{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:54WS6M3PSRYLQ6MSR34PW42UQ4","short_pith_number":"pith:54WS6M3P","canonical_record":{"source":{"id":"1511.08238","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-11-25T21:50:45Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"60ec0f715f8c1e25974d918b1ec00c74e8cd4e613a2070b5f0ccec1021d20557","abstract_canon_sha256":"4fecfee312c0425e8e7b529aace547be4563f066fbe0118205ebcc2d35203e7a"},"schema_version":"1.0"},"canonical_sha256":"ef2d2f336f9470b879928ef8fb73548713d5987ab50b6ac056c65e3368dd0a4c","source":{"kind":"arxiv","id":"1511.08238","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1511.08238","created_at":"2026-05-18T01:25:56Z"},{"alias_kind":"arxiv_version","alias_value":"1511.08238v1","created_at":"2026-05-18T01:25:56Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1511.08238","created_at":"2026-05-18T01:25:56Z"},{"alias_kind":"pith_short_12","alias_value":"54WS6M3PSRYL","created_at":"2026-05-18T12:29:05Z"},{"alias_kind":"pith_short_16","alias_value":"54WS6M3PSRYLQ6MS","created_at":"2026-05-18T12:29:05Z"},{"alias_kind":"pith_short_8","alias_value":"54WS6M3P","created_at":"2026-05-18T12:29:05Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:54WS6M3PSRYLQ6MSR34PW42UQ4","target":"record","payload":{"canonical_record":{"source":{"id":"1511.08238","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-11-25T21:50:45Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"60ec0f715f8c1e25974d918b1ec00c74e8cd4e613a2070b5f0ccec1021d20557","abstract_canon_sha256":"4fecfee312c0425e8e7b529aace547be4563f066fbe0118205ebcc2d35203e7a"},"schema_version":"1.0"},"canonical_sha256":"ef2d2f336f9470b879928ef8fb73548713d5987ab50b6ac056c65e3368dd0a4c","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:25:56.219427Z","signature_b64":"ML99S5GI7q2BUOM69ffFL5no/f5mgZ52uu1lTbo0bKdDrPqj5dWae9H/orD17x/zljrkxShMHohdZhI6hUcYDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ef2d2f336f9470b879928ef8fb73548713d5987ab50b6ac056c65e3368dd0a4c","last_reissued_at":"2026-05-18T01:25:56.218653Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:25:56.218653Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1511.08238","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:25:56Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"5s6I/V3xVn6x9CkpUM7plMfXc1YtmzUDWGFE+C0nRxAq1Ch9nH3zlkEKrzM5raFKM396EM4bXK1NRETCqryVDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-24T19:20:25.040451Z"},"content_sha256":"8b41ee3dcc0837e823adb6f0c068c7e0a2ef6687c22975aebc2289cd2cb47741","schema_version":"1.0","event_id":"sha256:8b41ee3dcc0837e823adb6f0c068c7e0a2ef6687c22975aebc2289cd2cb47741"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:54WS6M3PSRYLQ6MSR34PW42UQ4","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"An Approach to Complex Bayesian-optimal Approximate Message Passing","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Gabor Hannak, Gerald Matz, Martin Mayer, Norbert Goertz","submitted_at":"2015-11-25T21:50:45Z","abstract_excerpt":"In this work we aim to solve the compressed sensing problem for the case of a complex unknown vector by utilizing the Bayesian-optimal structured signal approximate message passing (BOSSAMP) algorithm on the jointly sparse real and imaginary parts of the unknown. By introducing a latent activity variable, BOSSAMP separates the tasks of activity detection and value estimation to overcome the problem of detecting different supports in the real and imaginary parts. We complement the recovery algorithm by two novel support detection schemes that utilize the updated auxiliary variables of BOSSAMP. "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1511.08238","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:25:56Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"q9LApALGRMnFCiDLPoONcU2eEb10vHHPcju6Aa5vZAoQAtivuf+3QFSlzsC2Twsczpia/8dt0a0G59TMSLRXAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-24T19:20:25.040804Z"},"content_sha256":"e4d53af1899b7db478a211f6cf55797b3704aa4301d1fa7430437fe9cdee30d6","schema_version":"1.0","event_id":"sha256:e4d53af1899b7db478a211f6cf55797b3704aa4301d1fa7430437fe9cdee30d6"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/54WS6M3PSRYLQ6MSR34PW42UQ4/bundle.json","state_url":"https://pith.science/pith/54WS6M3PSRYLQ6MSR34PW42UQ4/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/54WS6M3PSRYLQ6MSR34PW42UQ4/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-24T19:20:25Z","links":{"resolver":"https://pith.science/pith/54WS6M3PSRYLQ6MSR34PW42UQ4","bundle":"https://pith.science/pith/54WS6M3PSRYLQ6MSR34PW42UQ4/bundle.json","state":"https://pith.science/pith/54WS6M3PSRYLQ6MSR34PW42UQ4/state.json","well_known_bundle":"https://pith.science/.well-known/pith/54WS6M3PSRYLQ6MSR34PW42UQ4/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:54WS6M3PSRYLQ6MSR34PW42UQ4","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":"4fecfee312c0425e8e7b529aace547be4563f066fbe0118205ebcc2d35203e7a","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-11-25T21:50:45Z","title_canon_sha256":"60ec0f715f8c1e25974d918b1ec00c74e8cd4e613a2070b5f0ccec1021d20557"},"schema_version":"1.0","source":{"id":"1511.08238","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1511.08238","created_at":"2026-05-18T01:25:56Z"},{"alias_kind":"arxiv_version","alias_value":"1511.08238v1","created_at":"2026-05-18T01:25:56Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1511.08238","created_at":"2026-05-18T01:25:56Z"},{"alias_kind":"pith_short_12","alias_value":"54WS6M3PSRYL","created_at":"2026-05-18T12:29:05Z"},{"alias_kind":"pith_short_16","alias_value":"54WS6M3PSRYLQ6MS","created_at":"2026-05-18T12:29:05Z"},{"alias_kind":"pith_short_8","alias_value":"54WS6M3P","created_at":"2026-05-18T12:29:05Z"}],"graph_snapshots":[{"event_id":"sha256:e4d53af1899b7db478a211f6cf55797b3704aa4301d1fa7430437fe9cdee30d6","target":"graph","created_at":"2026-05-18T01:25:56Z","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":"In this work we aim to solve the compressed sensing problem for the case of a complex unknown vector by utilizing the Bayesian-optimal structured signal approximate message passing (BOSSAMP) algorithm on the jointly sparse real and imaginary parts of the unknown. By introducing a latent activity variable, BOSSAMP separates the tasks of activity detection and value estimation to overcome the problem of detecting different supports in the real and imaginary parts. We complement the recovery algorithm by two novel support detection schemes that utilize the updated auxiliary variables of BOSSAMP. ","authors_text":"Gabor Hannak, Gerald Matz, 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-11-25T21:50:45Z","title":"An Approach to Complex Bayesian-optimal Approximate Message Passing"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1511.08238","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:8b41ee3dcc0837e823adb6f0c068c7e0a2ef6687c22975aebc2289cd2cb47741","target":"record","created_at":"2026-05-18T01:25:56Z","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":"4fecfee312c0425e8e7b529aace547be4563f066fbe0118205ebcc2d35203e7a","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-11-25T21:50:45Z","title_canon_sha256":"60ec0f715f8c1e25974d918b1ec00c74e8cd4e613a2070b5f0ccec1021d20557"},"schema_version":"1.0","source":{"id":"1511.08238","kind":"arxiv","version":1}},"canonical_sha256":"ef2d2f336f9470b879928ef8fb73548713d5987ab50b6ac056c65e3368dd0a4c","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"ef2d2f336f9470b879928ef8fb73548713d5987ab50b6ac056c65e3368dd0a4c","first_computed_at":"2026-05-18T01:25:56.218653Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:25:56.218653Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"ML99S5GI7q2BUOM69ffFL5no/f5mgZ52uu1lTbo0bKdDrPqj5dWae9H/orD17x/zljrkxShMHohdZhI6hUcYDw==","signature_status":"signed_v1","signed_at":"2026-05-18T01:25:56.219427Z","signed_message":"canonical_sha256_bytes"},"source_id":"1511.08238","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:8b41ee3dcc0837e823adb6f0c068c7e0a2ef6687c22975aebc2289cd2cb47741","sha256:e4d53af1899b7db478a211f6cf55797b3704aa4301d1fa7430437fe9cdee30d6"],"state_sha256":"049062e841dbf8d05cdf3aa50eb5b07b94cfbeaa7a48a8ead466c960e0a36d34"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"OlOZWoP9WBZvSMvdOgWw+s5AT0SRujaMu8DcuiyFnRhLE874QvFKCN7jkVp+mdacU/UMNsCufB+hE+riKQc3Cg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-24T19:20:25.042769Z","bundle_sha256":"766f72adc0c9fd0e5fc1f8ee161131f1852c76478b6637b2394b2cf329640ca9"}}