{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2011:Z7GAVRDG4L6NPOQJXI5KUWMO6M","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":"da826c69bbcae573548786e8cc451978e78edb91ed1cf240b5584d7a82f8f5d3","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2011-04-18T09:34:30Z","title_canon_sha256":"57a4745aa908dbf7bf3e22a74d8e9ec8140d28f6c290127435b8dfff52199ccf"},"schema_version":"1.0","source":{"id":"1104.3419","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1104.3419","created_at":"2026-05-18T02:22:02Z"},{"alias_kind":"arxiv_version","alias_value":"1104.3419v1","created_at":"2026-05-18T02:22:02Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1104.3419","created_at":"2026-05-18T02:22:02Z"},{"alias_kind":"pith_short_12","alias_value":"Z7GAVRDG4L6N","created_at":"2026-05-18T12:26:47Z"},{"alias_kind":"pith_short_16","alias_value":"Z7GAVRDG4L6NPOQJ","created_at":"2026-05-18T12:26:47Z"},{"alias_kind":"pith_short_8","alias_value":"Z7GAVRDG","created_at":"2026-05-18T12:26:47Z"}],"graph_snapshots":[{"event_id":"sha256:ac9c4dd79fb195de9050fd1d9b30d4e11cc5e3e6325e9e1b3a307fc2dd7a27a8","target":"graph","created_at":"2026-05-18T02:22:02Z","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":"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","authors_text":"Christian Senger, Martin Bossert, Victor V. Zyablov, Vladimir R. Sidorenko","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2011-04-18T09:34:30Z","title":"Optimal Threshold-Based Multi-Trial Error/Erasure Decoding with the Guruswami-Sudan Algorithm"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1104.3419","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:f302c56fb5e7c27347e85f5646096be82dff27bd2624593d9519b5b53a859ce4","target":"record","created_at":"2026-05-18T02:22:02Z","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":"da826c69bbcae573548786e8cc451978e78edb91ed1cf240b5584d7a82f8f5d3","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2011-04-18T09:34:30Z","title_canon_sha256":"57a4745aa908dbf7bf3e22a74d8e9ec8140d28f6c290127435b8dfff52199ccf"},"schema_version":"1.0","source":{"id":"1104.3419","kind":"arxiv","version":1}},"canonical_sha256":"cfcc0ac466e2fcd7ba09ba3aaa598ef33573fc2fc459e716a1a1729ed27d58ba","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"cfcc0ac466e2fcd7ba09ba3aaa598ef33573fc2fc459e716a1a1729ed27d58ba","first_computed_at":"2026-05-18T02:22:02.550268Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:22:02.550268Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"E6NYYEYEAWCRXQrI7uPqqhUAclXtGL+cftaVBgXxaVt5DSJbmu0TKizSmwmrSxS36pYXewBBPfcy+K2Woi6pCg==","signature_status":"signed_v1","signed_at":"2026-05-18T02:22:02.551048Z","signed_message":"canonical_sha256_bytes"},"source_id":"1104.3419","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:f302c56fb5e7c27347e85f5646096be82dff27bd2624593d9519b5b53a859ce4","sha256:ac9c4dd79fb195de9050fd1d9b30d4e11cc5e3e6325e9e1b3a307fc2dd7a27a8"],"state_sha256":"ec0a76bdba04259f418de20ff06fbb9bf1cdc8fdb1a40cca71c0b8f21f69db9c"}