{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:K6CZL77SMMWLSEEDD7JWXGOGAB","short_pith_number":"pith:K6CZL77S","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"},"canonical_sha256":"578595fff2632cb910831fd36b99c6005fe3eb803e1e31fc71808734c36c5439","source":{"kind":"arxiv","id":"1802.04031","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1802.04031","created_at":"2026-05-17T23:52:53Z"},{"alias_kind":"arxiv_version","alias_value":"1802.04031v2","created_at":"2026-05-17T23:52:53Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1802.04031","created_at":"2026-05-17T23:52:53Z"},{"alias_kind":"pith_short_12","alias_value":"K6CZL77SMMWL","created_at":"2026-05-18T12:32:33Z"},{"alias_kind":"pith_short_16","alias_value":"K6CZL77SMMWLSEED","created_at":"2026-05-18T12:32:33Z"},{"alias_kind":"pith_short_8","alias_value":"K6CZL77S","created_at":"2026-05-18T12:32:33Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:K6CZL77SMMWLSEEDD7JWXGOGAB","target":"record","payload":{"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"},"canonical_sha256":"578595fff2632cb910831fd36b99c6005fe3eb803e1e31fc71808734c36c5439","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"},"source_kind":"arxiv","source_id":"1802.04031","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-17T23:52:53Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"IXpELYyOjMEo84/LltaTDGn8u2bOOClKtIdzI9oeBRahtO8qAqDsc3LjXnxQNZPxcrCicY1QOlnXqpLWCvppDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T19:06:13.384872Z"},"content_sha256":"59b2974ea218194353dfe27f28b54e7b7a60b6d11405066cf884b39948f75e88","schema_version":"1.0","event_id":"sha256:59b2974ea218194353dfe27f28b54e7b7a60b6d11405066cf884b39948f75e88"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:K6CZL77SMMWLSEEDD7JWXGOGAB","target":"graph","payload":{"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"},"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-17T23:52:53Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"XsIA5M1G0II36SckSCkkiTIwlqrE5GYd0Cg/U3Hd/Z9mta2T3JLu/PCy8L379r1BO9XQz3+KqfxGmmd0gJNMCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T19:06:13.385261Z"},"content_sha256":"c5f02010451b147f13751fa537ff8ca96f65f46e84a85a86f2874cfa1ffbbf98","schema_version":"1.0","event_id":"sha256:c5f02010451b147f13751fa537ff8ca96f65f46e84a85a86f2874cfa1ffbbf98"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/K6CZL77SMMWLSEEDD7JWXGOGAB/bundle.json","state_url":"https://pith.science/pith/K6CZL77SMMWLSEEDD7JWXGOGAB/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/K6CZL77SMMWLSEEDD7JWXGOGAB/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-26T19:06:13Z","links":{"resolver":"https://pith.science/pith/K6CZL77SMMWLSEEDD7JWXGOGAB","bundle":"https://pith.science/pith/K6CZL77SMMWLSEEDD7JWXGOGAB/bundle.json","state":"https://pith.science/pith/K6CZL77SMMWLSEEDD7JWXGOGAB/state.json","well_known_bundle":"https://pith.science/.well-known/pith/K6CZL77SMMWLSEEDD7JWXGOGAB/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:K6CZL77SMMWLSEEDD7JWXGOGAB","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":"d2404de8b4abcca2552e5b745729b5e112c953f9b5767ca4395a3fae20648e4a","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2018-02-12T13:29:54Z","title_canon_sha256":"407efb9ca7fe2995fca1b4346d978f607add6e39def8174056268c83f3c1a75f"},"schema_version":"1.0","source":{"id":"1802.04031","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1802.04031","created_at":"2026-05-17T23:52:53Z"},{"alias_kind":"arxiv_version","alias_value":"1802.04031v2","created_at":"2026-05-17T23:52:53Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1802.04031","created_at":"2026-05-17T23:52:53Z"},{"alias_kind":"pith_short_12","alias_value":"K6CZL77SMMWL","created_at":"2026-05-18T12:32:33Z"},{"alias_kind":"pith_short_16","alias_value":"K6CZL77SMMWLSEED","created_at":"2026-05-18T12:32:33Z"},{"alias_kind":"pith_short_8","alias_value":"K6CZL77S","created_at":"2026-05-18T12:32:33Z"}],"graph_snapshots":[{"event_id":"sha256:c5f02010451b147f13751fa537ff8ca96f65f46e84a85a86f2874cfa1ffbbf98","target":"graph","created_at":"2026-05-17T23:52:53Z","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":"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","authors_text":"Hanxu Hou, Kenneth W. Shum, Patrick P. C. Lee, Yuchong Hu","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2018-02-12T13:29:54Z","title":"Rack-Aware Regenerating Codes for Data Centers"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1802.04031","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:59b2974ea218194353dfe27f28b54e7b7a60b6d11405066cf884b39948f75e88","target":"record","created_at":"2026-05-17T23:52:53Z","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":"d2404de8b4abcca2552e5b745729b5e112c953f9b5767ca4395a3fae20648e4a","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2018-02-12T13:29:54Z","title_canon_sha256":"407efb9ca7fe2995fca1b4346d978f607add6e39def8174056268c83f3c1a75f"},"schema_version":"1.0","source":{"id":"1802.04031","kind":"arxiv","version":2}},"canonical_sha256":"578595fff2632cb910831fd36b99c6005fe3eb803e1e31fc71808734c36c5439","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"578595fff2632cb910831fd36b99c6005fe3eb803e1e31fc71808734c36c5439","first_computed_at":"2026-05-17T23:52:53.451703Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:52:53.451703Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"8Sbg0bER97jmhhtER3CI/jr7l2Q6L5psLsAEUbwgIWZlIuYyISYYXHKloAF3uk+wTO1esobxy5CV0THa7YSFDQ==","signature_status":"signed_v1","signed_at":"2026-05-17T23:52:53.452290Z","signed_message":"canonical_sha256_bytes"},"source_id":"1802.04031","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:59b2974ea218194353dfe27f28b54e7b7a60b6d11405066cf884b39948f75e88","sha256:c5f02010451b147f13751fa537ff8ca96f65f46e84a85a86f2874cfa1ffbbf98"],"state_sha256":"670fb67665d792f005dffe0498de3f53a51a09e4ca03a7af71d5635aa8f915dd"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ieFBPn/Y6EHc5XOCMu2Q8DJxiT52g7+E4/SyC1GYV9MFOxq9P+cz7B0xabwphrMNf9K2oX0bKkOWTn1vzBGIBA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-26T19:06:13.387994Z","bundle_sha256":"a4cf4744b115be04a6f963cca8f454a2bc7bbfab1de1da8bde2376284e50f8b9"}}