{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:AIYHBYW7POROWXW5QQHSAPSM7R","short_pith_number":"pith:AIYHBYW7","schema_version":"1.0","canonical_sha256":"023070e2df7ba2eb5edd840f203e4cfc6fea934dc3a904086b56573192ea8609","source":{"kind":"arxiv","id":"1704.03696","version":2},"attestation_state":"computed","paper":{"title":"Optimal Repair Layering for Erasure-Coded Data Centers: From Theory to Practice","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DC","authors_text":"Dan Feng, Mi Zhang, Pan Zhou, Patrick P. C. Lee, Xiaolu Li, Xiaoyang Zhang, Yuchong Hu","submitted_at":"2017-04-12T10:55:16Z","abstract_excerpt":"Repair performance in hierarchical data centers is often bottlenecked by cross-rack network transfer. Recent theoretical results show that the cross-rack repair traffic can be minimized through repair layering, whose idea is to partition a repair operation into inner-rack and cross-rack layers. However, how repair layering should be implemented and deployed in practice remains an open issue. In this paper, we address this issue by proposing a practical repair layering framework called DoubleR. We design two families of practical double regenerating codes (DRC), which not only minimize the cros"},"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":"1704.03696","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2017-04-12T10:55:16Z","cross_cats_sorted":[],"title_canon_sha256":"a4db9638c89a241330cd388382d1a5b847ebe66c7ebf096477e5ec63fe1d516a","abstract_canon_sha256":"1b4469109d03e7cd97d30a6235488620e1ea98df2c92a070c4137759a7c8e1fa"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:35:09.166787Z","signature_b64":"sj1y1/x29oajrEzdWyv8jBrHmy9PwlqlUWcCQReZWPZSq2bcVHP79BJfxVIO5uUovSgIVy20jiMUsCefIaBTBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"023070e2df7ba2eb5edd840f203e4cfc6fea934dc3a904086b56573192ea8609","last_reissued_at":"2026-05-18T00:35:09.166088Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:35:09.166088Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Optimal Repair Layering for Erasure-Coded Data Centers: From Theory to Practice","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DC","authors_text":"Dan Feng, Mi Zhang, Pan Zhou, Patrick P. C. Lee, Xiaolu Li, Xiaoyang Zhang, Yuchong Hu","submitted_at":"2017-04-12T10:55:16Z","abstract_excerpt":"Repair performance in hierarchical data centers is often bottlenecked by cross-rack network transfer. Recent theoretical results show that the cross-rack repair traffic can be minimized through repair layering, whose idea is to partition a repair operation into inner-rack and cross-rack layers. However, how repair layering should be implemented and deployed in practice remains an open issue. In this paper, we address this issue by proposing a practical repair layering framework called DoubleR. We design two families of practical double regenerating codes (DRC), which not only minimize the cros"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1704.03696","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":"1704.03696","created_at":"2026-05-18T00:35:09.166199+00:00"},{"alias_kind":"arxiv_version","alias_value":"1704.03696v2","created_at":"2026-05-18T00:35:09.166199+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1704.03696","created_at":"2026-05-18T00:35:09.166199+00:00"},{"alias_kind":"pith_short_12","alias_value":"AIYHBYW7PORO","created_at":"2026-05-18T12:31:05.417338+00:00"},{"alias_kind":"pith_short_16","alias_value":"AIYHBYW7POROWXW5","created_at":"2026-05-18T12:31:05.417338+00:00"},{"alias_kind":"pith_short_8","alias_value":"AIYHBYW7","created_at":"2026-05-18T12:31:05.417338+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/AIYHBYW7POROWXW5QQHSAPSM7R","json":"https://pith.science/pith/AIYHBYW7POROWXW5QQHSAPSM7R.json","graph_json":"https://pith.science/api/pith-number/AIYHBYW7POROWXW5QQHSAPSM7R/graph.json","events_json":"https://pith.science/api/pith-number/AIYHBYW7POROWXW5QQHSAPSM7R/events.json","paper":"https://pith.science/paper/AIYHBYW7"},"agent_actions":{"view_html":"https://pith.science/pith/AIYHBYW7POROWXW5QQHSAPSM7R","download_json":"https://pith.science/pith/AIYHBYW7POROWXW5QQHSAPSM7R.json","view_paper":"https://pith.science/paper/AIYHBYW7","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1704.03696&json=true","fetch_graph":"https://pith.science/api/pith-number/AIYHBYW7POROWXW5QQHSAPSM7R/graph.json","fetch_events":"https://pith.science/api/pith-number/AIYHBYW7POROWXW5QQHSAPSM7R/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/AIYHBYW7POROWXW5QQHSAPSM7R/action/timestamp_anchor","attest_storage":"https://pith.science/pith/AIYHBYW7POROWXW5QQHSAPSM7R/action/storage_attestation","attest_author":"https://pith.science/pith/AIYHBYW7POROWXW5QQHSAPSM7R/action/author_attestation","sign_citation":"https://pith.science/pith/AIYHBYW7POROWXW5QQHSAPSM7R/action/citation_signature","submit_replication":"https://pith.science/pith/AIYHBYW7POROWXW5QQHSAPSM7R/action/replication_record"}},"created_at":"2026-05-18T00:35:09.166199+00:00","updated_at":"2026-05-18T00:35:09.166199+00:00"}