{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2005:2YFDK5LBH2OEXQPFMIEXGCN2HW","short_pith_number":"pith:2YFDK5LB","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"},"canonical_sha256":"d60a3575613e9c4bc1e562097309ba3d9bc47f328faac2aadc005ee16126e062","source":{"kind":"arxiv","id":"cs/0509062","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"cs/0509062","created_at":"2026-05-18T01:06:49Z"},{"alias_kind":"arxiv_version","alias_value":"cs/0509062v3","created_at":"2026-05-18T01:06:49Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.cs/0509062","created_at":"2026-05-18T01:06:49Z"},{"alias_kind":"pith_short_12","alias_value":"2YFDK5LBH2OE","created_at":"2026-05-18T12:25:52Z"},{"alias_kind":"pith_short_16","alias_value":"2YFDK5LBH2OEXQPF","created_at":"2026-05-18T12:25:52Z"},{"alias_kind":"pith_short_8","alias_value":"2YFDK5LB","created_at":"2026-05-18T12:25:52Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2005:2YFDK5LBH2OEXQPFMIEXGCN2HW","target":"record","payload":{"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"},"canonical_sha256":"d60a3575613e9c4bc1e562097309ba3d9bc47f328faac2aadc005ee16126e062","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"},"source_kind":"arxiv","source_id":"cs/0509062","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-18T01:06:49Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"AbMiKmVmCrYq4k7zc+gGSU9w6+d2Jc4uLMviAldwPc5/nsbDixNDNgIZJtvzvUPz15+5BxoIqaeHYMxtZ65dDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-11T20:17:41.270300Z"},"content_sha256":"7459b575abb17b4d1927435288dc423a4e9e880626ccdff7240f4cac50b6eeed","schema_version":"1.0","event_id":"sha256:7459b575abb17b4d1927435288dc423a4e9e880626ccdff7240f4cac50b6eeed"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2005:2YFDK5LBH2OEXQPFMIEXGCN2HW","target":"graph","payload":{"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"},"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-18T01:06:49Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"JLE8bk5+kY//ivIB9eRLo1ckakCEJwHuwCAVguS9Ke8HrKzo9S/fQqGK3PhUj+P7TkCDeH29J0IiFLSwvK7CCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-11T20:17:41.270995Z"},"content_sha256":"c1c23ff666a0e02287ff8b4b434e519c528b8ff8d3441600dd7b3820a60657e5","schema_version":"1.0","event_id":"sha256:c1c23ff666a0e02287ff8b4b434e519c528b8ff8d3441600dd7b3820a60657e5"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/2YFDK5LBH2OEXQPFMIEXGCN2HW/bundle.json","state_url":"https://pith.science/pith/2YFDK5LBH2OEXQPFMIEXGCN2HW/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/2YFDK5LBH2OEXQPFMIEXGCN2HW/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-11T20:17:41Z","links":{"resolver":"https://pith.science/pith/2YFDK5LBH2OEXQPFMIEXGCN2HW","bundle":"https://pith.science/pith/2YFDK5LBH2OEXQPFMIEXGCN2HW/bundle.json","state":"https://pith.science/pith/2YFDK5LBH2OEXQPFMIEXGCN2HW/state.json","well_known_bundle":"https://pith.science/.well-known/pith/2YFDK5LBH2OEXQPFMIEXGCN2HW/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2005:2YFDK5LBH2OEXQPFMIEXGCN2HW","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":"5247b1edff4a007b4bd5a1dd526d6bfcef6d6b31ebbe8f26ae50f823676beb44","cross_cats_sorted":["math.IT"],"license":"","primary_cat":"cs.IT","submitted_at":"2005-09-19T23:22:34Z","title_canon_sha256":"f59e0f77fce7b29e37d2ca01b69536e355a0896d249f331070f05ae76e5e55f1"},"schema_version":"1.0","source":{"id":"cs/0509062","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"cs/0509062","created_at":"2026-05-18T01:06:49Z"},{"alias_kind":"arxiv_version","alias_value":"cs/0509062v3","created_at":"2026-05-18T01:06:49Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.cs/0509062","created_at":"2026-05-18T01:06:49Z"},{"alias_kind":"pith_short_12","alias_value":"2YFDK5LBH2OE","created_at":"2026-05-18T12:25:52Z"},{"alias_kind":"pith_short_16","alias_value":"2YFDK5LBH2OEXQPF","created_at":"2026-05-18T12:25:52Z"},{"alias_kind":"pith_short_8","alias_value":"2YFDK5LB","created_at":"2026-05-18T12:25:52Z"}],"graph_snapshots":[{"event_id":"sha256:c1c23ff666a0e02287ff8b4b434e519c528b8ff8d3441600dd7b3820a60657e5","target":"graph","created_at":"2026-05-18T01:06:49Z","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 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","authors_text":"Achilleas Anastasopoulos, Chun-Hao Hsu","cross_cats":["math.IT"],"headline":"","license":"","primary_cat":"cs.IT","submitted_at":"2005-09-19T23:22:34Z","title":"Capacity-Achieving Codes with Bounded Graphical Complexity on Noisy Channels"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"cs/0509062","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:7459b575abb17b4d1927435288dc423a4e9e880626ccdff7240f4cac50b6eeed","target":"record","created_at":"2026-05-18T01:06:49Z","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":"5247b1edff4a007b4bd5a1dd526d6bfcef6d6b31ebbe8f26ae50f823676beb44","cross_cats_sorted":["math.IT"],"license":"","primary_cat":"cs.IT","submitted_at":"2005-09-19T23:22:34Z","title_canon_sha256":"f59e0f77fce7b29e37d2ca01b69536e355a0896d249f331070f05ae76e5e55f1"},"schema_version":"1.0","source":{"id":"cs/0509062","kind":"arxiv","version":3}},"canonical_sha256":"d60a3575613e9c4bc1e562097309ba3d9bc47f328faac2aadc005ee16126e062","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"d60a3575613e9c4bc1e562097309ba3d9bc47f328faac2aadc005ee16126e062","first_computed_at":"2026-05-18T01:06:49.045428Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:06:49.045428Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"IMQRd0Lq2tLy0RO6TaMqd+6qyBgx2Qp7hP1aHkLK2zdMvCZCSdu0utOsYXvnvGu3BdoQUraQ/TzifbuE3a8PAg==","signature_status":"signed_v1","signed_at":"2026-05-18T01:06:49.046005Z","signed_message":"canonical_sha256_bytes"},"source_id":"cs/0509062","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:7459b575abb17b4d1927435288dc423a4e9e880626ccdff7240f4cac50b6eeed","sha256:c1c23ff666a0e02287ff8b4b434e519c528b8ff8d3441600dd7b3820a60657e5"],"state_sha256":"278a8a72189b4eaffe30a91e7c15aa3ccb242278079bfbdaadb3014faf83fb65"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"im3FEsg50IBea7hI1gpWG9/ZYQlxSCff254XftK0uWcy5AmUP0ZEpb4KzuoK21/XJsrt77ysfOrRisEK790nDA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-11T20:17:41.276325Z","bundle_sha256":"e9636a93ca6950cc3f2c7cc5ede2f210ff9ab2fb3877c1000386b860d8a8efdb"}}