{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:XUENENTZZZ3HEL2PNRG4OUT2DO","short_pith_number":"pith:XUENENTZ","schema_version":"1.0","canonical_sha256":"bd08d23679ce76722f4f6c4dc7527a1bbdd05caefae4aae94406383ce805041b","source":{"kind":"arxiv","id":"1802.05144","version":1},"attestation_state":"computed","paper":{"title":"Maximum Total Correntropy Diffusion Adaptation over Networks with Noisy Links","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["eess.SP","math.IT"],"primary_cat":"cs.IT","authors_text":"Badong Chen, Fei Wang, Pengju Ren, Shiyuan Wang, Yicong He","submitted_at":"2018-02-14T15:09:11Z","abstract_excerpt":"Distributed estimation over networks draws much attraction in recent years. In many situations, due to imperfect information communication among nodes, the performance of traditional diffusion adaptive algorithms such as the diffusion LMS (DLMS) may degrade. To deal with this problem, several modified DLMS algorithms have been proposed. However, these DLMS based algorithms still suffer from biased estimation and are not robust to impulsive link noise. In this paper, we focus on improving the performance of diffusion adaptation with noisy links from two aspects: accuracy and robustness. A new a"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"1802.05144","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2018-02-14T15:09:11Z","cross_cats_sorted":["eess.SP","math.IT"],"title_canon_sha256":"16137f965c5be09d23aafb7a75fc0eb2a074e597c3d4a71ff270fb208819da11","abstract_canon_sha256":"478d046c8619d7afbf2c51953420022606c6078a7be7acb3fc14fa5835516e6f"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:23:20.281919Z","signature_b64":"xT13UbglJl/ybGQp6gi5q0oCxtpJBBhaLhevU8t65rdpUzA5WJfTdHSv3W9FEipsXAl7+P7d0QOgbtvD4YGFAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"bd08d23679ce76722f4f6c4dc7527a1bbdd05caefae4aae94406383ce805041b","last_reissued_at":"2026-05-18T00:23:20.281215Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:23:20.281215Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Maximum Total Correntropy Diffusion Adaptation over Networks with Noisy Links","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["eess.SP","math.IT"],"primary_cat":"cs.IT","authors_text":"Badong Chen, Fei Wang, Pengju Ren, Shiyuan Wang, Yicong He","submitted_at":"2018-02-14T15:09:11Z","abstract_excerpt":"Distributed estimation over networks draws much attraction in recent years. In many situations, due to imperfect information communication among nodes, the performance of traditional diffusion adaptive algorithms such as the diffusion LMS (DLMS) may degrade. To deal with this problem, several modified DLMS algorithms have been proposed. However, these DLMS based algorithms still suffer from biased estimation and are not robust to impulsive link noise. In this paper, we focus on improving the performance of diffusion adaptation with noisy links from two aspects: accuracy and robustness. A new a"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1802.05144","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1802.05144","created_at":"2026-05-18T00:23:20.281329+00:00"},{"alias_kind":"arxiv_version","alias_value":"1802.05144v1","created_at":"2026-05-18T00:23:20.281329+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1802.05144","created_at":"2026-05-18T00:23:20.281329+00:00"},{"alias_kind":"pith_short_12","alias_value":"XUENENTZZZ3H","created_at":"2026-05-18T12:33:01.666342+00:00"},{"alias_kind":"pith_short_16","alias_value":"XUENENTZZZ3HEL2P","created_at":"2026-05-18T12:33:01.666342+00:00"},{"alias_kind":"pith_short_8","alias_value":"XUENENTZ","created_at":"2026-05-18T12:33:01.666342+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/XUENENTZZZ3HEL2PNRG4OUT2DO","json":"https://pith.science/pith/XUENENTZZZ3HEL2PNRG4OUT2DO.json","graph_json":"https://pith.science/api/pith-number/XUENENTZZZ3HEL2PNRG4OUT2DO/graph.json","events_json":"https://pith.science/api/pith-number/XUENENTZZZ3HEL2PNRG4OUT2DO/events.json","paper":"https://pith.science/paper/XUENENTZ"},"agent_actions":{"view_html":"https://pith.science/pith/XUENENTZZZ3HEL2PNRG4OUT2DO","download_json":"https://pith.science/pith/XUENENTZZZ3HEL2PNRG4OUT2DO.json","view_paper":"https://pith.science/paper/XUENENTZ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1802.05144&json=true","fetch_graph":"https://pith.science/api/pith-number/XUENENTZZZ3HEL2PNRG4OUT2DO/graph.json","fetch_events":"https://pith.science/api/pith-number/XUENENTZZZ3HEL2PNRG4OUT2DO/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/XUENENTZZZ3HEL2PNRG4OUT2DO/action/timestamp_anchor","attest_storage":"https://pith.science/pith/XUENENTZZZ3HEL2PNRG4OUT2DO/action/storage_attestation","attest_author":"https://pith.science/pith/XUENENTZZZ3HEL2PNRG4OUT2DO/action/author_attestation","sign_citation":"https://pith.science/pith/XUENENTZZZ3HEL2PNRG4OUT2DO/action/citation_signature","submit_replication":"https://pith.science/pith/XUENENTZZZ3HEL2PNRG4OUT2DO/action/replication_record"}},"created_at":"2026-05-18T00:23:20.281329+00:00","updated_at":"2026-05-18T00:23:20.281329+00:00"}