{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:U233YRXOTL34MPVHJBOP5G54C6","short_pith_number":"pith:U233YRXO","schema_version":"1.0","canonical_sha256":"a6b7bc46ee9af7c63ea7485cfe9bbc17b7921fe492312aaa9ce3520b9728aba8","source":{"kind":"arxiv","id":"1409.2778","version":1},"attestation_state":"computed","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"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1409.2778","created_at":"2026-05-18T02:43:09.813968+00:00"},{"alias_kind":"arxiv_version","alias_value":"1409.2778v1","created_at":"2026-05-18T02:43:09.813968+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1409.2778","created_at":"2026-05-18T02:43:09.813968+00:00"},{"alias_kind":"pith_short_12","alias_value":"U233YRXOTL34","created_at":"2026-05-18T12:28:52.271510+00:00"},{"alias_kind":"pith_short_16","alias_value":"U233YRXOTL34MPVH","created_at":"2026-05-18T12:28:52.271510+00:00"},{"alias_kind":"pith_short_8","alias_value":"U233YRXO","created_at":"2026-05-18T12:28:52.271510+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/U233YRXOTL34MPVHJBOP5G54C6","json":"https://pith.science/pith/U233YRXOTL34MPVHJBOP5G54C6.json","graph_json":"https://pith.science/api/pith-number/U233YRXOTL34MPVHJBOP5G54C6/graph.json","events_json":"https://pith.science/api/pith-number/U233YRXOTL34MPVHJBOP5G54C6/events.json","paper":"https://pith.science/paper/U233YRXO"},"agent_actions":{"view_html":"https://pith.science/pith/U233YRXOTL34MPVHJBOP5G54C6","download_json":"https://pith.science/pith/U233YRXOTL34MPVHJBOP5G54C6.json","view_paper":"https://pith.science/paper/U233YRXO","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1409.2778&json=true","fetch_graph":"https://pith.science/api/pith-number/U233YRXOTL34MPVHJBOP5G54C6/graph.json","fetch_events":"https://pith.science/api/pith-number/U233YRXOTL34MPVHJBOP5G54C6/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/U233YRXOTL34MPVHJBOP5G54C6/action/timestamp_anchor","attest_storage":"https://pith.science/pith/U233YRXOTL34MPVHJBOP5G54C6/action/storage_attestation","attest_author":"https://pith.science/pith/U233YRXOTL34MPVHJBOP5G54C6/action/author_attestation","sign_citation":"https://pith.science/pith/U233YRXOTL34MPVHJBOP5G54C6/action/citation_signature","submit_replication":"https://pith.science/pith/U233YRXOTL34MPVHJBOP5G54C6/action/replication_record"}},"created_at":"2026-05-18T02:43:09.813968+00:00","updated_at":"2026-05-18T02:43:09.813968+00:00"}