{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2020:W4SUAPVD6NIM77IHWKPSXHR26Y","short_pith_number":"pith:W4SUAPVD","canonical_record":{"source":{"id":"2005.02478","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2020-05-04T17:42:56Z","cross_cats_sorted":["cs.CC","cs.DM","cs.IT","math.IT"],"title_canon_sha256":"76413c8600e4410fe70744c162b2979b25feae47872ba455d75eecc33fbbe237","abstract_canon_sha256":"430fd4773dbe5404cb772331f7254656079a78e876617c04ec59f43e1a4ba0e2"},"schema_version":"1.0"},"canonical_sha256":"b725403ea3f350cffd07b29f2b9e3af60405665b3d1e64f5ad2599ad9ec63ddf","source":{"kind":"arxiv","id":"2005.02478","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2005.02478","created_at":"2026-07-05T01:16:14Z"},{"alias_kind":"arxiv_version","alias_value":"2005.02478v3","created_at":"2026-07-05T01:16:14Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2005.02478","created_at":"2026-07-05T01:16:14Z"},{"alias_kind":"pith_short_12","alias_value":"W4SUAPVD6NIM","created_at":"2026-07-05T01:16:14Z"},{"alias_kind":"pith_short_16","alias_value":"W4SUAPVD6NIM77IH","created_at":"2026-07-05T01:16:14Z"},{"alias_kind":"pith_short_8","alias_value":"W4SUAPVD","created_at":"2026-07-05T01:16:14Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2020:W4SUAPVD6NIM77IHWKPSXHR26Y","target":"record","payload":{"canonical_record":{"source":{"id":"2005.02478","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2020-05-04T17:42:56Z","cross_cats_sorted":["cs.CC","cs.DM","cs.IT","math.IT"],"title_canon_sha256":"76413c8600e4410fe70744c162b2979b25feae47872ba455d75eecc33fbbe237","abstract_canon_sha256":"430fd4773dbe5404cb772331f7254656079a78e876617c04ec59f43e1a4ba0e2"},"schema_version":"1.0"},"canonical_sha256":"b725403ea3f350cffd07b29f2b9e3af60405665b3d1e64f5ad2599ad9ec63ddf","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T01:16:14.936622Z","signature_b64":"2ohtTVzRBW93IXO3joGZFfiVUXxZajwzHTSnBX7RoczkeNMRB2GKYgBNIUpZAKI6FttoYPtZK2neXcTV3pCJDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b725403ea3f350cffd07b29f2b9e3af60405665b3d1e64f5ad2599ad9ec63ddf","last_reissued_at":"2026-07-05T01:16:14.936136Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T01:16:14.936136Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2005.02478","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-07-05T01:16:14Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"asMRv2op9uOU4WXDMRO1V/gmZ9JSRaypD5rTej2ipvge3bQuLy/kSWzQWU6Du8d/r2czr8CCvkF7BkmGMnqSDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-20T07:32:48.888568Z"},"content_sha256":"38a5b7460e79611c6e0a53cf6ef438a8401ecb1cc696c2b4a6d1192b2e4b4f30","schema_version":"1.0","event_id":"sha256:38a5b7460e79611c6e0a53cf6ef438a8401ecb1cc696c2b4a6d1192b2e4b4f30"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2020:W4SUAPVD6NIM77IHWKPSXHR26Y","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"On the list recoverability of randomly punctured codes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC","cs.DM","cs.IT","math.IT"],"primary_cat":"math.CO","authors_text":"Aditya Potukuchi, Ben Lund","submitted_at":"2020-05-04T17:42:56Z","abstract_excerpt":"We show that a random puncturing of a code with good distance is list recoverable beyond the Johnson bound. In particular, this implies that there are Reed-Solomon codes that are list recoverable beyond the Johnson bound. It was previously known that there are Reed-Solomon codes that do not have this property. As an immediate corollary to our main theorem, we obtain better degree bounds on unbalanced expanders that come from Reed-Solomon codes."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2005.02478","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2005.02478/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"},"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-07-05T01:16:14Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"1hzGXox8k4ZUPXQsNwOZI1MjcDzobuUPMewk09WgKVw9ky1NIB+BGMOINzG46mAEEcDyZjhV92J5XaiRSoYkAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-20T07:32:48.889076Z"},"content_sha256":"024a028360073a97240afbde9a1bc3ea620a58f211a7b693955dcb2f7988f7eb","schema_version":"1.0","event_id":"sha256:024a028360073a97240afbde9a1bc3ea620a58f211a7b693955dcb2f7988f7eb"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/W4SUAPVD6NIM77IHWKPSXHR26Y/bundle.json","state_url":"https://pith.science/pith/W4SUAPVD6NIM77IHWKPSXHR26Y/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/W4SUAPVD6NIM77IHWKPSXHR26Y/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-08-20T07:32:48Z","links":{"resolver":"https://pith.science/pith/W4SUAPVD6NIM77IHWKPSXHR26Y","bundle":"https://pith.science/pith/W4SUAPVD6NIM77IHWKPSXHR26Y/bundle.json","state":"https://pith.science/pith/W4SUAPVD6NIM77IHWKPSXHR26Y/state.json","well_known_bundle":"https://pith.science/.well-known/pith/W4SUAPVD6NIM77IHWKPSXHR26Y/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2020:W4SUAPVD6NIM77IHWKPSXHR26Y","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":"430fd4773dbe5404cb772331f7254656079a78e876617c04ec59f43e1a4ba0e2","cross_cats_sorted":["cs.CC","cs.DM","cs.IT","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2020-05-04T17:42:56Z","title_canon_sha256":"76413c8600e4410fe70744c162b2979b25feae47872ba455d75eecc33fbbe237"},"schema_version":"1.0","source":{"id":"2005.02478","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2005.02478","created_at":"2026-07-05T01:16:14Z"},{"alias_kind":"arxiv_version","alias_value":"2005.02478v3","created_at":"2026-07-05T01:16:14Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2005.02478","created_at":"2026-07-05T01:16:14Z"},{"alias_kind":"pith_short_12","alias_value":"W4SUAPVD6NIM","created_at":"2026-07-05T01:16:14Z"},{"alias_kind":"pith_short_16","alias_value":"W4SUAPVD6NIM77IH","created_at":"2026-07-05T01:16:14Z"},{"alias_kind":"pith_short_8","alias_value":"W4SUAPVD","created_at":"2026-07-05T01:16:14Z"}],"graph_snapshots":[{"event_id":"sha256:024a028360073a97240afbde9a1bc3ea620a58f211a7b693955dcb2f7988f7eb","target":"graph","created_at":"2026-07-05T01:16:14Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2005.02478/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"We show that a random puncturing of a code with good distance is list recoverable beyond the Johnson bound. In particular, this implies that there are Reed-Solomon codes that are list recoverable beyond the Johnson bound. It was previously known that there are Reed-Solomon codes that do not have this property. As an immediate corollary to our main theorem, we obtain better degree bounds on unbalanced expanders that come from Reed-Solomon codes.","authors_text":"Aditya Potukuchi, Ben Lund","cross_cats":["cs.CC","cs.DM","cs.IT","math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2020-05-04T17:42:56Z","title":"On the list recoverability of randomly punctured codes"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2005.02478","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:38a5b7460e79611c6e0a53cf6ef438a8401ecb1cc696c2b4a6d1192b2e4b4f30","target":"record","created_at":"2026-07-05T01:16:14Z","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":"430fd4773dbe5404cb772331f7254656079a78e876617c04ec59f43e1a4ba0e2","cross_cats_sorted":["cs.CC","cs.DM","cs.IT","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2020-05-04T17:42:56Z","title_canon_sha256":"76413c8600e4410fe70744c162b2979b25feae47872ba455d75eecc33fbbe237"},"schema_version":"1.0","source":{"id":"2005.02478","kind":"arxiv","version":3}},"canonical_sha256":"b725403ea3f350cffd07b29f2b9e3af60405665b3d1e64f5ad2599ad9ec63ddf","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"b725403ea3f350cffd07b29f2b9e3af60405665b3d1e64f5ad2599ad9ec63ddf","first_computed_at":"2026-07-05T01:16:14.936136Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T01:16:14.936136Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"2ohtTVzRBW93IXO3joGZFfiVUXxZajwzHTSnBX7RoczkeNMRB2GKYgBNIUpZAKI6FttoYPtZK2neXcTV3pCJDg==","signature_status":"signed_v1","signed_at":"2026-07-05T01:16:14.936622Z","signed_message":"canonical_sha256_bytes"},"source_id":"2005.02478","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:38a5b7460e79611c6e0a53cf6ef438a8401ecb1cc696c2b4a6d1192b2e4b4f30","sha256:024a028360073a97240afbde9a1bc3ea620a58f211a7b693955dcb2f7988f7eb"],"state_sha256":"028c3a134734e30167fb9d2d3bb55b292263cef44086a90e4958d7fcd6b53b6b"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"nUmlFWTxBB63VQkYR4ZVftht8s/bU0vKnBSxINrx4j/PvdSc54IA9v1iNAaymCGTvHwXJe+c+ps5I+scPc8pBg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-20T07:32:48.893927Z","bundle_sha256":"861836cbdd2016f90e910d07e45120df4bd621eaf7d9d379b128a0d729454df5"}}