{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:OONSMNGS5SGYNZF4DZDW3EHOFR","short_pith_number":"pith:OONSMNGS","canonical_record":{"source":{"id":"1310.5347","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2013-10-20T16:58:57Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"754b5575df4509e57c638e33348576aff606899db18cb50a023cc29a882bbd4c","abstract_canon_sha256":"5baa5789dd853e8599382cde02bcadbb5d4df9812f6dd7a17a67b6655ac2e4ba"},"schema_version":"1.0"},"canonical_sha256":"739b2634d2ec8d86e4bc1e476d90ee2c7368d588f9e5b243d747ed0acc38af97","source":{"kind":"arxiv","id":"1310.5347","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1310.5347","created_at":"2026-05-18T03:09:45Z"},{"alias_kind":"arxiv_version","alias_value":"1310.5347v1","created_at":"2026-05-18T03:09:45Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1310.5347","created_at":"2026-05-18T03:09:45Z"},{"alias_kind":"pith_short_12","alias_value":"OONSMNGS5SGY","created_at":"2026-05-18T12:27:54Z"},{"alias_kind":"pith_short_16","alias_value":"OONSMNGS5SGYNZF4","created_at":"2026-05-18T12:27:54Z"},{"alias_kind":"pith_short_8","alias_value":"OONSMNGS","created_at":"2026-05-18T12:27:54Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:OONSMNGS5SGYNZF4DZDW3EHOFR","target":"record","payload":{"canonical_record":{"source":{"id":"1310.5347","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2013-10-20T16:58:57Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"754b5575df4509e57c638e33348576aff606899db18cb50a023cc29a882bbd4c","abstract_canon_sha256":"5baa5789dd853e8599382cde02bcadbb5d4df9812f6dd7a17a67b6655ac2e4ba"},"schema_version":"1.0"},"canonical_sha256":"739b2634d2ec8d86e4bc1e476d90ee2c7368d588f9e5b243d747ed0acc38af97","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:09:45.733403Z","signature_b64":"LCapwt2nxLc4o02nQP5bWxOWHZhllMdPSeiZPOIcp//Ngo1pKKXlcCf0C14jqFuXRMA4GDhHzfiLxUOTkHb6Ag==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"739b2634d2ec8d86e4bc1e476d90ee2c7368d588f9e5b243d747ed0acc38af97","last_reissued_at":"2026-05-18T03:09:45.732416Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:09:45.732416Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1310.5347","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-18T03:09:45Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"e+pp61xOYcM3fWVfG0vnkZw14MWDnDQqrGgNFp76ViSRWGFtX/mVj6TFf2iopbA7u7cBJ5uB7lo7T5WtJvtXDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-20T05:11:29.106585Z"},"content_sha256":"d437c4c9970c61cf89edf4bf7a6a40ac5289432c47266c40aaa8c39defd67d00","schema_version":"1.0","event_id":"sha256:d437c4c9970c61cf89edf4bf7a6a40ac5289432c47266c40aaa8c39defd67d00"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:OONSMNGS5SGYNZF4DZDW3EHOFR","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Bayesian Extensions of Kernel Least Mean Squares","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"stat.ML","authors_text":"Il Memming Park, Sohan Seth, Steven Van Vaerenbergh","submitted_at":"2013-10-20T16:58:57Z","abstract_excerpt":"The kernel least mean squares (KLMS) algorithm is a computationally efficient nonlinear adaptive filtering method that \"kernelizes\" the celebrated (linear) least mean squares algorithm. We demonstrate that the least mean squares algorithm is closely related to the Kalman filtering, and thus, the KLMS can be interpreted as an approximate Bayesian filtering method. This allows us to systematically develop extensions of the KLMS by modifying the underlying state-space and observation models. The resulting extensions introduce many desirable properties such as \"forgetting\", and the ability to lear"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1310.5347","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-18T03:09:45Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"KhvuVpqBGNMdzcbwPul2502TFGSVxCcaHMQ3ycRbEG6rFkoL387FU+D/GUfNha7gLYX+QpXVyA6hm2h3MEPtDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-20T05:11:29.106939Z"},"content_sha256":"9d2620a60654a0b3184fc21c309e93a71d2441a644b8b27501c32e03347e0bbc","schema_version":"1.0","event_id":"sha256:9d2620a60654a0b3184fc21c309e93a71d2441a644b8b27501c32e03347e0bbc"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/OONSMNGS5SGYNZF4DZDW3EHOFR/bundle.json","state_url":"https://pith.science/pith/OONSMNGS5SGYNZF4DZDW3EHOFR/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/OONSMNGS5SGYNZF4DZDW3EHOFR/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-06-20T05:11:29Z","links":{"resolver":"https://pith.science/pith/OONSMNGS5SGYNZF4DZDW3EHOFR","bundle":"https://pith.science/pith/OONSMNGS5SGYNZF4DZDW3EHOFR/bundle.json","state":"https://pith.science/pith/OONSMNGS5SGYNZF4DZDW3EHOFR/state.json","well_known_bundle":"https://pith.science/.well-known/pith/OONSMNGS5SGYNZF4DZDW3EHOFR/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:OONSMNGS5SGYNZF4DZDW3EHOFR","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":"5baa5789dd853e8599382cde02bcadbb5d4df9812f6dd7a17a67b6655ac2e4ba","cross_cats_sorted":["cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2013-10-20T16:58:57Z","title_canon_sha256":"754b5575df4509e57c638e33348576aff606899db18cb50a023cc29a882bbd4c"},"schema_version":"1.0","source":{"id":"1310.5347","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1310.5347","created_at":"2026-05-18T03:09:45Z"},{"alias_kind":"arxiv_version","alias_value":"1310.5347v1","created_at":"2026-05-18T03:09:45Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1310.5347","created_at":"2026-05-18T03:09:45Z"},{"alias_kind":"pith_short_12","alias_value":"OONSMNGS5SGY","created_at":"2026-05-18T12:27:54Z"},{"alias_kind":"pith_short_16","alias_value":"OONSMNGS5SGYNZF4","created_at":"2026-05-18T12:27:54Z"},{"alias_kind":"pith_short_8","alias_value":"OONSMNGS","created_at":"2026-05-18T12:27:54Z"}],"graph_snapshots":[{"event_id":"sha256:9d2620a60654a0b3184fc21c309e93a71d2441a644b8b27501c32e03347e0bbc","target":"graph","created_at":"2026-05-18T03:09:45Z","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":"The kernel least mean squares (KLMS) algorithm is a computationally efficient nonlinear adaptive filtering method that \"kernelizes\" the celebrated (linear) least mean squares algorithm. We demonstrate that the least mean squares algorithm is closely related to the Kalman filtering, and thus, the KLMS can be interpreted as an approximate Bayesian filtering method. This allows us to systematically develop extensions of the KLMS by modifying the underlying state-space and observation models. The resulting extensions introduce many desirable properties such as \"forgetting\", and the ability to lear","authors_text":"Il Memming Park, Sohan Seth, Steven Van Vaerenbergh","cross_cats":["cs.LG"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2013-10-20T16:58:57Z","title":"Bayesian Extensions of Kernel Least Mean Squares"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1310.5347","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:d437c4c9970c61cf89edf4bf7a6a40ac5289432c47266c40aaa8c39defd67d00","target":"record","created_at":"2026-05-18T03:09:45Z","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":"5baa5789dd853e8599382cde02bcadbb5d4df9812f6dd7a17a67b6655ac2e4ba","cross_cats_sorted":["cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2013-10-20T16:58:57Z","title_canon_sha256":"754b5575df4509e57c638e33348576aff606899db18cb50a023cc29a882bbd4c"},"schema_version":"1.0","source":{"id":"1310.5347","kind":"arxiv","version":1}},"canonical_sha256":"739b2634d2ec8d86e4bc1e476d90ee2c7368d588f9e5b243d747ed0acc38af97","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"739b2634d2ec8d86e4bc1e476d90ee2c7368d588f9e5b243d747ed0acc38af97","first_computed_at":"2026-05-18T03:09:45.732416Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:09:45.732416Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"LCapwt2nxLc4o02nQP5bWxOWHZhllMdPSeiZPOIcp//Ngo1pKKXlcCf0C14jqFuXRMA4GDhHzfiLxUOTkHb6Ag==","signature_status":"signed_v1","signed_at":"2026-05-18T03:09:45.733403Z","signed_message":"canonical_sha256_bytes"},"source_id":"1310.5347","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:d437c4c9970c61cf89edf4bf7a6a40ac5289432c47266c40aaa8c39defd67d00","sha256:9d2620a60654a0b3184fc21c309e93a71d2441a644b8b27501c32e03347e0bbc"],"state_sha256":"966823ccd4553aa0905f778e205ce36ab139d6fb43d31828e40dafd0a56dbc5e"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"mo0gxh3uDEqaZ5HBDpsOiG24mxvZ1yvutDvDoC+WYrLeTQPQuGIcdMlTALOedAFwOOlG4rnTNBDd8uovlV0nAw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-20T05:11:29.108870Z","bundle_sha256":"d32359cb7d9a997300153acbbb5401116657dc3efd0b3b10bbb6be651a49c0f1"}}