{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:UD3XQL4TKEQQ2NZTXVTHSQKJGW","short_pith_number":"pith:UD3XQL4T","schema_version":"1.0","canonical_sha256":"a0f7782f9351210d3733bd6679414935a009bc99d47b67eaed8c5caaa1d37e0d","source":{"kind":"arxiv","id":"2606.02143","version":1},"attestation_state":"computed","paper":{"title":"On Proof Systems for #QBF","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.LO","authors_text":"Anil Shukla, Leroy Chew, Sravanthi Chede, Vaibhav Krishan","submitted_at":"2026-06-01T12:09:50Z","abstract_excerpt":"For a quantified Boolean formula (QBF), the problem of computing the number of winning strategies is known as the #QBF problem. This problem is considered harder than the analogous #SAT problem. Recently, important proof systems for QBFs and #SAT have been studied. By extending the ideas from both fields, we show that it is possible to design proof systems for #QBF. Such proof systems are important not only for advancing the theory of #QBF but also for certifying and designing better #QBF solvers, an area that is still in its early stages.\n  In this paper, we explore #QBF proof systems to coun"},"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":"2606.02143","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LO","submitted_at":"2026-06-01T12:09:50Z","cross_cats_sorted":[],"title_canon_sha256":"686bec6781d398f5ac45831a35d35d06874a0622a680214c0447dc13736c5079","abstract_canon_sha256":"15b5e35c85dc312d23b5379f42354d82184674251e11ec7c6f22b483fa6671ba"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-06-02T02:05:07.666383Z","signature_b64":"mbHSM3PHkPXRJANKuSYe7Fa5qdGvPY6owY3s7CA4n3SPTPjvTYxW5asN7cgmYGRAMOOL2QUP5+65igZWnxMtCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a0f7782f9351210d3733bd6679414935a009bc99d47b67eaed8c5caaa1d37e0d","last_reissued_at":"2026-06-02T02:05:07.665996Z","signature_status":"signed_v1","first_computed_at":"2026-06-02T02:05:07.665996Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On Proof Systems for #QBF","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.LO","authors_text":"Anil Shukla, Leroy Chew, Sravanthi Chede, Vaibhav Krishan","submitted_at":"2026-06-01T12:09:50Z","abstract_excerpt":"For a quantified Boolean formula (QBF), the problem of computing the number of winning strategies is known as the #QBF problem. This problem is considered harder than the analogous #SAT problem. Recently, important proof systems for QBFs and #SAT have been studied. By extending the ideas from both fields, we show that it is possible to design proof systems for #QBF. Such proof systems are important not only for advancing the theory of #QBF but also for certifying and designing better #QBF solvers, an area that is still in its early stages.\n  In this paper, we explore #QBF proof systems to coun"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2606.02143","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2606.02143/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":"2606.02143","created_at":"2026-06-02T02:05:07.666060+00:00"},{"alias_kind":"arxiv_version","alias_value":"2606.02143v1","created_at":"2026-06-02T02:05:07.666060+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2606.02143","created_at":"2026-06-02T02:05:07.666060+00:00"},{"alias_kind":"pith_short_12","alias_value":"UD3XQL4TKEQQ","created_at":"2026-06-02T02:05:07.666060+00:00"},{"alias_kind":"pith_short_16","alias_value":"UD3XQL4TKEQQ2NZT","created_at":"2026-06-02T02:05:07.666060+00:00"},{"alias_kind":"pith_short_8","alias_value":"UD3XQL4T","created_at":"2026-06-02T02:05:07.666060+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/UD3XQL4TKEQQ2NZTXVTHSQKJGW","json":"https://pith.science/pith/UD3XQL4TKEQQ2NZTXVTHSQKJGW.json","graph_json":"https://pith.science/api/pith-number/UD3XQL4TKEQQ2NZTXVTHSQKJGW/graph.json","events_json":"https://pith.science/api/pith-number/UD3XQL4TKEQQ2NZTXVTHSQKJGW/events.json","paper":"https://pith.science/paper/UD3XQL4T"},"agent_actions":{"view_html":"https://pith.science/pith/UD3XQL4TKEQQ2NZTXVTHSQKJGW","download_json":"https://pith.science/pith/UD3XQL4TKEQQ2NZTXVTHSQKJGW.json","view_paper":"https://pith.science/paper/UD3XQL4T","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2606.02143&json=true","fetch_graph":"https://pith.science/api/pith-number/UD3XQL4TKEQQ2NZTXVTHSQKJGW/graph.json","fetch_events":"https://pith.science/api/pith-number/UD3XQL4TKEQQ2NZTXVTHSQKJGW/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/UD3XQL4TKEQQ2NZTXVTHSQKJGW/action/timestamp_anchor","attest_storage":"https://pith.science/pith/UD3XQL4TKEQQ2NZTXVTHSQKJGW/action/storage_attestation","attest_author":"https://pith.science/pith/UD3XQL4TKEQQ2NZTXVTHSQKJGW/action/author_attestation","sign_citation":"https://pith.science/pith/UD3XQL4TKEQQ2NZTXVTHSQKJGW/action/citation_signature","submit_replication":"https://pith.science/pith/UD3XQL4TKEQQ2NZTXVTHSQKJGW/action/replication_record"}},"created_at":"2026-06-02T02:05:07.666060+00:00","updated_at":"2026-06-02T02:05:07.666060+00:00"}