{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:4SGM5C4S3A7T6Q32WTHWVW4PRY","short_pith_number":"pith:4SGM5C4S","schema_version":"1.0","canonical_sha256":"e48cce8b92d83f3f437ab4cf6adb8f8e09a311e19d8d6ef7edfd931f772422f7","source":{"kind":"arxiv","id":"1408.5845","version":2},"attestation_state":"computed","paper":{"title":"Analysis of a Reduced-Communication Diffusion LMS Algorithm","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG","cs.SY","math.OC"],"primary_cat":"cs.DC","authors_text":"Kutluy{\\i}l Do\\u{g}an\\c{c}ay, Reza Arablouei, Stefan Werner, Yih-Fang Huang","submitted_at":"2014-08-25T17:42:41Z","abstract_excerpt":"In diffusion-based algorithms for adaptive distributed estimation, each node of an adaptive network estimates a target parameter vector by creating an intermediate estimate and then combining the intermediate estimates available within its closed neighborhood. We analyze the performance of a reduced-communication diffusion least mean-square (RC-DLMS) algorithm, which allows each node to receive the intermediate estimates of only a subset of its neighbors at each iteration. This algorithm eases the usage of network communication resources and delivers a trade-off between estimation performance "},"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":"1408.5845","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2014-08-25T17:42:41Z","cross_cats_sorted":["cs.LG","cs.SY","math.OC"],"title_canon_sha256":"bac88d85ddfd5118d4fb7161b2ce8ffa11a467b52beb271721c3c035fdc72575","abstract_canon_sha256":"3db7b632001ed30230eae25d852a568445880c8d8be1e77c88fff1b792e939bd"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:32:06.084788Z","signature_b64":"OT2E8xrsyPdVscjTYPKNQC2bUJkWCbNgj1bOHmekIy9RsIr2yTMsZ2HQBU+YV62O8S5KYxSsx8W8EeQ+KTVzDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e48cce8b92d83f3f437ab4cf6adb8f8e09a311e19d8d6ef7edfd931f772422f7","last_reissued_at":"2026-05-18T02:32:06.084434Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:32:06.084434Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Analysis of a Reduced-Communication Diffusion LMS Algorithm","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG","cs.SY","math.OC"],"primary_cat":"cs.DC","authors_text":"Kutluy{\\i}l Do\\u{g}an\\c{c}ay, Reza Arablouei, Stefan Werner, Yih-Fang Huang","submitted_at":"2014-08-25T17:42:41Z","abstract_excerpt":"In diffusion-based algorithms for adaptive distributed estimation, each node of an adaptive network estimates a target parameter vector by creating an intermediate estimate and then combining the intermediate estimates available within its closed neighborhood. We analyze the performance of a reduced-communication diffusion least mean-square (RC-DLMS) algorithm, which allows each node to receive the intermediate estimates of only a subset of its neighbors at each iteration. This algorithm eases the usage of network communication resources and delivers a trade-off between estimation performance "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1408.5845","kind":"arxiv","version":2},"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":"1408.5845","created_at":"2026-05-18T02:32:06.084489+00:00"},{"alias_kind":"arxiv_version","alias_value":"1408.5845v2","created_at":"2026-05-18T02:32:06.084489+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1408.5845","created_at":"2026-05-18T02:32:06.084489+00:00"},{"alias_kind":"pith_short_12","alias_value":"4SGM5C4S3A7T","created_at":"2026-05-18T12:28:14.216126+00:00"},{"alias_kind":"pith_short_16","alias_value":"4SGM5C4S3A7T6Q32","created_at":"2026-05-18T12:28:14.216126+00:00"},{"alias_kind":"pith_short_8","alias_value":"4SGM5C4S","created_at":"2026-05-18T12:28:14.216126+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/4SGM5C4S3A7T6Q32WTHWVW4PRY","json":"https://pith.science/pith/4SGM5C4S3A7T6Q32WTHWVW4PRY.json","graph_json":"https://pith.science/api/pith-number/4SGM5C4S3A7T6Q32WTHWVW4PRY/graph.json","events_json":"https://pith.science/api/pith-number/4SGM5C4S3A7T6Q32WTHWVW4PRY/events.json","paper":"https://pith.science/paper/4SGM5C4S"},"agent_actions":{"view_html":"https://pith.science/pith/4SGM5C4S3A7T6Q32WTHWVW4PRY","download_json":"https://pith.science/pith/4SGM5C4S3A7T6Q32WTHWVW4PRY.json","view_paper":"https://pith.science/paper/4SGM5C4S","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1408.5845&json=true","fetch_graph":"https://pith.science/api/pith-number/4SGM5C4S3A7T6Q32WTHWVW4PRY/graph.json","fetch_events":"https://pith.science/api/pith-number/4SGM5C4S3A7T6Q32WTHWVW4PRY/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/4SGM5C4S3A7T6Q32WTHWVW4PRY/action/timestamp_anchor","attest_storage":"https://pith.science/pith/4SGM5C4S3A7T6Q32WTHWVW4PRY/action/storage_attestation","attest_author":"https://pith.science/pith/4SGM5C4S3A7T6Q32WTHWVW4PRY/action/author_attestation","sign_citation":"https://pith.science/pith/4SGM5C4S3A7T6Q32WTHWVW4PRY/action/citation_signature","submit_replication":"https://pith.science/pith/4SGM5C4S3A7T6Q32WTHWVW4PRY/action/replication_record"}},"created_at":"2026-05-18T02:32:06.084489+00:00","updated_at":"2026-05-18T02:32:06.084489+00:00"}