{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:LXGHOPVAGL3Z4RRBZFURTYTOIF","short_pith_number":"pith:LXGHOPVA","canonical_record":{"source":{"id":"1501.06929","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2015-01-27T21:23:22Z","cross_cats_sorted":["cs.SY","stat.AP"],"title_canon_sha256":"a79e0b51e1015fcab29817903e6b826083dc84e7887e30c80963229454a159aa","abstract_canon_sha256":"7f4f92873e612a4d195f4897f5bd9ab35a614f3ba2848b381311c38059ba918f"},"schema_version":"1.0"},"canonical_sha256":"5dcc773ea032f79e4621c96919e26e414cfa3892ffeddf9e9a6ec7e1b4b5117f","source":{"kind":"arxiv","id":"1501.06929","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1501.06929","created_at":"2026-05-18T01:17:30Z"},{"alias_kind":"arxiv_version","alias_value":"1501.06929v1","created_at":"2026-05-18T01:17:30Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1501.06929","created_at":"2026-05-18T01:17:30Z"},{"alias_kind":"pith_short_12","alias_value":"LXGHOPVAGL3Z","created_at":"2026-05-18T12:29:29Z"},{"alias_kind":"pith_short_16","alias_value":"LXGHOPVAGL3Z4RRB","created_at":"2026-05-18T12:29:29Z"},{"alias_kind":"pith_short_8","alias_value":"LXGHOPVA","created_at":"2026-05-18T12:29:29Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:LXGHOPVAGL3Z4RRBZFURTYTOIF","target":"record","payload":{"canonical_record":{"source":{"id":"1501.06929","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2015-01-27T21:23:22Z","cross_cats_sorted":["cs.SY","stat.AP"],"title_canon_sha256":"a79e0b51e1015fcab29817903e6b826083dc84e7887e30c80963229454a159aa","abstract_canon_sha256":"7f4f92873e612a4d195f4897f5bd9ab35a614f3ba2848b381311c38059ba918f"},"schema_version":"1.0"},"canonical_sha256":"5dcc773ea032f79e4621c96919e26e414cfa3892ffeddf9e9a6ec7e1b4b5117f","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:17:30.865248Z","signature_b64":"4tWyHIfh1vwUfJTPxNYAmmitqwa77BJoB9r0gqZlaY4e9Yc+XMRwxGdTXXHR1/oZwonyYpNYbooO8aYXcfIYBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5dcc773ea032f79e4621c96919e26e414cfa3892ffeddf9e9a6ec7e1b4b5117f","last_reissued_at":"2026-05-18T01:17:30.864691Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:17:30.864691Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1501.06929","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-18T01:17:30Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"/uotL8xt2XztBgPbi+QsVh2w9+4xGpoK+zX8P3oLjCvCEnDWpbOu5a+xuPT9Gmljd8KpZhSWyxq5JYx1AAVPDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T17:22:58.320683Z"},"content_sha256":"225eec5fdd9e1f1d53c58faa9d754c006d4f35fc58157ff489e3ef38e6980e4f","schema_version":"1.0","event_id":"sha256:225eec5fdd9e1f1d53c58faa9d754c006d4f35fc58157ff489e3ef38e6980e4f"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:LXGHOPVAGL3Z4RRBZFURTYTOIF","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A Probabilistic Least-Mean-Squares Filter","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.SY","stat.AP"],"primary_cat":"stat.ML","authors_text":"Jesus Fernandez-Bes, Steven Van Vaerenbergh, V\\'ictor Elvira","submitted_at":"2015-01-27T21:23:22Z","abstract_excerpt":"We introduce a probabilistic approach to the LMS filter. By means of an efficient approximation, this approach provides an adaptable step-size LMS algorithm together with a measure of uncertainty about the estimation. In addition, the proposed approximation preserves the linear complexity of the standard LMS. Numerical results show the improved performance of the algorithm with respect to standard LMS and state-of-the-art algorithms with similar complexity. The goal of this work, therefore, is to open the door to bring some more Bayesian machine learning techniques to adaptive filtering."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1501.06929","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-18T01:17:30Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"txGUoCq9dSkKoDnRxejzvgStScYQk9epGd6/bGZzBkKayC3Zz4ZxcMKXjbmruiBjjrytjwiA3YfQUss71iTyBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T17:22:58.321029Z"},"content_sha256":"7bc57546b14d1d831f454c8b6f2e5fe51e6e189afa363cf4bc544ad562a7ae4e","schema_version":"1.0","event_id":"sha256:7bc57546b14d1d831f454c8b6f2e5fe51e6e189afa363cf4bc544ad562a7ae4e"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/LXGHOPVAGL3Z4RRBZFURTYTOIF/bundle.json","state_url":"https://pith.science/pith/LXGHOPVAGL3Z4RRBZFURTYTOIF/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/LXGHOPVAGL3Z4RRBZFURTYTOIF/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-28T17:22:58Z","links":{"resolver":"https://pith.science/pith/LXGHOPVAGL3Z4RRBZFURTYTOIF","bundle":"https://pith.science/pith/LXGHOPVAGL3Z4RRBZFURTYTOIF/bundle.json","state":"https://pith.science/pith/LXGHOPVAGL3Z4RRBZFURTYTOIF/state.json","well_known_bundle":"https://pith.science/.well-known/pith/LXGHOPVAGL3Z4RRBZFURTYTOIF/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:LXGHOPVAGL3Z4RRBZFURTYTOIF","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":"7f4f92873e612a4d195f4897f5bd9ab35a614f3ba2848b381311c38059ba918f","cross_cats_sorted":["cs.SY","stat.AP"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2015-01-27T21:23:22Z","title_canon_sha256":"a79e0b51e1015fcab29817903e6b826083dc84e7887e30c80963229454a159aa"},"schema_version":"1.0","source":{"id":"1501.06929","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1501.06929","created_at":"2026-05-18T01:17:30Z"},{"alias_kind":"arxiv_version","alias_value":"1501.06929v1","created_at":"2026-05-18T01:17:30Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1501.06929","created_at":"2026-05-18T01:17:30Z"},{"alias_kind":"pith_short_12","alias_value":"LXGHOPVAGL3Z","created_at":"2026-05-18T12:29:29Z"},{"alias_kind":"pith_short_16","alias_value":"LXGHOPVAGL3Z4RRB","created_at":"2026-05-18T12:29:29Z"},{"alias_kind":"pith_short_8","alias_value":"LXGHOPVA","created_at":"2026-05-18T12:29:29Z"}],"graph_snapshots":[{"event_id":"sha256:7bc57546b14d1d831f454c8b6f2e5fe51e6e189afa363cf4bc544ad562a7ae4e","target":"graph","created_at":"2026-05-18T01:17:30Z","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":"We introduce a probabilistic approach to the LMS filter. By means of an efficient approximation, this approach provides an adaptable step-size LMS algorithm together with a measure of uncertainty about the estimation. In addition, the proposed approximation preserves the linear complexity of the standard LMS. Numerical results show the improved performance of the algorithm with respect to standard LMS and state-of-the-art algorithms with similar complexity. The goal of this work, therefore, is to open the door to bring some more Bayesian machine learning techniques to adaptive filtering.","authors_text":"Jesus Fernandez-Bes, Steven Van Vaerenbergh, V\\'ictor Elvira","cross_cats":["cs.SY","stat.AP"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2015-01-27T21:23:22Z","title":"A Probabilistic Least-Mean-Squares Filter"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1501.06929","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:225eec5fdd9e1f1d53c58faa9d754c006d4f35fc58157ff489e3ef38e6980e4f","target":"record","created_at":"2026-05-18T01:17:30Z","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":"7f4f92873e612a4d195f4897f5bd9ab35a614f3ba2848b381311c38059ba918f","cross_cats_sorted":["cs.SY","stat.AP"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2015-01-27T21:23:22Z","title_canon_sha256":"a79e0b51e1015fcab29817903e6b826083dc84e7887e30c80963229454a159aa"},"schema_version":"1.0","source":{"id":"1501.06929","kind":"arxiv","version":1}},"canonical_sha256":"5dcc773ea032f79e4621c96919e26e414cfa3892ffeddf9e9a6ec7e1b4b5117f","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"5dcc773ea032f79e4621c96919e26e414cfa3892ffeddf9e9a6ec7e1b4b5117f","first_computed_at":"2026-05-18T01:17:30.864691Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:17:30.864691Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"4tWyHIfh1vwUfJTPxNYAmmitqwa77BJoB9r0gqZlaY4e9Yc+XMRwxGdTXXHR1/oZwonyYpNYbooO8aYXcfIYBg==","signature_status":"signed_v1","signed_at":"2026-05-18T01:17:30.865248Z","signed_message":"canonical_sha256_bytes"},"source_id":"1501.06929","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:225eec5fdd9e1f1d53c58faa9d754c006d4f35fc58157ff489e3ef38e6980e4f","sha256:7bc57546b14d1d831f454c8b6f2e5fe51e6e189afa363cf4bc544ad562a7ae4e"],"state_sha256":"b83fa73c5ba1b4a4b026dc120438280c662b876ed774215a79bef81f10f27655"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"OKudWorCRxbk0sVQM8hCRZOFOwP9XchGJACtPF8f4bPOFZT2fZnu5itcfdkd1vSOIKq4nM435bkUGe33CYapCA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-28T17:22:58.323249Z","bundle_sha256":"2e27a1d4db9cecdc5d6fea5e71a5d8ba20a3722c034987a323daea592183efc0"}}