{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:A4N2EMBSTTSDD5HO4VZ2NH7DVG","short_pith_number":"pith:A4N2EMBS","schema_version":"1.0","canonical_sha256":"071ba230329ce431f4eee573a69fe3a9ba9e1982725f89a7a1612d3da05077fe","source":{"kind":"arxiv","id":"1809.10585","version":1},"attestation_state":"computed","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"},"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":"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1809.10585","created_at":"2026-05-18T00:04:38.040094+00:00"},{"alias_kind":"arxiv_version","alias_value":"1809.10585v1","created_at":"2026-05-18T00:04:38.040094+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1809.10585","created_at":"2026-05-18T00:04:38.040094+00:00"},{"alias_kind":"pith_short_12","alias_value":"A4N2EMBSTTSD","created_at":"2026-05-18T12:32:13.499390+00:00"},{"alias_kind":"pith_short_16","alias_value":"A4N2EMBSTTSDD5HO","created_at":"2026-05-18T12:32:13.499390+00:00"},{"alias_kind":"pith_short_8","alias_value":"A4N2EMBS","created_at":"2026-05-18T12:32:13.499390+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2602.14289","citing_title":"Parallel Sparse and Data-Sparse Factorization-based Linear Solvers","ref_index":120,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/A4N2EMBSTTSDD5HO4VZ2NH7DVG","json":"https://pith.science/pith/A4N2EMBSTTSDD5HO4VZ2NH7DVG.json","graph_json":"https://pith.science/api/pith-number/A4N2EMBSTTSDD5HO4VZ2NH7DVG/graph.json","events_json":"https://pith.science/api/pith-number/A4N2EMBSTTSDD5HO4VZ2NH7DVG/events.json","paper":"https://pith.science/paper/A4N2EMBS"},"agent_actions":{"view_html":"https://pith.science/pith/A4N2EMBSTTSDD5HO4VZ2NH7DVG","download_json":"https://pith.science/pith/A4N2EMBSTTSDD5HO4VZ2NH7DVG.json","view_paper":"https://pith.science/paper/A4N2EMBS","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1809.10585&json=true","fetch_graph":"https://pith.science/api/pith-number/A4N2EMBSTTSDD5HO4VZ2NH7DVG/graph.json","fetch_events":"https://pith.science/api/pith-number/A4N2EMBSTTSDD5HO4VZ2NH7DVG/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/A4N2EMBSTTSDD5HO4VZ2NH7DVG/action/timestamp_anchor","attest_storage":"https://pith.science/pith/A4N2EMBSTTSDD5HO4VZ2NH7DVG/action/storage_attestation","attest_author":"https://pith.science/pith/A4N2EMBSTTSDD5HO4VZ2NH7DVG/action/author_attestation","sign_citation":"https://pith.science/pith/A4N2EMBSTTSDD5HO4VZ2NH7DVG/action/citation_signature","submit_replication":"https://pith.science/pith/A4N2EMBSTTSDD5HO4VZ2NH7DVG/action/replication_record"}},"created_at":"2026-05-18T00:04:38.040094+00:00","updated_at":"2026-05-18T00:04:38.040094+00:00"}