{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:PBEU6TJ2AIW52HTN6YQ5HI5XJ4","short_pith_number":"pith:PBEU6TJ2","canonical_record":{"source":{"id":"1611.01296","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2016-11-04T09:41:33Z","cross_cats_sorted":["cs.FL"],"title_canon_sha256":"73f239a491e0f23d4242b98ec6421fd7beb9f29361eafb7ab71326bacf9ad749","abstract_canon_sha256":"fe5c3d7759dff4725743e4e756608db167928daa2ba52f7103fd685627c959f4"},"schema_version":"1.0"},"canonical_sha256":"78494f4d3a022ddd1e6df621d3a3b74f2751975b9c6ecc4edf7c65465c78d628","source":{"kind":"arxiv","id":"1611.01296","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1611.01296","created_at":"2026-05-18T01:00:11Z"},{"alias_kind":"arxiv_version","alias_value":"1611.01296v1","created_at":"2026-05-18T01:00:11Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1611.01296","created_at":"2026-05-18T01:00:11Z"},{"alias_kind":"pith_short_12","alias_value":"PBEU6TJ2AIW5","created_at":"2026-05-18T12:30:39Z"},{"alias_kind":"pith_short_16","alias_value":"PBEU6TJ2AIW52HTN","created_at":"2026-05-18T12:30:39Z"},{"alias_kind":"pith_short_8","alias_value":"PBEU6TJ2","created_at":"2026-05-18T12:30:39Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:PBEU6TJ2AIW52HTN6YQ5HI5XJ4","target":"record","payload":{"canonical_record":{"source":{"id":"1611.01296","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2016-11-04T09:41:33Z","cross_cats_sorted":["cs.FL"],"title_canon_sha256":"73f239a491e0f23d4242b98ec6421fd7beb9f29361eafb7ab71326bacf9ad749","abstract_canon_sha256":"fe5c3d7759dff4725743e4e756608db167928daa2ba52f7103fd685627c959f4"},"schema_version":"1.0"},"canonical_sha256":"78494f4d3a022ddd1e6df621d3a3b74f2751975b9c6ecc4edf7c65465c78d628","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:00:11.467429Z","signature_b64":"maXkPrXLdw/jOFO/klhbLr0tvxl0VEqyyXBUHsk2Hz/cPA1VJlAwrpyqkQyTnaKSdGddR8zKCa9/D+Kv8282DA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"78494f4d3a022ddd1e6df621d3a3b74f2751975b9c6ecc4edf7c65465c78d628","last_reissued_at":"2026-05-18T01:00:11.466711Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:00:11.466711Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1611.01296","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-18T01:00:11Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"lNvvLh90fNQ0p3vYFRJOUpPU0v8l/UiSwuEe9rceN1C+NU5UH1+cTFvn8g63uL1mLg0YFz92dAetBWrIg8BpBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T05:07:39.350724Z"},"content_sha256":"e72569a7062b4ecf0a5ad4dd55338d9711ed341ad3fac8512dd2959cf069d6fd","schema_version":"1.0","event_id":"sha256:e72569a7062b4ecf0a5ad4dd55338d9711ed341ad3fac8512dd2959cf069d6fd"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:PBEU6TJ2AIW52HTN6YQ5HI5XJ4","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Goal-Driven Unfolding of Petri Nets","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.FL"],"primary_cat":"cs.LO","authors_text":"Lo\\\"ic Paulev\\'e, Thomas Chatain","submitted_at":"2016-11-04T09:41:33Z","abstract_excerpt":"Unfoldings provide an efficient way to avoid the state-space explosion due to interleavings of concurrent transitions when exploring the runs of a Petri net. The theory of adequate orders allows one to define finite prefixes of unfoldings which contain all the reachable markings. In this paper we are interested in reachability of a single given marking, called the goal. We propose an algorithm for computing a finite prefix of the unfolding of a 1-safe Petri net that preserves all minimal configurations reaching this goal. Our algorithm combines the unfolding technique with on-the-fly model red"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1611.01296","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-18T01:00:11Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"O5Jxw/5yYP6X5ohj2ZbOulxdsgFsYKdligoCSDhfpUKOzNksZO5zmRLfuidiDRWdaHv3GWoicGjW1xJx6usxCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T05:07:39.351069Z"},"content_sha256":"4819e84f11121d252e35e5f9c8171fee27fa22b06b12a944f00a04b85c688005","schema_version":"1.0","event_id":"sha256:4819e84f11121d252e35e5f9c8171fee27fa22b06b12a944f00a04b85c688005"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/PBEU6TJ2AIW52HTN6YQ5HI5XJ4/bundle.json","state_url":"https://pith.science/pith/PBEU6TJ2AIW52HTN6YQ5HI5XJ4/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/PBEU6TJ2AIW52HTN6YQ5HI5XJ4/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-06-02T05:07:39Z","links":{"resolver":"https://pith.science/pith/PBEU6TJ2AIW52HTN6YQ5HI5XJ4","bundle":"https://pith.science/pith/PBEU6TJ2AIW52HTN6YQ5HI5XJ4/bundle.json","state":"https://pith.science/pith/PBEU6TJ2AIW52HTN6YQ5HI5XJ4/state.json","well_known_bundle":"https://pith.science/.well-known/pith/PBEU6TJ2AIW52HTN6YQ5HI5XJ4/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:PBEU6TJ2AIW52HTN6YQ5HI5XJ4","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":"fe5c3d7759dff4725743e4e756608db167928daa2ba52f7103fd685627c959f4","cross_cats_sorted":["cs.FL"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2016-11-04T09:41:33Z","title_canon_sha256":"73f239a491e0f23d4242b98ec6421fd7beb9f29361eafb7ab71326bacf9ad749"},"schema_version":"1.0","source":{"id":"1611.01296","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1611.01296","created_at":"2026-05-18T01:00:11Z"},{"alias_kind":"arxiv_version","alias_value":"1611.01296v1","created_at":"2026-05-18T01:00:11Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1611.01296","created_at":"2026-05-18T01:00:11Z"},{"alias_kind":"pith_short_12","alias_value":"PBEU6TJ2AIW5","created_at":"2026-05-18T12:30:39Z"},{"alias_kind":"pith_short_16","alias_value":"PBEU6TJ2AIW52HTN","created_at":"2026-05-18T12:30:39Z"},{"alias_kind":"pith_short_8","alias_value":"PBEU6TJ2","created_at":"2026-05-18T12:30:39Z"}],"graph_snapshots":[{"event_id":"sha256:4819e84f11121d252e35e5f9c8171fee27fa22b06b12a944f00a04b85c688005","target":"graph","created_at":"2026-05-18T01:00:11Z","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":"Unfoldings provide an efficient way to avoid the state-space explosion due to interleavings of concurrent transitions when exploring the runs of a Petri net. The theory of adequate orders allows one to define finite prefixes of unfoldings which contain all the reachable markings. In this paper we are interested in reachability of a single given marking, called the goal. We propose an algorithm for computing a finite prefix of the unfolding of a 1-safe Petri net that preserves all minimal configurations reaching this goal. Our algorithm combines the unfolding technique with on-the-fly model red","authors_text":"Lo\\\"ic Paulev\\'e, Thomas Chatain","cross_cats":["cs.FL"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2016-11-04T09:41:33Z","title":"Goal-Driven Unfolding of Petri Nets"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1611.01296","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:e72569a7062b4ecf0a5ad4dd55338d9711ed341ad3fac8512dd2959cf069d6fd","target":"record","created_at":"2026-05-18T01:00:11Z","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":"fe5c3d7759dff4725743e4e756608db167928daa2ba52f7103fd685627c959f4","cross_cats_sorted":["cs.FL"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2016-11-04T09:41:33Z","title_canon_sha256":"73f239a491e0f23d4242b98ec6421fd7beb9f29361eafb7ab71326bacf9ad749"},"schema_version":"1.0","source":{"id":"1611.01296","kind":"arxiv","version":1}},"canonical_sha256":"78494f4d3a022ddd1e6df621d3a3b74f2751975b9c6ecc4edf7c65465c78d628","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"78494f4d3a022ddd1e6df621d3a3b74f2751975b9c6ecc4edf7c65465c78d628","first_computed_at":"2026-05-18T01:00:11.466711Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:00:11.466711Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"maXkPrXLdw/jOFO/klhbLr0tvxl0VEqyyXBUHsk2Hz/cPA1VJlAwrpyqkQyTnaKSdGddR8zKCa9/D+Kv8282DA==","signature_status":"signed_v1","signed_at":"2026-05-18T01:00:11.467429Z","signed_message":"canonical_sha256_bytes"},"source_id":"1611.01296","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:e72569a7062b4ecf0a5ad4dd55338d9711ed341ad3fac8512dd2959cf069d6fd","sha256:4819e84f11121d252e35e5f9c8171fee27fa22b06b12a944f00a04b85c688005"],"state_sha256":"756360fdfefb30c05d3d58384b9045ee3626fb528e23bdd782cf023dd99e774c"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"kYifvFEjsip8SM/zJLSkyzxqY2BbtJ1BTDPZ4AFs//eo03NPPSho7P6cxmceJT/eOTtzIBNFtPLDS8l9cqdKCA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-02T05:07:39.352971Z","bundle_sha256":"409782bbd39afba05a0b070702196cadfb2951a4c18348c9a2219f1ccac30504"}}