{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:ONESJQT6F4MWK5K422WTKN6WHR","short_pith_number":"pith:ONESJQT6","schema_version":"1.0","canonical_sha256":"734924c27e2f1965755cd6ad3537d63c5eeba02a5869f4c55c677ab07cb8b646","source":{"kind":"arxiv","id":"1401.3458","version":1},"attestation_state":"computed","paper":{"title":"Solving #SAT and Bayesian Inference with Backtracking Search","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.AI","authors_text":"Fahiem Bacchus, Shannon Dalmao, Toniann Pitassi","submitted_at":"2014-01-15T05:17:49Z","abstract_excerpt":"Inference in Bayes Nets (BAYES) is an important problem with numerous applications in probabilistic reasoning. Counting the number of satisfying assignments of a propositional formula (#SAT) is a closely related problem of fundamental theoretical importance. Both these problems, and others, are members of the class of sum-of-products (SUMPROD) problems. In this paper we show that standard backtracking search when augmented with a simple memoization scheme (caching) can solve any sum-of-products problem with time complexity that is at least as good any other state-of-the-art exact algorithm, an"},"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":"1401.3458","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2014-01-15T05:17:49Z","cross_cats_sorted":[],"title_canon_sha256":"8344e5c0cd3a8f8dea98ee9621a534d98018dc2e14e4c89de68cacb6e9c15697","abstract_canon_sha256":"7ffd590f39b88141e592efda6492e827694072df90426f476ce14fa6d38ff2ca"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:02:08.982921Z","signature_b64":"MiADIsgOzi9lHC3SGfm7O8N4MV1wZbOsDRx75wyvv0gCWsn79mhp8Co/Z78MvQrlnNBZCBkW4eQRfgI/CA2rCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"734924c27e2f1965755cd6ad3537d63c5eeba02a5869f4c55c677ab07cb8b646","last_reissued_at":"2026-05-18T03:02:08.982049Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:02:08.982049Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Solving #SAT and Bayesian Inference with Backtracking Search","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.AI","authors_text":"Fahiem Bacchus, Shannon Dalmao, Toniann Pitassi","submitted_at":"2014-01-15T05:17:49Z","abstract_excerpt":"Inference in Bayes Nets (BAYES) is an important problem with numerous applications in probabilistic reasoning. Counting the number of satisfying assignments of a propositional formula (#SAT) is a closely related problem of fundamental theoretical importance. Both these problems, and others, are members of the class of sum-of-products (SUMPROD) problems. In this paper we show that standard backtracking search when augmented with a simple memoization scheme (caching) can solve any sum-of-products problem with time complexity that is at least as good any other state-of-the-art exact algorithm, an"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1401.3458","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":"1401.3458","created_at":"2026-05-18T03:02:08.982157+00:00"},{"alias_kind":"arxiv_version","alias_value":"1401.3458v1","created_at":"2026-05-18T03:02:08.982157+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1401.3458","created_at":"2026-05-18T03:02:08.982157+00:00"},{"alias_kind":"pith_short_12","alias_value":"ONESJQT6F4MW","created_at":"2026-05-18T12:28:41.024544+00:00"},{"alias_kind":"pith_short_16","alias_value":"ONESJQT6F4MWK5K4","created_at":"2026-05-18T12:28:41.024544+00:00"},{"alias_kind":"pith_short_8","alias_value":"ONESJQT6","created_at":"2026-05-18T12:28:41.024544+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/ONESJQT6F4MWK5K422WTKN6WHR","json":"https://pith.science/pith/ONESJQT6F4MWK5K422WTKN6WHR.json","graph_json":"https://pith.science/api/pith-number/ONESJQT6F4MWK5K422WTKN6WHR/graph.json","events_json":"https://pith.science/api/pith-number/ONESJQT6F4MWK5K422WTKN6WHR/events.json","paper":"https://pith.science/paper/ONESJQT6"},"agent_actions":{"view_html":"https://pith.science/pith/ONESJQT6F4MWK5K422WTKN6WHR","download_json":"https://pith.science/pith/ONESJQT6F4MWK5K422WTKN6WHR.json","view_paper":"https://pith.science/paper/ONESJQT6","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1401.3458&json=true","fetch_graph":"https://pith.science/api/pith-number/ONESJQT6F4MWK5K422WTKN6WHR/graph.json","fetch_events":"https://pith.science/api/pith-number/ONESJQT6F4MWK5K422WTKN6WHR/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/ONESJQT6F4MWK5K422WTKN6WHR/action/timestamp_anchor","attest_storage":"https://pith.science/pith/ONESJQT6F4MWK5K422WTKN6WHR/action/storage_attestation","attest_author":"https://pith.science/pith/ONESJQT6F4MWK5K422WTKN6WHR/action/author_attestation","sign_citation":"https://pith.science/pith/ONESJQT6F4MWK5K422WTKN6WHR/action/citation_signature","submit_replication":"https://pith.science/pith/ONESJQT6F4MWK5K422WTKN6WHR/action/replication_record"}},"created_at":"2026-05-18T03:02:08.982157+00:00","updated_at":"2026-05-18T03:02:08.982157+00:00"}