{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:3O2BRCZJYRZ2BG5QZY5APVDPAD","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":"ed88304dc5b7ea4a21b9f6c5259a3bc14a282d90ce215f367f346c25c6cfc47b","cross_cats_sorted":["stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-02-04T01:38:58Z","title_canon_sha256":"71740164410aacd1eb7339c836fafb57a3d99538702a4601ded7b3fbbbeaef47"},"schema_version":"1.0","source":{"id":"1902.01005","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1902.01005","created_at":"2026-05-17T23:54:49Z"},{"alias_kind":"arxiv_version","alias_value":"1902.01005v1","created_at":"2026-05-17T23:54:49Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1902.01005","created_at":"2026-05-17T23:54:49Z"},{"alias_kind":"pith_short_12","alias_value":"3O2BRCZJYRZ2","created_at":"2026-05-18T12:33:07Z"},{"alias_kind":"pith_short_16","alias_value":"3O2BRCZJYRZ2BG5Q","created_at":"2026-05-18T12:33:07Z"},{"alias_kind":"pith_short_8","alias_value":"3O2BRCZJ","created_at":"2026-05-18T12:33:07Z"}],"graph_snapshots":[{"event_id":"sha256:a835a630266a0c3414cb2e7351d996ffd5c8177d688ac2004d6c319dec22f922","target":"graph","created_at":"2026-05-17T23:54:49Z","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":"This work develops robust diffusion recursive least squares algorithms to mitigate the performance degradation often experienced in networks of agents in the presence of impulsive noise. The first algorithm minimizes an exponentially weighted least-squares cost function subject to a time-dependent constraint on the squared norm of the intermediate update at each node. A recursive strategy for computing the constraint is proposed using side information from the neighboring nodes to further improve the robustness. We also analyze the mean-square convergence behavior of the proposed algorithm. Th","authors_text":"H. Zhao, L. Lu, R. C. de Lamare, Y. Yu, Y. Zakharov","cross_cats":["stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-02-04T01:38:58Z","title":"Study of Robust Distributed Diffusion RLS Algorithms with Side Information for Adaptive Networks"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1902.01005","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:5d1649b66c9fad62e80747ea2349697e3e35b22179ee0a08cc97eed56dc45f38","target":"record","created_at":"2026-05-17T23:54:49Z","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":"ed88304dc5b7ea4a21b9f6c5259a3bc14a282d90ce215f367f346c25c6cfc47b","cross_cats_sorted":["stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-02-04T01:38:58Z","title_canon_sha256":"71740164410aacd1eb7339c836fafb57a3d99538702a4601ded7b3fbbbeaef47"},"schema_version":"1.0","source":{"id":"1902.01005","kind":"arxiv","version":1}},"canonical_sha256":"dbb4188b29c473a09bb0ce3a07d46f00e2ec82056a61259d03cf2af4f06a669e","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"dbb4188b29c473a09bb0ce3a07d46f00e2ec82056a61259d03cf2af4f06a669e","first_computed_at":"2026-05-17T23:54:49.912266Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:54:49.912266Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"ddpbw43ztCScWQ16sDCXtSft5CZRkPtkxPyJK9++aAkhSxykRWix57s9YSxcg2YkkIdyouNFtNc6sLWqpq2mDQ==","signature_status":"signed_v1","signed_at":"2026-05-17T23:54:49.912936Z","signed_message":"canonical_sha256_bytes"},"source_id":"1902.01005","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:5d1649b66c9fad62e80747ea2349697e3e35b22179ee0a08cc97eed56dc45f38","sha256:a835a630266a0c3414cb2e7351d996ffd5c8177d688ac2004d6c319dec22f922"],"state_sha256":"a47d1c4ee2f271621d176b04fce867902cd38c5f9602b174982466034b4103c8"}