{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2012:QDCF4SPWQVVKZLA2VIU6NUJYPI","short_pith_number":"pith:QDCF4SPW","schema_version":"1.0","canonical_sha256":"80c45e49f6856aacac1aaa29e6d1387a34658e53528055a8aa4b45a4ce376397","source":{"kind":"arxiv","id":"1210.5626","version":2},"attestation_state":"computed","paper":{"title":"Compressed Sensing Signal Recovery via Forward-Backward Pursuit","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":"2012-10-20T14:21:17Z","abstract_excerpt":"Recovery of sparse signals from compressed measurements constitutes an l0 norm minimization problem, which is unpractical to solve. A number of sparse recovery approaches have appeared in the literature, including l1 minimization techniques, greedy pursuit algorithms, Bayesian methods and nonconvex optimization techniques among others. This manuscript introduces a novel two stage greedy approach, called the Forward-Backward Pursuit (FBP). FBP is an iterative approach where each iteration consists of consecutive forward and backward stages. The forward step first expands the support estimate by"},"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":"1210.5626","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2012-10-20T14:21:17Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"a5dc19279359031dcf49d21cd81841b26d073afa3d6c39440b00a909658ce5ed","abstract_canon_sha256":"88eee46105b89ca3667230db2a4504abddaab6f0644f207b4d380e1bdea527bf"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:15:06.393358Z","signature_b64":"p1yPOk/mZe2RjBCIw+cfWnZ002rNNdAufGToHx8ASDB+VvkLF0vy0ET66/7fCtzewe9GalG456m8l3OCnrqjBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"80c45e49f6856aacac1aaa29e6d1387a34658e53528055a8aa4b45a4ce376397","last_reissued_at":"2026-05-18T03:15:06.392525Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:15:06.392525Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Compressed Sensing Signal Recovery via Forward-Backward Pursuit","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":"2012-10-20T14:21:17Z","abstract_excerpt":"Recovery of sparse signals from compressed measurements constitutes an l0 norm minimization problem, which is unpractical to solve. A number of sparse recovery approaches have appeared in the literature, including l1 minimization techniques, greedy pursuit algorithms, Bayesian methods and nonconvex optimization techniques among others. This manuscript introduces a novel two stage greedy approach, called the Forward-Backward Pursuit (FBP). FBP is an iterative approach where each iteration consists of consecutive forward and backward stages. The forward step first expands the support estimate by"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1210.5626","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1210.5626","created_at":"2026-05-18T03:15:06.392647+00:00"},{"alias_kind":"arxiv_version","alias_value":"1210.5626v2","created_at":"2026-05-18T03:15:06.392647+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1210.5626","created_at":"2026-05-18T03:15:06.392647+00:00"},{"alias_kind":"pith_short_12","alias_value":"QDCF4SPWQVVK","created_at":"2026-05-18T12:27:18.751474+00:00"},{"alias_kind":"pith_short_16","alias_value":"QDCF4SPWQVVKZLA2","created_at":"2026-05-18T12:27:18.751474+00:00"},{"alias_kind":"pith_short_8","alias_value":"QDCF4SPW","created_at":"2026-05-18T12:27:18.751474+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/QDCF4SPWQVVKZLA2VIU6NUJYPI","json":"https://pith.science/pith/QDCF4SPWQVVKZLA2VIU6NUJYPI.json","graph_json":"https://pith.science/api/pith-number/QDCF4SPWQVVKZLA2VIU6NUJYPI/graph.json","events_json":"https://pith.science/api/pith-number/QDCF4SPWQVVKZLA2VIU6NUJYPI/events.json","paper":"https://pith.science/paper/QDCF4SPW"},"agent_actions":{"view_html":"https://pith.science/pith/QDCF4SPWQVVKZLA2VIU6NUJYPI","download_json":"https://pith.science/pith/QDCF4SPWQVVKZLA2VIU6NUJYPI.json","view_paper":"https://pith.science/paper/QDCF4SPW","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1210.5626&json=true","fetch_graph":"https://pith.science/api/pith-number/QDCF4SPWQVVKZLA2VIU6NUJYPI/graph.json","fetch_events":"https://pith.science/api/pith-number/QDCF4SPWQVVKZLA2VIU6NUJYPI/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/QDCF4SPWQVVKZLA2VIU6NUJYPI/action/timestamp_anchor","attest_storage":"https://pith.science/pith/QDCF4SPWQVVKZLA2VIU6NUJYPI/action/storage_attestation","attest_author":"https://pith.science/pith/QDCF4SPWQVVKZLA2VIU6NUJYPI/action/author_attestation","sign_citation":"https://pith.science/pith/QDCF4SPWQVVKZLA2VIU6NUJYPI/action/citation_signature","submit_replication":"https://pith.science/pith/QDCF4SPWQVVKZLA2VIU6NUJYPI/action/replication_record"}},"created_at":"2026-05-18T03:15:06.392647+00:00","updated_at":"2026-05-18T03:15:06.392647+00:00"}