{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:AYE4UNWMWV4DRU5AJS7LURFOEV","short_pith_number":"pith:AYE4UNWM","schema_version":"1.0","canonical_sha256":"0609ca36ccb57838d3a04cbeba44ae25772fa407b5ec867cbaf6d5ff549d6910","source":{"kind":"arxiv","id":"1401.5714","version":2},"attestation_state":"computed","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$"},"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":"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1401.5714","created_at":"2026-05-18T03:00:38.910021+00:00"},{"alias_kind":"arxiv_version","alias_value":"1401.5714v2","created_at":"2026-05-18T03:00:38.910021+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1401.5714","created_at":"2026-05-18T03:00:38.910021+00:00"},{"alias_kind":"pith_short_12","alias_value":"AYE4UNWMWV4D","created_at":"2026-05-18T12:28:19.803747+00:00"},{"alias_kind":"pith_short_16","alias_value":"AYE4UNWMWV4DRU5A","created_at":"2026-05-18T12:28:19.803747+00:00"},{"alias_kind":"pith_short_8","alias_value":"AYE4UNWM","created_at":"2026-05-18T12:28:19.803747+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"1907.01863","citing_title":"Linear transformations between colorings in chordal graphs","ref_index":13,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/AYE4UNWMWV4DRU5AJS7LURFOEV","json":"https://pith.science/pith/AYE4UNWMWV4DRU5AJS7LURFOEV.json","graph_json":"https://pith.science/api/pith-number/AYE4UNWMWV4DRU5AJS7LURFOEV/graph.json","events_json":"https://pith.science/api/pith-number/AYE4UNWMWV4DRU5AJS7LURFOEV/events.json","paper":"https://pith.science/paper/AYE4UNWM"},"agent_actions":{"view_html":"https://pith.science/pith/AYE4UNWMWV4DRU5AJS7LURFOEV","download_json":"https://pith.science/pith/AYE4UNWMWV4DRU5AJS7LURFOEV.json","view_paper":"https://pith.science/paper/AYE4UNWM","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1401.5714&json=true","fetch_graph":"https://pith.science/api/pith-number/AYE4UNWMWV4DRU5AJS7LURFOEV/graph.json","fetch_events":"https://pith.science/api/pith-number/AYE4UNWMWV4DRU5AJS7LURFOEV/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/AYE4UNWMWV4DRU5AJS7LURFOEV/action/timestamp_anchor","attest_storage":"https://pith.science/pith/AYE4UNWMWV4DRU5AJS7LURFOEV/action/storage_attestation","attest_author":"https://pith.science/pith/AYE4UNWMWV4DRU5AJS7LURFOEV/action/author_attestation","sign_citation":"https://pith.science/pith/AYE4UNWMWV4DRU5AJS7LURFOEV/action/citation_signature","submit_replication":"https://pith.science/pith/AYE4UNWMWV4DRU5AJS7LURFOEV/action/replication_record"}},"created_at":"2026-05-18T03:00:38.910021+00:00","updated_at":"2026-05-18T03:00:38.910021+00:00"}