{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:U36KXMA3DSCA34PXZVN664YJUC","short_pith_number":"pith:U36KXMA3","canonical_record":{"source":{"id":"1701.02927","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.FL","submitted_at":"2017-01-11T11:20:31Z","cross_cats_sorted":["cs.LO"],"title_canon_sha256":"8cd02e5ae780160aba64dbbbfb74cd57a3d7ab1c6b8aa835808f0f757fd41283","abstract_canon_sha256":"4beccc08e0aaf81579c47f77c3daaf2ea680c2dd46bc32036b1b18699537c585"},"schema_version":"1.0"},"canonical_sha256":"a6fcabb01b1c840df1f7cd5bef7309a08e076471dc539f4a1d7dcd13eff0ad19","source":{"kind":"arxiv","id":"1701.02927","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1701.02927","created_at":"2026-05-18T00:19:09Z"},{"alias_kind":"arxiv_version","alias_value":"1701.02927v2","created_at":"2026-05-18T00:19:09Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1701.02927","created_at":"2026-05-18T00:19:09Z"},{"alias_kind":"pith_short_12","alias_value":"U36KXMA3DSCA","created_at":"2026-05-18T12:31:46Z"},{"alias_kind":"pith_short_16","alias_value":"U36KXMA3DSCA34PX","created_at":"2026-05-18T12:31:46Z"},{"alias_kind":"pith_short_8","alias_value":"U36KXMA3","created_at":"2026-05-18T12:31:46Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:U36KXMA3DSCA34PXZVN664YJUC","target":"record","payload":{"canonical_record":{"source":{"id":"1701.02927","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.FL","submitted_at":"2017-01-11T11:20:31Z","cross_cats_sorted":["cs.LO"],"title_canon_sha256":"8cd02e5ae780160aba64dbbbfb74cd57a3d7ab1c6b8aa835808f0f757fd41283","abstract_canon_sha256":"4beccc08e0aaf81579c47f77c3daaf2ea680c2dd46bc32036b1b18699537c585"},"schema_version":"1.0"},"canonical_sha256":"a6fcabb01b1c840df1f7cd5bef7309a08e076471dc539f4a1d7dcd13eff0ad19","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:19:09.010937Z","signature_b64":"RGQ0/t0c8auXlFpPPFOVCAYib07MDIjarUgY8nioobxArkmOJog+hz4/IVe6npNbzWZ4tbhEAB6Ea63+ua7SAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a6fcabb01b1c840df1f7cd5bef7309a08e076471dc539f4a1d7dcd13eff0ad19","last_reissued_at":"2026-05-18T00:19:09.009995Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:19:09.009995Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1701.02927","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:19:09Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"+KCPdgAyXfkrDtV+NMSFGmCv9OkW6pVeaI6BLeJo/1klvpBSF1QWtiAtkEaQsNE7XoYdJrjBuFYY0FBdLJCdAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-28T08:08:31.039935Z"},"content_sha256":"248fbb4f7997143715529ac7c3392df2797b09773cb1cf979608824de0ec41b1","schema_version":"1.0","event_id":"sha256:248fbb4f7997143715529ac7c3392df2797b09773cb1cf979608824de0ec41b1"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:U36KXMA3DSCA34PXZVN664YJUC","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"On the Upward/Downward Closures of Petri Nets","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LO"],"primary_cat":"cs.FL","authors_text":"Mohamed Faouzi Atig, Prakash Saivasan, Roland Meyer, Sebastian Muskalla","submitted_at":"2017-01-11T11:20:31Z","abstract_excerpt":"We study the size and the complexity of computing finite state automata (FSA) representing and approximating the downward and the upward closure of Petri net languages with coverability as the acceptance condition. We show how to construct an FSA recognizing the upward closure of a Petri net language in doubly-exponential time, and therefore the size is at most doubly exponential. For downward closures, we prove that the size of the minimal automata can be non-primitive recursive. In the case of BPP nets, a well-known subclass of Petri nets, we show that an FSA accepting the downward/upward cl"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1701.02927","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:19:09Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"02X5RmNaO4HJrYjzRw/LkWDDM+OS3ZjhV37Ii95rxjSZTxYc2Ys+SJ4V/miWp5BEGoKZd8rfEiQ3cXWwsV0gAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-28T08:08:31.040277Z"},"content_sha256":"1598c2f37ce7feb5b08e28aaf0c4a2104708d8936b1da787fbff477d1af62ec2","schema_version":"1.0","event_id":"sha256:1598c2f37ce7feb5b08e28aaf0c4a2104708d8936b1da787fbff477d1af62ec2"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/U36KXMA3DSCA34PXZVN664YJUC/bundle.json","state_url":"https://pith.science/pith/U36KXMA3DSCA34PXZVN664YJUC/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/U36KXMA3DSCA34PXZVN664YJUC/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-28T08:08:31Z","links":{"resolver":"https://pith.science/pith/U36KXMA3DSCA34PXZVN664YJUC","bundle":"https://pith.science/pith/U36KXMA3DSCA34PXZVN664YJUC/bundle.json","state":"https://pith.science/pith/U36KXMA3DSCA34PXZVN664YJUC/state.json","well_known_bundle":"https://pith.science/.well-known/pith/U36KXMA3DSCA34PXZVN664YJUC/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:U36KXMA3DSCA34PXZVN664YJUC","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":"4beccc08e0aaf81579c47f77c3daaf2ea680c2dd46bc32036b1b18699537c585","cross_cats_sorted":["cs.LO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.FL","submitted_at":"2017-01-11T11:20:31Z","title_canon_sha256":"8cd02e5ae780160aba64dbbbfb74cd57a3d7ab1c6b8aa835808f0f757fd41283"},"schema_version":"1.0","source":{"id":"1701.02927","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1701.02927","created_at":"2026-05-18T00:19:09Z"},{"alias_kind":"arxiv_version","alias_value":"1701.02927v2","created_at":"2026-05-18T00:19:09Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1701.02927","created_at":"2026-05-18T00:19:09Z"},{"alias_kind":"pith_short_12","alias_value":"U36KXMA3DSCA","created_at":"2026-05-18T12:31:46Z"},{"alias_kind":"pith_short_16","alias_value":"U36KXMA3DSCA34PX","created_at":"2026-05-18T12:31:46Z"},{"alias_kind":"pith_short_8","alias_value":"U36KXMA3","created_at":"2026-05-18T12:31:46Z"}],"graph_snapshots":[{"event_id":"sha256:1598c2f37ce7feb5b08e28aaf0c4a2104708d8936b1da787fbff477d1af62ec2","target":"graph","created_at":"2026-05-18T00:19:09Z","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":"We study the size and the complexity of computing finite state automata (FSA) representing and approximating the downward and the upward closure of Petri net languages with coverability as the acceptance condition. We show how to construct an FSA recognizing the upward closure of a Petri net language in doubly-exponential time, and therefore the size is at most doubly exponential. For downward closures, we prove that the size of the minimal automata can be non-primitive recursive. In the case of BPP nets, a well-known subclass of Petri nets, we show that an FSA accepting the downward/upward cl","authors_text":"Mohamed Faouzi Atig, Prakash Saivasan, Roland Meyer, Sebastian Muskalla","cross_cats":["cs.LO"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.FL","submitted_at":"2017-01-11T11:20:31Z","title":"On the Upward/Downward Closures of Petri Nets"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1701.02927","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:248fbb4f7997143715529ac7c3392df2797b09773cb1cf979608824de0ec41b1","target":"record","created_at":"2026-05-18T00:19:09Z","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":"4beccc08e0aaf81579c47f77c3daaf2ea680c2dd46bc32036b1b18699537c585","cross_cats_sorted":["cs.LO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.FL","submitted_at":"2017-01-11T11:20:31Z","title_canon_sha256":"8cd02e5ae780160aba64dbbbfb74cd57a3d7ab1c6b8aa835808f0f757fd41283"},"schema_version":"1.0","source":{"id":"1701.02927","kind":"arxiv","version":2}},"canonical_sha256":"a6fcabb01b1c840df1f7cd5bef7309a08e076471dc539f4a1d7dcd13eff0ad19","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"a6fcabb01b1c840df1f7cd5bef7309a08e076471dc539f4a1d7dcd13eff0ad19","first_computed_at":"2026-05-18T00:19:09.009995Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:19:09.009995Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"RGQ0/t0c8auXlFpPPFOVCAYib07MDIjarUgY8nioobxArkmOJog+hz4/IVe6npNbzWZ4tbhEAB6Ea63+ua7SAg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:19:09.010937Z","signed_message":"canonical_sha256_bytes"},"source_id":"1701.02927","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:248fbb4f7997143715529ac7c3392df2797b09773cb1cf979608824de0ec41b1","sha256:1598c2f37ce7feb5b08e28aaf0c4a2104708d8936b1da787fbff477d1af62ec2"],"state_sha256":"21587e721e089f9429ab3dc1583fc62e2cd2905f94aa61ce923eaa75874805b3"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"2FLOy3c5Od5R1nj8xaN0r40VIiKGPYIgDIeIhBB0smHW7lzaQLYXE29uZj9g27C33PUti0+qSSVzhD+PFtmDAQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-28T08:08:31.042227Z","bundle_sha256":"890737782ffb3096c97dd49882a861b916cfaf4fd15161f4c697c83c3e65fced"}}