{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:NELZRHNJQO6HYQX3GYQ6JFOJS3","short_pith_number":"pith:NELZRHNJ","canonical_record":{"source":{"id":"1201.0715","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2012-01-03T18:05:16Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"e5c9931aad48684f63d80f9da07a4d75c6c1fac33877f2e5d395a4db9c5c0bfe","abstract_canon_sha256":"52c0c41c5e11fa233c53663eb73599d5673ca27f86d8d7c1c910345c29bd2339"},"schema_version":"1.0"},"canonical_sha256":"6917989da983bc7c42fb3621e495c996ec7faff79dd74b1df9a81221e8ea732c","source":{"kind":"arxiv","id":"1201.0715","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1201.0715","created_at":"2026-05-18T02:21:26Z"},{"alias_kind":"arxiv_version","alias_value":"1201.0715v3","created_at":"2026-05-18T02:21:26Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1201.0715","created_at":"2026-05-18T02:21:26Z"},{"alias_kind":"pith_short_12","alias_value":"NELZRHNJQO6H","created_at":"2026-05-18T12:27:16Z"},{"alias_kind":"pith_short_16","alias_value":"NELZRHNJQO6HYQX3","created_at":"2026-05-18T12:27:16Z"},{"alias_kind":"pith_short_8","alias_value":"NELZRHNJ","created_at":"2026-05-18T12:27:16Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:NELZRHNJQO6HYQX3GYQ6JFOJS3","target":"record","payload":{"canonical_record":{"source":{"id":"1201.0715","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2012-01-03T18:05:16Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"e5c9931aad48684f63d80f9da07a4d75c6c1fac33877f2e5d395a4db9c5c0bfe","abstract_canon_sha256":"52c0c41c5e11fa233c53663eb73599d5673ca27f86d8d7c1c910345c29bd2339"},"schema_version":"1.0"},"canonical_sha256":"6917989da983bc7c42fb3621e495c996ec7faff79dd74b1df9a81221e8ea732c","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:21:26.770566Z","signature_b64":"vR5YW6w0ggzOtjW0ei436+/BVj/515mmwzpd2UnkbU332oyoGwZK71snBx6oYr+VgCuGQC3lAcrsMXM7m5tLAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6917989da983bc7c42fb3621e495c996ec7faff79dd74b1df9a81221e8ea732c","last_reissued_at":"2026-05-18T02:21:26.769863Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:21:26.769863Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1201.0715","source_version":3,"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:21:26Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"iKLLjU24KOGxk3Ai9gh4a1+udUpBLna+7iLmrROYajrwJWdHwVnaQSm0er0rvI+0g/jm/foIu76iU5U91h9rDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-10T18:08:44.955026Z"},"content_sha256":"b7ce6b8542bc2a5d2ca4bad48ff8be11b2545c60840f890eb2b4095402fbcda5","schema_version":"1.0","event_id":"sha256:b7ce6b8542bc2a5d2ca4bad48ff8be11b2545c60840f890eb2b4095402fbcda5"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:NELZRHNJQO6HYQX3GYQ6JFOJS3","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Tree-Structure Expectation Propagation for LDPC Decoding over the BEC","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Fernando P\\'erez-Cruz, Juan Jos\\'e Murillo-Fuentes, Pablo M. Olmos","submitted_at":"2012-01-03T18:05:16Z","abstract_excerpt":"We present the tree-structure expectation propagation (Tree-EP) algorithm to decode low-density parity-check (LDPC) codes over discrete memoryless channels (DMCs). EP generalizes 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 constraints over pairs of variables connected to a check node of the LDPC code's Tanner graph. Thanks to these additional constraints, the Tree-EP marginal e"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1201.0715","kind":"arxiv","version":3},"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:21:26Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"akfrgNpzes2MlULOFPeQiITZK6z3f1LJm7HIEGBOtn1IM48MFE5MtssENiKMWOy/xtvw9Yo+X/6eKto/JOJPDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-10T18:08:44.955423Z"},"content_sha256":"1899e4e51601ac9efa3feb02f07bec18347a3d2cfa50f739651a096dfc4ef793","schema_version":"1.0","event_id":"sha256:1899e4e51601ac9efa3feb02f07bec18347a3d2cfa50f739651a096dfc4ef793"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/NELZRHNJQO6HYQX3GYQ6JFOJS3/bundle.json","state_url":"https://pith.science/pith/NELZRHNJQO6HYQX3GYQ6JFOJS3/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/NELZRHNJQO6HYQX3GYQ6JFOJS3/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-10T18:08:44Z","links":{"resolver":"https://pith.science/pith/NELZRHNJQO6HYQX3GYQ6JFOJS3","bundle":"https://pith.science/pith/NELZRHNJQO6HYQX3GYQ6JFOJS3/bundle.json","state":"https://pith.science/pith/NELZRHNJQO6HYQX3GYQ6JFOJS3/state.json","well_known_bundle":"https://pith.science/.well-known/pith/NELZRHNJQO6HYQX3GYQ6JFOJS3/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:NELZRHNJQO6HYQX3GYQ6JFOJS3","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":"52c0c41c5e11fa233c53663eb73599d5673ca27f86d8d7c1c910345c29bd2339","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2012-01-03T18:05:16Z","title_canon_sha256":"e5c9931aad48684f63d80f9da07a4d75c6c1fac33877f2e5d395a4db9c5c0bfe"},"schema_version":"1.0","source":{"id":"1201.0715","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1201.0715","created_at":"2026-05-18T02:21:26Z"},{"alias_kind":"arxiv_version","alias_value":"1201.0715v3","created_at":"2026-05-18T02:21:26Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1201.0715","created_at":"2026-05-18T02:21:26Z"},{"alias_kind":"pith_short_12","alias_value":"NELZRHNJQO6H","created_at":"2026-05-18T12:27:16Z"},{"alias_kind":"pith_short_16","alias_value":"NELZRHNJQO6HYQX3","created_at":"2026-05-18T12:27:16Z"},{"alias_kind":"pith_short_8","alias_value":"NELZRHNJ","created_at":"2026-05-18T12:27:16Z"}],"graph_snapshots":[{"event_id":"sha256:1899e4e51601ac9efa3feb02f07bec18347a3d2cfa50f739651a096dfc4ef793","target":"graph","created_at":"2026-05-18T02:21:26Z","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":"We present the tree-structure expectation propagation (Tree-EP) algorithm to decode low-density parity-check (LDPC) codes over discrete memoryless channels (DMCs). EP generalizes 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 constraints over pairs of variables connected to a check node of the LDPC code's Tanner graph. Thanks to these additional constraints, the Tree-EP marginal e","authors_text":"Fernando P\\'erez-Cruz, Juan Jos\\'e Murillo-Fuentes, Pablo M. Olmos","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2012-01-03T18:05:16Z","title":"Tree-Structure Expectation Propagation for LDPC Decoding over the BEC"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1201.0715","kind":"arxiv","version":3},"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:b7ce6b8542bc2a5d2ca4bad48ff8be11b2545c60840f890eb2b4095402fbcda5","target":"record","created_at":"2026-05-18T02:21:26Z","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":"52c0c41c5e11fa233c53663eb73599d5673ca27f86d8d7c1c910345c29bd2339","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2012-01-03T18:05:16Z","title_canon_sha256":"e5c9931aad48684f63d80f9da07a4d75c6c1fac33877f2e5d395a4db9c5c0bfe"},"schema_version":"1.0","source":{"id":"1201.0715","kind":"arxiv","version":3}},"canonical_sha256":"6917989da983bc7c42fb3621e495c996ec7faff79dd74b1df9a81221e8ea732c","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"6917989da983bc7c42fb3621e495c996ec7faff79dd74b1df9a81221e8ea732c","first_computed_at":"2026-05-18T02:21:26.769863Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:21:26.769863Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"vR5YW6w0ggzOtjW0ei436+/BVj/515mmwzpd2UnkbU332oyoGwZK71snBx6oYr+VgCuGQC3lAcrsMXM7m5tLAw==","signature_status":"signed_v1","signed_at":"2026-05-18T02:21:26.770566Z","signed_message":"canonical_sha256_bytes"},"source_id":"1201.0715","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:b7ce6b8542bc2a5d2ca4bad48ff8be11b2545c60840f890eb2b4095402fbcda5","sha256:1899e4e51601ac9efa3feb02f07bec18347a3d2cfa50f739651a096dfc4ef793"],"state_sha256":"77717dd0ee3fe8476b86a9d0d4d9b20a67adb605abef1bf00bf941dc6d7fb715"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"CLYjwFYa4Zvl18pd10oQX5mrC4/UDYZv9I/glZCoMxXdCx5UyffHL/ZWqhqJlNqWMOwXCc0L57PVwFPScYAvBg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-10T18:08:44.957370Z","bundle_sha256":"5cd51cba02c1d1a9994e23d3f0aa79436d2bc0e106bdd653c1256dd2a03edc47"}}