{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:NZ6UCTBNAHEPRDEULVJFRE4BDT","short_pith_number":"pith:NZ6UCTBN","schema_version":"1.0","canonical_sha256":"6e7d414c2d01c8f88c945d525893811ccb935218b821420b32f34e4aec632e43","source":{"kind":"arxiv","id":"1911.02675","version":3},"attestation_state":"computed","paper":{"title":"Faster Least Squares Optimization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC","cs.NA","math.OC"],"primary_cat":"math.NA","authors_text":"Jonathan Lacotte, Mert Pilanci","submitted_at":"2019-11-06T23:29:54Z","abstract_excerpt":"We investigate iterative methods with randomized preconditioners for solving overdetermined least-squares problems, where the preconditioners are based on a random embedding of the data matrix. We consider two distinct approaches: the sketch is either computed once (fixed preconditioner), or, the random projection is refreshed at each iteration, i.e., sampled independently of previous ones (varying preconditioners). Although fixed sketching-based preconditioners have received considerable attention in the recent literature, little is known about the performance of refreshed sketches. For a fix"},"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":"1911.02675","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2019-11-06T23:29:54Z","cross_cats_sorted":["cs.CC","cs.NA","math.OC"],"title_canon_sha256":"dd7b5f81450d120b326bad2e6a9dc6f256c2d516fece424875cc740a78a9560c","abstract_canon_sha256":"58d8b5f1c02dc04f6de0629c953a2d8e9c1d8a7d57daca4d558fbcf1ecde7226"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T02:31:58.445350Z","signature_b64":"2hL2e0V/DbAEkcCpz1s/F+SohXBcJ+4nPV5FrP/DHCj2ps88vf4+EkR9TbaTNUFP1IBIXOcEZGfjSaZhCSnEAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6e7d414c2d01c8f88c945d525893811ccb935218b821420b32f34e4aec632e43","last_reissued_at":"2026-07-05T02:31:58.444930Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T02:31:58.444930Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Faster Least Squares Optimization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC","cs.NA","math.OC"],"primary_cat":"math.NA","authors_text":"Jonathan Lacotte, Mert Pilanci","submitted_at":"2019-11-06T23:29:54Z","abstract_excerpt":"We investigate iterative methods with randomized preconditioners for solving overdetermined least-squares problems, where the preconditioners are based on a random embedding of the data matrix. We consider two distinct approaches: the sketch is either computed once (fixed preconditioner), or, the random projection is refreshed at each iteration, i.e., sampled independently of previous ones (varying preconditioners). Although fixed sketching-based preconditioners have received considerable attention in the recent literature, little is known about the performance of refreshed sketches. For a fix"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1911.02675","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/1911.02675/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":"1911.02675","created_at":"2026-07-05T02:31:58.444994+00:00"},{"alias_kind":"arxiv_version","alias_value":"1911.02675v3","created_at":"2026-07-05T02:31:58.444994+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1911.02675","created_at":"2026-07-05T02:31:58.444994+00:00"},{"alias_kind":"pith_short_12","alias_value":"NZ6UCTBNAHEP","created_at":"2026-07-05T02:31:58.444994+00:00"},{"alias_kind":"pith_short_16","alias_value":"NZ6UCTBNAHEPRDEU","created_at":"2026-07-05T02:31:58.444994+00:00"},{"alias_kind":"pith_short_8","alias_value":"NZ6UCTBN","created_at":"2026-07-05T02:31:58.444994+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2509.06856","citing_title":"Sequential Least-Squares Estimators with Fast Randomized Sketching for Linear Statistical Models","ref_index":14,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/NZ6UCTBNAHEPRDEULVJFRE4BDT","json":"https://pith.science/pith/NZ6UCTBNAHEPRDEULVJFRE4BDT.json","graph_json":"https://pith.science/api/pith-number/NZ6UCTBNAHEPRDEULVJFRE4BDT/graph.json","events_json":"https://pith.science/api/pith-number/NZ6UCTBNAHEPRDEULVJFRE4BDT/events.json","paper":"https://pith.science/paper/NZ6UCTBN"},"agent_actions":{"view_html":"https://pith.science/pith/NZ6UCTBNAHEPRDEULVJFRE4BDT","download_json":"https://pith.science/pith/NZ6UCTBNAHEPRDEULVJFRE4BDT.json","view_paper":"https://pith.science/paper/NZ6UCTBN","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1911.02675&json=true","fetch_graph":"https://pith.science/api/pith-number/NZ6UCTBNAHEPRDEULVJFRE4BDT/graph.json","fetch_events":"https://pith.science/api/pith-number/NZ6UCTBNAHEPRDEULVJFRE4BDT/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/NZ6UCTBNAHEPRDEULVJFRE4BDT/action/timestamp_anchor","attest_storage":"https://pith.science/pith/NZ6UCTBNAHEPRDEULVJFRE4BDT/action/storage_attestation","attest_author":"https://pith.science/pith/NZ6UCTBNAHEPRDEULVJFRE4BDT/action/author_attestation","sign_citation":"https://pith.science/pith/NZ6UCTBNAHEPRDEULVJFRE4BDT/action/citation_signature","submit_replication":"https://pith.science/pith/NZ6UCTBNAHEPRDEULVJFRE4BDT/action/replication_record"}},"created_at":"2026-07-05T02:31:58.444994+00:00","updated_at":"2026-07-05T02:31:58.444994+00:00"}