{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:6A3LQJNSU44E27WHSQL2MRPQXH","short_pith_number":"pith:6A3LQJNS","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"},"canonical_sha256":"f036b825b2a7384d7ec79417a645f0b9c3115f3fe523eeae916ac35eb99dc0da","source":{"kind":"arxiv","id":"1807.03369","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1807.03369","created_at":"2026-05-18T00:06:20Z"},{"alias_kind":"arxiv_version","alias_value":"1807.03369v1","created_at":"2026-05-18T00:06:20Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1807.03369","created_at":"2026-05-18T00:06:20Z"},{"alias_kind":"pith_short_12","alias_value":"6A3LQJNSU44E","created_at":"2026-05-18T12:32:08Z"},{"alias_kind":"pith_short_16","alias_value":"6A3LQJNSU44E27WH","created_at":"2026-05-18T12:32:08Z"},{"alias_kind":"pith_short_8","alias_value":"6A3LQJNS","created_at":"2026-05-18T12:32:08Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:6A3LQJNSU44E27WHSQL2MRPQXH","target":"record","payload":{"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"},"canonical_sha256":"f036b825b2a7384d7ec79417a645f0b9c3115f3fe523eeae916ac35eb99dc0da","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"},"source_kind":"arxiv","source_id":"1807.03369","source_version":1,"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:06:20Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Hh2/EeKMbb7DkQxgNqJOcx9VXwn/Jxf+7hwji+qloDcc1B/FHxiZhK8ss4ooaHdOEdxLyxv8wk/w8MbWyIWMBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T11:32:02.429689Z"},"content_sha256":"7d0ef14cfa54e844e6693a900d125da2bedb105051d20c85286aaa9dbd56ebac","schema_version":"1.0","event_id":"sha256:7d0ef14cfa54e844e6693a900d125da2bedb105051d20c85286aaa9dbd56ebac"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:6A3LQJNSU44E27WHSQL2MRPQXH","target":"graph","payload":{"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"},"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:06:20Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"sWoU7bnujkn/Hx5N4j/k9giui5dqoDCrdN/VDXXMVbqjbvKZyrr8zQw0PV0x45VdnzwM9OwvZGyvxXUueacBAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T11:32:02.430234Z"},"content_sha256":"41c298d1b3d4e51f87caf15a94ab77950c71cd5648eb8f62608a1d5f4c48dd7b","schema_version":"1.0","event_id":"sha256:41c298d1b3d4e51f87caf15a94ab77950c71cd5648eb8f62608a1d5f4c48dd7b"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/6A3LQJNSU44E27WHSQL2MRPQXH/bundle.json","state_url":"https://pith.science/pith/6A3LQJNSU44E27WHSQL2MRPQXH/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/6A3LQJNSU44E27WHSQL2MRPQXH/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-05-28T11:32:02Z","links":{"resolver":"https://pith.science/pith/6A3LQJNSU44E27WHSQL2MRPQXH","bundle":"https://pith.science/pith/6A3LQJNSU44E27WHSQL2MRPQXH/bundle.json","state":"https://pith.science/pith/6A3LQJNSU44E27WHSQL2MRPQXH/state.json","well_known_bundle":"https://pith.science/.well-known/pith/6A3LQJNSU44E27WHSQL2MRPQXH/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:6A3LQJNSU44E27WHSQL2MRPQXH","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":"739712bc53361b1d12637456cf62323fd870ad328c138ba7aa23afbef3a16e51","cross_cats_sorted":["cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2018-07-09T20:20:20Z","title_canon_sha256":"14de35014d11b9f3c14b7ecb3921717601704fbee2c3bda41a0d355ffcebefa9"},"schema_version":"1.0","source":{"id":"1807.03369","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1807.03369","created_at":"2026-05-18T00:06:20Z"},{"alias_kind":"arxiv_version","alias_value":"1807.03369v1","created_at":"2026-05-18T00:06:20Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1807.03369","created_at":"2026-05-18T00:06:20Z"},{"alias_kind":"pith_short_12","alias_value":"6A3LQJNSU44E","created_at":"2026-05-18T12:32:08Z"},{"alias_kind":"pith_short_16","alias_value":"6A3LQJNSU44E27WH","created_at":"2026-05-18T12:32:08Z"},{"alias_kind":"pith_short_8","alias_value":"6A3LQJNS","created_at":"2026-05-18T12:32:08Z"}],"graph_snapshots":[{"event_id":"sha256:41c298d1b3d4e51f87caf15a94ab77950c71cd5648eb8f62608a1d5f4c48dd7b","target":"graph","created_at":"2026-05-18T00:06:20Z","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":"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","authors_text":"Danil Kuzin, Le Yang, Lyudmila Mihaylova, Olga Isupova","cross_cats":["cs.LG"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2018-07-09T20:20:20Z","title":"Ensemble Kalman Filtering for Online Gaussian Process Regression and Learning"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1807.03369","kind":"arxiv","version":1},"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:7d0ef14cfa54e844e6693a900d125da2bedb105051d20c85286aaa9dbd56ebac","target":"record","created_at":"2026-05-18T00:06:20Z","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":"739712bc53361b1d12637456cf62323fd870ad328c138ba7aa23afbef3a16e51","cross_cats_sorted":["cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2018-07-09T20:20:20Z","title_canon_sha256":"14de35014d11b9f3c14b7ecb3921717601704fbee2c3bda41a0d355ffcebefa9"},"schema_version":"1.0","source":{"id":"1807.03369","kind":"arxiv","version":1}},"canonical_sha256":"f036b825b2a7384d7ec79417a645f0b9c3115f3fe523eeae916ac35eb99dc0da","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"f036b825b2a7384d7ec79417a645f0b9c3115f3fe523eeae916ac35eb99dc0da","first_computed_at":"2026-05-18T00:06:20.060169Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:06:20.060169Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"xYP3NywKFmXyHjnDIDNcmjfvzQuTtZjvVO6Spcj/TqUSdfcbw2AVTjwvu4pkNJJJQi+c31HUocD3yUS8MPfuBg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:06:20.060825Z","signed_message":"canonical_sha256_bytes"},"source_id":"1807.03369","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:7d0ef14cfa54e844e6693a900d125da2bedb105051d20c85286aaa9dbd56ebac","sha256:41c298d1b3d4e51f87caf15a94ab77950c71cd5648eb8f62608a1d5f4c48dd7b"],"state_sha256":"8263e7206bd46800a4ca4502fc7fc68842aa17203f89d8dbcdb9c28c99bbe88d"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ZD3h5PIwJl5M9ikA5uFZ7KvN67ZUcJtPTrrZB7rz69/Q0MwJGVDoLHLtfubpNBhESyC9PKaGzmedFwYCjN9nCw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-28T11:32:02.432271Z","bundle_sha256":"af08675e18a90a3b5fe88d1e9058b553cbbe98d0b9c67b594b6f5ec5cc4dfb68"}}