{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2011:Z7GAVRDG4L6NPOQJXI5KUWMO6M","short_pith_number":"pith:Z7GAVRDG","schema_version":"1.0","canonical_sha256":"cfcc0ac466e2fcd7ba09ba3aaa598ef33573fc2fc459e716a1a1729ed27d58ba","source":{"kind":"arxiv","id":"1104.3419","version":1},"attestation_state":"computed","paper":{"title":"Optimal Threshold-Based Multi-Trial Error/Erasure Decoding with the Guruswami-Sudan Algorithm","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Christian Senger, Martin Bossert, Victor V. Zyablov, Vladimir R. Sidorenko","submitted_at":"2011-04-18T09:34:30Z","abstract_excerpt":"Traditionally, multi-trial error/erasure decoding of Reed-Solomon (RS) codes is based on Bounded Minimum Distance (BMD) decoders with an erasure option. Such decoders have error/erasure tradeoff factor L=2, which means that an error is twice as expensive as an erasure in terms of the code's minimum distance. The Guruswami-Sudan (GS) list decoder can be considered as state of the art in algebraic decoding of RS codes. Besides an erasure option, it allows to adjust L to values in the range 1<L<=2. Based on previous work, we provide formulae which allow to optimally (in terms of residual codeword"},"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":"1104.3419","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2011-04-18T09:34:30Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"57a4745aa908dbf7bf3e22a74d8e9ec8140d28f6c290127435b8dfff52199ccf","abstract_canon_sha256":"da826c69bbcae573548786e8cc451978e78edb91ed1cf240b5584d7a82f8f5d3"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:22:02.551048Z","signature_b64":"E6NYYEYEAWCRXQrI7uPqqhUAclXtGL+cftaVBgXxaVt5DSJbmu0TKizSmwmrSxS36pYXewBBPfcy+K2Woi6pCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"cfcc0ac466e2fcd7ba09ba3aaa598ef33573fc2fc459e716a1a1729ed27d58ba","last_reissued_at":"2026-05-18T02:22:02.550268Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:22:02.550268Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Optimal Threshold-Based Multi-Trial Error/Erasure Decoding with the Guruswami-Sudan Algorithm","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Christian Senger, Martin Bossert, Victor V. Zyablov, Vladimir R. Sidorenko","submitted_at":"2011-04-18T09:34:30Z","abstract_excerpt":"Traditionally, multi-trial error/erasure decoding of Reed-Solomon (RS) codes is based on Bounded Minimum Distance (BMD) decoders with an erasure option. Such decoders have error/erasure tradeoff factor L=2, which means that an error is twice as expensive as an erasure in terms of the code's minimum distance. The Guruswami-Sudan (GS) list decoder can be considered as state of the art in algebraic decoding of RS codes. Besides an erasure option, it allows to adjust L to values in the range 1<L<=2. Based on previous work, we provide formulae which allow to optimally (in terms of residual codeword"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1104.3419","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1104.3419","created_at":"2026-05-18T02:22:02.550419+00:00"},{"alias_kind":"arxiv_version","alias_value":"1104.3419v1","created_at":"2026-05-18T02:22:02.550419+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1104.3419","created_at":"2026-05-18T02:22:02.550419+00:00"},{"alias_kind":"pith_short_12","alias_value":"Z7GAVRDG4L6N","created_at":"2026-05-18T12:26:47.523578+00:00"},{"alias_kind":"pith_short_16","alias_value":"Z7GAVRDG4L6NPOQJ","created_at":"2026-05-18T12:26:47.523578+00:00"},{"alias_kind":"pith_short_8","alias_value":"Z7GAVRDG","created_at":"2026-05-18T12:26:47.523578+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/Z7GAVRDG4L6NPOQJXI5KUWMO6M","json":"https://pith.science/pith/Z7GAVRDG4L6NPOQJXI5KUWMO6M.json","graph_json":"https://pith.science/api/pith-number/Z7GAVRDG4L6NPOQJXI5KUWMO6M/graph.json","events_json":"https://pith.science/api/pith-number/Z7GAVRDG4L6NPOQJXI5KUWMO6M/events.json","paper":"https://pith.science/paper/Z7GAVRDG"},"agent_actions":{"view_html":"https://pith.science/pith/Z7GAVRDG4L6NPOQJXI5KUWMO6M","download_json":"https://pith.science/pith/Z7GAVRDG4L6NPOQJXI5KUWMO6M.json","view_paper":"https://pith.science/paper/Z7GAVRDG","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1104.3419&json=true","fetch_graph":"https://pith.science/api/pith-number/Z7GAVRDG4L6NPOQJXI5KUWMO6M/graph.json","fetch_events":"https://pith.science/api/pith-number/Z7GAVRDG4L6NPOQJXI5KUWMO6M/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/Z7GAVRDG4L6NPOQJXI5KUWMO6M/action/timestamp_anchor","attest_storage":"https://pith.science/pith/Z7GAVRDG4L6NPOQJXI5KUWMO6M/action/storage_attestation","attest_author":"https://pith.science/pith/Z7GAVRDG4L6NPOQJXI5KUWMO6M/action/author_attestation","sign_citation":"https://pith.science/pith/Z7GAVRDG4L6NPOQJXI5KUWMO6M/action/citation_signature","submit_replication":"https://pith.science/pith/Z7GAVRDG4L6NPOQJXI5KUWMO6M/action/replication_record"}},"created_at":"2026-05-18T02:22:02.550419+00:00","updated_at":"2026-05-18T02:22:02.550419+00:00"}