{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2025:RIZW3CCRNY2MJUNBKTNLCSJ7V7","short_pith_number":"pith:RIZW3CCR","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"},"canonical_sha256":"8a336d88516e34c4d1a154dab1493fafcc4644892d113db9d1e508b8ef477d83","source":{"kind":"arxiv","id":"2505.05935","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2505.05935","created_at":"2026-07-05T11:00:50Z"},{"alias_kind":"arxiv_version","alias_value":"2505.05935v1","created_at":"2026-07-05T11:00:50Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2505.05935","created_at":"2026-07-05T11:00:50Z"},{"alias_kind":"pith_short_12","alias_value":"RIZW3CCRNY2M","created_at":"2026-07-05T11:00:50Z"},{"alias_kind":"pith_short_16","alias_value":"RIZW3CCRNY2MJUNB","created_at":"2026-07-05T11:00:50Z"},{"alias_kind":"pith_short_8","alias_value":"RIZW3CCR","created_at":"2026-07-05T11:00:50Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2025:RIZW3CCRNY2MJUNBKTNLCSJ7V7","target":"record","payload":{"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"},"canonical_sha256":"8a336d88516e34c4d1a154dab1493fafcc4644892d113db9d1e508b8ef477d83","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"},"source_kind":"arxiv","source_id":"2505.05935","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-05T11:00:50Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"RJLyYyEhTLR6ms1xmtFJm5eP94XnwjsWdIPKeksFuzEaY/3BFLwZZ+/PLAYDjJSow3FwJBJQuyBI6+QJvm1NCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-17T09:42:18.406828Z"},"content_sha256":"5b64a9192dadd584a033f6cc7f6039b89a15d955789b5513b93fb0d48e0052d1","schema_version":"1.0","event_id":"sha256:5b64a9192dadd584a033f6cc7f6039b89a15d955789b5513b93fb0d48e0052d1"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2025:RIZW3CCRNY2MJUNBKTNLCSJ7V7","target":"graph","payload":{"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"},"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-05T11:00:50Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"O+xRVvfHgSsZPgbrJWMBDkbffzpW0SUKLsG3NFA4xJp8+c7gR+bww447cqK+/woSjMeMQ/gMulilBIz1e5XKBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-17T09:42:18.407362Z"},"content_sha256":"9d70005d13f04b2010e757434eb7c4fa59df21e51570621d1a627b2cf170c81e","schema_version":"1.0","event_id":"sha256:9d70005d13f04b2010e757434eb7c4fa59df21e51570621d1a627b2cf170c81e"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/RIZW3CCRNY2MJUNBKTNLCSJ7V7/bundle.json","state_url":"https://pith.science/pith/RIZW3CCRNY2MJUNBKTNLCSJ7V7/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/RIZW3CCRNY2MJUNBKTNLCSJ7V7/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-17T09:42:18Z","links":{"resolver":"https://pith.science/pith/RIZW3CCRNY2MJUNBKTNLCSJ7V7","bundle":"https://pith.science/pith/RIZW3CCRNY2MJUNBKTNLCSJ7V7/bundle.json","state":"https://pith.science/pith/RIZW3CCRNY2MJUNBKTNLCSJ7V7/state.json","well_known_bundle":"https://pith.science/.well-known/pith/RIZW3CCRNY2MJUNBKTNLCSJ7V7/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2025:RIZW3CCRNY2MJUNBKTNLCSJ7V7","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":"79374a41b4dcdfa601d9c0068386c7d3584a778194f384a75993961e4b204c73","cross_cats_sorted":["math.IT"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.IT","submitted_at":"2025-05-09T10:26:12Z","title_canon_sha256":"1d60801d1e16d7c435a39d8d46211e471e9f43dc8a6581111ef53384c00ed80e"},"schema_version":"1.0","source":{"id":"2505.05935","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2505.05935","created_at":"2026-07-05T11:00:50Z"},{"alias_kind":"arxiv_version","alias_value":"2505.05935v1","created_at":"2026-07-05T11:00:50Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2505.05935","created_at":"2026-07-05T11:00:50Z"},{"alias_kind":"pith_short_12","alias_value":"RIZW3CCRNY2M","created_at":"2026-07-05T11:00:50Z"},{"alias_kind":"pith_short_16","alias_value":"RIZW3CCRNY2MJUNB","created_at":"2026-07-05T11:00:50Z"},{"alias_kind":"pith_short_8","alias_value":"RIZW3CCR","created_at":"2026-07-05T11:00:50Z"}],"graph_snapshots":[{"event_id":"sha256:9d70005d13f04b2010e757434eb7c4fa59df21e51570621d1a627b2cf170c81e","target":"graph","created_at":"2026-07-05T11:00:50Z","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/2505.05935/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"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","authors_text":"Dean Doron, Jo\\~ao Ribeiro, Jonathan Mosheiff, Nicolas Resch","cross_cats":["math.IT"],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.IT","submitted_at":"2025-05-09T10:26:12Z","title":"List-Recovery of Random Linear Codes over Small Fields"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2505.05935","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:5b64a9192dadd584a033f6cc7f6039b89a15d955789b5513b93fb0d48e0052d1","target":"record","created_at":"2026-07-05T11:00:50Z","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":"79374a41b4dcdfa601d9c0068386c7d3584a778194f384a75993961e4b204c73","cross_cats_sorted":["math.IT"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.IT","submitted_at":"2025-05-09T10:26:12Z","title_canon_sha256":"1d60801d1e16d7c435a39d8d46211e471e9f43dc8a6581111ef53384c00ed80e"},"schema_version":"1.0","source":{"id":"2505.05935","kind":"arxiv","version":1}},"canonical_sha256":"8a336d88516e34c4d1a154dab1493fafcc4644892d113db9d1e508b8ef477d83","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"8a336d88516e34c4d1a154dab1493fafcc4644892d113db9d1e508b8ef477d83","first_computed_at":"2026-07-05T11:00:50.087993Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T11:00:50.087993Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"TdFKUlOuxJIdJu1V8XM2BTmSzpyCaxkCSOfVV0o62NH8wSrXnPTv4hd17EL7NAp/gtK7HyBKHzz3KNNG9qe0AA==","signature_status":"signed_v1","signed_at":"2026-07-05T11:00:50.088606Z","signed_message":"canonical_sha256_bytes"},"source_id":"2505.05935","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:5b64a9192dadd584a033f6cc7f6039b89a15d955789b5513b93fb0d48e0052d1","sha256:9d70005d13f04b2010e757434eb7c4fa59df21e51570621d1a627b2cf170c81e"],"state_sha256":"8f34b62522f02d3a649280175e8e9f4a82aac3b040eae16d41245e6659f711bd"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"w3EUMP2qeuiHp/CwTuDHqRp5H5ITOlI1Ex0hXaFp86zJbOmf72o06iOq9/g9h1tWRGnNUWYhDU71Z3qIE2xMBw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-17T09:42:18.412937Z","bundle_sha256":"4577d607f014e5002f47f60d52bce76346895bbc7b003e0d947914a802cd6be2"}}