{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:U2ON6EUHKDFGZHP4EDJOJRKT35","short_pith_number":"pith:U2ON6EUH","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"},"canonical_sha256":"a69cdf128750ca6c9dfc20d2e4c553df6abb6d621191d5edd689fb9a450431f6","source":{"kind":"arxiv","id":"1509.03979","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1509.03979","created_at":"2026-05-18T01:18:57Z"},{"alias_kind":"arxiv_version","alias_value":"1509.03979v2","created_at":"2026-05-18T01:18:57Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1509.03979","created_at":"2026-05-18T01:18:57Z"},{"alias_kind":"pith_short_12","alias_value":"U2ON6EUHKDFG","created_at":"2026-05-18T12:29:44Z"},{"alias_kind":"pith_short_16","alias_value":"U2ON6EUHKDFGZHP4","created_at":"2026-05-18T12:29:44Z"},{"alias_kind":"pith_short_8","alias_value":"U2ON6EUH","created_at":"2026-05-18T12:29:44Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:U2ON6EUHKDFGZHP4EDJOJRKT35","target":"record","payload":{"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"},"canonical_sha256":"a69cdf128750ca6c9dfc20d2e4c553df6abb6d621191d5edd689fb9a450431f6","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"},"source_kind":"arxiv","source_id":"1509.03979","source_version":2,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T01:18:57Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Fwhkj4aq0W876fTiiJOO1HRQLFgGDqtpDa63lZo41+/QocYvMuACh0K7W6P35vK91HKTvyqj73a93jxXk/B5CQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-26T14:44:38.559228Z"},"content_sha256":"770a486130f4bdcf7399ec85fd29fe544bd134281936cf18b165ca728a1f9f80","schema_version":"1.0","event_id":"sha256:770a486130f4bdcf7399ec85fd29fe544bd134281936cf18b165ca728a1f9f80"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:U2ON6EUHKDFGZHP4EDJOJRKT35","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T01:18:57Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"BTcUQTNWEGmfxLZKkvSAIvEQn3vio6s/F+VxvEtQcAtrCctYbxavk2XwZucqjFdYjAjXC/MzyOxF4aku7LlPCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-26T14:44:38.559584Z"},"content_sha256":"1a2325d775758c4fa94dbf56d852a0e445a69e9f2759232a5f59011e389417c2","schema_version":"1.0","event_id":"sha256:1a2325d775758c4fa94dbf56d852a0e445a69e9f2759232a5f59011e389417c2"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/U2ON6EUHKDFGZHP4EDJOJRKT35/bundle.json","state_url":"https://pith.science/pith/U2ON6EUHKDFGZHP4EDJOJRKT35/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/U2ON6EUHKDFGZHP4EDJOJRKT35/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-06-26T14:44:38Z","links":{"resolver":"https://pith.science/pith/U2ON6EUHKDFGZHP4EDJOJRKT35","bundle":"https://pith.science/pith/U2ON6EUHKDFGZHP4EDJOJRKT35/bundle.json","state":"https://pith.science/pith/U2ON6EUHKDFGZHP4EDJOJRKT35/state.json","well_known_bundle":"https://pith.science/.well-known/pith/U2ON6EUHKDFGZHP4EDJOJRKT35/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:U2ON6EUHKDFGZHP4EDJOJRKT35","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"67abe9647e0967ad15f152b2edbaf35b88b028c408a3390e9bdf8cc0937a07c5","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-09-14T07:55:51Z","title_canon_sha256":"1755cac18b02c80f2fa28f2f9428430b60acf4114d4c471eea29c0bf1ebefd1e"},"schema_version":"1.0","source":{"id":"1509.03979","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1509.03979","created_at":"2026-05-18T01:18:57Z"},{"alias_kind":"arxiv_version","alias_value":"1509.03979v2","created_at":"2026-05-18T01:18:57Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1509.03979","created_at":"2026-05-18T01:18:57Z"},{"alias_kind":"pith_short_12","alias_value":"U2ON6EUHKDFG","created_at":"2026-05-18T12:29:44Z"},{"alias_kind":"pith_short_16","alias_value":"U2ON6EUHKDFGZHP4","created_at":"2026-05-18T12:29:44Z"},{"alias_kind":"pith_short_8","alias_value":"U2ON6EUH","created_at":"2026-05-18T12:29:44Z"}],"graph_snapshots":[{"event_id":"sha256:1a2325d775758c4fa94dbf56d852a0e445a69e9f2759232a5f59011e389417c2","target":"graph","created_at":"2026-05-18T01:18:57Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"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 ","authors_text":"Chun-Shien Lu, Soo-Chang Pei, Sung-Hsien Hsieh","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-09-14T07:55:51Z","title":"Fast Greedy Approaches for Compressive Sensing of Large-Scale Signals"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1509.03979","kind":"arxiv","version":2},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:770a486130f4bdcf7399ec85fd29fe544bd134281936cf18b165ca728a1f9f80","target":"record","created_at":"2026-05-18T01:18:57Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"67abe9647e0967ad15f152b2edbaf35b88b028c408a3390e9bdf8cc0937a07c5","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-09-14T07:55:51Z","title_canon_sha256":"1755cac18b02c80f2fa28f2f9428430b60acf4114d4c471eea29c0bf1ebefd1e"},"schema_version":"1.0","source":{"id":"1509.03979","kind":"arxiv","version":2}},"canonical_sha256":"a69cdf128750ca6c9dfc20d2e4c553df6abb6d621191d5edd689fb9a450431f6","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"a69cdf128750ca6c9dfc20d2e4c553df6abb6d621191d5edd689fb9a450431f6","first_computed_at":"2026-05-18T01:18:57.265116Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:18:57.265116Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"VUQmNZMOigoo/0cCDHy1k03XqXnhb8Zs4JUpr7q5w0CTIintDRDZMODhDbcoilplQW6c0bwnDkX9ONkgktisAQ==","signature_status":"signed_v1","signed_at":"2026-05-18T01:18:57.265568Z","signed_message":"canonical_sha256_bytes"},"source_id":"1509.03979","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:770a486130f4bdcf7399ec85fd29fe544bd134281936cf18b165ca728a1f9f80","sha256:1a2325d775758c4fa94dbf56d852a0e445a69e9f2759232a5f59011e389417c2"],"state_sha256":"46539e1d1c41aee4245d51fc5e14d3609d9ab1b3638de39a96c063e6e6921299"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Vr69xGgM2Wz0i7iR69amM2WeN67V8dsIe+xERdsrsF2zrGcjc82DrtImrTHmEfZ3TpeG2H4bo5MM/GUplpMxBQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-26T14:44:38.561588Z","bundle_sha256":"1127d70605c23f33711523637db33e68ec15f6eb8caae4ba4f9167261d916d50"}}