{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:6OSWWIGPMB6DFVSDKKM7YUWWCB","short_pith_number":"pith:6OSWWIGP","canonical_record":{"source":{"id":"1303.2255","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-03-09T19:07:11Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"728206675534e70eb349e9aceee2347907150fcbfe2b9949584312a37cd6ff4a","abstract_canon_sha256":"f280c25e51e0a3b05dc0c302c389ca30734edf90ad713c1317cac0f6d80b0fa3"},"schema_version":"1.0"},"canonical_sha256":"f3a56b20cf607c32d6435299fc52d6104737c567c6d396cbf6c480c8ac20bc34","source":{"kind":"arxiv","id":"1303.2255","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1303.2255","created_at":"2026-05-18T03:31:19Z"},{"alias_kind":"arxiv_version","alias_value":"1303.2255v1","created_at":"2026-05-18T03:31:19Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1303.2255","created_at":"2026-05-18T03:31:19Z"},{"alias_kind":"pith_short_12","alias_value":"6OSWWIGPMB6D","created_at":"2026-05-18T12:27:36Z"},{"alias_kind":"pith_short_16","alias_value":"6OSWWIGPMB6DFVSD","created_at":"2026-05-18T12:27:36Z"},{"alias_kind":"pith_short_8","alias_value":"6OSWWIGP","created_at":"2026-05-18T12:27:36Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:6OSWWIGPMB6DFVSDKKM7YUWWCB","target":"record","payload":{"canonical_record":{"source":{"id":"1303.2255","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-03-09T19:07:11Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"728206675534e70eb349e9aceee2347907150fcbfe2b9949584312a37cd6ff4a","abstract_canon_sha256":"f280c25e51e0a3b05dc0c302c389ca30734edf90ad713c1317cac0f6d80b0fa3"},"schema_version":"1.0"},"canonical_sha256":"f3a56b20cf607c32d6435299fc52d6104737c567c6d396cbf6c480c8ac20bc34","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:31:19.534987Z","signature_b64":"NKFHef/yIPE9hXOfnznR3JJMCmIkDRXG8luM+QF4AJFdVIi3+5PgW//4ZepA41Asg//gYcjcCxhYOleyYIcfDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f3a56b20cf607c32d6435299fc52d6104737c567c6d396cbf6c480c8ac20bc34","last_reissued_at":"2026-05-18T03:31:19.534156Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:31:19.534156Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1303.2255","source_version":1,"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-18T03:31:19Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Xfyx08GYQVpWNYO+qdFRqWs32oUS2sO/B02R0W+mpd5lqRDSUA+3GgaWYqBoYIXkCHJNg8StiCAqCNaZ990tBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T19:27:09.630987Z"},"content_sha256":"069a5257bc4813526e8fae782fcaf66471d41c51acef3236aed8e67d658f3d8f","schema_version":"1.0","event_id":"sha256:069a5257bc4813526e8fae782fcaf66471d41c51acef3236aed8e67d658f3d8f"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:6OSWWIGPMB6DFVSDKKM7YUWWCB","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A Robust Zero-point Attraction LMS Algorithm on Near Sparse System Identification","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Jian Jin, Qing Qu, Yuantao Gu","submitted_at":"2013-03-09T19:07:11Z","abstract_excerpt":"The newly proposed $l_1$ norm constraint zero-point attraction Least Mean Square algorithm (ZA-LMS) demonstrates excellent performance on exact sparse system identification. However, ZA-LMS has less advantage against standard LMS when the system is near sparse. Thus, in this paper, firstly the near sparse system modeling by Generalized Gaussian Distribution is recommended, where the sparsity is defined accordingly. Secondly, two modifications to the ZA-LMS algorithm have been made. The $l_1$ norm penalty is replaced by a partial $l_1$ norm in the cost function, enhancing robustness without inc"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1303.2255","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"},"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-18T03:31:19Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"P0k8Vb/fToQUKsqS4E8vCVrrDw2OJxyiKhuQOhf+Yhf4+FG6dZVHlfbTgW5+I+kT9Uq1ET9i4qG7/1SQUuwiAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T19:27:09.631350Z"},"content_sha256":"e410fd49fa2d792cc2ce9e35652baca32a2ce70cf96246a94afd49cc78412628","schema_version":"1.0","event_id":"sha256:e410fd49fa2d792cc2ce9e35652baca32a2ce70cf96246a94afd49cc78412628"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/6OSWWIGPMB6DFVSDKKM7YUWWCB/bundle.json","state_url":"https://pith.science/pith/6OSWWIGPMB6DFVSDKKM7YUWWCB/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/6OSWWIGPMB6DFVSDKKM7YUWWCB/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-02T19:27:09Z","links":{"resolver":"https://pith.science/pith/6OSWWIGPMB6DFVSDKKM7YUWWCB","bundle":"https://pith.science/pith/6OSWWIGPMB6DFVSDKKM7YUWWCB/bundle.json","state":"https://pith.science/pith/6OSWWIGPMB6DFVSDKKM7YUWWCB/state.json","well_known_bundle":"https://pith.science/.well-known/pith/6OSWWIGPMB6DFVSDKKM7YUWWCB/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:6OSWWIGPMB6DFVSDKKM7YUWWCB","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":"f280c25e51e0a3b05dc0c302c389ca30734edf90ad713c1317cac0f6d80b0fa3","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-03-09T19:07:11Z","title_canon_sha256":"728206675534e70eb349e9aceee2347907150fcbfe2b9949584312a37cd6ff4a"},"schema_version":"1.0","source":{"id":"1303.2255","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1303.2255","created_at":"2026-05-18T03:31:19Z"},{"alias_kind":"arxiv_version","alias_value":"1303.2255v1","created_at":"2026-05-18T03:31:19Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1303.2255","created_at":"2026-05-18T03:31:19Z"},{"alias_kind":"pith_short_12","alias_value":"6OSWWIGPMB6D","created_at":"2026-05-18T12:27:36Z"},{"alias_kind":"pith_short_16","alias_value":"6OSWWIGPMB6DFVSD","created_at":"2026-05-18T12:27:36Z"},{"alias_kind":"pith_short_8","alias_value":"6OSWWIGP","created_at":"2026-05-18T12:27:36Z"}],"graph_snapshots":[{"event_id":"sha256:e410fd49fa2d792cc2ce9e35652baca32a2ce70cf96246a94afd49cc78412628","target":"graph","created_at":"2026-05-18T03:31:19Z","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":"The newly proposed $l_1$ norm constraint zero-point attraction Least Mean Square algorithm (ZA-LMS) demonstrates excellent performance on exact sparse system identification. However, ZA-LMS has less advantage against standard LMS when the system is near sparse. Thus, in this paper, firstly the near sparse system modeling by Generalized Gaussian Distribution is recommended, where the sparsity is defined accordingly. Secondly, two modifications to the ZA-LMS algorithm have been made. The $l_1$ norm penalty is replaced by a partial $l_1$ norm in the cost function, enhancing robustness without inc","authors_text":"Jian Jin, Qing Qu, Yuantao Gu","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-03-09T19:07:11Z","title":"A Robust Zero-point Attraction LMS Algorithm on Near Sparse System Identification"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1303.2255","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:069a5257bc4813526e8fae782fcaf66471d41c51acef3236aed8e67d658f3d8f","target":"record","created_at":"2026-05-18T03:31:19Z","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":"f280c25e51e0a3b05dc0c302c389ca30734edf90ad713c1317cac0f6d80b0fa3","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-03-09T19:07:11Z","title_canon_sha256":"728206675534e70eb349e9aceee2347907150fcbfe2b9949584312a37cd6ff4a"},"schema_version":"1.0","source":{"id":"1303.2255","kind":"arxiv","version":1}},"canonical_sha256":"f3a56b20cf607c32d6435299fc52d6104737c567c6d396cbf6c480c8ac20bc34","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"f3a56b20cf607c32d6435299fc52d6104737c567c6d396cbf6c480c8ac20bc34","first_computed_at":"2026-05-18T03:31:19.534156Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:31:19.534156Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"NKFHef/yIPE9hXOfnznR3JJMCmIkDRXG8luM+QF4AJFdVIi3+5PgW//4ZepA41Asg//gYcjcCxhYOleyYIcfDg==","signature_status":"signed_v1","signed_at":"2026-05-18T03:31:19.534987Z","signed_message":"canonical_sha256_bytes"},"source_id":"1303.2255","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:069a5257bc4813526e8fae782fcaf66471d41c51acef3236aed8e67d658f3d8f","sha256:e410fd49fa2d792cc2ce9e35652baca32a2ce70cf96246a94afd49cc78412628"],"state_sha256":"bcf2eaadfb78369be77160c92107fb384a7d592e690e5b1aaf11689398adf261"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"9sDclt8qUme4fVMqHzC8VyoCdnXDKTnrkb4VbCAxBqmbCVAG5RU3NepHfiOOx6Egxnl+xW1m51Lu+2TxENamDg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-02T19:27:09.633330Z","bundle_sha256":"30f891ab7ef625f8f876c179301f6c08993afdbae7898ac21dde5a61f7d87559"}}