{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2023:NU6DTDT3DSATCYXZ4NW4LCQ4PB","short_pith_number":"pith:NU6DTDT3","schema_version":"1.0","canonical_sha256":"6d3c398e7b1c813162f9e36dc58a1c787ace85b064c636525ba1e024c5dda4b6","source":{"kind":"arxiv","id":"2304.09445","version":6},"attestation_state":"computed","paper":{"title":"Random Reed-Solomon Codes Achieve List-Decoding Capacity With Linear-Sized Alphabets","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.DS","math.CO","math.IT"],"primary_cat":"cs.IT","authors_text":"Omar Alrabiah, Ray Li, Venkatesan Guruswami, Zeyu Guo, Zihan Zhang","submitted_at":"2023-04-19T06:28:54Z","abstract_excerpt":"Reed-Solomon codes are a classic family of error-correcting codes consisting of evaluations of low-degree polynomials over a finite field on some sequence of distinct field elements. They are widely known for their optimal unique-decoding capabilities, but their list-decoding capabilities are not fully understood. Given the prevalence of Reed-Solomon codes, a fundamental question in coding theory is determining if Reed-Solomon codes can optimally achieve list-decoding capacity. A recent breakthrough by Brakensiek, Gopi, and Makam established that Reed-Solomon codes are combinatorially list-dec"},"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":"2304.09445","kind":"arxiv","version":6},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.IT","submitted_at":"2023-04-19T06:28:54Z","cross_cats_sorted":["cs.DS","math.CO","math.IT"],"title_canon_sha256":"81ce52a1eef4017082e0b0451fe0576a91f97fe903a0f10ad85248e292d6aff6","abstract_canon_sha256":"c1f3d86c8c374b3bc6b9ba7aba3bdde39fd312eba40e785e766bbff922ea46c9"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T12:01:17.274443Z","signature_b64":"XwHPYfG+Oi+2YTKd+JiF9tkZnOMx0yx4mqkInJECXJ2HbsRnLCU0jNm+Ghdsjn2r375e4NY1i+KibkjXIo9vCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6d3c398e7b1c813162f9e36dc58a1c787ace85b064c636525ba1e024c5dda4b6","last_reissued_at":"2026-07-05T12:01:17.273904Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T12:01:17.273904Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Random Reed-Solomon Codes Achieve List-Decoding Capacity With Linear-Sized Alphabets","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.DS","math.CO","math.IT"],"primary_cat":"cs.IT","authors_text":"Omar Alrabiah, Ray Li, Venkatesan Guruswami, Zeyu Guo, Zihan Zhang","submitted_at":"2023-04-19T06:28:54Z","abstract_excerpt":"Reed-Solomon codes are a classic family of error-correcting codes consisting of evaluations of low-degree polynomials over a finite field on some sequence of distinct field elements. They are widely known for their optimal unique-decoding capabilities, but their list-decoding capabilities are not fully understood. Given the prevalence of Reed-Solomon codes, a fundamental question in coding theory is determining if Reed-Solomon codes can optimally achieve list-decoding capacity. A recent breakthrough by Brakensiek, Gopi, and Makam established that Reed-Solomon codes are combinatorially list-dec"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2304.09445","kind":"arxiv","version":6},"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/2304.09445/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":"2304.09445","created_at":"2026-07-05T12:01:17.273964+00:00"},{"alias_kind":"arxiv_version","alias_value":"2304.09445v6","created_at":"2026-07-05T12:01:17.273964+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2304.09445","created_at":"2026-07-05T12:01:17.273964+00:00"},{"alias_kind":"pith_short_12","alias_value":"NU6DTDT3DSAT","created_at":"2026-07-05T12:01:17.273964+00:00"},{"alias_kind":"pith_short_16","alias_value":"NU6DTDT3DSATCYXZ","created_at":"2026-07-05T12:01:17.273964+00:00"},{"alias_kind":"pith_short_8","alias_value":"NU6DTDT3","created_at":"2026-07-05T12:01:17.273964+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/NU6DTDT3DSATCYXZ4NW4LCQ4PB","json":"https://pith.science/pith/NU6DTDT3DSATCYXZ4NW4LCQ4PB.json","graph_json":"https://pith.science/api/pith-number/NU6DTDT3DSATCYXZ4NW4LCQ4PB/graph.json","events_json":"https://pith.science/api/pith-number/NU6DTDT3DSATCYXZ4NW4LCQ4PB/events.json","paper":"https://pith.science/paper/NU6DTDT3"},"agent_actions":{"view_html":"https://pith.science/pith/NU6DTDT3DSATCYXZ4NW4LCQ4PB","download_json":"https://pith.science/pith/NU6DTDT3DSATCYXZ4NW4LCQ4PB.json","view_paper":"https://pith.science/paper/NU6DTDT3","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2304.09445&json=true","fetch_graph":"https://pith.science/api/pith-number/NU6DTDT3DSATCYXZ4NW4LCQ4PB/graph.json","fetch_events":"https://pith.science/api/pith-number/NU6DTDT3DSATCYXZ4NW4LCQ4PB/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/NU6DTDT3DSATCYXZ4NW4LCQ4PB/action/timestamp_anchor","attest_storage":"https://pith.science/pith/NU6DTDT3DSATCYXZ4NW4LCQ4PB/action/storage_attestation","attest_author":"https://pith.science/pith/NU6DTDT3DSATCYXZ4NW4LCQ4PB/action/author_attestation","sign_citation":"https://pith.science/pith/NU6DTDT3DSATCYXZ4NW4LCQ4PB/action/citation_signature","submit_replication":"https://pith.science/pith/NU6DTDT3DSATCYXZ4NW4LCQ4PB/action/replication_record"}},"created_at":"2026-07-05T12:01:17.273964+00:00","updated_at":"2026-07-05T12:01:17.273964+00:00"}