{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2010:X2GKQJ2ROR76QQGHIX22ZESFUB","short_pith_number":"pith:X2GKQJ2R","schema_version":"1.0","canonical_sha256":"be8ca82751747fe840c745f5ac9245a06665e108391a2cf8a7b03bec6c556bde","source":{"kind":"arxiv","id":"1009.0396","version":3},"attestation_state":"computed","paper":{"title":"A* Orthogonal Matching Pursuit: Best-First Search for Compressed Sensing Signal Recovery","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Hakan Erdogan, Nazim Burak Karahanoglu","submitted_at":"2010-09-02T11:41:21Z","abstract_excerpt":"Compressed sensing is a developing field aiming at reconstruction of sparse signals acquired in reduced dimensions, which make the recovery process under-determined. The required solution is the one with minimum $\\ell_0$ norm due to sparsity, however it is not practical to solve the $\\ell_0$ minimization problem. Commonly used techniques include $\\ell_1$ minimization, such as Basis Pursuit (BP) and greedy pursuit algorithms such as Orthogonal Matching Pursuit (OMP) and Subspace Pursuit (SP). This manuscript proposes a novel semi-greedy recovery approach, namely A* Orthogonal Matching Pursuit ("},"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":"1009.0396","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2010-09-02T11:41:21Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"95b80b70ed32daf8bcceec2afa6ceb52613a4a4880d1630ba69eda6e228e71d7","abstract_canon_sha256":"bc229e8769ccac3e4a7a09097acfe603578981122e4aa2ab52f1198c5bfacb24"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:46:17.069730Z","signature_b64":"DEKBYnJHp5FfUGGh0EipRCbqEj662pX5uGo/DVb5vUoYZ6tasKZpXMA8ai0GM82VPFqMbx/gdDlaD9m5LncAAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"be8ca82751747fe840c745f5ac9245a06665e108391a2cf8a7b03bec6c556bde","last_reissued_at":"2026-05-18T03:46:17.068833Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:46:17.068833Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A* Orthogonal Matching Pursuit: Best-First Search for Compressed Sensing Signal Recovery","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Hakan Erdogan, Nazim Burak Karahanoglu","submitted_at":"2010-09-02T11:41:21Z","abstract_excerpt":"Compressed sensing is a developing field aiming at reconstruction of sparse signals acquired in reduced dimensions, which make the recovery process under-determined. The required solution is the one with minimum $\\ell_0$ norm due to sparsity, however it is not practical to solve the $\\ell_0$ minimization problem. Commonly used techniques include $\\ell_1$ minimization, such as Basis Pursuit (BP) and greedy pursuit algorithms such as Orthogonal Matching Pursuit (OMP) and Subspace Pursuit (SP). This manuscript proposes a novel semi-greedy recovery approach, namely A* Orthogonal Matching Pursuit ("},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1009.0396","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":""},"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":"1009.0396","created_at":"2026-05-18T03:46:17.068955+00:00"},{"alias_kind":"arxiv_version","alias_value":"1009.0396v3","created_at":"2026-05-18T03:46:17.068955+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1009.0396","created_at":"2026-05-18T03:46:17.068955+00:00"},{"alias_kind":"pith_short_12","alias_value":"X2GKQJ2ROR76","created_at":"2026-05-18T12:26:17.028572+00:00"},{"alias_kind":"pith_short_16","alias_value":"X2GKQJ2ROR76QQGH","created_at":"2026-05-18T12:26:17.028572+00:00"},{"alias_kind":"pith_short_8","alias_value":"X2GKQJ2R","created_at":"2026-05-18T12:26:17.028572+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/X2GKQJ2ROR76QQGHIX22ZESFUB","json":"https://pith.science/pith/X2GKQJ2ROR76QQGHIX22ZESFUB.json","graph_json":"https://pith.science/api/pith-number/X2GKQJ2ROR76QQGHIX22ZESFUB/graph.json","events_json":"https://pith.science/api/pith-number/X2GKQJ2ROR76QQGHIX22ZESFUB/events.json","paper":"https://pith.science/paper/X2GKQJ2R"},"agent_actions":{"view_html":"https://pith.science/pith/X2GKQJ2ROR76QQGHIX22ZESFUB","download_json":"https://pith.science/pith/X2GKQJ2ROR76QQGHIX22ZESFUB.json","view_paper":"https://pith.science/paper/X2GKQJ2R","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1009.0396&json=true","fetch_graph":"https://pith.science/api/pith-number/X2GKQJ2ROR76QQGHIX22ZESFUB/graph.json","fetch_events":"https://pith.science/api/pith-number/X2GKQJ2ROR76QQGHIX22ZESFUB/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/X2GKQJ2ROR76QQGHIX22ZESFUB/action/timestamp_anchor","attest_storage":"https://pith.science/pith/X2GKQJ2ROR76QQGHIX22ZESFUB/action/storage_attestation","attest_author":"https://pith.science/pith/X2GKQJ2ROR76QQGHIX22ZESFUB/action/author_attestation","sign_citation":"https://pith.science/pith/X2GKQJ2ROR76QQGHIX22ZESFUB/action/citation_signature","submit_replication":"https://pith.science/pith/X2GKQJ2ROR76QQGHIX22ZESFUB/action/replication_record"}},"created_at":"2026-05-18T03:46:17.068955+00:00","updated_at":"2026-05-18T03:46:17.068955+00:00"}