{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:D2IETP5MPKDUZZDNIRK3VWX44A","short_pith_number":"pith:D2IETP5M","canonical_record":{"source":{"id":"1403.2796","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-03-12T02:19:31Z","cross_cats_sorted":[],"title_canon_sha256":"9a60145d32ba0b26593a5cf960e167105439b47c4b86ba5a45c05a7a86872030","abstract_canon_sha256":"d196f34787fd28ae4093ebc54ce2eb2d64e278de7c94c82053f08a6fe76ce384"},"schema_version":"1.0"},"canonical_sha256":"1e9049bfac7a874ce46d4455badafce020c42e06c8024002ca096d7d49704c8e","source":{"kind":"arxiv","id":"1403.2796","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1403.2796","created_at":"2026-05-18T02:56:34Z"},{"alias_kind":"arxiv_version","alias_value":"1403.2796v1","created_at":"2026-05-18T02:56:34Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1403.2796","created_at":"2026-05-18T02:56:34Z"},{"alias_kind":"pith_short_12","alias_value":"D2IETP5MPKDU","created_at":"2026-05-18T12:28:25Z"},{"alias_kind":"pith_short_16","alias_value":"D2IETP5MPKDUZZDN","created_at":"2026-05-18T12:28:25Z"},{"alias_kind":"pith_short_8","alias_value":"D2IETP5M","created_at":"2026-05-18T12:28:25Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:D2IETP5MPKDUZZDNIRK3VWX44A","target":"record","payload":{"canonical_record":{"source":{"id":"1403.2796","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-03-12T02:19:31Z","cross_cats_sorted":[],"title_canon_sha256":"9a60145d32ba0b26593a5cf960e167105439b47c4b86ba5a45c05a7a86872030","abstract_canon_sha256":"d196f34787fd28ae4093ebc54ce2eb2d64e278de7c94c82053f08a6fe76ce384"},"schema_version":"1.0"},"canonical_sha256":"1e9049bfac7a874ce46d4455badafce020c42e06c8024002ca096d7d49704c8e","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:56:34.100278Z","signature_b64":"0dayZCVNYV5XG4HCK5bdleh9vpQHHenMzGGMO/0xp2CCTM6RWBYUun4dTqr/TMaR2pnEHZ8xVyymj9Ytd3iOBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1e9049bfac7a874ce46d4455badafce020c42e06c8024002ca096d7d49704c8e","last_reissued_at":"2026-05-18T02:56:34.099568Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:56:34.099568Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1403.2796","source_version":1,"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-18T02:56:34Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"E8BNrzboH7zSiIjSwtsVPwvSWORjeaPEmoYXH8dWhrnck4ZudNlbPggl5TRwtmFrVEEeIe0MVDIwcLkaLUGwBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-24T02:26:49.647284Z"},"content_sha256":"a8a0ad959947399e99e84df9df211c60f86e5daa758828ca42d92e9519a203bf","schema_version":"1.0","event_id":"sha256:a8a0ad959947399e99e84df9df211c60f86e5daa758828ca42d92e9519a203bf"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:D2IETP5MPKDUZZDNIRK3VWX44A","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"The Algorithmic Complexity of Bondage and Reinforcement Problems in bipartite graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Fu-Tao Hu, Moo Young Sohn","submitted_at":"2014-03-12T02:19:31Z","abstract_excerpt":"Let $G=(V,E)$ be a graph. A subset $D\\subseteq V$ is a dominating set if every vertex not in $D$ is adjacent to a vertex in $D$. The domination number of $G$, denoted by $\\gamma(G)$, is the smallest cardinality of a dominating set of $G$. The bondage number of a nonempty graph $G$ is the smallest number of edges whose removal from $G$ results in a graph with domination number larger than $\\gamma(G)$. The reinforcement number of $G$ is the smallest number of edges whose addition to $G$ results in a graph with smaller domination number than $\\gamma(G)$. In 2012, Hu and Xu proved that the decisio"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1403.2796","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"},"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-18T02:56:34Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"uSlTC+RkX3EQYVRlZM2ciEZnMdJI+EDeT9/GUOz+RRWNdtcnLUjaTi10vRvVQBMdm7m6QTNMjZsv+lEnzRcLBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-24T02:26:49.647646Z"},"content_sha256":"f0d00725b968a674fb75357ab8e0acbf762f6c218e96284c49b649febe28cb3c","schema_version":"1.0","event_id":"sha256:f0d00725b968a674fb75357ab8e0acbf762f6c218e96284c49b649febe28cb3c"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/D2IETP5MPKDUZZDNIRK3VWX44A/bundle.json","state_url":"https://pith.science/pith/D2IETP5MPKDUZZDNIRK3VWX44A/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/D2IETP5MPKDUZZDNIRK3VWX44A/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-06-24T02:26:49Z","links":{"resolver":"https://pith.science/pith/D2IETP5MPKDUZZDNIRK3VWX44A","bundle":"https://pith.science/pith/D2IETP5MPKDUZZDNIRK3VWX44A/bundle.json","state":"https://pith.science/pith/D2IETP5MPKDUZZDNIRK3VWX44A/state.json","well_known_bundle":"https://pith.science/.well-known/pith/D2IETP5MPKDUZZDNIRK3VWX44A/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:D2IETP5MPKDUZZDNIRK3VWX44A","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":"d196f34787fd28ae4093ebc54ce2eb2d64e278de7c94c82053f08a6fe76ce384","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-03-12T02:19:31Z","title_canon_sha256":"9a60145d32ba0b26593a5cf960e167105439b47c4b86ba5a45c05a7a86872030"},"schema_version":"1.0","source":{"id":"1403.2796","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1403.2796","created_at":"2026-05-18T02:56:34Z"},{"alias_kind":"arxiv_version","alias_value":"1403.2796v1","created_at":"2026-05-18T02:56:34Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1403.2796","created_at":"2026-05-18T02:56:34Z"},{"alias_kind":"pith_short_12","alias_value":"D2IETP5MPKDU","created_at":"2026-05-18T12:28:25Z"},{"alias_kind":"pith_short_16","alias_value":"D2IETP5MPKDUZZDN","created_at":"2026-05-18T12:28:25Z"},{"alias_kind":"pith_short_8","alias_value":"D2IETP5M","created_at":"2026-05-18T12:28:25Z"}],"graph_snapshots":[{"event_id":"sha256:f0d00725b968a674fb75357ab8e0acbf762f6c218e96284c49b649febe28cb3c","target":"graph","created_at":"2026-05-18T02:56:34Z","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":"Let $G=(V,E)$ be a graph. A subset $D\\subseteq V$ is a dominating set if every vertex not in $D$ is adjacent to a vertex in $D$. The domination number of $G$, denoted by $\\gamma(G)$, is the smallest cardinality of a dominating set of $G$. The bondage number of a nonempty graph $G$ is the smallest number of edges whose removal from $G$ results in a graph with domination number larger than $\\gamma(G)$. The reinforcement number of $G$ is the smallest number of edges whose addition to $G$ results in a graph with smaller domination number than $\\gamma(G)$. In 2012, Hu and Xu proved that the decisio","authors_text":"Fu-Tao Hu, Moo Young Sohn","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-03-12T02:19:31Z","title":"The Algorithmic Complexity of Bondage and Reinforcement Problems in bipartite graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1403.2796","kind":"arxiv","version":1},"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:a8a0ad959947399e99e84df9df211c60f86e5daa758828ca42d92e9519a203bf","target":"record","created_at":"2026-05-18T02:56:34Z","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":"d196f34787fd28ae4093ebc54ce2eb2d64e278de7c94c82053f08a6fe76ce384","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-03-12T02:19:31Z","title_canon_sha256":"9a60145d32ba0b26593a5cf960e167105439b47c4b86ba5a45c05a7a86872030"},"schema_version":"1.0","source":{"id":"1403.2796","kind":"arxiv","version":1}},"canonical_sha256":"1e9049bfac7a874ce46d4455badafce020c42e06c8024002ca096d7d49704c8e","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"1e9049bfac7a874ce46d4455badafce020c42e06c8024002ca096d7d49704c8e","first_computed_at":"2026-05-18T02:56:34.099568Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:56:34.099568Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"0dayZCVNYV5XG4HCK5bdleh9vpQHHenMzGGMO/0xp2CCTM6RWBYUun4dTqr/TMaR2pnEHZ8xVyymj9Ytd3iOBA==","signature_status":"signed_v1","signed_at":"2026-05-18T02:56:34.100278Z","signed_message":"canonical_sha256_bytes"},"source_id":"1403.2796","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:a8a0ad959947399e99e84df9df211c60f86e5daa758828ca42d92e9519a203bf","sha256:f0d00725b968a674fb75357ab8e0acbf762f6c218e96284c49b649febe28cb3c"],"state_sha256":"87664e7892cda250e40e10326837eb52147c577b775c64e5c090787cf1379f82"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"J+tUh2ztHpBREiK1Zzmv2DNTcE99AlNmDY4pb4nO8P9LhdoB8mfV2BydmdMsyir0s5l7OL8LsmIr+iX78bmzDg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-24T02:26:49.649716Z","bundle_sha256":"0057d8cf729bad56563b0bc22b1447f06b1312d9ab41a7eef62fb3d0f7b0805c"}}