{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:OAB7EZWNPINPD3SDBGISR5CKVV","short_pith_number":"pith:OAB7EZWN","schema_version":"1.0","canonical_sha256":"7003f266cd7a1af1ee43099128f44aad477b1962da147ea424b5cec95196a827","source":{"kind":"arxiv","id":"2606.24471","version":1},"attestation_state":"computed","paper":{"title":"Discrepancy for Random Linear Codes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC","cs.CR","math.CO","math.IT"],"primary_cat":"cs.IT","authors_text":"Dean Doron, Henrique Navas, Jo\\~ao Ribeiro, Jonathan Mosheiff, Nicolas Resch, Tal Leonov","submitted_at":"2026-06-23T12:01:54Z","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"},"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":"2606.24471","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2026-06-23T12:01:54Z","cross_cats_sorted":["cs.CC","cs.CR","math.CO","math.IT"],"title_canon_sha256":"3b4b650a341a9f3059e34a44abb2cccf824aea995cdc72ac0a7fcb3f2b29928b","abstract_canon_sha256":"f1d9ee34485c7a559927bde74faa3900b661d63d6849b1585eea1f7f852f5b0c"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-06-24T01:15:31.329767Z","signature_b64":"w2ptOZQiNIy+uTZo1iD8IAFj/ycQ5yrCk5BKylzIvVdt8IEtaPDhlR66LhSW5hzoHv3mUBnrOMvXN100io4zCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"7003f266cd7a1af1ee43099128f44aad477b1962da147ea424b5cec95196a827","last_reissued_at":"2026-06-24T01:15:31.329382Z","signature_status":"signed_v1","first_computed_at":"2026-06-24T01:15:31.329382Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Discrepancy for Random Linear Codes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC","cs.CR","math.CO","math.IT"],"primary_cat":"cs.IT","authors_text":"Dean Doron, Henrique Navas, Jo\\~ao Ribeiro, Jonathan Mosheiff, Nicolas Resch, Tal Leonov","submitted_at":"2026-06-23T12:01:54Z","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"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2606.24471","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/2606.24471/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":"2606.24471","created_at":"2026-06-24T01:15:31.329450+00:00"},{"alias_kind":"arxiv_version","alias_value":"2606.24471v1","created_at":"2026-06-24T01:15:31.329450+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2606.24471","created_at":"2026-06-24T01:15:31.329450+00:00"},{"alias_kind":"pith_short_12","alias_value":"OAB7EZWNPINP","created_at":"2026-06-24T01:15:31.329450+00:00"},{"alias_kind":"pith_short_16","alias_value":"OAB7EZWNPINPD3SD","created_at":"2026-06-24T01:15:31.329450+00:00"},{"alias_kind":"pith_short_8","alias_value":"OAB7EZWN","created_at":"2026-06-24T01:15:31.329450+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/OAB7EZWNPINPD3SDBGISR5CKVV","json":"https://pith.science/pith/OAB7EZWNPINPD3SDBGISR5CKVV.json","graph_json":"https://pith.science/api/pith-number/OAB7EZWNPINPD3SDBGISR5CKVV/graph.json","events_json":"https://pith.science/api/pith-number/OAB7EZWNPINPD3SDBGISR5CKVV/events.json","paper":"https://pith.science/paper/OAB7EZWN"},"agent_actions":{"view_html":"https://pith.science/pith/OAB7EZWNPINPD3SDBGISR5CKVV","download_json":"https://pith.science/pith/OAB7EZWNPINPD3SDBGISR5CKVV.json","view_paper":"https://pith.science/paper/OAB7EZWN","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2606.24471&json=true","fetch_graph":"https://pith.science/api/pith-number/OAB7EZWNPINPD3SDBGISR5CKVV/graph.json","fetch_events":"https://pith.science/api/pith-number/OAB7EZWNPINPD3SDBGISR5CKVV/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/OAB7EZWNPINPD3SDBGISR5CKVV/action/timestamp_anchor","attest_storage":"https://pith.science/pith/OAB7EZWNPINPD3SDBGISR5CKVV/action/storage_attestation","attest_author":"https://pith.science/pith/OAB7EZWNPINPD3SDBGISR5CKVV/action/author_attestation","sign_citation":"https://pith.science/pith/OAB7EZWNPINPD3SDBGISR5CKVV/action/citation_signature","submit_replication":"https://pith.science/pith/OAB7EZWNPINPD3SDBGISR5CKVV/action/replication_record"}},"created_at":"2026-06-24T01:15:31.329450+00:00","updated_at":"2026-06-24T01:15:31.329450+00:00"}