{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:AIYHBYW7POROWXW5QQHSAPSM7R","short_pith_number":"pith:AIYHBYW7","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"},"canonical_sha256":"023070e2df7ba2eb5edd840f203e4cfc6fea934dc3a904086b56573192ea8609","source":{"kind":"arxiv","id":"1704.03696","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1704.03696","created_at":"2026-05-18T00:35:09Z"},{"alias_kind":"arxiv_version","alias_value":"1704.03696v2","created_at":"2026-05-18T00:35:09Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1704.03696","created_at":"2026-05-18T00:35:09Z"},{"alias_kind":"pith_short_12","alias_value":"AIYHBYW7PORO","created_at":"2026-05-18T12:31:05Z"},{"alias_kind":"pith_short_16","alias_value":"AIYHBYW7POROWXW5","created_at":"2026-05-18T12:31:05Z"},{"alias_kind":"pith_short_8","alias_value":"AIYHBYW7","created_at":"2026-05-18T12:31:05Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:AIYHBYW7POROWXW5QQHSAPSM7R","target":"record","payload":{"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"},"canonical_sha256":"023070e2df7ba2eb5edd840f203e4cfc6fea934dc3a904086b56573192ea8609","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"},"source_kind":"arxiv","source_id":"1704.03696","source_version":2,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T00:35:09Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"0BVfWxcpxG/ophOpZGk+DtCXTfUzolKpWVTEesTlpfgNiL69o1IszKk1Ky4il4YDV36rqasNX4yDebzN2RZRCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T21:40:38.084433Z"},"content_sha256":"769cb747ce046683ee2ebe4cb90aa1e020d34ecdbae1aaf78dd26d569dfbdcf6","schema_version":"1.0","event_id":"sha256:769cb747ce046683ee2ebe4cb90aa1e020d34ecdbae1aaf78dd26d569dfbdcf6"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:AIYHBYW7POROWXW5QQHSAPSM7R","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T00:35:09Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"VF7ovzpq7hJJvn/MdOfNVuOfAmxa8oRwvOyYIO5UF58ifmpPLRvXhAZ/z0JqwhAPE9v78/HddPWQ42AhsGYrAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T21:40:38.085040Z"},"content_sha256":"fbc17ada1c120cc646cd580b4296550ec0ee36bb484b5da2311d451591962580","schema_version":"1.0","event_id":"sha256:fbc17ada1c120cc646cd580b4296550ec0ee36bb484b5da2311d451591962580"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/AIYHBYW7POROWXW5QQHSAPSM7R/bundle.json","state_url":"https://pith.science/pith/AIYHBYW7POROWXW5QQHSAPSM7R/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/AIYHBYW7POROWXW5QQHSAPSM7R/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-05-25T21:40:38Z","links":{"resolver":"https://pith.science/pith/AIYHBYW7POROWXW5QQHSAPSM7R","bundle":"https://pith.science/pith/AIYHBYW7POROWXW5QQHSAPSM7R/bundle.json","state":"https://pith.science/pith/AIYHBYW7POROWXW5QQHSAPSM7R/state.json","well_known_bundle":"https://pith.science/.well-known/pith/AIYHBYW7POROWXW5QQHSAPSM7R/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:AIYHBYW7POROWXW5QQHSAPSM7R","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":"1b4469109d03e7cd97d30a6235488620e1ea98df2c92a070c4137759a7c8e1fa","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2017-04-12T10:55:16Z","title_canon_sha256":"a4db9638c89a241330cd388382d1a5b847ebe66c7ebf096477e5ec63fe1d516a"},"schema_version":"1.0","source":{"id":"1704.03696","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1704.03696","created_at":"2026-05-18T00:35:09Z"},{"alias_kind":"arxiv_version","alias_value":"1704.03696v2","created_at":"2026-05-18T00:35:09Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1704.03696","created_at":"2026-05-18T00:35:09Z"},{"alias_kind":"pith_short_12","alias_value":"AIYHBYW7PORO","created_at":"2026-05-18T12:31:05Z"},{"alias_kind":"pith_short_16","alias_value":"AIYHBYW7POROWXW5","created_at":"2026-05-18T12:31:05Z"},{"alias_kind":"pith_short_8","alias_value":"AIYHBYW7","created_at":"2026-05-18T12:31:05Z"}],"graph_snapshots":[{"event_id":"sha256:fbc17ada1c120cc646cd580b4296550ec0ee36bb484b5da2311d451591962580","target":"graph","created_at":"2026-05-18T00:35:09Z","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":"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","authors_text":"Dan Feng, Mi Zhang, Pan Zhou, Patrick P. C. Lee, Xiaolu Li, Xiaoyang Zhang, Yuchong Hu","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2017-04-12T10:55:16Z","title":"Optimal Repair Layering for Erasure-Coded Data Centers: From Theory to Practice"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1704.03696","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:769cb747ce046683ee2ebe4cb90aa1e020d34ecdbae1aaf78dd26d569dfbdcf6","target":"record","created_at":"2026-05-18T00:35:09Z","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":"1b4469109d03e7cd97d30a6235488620e1ea98df2c92a070c4137759a7c8e1fa","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2017-04-12T10:55:16Z","title_canon_sha256":"a4db9638c89a241330cd388382d1a5b847ebe66c7ebf096477e5ec63fe1d516a"},"schema_version":"1.0","source":{"id":"1704.03696","kind":"arxiv","version":2}},"canonical_sha256":"023070e2df7ba2eb5edd840f203e4cfc6fea934dc3a904086b56573192ea8609","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"023070e2df7ba2eb5edd840f203e4cfc6fea934dc3a904086b56573192ea8609","first_computed_at":"2026-05-18T00:35:09.166088Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:35:09.166088Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"sj1y1/x29oajrEzdWyv8jBrHmy9PwlqlUWcCQReZWPZSq2bcVHP79BJfxVIO5uUovSgIVy20jiMUsCefIaBTBg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:35:09.166787Z","signed_message":"canonical_sha256_bytes"},"source_id":"1704.03696","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:769cb747ce046683ee2ebe4cb90aa1e020d34ecdbae1aaf78dd26d569dfbdcf6","sha256:fbc17ada1c120cc646cd580b4296550ec0ee36bb484b5da2311d451591962580"],"state_sha256":"b6e988deafd25621a3f64ad55e9159c84004bb7982c499d04d4bb64305e50e91"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"yb3Kh5qVL8gZI8wPAIyO66KZZgdTZqNP7/AzHvs8Il3WN3tiUdll3cVRVElp4NgNvnV0UZxZUaeY7ATlWMG8Cw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-25T21:40:38.087648Z","bundle_sha256":"7dfd82305173f69c4c71ab4a9689be45c03cf1bbba136c7653481dfdfe2e24c5"}}