{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:LNFDAT2BFHTZPB5FYMOJM3FSAD","short_pith_number":"pith:LNFDAT2B","schema_version":"1.0","canonical_sha256":"5b4a304f4129e79787a5c31c966cb200dd13d6d2a0384861c007ae4a92b2cbe5","source":{"kind":"arxiv","id":"1403.1666","version":1},"attestation_state":"computed","paper":{"title":"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, Jifeng He, Lijun Zhang, Moshe Y. Vardi","submitted_at":"2014-03-07T06:50:14Z","abstract_excerpt":"We consider here Linear Temporal Logic (LTL) formulas interpreted over \\emph{finite} traces. We denote this logic by LTLf. The existing approach for LTLf satisfiability checking is based on a reduction to standard LTL satisfiability checking. We describe here a novel direct approach to LTLf satisfiability checking, where we take advantage of the difference in the semantics between LTL and LTLf. While LTL satisfiability checking requires finding a \\emph{fair cycle} in an appropriate transition system, here we need to search only for a finite trace. This enables us to introduce specialized heuri"},"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":"1403.1666","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2014-03-07T06:50:14Z","cross_cats_sorted":[],"title_canon_sha256":"4f83c2a7d614fb0bc6e06477da6636e23623d82f4850cd3a37f8b80700be0c7a","abstract_canon_sha256":"0c5fab66565b096e85b2c2f4510a1bd0d538ea3d2121f6d910f53641a158d593"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:56:52.882061Z","signature_b64":"vc0qmbg4u2UI9aL7tLo3HTEaYkJBTN5Vo8uGI1sdn+biEjeDcrnYAmp8Eu1weXKR1QBtQ7x4wCHu+O+ra6ymBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5b4a304f4129e79787a5c31c966cb200dd13d6d2a0384861c007ae4a92b2cbe5","last_reissued_at":"2026-05-18T02:56:52.881492Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:56:52.881492Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"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, Jifeng He, Lijun Zhang, Moshe Y. Vardi","submitted_at":"2014-03-07T06:50:14Z","abstract_excerpt":"We consider here Linear Temporal Logic (LTL) formulas interpreted over \\emph{finite} traces. We denote this logic by LTLf. The existing approach for LTLf satisfiability checking is based on a reduction to standard LTL satisfiability checking. We describe here a novel direct approach to LTLf satisfiability checking, where we take advantage of the difference in the semantics between LTL and LTLf. While LTL satisfiability checking requires finding a \\emph{fair cycle} in an appropriate transition system, here we need to search only for a finite trace. This enables us to introduce specialized heuri"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1403.1666","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":"1403.1666","created_at":"2026-05-18T02:56:52.881575+00:00"},{"alias_kind":"arxiv_version","alias_value":"1403.1666v1","created_at":"2026-05-18T02:56:52.881575+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1403.1666","created_at":"2026-05-18T02:56:52.881575+00:00"},{"alias_kind":"pith_short_12","alias_value":"LNFDAT2BFHTZ","created_at":"2026-05-18T12:28:38.356838+00:00"},{"alias_kind":"pith_short_16","alias_value":"LNFDAT2BFHTZPB5F","created_at":"2026-05-18T12:28:38.356838+00:00"},{"alias_kind":"pith_short_8","alias_value":"LNFDAT2B","created_at":"2026-05-18T12:28:38.356838+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/LNFDAT2BFHTZPB5FYMOJM3FSAD","json":"https://pith.science/pith/LNFDAT2BFHTZPB5FYMOJM3FSAD.json","graph_json":"https://pith.science/api/pith-number/LNFDAT2BFHTZPB5FYMOJM3FSAD/graph.json","events_json":"https://pith.science/api/pith-number/LNFDAT2BFHTZPB5FYMOJM3FSAD/events.json","paper":"https://pith.science/paper/LNFDAT2B"},"agent_actions":{"view_html":"https://pith.science/pith/LNFDAT2BFHTZPB5FYMOJM3FSAD","download_json":"https://pith.science/pith/LNFDAT2BFHTZPB5FYMOJM3FSAD.json","view_paper":"https://pith.science/paper/LNFDAT2B","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1403.1666&json=true","fetch_graph":"https://pith.science/api/pith-number/LNFDAT2BFHTZPB5FYMOJM3FSAD/graph.json","fetch_events":"https://pith.science/api/pith-number/LNFDAT2BFHTZPB5FYMOJM3FSAD/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/LNFDAT2BFHTZPB5FYMOJM3FSAD/action/timestamp_anchor","attest_storage":"https://pith.science/pith/LNFDAT2BFHTZPB5FYMOJM3FSAD/action/storage_attestation","attest_author":"https://pith.science/pith/LNFDAT2BFHTZPB5FYMOJM3FSAD/action/author_attestation","sign_citation":"https://pith.science/pith/LNFDAT2BFHTZPB5FYMOJM3FSAD/action/citation_signature","submit_replication":"https://pith.science/pith/LNFDAT2BFHTZPB5FYMOJM3FSAD/action/replication_record"}},"created_at":"2026-05-18T02:56:52.881575+00:00","updated_at":"2026-05-18T02:56:52.881575+00:00"}