{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2026:PISA5JV4B5LICTEYYYODLOT6PD","short_pith_number":"pith:PISA5JV4","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"},"canonical_sha256":"7a240ea6bc0f56814c98c61c35ba7e78e36a6cae8d6b5cedd075edc000d83b10","source":{"kind":"arxiv","id":"2607.05944","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"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2026:PISA5JV4B5LICTEYYYODLOT6PD","target":"record","payload":{"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"},"canonical_sha256":"7a240ea6bc0f56814c98c61c35ba7e78e36a6cae8d6b5cedd075edc000d83b10","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"},"source_kind":"arxiv","source_id":"2607.05944","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-07-08T01:18:51Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"J1P4pTymFQE6AHy0V9OD9hrMOtblnMKPJUoJXTu1oUaqjpXjQo9hoycxOmeg6jrN7yBKzCFBfQWb+UkdHqJaBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-12T10:37:15.201908Z"},"content_sha256":"ce70a1164ba6ecb2e39b8dc82d4fabd6f325bc15f0152f8ded9040d325b79115","schema_version":"1.0","event_id":"sha256:ce70a1164ba6ecb2e39b8dc82d4fabd6f325bc15f0152f8ded9040d325b79115"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2026:PISA5JV4B5LICTEYYYODLOT6PD","target":"graph","payload":{"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"},"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-07-08T01:18:51Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"/BO1vIyKlZnAp7RmwJlWmGz9XX7KsYmRf/OUcJ17oseL+G3WXx1Xc27GxHYNWUW0KHrhC1JPAqeySpiaYGj3BQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-12T10:37:15.202787Z"},"content_sha256":"aa760d29152d1b5f01ae950f902f468a1c348e5dac22690f282b20a71ecd212a","schema_version":"1.0","event_id":"sha256:aa760d29152d1b5f01ae950f902f468a1c348e5dac22690f282b20a71ecd212a"},{"event_type":"integrity_finding","subject_pith_number":"pith:2026:PISA5JV4B5LICTEYYYODLOT6PD","target":"integrity","payload":{"note":"DOI in the printed bibliography is fragmented by whitespace or line breaks. A longer candidate (10.1007/978-3-540-45138-9\\_23) was visible in the surrounding text but could not be confirmed against doi.org as printed.","snippet":"Henrik Brosenne, Matthias Homeister, and Stephan Waack. http://dx.doi.org/10.1007/978-3-540-45138-9\\_23 Lower Bounds for General Graph-Driven Read-Once Parity Branching Programs . In Mathematical Foundations of Computer Science (MFCS) , vol","arxiv_id":"2607.05944","detector":"doi_compliance","evidence":{"ref_index":3,"verdict_class":"incontrovertible","resolved_title":null,"printed_excerpt":"Henrik Brosenne, Matthias Homeister, and Stephan Waack. http://dx.doi.org/10.1007/978-3-540-45138-9\\_23 Lower Bounds for General Graph-Driven Read-Once Parity Branching Programs . In Mathematical Foundations of Computer Science (MFCS) , vol","reconstructed_doi":"10.1007/978-3-540-45138-9\\_23"},"severity":"advisory","ref_index":3,"audited_at":"2026-07-09T07:50:06.109921Z","event_type":"pith.integrity.v1","detected_doi":"10.1007/978-3-540-45138-9\\_23","detector_url":"https://pith.science/pith-integrity-protocol#doi_compliance","external_url":null,"finding_type":"recoverable_identifier","evidence_hash":"8b396683ec1143950f2a56047c2579302df5c2e1547fe2a017a428dcb702c47e","paper_version":1,"verdict_class":"incontrovertible","resolved_title":null,"detector_version":"1.0.0","detected_arxiv_id":null,"integrity_event_id":7842,"payload_sha256":"18a207c866a06b04536b2e39cfecbf325762468fa11a9435e3b1f245c2fc129b","signature_b64":"WqReDmCHjl9xsmumXrPjewqeLP3AKmC9gdBSfK/PNlONs/T6xGHt0Cn4quPITd2zsWjiFvYNl0b/Ryc89VixAw==","signing_key_id":"pith-v1-2026-05"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-07-09T07:52:21Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"XbgwJLMf/cL8k5IclxthdsAGpW5QqyRE9Wg5KgAAeJI6kE2tS9t7/Zw8rdVgI+auW9kkIBALcSp4PXx4csfHCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-12T10:37:15.208168Z"},"content_sha256":"9285ba6d4b2e5f1f70dd3bccab3ab3abe3ce21b2a996674e6c5d383e0ac59c04","schema_version":"1.0","event_id":"sha256:9285ba6d4b2e5f1f70dd3bccab3ab3abe3ce21b2a996674e6c5d383e0ac59c04"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/PISA5JV4B5LICTEYYYODLOT6PD/bundle.json","state_url":"https://pith.science/pith/PISA5JV4B5LICTEYYYODLOT6PD/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/PISA5JV4B5LICTEYYYODLOT6PD/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-08-12T10:37:15Z","links":{"resolver":"https://pith.science/pith/PISA5JV4B5LICTEYYYODLOT6PD","bundle":"https://pith.science/pith/PISA5JV4B5LICTEYYYODLOT6PD/bundle.json","state":"https://pith.science/pith/PISA5JV4B5LICTEYYYODLOT6PD/state.json","well_known_bundle":"https://pith.science/.well-known/pith/PISA5JV4B5LICTEYYYODLOT6PD/bundle.json"},"state":{"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"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"M5t3rikuPPpVDAlIJm7S/Ul2GVERCp774kweO5HcNYrLMgsVMYJDcL7nLbx/zKtRs80DDKTWyZwUuShzLiyyAQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-12T10:37:15.211807Z","bundle_sha256":"3ede5c099025b78afa45b93798fc1d5311acce877464413feff318be2f6ef380"}}