{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:PBTHS2ZCRRDNNMONTUYSLEXY7I","short_pith_number":"pith:PBTHS2ZC","schema_version":"1.0","canonical_sha256":"7866796b228c46d6b1cd9d312592f8fa2476511c96b784299f8908db4b70759a","source":{"kind":"arxiv","id":"1504.03077","version":1},"attestation_state":"computed","paper":{"title":"Iterative-Promoting Variable Step-size Least Mean Square Algorithm For Adaptive Sparse Channel Estimation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.SY","authors_text":"Beiyi Liu, Guan Gui, Li Xu","submitted_at":"2015-04-13T07:06:04Z","abstract_excerpt":"Least mean square (LMS) type adaptive algorithms have attracted much attention due to their low computational complexity. In the scenarios of sparse channel estimation, zero-attracting LMS (ZA-LMS), reweighted ZA-LMS (RZA-LMS) and reweighted -norm LMS (RL1-LMS) have been proposed to exploit channel sparsity. However, these proposed algorithms may hard to make tradeoff between convergence speed and estimation performance with only one step-size. To solve this problem, we propose three sparse iterative-promoting variable step-size LMS (IP-VSS-LMS) algorithms with sparse constraints, i.e. ZA, RZA"},"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":"1504.03077","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SY","submitted_at":"2015-04-13T07:06:04Z","cross_cats_sorted":[],"title_canon_sha256":"f09fa336d6a2242e5245c13f8a26b47841d88d270285ca2ee798c1c43a330320","abstract_canon_sha256":"a31a4cd15aa3728ad538025a7039e6c1b60379dafb660c6e2d3cb75d6d327bbf"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:18:59.285766Z","signature_b64":"a8LsBVUoLKGZbZuY3si4XwWWDJk+pHS0yqiQfi3yjoW3UPOoVMil4CX5i3k/PiEqGqUvC2BO50h59XJbFaWhBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"7866796b228c46d6b1cd9d312592f8fa2476511c96b784299f8908db4b70759a","last_reissued_at":"2026-05-18T02:18:59.285213Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:18:59.285213Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Iterative-Promoting Variable Step-size Least Mean Square Algorithm For Adaptive Sparse Channel Estimation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.SY","authors_text":"Beiyi Liu, Guan Gui, Li Xu","submitted_at":"2015-04-13T07:06:04Z","abstract_excerpt":"Least mean square (LMS) type adaptive algorithms have attracted much attention due to their low computational complexity. In the scenarios of sparse channel estimation, zero-attracting LMS (ZA-LMS), reweighted ZA-LMS (RZA-LMS) and reweighted -norm LMS (RL1-LMS) have been proposed to exploit channel sparsity. However, these proposed algorithms may hard to make tradeoff between convergence speed and estimation performance with only one step-size. To solve this problem, we propose three sparse iterative-promoting variable step-size LMS (IP-VSS-LMS) algorithms with sparse constraints, i.e. ZA, RZA"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1504.03077","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":"1504.03077","created_at":"2026-05-18T02:18:59.285295+00:00"},{"alias_kind":"arxiv_version","alias_value":"1504.03077v1","created_at":"2026-05-18T02:18:59.285295+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1504.03077","created_at":"2026-05-18T02:18:59.285295+00:00"},{"alias_kind":"pith_short_12","alias_value":"PBTHS2ZCRRDN","created_at":"2026-05-18T12:29:37.295048+00:00"},{"alias_kind":"pith_short_16","alias_value":"PBTHS2ZCRRDNNMON","created_at":"2026-05-18T12:29:37.295048+00:00"},{"alias_kind":"pith_short_8","alias_value":"PBTHS2ZC","created_at":"2026-05-18T12:29:37.295048+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/PBTHS2ZCRRDNNMONTUYSLEXY7I","json":"https://pith.science/pith/PBTHS2ZCRRDNNMONTUYSLEXY7I.json","graph_json":"https://pith.science/api/pith-number/PBTHS2ZCRRDNNMONTUYSLEXY7I/graph.json","events_json":"https://pith.science/api/pith-number/PBTHS2ZCRRDNNMONTUYSLEXY7I/events.json","paper":"https://pith.science/paper/PBTHS2ZC"},"agent_actions":{"view_html":"https://pith.science/pith/PBTHS2ZCRRDNNMONTUYSLEXY7I","download_json":"https://pith.science/pith/PBTHS2ZCRRDNNMONTUYSLEXY7I.json","view_paper":"https://pith.science/paper/PBTHS2ZC","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1504.03077&json=true","fetch_graph":"https://pith.science/api/pith-number/PBTHS2ZCRRDNNMONTUYSLEXY7I/graph.json","fetch_events":"https://pith.science/api/pith-number/PBTHS2ZCRRDNNMONTUYSLEXY7I/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/PBTHS2ZCRRDNNMONTUYSLEXY7I/action/timestamp_anchor","attest_storage":"https://pith.science/pith/PBTHS2ZCRRDNNMONTUYSLEXY7I/action/storage_attestation","attest_author":"https://pith.science/pith/PBTHS2ZCRRDNNMONTUYSLEXY7I/action/author_attestation","sign_citation":"https://pith.science/pith/PBTHS2ZCRRDNNMONTUYSLEXY7I/action/citation_signature","submit_replication":"https://pith.science/pith/PBTHS2ZCRRDNNMONTUYSLEXY7I/action/replication_record"}},"created_at":"2026-05-18T02:18:59.285295+00:00","updated_at":"2026-05-18T02:18:59.285295+00:00"}