{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:PBEU6TJ2AIW52HTN6YQ5HI5XJ4","short_pith_number":"pith:PBEU6TJ2","schema_version":"1.0","canonical_sha256":"78494f4d3a022ddd1e6df621d3a3b74f2751975b9c6ecc4edf7c65465c78d628","source":{"kind":"arxiv","id":"1611.01296","version":1},"attestation_state":"computed","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"},"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":"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1611.01296","created_at":"2026-05-18T01:00:11.466825+00:00"},{"alias_kind":"arxiv_version","alias_value":"1611.01296v1","created_at":"2026-05-18T01:00:11.466825+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1611.01296","created_at":"2026-05-18T01:00:11.466825+00:00"},{"alias_kind":"pith_short_12","alias_value":"PBEU6TJ2AIW5","created_at":"2026-05-18T12:30:39.010887+00:00"},{"alias_kind":"pith_short_16","alias_value":"PBEU6TJ2AIW52HTN","created_at":"2026-05-18T12:30:39.010887+00:00"},{"alias_kind":"pith_short_8","alias_value":"PBEU6TJ2","created_at":"2026-05-18T12:30:39.010887+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/PBEU6TJ2AIW52HTN6YQ5HI5XJ4","json":"https://pith.science/pith/PBEU6TJ2AIW52HTN6YQ5HI5XJ4.json","graph_json":"https://pith.science/api/pith-number/PBEU6TJ2AIW52HTN6YQ5HI5XJ4/graph.json","events_json":"https://pith.science/api/pith-number/PBEU6TJ2AIW52HTN6YQ5HI5XJ4/events.json","paper":"https://pith.science/paper/PBEU6TJ2"},"agent_actions":{"view_html":"https://pith.science/pith/PBEU6TJ2AIW52HTN6YQ5HI5XJ4","download_json":"https://pith.science/pith/PBEU6TJ2AIW52HTN6YQ5HI5XJ4.json","view_paper":"https://pith.science/paper/PBEU6TJ2","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1611.01296&json=true","fetch_graph":"https://pith.science/api/pith-number/PBEU6TJ2AIW52HTN6YQ5HI5XJ4/graph.json","fetch_events":"https://pith.science/api/pith-number/PBEU6TJ2AIW52HTN6YQ5HI5XJ4/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/PBEU6TJ2AIW52HTN6YQ5HI5XJ4/action/timestamp_anchor","attest_storage":"https://pith.science/pith/PBEU6TJ2AIW52HTN6YQ5HI5XJ4/action/storage_attestation","attest_author":"https://pith.science/pith/PBEU6TJ2AIW52HTN6YQ5HI5XJ4/action/author_attestation","sign_citation":"https://pith.science/pith/PBEU6TJ2AIW52HTN6YQ5HI5XJ4/action/citation_signature","submit_replication":"https://pith.science/pith/PBEU6TJ2AIW52HTN6YQ5HI5XJ4/action/replication_record"}},"created_at":"2026-05-18T01:00:11.466825+00:00","updated_at":"2026-05-18T01:00:11.466825+00:00"}