{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:KNHXSTLH5SIKGVAYDOB3BT4FIQ","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":"a80ff8ae7fc4a13985107dab282fce2af4eb7d03c3347e9237ba5bd0399d8f77","cross_cats_sorted":["cs.LG","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-08-05T03:23:34Z","title_canon_sha256":"f48ff9fd0a3f0241a57375814dff4ae9ea484987e9ae63ce3372b023de18ccac"},"schema_version":"1.0","source":{"id":"1508.00964","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1508.00964","created_at":"2026-05-18T01:08:21Z"},{"alias_kind":"arxiv_version","alias_value":"1508.00964v2","created_at":"2026-05-18T01:08:21Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1508.00964","created_at":"2026-05-18T01:08:21Z"},{"alias_kind":"pith_short_12","alias_value":"KNHXSTLH5SIK","created_at":"2026-05-18T12:29:29Z"},{"alias_kind":"pith_short_16","alias_value":"KNHXSTLH5SIKGVAY","created_at":"2026-05-18T12:29:29Z"},{"alias_kind":"pith_short_8","alias_value":"KNHXSTLH","created_at":"2026-05-18T12:29:29Z"}],"graph_snapshots":[{"event_id":"sha256:663fac2c478809553eec7ae4b9499b54c069e04a9db1191bc73c553756c82915","target":"graph","created_at":"2026-05-18T01:08:21Z","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 reliable support detection is essential for a greedy algorithm to reconstruct a sparse signal accurately from compressed and noisy measurements. This paper proposes a novel support detection method for greedy algorithms, which is referred to as \"\\textit{maximum a posteriori (MAP) support detection}\". Unlike existing support detection methods that identify support indices with the largest correlation value in magnitude per iteration, the proposed method selects them with the largest likelihood ratios computed under the true and null support hypotheses by simultaneously exploiting the distribu","authors_text":"Namyoon Lee","cross_cats":["cs.LG","math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-08-05T03:23:34Z","title":"MAP Support Detection for Greedy Sparse Signal Recovery Algorithms in Compressive Sensing"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1508.00964","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:74920d5a31716a2c00ea14ad8d7b147ccc87225b0ed3b0989a96b67a152c79d4","target":"record","created_at":"2026-05-18T01:08:21Z","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":"a80ff8ae7fc4a13985107dab282fce2af4eb7d03c3347e9237ba5bd0399d8f77","cross_cats_sorted":["cs.LG","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-08-05T03:23:34Z","title_canon_sha256":"f48ff9fd0a3f0241a57375814dff4ae9ea484987e9ae63ce3372b023de18ccac"},"schema_version":"1.0","source":{"id":"1508.00964","kind":"arxiv","version":2}},"canonical_sha256":"534f794d67ec90a354181b83b0cf854418d88fb002c6709476d7627144c376a2","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"534f794d67ec90a354181b83b0cf854418d88fb002c6709476d7627144c376a2","first_computed_at":"2026-05-18T01:08:21.038993Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:08:21.038993Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"NULSUevntNzR0+2xk1YNVeI6Mer/ZAsT5nRvR7sa0XtwhRMPxfW2CI1vh00HsLI4U27GvG9C8j2FgUAQGG1HCg==","signature_status":"signed_v1","signed_at":"2026-05-18T01:08:21.039758Z","signed_message":"canonical_sha256_bytes"},"source_id":"1508.00964","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:74920d5a31716a2c00ea14ad8d7b147ccc87225b0ed3b0989a96b67a152c79d4","sha256:663fac2c478809553eec7ae4b9499b54c069e04a9db1191bc73c553756c82915"],"state_sha256":"b8d1a43605f9541dd95ec4d0c8006cf5cd7d76f8d59958d7ad9eeda9eae5d15d"}