{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:TE7N4TKLTICU5A4LDPK73353ZT","short_pith_number":"pith:TE7N4TKL","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"},"canonical_sha256":"993ede4d4b9a054e838b1bd5fdefbbccd0050f2231e069061d28442776eaef55","source":{"kind":"arxiv","id":"1308.5239","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1308.5239","created_at":"2026-05-18T03:14:51Z"},{"alias_kind":"arxiv_version","alias_value":"1308.5239v2","created_at":"2026-05-18T03:14:51Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1308.5239","created_at":"2026-05-18T03:14:51Z"},{"alias_kind":"pith_short_12","alias_value":"TE7N4TKLTICU","created_at":"2026-05-18T12:28:02Z"},{"alias_kind":"pith_short_16","alias_value":"TE7N4TKLTICU5A4L","created_at":"2026-05-18T12:28:02Z"},{"alias_kind":"pith_short_8","alias_value":"TE7N4TKL","created_at":"2026-05-18T12:28:02Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:TE7N4TKLTICU5A4LDPK73353ZT","target":"record","payload":{"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"},"canonical_sha256":"993ede4d4b9a054e838b1bd5fdefbbccd0050f2231e069061d28442776eaef55","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"},"source_kind":"arxiv","source_id":"1308.5239","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-18T03:14:51Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"jhTOtJaGEUej1yp9RnZ+DYP20hkO4HNLfGtHafU1VBDuitn0xi2mlSUd9d6hlVFmSu8MZnHQrY5lk+aXviVOBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T07:39:40.907025Z"},"content_sha256":"a4652b34a34498c1f5ed097564e53151bdf0029a733f2bc26d14b00e4f554a64","schema_version":"1.0","event_id":"sha256:a4652b34a34498c1f5ed097564e53151bdf0029a733f2bc26d14b00e4f554a64"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:TE7N4TKLTICU5A4LDPK73353ZT","target":"graph","payload":{"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"},"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-18T03:14:51Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"/eJvL/RTQ7KxUjkNqCiGjLWAlik2cUtRVNWGF93X5VbZA/7hH0ljfLJ+58PorJQ0hVat+xZdoE6rFF3HQq+TCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T07:39:40.907716Z"},"content_sha256":"9d69057129e9793cd77159e0a1a457fbd023cf0c50d9c34aa493d77f34b47a5e","schema_version":"1.0","event_id":"sha256:9d69057129e9793cd77159e0a1a457fbd023cf0c50d9c34aa493d77f34b47a5e"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/TE7N4TKLTICU5A4LDPK73353ZT/bundle.json","state_url":"https://pith.science/pith/TE7N4TKLTICU5A4LDPK73353ZT/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/TE7N4TKLTICU5A4LDPK73353ZT/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-05-26T07:39:40Z","links":{"resolver":"https://pith.science/pith/TE7N4TKLTICU5A4LDPK73353ZT","bundle":"https://pith.science/pith/TE7N4TKLTICU5A4LDPK73353ZT/bundle.json","state":"https://pith.science/pith/TE7N4TKLTICU5A4LDPK73353ZT/state.json","well_known_bundle":"https://pith.science/.well-known/pith/TE7N4TKLTICU5A4LDPK73353ZT/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:TE7N4TKLTICU5A4LDPK73353ZT","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":"64a78365424f0bddd9efa51d36abadde8964dbc384f61cc3bb434375046c65f3","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-08-23T20:43:20Z","title_canon_sha256":"c31f5a4cd2d0f288c2260976fb843955fced1e926c5557d30ff8c3cb57d192be"},"schema_version":"1.0","source":{"id":"1308.5239","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1308.5239","created_at":"2026-05-18T03:14:51Z"},{"alias_kind":"arxiv_version","alias_value":"1308.5239v2","created_at":"2026-05-18T03:14:51Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1308.5239","created_at":"2026-05-18T03:14:51Z"},{"alias_kind":"pith_short_12","alias_value":"TE7N4TKLTICU","created_at":"2026-05-18T12:28:02Z"},{"alias_kind":"pith_short_16","alias_value":"TE7N4TKLTICU5A4L","created_at":"2026-05-18T12:28:02Z"},{"alias_kind":"pith_short_8","alias_value":"TE7N4TKL","created_at":"2026-05-18T12:28:02Z"}],"graph_snapshots":[{"event_id":"sha256:9d69057129e9793cd77159e0a1a457fbd023cf0c50d9c34aa493d77f34b47a5e","target":"graph","created_at":"2026-05-18T03:14:51Z","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":"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","authors_text":"Ali Makhdoumi, Muriel Medard, Shao-Lun Huang, Yury Polyanskiy","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-08-23T20:43:20Z","title":"On Locally Decodable Source Coding"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1308.5239","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:a4652b34a34498c1f5ed097564e53151bdf0029a733f2bc26d14b00e4f554a64","target":"record","created_at":"2026-05-18T03:14:51Z","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":"64a78365424f0bddd9efa51d36abadde8964dbc384f61cc3bb434375046c65f3","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-08-23T20:43:20Z","title_canon_sha256":"c31f5a4cd2d0f288c2260976fb843955fced1e926c5557d30ff8c3cb57d192be"},"schema_version":"1.0","source":{"id":"1308.5239","kind":"arxiv","version":2}},"canonical_sha256":"993ede4d4b9a054e838b1bd5fdefbbccd0050f2231e069061d28442776eaef55","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"993ede4d4b9a054e838b1bd5fdefbbccd0050f2231e069061d28442776eaef55","first_computed_at":"2026-05-18T03:14:51.616427Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:14:51.616427Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"FnvO92Pm8Wqa32Q36wFzy2cJx7gvXuzhxaaZT1PcHUTGDoyYKFsTdVdV31WEdtg4v2BtwQbA45V6pyo6aa0vBw==","signature_status":"signed_v1","signed_at":"2026-05-18T03:14:51.617272Z","signed_message":"canonical_sha256_bytes"},"source_id":"1308.5239","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:a4652b34a34498c1f5ed097564e53151bdf0029a733f2bc26d14b00e4f554a64","sha256:9d69057129e9793cd77159e0a1a457fbd023cf0c50d9c34aa493d77f34b47a5e"],"state_sha256":"e2d22b0be7e414f2f8073a1509da409e55d1fc8e559b19daa8024812ccbb41bf"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"wq8sccKAUoXaE9v8NK/uqGfafm+FitqWHesQrG16jxrE1ZSXp3X4At/jmvftilXcT1LftdNFn2gICEmq+SEFCg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-26T07:39:40.911173Z","bundle_sha256":"761c88fca0615a40b60371ca0f218086062d6b252cbf326219abf2b00029bbfd"}}