{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2012:LGOVPDUB7J7ANQJ2UTQRU5ATS7","short_pith_number":"pith:LGOVPDUB","schema_version":"1.0","canonical_sha256":"599d578e81fa7e06c13aa4e11a741397e1c6becda7face69991c4d682af9830f","source":{"kind":"arxiv","id":"1210.2479","version":1},"attestation_state":"computed","paper":{"title":"Interval Temporal Logics over Strongly Discrete Linear Orders: the Complete Picture","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LO","authors_text":"Angelo Montanari (University of Udine, Dario Della Monica (Reykjavik University, Davide Bresolin (University of Verona, Guido Sciavicco (University of Murcia, Iceland), Italy), Pietro Sala (University of Verona, Spain)","submitted_at":"2012-10-09T03:43:57Z","abstract_excerpt":"Interval temporal logics provide a general framework for temporal reasoning about interval structures over linearly ordered domains, where intervals are taken as the primitive ontological entities. In this paper, we identify all fragments of Halpern and Shoham's interval temporal logic HS with a decidable satisfiability problem over the class of strongly discrete linear orders. We classify them in terms of both their relative expressive power and their complexity. We show that there are exactly 44 expressively different decidable fragments, whose complexity ranges from NP to EXPSPACE. In addit"},"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":"1210.2479","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2012-10-09T03:43:57Z","cross_cats_sorted":[],"title_canon_sha256":"8f3b09660150824da67efbcc63950d0a12afb79043d2acc0efe9785c6fb8e11c","abstract_canon_sha256":"3209d0a5f3275ad8123e2f2ace0f6603c343413872771692fd3d3e0d465b027d"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:43:41.386968Z","signature_b64":"MTABxIc6qq8r9g2HEFnaT2SzfXsUZJznDNdAOyaU4Fx451v/XPkIUvfNuvL/HhBPkbKnv87aMeHz2fK6U0AyAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"599d578e81fa7e06c13aa4e11a741397e1c6becda7face69991c4d682af9830f","last_reissued_at":"2026-05-18T03:43:41.386278Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:43:41.386278Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Interval Temporal Logics over Strongly Discrete Linear Orders: the Complete Picture","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LO","authors_text":"Angelo Montanari (University of Udine, Dario Della Monica (Reykjavik University, Davide Bresolin (University of Verona, Guido Sciavicco (University of Murcia, Iceland), Italy), Pietro Sala (University of Verona, Spain)","submitted_at":"2012-10-09T03:43:57Z","abstract_excerpt":"Interval temporal logics provide a general framework for temporal reasoning about interval structures over linearly ordered domains, where intervals are taken as the primitive ontological entities. In this paper, we identify all fragments of Halpern and Shoham's interval temporal logic HS with a decidable satisfiability problem over the class of strongly discrete linear orders. We classify them in terms of both their relative expressive power and their complexity. We show that there are exactly 44 expressively different decidable fragments, whose complexity ranges from NP to EXPSPACE. In addit"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1210.2479","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":"1210.2479","created_at":"2026-05-18T03:43:41.386398+00:00"},{"alias_kind":"arxiv_version","alias_value":"1210.2479v1","created_at":"2026-05-18T03:43:41.386398+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1210.2479","created_at":"2026-05-18T03:43:41.386398+00:00"},{"alias_kind":"pith_short_12","alias_value":"LGOVPDUB7J7A","created_at":"2026-05-18T12:27:14.488303+00:00"},{"alias_kind":"pith_short_16","alias_value":"LGOVPDUB7J7ANQJ2","created_at":"2026-05-18T12:27:14.488303+00:00"},{"alias_kind":"pith_short_8","alias_value":"LGOVPDUB","created_at":"2026-05-18T12:27:14.488303+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/LGOVPDUB7J7ANQJ2UTQRU5ATS7","json":"https://pith.science/pith/LGOVPDUB7J7ANQJ2UTQRU5ATS7.json","graph_json":"https://pith.science/api/pith-number/LGOVPDUB7J7ANQJ2UTQRU5ATS7/graph.json","events_json":"https://pith.science/api/pith-number/LGOVPDUB7J7ANQJ2UTQRU5ATS7/events.json","paper":"https://pith.science/paper/LGOVPDUB"},"agent_actions":{"view_html":"https://pith.science/pith/LGOVPDUB7J7ANQJ2UTQRU5ATS7","download_json":"https://pith.science/pith/LGOVPDUB7J7ANQJ2UTQRU5ATS7.json","view_paper":"https://pith.science/paper/LGOVPDUB","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1210.2479&json=true","fetch_graph":"https://pith.science/api/pith-number/LGOVPDUB7J7ANQJ2UTQRU5ATS7/graph.json","fetch_events":"https://pith.science/api/pith-number/LGOVPDUB7J7ANQJ2UTQRU5ATS7/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/LGOVPDUB7J7ANQJ2UTQRU5ATS7/action/timestamp_anchor","attest_storage":"https://pith.science/pith/LGOVPDUB7J7ANQJ2UTQRU5ATS7/action/storage_attestation","attest_author":"https://pith.science/pith/LGOVPDUB7J7ANQJ2UTQRU5ATS7/action/author_attestation","sign_citation":"https://pith.science/pith/LGOVPDUB7J7ANQJ2UTQRU5ATS7/action/citation_signature","submit_replication":"https://pith.science/pith/LGOVPDUB7J7ANQJ2UTQRU5ATS7/action/replication_record"}},"created_at":"2026-05-18T03:43:41.386398+00:00","updated_at":"2026-05-18T03:43:41.386398+00:00"}