{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:LD5MJUVSSMJPVBPHQEXGYITI7G","short_pith_number":"pith:LD5MJUVS","schema_version":"1.0","canonical_sha256":"58fac4d2b29312fa85e7812e6c2268f98fae170c66597b28c932a92b26932084","source":{"kind":"arxiv","id":"2602.14634","version":2},"attestation_state":"computed","paper":{"title":"Beyond Eager Encodings: A Theory-Agnostic Approach to Theory-Lemma Enumeration in SMT","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.LO","authors_text":"Emanuele Civini, Gabriele Masina, Giuseppe Spallitta, Roberto Sebastiani","submitted_at":"2026-02-16T10:49:11Z","abstract_excerpt":"Lifting Boolean-reasoning techniques to the SMT level most often requires producing theory lemmas that rule out theory-inconsistent truth assignments. With standard SMT solving, it is common to \"lazily\" generate such lemmas on demand during the search; with some harder SMT-level tasks -- such as unsat-core extraction, MaxSMT, T-OBDD or T-SDD compilation -- it may be beneficial or even necessary to \"eagerly\" pre-compute all the needed theory lemmas upfront. Whereas in principle \"classic\" eager SMT encodings could do the job, they are specific for very few and easy theories, they do not comply w"},"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":"2602.14634","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LO","submitted_at":"2026-02-16T10:49:11Z","cross_cats_sorted":[],"title_canon_sha256":"dff0bf18b98c0204b4c61a66e9e5750f266c948e93d5e0c3fa5876aa1e1be606","abstract_canon_sha256":"82915b3899c39562ca6e6e85093856f8bb6fc9fc5976e70449d02de464e38ee4"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-25T02:02:13.568844Z","signature_b64":"DsX1tAjqZ6eZej0f6ell23W19QBW7o0wuKR6kbgbhSFs63W4j20SQ1yVpdW924+3QzI13BxXTi+I3EkK1jFoBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"58fac4d2b29312fa85e7812e6c2268f98fae170c66597b28c932a92b26932084","last_reissued_at":"2026-05-25T02:02:13.568186Z","signature_status":"signed_v1","first_computed_at":"2026-05-25T02:02:13.568186Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Beyond Eager Encodings: A Theory-Agnostic Approach to Theory-Lemma Enumeration in SMT","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.LO","authors_text":"Emanuele Civini, Gabriele Masina, Giuseppe Spallitta, Roberto Sebastiani","submitted_at":"2026-02-16T10:49:11Z","abstract_excerpt":"Lifting Boolean-reasoning techniques to the SMT level most often requires producing theory lemmas that rule out theory-inconsistent truth assignments. With standard SMT solving, it is common to \"lazily\" generate such lemmas on demand during the search; with some harder SMT-level tasks -- such as unsat-core extraction, MaxSMT, T-OBDD or T-SDD compilation -- it may be beneficial or even necessary to \"eagerly\" pre-compute all the needed theory lemmas upfront. Whereas in principle \"classic\" eager SMT encodings could do the job, they are specific for very few and easy theories, they do not comply w"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2602.14634","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2602.14634/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"2602.14634","created_at":"2026-05-25T02:02:13.568258+00:00"},{"alias_kind":"arxiv_version","alias_value":"2602.14634v2","created_at":"2026-05-25T02:02:13.568258+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2602.14634","created_at":"2026-05-25T02:02:13.568258+00:00"},{"alias_kind":"pith_short_12","alias_value":"LD5MJUVSSMJP","created_at":"2026-05-25T02:02:13.568258+00:00"},{"alias_kind":"pith_short_16","alias_value":"LD5MJUVSSMJPVBPH","created_at":"2026-05-25T02:02:13.568258+00:00"},{"alias_kind":"pith_short_8","alias_value":"LD5MJUVS","created_at":"2026-05-25T02:02:13.568258+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2603.09975","citing_title":"d-DNNF Modulo Theories: A General Framework for Polytime SMT Queries","ref_index":5,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/LD5MJUVSSMJPVBPHQEXGYITI7G","json":"https://pith.science/pith/LD5MJUVSSMJPVBPHQEXGYITI7G.json","graph_json":"https://pith.science/api/pith-number/LD5MJUVSSMJPVBPHQEXGYITI7G/graph.json","events_json":"https://pith.science/api/pith-number/LD5MJUVSSMJPVBPHQEXGYITI7G/events.json","paper":"https://pith.science/paper/LD5MJUVS"},"agent_actions":{"view_html":"https://pith.science/pith/LD5MJUVSSMJPVBPHQEXGYITI7G","download_json":"https://pith.science/pith/LD5MJUVSSMJPVBPHQEXGYITI7G.json","view_paper":"https://pith.science/paper/LD5MJUVS","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2602.14634&json=true","fetch_graph":"https://pith.science/api/pith-number/LD5MJUVSSMJPVBPHQEXGYITI7G/graph.json","fetch_events":"https://pith.science/api/pith-number/LD5MJUVSSMJPVBPHQEXGYITI7G/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/LD5MJUVSSMJPVBPHQEXGYITI7G/action/timestamp_anchor","attest_storage":"https://pith.science/pith/LD5MJUVSSMJPVBPHQEXGYITI7G/action/storage_attestation","attest_author":"https://pith.science/pith/LD5MJUVSSMJPVBPHQEXGYITI7G/action/author_attestation","sign_citation":"https://pith.science/pith/LD5MJUVSSMJPVBPHQEXGYITI7G/action/citation_signature","submit_replication":"https://pith.science/pith/LD5MJUVSSMJPVBPHQEXGYITI7G/action/replication_record"}},"created_at":"2026-05-25T02:02:13.568258+00:00","updated_at":"2026-05-25T02:02:13.568258+00:00"}