{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:43C3ZUPG24W7F5E65QVOFZIZTL","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":"241653f198ce20949fd9699b7b66cddb0e602cbc657f264d51fdce5aad1b8db3","cross_cats_sorted":["cs.CR","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-11-07T17:02:11Z","title_canon_sha256":"d71f37a46dc3365d58f1140c8724f4d19994a725cd5bb9c71d206a1a15d74b57"},"schema_version":"1.0","source":{"id":"1511.02378","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1511.02378","created_at":"2026-05-18T01:27:30Z"},{"alias_kind":"arxiv_version","alias_value":"1511.02378v1","created_at":"2026-05-18T01:27:30Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1511.02378","created_at":"2026-05-18T01:27:30Z"},{"alias_kind":"pith_short_12","alias_value":"43C3ZUPG24W7","created_at":"2026-05-18T12:29:02Z"},{"alias_kind":"pith_short_16","alias_value":"43C3ZUPG24W7F5E6","created_at":"2026-05-18T12:29:02Z"},{"alias_kind":"pith_short_8","alias_value":"43C3ZUPG","created_at":"2026-05-18T12:29:02Z"}],"graph_snapshots":[{"event_id":"sha256:b20a3a10ec6d74bc3ed0feba1361fbccffebf2dd90e0de1188a3429821794929","target":"graph","created_at":"2026-05-18T01:27:30Z","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":"Regenerating code is a class of code very suitable for distributed storage systems, which can maintain optimal bandwidth and storage space. Two types of important regenerating code have been constructed: the minimum storage regeneration (MSR) code and the minimum bandwidth regeneration (MBR) code. However, in hostile networks where adversaries can compromise storage nodes, the storage capacity of the network can be significantly affected. In this paper, we propose two optimal constructions of regenerating codes through rate-matching that can combat against this kind of adversaries in hostile n","authors_text":"Jian Li, Jian Ren, Tongtong Li","cross_cats":["cs.CR","math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-11-07T17:02:11Z","title":"Optimal Construction of Regenerating Code through Rate-matching in Hostile Networks"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1511.02378","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:3253441b653c95b53d49f104d337bad16253c4e9e2a8009a00c01f385cbea981","target":"record","created_at":"2026-05-18T01:27:30Z","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":"241653f198ce20949fd9699b7b66cddb0e602cbc657f264d51fdce5aad1b8db3","cross_cats_sorted":["cs.CR","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-11-07T17:02:11Z","title_canon_sha256":"d71f37a46dc3365d58f1140c8724f4d19994a725cd5bb9c71d206a1a15d74b57"},"schema_version":"1.0","source":{"id":"1511.02378","kind":"arxiv","version":1}},"canonical_sha256":"e6c5bcd1e6d72df2f49eec2ae2e5199adae01d165683c67b993f7bb212b5551e","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"e6c5bcd1e6d72df2f49eec2ae2e5199adae01d165683c67b993f7bb212b5551e","first_computed_at":"2026-05-18T01:27:30.446294Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:27:30.446294Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"DNRUuW90vqHBcfXbf5u3Qwe5iad+5kf1NadaH0tU5hTz1m2Kc9A/Op3uqVx/l7MOuvShoSpkrSMHQeatt1BuCg==","signature_status":"signed_v1","signed_at":"2026-05-18T01:27:30.446799Z","signed_message":"canonical_sha256_bytes"},"source_id":"1511.02378","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:3253441b653c95b53d49f104d337bad16253c4e9e2a8009a00c01f385cbea981","sha256:b20a3a10ec6d74bc3ed0feba1361fbccffebf2dd90e0de1188a3429821794929"],"state_sha256":"4e8f16a8b65492aa3a1c2612c27ec297c8ec9f0fd22fb37f666e0c19aeff0fbe"}