{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2010:KB6W2KGVGBXMRRZ7OFFCSEUTPS","short_pith_number":"pith:KB6W2KGV","schema_version":"1.0","canonical_sha256":"507d6d28d5306ec8c73f714a2912937c95849fcf8aacda0536db2490f3e6b5da","source":{"kind":"arxiv","id":"1002.0043","version":2},"attestation_state":"computed","paper":{"title":"A Rate-Distortion Exponent Approach to Multiple Decoding Attempts for Reed-Solomon Codes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Henry D. Pfister, Krishna R. Narayanan, Phong S. Nguyen","submitted_at":"2010-01-30T05:35:57Z","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 "},"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":"1002.0043","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2010-01-30T05:35:57Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"a1f1c3acdf3d33b483ed1a4be0ea62f4a2bec5c91cfeb3c1526dbe651a14595a","abstract_canon_sha256":"0dcc39092e449c07a7302fb07680ebd438b5d3c776ee7b94157a141badef7e18"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:58:19.723866Z","signature_b64":"Q8pGgmo6vjJdyTmQyUH7J2K5HH2s6WLLa6GaIwp1qMkwwsDr4cGHbpVY//RIIuLiK5d8tf9cQB6rNStaiZzDCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"507d6d28d5306ec8c73f714a2912937c95849fcf8aacda0536db2490f3e6b5da","last_reissued_at":"2026-05-18T00:58:19.723141Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:58:19.723141Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A Rate-Distortion Exponent Approach to Multiple Decoding Attempts for Reed-Solomon Codes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Henry D. Pfister, Krishna R. Narayanan, Phong S. Nguyen","submitted_at":"2010-01-30T05:35:57Z","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 "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1002.0043","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1002.0043","created_at":"2026-05-18T00:58:19.723245+00:00"},{"alias_kind":"arxiv_version","alias_value":"1002.0043v2","created_at":"2026-05-18T00:58:19.723245+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1002.0043","created_at":"2026-05-18T00:58:19.723245+00:00"},{"alias_kind":"pith_short_12","alias_value":"KB6W2KGVGBXM","created_at":"2026-05-18T12:26:09.077623+00:00"},{"alias_kind":"pith_short_16","alias_value":"KB6W2KGVGBXMRRZ7","created_at":"2026-05-18T12:26:09.077623+00:00"},{"alias_kind":"pith_short_8","alias_value":"KB6W2KGV","created_at":"2026-05-18T12:26:09.077623+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/KB6W2KGVGBXMRRZ7OFFCSEUTPS","json":"https://pith.science/pith/KB6W2KGVGBXMRRZ7OFFCSEUTPS.json","graph_json":"https://pith.science/api/pith-number/KB6W2KGVGBXMRRZ7OFFCSEUTPS/graph.json","events_json":"https://pith.science/api/pith-number/KB6W2KGVGBXMRRZ7OFFCSEUTPS/events.json","paper":"https://pith.science/paper/KB6W2KGV"},"agent_actions":{"view_html":"https://pith.science/pith/KB6W2KGVGBXMRRZ7OFFCSEUTPS","download_json":"https://pith.science/pith/KB6W2KGVGBXMRRZ7OFFCSEUTPS.json","view_paper":"https://pith.science/paper/KB6W2KGV","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1002.0043&json=true","fetch_graph":"https://pith.science/api/pith-number/KB6W2KGVGBXMRRZ7OFFCSEUTPS/graph.json","fetch_events":"https://pith.science/api/pith-number/KB6W2KGVGBXMRRZ7OFFCSEUTPS/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/KB6W2KGVGBXMRRZ7OFFCSEUTPS/action/timestamp_anchor","attest_storage":"https://pith.science/pith/KB6W2KGVGBXMRRZ7OFFCSEUTPS/action/storage_attestation","attest_author":"https://pith.science/pith/KB6W2KGVGBXMRRZ7OFFCSEUTPS/action/author_attestation","sign_citation":"https://pith.science/pith/KB6W2KGVGBXMRRZ7OFFCSEUTPS/action/citation_signature","submit_replication":"https://pith.science/pith/KB6W2KGVGBXMRRZ7OFFCSEUTPS/action/replication_record"}},"created_at":"2026-05-18T00:58:19.723245+00:00","updated_at":"2026-05-18T00:58:19.723245+00:00"}