{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:DJDMFQADOIZ4XMG3MGF7KJCD6N","short_pith_number":"pith:DJDMFQAD","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"},"canonical_sha256":"1a46c2c0037233cbb0db618bf52443f362d18a911a0d297c0bca795ecd9fe231","source":{"kind":"arxiv","id":"1310.1345","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"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:DJDMFQADOIZ4XMG3MGF7KJCD6N","target":"record","payload":{"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"},"canonical_sha256":"1a46c2c0037233cbb0db618bf52443f362d18a911a0d297c0bca795ecd9fe231","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"},"source_kind":"arxiv","source_id":"1310.1345","source_version":2,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T03:10:36Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"mdgfuBvQS8MB9GUpG8IxR0IYw6WGKVCOs5/U6BQY6twnDLDslFD3ZgedWQPgndMqjeBtZX16Zn3b66c4qXvXDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-02T21:51:29.130090Z"},"content_sha256":"5fee11aa8f2786bbc640a536b6915f4a44749c97e5cccd15feb8eee1082024bc","schema_version":"1.0","event_id":"sha256:5fee11aa8f2786bbc640a536b6915f4a44749c97e5cccd15feb8eee1082024bc"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:DJDMFQADOIZ4XMG3MGF7KJCD6N","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T03:10:36Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"GqHRYC749irJl4m2qs6FXgpieXmFOcKy7cIcIqmtV2tDD08EdkpvODEbB0kfY9NceRf8ZNhgj7IqNA2Rim1tDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-02T21:51:29.130446Z"},"content_sha256":"78d43a5535a7307ffea76453bbe2ff9eef76528ede3655cdd90dc3be8f5b5cde","schema_version":"1.0","event_id":"sha256:78d43a5535a7307ffea76453bbe2ff9eef76528ede3655cdd90dc3be8f5b5cde"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/DJDMFQADOIZ4XMG3MGF7KJCD6N/bundle.json","state_url":"https://pith.science/pith/DJDMFQADOIZ4XMG3MGF7KJCD6N/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/DJDMFQADOIZ4XMG3MGF7KJCD6N/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-07-02T21:51:29Z","links":{"resolver":"https://pith.science/pith/DJDMFQADOIZ4XMG3MGF7KJCD6N","bundle":"https://pith.science/pith/DJDMFQADOIZ4XMG3MGF7KJCD6N/bundle.json","state":"https://pith.science/pith/DJDMFQADOIZ4XMG3MGF7KJCD6N/state.json","well_known_bundle":"https://pith.science/.well-known/pith/DJDMFQADOIZ4XMG3MGF7KJCD6N/bundle.json"},"state":{"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"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"nJ5bHWXh6S1zUeSEdQD6JBjQbP4uaR0I/piRDgafQ7cHTTO9UQv58LytoBCsoqawSL0xxJ4BnEHStbOaodGhCg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-02T21:51:29.132339Z","bundle_sha256":"6a3a1811dce8d2ebe42cf77622def303d9f5199cc846a91748f732bc6a20c001"}}