{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:FQBOX6F4HJO7NM2KKKRQN2INCW","short_pith_number":"pith:FQBOX6F4","schema_version":"1.0","canonical_sha256":"2c02ebf8bc3a5df6b34a52a306e90d15b4d6d1fe35758124d724cac0d2fabc73","source":{"kind":"arxiv","id":"1307.1770","version":3},"attestation_state":"computed","paper":{"title":"Improving A*OMP: Theoretical and Empirical Analyses With a Novel Dynamic Cost Model","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":"2013-07-06T10:35:26Z","abstract_excerpt":"Best-first search has been recently utilized for compressed sensing (CS) by the A* orthogonal matching pursuit (A*OMP) algorithm. In this work, we concentrate on theoretical and empirical analyses of A*OMP. We present a restricted isometry property (RIP) based general condition for exact recovery of sparse signals via A*OMP. In addition, we develop online guarantees which promise improved recovery performance with the residue-based termination instead of the sparsity-based one. We demonstrate the recovery capabilities of A*OMP with extensive recovery simulations using the adaptive-multiplicati"},"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":"1307.1770","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-07-06T10:35:26Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"51e0479a50fe7f46e42c94b4282118c2a8116510b2045b4d7a6cbe44c165d5e0","abstract_canon_sha256":"6dc52c02115cc2f80e8e634bff7772e590121d60c239a9ac289f8c2648ea6acd"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:56:51.732456Z","signature_b64":"jE+Ou4CjenD95OESMsz6kdS3+kHT5X9f0VTn0/saAdS7YBLos++z3QUAq0lGEMh8MNgFknKX911I08XmLanJCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2c02ebf8bc3a5df6b34a52a306e90d15b4d6d1fe35758124d724cac0d2fabc73","last_reissued_at":"2026-05-18T00:56:51.731901Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:56:51.731901Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Improving A*OMP: Theoretical and Empirical Analyses With a Novel Dynamic Cost Model","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":"2013-07-06T10:35:26Z","abstract_excerpt":"Best-first search has been recently utilized for compressed sensing (CS) by the A* orthogonal matching pursuit (A*OMP) algorithm. In this work, we concentrate on theoretical and empirical analyses of A*OMP. We present a restricted isometry property (RIP) based general condition for exact recovery of sparse signals via A*OMP. In addition, we develop online guarantees which promise improved recovery performance with the residue-based termination instead of the sparsity-based one. We demonstrate the recovery capabilities of A*OMP with extensive recovery simulations using the adaptive-multiplicati"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1307.1770","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":"1307.1770","created_at":"2026-05-18T00:56:51.731985+00:00"},{"alias_kind":"arxiv_version","alias_value":"1307.1770v3","created_at":"2026-05-18T00:56:51.731985+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1307.1770","created_at":"2026-05-18T00:56:51.731985+00:00"},{"alias_kind":"pith_short_12","alias_value":"FQBOX6F4HJO7","created_at":"2026-05-18T12:27:45.050594+00:00"},{"alias_kind":"pith_short_16","alias_value":"FQBOX6F4HJO7NM2K","created_at":"2026-05-18T12:27:45.050594+00:00"},{"alias_kind":"pith_short_8","alias_value":"FQBOX6F4","created_at":"2026-05-18T12:27:45.050594+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/FQBOX6F4HJO7NM2KKKRQN2INCW","json":"https://pith.science/pith/FQBOX6F4HJO7NM2KKKRQN2INCW.json","graph_json":"https://pith.science/api/pith-number/FQBOX6F4HJO7NM2KKKRQN2INCW/graph.json","events_json":"https://pith.science/api/pith-number/FQBOX6F4HJO7NM2KKKRQN2INCW/events.json","paper":"https://pith.science/paper/FQBOX6F4"},"agent_actions":{"view_html":"https://pith.science/pith/FQBOX6F4HJO7NM2KKKRQN2INCW","download_json":"https://pith.science/pith/FQBOX6F4HJO7NM2KKKRQN2INCW.json","view_paper":"https://pith.science/paper/FQBOX6F4","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1307.1770&json=true","fetch_graph":"https://pith.science/api/pith-number/FQBOX6F4HJO7NM2KKKRQN2INCW/graph.json","fetch_events":"https://pith.science/api/pith-number/FQBOX6F4HJO7NM2KKKRQN2INCW/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/FQBOX6F4HJO7NM2KKKRQN2INCW/action/timestamp_anchor","attest_storage":"https://pith.science/pith/FQBOX6F4HJO7NM2KKKRQN2INCW/action/storage_attestation","attest_author":"https://pith.science/pith/FQBOX6F4HJO7NM2KKKRQN2INCW/action/author_attestation","sign_citation":"https://pith.science/pith/FQBOX6F4HJO7NM2KKKRQN2INCW/action/citation_signature","submit_replication":"https://pith.science/pith/FQBOX6F4HJO7NM2KKKRQN2INCW/action/replication_record"}},"created_at":"2026-05-18T00:56:51.731985+00:00","updated_at":"2026-05-18T00:56:51.731985+00:00"}