{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2025:XXBJADEKQFQ57GUP6HPAX3HFMJ","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":"fb7fc7470c2853d5258ddefe5a9f0ede35945022cf80032ce8698ae57ae15889","cross_cats_sorted":["math.IT","math.RA"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2025-06-10T17:43:04Z","title_canon_sha256":"b8f39f31276efe0a981a3ae211ac65310ce650e1f524f4393654dd9ec8b644f4"},"schema_version":"1.0","source":{"id":"2506.09017","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2506.09017","created_at":"2026-07-05T11:19:16Z"},{"alias_kind":"arxiv_version","alias_value":"2506.09017v1","created_at":"2026-07-05T11:19:16Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2506.09017","created_at":"2026-07-05T11:19:16Z"},{"alias_kind":"pith_short_12","alias_value":"XXBJADEKQFQ5","created_at":"2026-07-05T11:19:16Z"},{"alias_kind":"pith_short_16","alias_value":"XXBJADEKQFQ57GUP","created_at":"2026-07-05T11:19:16Z"},{"alias_kind":"pith_short_8","alias_value":"XXBJADEK","created_at":"2026-07-05T11:19:16Z"}],"graph_snapshots":[{"event_id":"sha256:461511939625d2c179b65781e6d8e9de54d47ff42c209a596005fb288ae5242e","target":"graph","created_at":"2026-07-05T11:19:16Z","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/2506.09017/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Codes over rings, especially over Galois rings, have been extensively studied for nearly three decades due to their similarity to linear codes over finite fields. A distributed storage system uses a linear code to encode a large file across several nodes. If one of the nodes fails, a linear exact repair scheme efficiently recovers the failed node by accessing and downloading data from the rest of the servers of the storage system. In this article, we develop a linear repair scheme for free maximum distance separable codes, which coincide with free maximum distance with respect to the rank code","authors_text":"Daniel P. Bossaller, Hiram H. L\\'opez","cross_cats":["math.IT","math.RA"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2025-06-10T17:43:04Z","title":"Linear exact repair schemes for free MDS and Reed-Solomon codes over Galois rings"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2506.09017","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:19ddf9d95e55d3354d7d613c8d5fefae52e741ae452647203a537bc41550f7d8","target":"record","created_at":"2026-07-05T11:19:16Z","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":"fb7fc7470c2853d5258ddefe5a9f0ede35945022cf80032ce8698ae57ae15889","cross_cats_sorted":["math.IT","math.RA"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2025-06-10T17:43:04Z","title_canon_sha256":"b8f39f31276efe0a981a3ae211ac65310ce650e1f524f4393654dd9ec8b644f4"},"schema_version":"1.0","source":{"id":"2506.09017","kind":"arxiv","version":1}},"canonical_sha256":"bdc2900c8a8161df9a8ff1de0bece5627aeb20e40204d0283b4b789efdee35f1","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"bdc2900c8a8161df9a8ff1de0bece5627aeb20e40204d0283b4b789efdee35f1","first_computed_at":"2026-07-05T11:19:16.762494Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T11:19:16.762494Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"1m7PRumfYvlY94bLZ0k4/FYuuf5FxAHGMbDarljjFfTeYJ/LDAeNR600tZCbMjjUSxcBfn9+Hu821e4DYcyODg==","signature_status":"signed_v1","signed_at":"2026-07-05T11:19:16.762898Z","signed_message":"canonical_sha256_bytes"},"source_id":"2506.09017","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:19ddf9d95e55d3354d7d613c8d5fefae52e741ae452647203a537bc41550f7d8","sha256:461511939625d2c179b65781e6d8e9de54d47ff42c209a596005fb288ae5242e"],"state_sha256":"9b315a19de7d94b8ed7aa07638a8cc5ddce077db1a3e5168b1b78cb7cd29c2f9"}