{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2005:2YFDK5LBH2OEXQPFMIEXGCN2HW","short_pith_number":"pith:2YFDK5LB","schema_version":"1.0","canonical_sha256":"d60a3575613e9c4bc1e562097309ba3d9bc47f328faac2aadc005ee16126e062","source":{"kind":"arxiv","id":"cs/0509062","version":3},"attestation_state":"computed","paper":{"title":"Capacity-Achieving Codes with Bounded Graphical Complexity on Noisy Channels","license":"","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Achilleas Anastasopoulos, Chun-Hao Hsu","submitted_at":"2005-09-19T23:22:34Z","abstract_excerpt":"We introduce a new family of concatenated codes with an outer low-density parity-check (LDPC) code and an inner low-density generator matrix (LDGM) code, and prove that these codes can achieve capacity under any memoryless binary-input output-symmetric (MBIOS) channel using maximum-likelihood (ML) decoding with bounded graphical complexity, i.e., the number of edges per information bit in their graphical representation is bounded. In particular, we also show that these codes can achieve capacity on the binary erasure channel (BEC) under belief propagation (BP) decoding with bounded decoding co"},"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":"cs/0509062","kind":"arxiv","version":3},"metadata":{"license":"","primary_cat":"cs.IT","submitted_at":"2005-09-19T23:22:34Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"f59e0f77fce7b29e37d2ca01b69536e355a0896d249f331070f05ae76e5e55f1","abstract_canon_sha256":"5247b1edff4a007b4bd5a1dd526d6bfcef6d6b31ebbe8f26ae50f823676beb44"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:06:49.046005Z","signature_b64":"IMQRd0Lq2tLy0RO6TaMqd+6qyBgx2Qp7hP1aHkLK2zdMvCZCSdu0utOsYXvnvGu3BdoQUraQ/TzifbuE3a8PAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d60a3575613e9c4bc1e562097309ba3d9bc47f328faac2aadc005ee16126e062","last_reissued_at":"2026-05-18T01:06:49.045428Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:06:49.045428Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Capacity-Achieving Codes with Bounded Graphical Complexity on Noisy Channels","license":"","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Achilleas Anastasopoulos, Chun-Hao Hsu","submitted_at":"2005-09-19T23:22:34Z","abstract_excerpt":"We introduce a new family of concatenated codes with an outer low-density parity-check (LDPC) code and an inner low-density generator matrix (LDGM) code, and prove that these codes can achieve capacity under any memoryless binary-input output-symmetric (MBIOS) channel using maximum-likelihood (ML) decoding with bounded graphical complexity, i.e., the number of edges per information bit in their graphical representation is bounded. In particular, we also show that these codes can achieve capacity on the binary erasure channel (BEC) under belief propagation (BP) decoding with bounded decoding co"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"cs/0509062","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"cs/0509062","created_at":"2026-05-18T01:06:49.045538+00:00"},{"alias_kind":"arxiv_version","alias_value":"cs/0509062v3","created_at":"2026-05-18T01:06:49.045538+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.cs/0509062","created_at":"2026-05-18T01:06:49.045538+00:00"},{"alias_kind":"pith_short_12","alias_value":"2YFDK5LBH2OE","created_at":"2026-05-18T12:25:52.687210+00:00"},{"alias_kind":"pith_short_16","alias_value":"2YFDK5LBH2OEXQPF","created_at":"2026-05-18T12:25:52.687210+00:00"},{"alias_kind":"pith_short_8","alias_value":"2YFDK5LB","created_at":"2026-05-18T12:25:52.687210+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/2YFDK5LBH2OEXQPFMIEXGCN2HW","json":"https://pith.science/pith/2YFDK5LBH2OEXQPFMIEXGCN2HW.json","graph_json":"https://pith.science/api/pith-number/2YFDK5LBH2OEXQPFMIEXGCN2HW/graph.json","events_json":"https://pith.science/api/pith-number/2YFDK5LBH2OEXQPFMIEXGCN2HW/events.json","paper":"https://pith.science/paper/2YFDK5LB"},"agent_actions":{"view_html":"https://pith.science/pith/2YFDK5LBH2OEXQPFMIEXGCN2HW","download_json":"https://pith.science/pith/2YFDK5LBH2OEXQPFMIEXGCN2HW.json","view_paper":"https://pith.science/paper/2YFDK5LB","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=cs/0509062&json=true","fetch_graph":"https://pith.science/api/pith-number/2YFDK5LBH2OEXQPFMIEXGCN2HW/graph.json","fetch_events":"https://pith.science/api/pith-number/2YFDK5LBH2OEXQPFMIEXGCN2HW/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/2YFDK5LBH2OEXQPFMIEXGCN2HW/action/timestamp_anchor","attest_storage":"https://pith.science/pith/2YFDK5LBH2OEXQPFMIEXGCN2HW/action/storage_attestation","attest_author":"https://pith.science/pith/2YFDK5LBH2OEXQPFMIEXGCN2HW/action/author_attestation","sign_citation":"https://pith.science/pith/2YFDK5LBH2OEXQPFMIEXGCN2HW/action/citation_signature","submit_replication":"https://pith.science/pith/2YFDK5LBH2OEXQPFMIEXGCN2HW/action/replication_record"}},"created_at":"2026-05-18T01:06:49.045538+00:00","updated_at":"2026-05-18T01:06:49.045538+00:00"}