{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:BPQ6R3JYEA7ZBFQDUNVMIE7LRW","short_pith_number":"pith:BPQ6R3JY","canonical_record":{"source":{"id":"1602.03283","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-02-10T07:03:14Z","cross_cats_sorted":["math.IT","nlin.AO","stat.ME"],"title_canon_sha256":"01a0fadccabc30cbdd8e2194bf99d54f568d029c6c8b7c2d02b0687cc0a16a77","abstract_canon_sha256":"9b06ed4797400dea936584b670882c7cf32e809467cf2544efb02695c64e07f3"},"schema_version":"1.0"},"canonical_sha256":"0be1e8ed38203f909603a36ac413eb8db0a0e0dd91acb5a46b2f9f65b681d36d","source":{"kind":"arxiv","id":"1602.03283","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1602.03283","created_at":"2026-05-18T01:21:00Z"},{"alias_kind":"arxiv_version","alias_value":"1602.03283v1","created_at":"2026-05-18T01:21:00Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1602.03283","created_at":"2026-05-18T01:21:00Z"},{"alias_kind":"pith_short_12","alias_value":"BPQ6R3JYEA7Z","created_at":"2026-05-18T12:30:07Z"},{"alias_kind":"pith_short_16","alias_value":"BPQ6R3JYEA7ZBFQD","created_at":"2026-05-18T12:30:07Z"},{"alias_kind":"pith_short_8","alias_value":"BPQ6R3JY","created_at":"2026-05-18T12:30:07Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:BPQ6R3JYEA7ZBFQDUNVMIE7LRW","target":"record","payload":{"canonical_record":{"source":{"id":"1602.03283","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-02-10T07:03:14Z","cross_cats_sorted":["math.IT","nlin.AO","stat.ME"],"title_canon_sha256":"01a0fadccabc30cbdd8e2194bf99d54f568d029c6c8b7c2d02b0687cc0a16a77","abstract_canon_sha256":"9b06ed4797400dea936584b670882c7cf32e809467cf2544efb02695c64e07f3"},"schema_version":"1.0"},"canonical_sha256":"0be1e8ed38203f909603a36ac413eb8db0a0e0dd91acb5a46b2f9f65b681d36d","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:21:00.345903Z","signature_b64":"Zou77ccp+GolWM7chB7N6gxgIgC7v8hlNmfK5PwOL/ru33tZWJuS4lvDNcGDt29SXxo2TBKd6ntTbelGLpWzAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0be1e8ed38203f909603a36ac413eb8db0a0e0dd91acb5a46b2f9f65b681d36d","last_reissued_at":"2026-05-18T01:21:00.345484Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:21:00.345484Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1602.03283","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:21:00Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ZdvSUO/x/9IwPPn+f8mSINw+fY+3YBmkyx8xlGNpqxjHxEbPon2zrgAz+j1hfw8cITpPuigfCMURxGvjN580BA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T19:55:30.014280Z"},"content_sha256":"fdc119b699dfb082ad5b4d63b8bb03112f63b99d8ee8e82e57af4bbb042b0bf9","schema_version":"1.0","event_id":"sha256:fdc119b699dfb082ad5b4d63b8bb03112f63b99d8ee8e82e57af4bbb042b0bf9"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:BPQ6R3JYEA7ZBFQDUNVMIE7LRW","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Performance Analysis of $l_0$ Norm Constrained Recursive Least Squares Algorithm","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT","nlin.AO","stat.ME"],"primary_cat":"cs.IT","authors_text":"Bijit Kumar Das, Mrityunjoy Chakraborty, Samrat Mukhopadhyay","submitted_at":"2016-02-10T07:03:14Z","abstract_excerpt":"Performance analysis of $l_0$ norm constrained Recursive least Squares (RLS) algorithm is attempted in this paper. Though the performance pretty attractive compared to its various alternatives, no thorough study of theoretical analysis has been performed. Like the popular $l_0$ Least Mean Squares (LMS) algorithm, in $l_0$ RLS, a $l_0$ norm penalty is added to provide zero tap attractions on the instantaneous filter taps. A thorough theoretical performance analysis has been conducted in this paper with white Gaussian input data under assumptions suitable for many practical scenarios. An express"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1602.03283","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:21:00Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"H/JMVMjTduwXPt9RSFWHGFKyKzsnzYLdUuk0q2ZmAbwPujeYmQsvuSITH7D+nTOHbXbb4ReT1uLFXDTaOjksAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T19:55:30.014673Z"},"content_sha256":"df9e6e4d2ae8e6ae5cbdb97b5cb682a607e35d6b63a1f0bb663175a13807e37d","schema_version":"1.0","event_id":"sha256:df9e6e4d2ae8e6ae5cbdb97b5cb682a607e35d6b63a1f0bb663175a13807e37d"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/BPQ6R3JYEA7ZBFQDUNVMIE7LRW/bundle.json","state_url":"https://pith.science/pith/BPQ6R3JYEA7ZBFQDUNVMIE7LRW/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/BPQ6R3JYEA7ZBFQDUNVMIE7LRW/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-31T19:55:30Z","links":{"resolver":"https://pith.science/pith/BPQ6R3JYEA7ZBFQDUNVMIE7LRW","bundle":"https://pith.science/pith/BPQ6R3JYEA7ZBFQDUNVMIE7LRW/bundle.json","state":"https://pith.science/pith/BPQ6R3JYEA7ZBFQDUNVMIE7LRW/state.json","well_known_bundle":"https://pith.science/.well-known/pith/BPQ6R3JYEA7ZBFQDUNVMIE7LRW/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:BPQ6R3JYEA7ZBFQDUNVMIE7LRW","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":"9b06ed4797400dea936584b670882c7cf32e809467cf2544efb02695c64e07f3","cross_cats_sorted":["math.IT","nlin.AO","stat.ME"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-02-10T07:03:14Z","title_canon_sha256":"01a0fadccabc30cbdd8e2194bf99d54f568d029c6c8b7c2d02b0687cc0a16a77"},"schema_version":"1.0","source":{"id":"1602.03283","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1602.03283","created_at":"2026-05-18T01:21:00Z"},{"alias_kind":"arxiv_version","alias_value":"1602.03283v1","created_at":"2026-05-18T01:21:00Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1602.03283","created_at":"2026-05-18T01:21:00Z"},{"alias_kind":"pith_short_12","alias_value":"BPQ6R3JYEA7Z","created_at":"2026-05-18T12:30:07Z"},{"alias_kind":"pith_short_16","alias_value":"BPQ6R3JYEA7ZBFQD","created_at":"2026-05-18T12:30:07Z"},{"alias_kind":"pith_short_8","alias_value":"BPQ6R3JY","created_at":"2026-05-18T12:30:07Z"}],"graph_snapshots":[{"event_id":"sha256:df9e6e4d2ae8e6ae5cbdb97b5cb682a607e35d6b63a1f0bb663175a13807e37d","target":"graph","created_at":"2026-05-18T01:21:00Z","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":"Performance analysis of $l_0$ norm constrained Recursive least Squares (RLS) algorithm is attempted in this paper. Though the performance pretty attractive compared to its various alternatives, no thorough study of theoretical analysis has been performed. Like the popular $l_0$ Least Mean Squares (LMS) algorithm, in $l_0$ RLS, a $l_0$ norm penalty is added to provide zero tap attractions on the instantaneous filter taps. A thorough theoretical performance analysis has been conducted in this paper with white Gaussian input data under assumptions suitable for many practical scenarios. An express","authors_text":"Bijit Kumar Das, Mrityunjoy Chakraborty, Samrat Mukhopadhyay","cross_cats":["math.IT","nlin.AO","stat.ME"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-02-10T07:03:14Z","title":"Performance Analysis of $l_0$ Norm Constrained Recursive Least Squares Algorithm"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1602.03283","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:fdc119b699dfb082ad5b4d63b8bb03112f63b99d8ee8e82e57af4bbb042b0bf9","target":"record","created_at":"2026-05-18T01:21:00Z","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":"9b06ed4797400dea936584b670882c7cf32e809467cf2544efb02695c64e07f3","cross_cats_sorted":["math.IT","nlin.AO","stat.ME"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-02-10T07:03:14Z","title_canon_sha256":"01a0fadccabc30cbdd8e2194bf99d54f568d029c6c8b7c2d02b0687cc0a16a77"},"schema_version":"1.0","source":{"id":"1602.03283","kind":"arxiv","version":1}},"canonical_sha256":"0be1e8ed38203f909603a36ac413eb8db0a0e0dd91acb5a46b2f9f65b681d36d","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"0be1e8ed38203f909603a36ac413eb8db0a0e0dd91acb5a46b2f9f65b681d36d","first_computed_at":"2026-05-18T01:21:00.345484Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:21:00.345484Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Zou77ccp+GolWM7chB7N6gxgIgC7v8hlNmfK5PwOL/ru33tZWJuS4lvDNcGDt29SXxo2TBKd6ntTbelGLpWzAg==","signature_status":"signed_v1","signed_at":"2026-05-18T01:21:00.345903Z","signed_message":"canonical_sha256_bytes"},"source_id":"1602.03283","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:fdc119b699dfb082ad5b4d63b8bb03112f63b99d8ee8e82e57af4bbb042b0bf9","sha256:df9e6e4d2ae8e6ae5cbdb97b5cb682a607e35d6b63a1f0bb663175a13807e37d"],"state_sha256":"372beb3d8d2947de356cf266e59def3fda494aa233c5c168668070d199ebaca3"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Ql76zlKC3JBzDjVGajUb7rK5N01eDCXVoR7931Pv30YRO0WGcFHUCINC00y9dfGidE4DrIi71z3NgplYTi1sBw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-31T19:55:30.016994Z","bundle_sha256":"00f0f9657127b218fd130d241b5945d4ed2180a756936d4d64d8d1e4f2a77b4a"}}