{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:3QLUIEXT6TTVSSX4B3IGRW7LQJ","short_pith_number":"pith:3QLUIEXT","schema_version":"1.0","canonical_sha256":"dc174412f3f4e7594afc0ed068dbeb826cb9d24c5d1156cb4d0a670f949ec53b","source":{"kind":"arxiv","id":"1507.06145","version":2},"attestation_state":"computed","paper":{"title":"Dynamic Filtering of Time-Varying Sparse Signals via l1 Minimization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ML","stat.TH"],"primary_cat":"math.ST","authors_text":"Adam Charles, Aurele Balavoine, Christopher Rozell","submitted_at":"2015-07-22T12:10:16Z","abstract_excerpt":"Despite the importance of sparsity signal models and the increasing prevalence of high-dimensional streaming data, there are relatively few algorithms for dynamic filtering of time-varying sparse signals. Of the existing algorithms, fewer still provide strong performance guarantees. This paper examines two algorithms for dynamic filtering of sparse signals that are based on efficient l1 optimization methods. We first present an analysis for one simple algorithm (BPDN-DF) that works well when the system dynamics are known exactly. We then introduce a novel second algorithm (RWL1-DF) that is mor"},"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":"1507.06145","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.ST","submitted_at":"2015-07-22T12:10:16Z","cross_cats_sorted":["stat.ML","stat.TH"],"title_canon_sha256":"1ca45d4992ffcc573ba959f100786fe94df9853bd967ba40aad4135a372582a5","abstract_canon_sha256":"4db981f6b28083fb9b4617d49189f02569c9dbb5e1b15fc3a7ef401251594a68"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:00:40.485583Z","signature_b64":"dEC/OdMh+U00MV1IFfvcY9z6RX6nI5aZkWNQSJq5hNZuzk8pAR81P8Mj7rQfllIixc1I43Ufr0AfATF8XHK4DQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"dc174412f3f4e7594afc0ed068dbeb826cb9d24c5d1156cb4d0a670f949ec53b","last_reissued_at":"2026-05-18T01:00:40.485105Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:00:40.485105Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Dynamic Filtering of Time-Varying Sparse Signals via l1 Minimization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ML","stat.TH"],"primary_cat":"math.ST","authors_text":"Adam Charles, Aurele Balavoine, Christopher Rozell","submitted_at":"2015-07-22T12:10:16Z","abstract_excerpt":"Despite the importance of sparsity signal models and the increasing prevalence of high-dimensional streaming data, there are relatively few algorithms for dynamic filtering of time-varying sparse signals. Of the existing algorithms, fewer still provide strong performance guarantees. This paper examines two algorithms for dynamic filtering of sparse signals that are based on efficient l1 optimization methods. We first present an analysis for one simple algorithm (BPDN-DF) that works well when the system dynamics are known exactly. We then introduce a novel second algorithm (RWL1-DF) that is mor"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1507.06145","kind":"arxiv","version":2},"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":"1507.06145","created_at":"2026-05-18T01:00:40.485175+00:00"},{"alias_kind":"arxiv_version","alias_value":"1507.06145v2","created_at":"2026-05-18T01:00:40.485175+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1507.06145","created_at":"2026-05-18T01:00:40.485175+00:00"},{"alias_kind":"pith_short_12","alias_value":"3QLUIEXT6TTV","created_at":"2026-05-18T12:29:02.477457+00:00"},{"alias_kind":"pith_short_16","alias_value":"3QLUIEXT6TTVSSX4","created_at":"2026-05-18T12:29:02.477457+00:00"},{"alias_kind":"pith_short_8","alias_value":"3QLUIEXT","created_at":"2026-05-18T12:29:02.477457+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/3QLUIEXT6TTVSSX4B3IGRW7LQJ","json":"https://pith.science/pith/3QLUIEXT6TTVSSX4B3IGRW7LQJ.json","graph_json":"https://pith.science/api/pith-number/3QLUIEXT6TTVSSX4B3IGRW7LQJ/graph.json","events_json":"https://pith.science/api/pith-number/3QLUIEXT6TTVSSX4B3IGRW7LQJ/events.json","paper":"https://pith.science/paper/3QLUIEXT"},"agent_actions":{"view_html":"https://pith.science/pith/3QLUIEXT6TTVSSX4B3IGRW7LQJ","download_json":"https://pith.science/pith/3QLUIEXT6TTVSSX4B3IGRW7LQJ.json","view_paper":"https://pith.science/paper/3QLUIEXT","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1507.06145&json=true","fetch_graph":"https://pith.science/api/pith-number/3QLUIEXT6TTVSSX4B3IGRW7LQJ/graph.json","fetch_events":"https://pith.science/api/pith-number/3QLUIEXT6TTVSSX4B3IGRW7LQJ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/3QLUIEXT6TTVSSX4B3IGRW7LQJ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/3QLUIEXT6TTVSSX4B3IGRW7LQJ/action/storage_attestation","attest_author":"https://pith.science/pith/3QLUIEXT6TTVSSX4B3IGRW7LQJ/action/author_attestation","sign_citation":"https://pith.science/pith/3QLUIEXT6TTVSSX4B3IGRW7LQJ/action/citation_signature","submit_replication":"https://pith.science/pith/3QLUIEXT6TTVSSX4B3IGRW7LQJ/action/replication_record"}},"created_at":"2026-05-18T01:00:40.485175+00:00","updated_at":"2026-05-18T01:00:40.485175+00:00"}