{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:PISA5JV4B5LICTEYYYODLOT6PD","short_pith_number":"pith:PISA5JV4","schema_version":"1.0","canonical_sha256":"7a240ea6bc0f56814c98c61c35ba7e78e36a6cae8d6b5cedd075edc000d83b10","source":{"kind":"arxiv","id":"2607.05944","version":1},"attestation_state":"computed","paper":{"title":"A Lower Bound for Read-Once Parity Branching Programs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CC","authors_text":"Ben lee Volk","submitted_at":"2026-07-07T07:43:30Z","abstract_excerpt":"We prove an $\\tilde{\\Omega}(n^2)$ lower bound for read-once parity branching programs computing an explicit boolean function on $n$ variables. The previous best lower bound was $\\tilde{\\Omega}(n^{1.5})$. Our lower bound is proved by reducing the problem to a lower bound in algebraic circuit complexity."},"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":"2607.05944","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2026-07-07T07:43:30Z","cross_cats_sorted":[],"title_canon_sha256":"197272132f1e5915be0fee5781fce8e46e60a9e03f1cacfaf663fc13c7d69069","abstract_canon_sha256":"d1d4252feb0a4b093b4130e9cad6b42b420daed4d180a8a4ae5b776ed3b87e48"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-08T01:18:51.171651Z","signature_b64":"JB9DfSWRadQIzjftMtuF2cyD6UzncWBowiLv0UtLzP43dSpZeO8aqhjZvzL3Jj8VlxImejMQ1Noigol+1dmYAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"7a240ea6bc0f56814c98c61c35ba7e78e36a6cae8d6b5cedd075edc000d83b10","last_reissued_at":"2026-07-08T01:18:51.171180Z","signature_status":"signed_v1","first_computed_at":"2026-07-08T01:18:51.171180Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A Lower Bound for Read-Once Parity Branching Programs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CC","authors_text":"Ben lee Volk","submitted_at":"2026-07-07T07:43:30Z","abstract_excerpt":"We prove an $\\tilde{\\Omega}(n^2)$ lower bound for read-once parity branching programs computing an explicit boolean function on $n$ variables. The previous best lower bound was $\\tilde{\\Omega}(n^{1.5})$. Our lower bound is proved by reducing the problem to a lower bound in algebraic circuit complexity."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2607.05944","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/2607.05944/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":"2607.05944","created_at":"2026-07-08T01:18:51.171249+00:00"},{"alias_kind":"arxiv_version","alias_value":"2607.05944v1","created_at":"2026-07-08T01:18:51.171249+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2607.05944","created_at":"2026-07-08T01:18:51.171249+00:00"},{"alias_kind":"pith_short_12","alias_value":"PISA5JV4B5LI","created_at":"2026-07-08T01:18:51.171249+00:00"},{"alias_kind":"pith_short_16","alias_value":"PISA5JV4B5LICTEY","created_at":"2026-07-08T01:18:51.171249+00:00"},{"alias_kind":"pith_short_8","alias_value":"PISA5JV4","created_at":"2026-07-08T01:18:51.171249+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/PISA5JV4B5LICTEYYYODLOT6PD","json":"https://pith.science/pith/PISA5JV4B5LICTEYYYODLOT6PD.json","graph_json":"https://pith.science/api/pith-number/PISA5JV4B5LICTEYYYODLOT6PD/graph.json","events_json":"https://pith.science/api/pith-number/PISA5JV4B5LICTEYYYODLOT6PD/events.json","paper":"https://pith.science/paper/PISA5JV4"},"agent_actions":{"view_html":"https://pith.science/pith/PISA5JV4B5LICTEYYYODLOT6PD","download_json":"https://pith.science/pith/PISA5JV4B5LICTEYYYODLOT6PD.json","view_paper":"https://pith.science/paper/PISA5JV4","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2607.05944&json=true","fetch_graph":"https://pith.science/api/pith-number/PISA5JV4B5LICTEYYYODLOT6PD/graph.json","fetch_events":"https://pith.science/api/pith-number/PISA5JV4B5LICTEYYYODLOT6PD/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/PISA5JV4B5LICTEYYYODLOT6PD/action/timestamp_anchor","attest_storage":"https://pith.science/pith/PISA5JV4B5LICTEYYYODLOT6PD/action/storage_attestation","attest_author":"https://pith.science/pith/PISA5JV4B5LICTEYYYODLOT6PD/action/author_attestation","sign_citation":"https://pith.science/pith/PISA5JV4B5LICTEYYYODLOT6PD/action/citation_signature","submit_replication":"https://pith.science/pith/PISA5JV4B5LICTEYYYODLOT6PD/action/replication_record"}},"created_at":"2026-07-08T01:18:51.171249+00:00","updated_at":"2026-07-08T01:18:51.171249+00:00"}