{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:V35Y6SCP7LCJQ4D5QCZW3E3ZFV","short_pith_number":"pith:V35Y6SCP","canonical_record":{"source":{"id":"1407.6078","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-sa/3.0/","primary_cat":"cs.IT","submitted_at":"2014-07-23T00:50:51Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"90b52be968eac9f127a0e0e887d6a8c8a40b7ca8633d5eb84a39e028a2f93025","abstract_canon_sha256":"94dba926cb7e6d2d5c72c3f52d9387c4f949339732592c741cfde01db567f175"},"schema_version":"1.0"},"canonical_sha256":"aefb8f484ffac498707d80b36d93792d66c5fea49a2ffc5b11b58ea6ca719605","source":{"kind":"arxiv","id":"1407.6078","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1407.6078","created_at":"2026-05-18T02:46:59Z"},{"alias_kind":"arxiv_version","alias_value":"1407.6078v1","created_at":"2026-05-18T02:46:59Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1407.6078","created_at":"2026-05-18T02:46:59Z"},{"alias_kind":"pith_short_12","alias_value":"V35Y6SCP7LCJ","created_at":"2026-05-18T12:28:52Z"},{"alias_kind":"pith_short_16","alias_value":"V35Y6SCP7LCJQ4D5","created_at":"2026-05-18T12:28:52Z"},{"alias_kind":"pith_short_8","alias_value":"V35Y6SCP","created_at":"2026-05-18T12:28:52Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:V35Y6SCP7LCJQ4D5QCZW3E3ZFV","target":"record","payload":{"canonical_record":{"source":{"id":"1407.6078","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-sa/3.0/","primary_cat":"cs.IT","submitted_at":"2014-07-23T00:50:51Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"90b52be968eac9f127a0e0e887d6a8c8a40b7ca8633d5eb84a39e028a2f93025","abstract_canon_sha256":"94dba926cb7e6d2d5c72c3f52d9387c4f949339732592c741cfde01db567f175"},"schema_version":"1.0"},"canonical_sha256":"aefb8f484ffac498707d80b36d93792d66c5fea49a2ffc5b11b58ea6ca719605","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:46:59.132805Z","signature_b64":"1TdIzFZONTuScL1xdcd7UjjNoUFtBbgogGMwaRQiEElhEDegL9EMcMNcZIBADIbu4q4kucefRtMxZciLly1ZCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"aefb8f484ffac498707d80b36d93792d66c5fea49a2ffc5b11b58ea6ca719605","last_reissued_at":"2026-05-18T02:46:59.132062Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:46:59.132062Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1407.6078","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:46:59Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"6/Yqo0qiDkvcaadNtRnZpk49O+rFI1vsIkCUz6J0gtoa25x3rKR3wK2ZbgC/9Pqj0jh63xsNydmkmAft1GejDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-12T00:33:37.679113Z"},"content_sha256":"f5e747287c4b888f9ca20b10bebc0e3631bf2b3bd8b1b00d5627b1c1fb082cb8","schema_version":"1.0","event_id":"sha256:f5e747287c4b888f9ca20b10bebc0e3631bf2b3bd8b1b00d5627b1c1fb082cb8"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:V35Y6SCP7LCJQ4D5QCZW3E3ZFV","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Extra Gain:Improved Sparse Channel Estimation Using Reweighted l_1-norm Penalized LMS/F Algorithm","license":"http://creativecommons.org/licenses/by-nc-sa/3.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Fumiyuki Adachi, Guan Gui, Li Xu","submitted_at":"2014-07-23T00:50:51Z","abstract_excerpt":"The channel estimation is one of important techniques to ensure reliable broadband signal transmission. Broadband channels are often modeled as a sparse channel. Comparing with traditional dense-assumption based linear channel estimation methods, e.g., least mean square/fourth (LMS/F) algorithm, exploiting sparse structure information can get extra performance gain. By introducing l_1-norm penalty, two sparse LMS/F algorithms, (zero-attracting LMSF, ZA-LMS/F and reweighted ZA-LMSF, RZA-LMSF), have been proposed [1]. Motivated by existing reweighted l_1-norm (RL1) sparse algorithm in compressiv"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1407.6078","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:46:59Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"lc+FfUhyou0+x9u5dtpXwisi5Lrc0BSeipUyo+/sObkmqiSF2tKmLMERpx5W5O0vKtkkxVz5hjNKNN+DXXzdBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-12T00:33:37.679479Z"},"content_sha256":"ca5453338789ecade2a105585a9a23d7d44d8a29a108412dab012b8f6d65a9f9","schema_version":"1.0","event_id":"sha256:ca5453338789ecade2a105585a9a23d7d44d8a29a108412dab012b8f6d65a9f9"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/V35Y6SCP7LCJQ4D5QCZW3E3ZFV/bundle.json","state_url":"https://pith.science/pith/V35Y6SCP7LCJQ4D5QCZW3E3ZFV/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/V35Y6SCP7LCJQ4D5QCZW3E3ZFV/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-12T00:33:37Z","links":{"resolver":"https://pith.science/pith/V35Y6SCP7LCJQ4D5QCZW3E3ZFV","bundle":"https://pith.science/pith/V35Y6SCP7LCJQ4D5QCZW3E3ZFV/bundle.json","state":"https://pith.science/pith/V35Y6SCP7LCJQ4D5QCZW3E3ZFV/state.json","well_known_bundle":"https://pith.science/.well-known/pith/V35Y6SCP7LCJQ4D5QCZW3E3ZFV/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:V35Y6SCP7LCJQ4D5QCZW3E3ZFV","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":"94dba926cb7e6d2d5c72c3f52d9387c4f949339732592c741cfde01db567f175","cross_cats_sorted":["math.IT"],"license":"http://creativecommons.org/licenses/by-nc-sa/3.0/","primary_cat":"cs.IT","submitted_at":"2014-07-23T00:50:51Z","title_canon_sha256":"90b52be968eac9f127a0e0e887d6a8c8a40b7ca8633d5eb84a39e028a2f93025"},"schema_version":"1.0","source":{"id":"1407.6078","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1407.6078","created_at":"2026-05-18T02:46:59Z"},{"alias_kind":"arxiv_version","alias_value":"1407.6078v1","created_at":"2026-05-18T02:46:59Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1407.6078","created_at":"2026-05-18T02:46:59Z"},{"alias_kind":"pith_short_12","alias_value":"V35Y6SCP7LCJ","created_at":"2026-05-18T12:28:52Z"},{"alias_kind":"pith_short_16","alias_value":"V35Y6SCP7LCJQ4D5","created_at":"2026-05-18T12:28:52Z"},{"alias_kind":"pith_short_8","alias_value":"V35Y6SCP","created_at":"2026-05-18T12:28:52Z"}],"graph_snapshots":[{"event_id":"sha256:ca5453338789ecade2a105585a9a23d7d44d8a29a108412dab012b8f6d65a9f9","target":"graph","created_at":"2026-05-18T02:46: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":"The channel estimation is one of important techniques to ensure reliable broadband signal transmission. Broadband channels are often modeled as a sparse channel. Comparing with traditional dense-assumption based linear channel estimation methods, e.g., least mean square/fourth (LMS/F) algorithm, exploiting sparse structure information can get extra performance gain. By introducing l_1-norm penalty, two sparse LMS/F algorithms, (zero-attracting LMSF, ZA-LMS/F and reweighted ZA-LMSF, RZA-LMSF), have been proposed [1]. Motivated by existing reweighted l_1-norm (RL1) sparse algorithm in compressiv","authors_text":"Fumiyuki Adachi, Guan Gui, Li Xu","cross_cats":["math.IT"],"headline":"","license":"http://creativecommons.org/licenses/by-nc-sa/3.0/","primary_cat":"cs.IT","submitted_at":"2014-07-23T00:50:51Z","title":"Extra Gain:Improved Sparse Channel Estimation Using Reweighted l_1-norm Penalized LMS/F Algorithm"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1407.6078","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:f5e747287c4b888f9ca20b10bebc0e3631bf2b3bd8b1b00d5627b1c1fb082cb8","target":"record","created_at":"2026-05-18T02:46: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":"94dba926cb7e6d2d5c72c3f52d9387c4f949339732592c741cfde01db567f175","cross_cats_sorted":["math.IT"],"license":"http://creativecommons.org/licenses/by-nc-sa/3.0/","primary_cat":"cs.IT","submitted_at":"2014-07-23T00:50:51Z","title_canon_sha256":"90b52be968eac9f127a0e0e887d6a8c8a40b7ca8633d5eb84a39e028a2f93025"},"schema_version":"1.0","source":{"id":"1407.6078","kind":"arxiv","version":1}},"canonical_sha256":"aefb8f484ffac498707d80b36d93792d66c5fea49a2ffc5b11b58ea6ca719605","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"aefb8f484ffac498707d80b36d93792d66c5fea49a2ffc5b11b58ea6ca719605","first_computed_at":"2026-05-18T02:46:59.132062Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:46:59.132062Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"1TdIzFZONTuScL1xdcd7UjjNoUFtBbgogGMwaRQiEElhEDegL9EMcMNcZIBADIbu4q4kucefRtMxZciLly1ZCw==","signature_status":"signed_v1","signed_at":"2026-05-18T02:46:59.132805Z","signed_message":"canonical_sha256_bytes"},"source_id":"1407.6078","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:f5e747287c4b888f9ca20b10bebc0e3631bf2b3bd8b1b00d5627b1c1fb082cb8","sha256:ca5453338789ecade2a105585a9a23d7d44d8a29a108412dab012b8f6d65a9f9"],"state_sha256":"f58574169bfb0d8551db7a901d80eb812600a94756711f44e05eca630e73e51a"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"NIGloAogFbjrZVsaVcK3NJZMBVNWu+BU7imh0vuEK6fPvigRlD84hJvWJJk9iQbw1Q1xVi9B3Idd2SARcILIAw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-12T00:33:37.681450Z","bundle_sha256":"900f90e3fcf50ffb49df16bdfbec9fc9109df401fcbca930b78a3d61d99fbc4e"}}