{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:DTZ7HJYS4WHYEDX7K336F7XV3B","short_pith_number":"pith:DTZ7HJYS","schema_version":"1.0","canonical_sha256":"1cf3f3a712e58f820eff56f7e2fef5d866cf2ae4f150501a5694482dbfbbd26c","source":{"kind":"arxiv","id":"1602.07527","version":1},"attestation_state":"computed","paper":{"title":"Differentiation of the Cholesky decomposition","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.MS"],"primary_cat":"stat.CO","authors_text":"Iain Murray","submitted_at":"2016-02-24T14:35:31Z","abstract_excerpt":"We review strategies for differentiating matrix-based computations, and derive symbolic and algorithmic update rules for differentiating expressions containing the Cholesky decomposition. We recommend new `blocked' algorithms, based on differentiating the Cholesky algorithm DPOTRF in the LAPACK library, which uses `Level 3' matrix-matrix operations from BLAS, and so is cache-friendly and easy to parallelize. For large matrices, the resulting algorithms are the fastest way to compute Cholesky derivatives, and are an order of magnitude faster than the algorithms in common usage. In some computin"},"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":"1602.07527","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.CO","submitted_at":"2016-02-24T14:35:31Z","cross_cats_sorted":["cs.MS"],"title_canon_sha256":"a69509b725f3e63f47cc6cf8cdf6c48dd4f47939566d79b0ff306f3a161a9556","abstract_canon_sha256":"1252d6d7e903f3ba608215f2008d159774454e4ebe50ba0656c5f1907eff400f"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:20:02.780160Z","signature_b64":"FJ2/YJPGFu4SROOiy3VmCIoa/uhqewqL7T4nG1n/38aclYeDUvgGb/aObFWe2NYKdsfBjVGylF8N0oO7kdFKAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1cf3f3a712e58f820eff56f7e2fef5d866cf2ae4f150501a5694482dbfbbd26c","last_reissued_at":"2026-05-18T01:20:02.779517Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:20:02.779517Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Differentiation of the Cholesky decomposition","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.MS"],"primary_cat":"stat.CO","authors_text":"Iain Murray","submitted_at":"2016-02-24T14:35:31Z","abstract_excerpt":"We review strategies for differentiating matrix-based computations, and derive symbolic and algorithmic update rules for differentiating expressions containing the Cholesky decomposition. We recommend new `blocked' algorithms, based on differentiating the Cholesky algorithm DPOTRF in the LAPACK library, which uses `Level 3' matrix-matrix operations from BLAS, and so is cache-friendly and easy to parallelize. For large matrices, the resulting algorithms are the fastest way to compute Cholesky derivatives, and are an order of magnitude faster than the algorithms in common usage. In some computin"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1602.07527","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":"1602.07527","created_at":"2026-05-18T01:20:02.779614+00:00"},{"alias_kind":"arxiv_version","alias_value":"1602.07527v1","created_at":"2026-05-18T01:20:02.779614+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1602.07527","created_at":"2026-05-18T01:20:02.779614+00:00"},{"alias_kind":"pith_short_12","alias_value":"DTZ7HJYS4WHY","created_at":"2026-05-18T12:30:12.583610+00:00"},{"alias_kind":"pith_short_16","alias_value":"DTZ7HJYS4WHYEDX7","created_at":"2026-05-18T12:30:12.583610+00:00"},{"alias_kind":"pith_short_8","alias_value":"DTZ7HJYS","created_at":"2026-05-18T12:30:12.583610+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":3,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2605.18704","citing_title":"Learned Memory Attenuation in Sage-Husa Kalman Filters for Robust UAV State Estimation","ref_index":43,"is_internal_anchor":true},{"citing_arxiv_id":"2605.08864","citing_title":"Higher-Order Equilibrium Tracking for EM-Compressible Online Estimation","ref_index":16,"is_internal_anchor":false},{"citing_arxiv_id":"2605.06392","citing_title":"ADELIA: Automatic Differentiation for Efficient Laplace Inference Approximations","ref_index":22,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/DTZ7HJYS4WHYEDX7K336F7XV3B","json":"https://pith.science/pith/DTZ7HJYS4WHYEDX7K336F7XV3B.json","graph_json":"https://pith.science/api/pith-number/DTZ7HJYS4WHYEDX7K336F7XV3B/graph.json","events_json":"https://pith.science/api/pith-number/DTZ7HJYS4WHYEDX7K336F7XV3B/events.json","paper":"https://pith.science/paper/DTZ7HJYS"},"agent_actions":{"view_html":"https://pith.science/pith/DTZ7HJYS4WHYEDX7K336F7XV3B","download_json":"https://pith.science/pith/DTZ7HJYS4WHYEDX7K336F7XV3B.json","view_paper":"https://pith.science/paper/DTZ7HJYS","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1602.07527&json=true","fetch_graph":"https://pith.science/api/pith-number/DTZ7HJYS4WHYEDX7K336F7XV3B/graph.json","fetch_events":"https://pith.science/api/pith-number/DTZ7HJYS4WHYEDX7K336F7XV3B/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/DTZ7HJYS4WHYEDX7K336F7XV3B/action/timestamp_anchor","attest_storage":"https://pith.science/pith/DTZ7HJYS4WHYEDX7K336F7XV3B/action/storage_attestation","attest_author":"https://pith.science/pith/DTZ7HJYS4WHYEDX7K336F7XV3B/action/author_attestation","sign_citation":"https://pith.science/pith/DTZ7HJYS4WHYEDX7K336F7XV3B/action/citation_signature","submit_replication":"https://pith.science/pith/DTZ7HJYS4WHYEDX7K336F7XV3B/action/replication_record"}},"created_at":"2026-05-18T01:20:02.779614+00:00","updated_at":"2026-05-18T01:20:02.779614+00:00"}