{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2012:U7X33EJNIJSVCEFRYXHKBHPMPJ","short_pith_number":"pith:U7X33EJN","schema_version":"1.0","canonical_sha256":"a7efbd912d42655110b1c5cea09dec7a7986c120c0a1f8bc70f236cb11e11868","source":{"kind":"arxiv","id":"1207.6365","version":4},"attestation_state":"computed","paper":{"title":"Low Rank Approximation and Regression in Input Sparsity Time","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"David P. Woodruff, Kenneth L. Clarkson","submitted_at":"2012-07-26T18:50:00Z","abstract_excerpt":"We design a new distribution over $\\poly(r \\eps^{-1}) \\times n$ matrices $S$ so that for any fixed $n \\times d$ matrix $A$ of rank $r$, with probability at least 9/10, $\\norm{SAx}_2 = (1 \\pm \\eps)\\norm{Ax}_2$ simultaneously for all $x \\in \\mathbb{R}^d$. Such a matrix $S$ is called a \\emph{subspace embedding}. Furthermore, $SA$ can be computed in $\\nnz(A) + \\poly(d \\eps^{-1})$ time, where $\\nnz(A)$ is the number of non-zero entries of $A$. This improves over all previous subspace embeddings, which required at least $\\Omega(nd \\log d)$ time to achieve this property. We call our matrices $S$ \\emp"},"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":"1207.6365","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2012-07-26T18:50:00Z","cross_cats_sorted":[],"title_canon_sha256":"c0d51014f56cee95ab3533dcd93b5ea2534acb9a705c073060fd9556e30791bd","abstract_canon_sha256":"c04fb7adc57349898edf0bf31bfb526add179eb880176a455b7ef2fa57ec27e6"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:28:56.286235Z","signature_b64":"zMys5Dl7WSIcPQVaMjrMgzrdy6gwNsTXDL9auF3aN5Ya+RqMiiaSDTyYKLGuFpWsDZNHTpayuPPe1xpRmzChBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a7efbd912d42655110b1c5cea09dec7a7986c120c0a1f8bc70f236cb11e11868","last_reissued_at":"2026-05-18T03:28:56.285489Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:28:56.285489Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Low Rank Approximation and Regression in Input Sparsity Time","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"David P. Woodruff, Kenneth L. Clarkson","submitted_at":"2012-07-26T18:50:00Z","abstract_excerpt":"We design a new distribution over $\\poly(r \\eps^{-1}) \\times n$ matrices $S$ so that for any fixed $n \\times d$ matrix $A$ of rank $r$, with probability at least 9/10, $\\norm{SAx}_2 = (1 \\pm \\eps)\\norm{Ax}_2$ simultaneously for all $x \\in \\mathbb{R}^d$. Such a matrix $S$ is called a \\emph{subspace embedding}. Furthermore, $SA$ can be computed in $\\nnz(A) + \\poly(d \\eps^{-1})$ time, where $\\nnz(A)$ is the number of non-zero entries of $A$. This improves over all previous subspace embeddings, which required at least $\\Omega(nd \\log d)$ time to achieve this property. We call our matrices $S$ \\emp"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1207.6365","kind":"arxiv","version":4},"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":"1207.6365","created_at":"2026-05-18T03:28:56.285602+00:00"},{"alias_kind":"arxiv_version","alias_value":"1207.6365v4","created_at":"2026-05-18T03:28:56.285602+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1207.6365","created_at":"2026-05-18T03:28:56.285602+00:00"},{"alias_kind":"pith_short_12","alias_value":"U7X33EJNIJSV","created_at":"2026-05-18T12:27:23.164592+00:00"},{"alias_kind":"pith_short_16","alias_value":"U7X33EJNIJSVCEFR","created_at":"2026-05-18T12:27:23.164592+00:00"},{"alias_kind":"pith_short_8","alias_value":"U7X33EJN","created_at":"2026-05-18T12:27:23.164592+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/U7X33EJNIJSVCEFRYXHKBHPMPJ","json":"https://pith.science/pith/U7X33EJNIJSVCEFRYXHKBHPMPJ.json","graph_json":"https://pith.science/api/pith-number/U7X33EJNIJSVCEFRYXHKBHPMPJ/graph.json","events_json":"https://pith.science/api/pith-number/U7X33EJNIJSVCEFRYXHKBHPMPJ/events.json","paper":"https://pith.science/paper/U7X33EJN"},"agent_actions":{"view_html":"https://pith.science/pith/U7X33EJNIJSVCEFRYXHKBHPMPJ","download_json":"https://pith.science/pith/U7X33EJNIJSVCEFRYXHKBHPMPJ.json","view_paper":"https://pith.science/paper/U7X33EJN","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1207.6365&json=true","fetch_graph":"https://pith.science/api/pith-number/U7X33EJNIJSVCEFRYXHKBHPMPJ/graph.json","fetch_events":"https://pith.science/api/pith-number/U7X33EJNIJSVCEFRYXHKBHPMPJ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/U7X33EJNIJSVCEFRYXHKBHPMPJ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/U7X33EJNIJSVCEFRYXHKBHPMPJ/action/storage_attestation","attest_author":"https://pith.science/pith/U7X33EJNIJSVCEFRYXHKBHPMPJ/action/author_attestation","sign_citation":"https://pith.science/pith/U7X33EJNIJSVCEFRYXHKBHPMPJ/action/citation_signature","submit_replication":"https://pith.science/pith/U7X33EJNIJSVCEFRYXHKBHPMPJ/action/replication_record"}},"created_at":"2026-05-18T03:28:56.285602+00:00","updated_at":"2026-05-18T03:28:56.285602+00:00"}