{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:33XOJZL6EJGYWKXYK4JWTFGWDV","short_pith_number":"pith:33XOJZL6","canonical_record":{"source":{"id":"1607.07395","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2016-07-25T18:28:18Z","cross_cats_sorted":[],"title_canon_sha256":"214d8646ef2c2d97eba93f8c6fbad0a4d0184c20342d9a82d989df77b288b06f","abstract_canon_sha256":"75d872c855a4a1a0048d609bcdfffa6d4ed9388b6a129a318acfd36b11daeef6"},"schema_version":"1.0"},"canonical_sha256":"deeee4e57e224d8b2af857136994d61d620fcd9098f1940acbff6ac138411e4d","source":{"kind":"arxiv","id":"1607.07395","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1607.07395","created_at":"2026-05-18T01:10:23Z"},{"alias_kind":"arxiv_version","alias_value":"1607.07395v3","created_at":"2026-05-18T01:10:23Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1607.07395","created_at":"2026-05-18T01:10:23Z"},{"alias_kind":"pith_short_12","alias_value":"33XOJZL6EJGY","created_at":"2026-05-18T12:29:55Z"},{"alias_kind":"pith_short_16","alias_value":"33XOJZL6EJGYWKXY","created_at":"2026-05-18T12:29:55Z"},{"alias_kind":"pith_short_8","alias_value":"33XOJZL6","created_at":"2026-05-18T12:29:55Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:33XOJZL6EJGYWKXYK4JWTFGWDV","target":"record","payload":{"canonical_record":{"source":{"id":"1607.07395","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2016-07-25T18:28:18Z","cross_cats_sorted":[],"title_canon_sha256":"214d8646ef2c2d97eba93f8c6fbad0a4d0184c20342d9a82d989df77b288b06f","abstract_canon_sha256":"75d872c855a4a1a0048d609bcdfffa6d4ed9388b6a129a318acfd36b11daeef6"},"schema_version":"1.0"},"canonical_sha256":"deeee4e57e224d8b2af857136994d61d620fcd9098f1940acbff6ac138411e4d","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:10:23.083966Z","signature_b64":"GjoTCfzq0vN0AUN8jBh/YlKN6ij6ducKkIdSScElLSJCuGdWI/jMsJSvtSrQbOAICn69zubRqsrVPH93YWZoDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"deeee4e57e224d8b2af857136994d61d620fcd9098f1940acbff6ac138411e4d","last_reissued_at":"2026-05-18T01:10:23.083492Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:10:23.083492Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1607.07395","source_version":3,"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:10:23Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"i5cnWtE1vt3qn4XQKL6JiI+gg2k/zTvsnDmIC+XxR92ZoAEefuaZ9w4aWczSRrd+QnT4yAwXyqtXae7QKxv6Cg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-07T04:03:24.364593Z"},"content_sha256":"505265569a77ccdd4eec289cd27c8060f28b01b894c9c5c347f9b530e66e0617","schema_version":"1.0","event_id":"sha256:505265569a77ccdd4eec289cd27c8060f28b01b894c9c5c347f9b530e66e0617"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:33XOJZL6EJGYWKXYK4JWTFGWDV","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Seeing the Forest from the Trees in Two Looks: Matrix Sketching by Cascaded Bilateral Sampling","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Chuanren Liu, Eric Xing, Hui Xiong, Jieping Ye, Jie Zhang, Kai Zhang","submitted_at":"2016-07-25T18:28:18Z","abstract_excerpt":"Matrix sketching is aimed at finding close approximations of a matrix by factors of much smaller dimensions, which has important applications in optimization and machine learning. Given a matrix A of size m by n, state-of-the-art randomized algorithms take O(m * n) time and space to obtain its low-rank decomposition. Although quite useful, the need to store or manipulate the entire matrix makes it a computational bottleneck for truly large and dense inputs. Can we sketch an m-by-n matrix in O(m + n) cost by accessing only a small fraction of its rows and columns, without knowing anything about"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1607.07395","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":""},"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:10:23Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"QwbjCdeR3/9C5qu+fToKeWlDkNGpUwSnuyC5iLc0R8Tem1YD2pr8TcwALriuoI2euElVkgQkDEt7Jn9kM5Y5Aw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-07T04:03:24.364954Z"},"content_sha256":"2071549534365f4607e43ab708a84c1eea08001743c336c8c7ff4533abcf543d","schema_version":"1.0","event_id":"sha256:2071549534365f4607e43ab708a84c1eea08001743c336c8c7ff4533abcf543d"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/33XOJZL6EJGYWKXYK4JWTFGWDV/bundle.json","state_url":"https://pith.science/pith/33XOJZL6EJGYWKXYK4JWTFGWDV/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/33XOJZL6EJGYWKXYK4JWTFGWDV/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-07T04:03:24Z","links":{"resolver":"https://pith.science/pith/33XOJZL6EJGYWKXYK4JWTFGWDV","bundle":"https://pith.science/pith/33XOJZL6EJGYWKXYK4JWTFGWDV/bundle.json","state":"https://pith.science/pith/33XOJZL6EJGYWKXYK4JWTFGWDV/state.json","well_known_bundle":"https://pith.science/.well-known/pith/33XOJZL6EJGYWKXYK4JWTFGWDV/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:33XOJZL6EJGYWKXYK4JWTFGWDV","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":"75d872c855a4a1a0048d609bcdfffa6d4ed9388b6a129a318acfd36b11daeef6","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2016-07-25T18:28:18Z","title_canon_sha256":"214d8646ef2c2d97eba93f8c6fbad0a4d0184c20342d9a82d989df77b288b06f"},"schema_version":"1.0","source":{"id":"1607.07395","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1607.07395","created_at":"2026-05-18T01:10:23Z"},{"alias_kind":"arxiv_version","alias_value":"1607.07395v3","created_at":"2026-05-18T01:10:23Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1607.07395","created_at":"2026-05-18T01:10:23Z"},{"alias_kind":"pith_short_12","alias_value":"33XOJZL6EJGY","created_at":"2026-05-18T12:29:55Z"},{"alias_kind":"pith_short_16","alias_value":"33XOJZL6EJGYWKXY","created_at":"2026-05-18T12:29:55Z"},{"alias_kind":"pith_short_8","alias_value":"33XOJZL6","created_at":"2026-05-18T12:29:55Z"}],"graph_snapshots":[{"event_id":"sha256:2071549534365f4607e43ab708a84c1eea08001743c336c8c7ff4533abcf543d","target":"graph","created_at":"2026-05-18T01:10:23Z","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":"Matrix sketching is aimed at finding close approximations of a matrix by factors of much smaller dimensions, which has important applications in optimization and machine learning. Given a matrix A of size m by n, state-of-the-art randomized algorithms take O(m * n) time and space to obtain its low-rank decomposition. Although quite useful, the need to store or manipulate the entire matrix makes it a computational bottleneck for truly large and dense inputs. Can we sketch an m-by-n matrix in O(m + n) cost by accessing only a small fraction of its rows and columns, without knowing anything about","authors_text":"Chuanren Liu, Eric Xing, Hui Xiong, Jieping Ye, Jie Zhang, Kai Zhang","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2016-07-25T18:28:18Z","title":"Seeing the Forest from the Trees in Two Looks: Matrix Sketching by Cascaded Bilateral Sampling"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1607.07395","kind":"arxiv","version":3},"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:505265569a77ccdd4eec289cd27c8060f28b01b894c9c5c347f9b530e66e0617","target":"record","created_at":"2026-05-18T01:10:23Z","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":"75d872c855a4a1a0048d609bcdfffa6d4ed9388b6a129a318acfd36b11daeef6","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2016-07-25T18:28:18Z","title_canon_sha256":"214d8646ef2c2d97eba93f8c6fbad0a4d0184c20342d9a82d989df77b288b06f"},"schema_version":"1.0","source":{"id":"1607.07395","kind":"arxiv","version":3}},"canonical_sha256":"deeee4e57e224d8b2af857136994d61d620fcd9098f1940acbff6ac138411e4d","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"deeee4e57e224d8b2af857136994d61d620fcd9098f1940acbff6ac138411e4d","first_computed_at":"2026-05-18T01:10:23.083492Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:10:23.083492Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"GjoTCfzq0vN0AUN8jBh/YlKN6ij6ducKkIdSScElLSJCuGdWI/jMsJSvtSrQbOAICn69zubRqsrVPH93YWZoDA==","signature_status":"signed_v1","signed_at":"2026-05-18T01:10:23.083966Z","signed_message":"canonical_sha256_bytes"},"source_id":"1607.07395","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:505265569a77ccdd4eec289cd27c8060f28b01b894c9c5c347f9b530e66e0617","sha256:2071549534365f4607e43ab708a84c1eea08001743c336c8c7ff4533abcf543d"],"state_sha256":"556bd324e4fdc88cc9b321ca08f6392c46da8150ea5f0494d429ba96a19dbd11"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"y675LX7+rMF/nUxP/RbPvhrh/WhXchssTL1r9Rfkg9a5937Mis9M+8gLG+Zv13Hx4MKGOiTS47Bp/Fx1LtbKAA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-07T04:03:24.367207Z","bundle_sha256":"2ed284513b7b2943949da8151b4b81abbe7d486fb2dfbcc73646549f17d74418"}}