{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:FJJJXFHGI5QCRRONX3PKUVRQSF","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":"e879f7e2361ca499a4b134519241fa83eb0505bd042bc62c88ab3001aa1422ba","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"quant-ph","submitted_at":"2026-04-28T11:05:20Z","title_canon_sha256":"b2de9d37f35851793a5851da15708e06a46099643f9ea54a4669acd6b8a07822"},"schema_version":"1.0","source":{"id":"2604.25503","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2604.25503","created_at":"2026-05-26T01:03:31Z"},{"alias_kind":"arxiv_version","alias_value":"2604.25503v3","created_at":"2026-05-26T01:03:31Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2604.25503","created_at":"2026-05-26T01:03:31Z"},{"alias_kind":"pith_short_12","alias_value":"FJJJXFHGI5QC","created_at":"2026-05-26T01:03:31Z"},{"alias_kind":"pith_short_16","alias_value":"FJJJXFHGI5QCRRON","created_at":"2026-05-26T01:03:31Z"},{"alias_kind":"pith_short_8","alias_value":"FJJJXFHG","created_at":"2026-05-26T01:03:31Z"}],"graph_snapshots":[{"event_id":"sha256:181bcf653c986c739d6a1fb0c2f4946f8f69d26115736e251dcb6f75cc85649f","target":"graph","created_at":"2026-05-26T01:03:31Z","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":"the quantum evaluation circuit requires only 3n qubits and O(n^2) two-qubit gates per function query, whereas the classical computation of the exact Gowers U2 norm demands O(2^{2n}) arithmetic operations an exponential overhead that renders it infeasible for n ≳ 25"},{"attestation":"unclaimed","claim_id":"C2","kind":"weakest_assumption","source":"verdict.weakest_assumption","status":"machine_extracted","text":"The quantum circuit correctly evaluates the Gowers U2 norm up to sampling noise that does not derail the genetic algorithm's ability to reach the bent threshold, and that fault-tolerant hardware will be available to run the circuit at the claimed gate counts."},{"attestation":"unclaimed","claim_id":"C3","kind":"one_line_summary","source":"verdict.one_line_summary","status":"machine_extracted","text":"A quantum circuit computes the Gowers U2 norm using 3n qubits and O(n^2) gates to accelerate genetic search for bent Boolean functions, providing exponential advantage over classical O(2^{2n}) evaluation for n greater than 25."},{"attestation":"unclaimed","claim_id":"C4","kind":"headline","source":"verdict.pith_extraction.headline","status":"machine_extracted","text":"Quantum circuit evaluates Gowers U2 norm using 3n qubits and O(n^2) gates for bent function search"}],"snapshot_sha256":"def9ea45b0c068416dae9bc6fa414adc625076b63bb0ec33cb69dd6347a527c5"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"integrity":{"available":true,"clean":true,"detectors_run":[{"findings_count":0,"name":"ai_meta_artifact","ran_at":"2026-05-21T04:39:26.599052Z","status":"completed","version":"1.0.0"},{"findings_count":0,"name":"doi_compliance","ran_at":"2026-05-19T21:06:04.269779Z","status":"completed","version":"1.0.0"}],"endpoint":"/pith/2604.25503/integrity.json","findings":[],"snapshot_sha256":"d5564a49047929ab834dd326a5070d48ed68e554d773c89534cbf0cc2fa9c504","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Bent Boolean functions extremal objects that maximally resist affine approximation are notoriously hard to construct for large numbers of variables. We propose a hybrid quantum-classical genetic algorithm (GA) that uses a quantum circuit to evaluate the Gowers $U_2$ norm as the evolutionary fitness function. Our central contribution is a complexity-theoretic separation: the quantum evaluation circuit requires only $3n$ qubits and $\\bigO(n^2)$ two-qubit gates per function query, whereas the classical computation of the exact Gowers $U_2$ norm demands $\\bigO(2^{2n})$ arithmetic operations an exp","authors_text":"C. A. Jothiwashran, Rajdeep Dwivedi, Sugata Gangopadhyay, Vishvendra Singh Poonia","cross_cats":[],"headline":"Quantum circuit evaluates Gowers U2 norm using 3n qubits and O(n^2) gates for bent function search","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"quant-ph","submitted_at":"2026-04-28T11:05:20Z","title":"Quantum-Accelerated Gowers $U_2$ Norm for Bent Boolean Functions"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2604.25503","kind":"arxiv","version":3},"verdict":{"created_at":"2026-05-07T16:36:16.613412Z","id":"d8eff787-086f-4eea-a29b-0555716f3893","model_set":{"reader":"grok-4.3"},"one_line_summary":"A quantum circuit computes the Gowers U2 norm using 3n qubits and O(n^2) gates to accelerate genetic search for bent Boolean functions, providing exponential advantage over classical O(2^{2n}) evaluation for n greater than 25.","pipeline_version":"pith-pipeline@v0.9.0","pith_extraction_headline":"Quantum circuit evaluates Gowers U2 norm using 3n qubits and O(n^2) gates for bent function search","strongest_claim":"the quantum evaluation circuit requires only 3n qubits and O(n^2) two-qubit gates per function query, whereas the classical computation of the exact Gowers U2 norm demands O(2^{2n}) arithmetic operations an exponential overhead that renders it infeasible for n ≳ 25","weakest_assumption":"The quantum circuit correctly evaluates the Gowers U2 norm up to sampling noise that does not derail the genetic algorithm's ability to reach the bent threshold, and that fault-tolerant hardware will be available to run the circuit at the claimed gate counts."}},"verdict_id":"d8eff787-086f-4eea-a29b-0555716f3893"}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:3ba045f507991ac6e3abc3abe6a84157d45888b4ad69fd29e6944041624c3aef","target":"record","created_at":"2026-05-26T01:03:31Z","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":"e879f7e2361ca499a4b134519241fa83eb0505bd042bc62c88ab3001aa1422ba","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"quant-ph","submitted_at":"2026-04-28T11:05:20Z","title_canon_sha256":"b2de9d37f35851793a5851da15708e06a46099643f9ea54a4669acd6b8a07822"},"schema_version":"1.0","source":{"id":"2604.25503","kind":"arxiv","version":3}},"canonical_sha256":"2a529b94e6476028c5cdbedeaa563091542c36c35a98b014b682538938ec0d6c","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"2a529b94e6476028c5cdbedeaa563091542c36c35a98b014b682538938ec0d6c","first_computed_at":"2026-05-26T01:03:31.289818Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-26T01:03:31.289818Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"D58+rNtsq4s9Xo0uwzeNent3ZYqL4DIExCObw2DO7UNeNwt+1Fphl4D8x10JpdHTxRXMGsS4xdcyZmIJPTAQAw==","signature_status":"signed_v1","signed_at":"2026-05-26T01:03:31.290631Z","signed_message":"canonical_sha256_bytes"},"source_id":"2604.25503","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:3ba045f507991ac6e3abc3abe6a84157d45888b4ad69fd29e6944041624c3aef","sha256:181bcf653c986c739d6a1fb0c2f4946f8f69d26115736e251dcb6f75cc85649f"],"state_sha256":"fe043a44973ff3b7e7a0209e699dc5f177c0886bc5ad2a49229eff5bd968e11e"}