{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:3PSODZCOCNPRPDPKXV2KLARWYH","short_pith_number":"pith:3PSODZCO","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"},"canonical_sha256":"dbe4e1e44e135f178deabd74a58236c1e5cdbb27dedd1b0029fdb4d13055f1e4","source":{"kind":"arxiv","id":"1610.06656","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1610.06656","created_at":"2026-05-18T01:01:15Z"},{"alias_kind":"arxiv_version","alias_value":"1610.06656v2","created_at":"2026-05-18T01:01:15Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1610.06656","created_at":"2026-05-18T01:01:15Z"},{"alias_kind":"pith_short_12","alias_value":"3PSODZCOCNPR","created_at":"2026-05-18T12:29:55Z"},{"alias_kind":"pith_short_16","alias_value":"3PSODZCOCNPRPDPK","created_at":"2026-05-18T12:29:55Z"},{"alias_kind":"pith_short_8","alias_value":"3PSODZCO","created_at":"2026-05-18T12:29:55Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:3PSODZCOCNPRPDPKXV2KLARWYH","target":"record","payload":{"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"},"canonical_sha256":"dbe4e1e44e135f178deabd74a58236c1e5cdbb27dedd1b0029fdb4d13055f1e4","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"},"source_kind":"arxiv","source_id":"1610.06656","source_version":2,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T01:01:15Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"YLMDXlrK4Y+amPF9CiX66rVllhS667qJn+EA1YKZ+hRUNmI5DlmoGPUenGTwYbzTtZVyRpjGqw4cBhk02e0xCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T06:54:07.048777Z"},"content_sha256":"0a7e4bda4a8f63016663596e23e695925044050eb23348ce6cdb7624729fbdca","schema_version":"1.0","event_id":"sha256:0a7e4bda4a8f63016663596e23e695925044050eb23348ce6cdb7624729fbdca"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:3PSODZCOCNPRPDPKXV2KLARWYH","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T01:01:15Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"PgPfUKdHlQ4sH5pfeUwl43nP2l5bT4X2M9NJ/P/Lri+rrFxXEl4eeqK1K5zCzQvZYGk7sB6EAQ+wUVd0VobMDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T06:54:07.049494Z"},"content_sha256":"35522565a61fadf33f139b17738ae17ed493bd4b7aa236102f21cb45b53d1f1d","schema_version":"1.0","event_id":"sha256:35522565a61fadf33f139b17738ae17ed493bd4b7aa236102f21cb45b53d1f1d"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/3PSODZCOCNPRPDPKXV2KLARWYH/bundle.json","state_url":"https://pith.science/pith/3PSODZCOCNPRPDPKXV2KLARWYH/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/3PSODZCOCNPRPDPKXV2KLARWYH/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-06-05T06:54:07Z","links":{"resolver":"https://pith.science/pith/3PSODZCOCNPRPDPKXV2KLARWYH","bundle":"https://pith.science/pith/3PSODZCOCNPRPDPKXV2KLARWYH/bundle.json","state":"https://pith.science/pith/3PSODZCOCNPRPDPKXV2KLARWYH/state.json","well_known_bundle":"https://pith.science/.well-known/pith/3PSODZCOCNPRPDPKXV2KLARWYH/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:3PSODZCOCNPRPDPKXV2KLARWYH","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"228944bc4451a7691d1dce114cd955eab6315a91eafc08a3ea84531d5a42e471","cross_cats_sorted":["cs.DS","cs.IT","cs.LG","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2016-10-21T02:45:46Z","title_canon_sha256":"a306e381c9bfd2c74eb5ffa1419ad094fe314edd1b4811f0e9ffe98b33579b33"},"schema_version":"1.0","source":{"id":"1610.06656","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1610.06656","created_at":"2026-05-18T01:01:15Z"},{"alias_kind":"arxiv_version","alias_value":"1610.06656v2","created_at":"2026-05-18T01:01:15Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1610.06656","created_at":"2026-05-18T01:01:15Z"},{"alias_kind":"pith_short_12","alias_value":"3PSODZCOCNPR","created_at":"2026-05-18T12:29:55Z"},{"alias_kind":"pith_short_16","alias_value":"3PSODZCOCNPRPDPK","created_at":"2026-05-18T12:29:55Z"},{"alias_kind":"pith_short_8","alias_value":"3PSODZCO","created_at":"2026-05-18T12:29:55Z"}],"graph_snapshots":[{"event_id":"sha256:35522565a61fadf33f139b17738ae17ed493bd4b7aa236102f21cb45b53d1f1d","target":"graph","created_at":"2026-05-18T01:01:15Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"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 ","authors_text":"Alexandros G. Dimakis, Shanshan Wu, Srinadh Bhojanapalli, Sujay Sanghavi","cross_cats":["cs.DS","cs.IT","cs.LG","math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2016-10-21T02:45:46Z","title":"Single Pass PCA of Matrix Products"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1610.06656","kind":"arxiv","version":2},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:0a7e4bda4a8f63016663596e23e695925044050eb23348ce6cdb7624729fbdca","target":"record","created_at":"2026-05-18T01:01:15Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"228944bc4451a7691d1dce114cd955eab6315a91eafc08a3ea84531d5a42e471","cross_cats_sorted":["cs.DS","cs.IT","cs.LG","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2016-10-21T02:45:46Z","title_canon_sha256":"a306e381c9bfd2c74eb5ffa1419ad094fe314edd1b4811f0e9ffe98b33579b33"},"schema_version":"1.0","source":{"id":"1610.06656","kind":"arxiv","version":2}},"canonical_sha256":"dbe4e1e44e135f178deabd74a58236c1e5cdbb27dedd1b0029fdb4d13055f1e4","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"dbe4e1e44e135f178deabd74a58236c1e5cdbb27dedd1b0029fdb4d13055f1e4","first_computed_at":"2026-05-18T01:01:15.287605Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:01:15.287605Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"LhGkWrgMX5Y0HGG5o+++iDNp1BZiwXs4dcbevbYMNH5CNLCJCewxjkYF13dZApLy1IuIpkIqm0fU9vVbEv/MDg==","signature_status":"signed_v1","signed_at":"2026-05-18T01:01:15.288240Z","signed_message":"canonical_sha256_bytes"},"source_id":"1610.06656","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:0a7e4bda4a8f63016663596e23e695925044050eb23348ce6cdb7624729fbdca","sha256:35522565a61fadf33f139b17738ae17ed493bd4b7aa236102f21cb45b53d1f1d"],"state_sha256":"d409582607ba110a874cc5e1529c116111db82bf5d211355a95b0829e6b4f118"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"FKhpplQl07c+hZNlZJeoeSwxvKmWq84rg1rvhLPvl4VZdEcgtjgMOeZAsjlMC+JsyPAYr2viafqP12kT3vuFAA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-05T06:54:07.053243Z","bundle_sha256":"fdde6cf9829c8f54029d84791728c817ed5120696c7d25bcd2cb0c63188c42b4"}}