{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:RIZW3CCRNY2MJUNBKTNLCSJ7V7","short_pith_number":"pith:RIZW3CCR","schema_version":"1.0","canonical_sha256":"8a336d88516e34c4d1a154dab1493fafcc4644892d113db9d1e508b8ef477d83","source":{"kind":"arxiv","id":"2505.05935","version":1},"attestation_state":"computed","paper":{"title":"List-Recovery of Random Linear Codes over Small Fields","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Dean Doron, Jo\\~ao Ribeiro, Jonathan Mosheiff, Nicolas Resch","submitted_at":"2025-05-09T10:26:12Z","abstract_excerpt":"We study list-recoverability of random linear codes over small fields, both from errors and from erasures. We consider codes of rate $\\epsilon$-close to capacity, and aim to bound the dependence of the output list size $L$ on $\\epsilon$, the input list size $\\ell$, and the alphabet size $q$. Prior to our work, the best upper bound was $L = q^{O(\\ell/\\epsilon)}$ (Zyablov and Pinsker, Prob. Per. Inf. 1981).\n  Previous work has identified cases in which linear codes provably perform worse than non-linear codes with respect to list-recovery. While there exist non-linear codes that achieve $L=O(\\el"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"2505.05935","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.IT","submitted_at":"2025-05-09T10:26:12Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"1d60801d1e16d7c435a39d8d46211e471e9f43dc8a6581111ef53384c00ed80e","abstract_canon_sha256":"79374a41b4dcdfa601d9c0068386c7d3584a778194f384a75993961e4b204c73"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:00:50.088606Z","signature_b64":"TdFKUlOuxJIdJu1V8XM2BTmSzpyCaxkCSOfVV0o62NH8wSrXnPTv4hd17EL7NAp/gtK7HyBKHzz3KNNG9qe0AA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8a336d88516e34c4d1a154dab1493fafcc4644892d113db9d1e508b8ef477d83","last_reissued_at":"2026-07-05T11:00:50.087993Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:00:50.087993Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"List-Recovery of Random Linear Codes over Small Fields","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Dean Doron, Jo\\~ao Ribeiro, Jonathan Mosheiff, Nicolas Resch","submitted_at":"2025-05-09T10:26:12Z","abstract_excerpt":"We study list-recoverability of random linear codes over small fields, both from errors and from erasures. We consider codes of rate $\\epsilon$-close to capacity, and aim to bound the dependence of the output list size $L$ on $\\epsilon$, the input list size $\\ell$, and the alphabet size $q$. Prior to our work, the best upper bound was $L = q^{O(\\ell/\\epsilon)}$ (Zyablov and Pinsker, Prob. Per. Inf. 1981).\n  Previous work has identified cases in which linear codes provably perform worse than non-linear codes with respect to list-recovery. While there exist non-linear codes that achieve $L=O(\\el"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2505.05935","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/2505.05935/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"},"aliases":[{"alias_kind":"arxiv","alias_value":"2505.05935","created_at":"2026-07-05T11:00:50.088143+00:00"},{"alias_kind":"arxiv_version","alias_value":"2505.05935v1","created_at":"2026-07-05T11:00:50.088143+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2505.05935","created_at":"2026-07-05T11:00:50.088143+00:00"},{"alias_kind":"pith_short_12","alias_value":"RIZW3CCRNY2M","created_at":"2026-07-05T11:00:50.088143+00:00"},{"alias_kind":"pith_short_16","alias_value":"RIZW3CCRNY2MJUNB","created_at":"2026-07-05T11:00:50.088143+00:00"},{"alias_kind":"pith_short_8","alias_value":"RIZW3CCR","created_at":"2026-07-05T11:00:50.088143+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/RIZW3CCRNY2MJUNBKTNLCSJ7V7","json":"https://pith.science/pith/RIZW3CCRNY2MJUNBKTNLCSJ7V7.json","graph_json":"https://pith.science/api/pith-number/RIZW3CCRNY2MJUNBKTNLCSJ7V7/graph.json","events_json":"https://pith.science/api/pith-number/RIZW3CCRNY2MJUNBKTNLCSJ7V7/events.json","paper":"https://pith.science/paper/RIZW3CCR"},"agent_actions":{"view_html":"https://pith.science/pith/RIZW3CCRNY2MJUNBKTNLCSJ7V7","download_json":"https://pith.science/pith/RIZW3CCRNY2MJUNBKTNLCSJ7V7.json","view_paper":"https://pith.science/paper/RIZW3CCR","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2505.05935&json=true","fetch_graph":"https://pith.science/api/pith-number/RIZW3CCRNY2MJUNBKTNLCSJ7V7/graph.json","fetch_events":"https://pith.science/api/pith-number/RIZW3CCRNY2MJUNBKTNLCSJ7V7/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/RIZW3CCRNY2MJUNBKTNLCSJ7V7/action/timestamp_anchor","attest_storage":"https://pith.science/pith/RIZW3CCRNY2MJUNBKTNLCSJ7V7/action/storage_attestation","attest_author":"https://pith.science/pith/RIZW3CCRNY2MJUNBKTNLCSJ7V7/action/author_attestation","sign_citation":"https://pith.science/pith/RIZW3CCRNY2MJUNBKTNLCSJ7V7/action/citation_signature","submit_replication":"https://pith.science/pith/RIZW3CCRNY2MJUNBKTNLCSJ7V7/action/replication_record"}},"created_at":"2026-07-05T11:00:50.088143+00:00","updated_at":"2026-07-05T11:00:50.088143+00:00"}