{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2010:R3DQXFX4NC6RC7OYH5ENQKCHUN","short_pith_number":"pith:R3DQXFX4","schema_version":"1.0","canonical_sha256":"8ec70b96fc68bd117dd83f48d82847a372250ca951c2dea53edd6566a3bf91f8","source":{"kind":"arxiv","id":"1006.1535","version":1},"attestation_state":"computed","paper":{"title":"Tree-structure Expectation Propagation for Decoding LDPC codes over Binary Erasure Channels","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Juan Jos\\'e Murillo-Fuentes, Pablo M. Olmos","submitted_at":"2010-06-08T11:38:02Z","abstract_excerpt":"Expectation Propagation is a generalization to Belief Propagation (BP) in two ways. First, it can be used with any exponential family distribution over the cliques in the graph. Second, it can impose additional constraints on the marginal distributions. We use this second property to impose pair-wise marginal distribution constraints in some check nodes of the LDPC Tanner graph. These additional constraints allow decoding the received codeword when the BP decoder gets stuck. In this paper, we first present the new decoding algorithm, whose complexity is identical to the BP decoder, and we then"},"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":"1006.1535","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2010-06-08T11:38:02Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"b5ef196b1eec0931c199319553fc6abbc59a16e5a1c79ffa71e3a0606a9a704e","abstract_canon_sha256":"05fba31a8bb58ec1f9d6541688e5a1c267e60dcb4ae04b24542fb082e03ae039"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:40:33.994742Z","signature_b64":"1lr8ghAhTqnQBtFUe16WWBvWQMNPE+mAYPSZyugHJV9jPjdjE6BDIBKDuhsLElLjRyvGKIN/QVanLPrHDEHeAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8ec70b96fc68bd117dd83f48d82847a372250ca951c2dea53edd6566a3bf91f8","last_reissued_at":"2026-05-18T04:40:33.994068Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:40:33.994068Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Tree-structure Expectation Propagation for Decoding LDPC codes over Binary Erasure Channels","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Juan Jos\\'e Murillo-Fuentes, Pablo M. Olmos","submitted_at":"2010-06-08T11:38:02Z","abstract_excerpt":"Expectation Propagation is a generalization to Belief Propagation (BP) in two ways. First, it can be used with any exponential family distribution over the cliques in the graph. Second, it can impose additional constraints on the marginal distributions. We use this second property to impose pair-wise marginal distribution constraints in some check nodes of the LDPC Tanner graph. These additional constraints allow decoding the received codeword when the BP decoder gets stuck. In this paper, we first present the new decoding algorithm, whose complexity is identical to the BP decoder, and we then"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1006.1535","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":"1006.1535","created_at":"2026-05-18T04:40:33.994165+00:00"},{"alias_kind":"arxiv_version","alias_value":"1006.1535v1","created_at":"2026-05-18T04:40:33.994165+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1006.1535","created_at":"2026-05-18T04:40:33.994165+00:00"},{"alias_kind":"pith_short_12","alias_value":"R3DQXFX4NC6R","created_at":"2026-05-18T12:26:13.927090+00:00"},{"alias_kind":"pith_short_16","alias_value":"R3DQXFX4NC6RC7OY","created_at":"2026-05-18T12:26:13.927090+00:00"},{"alias_kind":"pith_short_8","alias_value":"R3DQXFX4","created_at":"2026-05-18T12:26:13.927090+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/R3DQXFX4NC6RC7OYH5ENQKCHUN","json":"https://pith.science/pith/R3DQXFX4NC6RC7OYH5ENQKCHUN.json","graph_json":"https://pith.science/api/pith-number/R3DQXFX4NC6RC7OYH5ENQKCHUN/graph.json","events_json":"https://pith.science/api/pith-number/R3DQXFX4NC6RC7OYH5ENQKCHUN/events.json","paper":"https://pith.science/paper/R3DQXFX4"},"agent_actions":{"view_html":"https://pith.science/pith/R3DQXFX4NC6RC7OYH5ENQKCHUN","download_json":"https://pith.science/pith/R3DQXFX4NC6RC7OYH5ENQKCHUN.json","view_paper":"https://pith.science/paper/R3DQXFX4","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1006.1535&json=true","fetch_graph":"https://pith.science/api/pith-number/R3DQXFX4NC6RC7OYH5ENQKCHUN/graph.json","fetch_events":"https://pith.science/api/pith-number/R3DQXFX4NC6RC7OYH5ENQKCHUN/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/R3DQXFX4NC6RC7OYH5ENQKCHUN/action/timestamp_anchor","attest_storage":"https://pith.science/pith/R3DQXFX4NC6RC7OYH5ENQKCHUN/action/storage_attestation","attest_author":"https://pith.science/pith/R3DQXFX4NC6RC7OYH5ENQKCHUN/action/author_attestation","sign_citation":"https://pith.science/pith/R3DQXFX4NC6RC7OYH5ENQKCHUN/action/citation_signature","submit_replication":"https://pith.science/pith/R3DQXFX4NC6RC7OYH5ENQKCHUN/action/replication_record"}},"created_at":"2026-05-18T04:40:33.994165+00:00","updated_at":"2026-05-18T04:40:33.994165+00:00"}