{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:6L7W5QI5EPIMQCL7UGVF2RUL6W","short_pith_number":"pith:6L7W5QI5","schema_version":"1.0","canonical_sha256":"f2ff6ec11d23d0c8097fa1aa5d468bf5baa2381a08499fc80e73e60226dfbaca","source":{"kind":"arxiv","id":"1602.07762","version":1},"attestation_state":"computed","paper":{"title":"Low Complexity Sparse Bayesian Learning Using Combined BP and MF with a Stretched Factor Graph","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Chuanzong Zhang, Qinghua Guo, Zhengdao Yuan, Zhongyong Wang","submitted_at":"2016-02-25T01:13:17Z","abstract_excerpt":"This paper concerns message passing based approaches to sparse Bayesian learning (SBL) with a linear model corrupted by additive white Gaussian noise with unknown variance. With the conventional factor graph, mean field (MF) message passing based algorithms have been proposed in the literature. In this work, instead of using the conventional factor graph, we modify the factor graph by adding some extra hard constraints (the graph looks like being `stretched'), which enables the use of combined belief propagation (BP) and MF message passing. We then propose a low complexity BP-MF SBL algorithm "},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"1602.07762","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-02-25T01:13:17Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"62c0a196928dd3a5ffd34faa943b238571ff9271aa5d8514299daac4aad06903","abstract_canon_sha256":"f7f75d047b8c250168f89c0dcdcf493aa83ec73c58a316b29619a7e8e9314852"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:05:43.890940Z","signature_b64":"ZFHZfPop6heoN/sx6OXERK5KL5ncieOtjLEF8KsXq49k6HrIZUZwm39q83YFHRlbiOHYmrh3XYgWlJpqln7ICg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f2ff6ec11d23d0c8097fa1aa5d468bf5baa2381a08499fc80e73e60226dfbaca","last_reissued_at":"2026-05-18T01:05:43.890535Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:05:43.890535Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Low Complexity Sparse Bayesian Learning Using Combined BP and MF with a Stretched Factor Graph","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Chuanzong Zhang, Qinghua Guo, Zhengdao Yuan, Zhongyong Wang","submitted_at":"2016-02-25T01:13:17Z","abstract_excerpt":"This paper concerns message passing based approaches to sparse Bayesian learning (SBL) with a linear model corrupted by additive white Gaussian noise with unknown variance. With the conventional factor graph, mean field (MF) message passing based algorithms have been proposed in the literature. In this work, instead of using the conventional factor graph, we modify the factor graph by adding some extra hard constraints (the graph looks like being `stretched'), which enables the use of combined belief propagation (BP) and MF message passing. We then propose a low complexity BP-MF SBL algorithm "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1602.07762","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1602.07762","created_at":"2026-05-18T01:05:43.890596+00:00"},{"alias_kind":"arxiv_version","alias_value":"1602.07762v1","created_at":"2026-05-18T01:05:43.890596+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1602.07762","created_at":"2026-05-18T01:05:43.890596+00:00"},{"alias_kind":"pith_short_12","alias_value":"6L7W5QI5EPIM","created_at":"2026-05-18T12:30:01.593930+00:00"},{"alias_kind":"pith_short_16","alias_value":"6L7W5QI5EPIMQCL7","created_at":"2026-05-18T12:30:01.593930+00:00"},{"alias_kind":"pith_short_8","alias_value":"6L7W5QI5","created_at":"2026-05-18T12:30:01.593930+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/6L7W5QI5EPIMQCL7UGVF2RUL6W","json":"https://pith.science/pith/6L7W5QI5EPIMQCL7UGVF2RUL6W.json","graph_json":"https://pith.science/api/pith-number/6L7W5QI5EPIMQCL7UGVF2RUL6W/graph.json","events_json":"https://pith.science/api/pith-number/6L7W5QI5EPIMQCL7UGVF2RUL6W/events.json","paper":"https://pith.science/paper/6L7W5QI5"},"agent_actions":{"view_html":"https://pith.science/pith/6L7W5QI5EPIMQCL7UGVF2RUL6W","download_json":"https://pith.science/pith/6L7W5QI5EPIMQCL7UGVF2RUL6W.json","view_paper":"https://pith.science/paper/6L7W5QI5","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1602.07762&json=true","fetch_graph":"https://pith.science/api/pith-number/6L7W5QI5EPIMQCL7UGVF2RUL6W/graph.json","fetch_events":"https://pith.science/api/pith-number/6L7W5QI5EPIMQCL7UGVF2RUL6W/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/6L7W5QI5EPIMQCL7UGVF2RUL6W/action/timestamp_anchor","attest_storage":"https://pith.science/pith/6L7W5QI5EPIMQCL7UGVF2RUL6W/action/storage_attestation","attest_author":"https://pith.science/pith/6L7W5QI5EPIMQCL7UGVF2RUL6W/action/author_attestation","sign_citation":"https://pith.science/pith/6L7W5QI5EPIMQCL7UGVF2RUL6W/action/citation_signature","submit_replication":"https://pith.science/pith/6L7W5QI5EPIMQCL7UGVF2RUL6W/action/replication_record"}},"created_at":"2026-05-18T01:05:43.890596+00:00","updated_at":"2026-05-18T01:05:43.890596+00:00"}