{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2012:D3EC43J2NULY5ZMFMJK5KIDJXL","short_pith_number":"pith:D3EC43J2","schema_version":"1.0","canonical_sha256":"1ec82e6d3a6d178ee5856255d52069bad1154f85862d2c3a75fee1c4aeaf8f6f","source":{"kind":"arxiv","id":"1202.1467","version":2},"attestation_state":"computed","paper":{"title":"Message-Passing Algorithms for Channel Estimation and Decoding Using Approximate Inference","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT","stat.ML"],"primary_cat":"cs.IT","authors_text":"Bernard Henri Fleury, Carles Navarro Manch\\'on, Erwin Riegler, Gunvor Elisabeth Kirkelund, Mihai-Alin Badiu","submitted_at":"2012-02-07T17:14:46Z","abstract_excerpt":"We design iterative receiver schemes for a generic wireless communication system by treating channel estimation and information decoding as an inference problem in graphical models. We introduce a recently proposed inference framework that combines belief propagation (BP) and the mean field (MF) approximation and includes these algorithms as special cases. We also show that the expectation propagation and expectation maximization algorithms can be embedded in the BP-MF framework with slight modifications. By applying the considered inference algorithms to our probabilistic model, we derive fou"},"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":"1202.1467","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2012-02-07T17:14:46Z","cross_cats_sorted":["math.IT","stat.ML"],"title_canon_sha256":"2e8ab900b0538ca51a56f3ae02cb4281adb32a0d94d7a949c85a732cf925a849","abstract_canon_sha256":"2649c6c3e98e8e42db02443e3c58d60a7c89354a574ba1c2e8b96363d8482090"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:59:09.855457Z","signature_b64":"M8Zz1gsk+7l0DOKa94FOB1eP88Re1iYz/bFwWX6sY80Qb/2a31eH6HDSry/C2gX6BKrweHOD+/MR1AcBkdjaBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1ec82e6d3a6d178ee5856255d52069bad1154f85862d2c3a75fee1c4aeaf8f6f","last_reissued_at":"2026-05-18T00:59:09.854668Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:59:09.854668Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Message-Passing Algorithms for Channel Estimation and Decoding Using Approximate Inference","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT","stat.ML"],"primary_cat":"cs.IT","authors_text":"Bernard Henri Fleury, Carles Navarro Manch\\'on, Erwin Riegler, Gunvor Elisabeth Kirkelund, Mihai-Alin Badiu","submitted_at":"2012-02-07T17:14:46Z","abstract_excerpt":"We design iterative receiver schemes for a generic wireless communication system by treating channel estimation and information decoding as an inference problem in graphical models. We introduce a recently proposed inference framework that combines belief propagation (BP) and the mean field (MF) approximation and includes these algorithms as special cases. We also show that the expectation propagation and expectation maximization algorithms can be embedded in the BP-MF framework with slight modifications. By applying the considered inference algorithms to our probabilistic model, we derive fou"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1202.1467","kind":"arxiv","version":2},"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":"1202.1467","created_at":"2026-05-18T00:59:09.854801+00:00"},{"alias_kind":"arxiv_version","alias_value":"1202.1467v2","created_at":"2026-05-18T00:59:09.854801+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1202.1467","created_at":"2026-05-18T00:59:09.854801+00:00"},{"alias_kind":"pith_short_12","alias_value":"D3EC43J2NULY","created_at":"2026-05-18T12:27:01.376967+00:00"},{"alias_kind":"pith_short_16","alias_value":"D3EC43J2NULY5ZMF","created_at":"2026-05-18T12:27:01.376967+00:00"},{"alias_kind":"pith_short_8","alias_value":"D3EC43J2","created_at":"2026-05-18T12:27:01.376967+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/D3EC43J2NULY5ZMFMJK5KIDJXL","json":"https://pith.science/pith/D3EC43J2NULY5ZMFMJK5KIDJXL.json","graph_json":"https://pith.science/api/pith-number/D3EC43J2NULY5ZMFMJK5KIDJXL/graph.json","events_json":"https://pith.science/api/pith-number/D3EC43J2NULY5ZMFMJK5KIDJXL/events.json","paper":"https://pith.science/paper/D3EC43J2"},"agent_actions":{"view_html":"https://pith.science/pith/D3EC43J2NULY5ZMFMJK5KIDJXL","download_json":"https://pith.science/pith/D3EC43J2NULY5ZMFMJK5KIDJXL.json","view_paper":"https://pith.science/paper/D3EC43J2","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1202.1467&json=true","fetch_graph":"https://pith.science/api/pith-number/D3EC43J2NULY5ZMFMJK5KIDJXL/graph.json","fetch_events":"https://pith.science/api/pith-number/D3EC43J2NULY5ZMFMJK5KIDJXL/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/D3EC43J2NULY5ZMFMJK5KIDJXL/action/timestamp_anchor","attest_storage":"https://pith.science/pith/D3EC43J2NULY5ZMFMJK5KIDJXL/action/storage_attestation","attest_author":"https://pith.science/pith/D3EC43J2NULY5ZMFMJK5KIDJXL/action/author_attestation","sign_citation":"https://pith.science/pith/D3EC43J2NULY5ZMFMJK5KIDJXL/action/citation_signature","submit_replication":"https://pith.science/pith/D3EC43J2NULY5ZMFMJK5KIDJXL/action/replication_record"}},"created_at":"2026-05-18T00:59:09.854801+00:00","updated_at":"2026-05-18T00:59:09.854801+00:00"}