{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2024:HPA52SX3UKDRRJ3XTPNYDTOFS3","short_pith_number":"pith:HPA52SX3","canonical_record":{"source":{"id":"2407.19484","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2024-07-28T12:32:07Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"6362da700b09045e007a7f23a675531c3dbdb46ffcb2f288b7349c60f4af507a","abstract_canon_sha256":"4d75054baafd56441a64e00336a25968d3d67c64c17b235d0bd3b181ccdfe2ff"},"schema_version":"1.0"},"canonical_sha256":"3bc1dd4afba28718a7779bdb81cdc596f64be96ba51ded1bb88a1943f91b54c4","source":{"kind":"arxiv","id":"2407.19484","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2407.19484","created_at":"2026-07-05T08:49:40Z"},{"alias_kind":"arxiv_version","alias_value":"2407.19484v1","created_at":"2026-07-05T08:49:40Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2407.19484","created_at":"2026-07-05T08:49:40Z"},{"alias_kind":"pith_short_12","alias_value":"HPA52SX3UKDR","created_at":"2026-07-05T08:49:40Z"},{"alias_kind":"pith_short_16","alias_value":"HPA52SX3UKDRRJ3X","created_at":"2026-07-05T08:49:40Z"},{"alias_kind":"pith_short_8","alias_value":"HPA52SX3","created_at":"2026-07-05T08:49:40Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2024:HPA52SX3UKDRRJ3XTPNYDTOFS3","target":"record","payload":{"canonical_record":{"source":{"id":"2407.19484","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2024-07-28T12:32:07Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"6362da700b09045e007a7f23a675531c3dbdb46ffcb2f288b7349c60f4af507a","abstract_canon_sha256":"4d75054baafd56441a64e00336a25968d3d67c64c17b235d0bd3b181ccdfe2ff"},"schema_version":"1.0"},"canonical_sha256":"3bc1dd4afba28718a7779bdb81cdc596f64be96ba51ded1bb88a1943f91b54c4","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T08:49:40.610569Z","signature_b64":"8IICpNdZCD9cPBcgU+ftbM7JEIUZ9A4NnNgreNFXYcNhyDmTKO8gK6hjHJi/5D8qygWouEkc+O6LoXFVKbIKDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3bc1dd4afba28718a7779bdb81cdc596f64be96ba51ded1bb88a1943f91b54c4","last_reissued_at":"2026-07-05T08:49:40.610160Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T08:49:40.610160Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2407.19484","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-07-05T08:49:40Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ldfWKd+VAu2tfpLPUOtiM1OpzaMHbF1/UQ29EJfgw0P4ES8YhA1rBLtgEAa55cYDwsjgj4Fr2HgHMog3CG0VCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-05T15:01:12.931129Z"},"content_sha256":"fb67978919e62de12e3b322eeb6d79e9910e86f0cd99d05a22db92e60461907d","schema_version":"1.0","event_id":"sha256:fb67978919e62de12e3b322eeb6d79e9910e86f0cd99d05a22db92e60461907d"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2024:HPA52SX3UKDRRJ3XTPNYDTOFS3","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Error Correction Decoding Algorithms of RS Codes Based on An Earlier Termination Algorithm to Find The Error Locator Polynomial","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Bo Bai, Gong Zhang, Hanxu Hou, Hao Shi, Linqi Song, Zhengyi Jiang, Zhongyi Huang","submitted_at":"2024-07-28T12:32:07Z","abstract_excerpt":"Reed-Solomon (RS) codes are widely used to correct errors in storage systems. Finding the error locator polynomial is one of the key steps in the error correction procedure of RS codes. Modular Approach (MA) is an effective algorithm for solving the Welch-Berlekamp (WB) key-equation problem to find the error locator polynomial that needs $2t$ steps, where $t$ is the error correction capability. In this paper, we first present a new MA algorithm that only requires $2e$ steps and then propose two fast decoding algorithms for RS codes based on our MA algorithm, where $e$ is the number of errors a"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2407.19484","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2407.19484/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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-07-05T08:49:40Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"SdRvNBvJDyGvSWnc9WLiZwRSM86Gx2okpWBjqLVZFOZSBzcvjWUxGTvXvI9+K6Db8I0X+G0w18nAvvGrf7EtAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-05T15:01:12.931549Z"},"content_sha256":"a99b3277c4a6584df638f628416cda5a07ad976c8d052de592a701134186060b","schema_version":"1.0","event_id":"sha256:a99b3277c4a6584df638f628416cda5a07ad976c8d052de592a701134186060b"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/HPA52SX3UKDRRJ3XTPNYDTOFS3/bundle.json","state_url":"https://pith.science/pith/HPA52SX3UKDRRJ3XTPNYDTOFS3/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/HPA52SX3UKDRRJ3XTPNYDTOFS3/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-07-05T15:01:12Z","links":{"resolver":"https://pith.science/pith/HPA52SX3UKDRRJ3XTPNYDTOFS3","bundle":"https://pith.science/pith/HPA52SX3UKDRRJ3XTPNYDTOFS3/bundle.json","state":"https://pith.science/pith/HPA52SX3UKDRRJ3XTPNYDTOFS3/state.json","well_known_bundle":"https://pith.science/.well-known/pith/HPA52SX3UKDRRJ3XTPNYDTOFS3/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2024:HPA52SX3UKDRRJ3XTPNYDTOFS3","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":"4d75054baafd56441a64e00336a25968d3d67c64c17b235d0bd3b181ccdfe2ff","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2024-07-28T12:32:07Z","title_canon_sha256":"6362da700b09045e007a7f23a675531c3dbdb46ffcb2f288b7349c60f4af507a"},"schema_version":"1.0","source":{"id":"2407.19484","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2407.19484","created_at":"2026-07-05T08:49:40Z"},{"alias_kind":"arxiv_version","alias_value":"2407.19484v1","created_at":"2026-07-05T08:49:40Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2407.19484","created_at":"2026-07-05T08:49:40Z"},{"alias_kind":"pith_short_12","alias_value":"HPA52SX3UKDR","created_at":"2026-07-05T08:49:40Z"},{"alias_kind":"pith_short_16","alias_value":"HPA52SX3UKDRRJ3X","created_at":"2026-07-05T08:49:40Z"},{"alias_kind":"pith_short_8","alias_value":"HPA52SX3","created_at":"2026-07-05T08:49:40Z"}],"graph_snapshots":[{"event_id":"sha256:a99b3277c4a6584df638f628416cda5a07ad976c8d052de592a701134186060b","target":"graph","created_at":"2026-07-05T08:49:40Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2407.19484/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Reed-Solomon (RS) codes are widely used to correct errors in storage systems. Finding the error locator polynomial is one of the key steps in the error correction procedure of RS codes. Modular Approach (MA) is an effective algorithm for solving the Welch-Berlekamp (WB) key-equation problem to find the error locator polynomial that needs $2t$ steps, where $t$ is the error correction capability. In this paper, we first present a new MA algorithm that only requires $2e$ steps and then propose two fast decoding algorithms for RS codes based on our MA algorithm, where $e$ is the number of errors a","authors_text":"Bo Bai, Gong Zhang, Hanxu Hou, Hao Shi, Linqi Song, Zhengyi Jiang, Zhongyi Huang","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2024-07-28T12:32:07Z","title":"Error Correction Decoding Algorithms of RS Codes Based on An Earlier Termination Algorithm to Find The Error Locator Polynomial"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2407.19484","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:fb67978919e62de12e3b322eeb6d79e9910e86f0cd99d05a22db92e60461907d","target":"record","created_at":"2026-07-05T08:49:40Z","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":"4d75054baafd56441a64e00336a25968d3d67c64c17b235d0bd3b181ccdfe2ff","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2024-07-28T12:32:07Z","title_canon_sha256":"6362da700b09045e007a7f23a675531c3dbdb46ffcb2f288b7349c60f4af507a"},"schema_version":"1.0","source":{"id":"2407.19484","kind":"arxiv","version":1}},"canonical_sha256":"3bc1dd4afba28718a7779bdb81cdc596f64be96ba51ded1bb88a1943f91b54c4","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"3bc1dd4afba28718a7779bdb81cdc596f64be96ba51ded1bb88a1943f91b54c4","first_computed_at":"2026-07-05T08:49:40.610160Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T08:49:40.610160Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"8IICpNdZCD9cPBcgU+ftbM7JEIUZ9A4NnNgreNFXYcNhyDmTKO8gK6hjHJi/5D8qygWouEkc+O6LoXFVKbIKDQ==","signature_status":"signed_v1","signed_at":"2026-07-05T08:49:40.610569Z","signed_message":"canonical_sha256_bytes"},"source_id":"2407.19484","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:fb67978919e62de12e3b322eeb6d79e9910e86f0cd99d05a22db92e60461907d","sha256:a99b3277c4a6584df638f628416cda5a07ad976c8d052de592a701134186060b"],"state_sha256":"43ab3bca5317d76c569d38be737690f580e4b3c9a82dd91760e1ceaf2e0f8137"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"QnLplpuBwpjt3JGavFCC1+SdO2A60KXGifM7vMSM7JXJyUQ0MWRkFIJfZ4JWk28FSmuMrGWKaI/sLYpQuDMJAw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-05T15:01:12.935720Z","bundle_sha256":"39c0bc284d74f73b9931754a36c077561d57393d5a0d5fd9173e77b255e068dc"}}