{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2024:JOSF6M3SPF5ZAVULWRS76EKLH7","short_pith_number":"pith:JOSF6M3S","canonical_record":{"source":{"id":"2410.09031","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.IT","submitted_at":"2024-10-11T17:48:43Z","cross_cats_sorted":["cs.CC","math.IT"],"title_canon_sha256":"c1ce7f0afce170385dcb599487849fe0fa490edb82edd82569663aa2e10a3261","abstract_canon_sha256":"e86299cde6ca072a018a1b2e8890b4929106a9c782ab48ce6a8de2862f85c1d5"},"schema_version":"1.0"},"canonical_sha256":"4ba45f3372797b90568bb465ff114b3fe92db17dd934e43dd2399f7862c3dbec","source":{"kind":"arxiv","id":"2410.09031","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2410.09031","created_at":"2026-07-05T09:19:20Z"},{"alias_kind":"arxiv_version","alias_value":"2410.09031v1","created_at":"2026-07-05T09:19:20Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2410.09031","created_at":"2026-07-05T09:19:20Z"},{"alias_kind":"pith_short_12","alias_value":"JOSF6M3SPF5Z","created_at":"2026-07-05T09:19:20Z"},{"alias_kind":"pith_short_16","alias_value":"JOSF6M3SPF5ZAVUL","created_at":"2026-07-05T09:19:20Z"},{"alias_kind":"pith_short_8","alias_value":"JOSF6M3S","created_at":"2026-07-05T09:19:20Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2024:JOSF6M3SPF5ZAVULWRS76EKLH7","target":"record","payload":{"canonical_record":{"source":{"id":"2410.09031","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.IT","submitted_at":"2024-10-11T17:48:43Z","cross_cats_sorted":["cs.CC","math.IT"],"title_canon_sha256":"c1ce7f0afce170385dcb599487849fe0fa490edb82edd82569663aa2e10a3261","abstract_canon_sha256":"e86299cde6ca072a018a1b2e8890b4929106a9c782ab48ce6a8de2862f85c1d5"},"schema_version":"1.0"},"canonical_sha256":"4ba45f3372797b90568bb465ff114b3fe92db17dd934e43dd2399f7862c3dbec","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T09:19:20.962692Z","signature_b64":"sYl6MHPxBbxhwWvJhZlbsDyofD8Z8BzEN3jdz+HFM4Zssjx8ZkrrTRoIi9YWd2PYbJbJjfb2YH3syu4039yYBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"4ba45f3372797b90568bb465ff114b3fe92db17dd934e43dd2399f7862c3dbec","last_reissued_at":"2026-07-05T09:19:20.962272Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T09:19:20.962272Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2410.09031","source_version":1,"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-05T09:19:20Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"7VgUobGpzoyTQu0fwP8TvjlYZjM+LqQpCmaQ/q3C66EjGhXwubFsyoVfohWmqrLp6DxBOvnI9WHkdEp99Uv8DA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-05T01:17:06.943428Z"},"content_sha256":"5688ca72c38088f35380b12a7f74cea3d4698ec50d7b2b75c97022feda2dd55e","schema_version":"1.0","event_id":"sha256:5688ca72c38088f35380b12a7f74cea3d4698ec50d7b2b75c97022feda2dd55e"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2024:JOSF6M3SPF5ZAVULWRS76EKLH7","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Improved List Size for Folded Reed-Solomon Codes","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.CC","math.IT"],"primary_cat":"cs.IT","authors_text":"Shashank Srivastava","submitted_at":"2024-10-11T17:48:43Z","abstract_excerpt":"Folded Reed-Solomon (FRS) codes are variants of Reed-Solomon codes, known for their optimal list decoding radius. We show explicit FRS codes with rate $R$ that can be list decoded up to radius $1-R-\\epsilon$ with lists of size $\\mathcal{O}(1/ \\epsilon^2)$. This improves the best known list size among explicit list decoding capacity achieving codes.\n  We also show a more general result that for any $k\\geq 1$, there are explicit FRS codes with rate $R$ and distance $1-R$ that can be list decoded arbitrarily close to radius $\\frac{k}{k+1}(1-R)$ with lists of size $(k-1)^2+1$.\n  Our results are ba"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2410.09031","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/2410.09031/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-05T09:19:20Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"LswWb2jMeD6V6fzX8J63iE220/rV/GVNWdJG+AQmswG3LH9vnANg0DrC0a44DOoaR4hiI8COHZg0hcqxgVFzBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-05T01:17:06.944231Z"},"content_sha256":"93d76227ff5470bb6168cfa8affb429e0d619db2285be915f0d6924895117dd2","schema_version":"1.0","event_id":"sha256:93d76227ff5470bb6168cfa8affb429e0d619db2285be915f0d6924895117dd2"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/JOSF6M3SPF5ZAVULWRS76EKLH7/bundle.json","state_url":"https://pith.science/pith/JOSF6M3SPF5ZAVULWRS76EKLH7/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/JOSF6M3SPF5ZAVULWRS76EKLH7/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-05T01:17:06Z","links":{"resolver":"https://pith.science/pith/JOSF6M3SPF5ZAVULWRS76EKLH7","bundle":"https://pith.science/pith/JOSF6M3SPF5ZAVULWRS76EKLH7/bundle.json","state":"https://pith.science/pith/JOSF6M3SPF5ZAVULWRS76EKLH7/state.json","well_known_bundle":"https://pith.science/.well-known/pith/JOSF6M3SPF5ZAVULWRS76EKLH7/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2024:JOSF6M3SPF5ZAVULWRS76EKLH7","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":"e86299cde6ca072a018a1b2e8890b4929106a9c782ab48ce6a8de2862f85c1d5","cross_cats_sorted":["cs.CC","math.IT"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.IT","submitted_at":"2024-10-11T17:48:43Z","title_canon_sha256":"c1ce7f0afce170385dcb599487849fe0fa490edb82edd82569663aa2e10a3261"},"schema_version":"1.0","source":{"id":"2410.09031","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2410.09031","created_at":"2026-07-05T09:19:20Z"},{"alias_kind":"arxiv_version","alias_value":"2410.09031v1","created_at":"2026-07-05T09:19:20Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2410.09031","created_at":"2026-07-05T09:19:20Z"},{"alias_kind":"pith_short_12","alias_value":"JOSF6M3SPF5Z","created_at":"2026-07-05T09:19:20Z"},{"alias_kind":"pith_short_16","alias_value":"JOSF6M3SPF5ZAVUL","created_at":"2026-07-05T09:19:20Z"},{"alias_kind":"pith_short_8","alias_value":"JOSF6M3S","created_at":"2026-07-05T09:19:20Z"}],"graph_snapshots":[{"event_id":"sha256:93d76227ff5470bb6168cfa8affb429e0d619db2285be915f0d6924895117dd2","target":"graph","created_at":"2026-07-05T09:19:20Z","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/2410.09031/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Folded Reed-Solomon (FRS) codes are variants of Reed-Solomon codes, known for their optimal list decoding radius. We show explicit FRS codes with rate $R$ that can be list decoded up to radius $1-R-\\epsilon$ with lists of size $\\mathcal{O}(1/ \\epsilon^2)$. This improves the best known list size among explicit list decoding capacity achieving codes.\n  We also show a more general result that for any $k\\geq 1$, there are explicit FRS codes with rate $R$ and distance $1-R$ that can be list decoded arbitrarily close to radius $\\frac{k}{k+1}(1-R)$ with lists of size $(k-1)^2+1$.\n  Our results are ba","authors_text":"Shashank Srivastava","cross_cats":["cs.CC","math.IT"],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.IT","submitted_at":"2024-10-11T17:48:43Z","title":"Improved List Size for Folded Reed-Solomon Codes"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2410.09031","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:5688ca72c38088f35380b12a7f74cea3d4698ec50d7b2b75c97022feda2dd55e","target":"record","created_at":"2026-07-05T09:19:20Z","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":"e86299cde6ca072a018a1b2e8890b4929106a9c782ab48ce6a8de2862f85c1d5","cross_cats_sorted":["cs.CC","math.IT"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.IT","submitted_at":"2024-10-11T17:48:43Z","title_canon_sha256":"c1ce7f0afce170385dcb599487849fe0fa490edb82edd82569663aa2e10a3261"},"schema_version":"1.0","source":{"id":"2410.09031","kind":"arxiv","version":1}},"canonical_sha256":"4ba45f3372797b90568bb465ff114b3fe92db17dd934e43dd2399f7862c3dbec","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"4ba45f3372797b90568bb465ff114b3fe92db17dd934e43dd2399f7862c3dbec","first_computed_at":"2026-07-05T09:19:20.962272Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T09:19:20.962272Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"sYl6MHPxBbxhwWvJhZlbsDyofD8Z8BzEN3jdz+HFM4Zssjx8ZkrrTRoIi9YWd2PYbJbJjfb2YH3syu4039yYBQ==","signature_status":"signed_v1","signed_at":"2026-07-05T09:19:20.962692Z","signed_message":"canonical_sha256_bytes"},"source_id":"2410.09031","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:5688ca72c38088f35380b12a7f74cea3d4698ec50d7b2b75c97022feda2dd55e","sha256:93d76227ff5470bb6168cfa8affb429e0d619db2285be915f0d6924895117dd2"],"state_sha256":"221857627b28d47ba420b497a5b87ecfc49c448154acd8f50e15d7e87584a337"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"C/w1IIGTqc/0hTiGHBXZdbnnciq1kgd30R9NHIcrWAFMRorQM1WOKqdjhYKxWuKphOexzTZQZaJNU2u9fNeJBA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-05T01:17:06.960256Z","bundle_sha256":"fb761007699da6db9016bf06a9b6cc4127bafad3e591b3c00b9839f00a3701b8"}}