{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:NTIYOVNGDF5O2GZLU4YBONRZHS","short_pith_number":"pith:NTIYOVNG","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"},"canonical_sha256":"6cd18755a6197aed1b2ba7301736393c81638e42cd3473c95e53fa0f49aea8bd","source":{"kind":"arxiv","id":"1503.01185","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1503.01185","created_at":"2026-05-18T02:25:18Z"},{"alias_kind":"arxiv_version","alias_value":"1503.01185v3","created_at":"2026-05-18T02:25:18Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1503.01185","created_at":"2026-05-18T02:25:18Z"},{"alias_kind":"pith_short_12","alias_value":"NTIYOVNGDF5O","created_at":"2026-05-18T12:29:34Z"},{"alias_kind":"pith_short_16","alias_value":"NTIYOVNGDF5O2GZL","created_at":"2026-05-18T12:29:34Z"},{"alias_kind":"pith_short_8","alias_value":"NTIYOVNG","created_at":"2026-05-18T12:29:34Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:NTIYOVNGDF5O2GZLU4YBONRZHS","target":"record","payload":{"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"},"canonical_sha256":"6cd18755a6197aed1b2ba7301736393c81638e42cd3473c95e53fa0f49aea8bd","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"},"source_kind":"arxiv","source_id":"1503.01185","source_version":3,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T02:25:18Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"yhqKhEmbLT6wdmLVbR8nYAQRykOGDip8Y19c1koMU89Ggr2aKZV6FoCWJfetW+Kca2Yq/mrDU65zsp9ayOn2Cg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-21T21:52:37.644374Z"},"content_sha256":"9db878ba340f782a8085f46a5d19dc8e1a98d276e04860115a50622b82b6b518","schema_version":"1.0","event_id":"sha256:9db878ba340f782a8085f46a5d19dc8e1a98d276e04860115a50622b82b6b518"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:NTIYOVNGDF5O2GZLU4YBONRZHS","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T02:25:18Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"I4W9hjaS9fYVWjATMlwjr10qc+nfWoTzOgIpB0lKvmiQu4e3cIxlZf2b0PFPIVrR7DdIM2KniXHu33P4IgfYCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-21T21:52:37.644727Z"},"content_sha256":"b247a4aec1d3c4baa8a81c370acf36ec0447c637113c90925ddd82b987d52d22","schema_version":"1.0","event_id":"sha256:b247a4aec1d3c4baa8a81c370acf36ec0447c637113c90925ddd82b987d52d22"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/NTIYOVNGDF5O2GZLU4YBONRZHS/bundle.json","state_url":"https://pith.science/pith/NTIYOVNGDF5O2GZLU4YBONRZHS/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/NTIYOVNGDF5O2GZLU4YBONRZHS/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-06-21T21:52:37Z","links":{"resolver":"https://pith.science/pith/NTIYOVNGDF5O2GZLU4YBONRZHS","bundle":"https://pith.science/pith/NTIYOVNGDF5O2GZLU4YBONRZHS/bundle.json","state":"https://pith.science/pith/NTIYOVNGDF5O2GZLU4YBONRZHS/state.json","well_known_bundle":"https://pith.science/.well-known/pith/NTIYOVNGDF5O2GZLU4YBONRZHS/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:NTIYOVNGDF5O2GZLU4YBONRZHS","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":"775daf1914184ce65b8a05c5572277ac3af6c884b3b5c59008c55c8989d76a96","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SY","submitted_at":"2015-03-04T01:17:27Z","title_canon_sha256":"f471d19505261f6bea226150d606040b7c890bde6ac2a7c8ca7ce7f49ef1cb21"},"schema_version":"1.0","source":{"id":"1503.01185","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1503.01185","created_at":"2026-05-18T02:25:18Z"},{"alias_kind":"arxiv_version","alias_value":"1503.01185v3","created_at":"2026-05-18T02:25:18Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1503.01185","created_at":"2026-05-18T02:25:18Z"},{"alias_kind":"pith_short_12","alias_value":"NTIYOVNGDF5O","created_at":"2026-05-18T12:29:34Z"},{"alias_kind":"pith_short_16","alias_value":"NTIYOVNGDF5O2GZL","created_at":"2026-05-18T12:29:34Z"},{"alias_kind":"pith_short_8","alias_value":"NTIYOVNG","created_at":"2026-05-18T12:29:34Z"}],"graph_snapshots":[{"event_id":"sha256:b247a4aec1d3c4baa8a81c370acf36ec0447c637113c90925ddd82b987d52d22","target":"graph","created_at":"2026-05-18T02:25:18Z","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":"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","authors_text":"Huazhong Shu, Jiasong Wu, Limin Luo, Rui Zeng, Yong Feng","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SY","submitted_at":"2015-03-04T01:17:27Z","title":"Gradient Compared Lp-LMS Algorithms for Sparse System Identification"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1503.01185","kind":"arxiv","version":3},"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:9db878ba340f782a8085f46a5d19dc8e1a98d276e04860115a50622b82b6b518","target":"record","created_at":"2026-05-18T02:25:18Z","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":"775daf1914184ce65b8a05c5572277ac3af6c884b3b5c59008c55c8989d76a96","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SY","submitted_at":"2015-03-04T01:17:27Z","title_canon_sha256":"f471d19505261f6bea226150d606040b7c890bde6ac2a7c8ca7ce7f49ef1cb21"},"schema_version":"1.0","source":{"id":"1503.01185","kind":"arxiv","version":3}},"canonical_sha256":"6cd18755a6197aed1b2ba7301736393c81638e42cd3473c95e53fa0f49aea8bd","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"6cd18755a6197aed1b2ba7301736393c81638e42cd3473c95e53fa0f49aea8bd","first_computed_at":"2026-05-18T02:25:18.058114Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:25:18.058114Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"XbmrGUts7K/7VN1GdsDXkTADCnEMifyIH3hFjxIw9RCfko1yubPv/kHkbBqWRqtzD1722AoEYLr0zJ0lSK0vCQ==","signature_status":"signed_v1","signed_at":"2026-05-18T02:25:18.058491Z","signed_message":"canonical_sha256_bytes"},"source_id":"1503.01185","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:9db878ba340f782a8085f46a5d19dc8e1a98d276e04860115a50622b82b6b518","sha256:b247a4aec1d3c4baa8a81c370acf36ec0447c637113c90925ddd82b987d52d22"],"state_sha256":"219ae344bc27cff5b67f512c21f8c7f24f8726ec655da7cf094b073345bfda82"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"1KBRGPxRFZ5ZyfuzYnZs+6QI7hnYH8vHXjjvI9xfnVu72NQbcjRfBOSbAPPkvQYlO5S+HFXssl7kBiNHR9BlDg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-21T21:52:37.646672Z","bundle_sha256":"256eeb404426e551b25bb81d2939b7a35f707d552a2ac383c69b63805536d319"}}