{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2025:253FXPRCLJHFBEVIHY44L2EYMH","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":"6bb6375a2c1499e74203fba9c19c841e6c7af4f8585cc4f97e8d497ff5248445","cross_cats_sorted":["math.CO","math.IT"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.IT","submitted_at":"2025-02-19T17:02:36Z","title_canon_sha256":"960f6ea4da40cff1799c52554985dab23a6e8d02ffc3f5e23720a1a96665b674"},"schema_version":"1.0","source":{"id":"2502.13877","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2502.13877","created_at":"2026-07-05T10:21:30Z"},{"alias_kind":"arxiv_version","alias_value":"2502.13877v2","created_at":"2026-07-05T10:21:30Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2502.13877","created_at":"2026-07-05T10:21:30Z"},{"alias_kind":"pith_short_12","alias_value":"253FXPRCLJHF","created_at":"2026-07-05T10:21:30Z"},{"alias_kind":"pith_short_16","alias_value":"253FXPRCLJHFBEVI","created_at":"2026-07-05T10:21:30Z"},{"alias_kind":"pith_short_8","alias_value":"253FXPRC","created_at":"2026-07-05T10:21:30Z"}],"graph_snapshots":[{"event_id":"sha256:1a19e2097975f018c9b08354174fb64734565eb26d29dec7502ed9ad31ed5cd7","target":"graph","created_at":"2026-07-05T10:21:30Z","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.13877/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"We prove several results on linear codes achieving list-recovery capacity. We show that random linear codes achieve list-recovery capacity with constant output list size (independent of the alphabet size and length). That is, over alphabets of size at least $\\ell^{\\Omega(1/\\varepsilon)}$, random linear codes of rate $R$ are $(1-R-\\varepsilon, \\ell, (\\ell/\\varepsilon)^{O(\\ell/\\varepsilon)})$-list-recoverable for all $R\\in(0,1)$ and $\\ell$. Together with a result of Levi, Mosheiff, and Shagrithaya, this implies that randomly punctured Reed-Solomon codes also achieve list-recovery capacity. We al","authors_text":"Nikhil Shagrithaya, Ray Li","cross_cats":["math.CO","math.IT"],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.IT","submitted_at":"2025-02-19T17:02:36Z","title":"Near-Optimal List-Recovery of Linear Code Families"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2502.13877","kind":"arxiv","version":2},"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:d389daa44433f00fb90d2224c85d133da08a109d5baf0b1163886b1332be0a35","target":"record","created_at":"2026-07-05T10:21:30Z","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":"6bb6375a2c1499e74203fba9c19c841e6c7af4f8585cc4f97e8d497ff5248445","cross_cats_sorted":["math.CO","math.IT"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.IT","submitted_at":"2025-02-19T17:02:36Z","title_canon_sha256":"960f6ea4da40cff1799c52554985dab23a6e8d02ffc3f5e23720a1a96665b674"},"schema_version":"1.0","source":{"id":"2502.13877","kind":"arxiv","version":2}},"canonical_sha256":"d7765bbe225a4e5092a83e39c5e89861d1ffde16b57769bec998bf7b00e5b5e0","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"d7765bbe225a4e5092a83e39c5e89861d1ffde16b57769bec998bf7b00e5b5e0","first_computed_at":"2026-07-05T10:21:30.181004Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T10:21:30.181004Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"M4Gz0ro1ZkOuIBBppzpMOppJ6Yp2LOO5D9csVqkOdlI3c9H0jw+5nCxh7uYxTdwultbPiiDbeKlAgVpdfzoDBQ==","signature_status":"signed_v1","signed_at":"2026-07-05T10:21:30.181494Z","signed_message":"canonical_sha256_bytes"},"source_id":"2502.13877","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:d389daa44433f00fb90d2224c85d133da08a109d5baf0b1163886b1332be0a35","sha256:1a19e2097975f018c9b08354174fb64734565eb26d29dec7502ed9ad31ed5cd7"],"state_sha256":"23d03f46d204f4f17d1a4b08ae1ddfb7834e468bc215af3ebb0935349b222b94"}