{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2012:4BMJW7R3FUFSTUQ4Y4W5OQKST5","short_pith_number":"pith:4BMJW7R3","schema_version":"1.0","canonical_sha256":"e0589b7e3b2d0b29d21cc72dd741529f655542877c283db64edf5b48925a380b","source":{"kind":"arxiv","id":"1205.0946","version":2},"attestation_state":"computed","paper":{"title":"Constraint LTL Satisfiability Checking without Automata","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LO","authors_text":"Achille Frigeri, Angelo Morzenti, Marcello M. Bersani, Matteo Pradella, Matteo Rossi, Pierluigi San Pietro","submitted_at":"2012-05-04T12:57:00Z","abstract_excerpt":"This paper introduces a novel technique to decide the satisfiability of formulae written in the language of Linear Temporal Logic with Both future and past operators and atomic formulae belonging to constraint system D (CLTLB(D) for short). The technique is based on the concept of bounded satisfiability, and hinges on an encoding of CLTLB(D) formulae into QF-EUD, the theory of quantifier-free equality and uninterpreted functions combined with D. Similarly to standard LTL, where bounded model-checking and SAT-solvers can be used as an alternative to automata-theoretic approaches to model-checki"},"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":"1205.0946","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2012-05-04T12:57:00Z","cross_cats_sorted":[],"title_canon_sha256":"74e87bd8578b3ebb87eda5aa8e283046d1c11ff778d1690ae479146febfc1a38","abstract_canon_sha256":"9ddad80745e2cc7dfd187595457c3a9d2af9b0d2ba5d1ac67ee42f7d71acbe29"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:59:30.767215Z","signature_b64":"3hntCoZ2WA1SAlvxsBaVEf+yRlT9PcYV98Jrh/Xg19Uqu4AwdElenpSKozcx53OUnxC7ZQR64XPEa9MdnhaaDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e0589b7e3b2d0b29d21cc72dd741529f655542877c283db64edf5b48925a380b","last_reissued_at":"2026-05-18T02:59:30.766338Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:59:30.766338Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Constraint LTL Satisfiability Checking without Automata","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LO","authors_text":"Achille Frigeri, Angelo Morzenti, Marcello M. Bersani, Matteo Pradella, Matteo Rossi, Pierluigi San Pietro","submitted_at":"2012-05-04T12:57:00Z","abstract_excerpt":"This paper introduces a novel technique to decide the satisfiability of formulae written in the language of Linear Temporal Logic with Both future and past operators and atomic formulae belonging to constraint system D (CLTLB(D) for short). The technique is based on the concept of bounded satisfiability, and hinges on an encoding of CLTLB(D) formulae into QF-EUD, the theory of quantifier-free equality and uninterpreted functions combined with D. Similarly to standard LTL, where bounded model-checking and SAT-solvers can be used as an alternative to automata-theoretic approaches to model-checki"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1205.0946","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":"1205.0946","created_at":"2026-05-18T02:59:30.766491+00:00"},{"alias_kind":"arxiv_version","alias_value":"1205.0946v2","created_at":"2026-05-18T02:59:30.766491+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1205.0946","created_at":"2026-05-18T02:59:30.766491+00:00"},{"alias_kind":"pith_short_12","alias_value":"4BMJW7R3FUFS","created_at":"2026-05-18T12:26:53.410803+00:00"},{"alias_kind":"pith_short_16","alias_value":"4BMJW7R3FUFSTUQ4","created_at":"2026-05-18T12:26:53.410803+00:00"},{"alias_kind":"pith_short_8","alias_value":"4BMJW7R3","created_at":"2026-05-18T12:26:53.410803+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/4BMJW7R3FUFSTUQ4Y4W5OQKST5","json":"https://pith.science/pith/4BMJW7R3FUFSTUQ4Y4W5OQKST5.json","graph_json":"https://pith.science/api/pith-number/4BMJW7R3FUFSTUQ4Y4W5OQKST5/graph.json","events_json":"https://pith.science/api/pith-number/4BMJW7R3FUFSTUQ4Y4W5OQKST5/events.json","paper":"https://pith.science/paper/4BMJW7R3"},"agent_actions":{"view_html":"https://pith.science/pith/4BMJW7R3FUFSTUQ4Y4W5OQKST5","download_json":"https://pith.science/pith/4BMJW7R3FUFSTUQ4Y4W5OQKST5.json","view_paper":"https://pith.science/paper/4BMJW7R3","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1205.0946&json=true","fetch_graph":"https://pith.science/api/pith-number/4BMJW7R3FUFSTUQ4Y4W5OQKST5/graph.json","fetch_events":"https://pith.science/api/pith-number/4BMJW7R3FUFSTUQ4Y4W5OQKST5/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/4BMJW7R3FUFSTUQ4Y4W5OQKST5/action/timestamp_anchor","attest_storage":"https://pith.science/pith/4BMJW7R3FUFSTUQ4Y4W5OQKST5/action/storage_attestation","attest_author":"https://pith.science/pith/4BMJW7R3FUFSTUQ4Y4W5OQKST5/action/author_attestation","sign_citation":"https://pith.science/pith/4BMJW7R3FUFSTUQ4Y4W5OQKST5/action/citation_signature","submit_replication":"https://pith.science/pith/4BMJW7R3FUFSTUQ4Y4W5OQKST5/action/replication_record"}},"created_at":"2026-05-18T02:59:30.766491+00:00","updated_at":"2026-05-18T02:59:30.766491+00:00"}