{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:AYE4UNWMWV4DRU5AJS7LURFOEV","short_pith_number":"pith:AYE4UNWM","canonical_record":{"source":{"id":"1401.5714","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2014-01-22T16:09:25Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"dcb22e154e42a90a0256a4539d15e6b7f57a879f34a99dcd5b969f2f44fad8bc","abstract_canon_sha256":"1f604ab80d9cf303de9025a753a7ad3dfd2be8c6923ce9d202945af9bd526df2"},"schema_version":"1.0"},"canonical_sha256":"0609ca36ccb57838d3a04cbeba44ae25772fa407b5ec867cbaf6d5ff549d6910","source":{"kind":"arxiv","id":"1401.5714","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1401.5714","created_at":"2026-05-18T03:00:38Z"},{"alias_kind":"arxiv_version","alias_value":"1401.5714v2","created_at":"2026-05-18T03:00:38Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1401.5714","created_at":"2026-05-18T03:00:38Z"},{"alias_kind":"pith_short_12","alias_value":"AYE4UNWMWV4D","created_at":"2026-05-18T12:28:19Z"},{"alias_kind":"pith_short_16","alias_value":"AYE4UNWMWV4DRU5A","created_at":"2026-05-18T12:28:19Z"},{"alias_kind":"pith_short_8","alias_value":"AYE4UNWM","created_at":"2026-05-18T12:28:19Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:AYE4UNWMWV4DRU5AJS7LURFOEV","target":"record","payload":{"canonical_record":{"source":{"id":"1401.5714","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2014-01-22T16:09:25Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"dcb22e154e42a90a0256a4539d15e6b7f57a879f34a99dcd5b969f2f44fad8bc","abstract_canon_sha256":"1f604ab80d9cf303de9025a753a7ad3dfd2be8c6923ce9d202945af9bd526df2"},"schema_version":"1.0"},"canonical_sha256":"0609ca36ccb57838d3a04cbeba44ae25772fa407b5ec867cbaf6d5ff549d6910","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:00:38.910696Z","signature_b64":"AIsiPWGVbO7ZF2REROp1GP4tUZtw+YAFhFpVU2sVaZMZV3KxqqTEE0Jxw0mageUKNK22l4izMBJkhDEcj2Q5Dg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0609ca36ccb57838d3a04cbeba44ae25772fa407b5ec867cbaf6d5ff549d6910","last_reissued_at":"2026-05-18T03:00:38.909898Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:00:38.909898Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1401.5714","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:00:38Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"k8x474BV5TNu4J3HqpE317CabbPt5Tia41+g5eomVGwBX18uIpLFo1wasgZmNwreCM1vwzVpDJJsLPg3y6spBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T23:29:49.175667Z"},"content_sha256":"3dcca23bfc625b3755882066819c3ac53bf5ea73eb8f3aa749190fb7fef423d8","schema_version":"1.0","event_id":"sha256:3dcca23bfc625b3755882066819c3ac53bf5ea73eb8f3aa749190fb7fef423d8"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:AYE4UNWMWV4DRU5AJS7LURFOEV","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Reconfiguration of Dominating Sets","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"cs.DM","authors_text":"Akira Suzuki, Amer E. Mouawad, Naomi Nishimura","submitted_at":"2014-01-22T16:09:25Z","abstract_excerpt":"We explore a reconfiguration version of the dominating set problem, where a dominating set in a graph $G$ is a set $S$ of vertices such that each vertex is either in $S$ or has a neighbour in $S$. In a reconfiguration problem, the goal is to determine whether there exists a sequence of feasible solutions connecting given feasible solutions $s$ and $t$ such that each pair of consecutive solutions is adjacent according to a specified adjacency relation. Two dominating sets are adjacent if one can be formed from the other by the addition or deletion of a single vertex.\n  For various values of $k$"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1401.5714","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:00:38Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"54jDUfS3h+xE9su2xVo/UILc8lJWJacR8tjh98Yd3lZbME1wgNIEy7FMFLc0MsSSeE38OBpI8q5nfqvdCh/vAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T23:29:49.176273Z"},"content_sha256":"0a1784ced8c4c2cd1714d352f6f5c1772919f55872d1b789ba62cd92033240dd","schema_version":"1.0","event_id":"sha256:0a1784ced8c4c2cd1714d352f6f5c1772919f55872d1b789ba62cd92033240dd"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/AYE4UNWMWV4DRU5AJS7LURFOEV/bundle.json","state_url":"https://pith.science/pith/AYE4UNWMWV4DRU5AJS7LURFOEV/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/AYE4UNWMWV4DRU5AJS7LURFOEV/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-05-25T23:29:49Z","links":{"resolver":"https://pith.science/pith/AYE4UNWMWV4DRU5AJS7LURFOEV","bundle":"https://pith.science/pith/AYE4UNWMWV4DRU5AJS7LURFOEV/bundle.json","state":"https://pith.science/pith/AYE4UNWMWV4DRU5AJS7LURFOEV/state.json","well_known_bundle":"https://pith.science/.well-known/pith/AYE4UNWMWV4DRU5AJS7LURFOEV/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:AYE4UNWMWV4DRU5AJS7LURFOEV","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":"1f604ab80d9cf303de9025a753a7ad3dfd2be8c6923ce9d202945af9bd526df2","cross_cats_sorted":["math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2014-01-22T16:09:25Z","title_canon_sha256":"dcb22e154e42a90a0256a4539d15e6b7f57a879f34a99dcd5b969f2f44fad8bc"},"schema_version":"1.0","source":{"id":"1401.5714","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1401.5714","created_at":"2026-05-18T03:00:38Z"},{"alias_kind":"arxiv_version","alias_value":"1401.5714v2","created_at":"2026-05-18T03:00:38Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1401.5714","created_at":"2026-05-18T03:00:38Z"},{"alias_kind":"pith_short_12","alias_value":"AYE4UNWMWV4D","created_at":"2026-05-18T12:28:19Z"},{"alias_kind":"pith_short_16","alias_value":"AYE4UNWMWV4DRU5A","created_at":"2026-05-18T12:28:19Z"},{"alias_kind":"pith_short_8","alias_value":"AYE4UNWM","created_at":"2026-05-18T12:28:19Z"}],"graph_snapshots":[{"event_id":"sha256:0a1784ced8c4c2cd1714d352f6f5c1772919f55872d1b789ba62cd92033240dd","target":"graph","created_at":"2026-05-18T03:00:38Z","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":"We explore a reconfiguration version of the dominating set problem, where a dominating set in a graph $G$ is a set $S$ of vertices such that each vertex is either in $S$ or has a neighbour in $S$. In a reconfiguration problem, the goal is to determine whether there exists a sequence of feasible solutions connecting given feasible solutions $s$ and $t$ such that each pair of consecutive solutions is adjacent according to a specified adjacency relation. Two dominating sets are adjacent if one can be formed from the other by the addition or deletion of a single vertex.\n  For various values of $k$","authors_text":"Akira Suzuki, Amer E. Mouawad, Naomi Nishimura","cross_cats":["math.CO"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2014-01-22T16:09:25Z","title":"Reconfiguration of Dominating Sets"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1401.5714","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:3dcca23bfc625b3755882066819c3ac53bf5ea73eb8f3aa749190fb7fef423d8","target":"record","created_at":"2026-05-18T03:00:38Z","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":"1f604ab80d9cf303de9025a753a7ad3dfd2be8c6923ce9d202945af9bd526df2","cross_cats_sorted":["math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2014-01-22T16:09:25Z","title_canon_sha256":"dcb22e154e42a90a0256a4539d15e6b7f57a879f34a99dcd5b969f2f44fad8bc"},"schema_version":"1.0","source":{"id":"1401.5714","kind":"arxiv","version":2}},"canonical_sha256":"0609ca36ccb57838d3a04cbeba44ae25772fa407b5ec867cbaf6d5ff549d6910","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"0609ca36ccb57838d3a04cbeba44ae25772fa407b5ec867cbaf6d5ff549d6910","first_computed_at":"2026-05-18T03:00:38.909898Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:00:38.909898Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"AIsiPWGVbO7ZF2REROp1GP4tUZtw+YAFhFpVU2sVaZMZV3KxqqTEE0Jxw0mageUKNK22l4izMBJkhDEcj2Q5Dg==","signature_status":"signed_v1","signed_at":"2026-05-18T03:00:38.910696Z","signed_message":"canonical_sha256_bytes"},"source_id":"1401.5714","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:3dcca23bfc625b3755882066819c3ac53bf5ea73eb8f3aa749190fb7fef423d8","sha256:0a1784ced8c4c2cd1714d352f6f5c1772919f55872d1b789ba62cd92033240dd"],"state_sha256":"2b355c0d7b47021f1b136beabdbd2cd8b2dbec1d4c4ccea90928bfb42cb658bb"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"/s2mnx8pTEDmQ/u263uE5ZotkMhDGwue5Fe4Zm9LXR7oIpg70XfWOJk4Ts7Rp9cLgegKKneLatmrka7XSGYFDw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-25T23:29:49.179742Z","bundle_sha256":"a07aa183d3dccab6dd4ed7a3cb440980bbcb98ebac1decd11849db8e81e18ff4"}}