{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:4VWAA3L3TGCOCBVTWZQIKSFYQS","short_pith_number":"pith:4VWAA3L3","canonical_record":{"source":{"id":"1406.0688","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2014-06-03T12:41:06Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"f40e4bc7cf4666fe500c1139b5d82323cde324af33a756d06239ec7736fb2e04","abstract_canon_sha256":"4bcf775af7cbbbf057852c18a58f208c1edf9135244260dd1b53c76dfb764bd1"},"schema_version":"1.0"},"canonical_sha256":"e56c006d7b9984e106b3b6608548b884a5ea7b07516a5023174c1ff749d4258c","source":{"kind":"arxiv","id":"1406.0688","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1406.0688","created_at":"2026-05-18T02:50:33Z"},{"alias_kind":"arxiv_version","alias_value":"1406.0688v1","created_at":"2026-05-18T02:50:33Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1406.0688","created_at":"2026-05-18T02:50:33Z"},{"alias_kind":"pith_short_12","alias_value":"4VWAA3L3TGCO","created_at":"2026-05-18T12:28:14Z"},{"alias_kind":"pith_short_16","alias_value":"4VWAA3L3TGCOCBVT","created_at":"2026-05-18T12:28:14Z"},{"alias_kind":"pith_short_8","alias_value":"4VWAA3L3","created_at":"2026-05-18T12:28:14Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:4VWAA3L3TGCOCBVTWZQIKSFYQS","target":"record","payload":{"canonical_record":{"source":{"id":"1406.0688","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2014-06-03T12:41:06Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"f40e4bc7cf4666fe500c1139b5d82323cde324af33a756d06239ec7736fb2e04","abstract_canon_sha256":"4bcf775af7cbbbf057852c18a58f208c1edf9135244260dd1b53c76dfb764bd1"},"schema_version":"1.0"},"canonical_sha256":"e56c006d7b9984e106b3b6608548b884a5ea7b07516a5023174c1ff749d4258c","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:50:33.063658Z","signature_b64":"Uph/3L1BCQQQIGMc4UVytjVAK5h/gnAA5V0e5dlu91eNnq7cx7pL/98Cv3jCxnpK1LC7PwnfmWOcfpfovBvXDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e56c006d7b9984e106b3b6608548b884a5ea7b07516a5023174c1ff749d4258c","last_reissued_at":"2026-05-18T02:50:33.063127Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:50:33.063127Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1406.0688","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:50:33Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"r2ivmtw7WRetByhp5KR0qbzXj3Kk5ngyM5WUpzq/6tHdveN1d45nQ7n2hexOBZWBFWKCin+7Z/YpfQpqHoVyAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-20T21:55:13.951043Z"},"content_sha256":"ece2b7ae322a81137282ef3ac932eb65f7008c0b6f3c8a7967b7ba0c373347cc","schema_version":"1.0","event_id":"sha256:ece2b7ae322a81137282ef3ac932eb65f7008c0b6f3c8a7967b7ba0c373347cc"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:4VWAA3L3TGCOCBVTWZQIKSFYQS","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Reduced List-Decoding of Reed--Solomon Codes Using Reliability Information","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Johan S. R. Nielsen, Martin Bossert, Mostafa Hosni Mohamed","submitted_at":"2014-06-03T12:41:06Z","abstract_excerpt":"We decode Reed-Solomon codes using soft information provided at the receiver. The Extended Euclidean Algorithm (EEA) is considered as an initial step to obtain an intermediate result. The final decoding result is obtained by interpolating the output of the EEA at the least reliable positions of the received word. We refer to this decoding method as reduced list-decoding, since not all received positions are used in the interpolation as in other list-decoding methods, such as the Guruswami-Sudan and Wu algorithms. Consequently the complexity of the interpolation step is reduced considerably. Th"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1406.0688","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:50:33Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"65cYudHlESLrAZR/hJWprqT3c66KuzIYcx9Hqn2OgCw4W8t45dd1AkqN5nLHDgSyrxeWV5AaIg1YUcY2lGn0CQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-20T21:55:13.951394Z"},"content_sha256":"785730bf19718c412e568bf6ecc8cb3cfddf3bbe94a6aec0ee6d9eff3d1cc584","schema_version":"1.0","event_id":"sha256:785730bf19718c412e568bf6ecc8cb3cfddf3bbe94a6aec0ee6d9eff3d1cc584"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/4VWAA3L3TGCOCBVTWZQIKSFYQS/bundle.json","state_url":"https://pith.science/pith/4VWAA3L3TGCOCBVTWZQIKSFYQS/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/4VWAA3L3TGCOCBVTWZQIKSFYQS/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-20T21:55:13Z","links":{"resolver":"https://pith.science/pith/4VWAA3L3TGCOCBVTWZQIKSFYQS","bundle":"https://pith.science/pith/4VWAA3L3TGCOCBVTWZQIKSFYQS/bundle.json","state":"https://pith.science/pith/4VWAA3L3TGCOCBVTWZQIKSFYQS/state.json","well_known_bundle":"https://pith.science/.well-known/pith/4VWAA3L3TGCOCBVTWZQIKSFYQS/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:4VWAA3L3TGCOCBVTWZQIKSFYQS","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":"4bcf775af7cbbbf057852c18a58f208c1edf9135244260dd1b53c76dfb764bd1","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2014-06-03T12:41:06Z","title_canon_sha256":"f40e4bc7cf4666fe500c1139b5d82323cde324af33a756d06239ec7736fb2e04"},"schema_version":"1.0","source":{"id":"1406.0688","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1406.0688","created_at":"2026-05-18T02:50:33Z"},{"alias_kind":"arxiv_version","alias_value":"1406.0688v1","created_at":"2026-05-18T02:50:33Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1406.0688","created_at":"2026-05-18T02:50:33Z"},{"alias_kind":"pith_short_12","alias_value":"4VWAA3L3TGCO","created_at":"2026-05-18T12:28:14Z"},{"alias_kind":"pith_short_16","alias_value":"4VWAA3L3TGCOCBVT","created_at":"2026-05-18T12:28:14Z"},{"alias_kind":"pith_short_8","alias_value":"4VWAA3L3","created_at":"2026-05-18T12:28:14Z"}],"graph_snapshots":[{"event_id":"sha256:785730bf19718c412e568bf6ecc8cb3cfddf3bbe94a6aec0ee6d9eff3d1cc584","target":"graph","created_at":"2026-05-18T02:50:33Z","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":"We decode Reed-Solomon codes using soft information provided at the receiver. The Extended Euclidean Algorithm (EEA) is considered as an initial step to obtain an intermediate result. The final decoding result is obtained by interpolating the output of the EEA at the least reliable positions of the received word. We refer to this decoding method as reduced list-decoding, since not all received positions are used in the interpolation as in other list-decoding methods, such as the Guruswami-Sudan and Wu algorithms. Consequently the complexity of the interpolation step is reduced considerably. Th","authors_text":"Johan S. R. Nielsen, Martin Bossert, Mostafa Hosni Mohamed","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2014-06-03T12:41:06Z","title":"Reduced List-Decoding of Reed--Solomon Codes Using Reliability Information"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1406.0688","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:ece2b7ae322a81137282ef3ac932eb65f7008c0b6f3c8a7967b7ba0c373347cc","target":"record","created_at":"2026-05-18T02:50:33Z","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":"4bcf775af7cbbbf057852c18a58f208c1edf9135244260dd1b53c76dfb764bd1","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2014-06-03T12:41:06Z","title_canon_sha256":"f40e4bc7cf4666fe500c1139b5d82323cde324af33a756d06239ec7736fb2e04"},"schema_version":"1.0","source":{"id":"1406.0688","kind":"arxiv","version":1}},"canonical_sha256":"e56c006d7b9984e106b3b6608548b884a5ea7b07516a5023174c1ff749d4258c","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"e56c006d7b9984e106b3b6608548b884a5ea7b07516a5023174c1ff749d4258c","first_computed_at":"2026-05-18T02:50:33.063127Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:50:33.063127Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Uph/3L1BCQQQIGMc4UVytjVAK5h/gnAA5V0e5dlu91eNnq7cx7pL/98Cv3jCxnpK1LC7PwnfmWOcfpfovBvXDg==","signature_status":"signed_v1","signed_at":"2026-05-18T02:50:33.063658Z","signed_message":"canonical_sha256_bytes"},"source_id":"1406.0688","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:ece2b7ae322a81137282ef3ac932eb65f7008c0b6f3c8a7967b7ba0c373347cc","sha256:785730bf19718c412e568bf6ecc8cb3cfddf3bbe94a6aec0ee6d9eff3d1cc584"],"state_sha256":"3e47736c765a5302b511791296b9be489f16d7dd7556131455ab213f04153dfc"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"7SwBALf3MS/Zcj/5sxq4w7XflrR9mfTHh/l/sRkWd13lcTfxXWwtdUBhIHseNQdvXeodTjs3wDIMoQWW6oyfBg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-20T21:55:13.953262Z","bundle_sha256":"8e9a9a52bcc6dc287a2e343106d6bf193862e91a699507ecaaff692f73f5306c"}}