{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:Y5J4EHYLZXFFGXF2CUNM2NKPFI","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":"7d5e68f8d4267e743c8d7a63ece841def53699f923fa3d351524f8ed2f826526","cross_cats_sorted":["math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.MG","submitted_at":"2016-10-02T08:24:06Z","title_canon_sha256":"b552f71699f9fc6e94251ac62d63b0b8c65dc02ee22a5dde44145ca535a3a35f"},"schema_version":"1.0","source":{"id":"1610.00239","kind":"arxiv","version":4}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1610.00239","created_at":"2026-05-18T00:47:26Z"},{"alias_kind":"arxiv_version","alias_value":"1610.00239v4","created_at":"2026-05-18T00:47:26Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1610.00239","created_at":"2026-05-18T00:47:26Z"},{"alias_kind":"pith_short_12","alias_value":"Y5J4EHYLZXFF","created_at":"2026-05-18T12:30:53Z"},{"alias_kind":"pith_short_16","alias_value":"Y5J4EHYLZXFFGXF2","created_at":"2026-05-18T12:30:53Z"},{"alias_kind":"pith_short_8","alias_value":"Y5J4EHYL","created_at":"2026-05-18T12:30:53Z"}],"graph_snapshots":[{"event_id":"sha256:b685124c0d27f45b1cb9ba2ad9a89bc5073747bfd7ae50ae83639e50fc4e8f22","target":"graph","created_at":"2026-05-18T00:47:26Z","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":"Let $X$ be a set of $n$ points of norm at most $1$ in the Euclidean space $R^k$, and suppose $\\varepsilon>0$. An $\\varepsilon$-distance sketch for $X$ is a data structure that, given any two points of $X$ enables one to recover the square of the (Euclidean) distance between them up to an {\\em additive} error of $\\varepsilon$. Let $f(n,k,\\varepsilon)$ denote the minimum possible number of bits of such a sketch. Here we determine $f(n,k,\\varepsilon)$ up to a constant factor for all $n \\geq k \\geq 1$ and all $\\varepsilon \\geq \\frac{1}{n^{0.49}}$. Our proof is algorithmic, and provides an efficien","authors_text":"Bo'az Klartag, Noga Alon","cross_cats":["math.CO"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.MG","submitted_at":"2016-10-02T08:24:06Z","title":"Optimal compression of approximate inner products and dimension reduction"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1610.00239","kind":"arxiv","version":4},"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:2c39398ea43633abd1760b74500bf83ff4066cafebe285d34c31de77a5e77dcf","target":"record","created_at":"2026-05-18T00:47:26Z","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":"7d5e68f8d4267e743c8d7a63ece841def53699f923fa3d351524f8ed2f826526","cross_cats_sorted":["math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.MG","submitted_at":"2016-10-02T08:24:06Z","title_canon_sha256":"b552f71699f9fc6e94251ac62d63b0b8c65dc02ee22a5dde44145ca535a3a35f"},"schema_version":"1.0","source":{"id":"1610.00239","kind":"arxiv","version":4}},"canonical_sha256":"c753c21f0bcdca535cba151acd354f2a3d6eef15b6257ee15d06884061592c8d","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"c753c21f0bcdca535cba151acd354f2a3d6eef15b6257ee15d06884061592c8d","first_computed_at":"2026-05-18T00:47:26.771154Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:47:26.771154Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"fVrosDlOKOiw7MDSZOv/UAlX8q/ahQOIcNkjsQbiIArbIT7VgPSIpOqR+mBXCiVS9M8tyfqGQFzFJ/GVvZQyAA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:47:26.771632Z","signed_message":"canonical_sha256_bytes"},"source_id":"1610.00239","source_kind":"arxiv","source_version":4}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:2c39398ea43633abd1760b74500bf83ff4066cafebe285d34c31de77a5e77dcf","sha256:b685124c0d27f45b1cb9ba2ad9a89bc5073747bfd7ae50ae83639e50fc4e8f22"],"state_sha256":"b0696503b69b6665f7f2c04a75ff9d4067248b2d9b939a2396f2a8519f076677"}