{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2012:UYCJQLSKMCW2DEV4ARU4R2MDLK","short_pith_number":"pith:UYCJQLSK","schema_version":"1.0","canonical_sha256":"a604982e4a60ada192bc0469c8e9835a9bf2515fc947f0b08e6e9168e49aeb52","source":{"kind":"arxiv","id":"1211.0995","version":1},"attestation_state":"computed","paper":{"title":"Sparsity Lower Bounds for Dimensionality Reducing Maps","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IT","math.IT"],"primary_cat":"cs.DS","authors_text":"Huy L. Nguyen, Jelani Nelson","submitted_at":"2012-11-05T20:42:03Z","abstract_excerpt":"We give near-tight lower bounds for the sparsity required in several dimensionality reducing linear maps. First, consider the JL lemma which states that for any set of n vectors in R there is a matrix A in R^{m x d} with m = O(eps^{-2}log n) such that mapping by A preserves pairwise Euclidean distances of these n vectors up to a 1 +/- eps factor. We show that there exists a set of n vectors such that any such matrix A with at most s non-zero entries per column must have s = Omega(eps^{-1}log n/log(1/eps)) as long as m < O(n/log(1/eps)). This bound improves the lower bound of Omega(min{eps^{-2}"},"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":"1211.0995","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2012-11-05T20:42:03Z","cross_cats_sorted":["cs.IT","math.IT"],"title_canon_sha256":"a9785b84e540269105d42d860f9f954c9181bcccdfccd2f1c7c264eb1d1c8631","abstract_canon_sha256":"8f453a59cf40c6c3760d70a9f54a5d4b20526fc854437b69bac01901a4493270"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:41:28.789049Z","signature_b64":"rN578qya7OmMmMgXpt4FcgZzQGGMbChFgNSEdMrf1FCrK6qdV7ZrdT/E3Zpt0UaZoTwlF84EeAwjc7Pd0kyQBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a604982e4a60ada192bc0469c8e9835a9bf2515fc947f0b08e6e9168e49aeb52","last_reissued_at":"2026-05-18T03:41:28.788342Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:41:28.788342Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Sparsity Lower Bounds for Dimensionality Reducing Maps","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IT","math.IT"],"primary_cat":"cs.DS","authors_text":"Huy L. Nguyen, Jelani Nelson","submitted_at":"2012-11-05T20:42:03Z","abstract_excerpt":"We give near-tight lower bounds for the sparsity required in several dimensionality reducing linear maps. First, consider the JL lemma which states that for any set of n vectors in R there is a matrix A in R^{m x d} with m = O(eps^{-2}log n) such that mapping by A preserves pairwise Euclidean distances of these n vectors up to a 1 +/- eps factor. We show that there exists a set of n vectors such that any such matrix A with at most s non-zero entries per column must have s = Omega(eps^{-1}log n/log(1/eps)) as long as m < O(n/log(1/eps)). This bound improves the lower bound of Omega(min{eps^{-2}"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1211.0995","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":"1211.0995","created_at":"2026-05-18T03:41:28.788452+00:00"},{"alias_kind":"arxiv_version","alias_value":"1211.0995v1","created_at":"2026-05-18T03:41:28.788452+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1211.0995","created_at":"2026-05-18T03:41:28.788452+00:00"},{"alias_kind":"pith_short_12","alias_value":"UYCJQLSKMCW2","created_at":"2026-05-18T12:27:25.539911+00:00"},{"alias_kind":"pith_short_16","alias_value":"UYCJQLSKMCW2DEV4","created_at":"2026-05-18T12:27:25.539911+00:00"},{"alias_kind":"pith_short_8","alias_value":"UYCJQLSK","created_at":"2026-05-18T12:27:25.539911+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/UYCJQLSKMCW2DEV4ARU4R2MDLK","json":"https://pith.science/pith/UYCJQLSKMCW2DEV4ARU4R2MDLK.json","graph_json":"https://pith.science/api/pith-number/UYCJQLSKMCW2DEV4ARU4R2MDLK/graph.json","events_json":"https://pith.science/api/pith-number/UYCJQLSKMCW2DEV4ARU4R2MDLK/events.json","paper":"https://pith.science/paper/UYCJQLSK"},"agent_actions":{"view_html":"https://pith.science/pith/UYCJQLSKMCW2DEV4ARU4R2MDLK","download_json":"https://pith.science/pith/UYCJQLSKMCW2DEV4ARU4R2MDLK.json","view_paper":"https://pith.science/paper/UYCJQLSK","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1211.0995&json=true","fetch_graph":"https://pith.science/api/pith-number/UYCJQLSKMCW2DEV4ARU4R2MDLK/graph.json","fetch_events":"https://pith.science/api/pith-number/UYCJQLSKMCW2DEV4ARU4R2MDLK/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/UYCJQLSKMCW2DEV4ARU4R2MDLK/action/timestamp_anchor","attest_storage":"https://pith.science/pith/UYCJQLSKMCW2DEV4ARU4R2MDLK/action/storage_attestation","attest_author":"https://pith.science/pith/UYCJQLSKMCW2DEV4ARU4R2MDLK/action/author_attestation","sign_citation":"https://pith.science/pith/UYCJQLSKMCW2DEV4ARU4R2MDLK/action/citation_signature","submit_replication":"https://pith.science/pith/UYCJQLSKMCW2DEV4ARU4R2MDLK/action/replication_record"}},"created_at":"2026-05-18T03:41:28.788452+00:00","updated_at":"2026-05-18T03:41:28.788452+00:00"}