{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:DJDMFQADOIZ4XMG3MGF7KJCD6N","short_pith_number":"pith:DJDMFQAD","schema_version":"1.0","canonical_sha256":"1a46c2c0037233cbb0db618bf52443f362d18a911a0d297c0bca795ecd9fe231","source":{"kind":"arxiv","id":"1310.1345","version":2},"attestation_state":"computed","paper":{"title":"Domination subdivision and domination multisubdivision numbers of graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Jerzy Topp, Joanna Raczek, Magda Dettlaff","submitted_at":"2013-10-04T17:34:03Z","abstract_excerpt":"The \\emph{domination subdivision number} sd$(G)$ of a graph $G$ is the minimum number of edges that must be subdivided (where an edge can be subdivided at most once) in order to increase the domination number of $G$. It has been shown \\cite{vel} that sd$(T)\\leq 3$ for any tree $T$. We prove that the decision problem of the domination subdivision number is NP-complete even for bipartite graphs. For this reason we define the \\emph{domination multisubdivision number} of a nonempty graph $G$ as a minimum positive integer $k$ such that there exists an edge which must be subdivided $k$ times to incr"},"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":"1310.1345","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-10-04T17:34:03Z","cross_cats_sorted":[],"title_canon_sha256":"d4ebe61a1752716ab6ea9944dea9b8fdf16bc59b68b921fbc12045272d3487a8","abstract_canon_sha256":"97c364c6e9cbfd7c05b827a826e0569d85f14ee03e622981a6f71f0c38b135cb"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:10:36.302694Z","signature_b64":"4g4spUrDVLvVyNpC8FkQmsXJrbZM+o4AIT3IRnwMiMBdXZi+mhAWhvzSJOKRE0gxULywDaYrUpYOXukWFJilBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1a46c2c0037233cbb0db618bf52443f362d18a911a0d297c0bca795ecd9fe231","last_reissued_at":"2026-05-18T03:10:36.302227Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:10:36.302227Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Domination subdivision and domination multisubdivision numbers of graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Jerzy Topp, Joanna Raczek, Magda Dettlaff","submitted_at":"2013-10-04T17:34:03Z","abstract_excerpt":"The \\emph{domination subdivision number} sd$(G)$ of a graph $G$ is the minimum number of edges that must be subdivided (where an edge can be subdivided at most once) in order to increase the domination number of $G$. It has been shown \\cite{vel} that sd$(T)\\leq 3$ for any tree $T$. We prove that the decision problem of the domination subdivision number is NP-complete even for bipartite graphs. For this reason we define the \\emph{domination multisubdivision number} of a nonempty graph $G$ as a minimum positive integer $k$ such that there exists an edge which must be subdivided $k$ times to incr"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1310.1345","kind":"arxiv","version":2},"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":"1310.1345","created_at":"2026-05-18T03:10:36.302292+00:00"},{"alias_kind":"arxiv_version","alias_value":"1310.1345v2","created_at":"2026-05-18T03:10:36.302292+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1310.1345","created_at":"2026-05-18T03:10:36.302292+00:00"},{"alias_kind":"pith_short_12","alias_value":"DJDMFQADOIZ4","created_at":"2026-05-18T12:27:43.054852+00:00"},{"alias_kind":"pith_short_16","alias_value":"DJDMFQADOIZ4XMG3","created_at":"2026-05-18T12:27:43.054852+00:00"},{"alias_kind":"pith_short_8","alias_value":"DJDMFQAD","created_at":"2026-05-18T12:27:43.054852+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/DJDMFQADOIZ4XMG3MGF7KJCD6N","json":"https://pith.science/pith/DJDMFQADOIZ4XMG3MGF7KJCD6N.json","graph_json":"https://pith.science/api/pith-number/DJDMFQADOIZ4XMG3MGF7KJCD6N/graph.json","events_json":"https://pith.science/api/pith-number/DJDMFQADOIZ4XMG3MGF7KJCD6N/events.json","paper":"https://pith.science/paper/DJDMFQAD"},"agent_actions":{"view_html":"https://pith.science/pith/DJDMFQADOIZ4XMG3MGF7KJCD6N","download_json":"https://pith.science/pith/DJDMFQADOIZ4XMG3MGF7KJCD6N.json","view_paper":"https://pith.science/paper/DJDMFQAD","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1310.1345&json=true","fetch_graph":"https://pith.science/api/pith-number/DJDMFQADOIZ4XMG3MGF7KJCD6N/graph.json","fetch_events":"https://pith.science/api/pith-number/DJDMFQADOIZ4XMG3MGF7KJCD6N/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/DJDMFQADOIZ4XMG3MGF7KJCD6N/action/timestamp_anchor","attest_storage":"https://pith.science/pith/DJDMFQADOIZ4XMG3MGF7KJCD6N/action/storage_attestation","attest_author":"https://pith.science/pith/DJDMFQADOIZ4XMG3MGF7KJCD6N/action/author_attestation","sign_citation":"https://pith.science/pith/DJDMFQADOIZ4XMG3MGF7KJCD6N/action/citation_signature","submit_replication":"https://pith.science/pith/DJDMFQADOIZ4XMG3MGF7KJCD6N/action/replication_record"}},"created_at":"2026-05-18T03:10:36.302292+00:00","updated_at":"2026-05-18T03:10:36.302292+00:00"}