{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:CTS3QQ66UVWKZBVP2UU7QBHDUE","short_pith_number":"pith:CTS3QQ66","schema_version":"1.0","canonical_sha256":"14e5b843dea56cac86afd529f804e3a10350a6491648d7568fe33d5479136dc6","source":{"kind":"arxiv","id":"2404.00146","version":3},"attestation_state":"computed","paper":{"title":"Fast Orthogonal Matching Pursuit through Successive Regression","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["math.OC"],"primary_cat":"cs.CV","authors_text":"Huiyuan Yu, Jia He, Maggie Cheng","submitted_at":"2024-03-29T20:39:37Z","abstract_excerpt":"Orthogonal Matching Pursuit (OMP) has been a powerful method in sparse signal recovery and approximation. However, OMP suffers computational issues when the signal has a large number of non-zeros. This paper advances OMP and its extension called generalized OMP (gOMP) by offering fast algorithms for the orthogonal projection of the input signal at each iteration. The proposed modifications directly reduce the computational complexity of OMP and gOMP. Experiment results verified the improvement in computation time. This paper also provides sufficient conditions for exact signal recovery. For ge"},"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":"2404.00146","kind":"arxiv","version":3},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CV","submitted_at":"2024-03-29T20:39:37Z","cross_cats_sorted":["math.OC"],"title_canon_sha256":"fb066bcff7d54405052a9f23861a8d1f7806ab90545bb50fc22757c3eea60dad","abstract_canon_sha256":"b00a4c82034a467894c9a6ce88c7173df2482081f7919433d79a848b0281708a"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T10:53:44.451379Z","signature_b64":"fHle8hjS8KrzZhonbGlcCphF5KCxWXjAze8x87DZBKhboHRicZX7TvDGGevVkwrnxrtpp33bWC0Jv1HZ7Q4cBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"14e5b843dea56cac86afd529f804e3a10350a6491648d7568fe33d5479136dc6","last_reissued_at":"2026-07-05T10:53:44.450961Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T10:53:44.450961Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Fast Orthogonal Matching Pursuit through Successive Regression","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["math.OC"],"primary_cat":"cs.CV","authors_text":"Huiyuan Yu, Jia He, Maggie Cheng","submitted_at":"2024-03-29T20:39:37Z","abstract_excerpt":"Orthogonal Matching Pursuit (OMP) has been a powerful method in sparse signal recovery and approximation. However, OMP suffers computational issues when the signal has a large number of non-zeros. This paper advances OMP and its extension called generalized OMP (gOMP) by offering fast algorithms for the orthogonal projection of the input signal at each iteration. The proposed modifications directly reduce the computational complexity of OMP and gOMP. Experiment results verified the improvement in computation time. This paper also provides sufficient conditions for exact signal recovery. For ge"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2404.00146","kind":"arxiv","version":3},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2404.00146/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"2404.00146","created_at":"2026-07-05T10:53:44.451020+00:00"},{"alias_kind":"arxiv_version","alias_value":"2404.00146v3","created_at":"2026-07-05T10:53:44.451020+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2404.00146","created_at":"2026-07-05T10:53:44.451020+00:00"},{"alias_kind":"pith_short_12","alias_value":"CTS3QQ66UVWK","created_at":"2026-07-05T10:53:44.451020+00:00"},{"alias_kind":"pith_short_16","alias_value":"CTS3QQ66UVWKZBVP","created_at":"2026-07-05T10:53:44.451020+00:00"},{"alias_kind":"pith_short_8","alias_value":"CTS3QQ66","created_at":"2026-07-05T10:53:44.451020+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/CTS3QQ66UVWKZBVP2UU7QBHDUE","json":"https://pith.science/pith/CTS3QQ66UVWKZBVP2UU7QBHDUE.json","graph_json":"https://pith.science/api/pith-number/CTS3QQ66UVWKZBVP2UU7QBHDUE/graph.json","events_json":"https://pith.science/api/pith-number/CTS3QQ66UVWKZBVP2UU7QBHDUE/events.json","paper":"https://pith.science/paper/CTS3QQ66"},"agent_actions":{"view_html":"https://pith.science/pith/CTS3QQ66UVWKZBVP2UU7QBHDUE","download_json":"https://pith.science/pith/CTS3QQ66UVWKZBVP2UU7QBHDUE.json","view_paper":"https://pith.science/paper/CTS3QQ66","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2404.00146&json=true","fetch_graph":"https://pith.science/api/pith-number/CTS3QQ66UVWKZBVP2UU7QBHDUE/graph.json","fetch_events":"https://pith.science/api/pith-number/CTS3QQ66UVWKZBVP2UU7QBHDUE/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/CTS3QQ66UVWKZBVP2UU7QBHDUE/action/timestamp_anchor","attest_storage":"https://pith.science/pith/CTS3QQ66UVWKZBVP2UU7QBHDUE/action/storage_attestation","attest_author":"https://pith.science/pith/CTS3QQ66UVWKZBVP2UU7QBHDUE/action/author_attestation","sign_citation":"https://pith.science/pith/CTS3QQ66UVWKZBVP2UU7QBHDUE/action/citation_signature","submit_replication":"https://pith.science/pith/CTS3QQ66UVWKZBVP2UU7QBHDUE/action/replication_record"}},"created_at":"2026-07-05T10:53:44.451020+00:00","updated_at":"2026-07-05T10:53:44.451020+00:00"}