{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:A4N2EMBSTTSDD5HO4VZ2NH7DVG","short_pith_number":"pith:A4N2EMBS","canonical_record":{"source":{"id":"1809.10585","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2018-09-27T15:45:20Z","cross_cats_sorted":[],"title_canon_sha256":"8b52ae1b3115326c2c9218ca13e2f7db058b0a1a461bc26b372a9ed58baba1b2","abstract_canon_sha256":"b407faa2579b8a6badab5d4c3f682f57621640ed42bc223dfe24b397d96196fe"},"schema_version":"1.0"},"canonical_sha256":"071ba230329ce431f4eee573a69fe3a9ba9e1982725f89a7a1612d3da05077fe","source":{"kind":"arxiv","id":"1809.10585","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1809.10585","created_at":"2026-05-18T00:04:38Z"},{"alias_kind":"arxiv_version","alias_value":"1809.10585v1","created_at":"2026-05-18T00:04:38Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1809.10585","created_at":"2026-05-18T00:04:38Z"},{"alias_kind":"pith_short_12","alias_value":"A4N2EMBSTTSD","created_at":"2026-05-18T12:32:13Z"},{"alias_kind":"pith_short_16","alias_value":"A4N2EMBSTTSDD5HO","created_at":"2026-05-18T12:32:13Z"},{"alias_kind":"pith_short_8","alias_value":"A4N2EMBS","created_at":"2026-05-18T12:32:13Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:A4N2EMBSTTSDD5HO4VZ2NH7DVG","target":"record","payload":{"canonical_record":{"source":{"id":"1809.10585","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2018-09-27T15:45:20Z","cross_cats_sorted":[],"title_canon_sha256":"8b52ae1b3115326c2c9218ca13e2f7db058b0a1a461bc26b372a9ed58baba1b2","abstract_canon_sha256":"b407faa2579b8a6badab5d4c3f682f57621640ed42bc223dfe24b397d96196fe"},"schema_version":"1.0"},"canonical_sha256":"071ba230329ce431f4eee573a69fe3a9ba9e1982725f89a7a1612d3da05077fe","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:04:38.040460Z","signature_b64":"y9Gt3UujsMe9K4tEnHFX28VbrXcR/nBvDkPllRwuofz2hzzAp5EZqQ5CDJKUDl9QZc9XyT3ht8sL9BdzOu8cBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"071ba230329ce431f4eee573a69fe3a9ba9e1982725f89a7a1612d3da05077fe","last_reissued_at":"2026-05-18T00:04:38.040023Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:04:38.040023Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1809.10585","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:38Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"twhY/2VusLL9cvYJ9C/BUaXnTMEVLavR+Wq3AUNIbqLD72P1ZN4yz66dD7Yv6RYTDF2Q6Qfb0k2LiU4y68krAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-05T05:12:27.125840Z"},"content_sha256":"d55473bec4838ea998f0521d64141d0ab60c932758d524d96665025b90609f2e","schema_version":"1.0","event_id":"sha256:d55473bec4838ea998f0521d64141d0ab60c932758d524d96665025b90609f2e"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:A4N2EMBSTTSDD5HO4VZ2NH7DVG","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Fast QR decomposition of HODLR matrices","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.NA","authors_text":"Ana Susnjara, Daniel Kressner","submitted_at":"2018-09-27T15:45:20Z","abstract_excerpt":"The efficient and accurate QR decomposition for matrices with hierarchical low-rank structures, such as HODLR and hierarchical matrices, has been challenging. Existing structure-exploiting algorithms are prone to numerical instability as they proceed indirectly, via Cholesky decompositions or a block Gram-Schmidt procedure. For a highly ill-conditioned matrix, such approaches either break down in finite-precision arithmetic or result in significant loss of orthogonality. Although these issues can sometimes be addressed by regularization and iterative refinement, it would be more desirable to h"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1809.10585","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:38Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"1KlDqBmNgi+GooLoST7AyDYU9OuBMQGbrCRV5POiur2f7qdHACst4GJfyXOl8pEaEefTvQXEfUSTvREVR8AHBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-05T05:12:27.126190Z"},"content_sha256":"631e79a1b7e3dfafebaaf3d4030c39189711e2f772f1b52a8c9d5cfaf6f29a20","schema_version":"1.0","event_id":"sha256:631e79a1b7e3dfafebaaf3d4030c39189711e2f772f1b52a8c9d5cfaf6f29a20"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/A4N2EMBSTTSDD5HO4VZ2NH7DVG/bundle.json","state_url":"https://pith.science/pith/A4N2EMBSTTSDD5HO4VZ2NH7DVG/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/A4N2EMBSTTSDD5HO4VZ2NH7DVG/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-07-05T05:12:27Z","links":{"resolver":"https://pith.science/pith/A4N2EMBSTTSDD5HO4VZ2NH7DVG","bundle":"https://pith.science/pith/A4N2EMBSTTSDD5HO4VZ2NH7DVG/bundle.json","state":"https://pith.science/pith/A4N2EMBSTTSDD5HO4VZ2NH7DVG/state.json","well_known_bundle":"https://pith.science/.well-known/pith/A4N2EMBSTTSDD5HO4VZ2NH7DVG/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:A4N2EMBSTTSDD5HO4VZ2NH7DVG","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":"b407faa2579b8a6badab5d4c3f682f57621640ed42bc223dfe24b397d96196fe","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2018-09-27T15:45:20Z","title_canon_sha256":"8b52ae1b3115326c2c9218ca13e2f7db058b0a1a461bc26b372a9ed58baba1b2"},"schema_version":"1.0","source":{"id":"1809.10585","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1809.10585","created_at":"2026-05-18T00:04:38Z"},{"alias_kind":"arxiv_version","alias_value":"1809.10585v1","created_at":"2026-05-18T00:04:38Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1809.10585","created_at":"2026-05-18T00:04:38Z"},{"alias_kind":"pith_short_12","alias_value":"A4N2EMBSTTSD","created_at":"2026-05-18T12:32:13Z"},{"alias_kind":"pith_short_16","alias_value":"A4N2EMBSTTSDD5HO","created_at":"2026-05-18T12:32:13Z"},{"alias_kind":"pith_short_8","alias_value":"A4N2EMBS","created_at":"2026-05-18T12:32:13Z"}],"graph_snapshots":[{"event_id":"sha256:631e79a1b7e3dfafebaaf3d4030c39189711e2f772f1b52a8c9d5cfaf6f29a20","target":"graph","created_at":"2026-05-18T00:04:38Z","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 efficient and accurate QR decomposition for matrices with hierarchical low-rank structures, such as HODLR and hierarchical matrices, has been challenging. Existing structure-exploiting algorithms are prone to numerical instability as they proceed indirectly, via Cholesky decompositions or a block Gram-Schmidt procedure. For a highly ill-conditioned matrix, such approaches either break down in finite-precision arithmetic or result in significant loss of orthogonality. Although these issues can sometimes be addressed by regularization and iterative refinement, it would be more desirable to h","authors_text":"Ana Susnjara, Daniel Kressner","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2018-09-27T15:45:20Z","title":"Fast QR decomposition of HODLR matrices"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1809.10585","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:d55473bec4838ea998f0521d64141d0ab60c932758d524d96665025b90609f2e","target":"record","created_at":"2026-05-18T00:04:38Z","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":"b407faa2579b8a6badab5d4c3f682f57621640ed42bc223dfe24b397d96196fe","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2018-09-27T15:45:20Z","title_canon_sha256":"8b52ae1b3115326c2c9218ca13e2f7db058b0a1a461bc26b372a9ed58baba1b2"},"schema_version":"1.0","source":{"id":"1809.10585","kind":"arxiv","version":1}},"canonical_sha256":"071ba230329ce431f4eee573a69fe3a9ba9e1982725f89a7a1612d3da05077fe","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"071ba230329ce431f4eee573a69fe3a9ba9e1982725f89a7a1612d3da05077fe","first_computed_at":"2026-05-18T00:04:38.040023Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:04:38.040023Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"y9Gt3UujsMe9K4tEnHFX28VbrXcR/nBvDkPllRwuofz2hzzAp5EZqQ5CDJKUDl9QZc9XyT3ht8sL9BdzOu8cBQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:04:38.040460Z","signed_message":"canonical_sha256_bytes"},"source_id":"1809.10585","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:d55473bec4838ea998f0521d64141d0ab60c932758d524d96665025b90609f2e","sha256:631e79a1b7e3dfafebaaf3d4030c39189711e2f772f1b52a8c9d5cfaf6f29a20"],"state_sha256":"dea9a71288d6173aa6845030bf46997ca4cf68ffd58fec711803f706cdd56b9b"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"LIHyIsEa6RATfwYgurNqQ5BqecoDB/m0nWQMZF4DghTehv04DJl+ywgS14mB5WfMWSAc45NlWWa1Spgo1WwYBw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-05T05:12:27.128207Z","bundle_sha256":"909ab74797edb5a3974ad992ac62da4ca74ec950737d6f717e0892e895dd82c4"}}