{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2023:5HRBMCP5YTHBA3Q6X2KR2X7XHV","short_pith_number":"pith:5HRBMCP5","schema_version":"1.0","canonical_sha256":"e9e21609fdc4ce106e1ebe951d5ff73d59f2065b71c72b714ae54408425edce8","source":{"kind":"arxiv","id":"2301.13163","version":2},"attestation_state":"computed","paper":{"title":"Randomized GCUR decompositions","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.NA"],"primary_cat":"math.NA","authors_text":"Pengpeng Xie, Yimin Wei, Zhengbang Cao","submitted_at":"2023-01-17T02:49:34Z","abstract_excerpt":"By exploiting the random sampling techniques, this paper derives an efficient randomized algorithm for computing a generalized CUR decomposition, which provides low-rank approximations of both matrices simultaneously in terms of some of their rows and columns. For large-scale data sets that are expensive to store and manipulate, a new variant of the discrete empirical interpolation method known as L-DEIM, which needs much lower cost and provides a significant acceleration in practice, is also combined with the random sampling approach to further improve the efficiency of our algorithm. Moreove"},"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":"2301.13163","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2023-01-17T02:49:34Z","cross_cats_sorted":["cs.NA"],"title_canon_sha256":"6dc53be18ffefb20bd4d54f9ea8b8a57206680945af964db88104e83541d7e66","abstract_canon_sha256":"77ce141042421520f5e86381df0725559343119461699fbd78e64febab9db5b5"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T05:58:29.220560Z","signature_b64":"Z+GIWUbL3hdUdQI3WL6irryBzLlaOrxE4NaUorHYSQEwV61OqbrKla0yby/8TJNxg83MNN2LQfxKyhJ8i5ZDCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e9e21609fdc4ce106e1ebe951d5ff73d59f2065b71c72b714ae54408425edce8","last_reissued_at":"2026-07-05T05:58:29.220136Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T05:58:29.220136Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Randomized GCUR decompositions","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.NA"],"primary_cat":"math.NA","authors_text":"Pengpeng Xie, Yimin Wei, Zhengbang Cao","submitted_at":"2023-01-17T02:49:34Z","abstract_excerpt":"By exploiting the random sampling techniques, this paper derives an efficient randomized algorithm for computing a generalized CUR decomposition, which provides low-rank approximations of both matrices simultaneously in terms of some of their rows and columns. For large-scale data sets that are expensive to store and manipulate, a new variant of the discrete empirical interpolation method known as L-DEIM, which needs much lower cost and provides a significant acceleration in practice, is also combined with the random sampling approach to further improve the efficiency of our algorithm. Moreove"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2301.13163","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2301.13163/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"2301.13163","created_at":"2026-07-05T05:58:29.220196+00:00"},{"alias_kind":"arxiv_version","alias_value":"2301.13163v2","created_at":"2026-07-05T05:58:29.220196+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2301.13163","created_at":"2026-07-05T05:58:29.220196+00:00"},{"alias_kind":"pith_short_12","alias_value":"5HRBMCP5YTHB","created_at":"2026-07-05T05:58:29.220196+00:00"},{"alias_kind":"pith_short_16","alias_value":"5HRBMCP5YTHBA3Q6","created_at":"2026-07-05T05:58:29.220196+00:00"},{"alias_kind":"pith_short_8","alias_value":"5HRBMCP5","created_at":"2026-07-05T05:58:29.220196+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/5HRBMCP5YTHBA3Q6X2KR2X7XHV","json":"https://pith.science/pith/5HRBMCP5YTHBA3Q6X2KR2X7XHV.json","graph_json":"https://pith.science/api/pith-number/5HRBMCP5YTHBA3Q6X2KR2X7XHV/graph.json","events_json":"https://pith.science/api/pith-number/5HRBMCP5YTHBA3Q6X2KR2X7XHV/events.json","paper":"https://pith.science/paper/5HRBMCP5"},"agent_actions":{"view_html":"https://pith.science/pith/5HRBMCP5YTHBA3Q6X2KR2X7XHV","download_json":"https://pith.science/pith/5HRBMCP5YTHBA3Q6X2KR2X7XHV.json","view_paper":"https://pith.science/paper/5HRBMCP5","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2301.13163&json=true","fetch_graph":"https://pith.science/api/pith-number/5HRBMCP5YTHBA3Q6X2KR2X7XHV/graph.json","fetch_events":"https://pith.science/api/pith-number/5HRBMCP5YTHBA3Q6X2KR2X7XHV/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/5HRBMCP5YTHBA3Q6X2KR2X7XHV/action/timestamp_anchor","attest_storage":"https://pith.science/pith/5HRBMCP5YTHBA3Q6X2KR2X7XHV/action/storage_attestation","attest_author":"https://pith.science/pith/5HRBMCP5YTHBA3Q6X2KR2X7XHV/action/author_attestation","sign_citation":"https://pith.science/pith/5HRBMCP5YTHBA3Q6X2KR2X7XHV/action/citation_signature","submit_replication":"https://pith.science/pith/5HRBMCP5YTHBA3Q6X2KR2X7XHV/action/replication_record"}},"created_at":"2026-07-05T05:58:29.220196+00:00","updated_at":"2026-07-05T05:58:29.220196+00:00"}