{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:WRDQ4Q5LLYKC2KXB2QJA55HRHD","short_pith_number":"pith:WRDQ4Q5L","schema_version":"1.0","canonical_sha256":"b4470e43ab5e142d2ae1d4120ef4f138f13167002e024a830e79dfa40ed6ff6d","source":{"kind":"arxiv","id":"1607.05539","version":1},"attestation_state":"computed","paper":{"title":"Partial Diffusion Recursive Least-Squares for Distributed Estimation under Noisy Links Condition","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.SI","cs.SY"],"primary_cat":"cs.DC","authors_text":"Amir Rastegarnia, Azam Khalili, Saeid Sanei, Vahid Vahidpour","submitted_at":"2016-07-19T12:19:26Z","abstract_excerpt":"Partial diffusion-based recursive least squares (PDRLS) is an effective method for reducing computational load and power consumption in adaptive network implementation. In this method, each node shares a part of its intermediate estimate vector with its neighbors at each iteration. PDRLS algorithm reduces the internode communications relative to the full-diffusion RLS algorithm. This selection of estimate entries becomes more appealing when the information fuse over noisy links. In this paper, we study the steady-state performance of PDRLS algorithm in presence of noisy links and investigate i"},"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":"1607.05539","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2016-07-19T12:19:26Z","cross_cats_sorted":["cs.SI","cs.SY"],"title_canon_sha256":"efdaef16aa717097ac095bd63d492b4112d8e78653cef4f27c28ca39c0e31b6c","abstract_canon_sha256":"d3e22c3d64a56badb75a89705d1c85b61301b4acff71def9155e1d44367882ed"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:10:46.612214Z","signature_b64":"BOeUe5rTrXgvepeYER7uesGFTI9rE7pao+ILbnLy2EROpTAZEyXNnMyuvSqbzzg6dYb6R4IKsXLUmehBtcCsCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b4470e43ab5e142d2ae1d4120ef4f138f13167002e024a830e79dfa40ed6ff6d","last_reissued_at":"2026-05-18T01:10:46.611670Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:10:46.611670Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Partial Diffusion Recursive Least-Squares for Distributed Estimation under Noisy Links Condition","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.SI","cs.SY"],"primary_cat":"cs.DC","authors_text":"Amir Rastegarnia, Azam Khalili, Saeid Sanei, Vahid Vahidpour","submitted_at":"2016-07-19T12:19:26Z","abstract_excerpt":"Partial diffusion-based recursive least squares (PDRLS) is an effective method for reducing computational load and power consumption in adaptive network implementation. In this method, each node shares a part of its intermediate estimate vector with its neighbors at each iteration. PDRLS algorithm reduces the internode communications relative to the full-diffusion RLS algorithm. This selection of estimate entries becomes more appealing when the information fuse over noisy links. In this paper, we study the steady-state performance of PDRLS algorithm in presence of noisy links and investigate i"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1607.05539","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":"1607.05539","created_at":"2026-05-18T01:10:46.611743+00:00"},{"alias_kind":"arxiv_version","alias_value":"1607.05539v1","created_at":"2026-05-18T01:10:46.611743+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1607.05539","created_at":"2026-05-18T01:10:46.611743+00:00"},{"alias_kind":"pith_short_12","alias_value":"WRDQ4Q5LLYKC","created_at":"2026-05-18T12:30:51.357362+00:00"},{"alias_kind":"pith_short_16","alias_value":"WRDQ4Q5LLYKC2KXB","created_at":"2026-05-18T12:30:51.357362+00:00"},{"alias_kind":"pith_short_8","alias_value":"WRDQ4Q5L","created_at":"2026-05-18T12:30:51.357362+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/WRDQ4Q5LLYKC2KXB2QJA55HRHD","json":"https://pith.science/pith/WRDQ4Q5LLYKC2KXB2QJA55HRHD.json","graph_json":"https://pith.science/api/pith-number/WRDQ4Q5LLYKC2KXB2QJA55HRHD/graph.json","events_json":"https://pith.science/api/pith-number/WRDQ4Q5LLYKC2KXB2QJA55HRHD/events.json","paper":"https://pith.science/paper/WRDQ4Q5L"},"agent_actions":{"view_html":"https://pith.science/pith/WRDQ4Q5LLYKC2KXB2QJA55HRHD","download_json":"https://pith.science/pith/WRDQ4Q5LLYKC2KXB2QJA55HRHD.json","view_paper":"https://pith.science/paper/WRDQ4Q5L","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1607.05539&json=true","fetch_graph":"https://pith.science/api/pith-number/WRDQ4Q5LLYKC2KXB2QJA55HRHD/graph.json","fetch_events":"https://pith.science/api/pith-number/WRDQ4Q5LLYKC2KXB2QJA55HRHD/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/WRDQ4Q5LLYKC2KXB2QJA55HRHD/action/timestamp_anchor","attest_storage":"https://pith.science/pith/WRDQ4Q5LLYKC2KXB2QJA55HRHD/action/storage_attestation","attest_author":"https://pith.science/pith/WRDQ4Q5LLYKC2KXB2QJA55HRHD/action/author_attestation","sign_citation":"https://pith.science/pith/WRDQ4Q5LLYKC2KXB2QJA55HRHD/action/citation_signature","submit_replication":"https://pith.science/pith/WRDQ4Q5LLYKC2KXB2QJA55HRHD/action/replication_record"}},"created_at":"2026-05-18T01:10:46.611743+00:00","updated_at":"2026-05-18T01:10:46.611743+00:00"}