{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:ZI7YFT2KGZFTVWI5F5JV6Y2ZP3","short_pith_number":"pith:ZI7YFT2K","canonical_record":{"source":{"id":"1506.04779","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2015-06-15T21:29:34Z","cross_cats_sorted":[],"title_canon_sha256":"592fbdd5d1145ecfaeb53e507f048070e334796f4a70c70142833d0f2d753be2","abstract_canon_sha256":"c11545db337422c77a7c4dae35a055c8f5ebe792e9ae7cfd25bbc5f51cb0a962"},"schema_version":"1.0"},"canonical_sha256":"ca3f82cf4a364b3ad91d2f535f63597ed38f009db9e5dda7071cfc253d95893e","source":{"kind":"arxiv","id":"1506.04779","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1506.04779","created_at":"2026-05-18T01:48:05Z"},{"alias_kind":"arxiv_version","alias_value":"1506.04779v1","created_at":"2026-05-18T01:48:05Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1506.04779","created_at":"2026-05-18T01:48:05Z"},{"alias_kind":"pith_short_12","alias_value":"ZI7YFT2KGZFT","created_at":"2026-05-18T12:29:52Z"},{"alias_kind":"pith_short_16","alias_value":"ZI7YFT2KGZFTVWI5","created_at":"2026-05-18T12:29:52Z"},{"alias_kind":"pith_short_8","alias_value":"ZI7YFT2K","created_at":"2026-05-18T12:29:52Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:ZI7YFT2KGZFTVWI5F5JV6Y2ZP3","target":"record","payload":{"canonical_record":{"source":{"id":"1506.04779","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2015-06-15T21:29:34Z","cross_cats_sorted":[],"title_canon_sha256":"592fbdd5d1145ecfaeb53e507f048070e334796f4a70c70142833d0f2d753be2","abstract_canon_sha256":"c11545db337422c77a7c4dae35a055c8f5ebe792e9ae7cfd25bbc5f51cb0a962"},"schema_version":"1.0"},"canonical_sha256":"ca3f82cf4a364b3ad91d2f535f63597ed38f009db9e5dda7071cfc253d95893e","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:48:05.889165Z","signature_b64":"/fOZMieiFd3GP4rFa7bhHg4cWnEb3FbB7Z6vpyX+8Fmy2LolthSBKJM9YBr8eErTnm6ps87PN1vvOrNNfr7AAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ca3f82cf4a364b3ad91d2f535f63597ed38f009db9e5dda7071cfc253d95893e","last_reissued_at":"2026-05-18T01:48:05.888554Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:48:05.888554Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1506.04779","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-18T01:48:05Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"8nLr4hSMwFrHmYIBJcocmSKv3YOMZxRffUxCZA93mEdH6bbpUOTH+WmanUhcBkCGAu1XAvSRW0gjw9PD6epXCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T00:14:35.507550Z"},"content_sha256":"5c99566359d5df644f44d8ab0fe20d8ccde49e23185edc81acc7e1e20dae73f2","schema_version":"1.0","event_id":"sha256:5c99566359d5df644f44d8ab0fe20d8ccde49e23185edc81acc7e1e20dae73f2"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:ZI7YFT2KGZFTVWI5F5JV6Y2ZP3","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Orthogonal Matching Pursuit under the Restricted Isometry Property","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.NA","authors_text":"Albert Cohen, Ronald DeVore, Wolfgang Dahmen","submitted_at":"2015-06-15T21:29:34Z","abstract_excerpt":"This paper is concerned with the performance of Orthogonal Matching Pursuit (OMP) algorithms applied to a dictionary $\\mathcal{D}$ in a Hilbert space $\\mathcal{H}$. Given an element $f\\in \\mathcal{H}$, OMP generates a sequence of approximations $f_n$, $n=1,2,\\dots$, each of which is a linear combination of $n$ dictionary elements chosen by a greedy criterion. It is studied whether the approximations $f_n$ are in some sense comparable to {\\em best $n$ term approximation} from the dictionary. One important result related to this question is a theorem of Zhang \\cite{TZ} in the context of sparse r"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1506.04779","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-18T01:48:05Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"u5YwLD2lp5rB/rPvQbzHrML9TaP6HChQ1skCSjOTGsw6tZ6KsW6mEIzDOfVTPXgCdL8sxWCf2Pln6URTD1b/DA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T00:14:35.507946Z"},"content_sha256":"8bec21f7cfc14722d6947636c3f765d0d47f4e99ca56b937a354a0d816615dcf","schema_version":"1.0","event_id":"sha256:8bec21f7cfc14722d6947636c3f765d0d47f4e99ca56b937a354a0d816615dcf"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/ZI7YFT2KGZFTVWI5F5JV6Y2ZP3/bundle.json","state_url":"https://pith.science/pith/ZI7YFT2KGZFTVWI5F5JV6Y2ZP3/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/ZI7YFT2KGZFTVWI5F5JV6Y2ZP3/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-06-01T00:14:35Z","links":{"resolver":"https://pith.science/pith/ZI7YFT2KGZFTVWI5F5JV6Y2ZP3","bundle":"https://pith.science/pith/ZI7YFT2KGZFTVWI5F5JV6Y2ZP3/bundle.json","state":"https://pith.science/pith/ZI7YFT2KGZFTVWI5F5JV6Y2ZP3/state.json","well_known_bundle":"https://pith.science/.well-known/pith/ZI7YFT2KGZFTVWI5F5JV6Y2ZP3/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:ZI7YFT2KGZFTVWI5F5JV6Y2ZP3","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":"c11545db337422c77a7c4dae35a055c8f5ebe792e9ae7cfd25bbc5f51cb0a962","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2015-06-15T21:29:34Z","title_canon_sha256":"592fbdd5d1145ecfaeb53e507f048070e334796f4a70c70142833d0f2d753be2"},"schema_version":"1.0","source":{"id":"1506.04779","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1506.04779","created_at":"2026-05-18T01:48:05Z"},{"alias_kind":"arxiv_version","alias_value":"1506.04779v1","created_at":"2026-05-18T01:48:05Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1506.04779","created_at":"2026-05-18T01:48:05Z"},{"alias_kind":"pith_short_12","alias_value":"ZI7YFT2KGZFT","created_at":"2026-05-18T12:29:52Z"},{"alias_kind":"pith_short_16","alias_value":"ZI7YFT2KGZFTVWI5","created_at":"2026-05-18T12:29:52Z"},{"alias_kind":"pith_short_8","alias_value":"ZI7YFT2K","created_at":"2026-05-18T12:29:52Z"}],"graph_snapshots":[{"event_id":"sha256:8bec21f7cfc14722d6947636c3f765d0d47f4e99ca56b937a354a0d816615dcf","target":"graph","created_at":"2026-05-18T01:48:05Z","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":"This paper is concerned with the performance of Orthogonal Matching Pursuit (OMP) algorithms applied to a dictionary $\\mathcal{D}$ in a Hilbert space $\\mathcal{H}$. Given an element $f\\in \\mathcal{H}$, OMP generates a sequence of approximations $f_n$, $n=1,2,\\dots$, each of which is a linear combination of $n$ dictionary elements chosen by a greedy criterion. It is studied whether the approximations $f_n$ are in some sense comparable to {\\em best $n$ term approximation} from the dictionary. One important result related to this question is a theorem of Zhang \\cite{TZ} in the context of sparse r","authors_text":"Albert Cohen, Ronald DeVore, Wolfgang Dahmen","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2015-06-15T21:29:34Z","title":"Orthogonal Matching Pursuit under the Restricted Isometry Property"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1506.04779","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:5c99566359d5df644f44d8ab0fe20d8ccde49e23185edc81acc7e1e20dae73f2","target":"record","created_at":"2026-05-18T01:48:05Z","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":"c11545db337422c77a7c4dae35a055c8f5ebe792e9ae7cfd25bbc5f51cb0a962","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2015-06-15T21:29:34Z","title_canon_sha256":"592fbdd5d1145ecfaeb53e507f048070e334796f4a70c70142833d0f2d753be2"},"schema_version":"1.0","source":{"id":"1506.04779","kind":"arxiv","version":1}},"canonical_sha256":"ca3f82cf4a364b3ad91d2f535f63597ed38f009db9e5dda7071cfc253d95893e","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"ca3f82cf4a364b3ad91d2f535f63597ed38f009db9e5dda7071cfc253d95893e","first_computed_at":"2026-05-18T01:48:05.888554Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:48:05.888554Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"/fOZMieiFd3GP4rFa7bhHg4cWnEb3FbB7Z6vpyX+8Fmy2LolthSBKJM9YBr8eErTnm6ps87PN1vvOrNNfr7AAQ==","signature_status":"signed_v1","signed_at":"2026-05-18T01:48:05.889165Z","signed_message":"canonical_sha256_bytes"},"source_id":"1506.04779","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:5c99566359d5df644f44d8ab0fe20d8ccde49e23185edc81acc7e1e20dae73f2","sha256:8bec21f7cfc14722d6947636c3f765d0d47f4e99ca56b937a354a0d816615dcf"],"state_sha256":"18b99a6876e606c8cfa4b40c6b6a4cf01c09c1706da7b6def3f974ba63fa58fa"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Q4HM2zekZ3e05TFigT/URUxZu3iGKMlmxFIicmTvl5QQDo3pQIZMKSuy2Co8JulYKk9M/OoiyiEZxcAn3NksDw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-01T00:14:35.510447Z","bundle_sha256":"092c4190afc449cf9876bee0f759ac1c38a138207b94443b28cb0bed35508a90"}}