{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:2E7RE5PKND2ZKCHGA7SEO7K3GZ","short_pith_number":"pith:2E7RE5PK","canonical_record":{"source":{"id":"1503.02654","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-03-09T19:59:17Z","cross_cats_sorted":["cs.DC"],"title_canon_sha256":"ce9844ac7ca74daae6f1cb42d40533de253fe6a70dd28472f2aa336cbe0c5e6d","abstract_canon_sha256":"bfe2ace5c5e8c5dd75490104333b092ac455f53dcd246244148eb487c7922cc5"},"schema_version":"1.0"},"canonical_sha256":"d13f1275ea68f59508e607e4477d5b365dd9294b60a20ba23c224875eb4803ec","source":{"kind":"arxiv","id":"1503.02654","version":4},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1503.02654","created_at":"2026-05-18T00:53:17Z"},{"alias_kind":"arxiv_version","alias_value":"1503.02654v4","created_at":"2026-05-18T00:53:17Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1503.02654","created_at":"2026-05-18T00:53:17Z"},{"alias_kind":"pith_short_12","alias_value":"2E7RE5PKND2Z","created_at":"2026-05-18T12:28:59Z"},{"alias_kind":"pith_short_16","alias_value":"2E7RE5PKND2ZKCHG","created_at":"2026-05-18T12:28:59Z"},{"alias_kind":"pith_short_8","alias_value":"2E7RE5PK","created_at":"2026-05-18T12:28:59Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:2E7RE5PKND2ZKCHGA7SEO7K3GZ","target":"record","payload":{"canonical_record":{"source":{"id":"1503.02654","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-03-09T19:59:17Z","cross_cats_sorted":["cs.DC"],"title_canon_sha256":"ce9844ac7ca74daae6f1cb42d40533de253fe6a70dd28472f2aa336cbe0c5e6d","abstract_canon_sha256":"bfe2ace5c5e8c5dd75490104333b092ac455f53dcd246244148eb487c7922cc5"},"schema_version":"1.0"},"canonical_sha256":"d13f1275ea68f59508e607e4477d5b365dd9294b60a20ba23c224875eb4803ec","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:53:17.853479Z","signature_b64":"T4F+LrPZL3HtUwr7KjDPQDEKxFgKx6KwIgKqBblfaL2z0EyJmam/eY4BkbnaQewdPshkEcW2HAf1v9Tif7YhDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d13f1275ea68f59508e607e4477d5b365dd9294b60a20ba23c224875eb4803ec","last_reissued_at":"2026-05-18T00:53:17.852771Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:53:17.852771Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1503.02654","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:53:17Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"a3RgmrDfPSz51WtUlvUq9fp8JO8/YANDxewjh+ctlrtBFFQjPnGHtVvzb+c5r92vO9COrbnq0YtR5zlPaeqtDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-23T19:36:43.791356Z"},"content_sha256":"8b4c2c1efe8079042591b5e830053ef158c4854b70b6bfcdee3b721a9b36deec","schema_version":"1.0","event_id":"sha256:8b4c2c1efe8079042591b5e830053ef158c4854b70b6bfcdee3b721a9b36deec"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:2E7RE5PKND2ZKCHGA7SEO7K3GZ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Algorithms for Replica Placement in High-Availability Storage","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DC"],"primary_cat":"cs.DS","authors_text":"K. Alex Mills, Neeraj Mittal, R. Chandrasekaran","submitted_at":"2015-03-09T19:59:17Z","abstract_excerpt":"A new model of causal failure is presented and used to solve a novel replica placement problem in data centers. The model describes dependencies among system components as a directed graph. A replica placement is defined as a subset of vertices in such a graph. A criterion for optimizing replica placements is formalized and explained. In this work, the optimization goal is to avoid choosing placements in which a single failure event is likely to wipe out multiple replicas. Using this criterion, a fast algorithm is given for the scenario in which the dependency model is a tree. The main contrib"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1503.02654","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:53:17Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"nx3gQleHsFXLXfzNWZ7E7gUdXQHuOuYWUESRaH7cYOik3Aaqy85pxZ/lVyKhCCI0f/RkCAmrnBmNGdfXb7mCDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-23T19:36:43.791708Z"},"content_sha256":"536d1b86093deb7afec35c1ca6a617dcbb3b38c86bda995e24465bebdc73e3e4","schema_version":"1.0","event_id":"sha256:536d1b86093deb7afec35c1ca6a617dcbb3b38c86bda995e24465bebdc73e3e4"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/2E7RE5PKND2ZKCHGA7SEO7K3GZ/bundle.json","state_url":"https://pith.science/pith/2E7RE5PKND2ZKCHGA7SEO7K3GZ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/2E7RE5PKND2ZKCHGA7SEO7K3GZ/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-06-23T19:36:43Z","links":{"resolver":"https://pith.science/pith/2E7RE5PKND2ZKCHGA7SEO7K3GZ","bundle":"https://pith.science/pith/2E7RE5PKND2ZKCHGA7SEO7K3GZ/bundle.json","state":"https://pith.science/pith/2E7RE5PKND2ZKCHGA7SEO7K3GZ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/2E7RE5PKND2ZKCHGA7SEO7K3GZ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:2E7RE5PKND2ZKCHGA7SEO7K3GZ","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":"bfe2ace5c5e8c5dd75490104333b092ac455f53dcd246244148eb487c7922cc5","cross_cats_sorted":["cs.DC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-03-09T19:59:17Z","title_canon_sha256":"ce9844ac7ca74daae6f1cb42d40533de253fe6a70dd28472f2aa336cbe0c5e6d"},"schema_version":"1.0","source":{"id":"1503.02654","kind":"arxiv","version":4}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1503.02654","created_at":"2026-05-18T00:53:17Z"},{"alias_kind":"arxiv_version","alias_value":"1503.02654v4","created_at":"2026-05-18T00:53:17Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1503.02654","created_at":"2026-05-18T00:53:17Z"},{"alias_kind":"pith_short_12","alias_value":"2E7RE5PKND2Z","created_at":"2026-05-18T12:28:59Z"},{"alias_kind":"pith_short_16","alias_value":"2E7RE5PKND2ZKCHG","created_at":"2026-05-18T12:28:59Z"},{"alias_kind":"pith_short_8","alias_value":"2E7RE5PK","created_at":"2026-05-18T12:28:59Z"}],"graph_snapshots":[{"event_id":"sha256:536d1b86093deb7afec35c1ca6a617dcbb3b38c86bda995e24465bebdc73e3e4","target":"graph","created_at":"2026-05-18T00:53:17Z","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":"A new model of causal failure is presented and used to solve a novel replica placement problem in data centers. The model describes dependencies among system components as a directed graph. A replica placement is defined as a subset of vertices in such a graph. A criterion for optimizing replica placements is formalized and explained. In this work, the optimization goal is to avoid choosing placements in which a single failure event is likely to wipe out multiple replicas. Using this criterion, a fast algorithm is given for the scenario in which the dependency model is a tree. The main contrib","authors_text":"K. Alex Mills, Neeraj Mittal, R. Chandrasekaran","cross_cats":["cs.DC"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-03-09T19:59:17Z","title":"Algorithms for Replica Placement in High-Availability Storage"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1503.02654","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:8b4c2c1efe8079042591b5e830053ef158c4854b70b6bfcdee3b721a9b36deec","target":"record","created_at":"2026-05-18T00:53:17Z","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":"bfe2ace5c5e8c5dd75490104333b092ac455f53dcd246244148eb487c7922cc5","cross_cats_sorted":["cs.DC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-03-09T19:59:17Z","title_canon_sha256":"ce9844ac7ca74daae6f1cb42d40533de253fe6a70dd28472f2aa336cbe0c5e6d"},"schema_version":"1.0","source":{"id":"1503.02654","kind":"arxiv","version":4}},"canonical_sha256":"d13f1275ea68f59508e607e4477d5b365dd9294b60a20ba23c224875eb4803ec","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"d13f1275ea68f59508e607e4477d5b365dd9294b60a20ba23c224875eb4803ec","first_computed_at":"2026-05-18T00:53:17.852771Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:53:17.852771Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"T4F+LrPZL3HtUwr7KjDPQDEKxFgKx6KwIgKqBblfaL2z0EyJmam/eY4BkbnaQewdPshkEcW2HAf1v9Tif7YhDw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:53:17.853479Z","signed_message":"canonical_sha256_bytes"},"source_id":"1503.02654","source_kind":"arxiv","source_version":4}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:8b4c2c1efe8079042591b5e830053ef158c4854b70b6bfcdee3b721a9b36deec","sha256:536d1b86093deb7afec35c1ca6a617dcbb3b38c86bda995e24465bebdc73e3e4"],"state_sha256":"8f1c81b14e20d426e85a1cbe111d189fe13391dae12d5ed0ecd63b57ef20f682"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ALE4NWKelyxQ1uCWX4+a0Jk14DYJ08mpKZwNezP5WLPBemM5BRlm1222v0nqngjRa4xph6NfJI7JecFIecSCCQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-23T19:36:43.793681Z","bundle_sha256":"6e0c9a49bb0fe2e505da696ece980e26680c81e30c97fc1e4158ce395c0bc794"}}