{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2010:KB6W2KGVGBXMRRZ7OFFCSEUTPS","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":"0dcc39092e449c07a7302fb07680ebd438b5d3c776ee7b94157a141badef7e18","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2010-01-30T05:35:57Z","title_canon_sha256":"a1f1c3acdf3d33b483ed1a4be0ea62f4a2bec5c91cfeb3c1526dbe651a14595a"},"schema_version":"1.0","source":{"id":"1002.0043","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1002.0043","created_at":"2026-05-18T00:58:19Z"},{"alias_kind":"arxiv_version","alias_value":"1002.0043v2","created_at":"2026-05-18T00:58:19Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1002.0043","created_at":"2026-05-18T00:58:19Z"},{"alias_kind":"pith_short_12","alias_value":"KB6W2KGVGBXM","created_at":"2026-05-18T12:26:09Z"},{"alias_kind":"pith_short_16","alias_value":"KB6W2KGVGBXMRRZ7","created_at":"2026-05-18T12:26:09Z"},{"alias_kind":"pith_short_8","alias_value":"KB6W2KGV","created_at":"2026-05-18T12:26:09Z"}],"graph_snapshots":[{"event_id":"sha256:9a42132769c862271da679219ee630e07b218215a1eb9ec2618ea48e344bec46","target":"graph","created_at":"2026-05-18T00:58:19Z","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":"Algorithms based on multiple decoding attempts of Reed-Solomon (RS) codes have recently attracted new attention. Choosing decoding candidates based on rate-distortion (R-D) theory, as proposed previously by the authors, currently provides the best performance-versus-complexity trade-off. In this paper, an analysis based on the rate-distortion exponent (RDE) is used to directly minimize the exponential decay rate of the error probability. This enables rigorous bounds on the error probability for finite-length RS codes and leads to modest performance gains. As a byproduct, a numerical method is ","authors_text":"Henry D. Pfister, Krishna R. Narayanan, Phong S. Nguyen","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2010-01-30T05:35:57Z","title":"A Rate-Distortion Exponent Approach to Multiple Decoding Attempts for Reed-Solomon Codes"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1002.0043","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:5ca4c34a39eaaea8a05da3bd0459176512ad1a21b324171f9d93b84ea710a6fa","target":"record","created_at":"2026-05-18T00:58:19Z","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":"0dcc39092e449c07a7302fb07680ebd438b5d3c776ee7b94157a141badef7e18","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2010-01-30T05:35:57Z","title_canon_sha256":"a1f1c3acdf3d33b483ed1a4be0ea62f4a2bec5c91cfeb3c1526dbe651a14595a"},"schema_version":"1.0","source":{"id":"1002.0043","kind":"arxiv","version":2}},"canonical_sha256":"507d6d28d5306ec8c73f714a2912937c95849fcf8aacda0536db2490f3e6b5da","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"507d6d28d5306ec8c73f714a2912937c95849fcf8aacda0536db2490f3e6b5da","first_computed_at":"2026-05-18T00:58:19.723141Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:58:19.723141Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Q8pGgmo6vjJdyTmQyUH7J2K5HH2s6WLLa6GaIwp1qMkwwsDr4cGHbpVY//RIIuLiK5d8tf9cQB6rNStaiZzDCQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:58:19.723866Z","signed_message":"canonical_sha256_bytes"},"source_id":"1002.0043","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:5ca4c34a39eaaea8a05da3bd0459176512ad1a21b324171f9d93b84ea710a6fa","sha256:9a42132769c862271da679219ee630e07b218215a1eb9ec2618ea48e344bec46"],"state_sha256":"c7ee91fc0cd53b1340af7070f7ac02b08e5ab45f5de6fe94943a93d322b97280"}