{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2007:HMMQDERDWZ2VEA2HPR55OH3UFY","short_pith_number":"pith:HMMQDERD","schema_version":"1.0","canonical_sha256":"3b19019223b6755203477c7bd71f742e35d9443fa69382694623b5ab4654b38d","source":{"kind":"arxiv","id":"0710.1435","version":4},"attestation_state":"computed","paper":{"title":"Faster Least Squares Approximation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Michael W. Mahoney, Petros Drineas, S. Muthukrishnan, Tamas Sarlos","submitted_at":"2007-10-07T17:37:37Z","abstract_excerpt":"Least squares approximation is a technique to find an approximate solution to a system of linear equations that has no exact solution. In a typical setting, one lets $n$ be the number of constraints and $d$ be the number of variables, with $n \\gg d$. Then, existing exact methods find a solution vector in $O(nd^2)$ time. We present two randomized algorithms that provide very accurate relative-error approximations to the optimal value and the solution vector of a least squares approximation problem more rapidly than existing exact algorithms. Both of our algorithms preprocess the data with the R"},"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":"0710.1435","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2007-10-07T17:37:37Z","cross_cats_sorted":[],"title_canon_sha256":"411a15729d5d73eb804705d00de1d44b5dc2d8092989af04a49de5ed10aadb79","abstract_canon_sha256":"434850cefdfd7233c065534a5c7c435bdbb7db9b8ada9f9b197e461e681c03d1"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:40:20.871690Z","signature_b64":"0kx+B4xGYl9A9Ocd4H0k/TXm/ArF9B4KIlxn90ebrH0Gq0fSewiBeFA9d+H2NgakpGWysBFG0CCgQ/VXuSgEAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3b19019223b6755203477c7bd71f742e35d9443fa69382694623b5ab4654b38d","last_reissued_at":"2026-05-18T04:40:20.871184Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:40:20.871184Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Faster Least Squares Approximation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Michael W. Mahoney, Petros Drineas, S. Muthukrishnan, Tamas Sarlos","submitted_at":"2007-10-07T17:37:37Z","abstract_excerpt":"Least squares approximation is a technique to find an approximate solution to a system of linear equations that has no exact solution. In a typical setting, one lets $n$ be the number of constraints and $d$ be the number of variables, with $n \\gg d$. Then, existing exact methods find a solution vector in $O(nd^2)$ time. We present two randomized algorithms that provide very accurate relative-error approximations to the optimal value and the solution vector of a least squares approximation problem more rapidly than existing exact algorithms. Both of our algorithms preprocess the data with the R"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"0710.1435","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":"0710.1435","created_at":"2026-05-18T04:40:20.871262+00:00"},{"alias_kind":"arxiv_version","alias_value":"0710.1435v4","created_at":"2026-05-18T04:40:20.871262+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0710.1435","created_at":"2026-05-18T04:40:20.871262+00:00"},{"alias_kind":"pith_short_12","alias_value":"HMMQDERDWZ2V","created_at":"2026-05-18T12:25:55.427421+00:00"},{"alias_kind":"pith_short_16","alias_value":"HMMQDERDWZ2VEA2H","created_at":"2026-05-18T12:25:55.427421+00:00"},{"alias_kind":"pith_short_8","alias_value":"HMMQDERD","created_at":"2026-05-18T12:25:55.427421+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/HMMQDERDWZ2VEA2HPR55OH3UFY","json":"https://pith.science/pith/HMMQDERDWZ2VEA2HPR55OH3UFY.json","graph_json":"https://pith.science/api/pith-number/HMMQDERDWZ2VEA2HPR55OH3UFY/graph.json","events_json":"https://pith.science/api/pith-number/HMMQDERDWZ2VEA2HPR55OH3UFY/events.json","paper":"https://pith.science/paper/HMMQDERD"},"agent_actions":{"view_html":"https://pith.science/pith/HMMQDERDWZ2VEA2HPR55OH3UFY","download_json":"https://pith.science/pith/HMMQDERDWZ2VEA2HPR55OH3UFY.json","view_paper":"https://pith.science/paper/HMMQDERD","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=0710.1435&json=true","fetch_graph":"https://pith.science/api/pith-number/HMMQDERDWZ2VEA2HPR55OH3UFY/graph.json","fetch_events":"https://pith.science/api/pith-number/HMMQDERDWZ2VEA2HPR55OH3UFY/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/HMMQDERDWZ2VEA2HPR55OH3UFY/action/timestamp_anchor","attest_storage":"https://pith.science/pith/HMMQDERDWZ2VEA2HPR55OH3UFY/action/storage_attestation","attest_author":"https://pith.science/pith/HMMQDERDWZ2VEA2HPR55OH3UFY/action/author_attestation","sign_citation":"https://pith.science/pith/HMMQDERDWZ2VEA2HPR55OH3UFY/action/citation_signature","submit_replication":"https://pith.science/pith/HMMQDERDWZ2VEA2HPR55OH3UFY/action/replication_record"}},"created_at":"2026-05-18T04:40:20.871262+00:00","updated_at":"2026-05-18T04:40:20.871262+00:00"}