{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:LKVQBXLZDLBFNOXZ3VN4NXNGHM","short_pith_number":"pith:LKVQBXLZ","canonical_record":{"source":{"id":"1706.03383","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-06-11T17:35:27Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"c80448028d48ab0f3dfac9245612456f7c8a44962c3d02d0297977dc438ec806","abstract_canon_sha256":"444be7d516ca43223b655c61b99b93ca47829be764a174bceb835b62a8bc4707"},"schema_version":"1.0"},"canonical_sha256":"5aab00dd791ac256baf9dd5bc6dda63b3d49e46b4e9e5f58b72e7c5ae1c36b7c","source":{"kind":"arxiv","id":"1706.03383","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1706.03383","created_at":"2026-05-18T00:42:35Z"},{"alias_kind":"arxiv_version","alias_value":"1706.03383v1","created_at":"2026-05-18T00:42:35Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1706.03383","created_at":"2026-05-18T00:42:35Z"},{"alias_kind":"pith_short_12","alias_value":"LKVQBXLZDLBF","created_at":"2026-05-18T12:31:28Z"},{"alias_kind":"pith_short_16","alias_value":"LKVQBXLZDLBFNOXZ","created_at":"2026-05-18T12:31:28Z"},{"alias_kind":"pith_short_8","alias_value":"LKVQBXLZ","created_at":"2026-05-18T12:31:28Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:LKVQBXLZDLBFNOXZ3VN4NXNGHM","target":"record","payload":{"canonical_record":{"source":{"id":"1706.03383","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-06-11T17:35:27Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"c80448028d48ab0f3dfac9245612456f7c8a44962c3d02d0297977dc438ec806","abstract_canon_sha256":"444be7d516ca43223b655c61b99b93ca47829be764a174bceb835b62a8bc4707"},"schema_version":"1.0"},"canonical_sha256":"5aab00dd791ac256baf9dd5bc6dda63b3d49e46b4e9e5f58b72e7c5ae1c36b7c","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:42:35.830895Z","signature_b64":"g9Xrfv/sLv6cfNycaXTrqXDpUue/FleU2VOoQtbBQRvgVJzr1WM2g6h1kNeLfXRtVqWAOcPV+IDeIeLd7sYnDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5aab00dd791ac256baf9dd5bc6dda63b3d49e46b4e9e5f58b72e7c5ae1c36b7c","last_reissued_at":"2026-05-18T00:42:35.830430Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:42:35.830430Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1706.03383","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-18T00:42:35Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"FrHbOQAcnP8enk+Y/qs4ynKvIrJfeZDsrmOLv3NfcALgBJfjlSC1c9I9lRJ3RAO63TB94kxhO2nA/fQpIrviCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T14:40:27.224253Z"},"content_sha256":"d6d525910dc1b7f1f54e49dbf73532b2097ff7007688bb91a8677ba98a155296","schema_version":"1.0","event_id":"sha256:d6d525910dc1b7f1f54e49dbf73532b2097ff7007688bb91a8677ba98a155296"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:LKVQBXLZDLBFNOXZ3VN4NXNGHM","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Local List Recovery of High-rate Tensor Codes and Applications","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Brett Hemenway, Mary Wootters, Noga Ron-Zewi","submitted_at":"2017-06-11T17:35:27Z","abstract_excerpt":"In this work, we give the first construction of high-rate locally list-recoverable codes. List-recovery has been an extremely useful building block in coding theory, and our motivation is to use these codes as such a building block. In particular, our construction gives the first capacity-achieving locally list-decodable codes (over constant-sized alphabet); the first capacity achieving globally list-decodable codes with nearly linear time list decoding algorithm (once more, over constant-sized alphabet); and a randomized construction of binary codes on the Gilbert-Varshamov bound that can be "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1706.03383","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-18T00:42:35Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"LWe73y98o12PK0hcRW9Ayp8OBIUmAB4ZUDWmwxFWBVJOkCbPlh3BUKE/u0iJAU30g7dCSFHaJkLDqb6bH63zBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T14:40:27.224619Z"},"content_sha256":"947fed5a25b6e5292584831283e80cc1f545c968cc1d09751dcb7b710580cfa7","schema_version":"1.0","event_id":"sha256:947fed5a25b6e5292584831283e80cc1f545c968cc1d09751dcb7b710580cfa7"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/LKVQBXLZDLBFNOXZ3VN4NXNGHM/bundle.json","state_url":"https://pith.science/pith/LKVQBXLZDLBFNOXZ3VN4NXNGHM/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/LKVQBXLZDLBFNOXZ3VN4NXNGHM/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-02T14:40:27Z","links":{"resolver":"https://pith.science/pith/LKVQBXLZDLBFNOXZ3VN4NXNGHM","bundle":"https://pith.science/pith/LKVQBXLZDLBFNOXZ3VN4NXNGHM/bundle.json","state":"https://pith.science/pith/LKVQBXLZDLBFNOXZ3VN4NXNGHM/state.json","well_known_bundle":"https://pith.science/.well-known/pith/LKVQBXLZDLBFNOXZ3VN4NXNGHM/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:LKVQBXLZDLBFNOXZ3VN4NXNGHM","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":"444be7d516ca43223b655c61b99b93ca47829be764a174bceb835b62a8bc4707","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-06-11T17:35:27Z","title_canon_sha256":"c80448028d48ab0f3dfac9245612456f7c8a44962c3d02d0297977dc438ec806"},"schema_version":"1.0","source":{"id":"1706.03383","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1706.03383","created_at":"2026-05-18T00:42:35Z"},{"alias_kind":"arxiv_version","alias_value":"1706.03383v1","created_at":"2026-05-18T00:42:35Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1706.03383","created_at":"2026-05-18T00:42:35Z"},{"alias_kind":"pith_short_12","alias_value":"LKVQBXLZDLBF","created_at":"2026-05-18T12:31:28Z"},{"alias_kind":"pith_short_16","alias_value":"LKVQBXLZDLBFNOXZ","created_at":"2026-05-18T12:31:28Z"},{"alias_kind":"pith_short_8","alias_value":"LKVQBXLZ","created_at":"2026-05-18T12:31:28Z"}],"graph_snapshots":[{"event_id":"sha256:947fed5a25b6e5292584831283e80cc1f545c968cc1d09751dcb7b710580cfa7","target":"graph","created_at":"2026-05-18T00:42:35Z","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":"In this work, we give the first construction of high-rate locally list-recoverable codes. List-recovery has been an extremely useful building block in coding theory, and our motivation is to use these codes as such a building block. In particular, our construction gives the first capacity-achieving locally list-decodable codes (over constant-sized alphabet); the first capacity achieving globally list-decodable codes with nearly linear time list decoding algorithm (once more, over constant-sized alphabet); and a randomized construction of binary codes on the Gilbert-Varshamov bound that can be ","authors_text":"Brett Hemenway, Mary Wootters, Noga Ron-Zewi","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-06-11T17:35:27Z","title":"Local List Recovery of High-rate Tensor Codes and Applications"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1706.03383","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:d6d525910dc1b7f1f54e49dbf73532b2097ff7007688bb91a8677ba98a155296","target":"record","created_at":"2026-05-18T00:42:35Z","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":"444be7d516ca43223b655c61b99b93ca47829be764a174bceb835b62a8bc4707","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-06-11T17:35:27Z","title_canon_sha256":"c80448028d48ab0f3dfac9245612456f7c8a44962c3d02d0297977dc438ec806"},"schema_version":"1.0","source":{"id":"1706.03383","kind":"arxiv","version":1}},"canonical_sha256":"5aab00dd791ac256baf9dd5bc6dda63b3d49e46b4e9e5f58b72e7c5ae1c36b7c","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"5aab00dd791ac256baf9dd5bc6dda63b3d49e46b4e9e5f58b72e7c5ae1c36b7c","first_computed_at":"2026-05-18T00:42:35.830430Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:42:35.830430Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"g9Xrfv/sLv6cfNycaXTrqXDpUue/FleU2VOoQtbBQRvgVJzr1WM2g6h1kNeLfXRtVqWAOcPV+IDeIeLd7sYnDg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:42:35.830895Z","signed_message":"canonical_sha256_bytes"},"source_id":"1706.03383","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:d6d525910dc1b7f1f54e49dbf73532b2097ff7007688bb91a8677ba98a155296","sha256:947fed5a25b6e5292584831283e80cc1f545c968cc1d09751dcb7b710580cfa7"],"state_sha256":"1f2d8146e6ecc72af8770feaeca19db40f9c794687f08da4b25aeb39294c3535"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"lTzrfToxQosYlV5QbGBg96uu9PNv+cMKaYA1VzbqVRuxdBqfP+4ViGibWOh8UytxJl4gE3/ghnpoMQTKnm/oBw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-02T14:40:27.226645Z","bundle_sha256":"f3bed1a9a187f4e349f13f345ad87bfb4c23861988807eb893f0223820fe58cc"}}