{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:3QHUQMCERUUNBJRUO4YEOKYZWU","short_pith_number":"pith:3QHUQMCE","schema_version":"1.0","canonical_sha256":"dc0f4830448d28d0a6347730472b19b516bfa1639b1ddb593de297fdb39133e8","source":{"kind":"arxiv","id":"1706.09914","version":2},"attestation_state":"computed","paper":{"title":"Diffusion Approximations for Load Balancing Mechanisms in Cloud Storage Systems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.PR","authors_text":"Amarjit Budhiraja, Eric Friedlander","submitted_at":"2017-06-29T18:19:49Z","abstract_excerpt":"In large storage systems, files are often coded across several servers to improve reliability and retrieval speed. We study load balancing under the Batch Sampling routing scheme for a network of $n$ servers storing a set of files using the Maximum Distance Separable (MDS) code (cf. Li, Ramamoorthy, and Srikant (2016)). Specifically, each file is stored in equally sized pieces across $L$ servers such that any $k$ pieces can reconstruct the original file. When a request for a file is received, the dispatcher routes the job into the $k$-shortest queues among the $L$ for which the corresponding s"},"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":"1706.09914","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2017-06-29T18:19:49Z","cross_cats_sorted":[],"title_canon_sha256":"9ce4e851743871600e685a6a54f40cfe721f751d5a3e6f0dfcc27b8c9f96d932","abstract_canon_sha256":"bb8599959fe6728550adc62bcbcd630165f28f92b2a2e8b26e58bebee54897fe"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:40:45.997335Z","signature_b64":"MP+yc4Cu3eg0DywrgvQcbxvtapSSblXz9wUs6bwANiytwroOQ7IZe0UcR9sGc8B+kq28TPRss4+SHbcoTK7WCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"dc0f4830448d28d0a6347730472b19b516bfa1639b1ddb593de297fdb39133e8","last_reissued_at":"2026-05-18T00:40:45.996680Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:40:45.996680Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Diffusion Approximations for Load Balancing Mechanisms in Cloud Storage Systems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.PR","authors_text":"Amarjit Budhiraja, Eric Friedlander","submitted_at":"2017-06-29T18:19:49Z","abstract_excerpt":"In large storage systems, files are often coded across several servers to improve reliability and retrieval speed. We study load balancing under the Batch Sampling routing scheme for a network of $n$ servers storing a set of files using the Maximum Distance Separable (MDS) code (cf. Li, Ramamoorthy, and Srikant (2016)). Specifically, each file is stored in equally sized pieces across $L$ servers such that any $k$ pieces can reconstruct the original file. When a request for a file is received, the dispatcher routes the job into the $k$-shortest queues among the $L$ for which the corresponding s"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1706.09914","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":"1706.09914","created_at":"2026-05-18T00:40:45.996770+00:00"},{"alias_kind":"arxiv_version","alias_value":"1706.09914v2","created_at":"2026-05-18T00:40:45.996770+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1706.09914","created_at":"2026-05-18T00:40:45.996770+00:00"},{"alias_kind":"pith_short_12","alias_value":"3QHUQMCERUUN","created_at":"2026-05-18T12:30:58.224056+00:00"},{"alias_kind":"pith_short_16","alias_value":"3QHUQMCERUUNBJRU","created_at":"2026-05-18T12:30:58.224056+00:00"},{"alias_kind":"pith_short_8","alias_value":"3QHUQMCE","created_at":"2026-05-18T12:30:58.224056+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/3QHUQMCERUUNBJRUO4YEOKYZWU","json":"https://pith.science/pith/3QHUQMCERUUNBJRUO4YEOKYZWU.json","graph_json":"https://pith.science/api/pith-number/3QHUQMCERUUNBJRUO4YEOKYZWU/graph.json","events_json":"https://pith.science/api/pith-number/3QHUQMCERUUNBJRUO4YEOKYZWU/events.json","paper":"https://pith.science/paper/3QHUQMCE"},"agent_actions":{"view_html":"https://pith.science/pith/3QHUQMCERUUNBJRUO4YEOKYZWU","download_json":"https://pith.science/pith/3QHUQMCERUUNBJRUO4YEOKYZWU.json","view_paper":"https://pith.science/paper/3QHUQMCE","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1706.09914&json=true","fetch_graph":"https://pith.science/api/pith-number/3QHUQMCERUUNBJRUO4YEOKYZWU/graph.json","fetch_events":"https://pith.science/api/pith-number/3QHUQMCERUUNBJRUO4YEOKYZWU/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/3QHUQMCERUUNBJRUO4YEOKYZWU/action/timestamp_anchor","attest_storage":"https://pith.science/pith/3QHUQMCERUUNBJRUO4YEOKYZWU/action/storage_attestation","attest_author":"https://pith.science/pith/3QHUQMCERUUNBJRUO4YEOKYZWU/action/author_attestation","sign_citation":"https://pith.science/pith/3QHUQMCERUUNBJRUO4YEOKYZWU/action/citation_signature","submit_replication":"https://pith.science/pith/3QHUQMCERUUNBJRUO4YEOKYZWU/action/replication_record"}},"created_at":"2026-05-18T00:40:45.996770+00:00","updated_at":"2026-05-18T00:40:45.996770+00:00"}