{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2012:BYBX6QBSTQFG4RPG7OS6H3X5V6","short_pith_number":"pith:BYBX6QBS","schema_version":"1.0","canonical_sha256":"0e037f40329c0a6e45e6fba5e3eefdafbf2318cac77646880aea08eff5e69a22","source":{"kind":"arxiv","id":"1202.2536","version":1},"attestation_state":"computed","paper":{"title":"Message passing for quantified Boolean formulas","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cond-mat.dis-nn"],"primary_cat":"cs.AI","authors_text":"Abolfazl Ramezanpour, Lenka Zdeborov\\'a, Pan Zhang, Riccardo Zecchina","submitted_at":"2012-02-12T15:47:29Z","abstract_excerpt":"We introduce two types of message passing algorithms for quantified Boolean formulas (QBF). The first type is a message passing based heuristics that can prove unsatisfiability of the QBF by assigning the universal variables in such a way that the remaining formula is unsatisfiable. In the second type, we use message passing to guide branching heuristics of a Davis-Putnam Logemann-Loveland (DPLL) complete solver. Numerical experiments show that on random QBFs our branching heuristics gives robust exponential efficiency gain with respect to the state-of-art solvers. We also manage to solve some"},"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":"1202.2536","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2012-02-12T15:47:29Z","cross_cats_sorted":["cond-mat.dis-nn"],"title_canon_sha256":"80dfc5e34166689090daf5083aeb10231e43514f8d1bcb5d4466f4c8eba2fdd5","abstract_canon_sha256":"2d5e93b250977165cfccf5acece56bdc5cd4fa4dfa361367eb5dd93727d96a45"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:53:54.417456Z","signature_b64":"mI/xio5jUOx8hKXhfE/AH0EvnnQFYsuMXJMzVj1JmitCYqgHiCvneyGEgnXSDd+mVm0Q9jVtatQTBuMlGGbLCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0e037f40329c0a6e45e6fba5e3eefdafbf2318cac77646880aea08eff5e69a22","last_reissued_at":"2026-05-18T03:53:54.416830Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:53:54.416830Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Message passing for quantified Boolean formulas","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cond-mat.dis-nn"],"primary_cat":"cs.AI","authors_text":"Abolfazl Ramezanpour, Lenka Zdeborov\\'a, Pan Zhang, Riccardo Zecchina","submitted_at":"2012-02-12T15:47:29Z","abstract_excerpt":"We introduce two types of message passing algorithms for quantified Boolean formulas (QBF). The first type is a message passing based heuristics that can prove unsatisfiability of the QBF by assigning the universal variables in such a way that the remaining formula is unsatisfiable. In the second type, we use message passing to guide branching heuristics of a Davis-Putnam Logemann-Loveland (DPLL) complete solver. Numerical experiments show that on random QBFs our branching heuristics gives robust exponential efficiency gain with respect to the state-of-art solvers. We also manage to solve some"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1202.2536","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":"1202.2536","created_at":"2026-05-18T03:53:54.416917+00:00"},{"alias_kind":"arxiv_version","alias_value":"1202.2536v1","created_at":"2026-05-18T03:53:54.416917+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1202.2536","created_at":"2026-05-18T03:53:54.416917+00:00"},{"alias_kind":"pith_short_12","alias_value":"BYBX6QBSTQFG","created_at":"2026-05-18T12:27:01.376967+00:00"},{"alias_kind":"pith_short_16","alias_value":"BYBX6QBSTQFG4RPG","created_at":"2026-05-18T12:27:01.376967+00:00"},{"alias_kind":"pith_short_8","alias_value":"BYBX6QBS","created_at":"2026-05-18T12:27:01.376967+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/BYBX6QBSTQFG4RPG7OS6H3X5V6","json":"https://pith.science/pith/BYBX6QBSTQFG4RPG7OS6H3X5V6.json","graph_json":"https://pith.science/api/pith-number/BYBX6QBSTQFG4RPG7OS6H3X5V6/graph.json","events_json":"https://pith.science/api/pith-number/BYBX6QBSTQFG4RPG7OS6H3X5V6/events.json","paper":"https://pith.science/paper/BYBX6QBS"},"agent_actions":{"view_html":"https://pith.science/pith/BYBX6QBSTQFG4RPG7OS6H3X5V6","download_json":"https://pith.science/pith/BYBX6QBSTQFG4RPG7OS6H3X5V6.json","view_paper":"https://pith.science/paper/BYBX6QBS","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1202.2536&json=true","fetch_graph":"https://pith.science/api/pith-number/BYBX6QBSTQFG4RPG7OS6H3X5V6/graph.json","fetch_events":"https://pith.science/api/pith-number/BYBX6QBSTQFG4RPG7OS6H3X5V6/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/BYBX6QBSTQFG4RPG7OS6H3X5V6/action/timestamp_anchor","attest_storage":"https://pith.science/pith/BYBX6QBSTQFG4RPG7OS6H3X5V6/action/storage_attestation","attest_author":"https://pith.science/pith/BYBX6QBSTQFG4RPG7OS6H3X5V6/action/author_attestation","sign_citation":"https://pith.science/pith/BYBX6QBSTQFG4RPG7OS6H3X5V6/action/citation_signature","submit_replication":"https://pith.science/pith/BYBX6QBSTQFG4RPG7OS6H3X5V6/action/replication_record"}},"created_at":"2026-05-18T03:53:54.416917+00:00","updated_at":"2026-05-18T03:53:54.416917+00:00"}