{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:YY5LMGF5XT2DM7IQPZK3PW3MPM","short_pith_number":"pith:YY5LMGF5","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"},"canonical_sha256":"c63ab618bdbcf4367d107e55b7db6c7b024a429d646767bed53eca9dd3862c4c","source":{"kind":"arxiv","id":"1405.0223","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1405.0223","created_at":"2026-05-18T00:53:45Z"},{"alias_kind":"arxiv_version","alias_value":"1405.0223v2","created_at":"2026-05-18T00:53:45Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1405.0223","created_at":"2026-05-18T00:53:45Z"},{"alias_kind":"pith_short_12","alias_value":"YY5LMGF5XT2D","created_at":"2026-05-18T12:28:59Z"},{"alias_kind":"pith_short_16","alias_value":"YY5LMGF5XT2DM7IQ","created_at":"2026-05-18T12:28:59Z"},{"alias_kind":"pith_short_8","alias_value":"YY5LMGF5","created_at":"2026-05-18T12:28:59Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:YY5LMGF5XT2DM7IQPZK3PW3MPM","target":"record","payload":{"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"},"canonical_sha256":"c63ab618bdbcf4367d107e55b7db6c7b024a429d646767bed53eca9dd3862c4c","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"},"source_kind":"arxiv","source_id":"1405.0223","source_version":2,"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:53:45Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"iS6ahnl3+kQ0Oa2ikcm5kub+qPTOAzdlcKwj2nNdg9FfSPU568SfMxcPQcHdXhVaiTn+lxnFRKzo2BYZx53OBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T14:48:49.337905Z"},"content_sha256":"410b984826606b902cda803e55d36f74310b9960242658caad022c7bb8c46b84","schema_version":"1.0","event_id":"sha256:410b984826606b902cda803e55d36f74310b9960242658caad022c7bb8c46b84"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:YY5LMGF5XT2DM7IQPZK3PW3MPM","target":"graph","payload":{"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"},"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:53:45Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"etn5MJUfnLZyWH8ZJIwUs5xBbfbV+0kB7FIJHEXO8MDCls/SOGuqcbzinjHw/24JpnjouHRQmFBFrkGE2mKXAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T14:48:49.338258Z"},"content_sha256":"0e7a0b2f549b99f465b94e4565558d6fe910673fed91d7118c851b452415e261","schema_version":"1.0","event_id":"sha256:0e7a0b2f549b99f465b94e4565558d6fe910673fed91d7118c851b452415e261"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/YY5LMGF5XT2DM7IQPZK3PW3MPM/bundle.json","state_url":"https://pith.science/pith/YY5LMGF5XT2DM7IQPZK3PW3MPM/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/YY5LMGF5XT2DM7IQPZK3PW3MPM/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-06-03T14:48:49Z","links":{"resolver":"https://pith.science/pith/YY5LMGF5XT2DM7IQPZK3PW3MPM","bundle":"https://pith.science/pith/YY5LMGF5XT2DM7IQPZK3PW3MPM/bundle.json","state":"https://pith.science/pith/YY5LMGF5XT2DM7IQPZK3PW3MPM/state.json","well_known_bundle":"https://pith.science/.well-known/pith/YY5LMGF5XT2DM7IQPZK3PW3MPM/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:YY5LMGF5XT2DM7IQPZK3PW3MPM","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":"8452215e9d539112a97d108f4668cdf16efe71c71fcba2a03a3b745cca9be375","cross_cats_sorted":["cs.NA","physics.flu-dyn","stat.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2014-05-01T17:18:17Z","title_canon_sha256":"0842533d0d93f99b0625d5ac0066cb78d44ac3751f3544352612248b779ce153"},"schema_version":"1.0","source":{"id":"1405.0223","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1405.0223","created_at":"2026-05-18T00:53:45Z"},{"alias_kind":"arxiv_version","alias_value":"1405.0223v2","created_at":"2026-05-18T00:53:45Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1405.0223","created_at":"2026-05-18T00:53:45Z"},{"alias_kind":"pith_short_12","alias_value":"YY5LMGF5XT2D","created_at":"2026-05-18T12:28:59Z"},{"alias_kind":"pith_short_16","alias_value":"YY5LMGF5XT2DM7IQ","created_at":"2026-05-18T12:28:59Z"},{"alias_kind":"pith_short_8","alias_value":"YY5LMGF5","created_at":"2026-05-18T12:28:59Z"}],"graph_snapshots":[{"event_id":"sha256:0e7a0b2f549b99f465b94e4565558d6fe910673fed91d7118c851b452415e261","target":"graph","created_at":"2026-05-18T00:53:45Z","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":"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 ","authors_text":"Karan Raj Singh, Michael O'Neil, Sivaram Ambikasaran","cross_cats":["cs.NA","physics.flu-dyn","stat.CO"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2014-05-01T17:18:17Z","title":"Fast symmetric factorization of hierarchical matrices with applications"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1405.0223","kind":"arxiv","version":2},"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:410b984826606b902cda803e55d36f74310b9960242658caad022c7bb8c46b84","target":"record","created_at":"2026-05-18T00:53:45Z","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":"8452215e9d539112a97d108f4668cdf16efe71c71fcba2a03a3b745cca9be375","cross_cats_sorted":["cs.NA","physics.flu-dyn","stat.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2014-05-01T17:18:17Z","title_canon_sha256":"0842533d0d93f99b0625d5ac0066cb78d44ac3751f3544352612248b779ce153"},"schema_version":"1.0","source":{"id":"1405.0223","kind":"arxiv","version":2}},"canonical_sha256":"c63ab618bdbcf4367d107e55b7db6c7b024a429d646767bed53eca9dd3862c4c","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"c63ab618bdbcf4367d107e55b7db6c7b024a429d646767bed53eca9dd3862c4c","first_computed_at":"2026-05-18T00:53:45.653558Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:53:45.653558Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"DzEnCk9YzNXmTNFv3Zteb5l73yPh4Mw9QNfkybn4XrOW8TIhNOoNTgDJGNduVP2zQ7aopiMgjqE5HNLvs3FqDA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:53:45.654118Z","signed_message":"canonical_sha256_bytes"},"source_id":"1405.0223","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:410b984826606b902cda803e55d36f74310b9960242658caad022c7bb8c46b84","sha256:0e7a0b2f549b99f465b94e4565558d6fe910673fed91d7118c851b452415e261"],"state_sha256":"ced0baf9c7b30d2653bc8d1c7b6f53f4fb705d6df6b635428fc74e87dc6e5ee8"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"HsjQJBxB9lRm2QlHXqrdv2GW5EvDAxLfmed20m393bIkDAsEu+badTjNDKoWXUtlbMeytzqbTHBD2BptrILvDw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-03T14:48:49.340444Z","bundle_sha256":"24f21b5d0c4f147718b703d48f4d0c32aaddce06218dd1b64215150e0a39c632"}}