{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:J3GDWA3PTB3XN2XBTL3SBGMQMS","short_pith_number":"pith:J3GDWA3P","schema_version":"1.0","canonical_sha256":"4ecc3b036f987776eae19af7209990648b526c33c828cf0dbd9432b754248e69","source":{"kind":"arxiv","id":"2605.02574","version":2},"attestation_state":"computed","paper":{"title":"Fast and accurate conditioning for large-scale and online Gaussian process prediction problems","license":"http://creativecommons.org/licenses/by/4.0/","headline":"Conditioning on a small number of carefully designed linear combinations of observations recovers machine-precision exact conditional distributions for Gaussian process prediction.","cross_cats":["cs.NA","math.NA","stat.ME"],"primary_cat":"stat.CO","authors_text":"Christopher J. Geoga, Samanyu Arora","submitted_at":"2026-05-04T13:29:09Z","abstract_excerpt":"Gaussian Process (GP) models provide a flexible framework for prediction and uncertainty quantification. For most covariance functions, however, exact GP prediction with $n$ points scales as $\\mathcal{O}(n^3)$, making it prohibitively expensive for large datasets or large numbers of prediction points. While nearest neighbor-based prediction can work well in certain settings, non-pathological circumstances (for example measurement noise) can severely restrict its efficiency. This work presents a complementary approach where one conditions on carefully designed linear combinations of data, which"},"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":"2605.02574","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"stat.CO","submitted_at":"2026-05-04T13:29:09Z","cross_cats_sorted":["cs.NA","math.NA","stat.ME"],"title_canon_sha256":"9bcf208cdd62a13bfc196ae8049b969e116f1d51aa5fce813bcd7840c5acf7ba","abstract_canon_sha256":"cd4991c15cecc8a5db453dfa3ffb0845aefc933ecab835cc5992f14c4ec8b6a7"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-29T01:05:11.466815Z","signature_b64":"K2PxoWtnlfrWCV4sG6+kPLn8k7QMafQbVGFL2Qfc3YxE79ygolM3TPwVLeNZ/3SsbAPClGm3nZBtm7tzmGJqCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"4ecc3b036f987776eae19af7209990648b526c33c828cf0dbd9432b754248e69","last_reissued_at":"2026-05-29T01:05:11.466163Z","signature_status":"signed_v1","first_computed_at":"2026-05-29T01:05:11.466163Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Fast and accurate conditioning for large-scale and online Gaussian process prediction problems","license":"http://creativecommons.org/licenses/by/4.0/","headline":"Conditioning on a small number of carefully designed linear combinations of observations recovers machine-precision exact conditional distributions for Gaussian process prediction.","cross_cats":["cs.NA","math.NA","stat.ME"],"primary_cat":"stat.CO","authors_text":"Christopher J. Geoga, Samanyu Arora","submitted_at":"2026-05-04T13:29:09Z","abstract_excerpt":"Gaussian Process (GP) models provide a flexible framework for prediction and uncertainty quantification. For most covariance functions, however, exact GP prediction with $n$ points scales as $\\mathcal{O}(n^3)$, making it prohibitively expensive for large datasets or large numbers of prediction points. While nearest neighbor-based prediction can work well in certain settings, non-pathological circumstances (for example measurement noise) can severely restrict its efficiency. This work presents a complementary approach where one conditions on carefully designed linear combinations of data, which"},"claims":{"count":4,"items":[{"kind":"strongest_claim","text":"For kernel functions that are smooth away from the origin, conditioning on a small number r of such data contrasts can be machine-precision accurate for the full exact conditional distributions.","source":"verdict.strongest_claim","status":"machine_extracted","claim_id":"C1","attestation":"unclaimed"},{"kind":"weakest_assumption","text":"The kernel functions are smooth away from the origin and that the linear combinations (contrasts) can be carefully designed to achieve the claimed accuracy and efficiency.","source":"verdict.weakest_assumption","status":"machine_extracted","claim_id":"C2","attestation":"unclaimed"},{"kind":"one_line_summary","text":"Conditioning on a small number of carefully designed linear combinations of data enables machine-precision accurate Gaussian process predictions at low cost for large-scale and online problems.","source":"verdict.one_line_summary","status":"machine_extracted","claim_id":"C3","attestation":"unclaimed"},{"kind":"headline","text":"Conditioning on a small number of carefully designed linear combinations of observations recovers machine-precision exact conditional distributions for Gaussian process prediction.","source":"verdict.pith_extraction.headline","status":"machine_extracted","claim_id":"C4","attestation":"unclaimed"}],"snapshot_sha256":"901d94a20d3858daa90828e653ed57039023bbd494fe4e01983144deda87539d"},"source":{"id":"2605.02574","kind":"arxiv","version":2},"verdict":{"id":"3869d112-3db5-4a74-b4a1-f3d411afd67f","model_set":{"reader":"grok-4.3"},"created_at":"2026-05-08T01:43:05.842240Z","strongest_claim":"For kernel functions that are smooth away from the origin, conditioning on a small number r of such data contrasts can be machine-precision accurate for the full exact conditional distributions.","one_line_summary":"Conditioning on a small number of carefully designed linear combinations of data enables machine-precision accurate Gaussian process predictions at low cost for large-scale and online problems.","pipeline_version":"pith-pipeline@v0.9.0","weakest_assumption":"The kernel functions are smooth away from the origin and that the linear combinations (contrasts) can be carefully designed to achieve the claimed accuracy and efficiency.","pith_extraction_headline":"Conditioning on a small number of carefully designed linear combinations of observations recovers machine-precision exact conditional distributions for Gaussian process prediction."},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2605.02574/integrity.json","findings":[],"available":true,"detectors_run":[{"name":"ai_meta_artifact","ran_at":"2026-05-20T15:38:43.510910Z","status":"completed","version":"1.0.0","findings_count":0},{"name":"doi_title_agreement","ran_at":"2026-05-20T03:01:22.396445Z","status":"completed","version":"1.0.0","findings_count":0},{"name":"doi_compliance","ran_at":"2026-05-19T16:14:37.482198Z","status":"completed","version":"1.0.0","findings_count":0}],"snapshot_sha256":"6ac6c9d575d41ebe7802606e8e8acd107015d8ef070a50a03fa1fcc5a397b687"},"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":"2605.02574","created_at":"2026-05-29T01:05:11.466244+00:00"},{"alias_kind":"arxiv_version","alias_value":"2605.02574v2","created_at":"2026-05-29T01:05:11.466244+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.02574","created_at":"2026-05-29T01:05:11.466244+00:00"},{"alias_kind":"pith_short_12","alias_value":"J3GDWA3PTB3X","created_at":"2026-05-29T01:05:11.466244+00:00"},{"alias_kind":"pith_short_16","alias_value":"J3GDWA3PTB3XN2XB","created_at":"2026-05-29T01:05:11.466244+00:00"},{"alias_kind":"pith_short_8","alias_value":"J3GDWA3P","created_at":"2026-05-29T01:05:11.466244+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/J3GDWA3PTB3XN2XBTL3SBGMQMS","json":"https://pith.science/pith/J3GDWA3PTB3XN2XBTL3SBGMQMS.json","graph_json":"https://pith.science/api/pith-number/J3GDWA3PTB3XN2XBTL3SBGMQMS/graph.json","events_json":"https://pith.science/api/pith-number/J3GDWA3PTB3XN2XBTL3SBGMQMS/events.json","paper":"https://pith.science/paper/J3GDWA3P"},"agent_actions":{"view_html":"https://pith.science/pith/J3GDWA3PTB3XN2XBTL3SBGMQMS","download_json":"https://pith.science/pith/J3GDWA3PTB3XN2XBTL3SBGMQMS.json","view_paper":"https://pith.science/paper/J3GDWA3P","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2605.02574&json=true","fetch_graph":"https://pith.science/api/pith-number/J3GDWA3PTB3XN2XBTL3SBGMQMS/graph.json","fetch_events":"https://pith.science/api/pith-number/J3GDWA3PTB3XN2XBTL3SBGMQMS/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/J3GDWA3PTB3XN2XBTL3SBGMQMS/action/timestamp_anchor","attest_storage":"https://pith.science/pith/J3GDWA3PTB3XN2XBTL3SBGMQMS/action/storage_attestation","attest_author":"https://pith.science/pith/J3GDWA3PTB3XN2XBTL3SBGMQMS/action/author_attestation","sign_citation":"https://pith.science/pith/J3GDWA3PTB3XN2XBTL3SBGMQMS/action/citation_signature","submit_replication":"https://pith.science/pith/J3GDWA3PTB3XN2XBTL3SBGMQMS/action/replication_record"}},"created_at":"2026-05-29T01:05:11.466244+00:00","updated_at":"2026-05-29T01:05:11.466244+00:00"}