{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:P3RFAWMC7ZPALTVH3KUUYYVXOO","short_pith_number":"pith:P3RFAWMC","canonical_record":{"source":{"id":"1806.08170","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LO","submitted_at":"2018-06-21T11:12:10Z","cross_cats_sorted":[],"title_canon_sha256":"62637e1f29966399892c5b233e55c235fa8df36600b303249469749380e78a89","abstract_canon_sha256":"4945635050fd7444b5965bee084e35d2e0a6be6dc503963f280e20b80ee0b7c3"},"schema_version":"1.0"},"canonical_sha256":"7ee2505982fe5e05cea7daa94c62b773be7e6a23e2c93284062449622d32d326","source":{"kind":"arxiv","id":"1806.08170","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1806.08170","created_at":"2026-05-18T00:12:41Z"},{"alias_kind":"arxiv_version","alias_value":"1806.08170v1","created_at":"2026-05-18T00:12:41Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1806.08170","created_at":"2026-05-18T00:12:41Z"},{"alias_kind":"pith_short_12","alias_value":"P3RFAWMC7ZPA","created_at":"2026-05-18T12:32:43Z"},{"alias_kind":"pith_short_16","alias_value":"P3RFAWMC7ZPALTVH","created_at":"2026-05-18T12:32:43Z"},{"alias_kind":"pith_short_8","alias_value":"P3RFAWMC","created_at":"2026-05-18T12:32:43Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:P3RFAWMC7ZPALTVH3KUUYYVXOO","target":"record","payload":{"canonical_record":{"source":{"id":"1806.08170","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LO","submitted_at":"2018-06-21T11:12:10Z","cross_cats_sorted":[],"title_canon_sha256":"62637e1f29966399892c5b233e55c235fa8df36600b303249469749380e78a89","abstract_canon_sha256":"4945635050fd7444b5965bee084e35d2e0a6be6dc503963f280e20b80ee0b7c3"},"schema_version":"1.0"},"canonical_sha256":"7ee2505982fe5e05cea7daa94c62b773be7e6a23e2c93284062449622d32d326","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:12:41.803083Z","signature_b64":"WVGIoZNchRniNFzJxh/XIt6bGTBHnvBHn11CJ7Brt5WAOAQ6dm+LtGMh2XMv+97InWQz9lYLPPDr6DWUWF1UDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"7ee2505982fe5e05cea7daa94c62b773be7e6a23e2c93284062449622d32d326","last_reissued_at":"2026-05-18T00:12:41.802573Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:12:41.802573Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1806.08170","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-18T00:12:41Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"/ER5q/Xlwl3ZOzWjBVPqcMfT4PjYks7zuHQDTV7Az7jpLF2IL0BKXDAo1nq8P42nL8q+ioAyCC0rSW2Z39OsCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T11:50:49.751168Z"},"content_sha256":"b1c52a15e18effc1ae38b7c43769920c5de755bb51c666318b6c8d4f09f539f3","schema_version":"1.0","event_id":"sha256:b1c52a15e18effc1ae38b7c43769920c5de755bb51c666318b6c8d4f09f539f3"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:P3RFAWMC7ZPALTVH3KUUYYVXOO","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Universal Safety for Timed Petri Nets is PSPACE-complete","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.LO","authors_text":"Mohamed Faouzi Atig, Parosh Aziz Abdulla, Patrick Totzke, Radu Ciobanu, Richard Mayr","submitted_at":"2018-06-21T11:12:10Z","abstract_excerpt":"A timed network consists of an arbitrary number of initially identical 1-clock timed automata, interacting via hand-shake communication. In this setting there is no unique central controller, since all automata are initially identical. We consider the universal safety problem for such controller-less timed networks, i.e., verifying that a bad event (enabling some given transition) is impossible regardless of the size of the network.\n  This universal safety problem is dual to the existential coverability problem for timed-arc Petri nets, i.e., does there exist a number $m$ of tokens, such that "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1806.08170","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-18T00:12:41Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Iz7p9nVZwGBydEgBeuK8SN2UocXzFW0/gH7oLA2HIqap0/9Z7pjsvR4JgeynJvDFoJ8Tq1Q5aBMhIWVhy4sODA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T11:50:49.751570Z"},"content_sha256":"212131c23fb81d0aab5d07abf021b1433cc3e92474d92ba9af1d3c1de4deebae","schema_version":"1.0","event_id":"sha256:212131c23fb81d0aab5d07abf021b1433cc3e92474d92ba9af1d3c1de4deebae"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/P3RFAWMC7ZPALTVH3KUUYYVXOO/bundle.json","state_url":"https://pith.science/pith/P3RFAWMC7ZPALTVH3KUUYYVXOO/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/P3RFAWMC7ZPALTVH3KUUYYVXOO/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-05-27T11:50:49Z","links":{"resolver":"https://pith.science/pith/P3RFAWMC7ZPALTVH3KUUYYVXOO","bundle":"https://pith.science/pith/P3RFAWMC7ZPALTVH3KUUYYVXOO/bundle.json","state":"https://pith.science/pith/P3RFAWMC7ZPALTVH3KUUYYVXOO/state.json","well_known_bundle":"https://pith.science/.well-known/pith/P3RFAWMC7ZPALTVH3KUUYYVXOO/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:P3RFAWMC7ZPALTVH3KUUYYVXOO","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":"4945635050fd7444b5965bee084e35d2e0a6be6dc503963f280e20b80ee0b7c3","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LO","submitted_at":"2018-06-21T11:12:10Z","title_canon_sha256":"62637e1f29966399892c5b233e55c235fa8df36600b303249469749380e78a89"},"schema_version":"1.0","source":{"id":"1806.08170","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1806.08170","created_at":"2026-05-18T00:12:41Z"},{"alias_kind":"arxiv_version","alias_value":"1806.08170v1","created_at":"2026-05-18T00:12:41Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1806.08170","created_at":"2026-05-18T00:12:41Z"},{"alias_kind":"pith_short_12","alias_value":"P3RFAWMC7ZPA","created_at":"2026-05-18T12:32:43Z"},{"alias_kind":"pith_short_16","alias_value":"P3RFAWMC7ZPALTVH","created_at":"2026-05-18T12:32:43Z"},{"alias_kind":"pith_short_8","alias_value":"P3RFAWMC","created_at":"2026-05-18T12:32:43Z"}],"graph_snapshots":[{"event_id":"sha256:212131c23fb81d0aab5d07abf021b1433cc3e92474d92ba9af1d3c1de4deebae","target":"graph","created_at":"2026-05-18T00:12:41Z","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":"A timed network consists of an arbitrary number of initially identical 1-clock timed automata, interacting via hand-shake communication. In this setting there is no unique central controller, since all automata are initially identical. We consider the universal safety problem for such controller-less timed networks, i.e., verifying that a bad event (enabling some given transition) is impossible regardless of the size of the network.\n  This universal safety problem is dual to the existential coverability problem for timed-arc Petri nets, i.e., does there exist a number $m$ of tokens, such that ","authors_text":"Mohamed Faouzi Atig, Parosh Aziz Abdulla, Patrick Totzke, Radu Ciobanu, Richard Mayr","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LO","submitted_at":"2018-06-21T11:12:10Z","title":"Universal Safety for Timed Petri Nets is PSPACE-complete"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1806.08170","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:b1c52a15e18effc1ae38b7c43769920c5de755bb51c666318b6c8d4f09f539f3","target":"record","created_at":"2026-05-18T00:12:41Z","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":"4945635050fd7444b5965bee084e35d2e0a6be6dc503963f280e20b80ee0b7c3","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LO","submitted_at":"2018-06-21T11:12:10Z","title_canon_sha256":"62637e1f29966399892c5b233e55c235fa8df36600b303249469749380e78a89"},"schema_version":"1.0","source":{"id":"1806.08170","kind":"arxiv","version":1}},"canonical_sha256":"7ee2505982fe5e05cea7daa94c62b773be7e6a23e2c93284062449622d32d326","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"7ee2505982fe5e05cea7daa94c62b773be7e6a23e2c93284062449622d32d326","first_computed_at":"2026-05-18T00:12:41.802573Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:12:41.802573Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"WVGIoZNchRniNFzJxh/XIt6bGTBHnvBHn11CJ7Brt5WAOAQ6dm+LtGMh2XMv+97InWQz9lYLPPDr6DWUWF1UDA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:12:41.803083Z","signed_message":"canonical_sha256_bytes"},"source_id":"1806.08170","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:b1c52a15e18effc1ae38b7c43769920c5de755bb51c666318b6c8d4f09f539f3","sha256:212131c23fb81d0aab5d07abf021b1433cc3e92474d92ba9af1d3c1de4deebae"],"state_sha256":"d5fb89185b12b6f8e538aed7f92761f8fc27cb0d1c425376d17c46316441f600"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"tLMr4SOlbv2W1WSxSZP8WFpdEne73XIoBbXtIbKL4KsHO5F9dA4rZgD3HucLriml9EIjXX19GMz8bXbL0YL3CA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-27T11:50:49.753743Z","bundle_sha256":"8083b63cfc687e21946c256aa4679ce5a8762454fd5db3c272b2f5fea4ca8cff"}}