{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:PISA5JV4B5LICTEYYYODLOT6PD","merge_version":"pith-open-graph-merge-v1","event_count":3,"valid_event_count":3,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"d1d4252feb0a4b093b4130e9cad6b42b420daed4d180a8a4ae5b776ed3b87e48","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2026-07-07T07:43:30Z","title_canon_sha256":"197272132f1e5915be0fee5781fce8e46e60a9e03f1cacfaf663fc13c7d69069"},"schema_version":"1.0","source":{"id":"2607.05944","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2607.05944","created_at":"2026-07-08T01:18:51Z"},{"alias_kind":"arxiv_version","alias_value":"2607.05944v1","created_at":"2026-07-08T01:18:51Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2607.05944","created_at":"2026-07-08T01:18:51Z"},{"alias_kind":"pith_short_12","alias_value":"PISA5JV4B5LI","created_at":"2026-07-08T01:18:51Z"},{"alias_kind":"pith_short_16","alias_value":"PISA5JV4B5LICTEY","created_at":"2026-07-08T01:18:51Z"},{"alias_kind":"pith_short_8","alias_value":"PISA5JV4","created_at":"2026-07-08T01:18:51Z"}],"graph_snapshots":[{"event_id":"sha256:aa760d29152d1b5f01ae950f902f468a1c348e5dac22690f282b20a71ecd212a","target":"graph","created_at":"2026-07-08T01:18:51Z","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/2607.05944/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"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.","authors_text":"Ben lee Volk","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2026-07-07T07:43:30Z","title":"A Lower Bound for Read-Once Parity Branching Programs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2607.05944","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:ce70a1164ba6ecb2e39b8dc82d4fabd6f325bc15f0152f8ded9040d325b79115","target":"record","created_at":"2026-07-08T01:18:51Z","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":"d1d4252feb0a4b093b4130e9cad6b42b420daed4d180a8a4ae5b776ed3b87e48","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2026-07-07T07:43:30Z","title_canon_sha256":"197272132f1e5915be0fee5781fce8e46e60a9e03f1cacfaf663fc13c7d69069"},"schema_version":"1.0","source":{"id":"2607.05944","kind":"arxiv","version":1}},"canonical_sha256":"7a240ea6bc0f56814c98c61c35ba7e78e36a6cae8d6b5cedd075edc000d83b10","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"7a240ea6bc0f56814c98c61c35ba7e78e36a6cae8d6b5cedd075edc000d83b10","first_computed_at":"2026-07-08T01:18:51.171180Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-08T01:18:51.171180Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"JB9DfSWRadQIzjftMtuF2cyD6UzncWBowiLv0UtLzP43dSpZeO8aqhjZvzL3Jj8VlxImejMQ1Noigol+1dmYAA==","signature_status":"signed_v1","signed_at":"2026-07-08T01:18:51.171651Z","signed_message":"canonical_sha256_bytes"},"source_id":"2607.05944","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:ce70a1164ba6ecb2e39b8dc82d4fabd6f325bc15f0152f8ded9040d325b79115","sha256:aa760d29152d1b5f01ae950f902f468a1c348e5dac22690f282b20a71ecd212a","sha256:9285ba6d4b2e5f1f70dd3bccab3ab3abe3ce21b2a996674e6c5d383e0ac59c04"],"state_sha256":"3311b9b26d982379083cefa7cc5736d09569ea9ac356c4e8e61f9c916554064c"}