{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:R424NTRKZUFAFUUD7A3YWDQ73F","short_pith_number":"pith:R424NTRK","schema_version":"1.0","canonical_sha256":"8f35c6ce2acd0a02d283f8378b0e1fd97151c28b2eb81c2148d89e65ecaf0c85","source":{"kind":"arxiv","id":"1503.00833","version":1},"attestation_state":"computed","paper":{"title":"The complexity of dominating set reconfiguration","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"cs.DM","authors_text":"Akira Suzuki, Amer E. Mouawad, Arash Haddadan, Hirotaka Ono, Naomi Nishimura, Takehiro Ito, Youcef Tebbal","submitted_at":"2015-03-03T06:44:38Z","abstract_excerpt":"Suppose that we are given two dominating sets $D_s$ and $D_t$ of a graph $G$ whose cardinalities are at most a given threshold $k$. Then, we are asked whether there exists a sequence of dominating sets of $G$ between $D_s$ and $D_t$ such that each dominating set in the sequence is of cardinality at most $k$ and can be obtained from the previous one by either adding or deleting exactly one vertex. This problem is known to be PSPACE-complete in general. In this paper, we study the complexity of this decision problem from the viewpoint of graph classes. We first prove that the problem remains PSP"},"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":"1503.00833","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2015-03-03T06:44:38Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"bc209c07519010d35d201a0f2179d69a0c0b9e16460ee1df8b6105c74f88af41","abstract_canon_sha256":"f2b1e518c2c1e68fc4c64edbb389c2c74c00d6fc52d3a2f6b87d059986f6486f"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:25:48.271243Z","signature_b64":"/lgztHjmORZt37DtAcpbmRdi7jrqpAmXMOvmqdBz7SvYmPLwQudO+RH/ghd6DAP86zqqh3Rw/QBvVRtSyQRYDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8f35c6ce2acd0a02d283f8378b0e1fd97151c28b2eb81c2148d89e65ecaf0c85","last_reissued_at":"2026-05-18T02:25:48.270814Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:25:48.270814Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"The complexity of dominating set reconfiguration","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"cs.DM","authors_text":"Akira Suzuki, Amer E. Mouawad, Arash Haddadan, Hirotaka Ono, Naomi Nishimura, Takehiro Ito, Youcef Tebbal","submitted_at":"2015-03-03T06:44:38Z","abstract_excerpt":"Suppose that we are given two dominating sets $D_s$ and $D_t$ of a graph $G$ whose cardinalities are at most a given threshold $k$. Then, we are asked whether there exists a sequence of dominating sets of $G$ between $D_s$ and $D_t$ such that each dominating set in the sequence is of cardinality at most $k$ and can be obtained from the previous one by either adding or deleting exactly one vertex. This problem is known to be PSPACE-complete in general. In this paper, we study the complexity of this decision problem from the viewpoint of graph classes. We first prove that the problem remains PSP"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1503.00833","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":"1503.00833","created_at":"2026-05-18T02:25:48.270876+00:00"},{"alias_kind":"arxiv_version","alias_value":"1503.00833v1","created_at":"2026-05-18T02:25:48.270876+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1503.00833","created_at":"2026-05-18T02:25:48.270876+00:00"},{"alias_kind":"pith_short_12","alias_value":"R424NTRKZUFA","created_at":"2026-05-18T12:29:39.896362+00:00"},{"alias_kind":"pith_short_16","alias_value":"R424NTRKZUFAFUUD","created_at":"2026-05-18T12:29:39.896362+00:00"},{"alias_kind":"pith_short_8","alias_value":"R424NTRK","created_at":"2026-05-18T12:29:39.896362+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/R424NTRKZUFAFUUD7A3YWDQ73F","json":"https://pith.science/pith/R424NTRKZUFAFUUD7A3YWDQ73F.json","graph_json":"https://pith.science/api/pith-number/R424NTRKZUFAFUUD7A3YWDQ73F/graph.json","events_json":"https://pith.science/api/pith-number/R424NTRKZUFAFUUD7A3YWDQ73F/events.json","paper":"https://pith.science/paper/R424NTRK"},"agent_actions":{"view_html":"https://pith.science/pith/R424NTRKZUFAFUUD7A3YWDQ73F","download_json":"https://pith.science/pith/R424NTRKZUFAFUUD7A3YWDQ73F.json","view_paper":"https://pith.science/paper/R424NTRK","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1503.00833&json=true","fetch_graph":"https://pith.science/api/pith-number/R424NTRKZUFAFUUD7A3YWDQ73F/graph.json","fetch_events":"https://pith.science/api/pith-number/R424NTRKZUFAFUUD7A3YWDQ73F/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/R424NTRKZUFAFUUD7A3YWDQ73F/action/timestamp_anchor","attest_storage":"https://pith.science/pith/R424NTRKZUFAFUUD7A3YWDQ73F/action/storage_attestation","attest_author":"https://pith.science/pith/R424NTRKZUFAFUUD7A3YWDQ73F/action/author_attestation","sign_citation":"https://pith.science/pith/R424NTRKZUFAFUUD7A3YWDQ73F/action/citation_signature","submit_replication":"https://pith.science/pith/R424NTRKZUFAFUUD7A3YWDQ73F/action/replication_record"}},"created_at":"2026-05-18T02:25:48.270876+00:00","updated_at":"2026-05-18T02:25:48.270876+00:00"}