{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2023:RTCBDBJM5V5CNKMTIVEVOUNZK3","short_pith_number":"pith:RTCBDBJM","schema_version":"1.0","canonical_sha256":"8cc411852ced7a26a99345495751b956f62afc46dce53078a5aeb7401cbbdac1","source":{"kind":"arxiv","id":"2307.11648","version":2},"attestation_state":"computed","paper":{"title":"Sparse inverse Cholesky factorization of dense kernel matrices by greedy conditional selection","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.NA","math.NA"],"primary_cat":"stat.CO","authors_text":"Florian Sch\\\"afer, Houman Owhadi, Joseph Guinness, Matthias Katzfuss, Stephen Huan","submitted_at":"2023-07-21T15:27:17Z","abstract_excerpt":"Dense kernel matrices resulting from pairwise evaluations of a kernel function arise naturally in machine learning and statistics. Previous work in constructing sparse approximate inverse Cholesky factors of such matrices by minimizing Kullback-Leibler divergence recovers the Vecchia approximation for Gaussian processes. These methods rely only on the geometry of the evaluation points to construct the sparsity pattern. In this work, we instead construct the sparsity pattern by leveraging a greedy selection algorithm that maximizes mutual information with target points, conditional on all point"},"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":"2307.11648","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.CO","submitted_at":"2023-07-21T15:27:17Z","cross_cats_sorted":["cs.NA","math.NA"],"title_canon_sha256":"a30cf3b76168a1c62feb3b65d6222d0be88575f19513864b297ba37016ae2d8b","abstract_canon_sha256":"3e1715bff67a39a342fdc2ad5820cd1e45a5206eb3dca690b6b80fa7033a6c24"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:00:34.911495Z","signature_b64":"bt8y7EdOe+Kl/eW3VlhGLhJzC7V5lfE/62j1wCoAk33emtOXkqLOPmXIUanE0TnK8IdBt+guRMxz4xldQl8eBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8cc411852ced7a26a99345495751b956f62afc46dce53078a5aeb7401cbbdac1","last_reissued_at":"2026-07-05T11:00:34.910985Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:00:34.910985Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Sparse inverse Cholesky factorization of dense kernel matrices by greedy conditional selection","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.NA","math.NA"],"primary_cat":"stat.CO","authors_text":"Florian Sch\\\"afer, Houman Owhadi, Joseph Guinness, Matthias Katzfuss, Stephen Huan","submitted_at":"2023-07-21T15:27:17Z","abstract_excerpt":"Dense kernel matrices resulting from pairwise evaluations of a kernel function arise naturally in machine learning and statistics. Previous work in constructing sparse approximate inverse Cholesky factors of such matrices by minimizing Kullback-Leibler divergence recovers the Vecchia approximation for Gaussian processes. These methods rely only on the geometry of the evaluation points to construct the sparsity pattern. In this work, we instead construct the sparsity pattern by leveraging a greedy selection algorithm that maximizes mutual information with target points, conditional on all point"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2307.11648","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2307.11648/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"2307.11648","created_at":"2026-07-05T11:00:34.911044+00:00"},{"alias_kind":"arxiv_version","alias_value":"2307.11648v2","created_at":"2026-07-05T11:00:34.911044+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2307.11648","created_at":"2026-07-05T11:00:34.911044+00:00"},{"alias_kind":"pith_short_12","alias_value":"RTCBDBJM5V5C","created_at":"2026-07-05T11:00:34.911044+00:00"},{"alias_kind":"pith_short_16","alias_value":"RTCBDBJM5V5CNKMT","created_at":"2026-07-05T11:00:34.911044+00:00"},{"alias_kind":"pith_short_8","alias_value":"RTCBDBJM","created_at":"2026-07-05T11:00:34.911044+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/RTCBDBJM5V5CNKMTIVEVOUNZK3","json":"https://pith.science/pith/RTCBDBJM5V5CNKMTIVEVOUNZK3.json","graph_json":"https://pith.science/api/pith-number/RTCBDBJM5V5CNKMTIVEVOUNZK3/graph.json","events_json":"https://pith.science/api/pith-number/RTCBDBJM5V5CNKMTIVEVOUNZK3/events.json","paper":"https://pith.science/paper/RTCBDBJM"},"agent_actions":{"view_html":"https://pith.science/pith/RTCBDBJM5V5CNKMTIVEVOUNZK3","download_json":"https://pith.science/pith/RTCBDBJM5V5CNKMTIVEVOUNZK3.json","view_paper":"https://pith.science/paper/RTCBDBJM","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2307.11648&json=true","fetch_graph":"https://pith.science/api/pith-number/RTCBDBJM5V5CNKMTIVEVOUNZK3/graph.json","fetch_events":"https://pith.science/api/pith-number/RTCBDBJM5V5CNKMTIVEVOUNZK3/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/RTCBDBJM5V5CNKMTIVEVOUNZK3/action/timestamp_anchor","attest_storage":"https://pith.science/pith/RTCBDBJM5V5CNKMTIVEVOUNZK3/action/storage_attestation","attest_author":"https://pith.science/pith/RTCBDBJM5V5CNKMTIVEVOUNZK3/action/author_attestation","sign_citation":"https://pith.science/pith/RTCBDBJM5V5CNKMTIVEVOUNZK3/action/citation_signature","submit_replication":"https://pith.science/pith/RTCBDBJM5V5CNKMTIVEVOUNZK3/action/replication_record"}},"created_at":"2026-07-05T11:00:34.911044+00:00","updated_at":"2026-07-05T11:00:34.911044+00:00"}