{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:2QTJPH3A27QPB6QDS2OL3N53CI","short_pith_number":"pith:2QTJPH3A","schema_version":"1.0","canonical_sha256":"d426979f60d7e0f0fa03969cbdb7bb123e479305fad31d66316972699679853d","source":{"kind":"arxiv","id":"1701.06555","version":2},"attestation_state":"computed","paper":{"title":"Decoding of Interleaved Reed-Solomon Codes Using Improved Power Decoding","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Johan Rosenkilde n\\'e Nielsen, Sven Puchinger","submitted_at":"2017-01-23T18:57:49Z","abstract_excerpt":"We propose a new partial decoding algorithm for $m$-interleaved Reed--Solomon (IRS) codes that can decode, with high probability, a random error of relative weight $1-R^{\\frac{m}{m+1}}$ at all code rates $R$, in time polynomial in the code length $n$. For $m>2$, this is an asymptotic improvement over the previous state-of-the-art for all rates, and the first improvement for $R>1/3$ in the last $20$ years. The method combines collaborative decoding of IRS codes with power decoding up to the Johnson radius."},"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":"1701.06555","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-01-23T18:57:49Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"13ec55be32519ffa8667850b9e9c03e0da56b620a3c2830df305b493e7dbe8b6","abstract_canon_sha256":"dd9461441d91871a42500b0fdadcb48006c8e73367f075bca87d40260cbc4c2b"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:45:01.299199Z","signature_b64":"ksVbBUgjuetm70w5Xx0OzksApoVMXiXMhm4j1g7QiEF725zFrgCPfqaeh2QUvoPbumHn37suEU7096lk20jBAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d426979f60d7e0f0fa03969cbdb7bb123e479305fad31d66316972699679853d","last_reissued_at":"2026-05-18T00:45:01.298733Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:45:01.298733Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Decoding of Interleaved Reed-Solomon Codes Using Improved Power Decoding","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Johan Rosenkilde n\\'e Nielsen, Sven Puchinger","submitted_at":"2017-01-23T18:57:49Z","abstract_excerpt":"We propose a new partial decoding algorithm for $m$-interleaved Reed--Solomon (IRS) codes that can decode, with high probability, a random error of relative weight $1-R^{\\frac{m}{m+1}}$ at all code rates $R$, in time polynomial in the code length $n$. For $m>2$, this is an asymptotic improvement over the previous state-of-the-art for all rates, and the first improvement for $R>1/3$ in the last $20$ years. The method combines collaborative decoding of IRS codes with power decoding up to the Johnson radius."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1701.06555","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":"1701.06555","created_at":"2026-05-18T00:45:01.298814+00:00"},{"alias_kind":"arxiv_version","alias_value":"1701.06555v2","created_at":"2026-05-18T00:45:01.298814+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1701.06555","created_at":"2026-05-18T00:45:01.298814+00:00"},{"alias_kind":"pith_short_12","alias_value":"2QTJPH3A27QP","created_at":"2026-05-18T12:30:55.937587+00:00"},{"alias_kind":"pith_short_16","alias_value":"2QTJPH3A27QPB6QD","created_at":"2026-05-18T12:30:55.937587+00:00"},{"alias_kind":"pith_short_8","alias_value":"2QTJPH3A","created_at":"2026-05-18T12:30:55.937587+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/2QTJPH3A27QPB6QDS2OL3N53CI","json":"https://pith.science/pith/2QTJPH3A27QPB6QDS2OL3N53CI.json","graph_json":"https://pith.science/api/pith-number/2QTJPH3A27QPB6QDS2OL3N53CI/graph.json","events_json":"https://pith.science/api/pith-number/2QTJPH3A27QPB6QDS2OL3N53CI/events.json","paper":"https://pith.science/paper/2QTJPH3A"},"agent_actions":{"view_html":"https://pith.science/pith/2QTJPH3A27QPB6QDS2OL3N53CI","download_json":"https://pith.science/pith/2QTJPH3A27QPB6QDS2OL3N53CI.json","view_paper":"https://pith.science/paper/2QTJPH3A","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1701.06555&json=true","fetch_graph":"https://pith.science/api/pith-number/2QTJPH3A27QPB6QDS2OL3N53CI/graph.json","fetch_events":"https://pith.science/api/pith-number/2QTJPH3A27QPB6QDS2OL3N53CI/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/2QTJPH3A27QPB6QDS2OL3N53CI/action/timestamp_anchor","attest_storage":"https://pith.science/pith/2QTJPH3A27QPB6QDS2OL3N53CI/action/storage_attestation","attest_author":"https://pith.science/pith/2QTJPH3A27QPB6QDS2OL3N53CI/action/author_attestation","sign_citation":"https://pith.science/pith/2QTJPH3A27QPB6QDS2OL3N53CI/action/citation_signature","submit_replication":"https://pith.science/pith/2QTJPH3A27QPB6QDS2OL3N53CI/action/replication_record"}},"created_at":"2026-05-18T00:45:01.298814+00:00","updated_at":"2026-05-18T00:45:01.298814+00:00"}