{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:7O7ETJEMKOPQX5ZV4A7O2DJLKQ","short_pith_number":"pith:7O7ETJEM","schema_version":"1.0","canonical_sha256":"fbbe49a48c539f0bf735e03eed0d2b54324c19091f1698616856f0d0267e8818","source":{"kind":"arxiv","id":"2411.08773","version":2},"attestation_state":"computed","paper":{"title":"Optimal Oblivious Subspace Embeddings with Near-optimal Sparsity","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.LG","cs.NA","math.NA","math.PR","stat.ML"],"primary_cat":"cs.DS","authors_text":"Micha{\\l} Derezi\\'nski, Shabarish Chenakkod, Xiaoyu Dong","submitted_at":"2024-11-13T16:58:51Z","abstract_excerpt":"An oblivious subspace embedding is a random $m\\times n$ matrix $\\Pi$ such that, for any $d$-dimensional subspace, with high probability $\\Pi$ preserves the norms of all vectors in that subspace within a $1\\pm\\epsilon$ factor. In this work, we give an oblivious subspace embedding with the optimal dimension $m=\\Theta(d/\\epsilon^2)$ that has a near-optimal sparsity of $\\tilde O(1/\\epsilon)$ non-zero entries per column of $\\Pi$. This is the first result to nearly match the conjecture of Nelson and Nguyen [FOCS 2013] in terms of the best sparsity attainable by an optimal oblivious subspace embeddin"},"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":"2411.08773","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2024-11-13T16:58:51Z","cross_cats_sorted":["cs.LG","cs.NA","math.NA","math.PR","stat.ML"],"title_canon_sha256":"ed2d6f43978b5007029656f2d13ca7f4a5f4c5d815375a21dd33c9658c3bbce8","abstract_canon_sha256":"6da6af88cf1bbdf750b6a49b9daa8381f7c8b681a14fcdbf798e1f459848517b"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T10:55:25.938219Z","signature_b64":"VPZEPRa0vJCUI6kY5bGW5O9uE0o+M12lvBA9GrwtXJq2tQstcVcsqIxG3ERj2zE+BKUkPE28mdfIgcKRSgibBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"fbbe49a48c539f0bf735e03eed0d2b54324c19091f1698616856f0d0267e8818","last_reissued_at":"2026-07-05T10:55:25.937726Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T10:55:25.937726Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Optimal Oblivious Subspace Embeddings with Near-optimal Sparsity","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.LG","cs.NA","math.NA","math.PR","stat.ML"],"primary_cat":"cs.DS","authors_text":"Micha{\\l} Derezi\\'nski, Shabarish Chenakkod, Xiaoyu Dong","submitted_at":"2024-11-13T16:58:51Z","abstract_excerpt":"An oblivious subspace embedding is a random $m\\times n$ matrix $\\Pi$ such that, for any $d$-dimensional subspace, with high probability $\\Pi$ preserves the norms of all vectors in that subspace within a $1\\pm\\epsilon$ factor. In this work, we give an oblivious subspace embedding with the optimal dimension $m=\\Theta(d/\\epsilon^2)$ that has a near-optimal sparsity of $\\tilde O(1/\\epsilon)$ non-zero entries per column of $\\Pi$. This is the first result to nearly match the conjecture of Nelson and Nguyen [FOCS 2013] in terms of the best sparsity attainable by an optimal oblivious subspace embeddin"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2411.08773","kind":"arxiv","version":2},"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/2411.08773/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":"2411.08773","created_at":"2026-07-05T10:55:25.937786+00:00"},{"alias_kind":"arxiv_version","alias_value":"2411.08773v2","created_at":"2026-07-05T10:55:25.937786+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2411.08773","created_at":"2026-07-05T10:55:25.937786+00:00"},{"alias_kind":"pith_short_12","alias_value":"7O7ETJEMKOPQ","created_at":"2026-07-05T10:55:25.937786+00:00"},{"alias_kind":"pith_short_16","alias_value":"7O7ETJEMKOPQX5ZV","created_at":"2026-07-05T10:55:25.937786+00:00"},{"alias_kind":"pith_short_8","alias_value":"7O7ETJEM","created_at":"2026-07-05T10:55:25.937786+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2607.05384","citing_title":"Well-invertible column subsets of sparse matrices are rare","ref_index":7,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/7O7ETJEMKOPQX5ZV4A7O2DJLKQ","json":"https://pith.science/pith/7O7ETJEMKOPQX5ZV4A7O2DJLKQ.json","graph_json":"https://pith.science/api/pith-number/7O7ETJEMKOPQX5ZV4A7O2DJLKQ/graph.json","events_json":"https://pith.science/api/pith-number/7O7ETJEMKOPQX5ZV4A7O2DJLKQ/events.json","paper":"https://pith.science/paper/7O7ETJEM"},"agent_actions":{"view_html":"https://pith.science/pith/7O7ETJEMKOPQX5ZV4A7O2DJLKQ","download_json":"https://pith.science/pith/7O7ETJEMKOPQX5ZV4A7O2DJLKQ.json","view_paper":"https://pith.science/paper/7O7ETJEM","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2411.08773&json=true","fetch_graph":"https://pith.science/api/pith-number/7O7ETJEMKOPQX5ZV4A7O2DJLKQ/graph.json","fetch_events":"https://pith.science/api/pith-number/7O7ETJEMKOPQX5ZV4A7O2DJLKQ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/7O7ETJEMKOPQX5ZV4A7O2DJLKQ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/7O7ETJEMKOPQX5ZV4A7O2DJLKQ/action/storage_attestation","attest_author":"https://pith.science/pith/7O7ETJEMKOPQX5ZV4A7O2DJLKQ/action/author_attestation","sign_citation":"https://pith.science/pith/7O7ETJEMKOPQX5ZV4A7O2DJLKQ/action/citation_signature","submit_replication":"https://pith.science/pith/7O7ETJEMKOPQX5ZV4A7O2DJLKQ/action/replication_record"}},"created_at":"2026-07-05T10:55:25.937786+00:00","updated_at":"2026-07-05T10:55:25.937786+00:00"}