{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:Y6UHV3HCCPNDOBGK2UF64ILXVS","short_pith_number":"pith:Y6UHV3HC","canonical_record":{"source":{"id":"1706.10110","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.FA","submitted_at":"2017-06-30T10:46:28Z","cross_cats_sorted":["cs.CC","cs.DS"],"title_canon_sha256":"9672a12b70765359931a3e866d1d3f9e1e46223a71f43b12bb2bde690d9f3187","abstract_canon_sha256":"2f0c25eeb52fc8fdb987c4ec9a4260c44ad56d615eda4c1d9b580455a110b856"},"schema_version":"1.0"},"canonical_sha256":"c7a87aece213da3704cad50bee2177acb21ecb19efc27e8ecd885ecc7af823e3","source":{"kind":"arxiv","id":"1706.10110","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1706.10110","created_at":"2026-05-18T00:31:02Z"},{"alias_kind":"arxiv_version","alias_value":"1706.10110v2","created_at":"2026-05-18T00:31:02Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1706.10110","created_at":"2026-05-18T00:31:02Z"},{"alias_kind":"pith_short_12","alias_value":"Y6UHV3HCCPND","created_at":"2026-05-18T12:31:56Z"},{"alias_kind":"pith_short_16","alias_value":"Y6UHV3HCCPNDOBGK","created_at":"2026-05-18T12:31:56Z"},{"alias_kind":"pith_short_8","alias_value":"Y6UHV3HC","created_at":"2026-05-18T12:31:56Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:Y6UHV3HCCPNDOBGK2UF64ILXVS","target":"record","payload":{"canonical_record":{"source":{"id":"1706.10110","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.FA","submitted_at":"2017-06-30T10:46:28Z","cross_cats_sorted":["cs.CC","cs.DS"],"title_canon_sha256":"9672a12b70765359931a3e866d1d3f9e1e46223a71f43b12bb2bde690d9f3187","abstract_canon_sha256":"2f0c25eeb52fc8fdb987c4ec9a4260c44ad56d615eda4c1d9b580455a110b856"},"schema_version":"1.0"},"canonical_sha256":"c7a87aece213da3704cad50bee2177acb21ecb19efc27e8ecd885ecc7af823e3","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:31:02.707386Z","signature_b64":"crepKYQIv6rNgnVW5IMICUv6ywI7YvY4dFfFUO6ChrEA/hK907rjSjZ0/UTj02H7cIG6xFJ5y1GXnIn3byBXAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c7a87aece213da3704cad50bee2177acb21ecb19efc27e8ecd885ecc7af823e3","last_reissued_at":"2026-05-18T00:31:02.706741Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:31:02.706741Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1706.10110","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:02Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"EV1p+ORDH61LDSlWzoDwCntIIEjn08evHNGhwCemhskOVExQcB0Yytwd6c54H4m7uwY+TyMo77GkiYYugMRuDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-11T12:38:20.325644Z"},"content_sha256":"8bef43953827769943bdeb38a9ce08d86c8991068a64e9dc94aed1c669742626","schema_version":"1.0","event_id":"sha256:8bef43953827769943bdeb38a9ce08d86c8991068a64e9dc94aed1c669742626"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:Y6UHV3HCCPNDOBGK2UF64ILXVS","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"On Using Toeplitz and Circulant Matrices for Johnson-Lindenstrauss Transforms","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC","cs.DS"],"primary_cat":"math.FA","authors_text":"Casper Benjamin Freksen, Kasper Green Larsen","submitted_at":"2017-06-30T10:46:28Z","abstract_excerpt":"The Johnson-Lindenstrauss lemma is one of the corner stone results in dimensionality reduction. It says that given $N$, for any set of $N$ vectors $X \\subset \\mathbb{R}^n$, there exists a mapping $f : X \\to \\mathbb{R}^m$ such that $f(X)$ preserves all pairwise distances between vectors in $X$ to within $(1 \\pm \\varepsilon)$ if $m = O(\\varepsilon^{-2} \\lg N)$. Much effort has gone into developing fast embedding algorithms, with the Fast Johnson-Lindenstrauss transform of Ailon and Chazelle being one of the most well-known techniques. The current fastest algorithm that yields the optimal $m = O("},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1706.10110","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:02Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"QyvFAjr2WJQG7kdQgo2mXukRmji0laUrzniHZ2xo0Pn57DP+t1AuBAd8RYYU/fHzH6iFtNRrklqLG1VvVtaGBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-11T12:38:20.326007Z"},"content_sha256":"36c54592b313fb5570b8a0fdaacb4f7ffe05870e02afd65bd68785ac9ee483f4","schema_version":"1.0","event_id":"sha256:36c54592b313fb5570b8a0fdaacb4f7ffe05870e02afd65bd68785ac9ee483f4"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/Y6UHV3HCCPNDOBGK2UF64ILXVS/bundle.json","state_url":"https://pith.science/pith/Y6UHV3HCCPNDOBGK2UF64ILXVS/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/Y6UHV3HCCPNDOBGK2UF64ILXVS/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-11T12:38:20Z","links":{"resolver":"https://pith.science/pith/Y6UHV3HCCPNDOBGK2UF64ILXVS","bundle":"https://pith.science/pith/Y6UHV3HCCPNDOBGK2UF64ILXVS/bundle.json","state":"https://pith.science/pith/Y6UHV3HCCPNDOBGK2UF64ILXVS/state.json","well_known_bundle":"https://pith.science/.well-known/pith/Y6UHV3HCCPNDOBGK2UF64ILXVS/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:Y6UHV3HCCPNDOBGK2UF64ILXVS","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":"2f0c25eeb52fc8fdb987c4ec9a4260c44ad56d615eda4c1d9b580455a110b856","cross_cats_sorted":["cs.CC","cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.FA","submitted_at":"2017-06-30T10:46:28Z","title_canon_sha256":"9672a12b70765359931a3e866d1d3f9e1e46223a71f43b12bb2bde690d9f3187"},"schema_version":"1.0","source":{"id":"1706.10110","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1706.10110","created_at":"2026-05-18T00:31:02Z"},{"alias_kind":"arxiv_version","alias_value":"1706.10110v2","created_at":"2026-05-18T00:31:02Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1706.10110","created_at":"2026-05-18T00:31:02Z"},{"alias_kind":"pith_short_12","alias_value":"Y6UHV3HCCPND","created_at":"2026-05-18T12:31:56Z"},{"alias_kind":"pith_short_16","alias_value":"Y6UHV3HCCPNDOBGK","created_at":"2026-05-18T12:31:56Z"},{"alias_kind":"pith_short_8","alias_value":"Y6UHV3HC","created_at":"2026-05-18T12:31:56Z"}],"graph_snapshots":[{"event_id":"sha256:36c54592b313fb5570b8a0fdaacb4f7ffe05870e02afd65bd68785ac9ee483f4","target":"graph","created_at":"2026-05-18T00:31:02Z","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":"The Johnson-Lindenstrauss lemma is one of the corner stone results in dimensionality reduction. It says that given $N$, for any set of $N$ vectors $X \\subset \\mathbb{R}^n$, there exists a mapping $f : X \\to \\mathbb{R}^m$ such that $f(X)$ preserves all pairwise distances between vectors in $X$ to within $(1 \\pm \\varepsilon)$ if $m = O(\\varepsilon^{-2} \\lg N)$. Much effort has gone into developing fast embedding algorithms, with the Fast Johnson-Lindenstrauss transform of Ailon and Chazelle being one of the most well-known techniques. The current fastest algorithm that yields the optimal $m = O(","authors_text":"Casper Benjamin Freksen, Kasper Green Larsen","cross_cats":["cs.CC","cs.DS"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.FA","submitted_at":"2017-06-30T10:46:28Z","title":"On Using Toeplitz and Circulant Matrices for Johnson-Lindenstrauss Transforms"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1706.10110","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:8bef43953827769943bdeb38a9ce08d86c8991068a64e9dc94aed1c669742626","target":"record","created_at":"2026-05-18T00:31:02Z","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":"2f0c25eeb52fc8fdb987c4ec9a4260c44ad56d615eda4c1d9b580455a110b856","cross_cats_sorted":["cs.CC","cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.FA","submitted_at":"2017-06-30T10:46:28Z","title_canon_sha256":"9672a12b70765359931a3e866d1d3f9e1e46223a71f43b12bb2bde690d9f3187"},"schema_version":"1.0","source":{"id":"1706.10110","kind":"arxiv","version":2}},"canonical_sha256":"c7a87aece213da3704cad50bee2177acb21ecb19efc27e8ecd885ecc7af823e3","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"c7a87aece213da3704cad50bee2177acb21ecb19efc27e8ecd885ecc7af823e3","first_computed_at":"2026-05-18T00:31:02.706741Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:31:02.706741Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"crepKYQIv6rNgnVW5IMICUv6ywI7YvY4dFfFUO6ChrEA/hK907rjSjZ0/UTj02H7cIG6xFJ5y1GXnIn3byBXAQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:31:02.707386Z","signed_message":"canonical_sha256_bytes"},"source_id":"1706.10110","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:8bef43953827769943bdeb38a9ce08d86c8991068a64e9dc94aed1c669742626","sha256:36c54592b313fb5570b8a0fdaacb4f7ffe05870e02afd65bd68785ac9ee483f4"],"state_sha256":"1087711aeb91cb7f773846b93f2b9ede36107d1604bfa8f0871ebd72be302a1f"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"DA7Avtb9eeKoEDNFRbMddhCNNsDUF4WvC8NeBXYY6JL78jWl8h+D210AD67cs2gKyWtKIjExyTFvToUxeJA8AA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-11T12:38:20.328097Z","bundle_sha256":"40551c698bada32b1f0de305b4a63876eb6df86d7b56e6727d72e53b1b9754b5"}}