{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2008:RROBA3B3BPMJX4HF2BJ5NYOQ7P","short_pith_number":"pith:RROBA3B3","schema_version":"1.0","canonical_sha256":"8c5c106c3b0bd89bf0e5d053d6e1d0fbd3aaf89a18537ab8c315279f390d354a","source":{"kind":"arxiv","id":"0810.4576","version":2},"attestation_state":"computed","paper":{"title":"New Constructions for Query-Efficient Locally Decodable Codes of Subexponential Length","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CR"],"primary_cat":"cs.CC","authors_text":"Toshiya Itoh, Yasuhiro Suzuki","submitted_at":"2008-10-25T04:53:23Z","abstract_excerpt":"A $(k,\\delta,\\epsilon)$-locally decodable code $C: F_{q}^{n} \\to F_{q}^{N}$ is an error-correcting code that encodes each message $\\vec{x}=(x_{1},x_{2},...,x_{n}) \\in F_{q}^{n}$ to $C(\\vec{x}) \\in F_{q}^{N}$ and has the following property: For any $\\vec{y} \\in {\\bf F}_{q}^{N}$ such that $d(\\vec{y},C(\\vec{x})) \\leq \\delta N$ and each $1 \\leq i \\leq n$, the symbol $x_{i}$ of $\\vec{x}$ can be recovered with probability at least $1-\\epsilon$ by a randomized decoding algorithm looking only at $k$ coordinates of $\\vec{y}$. The efficiency of a $(k,\\delta,\\epsilon)$-locally decodable code $C: F_{q}^{n"},"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":"0810.4576","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2008-10-25T04:53:23Z","cross_cats_sorted":["cs.CR"],"title_canon_sha256":"3e6972ca4cb4e5486e0c32c3f58243ef5d8d502bc5ee62b9662c1b04b7b8ec4d","abstract_canon_sha256":"45a9fc9fe6a7a97410efe9c7d6a0c6c4eee6a8d52027de64deba1572ed0aaca5"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:12:10.773394Z","signature_b64":"X6V5sJrc82N/NW/NHL6o+Re+dzMOI58pMzxQjYiyVLjW9wxt1HvU9Eqkj3U22ioQoUoWkCRdu8foQ+wtEgaZDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8c5c106c3b0bd89bf0e5d053d6e1d0fbd3aaf89a18537ab8c315279f390d354a","last_reissued_at":"2026-05-18T04:12:10.772885Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:12:10.772885Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"New Constructions for Query-Efficient Locally Decodable Codes of Subexponential Length","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CR"],"primary_cat":"cs.CC","authors_text":"Toshiya Itoh, Yasuhiro Suzuki","submitted_at":"2008-10-25T04:53:23Z","abstract_excerpt":"A $(k,\\delta,\\epsilon)$-locally decodable code $C: F_{q}^{n} \\to F_{q}^{N}$ is an error-correcting code that encodes each message $\\vec{x}=(x_{1},x_{2},...,x_{n}) \\in F_{q}^{n}$ to $C(\\vec{x}) \\in F_{q}^{N}$ and has the following property: For any $\\vec{y} \\in {\\bf F}_{q}^{N}$ such that $d(\\vec{y},C(\\vec{x})) \\leq \\delta N$ and each $1 \\leq i \\leq n$, the symbol $x_{i}$ of $\\vec{x}$ can be recovered with probability at least $1-\\epsilon$ by a randomized decoding algorithm looking only at $k$ coordinates of $\\vec{y}$. The efficiency of a $(k,\\delta,\\epsilon)$-locally decodable code $C: F_{q}^{n"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"0810.4576","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":"0810.4576","created_at":"2026-05-18T04:12:10.772960+00:00"},{"alias_kind":"arxiv_version","alias_value":"0810.4576v2","created_at":"2026-05-18T04:12:10.772960+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0810.4576","created_at":"2026-05-18T04:12:10.772960+00:00"},{"alias_kind":"pith_short_12","alias_value":"RROBA3B3BPMJ","created_at":"2026-05-18T12:25:58.018023+00:00"},{"alias_kind":"pith_short_16","alias_value":"RROBA3B3BPMJX4HF","created_at":"2026-05-18T12:25:58.018023+00:00"},{"alias_kind":"pith_short_8","alias_value":"RROBA3B3","created_at":"2026-05-18T12:25:58.018023+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/RROBA3B3BPMJX4HF2BJ5NYOQ7P","json":"https://pith.science/pith/RROBA3B3BPMJX4HF2BJ5NYOQ7P.json","graph_json":"https://pith.science/api/pith-number/RROBA3B3BPMJX4HF2BJ5NYOQ7P/graph.json","events_json":"https://pith.science/api/pith-number/RROBA3B3BPMJX4HF2BJ5NYOQ7P/events.json","paper":"https://pith.science/paper/RROBA3B3"},"agent_actions":{"view_html":"https://pith.science/pith/RROBA3B3BPMJX4HF2BJ5NYOQ7P","download_json":"https://pith.science/pith/RROBA3B3BPMJX4HF2BJ5NYOQ7P.json","view_paper":"https://pith.science/paper/RROBA3B3","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=0810.4576&json=true","fetch_graph":"https://pith.science/api/pith-number/RROBA3B3BPMJX4HF2BJ5NYOQ7P/graph.json","fetch_events":"https://pith.science/api/pith-number/RROBA3B3BPMJX4HF2BJ5NYOQ7P/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/RROBA3B3BPMJX4HF2BJ5NYOQ7P/action/timestamp_anchor","attest_storage":"https://pith.science/pith/RROBA3B3BPMJX4HF2BJ5NYOQ7P/action/storage_attestation","attest_author":"https://pith.science/pith/RROBA3B3BPMJX4HF2BJ5NYOQ7P/action/author_attestation","sign_citation":"https://pith.science/pith/RROBA3B3BPMJX4HF2BJ5NYOQ7P/action/citation_signature","submit_replication":"https://pith.science/pith/RROBA3B3BPMJX4HF2BJ5NYOQ7P/action/replication_record"}},"created_at":"2026-05-18T04:12:10.772960+00:00","updated_at":"2026-05-18T04:12:10.772960+00:00"}