{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2012:3GGXUI3MEMUCUZS3FVSO7JF2VY","short_pith_number":"pith:3GGXUI3M","schema_version":"1.0","canonical_sha256":"d98d7a236c23282a665b2d64efa4baae2909b64b2b29426f2f96a9463380a082","source":{"kind":"arxiv","id":"1210.3135","version":3},"attestation_state":"computed","paper":{"title":"Low-distortion Subspace Embeddings in Input-sparsity Time and Applications to Robust Linear Regression","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Michael W. Mahoney, Xiangrui Meng","submitted_at":"2012-10-11T06:18:59Z","abstract_excerpt":"Low-distortion embeddings are critical building blocks for developing random sampling and random projection algorithms for linear algebra problems. We show that, given a matrix $A \\in \\R^{n \\times d}$ with $n \\gg d$ and a $p \\in [1, 2)$, with a constant probability, we can construct a low-distortion embedding matrix $\\Pi \\in \\R^{O(\\poly(d)) \\times n}$ that embeds $\\A_p$, the $\\ell_p$ subspace spanned by $A$'s columns, into $(\\R^{O(\\poly(d))}, \\| \\cdot \\|_p)$; the distortion of our embeddings is only $O(\\poly(d))$, and we can compute $\\Pi A$ in $O(\\nnz(A))$ time, i.e., input-sparsity time. Our "},"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":"1210.3135","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2012-10-11T06:18:59Z","cross_cats_sorted":[],"title_canon_sha256":"cf0f576769adcc6656e8bc2db425518e4fc632b24dfebcf3878f0aed31cc14c4","abstract_canon_sha256":"7fb20b3d704bc070d51310367ab0435c95059f8e816447c95fdd3d145560c9a6"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:30:14.809363Z","signature_b64":"98JTyaLDv3LIktgSNPR1AjrujaAF5/6xhmUhZHqi+MSVHUJiZIbRh733D88ihEVCD6kAF68CGjWXBzKu2C4VBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d98d7a236c23282a665b2d64efa4baae2909b64b2b29426f2f96a9463380a082","last_reissued_at":"2026-05-18T03:30:14.808543Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:30:14.808543Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Low-distortion Subspace Embeddings in Input-sparsity Time and Applications to Robust Linear Regression","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Michael W. Mahoney, Xiangrui Meng","submitted_at":"2012-10-11T06:18:59Z","abstract_excerpt":"Low-distortion embeddings are critical building blocks for developing random sampling and random projection algorithms for linear algebra problems. We show that, given a matrix $A \\in \\R^{n \\times d}$ with $n \\gg d$ and a $p \\in [1, 2)$, with a constant probability, we can construct a low-distortion embedding matrix $\\Pi \\in \\R^{O(\\poly(d)) \\times n}$ that embeds $\\A_p$, the $\\ell_p$ subspace spanned by $A$'s columns, into $(\\R^{O(\\poly(d))}, \\| \\cdot \\|_p)$; the distortion of our embeddings is only $O(\\poly(d))$, and we can compute $\\Pi A$ in $O(\\nnz(A))$ time, i.e., input-sparsity time. Our "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1210.3135","kind":"arxiv","version":3},"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":"1210.3135","created_at":"2026-05-18T03:30:14.808685+00:00"},{"alias_kind":"arxiv_version","alias_value":"1210.3135v3","created_at":"2026-05-18T03:30:14.808685+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1210.3135","created_at":"2026-05-18T03:30:14.808685+00:00"},{"alias_kind":"pith_short_12","alias_value":"3GGXUI3MEMUC","created_at":"2026-05-18T12:26:50.516681+00:00"},{"alias_kind":"pith_short_16","alias_value":"3GGXUI3MEMUCUZS3","created_at":"2026-05-18T12:26:50.516681+00:00"},{"alias_kind":"pith_short_8","alias_value":"3GGXUI3M","created_at":"2026-05-18T12:26:50.516681+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/3GGXUI3MEMUCUZS3FVSO7JF2VY","json":"https://pith.science/pith/3GGXUI3MEMUCUZS3FVSO7JF2VY.json","graph_json":"https://pith.science/api/pith-number/3GGXUI3MEMUCUZS3FVSO7JF2VY/graph.json","events_json":"https://pith.science/api/pith-number/3GGXUI3MEMUCUZS3FVSO7JF2VY/events.json","paper":"https://pith.science/paper/3GGXUI3M"},"agent_actions":{"view_html":"https://pith.science/pith/3GGXUI3MEMUCUZS3FVSO7JF2VY","download_json":"https://pith.science/pith/3GGXUI3MEMUCUZS3FVSO7JF2VY.json","view_paper":"https://pith.science/paper/3GGXUI3M","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1210.3135&json=true","fetch_graph":"https://pith.science/api/pith-number/3GGXUI3MEMUCUZS3FVSO7JF2VY/graph.json","fetch_events":"https://pith.science/api/pith-number/3GGXUI3MEMUCUZS3FVSO7JF2VY/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/3GGXUI3MEMUCUZS3FVSO7JF2VY/action/timestamp_anchor","attest_storage":"https://pith.science/pith/3GGXUI3MEMUCUZS3FVSO7JF2VY/action/storage_attestation","attest_author":"https://pith.science/pith/3GGXUI3MEMUCUZS3FVSO7JF2VY/action/author_attestation","sign_citation":"https://pith.science/pith/3GGXUI3MEMUCUZS3FVSO7JF2VY/action/citation_signature","submit_replication":"https://pith.science/pith/3GGXUI3MEMUCUZS3FVSO7JF2VY/action/replication_record"}},"created_at":"2026-05-18T03:30:14.808685+00:00","updated_at":"2026-05-18T03:30:14.808685+00:00"}