{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:N5DSJMJDXPDMYZ2H3QMEC7YHKW","short_pith_number":"pith:N5DSJMJD","schema_version":"1.0","canonical_sha256":"6f4724b123bbc6cc6747dc18417f075580d9c596e03b4c0f5e01063401458730","source":{"kind":"arxiv","id":"1409.5606","version":1},"attestation_state":"computed","paper":{"title":"Greedy Sparse Signal Recovery with Tree Pruning","license":"http://creativecommons.org/licenses/by/3.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Byonghyo Shim, Jaeseok Lee, Jun Won Choi, Suhyuk Kwon","submitted_at":"2014-09-19T11:29:12Z","abstract_excerpt":"Recently, greedy algorithm has received much attention as a cost-effective means to reconstruct the sparse signals from compressed measurements. Much of previous work has focused on the investigation of a single candidate to identify the support (index set of nonzero elements) of the sparse signals. Well-known drawback of the greedy approach is that the chosen candidate is often not the optimal solution due to the myopic decision in each iteration. In this paper, we propose a greedy sparse recovery algorithm investigating multiple promising candidates via the tree search. Two key ingredients o"},"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":"1409.5606","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/3.0/","primary_cat":"cs.IT","submitted_at":"2014-09-19T11:29:12Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"5c29cacc8f79003c0940ccc04b47781bcc03180739cd533cb655fb0d3586cd2e","abstract_canon_sha256":"61571bc2ca01e8144e53b564c083e7cacf250462afe7eb43989c9d898877b1c6"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:42:26.846831Z","signature_b64":"hRdZBcB1wVUEtwk7Em/n1D+P8wmlK27YS+B399uvW/xwJoSxve8f3Mg0YbIF9bOhSUrBa09+/IKN0u1t8EGYCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6f4724b123bbc6cc6747dc18417f075580d9c596e03b4c0f5e01063401458730","last_reissued_at":"2026-05-18T02:42:26.846154Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:42:26.846154Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Greedy Sparse Signal Recovery with Tree Pruning","license":"http://creativecommons.org/licenses/by/3.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Byonghyo Shim, Jaeseok Lee, Jun Won Choi, Suhyuk Kwon","submitted_at":"2014-09-19T11:29:12Z","abstract_excerpt":"Recently, greedy algorithm has received much attention as a cost-effective means to reconstruct the sparse signals from compressed measurements. Much of previous work has focused on the investigation of a single candidate to identify the support (index set of nonzero elements) of the sparse signals. Well-known drawback of the greedy approach is that the chosen candidate is often not the optimal solution due to the myopic decision in each iteration. In this paper, we propose a greedy sparse recovery algorithm investigating multiple promising candidates via the tree search. Two key ingredients o"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1409.5606","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1409.5606","created_at":"2026-05-18T02:42:26.846252+00:00"},{"alias_kind":"arxiv_version","alias_value":"1409.5606v1","created_at":"2026-05-18T02:42:26.846252+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1409.5606","created_at":"2026-05-18T02:42:26.846252+00:00"},{"alias_kind":"pith_short_12","alias_value":"N5DSJMJDXPDM","created_at":"2026-05-18T12:28:41.024544+00:00"},{"alias_kind":"pith_short_16","alias_value":"N5DSJMJDXPDMYZ2H","created_at":"2026-05-18T12:28:41.024544+00:00"},{"alias_kind":"pith_short_8","alias_value":"N5DSJMJD","created_at":"2026-05-18T12:28:41.024544+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/N5DSJMJDXPDMYZ2H3QMEC7YHKW","json":"https://pith.science/pith/N5DSJMJDXPDMYZ2H3QMEC7YHKW.json","graph_json":"https://pith.science/api/pith-number/N5DSJMJDXPDMYZ2H3QMEC7YHKW/graph.json","events_json":"https://pith.science/api/pith-number/N5DSJMJDXPDMYZ2H3QMEC7YHKW/events.json","paper":"https://pith.science/paper/N5DSJMJD"},"agent_actions":{"view_html":"https://pith.science/pith/N5DSJMJDXPDMYZ2H3QMEC7YHKW","download_json":"https://pith.science/pith/N5DSJMJDXPDMYZ2H3QMEC7YHKW.json","view_paper":"https://pith.science/paper/N5DSJMJD","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1409.5606&json=true","fetch_graph":"https://pith.science/api/pith-number/N5DSJMJDXPDMYZ2H3QMEC7YHKW/graph.json","fetch_events":"https://pith.science/api/pith-number/N5DSJMJDXPDMYZ2H3QMEC7YHKW/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/N5DSJMJDXPDMYZ2H3QMEC7YHKW/action/timestamp_anchor","attest_storage":"https://pith.science/pith/N5DSJMJDXPDMYZ2H3QMEC7YHKW/action/storage_attestation","attest_author":"https://pith.science/pith/N5DSJMJDXPDMYZ2H3QMEC7YHKW/action/author_attestation","sign_citation":"https://pith.science/pith/N5DSJMJDXPDMYZ2H3QMEC7YHKW/action/citation_signature","submit_replication":"https://pith.science/pith/N5DSJMJDXPDMYZ2H3QMEC7YHKW/action/replication_record"}},"created_at":"2026-05-18T02:42:26.846252+00:00","updated_at":"2026-05-18T02:42:26.846252+00:00"}