{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:KIIIUPZRSYFFTPMNVPZ5JEHEWC","short_pith_number":"pith:KIIIUPZR","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"},"canonical_sha256":"52108a3f31960a59bd8dabf3d490e4b0b271277d407133cc649c0fcaff9c3bdb","source":{"kind":"arxiv","id":"1410.5024","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1410.5024","created_at":"2026-05-18T01:29:04Z"},{"alias_kind":"arxiv_version","alias_value":"1410.5024v1","created_at":"2026-05-18T01:29:04Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1410.5024","created_at":"2026-05-18T01:29:04Z"},{"alias_kind":"pith_short_12","alias_value":"KIIIUPZRSYFF","created_at":"2026-05-18T12:28:35Z"},{"alias_kind":"pith_short_16","alias_value":"KIIIUPZRSYFFTPMN","created_at":"2026-05-18T12:28:35Z"},{"alias_kind":"pith_short_8","alias_value":"KIIIUPZR","created_at":"2026-05-18T12:28:35Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:KIIIUPZRSYFFTPMNVPZ5JEHEWC","target":"record","payload":{"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"},"canonical_sha256":"52108a3f31960a59bd8dabf3d490e4b0b271277d407133cc649c0fcaff9c3bdb","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"},"source_kind":"arxiv","source_id":"1410.5024","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-18T01:29:04Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"vlXXfjaBfUzngzC3y02s+bAvMscmMi0kcqedXVKjdk/Fdz7Fa1G81kIultuIqJBCc+OOTXQXhULdgmhHJx4yAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T21:30:29.399303Z"},"content_sha256":"b57a6318279d6c8ff07a51ec6e99c3d822b5eebf04a786d4a9674962119cd8da","schema_version":"1.0","event_id":"sha256:b57a6318279d6c8ff07a51ec6e99c3d822b5eebf04a786d4a9674962119cd8da"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:KIIIUPZRSYFFTPMNVPZ5JEHEWC","target":"graph","payload":{"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"},"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-18T01:29:04Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"lTtXMPYn1NdZg0GJdQx5G/aNjfzEdrX5xUkwC181uASZs1pgHMZhcnKj4UepcipIZJ/AuJkf0GPu8JYOkZ0yAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T21:30:29.399671Z"},"content_sha256":"52aa7a082020dc533bc530a4f3f6ac8eab129192fce7621a58af6d11e8c148b3","schema_version":"1.0","event_id":"sha256:52aa7a082020dc533bc530a4f3f6ac8eab129192fce7621a58af6d11e8c148b3"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/KIIIUPZRSYFFTPMNVPZ5JEHEWC/bundle.json","state_url":"https://pith.science/pith/KIIIUPZRSYFFTPMNVPZ5JEHEWC/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/KIIIUPZRSYFFTPMNVPZ5JEHEWC/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-31T21:30:29Z","links":{"resolver":"https://pith.science/pith/KIIIUPZRSYFFTPMNVPZ5JEHEWC","bundle":"https://pith.science/pith/KIIIUPZRSYFFTPMNVPZ5JEHEWC/bundle.json","state":"https://pith.science/pith/KIIIUPZRSYFFTPMNVPZ5JEHEWC/state.json","well_known_bundle":"https://pith.science/.well-known/pith/KIIIUPZRSYFFTPMNVPZ5JEHEWC/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:KIIIUPZRSYFFTPMNVPZ5JEHEWC","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":"05a4ee6b05968ab7cde8bac76bda90d0add79053321f589c8c00b669a45cd324","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2014-10-19T01:45:06Z","title_canon_sha256":"4bf8027196f762b88787c833310ae7dd67f49694eb37cd1a3457dd2b50c1e238"},"schema_version":"1.0","source":{"id":"1410.5024","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1410.5024","created_at":"2026-05-18T01:29:04Z"},{"alias_kind":"arxiv_version","alias_value":"1410.5024v1","created_at":"2026-05-18T01:29:04Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1410.5024","created_at":"2026-05-18T01:29:04Z"},{"alias_kind":"pith_short_12","alias_value":"KIIIUPZRSYFF","created_at":"2026-05-18T12:28:35Z"},{"alias_kind":"pith_short_16","alias_value":"KIIIUPZRSYFFTPMN","created_at":"2026-05-18T12:28:35Z"},{"alias_kind":"pith_short_8","alias_value":"KIIIUPZR","created_at":"2026-05-18T12:28:35Z"}],"graph_snapshots":[{"event_id":"sha256:52aa7a082020dc533bc530a4f3f6ac8eab129192fce7621a58af6d11e8c148b3","target":"graph","created_at":"2026-05-18T01:29:04Z","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":"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","authors_text":"Shuyang Jiang, Yuantao Gu","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2014-10-19T01:45:06Z","title":"Block-Sparsity-Induced Adaptive Filter for Multi-Clustering System Identification"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1410.5024","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:b57a6318279d6c8ff07a51ec6e99c3d822b5eebf04a786d4a9674962119cd8da","target":"record","created_at":"2026-05-18T01:29:04Z","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":"05a4ee6b05968ab7cde8bac76bda90d0add79053321f589c8c00b669a45cd324","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2014-10-19T01:45:06Z","title_canon_sha256":"4bf8027196f762b88787c833310ae7dd67f49694eb37cd1a3457dd2b50c1e238"},"schema_version":"1.0","source":{"id":"1410.5024","kind":"arxiv","version":1}},"canonical_sha256":"52108a3f31960a59bd8dabf3d490e4b0b271277d407133cc649c0fcaff9c3bdb","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"52108a3f31960a59bd8dabf3d490e4b0b271277d407133cc649c0fcaff9c3bdb","first_computed_at":"2026-05-18T01:29:04.894747Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:29:04.894747Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"+nYj15tlWahYT4J4KoQteoTEWUwiau/MHnbZzXKq+bBC4W3lVIq47d+g88NP7L80fke+PgXBaNx64nkRQ/V7Cg==","signature_status":"signed_v1","signed_at":"2026-05-18T01:29:04.895338Z","signed_message":"canonical_sha256_bytes"},"source_id":"1410.5024","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:b57a6318279d6c8ff07a51ec6e99c3d822b5eebf04a786d4a9674962119cd8da","sha256:52aa7a082020dc533bc530a4f3f6ac8eab129192fce7621a58af6d11e8c148b3"],"state_sha256":"3f78a8a9bb3264e5b675dae378b5fe137fbf3d5ce9a31d2292707e27beed21ab"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"4KZzBxXtFIZ75WiEON5LiW0/qltSU7iVaBgO8620clSX45RDZJ7TeR2EPcBNJZfi6ZNHyk9wd0osdkyPo7I2Bg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-31T21:30:29.401816Z","bundle_sha256":"b1db145dd42eaa29a3192e2311d3bf53e11a7222aa19af79b5008749252509a9"}}