{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:RIQGUOOTAHT2G6GPHH7U3AUUCK","short_pith_number":"pith:RIQGUOOT","canonical_record":{"source":{"id":"1402.6952","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2014-02-27T16:14:10Z","cross_cats_sorted":["cs.DM"],"title_canon_sha256":"979ad915529136997b5a4d2e1e8a28fd8164a7fffc11722bad87e3c46c413a11","abstract_canon_sha256":"4d1dcba882c7c91de57d7b7f31d2b5919eb71340a3f6a3256050834fff736b65"},"schema_version":"1.0"},"canonical_sha256":"8a206a39d301e7a378cf39ff4d82941297bf16fec06bbfdb578cedc780d53542","source":{"kind":"arxiv","id":"1402.6952","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1402.6952","created_at":"2026-05-18T02:57:36Z"},{"alias_kind":"arxiv_version","alias_value":"1402.6952v1","created_at":"2026-05-18T02:57:36Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1402.6952","created_at":"2026-05-18T02:57:36Z"},{"alias_kind":"pith_short_12","alias_value":"RIQGUOOTAHT2","created_at":"2026-05-18T12:28:46Z"},{"alias_kind":"pith_short_16","alias_value":"RIQGUOOTAHT2G6GP","created_at":"2026-05-18T12:28:46Z"},{"alias_kind":"pith_short_8","alias_value":"RIQGUOOT","created_at":"2026-05-18T12:28:46Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:RIQGUOOTAHT2G6GPHH7U3AUUCK","target":"record","payload":{"canonical_record":{"source":{"id":"1402.6952","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2014-02-27T16:14:10Z","cross_cats_sorted":["cs.DM"],"title_canon_sha256":"979ad915529136997b5a4d2e1e8a28fd8164a7fffc11722bad87e3c46c413a11","abstract_canon_sha256":"4d1dcba882c7c91de57d7b7f31d2b5919eb71340a3f6a3256050834fff736b65"},"schema_version":"1.0"},"canonical_sha256":"8a206a39d301e7a378cf39ff4d82941297bf16fec06bbfdb578cedc780d53542","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:57:36.538323Z","signature_b64":"oDHduMex6cum4iFs6KvQsxBYgKQa9Wxb5sxIfDwF6uJiYSnLN2oW2z4WPPL7mi3qeD2GxH4CozFAIvBSZp7iAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8a206a39d301e7a378cf39ff4d82941297bf16fec06bbfdb578cedc780d53542","last_reissued_at":"2026-05-18T02:57:36.537767Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:57:36.537767Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1402.6952","source_version":1,"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-18T02:57:36Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"nim3rPY4x/9DvptxQrz06hszcBd/dVE+Hqvla5nnMqJ0xOSuEqQBTyZbPeZ6GHYyiBZLg4w/iOZLWcrNK3KuAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-10T01:12:19.215633Z"},"content_sha256":"d1cca345377a4fea22add761181affc0a7a754d02e95cc64636dc62ac3a79c0a","schema_version":"1.0","event_id":"sha256:d1cca345377a4fea22add761181affc0a7a754d02e95cc64636dc62ac3a79c0a"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:RIQGUOOTAHT2G6GPHH7U3AUUCK","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Lower Bounds for Approximate LDC","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"cs.CC","authors_text":"Guangda Hu, Jop Bri\\\"et, Shubhangi Saraf, Zeev Dvir","submitted_at":"2014-02-27T16:14:10Z","abstract_excerpt":"We study an approximate version of $q$-query LDCs (Locally Decodable Codes) over the real numbers and prove lower bounds on the encoding length of such codes. A $q$-query $(\\alpha,\\delta)$-approximate LDC is a set $V$ of $n$ points in $\\mathbb{R}^d$ so that, for each $i \\in [d]$ there are $\\Omega(\\delta n)$ disjoint $q$-tuples $(\\vec{u}_1,\\ldots,\\vec{u}_q) $ in $V$ so that $\\text{span}(\\vec{u}_1,\\ldots,\\vec{u}_q)$ contains a unit vector whose $i$'th coordinate is at least $\\alpha$. We prove exponential lower bounds of the form $n \\geq 2^{\\Omega(\\alpha \\delta \\sqrt{d})}$ for the case $q=2$ and,"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1402.6952","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"},"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-18T02:57:36Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"RYp9vMm8Ul4LQqEU4OuXuMDf79+9Sb4FOPph3kNqlUWUAIdVN2rnrGRjauN8A2zP3U2HMnth5TbLTZwQKGrJCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-10T01:12:19.216408Z"},"content_sha256":"58b5cda258803970f85463c3f8dc6543e9c1bd97cc756efa58bc3f3cac40b68b","schema_version":"1.0","event_id":"sha256:58b5cda258803970f85463c3f8dc6543e9c1bd97cc756efa58bc3f3cac40b68b"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/RIQGUOOTAHT2G6GPHH7U3AUUCK/bundle.json","state_url":"https://pith.science/pith/RIQGUOOTAHT2G6GPHH7U3AUUCK/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/RIQGUOOTAHT2G6GPHH7U3AUUCK/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-06-10T01:12:19Z","links":{"resolver":"https://pith.science/pith/RIQGUOOTAHT2G6GPHH7U3AUUCK","bundle":"https://pith.science/pith/RIQGUOOTAHT2G6GPHH7U3AUUCK/bundle.json","state":"https://pith.science/pith/RIQGUOOTAHT2G6GPHH7U3AUUCK/state.json","well_known_bundle":"https://pith.science/.well-known/pith/RIQGUOOTAHT2G6GPHH7U3AUUCK/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:RIQGUOOTAHT2G6GPHH7U3AUUCK","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":"4d1dcba882c7c91de57d7b7f31d2b5919eb71340a3f6a3256050834fff736b65","cross_cats_sorted":["cs.DM"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2014-02-27T16:14:10Z","title_canon_sha256":"979ad915529136997b5a4d2e1e8a28fd8164a7fffc11722bad87e3c46c413a11"},"schema_version":"1.0","source":{"id":"1402.6952","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1402.6952","created_at":"2026-05-18T02:57:36Z"},{"alias_kind":"arxiv_version","alias_value":"1402.6952v1","created_at":"2026-05-18T02:57:36Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1402.6952","created_at":"2026-05-18T02:57:36Z"},{"alias_kind":"pith_short_12","alias_value":"RIQGUOOTAHT2","created_at":"2026-05-18T12:28:46Z"},{"alias_kind":"pith_short_16","alias_value":"RIQGUOOTAHT2G6GP","created_at":"2026-05-18T12:28:46Z"},{"alias_kind":"pith_short_8","alias_value":"RIQGUOOT","created_at":"2026-05-18T12:28:46Z"}],"graph_snapshots":[{"event_id":"sha256:58b5cda258803970f85463c3f8dc6543e9c1bd97cc756efa58bc3f3cac40b68b","target":"graph","created_at":"2026-05-18T02:57:36Z","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":"We study an approximate version of $q$-query LDCs (Locally Decodable Codes) over the real numbers and prove lower bounds on the encoding length of such codes. A $q$-query $(\\alpha,\\delta)$-approximate LDC is a set $V$ of $n$ points in $\\mathbb{R}^d$ so that, for each $i \\in [d]$ there are $\\Omega(\\delta n)$ disjoint $q$-tuples $(\\vec{u}_1,\\ldots,\\vec{u}_q) $ in $V$ so that $\\text{span}(\\vec{u}_1,\\ldots,\\vec{u}_q)$ contains a unit vector whose $i$'th coordinate is at least $\\alpha$. We prove exponential lower bounds of the form $n \\geq 2^{\\Omega(\\alpha \\delta \\sqrt{d})}$ for the case $q=2$ and,","authors_text":"Guangda Hu, Jop Bri\\\"et, Shubhangi Saraf, Zeev Dvir","cross_cats":["cs.DM"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2014-02-27T16:14:10Z","title":"Lower Bounds for Approximate LDC"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1402.6952","kind":"arxiv","version":1},"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:d1cca345377a4fea22add761181affc0a7a754d02e95cc64636dc62ac3a79c0a","target":"record","created_at":"2026-05-18T02:57:36Z","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":"4d1dcba882c7c91de57d7b7f31d2b5919eb71340a3f6a3256050834fff736b65","cross_cats_sorted":["cs.DM"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2014-02-27T16:14:10Z","title_canon_sha256":"979ad915529136997b5a4d2e1e8a28fd8164a7fffc11722bad87e3c46c413a11"},"schema_version":"1.0","source":{"id":"1402.6952","kind":"arxiv","version":1}},"canonical_sha256":"8a206a39d301e7a378cf39ff4d82941297bf16fec06bbfdb578cedc780d53542","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"8a206a39d301e7a378cf39ff4d82941297bf16fec06bbfdb578cedc780d53542","first_computed_at":"2026-05-18T02:57:36.537767Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:57:36.537767Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"oDHduMex6cum4iFs6KvQsxBYgKQa9Wxb5sxIfDwF6uJiYSnLN2oW2z4WPPL7mi3qeD2GxH4CozFAIvBSZp7iAw==","signature_status":"signed_v1","signed_at":"2026-05-18T02:57:36.538323Z","signed_message":"canonical_sha256_bytes"},"source_id":"1402.6952","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:d1cca345377a4fea22add761181affc0a7a754d02e95cc64636dc62ac3a79c0a","sha256:58b5cda258803970f85463c3f8dc6543e9c1bd97cc756efa58bc3f3cac40b68b"],"state_sha256":"4895614f8b637bfe5e5ffad6d67dcdef4da060e38913c8cf1ebc31f7f5426ecb"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"pjVW6sROEd6kfRf8c83Khh3vN8Ky59WIRX+yJaRXUqg93/MKCuIUKwoUj7C35uvEIzWz/CNVudoS1j2vtZVHDQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-10T01:12:19.220745Z","bundle_sha256":"2c75bf0cc7fee5afc8dda7b8d37ec62f2348fce6d178a0482a49f8faee7776c2"}}