{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2008:QOYZ6C5YYNEFVKNCETANGP2LWG","short_pith_number":"pith:QOYZ6C5Y","canonical_record":{"source":{"id":"0803.2392","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2008-03-17T05:59:48Z","cross_cats_sorted":["cs.IT","math.IT"],"title_canon_sha256":"40a9136ca2b36b221e280700fc14dc0bb541fceb39e1833ada6263f049360c41","abstract_canon_sha256":"af031d6591db831b8ad72804f8fafd4638728c3f483fa01f22630f6b41c41344"},"schema_version":"1.0"},"canonical_sha256":"83b19f0bb8c3485aa9a224c0d33f4bb18f4bc59d2917800f6f0496a8db8d123d","source":{"kind":"arxiv","id":"0803.2392","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"0803.2392","created_at":"2026-05-18T02:53:16Z"},{"alias_kind":"arxiv_version","alias_value":"0803.2392v2","created_at":"2026-05-18T02:53:16Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0803.2392","created_at":"2026-05-18T02:53:16Z"},{"alias_kind":"pith_short_12","alias_value":"QOYZ6C5YYNEF","created_at":"2026-05-18T12:25:58Z"},{"alias_kind":"pith_short_16","alias_value":"QOYZ6C5YYNEFVKNC","created_at":"2026-05-18T12:25:58Z"},{"alias_kind":"pith_short_8","alias_value":"QOYZ6C5Y","created_at":"2026-05-18T12:25:58Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2008:QOYZ6C5YYNEFVKNCETANGP2LWG","target":"record","payload":{"canonical_record":{"source":{"id":"0803.2392","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2008-03-17T05:59:48Z","cross_cats_sorted":["cs.IT","math.IT"],"title_canon_sha256":"40a9136ca2b36b221e280700fc14dc0bb541fceb39e1833ada6263f049360c41","abstract_canon_sha256":"af031d6591db831b8ad72804f8fafd4638728c3f483fa01f22630f6b41c41344"},"schema_version":"1.0"},"canonical_sha256":"83b19f0bb8c3485aa9a224c0d33f4bb18f4bc59d2917800f6f0496a8db8d123d","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:53:16.104530Z","signature_b64":"AV6o++RZonOUrH6iDQyDSJjmSfqQwavomCFMhQhEkXebn/2Ac4VtGHtpZsrC++9gz2qbgVM1S0mopXuZ/G5SAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"83b19f0bb8c3485aa9a224c0d33f4bb18f4bc59d2917800f6f0496a8db8d123d","last_reissued_at":"2026-05-18T02:53:16.103790Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:53:16.103790Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"0803.2392","source_version":2,"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-18T02:53:16Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"QWYD+zI6QobgFq8WtAiJOBNFAQX1WRP33HXW1om+OiFay/Rs/Tg4HO4e/llxlRPFY5VVH3RRqlpJTQdzpZnFCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T07:37:10.275337Z"},"content_sha256":"c013691a00386286f43fc2a829344a251442d9d902d1665ca0a68051f681a111","schema_version":"1.0","event_id":"sha256:c013691a00386286f43fc2a829344a251442d9d902d1665ca0a68051f681a111"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2008:QOYZ6C5YYNEFVKNCETANGP2LWG","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"CoSaMP: Iterative signal recovery from incomplete and inaccurate samples","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IT","math.IT"],"primary_cat":"math.NA","authors_text":"D. Needell, J. A. Tropp","submitted_at":"2008-03-17T05:59:48Z","abstract_excerpt":"Compressive sampling offers a new paradigm for acquiring signals that are compressible with respect to an orthonormal basis. The major algorithmic challenge in compressive sampling is to approximate a compressible signal from noisy samples. This paper describes a new iterative recovery algorithm called CoSaMP that delivers the same guarantees as the best optimization-based approaches. Moreover, this algorithm offers rigorous bounds on computational cost and storage. It is likely to be extremely efficient for practical problems because it requires only matrix-vector multiplies with the sampling"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"0803.2392","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"},"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-18T02:53:16Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"tgnMTIjKD/xS1c5MdbUXotOf5Ei6PFuC55/Q7GtwrehY+3RT2UI/Lln/ZWx97JfCo8WEmGcTxbafDTFONQ1CAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T07:37:10.275691Z"},"content_sha256":"e9cbde64618580940a05b64d23475dc68b2b676db5644a3af5cf610d88509609","schema_version":"1.0","event_id":"sha256:e9cbde64618580940a05b64d23475dc68b2b676db5644a3af5cf610d88509609"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/QOYZ6C5YYNEFVKNCETANGP2LWG/bundle.json","state_url":"https://pith.science/pith/QOYZ6C5YYNEFVKNCETANGP2LWG/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/QOYZ6C5YYNEFVKNCETANGP2LWG/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-28T07:37:10Z","links":{"resolver":"https://pith.science/pith/QOYZ6C5YYNEFVKNCETANGP2LWG","bundle":"https://pith.science/pith/QOYZ6C5YYNEFVKNCETANGP2LWG/bundle.json","state":"https://pith.science/pith/QOYZ6C5YYNEFVKNCETANGP2LWG/state.json","well_known_bundle":"https://pith.science/.well-known/pith/QOYZ6C5YYNEFVKNCETANGP2LWG/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2008:QOYZ6C5YYNEFVKNCETANGP2LWG","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":"af031d6591db831b8ad72804f8fafd4638728c3f483fa01f22630f6b41c41344","cross_cats_sorted":["cs.IT","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2008-03-17T05:59:48Z","title_canon_sha256":"40a9136ca2b36b221e280700fc14dc0bb541fceb39e1833ada6263f049360c41"},"schema_version":"1.0","source":{"id":"0803.2392","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"0803.2392","created_at":"2026-05-18T02:53:16Z"},{"alias_kind":"arxiv_version","alias_value":"0803.2392v2","created_at":"2026-05-18T02:53:16Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0803.2392","created_at":"2026-05-18T02:53:16Z"},{"alias_kind":"pith_short_12","alias_value":"QOYZ6C5YYNEF","created_at":"2026-05-18T12:25:58Z"},{"alias_kind":"pith_short_16","alias_value":"QOYZ6C5YYNEFVKNC","created_at":"2026-05-18T12:25:58Z"},{"alias_kind":"pith_short_8","alias_value":"QOYZ6C5Y","created_at":"2026-05-18T12:25:58Z"}],"graph_snapshots":[{"event_id":"sha256:e9cbde64618580940a05b64d23475dc68b2b676db5644a3af5cf610d88509609","target":"graph","created_at":"2026-05-18T02:53:16Z","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":"Compressive sampling offers a new paradigm for acquiring signals that are compressible with respect to an orthonormal basis. The major algorithmic challenge in compressive sampling is to approximate a compressible signal from noisy samples. This paper describes a new iterative recovery algorithm called CoSaMP that delivers the same guarantees as the best optimization-based approaches. Moreover, this algorithm offers rigorous bounds on computational cost and storage. It is likely to be extremely efficient for practical problems because it requires only matrix-vector multiplies with the sampling","authors_text":"D. Needell, J. A. Tropp","cross_cats":["cs.IT","math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2008-03-17T05:59:48Z","title":"CoSaMP: Iterative signal recovery from incomplete and inaccurate samples"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"0803.2392","kind":"arxiv","version":2},"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:c013691a00386286f43fc2a829344a251442d9d902d1665ca0a68051f681a111","target":"record","created_at":"2026-05-18T02:53:16Z","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":"af031d6591db831b8ad72804f8fafd4638728c3f483fa01f22630f6b41c41344","cross_cats_sorted":["cs.IT","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2008-03-17T05:59:48Z","title_canon_sha256":"40a9136ca2b36b221e280700fc14dc0bb541fceb39e1833ada6263f049360c41"},"schema_version":"1.0","source":{"id":"0803.2392","kind":"arxiv","version":2}},"canonical_sha256":"83b19f0bb8c3485aa9a224c0d33f4bb18f4bc59d2917800f6f0496a8db8d123d","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"83b19f0bb8c3485aa9a224c0d33f4bb18f4bc59d2917800f6f0496a8db8d123d","first_computed_at":"2026-05-18T02:53:16.103790Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:53:16.103790Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"AV6o++RZonOUrH6iDQyDSJjmSfqQwavomCFMhQhEkXebn/2Ac4VtGHtpZsrC++9gz2qbgVM1S0mopXuZ/G5SAw==","signature_status":"signed_v1","signed_at":"2026-05-18T02:53:16.104530Z","signed_message":"canonical_sha256_bytes"},"source_id":"0803.2392","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:c013691a00386286f43fc2a829344a251442d9d902d1665ca0a68051f681a111","sha256:e9cbde64618580940a05b64d23475dc68b2b676db5644a3af5cf610d88509609"],"state_sha256":"229a32728c9c792ebb1001211625fa5e5d5a70e3e6e4a2c6ab57d2cfbbefb1c7"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ImKbtSOQlPgT+S6H9LLC3Bdpn6DNe/WAqdO1igpIStbKg3ZjsQ+0bAHMapOTGd62DbwM6pjdNawqcJkeDXNFBA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-28T07:37:10.277649Z","bundle_sha256":"852f0215206eb3c470bd0eb28c9d1e7e268642fccbbd7bc813c741509f7d2b29"}}