{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2010:NYSCBJMVTUZ44REVVIO3UYHGGE","short_pith_number":"pith:NYSCBJMV","schema_version":"1.0","canonical_sha256":"6e2420a5959d33ce4495aa1dba60e63111866a85fb43c8cb2af6fb136027bf5d","source":{"kind":"arxiv","id":"1010.3312","version":1},"attestation_state":"computed","paper":{"title":"List Decodability at Small Radii","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM","math.CO","math.IT"],"primary_cat":"cs.IT","authors_text":"Gennian Ge, Jianxing Yin, Lijun Ji, San Ling, Yeow Meng Chee","submitted_at":"2010-10-16T03:44:07Z","abstract_excerpt":"$A'(n,d,e)$, the smallest $\\ell$ for which every binary error-correcting code of length $n$ and minimum distance $d$ is decodable with a list of size $\\ell$ up to radius $e$, is determined for all $d\\geq 2e-3$. As a result, $A'(n,d,e)$ is determined for all $e\\leq 4$, except for 42 values of $n$."},"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":"1010.3312","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2010-10-16T03:44:07Z","cross_cats_sorted":["cs.DM","math.CO","math.IT"],"title_canon_sha256":"f882c50d018f19bfcbcebf5f076beebcc3e1be0ce2a9320ecd652032de26ab19","abstract_canon_sha256":"99b82940cc433f5a88aec1cb3269375c43d9b55774acb91a3f9b140f895ef02b"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:39:09.507580Z","signature_b64":"sYHUtgxfBwhKzPedja8qr2t4ELCLYwi1EM1TI3AOMQMm5rkGoyGnrR+8ven5fn/zVOOp5PtLls4dxHZgdG92DQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6e2420a5959d33ce4495aa1dba60e63111866a85fb43c8cb2af6fb136027bf5d","last_reissued_at":"2026-05-18T04:39:09.507084Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:39:09.507084Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"List Decodability at Small Radii","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM","math.CO","math.IT"],"primary_cat":"cs.IT","authors_text":"Gennian Ge, Jianxing Yin, Lijun Ji, San Ling, Yeow Meng Chee","submitted_at":"2010-10-16T03:44:07Z","abstract_excerpt":"$A'(n,d,e)$, the smallest $\\ell$ for which every binary error-correcting code of length $n$ and minimum distance $d$ is decodable with a list of size $\\ell$ up to radius $e$, is determined for all $d\\geq 2e-3$. As a result, $A'(n,d,e)$ is determined for all $e\\leq 4$, except for 42 values of $n$."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1010.3312","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":""},"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":"1010.3312","created_at":"2026-05-18T04:39:09.507165+00:00"},{"alias_kind":"arxiv_version","alias_value":"1010.3312v1","created_at":"2026-05-18T04:39:09.507165+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1010.3312","created_at":"2026-05-18T04:39:09.507165+00:00"},{"alias_kind":"pith_short_12","alias_value":"NYSCBJMVTUZ4","created_at":"2026-05-18T12:26:12.377268+00:00"},{"alias_kind":"pith_short_16","alias_value":"NYSCBJMVTUZ44REV","created_at":"2026-05-18T12:26:12.377268+00:00"},{"alias_kind":"pith_short_8","alias_value":"NYSCBJMV","created_at":"2026-05-18T12:26:12.377268+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/NYSCBJMVTUZ44REVVIO3UYHGGE","json":"https://pith.science/pith/NYSCBJMVTUZ44REVVIO3UYHGGE.json","graph_json":"https://pith.science/api/pith-number/NYSCBJMVTUZ44REVVIO3UYHGGE/graph.json","events_json":"https://pith.science/api/pith-number/NYSCBJMVTUZ44REVVIO3UYHGGE/events.json","paper":"https://pith.science/paper/NYSCBJMV"},"agent_actions":{"view_html":"https://pith.science/pith/NYSCBJMVTUZ44REVVIO3UYHGGE","download_json":"https://pith.science/pith/NYSCBJMVTUZ44REVVIO3UYHGGE.json","view_paper":"https://pith.science/paper/NYSCBJMV","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1010.3312&json=true","fetch_graph":"https://pith.science/api/pith-number/NYSCBJMVTUZ44REVVIO3UYHGGE/graph.json","fetch_events":"https://pith.science/api/pith-number/NYSCBJMVTUZ44REVVIO3UYHGGE/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/NYSCBJMVTUZ44REVVIO3UYHGGE/action/timestamp_anchor","attest_storage":"https://pith.science/pith/NYSCBJMVTUZ44REVVIO3UYHGGE/action/storage_attestation","attest_author":"https://pith.science/pith/NYSCBJMVTUZ44REVVIO3UYHGGE/action/author_attestation","sign_citation":"https://pith.science/pith/NYSCBJMVTUZ44REVVIO3UYHGGE/action/citation_signature","submit_replication":"https://pith.science/pith/NYSCBJMVTUZ44REVVIO3UYHGGE/action/replication_record"}},"created_at":"2026-05-18T04:39:09.507165+00:00","updated_at":"2026-05-18T04:39:09.507165+00:00"}