{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2022:SOSV35MGC2V26XRA5G4GHPMD5Q","short_pith_number":"pith:SOSV35MG","schema_version":"1.0","canonical_sha256":"93a55df58616abaf5e20e9b863bd83ec319469c37bd8b7fb47d39ee5ce042fa6","source":{"kind":"arxiv","id":"2207.07229","version":1},"attestation_state":"computed","paper":{"title":"PSPACE-Completeness of Reversible Deterministic Systems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CC","authors_text":"Dylan Hendrickson, Erik D. Demaine, Jayson Lynch, Robert A. Hearn","submitted_at":"2022-07-14T23:31:34Z","abstract_excerpt":"We prove PSPACE-completeness of several reversible, fully deterministic systems. At the core, we develop a framework for such proofs (building on a result of Tsukiji and Hagiwara and a framework for motion planning through gadgets), showing that any system that can implement three basic gadgets is PSPACE-complete. We then apply this framework to four different systems, showing its versatility. First, we prove that Deterministic Constraint Logic is PSPACE-complete, fixing an error in a previous argument from 2008. Second, we give a new PSPACE-hardness proof for the reversible `billiard ball' mo"},"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":"2207.07229","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2022-07-14T23:31:34Z","cross_cats_sorted":[],"title_canon_sha256":"d226af823b2c8f0e64720b3b42ee5a275459b690490879282904a03a0ca91f24","abstract_canon_sha256":"4855d9937f1daa19683b7388af0b5b52bbb36d9d66fce5e7a8716984c8696290"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T04:40:29.864499Z","signature_b64":"nEAQTBcKuVm0oydv7gQlQz3WuwMGtRuGH/vAEpH/Y9WFgX5Uyk90brVxtXf9lyb05pxPOpDNjC4Y61q7jKq8Dw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"93a55df58616abaf5e20e9b863bd83ec319469c37bd8b7fb47d39ee5ce042fa6","last_reissued_at":"2026-07-05T04:40:29.864071Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T04:40:29.864071Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"PSPACE-Completeness of Reversible Deterministic Systems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CC","authors_text":"Dylan Hendrickson, Erik D. Demaine, Jayson Lynch, Robert A. Hearn","submitted_at":"2022-07-14T23:31:34Z","abstract_excerpt":"We prove PSPACE-completeness of several reversible, fully deterministic systems. At the core, we develop a framework for such proofs (building on a result of Tsukiji and Hagiwara and a framework for motion planning through gadgets), showing that any system that can implement three basic gadgets is PSPACE-complete. We then apply this framework to four different systems, showing its versatility. First, we prove that Deterministic Constraint Logic is PSPACE-complete, fixing an error in a previous argument from 2008. Second, we give a new PSPACE-hardness proof for the reversible `billiard ball' mo"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2207.07229","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2207.07229/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"2207.07229","created_at":"2026-07-05T04:40:29.864128+00:00"},{"alias_kind":"arxiv_version","alias_value":"2207.07229v1","created_at":"2026-07-05T04:40:29.864128+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2207.07229","created_at":"2026-07-05T04:40:29.864128+00:00"},{"alias_kind":"pith_short_12","alias_value":"SOSV35MGC2V2","created_at":"2026-07-05T04:40:29.864128+00:00"},{"alias_kind":"pith_short_16","alias_value":"SOSV35MGC2V26XRA","created_at":"2026-07-05T04:40:29.864128+00:00"},{"alias_kind":"pith_short_8","alias_value":"SOSV35MG","created_at":"2026-07-05T04:40:29.864128+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/SOSV35MGC2V26XRA5G4GHPMD5Q","json":"https://pith.science/pith/SOSV35MGC2V26XRA5G4GHPMD5Q.json","graph_json":"https://pith.science/api/pith-number/SOSV35MGC2V26XRA5G4GHPMD5Q/graph.json","events_json":"https://pith.science/api/pith-number/SOSV35MGC2V26XRA5G4GHPMD5Q/events.json","paper":"https://pith.science/paper/SOSV35MG"},"agent_actions":{"view_html":"https://pith.science/pith/SOSV35MGC2V26XRA5G4GHPMD5Q","download_json":"https://pith.science/pith/SOSV35MGC2V26XRA5G4GHPMD5Q.json","view_paper":"https://pith.science/paper/SOSV35MG","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2207.07229&json=true","fetch_graph":"https://pith.science/api/pith-number/SOSV35MGC2V26XRA5G4GHPMD5Q/graph.json","fetch_events":"https://pith.science/api/pith-number/SOSV35MGC2V26XRA5G4GHPMD5Q/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/SOSV35MGC2V26XRA5G4GHPMD5Q/action/timestamp_anchor","attest_storage":"https://pith.science/pith/SOSV35MGC2V26XRA5G4GHPMD5Q/action/storage_attestation","attest_author":"https://pith.science/pith/SOSV35MGC2V26XRA5G4GHPMD5Q/action/author_attestation","sign_citation":"https://pith.science/pith/SOSV35MGC2V26XRA5G4GHPMD5Q/action/citation_signature","submit_replication":"https://pith.science/pith/SOSV35MGC2V26XRA5G4GHPMD5Q/action/replication_record"}},"created_at":"2026-07-05T04:40:29.864128+00:00","updated_at":"2026-07-05T04:40:29.864128+00:00"}