{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:AMJAWDH57ZFLQRXL67EGQ6WLGY","short_pith_number":"pith:AMJAWDH5","schema_version":"1.0","canonical_sha256":"03120b0cfdfe4ab846ebf7c8687acb36362c2c3cdb4984957bd96f77f5b623f4","source":{"kind":"arxiv","id":"1801.07839","version":4},"attestation_state":"computed","paper":{"title":"Improved list-decodability of random linear binary codes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Mary Wootters, Ray Li","submitted_at":"2018-01-24T02:21:53Z","abstract_excerpt":"There has been a great deal of work establishing that random linear codes are as list-decodable as uniformly random codes, in the sense that a random linear binary code of rate $1 - H(p) - \\epsilon$ is $(p,O(1/\\epsilon))$-list-decodable with high probability. In this work, we show that such codes are $(p, H(p)/\\epsilon + 2)$-list-decodable with high probability, for any $p \\in (0, 1/2)$ and $\\epsilon > 0$. In addition to improving the constant in known list-size bounds, our argument, which is quite simple, works simultaneously for all values of $p$, while previous works obtaining $L = O(1/\\eps"},"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":"1801.07839","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2018-01-24T02:21:53Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"2c69fc43eff892eaaa9652d876762e8df2711776a33f7187fe8dcf316902ed00","abstract_canon_sha256":"2f49f8fb4b1876ea23f3ed4e377f9a7a7cfb9cf98f7e8504e6c5fd9a88d5deb4"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T01:54:25.004484Z","signature_b64":"n0oigDXLv+WilWPVTMLAetx09ysj9blO0Atc6UP2LHUVyM0mGXITuSUNOayTF8UEvkombmii6DWt9DdtlvpMAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"03120b0cfdfe4ab846ebf7c8687acb36362c2c3cdb4984957bd96f77f5b623f4","last_reissued_at":"2026-07-05T01:54:25.004053Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T01:54:25.004053Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Improved list-decodability of random linear binary codes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Mary Wootters, Ray Li","submitted_at":"2018-01-24T02:21:53Z","abstract_excerpt":"There has been a great deal of work establishing that random linear codes are as list-decodable as uniformly random codes, in the sense that a random linear binary code of rate $1 - H(p) - \\epsilon$ is $(p,O(1/\\epsilon))$-list-decodable with high probability. In this work, we show that such codes are $(p, H(p)/\\epsilon + 2)$-list-decodable with high probability, for any $p \\in (0, 1/2)$ and $\\epsilon > 0$. In addition to improving the constant in known list-size bounds, our argument, which is quite simple, works simultaneously for all values of $p$, while previous works obtaining $L = O(1/\\eps"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1801.07839","kind":"arxiv","version":4},"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/1801.07839/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":"1801.07839","created_at":"2026-07-05T01:54:25.004116+00:00"},{"alias_kind":"arxiv_version","alias_value":"1801.07839v4","created_at":"2026-07-05T01:54:25.004116+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1801.07839","created_at":"2026-07-05T01:54:25.004116+00:00"},{"alias_kind":"pith_short_12","alias_value":"AMJAWDH57ZFL","created_at":"2026-07-05T01:54:25.004116+00:00"},{"alias_kind":"pith_short_16","alias_value":"AMJAWDH57ZFLQRXL","created_at":"2026-07-05T01:54:25.004116+00:00"},{"alias_kind":"pith_short_8","alias_value":"AMJAWDH5","created_at":"2026-07-05T01:54:25.004116+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/AMJAWDH57ZFLQRXL67EGQ6WLGY","json":"https://pith.science/pith/AMJAWDH57ZFLQRXL67EGQ6WLGY.json","graph_json":"https://pith.science/api/pith-number/AMJAWDH57ZFLQRXL67EGQ6WLGY/graph.json","events_json":"https://pith.science/api/pith-number/AMJAWDH57ZFLQRXL67EGQ6WLGY/events.json","paper":"https://pith.science/paper/AMJAWDH5"},"agent_actions":{"view_html":"https://pith.science/pith/AMJAWDH57ZFLQRXL67EGQ6WLGY","download_json":"https://pith.science/pith/AMJAWDH57ZFLQRXL67EGQ6WLGY.json","view_paper":"https://pith.science/paper/AMJAWDH5","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1801.07839&json=true","fetch_graph":"https://pith.science/api/pith-number/AMJAWDH57ZFLQRXL67EGQ6WLGY/graph.json","fetch_events":"https://pith.science/api/pith-number/AMJAWDH57ZFLQRXL67EGQ6WLGY/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/AMJAWDH57ZFLQRXL67EGQ6WLGY/action/timestamp_anchor","attest_storage":"https://pith.science/pith/AMJAWDH57ZFLQRXL67EGQ6WLGY/action/storage_attestation","attest_author":"https://pith.science/pith/AMJAWDH57ZFLQRXL67EGQ6WLGY/action/author_attestation","sign_citation":"https://pith.science/pith/AMJAWDH57ZFLQRXL67EGQ6WLGY/action/citation_signature","submit_replication":"https://pith.science/pith/AMJAWDH57ZFLQRXL67EGQ6WLGY/action/replication_record"}},"created_at":"2026-07-05T01:54:25.004116+00:00","updated_at":"2026-07-05T01:54:25.004116+00:00"}