{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2020:XFPZGQCT3XHKBDYR3CXYDQNJCR","short_pith_number":"pith:XFPZGQCT","schema_version":"1.0","canonical_sha256":"b95f934053ddcea08f11d8af81c1a91455f9f67bebc52720db28d4ff15a344bc","source":{"kind":"arxiv","id":"2007.03204","version":2},"attestation_state":"computed","paper":{"title":"Learning Branching Heuristics for Propositional Model Counting","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI","cs.LO","stat.ML"],"primary_cat":"cs.LG","authors_text":"Chris J. Maddison, Fahiem Bacchus, Gil Lederman, Pashootan Vaezipoor, Roger Grosse, Sanjit A. Seshia, Yuhuai Wu","submitted_at":"2020-07-07T05:20:29Z","abstract_excerpt":"Propositional model counting, or #SAT, is the problem of computing the number of satisfying assignments of a Boolean formula. Many problems from different application areas, including many discrete probabilistic inference problems, can be translated into model counting problems to be solved by #SAT solvers. Exact #SAT solvers, however, are often not scalable to industrial size instances. In this paper, we present Neuro#, an approach for learning branching heuristics to improve the performance of exact #SAT solvers on instances from a given family of problems. We experimentally show that our me"},"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":"2007.03204","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2020-07-07T05:20:29Z","cross_cats_sorted":["cs.AI","cs.LO","stat.ML"],"title_canon_sha256":"aac19fdffb23e04a56ed01c93608b1d36c9dbac51e2197f57569099c817d4b74","abstract_canon_sha256":"47cd88ae00aaa8399f06b0703de4ec8c11c3762991d64c054e35d0fdd4b73d2e"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T04:55:47.862063Z","signature_b64":"0GQGRhd4PSN5xFKdfHo8P1kDzMUMNatjmuCMAZBn/Vl/xece53s29nOU64uCSNb7/Ma3eLm9OGVo1jS8c0S3Cg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b95f934053ddcea08f11d8af81c1a91455f9f67bebc52720db28d4ff15a344bc","last_reissued_at":"2026-07-05T04:55:47.861708Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T04:55:47.861708Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Learning Branching Heuristics for Propositional Model Counting","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI","cs.LO","stat.ML"],"primary_cat":"cs.LG","authors_text":"Chris J. Maddison, Fahiem Bacchus, Gil Lederman, Pashootan Vaezipoor, Roger Grosse, Sanjit A. Seshia, Yuhuai Wu","submitted_at":"2020-07-07T05:20:29Z","abstract_excerpt":"Propositional model counting, or #SAT, is the problem of computing the number of satisfying assignments of a Boolean formula. Many problems from different application areas, including many discrete probabilistic inference problems, can be translated into model counting problems to be solved by #SAT solvers. Exact #SAT solvers, however, are often not scalable to industrial size instances. In this paper, we present Neuro#, an approach for learning branching heuristics to improve the performance of exact #SAT solvers on instances from a given family of problems. We experimentally show that our me"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2007.03204","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/2007.03204/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":"2007.03204","created_at":"2026-07-05T04:55:47.861764+00:00"},{"alias_kind":"arxiv_version","alias_value":"2007.03204v2","created_at":"2026-07-05T04:55:47.861764+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2007.03204","created_at":"2026-07-05T04:55:47.861764+00:00"},{"alias_kind":"pith_short_12","alias_value":"XFPZGQCT3XHK","created_at":"2026-07-05T04:55:47.861764+00:00"},{"alias_kind":"pith_short_16","alias_value":"XFPZGQCT3XHKBDYR","created_at":"2026-07-05T04:55:47.861764+00:00"},{"alias_kind":"pith_short_8","alias_value":"XFPZGQCT","created_at":"2026-07-05T04:55:47.861764+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/XFPZGQCT3XHKBDYR3CXYDQNJCR","json":"https://pith.science/pith/XFPZGQCT3XHKBDYR3CXYDQNJCR.json","graph_json":"https://pith.science/api/pith-number/XFPZGQCT3XHKBDYR3CXYDQNJCR/graph.json","events_json":"https://pith.science/api/pith-number/XFPZGQCT3XHKBDYR3CXYDQNJCR/events.json","paper":"https://pith.science/paper/XFPZGQCT"},"agent_actions":{"view_html":"https://pith.science/pith/XFPZGQCT3XHKBDYR3CXYDQNJCR","download_json":"https://pith.science/pith/XFPZGQCT3XHKBDYR3CXYDQNJCR.json","view_paper":"https://pith.science/paper/XFPZGQCT","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2007.03204&json=true","fetch_graph":"https://pith.science/api/pith-number/XFPZGQCT3XHKBDYR3CXYDQNJCR/graph.json","fetch_events":"https://pith.science/api/pith-number/XFPZGQCT3XHKBDYR3CXYDQNJCR/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/XFPZGQCT3XHKBDYR3CXYDQNJCR/action/timestamp_anchor","attest_storage":"https://pith.science/pith/XFPZGQCT3XHKBDYR3CXYDQNJCR/action/storage_attestation","attest_author":"https://pith.science/pith/XFPZGQCT3XHKBDYR3CXYDQNJCR/action/author_attestation","sign_citation":"https://pith.science/pith/XFPZGQCT3XHKBDYR3CXYDQNJCR/action/citation_signature","submit_replication":"https://pith.science/pith/XFPZGQCT3XHKBDYR3CXYDQNJCR/action/replication_record"}},"created_at":"2026-07-05T04:55:47.861764+00:00","updated_at":"2026-07-05T04:55:47.861764+00:00"}