{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:LYXWZ6O57CVS25TB64LJFICYRP","short_pith_number":"pith:LYXWZ6O5","canonical_record":{"source":{"id":"1302.2261","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-02-09T19:41:59Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"505cfc93f91fe6d2d626f5b92dca6fe9ae81a692566afb4d6b0e0fed918a2855","abstract_canon_sha256":"5dc4253d336eb87e0222481490da1fabcc59c0017c95fb19913b032a11aadd8c"},"schema_version":"1.0"},"canonical_sha256":"5e2f6cf9ddf8ab2d7661f71692a0588be19f9a7cc49c085ef8b9576e50ee47dd","source":{"kind":"arxiv","id":"1302.2261","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1302.2261","created_at":"2026-05-18T03:18:51Z"},{"alias_kind":"arxiv_version","alias_value":"1302.2261v3","created_at":"2026-05-18T03:18:51Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1302.2261","created_at":"2026-05-18T03:18:51Z"},{"alias_kind":"pith_short_12","alias_value":"LYXWZ6O57CVS","created_at":"2026-05-18T12:27:51Z"},{"alias_kind":"pith_short_16","alias_value":"LYXWZ6O57CVS25TB","created_at":"2026-05-18T12:27:51Z"},{"alias_kind":"pith_short_8","alias_value":"LYXWZ6O5","created_at":"2026-05-18T12:27:51Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:LYXWZ6O57CVS25TB64LJFICYRP","target":"record","payload":{"canonical_record":{"source":{"id":"1302.2261","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-02-09T19:41:59Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"505cfc93f91fe6d2d626f5b92dca6fe9ae81a692566afb4d6b0e0fed918a2855","abstract_canon_sha256":"5dc4253d336eb87e0222481490da1fabcc59c0017c95fb19913b032a11aadd8c"},"schema_version":"1.0"},"canonical_sha256":"5e2f6cf9ddf8ab2d7661f71692a0588be19f9a7cc49c085ef8b9576e50ee47dd","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:18:51.430017Z","signature_b64":"lenpzbtxzK2tAFT1Y1JmnKNJW7VrijBu2zXUs/KQDUHuliih4GAgpjfKslXDJcMjg2H0ukA8CaUVc/c4cHC7Bw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5e2f6cf9ddf8ab2d7661f71692a0588be19f9a7cc49c085ef8b9576e50ee47dd","last_reissued_at":"2026-05-18T03:18:51.429466Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:18:51.429466Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1302.2261","source_version":3,"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-05-18T03:18:51Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"dr2hdlGKfmfwprvSJgfznr/npccLxZWXVlCblwN5lcVXCFVe3axKGgRLI7vVAHo9zfuWY/sdq5EWEZCxYl5pAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-10T16:39:14.190728Z"},"content_sha256":"4f2f799babf31bc1455cbc8b7584e193bc032dcbd4bebffe791882750f3719a0","schema_version":"1.0","event_id":"sha256:4f2f799babf31bc1455cbc8b7584e193bc032dcbd4bebffe791882750f3719a0"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:LYXWZ6O57CVS25TB64LJFICYRP","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"On the list decodability of random linear codes with large error rates","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Mary Wootters","submitted_at":"2013-02-09T19:41:59Z","abstract_excerpt":"It is well known that a random q-ary code of rate \\Omega(\\epsilon^2) is list decodable up to radius (1 - 1/q - \\epsilon) with list sizes on the order of 1/\\epsilon^2, with probability 1 - o(1). However, until recently, a similar statement about random linear codes has until remained elusive. In a recent paper, Cheraghchi, Guruswami, and Velingker show a connection between list decodability of random linear codes and the Restricted Isometry Property from compressed sensing, and use this connection to prove that a random linear code of rate \\Omega(\\epsilon^2 / log^3(1/\\epsilon)) achieves the lis"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1302.2261","kind":"arxiv","version":3},"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"},"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-05-18T03:18:51Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"cenNx9f0iRbzDI6xM/mKMk131AP1p+9Dr9ZICzF9k6bz1Lx8X4VrPh9VfjuX2qli+nVVlBNJTWEeeoOX38jCDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-10T16:39:14.191081Z"},"content_sha256":"ad5926646802932bb08beee0a0bf509c77a1bc8cdf954f8a4952cb02d465e18d","schema_version":"1.0","event_id":"sha256:ad5926646802932bb08beee0a0bf509c77a1bc8cdf954f8a4952cb02d465e18d"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/LYXWZ6O57CVS25TB64LJFICYRP/bundle.json","state_url":"https://pith.science/pith/LYXWZ6O57CVS25TB64LJFICYRP/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/LYXWZ6O57CVS25TB64LJFICYRP/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-06-10T16:39:14Z","links":{"resolver":"https://pith.science/pith/LYXWZ6O57CVS25TB64LJFICYRP","bundle":"https://pith.science/pith/LYXWZ6O57CVS25TB64LJFICYRP/bundle.json","state":"https://pith.science/pith/LYXWZ6O57CVS25TB64LJFICYRP/state.json","well_known_bundle":"https://pith.science/.well-known/pith/LYXWZ6O57CVS25TB64LJFICYRP/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:LYXWZ6O57CVS25TB64LJFICYRP","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":"5dc4253d336eb87e0222481490da1fabcc59c0017c95fb19913b032a11aadd8c","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-02-09T19:41:59Z","title_canon_sha256":"505cfc93f91fe6d2d626f5b92dca6fe9ae81a692566afb4d6b0e0fed918a2855"},"schema_version":"1.0","source":{"id":"1302.2261","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1302.2261","created_at":"2026-05-18T03:18:51Z"},{"alias_kind":"arxiv_version","alias_value":"1302.2261v3","created_at":"2026-05-18T03:18:51Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1302.2261","created_at":"2026-05-18T03:18:51Z"},{"alias_kind":"pith_short_12","alias_value":"LYXWZ6O57CVS","created_at":"2026-05-18T12:27:51Z"},{"alias_kind":"pith_short_16","alias_value":"LYXWZ6O57CVS25TB","created_at":"2026-05-18T12:27:51Z"},{"alias_kind":"pith_short_8","alias_value":"LYXWZ6O5","created_at":"2026-05-18T12:27:51Z"}],"graph_snapshots":[{"event_id":"sha256:ad5926646802932bb08beee0a0bf509c77a1bc8cdf954f8a4952cb02d465e18d","target":"graph","created_at":"2026-05-18T03:18:51Z","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":"It is well known that a random q-ary code of rate \\Omega(\\epsilon^2) is list decodable up to radius (1 - 1/q - \\epsilon) with list sizes on the order of 1/\\epsilon^2, with probability 1 - o(1). However, until recently, a similar statement about random linear codes has until remained elusive. In a recent paper, Cheraghchi, Guruswami, and Velingker show a connection between list decodability of random linear codes and the Restricted Isometry Property from compressed sensing, and use this connection to prove that a random linear code of rate \\Omega(\\epsilon^2 / log^3(1/\\epsilon)) achieves the lis","authors_text":"Mary Wootters","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-02-09T19:41:59Z","title":"On the list decodability of random linear codes with large error rates"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1302.2261","kind":"arxiv","version":3},"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:4f2f799babf31bc1455cbc8b7584e193bc032dcbd4bebffe791882750f3719a0","target":"record","created_at":"2026-05-18T03:18:51Z","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":"5dc4253d336eb87e0222481490da1fabcc59c0017c95fb19913b032a11aadd8c","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-02-09T19:41:59Z","title_canon_sha256":"505cfc93f91fe6d2d626f5b92dca6fe9ae81a692566afb4d6b0e0fed918a2855"},"schema_version":"1.0","source":{"id":"1302.2261","kind":"arxiv","version":3}},"canonical_sha256":"5e2f6cf9ddf8ab2d7661f71692a0588be19f9a7cc49c085ef8b9576e50ee47dd","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"5e2f6cf9ddf8ab2d7661f71692a0588be19f9a7cc49c085ef8b9576e50ee47dd","first_computed_at":"2026-05-18T03:18:51.429466Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:18:51.429466Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"lenpzbtxzK2tAFT1Y1JmnKNJW7VrijBu2zXUs/KQDUHuliih4GAgpjfKslXDJcMjg2H0ukA8CaUVc/c4cHC7Bw==","signature_status":"signed_v1","signed_at":"2026-05-18T03:18:51.430017Z","signed_message":"canonical_sha256_bytes"},"source_id":"1302.2261","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:4f2f799babf31bc1455cbc8b7584e193bc032dcbd4bebffe791882750f3719a0","sha256:ad5926646802932bb08beee0a0bf509c77a1bc8cdf954f8a4952cb02d465e18d"],"state_sha256":"8e2e885352a8654822f59243de5a72cc8ba80dca11de4ad0e229a4c194b83df7"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"SjM8vYnorAoZpVmhzmEjWJ+Hl20NF90swYTtuYeqFXqVDNcl0+5TtF4cxCKWgrAKhnsZ3eg10R3C5BGlccNsAQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-10T16:39:14.193125Z","bundle_sha256":"3590b38e2631fb9c4638d5e586626cad16f35ca3ccfd514e712ea9d06462842e"}}