{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2022:2VADJOXVX4CHBLEGWQICCHEVSX","short_pith_number":"pith:2VADJOXV","schema_version":"1.0","canonical_sha256":"d54034baf5bf0470ac86b410211c9595f611a579b5744c0db085661462a253e7","source":{"kind":"arxiv","id":"2207.06503","version":6},"attestation_state":"computed","paper":{"title":"Randomly pivoted Cholesky: Practical approximation of a kernel matrix with few entry evaluations","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.NA","stat.ML"],"primary_cat":"math.NA","authors_text":"Ethan N. Epperly, Joel A. Tropp, Robert J. Webber, Yifan Chen","submitted_at":"2022-07-13T19:51:24Z","abstract_excerpt":"The randomly pivoted partial Cholesky algorithm (RPCholesky) computes a factorized rank-k approximation of an N x N positive-semidefinite (psd) matrix. RPCholesky requires only (k + 1) N entry evaluations and O(k^2 N) additional arithmetic operations, and it can be implemented with just a few lines of code. The method is particularly useful for approximating a kernel matrix.\n  This paper offers a thorough new investigation of the empirical and theoretical behavior of this fundamental algorithm. For matrix approximation problems that arise in scientific machine learning, experiments show that R"},"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":"2207.06503","kind":"arxiv","version":6},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2022-07-13T19:51:24Z","cross_cats_sorted":["cs.NA","stat.ML"],"title_canon_sha256":"a69ca35abc1dfc40610fc166502c3cd269f4096eeb8e3f36380d383509342c25","abstract_canon_sha256":"54f16eab9ec5f568ca8cb0cae758ae12a713ede4ef154864c731c88904101e70"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T09:23:42.217849Z","signature_b64":"dhm0pyzIgIuVmkLyIkakGYxowIkU6mxLFoISUYq8sNrCOWI8d1r6XWrlU8RblW+Q8HeHQaSFfTSBaf4c2AlEBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d54034baf5bf0470ac86b410211c9595f611a579b5744c0db085661462a253e7","last_reissued_at":"2026-07-05T09:23:42.217372Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T09:23:42.217372Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Randomly pivoted Cholesky: Practical approximation of a kernel matrix with few entry evaluations","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.NA","stat.ML"],"primary_cat":"math.NA","authors_text":"Ethan N. Epperly, Joel A. Tropp, Robert J. Webber, Yifan Chen","submitted_at":"2022-07-13T19:51:24Z","abstract_excerpt":"The randomly pivoted partial Cholesky algorithm (RPCholesky) computes a factorized rank-k approximation of an N x N positive-semidefinite (psd) matrix. RPCholesky requires only (k + 1) N entry evaluations and O(k^2 N) additional arithmetic operations, and it can be implemented with just a few lines of code. The method is particularly useful for approximating a kernel matrix.\n  This paper offers a thorough new investigation of the empirical and theoretical behavior of this fundamental algorithm. For matrix approximation problems that arise in scientific machine learning, experiments show that R"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2207.06503","kind":"arxiv","version":6},"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/2207.06503/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":"2207.06503","created_at":"2026-07-05T09:23:42.217428+00:00"},{"alias_kind":"arxiv_version","alias_value":"2207.06503v6","created_at":"2026-07-05T09:23:42.217428+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2207.06503","created_at":"2026-07-05T09:23:42.217428+00:00"},{"alias_kind":"pith_short_12","alias_value":"2VADJOXVX4CH","created_at":"2026-07-05T09:23:42.217428+00:00"},{"alias_kind":"pith_short_16","alias_value":"2VADJOXVX4CHBLEG","created_at":"2026-07-05T09:23:42.217428+00:00"},{"alias_kind":"pith_short_8","alias_value":"2VADJOXV","created_at":"2026-07-05T09:23:42.217428+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2606.01412","citing_title":"GPTQ-intrinsic LoRA: A Near-optimal Algorithm for Low-precision Quantization with Low-rank Adaptation","ref_index":9,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/2VADJOXVX4CHBLEGWQICCHEVSX","json":"https://pith.science/pith/2VADJOXVX4CHBLEGWQICCHEVSX.json","graph_json":"https://pith.science/api/pith-number/2VADJOXVX4CHBLEGWQICCHEVSX/graph.json","events_json":"https://pith.science/api/pith-number/2VADJOXVX4CHBLEGWQICCHEVSX/events.json","paper":"https://pith.science/paper/2VADJOXV"},"agent_actions":{"view_html":"https://pith.science/pith/2VADJOXVX4CHBLEGWQICCHEVSX","download_json":"https://pith.science/pith/2VADJOXVX4CHBLEGWQICCHEVSX.json","view_paper":"https://pith.science/paper/2VADJOXV","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2207.06503&json=true","fetch_graph":"https://pith.science/api/pith-number/2VADJOXVX4CHBLEGWQICCHEVSX/graph.json","fetch_events":"https://pith.science/api/pith-number/2VADJOXVX4CHBLEGWQICCHEVSX/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/2VADJOXVX4CHBLEGWQICCHEVSX/action/timestamp_anchor","attest_storage":"https://pith.science/pith/2VADJOXVX4CHBLEGWQICCHEVSX/action/storage_attestation","attest_author":"https://pith.science/pith/2VADJOXVX4CHBLEGWQICCHEVSX/action/author_attestation","sign_citation":"https://pith.science/pith/2VADJOXVX4CHBLEGWQICCHEVSX/action/citation_signature","submit_replication":"https://pith.science/pith/2VADJOXVX4CHBLEGWQICCHEVSX/action/replication_record"}},"created_at":"2026-07-05T09:23:42.217428+00:00","updated_at":"2026-07-05T09:23:42.217428+00:00"}