{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:WBDQBSTVKLVP7MSMGP74MPPG7B","short_pith_number":"pith:WBDQBSTV","schema_version":"1.0","canonical_sha256":"b04700ca7552eaffb24c33ffc63de6f858bc9e65e1eafc24ee9a405821561abb","source":{"kind":"arxiv","id":"1811.03176","version":1},"attestation_state":"computed","paper":{"title":"SAT-based Explicit LTLf Satisfiability Checking","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LO","authors_text":"Geguang Pu, Jianwen Li, Kristin Y. Rozier, Moshe Y. Vardi, Yueling Zhang","submitted_at":"2018-11-07T22:58:46Z","abstract_excerpt":"We present here a SAT-based framework for LTLf (Linear Temporal Logic on Finite Traces) satisfiability checking. We use propositional SAT-solving techniques to construct a transition system for the input LTLf formula; satisfiability checking is then reduced to a path-search problem over this transition system. Furthermore, we introduce CDLSC (Conflict-Driven LTLf Satisfiability Checking), a novel algorithm that leverages information produced by propositional SAT solvers from both satisfiability and unsatisfiability results. Experimental evaluations show that CDLSC outperforms all other existin"},"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":"1811.03176","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2018-11-07T22:58:46Z","cross_cats_sorted":[],"title_canon_sha256":"a62cab9c405e3fc9a144eb64a5b7bde83ff32c4944541ba7a1318f08dcf73c1b","abstract_canon_sha256":"e77c7dc3a0a35e0dc3dae5bb5b36b46290e16a3774ef17524d78436b1f27819e"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:01:18.920853Z","signature_b64":"zypCVPl4p/VPDBINmPpxigHnQUWqJW9Qc3cQ6BuGmSIZoG1FDI479aSDlxrSgpb3gttHmBx8+DJ/gXaXHpAKCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b04700ca7552eaffb24c33ffc63de6f858bc9e65e1eafc24ee9a405821561abb","last_reissued_at":"2026-05-18T00:01:18.920257Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:01:18.920257Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"SAT-based Explicit LTLf Satisfiability Checking","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LO","authors_text":"Geguang Pu, Jianwen Li, Kristin Y. Rozier, Moshe Y. Vardi, Yueling Zhang","submitted_at":"2018-11-07T22:58:46Z","abstract_excerpt":"We present here a SAT-based framework for LTLf (Linear Temporal Logic on Finite Traces) satisfiability checking. We use propositional SAT-solving techniques to construct a transition system for the input LTLf formula; satisfiability checking is then reduced to a path-search problem over this transition system. Furthermore, we introduce CDLSC (Conflict-Driven LTLf Satisfiability Checking), a novel algorithm that leverages information produced by propositional SAT solvers from both satisfiability and unsatisfiability results. Experimental evaluations show that CDLSC outperforms all other existin"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1811.03176","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":"1811.03176","created_at":"2026-05-18T00:01:18.920356+00:00"},{"alias_kind":"arxiv_version","alias_value":"1811.03176v1","created_at":"2026-05-18T00:01:18.920356+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1811.03176","created_at":"2026-05-18T00:01:18.920356+00:00"},{"alias_kind":"pith_short_12","alias_value":"WBDQBSTVKLVP","created_at":"2026-05-18T12:32:59.047623+00:00"},{"alias_kind":"pith_short_16","alias_value":"WBDQBSTVKLVP7MSM","created_at":"2026-05-18T12:32:59.047623+00:00"},{"alias_kind":"pith_short_8","alias_value":"WBDQBSTV","created_at":"2026-05-18T12:32:59.047623+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/WBDQBSTVKLVP7MSMGP74MPPG7B","json":"https://pith.science/pith/WBDQBSTVKLVP7MSMGP74MPPG7B.json","graph_json":"https://pith.science/api/pith-number/WBDQBSTVKLVP7MSMGP74MPPG7B/graph.json","events_json":"https://pith.science/api/pith-number/WBDQBSTVKLVP7MSMGP74MPPG7B/events.json","paper":"https://pith.science/paper/WBDQBSTV"},"agent_actions":{"view_html":"https://pith.science/pith/WBDQBSTVKLVP7MSMGP74MPPG7B","download_json":"https://pith.science/pith/WBDQBSTVKLVP7MSMGP74MPPG7B.json","view_paper":"https://pith.science/paper/WBDQBSTV","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1811.03176&json=true","fetch_graph":"https://pith.science/api/pith-number/WBDQBSTVKLVP7MSMGP74MPPG7B/graph.json","fetch_events":"https://pith.science/api/pith-number/WBDQBSTVKLVP7MSMGP74MPPG7B/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/WBDQBSTVKLVP7MSMGP74MPPG7B/action/timestamp_anchor","attest_storage":"https://pith.science/pith/WBDQBSTVKLVP7MSMGP74MPPG7B/action/storage_attestation","attest_author":"https://pith.science/pith/WBDQBSTVKLVP7MSMGP74MPPG7B/action/author_attestation","sign_citation":"https://pith.science/pith/WBDQBSTVKLVP7MSMGP74MPPG7B/action/citation_signature","submit_replication":"https://pith.science/pith/WBDQBSTVKLVP7MSMGP74MPPG7B/action/replication_record"}},"created_at":"2026-05-18T00:01:18.920356+00:00","updated_at":"2026-05-18T00:01:18.920356+00:00"}