{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2011:NOK3RQW72ZI2S5Q3ZAE5DHSTLG","short_pith_number":"pith:NOK3RQW7","canonical_record":{"source":{"id":"1110.3898","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2011-10-18T07:45:01Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"4015e8c2dd0c3c27509555f754d4cb96c6315318f984a382eeee2d2d158f42f6","abstract_canon_sha256":"f9bb3108ed6b942285f877aa965f20a495326761e6ffafb6e6af0dc05752874d"},"schema_version":"1.0"},"canonical_sha256":"6b95b8c2dfd651a9761bc809d19e535982141e8342a522a2b76ab8d14b0f906d","source":{"kind":"arxiv","id":"1110.3898","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1110.3898","created_at":"2026-05-18T04:10:46Z"},{"alias_kind":"arxiv_version","alias_value":"1110.3898v1","created_at":"2026-05-18T04:10:46Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1110.3898","created_at":"2026-05-18T04:10:46Z"},{"alias_kind":"pith_short_12","alias_value":"NOK3RQW72ZI2","created_at":"2026-05-18T12:26:37Z"},{"alias_kind":"pith_short_16","alias_value":"NOK3RQW72ZI2S5Q3","created_at":"2026-05-18T12:26:37Z"},{"alias_kind":"pith_short_8","alias_value":"NOK3RQW7","created_at":"2026-05-18T12:26:37Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2011:NOK3RQW72ZI2S5Q3ZAE5DHSTLG","target":"record","payload":{"canonical_record":{"source":{"id":"1110.3898","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2011-10-18T07:45:01Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"4015e8c2dd0c3c27509555f754d4cb96c6315318f984a382eeee2d2d158f42f6","abstract_canon_sha256":"f9bb3108ed6b942285f877aa965f20a495326761e6ffafb6e6af0dc05752874d"},"schema_version":"1.0"},"canonical_sha256":"6b95b8c2dfd651a9761bc809d19e535982141e8342a522a2b76ab8d14b0f906d","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:10:46.733709Z","signature_b64":"D/zcVYjBHHsvS8Sv27pidkp/AzgwZIBsqbEIFlS+5ybpWg+CZzGPWPJe1aan5/GgO6sq9Q6OBcDk/h6xB9QhCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6b95b8c2dfd651a9761bc809d19e535982141e8342a522a2b76ab8d14b0f906d","last_reissued_at":"2026-05-18T04:10:46.733264Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:10:46.733264Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1110.3898","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-18T04:10:46Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"+D9guhYindLAYmpLJWPEIQJnZSL9jXXD9EEBgbBvN3Gw0GyZT6MBfV4vEJeU7CfhvWqPZ3/8u4mQZnYs4lokAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-27T21:25:56.343588Z"},"content_sha256":"a16dbfa4fa326dea0cd74ec3bce78ef2fb85f63083f122a102fe39dc9774b044","schema_version":"1.0","event_id":"sha256:a16dbfa4fa326dea0cd74ec3bce78ef2fb85f63083f122a102fe39dc9774b044"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2011:NOK3RQW72ZI2S5Q3ZAE5DHSTLG","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"An Interpolation Procedure for List Decoding Reed--Solomon codes Based on Generalized Key Equations","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Alexander Zeh (INRIA Saclay - Ile de France), Christian Gentner (DLR), Daniel Augot (INRIA Saclay - Ile de France)","submitted_at":"2011-10-18T07:45:01Z","abstract_excerpt":"The key step of syndrome-based decoding of Reed-Solomon codes up to half the minimum distance is to solve the so-called Key Equation. List decoding algorithms, capable of decoding beyond half the minimum distance, are based on interpolation and factorization of multivariate polynomials. This article provides a link between syndrome-based decoding approaches based on Key Equations and the interpolation-based list decoding algorithms of Guruswami and Sudan for Reed-Solomon codes. The original interpolation conditions of Guruswami and Sudan for Reed-Solomon codes are reformulated in terms of a se"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1110.3898","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-18T04:10:46Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"cSkmwygOfTZuwpuUvDe3x7g0E6uIpnoANNTZgcOQkTeYHtt56RTN7UOe3oi3y25iVO9zjG4qiTKbGvIBil39AA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-27T21:25:56.343931Z"},"content_sha256":"5baa341bc6e7d213998e4a266908d1529a1ff486777a3cc090dda4f8b9231ee4","schema_version":"1.0","event_id":"sha256:5baa341bc6e7d213998e4a266908d1529a1ff486777a3cc090dda4f8b9231ee4"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/NOK3RQW72ZI2S5Q3ZAE5DHSTLG/bundle.json","state_url":"https://pith.science/pith/NOK3RQW72ZI2S5Q3ZAE5DHSTLG/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/NOK3RQW72ZI2S5Q3ZAE5DHSTLG/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-06-27T21:25:56Z","links":{"resolver":"https://pith.science/pith/NOK3RQW72ZI2S5Q3ZAE5DHSTLG","bundle":"https://pith.science/pith/NOK3RQW72ZI2S5Q3ZAE5DHSTLG/bundle.json","state":"https://pith.science/pith/NOK3RQW72ZI2S5Q3ZAE5DHSTLG/state.json","well_known_bundle":"https://pith.science/.well-known/pith/NOK3RQW72ZI2S5Q3ZAE5DHSTLG/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2011:NOK3RQW72ZI2S5Q3ZAE5DHSTLG","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":"f9bb3108ed6b942285f877aa965f20a495326761e6ffafb6e6af0dc05752874d","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2011-10-18T07:45:01Z","title_canon_sha256":"4015e8c2dd0c3c27509555f754d4cb96c6315318f984a382eeee2d2d158f42f6"},"schema_version":"1.0","source":{"id":"1110.3898","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1110.3898","created_at":"2026-05-18T04:10:46Z"},{"alias_kind":"arxiv_version","alias_value":"1110.3898v1","created_at":"2026-05-18T04:10:46Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1110.3898","created_at":"2026-05-18T04:10:46Z"},{"alias_kind":"pith_short_12","alias_value":"NOK3RQW72ZI2","created_at":"2026-05-18T12:26:37Z"},{"alias_kind":"pith_short_16","alias_value":"NOK3RQW72ZI2S5Q3","created_at":"2026-05-18T12:26:37Z"},{"alias_kind":"pith_short_8","alias_value":"NOK3RQW7","created_at":"2026-05-18T12:26:37Z"}],"graph_snapshots":[{"event_id":"sha256:5baa341bc6e7d213998e4a266908d1529a1ff486777a3cc090dda4f8b9231ee4","target":"graph","created_at":"2026-05-18T04:10:46Z","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":"The key step of syndrome-based decoding of Reed-Solomon codes up to half the minimum distance is to solve the so-called Key Equation. List decoding algorithms, capable of decoding beyond half the minimum distance, are based on interpolation and factorization of multivariate polynomials. This article provides a link between syndrome-based decoding approaches based on Key Equations and the interpolation-based list decoding algorithms of Guruswami and Sudan for Reed-Solomon codes. The original interpolation conditions of Guruswami and Sudan for Reed-Solomon codes are reformulated in terms of a se","authors_text":"Alexander Zeh (INRIA Saclay - Ile de France), Christian Gentner (DLR), Daniel Augot (INRIA Saclay - Ile de France)","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2011-10-18T07:45:01Z","title":"An Interpolation Procedure for List Decoding Reed--Solomon codes Based on Generalized Key Equations"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1110.3898","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:a16dbfa4fa326dea0cd74ec3bce78ef2fb85f63083f122a102fe39dc9774b044","target":"record","created_at":"2026-05-18T04:10:46Z","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":"f9bb3108ed6b942285f877aa965f20a495326761e6ffafb6e6af0dc05752874d","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2011-10-18T07:45:01Z","title_canon_sha256":"4015e8c2dd0c3c27509555f754d4cb96c6315318f984a382eeee2d2d158f42f6"},"schema_version":"1.0","source":{"id":"1110.3898","kind":"arxiv","version":1}},"canonical_sha256":"6b95b8c2dfd651a9761bc809d19e535982141e8342a522a2b76ab8d14b0f906d","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"6b95b8c2dfd651a9761bc809d19e535982141e8342a522a2b76ab8d14b0f906d","first_computed_at":"2026-05-18T04:10:46.733264Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:10:46.733264Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"D/zcVYjBHHsvS8Sv27pidkp/AzgwZIBsqbEIFlS+5ybpWg+CZzGPWPJe1aan5/GgO6sq9Q6OBcDk/h6xB9QhCw==","signature_status":"signed_v1","signed_at":"2026-05-18T04:10:46.733709Z","signed_message":"canonical_sha256_bytes"},"source_id":"1110.3898","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:a16dbfa4fa326dea0cd74ec3bce78ef2fb85f63083f122a102fe39dc9774b044","sha256:5baa341bc6e7d213998e4a266908d1529a1ff486777a3cc090dda4f8b9231ee4"],"state_sha256":"b2d15d20f8943fbd9c196c87fefa6b03b279d8117187c1190d7b5f7767f6b071"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"iiKfeI7HDCKwLgGl9woJg2p+ZzlHQroi0UeZ7Seq5sMFVVaWmSw5rUGhNm7tr/N2fQXGxmKPJHG7HL3U/jvODQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-27T21:25:56.345921Z","bundle_sha256":"a8bc0d42233f0ec6f7e7ef7ce8358c41483fa220ffae666f4c9d8b9073e42f71"}}