{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2005:Z2U2NBJVKTTIXZEDB5KUNVOGRW","short_pith_number":"pith:Z2U2NBJV","canonical_record":{"source":{"id":"cs/0509097","kind":"arxiv","version":1},"metadata":{"license":"","primary_cat":"cs.IT","submitted_at":"2005-09-29T07:22:10Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"83c5fefe199508156996aad2244df2eedc518b91b5a592eedc026f0de5ff2728","abstract_canon_sha256":"d02bdd36922c12a7e6d377b1d8f0c20ed8d86b3f6fb84588af865d8e64ea50ee"},"schema_version":"1.0"},"canonical_sha256":"cea9a6853554e68be4830f5546d5c68db3c6b649c4ee5fc2e3c266b09116e6c1","source":{"kind":"arxiv","id":"cs/0509097","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"cs/0509097","created_at":"2026-05-18T02:37:36Z"},{"alias_kind":"arxiv_version","alias_value":"cs/0509097v1","created_at":"2026-05-18T02:37:36Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.cs/0509097","created_at":"2026-05-18T02:37:36Z"},{"alias_kind":"pith_short_12","alias_value":"Z2U2NBJVKTTI","created_at":"2026-05-18T12:25:53Z"},{"alias_kind":"pith_short_16","alias_value":"Z2U2NBJVKTTIXZED","created_at":"2026-05-18T12:25:53Z"},{"alias_kind":"pith_short_8","alias_value":"Z2U2NBJV","created_at":"2026-05-18T12:25:53Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2005:Z2U2NBJVKTTIXZEDB5KUNVOGRW","target":"record","payload":{"canonical_record":{"source":{"id":"cs/0509097","kind":"arxiv","version":1},"metadata":{"license":"","primary_cat":"cs.IT","submitted_at":"2005-09-29T07:22:10Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"83c5fefe199508156996aad2244df2eedc518b91b5a592eedc026f0de5ff2728","abstract_canon_sha256":"d02bdd36922c12a7e6d377b1d8f0c20ed8d86b3f6fb84588af865d8e64ea50ee"},"schema_version":"1.0"},"canonical_sha256":"cea9a6853554e68be4830f5546d5c68db3c6b649c4ee5fc2e3c266b09116e6c1","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:37:36.914246Z","signature_b64":"ky18GbtRG8I9qnQN0dpotSAGspNYR6fIl0xKTB3WFSEp5v91d+kYH1rEe3E7CIBLXvOQEYW0Y3G5TbZlChhYBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"cea9a6853554e68be4830f5546d5c68db3c6b649c4ee5fc2e3c266b09116e6c1","last_reissued_at":"2026-05-18T02:37:36.913735Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:37:36.913735Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"cs/0509097","source_version":1,"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-18T02:37:36Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"tYHDjUt5n8A5icj6t+l01ysGOP5SSeSGzzPs5GBzq0xeApsVznLVp0UQYvi34NWNYGR0pvNkbse33YTUNc//BA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-11T22:39:54.410544Z"},"content_sha256":"851a1969ae6c9d59a62f5743831c5bf2a569b1462e1fca0fb928b6850b9742c9","schema_version":"1.0","event_id":"sha256:851a1969ae6c9d59a62f5743831c5bf2a569b1462e1fca0fb928b6850b9742c9"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2005:Z2U2NBJVKTTIXZEDB5KUNVOGRW","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Iterative Algebraic Soft-Decision List Decoding of Reed-Solomon Codes","license":"","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Mostafa El-Khamy, Robert J. McEliece","submitted_at":"2005-09-29T07:22:10Z","abstract_excerpt":"In this paper, we present an iterative soft-decision decoding algorithm for Reed-Solomon codes offering both complexity and performance advantages over previously known decoding algorithms. Our algorithm is a list decoding algorithm which combines two powerful soft decision decoding techniques which were previously regarded in the literature as competitive, namely, the Koetter-Vardy algebraic soft-decision decoding algorithm and belief-propagation based on adaptive parity check matrices, recently proposed by Jiang and Narayanan. Building on the Jiang-Narayanan algorithm, we present a belief-pr"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"cs/0509097","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"},"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-18T02:37:36Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"q+JRLefFXmiYeiAZTty+URYa89swtWydxju7sQzg2RgVkJSrl83AI2ojASkOMAHNdoa8otXd87nuVMrm4T/QBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-11T22:39:54.411273Z"},"content_sha256":"5cfd7a4ae2bfd8e3b18e56186d25f5c883e378d667e2e4f4bc39b66d3774f030","schema_version":"1.0","event_id":"sha256:5cfd7a4ae2bfd8e3b18e56186d25f5c883e378d667e2e4f4bc39b66d3774f030"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/Z2U2NBJVKTTIXZEDB5KUNVOGRW/bundle.json","state_url":"https://pith.science/pith/Z2U2NBJVKTTIXZEDB5KUNVOGRW/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/Z2U2NBJVKTTIXZEDB5KUNVOGRW/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-11T22:39:54Z","links":{"resolver":"https://pith.science/pith/Z2U2NBJVKTTIXZEDB5KUNVOGRW","bundle":"https://pith.science/pith/Z2U2NBJVKTTIXZEDB5KUNVOGRW/bundle.json","state":"https://pith.science/pith/Z2U2NBJVKTTIXZEDB5KUNVOGRW/state.json","well_known_bundle":"https://pith.science/.well-known/pith/Z2U2NBJVKTTIXZEDB5KUNVOGRW/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2005:Z2U2NBJVKTTIXZEDB5KUNVOGRW","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":"d02bdd36922c12a7e6d377b1d8f0c20ed8d86b3f6fb84588af865d8e64ea50ee","cross_cats_sorted":["math.IT"],"license":"","primary_cat":"cs.IT","submitted_at":"2005-09-29T07:22:10Z","title_canon_sha256":"83c5fefe199508156996aad2244df2eedc518b91b5a592eedc026f0de5ff2728"},"schema_version":"1.0","source":{"id":"cs/0509097","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"cs/0509097","created_at":"2026-05-18T02:37:36Z"},{"alias_kind":"arxiv_version","alias_value":"cs/0509097v1","created_at":"2026-05-18T02:37:36Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.cs/0509097","created_at":"2026-05-18T02:37:36Z"},{"alias_kind":"pith_short_12","alias_value":"Z2U2NBJVKTTI","created_at":"2026-05-18T12:25:53Z"},{"alias_kind":"pith_short_16","alias_value":"Z2U2NBJVKTTIXZED","created_at":"2026-05-18T12:25:53Z"},{"alias_kind":"pith_short_8","alias_value":"Z2U2NBJV","created_at":"2026-05-18T12:25:53Z"}],"graph_snapshots":[{"event_id":"sha256:5cfd7a4ae2bfd8e3b18e56186d25f5c883e378d667e2e4f4bc39b66d3774f030","target":"graph","created_at":"2026-05-18T02:37:36Z","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 paper, we present an iterative soft-decision decoding algorithm for Reed-Solomon codes offering both complexity and performance advantages over previously known decoding algorithms. Our algorithm is a list decoding algorithm which combines two powerful soft decision decoding techniques which were previously regarded in the literature as competitive, namely, the Koetter-Vardy algebraic soft-decision decoding algorithm and belief-propagation based on adaptive parity check matrices, recently proposed by Jiang and Narayanan. Building on the Jiang-Narayanan algorithm, we present a belief-pr","authors_text":"Mostafa El-Khamy, Robert J. McEliece","cross_cats":["math.IT"],"headline":"","license":"","primary_cat":"cs.IT","submitted_at":"2005-09-29T07:22:10Z","title":"Iterative Algebraic Soft-Decision List Decoding of Reed-Solomon Codes"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"cs/0509097","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:851a1969ae6c9d59a62f5743831c5bf2a569b1462e1fca0fb928b6850b9742c9","target":"record","created_at":"2026-05-18T02:37:36Z","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":"d02bdd36922c12a7e6d377b1d8f0c20ed8d86b3f6fb84588af865d8e64ea50ee","cross_cats_sorted":["math.IT"],"license":"","primary_cat":"cs.IT","submitted_at":"2005-09-29T07:22:10Z","title_canon_sha256":"83c5fefe199508156996aad2244df2eedc518b91b5a592eedc026f0de5ff2728"},"schema_version":"1.0","source":{"id":"cs/0509097","kind":"arxiv","version":1}},"canonical_sha256":"cea9a6853554e68be4830f5546d5c68db3c6b649c4ee5fc2e3c266b09116e6c1","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"cea9a6853554e68be4830f5546d5c68db3c6b649c4ee5fc2e3c266b09116e6c1","first_computed_at":"2026-05-18T02:37:36.913735Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:37:36.913735Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"ky18GbtRG8I9qnQN0dpotSAGspNYR6fIl0xKTB3WFSEp5v91d+kYH1rEe3E7CIBLXvOQEYW0Y3G5TbZlChhYBQ==","signature_status":"signed_v1","signed_at":"2026-05-18T02:37:36.914246Z","signed_message":"canonical_sha256_bytes"},"source_id":"cs/0509097","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:851a1969ae6c9d59a62f5743831c5bf2a569b1462e1fca0fb928b6850b9742c9","sha256:5cfd7a4ae2bfd8e3b18e56186d25f5c883e378d667e2e4f4bc39b66d3774f030"],"state_sha256":"3d0c0793ea9ee44e3c9b279e806c1aa004bcbfb0903e947d8ff5780b5e9a2355"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"xnzRzRS4Qsfvic401nynVmj7VAZFcRhzrdBpe3BzNUJDb4/oD69jK8sdj372glIbTQKdj0OI+cuphFh1IMSRCA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-11T22:39:54.415538Z","bundle_sha256":"f74b35fbb701dcdf4de3eb98d8ea7382f619275995208747706ad50a3d82a9ff"}}