{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:UFF3F34522YQZH4A457LNT567A","short_pith_number":"pith:UFF3F345","canonical_record":{"source":{"id":"1508.01104","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-08-05T15:23:12Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"d31bb3b644418431322410184db5c70505ea8d1dbd06f5e2154607a0864a9e93","abstract_canon_sha256":"97c020d5f93089e78642dd17fe242897d12d1d50de35c0a3d9a33cf4d17cb8b8"},"schema_version":"1.0"},"canonical_sha256":"a14bb2ef9dd6b10c9f80e77eb6cfbef81a5ed64b271b7fdbf19b718496117697","source":{"kind":"arxiv","id":"1508.01104","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1508.01104","created_at":"2026-05-18T01:35:44Z"},{"alias_kind":"arxiv_version","alias_value":"1508.01104v1","created_at":"2026-05-18T01:35:44Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1508.01104","created_at":"2026-05-18T01:35:44Z"},{"alias_kind":"pith_short_12","alias_value":"UFF3F34522YQ","created_at":"2026-05-18T12:29:44Z"},{"alias_kind":"pith_short_16","alias_value":"UFF3F34522YQZH4A","created_at":"2026-05-18T12:29:44Z"},{"alias_kind":"pith_short_8","alias_value":"UFF3F345","created_at":"2026-05-18T12:29:44Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:UFF3F34522YQZH4A457LNT567A","target":"record","payload":{"canonical_record":{"source":{"id":"1508.01104","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-08-05T15:23:12Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"d31bb3b644418431322410184db5c70505ea8d1dbd06f5e2154607a0864a9e93","abstract_canon_sha256":"97c020d5f93089e78642dd17fe242897d12d1d50de35c0a3d9a33cf4d17cb8b8"},"schema_version":"1.0"},"canonical_sha256":"a14bb2ef9dd6b10c9f80e77eb6cfbef81a5ed64b271b7fdbf19b718496117697","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:35:44.061145Z","signature_b64":"H5X28Ud/xGkTQHMfGVfLTc2C+uj1cBeu65X3CXwSph4rKlj2BkfKKjDMeW/eZsavI8kid6fPRkbJBU6g+iLWBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a14bb2ef9dd6b10c9f80e77eb6cfbef81a5ed64b271b7fdbf19b718496117697","last_reissued_at":"2026-05-18T01:35:44.060657Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:35:44.060657Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1508.01104","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:35:44Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"odvmJ4HYjjJc+xd2gi/30Q98v/frydTEWrF3jYwKWbKWSFnerHQmrPxmHbrqa4JeoHUl6Kq2utTWyqlkwY9OBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-24T21:50:30.472898Z"},"content_sha256":"4e00dfbe1b1571883af6b6bf22f2e2b2c13d0fe2f7b658f5976d988d53857b91","schema_version":"1.0","event_id":"sha256:4e00dfbe1b1571883af6b6bf22f2e2b2c13d0fe2f7b658f5976d988d53857b91"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:UFF3F34522YQZH4A457LNT567A","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Bayesian Optimal Approximate Message Passing to Recover Structured Sparse Signals","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Martin Mayer, Norbert Goertz","submitted_at":"2015-08-05T15:23:12Z","abstract_excerpt":"We present a novel compressed sensing recovery algorithm - termed Bayesian Optimal Structured Signal Approximate Message Passing (BOSSAMP) - that jointly exploits the prior distribution and the structured sparsity of a signal that shall be recovered from noisy linear measurements. Structured sparsity is inherent to group sparse and jointly sparse signals. Our algorithm is based on approximate message passing that poses a low complexity recovery algorithm whose Bayesian optimal version allows to specify a prior distribution for each signal component. We utilize this feature in order to establis"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1508.01104","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:35:44Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"TWv9pIkW4OpJF/XdYAUJLsXiGrzw7p9SQhxaLclHuRuYeF5ypvMIE5EStRPxnSKrXMVpfBAd3SmTjeHlIQ4ACA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-24T21:50:30.473239Z"},"content_sha256":"b61b6f6390d63812397e5e25d795338b47baf20b8cb8aa274a76cf22d153029b","schema_version":"1.0","event_id":"sha256:b61b6f6390d63812397e5e25d795338b47baf20b8cb8aa274a76cf22d153029b"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/UFF3F34522YQZH4A457LNT567A/bundle.json","state_url":"https://pith.science/pith/UFF3F34522YQZH4A457LNT567A/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/UFF3F34522YQZH4A457LNT567A/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-24T21:50:30Z","links":{"resolver":"https://pith.science/pith/UFF3F34522YQZH4A457LNT567A","bundle":"https://pith.science/pith/UFF3F34522YQZH4A457LNT567A/bundle.json","state":"https://pith.science/pith/UFF3F34522YQZH4A457LNT567A/state.json","well_known_bundle":"https://pith.science/.well-known/pith/UFF3F34522YQZH4A457LNT567A/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:UFF3F34522YQZH4A457LNT567A","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":"97c020d5f93089e78642dd17fe242897d12d1d50de35c0a3d9a33cf4d17cb8b8","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-08-05T15:23:12Z","title_canon_sha256":"d31bb3b644418431322410184db5c70505ea8d1dbd06f5e2154607a0864a9e93"},"schema_version":"1.0","source":{"id":"1508.01104","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1508.01104","created_at":"2026-05-18T01:35:44Z"},{"alias_kind":"arxiv_version","alias_value":"1508.01104v1","created_at":"2026-05-18T01:35:44Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1508.01104","created_at":"2026-05-18T01:35:44Z"},{"alias_kind":"pith_short_12","alias_value":"UFF3F34522YQ","created_at":"2026-05-18T12:29:44Z"},{"alias_kind":"pith_short_16","alias_value":"UFF3F34522YQZH4A","created_at":"2026-05-18T12:29:44Z"},{"alias_kind":"pith_short_8","alias_value":"UFF3F345","created_at":"2026-05-18T12:29:44Z"}],"graph_snapshots":[{"event_id":"sha256:b61b6f6390d63812397e5e25d795338b47baf20b8cb8aa274a76cf22d153029b","target":"graph","created_at":"2026-05-18T01:35:44Z","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 present a novel compressed sensing recovery algorithm - termed Bayesian Optimal Structured Signal Approximate Message Passing (BOSSAMP) - that jointly exploits the prior distribution and the structured sparsity of a signal that shall be recovered from noisy linear measurements. Structured sparsity is inherent to group sparse and jointly sparse signals. Our algorithm is based on approximate message passing that poses a low complexity recovery algorithm whose Bayesian optimal version allows to specify a prior distribution for each signal component. We utilize this feature in order to establis","authors_text":"Martin Mayer, Norbert Goertz","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-08-05T15:23:12Z","title":"Bayesian Optimal Approximate Message Passing to Recover Structured Sparse Signals"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1508.01104","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:4e00dfbe1b1571883af6b6bf22f2e2b2c13d0fe2f7b658f5976d988d53857b91","target":"record","created_at":"2026-05-18T01:35:44Z","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":"97c020d5f93089e78642dd17fe242897d12d1d50de35c0a3d9a33cf4d17cb8b8","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-08-05T15:23:12Z","title_canon_sha256":"d31bb3b644418431322410184db5c70505ea8d1dbd06f5e2154607a0864a9e93"},"schema_version":"1.0","source":{"id":"1508.01104","kind":"arxiv","version":1}},"canonical_sha256":"a14bb2ef9dd6b10c9f80e77eb6cfbef81a5ed64b271b7fdbf19b718496117697","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"a14bb2ef9dd6b10c9f80e77eb6cfbef81a5ed64b271b7fdbf19b718496117697","first_computed_at":"2026-05-18T01:35:44.060657Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:35:44.060657Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"H5X28Ud/xGkTQHMfGVfLTc2C+uj1cBeu65X3CXwSph4rKlj2BkfKKjDMeW/eZsavI8kid6fPRkbJBU6g+iLWBg==","signature_status":"signed_v1","signed_at":"2026-05-18T01:35:44.061145Z","signed_message":"canonical_sha256_bytes"},"source_id":"1508.01104","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:4e00dfbe1b1571883af6b6bf22f2e2b2c13d0fe2f7b658f5976d988d53857b91","sha256:b61b6f6390d63812397e5e25d795338b47baf20b8cb8aa274a76cf22d153029b"],"state_sha256":"ff5452c2ff5c59ecf884e4bcbdda831215704cf2c082feb56886772e95c3032b"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"fLUvKuZ35eaXbL9UGJkO60D/EL20Ml8lAr7S/wCo4B28YuwIqOv00aVLWMxNCWIJwTFl4RWo4zb113Yx6DQ1Bw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-24T21:50:30.475148Z","bundle_sha256":"2cd05fcc3b1e256a7f0eb48094f7adc9dbe4d6863f0dedf2ea47c2434a4977fb"}}