{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:TN5J3LTZZF2LOIIXA34SK77XBF","short_pith_number":"pith:TN5J3LTZ","schema_version":"1.0","canonical_sha256":"9b7a9dae79c974b7211706f9257ff709580d81ea00a401190f5401a9d928bbe5","source":{"kind":"arxiv","id":"1403.7737","version":2},"attestation_state":"computed","paper":{"title":"Sharpened Error Bounds for Random Sampling Based $\\ell_2$ Regression","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.NA","stat.ML"],"primary_cat":"cs.LG","authors_text":"Shusen Wang","submitted_at":"2014-03-30T11:21:39Z","abstract_excerpt":"Given a data matrix $X \\in R^{n\\times d}$ and a response vector $y \\in R^{n}$, suppose $n>d$, it costs $O(n d^2)$ time and $O(n d)$ space to solve the least squares regression (LSR) problem. When $n$ and $d$ are both large, exactly solving the LSR problem is very expensive. When $n \\gg d$, one feasible approach to speeding up LSR is to randomly embed $y$ and all columns of $X$ into a smaller subspace $R^c$; the induced LSR problem has the same number of columns but much fewer number of rows, and it can be solved in $O(c d^2)$ time and $O(c d)$ space.\n  We discuss in this paper two random sampl"},"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":"1403.7737","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2014-03-30T11:21:39Z","cross_cats_sorted":["cs.NA","stat.ML"],"title_canon_sha256":"7785913f9906138341496cbfc094cc2430aeffe3998a05f44ecc5c6e2541697a","abstract_canon_sha256":"2c92132586580851b5cb0e3d1648fa5891e70aa4392880abb977875c4b47a3d3"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:54:46.385937Z","signature_b64":"hoY7WEmvVErA1mVop8Y4EPuNPSXts2jSIOunDqhF49TzLwBDtyomVXF1fOtBXw7xnmYD9b750PXAxwOGBXtyAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9b7a9dae79c974b7211706f9257ff709580d81ea00a401190f5401a9d928bbe5","last_reissued_at":"2026-05-18T02:54:46.385427Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:54:46.385427Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Sharpened Error Bounds for Random Sampling Based $\\ell_2$ Regression","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.NA","stat.ML"],"primary_cat":"cs.LG","authors_text":"Shusen Wang","submitted_at":"2014-03-30T11:21:39Z","abstract_excerpt":"Given a data matrix $X \\in R^{n\\times d}$ and a response vector $y \\in R^{n}$, suppose $n>d$, it costs $O(n d^2)$ time and $O(n d)$ space to solve the least squares regression (LSR) problem. When $n$ and $d$ are both large, exactly solving the LSR problem is very expensive. When $n \\gg d$, one feasible approach to speeding up LSR is to randomly embed $y$ and all columns of $X$ into a smaller subspace $R^c$; the induced LSR problem has the same number of columns but much fewer number of rows, and it can be solved in $O(c d^2)$ time and $O(c d)$ space.\n  We discuss in this paper two random sampl"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1403.7737","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":""},"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":"1403.7737","created_at":"2026-05-18T02:54:46.385501+00:00"},{"alias_kind":"arxiv_version","alias_value":"1403.7737v2","created_at":"2026-05-18T02:54:46.385501+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1403.7737","created_at":"2026-05-18T02:54:46.385501+00:00"},{"alias_kind":"pith_short_12","alias_value":"TN5J3LTZZF2L","created_at":"2026-05-18T12:28:49.207871+00:00"},{"alias_kind":"pith_short_16","alias_value":"TN5J3LTZZF2LOIIX","created_at":"2026-05-18T12:28:49.207871+00:00"},{"alias_kind":"pith_short_8","alias_value":"TN5J3LTZ","created_at":"2026-05-18T12:28:49.207871+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/TN5J3LTZZF2LOIIXA34SK77XBF","json":"https://pith.science/pith/TN5J3LTZZF2LOIIXA34SK77XBF.json","graph_json":"https://pith.science/api/pith-number/TN5J3LTZZF2LOIIXA34SK77XBF/graph.json","events_json":"https://pith.science/api/pith-number/TN5J3LTZZF2LOIIXA34SK77XBF/events.json","paper":"https://pith.science/paper/TN5J3LTZ"},"agent_actions":{"view_html":"https://pith.science/pith/TN5J3LTZZF2LOIIXA34SK77XBF","download_json":"https://pith.science/pith/TN5J3LTZZF2LOIIXA34SK77XBF.json","view_paper":"https://pith.science/paper/TN5J3LTZ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1403.7737&json=true","fetch_graph":"https://pith.science/api/pith-number/TN5J3LTZZF2LOIIXA34SK77XBF/graph.json","fetch_events":"https://pith.science/api/pith-number/TN5J3LTZZF2LOIIXA34SK77XBF/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/TN5J3LTZZF2LOIIXA34SK77XBF/action/timestamp_anchor","attest_storage":"https://pith.science/pith/TN5J3LTZZF2LOIIXA34SK77XBF/action/storage_attestation","attest_author":"https://pith.science/pith/TN5J3LTZZF2LOIIXA34SK77XBF/action/author_attestation","sign_citation":"https://pith.science/pith/TN5J3LTZZF2LOIIXA34SK77XBF/action/citation_signature","submit_replication":"https://pith.science/pith/TN5J3LTZZF2LOIIXA34SK77XBF/action/replication_record"}},"created_at":"2026-05-18T02:54:46.385501+00:00","updated_at":"2026-05-18T02:54:46.385501+00:00"}