{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:TFBQ3KXX2QFNK5IEHPRRSBHOSH","short_pith_number":"pith:TFBQ3KXX","schema_version":"1.0","canonical_sha256":"99430daaf7d40ad575043be31904ee91da533f898b636c5517e6ae4b73802e82","source":{"kind":"arxiv","id":"1502.03805","version":1},"attestation_state":"computed","paper":{"title":"eOMP: Finding Sparser Representation by Recursively Orthonormalizing the Remaining Atoms","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IT","math.IT"],"primary_cat":"cs.NA","authors_text":"Yao Wang, Yuanyi Xue","submitted_at":"2015-02-12T20:50:06Z","abstract_excerpt":"Greedy algorithms for minimizing L0-norm of sparse decomposition have profound application impact on many signal processing problems. In the sparse coding setup, given the observations $\\mathrm{y}$ and the redundant dictionary $\\mathbf{\\Phi}$, one would seek the most sparse coefficient (signal) $\\mathrm{x}$ with a constraint on approximation fidelity. In this work, we propose a greedy algorithm based on the classic orthogonal matching pursuit (OMP) with improved sparsity on $\\mathrm{x}$ and better recovery rate, which we name as eOMP. The key ingredient of the eOMP is recursively performing on"},"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":"1502.03805","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NA","submitted_at":"2015-02-12T20:50:06Z","cross_cats_sorted":["cs.IT","math.IT"],"title_canon_sha256":"c782d384f273c4212fba02613fd001231e7fe416df42b8220e20d693311cde6f","abstract_canon_sha256":"ebc4e73e6d87091dda42247e919a764e3ce2e901c9b3c83a6a6f302069a3c36a"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:27:08.797428Z","signature_b64":"5EXjA5WJlRQu3NZJyyJGCyxJbg/KH/tS+EIiAgWPPBEMusatzrQQrAXeVqLByaJSNZSdPMORyET6n34z6LD5AQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"99430daaf7d40ad575043be31904ee91da533f898b636c5517e6ae4b73802e82","last_reissued_at":"2026-05-18T02:27:08.796609Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:27:08.796609Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"eOMP: Finding Sparser Representation by Recursively Orthonormalizing the Remaining Atoms","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IT","math.IT"],"primary_cat":"cs.NA","authors_text":"Yao Wang, Yuanyi Xue","submitted_at":"2015-02-12T20:50:06Z","abstract_excerpt":"Greedy algorithms for minimizing L0-norm of sparse decomposition have profound application impact on many signal processing problems. In the sparse coding setup, given the observations $\\mathrm{y}$ and the redundant dictionary $\\mathbf{\\Phi}$, one would seek the most sparse coefficient (signal) $\\mathrm{x}$ with a constraint on approximation fidelity. In this work, we propose a greedy algorithm based on the classic orthogonal matching pursuit (OMP) with improved sparsity on $\\mathrm{x}$ and better recovery rate, which we name as eOMP. The key ingredient of the eOMP is recursively performing on"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1502.03805","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":"1502.03805","created_at":"2026-05-18T02:27:08.796724+00:00"},{"alias_kind":"arxiv_version","alias_value":"1502.03805v1","created_at":"2026-05-18T02:27:08.796724+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1502.03805","created_at":"2026-05-18T02:27:08.796724+00:00"},{"alias_kind":"pith_short_12","alias_value":"TFBQ3KXX2QFN","created_at":"2026-05-18T12:29:42.218222+00:00"},{"alias_kind":"pith_short_16","alias_value":"TFBQ3KXX2QFNK5IE","created_at":"2026-05-18T12:29:42.218222+00:00"},{"alias_kind":"pith_short_8","alias_value":"TFBQ3KXX","created_at":"2026-05-18T12:29:42.218222+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/TFBQ3KXX2QFNK5IEHPRRSBHOSH","json":"https://pith.science/pith/TFBQ3KXX2QFNK5IEHPRRSBHOSH.json","graph_json":"https://pith.science/api/pith-number/TFBQ3KXX2QFNK5IEHPRRSBHOSH/graph.json","events_json":"https://pith.science/api/pith-number/TFBQ3KXX2QFNK5IEHPRRSBHOSH/events.json","paper":"https://pith.science/paper/TFBQ3KXX"},"agent_actions":{"view_html":"https://pith.science/pith/TFBQ3KXX2QFNK5IEHPRRSBHOSH","download_json":"https://pith.science/pith/TFBQ3KXX2QFNK5IEHPRRSBHOSH.json","view_paper":"https://pith.science/paper/TFBQ3KXX","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1502.03805&json=true","fetch_graph":"https://pith.science/api/pith-number/TFBQ3KXX2QFNK5IEHPRRSBHOSH/graph.json","fetch_events":"https://pith.science/api/pith-number/TFBQ3KXX2QFNK5IEHPRRSBHOSH/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/TFBQ3KXX2QFNK5IEHPRRSBHOSH/action/timestamp_anchor","attest_storage":"https://pith.science/pith/TFBQ3KXX2QFNK5IEHPRRSBHOSH/action/storage_attestation","attest_author":"https://pith.science/pith/TFBQ3KXX2QFNK5IEHPRRSBHOSH/action/author_attestation","sign_citation":"https://pith.science/pith/TFBQ3KXX2QFNK5IEHPRRSBHOSH/action/citation_signature","submit_replication":"https://pith.science/pith/TFBQ3KXX2QFNK5IEHPRRSBHOSH/action/replication_record"}},"created_at":"2026-05-18T02:27:08.796724+00:00","updated_at":"2026-05-18T02:27:08.796724+00:00"}