{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:UYCJQLSKMCW2DEV4ARU4R2MDLK","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":"8f453a59cf40c6c3760d70a9f54a5d4b20526fc854437b69bac01901a4493270","cross_cats_sorted":["cs.IT","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2012-11-05T20:42:03Z","title_canon_sha256":"a9785b84e540269105d42d860f9f954c9181bcccdfccd2f1c7c264eb1d1c8631"},"schema_version":"1.0","source":{"id":"1211.0995","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1211.0995","created_at":"2026-05-18T03:41:28Z"},{"alias_kind":"arxiv_version","alias_value":"1211.0995v1","created_at":"2026-05-18T03:41:28Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1211.0995","created_at":"2026-05-18T03:41:28Z"},{"alias_kind":"pith_short_12","alias_value":"UYCJQLSKMCW2","created_at":"2026-05-18T12:27:25Z"},{"alias_kind":"pith_short_16","alias_value":"UYCJQLSKMCW2DEV4","created_at":"2026-05-18T12:27:25Z"},{"alias_kind":"pith_short_8","alias_value":"UYCJQLSK","created_at":"2026-05-18T12:27:25Z"}],"graph_snapshots":[{"event_id":"sha256:4016c9266ad87c964988d08b28c7370fb1bbfb38745abb4dd97471a1f0fcc37a","target":"graph","created_at":"2026-05-18T03:41:28Z","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":"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}","authors_text":"Huy L. Nguyen, Jelani Nelson","cross_cats":["cs.IT","math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2012-11-05T20:42:03Z","title":"Sparsity Lower Bounds for Dimensionality Reducing Maps"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1211.0995","kind":"arxiv","version":1},"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:5ce59af8d484686ba42e15c55fa8eea4bafd460dd36c3e2c37e4abf67781e728","target":"record","created_at":"2026-05-18T03:41:28Z","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":"8f453a59cf40c6c3760d70a9f54a5d4b20526fc854437b69bac01901a4493270","cross_cats_sorted":["cs.IT","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2012-11-05T20:42:03Z","title_canon_sha256":"a9785b84e540269105d42d860f9f954c9181bcccdfccd2f1c7c264eb1d1c8631"},"schema_version":"1.0","source":{"id":"1211.0995","kind":"arxiv","version":1}},"canonical_sha256":"a604982e4a60ada192bc0469c8e9835a9bf2515fc947f0b08e6e9168e49aeb52","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"a604982e4a60ada192bc0469c8e9835a9bf2515fc947f0b08e6e9168e49aeb52","first_computed_at":"2026-05-18T03:41:28.788342Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:41:28.788342Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"rN578qya7OmMmMgXpt4FcgZzQGGMbChFgNSEdMrf1FCrK6qdV7ZrdT/E3Zpt0UaZoTwlF84EeAwjc7Pd0kyQBQ==","signature_status":"signed_v1","signed_at":"2026-05-18T03:41:28.789049Z","signed_message":"canonical_sha256_bytes"},"source_id":"1211.0995","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:5ce59af8d484686ba42e15c55fa8eea4bafd460dd36c3e2c37e4abf67781e728","sha256:4016c9266ad87c964988d08b28c7370fb1bbfb38745abb4dd97471a1f0fcc37a"],"state_sha256":"92137d96daa9bdbfc3025f373ef3cc04ba57ec2062b7a09311d33868cce6ffc0"}