{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:ONESJQT6F4MWK5K422WTKN6WHR","short_pith_number":"pith:ONESJQT6","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"},"canonical_sha256":"734924c27e2f1965755cd6ad3537d63c5eeba02a5869f4c55c677ab07cb8b646","source":{"kind":"arxiv","id":"1401.3458","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1401.3458","created_at":"2026-05-18T03:02:08Z"},{"alias_kind":"arxiv_version","alias_value":"1401.3458v1","created_at":"2026-05-18T03:02:08Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1401.3458","created_at":"2026-05-18T03:02:08Z"},{"alias_kind":"pith_short_12","alias_value":"ONESJQT6F4MW","created_at":"2026-05-18T12:28:41Z"},{"alias_kind":"pith_short_16","alias_value":"ONESJQT6F4MWK5K4","created_at":"2026-05-18T12:28:41Z"},{"alias_kind":"pith_short_8","alias_value":"ONESJQT6","created_at":"2026-05-18T12:28:41Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:ONESJQT6F4MWK5K422WTKN6WHR","target":"record","payload":{"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"},"canonical_sha256":"734924c27e2f1965755cd6ad3537d63c5eeba02a5869f4c55c677ab07cb8b646","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"},"source_kind":"arxiv","source_id":"1401.3458","source_version":1,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T03:02:08Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"GA7aOaaWmkzCUr+e4SFz3DDHv5yG0wDmUNk/4jMXPFnyy6352FffKCoOPDHhIM2GLCkO/Yqydk5hAJ8SCzdXBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T00:14:39.916725Z"},"content_sha256":"858bf258861ac91dda0a07fc800ace764050decc01066368a1b9cbc7a47bce3f","schema_version":"1.0","event_id":"sha256:858bf258861ac91dda0a07fc800ace764050decc01066368a1b9cbc7a47bce3f"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:ONESJQT6F4MWK5K422WTKN6WHR","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T03:02:08Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"xPraGvz8uRERPTbkFkLYhK83qBZql+FFrtRZsrtEOBQqo6Axqc8db3+cSJpCFwEPW8v3nxkjOr9pbU16C9l6Dg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T00:14:39.917425Z"},"content_sha256":"d303d16bc7b9c4f787521798237687f6c0ac4d34370e0fec82aa287ff26dccca","schema_version":"1.0","event_id":"sha256:d303d16bc7b9c4f787521798237687f6c0ac4d34370e0fec82aa287ff26dccca"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/ONESJQT6F4MWK5K422WTKN6WHR/bundle.json","state_url":"https://pith.science/pith/ONESJQT6F4MWK5K422WTKN6WHR/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/ONESJQT6F4MWK5K422WTKN6WHR/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-06-01T00:14:39Z","links":{"resolver":"https://pith.science/pith/ONESJQT6F4MWK5K422WTKN6WHR","bundle":"https://pith.science/pith/ONESJQT6F4MWK5K422WTKN6WHR/bundle.json","state":"https://pith.science/pith/ONESJQT6F4MWK5K422WTKN6WHR/state.json","well_known_bundle":"https://pith.science/.well-known/pith/ONESJQT6F4MWK5K422WTKN6WHR/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:ONESJQT6F4MWK5K422WTKN6WHR","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"7ffd590f39b88141e592efda6492e827694072df90426f476ce14fa6d38ff2ca","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2014-01-15T05:17:49Z","title_canon_sha256":"8344e5c0cd3a8f8dea98ee9621a534d98018dc2e14e4c89de68cacb6e9c15697"},"schema_version":"1.0","source":{"id":"1401.3458","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1401.3458","created_at":"2026-05-18T03:02:08Z"},{"alias_kind":"arxiv_version","alias_value":"1401.3458v1","created_at":"2026-05-18T03:02:08Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1401.3458","created_at":"2026-05-18T03:02:08Z"},{"alias_kind":"pith_short_12","alias_value":"ONESJQT6F4MW","created_at":"2026-05-18T12:28:41Z"},{"alias_kind":"pith_short_16","alias_value":"ONESJQT6F4MWK5K4","created_at":"2026-05-18T12:28:41Z"},{"alias_kind":"pith_short_8","alias_value":"ONESJQT6","created_at":"2026-05-18T12:28:41Z"}],"graph_snapshots":[{"event_id":"sha256:d303d16bc7b9c4f787521798237687f6c0ac4d34370e0fec82aa287ff26dccca","target":"graph","created_at":"2026-05-18T03:02:08Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"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","authors_text":"Fahiem Bacchus, Shannon Dalmao, Toniann Pitassi","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2014-01-15T05:17:49Z","title":"Solving #SAT and Bayesian Inference with Backtracking Search"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1401.3458","kind":"arxiv","version":1},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:858bf258861ac91dda0a07fc800ace764050decc01066368a1b9cbc7a47bce3f","target":"record","created_at":"2026-05-18T03:02:08Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"7ffd590f39b88141e592efda6492e827694072df90426f476ce14fa6d38ff2ca","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2014-01-15T05:17:49Z","title_canon_sha256":"8344e5c0cd3a8f8dea98ee9621a534d98018dc2e14e4c89de68cacb6e9c15697"},"schema_version":"1.0","source":{"id":"1401.3458","kind":"arxiv","version":1}},"canonical_sha256":"734924c27e2f1965755cd6ad3537d63c5eeba02a5869f4c55c677ab07cb8b646","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"734924c27e2f1965755cd6ad3537d63c5eeba02a5869f4c55c677ab07cb8b646","first_computed_at":"2026-05-18T03:02:08.982049Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:02:08.982049Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"MiADIsgOzi9lHC3SGfm7O8N4MV1wZbOsDRx75wyvv0gCWsn79mhp8Co/Z78MvQrlnNBZCBkW4eQRfgI/CA2rCQ==","signature_status":"signed_v1","signed_at":"2026-05-18T03:02:08.982921Z","signed_message":"canonical_sha256_bytes"},"source_id":"1401.3458","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:858bf258861ac91dda0a07fc800ace764050decc01066368a1b9cbc7a47bce3f","sha256:d303d16bc7b9c4f787521798237687f6c0ac4d34370e0fec82aa287ff26dccca"],"state_sha256":"0acfb461a4a5c5491462915558ed4063d2d4fac774a37d32699939e92845f277"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"wRRJoshPfprBAbEo07M9IsRqTy294HrqMMYds23qnEfVZpog10bw/DS/F9yXg4zRMLzc9COIMq34fJXYEci+BA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-01T00:14:39.920775Z","bundle_sha256":"3db44e1d64b7f48e45ca471adf48b23d2db9d5c1be4f9634aec498c2aad08a16"}}