{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2023:NU6DTDT3DSATCYXZ4NW4LCQ4PB","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":"c1f3d86c8c374b3bc6b9ba7aba3bdde39fd312eba40e785e766bbff922ea46c9","cross_cats_sorted":["cs.DS","math.CO","math.IT"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.IT","submitted_at":"2023-04-19T06:28:54Z","title_canon_sha256":"81ce52a1eef4017082e0b0451fe0576a91f97fe903a0f10ad85248e292d6aff6"},"schema_version":"1.0","source":{"id":"2304.09445","kind":"arxiv","version":6}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2304.09445","created_at":"2026-07-05T12:01:17Z"},{"alias_kind":"arxiv_version","alias_value":"2304.09445v6","created_at":"2026-07-05T12:01:17Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2304.09445","created_at":"2026-07-05T12:01:17Z"},{"alias_kind":"pith_short_12","alias_value":"NU6DTDT3DSAT","created_at":"2026-07-05T12:01:17Z"},{"alias_kind":"pith_short_16","alias_value":"NU6DTDT3DSATCYXZ","created_at":"2026-07-05T12:01:17Z"},{"alias_kind":"pith_short_8","alias_value":"NU6DTDT3","created_at":"2026-07-05T12:01:17Z"}],"graph_snapshots":[{"event_id":"sha256:aac90aa77cad7dcf88c5e730929fc33221c73690559d7c96f8281b4a043d7131","target":"graph","created_at":"2026-07-05T12:01:17Z","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/2304.09445/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"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","authors_text":"Omar Alrabiah, Ray Li, Venkatesan Guruswami, Zeyu Guo, Zihan Zhang","cross_cats":["cs.DS","math.CO","math.IT"],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.IT","submitted_at":"2023-04-19T06:28:54Z","title":"Random Reed-Solomon Codes Achieve List-Decoding Capacity With Linear-Sized Alphabets"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2304.09445","kind":"arxiv","version":6},"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:26311f323fbf10a92ef87f1ef6d95bbac09e16e72bf9a88411270fe49eb11daf","target":"record","created_at":"2026-07-05T12:01:17Z","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":"c1f3d86c8c374b3bc6b9ba7aba3bdde39fd312eba40e785e766bbff922ea46c9","cross_cats_sorted":["cs.DS","math.CO","math.IT"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.IT","submitted_at":"2023-04-19T06:28:54Z","title_canon_sha256":"81ce52a1eef4017082e0b0451fe0576a91f97fe903a0f10ad85248e292d6aff6"},"schema_version":"1.0","source":{"id":"2304.09445","kind":"arxiv","version":6}},"canonical_sha256":"6d3c398e7b1c813162f9e36dc58a1c787ace85b064c636525ba1e024c5dda4b6","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"6d3c398e7b1c813162f9e36dc58a1c787ace85b064c636525ba1e024c5dda4b6","first_computed_at":"2026-07-05T12:01:17.273904Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T12:01:17.273904Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"XwHPYfG+Oi+2YTKd+JiF9tkZnOMx0yx4mqkInJECXJ2HbsRnLCU0jNm+Ghdsjn2r375e4NY1i+KibkjXIo9vCA==","signature_status":"signed_v1","signed_at":"2026-07-05T12:01:17.274443Z","signed_message":"canonical_sha256_bytes"},"source_id":"2304.09445","source_kind":"arxiv","source_version":6}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:26311f323fbf10a92ef87f1ef6d95bbac09e16e72bf9a88411270fe49eb11daf","sha256:aac90aa77cad7dcf88c5e730929fc33221c73690559d7c96f8281b4a043d7131"],"state_sha256":"9f0f15aec31a0a07d92b5d5ede851978286fc799909d4feda3d42d24c863135c"}