{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2026:UD3XQL4TKEQQ2NZTXVTHSQKJGW","short_pith_number":"pith:UD3XQL4T","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"},"canonical_sha256":"a0f7782f9351210d3733bd6679414935a009bc99d47b67eaed8c5caaa1d37e0d","source":{"kind":"arxiv","id":"2606.02143","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2606.02143","created_at":"2026-06-02T02:05:07Z"},{"alias_kind":"arxiv_version","alias_value":"2606.02143v1","created_at":"2026-06-02T02:05:07Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2606.02143","created_at":"2026-06-02T02:05:07Z"},{"alias_kind":"pith_short_12","alias_value":"UD3XQL4TKEQQ","created_at":"2026-06-02T02:05:07Z"},{"alias_kind":"pith_short_16","alias_value":"UD3XQL4TKEQQ2NZT","created_at":"2026-06-02T02:05:07Z"},{"alias_kind":"pith_short_8","alias_value":"UD3XQL4T","created_at":"2026-06-02T02:05:07Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2026:UD3XQL4TKEQQ2NZTXVTHSQKJGW","target":"record","payload":{"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"},"canonical_sha256":"a0f7782f9351210d3733bd6679414935a009bc99d47b67eaed8c5caaa1d37e0d","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"},"source_kind":"arxiv","source_id":"2606.02143","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-06-02T02:05:07Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"BHryZezAdLA/MZeYd0GGH+CarvejnGeGZI9qq2FIUD6WlVqWuCeoO47wzhHlr3E89+73FvLfXlQqG/Fye+SaDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-03T21:53:23.769092Z"},"content_sha256":"f4aeb79e715d2d45c8779aa47a1f4fa479a51c084dcb94ed779558cff79ff479","schema_version":"1.0","event_id":"sha256:f4aeb79e715d2d45c8779aa47a1f4fa479a51c084dcb94ed779558cff79ff479"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2026:UD3XQL4TKEQQ2NZTXVTHSQKJGW","target":"graph","payload":{"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"},"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-06-02T02:05:07Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"PD89JRV66MA800PY+ux/YqzYr4DY1yc/fZLXW73bXtmK96Tj6epF3htPN6nRtYY1BphQYVmouD1PkctGjX0UCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-03T21:53:23.769474Z"},"content_sha256":"7cb5fba1179c5add0000a1ffa7412d7c81b92cd03f2b609b11f3de1f1d44a2eb","schema_version":"1.0","event_id":"sha256:7cb5fba1179c5add0000a1ffa7412d7c81b92cd03f2b609b11f3de1f1d44a2eb"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/UD3XQL4TKEQQ2NZTXVTHSQKJGW/bundle.json","state_url":"https://pith.science/pith/UD3XQL4TKEQQ2NZTXVTHSQKJGW/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/UD3XQL4TKEQQ2NZTXVTHSQKJGW/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-07-03T21:53:23Z","links":{"resolver":"https://pith.science/pith/UD3XQL4TKEQQ2NZTXVTHSQKJGW","bundle":"https://pith.science/pith/UD3XQL4TKEQQ2NZTXVTHSQKJGW/bundle.json","state":"https://pith.science/pith/UD3XQL4TKEQQ2NZTXVTHSQKJGW/state.json","well_known_bundle":"https://pith.science/.well-known/pith/UD3XQL4TKEQQ2NZTXVTHSQKJGW/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:UD3XQL4TKEQQ2NZTXVTHSQKJGW","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":"15b5e35c85dc312d23b5379f42354d82184674251e11ec7c6f22b483fa6671ba","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LO","submitted_at":"2026-06-01T12:09:50Z","title_canon_sha256":"686bec6781d398f5ac45831a35d35d06874a0622a680214c0447dc13736c5079"},"schema_version":"1.0","source":{"id":"2606.02143","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2606.02143","created_at":"2026-06-02T02:05:07Z"},{"alias_kind":"arxiv_version","alias_value":"2606.02143v1","created_at":"2026-06-02T02:05:07Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2606.02143","created_at":"2026-06-02T02:05:07Z"},{"alias_kind":"pith_short_12","alias_value":"UD3XQL4TKEQQ","created_at":"2026-06-02T02:05:07Z"},{"alias_kind":"pith_short_16","alias_value":"UD3XQL4TKEQQ2NZT","created_at":"2026-06-02T02:05:07Z"},{"alias_kind":"pith_short_8","alias_value":"UD3XQL4T","created_at":"2026-06-02T02:05:07Z"}],"graph_snapshots":[{"event_id":"sha256:7cb5fba1179c5add0000a1ffa7412d7c81b92cd03f2b609b11f3de1f1d44a2eb","target":"graph","created_at":"2026-06-02T02:05:07Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2606.02143/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"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","authors_text":"Anil Shukla, Leroy Chew, Sravanthi Chede, Vaibhav Krishan","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LO","submitted_at":"2026-06-01T12:09:50Z","title":"On Proof Systems for #QBF"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2606.02143","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:f4aeb79e715d2d45c8779aa47a1f4fa479a51c084dcb94ed779558cff79ff479","target":"record","created_at":"2026-06-02T02:05:07Z","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":"15b5e35c85dc312d23b5379f42354d82184674251e11ec7c6f22b483fa6671ba","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LO","submitted_at":"2026-06-01T12:09:50Z","title_canon_sha256":"686bec6781d398f5ac45831a35d35d06874a0622a680214c0447dc13736c5079"},"schema_version":"1.0","source":{"id":"2606.02143","kind":"arxiv","version":1}},"canonical_sha256":"a0f7782f9351210d3733bd6679414935a009bc99d47b67eaed8c5caaa1d37e0d","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"a0f7782f9351210d3733bd6679414935a009bc99d47b67eaed8c5caaa1d37e0d","first_computed_at":"2026-06-02T02:05:07.665996Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-06-02T02:05:07.665996Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"mbHSM3PHkPXRJANKuSYe7Fa5qdGvPY6owY3s7CA4n3SPTPjvTYxW5asN7cgmYGRAMOOL2QUP5+65igZWnxMtCw==","signature_status":"signed_v1","signed_at":"2026-06-02T02:05:07.666383Z","signed_message":"canonical_sha256_bytes"},"source_id":"2606.02143","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:f4aeb79e715d2d45c8779aa47a1f4fa479a51c084dcb94ed779558cff79ff479","sha256:7cb5fba1179c5add0000a1ffa7412d7c81b92cd03f2b609b11f3de1f1d44a2eb"],"state_sha256":"3ebe02214b03f0d546fc5264699f5e4f895d2445aee4d2e1fd28d572627c9091"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"5QvOSkZlvfkRQUUIwN8Sieuvdb5h1ho7ecX/Yp9U6RVeELQPORX74DS65T792X/TCmMjAB0mpGPQPwMfmjo6AA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-03T21:53:23.771550Z","bundle_sha256":"c11e71dcbd60a6c8a000b75c25d06509c9c2f1abdd8ba4f68c6d99700e66d5a0"}}