{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:K6CZL77SMMWLSEEDD7JWXGOGAB","short_pith_number":"pith:K6CZL77S","schema_version":"1.0","canonical_sha256":"578595fff2632cb910831fd36b99c6005fe3eb803e1e31fc71808734c36c5439","source":{"kind":"arxiv","id":"1802.04031","version":2},"attestation_state":"computed","paper":{"title":"Rack-Aware Regenerating Codes for Data Centers","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Hanxu Hou, Kenneth W. Shum, Patrick P. C. Lee, Yuchong Hu","submitted_at":"2018-02-12T13:29:54Z","abstract_excerpt":"Erasure coding is widely used for massive storage in data centers to achieve high fault tolerance and low storage redundancy. Since the cross-rack communication cost is often high, it is critical to design erasure codes that minimize the cross-rack repair bandwidth during failure repair. In this paper, we analyze the optimal trade-off between storage redundancy and cross-rack repair bandwidth specifically for data centers, subject to the condition that the original data can be reconstructed from a sufficient number of any non-failed nodes. We characterize the optimal trade-off curve under func"},"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":"1802.04031","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2018-02-12T13:29:54Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"407efb9ca7fe2995fca1b4346d978f607add6e39def8174056268c83f3c1a75f","abstract_canon_sha256":"d2404de8b4abcca2552e5b745729b5e112c953f9b5767ca4395a3fae20648e4a"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:52:53.452290Z","signature_b64":"8Sbg0bER97jmhhtER3CI/jr7l2Q6L5psLsAEUbwgIWZlIuYyISYYXHKloAF3uk+wTO1esobxy5CV0THa7YSFDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"578595fff2632cb910831fd36b99c6005fe3eb803e1e31fc71808734c36c5439","last_reissued_at":"2026-05-17T23:52:53.451703Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:52:53.451703Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Rack-Aware Regenerating Codes for Data Centers","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Hanxu Hou, Kenneth W. Shum, Patrick P. C. Lee, Yuchong Hu","submitted_at":"2018-02-12T13:29:54Z","abstract_excerpt":"Erasure coding is widely used for massive storage in data centers to achieve high fault tolerance and low storage redundancy. Since the cross-rack communication cost is often high, it is critical to design erasure codes that minimize the cross-rack repair bandwidth during failure repair. In this paper, we analyze the optimal trade-off between storage redundancy and cross-rack repair bandwidth specifically for data centers, subject to the condition that the original data can be reconstructed from a sufficient number of any non-failed nodes. We characterize the optimal trade-off curve under func"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1802.04031","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":"1802.04031","created_at":"2026-05-17T23:52:53.451797+00:00"},{"alias_kind":"arxiv_version","alias_value":"1802.04031v2","created_at":"2026-05-17T23:52:53.451797+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1802.04031","created_at":"2026-05-17T23:52:53.451797+00:00"},{"alias_kind":"pith_short_12","alias_value":"K6CZL77SMMWL","created_at":"2026-05-18T12:32:33.847187+00:00"},{"alias_kind":"pith_short_16","alias_value":"K6CZL77SMMWLSEED","created_at":"2026-05-18T12:32:33.847187+00:00"},{"alias_kind":"pith_short_8","alias_value":"K6CZL77S","created_at":"2026-05-18T12:32:33.847187+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/K6CZL77SMMWLSEEDD7JWXGOGAB","json":"https://pith.science/pith/K6CZL77SMMWLSEEDD7JWXGOGAB.json","graph_json":"https://pith.science/api/pith-number/K6CZL77SMMWLSEEDD7JWXGOGAB/graph.json","events_json":"https://pith.science/api/pith-number/K6CZL77SMMWLSEEDD7JWXGOGAB/events.json","paper":"https://pith.science/paper/K6CZL77S"},"agent_actions":{"view_html":"https://pith.science/pith/K6CZL77SMMWLSEEDD7JWXGOGAB","download_json":"https://pith.science/pith/K6CZL77SMMWLSEEDD7JWXGOGAB.json","view_paper":"https://pith.science/paper/K6CZL77S","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1802.04031&json=true","fetch_graph":"https://pith.science/api/pith-number/K6CZL77SMMWLSEEDD7JWXGOGAB/graph.json","fetch_events":"https://pith.science/api/pith-number/K6CZL77SMMWLSEEDD7JWXGOGAB/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/K6CZL77SMMWLSEEDD7JWXGOGAB/action/timestamp_anchor","attest_storage":"https://pith.science/pith/K6CZL77SMMWLSEEDD7JWXGOGAB/action/storage_attestation","attest_author":"https://pith.science/pith/K6CZL77SMMWLSEEDD7JWXGOGAB/action/author_attestation","sign_citation":"https://pith.science/pith/K6CZL77SMMWLSEEDD7JWXGOGAB/action/citation_signature","submit_replication":"https://pith.science/pith/K6CZL77SMMWLSEEDD7JWXGOGAB/action/replication_record"}},"created_at":"2026-05-17T23:52:53.451797+00:00","updated_at":"2026-05-17T23:52:53.451797+00:00"}