{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2026:ODJK3Z44TZIGZGTYZ6ZLQRZOV4","short_pith_number":"pith:ODJK3Z44","canonical_record":{"source":{"id":"2605.14093","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2026-05-13T20:25:11Z","cross_cats_sorted":[],"title_canon_sha256":"cb5a6e5da6d309bd197a4c9fada2ec41442fca5e687310c40eb77be4163c46f2","abstract_canon_sha256":"043430e1da4601815e44f8c7620a44556c6bda62a048b92d18dbc31c653a853a"},"schema_version":"1.0"},"canonical_sha256":"70d2ade79c9e506c9a78cfb2b8472eaf13e83d3f1058636d55a83543ea2ac714","source":{"kind":"arxiv","id":"2605.14093","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2605.14093","created_at":"2026-05-17T23:39:12Z"},{"alias_kind":"arxiv_version","alias_value":"2605.14093v1","created_at":"2026-05-17T23:39:12Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.14093","created_at":"2026-05-17T23:39:12Z"},{"alias_kind":"pith_short_12","alias_value":"ODJK3Z44TZIG","created_at":"2026-05-18T12:33:37Z"},{"alias_kind":"pith_short_16","alias_value":"ODJK3Z44TZIGZGTY","created_at":"2026-05-18T12:33:37Z"},{"alias_kind":"pith_short_8","alias_value":"ODJK3Z44","created_at":"2026-05-18T12:33:37Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2026:ODJK3Z44TZIGZGTYZ6ZLQRZOV4","target":"record","payload":{"canonical_record":{"source":{"id":"2605.14093","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2026-05-13T20:25:11Z","cross_cats_sorted":[],"title_canon_sha256":"cb5a6e5da6d309bd197a4c9fada2ec41442fca5e687310c40eb77be4163c46f2","abstract_canon_sha256":"043430e1da4601815e44f8c7620a44556c6bda62a048b92d18dbc31c653a853a"},"schema_version":"1.0"},"canonical_sha256":"70d2ade79c9e506c9a78cfb2b8472eaf13e83d3f1058636d55a83543ea2ac714","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:39:12.183866Z","signature_b64":"pKwqmNwjBPiReuogHAppY3PITE7szTa79bF8eDTwvKmzNeyF1xrJ5Bxdb10C0Xw7UYmrFqBT4fq5Eukj3detCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"70d2ade79c9e506c9a78cfb2b8472eaf13e83d3f1058636d55a83543ea2ac714","last_reissued_at":"2026-05-17T23:39:12.183097Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:39:12.183097Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2605.14093","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-17T23:39:12Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"3txaJ7D1uc+BYVwXu5/vSkYIBX3dyJQtBJnoFeP5oRisnob1JOZhtnqiYNs/NNznPly0i/4gC43mgMyjcpd4Ag==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T17:20:36.032897Z"},"content_sha256":"c11bb5271b4b40362764455501445cfbd424c51ee60afaedb229807474b2785e","schema_version":"1.0","event_id":"sha256:c11bb5271b4b40362764455501445cfbd424c51ee60afaedb229807474b2785e"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2026:ODJK3Z44TZIGZGTYZ6ZLQRZOV4","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"New Algorithms for Parity-SAT and Its Bounded-Occurrence Versions","license":"http://creativecommons.org/licenses/by/4.0/","headline":"Randomized algorithms solve Parity-d-occ-SAT in O^*(2^{m(1-1/O(d))}) time for any fixed d.","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Frank Stephan, Haoyun Tang, Junqiang Peng, Mingyu Xiao, Sanjay Jain","submitted_at":"2026-05-13T20:25:11Z","abstract_excerpt":"Parity-SAT is the problem of determining whether a given CNF formula has an odd number of satisfying assignments. As a canonical $\\oplus$P-complete problem, it represents a fundamental variant of the exact model counting problem (#SAT). Under the Strong Exponential Time Hypothesis (SETH), Parity-SAT admits no $O^*((2-\\varepsilon)^n)$-time or $O^*((2-\\varepsilon)^m)$-time algorithm for any constant $\\varepsilon>0$, where $n$ and $m$ denote the numbers of variables and clauses, respectively. Thus, breaking the $2^n$ or $2^m$ barrier appears impossible in full generality.\n  In this work, we revis"},"claims":{"count":4,"items":[{"kind":"strongest_claim","text":"We design a randomized O^*(2^{m(1-1/O(d))})-time algorithm for Parity-d-occ-SAT, thereby breaking the 2^m barrier for every fixed d. For d=2 we obtain O^*(1.1193^n) or O^*(1.3248^m), and for general Parity-SAT an O^*(1.1052^L) algorithm.","source":"verdict.strongest_claim","status":"machine_extracted","claim_id":"C1","attestation":"unclaimed"},{"kind":"weakest_assumption","text":"The algorithms assume that parity can be exploited via structural reductions and branching rules that avoid the overhead of exact counting, without hidden costs that would appear only in a full proof or implementation.","source":"verdict.weakest_assumption","status":"machine_extracted","claim_id":"C2","attestation":"unclaimed"},{"kind":"one_line_summary","text":"New randomized and branching algorithms achieve O*(2^{m(1-1/O(d))}) time for Parity-d-occ-SAT and O*(1.1052^L) time for general Parity-SAT, outperforming exact counting bounds.","source":"verdict.one_line_summary","status":"machine_extracted","claim_id":"C3","attestation":"unclaimed"},{"kind":"headline","text":"Randomized algorithms solve Parity-d-occ-SAT in O^*(2^{m(1-1/O(d))}) time for any fixed d.","source":"verdict.pith_extraction.headline","status":"machine_extracted","claim_id":"C4","attestation":"unclaimed"}],"snapshot_sha256":"5b6e6683f75ce51e0a14a6698aca48d6cb89be388ef6ef94fea00260a34a7c85"},"source":{"id":"2605.14093","kind":"arxiv","version":1},"verdict":{"id":"8d4cd976-1403-468b-9aed-5ca4d8674921","model_set":{"reader":"grok-4.3"},"created_at":"2026-05-15T02:02:37.540963Z","strongest_claim":"We design a randomized O^*(2^{m(1-1/O(d))})-time algorithm for Parity-d-occ-SAT, thereby breaking the 2^m barrier for every fixed d. For d=2 we obtain O^*(1.1193^n) or O^*(1.3248^m), and for general Parity-SAT an O^*(1.1052^L) algorithm.","one_line_summary":"New randomized and branching algorithms achieve O*(2^{m(1-1/O(d))}) time for Parity-d-occ-SAT and O*(1.1052^L) time for general Parity-SAT, outperforming exact counting bounds.","pipeline_version":"pith-pipeline@v0.9.0","weakest_assumption":"The algorithms assume that parity can be exploited via structural reductions and branching rules that avoid the overhead of exact counting, without hidden costs that would appear only in a full proof or implementation.","pith_extraction_headline":"Randomized algorithms solve Parity-d-occ-SAT in O^*(2^{m(1-1/O(d))}) time for any fixed d."},"references":{"count":47,"sample":[{"doi":"","year":1971,"title":"Cook , title =","work_id":"7a1ba4b8-f6e6-4578-b28c-2fac8ba3c03f","ref_index":1,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":1979,"title":"Valiant , title =","work_id":"1aebe9ac-f4b9-4d17-982b-a3e211e28ecf","ref_index":2,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":2003,"title":"Proceedings of the 44th Annual Symposium on Foundations of Computer Science (","work_id":"0742f591-00ad-4b13-a099-94779134da30","ref_index":3,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":1996,"title":"Dan Roth , title =. Artif. Intell. , volume =. 1996 , doi =","work_id":"0df74d66-3e8f-4685-9ec6-6fbfce3b1221","ref_index":4,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":null,"title":"Kautz , title =","work_id":"662a91d3-ed7a-465d-8746-dcd0d31322fb","ref_index":5,"cited_arxiv_id":"","is_internal_anchor":false}],"resolved_work":47,"snapshot_sha256":"7f09ead516086669e4080a6685a242087eddc40410b11be115c25b403c03f248","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":"8d4cd976-1403-468b-9aed-5ca4d8674921"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-17T23:39:12Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"XFXXrb3jnkXes4Cc4qAJq6v6Nr4dzWyXp/mPBzdZz0u2ZwPdEtPFEENJMjeEFL7j+XRYoIPMIg+lBnLCx0FTBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T17:20:36.033692Z"},"content_sha256":"1f04769555acf62d2b8a47e7ecfa36fb704c318c217383ce0d38f6f59b255f81","schema_version":"1.0","event_id":"sha256:1f04769555acf62d2b8a47e7ecfa36fb704c318c217383ce0d38f6f59b255f81"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/ODJK3Z44TZIGZGTYZ6ZLQRZOV4/bundle.json","state_url":"https://pith.science/pith/ODJK3Z44TZIGZGTYZ6ZLQRZOV4/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/ODJK3Z44TZIGZGTYZ6ZLQRZOV4/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-05-27T17:20:36Z","links":{"resolver":"https://pith.science/pith/ODJK3Z44TZIGZGTYZ6ZLQRZOV4","bundle":"https://pith.science/pith/ODJK3Z44TZIGZGTYZ6ZLQRZOV4/bundle.json","state":"https://pith.science/pith/ODJK3Z44TZIGZGTYZ6ZLQRZOV4/state.json","well_known_bundle":"https://pith.science/.well-known/pith/ODJK3Z44TZIGZGTYZ6ZLQRZOV4/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:ODJK3Z44TZIGZGTYZ6ZLQRZOV4","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":"043430e1da4601815e44f8c7620a44556c6bda62a048b92d18dbc31c653a853a","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2026-05-13T20:25:11Z","title_canon_sha256":"cb5a6e5da6d309bd197a4c9fada2ec41442fca5e687310c40eb77be4163c46f2"},"schema_version":"1.0","source":{"id":"2605.14093","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2605.14093","created_at":"2026-05-17T23:39:12Z"},{"alias_kind":"arxiv_version","alias_value":"2605.14093v1","created_at":"2026-05-17T23:39:12Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.14093","created_at":"2026-05-17T23:39:12Z"},{"alias_kind":"pith_short_12","alias_value":"ODJK3Z44TZIG","created_at":"2026-05-18T12:33:37Z"},{"alias_kind":"pith_short_16","alias_value":"ODJK3Z44TZIGZGTY","created_at":"2026-05-18T12:33:37Z"},{"alias_kind":"pith_short_8","alias_value":"ODJK3Z44","created_at":"2026-05-18T12:33:37Z"}],"graph_snapshots":[{"event_id":"sha256:1f04769555acf62d2b8a47e7ecfa36fb704c318c217383ce0d38f6f59b255f81","target":"graph","created_at":"2026-05-17T23:39:12Z","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":4,"items":[{"attestation":"unclaimed","claim_id":"C1","kind":"strongest_claim","source":"verdict.strongest_claim","status":"machine_extracted","text":"We design a randomized O^*(2^{m(1-1/O(d))})-time algorithm for Parity-d-occ-SAT, thereby breaking the 2^m barrier for every fixed d. For d=2 we obtain O^*(1.1193^n) or O^*(1.3248^m), and for general Parity-SAT an O^*(1.1052^L) algorithm."},{"attestation":"unclaimed","claim_id":"C2","kind":"weakest_assumption","source":"verdict.weakest_assumption","status":"machine_extracted","text":"The algorithms assume that parity can be exploited via structural reductions and branching rules that avoid the overhead of exact counting, without hidden costs that would appear only in a full proof or implementation."},{"attestation":"unclaimed","claim_id":"C3","kind":"one_line_summary","source":"verdict.one_line_summary","status":"machine_extracted","text":"New randomized and branching algorithms achieve O*(2^{m(1-1/O(d))}) time for Parity-d-occ-SAT and O*(1.1052^L) time for general Parity-SAT, outperforming exact counting bounds."},{"attestation":"unclaimed","claim_id":"C4","kind":"headline","source":"verdict.pith_extraction.headline","status":"machine_extracted","text":"Randomized algorithms solve Parity-d-occ-SAT in O^*(2^{m(1-1/O(d))}) time for any fixed d."}],"snapshot_sha256":"5b6e6683f75ce51e0a14a6698aca48d6cb89be388ef6ef94fea00260a34a7c85"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"abstract_excerpt":"Parity-SAT is the problem of determining whether a given CNF formula has an odd number of satisfying assignments. As a canonical $\\oplus$P-complete problem, it represents a fundamental variant of the exact model counting problem (#SAT). Under the Strong Exponential Time Hypothesis (SETH), Parity-SAT admits no $O^*((2-\\varepsilon)^n)$-time or $O^*((2-\\varepsilon)^m)$-time algorithm for any constant $\\varepsilon>0$, where $n$ and $m$ denote the numbers of variables and clauses, respectively. Thus, breaking the $2^n$ or $2^m$ barrier appears impossible in full generality.\n  In this work, we revis","authors_text":"Frank Stephan, Haoyun Tang, Junqiang Peng, Mingyu Xiao, Sanjay Jain","cross_cats":[],"headline":"Randomized algorithms solve Parity-d-occ-SAT in O^*(2^{m(1-1/O(d))}) time for any fixed d.","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2026-05-13T20:25:11Z","title":"New Algorithms for Parity-SAT and Its Bounded-Occurrence Versions"},"references":{"count":47,"internal_anchors":0,"resolved_work":47,"sample":[{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":1,"title":"Cook , title =","work_id":"7a1ba4b8-f6e6-4578-b28c-2fac8ba3c03f","year":1971},{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":2,"title":"Valiant , title =","work_id":"1aebe9ac-f4b9-4d17-982b-a3e211e28ecf","year":1979},{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":3,"title":"Proceedings of the 44th Annual Symposium on Foundations of Computer Science (","work_id":"0742f591-00ad-4b13-a099-94779134da30","year":2003},{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":4,"title":"Dan Roth , title =. Artif. Intell. , volume =. 1996 , doi =","work_id":"0df74d66-3e8f-4685-9ec6-6fbfce3b1221","year":1996},{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":5,"title":"Kautz , title =","work_id":"662a91d3-ed7a-465d-8746-dcd0d31322fb","year":null}],"snapshot_sha256":"7f09ead516086669e4080a6685a242087eddc40410b11be115c25b403c03f248"},"source":{"id":"2605.14093","kind":"arxiv","version":1},"verdict":{"created_at":"2026-05-15T02:02:37.540963Z","id":"8d4cd976-1403-468b-9aed-5ca4d8674921","model_set":{"reader":"grok-4.3"},"one_line_summary":"New randomized and branching algorithms achieve O*(2^{m(1-1/O(d))}) time for Parity-d-occ-SAT and O*(1.1052^L) time for general Parity-SAT, outperforming exact counting bounds.","pipeline_version":"pith-pipeline@v0.9.0","pith_extraction_headline":"Randomized algorithms solve Parity-d-occ-SAT in O^*(2^{m(1-1/O(d))}) time for any fixed d.","strongest_claim":"We design a randomized O^*(2^{m(1-1/O(d))})-time algorithm for Parity-d-occ-SAT, thereby breaking the 2^m barrier for every fixed d. For d=2 we obtain O^*(1.1193^n) or O^*(1.3248^m), and for general Parity-SAT an O^*(1.1052^L) algorithm.","weakest_assumption":"The algorithms assume that parity can be exploited via structural reductions and branching rules that avoid the overhead of exact counting, without hidden costs that would appear only in a full proof or implementation."}},"verdict_id":"8d4cd976-1403-468b-9aed-5ca4d8674921"}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:c11bb5271b4b40362764455501445cfbd424c51ee60afaedb229807474b2785e","target":"record","created_at":"2026-05-17T23:39:12Z","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":"043430e1da4601815e44f8c7620a44556c6bda62a048b92d18dbc31c653a853a","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2026-05-13T20:25:11Z","title_canon_sha256":"cb5a6e5da6d309bd197a4c9fada2ec41442fca5e687310c40eb77be4163c46f2"},"schema_version":"1.0","source":{"id":"2605.14093","kind":"arxiv","version":1}},"canonical_sha256":"70d2ade79c9e506c9a78cfb2b8472eaf13e83d3f1058636d55a83543ea2ac714","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"70d2ade79c9e506c9a78cfb2b8472eaf13e83d3f1058636d55a83543ea2ac714","first_computed_at":"2026-05-17T23:39:12.183097Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:39:12.183097Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"pKwqmNwjBPiReuogHAppY3PITE7szTa79bF8eDTwvKmzNeyF1xrJ5Bxdb10C0Xw7UYmrFqBT4fq5Eukj3detCw==","signature_status":"signed_v1","signed_at":"2026-05-17T23:39:12.183866Z","signed_message":"canonical_sha256_bytes"},"source_id":"2605.14093","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:c11bb5271b4b40362764455501445cfbd424c51ee60afaedb229807474b2785e","sha256:1f04769555acf62d2b8a47e7ecfa36fb704c318c217383ce0d38f6f59b255f81"],"state_sha256":"91284d31cb923b6c6a63ec39767590444a4dad49b3791f912bdf21b84839664e"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"IdLLOuUEhfvRoQ/1aoA1J9RQloEbWFyybsPv14mlk8WZtM71sFEAxdYMiVtNCISTy2cJxyc0NWRLdwRSk0+TCg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-27T17:20:36.037491Z","bundle_sha256":"cbb3c440a877eedba55a388a5f423365b7b2de95e964662670367247f61e2e2f"}}