{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:M25THN5IRBCP7T7OXL7M2WARQZ","short_pith_number":"pith:M25THN5I","schema_version":"1.0","canonical_sha256":"66bb33b7a88844ffcfeebafecd58118655f90816adde6d14bdd703c3663d3830","source":{"kind":"arxiv","id":"1903.09773","version":1},"attestation_state":"computed","paper":{"title":"Effective Definability of the Reachability Relation in Timed Automata","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.FL","authors_text":"James Worrell, Karin Quaas, Mahsa Shirmohammadi, Martin Fr\\\"anzle","submitted_at":"2019-03-23T06:53:26Z","abstract_excerpt":"We give a new proof of the result of Comon and Jurski that the binary reachability relation of a timed automaton is definable in linear arithmetic."},"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":"1903.09773","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.FL","submitted_at":"2019-03-23T06:53:26Z","cross_cats_sorted":[],"title_canon_sha256":"9b682ed111f61a09d79faacc027909074a50051bc908590d425e0139668b2ed0","abstract_canon_sha256":"be572dbbfcda2810c3c8259d03ebeec55ba7fca8efeb929d46c7c2491dce78a6"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:50:35.558866Z","signature_b64":"bRhcodNvtOcFWnO2sQfwfPP+z8H0mxpB5Ozp6DAw/yPmNJp2JRde/a01dXqlPXD9gbZi5VhzPrrEztDGg2R8BA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"66bb33b7a88844ffcfeebafecd58118655f90816adde6d14bdd703c3663d3830","last_reissued_at":"2026-05-17T23:50:35.558114Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:50:35.558114Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Effective Definability of the Reachability Relation in Timed Automata","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.FL","authors_text":"James Worrell, Karin Quaas, Mahsa Shirmohammadi, Martin Fr\\\"anzle","submitted_at":"2019-03-23T06:53:26Z","abstract_excerpt":"We give a new proof of the result of Comon and Jurski that the binary reachability relation of a timed automaton is definable in linear arithmetic."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1903.09773","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":"1903.09773","created_at":"2026-05-17T23:50:35.558250+00:00"},{"alias_kind":"arxiv_version","alias_value":"1903.09773v1","created_at":"2026-05-17T23:50:35.558250+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1903.09773","created_at":"2026-05-17T23:50:35.558250+00:00"},{"alias_kind":"pith_short_12","alias_value":"M25THN5IRBCP","created_at":"2026-05-18T12:33:21.387695+00:00"},{"alias_kind":"pith_short_16","alias_value":"M25THN5IRBCP7T7O","created_at":"2026-05-18T12:33:21.387695+00:00"},{"alias_kind":"pith_short_8","alias_value":"M25THN5I","created_at":"2026-05-18T12:33:21.387695+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/M25THN5IRBCP7T7OXL7M2WARQZ","json":"https://pith.science/pith/M25THN5IRBCP7T7OXL7M2WARQZ.json","graph_json":"https://pith.science/api/pith-number/M25THN5IRBCP7T7OXL7M2WARQZ/graph.json","events_json":"https://pith.science/api/pith-number/M25THN5IRBCP7T7OXL7M2WARQZ/events.json","paper":"https://pith.science/paper/M25THN5I"},"agent_actions":{"view_html":"https://pith.science/pith/M25THN5IRBCP7T7OXL7M2WARQZ","download_json":"https://pith.science/pith/M25THN5IRBCP7T7OXL7M2WARQZ.json","view_paper":"https://pith.science/paper/M25THN5I","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1903.09773&json=true","fetch_graph":"https://pith.science/api/pith-number/M25THN5IRBCP7T7OXL7M2WARQZ/graph.json","fetch_events":"https://pith.science/api/pith-number/M25THN5IRBCP7T7OXL7M2WARQZ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/M25THN5IRBCP7T7OXL7M2WARQZ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/M25THN5IRBCP7T7OXL7M2WARQZ/action/storage_attestation","attest_author":"https://pith.science/pith/M25THN5IRBCP7T7OXL7M2WARQZ/action/author_attestation","sign_citation":"https://pith.science/pith/M25THN5IRBCP7T7OXL7M2WARQZ/action/citation_signature","submit_replication":"https://pith.science/pith/M25THN5IRBCP7T7OXL7M2WARQZ/action/replication_record"}},"created_at":"2026-05-17T23:50:35.558250+00:00","updated_at":"2026-05-17T23:50:35.558250+00:00"}