{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2011:V3XKIERWZWPMOEFG3B3WCZEYGK","short_pith_number":"pith:V3XKIERW","canonical_record":{"source":{"id":"1104.0576","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2011-04-04T14:07:57Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"8b8d342e74183f915084a7a6eff4e8b2add496f1a8000297b5269e41784343bb","abstract_canon_sha256":"495e385ad29b12c683424e46409e05fd10d95246c43cdf6f3b7abdc4e29dfecd"},"schema_version":"1.0"},"canonical_sha256":"aeeea41236cd9ec710a6d87761649832850eda0ad62ad791b34883163b2738c7","source":{"kind":"arxiv","id":"1104.0576","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1104.0576","created_at":"2026-05-18T02:22:11Z"},{"alias_kind":"arxiv_version","alias_value":"1104.0576v1","created_at":"2026-05-18T02:22:11Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1104.0576","created_at":"2026-05-18T02:22:11Z"},{"alias_kind":"pith_short_12","alias_value":"V3XKIERWZWPM","created_at":"2026-05-18T12:26:42Z"},{"alias_kind":"pith_short_16","alias_value":"V3XKIERWZWPMOEFG","created_at":"2026-05-18T12:26:42Z"},{"alias_kind":"pith_short_8","alias_value":"V3XKIERW","created_at":"2026-05-18T12:26:42Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2011:V3XKIERWZWPMOEFG3B3WCZEYGK","target":"record","payload":{"canonical_record":{"source":{"id":"1104.0576","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2011-04-04T14:07:57Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"8b8d342e74183f915084a7a6eff4e8b2add496f1a8000297b5269e41784343bb","abstract_canon_sha256":"495e385ad29b12c683424e46409e05fd10d95246c43cdf6f3b7abdc4e29dfecd"},"schema_version":"1.0"},"canonical_sha256":"aeeea41236cd9ec710a6d87761649832850eda0ad62ad791b34883163b2738c7","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:22:11.185175Z","signature_b64":"EKVgL11c3yc9U+TZofh9gTZ9SFB3PqBd1eWCIrYEsXj765kmwJYP5PW8NRhPTRX5nu/HKtrIC9/xCu9cMr/8Bg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"aeeea41236cd9ec710a6d87761649832850eda0ad62ad791b34883163b2738c7","last_reissued_at":"2026-05-18T02:22:11.184591Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:22:11.184591Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1104.0576","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:11Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"8xNn+HMJl41tatUvaa+TxnLA0XeRI0NhWLUCi2Vl9M+Z82eb5PdMEgWbZ+GpbMQCAUCRHhoa5QBEZvFvZU5+Ag==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T18:53:58.925387Z"},"content_sha256":"0064c5d93ad3777a96e8f099c0dc100838e4db5cfce46948d8ecca05c885e6d5","schema_version":"1.0","event_id":"sha256:0064c5d93ad3777a96e8f099c0dc100838e4db5cfce46948d8ecca05c885e6d5"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2011:V3XKIERWZWPMOEFG3B3WCZEYGK","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Adaptive Single-Trial Error/Erasure Decoding of Reed-Solomon Codes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Christian Senger, Martin Bossert, Steffen Schober, Victor V. Zyablov, Vladimir R. Sidorenko","submitted_at":"2011-04-04T14:07:57Z","abstract_excerpt":"Algebraic decoding algorithms are commonly applied for the decoding of Reed-Solomon codes. Their main advantages are low computational complexity and predictable decoding capabilities. Many algorithms can be extended for correction of both errors and erasures. This enables the decoder to exploit binary quantized reliability information obtained from the transmission channel: Received symbols with high reliability are forwarded to the decoding algorithm while symbols with low reliability are erased. In this paper we investigate adaptive single-trial error/erasure decoding of Reed-Solomon codes,"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1104.0576","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:11Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"u1TJsNvmRoA4PQOYVJccAcWTDZXGi3tKRtE7VDsmq63plN7/D6AR2v+jKFRBKUjjZClrJag9CumRQVVyHEoXAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T18:53:58.926170Z"},"content_sha256":"12862d54e3f3c236ee967399ae34d2328b8bdd6bc279b64f4b4b005b50d9eba7","schema_version":"1.0","event_id":"sha256:12862d54e3f3c236ee967399ae34d2328b8bdd6bc279b64f4b4b005b50d9eba7"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/V3XKIERWZWPMOEFG3B3WCZEYGK/bundle.json","state_url":"https://pith.science/pith/V3XKIERWZWPMOEFG3B3WCZEYGK/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/V3XKIERWZWPMOEFG3B3WCZEYGK/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-28T18:53:58Z","links":{"resolver":"https://pith.science/pith/V3XKIERWZWPMOEFG3B3WCZEYGK","bundle":"https://pith.science/pith/V3XKIERWZWPMOEFG3B3WCZEYGK/bundle.json","state":"https://pith.science/pith/V3XKIERWZWPMOEFG3B3WCZEYGK/state.json","well_known_bundle":"https://pith.science/.well-known/pith/V3XKIERWZWPMOEFG3B3WCZEYGK/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2011:V3XKIERWZWPMOEFG3B3WCZEYGK","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":"495e385ad29b12c683424e46409e05fd10d95246c43cdf6f3b7abdc4e29dfecd","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2011-04-04T14:07:57Z","title_canon_sha256":"8b8d342e74183f915084a7a6eff4e8b2add496f1a8000297b5269e41784343bb"},"schema_version":"1.0","source":{"id":"1104.0576","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1104.0576","created_at":"2026-05-18T02:22:11Z"},{"alias_kind":"arxiv_version","alias_value":"1104.0576v1","created_at":"2026-05-18T02:22:11Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1104.0576","created_at":"2026-05-18T02:22:11Z"},{"alias_kind":"pith_short_12","alias_value":"V3XKIERWZWPM","created_at":"2026-05-18T12:26:42Z"},{"alias_kind":"pith_short_16","alias_value":"V3XKIERWZWPMOEFG","created_at":"2026-05-18T12:26:42Z"},{"alias_kind":"pith_short_8","alias_value":"V3XKIERW","created_at":"2026-05-18T12:26:42Z"}],"graph_snapshots":[{"event_id":"sha256:12862d54e3f3c236ee967399ae34d2328b8bdd6bc279b64f4b4b005b50d9eba7","target":"graph","created_at":"2026-05-18T02:22:11Z","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":"Algebraic decoding algorithms are commonly applied for the decoding of Reed-Solomon codes. Their main advantages are low computational complexity and predictable decoding capabilities. Many algorithms can be extended for correction of both errors and erasures. This enables the decoder to exploit binary quantized reliability information obtained from the transmission channel: Received symbols with high reliability are forwarded to the decoding algorithm while symbols with low reliability are erased. In this paper we investigate adaptive single-trial error/erasure decoding of Reed-Solomon codes,","authors_text":"Christian Senger, Martin Bossert, Steffen Schober, 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-04T14:07:57Z","title":"Adaptive Single-Trial Error/Erasure Decoding of Reed-Solomon Codes"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1104.0576","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:0064c5d93ad3777a96e8f099c0dc100838e4db5cfce46948d8ecca05c885e6d5","target":"record","created_at":"2026-05-18T02:22:11Z","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":"495e385ad29b12c683424e46409e05fd10d95246c43cdf6f3b7abdc4e29dfecd","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2011-04-04T14:07:57Z","title_canon_sha256":"8b8d342e74183f915084a7a6eff4e8b2add496f1a8000297b5269e41784343bb"},"schema_version":"1.0","source":{"id":"1104.0576","kind":"arxiv","version":1}},"canonical_sha256":"aeeea41236cd9ec710a6d87761649832850eda0ad62ad791b34883163b2738c7","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"aeeea41236cd9ec710a6d87761649832850eda0ad62ad791b34883163b2738c7","first_computed_at":"2026-05-18T02:22:11.184591Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:22:11.184591Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"EKVgL11c3yc9U+TZofh9gTZ9SFB3PqBd1eWCIrYEsXj765kmwJYP5PW8NRhPTRX5nu/HKtrIC9/xCu9cMr/8Bg==","signature_status":"signed_v1","signed_at":"2026-05-18T02:22:11.185175Z","signed_message":"canonical_sha256_bytes"},"source_id":"1104.0576","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:0064c5d93ad3777a96e8f099c0dc100838e4db5cfce46948d8ecca05c885e6d5","sha256:12862d54e3f3c236ee967399ae34d2328b8bdd6bc279b64f4b4b005b50d9eba7"],"state_sha256":"51ba85dc959c9882f3a58939d2c7607c0efa867dd003ccbf20a0e99e98535ff0"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"rMB42HFLuLvtpgTByqkwTg6emT8E6S3wCQNRKRZxSz2rjsY6bv4BSTo08JKWN511RgNTtb2bttAzk5BhRGUICA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-28T18:53:58.930742Z","bundle_sha256":"af0f06da8adbfc7bd081c5bc6fa3e077d1e4afabd361b21a621357f92ff68251"}}