{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:6A3LQJNSU44E27WHSQL2MRPQXH","short_pith_number":"pith:6A3LQJNS","schema_version":"1.0","canonical_sha256":"f036b825b2a7384d7ec79417a645f0b9c3115f3fe523eeae916ac35eb99dc0da","source":{"kind":"arxiv","id":"1807.03369","version":1},"attestation_state":"computed","paper":{"title":"Ensemble Kalman Filtering for Online Gaussian Process Regression and Learning","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"stat.ML","authors_text":"Danil Kuzin, Le Yang, Lyudmila Mihaylova, Olga Isupova","submitted_at":"2018-07-09T20:20:20Z","abstract_excerpt":"Gaussian process regression is a machine learning approach which has been shown its power for estimation of unknown functions. However, Gaussian processes suffer from high computational complexity, as in a basic form they scale cubically with the number of observations. Several approaches based on inducing points were proposed to handle this problem in a static context. These methods though face challenges with real-time tasks and when the data is received sequentially over time. In this paper, a novel online algorithm for training sparse Gaussian process models is presented. It treats the mea"},"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":"1807.03369","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2018-07-09T20:20:20Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"14de35014d11b9f3c14b7ecb3921717601704fbee2c3bda41a0d355ffcebefa9","abstract_canon_sha256":"739712bc53361b1d12637456cf62323fd870ad328c138ba7aa23afbef3a16e51"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:06:20.060825Z","signature_b64":"xYP3NywKFmXyHjnDIDNcmjfvzQuTtZjvVO6Spcj/TqUSdfcbw2AVTjwvu4pkNJJJQi+c31HUocD3yUS8MPfuBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f036b825b2a7384d7ec79417a645f0b9c3115f3fe523eeae916ac35eb99dc0da","last_reissued_at":"2026-05-18T00:06:20.060169Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:06:20.060169Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Ensemble Kalman Filtering for Online Gaussian Process Regression and Learning","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"stat.ML","authors_text":"Danil Kuzin, Le Yang, Lyudmila Mihaylova, Olga Isupova","submitted_at":"2018-07-09T20:20:20Z","abstract_excerpt":"Gaussian process regression is a machine learning approach which has been shown its power for estimation of unknown functions. However, Gaussian processes suffer from high computational complexity, as in a basic form they scale cubically with the number of observations. Several approaches based on inducing points were proposed to handle this problem in a static context. These methods though face challenges with real-time tasks and when the data is received sequentially over time. In this paper, a novel online algorithm for training sparse Gaussian process models is presented. It treats the mea"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1807.03369","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":"1807.03369","created_at":"2026-05-18T00:06:20.060288+00:00"},{"alias_kind":"arxiv_version","alias_value":"1807.03369v1","created_at":"2026-05-18T00:06:20.060288+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1807.03369","created_at":"2026-05-18T00:06:20.060288+00:00"},{"alias_kind":"pith_short_12","alias_value":"6A3LQJNSU44E","created_at":"2026-05-18T12:32:08.215937+00:00"},{"alias_kind":"pith_short_16","alias_value":"6A3LQJNSU44E27WH","created_at":"2026-05-18T12:32:08.215937+00:00"},{"alias_kind":"pith_short_8","alias_value":"6A3LQJNS","created_at":"2026-05-18T12:32:08.215937+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/6A3LQJNSU44E27WHSQL2MRPQXH","json":"https://pith.science/pith/6A3LQJNSU44E27WHSQL2MRPQXH.json","graph_json":"https://pith.science/api/pith-number/6A3LQJNSU44E27WHSQL2MRPQXH/graph.json","events_json":"https://pith.science/api/pith-number/6A3LQJNSU44E27WHSQL2MRPQXH/events.json","paper":"https://pith.science/paper/6A3LQJNS"},"agent_actions":{"view_html":"https://pith.science/pith/6A3LQJNSU44E27WHSQL2MRPQXH","download_json":"https://pith.science/pith/6A3LQJNSU44E27WHSQL2MRPQXH.json","view_paper":"https://pith.science/paper/6A3LQJNS","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1807.03369&json=true","fetch_graph":"https://pith.science/api/pith-number/6A3LQJNSU44E27WHSQL2MRPQXH/graph.json","fetch_events":"https://pith.science/api/pith-number/6A3LQJNSU44E27WHSQL2MRPQXH/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/6A3LQJNSU44E27WHSQL2MRPQXH/action/timestamp_anchor","attest_storage":"https://pith.science/pith/6A3LQJNSU44E27WHSQL2MRPQXH/action/storage_attestation","attest_author":"https://pith.science/pith/6A3LQJNSU44E27WHSQL2MRPQXH/action/author_attestation","sign_citation":"https://pith.science/pith/6A3LQJNSU44E27WHSQL2MRPQXH/action/citation_signature","submit_replication":"https://pith.science/pith/6A3LQJNSU44E27WHSQL2MRPQXH/action/replication_record"}},"created_at":"2026-05-18T00:06:20.060288+00:00","updated_at":"2026-05-18T00:06:20.060288+00:00"}