{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2010:XKIKAWZNRGUDS5U7MKIPK5T3PZ","short_pith_number":"pith:XKIKAWZN","schema_version":"1.0","canonical_sha256":"ba90a05b2d89a839769f6290f5767b7e7fcafbfe24a32192c67bf43dc43734e2","source":{"kind":"arxiv","id":"1011.2590","version":1},"attestation_state":"computed","paper":{"title":"Rademacher Chaos, Random Eulerian Graphs and The Sparse Johnson-Lindenstrauss Transform","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Rafail Ostrovsky, Vladimir Braverman, Yuval Rabani","submitted_at":"2010-11-11T08:13:15Z","abstract_excerpt":"The celebrated dimension reduction lemma of Johnson and Lindenstrauss has numerous computational and other applications. Due to its application in practice, speeding up the computation of a Johnson-Lindenstrauss style dimension reduction is an important question. Recently, Dasgupta, Kumar, and Sarlos (STOC 2010) constructed such a transform that uses a sparse matrix. This is motivated by the desire to speed up the computation when applied to sparse input vectors, a scenario that comes up in applications. The sparsity of their construction was further improved by Kane and Nelson (ArXiv 2010).\n "},"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":"1011.2590","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2010-11-11T08:13:15Z","cross_cats_sorted":[],"title_canon_sha256":"104533e778e19bc6cebc61472510bb3d3a9275c8e1b34fe1635f97e23515df8b","abstract_canon_sha256":"f47fafb2167438988d1af6123bac9717c80650e44e0af95010fbdfcce1ed8fc6"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:36:09.956386Z","signature_b64":"7UkgSCKmd/EryGHH8gSdnSbU7BnqTQceHksUKMYVGiQ3KdpjNIPkHTUU2z2PmpJveT4+He4Z5rJVINVT6icoDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ba90a05b2d89a839769f6290f5767b7e7fcafbfe24a32192c67bf43dc43734e2","last_reissued_at":"2026-05-18T04:36:09.955772Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:36:09.955772Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Rademacher Chaos, Random Eulerian Graphs and The Sparse Johnson-Lindenstrauss Transform","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Rafail Ostrovsky, Vladimir Braverman, Yuval Rabani","submitted_at":"2010-11-11T08:13:15Z","abstract_excerpt":"The celebrated dimension reduction lemma of Johnson and Lindenstrauss has numerous computational and other applications. Due to its application in practice, speeding up the computation of a Johnson-Lindenstrauss style dimension reduction is an important question. Recently, Dasgupta, Kumar, and Sarlos (STOC 2010) constructed such a transform that uses a sparse matrix. This is motivated by the desire to speed up the computation when applied to sparse input vectors, a scenario that comes up in applications. The sparsity of their construction was further improved by Kane and Nelson (ArXiv 2010).\n "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1011.2590","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1011.2590","created_at":"2026-05-18T04:36:09.955851+00:00"},{"alias_kind":"arxiv_version","alias_value":"1011.2590v1","created_at":"2026-05-18T04:36:09.955851+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1011.2590","created_at":"2026-05-18T04:36:09.955851+00:00"},{"alias_kind":"pith_short_12","alias_value":"XKIKAWZNRGUD","created_at":"2026-05-18T12:26:17.028572+00:00"},{"alias_kind":"pith_short_16","alias_value":"XKIKAWZNRGUDS5U7","created_at":"2026-05-18T12:26:17.028572+00:00"},{"alias_kind":"pith_short_8","alias_value":"XKIKAWZN","created_at":"2026-05-18T12:26:17.028572+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/XKIKAWZNRGUDS5U7MKIPK5T3PZ","json":"https://pith.science/pith/XKIKAWZNRGUDS5U7MKIPK5T3PZ.json","graph_json":"https://pith.science/api/pith-number/XKIKAWZNRGUDS5U7MKIPK5T3PZ/graph.json","events_json":"https://pith.science/api/pith-number/XKIKAWZNRGUDS5U7MKIPK5T3PZ/events.json","paper":"https://pith.science/paper/XKIKAWZN"},"agent_actions":{"view_html":"https://pith.science/pith/XKIKAWZNRGUDS5U7MKIPK5T3PZ","download_json":"https://pith.science/pith/XKIKAWZNRGUDS5U7MKIPK5T3PZ.json","view_paper":"https://pith.science/paper/XKIKAWZN","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1011.2590&json=true","fetch_graph":"https://pith.science/api/pith-number/XKIKAWZNRGUDS5U7MKIPK5T3PZ/graph.json","fetch_events":"https://pith.science/api/pith-number/XKIKAWZNRGUDS5U7MKIPK5T3PZ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/XKIKAWZNRGUDS5U7MKIPK5T3PZ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/XKIKAWZNRGUDS5U7MKIPK5T3PZ/action/storage_attestation","attest_author":"https://pith.science/pith/XKIKAWZNRGUDS5U7MKIPK5T3PZ/action/author_attestation","sign_citation":"https://pith.science/pith/XKIKAWZNRGUDS5U7MKIPK5T3PZ/action/citation_signature","submit_replication":"https://pith.science/pith/XKIKAWZNRGUDS5U7MKIPK5T3PZ/action/replication_record"}},"created_at":"2026-05-18T04:36:09.955851+00:00","updated_at":"2026-05-18T04:36:09.955851+00:00"}