{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:6UV675MGV5MVZ7XJNCNR37XNWX","short_pith_number":"pith:6UV675MG","schema_version":"1.0","canonical_sha256":"f52beff586af595cfee9689b1dfeedb5fcf0bd31d5353489c4ba8edf1d81cca4","source":{"kind":"arxiv","id":"1706.04108","version":3},"attestation_state":"computed","paper":{"title":"On complexity of propositional Linear-time Temporal Logic with finitely many variables","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LO","authors_text":"Dmitry Shkatov, Mikhail Rybakov","submitted_at":"2017-06-13T14:58:23Z","abstract_excerpt":"It is known [DemriSchnoebelen02] that both satisfiability and model-checking problems for propositional Linear-time Temporal Logic, LTL, with only a single propositional variable in the language are PSPACE-complete, which coincides with the complexity of these problems for LTL with an arbitrary number of propositional variables [SislaClarke85]. In the present paper, we show that the same result can be obtained by modifying the original proof of SPACE-hardness for LTL from [SislaClarke85]; i.e., we show how to modify the construction from [SislaClarke85] to model the computations of polynomiall"},"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":"1706.04108","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2017-06-13T14:58:23Z","cross_cats_sorted":[],"title_canon_sha256":"1de221725d301ba8bd2d6d4bc6e54cbec2399bd3753177324d83fe01c384105c","abstract_canon_sha256":"ce4e5a93834930f29e0bab6c20b23aa71a30019fd7dddcbad7958a6526aaed25"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:00:02.573979Z","signature_b64":"KuyHuQVp1VRWopp7Pchvd9uP/6ZxYgJwlGpvZGpczQkIFJRUIJ+G5ePeoRFImQVjNS/EkR6kjsWxgN6K7Q2SCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f52beff586af595cfee9689b1dfeedb5fcf0bd31d5353489c4ba8edf1d81cca4","last_reissued_at":"2026-05-18T00:00:02.573503Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:00:02.573503Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On complexity of propositional Linear-time Temporal Logic with finitely many variables","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LO","authors_text":"Dmitry Shkatov, Mikhail Rybakov","submitted_at":"2017-06-13T14:58:23Z","abstract_excerpt":"It is known [DemriSchnoebelen02] that both satisfiability and model-checking problems for propositional Linear-time Temporal Logic, LTL, with only a single propositional variable in the language are PSPACE-complete, which coincides with the complexity of these problems for LTL with an arbitrary number of propositional variables [SislaClarke85]. In the present paper, we show that the same result can be obtained by modifying the original proof of SPACE-hardness for LTL from [SislaClarke85]; i.e., we show how to modify the construction from [SislaClarke85] to model the computations of polynomiall"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1706.04108","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":"1706.04108","created_at":"2026-05-18T00:00:02.573573+00:00"},{"alias_kind":"arxiv_version","alias_value":"1706.04108v3","created_at":"2026-05-18T00:00:02.573573+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1706.04108","created_at":"2026-05-18T00:00:02.573573+00:00"},{"alias_kind":"pith_short_12","alias_value":"6UV675MGV5MV","created_at":"2026-05-18T12:31:03.183658+00:00"},{"alias_kind":"pith_short_16","alias_value":"6UV675MGV5MVZ7XJ","created_at":"2026-05-18T12:31:03.183658+00:00"},{"alias_kind":"pith_short_8","alias_value":"6UV675MG","created_at":"2026-05-18T12:31:03.183658+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/6UV675MGV5MVZ7XJNCNR37XNWX","json":"https://pith.science/pith/6UV675MGV5MVZ7XJNCNR37XNWX.json","graph_json":"https://pith.science/api/pith-number/6UV675MGV5MVZ7XJNCNR37XNWX/graph.json","events_json":"https://pith.science/api/pith-number/6UV675MGV5MVZ7XJNCNR37XNWX/events.json","paper":"https://pith.science/paper/6UV675MG"},"agent_actions":{"view_html":"https://pith.science/pith/6UV675MGV5MVZ7XJNCNR37XNWX","download_json":"https://pith.science/pith/6UV675MGV5MVZ7XJNCNR37XNWX.json","view_paper":"https://pith.science/paper/6UV675MG","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1706.04108&json=true","fetch_graph":"https://pith.science/api/pith-number/6UV675MGV5MVZ7XJNCNR37XNWX/graph.json","fetch_events":"https://pith.science/api/pith-number/6UV675MGV5MVZ7XJNCNR37XNWX/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/6UV675MGV5MVZ7XJNCNR37XNWX/action/timestamp_anchor","attest_storage":"https://pith.science/pith/6UV675MGV5MVZ7XJNCNR37XNWX/action/storage_attestation","attest_author":"https://pith.science/pith/6UV675MGV5MVZ7XJNCNR37XNWX/action/author_attestation","sign_citation":"https://pith.science/pith/6UV675MGV5MVZ7XJNCNR37XNWX/action/citation_signature","submit_replication":"https://pith.science/pith/6UV675MGV5MVZ7XJNCNR37XNWX/action/replication_record"}},"created_at":"2026-05-18T00:00:02.573573+00:00","updated_at":"2026-05-18T00:00:02.573573+00:00"}