{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:VK6MWHPMRXMSXPSFDVBHCV2PLW","short_pith_number":"pith:VK6MWHPM","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"},"canonical_sha256":"aabccb1dec8dd92bbe451d4271574f5d8d4fc6c03403f23045309a2bbef40503","source":{"kind":"arxiv","id":"1503.00745","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1503.00745","created_at":"2026-05-18T01:35:38Z"},{"alias_kind":"arxiv_version","alias_value":"1503.00745v2","created_at":"2026-05-18T01:35:38Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1503.00745","created_at":"2026-05-18T01:35:38Z"},{"alias_kind":"pith_short_12","alias_value":"VK6MWHPMRXMS","created_at":"2026-05-18T12:29:44Z"},{"alias_kind":"pith_short_16","alias_value":"VK6MWHPMRXMSXPSF","created_at":"2026-05-18T12:29:44Z"},{"alias_kind":"pith_short_8","alias_value":"VK6MWHPM","created_at":"2026-05-18T12:29:44Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:VK6MWHPMRXMSXPSFDVBHCV2PLW","target":"record","payload":{"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"},"canonical_sha256":"aabccb1dec8dd92bbe451d4271574f5d8d4fc6c03403f23045309a2bbef40503","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"},"source_kind":"arxiv","source_id":"1503.00745","source_version":2,"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-18T01:35:38Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"1UbH6ev0etRgTI2YjJ7K2AAI1dT3ahzJjFfQVQkoBs1AH3I4E+utSXaqv5JqQEdRpik+56uEfwyQcB6i07O/AA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T21:37:24.291719Z"},"content_sha256":"fa3b302b33760da5121f88d91f9b19628667f943a1e3f6f664e9fbb5504566f6","schema_version":"1.0","event_id":"sha256:fa3b302b33760da5121f88d91f9b19628667f943a1e3f6f664e9fbb5504566f6"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:VK6MWHPMRXMSXPSFDVBHCV2PLW","target":"graph","payload":{"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"},"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-18T01:35:38Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"8ImSrhapC/pgm7N+2G46YrtsXoT3E3z778sOpeDpsj+gl+OIP23uPestM/kPrxG3AVBjzxQ5feAde24zJ8y7Bg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T21:37:24.292407Z"},"content_sha256":"38f588d0d579f3cb9cc710904e636364d521bca3be550b6d4ebd520b11de260a","schema_version":"1.0","event_id":"sha256:38f588d0d579f3cb9cc710904e636364d521bca3be550b6d4ebd520b11de260a"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/VK6MWHPMRXMSXPSFDVBHCV2PLW/bundle.json","state_url":"https://pith.science/pith/VK6MWHPMRXMSXPSFDVBHCV2PLW/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/VK6MWHPMRXMSXPSFDVBHCV2PLW/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-25T21:37:24Z","links":{"resolver":"https://pith.science/pith/VK6MWHPMRXMSXPSFDVBHCV2PLW","bundle":"https://pith.science/pith/VK6MWHPMRXMSXPSFDVBHCV2PLW/bundle.json","state":"https://pith.science/pith/VK6MWHPMRXMSXPSFDVBHCV2PLW/state.json","well_known_bundle":"https://pith.science/.well-known/pith/VK6MWHPMRXMSXPSFDVBHCV2PLW/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:VK6MWHPMRXMSXPSFDVBHCV2PLW","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":"0bd0b76c8bdede7d0faa7ba4435422a5624c92119485c2147603b1f3e6ed2151","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2015-03-02T21:12:14Z","title_canon_sha256":"23d120d86d2a95df4f5a54603a8701085f39caff2167ba424c3a66d2e6b33c28"},"schema_version":"1.0","source":{"id":"1503.00745","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1503.00745","created_at":"2026-05-18T01:35:38Z"},{"alias_kind":"arxiv_version","alias_value":"1503.00745v2","created_at":"2026-05-18T01:35:38Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1503.00745","created_at":"2026-05-18T01:35:38Z"},{"alias_kind":"pith_short_12","alias_value":"VK6MWHPMRXMS","created_at":"2026-05-18T12:29:44Z"},{"alias_kind":"pith_short_16","alias_value":"VK6MWHPMRXMSXPSF","created_at":"2026-05-18T12:29:44Z"},{"alias_kind":"pith_short_8","alias_value":"VK6MWHPM","created_at":"2026-05-18T12:29:44Z"}],"graph_snapshots":[{"event_id":"sha256:38f588d0d579f3cb9cc710904e636364d521bca3be550b6d4ebd520b11de260a","target":"graph","created_at":"2026-05-18T01:35:38Z","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":"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","authors_text":"J\\'er\\^ome Leroux, Sylvain Schmitz","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2015-03-02T21:12:14Z","title":"Demystifying Reachability in Vector Addition Systems"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1503.00745","kind":"arxiv","version":2},"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:fa3b302b33760da5121f88d91f9b19628667f943a1e3f6f664e9fbb5504566f6","target":"record","created_at":"2026-05-18T01:35:38Z","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":"0bd0b76c8bdede7d0faa7ba4435422a5624c92119485c2147603b1f3e6ed2151","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2015-03-02T21:12:14Z","title_canon_sha256":"23d120d86d2a95df4f5a54603a8701085f39caff2167ba424c3a66d2e6b33c28"},"schema_version":"1.0","source":{"id":"1503.00745","kind":"arxiv","version":2}},"canonical_sha256":"aabccb1dec8dd92bbe451d4271574f5d8d4fc6c03403f23045309a2bbef40503","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"aabccb1dec8dd92bbe451d4271574f5d8d4fc6c03403f23045309a2bbef40503","first_computed_at":"2026-05-18T01:35:38.150686Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:35:38.150686Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"ldkH7A0tQ8BlBA+Wj5kVHrB//bKmTZNG0pAtEgVQQh1NQMcXRb+gONMDlBf3Sti7QDV2xUBNF7QwrjeKuhiXBg==","signature_status":"signed_v1","signed_at":"2026-05-18T01:35:38.151391Z","signed_message":"canonical_sha256_bytes"},"source_id":"1503.00745","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:fa3b302b33760da5121f88d91f9b19628667f943a1e3f6f664e9fbb5504566f6","sha256:38f588d0d579f3cb9cc710904e636364d521bca3be550b6d4ebd520b11de260a"],"state_sha256":"2fb22e1c7381b874e59af6d1572e85653670128838b93b3947962528492d7a66"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"pAGVL7mc5EG0m897ybfe46WpeC0DXT7/UVPHk7RHXNenwNSnPJMMZgKxIRN91vJb8ylV15X6DYWMHrBpd+gEBw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-25T21:37:24.295692Z","bundle_sha256":"a6c94e6475c373e9e4c8d7ed0092a2cac8722bab7916b99705ec4ade883940f8"}}