{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2022:FX6GRDGGIXB3HDZVO7QXPZVD5S","short_pith_number":"pith:FX6GRDGG","schema_version":"1.0","canonical_sha256":"2dfc688cc645c3b38f3577e177e6a3ecaa5d2f663dcf1f797b3b153d4f727161","source":{"kind":"arxiv","id":"2210.09953","version":2},"attestation_state":"computed","paper":{"title":"Randomized Cholesky QR factorizations","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.NA"],"primary_cat":"math.NA","authors_text":"Oleg Balabanov","submitted_at":"2022-10-18T16:07:50Z","abstract_excerpt":"This article proposes and analyzes several variants of the randomized Cholesky QR factorization of a matrix $X$. Instead of computing the R factor from $X^T X$, as is done by standard methods, we obtain it from a small, efficiently computable random sketch of $X$, thus saving computational cost and improving numerical stability. The proposed direct variant of the randomized Cholesky QR requires only half the flops and the same communication cost as the classical Cholesky QR. At the same time, it is more robust since it is guaranteed to be stable whenever the input matrix is numerically full-ra"},"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":"2210.09953","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2022-10-18T16:07:50Z","cross_cats_sorted":["cs.NA"],"title_canon_sha256":"0cf9f062072960d2786bd213d8c4d3558c1bc50e798b20d22055dcd8d7521266","abstract_canon_sha256":"b02214da3a3d00b3190a5a46ab187843134a05583b31e633c140b99cb21bbb7c"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T05:09:23.743760Z","signature_b64":"N2SDw3WQ49SQRgod11JKvHOkSsv1OBsVmZlUNVeQZSK4fBA197LaEcLrz7lnGXVIPFizlneimdv8yiGiw7r2Aw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2dfc688cc645c3b38f3577e177e6a3ecaa5d2f663dcf1f797b3b153d4f727161","last_reissued_at":"2026-07-05T05:09:23.743357Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T05:09:23.743357Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Randomized Cholesky QR factorizations","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.NA"],"primary_cat":"math.NA","authors_text":"Oleg Balabanov","submitted_at":"2022-10-18T16:07:50Z","abstract_excerpt":"This article proposes and analyzes several variants of the randomized Cholesky QR factorization of a matrix $X$. Instead of computing the R factor from $X^T X$, as is done by standard methods, we obtain it from a small, efficiently computable random sketch of $X$, thus saving computational cost and improving numerical stability. The proposed direct variant of the randomized Cholesky QR requires only half the flops and the same communication cost as the classical Cholesky QR. At the same time, it is more robust since it is guaranteed to be stable whenever the input matrix is numerically full-ra"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2210.09953","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/2210.09953/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":"2210.09953","created_at":"2026-07-05T05:09:23.743416+00:00"},{"alias_kind":"arxiv_version","alias_value":"2210.09953v2","created_at":"2026-07-05T05:09:23.743416+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2210.09953","created_at":"2026-07-05T05:09:23.743416+00:00"},{"alias_kind":"pith_short_12","alias_value":"FX6GRDGGIXB3","created_at":"2026-07-05T05:09:23.743416+00:00"},{"alias_kind":"pith_short_16","alias_value":"FX6GRDGGIXB3HDZV","created_at":"2026-07-05T05:09:23.743416+00:00"},{"alias_kind":"pith_short_8","alias_value":"FX6GRDGG","created_at":"2026-07-05T05:09:23.743416+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":3,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2606.18411","citing_title":"Numerically Stable Cholesky-QR on GPU via Mixed-Precision Randomized Preconditioning","ref_index":17,"is_internal_anchor":false},{"citing_arxiv_id":"2606.18411","citing_title":"Numerically Stable Cholesky-QR on GPU via Mixed-Precision Randomized Preconditioning","ref_index":17,"is_internal_anchor":false},{"citing_arxiv_id":"2604.05065","citing_title":"Adaptive LSQR Preconditioning from One Small Sketch","ref_index":5,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/FX6GRDGGIXB3HDZVO7QXPZVD5S","json":"https://pith.science/pith/FX6GRDGGIXB3HDZVO7QXPZVD5S.json","graph_json":"https://pith.science/api/pith-number/FX6GRDGGIXB3HDZVO7QXPZVD5S/graph.json","events_json":"https://pith.science/api/pith-number/FX6GRDGGIXB3HDZVO7QXPZVD5S/events.json","paper":"https://pith.science/paper/FX6GRDGG"},"agent_actions":{"view_html":"https://pith.science/pith/FX6GRDGGIXB3HDZVO7QXPZVD5S","download_json":"https://pith.science/pith/FX6GRDGGIXB3HDZVO7QXPZVD5S.json","view_paper":"https://pith.science/paper/FX6GRDGG","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2210.09953&json=true","fetch_graph":"https://pith.science/api/pith-number/FX6GRDGGIXB3HDZVO7QXPZVD5S/graph.json","fetch_events":"https://pith.science/api/pith-number/FX6GRDGGIXB3HDZVO7QXPZVD5S/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/FX6GRDGGIXB3HDZVO7QXPZVD5S/action/timestamp_anchor","attest_storage":"https://pith.science/pith/FX6GRDGGIXB3HDZVO7QXPZVD5S/action/storage_attestation","attest_author":"https://pith.science/pith/FX6GRDGGIXB3HDZVO7QXPZVD5S/action/author_attestation","sign_citation":"https://pith.science/pith/FX6GRDGGIXB3HDZVO7QXPZVD5S/action/citation_signature","submit_replication":"https://pith.science/pith/FX6GRDGGIXB3HDZVO7QXPZVD5S/action/replication_record"}},"created_at":"2026-07-05T05:09:23.743416+00:00","updated_at":"2026-07-05T05:09:23.743416+00:00"}