{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:OAB7EZWNPINPD3SDBGISR5CKVV","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":"f1d9ee34485c7a559927bde74faa3900b661d63d6849b1585eea1f7f852f5b0c","cross_cats_sorted":["cs.CC","cs.CR","math.CO","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2026-06-23T12:01:54Z","title_canon_sha256":"3b4b650a341a9f3059e34a44abb2cccf824aea995cdc72ac0a7fcb3f2b29928b"},"schema_version":"1.0","source":{"id":"2606.24471","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2606.24471","created_at":"2026-06-24T01:15:31Z"},{"alias_kind":"arxiv_version","alias_value":"2606.24471v1","created_at":"2026-06-24T01:15:31Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2606.24471","created_at":"2026-06-24T01:15:31Z"},{"alias_kind":"pith_short_12","alias_value":"OAB7EZWNPINP","created_at":"2026-06-24T01:15:31Z"},{"alias_kind":"pith_short_16","alias_value":"OAB7EZWNPINPD3SD","created_at":"2026-06-24T01:15:31Z"},{"alias_kind":"pith_short_8","alias_value":"OAB7EZWN","created_at":"2026-06-24T01:15:31Z"}],"graph_snapshots":[{"event_id":"sha256:3fd769798677fe8ee15c8ec7acd1697c8d7cf99f9d7e6bafe25c6a8983cc30c7","target":"graph","created_at":"2026-06-24T01:15: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":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2606.24471/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"We prove that random linear codes have nearly optimal discrepancy properties in a broad range of regimes. Our main results are two general theorems: one controlling all translates of a fixed test, and another controlling large families of Fourier-pseudorandom tests. Two motivating applications follow.\n  First, random linear codes match unstructured random codes for list-decoding from errors above capacity. If $C\\subseteq\\mathbb F_q^n$ is a random linear code of rate $1-\\frac1n\\log_q |B_\\rho|+\\epsilon$, where $B_\\rho$ is a radius-$\\rho$ Hamming ball, then with high probability $$ |C\\cap B|=(1\\p","authors_text":"Dean Doron, Henrique Navas, Jo\\~ao Ribeiro, Jonathan Mosheiff, Nicolas Resch, Tal Leonov","cross_cats":["cs.CC","cs.CR","math.CO","math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2026-06-23T12:01:54Z","title":"Discrepancy for Random Linear Codes"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2606.24471","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:82d2705cb0b94ca7c33fa8f58e8416ab80fca191ac8d1aa66605ae106282ab5e","target":"record","created_at":"2026-06-24T01:15: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":"f1d9ee34485c7a559927bde74faa3900b661d63d6849b1585eea1f7f852f5b0c","cross_cats_sorted":["cs.CC","cs.CR","math.CO","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2026-06-23T12:01:54Z","title_canon_sha256":"3b4b650a341a9f3059e34a44abb2cccf824aea995cdc72ac0a7fcb3f2b29928b"},"schema_version":"1.0","source":{"id":"2606.24471","kind":"arxiv","version":1}},"canonical_sha256":"7003f266cd7a1af1ee43099128f44aad477b1962da147ea424b5cec95196a827","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"7003f266cd7a1af1ee43099128f44aad477b1962da147ea424b5cec95196a827","first_computed_at":"2026-06-24T01:15:31.329382Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-06-24T01:15:31.329382Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"w2ptOZQiNIy+uTZo1iD8IAFj/ycQ5yrCk5BKylzIvVdt8IEtaPDhlR66LhSW5hzoHv3mUBnrOMvXN100io4zCQ==","signature_status":"signed_v1","signed_at":"2026-06-24T01:15:31.329767Z","signed_message":"canonical_sha256_bytes"},"source_id":"2606.24471","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:82d2705cb0b94ca7c33fa8f58e8416ab80fca191ac8d1aa66605ae106282ab5e","sha256:3fd769798677fe8ee15c8ec7acd1697c8d7cf99f9d7e6bafe25c6a8983cc30c7"],"state_sha256":"00a58bffb3af39f5be5ab1e9508bc69233e42ba1f2eba70aa67b8f7592b1b6b6"}