{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2023:SCBXCW6Z2ZR2VCK2MMJHJBTFCZ","short_pith_number":"pith:SCBXCW6Z","schema_version":"1.0","canonical_sha256":"9083715bd9d663aa895a63127486651673f7daff0bdf3760974c6940d3239034","source":{"kind":"arxiv","id":"2302.06165","version":1},"attestation_state":"computed","paper":{"title":"Sparse Dimensionality Reduction Revisited","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"cs.DS","authors_text":"Chris Schwiegelshohn, Jelani Nelson, Kasper Green Larsen, Lion Kamma, Mikael M{\\o}ller H{\\o}gsgaard","submitted_at":"2023-02-13T08:01:25Z","abstract_excerpt":"The sparse Johnson-Lindenstrauss transform is one of the central techniques in dimensionality reduction. It supports embedding a set of $n$ points in $\\mathbb{R}^d$ into $m=O(\\varepsilon^{-2} \\lg n)$ dimensions while preserving all pairwise distances to within $1 \\pm \\varepsilon$. Each input point $x$ is embedded to $Ax$, where $A$ is an $m \\times d$ matrix having $s$ non-zeros per column, allowing for an embedding time of $O(s \\|x\\|_0)$.\n  Since the sparsity of $A$ governs the embedding time, much work has gone into improving the sparsity $s$. The current state-of-the-art by Kane and Nelson ("},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"2302.06165","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2023-02-13T08:01:25Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"3b6184b4da1518e6ebc3bdcf2c7ad6da40118bd75eed1b8fe9fb7461ca99daa3","abstract_canon_sha256":"b50207c91b9026515d0bde41e6c21e6730d85934424b1d3f187140af9f5aa3d6"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T05:41:02.659480Z","signature_b64":"2xsmcrtU3QvRkBsTwu3zIuPejCN8fBMCaPL9QiPzQPy7r7z7Mjjfp5CMDpJnVimxfqoGhWFSkst2bfRSbBKzCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9083715bd9d663aa895a63127486651673f7daff0bdf3760974c6940d3239034","last_reissued_at":"2026-07-05T05:41:02.659134Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T05:41:02.659134Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Sparse Dimensionality Reduction Revisited","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"cs.DS","authors_text":"Chris Schwiegelshohn, Jelani Nelson, Kasper Green Larsen, Lion Kamma, Mikael M{\\o}ller H{\\o}gsgaard","submitted_at":"2023-02-13T08:01:25Z","abstract_excerpt":"The sparse Johnson-Lindenstrauss transform is one of the central techniques in dimensionality reduction. It supports embedding a set of $n$ points in $\\mathbb{R}^d$ into $m=O(\\varepsilon^{-2} \\lg n)$ dimensions while preserving all pairwise distances to within $1 \\pm \\varepsilon$. Each input point $x$ is embedded to $Ax$, where $A$ is an $m \\times d$ matrix having $s$ non-zeros per column, allowing for an embedding time of $O(s \\|x\\|_0)$.\n  Since the sparsity of $A$ governs the embedding time, much work has gone into improving the sparsity $s$. The current state-of-the-art by Kane and Nelson ("},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2302.06165","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2302.06165/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"2302.06165","created_at":"2026-07-05T05:41:02.659189+00:00"},{"alias_kind":"arxiv_version","alias_value":"2302.06165v1","created_at":"2026-07-05T05:41:02.659189+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2302.06165","created_at":"2026-07-05T05:41:02.659189+00:00"},{"alias_kind":"pith_short_12","alias_value":"SCBXCW6Z2ZR2","created_at":"2026-07-05T05:41:02.659189+00:00"},{"alias_kind":"pith_short_16","alias_value":"SCBXCW6Z2ZR2VCK2","created_at":"2026-07-05T05:41:02.659189+00:00"},{"alias_kind":"pith_short_8","alias_value":"SCBXCW6Z","created_at":"2026-07-05T05:41:02.659189+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2412.00497","citing_title":"Distributed Differentially Private Data Analytics via Secure Sketching","ref_index":42,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/SCBXCW6Z2ZR2VCK2MMJHJBTFCZ","json":"https://pith.science/pith/SCBXCW6Z2ZR2VCK2MMJHJBTFCZ.json","graph_json":"https://pith.science/api/pith-number/SCBXCW6Z2ZR2VCK2MMJHJBTFCZ/graph.json","events_json":"https://pith.science/api/pith-number/SCBXCW6Z2ZR2VCK2MMJHJBTFCZ/events.json","paper":"https://pith.science/paper/SCBXCW6Z"},"agent_actions":{"view_html":"https://pith.science/pith/SCBXCW6Z2ZR2VCK2MMJHJBTFCZ","download_json":"https://pith.science/pith/SCBXCW6Z2ZR2VCK2MMJHJBTFCZ.json","view_paper":"https://pith.science/paper/SCBXCW6Z","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2302.06165&json=true","fetch_graph":"https://pith.science/api/pith-number/SCBXCW6Z2ZR2VCK2MMJHJBTFCZ/graph.json","fetch_events":"https://pith.science/api/pith-number/SCBXCW6Z2ZR2VCK2MMJHJBTFCZ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/SCBXCW6Z2ZR2VCK2MMJHJBTFCZ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/SCBXCW6Z2ZR2VCK2MMJHJBTFCZ/action/storage_attestation","attest_author":"https://pith.science/pith/SCBXCW6Z2ZR2VCK2MMJHJBTFCZ/action/author_attestation","sign_citation":"https://pith.science/pith/SCBXCW6Z2ZR2VCK2MMJHJBTFCZ/action/citation_signature","submit_replication":"https://pith.science/pith/SCBXCW6Z2ZR2VCK2MMJHJBTFCZ/action/replication_record"}},"created_at":"2026-07-05T05:41:02.659189+00:00","updated_at":"2026-07-05T05:41:02.659189+00:00"}