{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2009:YIORKUHBCGEPW5FZEWLKXKAERB","short_pith_number":"pith:YIORKUHB","schema_version":"1.0","canonical_sha256":"c21d1550e11188fb74b92596aba804887bbcbbf102d17656231b4924922fb0cd","source":{"kind":"arxiv","id":"0905.3733","version":1},"attestation_state":"computed","paper":{"title":"Trapping Set Enumerators for Repeat Multiple Accumulate Code Ensembles","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Alexandre Graell i Amat, Christian Koller, Daniel J. Costello Jr, Joerg Kliewer","submitted_at":"2009-05-22T17:40:16Z","abstract_excerpt":"The serial concatenation of a repetition code with two or more accumulators has the advantage of a simple encoder structure. Furthermore, the resulting ensemble is asymptotically good and exhibits minimum distance growing linearly with block length. However, in practice these codes cannot be decoded by a maximum likelihood decoder, and iterative decoding schemes must be employed. For low-density parity-check codes, the notion of trapping sets has been introduced to estimate the performance of these codes under iterative message passing decoding. In this paper, we present a closed form finite l"},"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":"0905.3733","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2009-05-22T17:40:16Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"7c2b8bc854194fcc355306ae1afb630f33b331301d43fd2aa9965fd79a8dc98d","abstract_canon_sha256":"87ffc1c57dc52c667381c5f870a8b45e2dc8caed9cb141f895db69b452a114a9"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:59:11.341584Z","signature_b64":"IpwROlRVk/gfiu7LJMWFW7qP6gB9fRmuAtejkukBUmyDyk69ioPv20ebCd0249fYcsK8KHAXS1Y0Qs6w44grAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c21d1550e11188fb74b92596aba804887bbcbbf102d17656231b4924922fb0cd","last_reissued_at":"2026-05-18T00:59:11.340833Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:59:11.340833Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Trapping Set Enumerators for Repeat Multiple Accumulate Code Ensembles","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Alexandre Graell i Amat, Christian Koller, Daniel J. Costello Jr, Joerg Kliewer","submitted_at":"2009-05-22T17:40:16Z","abstract_excerpt":"The serial concatenation of a repetition code with two or more accumulators has the advantage of a simple encoder structure. Furthermore, the resulting ensemble is asymptotically good and exhibits minimum distance growing linearly with block length. However, in practice these codes cannot be decoded by a maximum likelihood decoder, and iterative decoding schemes must be employed. For low-density parity-check codes, the notion of trapping sets has been introduced to estimate the performance of these codes under iterative message passing decoding. In this paper, we present a closed form finite l"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"0905.3733","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":"0905.3733","created_at":"2026-05-18T00:59:11.340956+00:00"},{"alias_kind":"arxiv_version","alias_value":"0905.3733v1","created_at":"2026-05-18T00:59:11.340956+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0905.3733","created_at":"2026-05-18T00:59:11.340956+00:00"},{"alias_kind":"pith_short_12","alias_value":"YIORKUHBCGEP","created_at":"2026-05-18T12:26:02.257875+00:00"},{"alias_kind":"pith_short_16","alias_value":"YIORKUHBCGEPW5FZ","created_at":"2026-05-18T12:26:02.257875+00:00"},{"alias_kind":"pith_short_8","alias_value":"YIORKUHB","created_at":"2026-05-18T12:26:02.257875+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/YIORKUHBCGEPW5FZEWLKXKAERB","json":"https://pith.science/pith/YIORKUHBCGEPW5FZEWLKXKAERB.json","graph_json":"https://pith.science/api/pith-number/YIORKUHBCGEPW5FZEWLKXKAERB/graph.json","events_json":"https://pith.science/api/pith-number/YIORKUHBCGEPW5FZEWLKXKAERB/events.json","paper":"https://pith.science/paper/YIORKUHB"},"agent_actions":{"view_html":"https://pith.science/pith/YIORKUHBCGEPW5FZEWLKXKAERB","download_json":"https://pith.science/pith/YIORKUHBCGEPW5FZEWLKXKAERB.json","view_paper":"https://pith.science/paper/YIORKUHB","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=0905.3733&json=true","fetch_graph":"https://pith.science/api/pith-number/YIORKUHBCGEPW5FZEWLKXKAERB/graph.json","fetch_events":"https://pith.science/api/pith-number/YIORKUHBCGEPW5FZEWLKXKAERB/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/YIORKUHBCGEPW5FZEWLKXKAERB/action/timestamp_anchor","attest_storage":"https://pith.science/pith/YIORKUHBCGEPW5FZEWLKXKAERB/action/storage_attestation","attest_author":"https://pith.science/pith/YIORKUHBCGEPW5FZEWLKXKAERB/action/author_attestation","sign_citation":"https://pith.science/pith/YIORKUHBCGEPW5FZEWLKXKAERB/action/citation_signature","submit_replication":"https://pith.science/pith/YIORKUHBCGEPW5FZEWLKXKAERB/action/replication_record"}},"created_at":"2026-05-18T00:59:11.340956+00:00","updated_at":"2026-05-18T00:59:11.340956+00:00"}