{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:HXFD3G3VFQWHA2KFJRA5YWS2GV","short_pith_number":"pith:HXFD3G3V","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"},"canonical_sha256":"3dca3d9b752c2c7069454c41dc5a5a35779cdcf9756fb86a30993e2d2d533cc3","source":{"kind":"arxiv","id":"1412.4259","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1412.4259","created_at":"2026-05-18T00:48:33Z"},{"alias_kind":"arxiv_version","alias_value":"1412.4259v1","created_at":"2026-05-18T00:48:33Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1412.4259","created_at":"2026-05-18T00:48:33Z"},{"alias_kind":"pith_short_12","alias_value":"HXFD3G3VFQWH","created_at":"2026-05-18T12:28:30Z"},{"alias_kind":"pith_short_16","alias_value":"HXFD3G3VFQWHA2KF","created_at":"2026-05-18T12:28:30Z"},{"alias_kind":"pith_short_8","alias_value":"HXFD3G3V","created_at":"2026-05-18T12:28:30Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:HXFD3G3VFQWHA2KFJRA5YWS2GV","target":"record","payload":{"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"},"canonical_sha256":"3dca3d9b752c2c7069454c41dc5a5a35779cdcf9756fb86a30993e2d2d533cc3","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"},"source_kind":"arxiv","source_id":"1412.4259","source_version":1,"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-18T00:48:33Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"pUTnhi5OlakKuu9NNG9fvW8NObc2FAOZTna1DzrpQpFkBTu888dBi4kE8OPJxqgoa6NwxJl3d3+l8T7jS8kLAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T09:40:50.877939Z"},"content_sha256":"a6c5810438105456d81de14855ac11ed77fd6e7ad0941a55196a2f92df05c52e","schema_version":"1.0","event_id":"sha256:a6c5810438105456d81de14855ac11ed77fd6e7ad0941a55196a2f92df05c52e"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:HXFD3G3VFQWHA2KFJRA5YWS2GV","target":"graph","payload":{"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"},"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-18T00:48:33Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"O/Er7pEa9wanfvxYXK51b6TKA2JwTF4fgi/Zd+tcjhXQ2cY0wilfoQCR3A4xCNoaJ/hFJXd1y5Xqpnfpno/2Dg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T09:40:50.878689Z"},"content_sha256":"59907458fd9f18b664cd31e4e49e1daf94ef7318042594b3733b8a2545ac0ec5","schema_version":"1.0","event_id":"sha256:59907458fd9f18b664cd31e4e49e1daf94ef7318042594b3733b8a2545ac0ec5"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/HXFD3G3VFQWHA2KFJRA5YWS2GV/bundle.json","state_url":"https://pith.science/pith/HXFD3G3VFQWHA2KFJRA5YWS2GV/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/HXFD3G3VFQWHA2KFJRA5YWS2GV/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-26T09:40:50Z","links":{"resolver":"https://pith.science/pith/HXFD3G3VFQWHA2KFJRA5YWS2GV","bundle":"https://pith.science/pith/HXFD3G3VFQWHA2KFJRA5YWS2GV/bundle.json","state":"https://pith.science/pith/HXFD3G3VFQWHA2KFJRA5YWS2GV/state.json","well_known_bundle":"https://pith.science/.well-known/pith/HXFD3G3VFQWHA2KFJRA5YWS2GV/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:HXFD3G3VFQWHA2KFJRA5YWS2GV","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":"dc230bf4e96d3669b5474b9b301e8d0c597af51910bfda09885e55ea1282322c","cross_cats_sorted":["cs.CC","cs.LO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.FL","submitted_at":"2014-12-13T17:10:34Z","title_canon_sha256":"fc1cff08fb9c27e8c5295da939fcd68028a23419a394d82421e817ffa56c8317"},"schema_version":"1.0","source":{"id":"1412.4259","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1412.4259","created_at":"2026-05-18T00:48:33Z"},{"alias_kind":"arxiv_version","alias_value":"1412.4259v1","created_at":"2026-05-18T00:48:33Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1412.4259","created_at":"2026-05-18T00:48:33Z"},{"alias_kind":"pith_short_12","alias_value":"HXFD3G3VFQWH","created_at":"2026-05-18T12:28:30Z"},{"alias_kind":"pith_short_16","alias_value":"HXFD3G3VFQWHA2KF","created_at":"2026-05-18T12:28:30Z"},{"alias_kind":"pith_short_8","alias_value":"HXFD3G3V","created_at":"2026-05-18T12:28:30Z"}],"graph_snapshots":[{"event_id":"sha256:59907458fd9f18b664cd31e4e49e1daf94ef7318042594b3733b8a2545ac0ec5","target":"graph","created_at":"2026-05-18T00:48:33Z","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":"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","authors_text":"Alain Finkel, Christoph Haase, Michael Blondin, Pierre McKenzie, Stefan G\\\"oller","cross_cats":["cs.CC","cs.LO"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.FL","submitted_at":"2014-12-13T17:10:34Z","title":"Reachability in Two-Dimensional Vector Addition Systems with States is PSPACE-complete"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1412.4259","kind":"arxiv","version":1},"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:a6c5810438105456d81de14855ac11ed77fd6e7ad0941a55196a2f92df05c52e","target":"record","created_at":"2026-05-18T00:48:33Z","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":"dc230bf4e96d3669b5474b9b301e8d0c597af51910bfda09885e55ea1282322c","cross_cats_sorted":["cs.CC","cs.LO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.FL","submitted_at":"2014-12-13T17:10:34Z","title_canon_sha256":"fc1cff08fb9c27e8c5295da939fcd68028a23419a394d82421e817ffa56c8317"},"schema_version":"1.0","source":{"id":"1412.4259","kind":"arxiv","version":1}},"canonical_sha256":"3dca3d9b752c2c7069454c41dc5a5a35779cdcf9756fb86a30993e2d2d533cc3","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"3dca3d9b752c2c7069454c41dc5a5a35779cdcf9756fb86a30993e2d2d533cc3","first_computed_at":"2026-05-18T00:48:33.262900Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:48:33.262900Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Az/cfDI7En7pqyNt4wJ4xS9wcQRkFZPee8id/8eYUz/AYsgCSO108WWhLiZoJT1oFDqjFMMSYS+9dVZ5Ot+CCQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:48:33.263491Z","signed_message":"canonical_sha256_bytes"},"source_id":"1412.4259","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:a6c5810438105456d81de14855ac11ed77fd6e7ad0941a55196a2f92df05c52e","sha256:59907458fd9f18b664cd31e4e49e1daf94ef7318042594b3733b8a2545ac0ec5"],"state_sha256":"1b18fce638167bde29cd7cfb509b923ef69ed448fc51bfea7a8475d0767fda9b"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"pixjcTDyGo2AKDU8ozvdSWuzz4vZAcD+xlYvJGFBkylU0VOk9XrX+HNZe8EKL0bayJzL//qr4y2rPVLoj1eRAw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-26T09:40:50.882488Z","bundle_sha256":"48b301879dde8598bcdc5ae46c1b6f1a7747535f872075a2d9ed455fa377d4b6"}}