{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:U6E3QS44KLLDJPQYUWKAIMWVCV","short_pith_number":"pith:U6E3QS44","canonical_record":{"source":{"id":"1206.4208","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.OT","submitted_at":"2012-06-19T13:50:41Z","cross_cats_sorted":[],"title_canon_sha256":"4607546745c3070dd4bcc172859e1944844a4eb9a4f31d7172e777a4ee5db912","abstract_canon_sha256":"d1daa0a915012ff2ba0dd969a7d12434f43e51303fb5dc0e7cdaedb1073c8f74"},"schema_version":"1.0"},"canonical_sha256":"a789b84b9c52d634be18a5940432d5157649c9a81ad3211b4bb005ecaa8596b8","source":{"kind":"arxiv","id":"1206.4208","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1206.4208","created_at":"2026-05-18T03:53:16Z"},{"alias_kind":"arxiv_version","alias_value":"1206.4208v1","created_at":"2026-05-18T03:53:16Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1206.4208","created_at":"2026-05-18T03:53:16Z"},{"alias_kind":"pith_short_12","alias_value":"U6E3QS44KLLD","created_at":"2026-05-18T12:27:23Z"},{"alias_kind":"pith_short_16","alias_value":"U6E3QS44KLLDJPQY","created_at":"2026-05-18T12:27:23Z"},{"alias_kind":"pith_short_8","alias_value":"U6E3QS44","created_at":"2026-05-18T12:27:23Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:U6E3QS44KLLDJPQYUWKAIMWVCV","target":"record","payload":{"canonical_record":{"source":{"id":"1206.4208","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.OT","submitted_at":"2012-06-19T13:50:41Z","cross_cats_sorted":[],"title_canon_sha256":"4607546745c3070dd4bcc172859e1944844a4eb9a4f31d7172e777a4ee5db912","abstract_canon_sha256":"d1daa0a915012ff2ba0dd969a7d12434f43e51303fb5dc0e7cdaedb1073c8f74"},"schema_version":"1.0"},"canonical_sha256":"a789b84b9c52d634be18a5940432d5157649c9a81ad3211b4bb005ecaa8596b8","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:53:16.450580Z","signature_b64":"NutGCt8v6Sm0t4/KtC6GjrG6qwYQcQ58TWtyFpAiwrqAJBAt5gamH+FdXULeH1T5ulLjihMafUGqX5VCav+8AQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a789b84b9c52d634be18a5940432d5157649c9a81ad3211b4bb005ecaa8596b8","last_reissued_at":"2026-05-18T03:53:16.449963Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:53:16.449963Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1206.4208","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-18T03:53:16Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"0nm8hSKx1Tfy2wHNMRvXebRgL88eJnbDeg2O0tQ2SeAkkX6Hli5Yr79tcXqrnmibo8ctxLFvX9ZqROocr7K8Dg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T14:43:15.418583Z"},"content_sha256":"589749c342a608d22cabe21f9689ea2057f96186fa9e5d750a61b3bf9f031d3b","schema_version":"1.0","event_id":"sha256:589749c342a608d22cabe21f9689ea2057f96186fa9e5d750a61b3bf9f031d3b"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:U6E3QS44KLLDJPQYUWKAIMWVCV","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A Fast Non-Gaussian Bayesian Matching Pursuit Method for Sparse Reconstruction","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"stat.OT","authors_text":"Mudassir Masood, Tareq Al-Naffouri","submitted_at":"2012-06-19T13:50:41Z","abstract_excerpt":"A fast matching pursuit method using a Bayesian approach is introduced for sparse signal recovery. This method, referred to as nGpFBMP, performs Bayesian estimates of sparse signals even when the signal prior is non-Gaussian or unknown. It is agnostic on signal statistics and utilizes a priori statistics of additive noise and the sparsity rate of the signal, which are shown to be easily estimated from data if not available. nGpFBMP utilizes a greedy approach and order-recursive updates of its metrics to find the most dominant sparse supports to determine the approximate minimum mean square err"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1206.4208","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-18T03:53:16Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"i5SsSh90JXIcYnLFRnRHb2aQcXnYWU9BeT6NWZcHIO9h4Gpf9W1vm3WkTSog4hq5y8K3mWBGguqxVemnrp68Cw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T14:43:15.418931Z"},"content_sha256":"84e8434d1184a329c393cb31f0ae6c0e70ae008748f243654a2f113cf59fe554","schema_version":"1.0","event_id":"sha256:84e8434d1184a329c393cb31f0ae6c0e70ae008748f243654a2f113cf59fe554"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/U6E3QS44KLLDJPQYUWKAIMWVCV/bundle.json","state_url":"https://pith.science/pith/U6E3QS44KLLDJPQYUWKAIMWVCV/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/U6E3QS44KLLDJPQYUWKAIMWVCV/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-03T14:43:15Z","links":{"resolver":"https://pith.science/pith/U6E3QS44KLLDJPQYUWKAIMWVCV","bundle":"https://pith.science/pith/U6E3QS44KLLDJPQYUWKAIMWVCV/bundle.json","state":"https://pith.science/pith/U6E3QS44KLLDJPQYUWKAIMWVCV/state.json","well_known_bundle":"https://pith.science/.well-known/pith/U6E3QS44KLLDJPQYUWKAIMWVCV/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:U6E3QS44KLLDJPQYUWKAIMWVCV","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":"d1daa0a915012ff2ba0dd969a7d12434f43e51303fb5dc0e7cdaedb1073c8f74","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.OT","submitted_at":"2012-06-19T13:50:41Z","title_canon_sha256":"4607546745c3070dd4bcc172859e1944844a4eb9a4f31d7172e777a4ee5db912"},"schema_version":"1.0","source":{"id":"1206.4208","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1206.4208","created_at":"2026-05-18T03:53:16Z"},{"alias_kind":"arxiv_version","alias_value":"1206.4208v1","created_at":"2026-05-18T03:53:16Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1206.4208","created_at":"2026-05-18T03:53:16Z"},{"alias_kind":"pith_short_12","alias_value":"U6E3QS44KLLD","created_at":"2026-05-18T12:27:23Z"},{"alias_kind":"pith_short_16","alias_value":"U6E3QS44KLLDJPQY","created_at":"2026-05-18T12:27:23Z"},{"alias_kind":"pith_short_8","alias_value":"U6E3QS44","created_at":"2026-05-18T12:27:23Z"}],"graph_snapshots":[{"event_id":"sha256:84e8434d1184a329c393cb31f0ae6c0e70ae008748f243654a2f113cf59fe554","target":"graph","created_at":"2026-05-18T03:53:16Z","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":"A fast matching pursuit method using a Bayesian approach is introduced for sparse signal recovery. This method, referred to as nGpFBMP, performs Bayesian estimates of sparse signals even when the signal prior is non-Gaussian or unknown. It is agnostic on signal statistics and utilizes a priori statistics of additive noise and the sparsity rate of the signal, which are shown to be easily estimated from data if not available. nGpFBMP utilizes a greedy approach and order-recursive updates of its metrics to find the most dominant sparse supports to determine the approximate minimum mean square err","authors_text":"Mudassir Masood, Tareq Al-Naffouri","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.OT","submitted_at":"2012-06-19T13:50:41Z","title":"A Fast Non-Gaussian Bayesian Matching Pursuit Method for Sparse Reconstruction"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1206.4208","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:589749c342a608d22cabe21f9689ea2057f96186fa9e5d750a61b3bf9f031d3b","target":"record","created_at":"2026-05-18T03:53:16Z","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":"d1daa0a915012ff2ba0dd969a7d12434f43e51303fb5dc0e7cdaedb1073c8f74","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.OT","submitted_at":"2012-06-19T13:50:41Z","title_canon_sha256":"4607546745c3070dd4bcc172859e1944844a4eb9a4f31d7172e777a4ee5db912"},"schema_version":"1.0","source":{"id":"1206.4208","kind":"arxiv","version":1}},"canonical_sha256":"a789b84b9c52d634be18a5940432d5157649c9a81ad3211b4bb005ecaa8596b8","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"a789b84b9c52d634be18a5940432d5157649c9a81ad3211b4bb005ecaa8596b8","first_computed_at":"2026-05-18T03:53:16.449963Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:53:16.449963Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"NutGCt8v6Sm0t4/KtC6GjrG6qwYQcQ58TWtyFpAiwrqAJBAt5gamH+FdXULeH1T5ulLjihMafUGqX5VCav+8AQ==","signature_status":"signed_v1","signed_at":"2026-05-18T03:53:16.450580Z","signed_message":"canonical_sha256_bytes"},"source_id":"1206.4208","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:589749c342a608d22cabe21f9689ea2057f96186fa9e5d750a61b3bf9f031d3b","sha256:84e8434d1184a329c393cb31f0ae6c0e70ae008748f243654a2f113cf59fe554"],"state_sha256":"b32260bac57d811da245e7c3036b2f3a123db216c2975028474775fc60f28e98"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"E7FngxfbzfLeToBzUDPysZJ+asuN/W+Jdi+A0Pav1XahgdGjYYPe5576MJ0hbFuf/8fh9PohbjUsc2ldLuymAA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-03T14:43:15.420977Z","bundle_sha256":"e8aa3d65e6020c999d3db411f635b12729ddf7a78589c96ebeee661775a2bbb5"}}