{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:2HRBGECTRDMS3NVBT5UXNWE6KV","short_pith_number":"pith:2HRBGECT","canonical_record":{"source":{"id":"1809.07115","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.FL","submitted_at":"2018-09-19T10:39:00Z","cross_cats_sorted":["cs.LO"],"title_canon_sha256":"a0ff603eb9a6c0f2c9474c0c3d9dc00b24ce8ce878dbf5d8014319ecc5c25fbc","abstract_canon_sha256":"47e9fdde1da55a17d1dcbd1c717125d4b85255e34a800d599e0c1b1f6b3c0198"},"schema_version":"1.0"},"canonical_sha256":"d1e213105388d92db6a19f6976d89e5557a5a203f1648fdaac0655f406bbee15","source":{"kind":"arxiv","id":"1809.07115","version":4},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1809.07115","created_at":"2026-05-17T23:48:50Z"},{"alias_kind":"arxiv_version","alias_value":"1809.07115v4","created_at":"2026-05-17T23:48:50Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1809.07115","created_at":"2026-05-17T23:48:50Z"},{"alias_kind":"pith_short_12","alias_value":"2HRBGECTRDMS","created_at":"2026-05-18T12:32:02Z"},{"alias_kind":"pith_short_16","alias_value":"2HRBGECTRDMS3NVB","created_at":"2026-05-18T12:32:02Z"},{"alias_kind":"pith_short_8","alias_value":"2HRBGECT","created_at":"2026-05-18T12:32:02Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:2HRBGECTRDMS3NVBT5UXNWE6KV","target":"record","payload":{"canonical_record":{"source":{"id":"1809.07115","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.FL","submitted_at":"2018-09-19T10:39:00Z","cross_cats_sorted":["cs.LO"],"title_canon_sha256":"a0ff603eb9a6c0f2c9474c0c3d9dc00b24ce8ce878dbf5d8014319ecc5c25fbc","abstract_canon_sha256":"47e9fdde1da55a17d1dcbd1c717125d4b85255e34a800d599e0c1b1f6b3c0198"},"schema_version":"1.0"},"canonical_sha256":"d1e213105388d92db6a19f6976d89e5557a5a203f1648fdaac0655f406bbee15","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:48:50.753465Z","signature_b64":"h1XFh66DgHiXSVch+c/Pie6OwTXU9oYpvZ8efuLQ7xSZYn5YjnHmvwLf+asfn0ulCiNkJLubqgcEzxxMRltXBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d1e213105388d92db6a19f6976d89e5557a5a203f1648fdaac0655f406bbee15","last_reissued_at":"2026-05-17T23:48:50.752804Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:48:50.752804Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1809.07115","source_version":4,"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-17T23:48:50Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"4tjd6Gacf4AL5sE9rBMqfpiNUvOwLX7Ypo1mxQ/szCw+O3/Ie1ys+8oQM7g+OheUB/riInCzMgzjQYiXLCpmDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-08T08:18:16.906048Z"},"content_sha256":"6eac47401d8d5412c9ba0f4b49a91d57b687ddaaf746405c286c5334791aa486","schema_version":"1.0","event_id":"sha256:6eac47401d8d5412c9ba0f4b49a91d57b687ddaaf746405c286c5334791aa486"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:2HRBGECTRDMS3NVBT5UXNWE6KV","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"The Reachability Problem for Petri Nets is Not Elementary","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LO"],"primary_cat":"cs.FL","authors_text":"Filip Mazowiecki, Jerome Leroux, Ranko Lazic, Slawomir Lasota, Wojciech Czerwinski","submitted_at":"2018-09-19T10:39:00Z","abstract_excerpt":"Petri nets, also known as vector addition systems, are a long established model of concurrency with extensive applications in modelling and analysis of hardware, software and database systems, as well as chemical, biological and business processes. The central algorithmic problem for Petri nets is reachability: whether from the given initial configuration there exists a sequence of valid execution steps that reaches the given final configuration. The complexity of the problem has remained unsettled since the 1960s, and it is one of the most prominent open questions in the theory of verificatio"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1809.07115","kind":"arxiv","version":4},"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-17T23:48:50Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"SwK3iEBelflvHZDknKSq28mNIeofb4zWDKEBZQiyzuO6h3p51Hk+peiVl3BOHKx834AkjKAzfL2Nc82zWjMYAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-08T08:18:16.906785Z"},"content_sha256":"f28eec28e7f15fc3f53d172b018e378797c374d7ff44768828efbdfddb269058","schema_version":"1.0","event_id":"sha256:f28eec28e7f15fc3f53d172b018e378797c374d7ff44768828efbdfddb269058"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/2HRBGECTRDMS3NVBT5UXNWE6KV/bundle.json","state_url":"https://pith.science/pith/2HRBGECTRDMS3NVBT5UXNWE6KV/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/2HRBGECTRDMS3NVBT5UXNWE6KV/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-08T08:18:16Z","links":{"resolver":"https://pith.science/pith/2HRBGECTRDMS3NVBT5UXNWE6KV","bundle":"https://pith.science/pith/2HRBGECTRDMS3NVBT5UXNWE6KV/bundle.json","state":"https://pith.science/pith/2HRBGECTRDMS3NVBT5UXNWE6KV/state.json","well_known_bundle":"https://pith.science/.well-known/pith/2HRBGECTRDMS3NVBT5UXNWE6KV/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:2HRBGECTRDMS3NVBT5UXNWE6KV","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":"47e9fdde1da55a17d1dcbd1c717125d4b85255e34a800d599e0c1b1f6b3c0198","cross_cats_sorted":["cs.LO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.FL","submitted_at":"2018-09-19T10:39:00Z","title_canon_sha256":"a0ff603eb9a6c0f2c9474c0c3d9dc00b24ce8ce878dbf5d8014319ecc5c25fbc"},"schema_version":"1.0","source":{"id":"1809.07115","kind":"arxiv","version":4}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1809.07115","created_at":"2026-05-17T23:48:50Z"},{"alias_kind":"arxiv_version","alias_value":"1809.07115v4","created_at":"2026-05-17T23:48:50Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1809.07115","created_at":"2026-05-17T23:48:50Z"},{"alias_kind":"pith_short_12","alias_value":"2HRBGECTRDMS","created_at":"2026-05-18T12:32:02Z"},{"alias_kind":"pith_short_16","alias_value":"2HRBGECTRDMS3NVB","created_at":"2026-05-18T12:32:02Z"},{"alias_kind":"pith_short_8","alias_value":"2HRBGECT","created_at":"2026-05-18T12:32:02Z"}],"graph_snapshots":[{"event_id":"sha256:f28eec28e7f15fc3f53d172b018e378797c374d7ff44768828efbdfddb269058","target":"graph","created_at":"2026-05-17T23:48:50Z","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":"Petri nets, also known as vector addition systems, are a long established model of concurrency with extensive applications in modelling and analysis of hardware, software and database systems, as well as chemical, biological and business processes. The central algorithmic problem for Petri nets is reachability: whether from the given initial configuration there exists a sequence of valid execution steps that reaches the given final configuration. The complexity of the problem has remained unsettled since the 1960s, and it is one of the most prominent open questions in the theory of verificatio","authors_text":"Filip Mazowiecki, Jerome Leroux, Ranko Lazic, Slawomir Lasota, Wojciech Czerwinski","cross_cats":["cs.LO"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.FL","submitted_at":"2018-09-19T10:39:00Z","title":"The Reachability Problem for Petri Nets is Not Elementary"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1809.07115","kind":"arxiv","version":4},"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:6eac47401d8d5412c9ba0f4b49a91d57b687ddaaf746405c286c5334791aa486","target":"record","created_at":"2026-05-17T23:48:50Z","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":"47e9fdde1da55a17d1dcbd1c717125d4b85255e34a800d599e0c1b1f6b3c0198","cross_cats_sorted":["cs.LO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.FL","submitted_at":"2018-09-19T10:39:00Z","title_canon_sha256":"a0ff603eb9a6c0f2c9474c0c3d9dc00b24ce8ce878dbf5d8014319ecc5c25fbc"},"schema_version":"1.0","source":{"id":"1809.07115","kind":"arxiv","version":4}},"canonical_sha256":"d1e213105388d92db6a19f6976d89e5557a5a203f1648fdaac0655f406bbee15","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"d1e213105388d92db6a19f6976d89e5557a5a203f1648fdaac0655f406bbee15","first_computed_at":"2026-05-17T23:48:50.752804Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:48:50.752804Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"h1XFh66DgHiXSVch+c/Pie6OwTXU9oYpvZ8efuLQ7xSZYn5YjnHmvwLf+asfn0ulCiNkJLubqgcEzxxMRltXBQ==","signature_status":"signed_v1","signed_at":"2026-05-17T23:48:50.753465Z","signed_message":"canonical_sha256_bytes"},"source_id":"1809.07115","source_kind":"arxiv","source_version":4}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:6eac47401d8d5412c9ba0f4b49a91d57b687ddaaf746405c286c5334791aa486","sha256:f28eec28e7f15fc3f53d172b018e378797c374d7ff44768828efbdfddb269058"],"state_sha256":"40c9b05c64a40b57c0da28eb543475da2f3762232fcd29bf62a328ce9f469a54"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"GnauTAG1Nd0f1MnmC9Hg3NKEXJBKY+wclR+u4ANot398mxtKcqBGenktg+1iMV1sA019XIUW2m5B1SYuD2ezBg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-08T08:18:16.910651Z","bundle_sha256":"9178ba78cfe1d076da08ab95b8cfe85adefee1cd32622006727d6a0e7e588599"}}