{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:HHO3DB3ZZOA24LOI33TG43TRVN","short_pith_number":"pith:HHO3DB3Z","canonical_record":{"source":{"id":"1510.05724","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2015-10-20T00:02:48Z","cross_cats_sorted":["cs.FL"],"title_canon_sha256":"35e70ccd252ad744793042384639534052b1326c14b91c0fad72a4b57b8bce2d","abstract_canon_sha256":"70506d8eb796f189d07605aaed4d786769929aa16ac0f473dac298e3a321a52e"},"schema_version":"1.0"},"canonical_sha256":"39ddb18779cb81ae2dc8dee66e6e71ab5ecec59b16a63ec0d942b0893136f9d4","source":{"kind":"arxiv","id":"1510.05724","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1510.05724","created_at":"2026-05-18T00:48:05Z"},{"alias_kind":"arxiv_version","alias_value":"1510.05724v2","created_at":"2026-05-18T00:48:05Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1510.05724","created_at":"2026-05-18T00:48:05Z"},{"alias_kind":"pith_short_12","alias_value":"HHO3DB3ZZOA2","created_at":"2026-05-18T12:29:25Z"},{"alias_kind":"pith_short_16","alias_value":"HHO3DB3ZZOA24LOI","created_at":"2026-05-18T12:29:25Z"},{"alias_kind":"pith_short_8","alias_value":"HHO3DB3Z","created_at":"2026-05-18T12:29:25Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:HHO3DB3ZZOA24LOI33TG43TRVN","target":"record","payload":{"canonical_record":{"source":{"id":"1510.05724","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2015-10-20T00:02:48Z","cross_cats_sorted":["cs.FL"],"title_canon_sha256":"35e70ccd252ad744793042384639534052b1326c14b91c0fad72a4b57b8bce2d","abstract_canon_sha256":"70506d8eb796f189d07605aaed4d786769929aa16ac0f473dac298e3a321a52e"},"schema_version":"1.0"},"canonical_sha256":"39ddb18779cb81ae2dc8dee66e6e71ab5ecec59b16a63ec0d942b0893136f9d4","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:48:05.833306Z","signature_b64":"SrGga5PZRn7Lk0cGwYMYNYqeI9OnHYgZQOyu/ZGLzL4Z4mzAEgOWCCMS/PBH35Xo10luO0sDBeSm4JtVFAp8Aw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"39ddb18779cb81ae2dc8dee66e6e71ab5ecec59b16a63ec0d942b0893136f9d4","last_reissued_at":"2026-05-18T00:48:05.832730Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:48:05.832730Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1510.05724","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-18T00:48:05Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"BSCBzoW7RPAxRMcl/hdyJehw4W58MP6iNV5phkNGwUBCGaAwZme31yi4eAKwpdHv/qhpEe2BKC0n2VkrXHepBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T04:44:23.619486Z"},"content_sha256":"61232349ac6f82ce9668ea2fc81cc014d6311891cdcc762348729d3bfcd86af8","schema_version":"1.0","event_id":"sha256:61232349ac6f82ce9668ea2fc81cc014d6311891cdcc762348729d3bfcd86af8"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:HHO3DB3ZZOA24LOI33TG43TRVN","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Approaching the Coverability Problem Continuously","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.FL"],"primary_cat":"cs.LO","authors_text":"Alain Finkel, Christoph Haase, Michael Blondin, Serge Haddad","submitted_at":"2015-10-20T00:02:48Z","abstract_excerpt":"The coverability problem for Petri nets plays a central role in the verification of concurrent shared-memory programs. However, its high EXPSPACE-complete complexity poses a challenge when encountered in real-world instances. In this paper, we develop a new approach to this problem which is primarily based on applying forward coverability in continuous Petri nets as a pruning criterion inside a backward coverability framework. A cornerstone of our approach is the efficient encoding of a recently developed polynomial-time algorithm for reachability in continuous Petri nets into SMT. We demonstr"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1510.05724","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-18T00:48:05Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"uRk/3WJmpJp8+feIkTVIgM9/ETbuw3GaFdqdJZxVqkDCJavT32aqSBUQCyOmacrFEDHuzSCRIUYIwM1jdxIxCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T04:44:23.620124Z"},"content_sha256":"8edd219f5385a1e2f1f87c4ae0edeae7c89e045dbc97adca2c155abeb24e89cd","schema_version":"1.0","event_id":"sha256:8edd219f5385a1e2f1f87c4ae0edeae7c89e045dbc97adca2c155abeb24e89cd"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/HHO3DB3ZZOA24LOI33TG43TRVN/bundle.json","state_url":"https://pith.science/pith/HHO3DB3ZZOA24LOI33TG43TRVN/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/HHO3DB3ZZOA24LOI33TG43TRVN/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-26T04:44:23Z","links":{"resolver":"https://pith.science/pith/HHO3DB3ZZOA24LOI33TG43TRVN","bundle":"https://pith.science/pith/HHO3DB3ZZOA24LOI33TG43TRVN/bundle.json","state":"https://pith.science/pith/HHO3DB3ZZOA24LOI33TG43TRVN/state.json","well_known_bundle":"https://pith.science/.well-known/pith/HHO3DB3ZZOA24LOI33TG43TRVN/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:HHO3DB3ZZOA24LOI33TG43TRVN","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":"70506d8eb796f189d07605aaed4d786769929aa16ac0f473dac298e3a321a52e","cross_cats_sorted":["cs.FL"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2015-10-20T00:02:48Z","title_canon_sha256":"35e70ccd252ad744793042384639534052b1326c14b91c0fad72a4b57b8bce2d"},"schema_version":"1.0","source":{"id":"1510.05724","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1510.05724","created_at":"2026-05-18T00:48:05Z"},{"alias_kind":"arxiv_version","alias_value":"1510.05724v2","created_at":"2026-05-18T00:48:05Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1510.05724","created_at":"2026-05-18T00:48:05Z"},{"alias_kind":"pith_short_12","alias_value":"HHO3DB3ZZOA2","created_at":"2026-05-18T12:29:25Z"},{"alias_kind":"pith_short_16","alias_value":"HHO3DB3ZZOA24LOI","created_at":"2026-05-18T12:29:25Z"},{"alias_kind":"pith_short_8","alias_value":"HHO3DB3Z","created_at":"2026-05-18T12:29:25Z"}],"graph_snapshots":[{"event_id":"sha256:8edd219f5385a1e2f1f87c4ae0edeae7c89e045dbc97adca2c155abeb24e89cd","target":"graph","created_at":"2026-05-18T00:48:05Z","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":"The coverability problem for Petri nets plays a central role in the verification of concurrent shared-memory programs. However, its high EXPSPACE-complete complexity poses a challenge when encountered in real-world instances. In this paper, we develop a new approach to this problem which is primarily based on applying forward coverability in continuous Petri nets as a pruning criterion inside a backward coverability framework. A cornerstone of our approach is the efficient encoding of a recently developed polynomial-time algorithm for reachability in continuous Petri nets into SMT. We demonstr","authors_text":"Alain Finkel, Christoph Haase, Michael Blondin, Serge Haddad","cross_cats":["cs.FL"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2015-10-20T00:02:48Z","title":"Approaching the Coverability Problem Continuously"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1510.05724","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:61232349ac6f82ce9668ea2fc81cc014d6311891cdcc762348729d3bfcd86af8","target":"record","created_at":"2026-05-18T00:48:05Z","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":"70506d8eb796f189d07605aaed4d786769929aa16ac0f473dac298e3a321a52e","cross_cats_sorted":["cs.FL"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2015-10-20T00:02:48Z","title_canon_sha256":"35e70ccd252ad744793042384639534052b1326c14b91c0fad72a4b57b8bce2d"},"schema_version":"1.0","source":{"id":"1510.05724","kind":"arxiv","version":2}},"canonical_sha256":"39ddb18779cb81ae2dc8dee66e6e71ab5ecec59b16a63ec0d942b0893136f9d4","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"39ddb18779cb81ae2dc8dee66e6e71ab5ecec59b16a63ec0d942b0893136f9d4","first_computed_at":"2026-05-18T00:48:05.832730Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:48:05.832730Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"SrGga5PZRn7Lk0cGwYMYNYqeI9OnHYgZQOyu/ZGLzL4Z4mzAEgOWCCMS/PBH35Xo10luO0sDBeSm4JtVFAp8Aw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:48:05.833306Z","signed_message":"canonical_sha256_bytes"},"source_id":"1510.05724","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:61232349ac6f82ce9668ea2fc81cc014d6311891cdcc762348729d3bfcd86af8","sha256:8edd219f5385a1e2f1f87c4ae0edeae7c89e045dbc97adca2c155abeb24e89cd"],"state_sha256":"9c9ef524a3b7e464855e341a8924f1a3ed1b2986ca012173993a91fcd1ff7f5b"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"2PbGxNYL9By12rR/3jikoLe7dOUX4J8wA42wo7pZwjeWw/lp9iuH30XZCG1yDeULCeCcF6JzmFJDH8o8FMo2CA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-26T04:44:23.623665Z","bundle_sha256":"17fe3776a933620b464f4935022bcec781587e080370d9e969bf8b36cf56b453"}}