{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:OLFB2UEZ37HLJJ7VKY66ZMRYZ4","short_pith_number":"pith:OLFB2UEZ","schema_version":"1.0","canonical_sha256":"72ca1d5099dfceb4a7f5563decb238cf2417baab69ee9e5f9d79b1f19bf49bfa","source":{"kind":"arxiv","id":"1309.7228","version":1},"attestation_state":"computed","paper":{"title":"Total domination multisubdivision number of a graph","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Diana Avella-Alaminos, Magda Dettlaff, Magdalena Lema\\'nska, Rita Zuazua","submitted_at":"2013-09-27T13:17:06Z","abstract_excerpt":"The domination multisubdivision number of a nonempty graph $G$ was defined as the minimum positive integer $k$ such that there exists an edge which must be subdivided $k$ times to increase the domination number of $G$. Similarly we define the total domination multisubdivision number msd$_{\\gamma_t}(G)$ of a graph $G$ and we show that for any connected graph $G$ of order at least two, msd$_{\\gamma_t}(G)\\leq 3.$ We show that for trees the total domination multisubdivision number is equal to the known total domination subdivision number. We also determine the total domination multisubdivision num"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"1309.7228","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-09-27T13:17:06Z","cross_cats_sorted":[],"title_canon_sha256":"bddee5f03de4b60e0a63fb945943f86f0956381c50f95664c0ed78979d6e717d","abstract_canon_sha256":"39c627acab22902ddf99cf28ebe46df57bf38d3c7a869969425108772b4b4075"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:11:59.828458Z","signature_b64":"V7OIC7HahiW+uDLRM8KDT9wn7lu9gm6raGi8XDJcVet+qHcCNJXbnprJl2trbBrMrZlQ4nmnO+NcFLTVUSxgAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"72ca1d5099dfceb4a7f5563decb238cf2417baab69ee9e5f9d79b1f19bf49bfa","last_reissued_at":"2026-05-18T03:11:59.827871Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:11:59.827871Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Total domination multisubdivision number of a graph","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Diana Avella-Alaminos, Magda Dettlaff, Magdalena Lema\\'nska, Rita Zuazua","submitted_at":"2013-09-27T13:17:06Z","abstract_excerpt":"The domination multisubdivision number of a nonempty graph $G$ was defined as the minimum positive integer $k$ such that there exists an edge which must be subdivided $k$ times to increase the domination number of $G$. Similarly we define the total domination multisubdivision number msd$_{\\gamma_t}(G)$ of a graph $G$ and we show that for any connected graph $G$ of order at least two, msd$_{\\gamma_t}(G)\\leq 3.$ We show that for trees the total domination multisubdivision number is equal to the known total domination subdivision number. We also determine the total domination multisubdivision num"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1309.7228","kind":"arxiv","version":1},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"references":{"count":0,"sample":[],"resolved_work":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","internal_anchors":0},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"author_claims":{"count":0,"strong_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"builder_version":"pith-number-builder-2026-05-17-v1"},"aliases":[{"alias_kind":"arxiv","alias_value":"1309.7228","created_at":"2026-05-18T03:11:59.827964+00:00"},{"alias_kind":"arxiv_version","alias_value":"1309.7228v1","created_at":"2026-05-18T03:11:59.827964+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1309.7228","created_at":"2026-05-18T03:11:59.827964+00:00"},{"alias_kind":"pith_short_12","alias_value":"OLFB2UEZ37HL","created_at":"2026-05-18T12:27:54.935989+00:00"},{"alias_kind":"pith_short_16","alias_value":"OLFB2UEZ37HLJJ7V","created_at":"2026-05-18T12:27:54.935989+00:00"},{"alias_kind":"pith_short_8","alias_value":"OLFB2UEZ","created_at":"2026-05-18T12:27:54.935989+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/OLFB2UEZ37HLJJ7VKY66ZMRYZ4","json":"https://pith.science/pith/OLFB2UEZ37HLJJ7VKY66ZMRYZ4.json","graph_json":"https://pith.science/api/pith-number/OLFB2UEZ37HLJJ7VKY66ZMRYZ4/graph.json","events_json":"https://pith.science/api/pith-number/OLFB2UEZ37HLJJ7VKY66ZMRYZ4/events.json","paper":"https://pith.science/paper/OLFB2UEZ"},"agent_actions":{"view_html":"https://pith.science/pith/OLFB2UEZ37HLJJ7VKY66ZMRYZ4","download_json":"https://pith.science/pith/OLFB2UEZ37HLJJ7VKY66ZMRYZ4.json","view_paper":"https://pith.science/paper/OLFB2UEZ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1309.7228&json=true","fetch_graph":"https://pith.science/api/pith-number/OLFB2UEZ37HLJJ7VKY66ZMRYZ4/graph.json","fetch_events":"https://pith.science/api/pith-number/OLFB2UEZ37HLJJ7VKY66ZMRYZ4/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/OLFB2UEZ37HLJJ7VKY66ZMRYZ4/action/timestamp_anchor","attest_storage":"https://pith.science/pith/OLFB2UEZ37HLJJ7VKY66ZMRYZ4/action/storage_attestation","attest_author":"https://pith.science/pith/OLFB2UEZ37HLJJ7VKY66ZMRYZ4/action/author_attestation","sign_citation":"https://pith.science/pith/OLFB2UEZ37HLJJ7VKY66ZMRYZ4/action/citation_signature","submit_replication":"https://pith.science/pith/OLFB2UEZ37HLJJ7VKY66ZMRYZ4/action/replication_record"}},"created_at":"2026-05-18T03:11:59.827964+00:00","updated_at":"2026-05-18T03:11:59.827964+00:00"}