{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:I5URMWUZTR24BCZYF7ZHKEO3JN","short_pith_number":"pith:I5URMWUZ","canonical_record":{"source":{"id":"1809.11085","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2018-09-28T15:26:25Z","cross_cats_sorted":[],"title_canon_sha256":"6d42bbea5e6303d9a4e5415d3586b9ded7f113a96b9b5bc8e990cf16243ab493","abstract_canon_sha256":"a59372cee2ffa02908542f249b5f7b08572b911e5c554168777856a407205d0b"},"schema_version":"1.0"},"canonical_sha256":"4769165a999c75c08b382ff27511db4b4679f622099c54fa079e200d6ff1bcf4","source":{"kind":"arxiv","id":"1809.11085","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1809.11085","created_at":"2026-05-18T00:04:33Z"},{"alias_kind":"arxiv_version","alias_value":"1809.11085v1","created_at":"2026-05-18T00:04:33Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1809.11085","created_at":"2026-05-18T00:04:33Z"},{"alias_kind":"pith_short_12","alias_value":"I5URMWUZTR24","created_at":"2026-05-18T12:32:28Z"},{"alias_kind":"pith_short_16","alias_value":"I5URMWUZTR24BCZY","created_at":"2026-05-18T12:32:28Z"},{"alias_kind":"pith_short_8","alias_value":"I5URMWUZ","created_at":"2026-05-18T12:32:28Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:I5URMWUZTR24BCZYF7ZHKEO3JN","target":"record","payload":{"canonical_record":{"source":{"id":"1809.11085","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2018-09-28T15:26:25Z","cross_cats_sorted":[],"title_canon_sha256":"6d42bbea5e6303d9a4e5415d3586b9ded7f113a96b9b5bc8e990cf16243ab493","abstract_canon_sha256":"a59372cee2ffa02908542f249b5f7b08572b911e5c554168777856a407205d0b"},"schema_version":"1.0"},"canonical_sha256":"4769165a999c75c08b382ff27511db4b4679f622099c54fa079e200d6ff1bcf4","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:04:33.341477Z","signature_b64":"7mjkHShcCHkar5WdHjCrQUjt5/UW2qlsB2btvVkMTHqNiZN/yB3bSajLtjajs/XRYODrpkDIynM+hEo4h4YVBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"4769165a999c75c08b382ff27511db4b4679f622099c54fa079e200d6ff1bcf4","last_reissued_at":"2026-05-18T00:04:33.340778Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:04:33.340778Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1809.11085","source_version":1,"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-18T00:04:33Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"+9EctRzadw7ICzD4Rpcw0UYHT6X3dTS+Mo2quGQJDkY7eYMVqSM8XYNm5DwA77/2kO0xP1/oB+UC8Q2GLZEADg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T03:36:43.546298Z"},"content_sha256":"004b76d8219c19eadc0b1473af50b7e271728a261dae016d1cefa0b306f58e39","schema_version":"1.0","event_id":"sha256:004b76d8219c19eadc0b1473af50b7e271728a261dae016d1cefa0b306f58e39"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:I5URMWUZTR24BCZYF7ZHKEO3JN","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Shifted CholeskyQR for computing the QR factorization of ill-conditioned matrices","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.NA","authors_text":"Ramaseshan Kannan, Takeshi Fukaya, Yuji Nakatsukasa, Yuka Yanagisawa, Yusaku Yamamoto","submitted_at":"2018-09-28T15:26:25Z","abstract_excerpt":"The Cholesky QR algorithm is an efficient communication-minimizing algorithm for computing the QR factorization of a tall-skinny matrix. Unfortunately it has the inherent numerical instability and breakdown when the matrix is ill-conditioned. A recent work establishes that the instability can be cured by repeating the algorithm twice (called CholeskyQR2). However, the applicability of CholeskyQR2 is still limited by the requirement that the Cholesky factorization of the Gram matrix runs to completion, which means it does not always work for matrices $X$ with $\\kappa_2(X)\\gtrsim {{\\bf u}}^{-\\fr"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1809.11085","kind":"arxiv","version":1},"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-18T00:04:33Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Efdic4/x92E/5f0diNUtAeyp67xo6uVD23XHC6VxY7q2iop5EZi8Qtf+9sHi0XRw+VVB6HqOIlkkjg+uZH41AA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T03:36:43.546661Z"},"content_sha256":"b8bdb96c53af5fd602a7649b8fc0fbe2bad43fb90b46246f218ad246ec6a1730","schema_version":"1.0","event_id":"sha256:b8bdb96c53af5fd602a7649b8fc0fbe2bad43fb90b46246f218ad246ec6a1730"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/I5URMWUZTR24BCZYF7ZHKEO3JN/bundle.json","state_url":"https://pith.science/pith/I5URMWUZTR24BCZYF7ZHKEO3JN/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/I5URMWUZTR24BCZYF7ZHKEO3JN/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-05-28T03:36:43Z","links":{"resolver":"https://pith.science/pith/I5URMWUZTR24BCZYF7ZHKEO3JN","bundle":"https://pith.science/pith/I5URMWUZTR24BCZYF7ZHKEO3JN/bundle.json","state":"https://pith.science/pith/I5URMWUZTR24BCZYF7ZHKEO3JN/state.json","well_known_bundle":"https://pith.science/.well-known/pith/I5URMWUZTR24BCZYF7ZHKEO3JN/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:I5URMWUZTR24BCZYF7ZHKEO3JN","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":"a59372cee2ffa02908542f249b5f7b08572b911e5c554168777856a407205d0b","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2018-09-28T15:26:25Z","title_canon_sha256":"6d42bbea5e6303d9a4e5415d3586b9ded7f113a96b9b5bc8e990cf16243ab493"},"schema_version":"1.0","source":{"id":"1809.11085","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1809.11085","created_at":"2026-05-18T00:04:33Z"},{"alias_kind":"arxiv_version","alias_value":"1809.11085v1","created_at":"2026-05-18T00:04:33Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1809.11085","created_at":"2026-05-18T00:04:33Z"},{"alias_kind":"pith_short_12","alias_value":"I5URMWUZTR24","created_at":"2026-05-18T12:32:28Z"},{"alias_kind":"pith_short_16","alias_value":"I5URMWUZTR24BCZY","created_at":"2026-05-18T12:32:28Z"},{"alias_kind":"pith_short_8","alias_value":"I5URMWUZ","created_at":"2026-05-18T12:32:28Z"}],"graph_snapshots":[{"event_id":"sha256:b8bdb96c53af5fd602a7649b8fc0fbe2bad43fb90b46246f218ad246ec6a1730","target":"graph","created_at":"2026-05-18T00:04:33Z","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":"The Cholesky QR algorithm is an efficient communication-minimizing algorithm for computing the QR factorization of a tall-skinny matrix. Unfortunately it has the inherent numerical instability and breakdown when the matrix is ill-conditioned. A recent work establishes that the instability can be cured by repeating the algorithm twice (called CholeskyQR2). However, the applicability of CholeskyQR2 is still limited by the requirement that the Cholesky factorization of the Gram matrix runs to completion, which means it does not always work for matrices $X$ with $\\kappa_2(X)\\gtrsim {{\\bf u}}^{-\\fr","authors_text":"Ramaseshan Kannan, Takeshi Fukaya, Yuji Nakatsukasa, Yuka Yanagisawa, Yusaku Yamamoto","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2018-09-28T15:26:25Z","title":"Shifted CholeskyQR for computing the QR factorization of ill-conditioned matrices"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1809.11085","kind":"arxiv","version":1},"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:004b76d8219c19eadc0b1473af50b7e271728a261dae016d1cefa0b306f58e39","target":"record","created_at":"2026-05-18T00:04:33Z","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":"a59372cee2ffa02908542f249b5f7b08572b911e5c554168777856a407205d0b","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2018-09-28T15:26:25Z","title_canon_sha256":"6d42bbea5e6303d9a4e5415d3586b9ded7f113a96b9b5bc8e990cf16243ab493"},"schema_version":"1.0","source":{"id":"1809.11085","kind":"arxiv","version":1}},"canonical_sha256":"4769165a999c75c08b382ff27511db4b4679f622099c54fa079e200d6ff1bcf4","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"4769165a999c75c08b382ff27511db4b4679f622099c54fa079e200d6ff1bcf4","first_computed_at":"2026-05-18T00:04:33.340778Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:04:33.340778Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"7mjkHShcCHkar5WdHjCrQUjt5/UW2qlsB2btvVkMTHqNiZN/yB3bSajLtjajs/XRYODrpkDIynM+hEo4h4YVBA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:04:33.341477Z","signed_message":"canonical_sha256_bytes"},"source_id":"1809.11085","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:004b76d8219c19eadc0b1473af50b7e271728a261dae016d1cefa0b306f58e39","sha256:b8bdb96c53af5fd602a7649b8fc0fbe2bad43fb90b46246f218ad246ec6a1730"],"state_sha256":"9657e76ed132047935f86a00d5237a77feeb35e27d2d88a3bfda23b842cd3e36"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"VaBJ09TaLIgdGUR/NfKeE4MFnpmYJ0k0Ok0wp5dSe0wesmMjmg2ssumQNhJNkvSOux2ioGipg8yXgIAO5jFUCA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-28T03:36:43.548639Z","bundle_sha256":"a8304c04daad7229a629449acceeefc3117033d58a8d522c6241618dd46d75c9"}}