{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:52GVARMUQDS22ILYL5XFLPLJSN","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":"e5e71d77bb6c770ee844a3c71a7e434562f170aaa925b2b0b031e092feaece99","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2014-01-13T05:33:15Z","title_canon_sha256":"02a298b0767327db57bea6619331c48a472cdadf815456902a3c91146121d2df"},"schema_version":"1.0","source":{"id":"1401.2716","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1401.2716","created_at":"2026-05-18T03:02:32Z"},{"alias_kind":"arxiv_version","alias_value":"1401.2716v1","created_at":"2026-05-18T03:02:32Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1401.2716","created_at":"2026-05-18T03:02:32Z"},{"alias_kind":"pith_short_12","alias_value":"52GVARMUQDS2","created_at":"2026-05-18T12:28:14Z"},{"alias_kind":"pith_short_16","alias_value":"52GVARMUQDS22ILY","created_at":"2026-05-18T12:28:14Z"},{"alias_kind":"pith_short_8","alias_value":"52GVARMU","created_at":"2026-05-18T12:28:14Z"}],"graph_snapshots":[{"event_id":"sha256:dd37d9499b6f904d9b1672e9869df8f419abc0afecae47cecb6dee356175028b","target":"graph","created_at":"2026-05-18T03:02:32Z","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"},"paper":{"abstract_excerpt":"Erasure list decoding was introduced to correct a larger number of erasures with output of a list of possible candidates. In the present paper, we consider both random linear codes and algebraic geometry codes for list decoding erasure errors. The contributions of this paper are two-fold. Firstly, we show that, for arbitrary $0<R<1$ and $\\epsilon>0$ ($R$ and $\\epsilon$ are independent), with high probability a random linear code is an erasure list decodable code with constant list size $2^{O(1/\\epsilon)}$ that can correct a fraction $1-R-\\epsilon$ of erasures, i.e., a random linear code achiev","authors_text":"Chaoping Xing, Lingfei Jin, Yang Ding","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2014-01-13T05:33:15Z","title":"Erasure List-Decodable Codes from Random and Algebraic Geometry Codes"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1401.2716","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:707b34b3b9f634c1e1e4e063d32842ad47c2ddae3b3f1683fb14b1e83d2ab3cf","target":"record","created_at":"2026-05-18T03:02:32Z","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":"e5e71d77bb6c770ee844a3c71a7e434562f170aaa925b2b0b031e092feaece99","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2014-01-13T05:33:15Z","title_canon_sha256":"02a298b0767327db57bea6619331c48a472cdadf815456902a3c91146121d2df"},"schema_version":"1.0","source":{"id":"1401.2716","kind":"arxiv","version":1}},"canonical_sha256":"ee8d50459480e5ad21785f6e55bd6993762ff5fad6d9097974f3dc05fe361fa0","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"ee8d50459480e5ad21785f6e55bd6993762ff5fad6d9097974f3dc05fe361fa0","first_computed_at":"2026-05-18T03:02:32.431092Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:02:32.431092Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"RWtmW/eREJ9rxyNTbtXioXwHECaps4VM1oPBllM8SzPZ1Ld1jpFRmtViSYsRFBONW/5oHpqDeXIn4C+2rPDQDw==","signature_status":"signed_v1","signed_at":"2026-05-18T03:02:32.431921Z","signed_message":"canonical_sha256_bytes"},"source_id":"1401.2716","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:707b34b3b9f634c1e1e4e063d32842ad47c2ddae3b3f1683fb14b1e83d2ab3cf","sha256:dd37d9499b6f904d9b1672e9869df8f419abc0afecae47cecb6dee356175028b"],"state_sha256":"167ccaad7b0b9958d2747a7819cb184c77b0c132ff8a153278f0ca85c33df27e"}