{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2009:7RGKO6OY2LROGDAR2MLRNVRSD5","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":"2cffa205743aa6b40c5afe340a7866498f86a585f3b8ae50070009a01372b5ca","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2009-04-16T13:32:47Z","title_canon_sha256":"fea05f124c7b218b163d25abac8f356147589a38bd4c23afa77d146be2ea8996"},"schema_version":"1.0","source":{"id":"0904.2482","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"0904.2482","created_at":"2026-05-18T04:21:11Z"},{"alias_kind":"arxiv_version","alias_value":"0904.2482v1","created_at":"2026-05-18T04:21:11Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0904.2482","created_at":"2026-05-18T04:21:11Z"},{"alias_kind":"pith_short_12","alias_value":"7RGKO6OY2LRO","created_at":"2026-05-18T12:25:58Z"},{"alias_kind":"pith_short_16","alias_value":"7RGKO6OY2LROGDAR","created_at":"2026-05-18T12:25:58Z"},{"alias_kind":"pith_short_8","alias_value":"7RGKO6OY","created_at":"2026-05-18T12:25:58Z"}],"graph_snapshots":[{"event_id":"sha256:74558f94806ade015c6fb2919179778ce84a6d505afb1d09fdea777eddd94b8a","target":"graph","created_at":"2026-05-18T04:21:11Z","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 work, we give good concatenated code ensembles for the binary erasure channel (BEC). In particular, we consider repeat multiple-accumulate (RMA) code ensembles formed by the serial concatenation of a repetition code with multiple accumulators, and the hybrid concatenated code (HCC) ensembles recently introduced by Koller et al. (5th Int. Symp. on Turbo Codes & Rel. Topics, Lausanne, Switzerland) consisting of an outer multiple parallel concatenated code serially concatenated with an inner accumulator. We introduce stopping sets for iterative constituent code oriented decoding using max","authors_text":"Alexandre Graell i Amat, Eirik Rosnes","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2009-04-16T13:32:47Z","title":"Good Concatenated Code Ensembles for the Binary Erasure Channel"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"0904.2482","kind":"arxiv","version":1},"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:2a58c1d133eb46437ab4bb42d21c2a95730e1a561d9778d4c7d0f786476b94cc","target":"record","created_at":"2026-05-18T04:21:11Z","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":"2cffa205743aa6b40c5afe340a7866498f86a585f3b8ae50070009a01372b5ca","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2009-04-16T13:32:47Z","title_canon_sha256":"fea05f124c7b218b163d25abac8f356147589a38bd4c23afa77d146be2ea8996"},"schema_version":"1.0","source":{"id":"0904.2482","kind":"arxiv","version":1}},"canonical_sha256":"fc4ca779d8d2e2e30c11d31716d6321f6595e23b5da64f7aef09c5f2ed714fe1","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"fc4ca779d8d2e2e30c11d31716d6321f6595e23b5da64f7aef09c5f2ed714fe1","first_computed_at":"2026-05-18T04:21:11.064964Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:21:11.064964Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"CmDWhBtVrB3pfdE2uWFbENxb7ZflToFLELvWGPyX8K+QmxD1VxRS4c4qvsEBoV6L7G+tm8n/GuE+alw3vcdzDg==","signature_status":"signed_v1","signed_at":"2026-05-18T04:21:11.065618Z","signed_message":"canonical_sha256_bytes"},"source_id":"0904.2482","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:2a58c1d133eb46437ab4bb42d21c2a95730e1a561d9778d4c7d0f786476b94cc","sha256:74558f94806ade015c6fb2919179778ce84a6d505afb1d09fdea777eddd94b8a"],"state_sha256":"4c7ab21d4d20f8d2c33a82cd93a78da0ff8fe93e6248a5682f946a713171ff17"}