{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:V76PVE4YFIM4HAK7CIXXMMXUQM","short_pith_number":"pith:V76PVE4Y","canonical_record":{"source":{"id":"1712.00938","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-12-04T07:38:35Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"5e64cd624d0df6a408de96512ca94ae0e0bb47dc575a3c2d6ba498680b1e4c0d","abstract_canon_sha256":"efe13e5cd7960705c2de9f9a774379062f0fc8d901de34ec34104014ab82e9ea"},"schema_version":"1.0"},"canonical_sha256":"affcfa93982a19c3815f122f7632f483303a34cf63c7b7917d1993033efd3c5e","source":{"kind":"arxiv","id":"1712.00938","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1712.00938","created_at":"2026-05-18T00:15:46Z"},{"alias_kind":"arxiv_version","alias_value":"1712.00938v2","created_at":"2026-05-18T00:15:46Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1712.00938","created_at":"2026-05-18T00:15:46Z"},{"alias_kind":"pith_short_12","alias_value":"V76PVE4YFIM4","created_at":"2026-05-18T12:31:49Z"},{"alias_kind":"pith_short_16","alias_value":"V76PVE4YFIM4HAK7","created_at":"2026-05-18T12:31:49Z"},{"alias_kind":"pith_short_8","alias_value":"V76PVE4Y","created_at":"2026-05-18T12:31:49Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:V76PVE4YFIM4HAK7CIXXMMXUQM","target":"record","payload":{"canonical_record":{"source":{"id":"1712.00938","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-12-04T07:38:35Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"5e64cd624d0df6a408de96512ca94ae0e0bb47dc575a3c2d6ba498680b1e4c0d","abstract_canon_sha256":"efe13e5cd7960705c2de9f9a774379062f0fc8d901de34ec34104014ab82e9ea"},"schema_version":"1.0"},"canonical_sha256":"affcfa93982a19c3815f122f7632f483303a34cf63c7b7917d1993033efd3c5e","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:15:46.891835Z","signature_b64":"+HPfUWvVJte6ivrPNB8Hem+CJ8luHWZsHlqBdtElu2R/8MSzKF+FecJoPddyvxEcV5D4HR1Jz4F50ONbweYWBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"affcfa93982a19c3815f122f7632f483303a34cf63c7b7917d1993033efd3c5e","last_reissued_at":"2026-05-18T00:15:46.891143Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:15:46.891143Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1712.00938","source_version":2,"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-18T00:15:46Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"poqep9SXJsFD7nR81YSIDb7KkRrBWuIj1/ieOwiNfKMcsxk49iwarL0FckurfMD4i7jT/D/Fdf3umgYH7l86Cw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-22T22:21:48.893298Z"},"content_sha256":"3dd3958fcfc47b8e6909e574d36344afcda28cbcd5b4bdb291b907bab63de0d2","schema_version":"1.0","event_id":"sha256:3dd3958fcfc47b8e6909e574d36344afcda28cbcd5b4bdb291b907bab63de0d2"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:V76PVE4YFIM4HAK7CIXXMMXUQM","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Algebraic Soft Decoding of Reed-Solomon Codes Using Module Minimization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Jiongyue Xing, Li Chen, Martin Bossert","submitted_at":"2017-12-04T07:38:35Z","abstract_excerpt":"The interpolation based algebraic decoding for Reed-Solomon (RS) codes can correct errors beyond half of the code's minimum Hamming distance. Using soft information, the algebraic soft decoding (ASD) further improves the decoding performance. This paper presents a unified study of two classical ASD algorithms in which the computationally expensive interpolation is solved by the module minimization (MM) technique. An explicit module basis construction for the two ASD algorithms will be introduced. Compared with Koetter's interpolation, the MM interpolation enables the algebraic Chase decoding a"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1712.00938","kind":"arxiv","version":2},"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-18T00:15:46Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"jkSj965V6RgTEJfxYFQ7PEODkXvXcU7BRaIhvnAj6cBVsl/40vQ7NXclnyJ02k6N+WKORtu6h8HwmUNk0rXICg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-22T22:21:48.893686Z"},"content_sha256":"c01a4eb3bc430f634af7b1916a1e3df543b5fb2e54cd6f12e7b446033ec6ae0d","schema_version":"1.0","event_id":"sha256:c01a4eb3bc430f634af7b1916a1e3df543b5fb2e54cd6f12e7b446033ec6ae0d"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/V76PVE4YFIM4HAK7CIXXMMXUQM/bundle.json","state_url":"https://pith.science/pith/V76PVE4YFIM4HAK7CIXXMMXUQM/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/V76PVE4YFIM4HAK7CIXXMMXUQM/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-22T22:21:48Z","links":{"resolver":"https://pith.science/pith/V76PVE4YFIM4HAK7CIXXMMXUQM","bundle":"https://pith.science/pith/V76PVE4YFIM4HAK7CIXXMMXUQM/bundle.json","state":"https://pith.science/pith/V76PVE4YFIM4HAK7CIXXMMXUQM/state.json","well_known_bundle":"https://pith.science/.well-known/pith/V76PVE4YFIM4HAK7CIXXMMXUQM/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:V76PVE4YFIM4HAK7CIXXMMXUQM","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":"efe13e5cd7960705c2de9f9a774379062f0fc8d901de34ec34104014ab82e9ea","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-12-04T07:38:35Z","title_canon_sha256":"5e64cd624d0df6a408de96512ca94ae0e0bb47dc575a3c2d6ba498680b1e4c0d"},"schema_version":"1.0","source":{"id":"1712.00938","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1712.00938","created_at":"2026-05-18T00:15:46Z"},{"alias_kind":"arxiv_version","alias_value":"1712.00938v2","created_at":"2026-05-18T00:15:46Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1712.00938","created_at":"2026-05-18T00:15:46Z"},{"alias_kind":"pith_short_12","alias_value":"V76PVE4YFIM4","created_at":"2026-05-18T12:31:49Z"},{"alias_kind":"pith_short_16","alias_value":"V76PVE4YFIM4HAK7","created_at":"2026-05-18T12:31:49Z"},{"alias_kind":"pith_short_8","alias_value":"V76PVE4Y","created_at":"2026-05-18T12:31:49Z"}],"graph_snapshots":[{"event_id":"sha256:c01a4eb3bc430f634af7b1916a1e3df543b5fb2e54cd6f12e7b446033ec6ae0d","target":"graph","created_at":"2026-05-18T00:15: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 interpolation based algebraic decoding for Reed-Solomon (RS) codes can correct errors beyond half of the code's minimum Hamming distance. Using soft information, the algebraic soft decoding (ASD) further improves the decoding performance. This paper presents a unified study of two classical ASD algorithms in which the computationally expensive interpolation is solved by the module minimization (MM) technique. An explicit module basis construction for the two ASD algorithms will be introduced. Compared with Koetter's interpolation, the MM interpolation enables the algebraic Chase decoding a","authors_text":"Jiongyue Xing, Li Chen, Martin Bossert","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-12-04T07:38:35Z","title":"Algebraic Soft Decoding of Reed-Solomon Codes Using Module Minimization"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1712.00938","kind":"arxiv","version":2},"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:3dd3958fcfc47b8e6909e574d36344afcda28cbcd5b4bdb291b907bab63de0d2","target":"record","created_at":"2026-05-18T00:15: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":"efe13e5cd7960705c2de9f9a774379062f0fc8d901de34ec34104014ab82e9ea","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-12-04T07:38:35Z","title_canon_sha256":"5e64cd624d0df6a408de96512ca94ae0e0bb47dc575a3c2d6ba498680b1e4c0d"},"schema_version":"1.0","source":{"id":"1712.00938","kind":"arxiv","version":2}},"canonical_sha256":"affcfa93982a19c3815f122f7632f483303a34cf63c7b7917d1993033efd3c5e","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"affcfa93982a19c3815f122f7632f483303a34cf63c7b7917d1993033efd3c5e","first_computed_at":"2026-05-18T00:15:46.891143Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:15:46.891143Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"+HPfUWvVJte6ivrPNB8Hem+CJ8luHWZsHlqBdtElu2R/8MSzKF+FecJoPddyvxEcV5D4HR1Jz4F50ONbweYWBw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:15:46.891835Z","signed_message":"canonical_sha256_bytes"},"source_id":"1712.00938","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:3dd3958fcfc47b8e6909e574d36344afcda28cbcd5b4bdb291b907bab63de0d2","sha256:c01a4eb3bc430f634af7b1916a1e3df543b5fb2e54cd6f12e7b446033ec6ae0d"],"state_sha256":"9747e99bfd21e1ff353d5dea94e3292d10071e035a2311a987b5500dd9dfd839"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Pxa3qDpOAcp0mQGrI1V5X7Szg0Cva4Gfalfezdxfg+iPkjxg1QGjalaZ2lzF++NFROkQpsmG3RBCGHFLStJhCQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-22T22:21:48.895559Z","bundle_sha256":"566119fdb665212183b0523b95691a39fb47b8d3a04f23f005540a32a7814dc0"}}