{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:JT3G43V3PWPV3W7MSPZ5B3NBDH","short_pith_number":"pith:JT3G43V3","canonical_record":{"source":{"id":"1501.07107","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-01-28T14:05:31Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"06e834eb757c2623d6048cfe2529bbc788cd88199acfaf64e7ca5a11f2ec10c5","abstract_canon_sha256":"e2767f7750b3cadbc263b33af6c3fa2e9c5d69044715bbb5dbb488e50b7cf310"},"schema_version":"1.0"},"canonical_sha256":"4cf66e6ebb7d9f5ddbec93f3d0eda119ca8252c6282588aa6a564f1cfa74b80b","source":{"kind":"arxiv","id":"1501.07107","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1501.07107","created_at":"2026-05-18T02:28:30Z"},{"alias_kind":"arxiv_version","alias_value":"1501.07107v1","created_at":"2026-05-18T02:28:30Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1501.07107","created_at":"2026-05-18T02:28:30Z"},{"alias_kind":"pith_short_12","alias_value":"JT3G43V3PWPV","created_at":"2026-05-18T12:29:27Z"},{"alias_kind":"pith_short_16","alias_value":"JT3G43V3PWPV3W7M","created_at":"2026-05-18T12:29:27Z"},{"alias_kind":"pith_short_8","alias_value":"JT3G43V3","created_at":"2026-05-18T12:29:27Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:JT3G43V3PWPV3W7MSPZ5B3NBDH","target":"record","payload":{"canonical_record":{"source":{"id":"1501.07107","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-01-28T14:05:31Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"06e834eb757c2623d6048cfe2529bbc788cd88199acfaf64e7ca5a11f2ec10c5","abstract_canon_sha256":"e2767f7750b3cadbc263b33af6c3fa2e9c5d69044715bbb5dbb488e50b7cf310"},"schema_version":"1.0"},"canonical_sha256":"4cf66e6ebb7d9f5ddbec93f3d0eda119ca8252c6282588aa6a564f1cfa74b80b","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:28:30.234476Z","signature_b64":"oHFekOFxttAkzYpt4JQz9cdg3CjTVYdrBSivk8hQg8jtzZiCYRDrztffKLix41KNamJQgckViDwpEiAAvjTVDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"4cf66e6ebb7d9f5ddbec93f3d0eda119ca8252c6282588aa6a564f1cfa74b80b","last_reissued_at":"2026-05-18T02:28:30.233930Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:28:30.233930Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1501.07107","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:28:30Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"D3GtyhdBysIgmzdIEWRmyCNTR++JPbex65Aym8e7kjHOnXCvonah/W8C/E5zvVfMVTwzmiakuWZ27fJtpj7SBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-11T22:08:17.733237Z"},"content_sha256":"9a40fac3deb3974ba264a703cef40ad66735151d505709768109aedd7cfde0f3","schema_version":"1.0","event_id":"sha256:9a40fac3deb3974ba264a703cef40ad66735151d505709768109aedd7cfde0f3"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:JT3G43V3PWPV3W7MSPZ5B3NBDH","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Iterative-Promoting Variable Step Size Least Mean Square Algorithm for Accelerating Adaptive Channel Estimation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Beiyi Liu, Guan Gui, Li Xu, Nobuhiro Shimoi","submitted_at":"2015-01-28T14:05:31Z","abstract_excerpt":"Invariable step size based least-mean-square error (ISS-LMS) was considered as a very simple adaptive filtering algorithm and hence it has been widely utilized in many applications, such as adaptive channel estimation. It is well known that the convergence speed of ISS-LMS is fixed by the initial step-size. In the channel estimation scenarios, it is very hard to make tradeoff between convergence speed and estimation performance. In this paper, we propose an iterative-promoting variable step size based least-mean-square error (VSS-LMS) algorithm to control the convergence speed as well as to im"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1501.07107","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:28:30Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"F9wyoGjrHZ1D78+Vy6i9djT28CPQ6cOZyOSjasRL68jDDOVsidq82s5SM4hE4rFGg9R5gyC6ErE2fTy65MF/Dw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-11T22:08:17.734009Z"},"content_sha256":"0bcdbbc82ea591c6204d393b9c287cbc1ddf011b7fb93b23e8bff59019556d16","schema_version":"1.0","event_id":"sha256:0bcdbbc82ea591c6204d393b9c287cbc1ddf011b7fb93b23e8bff59019556d16"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/JT3G43V3PWPV3W7MSPZ5B3NBDH/bundle.json","state_url":"https://pith.science/pith/JT3G43V3PWPV3W7MSPZ5B3NBDH/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/JT3G43V3PWPV3W7MSPZ5B3NBDH/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-11T22:08:17Z","links":{"resolver":"https://pith.science/pith/JT3G43V3PWPV3W7MSPZ5B3NBDH","bundle":"https://pith.science/pith/JT3G43V3PWPV3W7MSPZ5B3NBDH/bundle.json","state":"https://pith.science/pith/JT3G43V3PWPV3W7MSPZ5B3NBDH/state.json","well_known_bundle":"https://pith.science/.well-known/pith/JT3G43V3PWPV3W7MSPZ5B3NBDH/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:JT3G43V3PWPV3W7MSPZ5B3NBDH","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":"e2767f7750b3cadbc263b33af6c3fa2e9c5d69044715bbb5dbb488e50b7cf310","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-01-28T14:05:31Z","title_canon_sha256":"06e834eb757c2623d6048cfe2529bbc788cd88199acfaf64e7ca5a11f2ec10c5"},"schema_version":"1.0","source":{"id":"1501.07107","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1501.07107","created_at":"2026-05-18T02:28:30Z"},{"alias_kind":"arxiv_version","alias_value":"1501.07107v1","created_at":"2026-05-18T02:28:30Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1501.07107","created_at":"2026-05-18T02:28:30Z"},{"alias_kind":"pith_short_12","alias_value":"JT3G43V3PWPV","created_at":"2026-05-18T12:29:27Z"},{"alias_kind":"pith_short_16","alias_value":"JT3G43V3PWPV3W7M","created_at":"2026-05-18T12:29:27Z"},{"alias_kind":"pith_short_8","alias_value":"JT3G43V3","created_at":"2026-05-18T12:29:27Z"}],"graph_snapshots":[{"event_id":"sha256:0bcdbbc82ea591c6204d393b9c287cbc1ddf011b7fb93b23e8bff59019556d16","target":"graph","created_at":"2026-05-18T02:28:30Z","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":"Invariable step size based least-mean-square error (ISS-LMS) was considered as a very simple adaptive filtering algorithm and hence it has been widely utilized in many applications, such as adaptive channel estimation. It is well known that the convergence speed of ISS-LMS is fixed by the initial step-size. In the channel estimation scenarios, it is very hard to make tradeoff between convergence speed and estimation performance. In this paper, we propose an iterative-promoting variable step size based least-mean-square error (VSS-LMS) algorithm to control the convergence speed as well as to im","authors_text":"Beiyi Liu, Guan Gui, Li Xu, Nobuhiro Shimoi","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-01-28T14:05:31Z","title":"Iterative-Promoting Variable Step Size Least Mean Square Algorithm for Accelerating Adaptive Channel Estimation"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1501.07107","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:9a40fac3deb3974ba264a703cef40ad66735151d505709768109aedd7cfde0f3","target":"record","created_at":"2026-05-18T02:28:30Z","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":"e2767f7750b3cadbc263b33af6c3fa2e9c5d69044715bbb5dbb488e50b7cf310","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-01-28T14:05:31Z","title_canon_sha256":"06e834eb757c2623d6048cfe2529bbc788cd88199acfaf64e7ca5a11f2ec10c5"},"schema_version":"1.0","source":{"id":"1501.07107","kind":"arxiv","version":1}},"canonical_sha256":"4cf66e6ebb7d9f5ddbec93f3d0eda119ca8252c6282588aa6a564f1cfa74b80b","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"4cf66e6ebb7d9f5ddbec93f3d0eda119ca8252c6282588aa6a564f1cfa74b80b","first_computed_at":"2026-05-18T02:28:30.233930Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:28:30.233930Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"oHFekOFxttAkzYpt4JQz9cdg3CjTVYdrBSivk8hQg8jtzZiCYRDrztffKLix41KNamJQgckViDwpEiAAvjTVDA==","signature_status":"signed_v1","signed_at":"2026-05-18T02:28:30.234476Z","signed_message":"canonical_sha256_bytes"},"source_id":"1501.07107","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:9a40fac3deb3974ba264a703cef40ad66735151d505709768109aedd7cfde0f3","sha256:0bcdbbc82ea591c6204d393b9c287cbc1ddf011b7fb93b23e8bff59019556d16"],"state_sha256":"f5c28beedf008831b79d7cdd586f973d1ca0f8257e08422f01aac5271f66eb19"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"L2q/AtWkhgwhFLdvxrnr8XHMOcUQa3OVm8s4U6rSIwgOrenrXiL9q1Z0nAOHi3MgSB9Qfig0cZjnDo79trwwCw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-11T22:08:17.738311Z","bundle_sha256":"5c779b9b9285b0231796123491b7f834d7d2a93c4cb7026b5530533a8a497eeb"}}