{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:N2FJBJLHUIRHS724NTYPA43JWB","short_pith_number":"pith:N2FJBJLH","schema_version":"1.0","canonical_sha256":"6e8a90a567a222797f5c6cf0f07369b06f2ff403f743cf0bde71259c045845de","source":{"kind":"arxiv","id":"1609.00048","version":2},"attestation_state":"computed","paper":{"title":"Practical sketching algorithms for low-rank matrix approximation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS","math.NA","stat.CO","stat.ML"],"primary_cat":"cs.NA","authors_text":"Alp Yurtsever, Joel A. Tropp, Madeleine Udell, Volkan Cevher","submitted_at":"2016-08-31T21:30:26Z","abstract_excerpt":"This paper describes a suite of algorithms for constructing low-rank approximations of an input matrix from a random linear image of the matrix, called a sketch. These methods can preserve structural properties of the input matrix, such as positive-semidefiniteness, and they can produce approximations with a user-specified rank. The algorithms are simple, accurate, numerically stable, and provably correct. Moreover, each method is accompanied by an informative error bound that allows users to select parameters a priori to achieve a given approximation quality. These claims are supported by num"},"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":"1609.00048","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NA","submitted_at":"2016-08-31T21:30:26Z","cross_cats_sorted":["cs.DS","math.NA","stat.CO","stat.ML"],"title_canon_sha256":"766b7bd8a767b5de173df9a708ab2ded9d94d05dfecf456919727aa0d211e5ff","abstract_canon_sha256":"faf52145eb1170de2e1e1b46cfbf9ae293c26caa736c33d3501dffc0aa12995c"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:26:57.799214Z","signature_b64":"XxaNnQMraSKMWoJzrk49TFRDxFFa6GvIUebRFuyodxwCrQuQienz+ABCcQVpgbPic3S4ngwvHiqB5VrznMXPAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6e8a90a567a222797f5c6cf0f07369b06f2ff403f743cf0bde71259c045845de","last_reissued_at":"2026-05-18T00:26:57.798638Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:26:57.798638Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Practical sketching algorithms for low-rank matrix approximation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS","math.NA","stat.CO","stat.ML"],"primary_cat":"cs.NA","authors_text":"Alp Yurtsever, Joel A. Tropp, Madeleine Udell, Volkan Cevher","submitted_at":"2016-08-31T21:30:26Z","abstract_excerpt":"This paper describes a suite of algorithms for constructing low-rank approximations of an input matrix from a random linear image of the matrix, called a sketch. These methods can preserve structural properties of the input matrix, such as positive-semidefiniteness, and they can produce approximations with a user-specified rank. The algorithms are simple, accurate, numerically stable, and provably correct. Moreover, each method is accompanied by an informative error bound that allows users to select parameters a priori to achieve a given approximation quality. These claims are supported by num"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1609.00048","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":"1609.00048","created_at":"2026-05-18T00:26:57.798742+00:00"},{"alias_kind":"arxiv_version","alias_value":"1609.00048v2","created_at":"2026-05-18T00:26:57.798742+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1609.00048","created_at":"2026-05-18T00:26:57.798742+00:00"},{"alias_kind":"pith_short_12","alias_value":"N2FJBJLHUIRH","created_at":"2026-05-18T12:30:32.724797+00:00"},{"alias_kind":"pith_short_16","alias_value":"N2FJBJLHUIRHS724","created_at":"2026-05-18T12:30:32.724797+00:00"},{"alias_kind":"pith_short_8","alias_value":"N2FJBJLH","created_at":"2026-05-18T12:30:32.724797+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":2,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2605.19096","citing_title":"Sharp analysis of sketched least squares and randomized low-rank approximation","ref_index":2,"is_internal_anchor":true},{"citing_arxiv_id":"2605.00500","citing_title":"Scaling Federated Linear Contextual Bandits via Sketching","ref_index":18,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/N2FJBJLHUIRHS724NTYPA43JWB","json":"https://pith.science/pith/N2FJBJLHUIRHS724NTYPA43JWB.json","graph_json":"https://pith.science/api/pith-number/N2FJBJLHUIRHS724NTYPA43JWB/graph.json","events_json":"https://pith.science/api/pith-number/N2FJBJLHUIRHS724NTYPA43JWB/events.json","paper":"https://pith.science/paper/N2FJBJLH"},"agent_actions":{"view_html":"https://pith.science/pith/N2FJBJLHUIRHS724NTYPA43JWB","download_json":"https://pith.science/pith/N2FJBJLHUIRHS724NTYPA43JWB.json","view_paper":"https://pith.science/paper/N2FJBJLH","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1609.00048&json=true","fetch_graph":"https://pith.science/api/pith-number/N2FJBJLHUIRHS724NTYPA43JWB/graph.json","fetch_events":"https://pith.science/api/pith-number/N2FJBJLHUIRHS724NTYPA43JWB/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/N2FJBJLHUIRHS724NTYPA43JWB/action/timestamp_anchor","attest_storage":"https://pith.science/pith/N2FJBJLHUIRHS724NTYPA43JWB/action/storage_attestation","attest_author":"https://pith.science/pith/N2FJBJLHUIRHS724NTYPA43JWB/action/author_attestation","sign_citation":"https://pith.science/pith/N2FJBJLHUIRHS724NTYPA43JWB/action/citation_signature","submit_replication":"https://pith.science/pith/N2FJBJLHUIRHS724NTYPA43JWB/action/replication_record"}},"created_at":"2026-05-18T00:26:57.798742+00:00","updated_at":"2026-05-18T00:26:57.798742+00:00"}