{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:4W6SPIC2OPFQORQ2GTK35LVNNK","short_pith_number":"pith:4W6SPIC2","canonical_record":{"source":{"id":"1304.8129","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-04-30T19:40:30Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"9466cd82380212305606778cdf044a1a5b1c55871d1da73d3b1246018fdb9074","abstract_canon_sha256":"74b9ac4cb0fd0ce57d9ea6aa036d722e34c5cd02a7432531cefe4880d85cf27a"},"schema_version":"1.0"},"canonical_sha256":"e5bd27a05a73cb07461a34d5beaead6ab9d0812a9b6bcccad42c9f25af298424","source":{"kind":"arxiv","id":"1304.8129","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1304.8129","created_at":"2026-05-18T02:29:55Z"},{"alias_kind":"arxiv_version","alias_value":"1304.8129v2","created_at":"2026-05-18T02:29:55Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1304.8129","created_at":"2026-05-18T02:29:55Z"},{"alias_kind":"pith_short_12","alias_value":"4W6SPIC2OPFQ","created_at":"2026-05-18T12:27:34Z"},{"alias_kind":"pith_short_16","alias_value":"4W6SPIC2OPFQORQ2","created_at":"2026-05-18T12:27:34Z"},{"alias_kind":"pith_short_8","alias_value":"4W6SPIC2","created_at":"2026-05-18T12:27:34Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:4W6SPIC2OPFQORQ2GTK35LVNNK","target":"record","payload":{"canonical_record":{"source":{"id":"1304.8129","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-04-30T19:40:30Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"9466cd82380212305606778cdf044a1a5b1c55871d1da73d3b1246018fdb9074","abstract_canon_sha256":"74b9ac4cb0fd0ce57d9ea6aa036d722e34c5cd02a7432531cefe4880d85cf27a"},"schema_version":"1.0"},"canonical_sha256":"e5bd27a05a73cb07461a34d5beaead6ab9d0812a9b6bcccad42c9f25af298424","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:29:55.268464Z","signature_b64":"uw2e8EvJpzx6drQl/o7tvIVGW2sQ/WzR79ZLXTCPeJtYWLuiYk23Kxo23qVJp7wpjYt3WU7S6QDSSoUzB7+SCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e5bd27a05a73cb07461a34d5beaead6ab9d0812a9b6bcccad42c9f25af298424","last_reissued_at":"2026-05-18T02:29:55.267974Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:29:55.267974Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1304.8129","source_version":2,"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-18T02:29:55Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"6ja7We2F5hUQQc/dLxhknQxokIrzCD0rW1gr4Kyr3AJ4cs9i8rdOyL8UGjOHH5n3LwEM3suZcO7xMQ4/K0RRBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T12:05:57.399713Z"},"content_sha256":"642f96025cf161e0f45eb1ea6dfa95fb902a5e3d57d6f82dbeaa1d955975c8fb","schema_version":"1.0","event_id":"sha256:642f96025cf161e0f45eb1ea6dfa95fb902a5e3d57d6f82dbeaa1d955975c8fb"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:4W6SPIC2OPFQORQ2GTK35LVNNK","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Local Correctability of Expander Codes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Brett Hemenway, Mary Wootters, Rafail Ostrovsky","submitted_at":"2013-04-30T19:40:30Z","abstract_excerpt":"In this work, we present the first local-decoding algorithm for expander codes. This yields a new family of constant-rate codes that can recover from a constant fraction of errors in the codeword symbols, and where any symbol of the codeword can be recovered with high probability by reading $N^\\epsilon$ symbols from the corrupted codeword, where $N$ is the block-length of the code.\n  Expander codes, introduced by Sipser and Spielman, are formed from an expander graph $G = (V,E)$ of degree $d$, and an inner code of block-length $d$ over an alphabet $\\Sigma$. Each edge of the expander graph is a"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1304.8129","kind":"arxiv","version":2},"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-18T02:29:55Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Qh0AjeiTOrYbpTaP83tjY6s7b+SqwzN2a2YiodkhEd8tVs4CLireWXf59YdIjALEJuexhiVQR4LZ2GIeKmuPCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T12:05:57.400058Z"},"content_sha256":"529bc7a177751014011fd6d848e22d40977e790883cb755b0f431f043eaf4689","schema_version":"1.0","event_id":"sha256:529bc7a177751014011fd6d848e22d40977e790883cb755b0f431f043eaf4689"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/4W6SPIC2OPFQORQ2GTK35LVNNK/bundle.json","state_url":"https://pith.science/pith/4W6SPIC2OPFQORQ2GTK35LVNNK/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/4W6SPIC2OPFQORQ2GTK35LVNNK/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-02T12:05:57Z","links":{"resolver":"https://pith.science/pith/4W6SPIC2OPFQORQ2GTK35LVNNK","bundle":"https://pith.science/pith/4W6SPIC2OPFQORQ2GTK35LVNNK/bundle.json","state":"https://pith.science/pith/4W6SPIC2OPFQORQ2GTK35LVNNK/state.json","well_known_bundle":"https://pith.science/.well-known/pith/4W6SPIC2OPFQORQ2GTK35LVNNK/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:4W6SPIC2OPFQORQ2GTK35LVNNK","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":"74b9ac4cb0fd0ce57d9ea6aa036d722e34c5cd02a7432531cefe4880d85cf27a","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-04-30T19:40:30Z","title_canon_sha256":"9466cd82380212305606778cdf044a1a5b1c55871d1da73d3b1246018fdb9074"},"schema_version":"1.0","source":{"id":"1304.8129","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1304.8129","created_at":"2026-05-18T02:29:55Z"},{"alias_kind":"arxiv_version","alias_value":"1304.8129v2","created_at":"2026-05-18T02:29:55Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1304.8129","created_at":"2026-05-18T02:29:55Z"},{"alias_kind":"pith_short_12","alias_value":"4W6SPIC2OPFQ","created_at":"2026-05-18T12:27:34Z"},{"alias_kind":"pith_short_16","alias_value":"4W6SPIC2OPFQORQ2","created_at":"2026-05-18T12:27:34Z"},{"alias_kind":"pith_short_8","alias_value":"4W6SPIC2","created_at":"2026-05-18T12:27:34Z"}],"graph_snapshots":[{"event_id":"sha256:529bc7a177751014011fd6d848e22d40977e790883cb755b0f431f043eaf4689","target":"graph","created_at":"2026-05-18T02:29:55Z","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 present the first local-decoding algorithm for expander codes. This yields a new family of constant-rate codes that can recover from a constant fraction of errors in the codeword symbols, and where any symbol of the codeword can be recovered with high probability by reading $N^\\epsilon$ symbols from the corrupted codeword, where $N$ is the block-length of the code.\n  Expander codes, introduced by Sipser and Spielman, are formed from an expander graph $G = (V,E)$ of degree $d$, and an inner code of block-length $d$ over an alphabet $\\Sigma$. Each edge of the expander graph is a","authors_text":"Brett Hemenway, Mary Wootters, Rafail Ostrovsky","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-04-30T19:40:30Z","title":"Local Correctability of Expander Codes"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1304.8129","kind":"arxiv","version":2},"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:642f96025cf161e0f45eb1ea6dfa95fb902a5e3d57d6f82dbeaa1d955975c8fb","target":"record","created_at":"2026-05-18T02:29:55Z","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":"74b9ac4cb0fd0ce57d9ea6aa036d722e34c5cd02a7432531cefe4880d85cf27a","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-04-30T19:40:30Z","title_canon_sha256":"9466cd82380212305606778cdf044a1a5b1c55871d1da73d3b1246018fdb9074"},"schema_version":"1.0","source":{"id":"1304.8129","kind":"arxiv","version":2}},"canonical_sha256":"e5bd27a05a73cb07461a34d5beaead6ab9d0812a9b6bcccad42c9f25af298424","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"e5bd27a05a73cb07461a34d5beaead6ab9d0812a9b6bcccad42c9f25af298424","first_computed_at":"2026-05-18T02:29:55.267974Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:29:55.267974Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"uw2e8EvJpzx6drQl/o7tvIVGW2sQ/WzR79ZLXTCPeJtYWLuiYk23Kxo23qVJp7wpjYt3WU7S6QDSSoUzB7+SCA==","signature_status":"signed_v1","signed_at":"2026-05-18T02:29:55.268464Z","signed_message":"canonical_sha256_bytes"},"source_id":"1304.8129","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:642f96025cf161e0f45eb1ea6dfa95fb902a5e3d57d6f82dbeaa1d955975c8fb","sha256:529bc7a177751014011fd6d848e22d40977e790883cb755b0f431f043eaf4689"],"state_sha256":"a829d7c546490a43c1493f59ed19a401b1b8e82415ec5d0ad25fa83007cdb1ed"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"KEdTpn3dT7XSZlVhmBRrTMuVSFN8xvk9qk3dzSxWRWDo/a0ytJiPbHhZ2Gi+PTl2ltIa45gLcPJqdYEeVXN9Dg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-02T12:05:57.402129Z","bundle_sha256":"cd892714d8d4c8a897f4f777a27c12e75dc19af40cd7108f18ff9faf6df69131"}}