{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:B2DIJIC3QKHKJGBBY2J3JC7AEB","short_pith_number":"pith:B2DIJIC3","schema_version":"1.0","canonical_sha256":"0e8684a05b828ea49821c693b48be02066552874c1f3a5818b4188b7b1ede2e7","source":{"kind":"arxiv","id":"1706.05431","version":2},"attestation_state":"computed","paper":{"title":"Centralized Multi-Node Repair Regenerating Codes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Marwen Zorgui, Zhiying Wang","submitted_at":"2017-06-16T21:08:02Z","abstract_excerpt":"In a distributed storage system, recovering from multiple failures is a critical and frequent task that is crucial for maintaining the system's reliability and fault-tolerance. In this work, we focus on the problem of repairing multiple failures in a centralized way, which can be desirable in many data storage configurations, and we show that a significant repair traffic reduction is possible. First, the fundamental tradeoff between the repair bandwidth and the storage size for functional repair is established. Using a graph-theoretic formulation, the optimal tradeoff is identified as the solu"},"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":"1706.05431","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-06-16T21:08:02Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"87d20eb23e48a1dbc2704f5c531b3e20b583a234ae797cde78a6d04c41c23d9e","abstract_canon_sha256":"b44e0fb256ad62e36393d8988f485ecd3d3069f87e5d715d2d0366e204d67227"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:16:36.959995Z","signature_b64":"tiQGMLnkkwqnUozJqx5w4LKUcLfYgLaV4NfYZJ1ySzDMI+2jiAZajd3mkF6DTD8xFoG0czXgpIgh/IHay+wXAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0e8684a05b828ea49821c693b48be02066552874c1f3a5818b4188b7b1ede2e7","last_reissued_at":"2026-05-18T00:16:36.959387Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:16:36.959387Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Centralized Multi-Node Repair Regenerating Codes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Marwen Zorgui, Zhiying Wang","submitted_at":"2017-06-16T21:08:02Z","abstract_excerpt":"In a distributed storage system, recovering from multiple failures is a critical and frequent task that is crucial for maintaining the system's reliability and fault-tolerance. In this work, we focus on the problem of repairing multiple failures in a centralized way, which can be desirable in many data storage configurations, and we show that a significant repair traffic reduction is possible. First, the fundamental tradeoff between the repair bandwidth and the storage size for functional repair is established. Using a graph-theoretic formulation, the optimal tradeoff is identified as the solu"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1706.05431","kind":"arxiv","version":2},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"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":"1706.05431","created_at":"2026-05-18T00:16:36.959498+00:00"},{"alias_kind":"arxiv_version","alias_value":"1706.05431v2","created_at":"2026-05-18T00:16:36.959498+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1706.05431","created_at":"2026-05-18T00:16:36.959498+00:00"},{"alias_kind":"pith_short_12","alias_value":"B2DIJIC3QKHK","created_at":"2026-05-18T12:31:08.081275+00:00"},{"alias_kind":"pith_short_16","alias_value":"B2DIJIC3QKHKJGBB","created_at":"2026-05-18T12:31:08.081275+00:00"},{"alias_kind":"pith_short_8","alias_value":"B2DIJIC3","created_at":"2026-05-18T12:31:08.081275+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/B2DIJIC3QKHKJGBBY2J3JC7AEB","json":"https://pith.science/pith/B2DIJIC3QKHKJGBBY2J3JC7AEB.json","graph_json":"https://pith.science/api/pith-number/B2DIJIC3QKHKJGBBY2J3JC7AEB/graph.json","events_json":"https://pith.science/api/pith-number/B2DIJIC3QKHKJGBBY2J3JC7AEB/events.json","paper":"https://pith.science/paper/B2DIJIC3"},"agent_actions":{"view_html":"https://pith.science/pith/B2DIJIC3QKHKJGBBY2J3JC7AEB","download_json":"https://pith.science/pith/B2DIJIC3QKHKJGBBY2J3JC7AEB.json","view_paper":"https://pith.science/paper/B2DIJIC3","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1706.05431&json=true","fetch_graph":"https://pith.science/api/pith-number/B2DIJIC3QKHKJGBBY2J3JC7AEB/graph.json","fetch_events":"https://pith.science/api/pith-number/B2DIJIC3QKHKJGBBY2J3JC7AEB/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/B2DIJIC3QKHKJGBBY2J3JC7AEB/action/timestamp_anchor","attest_storage":"https://pith.science/pith/B2DIJIC3QKHKJGBBY2J3JC7AEB/action/storage_attestation","attest_author":"https://pith.science/pith/B2DIJIC3QKHKJGBBY2J3JC7AEB/action/author_attestation","sign_citation":"https://pith.science/pith/B2DIJIC3QKHKJGBBY2J3JC7AEB/action/citation_signature","submit_replication":"https://pith.science/pith/B2DIJIC3QKHKJGBBY2J3JC7AEB/action/replication_record"}},"created_at":"2026-05-18T00:16:36.959498+00:00","updated_at":"2026-05-18T00:16:36.959498+00:00"}