{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:HXFD3G3VFQWHA2KFJRA5YWS2GV","short_pith_number":"pith:HXFD3G3V","schema_version":"1.0","canonical_sha256":"3dca3d9b752c2c7069454c41dc5a5a35779cdcf9756fb86a30993e2d2d533cc3","source":{"kind":"arxiv","id":"1412.4259","version":1},"attestation_state":"computed","paper":{"title":"Reachability in Two-Dimensional Vector Addition Systems with States is PSPACE-complete","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC","cs.LO"],"primary_cat":"cs.FL","authors_text":"Alain Finkel, Christoph Haase, Michael Blondin, Pierre McKenzie, Stefan G\\\"oller","submitted_at":"2014-12-13T17:10:34Z","abstract_excerpt":"Determining the complexity of the reachability problem for vector addition systems with states (VASS) is a long-standing open problem in computer science. Long known to be decidable, the problem to this day lacks any complexity upper bound whatsoever. In this paper, reachability for two-dimensional VASS is shown PSPACE-complete. This improves on a previously known doubly exponential time bound established by Howell, Rosier, Huynh and Yen in 1986. The coverability and boundedness problems are also noted to be PSPACE-complete. In addition, some complexity results are given for the reachability p"},"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":"1412.4259","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.FL","submitted_at":"2014-12-13T17:10:34Z","cross_cats_sorted":["cs.CC","cs.LO"],"title_canon_sha256":"fc1cff08fb9c27e8c5295da939fcd68028a23419a394d82421e817ffa56c8317","abstract_canon_sha256":"dc230bf4e96d3669b5474b9b301e8d0c597af51910bfda09885e55ea1282322c"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:48:33.263491Z","signature_b64":"Az/cfDI7En7pqyNt4wJ4xS9wcQRkFZPee8id/8eYUz/AYsgCSO108WWhLiZoJT1oFDqjFMMSYS+9dVZ5Ot+CCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3dca3d9b752c2c7069454c41dc5a5a35779cdcf9756fb86a30993e2d2d533cc3","last_reissued_at":"2026-05-18T00:48:33.262900Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:48:33.262900Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Reachability in Two-Dimensional Vector Addition Systems with States is PSPACE-complete","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC","cs.LO"],"primary_cat":"cs.FL","authors_text":"Alain Finkel, Christoph Haase, Michael Blondin, Pierre McKenzie, Stefan G\\\"oller","submitted_at":"2014-12-13T17:10:34Z","abstract_excerpt":"Determining the complexity of the reachability problem for vector addition systems with states (VASS) is a long-standing open problem in computer science. Long known to be decidable, the problem to this day lacks any complexity upper bound whatsoever. In this paper, reachability for two-dimensional VASS is shown PSPACE-complete. This improves on a previously known doubly exponential time bound established by Howell, Rosier, Huynh and Yen in 1986. The coverability and boundedness problems are also noted to be PSPACE-complete. In addition, some complexity results are given for the reachability p"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1412.4259","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":"1412.4259","created_at":"2026-05-18T00:48:33.263008+00:00"},{"alias_kind":"arxiv_version","alias_value":"1412.4259v1","created_at":"2026-05-18T00:48:33.263008+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1412.4259","created_at":"2026-05-18T00:48:33.263008+00:00"},{"alias_kind":"pith_short_12","alias_value":"HXFD3G3VFQWH","created_at":"2026-05-18T12:28:30.664211+00:00"},{"alias_kind":"pith_short_16","alias_value":"HXFD3G3VFQWHA2KF","created_at":"2026-05-18T12:28:30.664211+00:00"},{"alias_kind":"pith_short_8","alias_value":"HXFD3G3V","created_at":"2026-05-18T12:28:30.664211+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/HXFD3G3VFQWHA2KFJRA5YWS2GV","json":"https://pith.science/pith/HXFD3G3VFQWHA2KFJRA5YWS2GV.json","graph_json":"https://pith.science/api/pith-number/HXFD3G3VFQWHA2KFJRA5YWS2GV/graph.json","events_json":"https://pith.science/api/pith-number/HXFD3G3VFQWHA2KFJRA5YWS2GV/events.json","paper":"https://pith.science/paper/HXFD3G3V"},"agent_actions":{"view_html":"https://pith.science/pith/HXFD3G3VFQWHA2KFJRA5YWS2GV","download_json":"https://pith.science/pith/HXFD3G3VFQWHA2KFJRA5YWS2GV.json","view_paper":"https://pith.science/paper/HXFD3G3V","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1412.4259&json=true","fetch_graph":"https://pith.science/api/pith-number/HXFD3G3VFQWHA2KFJRA5YWS2GV/graph.json","fetch_events":"https://pith.science/api/pith-number/HXFD3G3VFQWHA2KFJRA5YWS2GV/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/HXFD3G3VFQWHA2KFJRA5YWS2GV/action/timestamp_anchor","attest_storage":"https://pith.science/pith/HXFD3G3VFQWHA2KFJRA5YWS2GV/action/storage_attestation","attest_author":"https://pith.science/pith/HXFD3G3VFQWHA2KFJRA5YWS2GV/action/author_attestation","sign_citation":"https://pith.science/pith/HXFD3G3VFQWHA2KFJRA5YWS2GV/action/citation_signature","submit_replication":"https://pith.science/pith/HXFD3G3VFQWHA2KFJRA5YWS2GV/action/replication_record"}},"created_at":"2026-05-18T00:48:33.263008+00:00","updated_at":"2026-05-18T00:48:33.263008+00:00"}