{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:AWUJONAHEHLMPT5WAO5I6XDAIM","short_pith_number":"pith:AWUJONAH","schema_version":"1.0","canonical_sha256":"05a897340721d6c7cfb603ba8f5c604315c221a64d3fa4cd732cb4327f9caf09","source":{"kind":"arxiv","id":"1812.05566","version":1},"attestation_state":"computed","paper":{"title":"On the Capacity of Locally Decodable Codes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Hua Sun, Syed A. Jafar","submitted_at":"2018-12-13T18:34:53Z","abstract_excerpt":"A locally decodable code (LDC) maps $K$ source symbols, each of size $L_w$ bits, to $M$ coded symbols, each of size $L_x$ bits, such that each source symbol can be decoded from $N \\leq M$ coded symbols. A perfectly smooth LDC further requires that each coded symbol is uniformly accessed when we decode any one of the messages. The ratio $L_w/L_x$ is called the symbol rate of an LDC. The highest possible symbol rate for a class of LDCs is called the capacity of that class. It is shown that given $K, N$, the maximum value of capacity of perfectly smooth LDCs, maximized over all code lengths $M$, "},"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":"1812.05566","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2018-12-13T18:34:53Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"2a3b2b3da2fd27fb410d5989a82c85ac346615abaeb52b473bf6e36426391f3a","abstract_canon_sha256":"90ceffc028bfac4853fdc843895eff25e5af31c3b7e1b4e1c15f84da73f5bb1c"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:58:19.937963Z","signature_b64":"Ls2tOscZqO9nvIg9X3aYVKmdb4gCcI9h5dfBMHG5lEdi8Xzi3w3xThmbfIeeA17iz7HGLJ/2CQgqOyCV5eeLDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"05a897340721d6c7cfb603ba8f5c604315c221a64d3fa4cd732cb4327f9caf09","last_reissued_at":"2026-05-17T23:58:19.937554Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:58:19.937554Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On the Capacity of Locally Decodable Codes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Hua Sun, Syed A. Jafar","submitted_at":"2018-12-13T18:34:53Z","abstract_excerpt":"A locally decodable code (LDC) maps $K$ source symbols, each of size $L_w$ bits, to $M$ coded symbols, each of size $L_x$ bits, such that each source symbol can be decoded from $N \\leq M$ coded symbols. A perfectly smooth LDC further requires that each coded symbol is uniformly accessed when we decode any one of the messages. The ratio $L_w/L_x$ is called the symbol rate of an LDC. The highest possible symbol rate for a class of LDCs is called the capacity of that class. It is shown that given $K, N$, the maximum value of capacity of perfectly smooth LDCs, maximized over all code lengths $M$, "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1812.05566","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1812.05566","created_at":"2026-05-17T23:58:19.937612+00:00"},{"alias_kind":"arxiv_version","alias_value":"1812.05566v1","created_at":"2026-05-17T23:58:19.937612+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1812.05566","created_at":"2026-05-17T23:58:19.937612+00:00"},{"alias_kind":"pith_short_12","alias_value":"AWUJONAHEHLM","created_at":"2026-05-18T12:32:13.499390+00:00"},{"alias_kind":"pith_short_16","alias_value":"AWUJONAHEHLMPT5W","created_at":"2026-05-18T12:32:13.499390+00:00"},{"alias_kind":"pith_short_8","alias_value":"AWUJONAH","created_at":"2026-05-18T12:32:13.499390+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/AWUJONAHEHLMPT5WAO5I6XDAIM","json":"https://pith.science/pith/AWUJONAHEHLMPT5WAO5I6XDAIM.json","graph_json":"https://pith.science/api/pith-number/AWUJONAHEHLMPT5WAO5I6XDAIM/graph.json","events_json":"https://pith.science/api/pith-number/AWUJONAHEHLMPT5WAO5I6XDAIM/events.json","paper":"https://pith.science/paper/AWUJONAH"},"agent_actions":{"view_html":"https://pith.science/pith/AWUJONAHEHLMPT5WAO5I6XDAIM","download_json":"https://pith.science/pith/AWUJONAHEHLMPT5WAO5I6XDAIM.json","view_paper":"https://pith.science/paper/AWUJONAH","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1812.05566&json=true","fetch_graph":"https://pith.science/api/pith-number/AWUJONAHEHLMPT5WAO5I6XDAIM/graph.json","fetch_events":"https://pith.science/api/pith-number/AWUJONAHEHLMPT5WAO5I6XDAIM/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/AWUJONAHEHLMPT5WAO5I6XDAIM/action/timestamp_anchor","attest_storage":"https://pith.science/pith/AWUJONAHEHLMPT5WAO5I6XDAIM/action/storage_attestation","attest_author":"https://pith.science/pith/AWUJONAHEHLMPT5WAO5I6XDAIM/action/author_attestation","sign_citation":"https://pith.science/pith/AWUJONAHEHLMPT5WAO5I6XDAIM/action/citation_signature","submit_replication":"https://pith.science/pith/AWUJONAHEHLMPT5WAO5I6XDAIM/action/replication_record"}},"created_at":"2026-05-17T23:58:19.937612+00:00","updated_at":"2026-05-17T23:58:19.937612+00:00"}