{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2020:OIWD66YMQ473JXR5RSHSXVZK7X","short_pith_number":"pith:OIWD66YM","schema_version":"1.0","canonical_sha256":"722c3f7b0c873fb4de3d8c8f2bd72afde4fab7668a09d77f66379e3cb8587a47","source":{"kind":"arxiv","id":"2004.13247","version":2},"attestation_state":"computed","paper":{"title":"Bounds for list-decoding and list-recovery of random linear codes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT","math.PR"],"primary_cat":"cs.IT","authors_text":"Jonathan Mosheiff, Mary Wootters, Nicolas Resch, Ray Li, Shashwat Silas, Venkatesan Guruswami","submitted_at":"2020-04-28T02:29:26Z","abstract_excerpt":"A family of error-correcting codes is list-decodable from error fraction $p$ if, for every code in the family, the number of codewords in any Hamming ball of fractional radius $p$ is less than some integer $L$ that is independent of the code length. It is said to be list-recoverable for input list size $\\ell$ if for every sufficiently large subset of codewords (of size $L$ or more), there is a coordinate where the codewords take more than $\\ell$ values. The parameter $L$ is said to be the \"list size\" in either case. The capacity, i.e., the largest possible rate for these notions as the list si"},"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":"2004.13247","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2020-04-28T02:29:26Z","cross_cats_sorted":["math.IT","math.PR"],"title_canon_sha256":"39a0cd962f9423748b74653158932ea778655ebc1f9bc2a8f9eb0001335aad5d","abstract_canon_sha256":"a8427b9fbae46bb389c4d3330b76f211a49276b8c12aa5dba0836fcf35638b7a"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T08:41:57.165248Z","signature_b64":"M0lZgwI0OR1153IVoIFVC7ULtv10MB7snxgTwaTEaDH7Rsn28nljOw9TMu6y92kkByMLmO9mQxWog3LDM3ziCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"722c3f7b0c873fb4de3d8c8f2bd72afde4fab7668a09d77f66379e3cb8587a47","last_reissued_at":"2026-07-05T08:41:57.164841Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T08:41:57.164841Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Bounds for list-decoding and list-recovery of random linear codes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT","math.PR"],"primary_cat":"cs.IT","authors_text":"Jonathan Mosheiff, Mary Wootters, Nicolas Resch, Ray Li, Shashwat Silas, Venkatesan Guruswami","submitted_at":"2020-04-28T02:29:26Z","abstract_excerpt":"A family of error-correcting codes is list-decodable from error fraction $p$ if, for every code in the family, the number of codewords in any Hamming ball of fractional radius $p$ is less than some integer $L$ that is independent of the code length. It is said to be list-recoverable for input list size $\\ell$ if for every sufficiently large subset of codewords (of size $L$ or more), there is a coordinate where the codewords take more than $\\ell$ values. The parameter $L$ is said to be the \"list size\" in either case. The capacity, i.e., the largest possible rate for these notions as the list si"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2004.13247","kind":"arxiv","version":2},"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/2004.13247/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":"2004.13247","created_at":"2026-07-05T08:41:57.164897+00:00"},{"alias_kind":"arxiv_version","alias_value":"2004.13247v2","created_at":"2026-07-05T08:41:57.164897+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2004.13247","created_at":"2026-07-05T08:41:57.164897+00:00"},{"alias_kind":"pith_short_12","alias_value":"OIWD66YMQ473","created_at":"2026-07-05T08:41:57.164897+00:00"},{"alias_kind":"pith_short_16","alias_value":"OIWD66YMQ473JXR5","created_at":"2026-07-05T08:41:57.164897+00:00"},{"alias_kind":"pith_short_8","alias_value":"OIWD66YM","created_at":"2026-07-05T08:41:57.164897+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/OIWD66YMQ473JXR5RSHSXVZK7X","json":"https://pith.science/pith/OIWD66YMQ473JXR5RSHSXVZK7X.json","graph_json":"https://pith.science/api/pith-number/OIWD66YMQ473JXR5RSHSXVZK7X/graph.json","events_json":"https://pith.science/api/pith-number/OIWD66YMQ473JXR5RSHSXVZK7X/events.json","paper":"https://pith.science/paper/OIWD66YM"},"agent_actions":{"view_html":"https://pith.science/pith/OIWD66YMQ473JXR5RSHSXVZK7X","download_json":"https://pith.science/pith/OIWD66YMQ473JXR5RSHSXVZK7X.json","view_paper":"https://pith.science/paper/OIWD66YM","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2004.13247&json=true","fetch_graph":"https://pith.science/api/pith-number/OIWD66YMQ473JXR5RSHSXVZK7X/graph.json","fetch_events":"https://pith.science/api/pith-number/OIWD66YMQ473JXR5RSHSXVZK7X/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/OIWD66YMQ473JXR5RSHSXVZK7X/action/timestamp_anchor","attest_storage":"https://pith.science/pith/OIWD66YMQ473JXR5RSHSXVZK7X/action/storage_attestation","attest_author":"https://pith.science/pith/OIWD66YMQ473JXR5RSHSXVZK7X/action/author_attestation","sign_citation":"https://pith.science/pith/OIWD66YMQ473JXR5RSHSXVZK7X/action/citation_signature","submit_replication":"https://pith.science/pith/OIWD66YMQ473JXR5RSHSXVZK7X/action/replication_record"}},"created_at":"2026-07-05T08:41:57.164897+00:00","updated_at":"2026-07-05T08:41:57.164897+00:00"}