{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:2E7RE5PKND2ZKCHGA7SEO7K3GZ","short_pith_number":"pith:2E7RE5PK","schema_version":"1.0","canonical_sha256":"d13f1275ea68f59508e607e4477d5b365dd9294b60a20ba23c224875eb4803ec","source":{"kind":"arxiv","id":"1503.02654","version":4},"attestation_state":"computed","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"},"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":"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1503.02654","created_at":"2026-05-18T00:53:17.852873+00:00"},{"alias_kind":"arxiv_version","alias_value":"1503.02654v4","created_at":"2026-05-18T00:53:17.852873+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1503.02654","created_at":"2026-05-18T00:53:17.852873+00:00"},{"alias_kind":"pith_short_12","alias_value":"2E7RE5PKND2Z","created_at":"2026-05-18T12:28:59.999130+00:00"},{"alias_kind":"pith_short_16","alias_value":"2E7RE5PKND2ZKCHG","created_at":"2026-05-18T12:28:59.999130+00:00"},{"alias_kind":"pith_short_8","alias_value":"2E7RE5PK","created_at":"2026-05-18T12:28:59.999130+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/2E7RE5PKND2ZKCHGA7SEO7K3GZ","json":"https://pith.science/pith/2E7RE5PKND2ZKCHGA7SEO7K3GZ.json","graph_json":"https://pith.science/api/pith-number/2E7RE5PKND2ZKCHGA7SEO7K3GZ/graph.json","events_json":"https://pith.science/api/pith-number/2E7RE5PKND2ZKCHGA7SEO7K3GZ/events.json","paper":"https://pith.science/paper/2E7RE5PK"},"agent_actions":{"view_html":"https://pith.science/pith/2E7RE5PKND2ZKCHGA7SEO7K3GZ","download_json":"https://pith.science/pith/2E7RE5PKND2ZKCHGA7SEO7K3GZ.json","view_paper":"https://pith.science/paper/2E7RE5PK","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1503.02654&json=true","fetch_graph":"https://pith.science/api/pith-number/2E7RE5PKND2ZKCHGA7SEO7K3GZ/graph.json","fetch_events":"https://pith.science/api/pith-number/2E7RE5PKND2ZKCHGA7SEO7K3GZ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/2E7RE5PKND2ZKCHGA7SEO7K3GZ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/2E7RE5PKND2ZKCHGA7SEO7K3GZ/action/storage_attestation","attest_author":"https://pith.science/pith/2E7RE5PKND2ZKCHGA7SEO7K3GZ/action/author_attestation","sign_citation":"https://pith.science/pith/2E7RE5PKND2ZKCHGA7SEO7K3GZ/action/citation_signature","submit_replication":"https://pith.science/pith/2E7RE5PKND2ZKCHGA7SEO7K3GZ/action/replication_record"}},"created_at":"2026-05-18T00:53:17.852873+00:00","updated_at":"2026-05-18T00:53:17.852873+00:00"}