{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:33XOJZL6EJGYWKXYK4JWTFGWDV","short_pith_number":"pith:33XOJZL6","schema_version":"1.0","canonical_sha256":"deeee4e57e224d8b2af857136994d61d620fcd9098f1940acbff6ac138411e4d","source":{"kind":"arxiv","id":"1607.07395","version":3},"attestation_state":"computed","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"},"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":"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1607.07395","created_at":"2026-05-18T01:10:23.083586+00:00"},{"alias_kind":"arxiv_version","alias_value":"1607.07395v3","created_at":"2026-05-18T01:10:23.083586+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1607.07395","created_at":"2026-05-18T01:10:23.083586+00:00"},{"alias_kind":"pith_short_12","alias_value":"33XOJZL6EJGY","created_at":"2026-05-18T12:29:55.572404+00:00"},{"alias_kind":"pith_short_16","alias_value":"33XOJZL6EJGYWKXY","created_at":"2026-05-18T12:29:55.572404+00:00"},{"alias_kind":"pith_short_8","alias_value":"33XOJZL6","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/33XOJZL6EJGYWKXYK4JWTFGWDV","json":"https://pith.science/pith/33XOJZL6EJGYWKXYK4JWTFGWDV.json","graph_json":"https://pith.science/api/pith-number/33XOJZL6EJGYWKXYK4JWTFGWDV/graph.json","events_json":"https://pith.science/api/pith-number/33XOJZL6EJGYWKXYK4JWTFGWDV/events.json","paper":"https://pith.science/paper/33XOJZL6"},"agent_actions":{"view_html":"https://pith.science/pith/33XOJZL6EJGYWKXYK4JWTFGWDV","download_json":"https://pith.science/pith/33XOJZL6EJGYWKXYK4JWTFGWDV.json","view_paper":"https://pith.science/paper/33XOJZL6","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1607.07395&json=true","fetch_graph":"https://pith.science/api/pith-number/33XOJZL6EJGYWKXYK4JWTFGWDV/graph.json","fetch_events":"https://pith.science/api/pith-number/33XOJZL6EJGYWKXYK4JWTFGWDV/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/33XOJZL6EJGYWKXYK4JWTFGWDV/action/timestamp_anchor","attest_storage":"https://pith.science/pith/33XOJZL6EJGYWKXYK4JWTFGWDV/action/storage_attestation","attest_author":"https://pith.science/pith/33XOJZL6EJGYWKXYK4JWTFGWDV/action/author_attestation","sign_citation":"https://pith.science/pith/33XOJZL6EJGYWKXYK4JWTFGWDV/action/citation_signature","submit_replication":"https://pith.science/pith/33XOJZL6EJGYWKXYK4JWTFGWDV/action/replication_record"}},"created_at":"2026-05-18T01:10:23.083586+00:00","updated_at":"2026-05-18T01:10:23.083586+00:00"}