{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2023:7TIE6ZIYO6ZQEVS6CUM3B2QE6V","short_pith_number":"pith:7TIE6ZIY","schema_version":"1.0","canonical_sha256":"fcd04f651877b302565e1519b0ea04f5759d9332dbe5ca014849021cd8279cdd","source":{"kind":"arxiv","id":"2306.04541","version":2},"attestation_state":"computed","paper":{"title":"Top-Down Knowledge Compilation for Counting Modulo Theories","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.AI","authors_text":"Paolo Morettin, Pedro Zuidberg Dos Martires, Samuel Kolb, Vincent Derkinderen","submitted_at":"2023-06-07T15:46:28Z","abstract_excerpt":"Propositional model counting (#SAT) can be solved efficiently when the input formula is in deterministic decomposable negation normal form (d-DNNF). Translating an arbitrary formula into a representation that allows inference tasks, such as counting, to be performed efficiently, is called knowledge compilation. Top-down knowledge compilation is a state-of-the-art technique for solving #SAT problems that leverages the traces of exhaustive DPLL search to obtain d-DNNF representations. While knowledge compilation is well studied for propositional approaches, knowledge compilation for the (quantif"},"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":"2306.04541","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2023-06-07T15:46:28Z","cross_cats_sorted":[],"title_canon_sha256":"54b283971e1af73c1106233d9c0c29c44487b16c3e6c9560c1ba2daff060aec7","abstract_canon_sha256":"e4e098046d691b51b8523f6c437cb6eaa84b82c9aaf396bcfbd6b2b5b51d47ab"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T07:18:27.484686Z","signature_b64":"IhdyIp8ne1vw4/jOlBDUVJOSdiorYaR36L8fn/jKlhDPiYxur5YviNa+k7tY0dx7aKEkb3y8gK9DE4WrH1/ICg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"fcd04f651877b302565e1519b0ea04f5759d9332dbe5ca014849021cd8279cdd","last_reissued_at":"2026-07-05T07:18:27.484214Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T07:18:27.484214Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Top-Down Knowledge Compilation for Counting Modulo Theories","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.AI","authors_text":"Paolo Morettin, Pedro Zuidberg Dos Martires, Samuel Kolb, Vincent Derkinderen","submitted_at":"2023-06-07T15:46:28Z","abstract_excerpt":"Propositional model counting (#SAT) can be solved efficiently when the input formula is in deterministic decomposable negation normal form (d-DNNF). Translating an arbitrary formula into a representation that allows inference tasks, such as counting, to be performed efficiently, is called knowledge compilation. Top-down knowledge compilation is a state-of-the-art technique for solving #SAT problems that leverages the traces of exhaustive DPLL search to obtain d-DNNF representations. While knowledge compilation is well studied for propositional approaches, knowledge compilation for the (quantif"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2306.04541","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/2306.04541/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":"2306.04541","created_at":"2026-07-05T07:18:27.484270+00:00"},{"alias_kind":"arxiv_version","alias_value":"2306.04541v2","created_at":"2026-07-05T07:18:27.484270+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2306.04541","created_at":"2026-07-05T07:18:27.484270+00:00"},{"alias_kind":"pith_short_12","alias_value":"7TIE6ZIYO6ZQ","created_at":"2026-07-05T07:18:27.484270+00:00"},{"alias_kind":"pith_short_16","alias_value":"7TIE6ZIYO6ZQEVS6","created_at":"2026-07-05T07:18:27.484270+00:00"},{"alias_kind":"pith_short_8","alias_value":"7TIE6ZIY","created_at":"2026-07-05T07:18:27.484270+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/7TIE6ZIYO6ZQEVS6CUM3B2QE6V","json":"https://pith.science/pith/7TIE6ZIYO6ZQEVS6CUM3B2QE6V.json","graph_json":"https://pith.science/api/pith-number/7TIE6ZIYO6ZQEVS6CUM3B2QE6V/graph.json","events_json":"https://pith.science/api/pith-number/7TIE6ZIYO6ZQEVS6CUM3B2QE6V/events.json","paper":"https://pith.science/paper/7TIE6ZIY"},"agent_actions":{"view_html":"https://pith.science/pith/7TIE6ZIYO6ZQEVS6CUM3B2QE6V","download_json":"https://pith.science/pith/7TIE6ZIYO6ZQEVS6CUM3B2QE6V.json","view_paper":"https://pith.science/paper/7TIE6ZIY","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2306.04541&json=true","fetch_graph":"https://pith.science/api/pith-number/7TIE6ZIYO6ZQEVS6CUM3B2QE6V/graph.json","fetch_events":"https://pith.science/api/pith-number/7TIE6ZIYO6ZQEVS6CUM3B2QE6V/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/7TIE6ZIYO6ZQEVS6CUM3B2QE6V/action/timestamp_anchor","attest_storage":"https://pith.science/pith/7TIE6ZIYO6ZQEVS6CUM3B2QE6V/action/storage_attestation","attest_author":"https://pith.science/pith/7TIE6ZIYO6ZQEVS6CUM3B2QE6V/action/author_attestation","sign_citation":"https://pith.science/pith/7TIE6ZIYO6ZQEVS6CUM3B2QE6V/action/citation_signature","submit_replication":"https://pith.science/pith/7TIE6ZIYO6ZQEVS6CUM3B2QE6V/action/replication_record"}},"created_at":"2026-07-05T07:18:27.484270+00:00","updated_at":"2026-07-05T07:18:27.484270+00:00"}