{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2008:F3DHMLCCNW56OUS45U6QXKI2K3","short_pith_number":"pith:F3DHMLCC","schema_version":"1.0","canonical_sha256":"2ec6762c426dbbe7525ced3d0ba91a56ca38b8202535caadf324570d29b96033","source":{"kind":"arxiv","id":"0812.4848","version":3},"attestation_state":"computed","paper":{"title":"The Complexity of Generalized Satisfiability for Linear Temporal Logic","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LO","authors_text":"Henning Schnoor, Heribert Vollmer, Ilka Schnoor, Michael Bauland, Thomas Schneider","submitted_at":"2008-12-28T21:10:06Z","abstract_excerpt":"In a seminal paper from 1985, Sistla and Clarke showed that satisfiability for Linear Temporal Logic (LTL) is either NP-complete or PSPACE-complete, depending on the set of temporal operators used. If, in contrast, the set of propositional operators is restricted, the complexity may decrease. This paper undertakes a systematic study of satisfiability for LTL formulae over restricted sets of propositional and temporal operators. Since every propositional operator corresponds to a Boolean function, there exist infinitely many propositional operators. In order to systematically cover all possible"},"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":"0812.4848","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2008-12-28T21:10:06Z","cross_cats_sorted":[],"title_canon_sha256":"ddaab415ab40556a79bc20123136d7492ea4573b6b4649813181c6b3ea54b42b","abstract_canon_sha256":"fae6f68ac3f7d7280ffc9b7634c8ccf2226af6f560a03bfca548a14cd754be97"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:37:40.582270Z","signature_b64":"ArQz3h3UGImNKXesPxHlzKCR6ZzsFghS3GOO0aaNxqR5YWozVhKxROpdgtcmyyz38/ns1TMJPefSGLRBvaZbDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2ec6762c426dbbe7525ced3d0ba91a56ca38b8202535caadf324570d29b96033","last_reissued_at":"2026-05-18T01:37:40.581695Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:37:40.581695Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"The Complexity of Generalized Satisfiability for Linear Temporal Logic","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LO","authors_text":"Henning Schnoor, Heribert Vollmer, Ilka Schnoor, Michael Bauland, Thomas Schneider","submitted_at":"2008-12-28T21:10:06Z","abstract_excerpt":"In a seminal paper from 1985, Sistla and Clarke showed that satisfiability for Linear Temporal Logic (LTL) is either NP-complete or PSPACE-complete, depending on the set of temporal operators used. If, in contrast, the set of propositional operators is restricted, the complexity may decrease. This paper undertakes a systematic study of satisfiability for LTL formulae over restricted sets of propositional and temporal operators. Since every propositional operator corresponds to a Boolean function, there exist infinitely many propositional operators. In order to systematically cover all possible"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"0812.4848","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":"0812.4848","created_at":"2026-05-18T01:37:40.581790+00:00"},{"alias_kind":"arxiv_version","alias_value":"0812.4848v3","created_at":"2026-05-18T01:37:40.581790+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0812.4848","created_at":"2026-05-18T01:37:40.581790+00:00"},{"alias_kind":"pith_short_12","alias_value":"F3DHMLCCNW56","created_at":"2026-05-18T12:25:57.157939+00:00"},{"alias_kind":"pith_short_16","alias_value":"F3DHMLCCNW56OUS4","created_at":"2026-05-18T12:25:57.157939+00:00"},{"alias_kind":"pith_short_8","alias_value":"F3DHMLCC","created_at":"2026-05-18T12:25:57.157939+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/F3DHMLCCNW56OUS45U6QXKI2K3","json":"https://pith.science/pith/F3DHMLCCNW56OUS45U6QXKI2K3.json","graph_json":"https://pith.science/api/pith-number/F3DHMLCCNW56OUS45U6QXKI2K3/graph.json","events_json":"https://pith.science/api/pith-number/F3DHMLCCNW56OUS45U6QXKI2K3/events.json","paper":"https://pith.science/paper/F3DHMLCC"},"agent_actions":{"view_html":"https://pith.science/pith/F3DHMLCCNW56OUS45U6QXKI2K3","download_json":"https://pith.science/pith/F3DHMLCCNW56OUS45U6QXKI2K3.json","view_paper":"https://pith.science/paper/F3DHMLCC","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=0812.4848&json=true","fetch_graph":"https://pith.science/api/pith-number/F3DHMLCCNW56OUS45U6QXKI2K3/graph.json","fetch_events":"https://pith.science/api/pith-number/F3DHMLCCNW56OUS45U6QXKI2K3/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/F3DHMLCCNW56OUS45U6QXKI2K3/action/timestamp_anchor","attest_storage":"https://pith.science/pith/F3DHMLCCNW56OUS45U6QXKI2K3/action/storage_attestation","attest_author":"https://pith.science/pith/F3DHMLCCNW56OUS45U6QXKI2K3/action/author_attestation","sign_citation":"https://pith.science/pith/F3DHMLCCNW56OUS45U6QXKI2K3/action/citation_signature","submit_replication":"https://pith.science/pith/F3DHMLCCNW56OUS45U6QXKI2K3/action/replication_record"}},"created_at":"2026-05-18T01:37:40.581790+00:00","updated_at":"2026-05-18T01:37:40.581790+00:00"}