{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:3QTG5VSCQOF5ZMN2O5S6C5WHL7","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":"c53a5dbfccb9bba7998ac03b58ca32f5b4a16b5b01bbf659c4745d149c71fbf7","cross_cats_sorted":["cs.LG","eess.SP","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2018-12-24T21:40:54Z","title_canon_sha256":"aa99dddccf4e42f0072edea741f17eb8bd296e1580ef743d112238a7911cef95"},"schema_version":"1.0","source":{"id":"1812.09985","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1812.09985","created_at":"2026-05-17T23:53:23Z"},{"alias_kind":"arxiv_version","alias_value":"1812.09985v1","created_at":"2026-05-17T23:53:23Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1812.09985","created_at":"2026-05-17T23:53:23Z"},{"alias_kind":"pith_short_12","alias_value":"3QTG5VSCQOF5","created_at":"2026-05-18T12:32:02Z"},{"alias_kind":"pith_short_16","alias_value":"3QTG5VSCQOF5ZMN2","created_at":"2026-05-18T12:32:02Z"},{"alias_kind":"pith_short_8","alias_value":"3QTG5VSC","created_at":"2026-05-18T12:32:02Z"}],"graph_snapshots":[{"event_id":"sha256:e18d72009a4b712ca7df6db2106b5ff65a8fb46d2c81aa141c797d6db4e82f8a","target":"graph","created_at":"2026-05-17T23:53:23Z","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 a robust diffusion recursive least squares algorithm to mitigate the performance degradation often experienced in networks of agents in the presence of impulsive noise. This algorithm minimizes an exponentially weighted least-squares cost function subject to a time-dependent constraint on the squared norm of the intermediate estimate update at each node. With the help of side information, the constraint is recursively updated in a diffusion strategy. Moreover, a control strategy for resetting the constraint is also proposed to retain good tracking capability when the estimat","authors_text":"R. C. de Lamare, Y. Yu, Y. Zakharov","cross_cats":["cs.LG","eess.SP","math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2018-12-24T21:40:54Z","title":"Study of Robust Diffusion Recursive Least Squares Algorithms with Side Information for Networked Agents"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1812.09985","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:2fb9ddf5ca367afdb7ba1b5446e734ae3bf18206ba3ad05092ea7b22b29985f5","target":"record","created_at":"2026-05-17T23:53:23Z","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":"c53a5dbfccb9bba7998ac03b58ca32f5b4a16b5b01bbf659c4745d149c71fbf7","cross_cats_sorted":["cs.LG","eess.SP","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2018-12-24T21:40:54Z","title_canon_sha256":"aa99dddccf4e42f0072edea741f17eb8bd296e1580ef743d112238a7911cef95"},"schema_version":"1.0","source":{"id":"1812.09985","kind":"arxiv","version":1}},"canonical_sha256":"dc266ed642838bdcb1ba7765e176c75fc39a1f00187d514851805e4f6409001c","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"dc266ed642838bdcb1ba7765e176c75fc39a1f00187d514851805e4f6409001c","first_computed_at":"2026-05-17T23:53:23.355506Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:53:23.355506Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Wd09BmjRwkhF4zz7vOA0WPA7J3C2MDY6BIeFnmvN+i12624fbGvr1qEIIFrdzVoCnhYRxNxBw6ATcopZG1+mBg==","signature_status":"signed_v1","signed_at":"2026-05-17T23:53:23.356083Z","signed_message":"canonical_sha256_bytes"},"source_id":"1812.09985","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:2fb9ddf5ca367afdb7ba1b5446e734ae3bf18206ba3ad05092ea7b22b29985f5","sha256:e18d72009a4b712ca7df6db2106b5ff65a8fb46d2c81aa141c797d6db4e82f8a"],"state_sha256":"9891021667fd58735cc9d8ffe8fefe02d96733312713fa5a47923e499508d341"}