{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:GENDJFZM5LHYMNRKTNAF4RMQ6V","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":"105e134867adecf3a7a5ac8ad0fcf35806fc8aa0aa8411dd4c18ce889e6eea81","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2019-01-18T03:00:18Z","title_canon_sha256":"61e3aac8b61232f81b4689581d54b8d9c42bffd593168d07a56852c43aea5abf"},"schema_version":"1.0","source":{"id":"1901.06067","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1901.06067","created_at":"2026-07-05T03:29:38Z"},{"alias_kind":"arxiv_version","alias_value":"1901.06067v2","created_at":"2026-07-05T03:29:38Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1901.06067","created_at":"2026-07-05T03:29:38Z"},{"alias_kind":"pith_short_12","alias_value":"GENDJFZM5LHY","created_at":"2026-07-05T03:29:38Z"},{"alias_kind":"pith_short_16","alias_value":"GENDJFZM5LHYMNRK","created_at":"2026-07-05T03:29:38Z"},{"alias_kind":"pith_short_8","alias_value":"GENDJFZM","created_at":"2026-07-05T03:29:38Z"}],"graph_snapshots":[{"event_id":"sha256:c3299c90c3241fce0661455a7ebc3a2df6aebaef44729a6b55029ee74e722d8b","target":"graph","created_at":"2026-07-05T03:29:38Z","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/1901.06067/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"For high-rate linear systematic maximum distance separable (MDS) codes, most early constructions could initially optimally repair all the systematic nodes but not all the parity nodes. Fortunately, this issue was first solved by Li et al. in (IEEE Trans. Inform. Theory, 64(9), 6257-6267, 2018), where a transformation that can convert any nonbinary MDS array code into another one with desired properties was proposed. However, the transformation does not work for binary MDS array codes. In this paper, we address this issue by proposing another generic transformation that can convert any $[n, k]$","authors_text":"Camilla Hollanti, Jie Li, Xiaohu Tang","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2019-01-18T03:00:18Z","title":"A Generic Transformation for Optimal Node Repair in MDS Array Codes over $\\mathbf{F}_2$"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1901.06067","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:b6335270e2c99e0ea308ec49141ff8074f8dc5c91f02e1f099004d7a55cbdca3","target":"record","created_at":"2026-07-05T03:29:38Z","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":"105e134867adecf3a7a5ac8ad0fcf35806fc8aa0aa8411dd4c18ce889e6eea81","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2019-01-18T03:00:18Z","title_canon_sha256":"61e3aac8b61232f81b4689581d54b8d9c42bffd593168d07a56852c43aea5abf"},"schema_version":"1.0","source":{"id":"1901.06067","kind":"arxiv","version":2}},"canonical_sha256":"311a34972ceacf86362a9b405e4590f5520ed2c390db19684fe8e26d7daf1bf4","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"311a34972ceacf86362a9b405e4590f5520ed2c390db19684fe8e26d7daf1bf4","first_computed_at":"2026-07-05T03:29:38.267182Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T03:29:38.267182Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"fkd6wdek2QZ4yCcZQ6LZQa9Ujotqa0yTrvzbX5F6CI3Q4gNGWhmEOCL7lo+iOz8gZh6SbPVbL9P6WrqWksxDCQ==","signature_status":"signed_v1","signed_at":"2026-07-05T03:29:38.267617Z","signed_message":"canonical_sha256_bytes"},"source_id":"1901.06067","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:b6335270e2c99e0ea308ec49141ff8074f8dc5c91f02e1f099004d7a55cbdca3","sha256:c3299c90c3241fce0661455a7ebc3a2df6aebaef44729a6b55029ee74e722d8b"],"state_sha256":"22a52b618537f100637a4635dca84b32de1c54985febd3e53356b162d6d7d712"}