{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:RLRJPBY75R762VJ3CPLQ34BERG","short_pith_number":"pith:RLRJPBY7","schema_version":"1.0","canonical_sha256":"8ae297871fec7fed553b13d70df024899544a6acaa40ea596b6d40e2bbba13cc","source":{"kind":"arxiv","id":"1602.04294","version":1},"attestation_state":"computed","paper":{"title":"Time Window Temporal Logic","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LO"],"primary_cat":"cs.FL","authors_text":"Calin Belta, Cristian-Ioan Vasile, Derya Aksaray","submitted_at":"2016-02-13T07:10:59Z","abstract_excerpt":"This paper introduces time window temporal logic (TWTL), a rich expressivity language for describing various time bounded specifications. In particular, the syntax and semantics of TWTL enable the compact representation of serial tasks, which are typically seen in robotics and control applications. This paper also discusses the relaxation of TWTL formulae with respect to deadlines of tasks. Efficient automata-based frameworks to solve synthesis, verification and learning problems are also presented. The key ingredient to the presented solution is an algorithm to translate a TWTL formula to an "},"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":"1602.04294","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.FL","submitted_at":"2016-02-13T07:10:59Z","cross_cats_sorted":["cs.LO"],"title_canon_sha256":"3712e3c621ca78edb866630a1a59b48ba88d1addd2b75298397309361870e9f1","abstract_canon_sha256":"b5715ecc6484293fac116dd2d3f4860d36ff815fa0178fac6f8fb045fe590ee1"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:20:51.294351Z","signature_b64":"FCOpxFD0Nw1tsKCbvsaQpSMqY59KFY84jCTYcL11WHOUoc5v8dY/17SqFr3m6q7N2GhncoV4uV44EEnSiZ3YCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8ae297871fec7fed553b13d70df024899544a6acaa40ea596b6d40e2bbba13cc","last_reissued_at":"2026-05-18T01:20:51.293832Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:20:51.293832Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Time Window Temporal Logic","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LO"],"primary_cat":"cs.FL","authors_text":"Calin Belta, Cristian-Ioan Vasile, Derya Aksaray","submitted_at":"2016-02-13T07:10:59Z","abstract_excerpt":"This paper introduces time window temporal logic (TWTL), a rich expressivity language for describing various time bounded specifications. In particular, the syntax and semantics of TWTL enable the compact representation of serial tasks, which are typically seen in robotics and control applications. This paper also discusses the relaxation of TWTL formulae with respect to deadlines of tasks. Efficient automata-based frameworks to solve synthesis, verification and learning problems are also presented. The key ingredient to the presented solution is an algorithm to translate a TWTL formula to an "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1602.04294","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":"1602.04294","created_at":"2026-05-18T01:20:51.293910+00:00"},{"alias_kind":"arxiv_version","alias_value":"1602.04294v1","created_at":"2026-05-18T01:20:51.293910+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1602.04294","created_at":"2026-05-18T01:20:51.293910+00:00"},{"alias_kind":"pith_short_12","alias_value":"RLRJPBY75R76","created_at":"2026-05-18T12:30:41.710351+00:00"},{"alias_kind":"pith_short_16","alias_value":"RLRJPBY75R762VJ3","created_at":"2026-05-18T12:30:41.710351+00:00"},{"alias_kind":"pith_short_8","alias_value":"RLRJPBY7","created_at":"2026-05-18T12:30:41.710351+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/RLRJPBY75R762VJ3CPLQ34BERG","json":"https://pith.science/pith/RLRJPBY75R762VJ3CPLQ34BERG.json","graph_json":"https://pith.science/api/pith-number/RLRJPBY75R762VJ3CPLQ34BERG/graph.json","events_json":"https://pith.science/api/pith-number/RLRJPBY75R762VJ3CPLQ34BERG/events.json","paper":"https://pith.science/paper/RLRJPBY7"},"agent_actions":{"view_html":"https://pith.science/pith/RLRJPBY75R762VJ3CPLQ34BERG","download_json":"https://pith.science/pith/RLRJPBY75R762VJ3CPLQ34BERG.json","view_paper":"https://pith.science/paper/RLRJPBY7","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1602.04294&json=true","fetch_graph":"https://pith.science/api/pith-number/RLRJPBY75R762VJ3CPLQ34BERG/graph.json","fetch_events":"https://pith.science/api/pith-number/RLRJPBY75R762VJ3CPLQ34BERG/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/RLRJPBY75R762VJ3CPLQ34BERG/action/timestamp_anchor","attest_storage":"https://pith.science/pith/RLRJPBY75R762VJ3CPLQ34BERG/action/storage_attestation","attest_author":"https://pith.science/pith/RLRJPBY75R762VJ3CPLQ34BERG/action/author_attestation","sign_citation":"https://pith.science/pith/RLRJPBY75R762VJ3CPLQ34BERG/action/citation_signature","submit_replication":"https://pith.science/pith/RLRJPBY75R762VJ3CPLQ34BERG/action/replication_record"}},"created_at":"2026-05-18T01:20:51.293910+00:00","updated_at":"2026-05-18T01:20:51.293910+00:00"}