{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:DLRWE23HYJQM5VMNY2E3HQGZFQ","short_pith_number":"pith:DLRWE23H","canonical_record":{"source":{"id":"1609.02094","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-09-07T18:00:16Z","cross_cats_sorted":["cs.CG","cs.DS","math.FA","math.IT"],"title_canon_sha256":"bdb31cf9d886dad826602e587198220217b4a92f9e5eb7a24522527b939c8e3d","abstract_canon_sha256":"917bffdaa8f00da426d5ddeb2716c6fed9cfabc19496bf1bd26760756840e443"},"schema_version":"1.0"},"canonical_sha256":"1ae3626b67c260ced58dc689b3c0d92c0f42854b3734df6621f6a16440150629","source":{"kind":"arxiv","id":"1609.02094","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1609.02094","created_at":"2026-05-18T00:31:00Z"},{"alias_kind":"arxiv_version","alias_value":"1609.02094v2","created_at":"2026-05-18T00:31:00Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1609.02094","created_at":"2026-05-18T00:31:00Z"},{"alias_kind":"pith_short_12","alias_value":"DLRWE23HYJQM","created_at":"2026-05-18T12:30:12Z"},{"alias_kind":"pith_short_16","alias_value":"DLRWE23HYJQM5VMN","created_at":"2026-05-18T12:30:12Z"},{"alias_kind":"pith_short_8","alias_value":"DLRWE23H","created_at":"2026-05-18T12:30:12Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:DLRWE23HYJQM5VMNY2E3HQGZFQ","target":"record","payload":{"canonical_record":{"source":{"id":"1609.02094","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-09-07T18:00:16Z","cross_cats_sorted":["cs.CG","cs.DS","math.FA","math.IT"],"title_canon_sha256":"bdb31cf9d886dad826602e587198220217b4a92f9e5eb7a24522527b939c8e3d","abstract_canon_sha256":"917bffdaa8f00da426d5ddeb2716c6fed9cfabc19496bf1bd26760756840e443"},"schema_version":"1.0"},"canonical_sha256":"1ae3626b67c260ced58dc689b3c0d92c0f42854b3734df6621f6a16440150629","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:31:00.402448Z","signature_b64":"N1Vh8p110ic2k/z1fauh+w5OrkiaB/kYfgQ43kCHCEpIyLkdDwOFJPxsd5bEmDFuWL+7U/0A/8l2DbXjTTwvAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1ae3626b67c260ced58dc689b3c0d92c0f42854b3734df6621f6a16440150629","last_reissued_at":"2026-05-18T00:31:00.401889Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:31:00.401889Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1609.02094","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-18T00:31:00Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"t6zg0QhenGc9Fddwe9UnYot1yUPlGHaGRHeiZQoR6YpoEFggGDD7tOhqIrN45lDS2BKhaL8i95BxnlrqrugfCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-04T13:02:54.415748Z"},"content_sha256":"b38606a497c4f9617b048dd1ffa7d377a7b6e66983a9210368a8186767e56c13","schema_version":"1.0","event_id":"sha256:b38606a497c4f9617b048dd1ffa7d377a7b6e66983a9210368a8186767e56c13"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:DLRWE23HYJQM5VMNY2E3HQGZFQ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Optimality of the Johnson-Lindenstrauss Lemma","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CG","cs.DS","math.FA","math.IT"],"primary_cat":"cs.IT","authors_text":"Jelani Nelson, Kasper Green Larsen","submitted_at":"2016-09-07T18:00:16Z","abstract_excerpt":"For any integers $d, n \\geq 2$ and $1/({\\min\\{n,d\\}})^{0.4999} < \\varepsilon<1$, we show the existence of a set of $n$ vectors $X\\subset \\mathbb{R}^d$ such that any embedding $f:X\\rightarrow \\mathbb{R}^m$ satisfying $$ \\forall x,y\\in X,\\ (1-\\varepsilon)\\|x-y\\|_2^2\\le \\|f(x)-f(y)\\|_2^2 \\le (1+\\varepsilon)\\|x-y\\|_2^2 $$ must have $$ m = \\Omega(\\varepsilon^{-2} \\lg n). $$ This lower bound matches the upper bound given by the Johnson-Lindenstrauss lemma [JL84]. Furthermore, our lower bound holds for nearly the full range of $\\varepsilon$ of interest, since there is always an isometric embedding in"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1609.02094","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-18T00:31:00Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"HS3zU3MtUvpw8tSnnf/Dd98oSETzObeaFAQNdzTQpBoWIIQbtejMbG8+x6LOiB0QXoL5G20VEPnJylIBrH1XAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-04T13:02:54.416107Z"},"content_sha256":"1f2484298fd729f0b08f7e37d8ec5f260545ce0614e591bda90ba00fd0e4f7a4","schema_version":"1.0","event_id":"sha256:1f2484298fd729f0b08f7e37d8ec5f260545ce0614e591bda90ba00fd0e4f7a4"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/DLRWE23HYJQM5VMNY2E3HQGZFQ/bundle.json","state_url":"https://pith.science/pith/DLRWE23HYJQM5VMNY2E3HQGZFQ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/DLRWE23HYJQM5VMNY2E3HQGZFQ/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-04T13:02:54Z","links":{"resolver":"https://pith.science/pith/DLRWE23HYJQM5VMNY2E3HQGZFQ","bundle":"https://pith.science/pith/DLRWE23HYJQM5VMNY2E3HQGZFQ/bundle.json","state":"https://pith.science/pith/DLRWE23HYJQM5VMNY2E3HQGZFQ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/DLRWE23HYJQM5VMNY2E3HQGZFQ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:DLRWE23HYJQM5VMNY2E3HQGZFQ","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":"917bffdaa8f00da426d5ddeb2716c6fed9cfabc19496bf1bd26760756840e443","cross_cats_sorted":["cs.CG","cs.DS","math.FA","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-09-07T18:00:16Z","title_canon_sha256":"bdb31cf9d886dad826602e587198220217b4a92f9e5eb7a24522527b939c8e3d"},"schema_version":"1.0","source":{"id":"1609.02094","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1609.02094","created_at":"2026-05-18T00:31:00Z"},{"alias_kind":"arxiv_version","alias_value":"1609.02094v2","created_at":"2026-05-18T00:31:00Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1609.02094","created_at":"2026-05-18T00:31:00Z"},{"alias_kind":"pith_short_12","alias_value":"DLRWE23HYJQM","created_at":"2026-05-18T12:30:12Z"},{"alias_kind":"pith_short_16","alias_value":"DLRWE23HYJQM5VMN","created_at":"2026-05-18T12:30:12Z"},{"alias_kind":"pith_short_8","alias_value":"DLRWE23H","created_at":"2026-05-18T12:30:12Z"}],"graph_snapshots":[{"event_id":"sha256:1f2484298fd729f0b08f7e37d8ec5f260545ce0614e591bda90ba00fd0e4f7a4","target":"graph","created_at":"2026-05-18T00:31:00Z","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":"For any integers $d, n \\geq 2$ and $1/({\\min\\{n,d\\}})^{0.4999} < \\varepsilon<1$, we show the existence of a set of $n$ vectors $X\\subset \\mathbb{R}^d$ such that any embedding $f:X\\rightarrow \\mathbb{R}^m$ satisfying $$ \\forall x,y\\in X,\\ (1-\\varepsilon)\\|x-y\\|_2^2\\le \\|f(x)-f(y)\\|_2^2 \\le (1+\\varepsilon)\\|x-y\\|_2^2 $$ must have $$ m = \\Omega(\\varepsilon^{-2} \\lg n). $$ This lower bound matches the upper bound given by the Johnson-Lindenstrauss lemma [JL84]. Furthermore, our lower bound holds for nearly the full range of $\\varepsilon$ of interest, since there is always an isometric embedding in","authors_text":"Jelani Nelson, Kasper Green Larsen","cross_cats":["cs.CG","cs.DS","math.FA","math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-09-07T18:00:16Z","title":"Optimality of the Johnson-Lindenstrauss Lemma"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1609.02094","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:b38606a497c4f9617b048dd1ffa7d377a7b6e66983a9210368a8186767e56c13","target":"record","created_at":"2026-05-18T00:31:00Z","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":"917bffdaa8f00da426d5ddeb2716c6fed9cfabc19496bf1bd26760756840e443","cross_cats_sorted":["cs.CG","cs.DS","math.FA","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-09-07T18:00:16Z","title_canon_sha256":"bdb31cf9d886dad826602e587198220217b4a92f9e5eb7a24522527b939c8e3d"},"schema_version":"1.0","source":{"id":"1609.02094","kind":"arxiv","version":2}},"canonical_sha256":"1ae3626b67c260ced58dc689b3c0d92c0f42854b3734df6621f6a16440150629","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"1ae3626b67c260ced58dc689b3c0d92c0f42854b3734df6621f6a16440150629","first_computed_at":"2026-05-18T00:31:00.401889Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:31:00.401889Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"N1Vh8p110ic2k/z1fauh+w5OrkiaB/kYfgQ43kCHCEpIyLkdDwOFJPxsd5bEmDFuWL+7U/0A/8l2DbXjTTwvAA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:31:00.402448Z","signed_message":"canonical_sha256_bytes"},"source_id":"1609.02094","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:b38606a497c4f9617b048dd1ffa7d377a7b6e66983a9210368a8186767e56c13","sha256:1f2484298fd729f0b08f7e37d8ec5f260545ce0614e591bda90ba00fd0e4f7a4"],"state_sha256":"c0c64fad103717f6a51e9a56fb0c561f7cbaacc311362d6e5ff157effbc2886d"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"bXbRc1+Vp5zvnTzThtmeLQR9xErOBxTun/6ezVUYHA/05nx+lp8KGmTfQQa/5yUpRXAfBN74NCUvZxGVRkkMAg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-04T13:02:54.418092Z","bundle_sha256":"19cdaac8947d87ec2cd026a79327a9b18c5c521d89387f63afa453f394cd8f61"}}