{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:EP7BFTC7BRW6ZLZU7HU7QLC5QV","short_pith_number":"pith:EP7BFTC7","canonical_record":{"source":{"id":"1207.1140","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2012-07-04T23:21:09Z","cross_cats_sorted":["math.CO","math.IT","math.PR"],"title_canon_sha256":"91276862bcd0a918701b51c1da1b49e527d8d3a08f858353a4b95739ec7bc4ed","abstract_canon_sha256":"0d9a9c09586406a60b279bea8dbc95d6567ceae6cd07247ce2f4b67c0842716c"},"schema_version":"1.0"},"canonical_sha256":"23fe12cc5f0c6decaf34f9e9f82c5d8569d43a7bd078aef10f649e616782dbd6","source":{"kind":"arxiv","id":"1207.1140","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1207.1140","created_at":"2026-05-18T03:51:46Z"},{"alias_kind":"arxiv_version","alias_value":"1207.1140v1","created_at":"2026-05-18T03:51:46Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1207.1140","created_at":"2026-05-18T03:51:46Z"},{"alias_kind":"pith_short_12","alias_value":"EP7BFTC7BRW6","created_at":"2026-05-18T12:27:04Z"},{"alias_kind":"pith_short_16","alias_value":"EP7BFTC7BRW6ZLZU","created_at":"2026-05-18T12:27:04Z"},{"alias_kind":"pith_short_8","alias_value":"EP7BFTC7","created_at":"2026-05-18T12:27:04Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:EP7BFTC7BRW6ZLZU7HU7QLC5QV","target":"record","payload":{"canonical_record":{"source":{"id":"1207.1140","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2012-07-04T23:21:09Z","cross_cats_sorted":["math.CO","math.IT","math.PR"],"title_canon_sha256":"91276862bcd0a918701b51c1da1b49e527d8d3a08f858353a4b95739ec7bc4ed","abstract_canon_sha256":"0d9a9c09586406a60b279bea8dbc95d6567ceae6cd07247ce2f4b67c0842716c"},"schema_version":"1.0"},"canonical_sha256":"23fe12cc5f0c6decaf34f9e9f82c5d8569d43a7bd078aef10f649e616782dbd6","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:51:46.773853Z","signature_b64":"Q7C6m30vJNaYv6vvSfQBbsgHMPkGWmczF9D2VJZ46IuKJ9hzx1Wu/aGJmN0I8d/AzoPBuXx58OjczP4ELi5dDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"23fe12cc5f0c6decaf34f9e9f82c5d8569d43a7bd078aef10f649e616782dbd6","last_reissued_at":"2026-05-18T03:51:46.773349Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:51:46.773349Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1207.1140","source_version":1,"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:51:46Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"OaCMAL0qdKGxGwgvTmoYXmwvd1E80yrd8RaX+kmhpr117GdHDqDx3DX/K9TmsbnDqFm/S44pW3dZrRyPkFfQBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T11:42:27.296921Z"},"content_sha256":"21a8e136a31e04064d1e46065bbb6649bc315a5216a0a76e21d5355fdee7e2e5","schema_version":"1.0","event_id":"sha256:21a8e136a31e04064d1e46065bbb6649bc315a5216a0a76e21d5355fdee7e2e5"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:EP7BFTC7BRW6ZLZU7HU7QLC5QV","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Restricted Isometry of Fourier Matrices and List Decodability of Random Linear Codes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO","math.IT","math.PR"],"primary_cat":"cs.IT","authors_text":"Ameya Velingker, Mahdi Cheraghchi, Venkatesan Guruswami","submitted_at":"2012-07-04T23:21:09Z","abstract_excerpt":"We prove that a random linear code over F_q, with probability arbitrarily close to 1, is list decodable at radius (1-1/q-\\epsilon) with list size L=O(1/\\epsilon^2) and rate R=\\Omega_q(\\epsilon^2/(log^3(1/\\epsilon))). Up to the polylogarithmic factor in (1/\\epsilon) and constant factors depending on q, this matches the lower bound L=\\Omega_q(1/\\epsilon^2) for the list size and upper bound R=O_q(\\epsilon^2) for the rate. Previously only existence (and not abundance) of such codes was known for the special case q=2 (Guruswami, H{\\aa}stad, Sudan and Zuckerman, 2002).\n  In order to obtain our resul"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1207.1140","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"},"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:51:46Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"5iLLI4J9nFv/XXem8R+UGvJTRkLIFqv1Db4fMOqEVel7bjMzfUV7YMosIb02c66cLemkym6/KYLFdCrX0TK6BQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T11:42:27.297348Z"},"content_sha256":"3e130807b5adef7f93825a0ddd36b987db3a5a6ea4b7ffa89ad1802ec8f9b7c6","schema_version":"1.0","event_id":"sha256:3e130807b5adef7f93825a0ddd36b987db3a5a6ea4b7ffa89ad1802ec8f9b7c6"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/EP7BFTC7BRW6ZLZU7HU7QLC5QV/bundle.json","state_url":"https://pith.science/pith/EP7BFTC7BRW6ZLZU7HU7QLC5QV/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/EP7BFTC7BRW6ZLZU7HU7QLC5QV/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-01T11:42:27Z","links":{"resolver":"https://pith.science/pith/EP7BFTC7BRW6ZLZU7HU7QLC5QV","bundle":"https://pith.science/pith/EP7BFTC7BRW6ZLZU7HU7QLC5QV/bundle.json","state":"https://pith.science/pith/EP7BFTC7BRW6ZLZU7HU7QLC5QV/state.json","well_known_bundle":"https://pith.science/.well-known/pith/EP7BFTC7BRW6ZLZU7HU7QLC5QV/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:EP7BFTC7BRW6ZLZU7HU7QLC5QV","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":"0d9a9c09586406a60b279bea8dbc95d6567ceae6cd07247ce2f4b67c0842716c","cross_cats_sorted":["math.CO","math.IT","math.PR"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2012-07-04T23:21:09Z","title_canon_sha256":"91276862bcd0a918701b51c1da1b49e527d8d3a08f858353a4b95739ec7bc4ed"},"schema_version":"1.0","source":{"id":"1207.1140","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1207.1140","created_at":"2026-05-18T03:51:46Z"},{"alias_kind":"arxiv_version","alias_value":"1207.1140v1","created_at":"2026-05-18T03:51:46Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1207.1140","created_at":"2026-05-18T03:51:46Z"},{"alias_kind":"pith_short_12","alias_value":"EP7BFTC7BRW6","created_at":"2026-05-18T12:27:04Z"},{"alias_kind":"pith_short_16","alias_value":"EP7BFTC7BRW6ZLZU","created_at":"2026-05-18T12:27:04Z"},{"alias_kind":"pith_short_8","alias_value":"EP7BFTC7","created_at":"2026-05-18T12:27:04Z"}],"graph_snapshots":[{"event_id":"sha256:3e130807b5adef7f93825a0ddd36b987db3a5a6ea4b7ffa89ad1802ec8f9b7c6","target":"graph","created_at":"2026-05-18T03:51:46Z","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":"We prove that a random linear code over F_q, with probability arbitrarily close to 1, is list decodable at radius (1-1/q-\\epsilon) with list size L=O(1/\\epsilon^2) and rate R=\\Omega_q(\\epsilon^2/(log^3(1/\\epsilon))). Up to the polylogarithmic factor in (1/\\epsilon) and constant factors depending on q, this matches the lower bound L=\\Omega_q(1/\\epsilon^2) for the list size and upper bound R=O_q(\\epsilon^2) for the rate. Previously only existence (and not abundance) of such codes was known for the special case q=2 (Guruswami, H{\\aa}stad, Sudan and Zuckerman, 2002).\n  In order to obtain our resul","authors_text":"Ameya Velingker, Mahdi Cheraghchi, Venkatesan Guruswami","cross_cats":["math.CO","math.IT","math.PR"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2012-07-04T23:21:09Z","title":"Restricted Isometry of Fourier Matrices and List Decodability of Random Linear Codes"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1207.1140","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:21a8e136a31e04064d1e46065bbb6649bc315a5216a0a76e21d5355fdee7e2e5","target":"record","created_at":"2026-05-18T03:51:46Z","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":"0d9a9c09586406a60b279bea8dbc95d6567ceae6cd07247ce2f4b67c0842716c","cross_cats_sorted":["math.CO","math.IT","math.PR"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2012-07-04T23:21:09Z","title_canon_sha256":"91276862bcd0a918701b51c1da1b49e527d8d3a08f858353a4b95739ec7bc4ed"},"schema_version":"1.0","source":{"id":"1207.1140","kind":"arxiv","version":1}},"canonical_sha256":"23fe12cc5f0c6decaf34f9e9f82c5d8569d43a7bd078aef10f649e616782dbd6","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"23fe12cc5f0c6decaf34f9e9f82c5d8569d43a7bd078aef10f649e616782dbd6","first_computed_at":"2026-05-18T03:51:46.773349Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:51:46.773349Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Q7C6m30vJNaYv6vvSfQBbsgHMPkGWmczF9D2VJZ46IuKJ9hzx1Wu/aGJmN0I8d/AzoPBuXx58OjczP4ELi5dDw==","signature_status":"signed_v1","signed_at":"2026-05-18T03:51:46.773853Z","signed_message":"canonical_sha256_bytes"},"source_id":"1207.1140","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:21a8e136a31e04064d1e46065bbb6649bc315a5216a0a76e21d5355fdee7e2e5","sha256:3e130807b5adef7f93825a0ddd36b987db3a5a6ea4b7ffa89ad1802ec8f9b7c6"],"state_sha256":"e57c8028614f9131d75754bef92915f4e76318b3d80c8342ca5a61a4e1796f08"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"d47ctcud9VALg7Oy4ncs/f3X8iClmiMPOlzD5awhMh/aW9+APCKO7nYnE6WgBfr6NaXs9cqfMjvyXgyyL6BxDQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-01T11:42:27.299659Z","bundle_sha256":"b93f629060c37684ee05e070fb1aa1aae31c3ecec397772dcb8887028fbd34bc"}}