{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:YY5LMGF5XT2DM7IQPZK3PW3MPM","short_pith_number":"pith:YY5LMGF5","schema_version":"1.0","canonical_sha256":"c63ab618bdbcf4367d107e55b7db6c7b024a429d646767bed53eca9dd3862c4c","source":{"kind":"arxiv","id":"1405.0223","version":2},"attestation_state":"computed","paper":{"title":"Fast symmetric factorization of hierarchical matrices with applications","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.NA","physics.flu-dyn","stat.CO"],"primary_cat":"math.NA","authors_text":"Karan Raj Singh, Michael O'Neil, Sivaram Ambikasaran","submitted_at":"2014-05-01T17:18:17Z","abstract_excerpt":"We present a fast direct algorithm for computing symmetric factorizations, i.e. $A = WW^T$, of symmetric positive-definite hierarchical matrices with weak-admissibility conditions. The computational cost for the symmetric factorization scales as $\\mathcal{O}(n \\log^2 n)$ for hierarchically off-diagonal low-rank matrices. Once this factorization is obtained, the cost for inversion, application, and determinant computation scales as $\\mathcal{O}(n \\log n)$. In particular, this allows for the near optimal generation of correlated random variates in the case where $A$ is a covariance matrix. This "},"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":"1405.0223","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2014-05-01T17:18:17Z","cross_cats_sorted":["cs.NA","physics.flu-dyn","stat.CO"],"title_canon_sha256":"0842533d0d93f99b0625d5ac0066cb78d44ac3751f3544352612248b779ce153","abstract_canon_sha256":"8452215e9d539112a97d108f4668cdf16efe71c71fcba2a03a3b745cca9be375"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:53:45.654118Z","signature_b64":"DzEnCk9YzNXmTNFv3Zteb5l73yPh4Mw9QNfkybn4XrOW8TIhNOoNTgDJGNduVP2zQ7aopiMgjqE5HNLvs3FqDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c63ab618bdbcf4367d107e55b7db6c7b024a429d646767bed53eca9dd3862c4c","last_reissued_at":"2026-05-18T00:53:45.653558Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:53:45.653558Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Fast symmetric factorization of hierarchical matrices with applications","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.NA","physics.flu-dyn","stat.CO"],"primary_cat":"math.NA","authors_text":"Karan Raj Singh, Michael O'Neil, Sivaram Ambikasaran","submitted_at":"2014-05-01T17:18:17Z","abstract_excerpt":"We present a fast direct algorithm for computing symmetric factorizations, i.e. $A = WW^T$, of symmetric positive-definite hierarchical matrices with weak-admissibility conditions. The computational cost for the symmetric factorization scales as $\\mathcal{O}(n \\log^2 n)$ for hierarchically off-diagonal low-rank matrices. Once this factorization is obtained, the cost for inversion, application, and determinant computation scales as $\\mathcal{O}(n \\log n)$. In particular, this allows for the near optimal generation of correlated random variates in the case where $A$ is a covariance matrix. This "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1405.0223","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":""},"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":"1405.0223","created_at":"2026-05-18T00:53:45.653647+00:00"},{"alias_kind":"arxiv_version","alias_value":"1405.0223v2","created_at":"2026-05-18T00:53:45.653647+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1405.0223","created_at":"2026-05-18T00:53:45.653647+00:00"},{"alias_kind":"pith_short_12","alias_value":"YY5LMGF5XT2D","created_at":"2026-05-18T12:28:59.999130+00:00"},{"alias_kind":"pith_short_16","alias_value":"YY5LMGF5XT2DM7IQ","created_at":"2026-05-18T12:28:59.999130+00:00"},{"alias_kind":"pith_short_8","alias_value":"YY5LMGF5","created_at":"2026-05-18T12:28:59.999130+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":12,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/YY5LMGF5XT2DM7IQPZK3PW3MPM","json":"https://pith.science/pith/YY5LMGF5XT2DM7IQPZK3PW3MPM.json","graph_json":"https://pith.science/api/pith-number/YY5LMGF5XT2DM7IQPZK3PW3MPM/graph.json","events_json":"https://pith.science/api/pith-number/YY5LMGF5XT2DM7IQPZK3PW3MPM/events.json","paper":"https://pith.science/paper/YY5LMGF5"},"agent_actions":{"view_html":"https://pith.science/pith/YY5LMGF5XT2DM7IQPZK3PW3MPM","download_json":"https://pith.science/pith/YY5LMGF5XT2DM7IQPZK3PW3MPM.json","view_paper":"https://pith.science/paper/YY5LMGF5","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1405.0223&json=true","fetch_graph":"https://pith.science/api/pith-number/YY5LMGF5XT2DM7IQPZK3PW3MPM/graph.json","fetch_events":"https://pith.science/api/pith-number/YY5LMGF5XT2DM7IQPZK3PW3MPM/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/YY5LMGF5XT2DM7IQPZK3PW3MPM/action/timestamp_anchor","attest_storage":"https://pith.science/pith/YY5LMGF5XT2DM7IQPZK3PW3MPM/action/storage_attestation","attest_author":"https://pith.science/pith/YY5LMGF5XT2DM7IQPZK3PW3MPM/action/author_attestation","sign_citation":"https://pith.science/pith/YY5LMGF5XT2DM7IQPZK3PW3MPM/action/citation_signature","submit_replication":"https://pith.science/pith/YY5LMGF5XT2DM7IQPZK3PW3MPM/action/replication_record"}},"created_at":"2026-05-18T00:53:45.653647+00:00","updated_at":"2026-05-18T00:53:45.653647+00:00"}