{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:ZH2XGPMT42752JWMJHB2663ETP","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":"5a93ce8ae3c0336c2180a99af8ca70218b8bd8d1a027ce71b1183201d0781329","cross_cats_sorted":["math.CO","math.PR"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2016-09-20T21:02:02Z","title_canon_sha256":"edaf84530308c7b7453899601be3b2f4aa8cc20b6d946a0f6e92db80a2b8d928"},"schema_version":"1.0","source":{"id":"1609.06355","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1609.06355","created_at":"2026-05-18T00:41:39Z"},{"alias_kind":"arxiv_version","alias_value":"1609.06355v2","created_at":"2026-05-18T00:41:39Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1609.06355","created_at":"2026-05-18T00:41:39Z"},{"alias_kind":"pith_short_12","alias_value":"ZH2XGPMT4275","created_at":"2026-05-18T12:30:53Z"},{"alias_kind":"pith_short_16","alias_value":"ZH2XGPMT42752JWM","created_at":"2026-05-18T12:30:53Z"},{"alias_kind":"pith_short_8","alias_value":"ZH2XGPMT","created_at":"2026-05-18T12:30:53Z"}],"graph_snapshots":[{"event_id":"sha256:0111f848a13a539cf0962d36c4a5c2bb8c886b743643359a7398a068e781bcde","target":"graph","created_at":"2026-05-18T00:41:39Z","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 codes (LDCs) are error correcting codes that allow for decoding of a single message bit using a small number of queries to a corrupted encoding. Despite decades of study, the optimal trade-off between query complexity and codeword length is far from understood. In this work, we give a new characterization of LDCs using distributions over Boolean functions whose expectation is hard to approximate (in~$L_\\infty$~norm) with a small number of samples. We coin the term `outlaw distributions' for such distributions since they `defy' the Law of Large Numbers. We show that the existe","authors_text":"Jop Bri\\\"et, Sivakanth Gopi, Zeev Dvir","cross_cats":["math.CO","math.PR"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2016-09-20T21:02:02Z","title":"Outlaw distributions and locally decodable codes"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1609.06355","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:ee01031a67c00f95132cd22c8e3e25084dd97cac5adca11b39706d7c52b02ec4","target":"record","created_at":"2026-05-18T00:41:39Z","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":"5a93ce8ae3c0336c2180a99af8ca70218b8bd8d1a027ce71b1183201d0781329","cross_cats_sorted":["math.CO","math.PR"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2016-09-20T21:02:02Z","title_canon_sha256":"edaf84530308c7b7453899601be3b2f4aa8cc20b6d946a0f6e92db80a2b8d928"},"schema_version":"1.0","source":{"id":"1609.06355","kind":"arxiv","version":2}},"canonical_sha256":"c9f5733d93e6bfdd26cc49c3af7b649beb53cb672f24068d5dd855318f7b5839","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"c9f5733d93e6bfdd26cc49c3af7b649beb53cb672f24068d5dd855318f7b5839","first_computed_at":"2026-05-18T00:41:39.055100Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:41:39.055100Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"DtMKKAgMvTu7G8RdKTqsXcfxx7+RI3MaBKZojvejbw9C6pxbCIK6+i8TNugWLpFYTPOP1icWDnmHUFcROydNDQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:41:39.055778Z","signed_message":"canonical_sha256_bytes"},"source_id":"1609.06355","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:ee01031a67c00f95132cd22c8e3e25084dd97cac5adca11b39706d7c52b02ec4","sha256:0111f848a13a539cf0962d36c4a5c2bb8c886b743643359a7398a068e781bcde"],"state_sha256":"43aecbba1866ad2f44b6b60f16be993545cfc3458533720c1d8f4279afb7af4a"}