{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2025:KA4A6PN5EKENMEKIIW2RKOPYYN","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":"429e026b649f0b694380aea970a49a528f3bb54f3286e6c57c12a09db65900c9","cross_cats_sorted":["cs.CC","math.IT"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.IT","submitted_at":"2025-02-11T07:11:29Z","title_canon_sha256":"be9f20850400b876cba27d5795765ff8af33179fc94579bf68b5e089954a48c5"},"schema_version":"1.0","source":{"id":"2502.07308","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2502.07308","created_at":"2026-07-05T10:12:35Z"},{"alias_kind":"arxiv_version","alias_value":"2502.07308v1","created_at":"2026-07-05T10:12:35Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2502.07308","created_at":"2026-07-05T10:12:35Z"},{"alias_kind":"pith_short_12","alias_value":"KA4A6PN5EKEN","created_at":"2026-07-05T10:12:35Z"},{"alias_kind":"pith_short_16","alias_value":"KA4A6PN5EKENMEKI","created_at":"2026-07-05T10:12:35Z"},{"alias_kind":"pith_short_8","alias_value":"KA4A6PN5","created_at":"2026-07-05T10:12:35Z"}],"graph_snapshots":[{"event_id":"sha256:572cf08f64417ff04d3e7f241c8975dfb0fd5a74f0c2b32e5e774d928ef9fe78","target":"graph","created_at":"2026-07-05T10:12:35Z","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/2502.07308/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"We construct a new family of explicit codes that are list decodable to capacity and achieve an optimal list size of $O(\\frac{1}{\\epsilon})$. In contrast to existing explicit constructions of codes achieving list decoding capacity, our arguments do not rely on algebraic structure but utilize simple combinatorial properties of expander graphs.\n  Our construction is based on a celebrated distance amplification procedure due to Alon, Edmonds, and Luby [FOCS'95], which transforms any high-rate code into one with near-optimal rate-distance tradeoff. We generalize it to show that the same procedure c","authors_text":"Fernando Granha Jeronimo, Madhur Tulsiani, Shashank Srivastava, Tushant Mittal","cross_cats":["cs.CC","math.IT"],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.IT","submitted_at":"2025-02-11T07:11:29Z","title":"Explicit Codes approaching Generalized Singleton Bound using Expanders"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2502.07308","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:4fc41868d147cdcb724e795c4a6f8bb70abc8abfae86ad9247c22c38c0df94d0","target":"record","created_at":"2026-07-05T10:12:35Z","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":"429e026b649f0b694380aea970a49a528f3bb54f3286e6c57c12a09db65900c9","cross_cats_sorted":["cs.CC","math.IT"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.IT","submitted_at":"2025-02-11T07:11:29Z","title_canon_sha256":"be9f20850400b876cba27d5795765ff8af33179fc94579bf68b5e089954a48c5"},"schema_version":"1.0","source":{"id":"2502.07308","kind":"arxiv","version":1}},"canonical_sha256":"50380f3dbd2288d6114845b51539f8c34e4c2a1d4872b5ba421bf935d4a6d0b6","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"50380f3dbd2288d6114845b51539f8c34e4c2a1d4872b5ba421bf935d4a6d0b6","first_computed_at":"2026-07-05T10:12:35.820053Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T10:12:35.820053Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Tkl7Liq1GB1fFi0Kg2N6V4dBiEBwll+LM4aGPAWhOL4eo3pBQ/1Qy9wU3FKvC/gXeRfGhoB49QfLByUggw+BAQ==","signature_status":"signed_v1","signed_at":"2026-07-05T10:12:35.820606Z","signed_message":"canonical_sha256_bytes"},"source_id":"2502.07308","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:4fc41868d147cdcb724e795c4a6f8bb70abc8abfae86ad9247c22c38c0df94d0","sha256:572cf08f64417ff04d3e7f241c8975dfb0fd5a74f0c2b32e5e774d928ef9fe78"],"state_sha256":"b3bce792f2521e6bb98bd6cabcb80d49a0fbd1fcdac85c866a4d372b1a0e885c"}