{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:OM2N7RCPNFMDBWSXYRCETGYWKZ","short_pith_number":"pith:OM2N7RCP","canonical_record":{"source":{"id":"1701.02922","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-01-11T10:50:54Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"8da67328f7f0544ac1fc7dc631908ec43cf26a07ec3b47ce27559c57e4941f10","abstract_canon_sha256":"0842893292b0e36e7a665e8d77f9001d11d27ca796e3dc3ee4ab6c74326b3cf7"},"schema_version":"1.0"},"canonical_sha256":"7334dfc44f695830da57c444499b16564a26cc5ba049bcfe81dc4d0fa41310b5","source":{"kind":"arxiv","id":"1701.02922","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1701.02922","created_at":"2026-05-18T00:52:59Z"},{"alias_kind":"arxiv_version","alias_value":"1701.02922v1","created_at":"2026-05-18T00:52:59Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1701.02922","created_at":"2026-05-18T00:52:59Z"},{"alias_kind":"pith_short_12","alias_value":"OM2N7RCPNFMD","created_at":"2026-05-18T12:31:34Z"},{"alias_kind":"pith_short_16","alias_value":"OM2N7RCPNFMDBWSX","created_at":"2026-05-18T12:31:34Z"},{"alias_kind":"pith_short_8","alias_value":"OM2N7RCP","created_at":"2026-05-18T12:31:34Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:OM2N7RCPNFMDBWSXYRCETGYWKZ","target":"record","payload":{"canonical_record":{"source":{"id":"1701.02922","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-01-11T10:50:54Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"8da67328f7f0544ac1fc7dc631908ec43cf26a07ec3b47ce27559c57e4941f10","abstract_canon_sha256":"0842893292b0e36e7a665e8d77f9001d11d27ca796e3dc3ee4ab6c74326b3cf7"},"schema_version":"1.0"},"canonical_sha256":"7334dfc44f695830da57c444499b16564a26cc5ba049bcfe81dc4d0fa41310b5","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:52:59.817568Z","signature_b64":"Xq5JchhbcaL4tPrpE/mxPOVgDMiIcLCO/jv7YphP0k/UpPrxeTUmvpVl/lBUz3DUohDOJiYPoB55TTGO0z1hDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"7334dfc44f695830da57c444499b16564a26cc5ba049bcfe81dc4d0fa41310b5","last_reissued_at":"2026-05-18T00:52:59.817180Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:52:59.817180Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1701.02922","source_version":1,"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-18T00:52:59Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Tpf1GLfPguc6AlPtDUEIOrs87LHjJ0RpEULVmqFaWgfGzbJffDBpPth+368Dcx4M66o/FlpLSfoe7S5JysOBCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-04T20:25:53.441601Z"},"content_sha256":"8965e97e2798f0ece50a21607f835a7ea400b8fa2056f039178aa6fcab92e0d7","schema_version":"1.0","event_id":"sha256:8965e97e2798f0ece50a21607f835a7ea400b8fa2056f039178aa6fcab92e0d7"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:OM2N7RCPNFMDBWSXYRCETGYWKZ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Greedy Sparse Signal Reconstruction Using Matching Pursuit Based on Hope-tree","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Chengqing Li, Hongqing Zeng, Jun Fang, Zhetao Li","submitted_at":"2017-01-11T10:50:54Z","abstract_excerpt":"The reconstruction of sparse signals requires the solution of an $\\ell_0$-norm minimization problem in Compressed Sensing. Previous research has focused on the investigation of a single candidate to identify the support (index of nonzero elements) of a sparse signal. To ensure that the optimal candidate can be obtained in each iteration, we propose here an iterative greedy reconstruction algorithm (GSRA). First, the intersection of the support sets estimated by the Orthogonal Matching Pursuit (OMP) and Subspace Pursuit (SP) is set as the initial support set. Then, a hope-tree is built to expan"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1701.02922","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"},"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-18T00:52:59Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"d4ksNakuZxsC2JoDYUPpD6rTHgT5k9n08lQhR+bIjvZb3XUHz8a9OCfpYb89Yc86JM/HGYOEF/fE4WgeUNk2Ag==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-04T20:25:53.441941Z"},"content_sha256":"f9f3aa442230417cffabbde6ba29358796ae8a87e0ac75d5e176094850bdfea8","schema_version":"1.0","event_id":"sha256:f9f3aa442230417cffabbde6ba29358796ae8a87e0ac75d5e176094850bdfea8"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/OM2N7RCPNFMDBWSXYRCETGYWKZ/bundle.json","state_url":"https://pith.science/pith/OM2N7RCPNFMDBWSXYRCETGYWKZ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/OM2N7RCPNFMDBWSXYRCETGYWKZ/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-04T20:25:53Z","links":{"resolver":"https://pith.science/pith/OM2N7RCPNFMDBWSXYRCETGYWKZ","bundle":"https://pith.science/pith/OM2N7RCPNFMDBWSXYRCETGYWKZ/bundle.json","state":"https://pith.science/pith/OM2N7RCPNFMDBWSXYRCETGYWKZ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/OM2N7RCPNFMDBWSXYRCETGYWKZ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:OM2N7RCPNFMDBWSXYRCETGYWKZ","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":"0842893292b0e36e7a665e8d77f9001d11d27ca796e3dc3ee4ab6c74326b3cf7","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-01-11T10:50:54Z","title_canon_sha256":"8da67328f7f0544ac1fc7dc631908ec43cf26a07ec3b47ce27559c57e4941f10"},"schema_version":"1.0","source":{"id":"1701.02922","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1701.02922","created_at":"2026-05-18T00:52:59Z"},{"alias_kind":"arxiv_version","alias_value":"1701.02922v1","created_at":"2026-05-18T00:52:59Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1701.02922","created_at":"2026-05-18T00:52:59Z"},{"alias_kind":"pith_short_12","alias_value":"OM2N7RCPNFMD","created_at":"2026-05-18T12:31:34Z"},{"alias_kind":"pith_short_16","alias_value":"OM2N7RCPNFMDBWSX","created_at":"2026-05-18T12:31:34Z"},{"alias_kind":"pith_short_8","alias_value":"OM2N7RCP","created_at":"2026-05-18T12:31:34Z"}],"graph_snapshots":[{"event_id":"sha256:f9f3aa442230417cffabbde6ba29358796ae8a87e0ac75d5e176094850bdfea8","target":"graph","created_at":"2026-05-18T00:52:59Z","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":"The reconstruction of sparse signals requires the solution of an $\\ell_0$-norm minimization problem in Compressed Sensing. Previous research has focused on the investigation of a single candidate to identify the support (index of nonzero elements) of a sparse signal. To ensure that the optimal candidate can be obtained in each iteration, we propose here an iterative greedy reconstruction algorithm (GSRA). First, the intersection of the support sets estimated by the Orthogonal Matching Pursuit (OMP) and Subspace Pursuit (SP) is set as the initial support set. Then, a hope-tree is built to expan","authors_text":"Chengqing Li, Hongqing Zeng, Jun Fang, Zhetao Li","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-01-11T10:50:54Z","title":"Greedy Sparse Signal Reconstruction Using Matching Pursuit Based on Hope-tree"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1701.02922","kind":"arxiv","version":1},"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:8965e97e2798f0ece50a21607f835a7ea400b8fa2056f039178aa6fcab92e0d7","target":"record","created_at":"2026-05-18T00:52:59Z","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":"0842893292b0e36e7a665e8d77f9001d11d27ca796e3dc3ee4ab6c74326b3cf7","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-01-11T10:50:54Z","title_canon_sha256":"8da67328f7f0544ac1fc7dc631908ec43cf26a07ec3b47ce27559c57e4941f10"},"schema_version":"1.0","source":{"id":"1701.02922","kind":"arxiv","version":1}},"canonical_sha256":"7334dfc44f695830da57c444499b16564a26cc5ba049bcfe81dc4d0fa41310b5","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"7334dfc44f695830da57c444499b16564a26cc5ba049bcfe81dc4d0fa41310b5","first_computed_at":"2026-05-18T00:52:59.817180Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:52:59.817180Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Xq5JchhbcaL4tPrpE/mxPOVgDMiIcLCO/jv7YphP0k/UpPrxeTUmvpVl/lBUz3DUohDOJiYPoB55TTGO0z1hDA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:52:59.817568Z","signed_message":"canonical_sha256_bytes"},"source_id":"1701.02922","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:8965e97e2798f0ece50a21607f835a7ea400b8fa2056f039178aa6fcab92e0d7","sha256:f9f3aa442230417cffabbde6ba29358796ae8a87e0ac75d5e176094850bdfea8"],"state_sha256":"24946c52900f3366073dbde022f2153f89ac301ef53a9233682d362763b9f960"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"wRtZMd2NO9Mn5eR5l+d0a0eU1S8g5VXNYrulbbGDWr0ywmvlVjSVIDOhUGnokdrmHoWTwMg0HTT7jqNER/9zCA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-04T20:25:53.444164Z","bundle_sha256":"1f5946e72a2d10c2eb6433ce60822807322ded7d179844124443d5c492fcecfa"}}