{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:3ZLNQ5JRSZ3QMXPI5TSNPXTWVR","short_pith_number":"pith:3ZLNQ5JR","canonical_record":{"source":{"id":"1601.00543","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-01-04T15:43:49Z","cross_cats_sorted":["cs.LG","math.IT"],"title_canon_sha256":"58548223a3a115b13341bc4b3ff170194396c5dde907d1923de842fbff37cd71","abstract_canon_sha256":"3e2266cb4ea2189f2ffe7d78fffd07b09511795cf021fa856401ee63aa1d9b95"},"schema_version":"1.0"},"canonical_sha256":"de56d875319677065de8ece4d7de76ac712572fffb59bc12de9011a94c75f777","source":{"kind":"arxiv","id":"1601.00543","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1601.00543","created_at":"2026-05-18T01:23:27Z"},{"alias_kind":"arxiv_version","alias_value":"1601.00543v1","created_at":"2026-05-18T01:23:27Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1601.00543","created_at":"2026-05-18T01:23:27Z"},{"alias_kind":"pith_short_12","alias_value":"3ZLNQ5JRSZ3Q","created_at":"2026-05-18T12:29:58Z"},{"alias_kind":"pith_short_16","alias_value":"3ZLNQ5JRSZ3QMXPI","created_at":"2026-05-18T12:29:58Z"},{"alias_kind":"pith_short_8","alias_value":"3ZLNQ5JR","created_at":"2026-05-18T12:29:58Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:3ZLNQ5JRSZ3QMXPI5TSNPXTWVR","target":"record","payload":{"canonical_record":{"source":{"id":"1601.00543","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-01-04T15:43:49Z","cross_cats_sorted":["cs.LG","math.IT"],"title_canon_sha256":"58548223a3a115b13341bc4b3ff170194396c5dde907d1923de842fbff37cd71","abstract_canon_sha256":"3e2266cb4ea2189f2ffe7d78fffd07b09511795cf021fa856401ee63aa1d9b95"},"schema_version":"1.0"},"canonical_sha256":"de56d875319677065de8ece4d7de76ac712572fffb59bc12de9011a94c75f777","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:23:27.082033Z","signature_b64":"8+/FBior9QFTnvIw8sPMuXbxDp8FdbDW4MBQ7mtO26GTwPumCTwxDmou23zHJ553Wmeiu7qNDCcdosAxeuC1Cw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"de56d875319677065de8ece4d7de76ac712572fffb59bc12de9011a94c75f777","last_reissued_at":"2026-05-18T01:23:27.081434Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:23:27.081434Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1601.00543","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-18T01:23:27Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"G2dgXbYvoH5FGEb8yBlZbyG8A/j5FEFI43ts/iNd4D0F8ynUQoAc+WXyjnI3nkCjsR/UHrF4fGVs+3/+yNFZCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T08:44:43.881028Z"},"content_sha256":"1f0e3ab2033ce83da1dc25c45b120c3c5a73d4f01d32fd36ca43c2d0a091547b","schema_version":"1.0","event_id":"sha256:1f0e3ab2033ce83da1dc25c45b120c3c5a73d4f01d32fd36ca43c2d0a091547b"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:3ZLNQ5JRSZ3QMXPI5TSNPXTWVR","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Approximate Message Passing with Nearest Neighbor Sparsity Pattern Learning","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG","math.IT"],"primary_cat":"cs.IT","authors_text":"Defeng (David) Huang, Jianhua Lu, Linling Kuang, Sheng Wu, Xiangming Meng","submitted_at":"2016-01-04T15:43:49Z","abstract_excerpt":"We consider the problem of recovering clustered sparse signals with no prior knowledge of the sparsity pattern. Beyond simple sparsity, signals of interest often exhibits an underlying sparsity pattern which, if leveraged, can improve the reconstruction performance. However, the sparsity pattern is usually unknown a priori. Inspired by the idea of k-nearest neighbor (k-NN) algorithm, we propose an efficient algorithm termed approximate message passing with nearest neighbor sparsity pattern learning (AMP-NNSPL), which learns the sparsity pattern adaptively. AMP-NNSPL specifies a flexible spike "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1601.00543","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-18T01:23:27Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"6se/cTjBY6OWKIKlVkDxakhYAfQMXx/mnn+rppBevQ4i/JK7bjiXceG9t8J4AZchG8rOZlsIaxMAzM6yfYVlAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T08:44:43.881402Z"},"content_sha256":"6d8b5da8cd6ce0763417100743c719c7e37be3ca976dec88ebf8d88f81c1a98f","schema_version":"1.0","event_id":"sha256:6d8b5da8cd6ce0763417100743c719c7e37be3ca976dec88ebf8d88f81c1a98f"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/3ZLNQ5JRSZ3QMXPI5TSNPXTWVR/bundle.json","state_url":"https://pith.science/pith/3ZLNQ5JRSZ3QMXPI5TSNPXTWVR/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/3ZLNQ5JRSZ3QMXPI5TSNPXTWVR/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-05-30T08:44:43Z","links":{"resolver":"https://pith.science/pith/3ZLNQ5JRSZ3QMXPI5TSNPXTWVR","bundle":"https://pith.science/pith/3ZLNQ5JRSZ3QMXPI5TSNPXTWVR/bundle.json","state":"https://pith.science/pith/3ZLNQ5JRSZ3QMXPI5TSNPXTWVR/state.json","well_known_bundle":"https://pith.science/.well-known/pith/3ZLNQ5JRSZ3QMXPI5TSNPXTWVR/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:3ZLNQ5JRSZ3QMXPI5TSNPXTWVR","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":"3e2266cb4ea2189f2ffe7d78fffd07b09511795cf021fa856401ee63aa1d9b95","cross_cats_sorted":["cs.LG","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-01-04T15:43:49Z","title_canon_sha256":"58548223a3a115b13341bc4b3ff170194396c5dde907d1923de842fbff37cd71"},"schema_version":"1.0","source":{"id":"1601.00543","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1601.00543","created_at":"2026-05-18T01:23:27Z"},{"alias_kind":"arxiv_version","alias_value":"1601.00543v1","created_at":"2026-05-18T01:23:27Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1601.00543","created_at":"2026-05-18T01:23:27Z"},{"alias_kind":"pith_short_12","alias_value":"3ZLNQ5JRSZ3Q","created_at":"2026-05-18T12:29:58Z"},{"alias_kind":"pith_short_16","alias_value":"3ZLNQ5JRSZ3QMXPI","created_at":"2026-05-18T12:29:58Z"},{"alias_kind":"pith_short_8","alias_value":"3ZLNQ5JR","created_at":"2026-05-18T12:29:58Z"}],"graph_snapshots":[{"event_id":"sha256:6d8b5da8cd6ce0763417100743c719c7e37be3ca976dec88ebf8d88f81c1a98f","target":"graph","created_at":"2026-05-18T01:23:27Z","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":"We consider the problem of recovering clustered sparse signals with no prior knowledge of the sparsity pattern. Beyond simple sparsity, signals of interest often exhibits an underlying sparsity pattern which, if leveraged, can improve the reconstruction performance. However, the sparsity pattern is usually unknown a priori. Inspired by the idea of k-nearest neighbor (k-NN) algorithm, we propose an efficient algorithm termed approximate message passing with nearest neighbor sparsity pattern learning (AMP-NNSPL), which learns the sparsity pattern adaptively. AMP-NNSPL specifies a flexible spike ","authors_text":"Defeng (David) Huang, Jianhua Lu, Linling Kuang, Sheng Wu, Xiangming Meng","cross_cats":["cs.LG","math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-01-04T15:43:49Z","title":"Approximate Message Passing with Nearest Neighbor Sparsity Pattern Learning"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1601.00543","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:1f0e3ab2033ce83da1dc25c45b120c3c5a73d4f01d32fd36ca43c2d0a091547b","target":"record","created_at":"2026-05-18T01:23:27Z","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":"3e2266cb4ea2189f2ffe7d78fffd07b09511795cf021fa856401ee63aa1d9b95","cross_cats_sorted":["cs.LG","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-01-04T15:43:49Z","title_canon_sha256":"58548223a3a115b13341bc4b3ff170194396c5dde907d1923de842fbff37cd71"},"schema_version":"1.0","source":{"id":"1601.00543","kind":"arxiv","version":1}},"canonical_sha256":"de56d875319677065de8ece4d7de76ac712572fffb59bc12de9011a94c75f777","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"de56d875319677065de8ece4d7de76ac712572fffb59bc12de9011a94c75f777","first_computed_at":"2026-05-18T01:23:27.081434Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:23:27.081434Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"8+/FBior9QFTnvIw8sPMuXbxDp8FdbDW4MBQ7mtO26GTwPumCTwxDmou23zHJ553Wmeiu7qNDCcdosAxeuC1Cw==","signature_status":"signed_v1","signed_at":"2026-05-18T01:23:27.082033Z","signed_message":"canonical_sha256_bytes"},"source_id":"1601.00543","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:1f0e3ab2033ce83da1dc25c45b120c3c5a73d4f01d32fd36ca43c2d0a091547b","sha256:6d8b5da8cd6ce0763417100743c719c7e37be3ca976dec88ebf8d88f81c1a98f"],"state_sha256":"c8f5748dc1f8e0f3897d86c5a9e796047aca37f36954b444ad7fb042b1369b0d"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Ql3pRZjTCmhYbJyOOmlyiaFRf28tUwoOyRaM7EEhYqruIjSHM3l18mj1+2NqfZ+fsxnoAOXremMmT5+ae1mSAw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-30T08:44:43.885027Z","bundle_sha256":"5d3a9e7e2c998afd0ad949cb0d687060a958eebe883e46807093f826f912aba7"}}