{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:DJDMFQADOIZ4XMG3MGF7KJCD6N","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"97c364c6e9cbfd7c05b827a826e0569d85f14ee03e622981a6f71f0c38b135cb","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-10-04T17:34:03Z","title_canon_sha256":"d4ebe61a1752716ab6ea9944dea9b8fdf16bc59b68b921fbc12045272d3487a8"},"schema_version":"1.0","source":{"id":"1310.1345","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1310.1345","created_at":"2026-05-18T03:10:36Z"},{"alias_kind":"arxiv_version","alias_value":"1310.1345v2","created_at":"2026-05-18T03:10:36Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1310.1345","created_at":"2026-05-18T03:10:36Z"},{"alias_kind":"pith_short_12","alias_value":"DJDMFQADOIZ4","created_at":"2026-05-18T12:27:43Z"},{"alias_kind":"pith_short_16","alias_value":"DJDMFQADOIZ4XMG3","created_at":"2026-05-18T12:27:43Z"},{"alias_kind":"pith_short_8","alias_value":"DJDMFQAD","created_at":"2026-05-18T12:27:43Z"}],"graph_snapshots":[{"event_id":"sha256:78d43a5535a7307ffea76453bbe2ff9eef76528ede3655cdd90dc3be8f5b5cde","target":"graph","created_at":"2026-05-18T03:10:36Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"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","authors_text":"Jerzy Topp, Joanna Raczek, Magda Dettlaff","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-10-04T17:34:03Z","title":"Domination subdivision and domination multisubdivision numbers of graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1310.1345","kind":"arxiv","version":2},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:5fee11aa8f2786bbc640a536b6915f4a44749c97e5cccd15feb8eee1082024bc","target":"record","created_at":"2026-05-18T03:10:36Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"97c364c6e9cbfd7c05b827a826e0569d85f14ee03e622981a6f71f0c38b135cb","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-10-04T17:34:03Z","title_canon_sha256":"d4ebe61a1752716ab6ea9944dea9b8fdf16bc59b68b921fbc12045272d3487a8"},"schema_version":"1.0","source":{"id":"1310.1345","kind":"arxiv","version":2}},"canonical_sha256":"1a46c2c0037233cbb0db618bf52443f362d18a911a0d297c0bca795ecd9fe231","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"1a46c2c0037233cbb0db618bf52443f362d18a911a0d297c0bca795ecd9fe231","first_computed_at":"2026-05-18T03:10:36.302227Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:10:36.302227Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"4g4spUrDVLvVyNpC8FkQmsXJrbZM+o4AIT3IRnwMiMBdXZi+mhAWhvzSJOKRE0gxULywDaYrUpYOXukWFJilBg==","signature_status":"signed_v1","signed_at":"2026-05-18T03:10:36.302694Z","signed_message":"canonical_sha256_bytes"},"source_id":"1310.1345","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:5fee11aa8f2786bbc640a536b6915f4a44749c97e5cccd15feb8eee1082024bc","sha256:78d43a5535a7307ffea76453bbe2ff9eef76528ede3655cdd90dc3be8f5b5cde"],"state_sha256":"9929071def50d5434db026d6ba6016ab49300479df22335a87a9361c807217e2"}