{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2010:QPF7M3QYMMBYZYCQWJQYIQ773X","short_pith_number":"pith:QPF7M3QY","schema_version":"1.0","canonical_sha256":"83cbf66e1863038ce050b2618443ffddc1cbb36e159e1d463d07d14ee728d02a","source":{"kind":"arxiv","id":"1009.5206","version":2},"attestation_state":"computed","paper":{"title":"The complexity of linear-time temporal logic over the class of ordinals","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LO","authors_text":"Alexander Rabinovich (School of CS, CNRS, ENS Cachan, INRIA), Stephane Demri (LSV, Tel Aviv University)","submitted_at":"2010-09-27T09:58:46Z","abstract_excerpt":"We consider the temporal logic with since and until modalities. This temporal logic is expressively equivalent over the class of ordinals to first-order logic by Kamp's theorem. We show that it has a PSPACE-complete satisfiability problem over the class of ordinals. Among the consequences of our proof, we show that given the code of some countable ordinal alpha and a formula, we can decide in PSPACE whether the formula has a model over alpha. In order to show these results, we introduce a class of simple ordinal automata, as expressive as B\\\"uchi ordinal automata. The PSPACE upper bound for th"},"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":"1009.5206","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2010-09-27T09:58:46Z","cross_cats_sorted":[],"title_canon_sha256":"e1291b59964ecda58bf52052a074ac1c048d17486182178a09ae98af22f2271a","abstract_canon_sha256":"29e1dda1c4a55e8fc93a0d8a144968a0abad02cd50b4d6e264b8343224cc56f6"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:37:39.854743Z","signature_b64":"xO94JDwJx82nTF2WMNOLQrcHmKwGWmM7G7w67BFcx3rQVK3nJ7yMLx5KIDGS8HOSoe+cVWsi+IMN4S8Zu8YoCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"83cbf66e1863038ce050b2618443ffddc1cbb36e159e1d463d07d14ee728d02a","last_reissued_at":"2026-05-18T01:37:39.854020Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:37:39.854020Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"The complexity of linear-time temporal logic over the class of ordinals","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LO","authors_text":"Alexander Rabinovich (School of CS, CNRS, ENS Cachan, INRIA), Stephane Demri (LSV, Tel Aviv University)","submitted_at":"2010-09-27T09:58:46Z","abstract_excerpt":"We consider the temporal logic with since and until modalities. This temporal logic is expressively equivalent over the class of ordinals to first-order logic by Kamp's theorem. We show that it has a PSPACE-complete satisfiability problem over the class of ordinals. Among the consequences of our proof, we show that given the code of some countable ordinal alpha and a formula, we can decide in PSPACE whether the formula has a model over alpha. In order to show these results, we introduce a class of simple ordinal automata, as expressive as B\\\"uchi ordinal automata. The PSPACE upper bound for th"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1009.5206","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":"1009.5206","created_at":"2026-05-18T01:37:39.854124+00:00"},{"alias_kind":"arxiv_version","alias_value":"1009.5206v2","created_at":"2026-05-18T01:37:39.854124+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1009.5206","created_at":"2026-05-18T01:37:39.854124+00:00"},{"alias_kind":"pith_short_12","alias_value":"QPF7M3QYMMBY","created_at":"2026-05-18T12:26:12.377268+00:00"},{"alias_kind":"pith_short_16","alias_value":"QPF7M3QYMMBYZYCQ","created_at":"2026-05-18T12:26:12.377268+00:00"},{"alias_kind":"pith_short_8","alias_value":"QPF7M3QY","created_at":"2026-05-18T12:26:12.377268+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/QPF7M3QYMMBYZYCQWJQYIQ773X","json":"https://pith.science/pith/QPF7M3QYMMBYZYCQWJQYIQ773X.json","graph_json":"https://pith.science/api/pith-number/QPF7M3QYMMBYZYCQWJQYIQ773X/graph.json","events_json":"https://pith.science/api/pith-number/QPF7M3QYMMBYZYCQWJQYIQ773X/events.json","paper":"https://pith.science/paper/QPF7M3QY"},"agent_actions":{"view_html":"https://pith.science/pith/QPF7M3QYMMBYZYCQWJQYIQ773X","download_json":"https://pith.science/pith/QPF7M3QYMMBYZYCQWJQYIQ773X.json","view_paper":"https://pith.science/paper/QPF7M3QY","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1009.5206&json=true","fetch_graph":"https://pith.science/api/pith-number/QPF7M3QYMMBYZYCQWJQYIQ773X/graph.json","fetch_events":"https://pith.science/api/pith-number/QPF7M3QYMMBYZYCQWJQYIQ773X/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/QPF7M3QYMMBYZYCQWJQYIQ773X/action/timestamp_anchor","attest_storage":"https://pith.science/pith/QPF7M3QYMMBYZYCQWJQYIQ773X/action/storage_attestation","attest_author":"https://pith.science/pith/QPF7M3QYMMBYZYCQWJQYIQ773X/action/author_attestation","sign_citation":"https://pith.science/pith/QPF7M3QYMMBYZYCQWJQYIQ773X/action/citation_signature","submit_replication":"https://pith.science/pith/QPF7M3QYMMBYZYCQWJQYIQ773X/action/replication_record"}},"created_at":"2026-05-18T01:37:39.854124+00:00","updated_at":"2026-05-18T01:37:39.854124+00:00"}