{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:DRZRUHG26N6RUOMERTHHVR3BTN","short_pith_number":"pith:DRZRUHG2","schema_version":"1.0","canonical_sha256":"1c731a1cdaf37d1a39848cce7ac7619b5d067ad8e3bf1808c9194bf45f7bb2a9","source":{"kind":"arxiv","id":"1903.03773","version":2},"attestation_state":"computed","paper":{"title":"Timed Systems through the Lens of Logic","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.LO","authors_text":"Paul Gastin, S. Akshay, Shankara Narayanan Krishna, Vincent Juge","submitted_at":"2019-03-09T10:03:07Z","abstract_excerpt":"In this paper, we analyze timed systems with data structures, using a rich interplay of logic and properties of graphs. We start by describing behaviors of timed systems using graphs with timing constraints. Such a graph is called realizable if we can assign time-stamps to nodes or events so that they are consistent with the timing constraints. The logical definability of several graph properties has been a challenging problem, and we show, using a highly non-trivial argument, that the realizability property for collections of graphs with strict timing constraints is logically definable in a c"},"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.03773","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","primary_cat":"cs.LO","submitted_at":"2019-03-09T10:03:07Z","cross_cats_sorted":[],"title_canon_sha256":"2635cf4b67099eec3467c8e0781f1f1a419a5850fee062f0a9bfc8dda0792117","abstract_canon_sha256":"890c9b634b17d125ee0e7b708279141a433d12f6996a0e655b6058544807696f"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:47:39.318088Z","signature_b64":"MNFs11rq8+V2RUcYSM7TWvVu0PlWLeLc3p8laNo5FjVzEXbkMcmRgFxrmihKfkBnicbKjKsEquP8kqEzHC47AQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1c731a1cdaf37d1a39848cce7ac7619b5d067ad8e3bf1808c9194bf45f7bb2a9","last_reissued_at":"2026-05-17T23:47:39.317476Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:47:39.317476Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Timed Systems through the Lens of Logic","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.LO","authors_text":"Paul Gastin, S. Akshay, Shankara Narayanan Krishna, Vincent Juge","submitted_at":"2019-03-09T10:03:07Z","abstract_excerpt":"In this paper, we analyze timed systems with data structures, using a rich interplay of logic and properties of graphs. We start by describing behaviors of timed systems using graphs with timing constraints. Such a graph is called realizable if we can assign time-stamps to nodes or events so that they are consistent with the timing constraints. The logical definability of several graph properties has been a challenging problem, and we show, using a highly non-trivial argument, that the realizability property for collections of graphs with strict timing constraints is logically definable in a c"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1903.03773","kind":"arxiv","version":2},"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.03773","created_at":"2026-05-17T23:47:39.317560+00:00"},{"alias_kind":"arxiv_version","alias_value":"1903.03773v2","created_at":"2026-05-17T23:47:39.317560+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1903.03773","created_at":"2026-05-17T23:47:39.317560+00:00"},{"alias_kind":"pith_short_12","alias_value":"DRZRUHG26N6R","created_at":"2026-05-18T12:33:15.570797+00:00"},{"alias_kind":"pith_short_16","alias_value":"DRZRUHG26N6RUOME","created_at":"2026-05-18T12:33:15.570797+00:00"},{"alias_kind":"pith_short_8","alias_value":"DRZRUHG2","created_at":"2026-05-18T12:33:15.570797+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/DRZRUHG26N6RUOMERTHHVR3BTN","json":"https://pith.science/pith/DRZRUHG26N6RUOMERTHHVR3BTN.json","graph_json":"https://pith.science/api/pith-number/DRZRUHG26N6RUOMERTHHVR3BTN/graph.json","events_json":"https://pith.science/api/pith-number/DRZRUHG26N6RUOMERTHHVR3BTN/events.json","paper":"https://pith.science/paper/DRZRUHG2"},"agent_actions":{"view_html":"https://pith.science/pith/DRZRUHG26N6RUOMERTHHVR3BTN","download_json":"https://pith.science/pith/DRZRUHG26N6RUOMERTHHVR3BTN.json","view_paper":"https://pith.science/paper/DRZRUHG2","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1903.03773&json=true","fetch_graph":"https://pith.science/api/pith-number/DRZRUHG26N6RUOMERTHHVR3BTN/graph.json","fetch_events":"https://pith.science/api/pith-number/DRZRUHG26N6RUOMERTHHVR3BTN/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/DRZRUHG26N6RUOMERTHHVR3BTN/action/timestamp_anchor","attest_storage":"https://pith.science/pith/DRZRUHG26N6RUOMERTHHVR3BTN/action/storage_attestation","attest_author":"https://pith.science/pith/DRZRUHG26N6RUOMERTHHVR3BTN/action/author_attestation","sign_citation":"https://pith.science/pith/DRZRUHG26N6RUOMERTHHVR3BTN/action/citation_signature","submit_replication":"https://pith.science/pith/DRZRUHG26N6RUOMERTHHVR3BTN/action/replication_record"}},"created_at":"2026-05-17T23:47:39.317560+00:00","updated_at":"2026-05-17T23:47:39.317560+00:00"}