{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:4W6SPIC2OPFQORQ2GTK35LVNNK","short_pith_number":"pith:4W6SPIC2","schema_version":"1.0","canonical_sha256":"e5bd27a05a73cb07461a34d5beaead6ab9d0812a9b6bcccad42c9f25af298424","source":{"kind":"arxiv","id":"1304.8129","version":2},"attestation_state":"computed","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"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1304.8129","created_at":"2026-05-18T02:29:55.268037+00:00"},{"alias_kind":"arxiv_version","alias_value":"1304.8129v2","created_at":"2026-05-18T02:29:55.268037+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1304.8129","created_at":"2026-05-18T02:29:55.268037+00:00"},{"alias_kind":"pith_short_12","alias_value":"4W6SPIC2OPFQ","created_at":"2026-05-18T12:27:34.582898+00:00"},{"alias_kind":"pith_short_16","alias_value":"4W6SPIC2OPFQORQ2","created_at":"2026-05-18T12:27:34.582898+00:00"},{"alias_kind":"pith_short_8","alias_value":"4W6SPIC2","created_at":"2026-05-18T12:27:34.582898+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/4W6SPIC2OPFQORQ2GTK35LVNNK","json":"https://pith.science/pith/4W6SPIC2OPFQORQ2GTK35LVNNK.json","graph_json":"https://pith.science/api/pith-number/4W6SPIC2OPFQORQ2GTK35LVNNK/graph.json","events_json":"https://pith.science/api/pith-number/4W6SPIC2OPFQORQ2GTK35LVNNK/events.json","paper":"https://pith.science/paper/4W6SPIC2"},"agent_actions":{"view_html":"https://pith.science/pith/4W6SPIC2OPFQORQ2GTK35LVNNK","download_json":"https://pith.science/pith/4W6SPIC2OPFQORQ2GTK35LVNNK.json","view_paper":"https://pith.science/paper/4W6SPIC2","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1304.8129&json=true","fetch_graph":"https://pith.science/api/pith-number/4W6SPIC2OPFQORQ2GTK35LVNNK/graph.json","fetch_events":"https://pith.science/api/pith-number/4W6SPIC2OPFQORQ2GTK35LVNNK/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/4W6SPIC2OPFQORQ2GTK35LVNNK/action/timestamp_anchor","attest_storage":"https://pith.science/pith/4W6SPIC2OPFQORQ2GTK35LVNNK/action/storage_attestation","attest_author":"https://pith.science/pith/4W6SPIC2OPFQORQ2GTK35LVNNK/action/author_attestation","sign_citation":"https://pith.science/pith/4W6SPIC2OPFQORQ2GTK35LVNNK/action/citation_signature","submit_replication":"https://pith.science/pith/4W6SPIC2OPFQORQ2GTK35LVNNK/action/replication_record"}},"created_at":"2026-05-18T02:29:55.268037+00:00","updated_at":"2026-05-18T02:29:55.268037+00:00"}