{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:TE7N4TKLTICU5A4LDPK73353ZT","short_pith_number":"pith:TE7N4TKL","schema_version":"1.0","canonical_sha256":"993ede4d4b9a054e838b1bd5fdefbbccd0050f2231e069061d28442776eaef55","source":{"kind":"arxiv","id":"1308.5239","version":2},"attestation_state":"computed","paper":{"title":"On Locally Decodable Source Coding","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Ali Makhdoumi, Muriel Medard, Shao-Lun Huang, Yury Polyanskiy","submitted_at":"2013-08-23T20:43:20Z","abstract_excerpt":"Locally decodable channel codes form a special class of error-correcting codes with the property that the decoder is able to reconstruct any bit of the input message from querying only a few bits of a noisy codeword. It is well known that such codes require significantly more redundancy (in particular have vanishing rate) compared to their non-local counterparts. In this paper, we define a dual problem, i.e. locally decodable source codes (LDSC). We consider both almost lossless (block error) and lossy (bit error) cases. In almost lossless case, we show that optimal compression (to entropy) is"},"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":"1308.5239","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-08-23T20:43:20Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"c31f5a4cd2d0f288c2260976fb843955fced1e926c5557d30ff8c3cb57d192be","abstract_canon_sha256":"64a78365424f0bddd9efa51d36abadde8964dbc384f61cc3bb434375046c65f3"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:14:51.617272Z","signature_b64":"FnvO92Pm8Wqa32Q36wFzy2cJx7gvXuzhxaaZT1PcHUTGDoyYKFsTdVdV31WEdtg4v2BtwQbA45V6pyo6aa0vBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"993ede4d4b9a054e838b1bd5fdefbbccd0050f2231e069061d28442776eaef55","last_reissued_at":"2026-05-18T03:14:51.616427Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:14:51.616427Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On Locally Decodable Source Coding","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Ali Makhdoumi, Muriel Medard, Shao-Lun Huang, Yury Polyanskiy","submitted_at":"2013-08-23T20:43:20Z","abstract_excerpt":"Locally decodable channel codes form a special class of error-correcting codes with the property that the decoder is able to reconstruct any bit of the input message from querying only a few bits of a noisy codeword. It is well known that such codes require significantly more redundancy (in particular have vanishing rate) compared to their non-local counterparts. In this paper, we define a dual problem, i.e. locally decodable source codes (LDSC). We consider both almost lossless (block error) and lossy (bit error) cases. In almost lossless case, we show that optimal compression (to entropy) is"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1308.5239","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":"1308.5239","created_at":"2026-05-18T03:14:51.616567+00:00"},{"alias_kind":"arxiv_version","alias_value":"1308.5239v2","created_at":"2026-05-18T03:14:51.616567+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1308.5239","created_at":"2026-05-18T03:14:51.616567+00:00"},{"alias_kind":"pith_short_12","alias_value":"TE7N4TKLTICU","created_at":"2026-05-18T12:28:02.375192+00:00"},{"alias_kind":"pith_short_16","alias_value":"TE7N4TKLTICU5A4L","created_at":"2026-05-18T12:28:02.375192+00:00"},{"alias_kind":"pith_short_8","alias_value":"TE7N4TKL","created_at":"2026-05-18T12:28:02.375192+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/TE7N4TKLTICU5A4LDPK73353ZT","json":"https://pith.science/pith/TE7N4TKLTICU5A4LDPK73353ZT.json","graph_json":"https://pith.science/api/pith-number/TE7N4TKLTICU5A4LDPK73353ZT/graph.json","events_json":"https://pith.science/api/pith-number/TE7N4TKLTICU5A4LDPK73353ZT/events.json","paper":"https://pith.science/paper/TE7N4TKL"},"agent_actions":{"view_html":"https://pith.science/pith/TE7N4TKLTICU5A4LDPK73353ZT","download_json":"https://pith.science/pith/TE7N4TKLTICU5A4LDPK73353ZT.json","view_paper":"https://pith.science/paper/TE7N4TKL","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1308.5239&json=true","fetch_graph":"https://pith.science/api/pith-number/TE7N4TKLTICU5A4LDPK73353ZT/graph.json","fetch_events":"https://pith.science/api/pith-number/TE7N4TKLTICU5A4LDPK73353ZT/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/TE7N4TKLTICU5A4LDPK73353ZT/action/timestamp_anchor","attest_storage":"https://pith.science/pith/TE7N4TKLTICU5A4LDPK73353ZT/action/storage_attestation","attest_author":"https://pith.science/pith/TE7N4TKLTICU5A4LDPK73353ZT/action/author_attestation","sign_citation":"https://pith.science/pith/TE7N4TKLTICU5A4LDPK73353ZT/action/citation_signature","submit_replication":"https://pith.science/pith/TE7N4TKLTICU5A4LDPK73353ZT/action/replication_record"}},"created_at":"2026-05-18T03:14:51.616567+00:00","updated_at":"2026-05-18T03:14:51.616567+00:00"}