{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:HTIBTCVX3HFEWQPAIQ4KUBMHKR","short_pith_number":"pith:HTIBTCVX","canonical_record":{"source":{"id":"1701.01539","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-01-06T04:05:09Z","cross_cats_sorted":["cs.DC","cs.DM"],"title_canon_sha256":"ff11c72e5d8320532626668c13cb02ff23d877f222e42cd11c7406fada08b55f","abstract_canon_sha256":"ef4de72e8e6416a1084c70d90b92c80425790e47d69ec8b092975c5eef5a3a96"},"schema_version":"1.0"},"canonical_sha256":"3cd0198ab7d9ca4b41e04438aa058754738181e6e5f8cba29414e6aaab1f3d83","source":{"kind":"arxiv","id":"1701.01539","version":4},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1701.01539","created_at":"2026-05-18T00:46:04Z"},{"alias_kind":"arxiv_version","alias_value":"1701.01539v4","created_at":"2026-05-18T00:46:04Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1701.01539","created_at":"2026-05-18T00:46:04Z"},{"alias_kind":"pith_short_12","alias_value":"HTIBTCVX3HFE","created_at":"2026-05-18T12:31:18Z"},{"alias_kind":"pith_short_16","alias_value":"HTIBTCVX3HFEWQPA","created_at":"2026-05-18T12:31:18Z"},{"alias_kind":"pith_short_8","alias_value":"HTIBTCVX","created_at":"2026-05-18T12:31:18Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:HTIBTCVX3HFEWQPAIQ4KUBMHKR","target":"record","payload":{"canonical_record":{"source":{"id":"1701.01539","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-01-06T04:05:09Z","cross_cats_sorted":["cs.DC","cs.DM"],"title_canon_sha256":"ff11c72e5d8320532626668c13cb02ff23d877f222e42cd11c7406fada08b55f","abstract_canon_sha256":"ef4de72e8e6416a1084c70d90b92c80425790e47d69ec8b092975c5eef5a3a96"},"schema_version":"1.0"},"canonical_sha256":"3cd0198ab7d9ca4b41e04438aa058754738181e6e5f8cba29414e6aaab1f3d83","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:46:04.135372Z","signature_b64":"q0uwnaqbIkKX5VU+z2xd6Aslcf1ncpATFe/tSYe6ExF82cCIJjUZGLM3dW8/tWfrQjEGPkWV2BFJ5HmK/vY8Dg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3cd0198ab7d9ca4b41e04438aa058754738181e6e5f8cba29414e6aaab1f3d83","last_reissued_at":"2026-05-18T00:46:04.134904Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:46:04.134904Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1701.01539","source_version":4,"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:46:04Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"jmc7VSxQsqFyIzuD4lageaIMp67KWJuwywrt91mWApFmvt+go8BNOrtm15r9cus6x53xAs4NK4tJUZ/OyLgvCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-29T21:06:08.955571Z"},"content_sha256":"3e3419405ef1e7eaa87f4930a6ca06571f66ea873c80978c8c91068c3024e83d","schema_version":"1.0","event_id":"sha256:3e3419405ef1e7eaa87f4930a6ca06571f66ea873c80978c8c91068c3024e83d"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:HTIBTCVX3HFEWQPAIQ4KUBMHKR","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Algorithms for Optimal Replica Placement Under Correlated Failure in Hierarchical Failure Domains","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DC","cs.DM"],"primary_cat":"cs.DS","authors_text":"K. Alex Mills, Neeraj Mittal, R. Chandrasekaran","submitted_at":"2017-01-06T04:05:09Z","abstract_excerpt":"In data centers, data replication is the primary method used to ensure availability of customer data. To avoid correlated failure, cloud storage infrastructure providers model hierarchical failure domains using a tree, and avoid placing a large number of data replicas within the same failure domain (i.e. on the same branch of the tree). Typical best practices ensure that replicas are distributed across failure domains, but relatively little is known concerning optimization algorithms for distributing data replicas. Using a hierarchical model, we answer how to distribute replicas across failure"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1701.01539","kind":"arxiv","version":4},"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:46:04Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"tYVj3hJvDrjqx9WGZhyW38QLIwCDq6nMWYNLxxU/g92TDG479q5yfdjWpEf/88e15hHXV4tfYmdDtUUlDO3dDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-29T21:06:08.956287Z"},"content_sha256":"68848e00bef0f2d3ce7dd8c8d06e7d1b71f737fa296b75b45253789c6704d524","schema_version":"1.0","event_id":"sha256:68848e00bef0f2d3ce7dd8c8d06e7d1b71f737fa296b75b45253789c6704d524"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/HTIBTCVX3HFEWQPAIQ4KUBMHKR/bundle.json","state_url":"https://pith.science/pith/HTIBTCVX3HFEWQPAIQ4KUBMHKR/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/HTIBTCVX3HFEWQPAIQ4KUBMHKR/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-29T21:06:08Z","links":{"resolver":"https://pith.science/pith/HTIBTCVX3HFEWQPAIQ4KUBMHKR","bundle":"https://pith.science/pith/HTIBTCVX3HFEWQPAIQ4KUBMHKR/bundle.json","state":"https://pith.science/pith/HTIBTCVX3HFEWQPAIQ4KUBMHKR/state.json","well_known_bundle":"https://pith.science/.well-known/pith/HTIBTCVX3HFEWQPAIQ4KUBMHKR/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:HTIBTCVX3HFEWQPAIQ4KUBMHKR","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":"ef4de72e8e6416a1084c70d90b92c80425790e47d69ec8b092975c5eef5a3a96","cross_cats_sorted":["cs.DC","cs.DM"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-01-06T04:05:09Z","title_canon_sha256":"ff11c72e5d8320532626668c13cb02ff23d877f222e42cd11c7406fada08b55f"},"schema_version":"1.0","source":{"id":"1701.01539","kind":"arxiv","version":4}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1701.01539","created_at":"2026-05-18T00:46:04Z"},{"alias_kind":"arxiv_version","alias_value":"1701.01539v4","created_at":"2026-05-18T00:46:04Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1701.01539","created_at":"2026-05-18T00:46:04Z"},{"alias_kind":"pith_short_12","alias_value":"HTIBTCVX3HFE","created_at":"2026-05-18T12:31:18Z"},{"alias_kind":"pith_short_16","alias_value":"HTIBTCVX3HFEWQPA","created_at":"2026-05-18T12:31:18Z"},{"alias_kind":"pith_short_8","alias_value":"HTIBTCVX","created_at":"2026-05-18T12:31:18Z"}],"graph_snapshots":[{"event_id":"sha256:68848e00bef0f2d3ce7dd8c8d06e7d1b71f737fa296b75b45253789c6704d524","target":"graph","created_at":"2026-05-18T00:46:04Z","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":"In data centers, data replication is the primary method used to ensure availability of customer data. To avoid correlated failure, cloud storage infrastructure providers model hierarchical failure domains using a tree, and avoid placing a large number of data replicas within the same failure domain (i.e. on the same branch of the tree). Typical best practices ensure that replicas are distributed across failure domains, but relatively little is known concerning optimization algorithms for distributing data replicas. Using a hierarchical model, we answer how to distribute replicas across failure","authors_text":"K. Alex Mills, Neeraj Mittal, R. Chandrasekaran","cross_cats":["cs.DC","cs.DM"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-01-06T04:05:09Z","title":"Algorithms for Optimal Replica Placement Under Correlated Failure in Hierarchical Failure Domains"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1701.01539","kind":"arxiv","version":4},"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:3e3419405ef1e7eaa87f4930a6ca06571f66ea873c80978c8c91068c3024e83d","target":"record","created_at":"2026-05-18T00:46:04Z","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":"ef4de72e8e6416a1084c70d90b92c80425790e47d69ec8b092975c5eef5a3a96","cross_cats_sorted":["cs.DC","cs.DM"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-01-06T04:05:09Z","title_canon_sha256":"ff11c72e5d8320532626668c13cb02ff23d877f222e42cd11c7406fada08b55f"},"schema_version":"1.0","source":{"id":"1701.01539","kind":"arxiv","version":4}},"canonical_sha256":"3cd0198ab7d9ca4b41e04438aa058754738181e6e5f8cba29414e6aaab1f3d83","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"3cd0198ab7d9ca4b41e04438aa058754738181e6e5f8cba29414e6aaab1f3d83","first_computed_at":"2026-05-18T00:46:04.134904Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:46:04.134904Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"q0uwnaqbIkKX5VU+z2xd6Aslcf1ncpATFe/tSYe6ExF82cCIJjUZGLM3dW8/tWfrQjEGPkWV2BFJ5HmK/vY8Dg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:46:04.135372Z","signed_message":"canonical_sha256_bytes"},"source_id":"1701.01539","source_kind":"arxiv","source_version":4}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:3e3419405ef1e7eaa87f4930a6ca06571f66ea873c80978c8c91068c3024e83d","sha256:68848e00bef0f2d3ce7dd8c8d06e7d1b71f737fa296b75b45253789c6704d524"],"state_sha256":"f1358c6868a0ad91623e807dee9919f632368900d401410cc9218dc3faa96c11"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"soGfBuwiSSiivKsbGQ4C1jR1O9KJLUdaUKl6QLuKQrFPbFQrSOytkTz/JVpoK2dPdgWyiVHKrkd2AMwrU4KvBA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-29T21:06:08.960033Z","bundle_sha256":"850066b0bcba0b57208fc201e45c04d566f4e8ab3695a54278c3d2addeed3969"}}