{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:LST5GIUP3BSOVYS6VOKD4HZZNL","short_pith_number":"pith:LST5GIUP","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"},"canonical_sha256":"5ca7d3228fd864eae25eab943e1f396ac40e696c3224f5642253b1849bf69b90","source":{"kind":"arxiv","id":"1312.4895","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1312.4895","created_at":"2026-05-18T03:04:22Z"},{"alias_kind":"arxiv_version","alias_value":"1312.4895v1","created_at":"2026-05-18T03:04:22Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1312.4895","created_at":"2026-05-18T03:04:22Z"},{"alias_kind":"pith_short_12","alias_value":"LST5GIUP3BSO","created_at":"2026-05-18T12:27:51Z"},{"alias_kind":"pith_short_16","alias_value":"LST5GIUP3BSOVYS6","created_at":"2026-05-18T12:27:51Z"},{"alias_kind":"pith_short_8","alias_value":"LST5GIUP","created_at":"2026-05-18T12:27:51Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:LST5GIUP3BSOVYS6VOKD4HZZNL","target":"record","payload":{"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"},"canonical_sha256":"5ca7d3228fd864eae25eab943e1f396ac40e696c3224f5642253b1849bf69b90","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"},"source_kind":"arxiv","source_id":"1312.4895","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-18T03:04:22Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"P/ONo8R39ptIG4xyTrxCeJCgkMVHBWApzCySWLjP4y4biCYMAQNLMuAgLfdKbaJSxMKOVhKy3B0cWRLzedCcAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T00:53:20.791115Z"},"content_sha256":"6808f73205502f902630a92bf37652b2d9c55f6330ff68fa16a0a49cf4bc84ab","schema_version":"1.0","event_id":"sha256:6808f73205502f902630a92bf37652b2d9c55f6330ff68fa16a0a49cf4bc84ab"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:LST5GIUP3BSOVYS6VOKD4HZZNL","target":"graph","payload":{"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"},"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-18T03:04:22Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"1O9yNQ2JHfNDyQsrT280h8LW+/tcmItdU8L6czWMuFS8KIPSfrcUiDuBctRznWp+NFZOjSsvt9LoEjAF/czTDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T00:53:20.791852Z"},"content_sha256":"754588675fb7eb634d2f5badb27ff3705e1043521687026b7cd7607c4e3a1384","schema_version":"1.0","event_id":"sha256:754588675fb7eb634d2f5badb27ff3705e1043521687026b7cd7607c4e3a1384"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/LST5GIUP3BSOVYS6VOKD4HZZNL/bundle.json","state_url":"https://pith.science/pith/LST5GIUP3BSOVYS6VOKD4HZZNL/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/LST5GIUP3BSOVYS6VOKD4HZZNL/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-26T00:53:20Z","links":{"resolver":"https://pith.science/pith/LST5GIUP3BSOVYS6VOKD4HZZNL","bundle":"https://pith.science/pith/LST5GIUP3BSOVYS6VOKD4HZZNL/bundle.json","state":"https://pith.science/pith/LST5GIUP3BSOVYS6VOKD4HZZNL/state.json","well_known_bundle":"https://pith.science/.well-known/pith/LST5GIUP3BSOVYS6VOKD4HZZNL/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:LST5GIUP3BSOVYS6VOKD4HZZNL","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":"b8a73bc9a8c2af93e30b0cc3f2ed1ef5eec5e6c098168f296c11a49f06d3312c","cross_cats_sorted":["cs.IT","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2013-12-17T19:06:59Z","title_canon_sha256":"17cc17dd9a040669b1df8016ecf7dd0f3512b67403347fe6f4d9cb198cfbcc9f"},"schema_version":"1.0","source":{"id":"1312.4895","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1312.4895","created_at":"2026-05-18T03:04:22Z"},{"alias_kind":"arxiv_version","alias_value":"1312.4895v1","created_at":"2026-05-18T03:04:22Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1312.4895","created_at":"2026-05-18T03:04:22Z"},{"alias_kind":"pith_short_12","alias_value":"LST5GIUP3BSO","created_at":"2026-05-18T12:27:51Z"},{"alias_kind":"pith_short_16","alias_value":"LST5GIUP3BSOVYS6","created_at":"2026-05-18T12:27:51Z"},{"alias_kind":"pith_short_8","alias_value":"LST5GIUP","created_at":"2026-05-18T12:27:51Z"}],"graph_snapshots":[{"event_id":"sha256:754588675fb7eb634d2f5badb27ff3705e1043521687026b7cd7607c4e3a1384","target":"graph","created_at":"2026-05-18T03:04:22Z","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":"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","authors_text":"Martin Vetterli, Nikolaos M. Freris, Orhan \\\"O\\c{c}al","cross_cats":["cs.IT","math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2013-12-17T19:06:59Z","title":"Recursive Compressed Sensing"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1312.4895","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:6808f73205502f902630a92bf37652b2d9c55f6330ff68fa16a0a49cf4bc84ab","target":"record","created_at":"2026-05-18T03:04:22Z","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":"b8a73bc9a8c2af93e30b0cc3f2ed1ef5eec5e6c098168f296c11a49f06d3312c","cross_cats_sorted":["cs.IT","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2013-12-17T19:06:59Z","title_canon_sha256":"17cc17dd9a040669b1df8016ecf7dd0f3512b67403347fe6f4d9cb198cfbcc9f"},"schema_version":"1.0","source":{"id":"1312.4895","kind":"arxiv","version":1}},"canonical_sha256":"5ca7d3228fd864eae25eab943e1f396ac40e696c3224f5642253b1849bf69b90","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"5ca7d3228fd864eae25eab943e1f396ac40e696c3224f5642253b1849bf69b90","first_computed_at":"2026-05-18T03:04:22.937603Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:04:22.937603Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"2Mys3CxS6hOqhCSpdFuGFkVS9xIAJb441AgY65qbE9BVIy6JIcGNz+zERUpUiTQScWsJ/Y3U5hf11f3ib0k3CA==","signature_status":"signed_v1","signed_at":"2026-05-18T03:04:22.938031Z","signed_message":"canonical_sha256_bytes"},"source_id":"1312.4895","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:6808f73205502f902630a92bf37652b2d9c55f6330ff68fa16a0a49cf4bc84ab","sha256:754588675fb7eb634d2f5badb27ff3705e1043521687026b7cd7607c4e3a1384"],"state_sha256":"7395fc7b5407ce3aecc39f8781fa39a2893e45d0046a1f8605521367b0be9eb5"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"sIL94MOPBrJ7EjrlAObjyG0AgQqFFiEFPOmmRXkx6qToiuCRTjYEkndrNCXbsHu4nc3SfLOXVYlT/lOlkK+cCw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-26T00:53:20.795996Z","bundle_sha256":"7d25d2a873eed8aefdb6dbd1fbbabacbca6d98a7e45797dca76b57c9a9e105ca"}}