{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:EK7TG6SOTU6NWONAPG2CZZWX5H","short_pith_number":"pith:EK7TG6SO","canonical_record":{"source":{"id":"1401.3566","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2014-01-15T13:03:43Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"1606bb257da3cbe29c5d9572a3f4ef015c7f1c816779b5029a4916ecabf4aa85","abstract_canon_sha256":"339f37fbde5e0456dfabc1f8148d1dc8e72f0398b3dac083148e3709647c1aa4"},"schema_version":"1.0"},"canonical_sha256":"22bf337a4e9d3cdb39a079b42ce6d7e9f16823bcec731b26cf3208c228dd2f88","source":{"kind":"arxiv","id":"1401.3566","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1401.3566","created_at":"2026-05-18T02:52:23Z"},{"alias_kind":"arxiv_version","alias_value":"1401.3566v1","created_at":"2026-05-18T02:52:23Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1401.3566","created_at":"2026-05-18T02:52:23Z"},{"alias_kind":"pith_short_12","alias_value":"EK7TG6SOTU6N","created_at":"2026-05-18T12:28:28Z"},{"alias_kind":"pith_short_16","alias_value":"EK7TG6SOTU6NWONA","created_at":"2026-05-18T12:28:28Z"},{"alias_kind":"pith_short_8","alias_value":"EK7TG6SO","created_at":"2026-05-18T12:28:28Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:EK7TG6SOTU6NWONAPG2CZZWX5H","target":"record","payload":{"canonical_record":{"source":{"id":"1401.3566","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2014-01-15T13:03:43Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"1606bb257da3cbe29c5d9572a3f4ef015c7f1c816779b5029a4916ecabf4aa85","abstract_canon_sha256":"339f37fbde5e0456dfabc1f8148d1dc8e72f0398b3dac083148e3709647c1aa4"},"schema_version":"1.0"},"canonical_sha256":"22bf337a4e9d3cdb39a079b42ce6d7e9f16823bcec731b26cf3208c228dd2f88","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:52:23.270761Z","signature_b64":"JK7ceGasfzIWuQjEkWtMy42dMiiQt7JPru5VzpBTIwQ1MnxbVyEGH4JSuvH84f6+/nqGHbSxZR21hLuETRwdDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"22bf337a4e9d3cdb39a079b42ce6d7e9f16823bcec731b26cf3208c228dd2f88","last_reissued_at":"2026-05-18T02:52:23.270185Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:52:23.270185Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1401.3566","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:52:23Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"p2w+8Z3Xp48Pml+5mXROZIfvhVtrMAsK3ato589j6FGZXYfQu27GYPV+nowBhCnCcGPr8D19Pm4XY6NTxwepDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T13:20:54.418637Z"},"content_sha256":"37d7b274a5634e0098709c7e74c16b08259137a68fb0aea68862ce16a7a9925f","schema_version":"1.0","event_id":"sha256:37d7b274a5634e0098709c7e74c16b08259137a68fb0aea68862ce16a7a9925f"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:EK7TG6SOTU6NWONAPG2CZZWX5H","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Reweighted l1-norm Penalized LMS for Sparse Channel Estimation and Its Analysis","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Omid Taheri, Sergiy A. Vorobyov","submitted_at":"2014-01-15T13:03:43Z","abstract_excerpt":"A new reweighted l1-norm penalized least mean square (LMS) algorithm for sparse channel estimation is proposed and studied in this paper. Since standard LMS algorithm does not take into account the sparsity information about the channel impulse response (CIR), sparsity-aware modifications of the LMS algorithm aim at outperforming the standard LMS by introducing a penalty term to the standard LMS cost function which forces the solution to be sparse. Our reweighted l1-norm penalized LMS algorithm introduces in addition a reweighting of the CIR coefficient estimates to promote a sparse solution e"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1401.3566","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:52:23Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Mlag1jb39e7/8+ZAONgYqwN0FBZG2/Gn7c+gWL5Yn03ivx5q7FajBFC8gHCbo+J08zKJuTulMwzNHSkrFdJcCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T13:20:54.419023Z"},"content_sha256":"0cdd3b04c27cbe04bd1536cd799574c69059bdc0a861c5dd1e1d39cf65c25fe1","schema_version":"1.0","event_id":"sha256:0cdd3b04c27cbe04bd1536cd799574c69059bdc0a861c5dd1e1d39cf65c25fe1"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/EK7TG6SOTU6NWONAPG2CZZWX5H/bundle.json","state_url":"https://pith.science/pith/EK7TG6SOTU6NWONAPG2CZZWX5H/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/EK7TG6SOTU6NWONAPG2CZZWX5H/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-05-30T13:20:54Z","links":{"resolver":"https://pith.science/pith/EK7TG6SOTU6NWONAPG2CZZWX5H","bundle":"https://pith.science/pith/EK7TG6SOTU6NWONAPG2CZZWX5H/bundle.json","state":"https://pith.science/pith/EK7TG6SOTU6NWONAPG2CZZWX5H/state.json","well_known_bundle":"https://pith.science/.well-known/pith/EK7TG6SOTU6NWONAPG2CZZWX5H/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:EK7TG6SOTU6NWONAPG2CZZWX5H","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":"339f37fbde5e0456dfabc1f8148d1dc8e72f0398b3dac083148e3709647c1aa4","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2014-01-15T13:03:43Z","title_canon_sha256":"1606bb257da3cbe29c5d9572a3f4ef015c7f1c816779b5029a4916ecabf4aa85"},"schema_version":"1.0","source":{"id":"1401.3566","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1401.3566","created_at":"2026-05-18T02:52:23Z"},{"alias_kind":"arxiv_version","alias_value":"1401.3566v1","created_at":"2026-05-18T02:52:23Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1401.3566","created_at":"2026-05-18T02:52:23Z"},{"alias_kind":"pith_short_12","alias_value":"EK7TG6SOTU6N","created_at":"2026-05-18T12:28:28Z"},{"alias_kind":"pith_short_16","alias_value":"EK7TG6SOTU6NWONA","created_at":"2026-05-18T12:28:28Z"},{"alias_kind":"pith_short_8","alias_value":"EK7TG6SO","created_at":"2026-05-18T12:28:28Z"}],"graph_snapshots":[{"event_id":"sha256:0cdd3b04c27cbe04bd1536cd799574c69059bdc0a861c5dd1e1d39cf65c25fe1","target":"graph","created_at":"2026-05-18T02:52:23Z","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":"A new reweighted l1-norm penalized least mean square (LMS) algorithm for sparse channel estimation is proposed and studied in this paper. Since standard LMS algorithm does not take into account the sparsity information about the channel impulse response (CIR), sparsity-aware modifications of the LMS algorithm aim at outperforming the standard LMS by introducing a penalty term to the standard LMS cost function which forces the solution to be sparse. Our reweighted l1-norm penalized LMS algorithm introduces in addition a reweighting of the CIR coefficient estimates to promote a sparse solution e","authors_text":"Omid Taheri, Sergiy A. Vorobyov","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2014-01-15T13:03:43Z","title":"Reweighted l1-norm Penalized LMS for Sparse Channel Estimation and Its Analysis"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1401.3566","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:37d7b274a5634e0098709c7e74c16b08259137a68fb0aea68862ce16a7a9925f","target":"record","created_at":"2026-05-18T02:52:23Z","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":"339f37fbde5e0456dfabc1f8148d1dc8e72f0398b3dac083148e3709647c1aa4","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2014-01-15T13:03:43Z","title_canon_sha256":"1606bb257da3cbe29c5d9572a3f4ef015c7f1c816779b5029a4916ecabf4aa85"},"schema_version":"1.0","source":{"id":"1401.3566","kind":"arxiv","version":1}},"canonical_sha256":"22bf337a4e9d3cdb39a079b42ce6d7e9f16823bcec731b26cf3208c228dd2f88","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"22bf337a4e9d3cdb39a079b42ce6d7e9f16823bcec731b26cf3208c228dd2f88","first_computed_at":"2026-05-18T02:52:23.270185Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:52:23.270185Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"JK7ceGasfzIWuQjEkWtMy42dMiiQt7JPru5VzpBTIwQ1MnxbVyEGH4JSuvH84f6+/nqGHbSxZR21hLuETRwdDw==","signature_status":"signed_v1","signed_at":"2026-05-18T02:52:23.270761Z","signed_message":"canonical_sha256_bytes"},"source_id":"1401.3566","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:37d7b274a5634e0098709c7e74c16b08259137a68fb0aea68862ce16a7a9925f","sha256:0cdd3b04c27cbe04bd1536cd799574c69059bdc0a861c5dd1e1d39cf65c25fe1"],"state_sha256":"7c06129b5377a06f373531d03dd574f2ff7dae4eafb41024cc7f828807effd46"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"3sPZYPGHv0OEEmEEgt8Cs8CEZRZEK9uUDaOsut5EPAiPIfF8RGW5IfHJpCM1S6xYAk/9pJGru1IOY78Qb2wuBA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-30T13:20:54.421405Z","bundle_sha256":"b77632b17025f5cc4c33c27e63dc4852bb64e981e80bb00a8b12b9c424401a1d"}}