{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:KIIIUPZRSYFFTPMNVPZ5JEHEWC","short_pith_number":"pith:KIIIUPZR","schema_version":"1.0","canonical_sha256":"52108a3f31960a59bd8dabf3d490e4b0b271277d407133cc649c0fcaff9c3bdb","source":{"kind":"arxiv","id":"1410.5024","version":1},"attestation_state":"computed","paper":{"title":"Block-Sparsity-Induced Adaptive Filter for Multi-Clustering System Identification","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Shuyang Jiang, Yuantao Gu","submitted_at":"2014-10-19T01:45:06Z","abstract_excerpt":"In order to improve the performance of least mean square (LMS)-based adaptive filtering for identifying block-sparse systems, a new adaptive algorithm called block-sparse LMS (BS-LMS) is proposed in this paper. The basis of the proposed algorithm is to insert a penalty of block-sparsity, which is a mixed \\$l_{2, 0}\\$ norm of adaptive tap-weights with equal group partition sizes, into the cost function of traditional LMS algorithm. To describe a block-sparse system response, we first propose a Markov-Gaussian model, which can generate a kind of system responses of arbitrary average sparsity and"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"1410.5024","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2014-10-19T01:45:06Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"4bf8027196f762b88787c833310ae7dd67f49694eb37cd1a3457dd2b50c1e238","abstract_canon_sha256":"05a4ee6b05968ab7cde8bac76bda90d0add79053321f589c8c00b669a45cd324"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:29:04.895338Z","signature_b64":"+nYj15tlWahYT4J4KoQteoTEWUwiau/MHnbZzXKq+bBC4W3lVIq47d+g88NP7L80fke+PgXBaNx64nkRQ/V7Cg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"52108a3f31960a59bd8dabf3d490e4b0b271277d407133cc649c0fcaff9c3bdb","last_reissued_at":"2026-05-18T01:29:04.894747Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:29:04.894747Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Block-Sparsity-Induced Adaptive Filter for Multi-Clustering System Identification","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Shuyang Jiang, Yuantao Gu","submitted_at":"2014-10-19T01:45:06Z","abstract_excerpt":"In order to improve the performance of least mean square (LMS)-based adaptive filtering for identifying block-sparse systems, a new adaptive algorithm called block-sparse LMS (BS-LMS) is proposed in this paper. The basis of the proposed algorithm is to insert a penalty of block-sparsity, which is a mixed \\$l_{2, 0}\\$ norm of adaptive tap-weights with equal group partition sizes, into the cost function of traditional LMS algorithm. To describe a block-sparse system response, we first propose a Markov-Gaussian model, which can generate a kind of system responses of arbitrary average sparsity and"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1410.5024","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1410.5024","created_at":"2026-05-18T01:29:04.894837+00:00"},{"alias_kind":"arxiv_version","alias_value":"1410.5024v1","created_at":"2026-05-18T01:29:04.894837+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1410.5024","created_at":"2026-05-18T01:29:04.894837+00:00"},{"alias_kind":"pith_short_12","alias_value":"KIIIUPZRSYFF","created_at":"2026-05-18T12:28:35.611951+00:00"},{"alias_kind":"pith_short_16","alias_value":"KIIIUPZRSYFFTPMN","created_at":"2026-05-18T12:28:35.611951+00:00"},{"alias_kind":"pith_short_8","alias_value":"KIIIUPZR","created_at":"2026-05-18T12:28:35.611951+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/KIIIUPZRSYFFTPMNVPZ5JEHEWC","json":"https://pith.science/pith/KIIIUPZRSYFFTPMNVPZ5JEHEWC.json","graph_json":"https://pith.science/api/pith-number/KIIIUPZRSYFFTPMNVPZ5JEHEWC/graph.json","events_json":"https://pith.science/api/pith-number/KIIIUPZRSYFFTPMNVPZ5JEHEWC/events.json","paper":"https://pith.science/paper/KIIIUPZR"},"agent_actions":{"view_html":"https://pith.science/pith/KIIIUPZRSYFFTPMNVPZ5JEHEWC","download_json":"https://pith.science/pith/KIIIUPZRSYFFTPMNVPZ5JEHEWC.json","view_paper":"https://pith.science/paper/KIIIUPZR","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1410.5024&json=true","fetch_graph":"https://pith.science/api/pith-number/KIIIUPZRSYFFTPMNVPZ5JEHEWC/graph.json","fetch_events":"https://pith.science/api/pith-number/KIIIUPZRSYFFTPMNVPZ5JEHEWC/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/KIIIUPZRSYFFTPMNVPZ5JEHEWC/action/timestamp_anchor","attest_storage":"https://pith.science/pith/KIIIUPZRSYFFTPMNVPZ5JEHEWC/action/storage_attestation","attest_author":"https://pith.science/pith/KIIIUPZRSYFFTPMNVPZ5JEHEWC/action/author_attestation","sign_citation":"https://pith.science/pith/KIIIUPZRSYFFTPMNVPZ5JEHEWC/action/citation_signature","submit_replication":"https://pith.science/pith/KIIIUPZRSYFFTPMNVPZ5JEHEWC/action/replication_record"}},"created_at":"2026-05-18T01:29:04.894837+00:00","updated_at":"2026-05-18T01:29:04.894837+00:00"}