{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:2XCZ2GTZKP6GPIK2VCTHKJQIVK","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"27fb4030390d318e3fa16bd63b5bd44ecba0bdfdde2e516316245f8ab9d9056c","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-03-03T01:02:49Z","title_canon_sha256":"72fc4d409ec25268857924f021a6eaff590ae5c14b0e2a2eb251165fd1514341"},"schema_version":"1.0","source":{"id":"1503.00792","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1503.00792","created_at":"2026-05-18T02:25:48Z"},{"alias_kind":"arxiv_version","alias_value":"1503.00792v1","created_at":"2026-05-18T02:25:48Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1503.00792","created_at":"2026-05-18T02:25:48Z"},{"alias_kind":"pith_short_12","alias_value":"2XCZ2GTZKP6G","created_at":"2026-05-18T12:29:02Z"},{"alias_kind":"pith_short_16","alias_value":"2XCZ2GTZKP6GPIK2","created_at":"2026-05-18T12:29:02Z"},{"alias_kind":"pith_short_8","alias_value":"2XCZ2GTZ","created_at":"2026-05-18T12:29:02Z"}],"graph_snapshots":[{"event_id":"sha256:b90a069e3b63d88390449e11494f1033f37c32146e78ba33a8037a16f90907dc","target":"graph","created_at":"2026-05-18T02:25:48Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"abstract_excerpt":"For identifying the non-Gaussian impulsive noise systems, normalized LMP (NLMP) has been proposed to combat impulsive-inducing instability. However, the standard algorithm is without considering the inherent sparse structure distribution of unknown system. To exploit sparsity as well as to mitigate the impulsive noise, this paper proposes a sparse NLMP algorithm, i.e., Correntropy Induced Metric (CIM) constraint based NLMP (CIMNLMP). Based on the first proposed algorithm, moreover, we propose an improved CIM constraint variable regularized NLMP(CIMVRNLMP) algorithm by utilizing variable regula","authors_text":"Badong Chen, Guan Gui, Hua Qu, Jihong Zhao, Wentao Ma","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-03-03T01:02:49Z","title":"Sparsity Aware Normalized Least Mean p-power Algorithms with Correntropy Induced Metric Penalty"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1503.00792","kind":"arxiv","version":1},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:6e400504c5d1a24991a628c0b68864ac3c0c3b7f90e6bf6fb40b01696a1ee3b5","target":"record","created_at":"2026-05-18T02:25:48Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"27fb4030390d318e3fa16bd63b5bd44ecba0bdfdde2e516316245f8ab9d9056c","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-03-03T01:02:49Z","title_canon_sha256":"72fc4d409ec25268857924f021a6eaff590ae5c14b0e2a2eb251165fd1514341"},"schema_version":"1.0","source":{"id":"1503.00792","kind":"arxiv","version":1}},"canonical_sha256":"d5c59d1a7953fc67a15aa8a6752608aa873175e1b318d4e68c8458aafc747ba9","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"d5c59d1a7953fc67a15aa8a6752608aa873175e1b318d4e68c8458aafc747ba9","first_computed_at":"2026-05-18T02:25:48.391753Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:25:48.391753Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"QEeaKjO4B8wwLGyj7m2GV+enf6tFVct4r+3YeBFTw5rCxG5I/cDyqziZmFbMytKntY9yUxCdeazSvq8CTz79BA==","signature_status":"signed_v1","signed_at":"2026-05-18T02:25:48.392187Z","signed_message":"canonical_sha256_bytes"},"source_id":"1503.00792","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:6e400504c5d1a24991a628c0b68864ac3c0c3b7f90e6bf6fb40b01696a1ee3b5","sha256:b90a069e3b63d88390449e11494f1033f37c32146e78ba33a8037a16f90907dc"],"state_sha256":"0efec9fdebde3bfacaf6642c272087f9b5e6b673ec9dba24f82c1344728c24cb"}