{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:V35Y6SCP7LCJQ4D5QCZW3E3ZFV","short_pith_number":"pith:V35Y6SCP","schema_version":"1.0","canonical_sha256":"aefb8f484ffac498707d80b36d93792d66c5fea49a2ffc5b11b58ea6ca719605","source":{"kind":"arxiv","id":"1407.6078","version":1},"attestation_state":"computed","paper":{"title":"Extra Gain:Improved Sparse Channel Estimation Using Reweighted l_1-norm Penalized LMS/F Algorithm","license":"http://creativecommons.org/licenses/by-nc-sa/3.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Fumiyuki Adachi, Guan Gui, Li Xu","submitted_at":"2014-07-23T00:50:51Z","abstract_excerpt":"The channel estimation is one of important techniques to ensure reliable broadband signal transmission. Broadband channels are often modeled as a sparse channel. Comparing with traditional dense-assumption based linear channel estimation methods, e.g., least mean square/fourth (LMS/F) algorithm, exploiting sparse structure information can get extra performance gain. By introducing l_1-norm penalty, two sparse LMS/F algorithms, (zero-attracting LMSF, ZA-LMS/F and reweighted ZA-LMSF, RZA-LMSF), have been proposed [1]. Motivated by existing reweighted l_1-norm (RL1) sparse algorithm in compressiv"},"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":"1407.6078","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-sa/3.0/","primary_cat":"cs.IT","submitted_at":"2014-07-23T00:50:51Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"90b52be968eac9f127a0e0e887d6a8c8a40b7ca8633d5eb84a39e028a2f93025","abstract_canon_sha256":"94dba926cb7e6d2d5c72c3f52d9387c4f949339732592c741cfde01db567f175"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:46:59.132805Z","signature_b64":"1TdIzFZONTuScL1xdcd7UjjNoUFtBbgogGMwaRQiEElhEDegL9EMcMNcZIBADIbu4q4kucefRtMxZciLly1ZCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"aefb8f484ffac498707d80b36d93792d66c5fea49a2ffc5b11b58ea6ca719605","last_reissued_at":"2026-05-18T02:46:59.132062Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:46:59.132062Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Extra Gain:Improved Sparse Channel Estimation Using Reweighted l_1-norm Penalized LMS/F Algorithm","license":"http://creativecommons.org/licenses/by-nc-sa/3.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Fumiyuki Adachi, Guan Gui, Li Xu","submitted_at":"2014-07-23T00:50:51Z","abstract_excerpt":"The channel estimation is one of important techniques to ensure reliable broadband signal transmission. Broadband channels are often modeled as a sparse channel. Comparing with traditional dense-assumption based linear channel estimation methods, e.g., least mean square/fourth (LMS/F) algorithm, exploiting sparse structure information can get extra performance gain. By introducing l_1-norm penalty, two sparse LMS/F algorithms, (zero-attracting LMSF, ZA-LMS/F and reweighted ZA-LMSF, RZA-LMSF), have been proposed [1]. Motivated by existing reweighted l_1-norm (RL1) sparse algorithm in compressiv"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1407.6078","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":"1407.6078","created_at":"2026-05-18T02:46:59.132184+00:00"},{"alias_kind":"arxiv_version","alias_value":"1407.6078v1","created_at":"2026-05-18T02:46:59.132184+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1407.6078","created_at":"2026-05-18T02:46:59.132184+00:00"},{"alias_kind":"pith_short_12","alias_value":"V35Y6SCP7LCJ","created_at":"2026-05-18T12:28:52.271510+00:00"},{"alias_kind":"pith_short_16","alias_value":"V35Y6SCP7LCJQ4D5","created_at":"2026-05-18T12:28:52.271510+00:00"},{"alias_kind":"pith_short_8","alias_value":"V35Y6SCP","created_at":"2026-05-18T12:28:52.271510+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/V35Y6SCP7LCJQ4D5QCZW3E3ZFV","json":"https://pith.science/pith/V35Y6SCP7LCJQ4D5QCZW3E3ZFV.json","graph_json":"https://pith.science/api/pith-number/V35Y6SCP7LCJQ4D5QCZW3E3ZFV/graph.json","events_json":"https://pith.science/api/pith-number/V35Y6SCP7LCJQ4D5QCZW3E3ZFV/events.json","paper":"https://pith.science/paper/V35Y6SCP"},"agent_actions":{"view_html":"https://pith.science/pith/V35Y6SCP7LCJQ4D5QCZW3E3ZFV","download_json":"https://pith.science/pith/V35Y6SCP7LCJQ4D5QCZW3E3ZFV.json","view_paper":"https://pith.science/paper/V35Y6SCP","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1407.6078&json=true","fetch_graph":"https://pith.science/api/pith-number/V35Y6SCP7LCJQ4D5QCZW3E3ZFV/graph.json","fetch_events":"https://pith.science/api/pith-number/V35Y6SCP7LCJQ4D5QCZW3E3ZFV/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/V35Y6SCP7LCJQ4D5QCZW3E3ZFV/action/timestamp_anchor","attest_storage":"https://pith.science/pith/V35Y6SCP7LCJQ4D5QCZW3E3ZFV/action/storage_attestation","attest_author":"https://pith.science/pith/V35Y6SCP7LCJQ4D5QCZW3E3ZFV/action/author_attestation","sign_citation":"https://pith.science/pith/V35Y6SCP7LCJQ4D5QCZW3E3ZFV/action/citation_signature","submit_replication":"https://pith.science/pith/V35Y6SCP7LCJQ4D5QCZW3E3ZFV/action/replication_record"}},"created_at":"2026-05-18T02:46:59.132184+00:00","updated_at":"2026-05-18T02:46:59.132184+00:00"}