{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2008:NULVVYTTEVM2MZLCGMCQDVE43B","short_pith_number":"pith:NULVVYTT","schema_version":"1.0","canonical_sha256":"6d175ae2732559a66562330501d49cd848f1446d59793b18f321a39082d4e600","source":{"kind":"arxiv","id":"0804.0819","version":1},"attestation_state":"computed","paper":{"title":"Kalman Filtered Compressed Sensing","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT","math.ST","stat.TH"],"primary_cat":"cs.IT","authors_text":"Namrata Vaswani","submitted_at":"2008-04-04T22:56:33Z","abstract_excerpt":"We consider the problem of reconstructing time sequences of spatially sparse signals (with unknown and time-varying sparsity patterns) from a limited number of linear \"incoherent\" measurements, in real-time. The signals are sparse in some transform domain referred to as the sparsity basis. For a single spatial signal, the solution is provided by Compressed Sensing (CS). The question that we address is, for a sequence of sparse signals, can we do better than CS, if (a) the sparsity pattern of the signal's transform coefficients' vector changes slowly over time, and (b) a simple prior model on t"},"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":"0804.0819","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2008-04-04T22:56:33Z","cross_cats_sorted":["math.IT","math.ST","stat.TH"],"title_canon_sha256":"0cb3913383a283d707e8c4d499c338ae816dcbb339281aec7fb4bf9e7cda0919","abstract_canon_sha256":"6811bd8698cb133bd541d8a755b7b9e97ada0a4bd3b75d5f5293138d9cc06341"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:58:25.667926Z","signature_b64":"0HR6d87gZAhGfiDUQ/Cx/+3Hsscwf7iNAkhLTVsijdl6Q1/8cszaMCW6RGIZLUWIiDAu6G63uvMfn+dAVkX9Cw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6d175ae2732559a66562330501d49cd848f1446d59793b18f321a39082d4e600","last_reissued_at":"2026-05-18T00:58:25.667258Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:58:25.667258Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Kalman Filtered Compressed Sensing","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT","math.ST","stat.TH"],"primary_cat":"cs.IT","authors_text":"Namrata Vaswani","submitted_at":"2008-04-04T22:56:33Z","abstract_excerpt":"We consider the problem of reconstructing time sequences of spatially sparse signals (with unknown and time-varying sparsity patterns) from a limited number of linear \"incoherent\" measurements, in real-time. The signals are sparse in some transform domain referred to as the sparsity basis. For a single spatial signal, the solution is provided by Compressed Sensing (CS). The question that we address is, for a sequence of sparse signals, can we do better than CS, if (a) the sparsity pattern of the signal's transform coefficients' vector changes slowly over time, and (b) a simple prior model on t"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"0804.0819","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":"0804.0819","created_at":"2026-05-18T00:58:25.667402+00:00"},{"alias_kind":"arxiv_version","alias_value":"0804.0819v1","created_at":"2026-05-18T00:58:25.667402+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0804.0819","created_at":"2026-05-18T00:58:25.667402+00:00"},{"alias_kind":"pith_short_12","alias_value":"NULVVYTTEVM2","created_at":"2026-05-18T12:25:57.157939+00:00"},{"alias_kind":"pith_short_16","alias_value":"NULVVYTTEVM2MZLC","created_at":"2026-05-18T12:25:57.157939+00:00"},{"alias_kind":"pith_short_8","alias_value":"NULVVYTT","created_at":"2026-05-18T12:25:57.157939+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/NULVVYTTEVM2MZLCGMCQDVE43B","json":"https://pith.science/pith/NULVVYTTEVM2MZLCGMCQDVE43B.json","graph_json":"https://pith.science/api/pith-number/NULVVYTTEVM2MZLCGMCQDVE43B/graph.json","events_json":"https://pith.science/api/pith-number/NULVVYTTEVM2MZLCGMCQDVE43B/events.json","paper":"https://pith.science/paper/NULVVYTT"},"agent_actions":{"view_html":"https://pith.science/pith/NULVVYTTEVM2MZLCGMCQDVE43B","download_json":"https://pith.science/pith/NULVVYTTEVM2MZLCGMCQDVE43B.json","view_paper":"https://pith.science/paper/NULVVYTT","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=0804.0819&json=true","fetch_graph":"https://pith.science/api/pith-number/NULVVYTTEVM2MZLCGMCQDVE43B/graph.json","fetch_events":"https://pith.science/api/pith-number/NULVVYTTEVM2MZLCGMCQDVE43B/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/NULVVYTTEVM2MZLCGMCQDVE43B/action/timestamp_anchor","attest_storage":"https://pith.science/pith/NULVVYTTEVM2MZLCGMCQDVE43B/action/storage_attestation","attest_author":"https://pith.science/pith/NULVVYTTEVM2MZLCGMCQDVE43B/action/author_attestation","sign_citation":"https://pith.science/pith/NULVVYTTEVM2MZLCGMCQDVE43B/action/citation_signature","submit_replication":"https://pith.science/pith/NULVVYTTEVM2MZLCGMCQDVE43B/action/replication_record"}},"created_at":"2026-05-18T00:58:25.667402+00:00","updated_at":"2026-05-18T00:58:25.667402+00:00"}