{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2011:MSYIWWCKWJXTSTS2HGJN5HQPOM","short_pith_number":"pith:MSYIWWCK","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"},"canonical_sha256":"64b08b584ab26f394e5a3992de9e0f732ef1731d655c88b70ae3577080f30ad3","source":{"kind":"arxiv","id":"1109.1657","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1109.1657","created_at":"2026-05-18T04:13:54Z"},{"alias_kind":"arxiv_version","alias_value":"1109.1657v1","created_at":"2026-05-18T04:13:54Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1109.1657","created_at":"2026-05-18T04:13:54Z"},{"alias_kind":"pith_short_12","alias_value":"MSYIWWCKWJXT","created_at":"2026-05-18T12:26:34Z"},{"alias_kind":"pith_short_16","alias_value":"MSYIWWCKWJXTSTS2","created_at":"2026-05-18T12:26:34Z"},{"alias_kind":"pith_short_8","alias_value":"MSYIWWCK","created_at":"2026-05-18T12:26:34Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2011:MSYIWWCKWJXTSTS2HGJN5HQPOM","target":"record","payload":{"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"},"canonical_sha256":"64b08b584ab26f394e5a3992de9e0f732ef1731d655c88b70ae3577080f30ad3","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"},"source_kind":"arxiv","source_id":"1109.1657","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-18T04:13:54Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"vWUcavTvApRqbtFPBucp5FvPsdLHJ8YFIKh25bqD5QOLDE7h+5oO/rlMC9J9pc9Oyf6Ex9da67h5A0kV600sDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-24T02:56:36.252829Z"},"content_sha256":"f8a5525188f64b25050d8e7edf68fa299b5c2b11ef0a581d35351eaa82e82d22","schema_version":"1.0","event_id":"sha256:f8a5525188f64b25050d8e7edf68fa299b5c2b11ef0a581d35351eaa82e82d22"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2011:MSYIWWCKWJXTSTS2HGJN5HQPOM","target":"graph","payload":{"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"},"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-18T04:13:54Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"f2iozjicfqseIJBCt2UtpAj8E1rn7ZtilSF/snPgXV3ExJPd4Y+tU9fc9xs+4itse5Ky4BjwzaZD6yAM+LWeCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-24T02:56:36.253209Z"},"content_sha256":"c149b3912a4387b049239592321b67b5c2bcd952968a6f53476e505e68ea4f3e","schema_version":"1.0","event_id":"sha256:c149b3912a4387b049239592321b67b5c2bcd952968a6f53476e505e68ea4f3e"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/MSYIWWCKWJXTSTS2HGJN5HQPOM/bundle.json","state_url":"https://pith.science/pith/MSYIWWCKWJXTSTS2HGJN5HQPOM/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/MSYIWWCKWJXTSTS2HGJN5HQPOM/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:56:36Z","links":{"resolver":"https://pith.science/pith/MSYIWWCKWJXTSTS2HGJN5HQPOM","bundle":"https://pith.science/pith/MSYIWWCKWJXTSTS2HGJN5HQPOM/bundle.json","state":"https://pith.science/pith/MSYIWWCKWJXTSTS2HGJN5HQPOM/state.json","well_known_bundle":"https://pith.science/.well-known/pith/MSYIWWCKWJXTSTS2HGJN5HQPOM/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2011:MSYIWWCKWJXTSTS2HGJN5HQPOM","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":"101ee2b3d1d86fd9f14615df4bda3bf206c4fa7ebba6433f602dd0bf97e0d8e1","cross_cats_sorted":["cs.CC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2011-09-08T08:33:29Z","title_canon_sha256":"fca83189d4c2843e447a1c7e2aa0c95dcc3b2ab28788652833492095e4853dff"},"schema_version":"1.0","source":{"id":"1109.1657","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1109.1657","created_at":"2026-05-18T04:13:54Z"},{"alias_kind":"arxiv_version","alias_value":"1109.1657v1","created_at":"2026-05-18T04:13:54Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1109.1657","created_at":"2026-05-18T04:13:54Z"},{"alias_kind":"pith_short_12","alias_value":"MSYIWWCKWJXT","created_at":"2026-05-18T12:26:34Z"},{"alias_kind":"pith_short_16","alias_value":"MSYIWWCKWJXTSTS2","created_at":"2026-05-18T12:26:34Z"},{"alias_kind":"pith_short_8","alias_value":"MSYIWWCK","created_at":"2026-05-18T12:26:34Z"}],"graph_snapshots":[{"event_id":"sha256:c149b3912a4387b049239592321b67b5c2bcd952968a6f53476e505e68ea4f3e","target":"graph","created_at":"2026-05-18T04:13:54Z","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$. 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 ","authors_text":"Fu-Tao Hu, Jun-Ming Xu","cross_cats":["cs.CC"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2011-09-08T08:33:29Z","title":"Complexity of Bondage and Reinforcement"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1109.1657","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:f8a5525188f64b25050d8e7edf68fa299b5c2b11ef0a581d35351eaa82e82d22","target":"record","created_at":"2026-05-18T04:13:54Z","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":"101ee2b3d1d86fd9f14615df4bda3bf206c4fa7ebba6433f602dd0bf97e0d8e1","cross_cats_sorted":["cs.CC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2011-09-08T08:33:29Z","title_canon_sha256":"fca83189d4c2843e447a1c7e2aa0c95dcc3b2ab28788652833492095e4853dff"},"schema_version":"1.0","source":{"id":"1109.1657","kind":"arxiv","version":1}},"canonical_sha256":"64b08b584ab26f394e5a3992de9e0f732ef1731d655c88b70ae3577080f30ad3","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"64b08b584ab26f394e5a3992de9e0f732ef1731d655c88b70ae3577080f30ad3","first_computed_at":"2026-05-18T04:13:54.656207Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:13:54.656207Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"m7jzB8LVB5oP4L2ITo2AHif1ODHxLm+1co1+wE5/CYVMwpwspmWpW0SdStpiQGY8mjLQrbA85HAw7ZIgmpBKDg==","signature_status":"signed_v1","signed_at":"2026-05-18T04:13:54.656852Z","signed_message":"canonical_sha256_bytes"},"source_id":"1109.1657","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:f8a5525188f64b25050d8e7edf68fa299b5c2b11ef0a581d35351eaa82e82d22","sha256:c149b3912a4387b049239592321b67b5c2bcd952968a6f53476e505e68ea4f3e"],"state_sha256":"519b84ba528ba62c3df1d880228f0883a7da7a56d96749aa75a631c78f9240c8"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"pw+h0qsNkc0DJN2WnXEzqvQLRtZ+20lYBvNmZMgN27Fv+wRQ1fZ/Su0mE8VDzZQraFwt4uZZHXFpv/y72b75AQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-24T02:56:36.255107Z","bundle_sha256":"ef4d20f97417981add24dd819e695eb211f613cd0d156add7d44eb6325977ced"}}