{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2011:Z7GAVRDG4L6NPOQJXI5KUWMO6M","short_pith_number":"pith:Z7GAVRDG","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"},"canonical_sha256":"cfcc0ac466e2fcd7ba09ba3aaa598ef33573fc2fc459e716a1a1729ed27d58ba","source":{"kind":"arxiv","id":"1104.3419","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"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2011:Z7GAVRDG4L6NPOQJXI5KUWMO6M","target":"record","payload":{"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"},"canonical_sha256":"cfcc0ac466e2fcd7ba09ba3aaa598ef33573fc2fc459e716a1a1729ed27d58ba","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"},"source_kind":"arxiv","source_id":"1104.3419","source_version":1,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T02:22:02Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"BzMNRPEOWyvjmWf9ttdoqG8GV6KN+QZUtJHGIYSWH2L0iG5w7E7x9cqPNDzsSU/spsgPLDLuztkBJMLq3IOhDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T08:39:38.301872Z"},"content_sha256":"f302c56fb5e7c27347e85f5646096be82dff27bd2624593d9519b5b53a859ce4","schema_version":"1.0","event_id":"sha256:f302c56fb5e7c27347e85f5646096be82dff27bd2624593d9519b5b53a859ce4"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2011:Z7GAVRDG4L6NPOQJXI5KUWMO6M","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T02:22:02Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"y/kI/2Xmrxso8OCEHfo8Fsa5H1B/FI2H+YWGJ7gfJpp6SGXoT+cQNBiL7mfHfbXWHlhrn74rcXktEKa0KFbMCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T08:39:38.302219Z"},"content_sha256":"ac9c4dd79fb195de9050fd1d9b30d4e11cc5e3e6325e9e1b3a307fc2dd7a27a8","schema_version":"1.0","event_id":"sha256:ac9c4dd79fb195de9050fd1d9b30d4e11cc5e3e6325e9e1b3a307fc2dd7a27a8"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/Z7GAVRDG4L6NPOQJXI5KUWMO6M/bundle.json","state_url":"https://pith.science/pith/Z7GAVRDG4L6NPOQJXI5KUWMO6M/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/Z7GAVRDG4L6NPOQJXI5KUWMO6M/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-05-28T08:39:38Z","links":{"resolver":"https://pith.science/pith/Z7GAVRDG4L6NPOQJXI5KUWMO6M","bundle":"https://pith.science/pith/Z7GAVRDG4L6NPOQJXI5KUWMO6M/bundle.json","state":"https://pith.science/pith/Z7GAVRDG4L6NPOQJXI5KUWMO6M/state.json","well_known_bundle":"https://pith.science/.well-known/pith/Z7GAVRDG4L6NPOQJXI5KUWMO6M/bundle.json"},"state":{"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"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Q7GLNZQ9P4/WspKB/6P6I0n3EAHfyVp+RjdQ250816ndll3ubDdWhO+jjKU2Ow3OkABrLaCfRusDB9kTyUunBg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-28T08:39:38.304716Z","bundle_sha256":"5bff26504a7beb6fe1d251dfa273f71ad8945138b2c6bf0991f296d4a0270817"}}