{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:O5TTKPLV7WEIFE3LCLIJ3D2QJO","short_pith_number":"pith:O5TTKPLV","schema_version":"1.0","canonical_sha256":"7767353d75fd8882936b12d09d8f504baa15b9111bb4bdf3c83b81b2d6951d9f","source":{"kind":"arxiv","id":"2603.09975","version":3},"attestation_state":"computed","paper":{"title":"d-DNNF Modulo Theories: A General Framework for Polytime SMT Queries","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.LO","authors_text":"Emanuele Civini, Gabriele Masina, Giuseppe Spallitta, Massimo Michelutti, Roberto Sebastiani","submitted_at":"2026-03-10T17:59:31Z","abstract_excerpt":"In Knowledge Compilation (KC) a propositional knowledge base is compiled off-line into some target form, typically into deterministic decomposable negation normal form (d-DNNF) or one of its subcases, which is then used on-line to answer a large number of queries in polytime, such as clausal entailment, model counting, and others. The general idea is to push as much of the computational effort into the off-line compilation phase, which is amortized over all on-line polytime queries.\n  In this paper, we present for the first time a novel and general technique to leverage d-DNNF compilation and "},"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":"2603.09975","kind":"arxiv","version":3},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LO","submitted_at":"2026-03-10T17:59:31Z","cross_cats_sorted":[],"title_canon_sha256":"c9d576c1fa6d5a566132bd3cac7b7edb75097723235a5c631a0a71d2d1d63a86","abstract_canon_sha256":"219c4271370e72f05a737215da011bcd2e73ef554d7da725b949ab0900aa986f"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-20T00:00:36.250854Z","signature_b64":"BrkYjj5vcmUE4IN87ENmnOjQovqg190YQSYVVmj/evfwAuHuMnfLUraXoESdgZl4yBLfOzLaep9aCSbR0HLkAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"7767353d75fd8882936b12d09d8f504baa15b9111bb4bdf3c83b81b2d6951d9f","last_reissued_at":"2026-05-20T00:00:36.250144Z","signature_status":"signed_v1","first_computed_at":"2026-05-20T00:00:36.250144Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"d-DNNF Modulo Theories: A General Framework for Polytime SMT Queries","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.LO","authors_text":"Emanuele Civini, Gabriele Masina, Giuseppe Spallitta, Massimo Michelutti, Roberto Sebastiani","submitted_at":"2026-03-10T17:59:31Z","abstract_excerpt":"In Knowledge Compilation (KC) a propositional knowledge base is compiled off-line into some target form, typically into deterministic decomposable negation normal form (d-DNNF) or one of its subcases, which is then used on-line to answer a large number of queries in polytime, such as clausal entailment, model counting, and others. The general idea is to push as much of the computational effort into the off-line compilation phase, which is amortized over all on-line polytime queries.\n  In this paper, we present for the first time a novel and general technique to leverage d-DNNF compilation and "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2603.09975","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2603.09975/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":"2603.09975","created_at":"2026-05-20T00:00:36.250263+00:00"},{"alias_kind":"arxiv_version","alias_value":"2603.09975v3","created_at":"2026-05-20T00:00:36.250263+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2603.09975","created_at":"2026-05-20T00:00:36.250263+00:00"},{"alias_kind":"pith_short_12","alias_value":"O5TTKPLV7WEI","created_at":"2026-05-20T00:00:36.250263+00:00"},{"alias_kind":"pith_short_16","alias_value":"O5TTKPLV7WEIFE3L","created_at":"2026-05-20T00:00:36.250263+00:00"},{"alias_kind":"pith_short_8","alias_value":"O5TTKPLV","created_at":"2026-05-20T00:00:36.250263+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/O5TTKPLV7WEIFE3LCLIJ3D2QJO","json":"https://pith.science/pith/O5TTKPLV7WEIFE3LCLIJ3D2QJO.json","graph_json":"https://pith.science/api/pith-number/O5TTKPLV7WEIFE3LCLIJ3D2QJO/graph.json","events_json":"https://pith.science/api/pith-number/O5TTKPLV7WEIFE3LCLIJ3D2QJO/events.json","paper":"https://pith.science/paper/O5TTKPLV"},"agent_actions":{"view_html":"https://pith.science/pith/O5TTKPLV7WEIFE3LCLIJ3D2QJO","download_json":"https://pith.science/pith/O5TTKPLV7WEIFE3LCLIJ3D2QJO.json","view_paper":"https://pith.science/paper/O5TTKPLV","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2603.09975&json=true","fetch_graph":"https://pith.science/api/pith-number/O5TTKPLV7WEIFE3LCLIJ3D2QJO/graph.json","fetch_events":"https://pith.science/api/pith-number/O5TTKPLV7WEIFE3LCLIJ3D2QJO/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/O5TTKPLV7WEIFE3LCLIJ3D2QJO/action/timestamp_anchor","attest_storage":"https://pith.science/pith/O5TTKPLV7WEIFE3LCLIJ3D2QJO/action/storage_attestation","attest_author":"https://pith.science/pith/O5TTKPLV7WEIFE3LCLIJ3D2QJO/action/author_attestation","sign_citation":"https://pith.science/pith/O5TTKPLV7WEIFE3LCLIJ3D2QJO/action/citation_signature","submit_replication":"https://pith.science/pith/O5TTKPLV7WEIFE3LCLIJ3D2QJO/action/replication_record"}},"created_at":"2026-05-20T00:00:36.250263+00:00","updated_at":"2026-05-20T00:00:36.250263+00:00"}