{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:NTIYOVNGDF5O2GZLU4YBONRZHS","short_pith_number":"pith:NTIYOVNG","schema_version":"1.0","canonical_sha256":"6cd18755a6197aed1b2ba7301736393c81638e42cd3473c95e53fa0f49aea8bd","source":{"kind":"arxiv","id":"1503.01185","version":3},"attestation_state":"computed","paper":{"title":"Gradient Compared Lp-LMS Algorithms for Sparse System Identification","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.SY","authors_text":"Huazhong Shu, Jiasong Wu, Limin Luo, Rui Zeng, Yong Feng","submitted_at":"2015-03-04T01:17:27Z","abstract_excerpt":"In this paper, we propose two novel p-norm penalty least mean square (Lp-LMS) algorithms as supplements of the conventional Lp-LMS algorithm established for sparse adaptive filtering recently. A gradient comparator is employed to selectively apply the zero attractor of p-norm constraint for only those taps that have the same polarity as that of the gradient of the squared instantaneous error, which leads to the new proposed gradient compared p-norm constraint LMS algorithm (LpGC-LMS). We explain that the LpGC-LMS can achieve lower mean square error than the standard Lp-LMS algorithm theoretica"},"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":"1503.01185","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SY","submitted_at":"2015-03-04T01:17:27Z","cross_cats_sorted":[],"title_canon_sha256":"f471d19505261f6bea226150d606040b7c890bde6ac2a7c8ca7ce7f49ef1cb21","abstract_canon_sha256":"775daf1914184ce65b8a05c5572277ac3af6c884b3b5c59008c55c8989d76a96"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:25:18.058491Z","signature_b64":"XbmrGUts7K/7VN1GdsDXkTADCnEMifyIH3hFjxIw9RCfko1yubPv/kHkbBqWRqtzD1722AoEYLr0zJ0lSK0vCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6cd18755a6197aed1b2ba7301736393c81638e42cd3473c95e53fa0f49aea8bd","last_reissued_at":"2026-05-18T02:25:18.058114Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:25:18.058114Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Gradient Compared Lp-LMS Algorithms for Sparse System Identification","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.SY","authors_text":"Huazhong Shu, Jiasong Wu, Limin Luo, Rui Zeng, Yong Feng","submitted_at":"2015-03-04T01:17:27Z","abstract_excerpt":"In this paper, we propose two novel p-norm penalty least mean square (Lp-LMS) algorithms as supplements of the conventional Lp-LMS algorithm established for sparse adaptive filtering recently. A gradient comparator is employed to selectively apply the zero attractor of p-norm constraint for only those taps that have the same polarity as that of the gradient of the squared instantaneous error, which leads to the new proposed gradient compared p-norm constraint LMS algorithm (LpGC-LMS). We explain that the LpGC-LMS can achieve lower mean square error than the standard Lp-LMS algorithm theoretica"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1503.01185","kind":"arxiv","version":3},"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":"1503.01185","created_at":"2026-05-18T02:25:18.058170+00:00"},{"alias_kind":"arxiv_version","alias_value":"1503.01185v3","created_at":"2026-05-18T02:25:18.058170+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1503.01185","created_at":"2026-05-18T02:25:18.058170+00:00"},{"alias_kind":"pith_short_12","alias_value":"NTIYOVNGDF5O","created_at":"2026-05-18T12:29:34.919912+00:00"},{"alias_kind":"pith_short_16","alias_value":"NTIYOVNGDF5O2GZL","created_at":"2026-05-18T12:29:34.919912+00:00"},{"alias_kind":"pith_short_8","alias_value":"NTIYOVNG","created_at":"2026-05-18T12:29:34.919912+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/NTIYOVNGDF5O2GZLU4YBONRZHS","json":"https://pith.science/pith/NTIYOVNGDF5O2GZLU4YBONRZHS.json","graph_json":"https://pith.science/api/pith-number/NTIYOVNGDF5O2GZLU4YBONRZHS/graph.json","events_json":"https://pith.science/api/pith-number/NTIYOVNGDF5O2GZLU4YBONRZHS/events.json","paper":"https://pith.science/paper/NTIYOVNG"},"agent_actions":{"view_html":"https://pith.science/pith/NTIYOVNGDF5O2GZLU4YBONRZHS","download_json":"https://pith.science/pith/NTIYOVNGDF5O2GZLU4YBONRZHS.json","view_paper":"https://pith.science/paper/NTIYOVNG","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1503.01185&json=true","fetch_graph":"https://pith.science/api/pith-number/NTIYOVNGDF5O2GZLU4YBONRZHS/graph.json","fetch_events":"https://pith.science/api/pith-number/NTIYOVNGDF5O2GZLU4YBONRZHS/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/NTIYOVNGDF5O2GZLU4YBONRZHS/action/timestamp_anchor","attest_storage":"https://pith.science/pith/NTIYOVNGDF5O2GZLU4YBONRZHS/action/storage_attestation","attest_author":"https://pith.science/pith/NTIYOVNGDF5O2GZLU4YBONRZHS/action/author_attestation","sign_citation":"https://pith.science/pith/NTIYOVNGDF5O2GZLU4YBONRZHS/action/citation_signature","submit_replication":"https://pith.science/pith/NTIYOVNGDF5O2GZLU4YBONRZHS/action/replication_record"}},"created_at":"2026-05-18T02:25:18.058170+00:00","updated_at":"2026-05-18T02:25:18.058170+00:00"}