{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:U2ON6EUHKDFGZHP4EDJOJRKT35","short_pith_number":"pith:U2ON6EUH","schema_version":"1.0","canonical_sha256":"a69cdf128750ca6c9dfc20d2e4c553df6abb6d621191d5edd689fb9a450431f6","source":{"kind":"arxiv","id":"1509.03979","version":2},"attestation_state":"computed","paper":{"title":"Fast Greedy Approaches for Compressive Sensing of Large-Scale Signals","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Chun-Shien Lu, Soo-Chang Pei, Sung-Hsien Hsieh","submitted_at":"2015-09-14T07:55:51Z","abstract_excerpt":"Cost-efficient compressive sensing is challenging when facing large-scale data, {\\em i.e.}, data with large sizes. Conventional compressive sensing methods for large-scale data will suffer from low computational efficiency and massive memory storage. In this paper, we revisit well-known solvers called greedy algorithms, including Orthogonal Matching Pursuit (OMP), Subspace Pursuit (SP), Orthogonal Matching Pursuit with Replacement (OMPR). Generally, these approaches are conducted by iteratively executing two main steps: 1) support detection and 2) solving least square problem.\n  To reduce the "},"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":"1509.03979","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-09-14T07:55:51Z","cross_cats_sorted":[],"title_canon_sha256":"1755cac18b02c80f2fa28f2f9428430b60acf4114d4c471eea29c0bf1ebefd1e","abstract_canon_sha256":"67abe9647e0967ad15f152b2edbaf35b88b028c408a3390e9bdf8cc0937a07c5"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:18:57.265568Z","signature_b64":"VUQmNZMOigoo/0cCDHy1k03XqXnhb8Zs4JUpr7q5w0CTIintDRDZMODhDbcoilplQW6c0bwnDkX9ONkgktisAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a69cdf128750ca6c9dfc20d2e4c553df6abb6d621191d5edd689fb9a450431f6","last_reissued_at":"2026-05-18T01:18:57.265116Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:18:57.265116Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Fast Greedy Approaches for Compressive Sensing of Large-Scale Signals","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Chun-Shien Lu, Soo-Chang Pei, Sung-Hsien Hsieh","submitted_at":"2015-09-14T07:55:51Z","abstract_excerpt":"Cost-efficient compressive sensing is challenging when facing large-scale data, {\\em i.e.}, data with large sizes. Conventional compressive sensing methods for large-scale data will suffer from low computational efficiency and massive memory storage. In this paper, we revisit well-known solvers called greedy algorithms, including Orthogonal Matching Pursuit (OMP), Subspace Pursuit (SP), Orthogonal Matching Pursuit with Replacement (OMPR). Generally, these approaches are conducted by iteratively executing two main steps: 1) support detection and 2) solving least square problem.\n  To reduce the "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1509.03979","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":"1509.03979","created_at":"2026-05-18T01:18:57.265196+00:00"},{"alias_kind":"arxiv_version","alias_value":"1509.03979v2","created_at":"2026-05-18T01:18:57.265196+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1509.03979","created_at":"2026-05-18T01:18:57.265196+00:00"},{"alias_kind":"pith_short_12","alias_value":"U2ON6EUHKDFG","created_at":"2026-05-18T12:29:44.643036+00:00"},{"alias_kind":"pith_short_16","alias_value":"U2ON6EUHKDFGZHP4","created_at":"2026-05-18T12:29:44.643036+00:00"},{"alias_kind":"pith_short_8","alias_value":"U2ON6EUH","created_at":"2026-05-18T12:29:44.643036+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/U2ON6EUHKDFGZHP4EDJOJRKT35","json":"https://pith.science/pith/U2ON6EUHKDFGZHP4EDJOJRKT35.json","graph_json":"https://pith.science/api/pith-number/U2ON6EUHKDFGZHP4EDJOJRKT35/graph.json","events_json":"https://pith.science/api/pith-number/U2ON6EUHKDFGZHP4EDJOJRKT35/events.json","paper":"https://pith.science/paper/U2ON6EUH"},"agent_actions":{"view_html":"https://pith.science/pith/U2ON6EUHKDFGZHP4EDJOJRKT35","download_json":"https://pith.science/pith/U2ON6EUHKDFGZHP4EDJOJRKT35.json","view_paper":"https://pith.science/paper/U2ON6EUH","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1509.03979&json=true","fetch_graph":"https://pith.science/api/pith-number/U2ON6EUHKDFGZHP4EDJOJRKT35/graph.json","fetch_events":"https://pith.science/api/pith-number/U2ON6EUHKDFGZHP4EDJOJRKT35/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/U2ON6EUHKDFGZHP4EDJOJRKT35/action/timestamp_anchor","attest_storage":"https://pith.science/pith/U2ON6EUHKDFGZHP4EDJOJRKT35/action/storage_attestation","attest_author":"https://pith.science/pith/U2ON6EUHKDFGZHP4EDJOJRKT35/action/author_attestation","sign_citation":"https://pith.science/pith/U2ON6EUHKDFGZHP4EDJOJRKT35/action/citation_signature","submit_replication":"https://pith.science/pith/U2ON6EUHKDFGZHP4EDJOJRKT35/action/replication_record"}},"created_at":"2026-05-18T01:18:57.265196+00:00","updated_at":"2026-05-18T01:18:57.265196+00:00"}