{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2010:N3Q2H5QZUT3EMDPEPCCWVGTM27","short_pith_number":"pith:N3Q2H5QZ","canonical_record":{"source":{"id":"1009.4287","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2010-09-22T08:15:41Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"28f2bd4a7db4ab9e2e875b57b7e1400063412ace11195493d2eeee5f474cdbdb","abstract_canon_sha256":"d6cf74e962d79ac354bdb000beec4ff88be74dbeea25db90fca25ea3f2f0da6e"},"schema_version":"1.0"},"canonical_sha256":"6ee1a3f619a4f6460de478856a9a6cd7cb66c8ea5683e3d9cceaefcdca3ec164","source":{"kind":"arxiv","id":"1009.4287","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1009.4287","created_at":"2026-05-18T04:05:16Z"},{"alias_kind":"arxiv_version","alias_value":"1009.4287v3","created_at":"2026-05-18T04:05:16Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1009.4287","created_at":"2026-05-18T04:05:16Z"},{"alias_kind":"pith_short_12","alias_value":"N3Q2H5QZUT3E","created_at":"2026-05-18T12:26:10Z"},{"alias_kind":"pith_short_16","alias_value":"N3Q2H5QZUT3EMDPE","created_at":"2026-05-18T12:26:10Z"},{"alias_kind":"pith_short_8","alias_value":"N3Q2H5QZ","created_at":"2026-05-18T12:26:10Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2010:N3Q2H5QZUT3EMDPEPCCWVGTM27","target":"record","payload":{"canonical_record":{"source":{"id":"1009.4287","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2010-09-22T08:15:41Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"28f2bd4a7db4ab9e2e875b57b7e1400063412ace11195493d2eeee5f474cdbdb","abstract_canon_sha256":"d6cf74e962d79ac354bdb000beec4ff88be74dbeea25db90fca25ea3f2f0da6e"},"schema_version":"1.0"},"canonical_sha256":"6ee1a3f619a4f6460de478856a9a6cd7cb66c8ea5683e3d9cceaefcdca3ec164","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:05:16.578126Z","signature_b64":"3/zjEnko+Tq5eJeGP4LmQybbjq2ZzAUKEQxhrgm2ICJYHwIWL93EqondpDG75pgrnGhSy5SWL6yumqJgnX1zAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6ee1a3f619a4f6460de478856a9a6cd7cb66c8ea5683e3d9cceaefcdca3ec164","last_reissued_at":"2026-05-18T04:05:16.576737Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:05:16.576737Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1009.4287","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-18T04:05:16Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"estICITDnswTFiToYznOklYWw5IOe8ZbSg+bHUYNH7fyv0rCTpjRj5Nb/0PjLMMVUN1bWpdabl90sUfXODr+CQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T03:48:12.019537Z"},"content_sha256":"af286a95c7c58c8210db131675b9b6443a5cc82e9a1a93e6a041155dedc056cd","schema_version":"1.0","event_id":"sha256:af286a95c7c58c8210db131675b9b6443a5cc82e9a1a93e6a041155dedc056cd"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2010:N3Q2H5QZUT3EMDPEPCCWVGTM27","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Tree-Structure Expectation Propagation for LDPC Decoding in Erasure Channels","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":"2010-09-22T08:15:41Z","abstract_excerpt":"In this paper we present a new algorithm, denoted as TEP, to decode low-density parity-check (LDPC) codes over the Binary Erasure Channel (BEC). The TEP decoder is derived applying the expectation propagation (EP) algorithm with a tree- structured approximation. Expectation Propagation (EP) 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 constraints in some c"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1009.4287","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-18T04:05:16Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"fElCgjdy/0M7YcXeUU1rz4YgLtQgUOcvdPEq8cFUoNRhDJg6kejTXQkFAYKBxSSrY0rH7MwSLlPPbRiB9hSUAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T03:48:12.019915Z"},"content_sha256":"999e9ad49b2954ca43cea86f213aef7c230f2d7cd76979c858212583c891c388","schema_version":"1.0","event_id":"sha256:999e9ad49b2954ca43cea86f213aef7c230f2d7cd76979c858212583c891c388"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/N3Q2H5QZUT3EMDPEPCCWVGTM27/bundle.json","state_url":"https://pith.science/pith/N3Q2H5QZUT3EMDPEPCCWVGTM27/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/N3Q2H5QZUT3EMDPEPCCWVGTM27/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-30T03:48:12Z","links":{"resolver":"https://pith.science/pith/N3Q2H5QZUT3EMDPEPCCWVGTM27","bundle":"https://pith.science/pith/N3Q2H5QZUT3EMDPEPCCWVGTM27/bundle.json","state":"https://pith.science/pith/N3Q2H5QZUT3EMDPEPCCWVGTM27/state.json","well_known_bundle":"https://pith.science/.well-known/pith/N3Q2H5QZUT3EMDPEPCCWVGTM27/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2010:N3Q2H5QZUT3EMDPEPCCWVGTM27","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":"d6cf74e962d79ac354bdb000beec4ff88be74dbeea25db90fca25ea3f2f0da6e","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2010-09-22T08:15:41Z","title_canon_sha256":"28f2bd4a7db4ab9e2e875b57b7e1400063412ace11195493d2eeee5f474cdbdb"},"schema_version":"1.0","source":{"id":"1009.4287","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1009.4287","created_at":"2026-05-18T04:05:16Z"},{"alias_kind":"arxiv_version","alias_value":"1009.4287v3","created_at":"2026-05-18T04:05:16Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1009.4287","created_at":"2026-05-18T04:05:16Z"},{"alias_kind":"pith_short_12","alias_value":"N3Q2H5QZUT3E","created_at":"2026-05-18T12:26:10Z"},{"alias_kind":"pith_short_16","alias_value":"N3Q2H5QZUT3EMDPE","created_at":"2026-05-18T12:26:10Z"},{"alias_kind":"pith_short_8","alias_value":"N3Q2H5QZ","created_at":"2026-05-18T12:26:10Z"}],"graph_snapshots":[{"event_id":"sha256:999e9ad49b2954ca43cea86f213aef7c230f2d7cd76979c858212583c891c388","target":"graph","created_at":"2026-05-18T04:05:16Z","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":"In this paper we present a new algorithm, denoted as TEP, to decode low-density parity-check (LDPC) codes over the Binary Erasure Channel (BEC). The TEP decoder is derived applying the expectation propagation (EP) algorithm with a tree- structured approximation. Expectation Propagation (EP) 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 constraints in some c","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":"2010-09-22T08:15:41Z","title":"Tree-Structure Expectation Propagation for LDPC Decoding in Erasure Channels"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1009.4287","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:af286a95c7c58c8210db131675b9b6443a5cc82e9a1a93e6a041155dedc056cd","target":"record","created_at":"2026-05-18T04:05:16Z","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":"d6cf74e962d79ac354bdb000beec4ff88be74dbeea25db90fca25ea3f2f0da6e","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2010-09-22T08:15:41Z","title_canon_sha256":"28f2bd4a7db4ab9e2e875b57b7e1400063412ace11195493d2eeee5f474cdbdb"},"schema_version":"1.0","source":{"id":"1009.4287","kind":"arxiv","version":3}},"canonical_sha256":"6ee1a3f619a4f6460de478856a9a6cd7cb66c8ea5683e3d9cceaefcdca3ec164","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"6ee1a3f619a4f6460de478856a9a6cd7cb66c8ea5683e3d9cceaefcdca3ec164","first_computed_at":"2026-05-18T04:05:16.576737Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:05:16.576737Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"3/zjEnko+Tq5eJeGP4LmQybbjq2ZzAUKEQxhrgm2ICJYHwIWL93EqondpDG75pgrnGhSy5SWL6yumqJgnX1zAQ==","signature_status":"signed_v1","signed_at":"2026-05-18T04:05:16.578126Z","signed_message":"canonical_sha256_bytes"},"source_id":"1009.4287","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:af286a95c7c58c8210db131675b9b6443a5cc82e9a1a93e6a041155dedc056cd","sha256:999e9ad49b2954ca43cea86f213aef7c230f2d7cd76979c858212583c891c388"],"state_sha256":"097ce0f3655cf895a20d44ac748b6949ae38b03e9d643c108ab655380bbc4f40"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"16xpJxpJPxf3Tp326OJKbAk2LJy6hLxSA8Aes2VEXAIJPOj1dbMkERdBjDPiD3sK1CtsB5keXQ0ts+B8uIY6Bw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-30T03:48:12.021985Z","bundle_sha256":"c79cd82befe5d94107bc3231f695634828be2de591d35b1697b25c88fa12e81a"}}