{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2011:MSYIWWCKWJXTSTS2HGJN5HQPOM","short_pith_number":"pith:MSYIWWCK","schema_version":"1.0","canonical_sha256":"64b08b584ab26f394e5a3992de9e0f732ef1731d655c88b70ae3577080f30ad3","source":{"kind":"arxiv","id":"1109.1657","version":1},"attestation_state":"computed","paper":{"title":"Complexity of Bondage and Reinforcement","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC"],"primary_cat":"math.CO","authors_text":"Fu-Tao Hu, Jun-Ming Xu","submitted_at":"2011-09-08T08:33:29Z","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$. A dominating set $D$ is called a total dominating set if every vertex in $D$ is adjacent to a vertex in $D$. The domination (resp. total domination) number of $G$ is the smallest cardinality of a dominating (resp. total dominating) set of $G$. The bondage (resp. total bondage) number of a nonempty graph $G$ is the smallest number of edges whose removal from $G$ results in a graph with larger domination (resp. total domination) number of $G$. The reinforcement number "},"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":"1109.1657","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2011-09-08T08:33:29Z","cross_cats_sorted":["cs.CC"],"title_canon_sha256":"fca83189d4c2843e447a1c7e2aa0c95dcc3b2ab28788652833492095e4853dff","abstract_canon_sha256":"101ee2b3d1d86fd9f14615df4bda3bf206c4fa7ebba6433f602dd0bf97e0d8e1"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:13:54.656852Z","signature_b64":"m7jzB8LVB5oP4L2ITo2AHif1ODHxLm+1co1+wE5/CYVMwpwspmWpW0SdStpiQGY8mjLQrbA85HAw7ZIgmpBKDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"64b08b584ab26f394e5a3992de9e0f732ef1731d655c88b70ae3577080f30ad3","last_reissued_at":"2026-05-18T04:13:54.656207Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:13:54.656207Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Complexity of Bondage and Reinforcement","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC"],"primary_cat":"math.CO","authors_text":"Fu-Tao Hu, Jun-Ming Xu","submitted_at":"2011-09-08T08:33:29Z","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$. A dominating set $D$ is called a total dominating set if every vertex in $D$ is adjacent to a vertex in $D$. The domination (resp. total domination) number of $G$ is the smallest cardinality of a dominating (resp. total dominating) set of $G$. The bondage (resp. total bondage) number of a nonempty graph $G$ is the smallest number of edges whose removal from $G$ results in a graph with larger domination (resp. total domination) number of $G$. The reinforcement number "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1109.1657","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":"1109.1657","created_at":"2026-05-18T04:13:54.656291+00:00"},{"alias_kind":"arxiv_version","alias_value":"1109.1657v1","created_at":"2026-05-18T04:13:54.656291+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1109.1657","created_at":"2026-05-18T04:13:54.656291+00:00"},{"alias_kind":"pith_short_12","alias_value":"MSYIWWCKWJXT","created_at":"2026-05-18T12:26:34.985390+00:00"},{"alias_kind":"pith_short_16","alias_value":"MSYIWWCKWJXTSTS2","created_at":"2026-05-18T12:26:34.985390+00:00"},{"alias_kind":"pith_short_8","alias_value":"MSYIWWCK","created_at":"2026-05-18T12:26:34.985390+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/MSYIWWCKWJXTSTS2HGJN5HQPOM","json":"https://pith.science/pith/MSYIWWCKWJXTSTS2HGJN5HQPOM.json","graph_json":"https://pith.science/api/pith-number/MSYIWWCKWJXTSTS2HGJN5HQPOM/graph.json","events_json":"https://pith.science/api/pith-number/MSYIWWCKWJXTSTS2HGJN5HQPOM/events.json","paper":"https://pith.science/paper/MSYIWWCK"},"agent_actions":{"view_html":"https://pith.science/pith/MSYIWWCKWJXTSTS2HGJN5HQPOM","download_json":"https://pith.science/pith/MSYIWWCKWJXTSTS2HGJN5HQPOM.json","view_paper":"https://pith.science/paper/MSYIWWCK","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1109.1657&json=true","fetch_graph":"https://pith.science/api/pith-number/MSYIWWCKWJXTSTS2HGJN5HQPOM/graph.json","fetch_events":"https://pith.science/api/pith-number/MSYIWWCKWJXTSTS2HGJN5HQPOM/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/MSYIWWCKWJXTSTS2HGJN5HQPOM/action/timestamp_anchor","attest_storage":"https://pith.science/pith/MSYIWWCKWJXTSTS2HGJN5HQPOM/action/storage_attestation","attest_author":"https://pith.science/pith/MSYIWWCKWJXTSTS2HGJN5HQPOM/action/author_attestation","sign_citation":"https://pith.science/pith/MSYIWWCKWJXTSTS2HGJN5HQPOM/action/citation_signature","submit_replication":"https://pith.science/pith/MSYIWWCKWJXTSTS2HGJN5HQPOM/action/replication_record"}},"created_at":"2026-05-18T04:13:54.656291+00:00","updated_at":"2026-05-18T04:13:54.656291+00:00"}