{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:52UQLGODNMZBEZ5J4YLYMMAHU2","short_pith_number":"pith:52UQLGOD","schema_version":"1.0","canonical_sha256":"eea90599c36b321267a9e617863007a6a7806479bb0d0f19c8281bafc129f1a9","source":{"kind":"arxiv","id":"1410.2470","version":6},"attestation_state":"computed","paper":{"title":"Randomness Efficient Fast-Johnson-Lindenstrauss Transform with Applications in Differential Privacy and Compressed Sensing","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CR"],"primary_cat":"cs.DS","authors_text":"Jalaj Upadhyay","submitted_at":"2014-10-09T14:04:26Z","abstract_excerpt":"The Johnson-Lindenstrauss property ({\\sf JLP}) of random matrices has immense application in computer science ranging from compressed sensing, learning theory, numerical linear algebra, to privacy. This paper explores the properties and applications of a distribution of random matrices. Our distribution satisfies {\\sf JLP} with desirable properties like fast matrix-vector multiplication, sparsity, and optimal subspace embedding. We can sample a random matrix from this distribution using exactly $2n+n \\log n$ random bits. We show that a random matrix picked from this distribution preserves diff"},"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":"1410.2470","kind":"arxiv","version":6},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-10-09T14:04:26Z","cross_cats_sorted":["cs.CR"],"title_canon_sha256":"abfe1f688739c2c84580f213e8ee60487c29d795bf5f363d27bc5fad765da7d8","abstract_canon_sha256":"363994ed9d9da015a0db74809c19c2071f01ccf845b1418a618c15aab47a68fe"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:36:48.266395Z","signature_b64":"t0TSaN4rqM8hGZXGsn739CmUvvM7ml5pk7JjvIWIyj9W/mC7toBUGE2KG5gfhSeK0kz+w+jNlVckMlSbeaeWDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"eea90599c36b321267a9e617863007a6a7806479bb0d0f19c8281bafc129f1a9","last_reissued_at":"2026-05-18T01:36:48.265744Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:36:48.265744Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Randomness Efficient Fast-Johnson-Lindenstrauss Transform with Applications in Differential Privacy and Compressed Sensing","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CR"],"primary_cat":"cs.DS","authors_text":"Jalaj Upadhyay","submitted_at":"2014-10-09T14:04:26Z","abstract_excerpt":"The Johnson-Lindenstrauss property ({\\sf JLP}) of random matrices has immense application in computer science ranging from compressed sensing, learning theory, numerical linear algebra, to privacy. This paper explores the properties and applications of a distribution of random matrices. Our distribution satisfies {\\sf JLP} with desirable properties like fast matrix-vector multiplication, sparsity, and optimal subspace embedding. We can sample a random matrix from this distribution using exactly $2n+n \\log n$ random bits. We show that a random matrix picked from this distribution preserves diff"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1410.2470","kind":"arxiv","version":6},"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":"1410.2470","created_at":"2026-05-18T01:36:48.265843+00:00"},{"alias_kind":"arxiv_version","alias_value":"1410.2470v6","created_at":"2026-05-18T01:36:48.265843+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1410.2470","created_at":"2026-05-18T01:36:48.265843+00:00"},{"alias_kind":"pith_short_12","alias_value":"52UQLGODNMZB","created_at":"2026-05-18T12:28:14.216126+00:00"},{"alias_kind":"pith_short_16","alias_value":"52UQLGODNMZBEZ5J","created_at":"2026-05-18T12:28:14.216126+00:00"},{"alias_kind":"pith_short_8","alias_value":"52UQLGOD","created_at":"2026-05-18T12:28:14.216126+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2309.01243","citing_title":"The Normal Distributions Indistinguishability Spectrum and its Application to Privacy-Preserving Machine Learning","ref_index":40,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/52UQLGODNMZBEZ5J4YLYMMAHU2","json":"https://pith.science/pith/52UQLGODNMZBEZ5J4YLYMMAHU2.json","graph_json":"https://pith.science/api/pith-number/52UQLGODNMZBEZ5J4YLYMMAHU2/graph.json","events_json":"https://pith.science/api/pith-number/52UQLGODNMZBEZ5J4YLYMMAHU2/events.json","paper":"https://pith.science/paper/52UQLGOD"},"agent_actions":{"view_html":"https://pith.science/pith/52UQLGODNMZBEZ5J4YLYMMAHU2","download_json":"https://pith.science/pith/52UQLGODNMZBEZ5J4YLYMMAHU2.json","view_paper":"https://pith.science/paper/52UQLGOD","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1410.2470&json=true","fetch_graph":"https://pith.science/api/pith-number/52UQLGODNMZBEZ5J4YLYMMAHU2/graph.json","fetch_events":"https://pith.science/api/pith-number/52UQLGODNMZBEZ5J4YLYMMAHU2/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/52UQLGODNMZBEZ5J4YLYMMAHU2/action/timestamp_anchor","attest_storage":"https://pith.science/pith/52UQLGODNMZBEZ5J4YLYMMAHU2/action/storage_attestation","attest_author":"https://pith.science/pith/52UQLGODNMZBEZ5J4YLYMMAHU2/action/author_attestation","sign_citation":"https://pith.science/pith/52UQLGODNMZBEZ5J4YLYMMAHU2/action/citation_signature","submit_replication":"https://pith.science/pith/52UQLGODNMZBEZ5J4YLYMMAHU2/action/replication_record"}},"created_at":"2026-05-18T01:36:48.265843+00:00","updated_at":"2026-05-18T01:36:48.265843+00:00"}