{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:3PSODZCOCNPRPDPKXV2KLARWYH","short_pith_number":"pith:3PSODZCO","schema_version":"1.0","canonical_sha256":"dbe4e1e44e135f178deabd74a58236c1e5cdbb27dedd1b0029fdb4d13055f1e4","source":{"kind":"arxiv","id":"1610.06656","version":2},"attestation_state":"computed","paper":{"title":"Single Pass PCA of Matrix Products","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS","cs.IT","cs.LG","math.IT"],"primary_cat":"stat.ML","authors_text":"Alexandros G. Dimakis, Shanshan Wu, Srinadh Bhojanapalli, Sujay Sanghavi","submitted_at":"2016-10-21T02:45:46Z","abstract_excerpt":"In this paper we present a new algorithm for computing a low rank approximation of the product $A^TB$ by taking only a single pass of the two matrices $A$ and $B$. The straightforward way to do this is to (a) first sketch $A$ and $B$ individually, and then (b) find the top components using PCA on the sketch. Our algorithm in contrast retains additional summary information about $A,B$ (e.g. row and column norms etc.) and uses this additional information to obtain an improved approximation from the sketches. Our main analytical result establishes a comparable spectral norm guarantee to existing "},"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":"1610.06656","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2016-10-21T02:45:46Z","cross_cats_sorted":["cs.DS","cs.IT","cs.LG","math.IT"],"title_canon_sha256":"a306e381c9bfd2c74eb5ffa1419ad094fe314edd1b4811f0e9ffe98b33579b33","abstract_canon_sha256":"228944bc4451a7691d1dce114cd955eab6315a91eafc08a3ea84531d5a42e471"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:01:15.288240Z","signature_b64":"LhGkWrgMX5Y0HGG5o+++iDNp1BZiwXs4dcbevbYMNH5CNLCJCewxjkYF13dZApLy1IuIpkIqm0fU9vVbEv/MDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"dbe4e1e44e135f178deabd74a58236c1e5cdbb27dedd1b0029fdb4d13055f1e4","last_reissued_at":"2026-05-18T01:01:15.287605Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:01:15.287605Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Single Pass PCA of Matrix Products","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS","cs.IT","cs.LG","math.IT"],"primary_cat":"stat.ML","authors_text":"Alexandros G. Dimakis, Shanshan Wu, Srinadh Bhojanapalli, Sujay Sanghavi","submitted_at":"2016-10-21T02:45:46Z","abstract_excerpt":"In this paper we present a new algorithm for computing a low rank approximation of the product $A^TB$ by taking only a single pass of the two matrices $A$ and $B$. The straightforward way to do this is to (a) first sketch $A$ and $B$ individually, and then (b) find the top components using PCA on the sketch. Our algorithm in contrast retains additional summary information about $A,B$ (e.g. row and column norms etc.) and uses this additional information to obtain an improved approximation from the sketches. Our main analytical result establishes a comparable spectral norm guarantee to existing "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1610.06656","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":"1610.06656","created_at":"2026-05-18T01:01:15.287714+00:00"},{"alias_kind":"arxiv_version","alias_value":"1610.06656v2","created_at":"2026-05-18T01:01:15.287714+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1610.06656","created_at":"2026-05-18T01:01:15.287714+00:00"},{"alias_kind":"pith_short_12","alias_value":"3PSODZCOCNPR","created_at":"2026-05-18T12:29:55.572404+00:00"},{"alias_kind":"pith_short_16","alias_value":"3PSODZCOCNPRPDPK","created_at":"2026-05-18T12:29:55.572404+00:00"},{"alias_kind":"pith_short_8","alias_value":"3PSODZCO","created_at":"2026-05-18T12:29:55.572404+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/3PSODZCOCNPRPDPKXV2KLARWYH","json":"https://pith.science/pith/3PSODZCOCNPRPDPKXV2KLARWYH.json","graph_json":"https://pith.science/api/pith-number/3PSODZCOCNPRPDPKXV2KLARWYH/graph.json","events_json":"https://pith.science/api/pith-number/3PSODZCOCNPRPDPKXV2KLARWYH/events.json","paper":"https://pith.science/paper/3PSODZCO"},"agent_actions":{"view_html":"https://pith.science/pith/3PSODZCOCNPRPDPKXV2KLARWYH","download_json":"https://pith.science/pith/3PSODZCOCNPRPDPKXV2KLARWYH.json","view_paper":"https://pith.science/paper/3PSODZCO","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1610.06656&json=true","fetch_graph":"https://pith.science/api/pith-number/3PSODZCOCNPRPDPKXV2KLARWYH/graph.json","fetch_events":"https://pith.science/api/pith-number/3PSODZCOCNPRPDPKXV2KLARWYH/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/3PSODZCOCNPRPDPKXV2KLARWYH/action/timestamp_anchor","attest_storage":"https://pith.science/pith/3PSODZCOCNPRPDPKXV2KLARWYH/action/storage_attestation","attest_author":"https://pith.science/pith/3PSODZCOCNPRPDPKXV2KLARWYH/action/author_attestation","sign_citation":"https://pith.science/pith/3PSODZCOCNPRPDPKXV2KLARWYH/action/citation_signature","submit_replication":"https://pith.science/pith/3PSODZCOCNPRPDPKXV2KLARWYH/action/replication_record"}},"created_at":"2026-05-18T01:01:15.287714+00:00","updated_at":"2026-05-18T01:01:15.287714+00:00"}