{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:LST5GIUP3BSOVYS6VOKD4HZZNL","short_pith_number":"pith:LST5GIUP","schema_version":"1.0","canonical_sha256":"5ca7d3228fd864eae25eab943e1f396ac40e696c3224f5642253b1849bf69b90","source":{"kind":"arxiv","id":"1312.4895","version":1},"attestation_state":"computed","paper":{"title":"Recursive Compressed Sensing","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IT","math.IT"],"primary_cat":"stat.ML","authors_text":"Martin Vetterli, Nikolaos M. Freris, Orhan \\\"O\\c{c}al","submitted_at":"2013-12-17T19:06:59Z","abstract_excerpt":"We introduce a recursive algorithm for performing compressed sensing on streaming data. The approach consists of a) recursive encoding, where we sample the input stream via overlapping windowing and make use of the previous measurement in obtaining the next one, and b) recursive decoding, where the signal estimate from the previous window is utilized in order to achieve faster convergence in an iterative optimization scheme applied to decode the new one. To remove estimation bias, a two-step estimation procedure is proposed comprising support set detection and signal amplitude estimation. Esti"},"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":"1312.4895","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2013-12-17T19:06:59Z","cross_cats_sorted":["cs.IT","math.IT"],"title_canon_sha256":"17cc17dd9a040669b1df8016ecf7dd0f3512b67403347fe6f4d9cb198cfbcc9f","abstract_canon_sha256":"b8a73bc9a8c2af93e30b0cc3f2ed1ef5eec5e6c098168f296c11a49f06d3312c"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:04:22.938031Z","signature_b64":"2Mys3CxS6hOqhCSpdFuGFkVS9xIAJb441AgY65qbE9BVIy6JIcGNz+zERUpUiTQScWsJ/Y3U5hf11f3ib0k3CA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5ca7d3228fd864eae25eab943e1f396ac40e696c3224f5642253b1849bf69b90","last_reissued_at":"2026-05-18T03:04:22.937603Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:04:22.937603Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Recursive Compressed Sensing","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IT","math.IT"],"primary_cat":"stat.ML","authors_text":"Martin Vetterli, Nikolaos M. Freris, Orhan \\\"O\\c{c}al","submitted_at":"2013-12-17T19:06:59Z","abstract_excerpt":"We introduce a recursive algorithm for performing compressed sensing on streaming data. The approach consists of a) recursive encoding, where we sample the input stream via overlapping windowing and make use of the previous measurement in obtaining the next one, and b) recursive decoding, where the signal estimate from the previous window is utilized in order to achieve faster convergence in an iterative optimization scheme applied to decode the new one. To remove estimation bias, a two-step estimation procedure is proposed comprising support set detection and signal amplitude estimation. Esti"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1312.4895","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":"1312.4895","created_at":"2026-05-18T03:04:22.937672+00:00"},{"alias_kind":"arxiv_version","alias_value":"1312.4895v1","created_at":"2026-05-18T03:04:22.937672+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1312.4895","created_at":"2026-05-18T03:04:22.937672+00:00"},{"alias_kind":"pith_short_12","alias_value":"LST5GIUP3BSO","created_at":"2026-05-18T12:27:51.066281+00:00"},{"alias_kind":"pith_short_16","alias_value":"LST5GIUP3BSOVYS6","created_at":"2026-05-18T12:27:51.066281+00:00"},{"alias_kind":"pith_short_8","alias_value":"LST5GIUP","created_at":"2026-05-18T12:27:51.066281+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/LST5GIUP3BSOVYS6VOKD4HZZNL","json":"https://pith.science/pith/LST5GIUP3BSOVYS6VOKD4HZZNL.json","graph_json":"https://pith.science/api/pith-number/LST5GIUP3BSOVYS6VOKD4HZZNL/graph.json","events_json":"https://pith.science/api/pith-number/LST5GIUP3BSOVYS6VOKD4HZZNL/events.json","paper":"https://pith.science/paper/LST5GIUP"},"agent_actions":{"view_html":"https://pith.science/pith/LST5GIUP3BSOVYS6VOKD4HZZNL","download_json":"https://pith.science/pith/LST5GIUP3BSOVYS6VOKD4HZZNL.json","view_paper":"https://pith.science/paper/LST5GIUP","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1312.4895&json=true","fetch_graph":"https://pith.science/api/pith-number/LST5GIUP3BSOVYS6VOKD4HZZNL/graph.json","fetch_events":"https://pith.science/api/pith-number/LST5GIUP3BSOVYS6VOKD4HZZNL/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/LST5GIUP3BSOVYS6VOKD4HZZNL/action/timestamp_anchor","attest_storage":"https://pith.science/pith/LST5GIUP3BSOVYS6VOKD4HZZNL/action/storage_attestation","attest_author":"https://pith.science/pith/LST5GIUP3BSOVYS6VOKD4HZZNL/action/author_attestation","sign_citation":"https://pith.science/pith/LST5GIUP3BSOVYS6VOKD4HZZNL/action/citation_signature","submit_replication":"https://pith.science/pith/LST5GIUP3BSOVYS6VOKD4HZZNL/action/replication_record"}},"created_at":"2026-05-18T03:04:22.937672+00:00","updated_at":"2026-05-18T03:04:22.937672+00:00"}