{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:D2IETP5MPKDUZZDNIRK3VWX44A","short_pith_number":"pith:D2IETP5M","schema_version":"1.0","canonical_sha256":"1e9049bfac7a874ce46d4455badafce020c42e06c8024002ca096d7d49704c8e","source":{"kind":"arxiv","id":"1403.2796","version":1},"attestation_state":"computed","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"},"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":"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1403.2796","created_at":"2026-05-18T02:56:34.099693+00:00"},{"alias_kind":"arxiv_version","alias_value":"1403.2796v1","created_at":"2026-05-18T02:56:34.099693+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1403.2796","created_at":"2026-05-18T02:56:34.099693+00:00"},{"alias_kind":"pith_short_12","alias_value":"D2IETP5MPKDU","created_at":"2026-05-18T12:28:25.294606+00:00"},{"alias_kind":"pith_short_16","alias_value":"D2IETP5MPKDUZZDN","created_at":"2026-05-18T12:28:25.294606+00:00"},{"alias_kind":"pith_short_8","alias_value":"D2IETP5M","created_at":"2026-05-18T12:28:25.294606+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/D2IETP5MPKDUZZDNIRK3VWX44A","json":"https://pith.science/pith/D2IETP5MPKDUZZDNIRK3VWX44A.json","graph_json":"https://pith.science/api/pith-number/D2IETP5MPKDUZZDNIRK3VWX44A/graph.json","events_json":"https://pith.science/api/pith-number/D2IETP5MPKDUZZDNIRK3VWX44A/events.json","paper":"https://pith.science/paper/D2IETP5M"},"agent_actions":{"view_html":"https://pith.science/pith/D2IETP5MPKDUZZDNIRK3VWX44A","download_json":"https://pith.science/pith/D2IETP5MPKDUZZDNIRK3VWX44A.json","view_paper":"https://pith.science/paper/D2IETP5M","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1403.2796&json=true","fetch_graph":"https://pith.science/api/pith-number/D2IETP5MPKDUZZDNIRK3VWX44A/graph.json","fetch_events":"https://pith.science/api/pith-number/D2IETP5MPKDUZZDNIRK3VWX44A/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/D2IETP5MPKDUZZDNIRK3VWX44A/action/timestamp_anchor","attest_storage":"https://pith.science/pith/D2IETP5MPKDUZZDNIRK3VWX44A/action/storage_attestation","attest_author":"https://pith.science/pith/D2IETP5MPKDUZZDNIRK3VWX44A/action/author_attestation","sign_citation":"https://pith.science/pith/D2IETP5MPKDUZZDNIRK3VWX44A/action/citation_signature","submit_replication":"https://pith.science/pith/D2IETP5MPKDUZZDNIRK3VWX44A/action/replication_record"}},"created_at":"2026-05-18T02:56:34.099693+00:00","updated_at":"2026-05-18T02:56:34.099693+00:00"}