{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2008:7MD227MPOTUS6QK5QZ665QSEDE","short_pith_number":"pith:7MD227MP","canonical_record":{"source":{"id":"0808.3756","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2008-08-27T19:32:45Z","cross_cats_sorted":["cs.CC","math.IT"],"title_canon_sha256":"88ed62e2eb556c5b1b56886ad3b73c6b2bff1adb870344f78f12b2e849c08c31","abstract_canon_sha256":"513905cc393122873046891da2c0b6683d42f93b6595eebc5b3fcb60a2fefe63"},"schema_version":"1.0"},"canonical_sha256":"fb07ad7d8f74e92f415d867deec24419230a181f1ab1489dfa3e00a17f2528ac","source":{"kind":"arxiv","id":"0808.3756","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"0808.3756","created_at":"2026-05-18T00:58:48Z"},{"alias_kind":"arxiv_version","alias_value":"0808.3756v2","created_at":"2026-05-18T00:58:48Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0808.3756","created_at":"2026-05-18T00:58:48Z"},{"alias_kind":"pith_short_12","alias_value":"7MD227MPOTUS","created_at":"2026-05-18T12:25:56Z"},{"alias_kind":"pith_short_16","alias_value":"7MD227MPOTUS6QK5","created_at":"2026-05-18T12:25:56Z"},{"alias_kind":"pith_short_8","alias_value":"7MD227MP","created_at":"2026-05-18T12:25:56Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2008:7MD227MPOTUS6QK5QZ665QSEDE","target":"record","payload":{"canonical_record":{"source":{"id":"0808.3756","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2008-08-27T19:32:45Z","cross_cats_sorted":["cs.CC","math.IT"],"title_canon_sha256":"88ed62e2eb556c5b1b56886ad3b73c6b2bff1adb870344f78f12b2e849c08c31","abstract_canon_sha256":"513905cc393122873046891da2c0b6683d42f93b6595eebc5b3fcb60a2fefe63"},"schema_version":"1.0"},"canonical_sha256":"fb07ad7d8f74e92f415d867deec24419230a181f1ab1489dfa3e00a17f2528ac","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:58:48.415627Z","signature_b64":"/afvmEGIo3rHWhiJZ0J7dFZSDsn3dKNj7WofvDQQP0Zt2Iw9M+sO/ZeBKnPii1l1FCSFJF7g7ugSibcWpDg1Ag==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"fb07ad7d8f74e92f415d867deec24419230a181f1ab1489dfa3e00a17f2528ac","last_reissued_at":"2026-05-18T00:58:48.415127Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:58:48.415127Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"0808.3756","source_version":2,"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-18T00:58:48Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"jsskWkQgOAs3UJeZlgUMWmkeylv0czwlM+1uProlM+FKO71AQ2OAvlXHWBmbKabtrwdi1F7vtrZd5JLHmLziDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T01:45:47.542888Z"},"content_sha256":"e96ee2dc16e704ca5ab4eaacc4644d603b738770fc230ff3f30b38890c2ebec1","schema_version":"1.0","event_id":"sha256:e96ee2dc16e704ca5ab4eaacc4644d603b738770fc230ff3f30b38890c2ebec1"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2008:7MD227MPOTUS6QK5QZ665QSEDE","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Approaching Blokh-Zyablov Error Exponent with Linear-Time Encodable/Decodable Codes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC","math.IT"],"primary_cat":"cs.IT","authors_text":"Jie Luo, Zheng Wang","submitted_at":"2008-08-27T19:32:45Z","abstract_excerpt":"Guruswami and Indyk showed in [1] that Forney's error exponent can be achieved with linear coding complexity over binary symmetric channels. This paper extends this conclusion to general discrete-time memoryless channels and shows that Forney's and Blokh-Zyablov error exponents can be arbitrarily approached by one-level and multi-level concatenated codes with linear encoding/decoding complexity. The key result is a revision to Forney's general minimum distance decoding algorithm, which enables a low complexity integration of Guruswami-Indyk's outer codes into the concatenated coding schemes."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"0808.3756","kind":"arxiv","version":2},"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-18T00:58:48Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"z524vo5+LHxURWRoAfEYw3EM5MXoGkPgRG2exHol7NWx1Lgwl2uwwSJBV6DjzSF6X6VeVL7pcnV2msyf0ZztCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T01:45:47.543588Z"},"content_sha256":"2fd9daae64bdb1e2dc980e87802c20404acd06d7cf8f8b25f53c54d55a3a2926","schema_version":"1.0","event_id":"sha256:2fd9daae64bdb1e2dc980e87802c20404acd06d7cf8f8b25f53c54d55a3a2926"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/7MD227MPOTUS6QK5QZ665QSEDE/bundle.json","state_url":"https://pith.science/pith/7MD227MPOTUS6QK5QZ665QSEDE/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/7MD227MPOTUS6QK5QZ665QSEDE/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-05T01:45:47Z","links":{"resolver":"https://pith.science/pith/7MD227MPOTUS6QK5QZ665QSEDE","bundle":"https://pith.science/pith/7MD227MPOTUS6QK5QZ665QSEDE/bundle.json","state":"https://pith.science/pith/7MD227MPOTUS6QK5QZ665QSEDE/state.json","well_known_bundle":"https://pith.science/.well-known/pith/7MD227MPOTUS6QK5QZ665QSEDE/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2008:7MD227MPOTUS6QK5QZ665QSEDE","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":"513905cc393122873046891da2c0b6683d42f93b6595eebc5b3fcb60a2fefe63","cross_cats_sorted":["cs.CC","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2008-08-27T19:32:45Z","title_canon_sha256":"88ed62e2eb556c5b1b56886ad3b73c6b2bff1adb870344f78f12b2e849c08c31"},"schema_version":"1.0","source":{"id":"0808.3756","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"0808.3756","created_at":"2026-05-18T00:58:48Z"},{"alias_kind":"arxiv_version","alias_value":"0808.3756v2","created_at":"2026-05-18T00:58:48Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0808.3756","created_at":"2026-05-18T00:58:48Z"},{"alias_kind":"pith_short_12","alias_value":"7MD227MPOTUS","created_at":"2026-05-18T12:25:56Z"},{"alias_kind":"pith_short_16","alias_value":"7MD227MPOTUS6QK5","created_at":"2026-05-18T12:25:56Z"},{"alias_kind":"pith_short_8","alias_value":"7MD227MP","created_at":"2026-05-18T12:25:56Z"}],"graph_snapshots":[{"event_id":"sha256:2fd9daae64bdb1e2dc980e87802c20404acd06d7cf8f8b25f53c54d55a3a2926","target":"graph","created_at":"2026-05-18T00:58:48Z","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":"Guruswami and Indyk showed in [1] that Forney's error exponent can be achieved with linear coding complexity over binary symmetric channels. This paper extends this conclusion to general discrete-time memoryless channels and shows that Forney's and Blokh-Zyablov error exponents can be arbitrarily approached by one-level and multi-level concatenated codes with linear encoding/decoding complexity. The key result is a revision to Forney's general minimum distance decoding algorithm, which enables a low complexity integration of Guruswami-Indyk's outer codes into the concatenated coding schemes.","authors_text":"Jie Luo, Zheng Wang","cross_cats":["cs.CC","math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2008-08-27T19:32:45Z","title":"Approaching Blokh-Zyablov Error Exponent with Linear-Time Encodable/Decodable Codes"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"0808.3756","kind":"arxiv","version":2},"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:e96ee2dc16e704ca5ab4eaacc4644d603b738770fc230ff3f30b38890c2ebec1","target":"record","created_at":"2026-05-18T00:58:48Z","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":"513905cc393122873046891da2c0b6683d42f93b6595eebc5b3fcb60a2fefe63","cross_cats_sorted":["cs.CC","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2008-08-27T19:32:45Z","title_canon_sha256":"88ed62e2eb556c5b1b56886ad3b73c6b2bff1adb870344f78f12b2e849c08c31"},"schema_version":"1.0","source":{"id":"0808.3756","kind":"arxiv","version":2}},"canonical_sha256":"fb07ad7d8f74e92f415d867deec24419230a181f1ab1489dfa3e00a17f2528ac","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"fb07ad7d8f74e92f415d867deec24419230a181f1ab1489dfa3e00a17f2528ac","first_computed_at":"2026-05-18T00:58:48.415127Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:58:48.415127Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"/afvmEGIo3rHWhiJZ0J7dFZSDsn3dKNj7WofvDQQP0Zt2Iw9M+sO/ZeBKnPii1l1FCSFJF7g7ugSibcWpDg1Ag==","signature_status":"signed_v1","signed_at":"2026-05-18T00:58:48.415627Z","signed_message":"canonical_sha256_bytes"},"source_id":"0808.3756","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:e96ee2dc16e704ca5ab4eaacc4644d603b738770fc230ff3f30b38890c2ebec1","sha256:2fd9daae64bdb1e2dc980e87802c20404acd06d7cf8f8b25f53c54d55a3a2926"],"state_sha256":"76c7dd6f858e0dc51238a8c1ab88132bf0d8e6a914a767739c6788e2b6f4bc6f"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"PQsfzSKFDDiwKD7cRuAvSUG+jD1rjhK1lI7KVYr01UkRa4Qn//+TXsSYnfmGLtRobzfSI8MX7u7p+wFuqTVYCw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-05T01:45:47.547223Z","bundle_sha256":"890f4392481e077f97df4ba2072258d3e33254fd97a6198b7390a9ccfaf30fca"}}