{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:U233YRXOTL34MPVHJBOP5G54C6","short_pith_number":"pith:U233YRXO","canonical_record":{"source":{"id":"1409.2778","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2014-09-09T15:31:00Z","cross_cats_sorted":["cs.SE"],"title_canon_sha256":"5c20e34b4f59024117e98cae77f647d8e01e2db72650dcf200946462e33173ff","abstract_canon_sha256":"e5f02c03af33ba334e3ed447ae0a67d964ea1d62b33cc3985ebd2fc9acb8309a"},"schema_version":"1.0"},"canonical_sha256":"a6b7bc46ee9af7c63ea7485cfe9bbc17b7921fe492312aaa9ce3520b9728aba8","source":{"kind":"arxiv","id":"1409.2778","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1409.2778","created_at":"2026-05-18T02:43:09Z"},{"alias_kind":"arxiv_version","alias_value":"1409.2778v1","created_at":"2026-05-18T02:43:09Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1409.2778","created_at":"2026-05-18T02:43:09Z"},{"alias_kind":"pith_short_12","alias_value":"U233YRXOTL34","created_at":"2026-05-18T12:28:52Z"},{"alias_kind":"pith_short_16","alias_value":"U233YRXOTL34MPVH","created_at":"2026-05-18T12:28:52Z"},{"alias_kind":"pith_short_8","alias_value":"U233YRXO","created_at":"2026-05-18T12:28:52Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:U233YRXOTL34MPVHJBOP5G54C6","target":"record","payload":{"canonical_record":{"source":{"id":"1409.2778","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2014-09-09T15:31:00Z","cross_cats_sorted":["cs.SE"],"title_canon_sha256":"5c20e34b4f59024117e98cae77f647d8e01e2db72650dcf200946462e33173ff","abstract_canon_sha256":"e5f02c03af33ba334e3ed447ae0a67d964ea1d62b33cc3985ebd2fc9acb8309a"},"schema_version":"1.0"},"canonical_sha256":"a6b7bc46ee9af7c63ea7485cfe9bbc17b7921fe492312aaa9ce3520b9728aba8","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:43:09.814457Z","signature_b64":"eDtWQJAZnBjtvWKq90O1U5u4cbidYbHOpaKEGU8u1xRHWi2Btb0TO2iPK4CXSnq7Ub7SAbPdInAeTnbTOYUxCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a6b7bc46ee9af7c63ea7485cfe9bbc17b7921fe492312aaa9ce3520b9728aba8","last_reissued_at":"2026-05-18T02:43:09.813873Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:43:09.813873Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1409.2778","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-18T02:43:09Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"VXtMzeUp53G6dToilzmGIBNMYgj4aAdnFrQoSOpH/RNF7/nqW5WK9Er3PzCx+P93htrnWvxIDmvWO55lKiOSDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T17:51:06.787784Z"},"content_sha256":"286af845a3d63f985dd4c34aed68810d0d0e763554923c06d8f31120285766d0","schema_version":"1.0","event_id":"sha256:286af845a3d63f985dd4c34aed68810d0d0e763554923c06d8f31120285766d0"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:U233YRXOTL34MPVHJBOP5G54C6","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Verification of Reachability Problems for Time Basic Petri Nets","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.SE"],"primary_cat":"cs.LO","authors_text":"Matteo Camilli","submitted_at":"2014-09-09T15:31:00Z","abstract_excerpt":"Time-Basic Petri nets, is a powerful formalism for model- ing real-time systems where time constraints are expressed through time functions of marking's time description associated with transition, representing possible firing times. We introduce a technique for reachability analysis based on the building of finite contraction of the infinite state space associated with such a models. The technique constructs a finite symbolic reachability graph relying on a sort of time coverage, and over- comes the limitations of the existing available analyzers for Time-Basic nets, based in turn on a time-b"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1409.2778","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-18T02:43:09Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Yt9WdyrWOz6fBzE0zG+IVimRqh4v74aciMn2Op4AsQ03wkCFi0vbCrEwgbD5fspiZrsMGG5f+raOecroUobuAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T17:51:06.788137Z"},"content_sha256":"f7d7807edd15689a14b84bfe1d1087d415e7ab71f2e84c684735c79d63b206a1","schema_version":"1.0","event_id":"sha256:f7d7807edd15689a14b84bfe1d1087d415e7ab71f2e84c684735c79d63b206a1"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/U233YRXOTL34MPVHJBOP5G54C6/bundle.json","state_url":"https://pith.science/pith/U233YRXOTL34MPVHJBOP5G54C6/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/U233YRXOTL34MPVHJBOP5G54C6/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-01T17:51:06Z","links":{"resolver":"https://pith.science/pith/U233YRXOTL34MPVHJBOP5G54C6","bundle":"https://pith.science/pith/U233YRXOTL34MPVHJBOP5G54C6/bundle.json","state":"https://pith.science/pith/U233YRXOTL34MPVHJBOP5G54C6/state.json","well_known_bundle":"https://pith.science/.well-known/pith/U233YRXOTL34MPVHJBOP5G54C6/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:U233YRXOTL34MPVHJBOP5G54C6","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":"e5f02c03af33ba334e3ed447ae0a67d964ea1d62b33cc3985ebd2fc9acb8309a","cross_cats_sorted":["cs.SE"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2014-09-09T15:31:00Z","title_canon_sha256":"5c20e34b4f59024117e98cae77f647d8e01e2db72650dcf200946462e33173ff"},"schema_version":"1.0","source":{"id":"1409.2778","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1409.2778","created_at":"2026-05-18T02:43:09Z"},{"alias_kind":"arxiv_version","alias_value":"1409.2778v1","created_at":"2026-05-18T02:43:09Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1409.2778","created_at":"2026-05-18T02:43:09Z"},{"alias_kind":"pith_short_12","alias_value":"U233YRXOTL34","created_at":"2026-05-18T12:28:52Z"},{"alias_kind":"pith_short_16","alias_value":"U233YRXOTL34MPVH","created_at":"2026-05-18T12:28:52Z"},{"alias_kind":"pith_short_8","alias_value":"U233YRXO","created_at":"2026-05-18T12:28:52Z"}],"graph_snapshots":[{"event_id":"sha256:f7d7807edd15689a14b84bfe1d1087d415e7ab71f2e84c684735c79d63b206a1","target":"graph","created_at":"2026-05-18T02:43: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":"Time-Basic Petri nets, is a powerful formalism for model- ing real-time systems where time constraints are expressed through time functions of marking's time description associated with transition, representing possible firing times. We introduce a technique for reachability analysis based on the building of finite contraction of the infinite state space associated with such a models. The technique constructs a finite symbolic reachability graph relying on a sort of time coverage, and over- comes the limitations of the existing available analyzers for Time-Basic nets, based in turn on a time-b","authors_text":"Matteo Camilli","cross_cats":["cs.SE"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2014-09-09T15:31:00Z","title":"Verification of Reachability Problems for Time Basic Petri Nets"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1409.2778","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:286af845a3d63f985dd4c34aed68810d0d0e763554923c06d8f31120285766d0","target":"record","created_at":"2026-05-18T02:43: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":"e5f02c03af33ba334e3ed447ae0a67d964ea1d62b33cc3985ebd2fc9acb8309a","cross_cats_sorted":["cs.SE"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2014-09-09T15:31:00Z","title_canon_sha256":"5c20e34b4f59024117e98cae77f647d8e01e2db72650dcf200946462e33173ff"},"schema_version":"1.0","source":{"id":"1409.2778","kind":"arxiv","version":1}},"canonical_sha256":"a6b7bc46ee9af7c63ea7485cfe9bbc17b7921fe492312aaa9ce3520b9728aba8","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"a6b7bc46ee9af7c63ea7485cfe9bbc17b7921fe492312aaa9ce3520b9728aba8","first_computed_at":"2026-05-18T02:43:09.813873Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:43:09.813873Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"eDtWQJAZnBjtvWKq90O1U5u4cbidYbHOpaKEGU8u1xRHWi2Btb0TO2iPK4CXSnq7Ub7SAbPdInAeTnbTOYUxCg==","signature_status":"signed_v1","signed_at":"2026-05-18T02:43:09.814457Z","signed_message":"canonical_sha256_bytes"},"source_id":"1409.2778","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:286af845a3d63f985dd4c34aed68810d0d0e763554923c06d8f31120285766d0","sha256:f7d7807edd15689a14b84bfe1d1087d415e7ab71f2e84c684735c79d63b206a1"],"state_sha256":"2711047893c0c47fc5d91de834a1ef6629ce5c8777c4998d1ff783d85d0e953f"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"UHrYUu4JQDPoaihXtmode9Z24ivzW04Qo7nr9BNBd9WtcIwTARvdXTLT1g/myPncWTw7JE2EB16T19lX3wiYBg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-01T17:51:06.790122Z","bundle_sha256":"9855e8b060dc5da2108461125cfcd42321f2865a6eee7de12da10f531d4a50f8"}}