{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:SFS7F4EA24HFAPWV5IMDUFJG5K","short_pith_number":"pith:SFS7F4EA","schema_version":"1.0","canonical_sha256":"9165f2f080d70e503ed5ea183a1526ea94cf6b3499454b414e683f17094628de","source":{"kind":"arxiv","id":"1303.3844","version":1},"attestation_state":"computed","paper":{"title":"Low-Complexity Channel Estimation with Set-Membership Algorithms for Cooperative Wireless Sensor Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"P. D. Mitchell, R. C. de Lamare, T. Wang","submitted_at":"2013-03-15T18:16:41Z","abstract_excerpt":"In this paper, we consider a general cooperative wireless sensor network (WSN) with multiple hops and the problem of channel estimation. Two matrix-based set-membership algorithms are developed for the estimation of the complex matrix channel parameters. The main goal is to reduce the computational complexity significantly as compared with existing channel estimators and extend the lifetime of the WSN by reducing its power consumption. The first proposed algorithm is the set-membership normalized least mean squares (SM-NLMS) algorithm. The second is the set-membership recursive least squares ("},"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":"1303.3844","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-03-15T18:16:41Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"af9886086892f89563761b1dbba6e599c9d095a38474561e4d4bfb89e7caceb3","abstract_canon_sha256":"fc4e5ee8731dc390b0d1dc1265ef3d96a108f64f31910d2e33a89cd5822cb086"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:30:42.900778Z","signature_b64":"QjjA4jDOHuIh1wYQuyJHJN9DuDv53ge6qsObG/X1imr7ztwNve45qj2YvTmHLjgZIl0jSYD2sb9H2M6rqvE2DA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9165f2f080d70e503ed5ea183a1526ea94cf6b3499454b414e683f17094628de","last_reissued_at":"2026-05-18T03:30:42.899946Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:30:42.899946Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Low-Complexity Channel Estimation with Set-Membership Algorithms for Cooperative Wireless Sensor Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"P. D. Mitchell, R. C. de Lamare, T. Wang","submitted_at":"2013-03-15T18:16:41Z","abstract_excerpt":"In this paper, we consider a general cooperative wireless sensor network (WSN) with multiple hops and the problem of channel estimation. Two matrix-based set-membership algorithms are developed for the estimation of the complex matrix channel parameters. The main goal is to reduce the computational complexity significantly as compared with existing channel estimators and extend the lifetime of the WSN by reducing its power consumption. The first proposed algorithm is the set-membership normalized least mean squares (SM-NLMS) algorithm. The second is the set-membership recursive least squares ("},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1303.3844","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":"1303.3844","created_at":"2026-05-18T03:30:42.900105+00:00"},{"alias_kind":"arxiv_version","alias_value":"1303.3844v1","created_at":"2026-05-18T03:30:42.900105+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1303.3844","created_at":"2026-05-18T03:30:42.900105+00:00"},{"alias_kind":"pith_short_12","alias_value":"SFS7F4EA24HF","created_at":"2026-05-18T12:27:59.945178+00:00"},{"alias_kind":"pith_short_16","alias_value":"SFS7F4EA24HFAPWV","created_at":"2026-05-18T12:27:59.945178+00:00"},{"alias_kind":"pith_short_8","alias_value":"SFS7F4EA","created_at":"2026-05-18T12:27:59.945178+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/SFS7F4EA24HFAPWV5IMDUFJG5K","json":"https://pith.science/pith/SFS7F4EA24HFAPWV5IMDUFJG5K.json","graph_json":"https://pith.science/api/pith-number/SFS7F4EA24HFAPWV5IMDUFJG5K/graph.json","events_json":"https://pith.science/api/pith-number/SFS7F4EA24HFAPWV5IMDUFJG5K/events.json","paper":"https://pith.science/paper/SFS7F4EA"},"agent_actions":{"view_html":"https://pith.science/pith/SFS7F4EA24HFAPWV5IMDUFJG5K","download_json":"https://pith.science/pith/SFS7F4EA24HFAPWV5IMDUFJG5K.json","view_paper":"https://pith.science/paper/SFS7F4EA","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1303.3844&json=true","fetch_graph":"https://pith.science/api/pith-number/SFS7F4EA24HFAPWV5IMDUFJG5K/graph.json","fetch_events":"https://pith.science/api/pith-number/SFS7F4EA24HFAPWV5IMDUFJG5K/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/SFS7F4EA24HFAPWV5IMDUFJG5K/action/timestamp_anchor","attest_storage":"https://pith.science/pith/SFS7F4EA24HFAPWV5IMDUFJG5K/action/storage_attestation","attest_author":"https://pith.science/pith/SFS7F4EA24HFAPWV5IMDUFJG5K/action/author_attestation","sign_citation":"https://pith.science/pith/SFS7F4EA24HFAPWV5IMDUFJG5K/action/citation_signature","submit_replication":"https://pith.science/pith/SFS7F4EA24HFAPWV5IMDUFJG5K/action/replication_record"}},"created_at":"2026-05-18T03:30:42.900105+00:00","updated_at":"2026-05-18T03:30:42.900105+00:00"}