{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2023:NU6DTDT3DSATCYXZ4NW4LCQ4PB","short_pith_number":"pith:NU6DTDT3","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"},"canonical_sha256":"6d3c398e7b1c813162f9e36dc58a1c787ace85b064c636525ba1e024c5dda4b6","source":{"kind":"arxiv","id":"2304.09445","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"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2023:NU6DTDT3DSATCYXZ4NW4LCQ4PB","target":"record","payload":{"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"},"canonical_sha256":"6d3c398e7b1c813162f9e36dc58a1c787ace85b064c636525ba1e024c5dda4b6","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"},"source_kind":"arxiv","source_id":"2304.09445","source_version":6,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-07-05T12:01:17Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ELgUSvOaJInk044smY3Q8KlXvq80B3aivOMHG8kVI2GL+s0+9rBcDsmd7rtvUs6iVWHlOJUimjBfcUxEttGzBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-05T08:02:15.190261Z"},"content_sha256":"26311f323fbf10a92ef87f1ef6d95bbac09e16e72bf9a88411270fe49eb11daf","schema_version":"1.0","event_id":"sha256:26311f323fbf10a92ef87f1ef6d95bbac09e16e72bf9a88411270fe49eb11daf"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2023:NU6DTDT3DSATCYXZ4NW4LCQ4PB","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-07-05T12:01:17Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"XOGxKTMMOEz4+1G/CFmx169ml8H3ZoBnJ7QKZ8KNbSPKnUDDwllCh/63dIp17V9zWAumTQpu7v5NgOYEJFZdCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-05T08:02:15.190770Z"},"content_sha256":"aac90aa77cad7dcf88c5e730929fc33221c73690559d7c96f8281b4a043d7131","schema_version":"1.0","event_id":"sha256:aac90aa77cad7dcf88c5e730929fc33221c73690559d7c96f8281b4a043d7131"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/NU6DTDT3DSATCYXZ4NW4LCQ4PB/bundle.json","state_url":"https://pith.science/pith/NU6DTDT3DSATCYXZ4NW4LCQ4PB/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/NU6DTDT3DSATCYXZ4NW4LCQ4PB/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-08-05T08:02:15Z","links":{"resolver":"https://pith.science/pith/NU6DTDT3DSATCYXZ4NW4LCQ4PB","bundle":"https://pith.science/pith/NU6DTDT3DSATCYXZ4NW4LCQ4PB/bundle.json","state":"https://pith.science/pith/NU6DTDT3DSATCYXZ4NW4LCQ4PB/state.json","well_known_bundle":"https://pith.science/.well-known/pith/NU6DTDT3DSATCYXZ4NW4LCQ4PB/bundle.json"},"state":{"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"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"FhpgZF0SKDeeCt91UOWaLvZ6/sEO7nsn9mm/8c1FI8SYJUq/vJBHyGhazzR2xfFaBBDu0Q9YgegNixkUlCh9Bw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-05T08:02:15.194432Z","bundle_sha256":"dda45a52fb65eaf2b1889d16572936ed09947d07b5448a7479f90a8ab48c03ad"}}