{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:EKTZ3N6YPISEMJFV2GTEGLBTAW","short_pith_number":"pith:EKTZ3N6Y","schema_version":"1.0","canonical_sha256":"22a79db7d87a244624b5d1a6432c330595bc116f1c76546686e77a19b3d70d67","source":{"kind":"arxiv","id":"1305.6137","version":3},"attestation_state":"computed","paper":{"title":"On the Decidability and Complexity of Some Fragments of Metric Temporal Logic","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LO","authors_text":"Khushraj Madnani, Paritosh K. Pandya, Shankara Narayanan Krishna","submitted_at":"2013-05-27T07:51:23Z","abstract_excerpt":"Metric Temporal Logic, $\\mtlfull$ is amongst the most studied real-time logics. It exhibits considerable diversity in expressiveness and decidability properties based on the permitted set of modalities and the nature of time interval constraints $I$. \\oomit{The classical results of Alur and Henzinger showed that $\\mtlfull$ is undecidable where as $\\mitl$ which uses only non-singular intervals $NS$ is decidable. In a surprizing result, Ouaknine and Worrell showed that the satisfiability of $\\mtl$ is decidable over finite pointwise models, albeit with NPR decision complexity, whereas it remains "},"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":"1305.6137","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2013-05-27T07:51:23Z","cross_cats_sorted":[],"title_canon_sha256":"b377d833d5affaebf3c1195dbc05cdee341fb097cbaba378462bdb22e7819276","abstract_canon_sha256":"9172126bf340987aef905c7443ffcf93778f60e83d5706ece2d486a0020c496e"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:06:04.857724Z","signature_b64":"t0D5h11o2JrRV1o0FqqNs04FhksfQJuCv02GOGX4UN3GIVhE6mYKVvn/aBByZCYPzLKWmB8fan0HFU0bFnQbBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"22a79db7d87a244624b5d1a6432c330595bc116f1c76546686e77a19b3d70d67","last_reissued_at":"2026-05-18T03:06:04.857232Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:06:04.857232Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On the Decidability and Complexity of Some Fragments of Metric Temporal Logic","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LO","authors_text":"Khushraj Madnani, Paritosh K. Pandya, Shankara Narayanan Krishna","submitted_at":"2013-05-27T07:51:23Z","abstract_excerpt":"Metric Temporal Logic, $\\mtlfull$ is amongst the most studied real-time logics. It exhibits considerable diversity in expressiveness and decidability properties based on the permitted set of modalities and the nature of time interval constraints $I$. \\oomit{The classical results of Alur and Henzinger showed that $\\mtlfull$ is undecidable where as $\\mitl$ which uses only non-singular intervals $NS$ is decidable. In a surprizing result, Ouaknine and Worrell showed that the satisfiability of $\\mtl$ is decidable over finite pointwise models, albeit with NPR decision complexity, whereas it remains "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1305.6137","kind":"arxiv","version":3},"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":"1305.6137","created_at":"2026-05-18T03:06:04.857309+00:00"},{"alias_kind":"arxiv_version","alias_value":"1305.6137v3","created_at":"2026-05-18T03:06:04.857309+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1305.6137","created_at":"2026-05-18T03:06:04.857309+00:00"},{"alias_kind":"pith_short_12","alias_value":"EKTZ3N6YPISE","created_at":"2026-05-18T12:27:43.054852+00:00"},{"alias_kind":"pith_short_16","alias_value":"EKTZ3N6YPISEMJFV","created_at":"2026-05-18T12:27:43.054852+00:00"},{"alias_kind":"pith_short_8","alias_value":"EKTZ3N6Y","created_at":"2026-05-18T12:27:43.054852+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/EKTZ3N6YPISEMJFV2GTEGLBTAW","json":"https://pith.science/pith/EKTZ3N6YPISEMJFV2GTEGLBTAW.json","graph_json":"https://pith.science/api/pith-number/EKTZ3N6YPISEMJFV2GTEGLBTAW/graph.json","events_json":"https://pith.science/api/pith-number/EKTZ3N6YPISEMJFV2GTEGLBTAW/events.json","paper":"https://pith.science/paper/EKTZ3N6Y"},"agent_actions":{"view_html":"https://pith.science/pith/EKTZ3N6YPISEMJFV2GTEGLBTAW","download_json":"https://pith.science/pith/EKTZ3N6YPISEMJFV2GTEGLBTAW.json","view_paper":"https://pith.science/paper/EKTZ3N6Y","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1305.6137&json=true","fetch_graph":"https://pith.science/api/pith-number/EKTZ3N6YPISEMJFV2GTEGLBTAW/graph.json","fetch_events":"https://pith.science/api/pith-number/EKTZ3N6YPISEMJFV2GTEGLBTAW/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/EKTZ3N6YPISEMJFV2GTEGLBTAW/action/timestamp_anchor","attest_storage":"https://pith.science/pith/EKTZ3N6YPISEMJFV2GTEGLBTAW/action/storage_attestation","attest_author":"https://pith.science/pith/EKTZ3N6YPISEMJFV2GTEGLBTAW/action/author_attestation","sign_citation":"https://pith.science/pith/EKTZ3N6YPISEMJFV2GTEGLBTAW/action/citation_signature","submit_replication":"https://pith.science/pith/EKTZ3N6YPISEMJFV2GTEGLBTAW/action/replication_record"}},"created_at":"2026-05-18T03:06:04.857309+00:00","updated_at":"2026-05-18T03:06:04.857309+00:00"}