{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:BWNHL4CKLLPJYBLNPCDJS6U5RG","short_pith_number":"pith:BWNHL4CK","schema_version":"1.0","canonical_sha256":"0d9a75f04a5ade9c056d7886997a9d89baeaa872750d13c8a123ccf05a0f585a","source":{"kind":"arxiv","id":"2606.05573","version":1},"attestation_state":"computed","paper":{"title":"Robust Repair of Reed-Solomon Codes","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Gaojun Luo, Han Mao Kiah, Stanislav Kruglik, Wilton Kim","submitted_at":"2026-06-04T01:47:13Z","abstract_excerpt":"We study the problem of robust repair of a single erasure in Reed--Solomon codes under low communication bandwidth. Focusing on the Guruswami--Wootters trace repair framework, we investigate whether a failed node can be correctly repaired in the presence of erroneous responses from helper nodes. Equivalently, we view the collection of downloaded traces as a code, which we call the repair-trace code. By characterizing the zero coefficients of the associated polynomial in terms of cyclotomic cosets, we derive upper bounds on the dimension $k$ that allow correction of a given number of erroneous "},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"2606.05573","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.IT","submitted_at":"2026-06-04T01:47:13Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"f14c3e24386c71e3f1e2ad55048ecce96a01ff63bf4808c74833f80b4a78d141","abstract_canon_sha256":"f53ac6ca1af0b45e1eba47b1f5e93dbdd3c9d9ae8a7b7adaf5c71fc8b32982be"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-06-05T01:14:55.274658Z","signature_b64":"ZGfYTAVicqZWpUGYDxYbPAShL7+0gTqxVR8OZ6Dan+t4G7FTKbu9BrMCVaT5T/4Y9tiZJ0rdRUeahMpTPGXjCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0d9a75f04a5ade9c056d7886997a9d89baeaa872750d13c8a123ccf05a0f585a","last_reissued_at":"2026-06-05T01:14:55.274208Z","signature_status":"signed_v1","first_computed_at":"2026-06-05T01:14:55.274208Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Robust Repair of Reed-Solomon Codes","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Gaojun Luo, Han Mao Kiah, Stanislav Kruglik, Wilton Kim","submitted_at":"2026-06-04T01:47:13Z","abstract_excerpt":"We study the problem of robust repair of a single erasure in Reed--Solomon codes under low communication bandwidth. Focusing on the Guruswami--Wootters trace repair framework, we investigate whether a failed node can be correctly repaired in the presence of erroneous responses from helper nodes. Equivalently, we view the collection of downloaded traces as a code, which we call the repair-trace code. By characterizing the zero coefficients of the associated polynomial in terms of cyclotomic cosets, we derive upper bounds on the dimension $k$ that allow correction of a given number of erroneous "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2606.05573","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/2606.05573/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"},"aliases":[{"alias_kind":"arxiv","alias_value":"2606.05573","created_at":"2026-06-05T01:14:55.274267+00:00"},{"alias_kind":"arxiv_version","alias_value":"2606.05573v1","created_at":"2026-06-05T01:14:55.274267+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2606.05573","created_at":"2026-06-05T01:14:55.274267+00:00"},{"alias_kind":"pith_short_12","alias_value":"BWNHL4CKLLPJ","created_at":"2026-06-05T01:14:55.274267+00:00"},{"alias_kind":"pith_short_16","alias_value":"BWNHL4CKLLPJYBLN","created_at":"2026-06-05T01:14:55.274267+00:00"},{"alias_kind":"pith_short_8","alias_value":"BWNHL4CK","created_at":"2026-06-05T01:14:55.274267+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/BWNHL4CKLLPJYBLNPCDJS6U5RG","json":"https://pith.science/pith/BWNHL4CKLLPJYBLNPCDJS6U5RG.json","graph_json":"https://pith.science/api/pith-number/BWNHL4CKLLPJYBLNPCDJS6U5RG/graph.json","events_json":"https://pith.science/api/pith-number/BWNHL4CKLLPJYBLNPCDJS6U5RG/events.json","paper":"https://pith.science/paper/BWNHL4CK"},"agent_actions":{"view_html":"https://pith.science/pith/BWNHL4CKLLPJYBLNPCDJS6U5RG","download_json":"https://pith.science/pith/BWNHL4CKLLPJYBLNPCDJS6U5RG.json","view_paper":"https://pith.science/paper/BWNHL4CK","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2606.05573&json=true","fetch_graph":"https://pith.science/api/pith-number/BWNHL4CKLLPJYBLNPCDJS6U5RG/graph.json","fetch_events":"https://pith.science/api/pith-number/BWNHL4CKLLPJYBLNPCDJS6U5RG/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/BWNHL4CKLLPJYBLNPCDJS6U5RG/action/timestamp_anchor","attest_storage":"https://pith.science/pith/BWNHL4CKLLPJYBLNPCDJS6U5RG/action/storage_attestation","attest_author":"https://pith.science/pith/BWNHL4CKLLPJYBLNPCDJS6U5RG/action/author_attestation","sign_citation":"https://pith.science/pith/BWNHL4CKLLPJYBLNPCDJS6U5RG/action/citation_signature","submit_replication":"https://pith.science/pith/BWNHL4CKLLPJYBLNPCDJS6U5RG/action/replication_record"}},"created_at":"2026-06-05T01:14:55.274267+00:00","updated_at":"2026-06-05T01:14:55.274267+00:00"}