{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2012:VYF6CJD4Y4PMQR42P3COVJCVRF","short_pith_number":"pith:VYF6CJD4","schema_version":"1.0","canonical_sha256":"ae0be1247cc71ec8479a7ec4eaa4558978690c69615cb7b5b669e6861881f6e3","source":{"kind":"arxiv","id":"1203.1535","version":2},"attestation_state":"computed","paper":{"title":"Performance Analysis of l_0 Norm Constraint Least Mean Square Algorithm","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.PF","math.IT"],"primary_cat":"cs.IT","authors_text":"Guolong Su, Jian Jin, Jian Wang, Yuantao Gu","submitted_at":"2012-03-07T16:43:45Z","abstract_excerpt":"As one of the recently proposed algorithms for sparse system identification, $l_0$ norm constraint Least Mean Square ($l_0$-LMS) algorithm modifies the cost function of the traditional method with a penalty of tap-weight sparsity. The performance of $l_0$-LMS is quite attractive compared with its various precursors. However, there has been no detailed study of its performance. This paper presents all-around and throughout theoretical performance analysis of $l_0$-LMS for white Gaussian input data based on some reasonable assumptions. Expressions for steady-state mean square deviation (MSD) are"},"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":"1203.1535","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2012-03-07T16:43:45Z","cross_cats_sorted":["cs.PF","math.IT"],"title_canon_sha256":"b0dc96fbdc5258631548a5d254d5818ece4695c5ff90e61c6227ff9dee4a1f1b","abstract_canon_sha256":"f8d01bb9afc8020b7568c796519d4770252b83c42ced2384ff5eff1542b3ac93"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:58:13.630661Z","signature_b64":"6WZizNlGSjkCgCpc1N/DIHJs0LHWMvCa1SD4+StMjvKYZ4cKaZKer7MJLKPpeEPoIPOBBo2vCPeiFpB7ujMfBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ae0be1247cc71ec8479a7ec4eaa4558978690c69615cb7b5b669e6861881f6e3","last_reissued_at":"2026-05-18T01:58:13.629869Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:58:13.629869Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Performance Analysis of l_0 Norm Constraint Least Mean Square Algorithm","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.PF","math.IT"],"primary_cat":"cs.IT","authors_text":"Guolong Su, Jian Jin, Jian Wang, Yuantao Gu","submitted_at":"2012-03-07T16:43:45Z","abstract_excerpt":"As one of the recently proposed algorithms for sparse system identification, $l_0$ norm constraint Least Mean Square ($l_0$-LMS) algorithm modifies the cost function of the traditional method with a penalty of tap-weight sparsity. The performance of $l_0$-LMS is quite attractive compared with its various precursors. However, there has been no detailed study of its performance. This paper presents all-around and throughout theoretical performance analysis of $l_0$-LMS for white Gaussian input data based on some reasonable assumptions. Expressions for steady-state mean square deviation (MSD) are"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1203.1535","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":"1203.1535","created_at":"2026-05-18T01:58:13.630008+00:00"},{"alias_kind":"arxiv_version","alias_value":"1203.1535v2","created_at":"2026-05-18T01:58:13.630008+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1203.1535","created_at":"2026-05-18T01:58:13.630008+00:00"},{"alias_kind":"pith_short_12","alias_value":"VYF6CJD4Y4PM","created_at":"2026-05-18T12:27:25.539911+00:00"},{"alias_kind":"pith_short_16","alias_value":"VYF6CJD4Y4PMQR42","created_at":"2026-05-18T12:27:25.539911+00:00"},{"alias_kind":"pith_short_8","alias_value":"VYF6CJD4","created_at":"2026-05-18T12:27:25.539911+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/VYF6CJD4Y4PMQR42P3COVJCVRF","json":"https://pith.science/pith/VYF6CJD4Y4PMQR42P3COVJCVRF.json","graph_json":"https://pith.science/api/pith-number/VYF6CJD4Y4PMQR42P3COVJCVRF/graph.json","events_json":"https://pith.science/api/pith-number/VYF6CJD4Y4PMQR42P3COVJCVRF/events.json","paper":"https://pith.science/paper/VYF6CJD4"},"agent_actions":{"view_html":"https://pith.science/pith/VYF6CJD4Y4PMQR42P3COVJCVRF","download_json":"https://pith.science/pith/VYF6CJD4Y4PMQR42P3COVJCVRF.json","view_paper":"https://pith.science/paper/VYF6CJD4","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1203.1535&json=true","fetch_graph":"https://pith.science/api/pith-number/VYF6CJD4Y4PMQR42P3COVJCVRF/graph.json","fetch_events":"https://pith.science/api/pith-number/VYF6CJD4Y4PMQR42P3COVJCVRF/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/VYF6CJD4Y4PMQR42P3COVJCVRF/action/timestamp_anchor","attest_storage":"https://pith.science/pith/VYF6CJD4Y4PMQR42P3COVJCVRF/action/storage_attestation","attest_author":"https://pith.science/pith/VYF6CJD4Y4PMQR42P3COVJCVRF/action/author_attestation","sign_citation":"https://pith.science/pith/VYF6CJD4Y4PMQR42P3COVJCVRF/action/citation_signature","submit_replication":"https://pith.science/pith/VYF6CJD4Y4PMQR42P3COVJCVRF/action/replication_record"}},"created_at":"2026-05-18T01:58:13.630008+00:00","updated_at":"2026-05-18T01:58:13.630008+00:00"}