{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:S7QJFII5VQJGZS7B6IEUH4SQCP","short_pith_number":"pith:S7QJFII5","canonical_record":{"source":{"id":"1902.05604","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","primary_cat":"cs.FL","submitted_at":"2019-02-14T21:05:18Z","cross_cats_sorted":[],"title_canon_sha256":"a2ec1084e79c4d50f2282dbd31076784275a62f1a0cf50226c3af88acda2292a","abstract_canon_sha256":"2c8104225beda4a45d40bf2bc0eb80e326a6bbba1ce01db0db66fda947054bff"},"schema_version":"1.0"},"canonical_sha256":"97e092a11dac126ccbe1f20943f25013caed0707db4cd84895d1b25c0db2db12","source":{"kind":"arxiv","id":"1902.05604","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1902.05604","created_at":"2026-05-17T23:53:56Z"},{"alias_kind":"arxiv_version","alias_value":"1902.05604v1","created_at":"2026-05-17T23:53:56Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1902.05604","created_at":"2026-05-17T23:53:56Z"},{"alias_kind":"pith_short_12","alias_value":"S7QJFII5VQJG","created_at":"2026-05-18T12:33:27Z"},{"alias_kind":"pith_short_16","alias_value":"S7QJFII5VQJGZS7B","created_at":"2026-05-18T12:33:27Z"},{"alias_kind":"pith_short_8","alias_value":"S7QJFII5","created_at":"2026-05-18T12:33:27Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:S7QJFII5VQJGZS7B6IEUH4SQCP","target":"record","payload":{"canonical_record":{"source":{"id":"1902.05604","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","primary_cat":"cs.FL","submitted_at":"2019-02-14T21:05:18Z","cross_cats_sorted":[],"title_canon_sha256":"a2ec1084e79c4d50f2282dbd31076784275a62f1a0cf50226c3af88acda2292a","abstract_canon_sha256":"2c8104225beda4a45d40bf2bc0eb80e326a6bbba1ce01db0db66fda947054bff"},"schema_version":"1.0"},"canonical_sha256":"97e092a11dac126ccbe1f20943f25013caed0707db4cd84895d1b25c0db2db12","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:53:56.812065Z","signature_b64":"zZJUDpQ2OdQUaXQNg5OtrDe/Mp5l383WXH/WsuoRD+6KlWZ9JhzoIFkkJJmxIhUXdijc29E0X/c8+cpppDBKCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"97e092a11dac126ccbe1f20943f25013caed0707db4cd84895d1b25c0db2db12","last_reissued_at":"2026-05-17T23:53:56.811457Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:53:56.811457Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1902.05604","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-17T23:53:56Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"6UGESGEbLB8eP8Qo6pJ537pGPpCh1ioBSmB02b16a0RYMmhydPMzhTHGWvc5L6XdbACw3UrBxnTWz7511pO5AA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-21T22:10:27.210416Z"},"content_sha256":"3f01b5e4b6658ac0cf7949bd28b02c55d90151393676f32e02f46371d39ec2fb","schema_version":"1.0","event_id":"sha256:3f01b5e4b6658ac0cf7949bd28b02c55d90151393676f32e02f46371d39ec2fb"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:S7QJFII5VQJGZS7B6IEUH4SQCP","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Continuous Reachability for Unordered Data Petri nets is in PTime","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.FL","authors_text":"Piotr Hofman, Preey Shah, S. Akshay, Utkarsh Gupta","submitted_at":"2019-02-14T21:05:18Z","abstract_excerpt":"Unordered data Petri nets (UDPN) are an extension of classical Petri nets with tokens that carry data from an infinite domain and where transitions may check equality and disequality of tokens. UDPN are well-structured, so the coverability and termination problems are decidable, but with higher complexity than for Petri nets. On the other hand, the problem of reachability for UDPN is surprisingly complex, and its decidability status remains open. In this paper, we consider the continuous reachability problem for UDPN, which can be seen as an over-approximation of the reachability problem. Our "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1902.05604","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-17T23:53:56Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Ed9oRchz62WlJD61HFapbOGLp4g+PbqJkVVy1imF4CB2RpJl7yPnuPJXsbFU50NnFzVYCjN+0LezTM+mJe7cAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-21T22:10:27.210768Z"},"content_sha256":"d0d551d7be33dc9f2060c8fcde6aff42bfae8bbefab8415fd6cc75b39973639b","schema_version":"1.0","event_id":"sha256:d0d551d7be33dc9f2060c8fcde6aff42bfae8bbefab8415fd6cc75b39973639b"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/S7QJFII5VQJGZS7B6IEUH4SQCP/bundle.json","state_url":"https://pith.science/pith/S7QJFII5VQJGZS7B6IEUH4SQCP/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/S7QJFII5VQJGZS7B6IEUH4SQCP/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-21T22:10:27Z","links":{"resolver":"https://pith.science/pith/S7QJFII5VQJGZS7B6IEUH4SQCP","bundle":"https://pith.science/pith/S7QJFII5VQJGZS7B6IEUH4SQCP/bundle.json","state":"https://pith.science/pith/S7QJFII5VQJGZS7B6IEUH4SQCP/state.json","well_known_bundle":"https://pith.science/.well-known/pith/S7QJFII5VQJGZS7B6IEUH4SQCP/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:S7QJFII5VQJGZS7B6IEUH4SQCP","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":"2c8104225beda4a45d40bf2bc0eb80e326a6bbba1ce01db0db66fda947054bff","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","primary_cat":"cs.FL","submitted_at":"2019-02-14T21:05:18Z","title_canon_sha256":"a2ec1084e79c4d50f2282dbd31076784275a62f1a0cf50226c3af88acda2292a"},"schema_version":"1.0","source":{"id":"1902.05604","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1902.05604","created_at":"2026-05-17T23:53:56Z"},{"alias_kind":"arxiv_version","alias_value":"1902.05604v1","created_at":"2026-05-17T23:53:56Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1902.05604","created_at":"2026-05-17T23:53:56Z"},{"alias_kind":"pith_short_12","alias_value":"S7QJFII5VQJG","created_at":"2026-05-18T12:33:27Z"},{"alias_kind":"pith_short_16","alias_value":"S7QJFII5VQJGZS7B","created_at":"2026-05-18T12:33:27Z"},{"alias_kind":"pith_short_8","alias_value":"S7QJFII5","created_at":"2026-05-18T12:33:27Z"}],"graph_snapshots":[{"event_id":"sha256:d0d551d7be33dc9f2060c8fcde6aff42bfae8bbefab8415fd6cc75b39973639b","target":"graph","created_at":"2026-05-17T23:53:56Z","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":"Unordered data Petri nets (UDPN) are an extension of classical Petri nets with tokens that carry data from an infinite domain and where transitions may check equality and disequality of tokens. UDPN are well-structured, so the coverability and termination problems are decidable, but with higher complexity than for Petri nets. On the other hand, the problem of reachability for UDPN is surprisingly complex, and its decidability status remains open. In this paper, we consider the continuous reachability problem for UDPN, which can be seen as an over-approximation of the reachability problem. Our ","authors_text":"Piotr Hofman, Preey Shah, S. Akshay, Utkarsh Gupta","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","primary_cat":"cs.FL","submitted_at":"2019-02-14T21:05:18Z","title":"Continuous Reachability for Unordered Data Petri nets is in PTime"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1902.05604","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:3f01b5e4b6658ac0cf7949bd28b02c55d90151393676f32e02f46371d39ec2fb","target":"record","created_at":"2026-05-17T23:53:56Z","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":"2c8104225beda4a45d40bf2bc0eb80e326a6bbba1ce01db0db66fda947054bff","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","primary_cat":"cs.FL","submitted_at":"2019-02-14T21:05:18Z","title_canon_sha256":"a2ec1084e79c4d50f2282dbd31076784275a62f1a0cf50226c3af88acda2292a"},"schema_version":"1.0","source":{"id":"1902.05604","kind":"arxiv","version":1}},"canonical_sha256":"97e092a11dac126ccbe1f20943f25013caed0707db4cd84895d1b25c0db2db12","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"97e092a11dac126ccbe1f20943f25013caed0707db4cd84895d1b25c0db2db12","first_computed_at":"2026-05-17T23:53:56.811457Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:53:56.811457Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"zZJUDpQ2OdQUaXQNg5OtrDe/Mp5l383WXH/WsuoRD+6KlWZ9JhzoIFkkJJmxIhUXdijc29E0X/c8+cpppDBKCg==","signature_status":"signed_v1","signed_at":"2026-05-17T23:53:56.812065Z","signed_message":"canonical_sha256_bytes"},"source_id":"1902.05604","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:3f01b5e4b6658ac0cf7949bd28b02c55d90151393676f32e02f46371d39ec2fb","sha256:d0d551d7be33dc9f2060c8fcde6aff42bfae8bbefab8415fd6cc75b39973639b"],"state_sha256":"3557ecc02027dd097482c9a4d825766e4d52ad8a3c2e6d2e27af641cc8013beb"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"towV20MXJos2NGdUqmxf448ug9l+WGk6C03T9heCXTT4A4L9oKURnXqK52CmYakSAfAZk7bZ7edtUVRpzR5iAw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-21T22:10:27.212772Z","bundle_sha256":"102d01f5bd302c5afe3e29ff824894f65283e1de472eae17d1516ee43321f73b"}}