{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:VK6MWHPMRXMSXPSFDVBHCV2PLW","short_pith_number":"pith:VK6MWHPM","schema_version":"1.0","canonical_sha256":"aabccb1dec8dd92bbe451d4271574f5d8d4fc6c03403f23045309a2bbef40503","source":{"kind":"arxiv","id":"1503.00745","version":2},"attestation_state":"computed","paper":{"title":"Demystifying Reachability in Vector Addition Systems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LO","authors_text":"J\\'er\\^ome Leroux, Sylvain Schmitz","submitted_at":"2015-03-02T21:12:14Z","abstract_excerpt":"More than 30 years after their inception, the decidability proofs for reachability in vector addition systems (VAS) still retain much of their mystery. These proofs rely crucially on a decomposition of runs successively refined by Mayr, Kosaraju, and Lambert, which appears rather magical, and for which no complexity upper bound is known.\n  We first offer a justification for this decomposition technique, by showing that it computes the ideal decomposition of the set of runs, using the natural embedding relation between runs as well quasi ordering. In a second part, we apply recent results on th"},"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.00745","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2015-03-02T21:12:14Z","cross_cats_sorted":[],"title_canon_sha256":"23d120d86d2a95df4f5a54603a8701085f39caff2167ba424c3a66d2e6b33c28","abstract_canon_sha256":"0bd0b76c8bdede7d0faa7ba4435422a5624c92119485c2147603b1f3e6ed2151"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:35:38.151391Z","signature_b64":"ldkH7A0tQ8BlBA+Wj5kVHrB//bKmTZNG0pAtEgVQQh1NQMcXRb+gONMDlBf3Sti7QDV2xUBNF7QwrjeKuhiXBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"aabccb1dec8dd92bbe451d4271574f5d8d4fc6c03403f23045309a2bbef40503","last_reissued_at":"2026-05-18T01:35:38.150686Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:35:38.150686Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Demystifying Reachability in Vector Addition Systems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LO","authors_text":"J\\'er\\^ome Leroux, Sylvain Schmitz","submitted_at":"2015-03-02T21:12:14Z","abstract_excerpt":"More than 30 years after their inception, the decidability proofs for reachability in vector addition systems (VAS) still retain much of their mystery. These proofs rely crucially on a decomposition of runs successively refined by Mayr, Kosaraju, and Lambert, which appears rather magical, and for which no complexity upper bound is known.\n  We first offer a justification for this decomposition technique, by showing that it computes the ideal decomposition of the set of runs, using the natural embedding relation between runs as well quasi ordering. In a second part, we apply recent results on th"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1503.00745","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":"1503.00745","created_at":"2026-05-18T01:35:38.150800+00:00"},{"alias_kind":"arxiv_version","alias_value":"1503.00745v2","created_at":"2026-05-18T01:35:38.150800+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1503.00745","created_at":"2026-05-18T01:35:38.150800+00:00"},{"alias_kind":"pith_short_12","alias_value":"VK6MWHPMRXMS","created_at":"2026-05-18T12:29:44.643036+00:00"},{"alias_kind":"pith_short_16","alias_value":"VK6MWHPMRXMSXPSF","created_at":"2026-05-18T12:29:44.643036+00:00"},{"alias_kind":"pith_short_8","alias_value":"VK6MWHPM","created_at":"2026-05-18T12:29:44.643036+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/VK6MWHPMRXMSXPSFDVBHCV2PLW","json":"https://pith.science/pith/VK6MWHPMRXMSXPSFDVBHCV2PLW.json","graph_json":"https://pith.science/api/pith-number/VK6MWHPMRXMSXPSFDVBHCV2PLW/graph.json","events_json":"https://pith.science/api/pith-number/VK6MWHPMRXMSXPSFDVBHCV2PLW/events.json","paper":"https://pith.science/paper/VK6MWHPM"},"agent_actions":{"view_html":"https://pith.science/pith/VK6MWHPMRXMSXPSFDVBHCV2PLW","download_json":"https://pith.science/pith/VK6MWHPMRXMSXPSFDVBHCV2PLW.json","view_paper":"https://pith.science/paper/VK6MWHPM","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1503.00745&json=true","fetch_graph":"https://pith.science/api/pith-number/VK6MWHPMRXMSXPSFDVBHCV2PLW/graph.json","fetch_events":"https://pith.science/api/pith-number/VK6MWHPMRXMSXPSFDVBHCV2PLW/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/VK6MWHPMRXMSXPSFDVBHCV2PLW/action/timestamp_anchor","attest_storage":"https://pith.science/pith/VK6MWHPMRXMSXPSFDVBHCV2PLW/action/storage_attestation","attest_author":"https://pith.science/pith/VK6MWHPMRXMSXPSFDVBHCV2PLW/action/author_attestation","sign_citation":"https://pith.science/pith/VK6MWHPMRXMSXPSFDVBHCV2PLW/action/citation_signature","submit_replication":"https://pith.science/pith/VK6MWHPMRXMSXPSFDVBHCV2PLW/action/replication_record"}},"created_at":"2026-05-18T01:35:38.150800+00:00","updated_at":"2026-05-18T01:35:38.150800+00:00"}