{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:PBTHS2ZCRRDNNMONTUYSLEXY7I","short_pith_number":"pith:PBTHS2ZC","canonical_record":{"source":{"id":"1504.03077","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SY","submitted_at":"2015-04-13T07:06:04Z","cross_cats_sorted":[],"title_canon_sha256":"f09fa336d6a2242e5245c13f8a26b47841d88d270285ca2ee798c1c43a330320","abstract_canon_sha256":"a31a4cd15aa3728ad538025a7039e6c1b60379dafb660c6e2d3cb75d6d327bbf"},"schema_version":"1.0"},"canonical_sha256":"7866796b228c46d6b1cd9d312592f8fa2476511c96b784299f8908db4b70759a","source":{"kind":"arxiv","id":"1504.03077","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1504.03077","created_at":"2026-05-18T02:18:59Z"},{"alias_kind":"arxiv_version","alias_value":"1504.03077v1","created_at":"2026-05-18T02:18:59Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1504.03077","created_at":"2026-05-18T02:18:59Z"},{"alias_kind":"pith_short_12","alias_value":"PBTHS2ZCRRDN","created_at":"2026-05-18T12:29:37Z"},{"alias_kind":"pith_short_16","alias_value":"PBTHS2ZCRRDNNMON","created_at":"2026-05-18T12:29:37Z"},{"alias_kind":"pith_short_8","alias_value":"PBTHS2ZC","created_at":"2026-05-18T12:29:37Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:PBTHS2ZCRRDNNMONTUYSLEXY7I","target":"record","payload":{"canonical_record":{"source":{"id":"1504.03077","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SY","submitted_at":"2015-04-13T07:06:04Z","cross_cats_sorted":[],"title_canon_sha256":"f09fa336d6a2242e5245c13f8a26b47841d88d270285ca2ee798c1c43a330320","abstract_canon_sha256":"a31a4cd15aa3728ad538025a7039e6c1b60379dafb660c6e2d3cb75d6d327bbf"},"schema_version":"1.0"},"canonical_sha256":"7866796b228c46d6b1cd9d312592f8fa2476511c96b784299f8908db4b70759a","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:18:59.285766Z","signature_b64":"a8LsBVUoLKGZbZuY3si4XwWWDJk+pHS0yqiQfi3yjoW3UPOoVMil4CX5i3k/PiEqGqUvC2BO50h59XJbFaWhBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"7866796b228c46d6b1cd9d312592f8fa2476511c96b784299f8908db4b70759a","last_reissued_at":"2026-05-18T02:18:59.285213Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:18:59.285213Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1504.03077","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-18T02:18:59Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"uu1nBO8ooDbX0CpaSW0qfMuB4TnZVXn/jX/zVx6AZ1zwZPnu+2GuEFhnHd9RS5WonNekjvzDB3xiJyAL4zvoAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-11T16:53:32.392958Z"},"content_sha256":"353bf902ca5783417b38502e5865d5c0d17379b99c3145a7e9548ffbd10090b7","schema_version":"1.0","event_id":"sha256:353bf902ca5783417b38502e5865d5c0d17379b99c3145a7e9548ffbd10090b7"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:PBTHS2ZCRRDNNMONTUYSLEXY7I","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Iterative-Promoting Variable Step-size Least Mean Square Algorithm For Adaptive Sparse Channel Estimation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.SY","authors_text":"Beiyi Liu, Guan Gui, Li Xu","submitted_at":"2015-04-13T07:06:04Z","abstract_excerpt":"Least mean square (LMS) type adaptive algorithms have attracted much attention due to their low computational complexity. In the scenarios of sparse channel estimation, zero-attracting LMS (ZA-LMS), reweighted ZA-LMS (RZA-LMS) and reweighted -norm LMS (RL1-LMS) have been proposed to exploit channel sparsity. However, these proposed algorithms may hard to make tradeoff between convergence speed and estimation performance with only one step-size. To solve this problem, we propose three sparse iterative-promoting variable step-size LMS (IP-VSS-LMS) algorithms with sparse constraints, i.e. ZA, RZA"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1504.03077","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-18T02:18:59Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"6GKaJMX59ePibK2MC1v2x0hwcaVF+v3sAhrjvvXzTW3z39/AfgOEohK4KMSPxDeFATVA92RXmxVwLw8x4yCsBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-11T16:53:32.393751Z"},"content_sha256":"cd0cd7c89144a287b57e28968142bfe4e6018ed1129445349d63019a2ca50fc6","schema_version":"1.0","event_id":"sha256:cd0cd7c89144a287b57e28968142bfe4e6018ed1129445349d63019a2ca50fc6"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/PBTHS2ZCRRDNNMONTUYSLEXY7I/bundle.json","state_url":"https://pith.science/pith/PBTHS2ZCRRDNNMONTUYSLEXY7I/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/PBTHS2ZCRRDNNMONTUYSLEXY7I/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-11T16:53:32Z","links":{"resolver":"https://pith.science/pith/PBTHS2ZCRRDNNMONTUYSLEXY7I","bundle":"https://pith.science/pith/PBTHS2ZCRRDNNMONTUYSLEXY7I/bundle.json","state":"https://pith.science/pith/PBTHS2ZCRRDNNMONTUYSLEXY7I/state.json","well_known_bundle":"https://pith.science/.well-known/pith/PBTHS2ZCRRDNNMONTUYSLEXY7I/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:PBTHS2ZCRRDNNMONTUYSLEXY7I","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":"a31a4cd15aa3728ad538025a7039e6c1b60379dafb660c6e2d3cb75d6d327bbf","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SY","submitted_at":"2015-04-13T07:06:04Z","title_canon_sha256":"f09fa336d6a2242e5245c13f8a26b47841d88d270285ca2ee798c1c43a330320"},"schema_version":"1.0","source":{"id":"1504.03077","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1504.03077","created_at":"2026-05-18T02:18:59Z"},{"alias_kind":"arxiv_version","alias_value":"1504.03077v1","created_at":"2026-05-18T02:18:59Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1504.03077","created_at":"2026-05-18T02:18:59Z"},{"alias_kind":"pith_short_12","alias_value":"PBTHS2ZCRRDN","created_at":"2026-05-18T12:29:37Z"},{"alias_kind":"pith_short_16","alias_value":"PBTHS2ZCRRDNNMON","created_at":"2026-05-18T12:29:37Z"},{"alias_kind":"pith_short_8","alias_value":"PBTHS2ZC","created_at":"2026-05-18T12:29:37Z"}],"graph_snapshots":[{"event_id":"sha256:cd0cd7c89144a287b57e28968142bfe4e6018ed1129445349d63019a2ca50fc6","target":"graph","created_at":"2026-05-18T02:18:59Z","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":"Least mean square (LMS) type adaptive algorithms have attracted much attention due to their low computational complexity. In the scenarios of sparse channel estimation, zero-attracting LMS (ZA-LMS), reweighted ZA-LMS (RZA-LMS) and reweighted -norm LMS (RL1-LMS) have been proposed to exploit channel sparsity. However, these proposed algorithms may hard to make tradeoff between convergence speed and estimation performance with only one step-size. To solve this problem, we propose three sparse iterative-promoting variable step-size LMS (IP-VSS-LMS) algorithms with sparse constraints, i.e. ZA, RZA","authors_text":"Beiyi Liu, Guan Gui, Li Xu","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SY","submitted_at":"2015-04-13T07:06:04Z","title":"Iterative-Promoting Variable Step-size Least Mean Square Algorithm For Adaptive Sparse Channel Estimation"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1504.03077","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:353bf902ca5783417b38502e5865d5c0d17379b99c3145a7e9548ffbd10090b7","target":"record","created_at":"2026-05-18T02:18:59Z","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":"a31a4cd15aa3728ad538025a7039e6c1b60379dafb660c6e2d3cb75d6d327bbf","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SY","submitted_at":"2015-04-13T07:06:04Z","title_canon_sha256":"f09fa336d6a2242e5245c13f8a26b47841d88d270285ca2ee798c1c43a330320"},"schema_version":"1.0","source":{"id":"1504.03077","kind":"arxiv","version":1}},"canonical_sha256":"7866796b228c46d6b1cd9d312592f8fa2476511c96b784299f8908db4b70759a","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"7866796b228c46d6b1cd9d312592f8fa2476511c96b784299f8908db4b70759a","first_computed_at":"2026-05-18T02:18:59.285213Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:18:59.285213Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"a8LsBVUoLKGZbZuY3si4XwWWDJk+pHS0yqiQfi3yjoW3UPOoVMil4CX5i3k/PiEqGqUvC2BO50h59XJbFaWhBA==","signature_status":"signed_v1","signed_at":"2026-05-18T02:18:59.285766Z","signed_message":"canonical_sha256_bytes"},"source_id":"1504.03077","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:353bf902ca5783417b38502e5865d5c0d17379b99c3145a7e9548ffbd10090b7","sha256:cd0cd7c89144a287b57e28968142bfe4e6018ed1129445349d63019a2ca50fc6"],"state_sha256":"eedc7097df14a0411c999e625e0039041961f01c902eed7b9ed615327030af2e"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"6dtQMS24xinQcyggU2+c7Z58eu6533+mxKKIqZdSIm4DONYlP9rtedIpDHEpsf3ol96PatNR7KSDs4m6E3RKDA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-11T16:53:32.397616Z","bundle_sha256":"2c3d524c49e09034ea1486648d8165c45f0a50daeb28f32544af499e54c3d78b"}}