{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:M3HJRNPI2LUM4QBCUKWJ3QHOZ5","short_pith_number":"pith:M3HJRNPI","canonical_record":{"source":{"id":"1501.04762","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-01-20T11:15:29Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"e489102dcbc1aee5e384f99e029affd2e41e085bb1a1f77f75087760033b753b","abstract_canon_sha256":"ae5e677f233c72f30e67def064b313e5fdf1b8c0973a8aebd86c5513a87cf193"},"schema_version":"1.0"},"canonical_sha256":"66ce98b5e8d2e8ce4022a2ac9dc0eecf5aaca70ab091c63759acade6aa4c2cda","source":{"kind":"arxiv","id":"1501.04762","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1501.04762","created_at":"2026-05-18T02:29:02Z"},{"alias_kind":"arxiv_version","alias_value":"1501.04762v1","created_at":"2026-05-18T02:29:02Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1501.04762","created_at":"2026-05-18T02:29:02Z"},{"alias_kind":"pith_short_12","alias_value":"M3HJRNPI2LUM","created_at":"2026-05-18T12:29:29Z"},{"alias_kind":"pith_short_16","alias_value":"M3HJRNPI2LUM4QBC","created_at":"2026-05-18T12:29:29Z"},{"alias_kind":"pith_short_8","alias_value":"M3HJRNPI","created_at":"2026-05-18T12:29:29Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:M3HJRNPI2LUM4QBCUKWJ3QHOZ5","target":"record","payload":{"canonical_record":{"source":{"id":"1501.04762","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-01-20T11:15:29Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"e489102dcbc1aee5e384f99e029affd2e41e085bb1a1f77f75087760033b753b","abstract_canon_sha256":"ae5e677f233c72f30e67def064b313e5fdf1b8c0973a8aebd86c5513a87cf193"},"schema_version":"1.0"},"canonical_sha256":"66ce98b5e8d2e8ce4022a2ac9dc0eecf5aaca70ab091c63759acade6aa4c2cda","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:29:02.891252Z","signature_b64":"YpFiYXbImXdO7a6hq1txM31ZV9Bf52bt0FO6z8GvbF1TZRNiAU/ncThX6ejXTpB/PJHf867QEH63RC0M0msTAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"66ce98b5e8d2e8ce4022a2ac9dc0eecf5aaca70ab091c63759acade6aa4c2cda","last_reissued_at":"2026-05-18T02:29:02.890790Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:29:02.890790Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1501.04762","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-18T02:29:02Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"e6qx8cUJJRO0aVvl8lO2l8J5LcvablPvamTz+VLLRRm9l8z0oySiY0AK3jg/Nv4YnKJdaJfTNUGWxM2Ai0M+Dg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-18T22:22:19.428791Z"},"content_sha256":"92881e32a3cae52701b95c6c8fe7b463a97f6d74ee1b06250175a42ced48a4d2","schema_version":"1.0","event_id":"sha256:92881e32a3cae52701b95c6c8fe7b463a97f6d74ee1b06250175a42ced48a4d2"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:M3HJRNPI2LUM4QBCUKWJ3QHOZ5","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Computationally Efficient Sparse Bayesian Learning via Generalized Approximate Message Passing","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Fuwei Li, Hongbin Li, Huiping Duan, Jun Fang, Zhi Chen","submitted_at":"2015-01-20T11:15:29Z","abstract_excerpt":"The sparse Beyesian learning (also referred to as Bayesian compressed sensing) algorithm is one of the most popular approaches for sparse signal recovery, and has demonstrated superior performance in a series of experiments. Nevertheless, the sparse Bayesian learning algorithm has computational complexity that grows exponentially with the dimension of the signal, which hinders its application to many practical problems even with moderately large data sets. To address this issue, in this paper, we propose a computationally efficient sparse Bayesian learning method via the generalized approximat"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1501.04762","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-18T02:29:02Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"3tL1tPS1qjM/gMLS6fLspPdMmXlKBhn+dEVKjmOhsP/mGL0KplINf1DtnCov4ve+u1AEMV3izvTHz4UQIGZpDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-18T22:22:19.429309Z"},"content_sha256":"552dab5119c1aa29196a496a497c0e8250d362c2e56008d992dbdc33fe618c87","schema_version":"1.0","event_id":"sha256:552dab5119c1aa29196a496a497c0e8250d362c2e56008d992dbdc33fe618c87"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/M3HJRNPI2LUM4QBCUKWJ3QHOZ5/bundle.json","state_url":"https://pith.science/pith/M3HJRNPI2LUM4QBCUKWJ3QHOZ5/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/M3HJRNPI2LUM4QBCUKWJ3QHOZ5/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-18T22:22:19Z","links":{"resolver":"https://pith.science/pith/M3HJRNPI2LUM4QBCUKWJ3QHOZ5","bundle":"https://pith.science/pith/M3HJRNPI2LUM4QBCUKWJ3QHOZ5/bundle.json","state":"https://pith.science/pith/M3HJRNPI2LUM4QBCUKWJ3QHOZ5/state.json","well_known_bundle":"https://pith.science/.well-known/pith/M3HJRNPI2LUM4QBCUKWJ3QHOZ5/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:M3HJRNPI2LUM4QBCUKWJ3QHOZ5","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":"ae5e677f233c72f30e67def064b313e5fdf1b8c0973a8aebd86c5513a87cf193","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-01-20T11:15:29Z","title_canon_sha256":"e489102dcbc1aee5e384f99e029affd2e41e085bb1a1f77f75087760033b753b"},"schema_version":"1.0","source":{"id":"1501.04762","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1501.04762","created_at":"2026-05-18T02:29:02Z"},{"alias_kind":"arxiv_version","alias_value":"1501.04762v1","created_at":"2026-05-18T02:29:02Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1501.04762","created_at":"2026-05-18T02:29:02Z"},{"alias_kind":"pith_short_12","alias_value":"M3HJRNPI2LUM","created_at":"2026-05-18T12:29:29Z"},{"alias_kind":"pith_short_16","alias_value":"M3HJRNPI2LUM4QBC","created_at":"2026-05-18T12:29:29Z"},{"alias_kind":"pith_short_8","alias_value":"M3HJRNPI","created_at":"2026-05-18T12:29:29Z"}],"graph_snapshots":[{"event_id":"sha256:552dab5119c1aa29196a496a497c0e8250d362c2e56008d992dbdc33fe618c87","target":"graph","created_at":"2026-05-18T02:29:02Z","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":"The sparse Beyesian learning (also referred to as Bayesian compressed sensing) algorithm is one of the most popular approaches for sparse signal recovery, and has demonstrated superior performance in a series of experiments. Nevertheless, the sparse Bayesian learning algorithm has computational complexity that grows exponentially with the dimension of the signal, which hinders its application to many practical problems even with moderately large data sets. To address this issue, in this paper, we propose a computationally efficient sparse Bayesian learning method via the generalized approximat","authors_text":"Fuwei Li, Hongbin Li, Huiping Duan, Jun Fang, Zhi Chen","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-01-20T11:15:29Z","title":"Computationally Efficient Sparse Bayesian Learning via Generalized Approximate Message Passing"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1501.04762","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:92881e32a3cae52701b95c6c8fe7b463a97f6d74ee1b06250175a42ced48a4d2","target":"record","created_at":"2026-05-18T02:29:02Z","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":"ae5e677f233c72f30e67def064b313e5fdf1b8c0973a8aebd86c5513a87cf193","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-01-20T11:15:29Z","title_canon_sha256":"e489102dcbc1aee5e384f99e029affd2e41e085bb1a1f77f75087760033b753b"},"schema_version":"1.0","source":{"id":"1501.04762","kind":"arxiv","version":1}},"canonical_sha256":"66ce98b5e8d2e8ce4022a2ac9dc0eecf5aaca70ab091c63759acade6aa4c2cda","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"66ce98b5e8d2e8ce4022a2ac9dc0eecf5aaca70ab091c63759acade6aa4c2cda","first_computed_at":"2026-05-18T02:29:02.890790Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:29:02.890790Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"YpFiYXbImXdO7a6hq1txM31ZV9Bf52bt0FO6z8GvbF1TZRNiAU/ncThX6ejXTpB/PJHf867QEH63RC0M0msTAA==","signature_status":"signed_v1","signed_at":"2026-05-18T02:29:02.891252Z","signed_message":"canonical_sha256_bytes"},"source_id":"1501.04762","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:92881e32a3cae52701b95c6c8fe7b463a97f6d74ee1b06250175a42ced48a4d2","sha256:552dab5119c1aa29196a496a497c0e8250d362c2e56008d992dbdc33fe618c87"],"state_sha256":"879586662a5cd869e612ad68bb79c0c93daa35553d9b9389e682aa77dd91ba77"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"K17+2Yu6ia3nsKkdBqXKiIqLvUW716ubREHaUe9ZCkseUIn2mh8EfGMydp/FDMqY2v4ucySb0eTRHzSG8nR6Aw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-18T22:22:19.431100Z","bundle_sha256":"01186e3da5cef49b8562fd0d4d8896a8466f4134b75687f4d10160e251f400bd"}}