{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:6QGDCYCWG46J5VGC4NZASUGDRN","short_pith_number":"pith:6QGDCYCW","schema_version":"1.0","canonical_sha256":"f40c316056373c9ed4c2e3720950c38b693c6efa093a4381a7a0389f9e3e2bdd","source":{"kind":"arxiv","id":"1612.00723","version":2},"attestation_state":"computed","paper":{"title":"Universality of Power-of-$d$ Load Balancing in Many-Server Systems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.PR","authors_text":"Debankur Mukherjee, Johan S. H. van Leeuwaarden, Philip A. Whiting, Sem C. Borst","submitted_at":"2016-12-02T16:11:18Z","abstract_excerpt":"We consider a system of $N$ parallel single-server queues with unit exponential service rates and a single dispatcher where tasks arrive as a Poisson process of rate $\\lambda(N)$. When a task arrives, the dispatcher assigns it to a server with the shortest queue among $d(N)$ randomly selected servers ($1 \\leq d(N) \\leq N$). This load balancing strategy is referred to as a JSQ($d(N)$) scheme, marking that it subsumes the celebrated Join-the-Shortest Queue (JSQ) policy as a crucial special case for $d(N) = N$.\n  We construct a stochastic coupling to bound the difference in the queue length proce"},"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":"1612.00723","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2016-12-02T16:11:18Z","cross_cats_sorted":[],"title_canon_sha256":"4bbf494a4e83e2e5ffe67132ce9be0da1f40931407f1dfdd40fddd976514afdc","abstract_canon_sha256":"5934dbecee11974570f7a4d2b4c7784b87ebb13b1b60c3a9e51edf11cb8081cc"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:55:39.059393Z","signature_b64":"JkL8SWfNEIoXb5T/oIzdvKxos4FyGUCoEeqGDjdmBUTdF8lhXm4Pp/feoVew7qpqUuhEKJ0doYxkmexHwILcDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f40c316056373c9ed4c2e3720950c38b693c6efa093a4381a7a0389f9e3e2bdd","last_reissued_at":"2026-05-17T23:55:39.058788Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:55:39.058788Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Universality of Power-of-$d$ Load Balancing in Many-Server Systems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.PR","authors_text":"Debankur Mukherjee, Johan S. H. van Leeuwaarden, Philip A. Whiting, Sem C. Borst","submitted_at":"2016-12-02T16:11:18Z","abstract_excerpt":"We consider a system of $N$ parallel single-server queues with unit exponential service rates and a single dispatcher where tasks arrive as a Poisson process of rate $\\lambda(N)$. When a task arrives, the dispatcher assigns it to a server with the shortest queue among $d(N)$ randomly selected servers ($1 \\leq d(N) \\leq N$). This load balancing strategy is referred to as a JSQ($d(N)$) scheme, marking that it subsumes the celebrated Join-the-Shortest Queue (JSQ) policy as a crucial special case for $d(N) = N$.\n  We construct a stochastic coupling to bound the difference in the queue length proce"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1612.00723","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":"1612.00723","created_at":"2026-05-17T23:55:39.058879+00:00"},{"alias_kind":"arxiv_version","alias_value":"1612.00723v2","created_at":"2026-05-17T23:55:39.058879+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1612.00723","created_at":"2026-05-17T23:55:39.058879+00:00"},{"alias_kind":"pith_short_12","alias_value":"6QGDCYCWG46J","created_at":"2026-05-18T12:30:01.593930+00:00"},{"alias_kind":"pith_short_16","alias_value":"6QGDCYCWG46J5VGC","created_at":"2026-05-18T12:30:01.593930+00:00"},{"alias_kind":"pith_short_8","alias_value":"6QGDCYCW","created_at":"2026-05-18T12:30:01.593930+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/6QGDCYCWG46J5VGC4NZASUGDRN","json":"https://pith.science/pith/6QGDCYCWG46J5VGC4NZASUGDRN.json","graph_json":"https://pith.science/api/pith-number/6QGDCYCWG46J5VGC4NZASUGDRN/graph.json","events_json":"https://pith.science/api/pith-number/6QGDCYCWG46J5VGC4NZASUGDRN/events.json","paper":"https://pith.science/paper/6QGDCYCW"},"agent_actions":{"view_html":"https://pith.science/pith/6QGDCYCWG46J5VGC4NZASUGDRN","download_json":"https://pith.science/pith/6QGDCYCWG46J5VGC4NZASUGDRN.json","view_paper":"https://pith.science/paper/6QGDCYCW","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1612.00723&json=true","fetch_graph":"https://pith.science/api/pith-number/6QGDCYCWG46J5VGC4NZASUGDRN/graph.json","fetch_events":"https://pith.science/api/pith-number/6QGDCYCWG46J5VGC4NZASUGDRN/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/6QGDCYCWG46J5VGC4NZASUGDRN/action/timestamp_anchor","attest_storage":"https://pith.science/pith/6QGDCYCWG46J5VGC4NZASUGDRN/action/storage_attestation","attest_author":"https://pith.science/pith/6QGDCYCWG46J5VGC4NZASUGDRN/action/author_attestation","sign_citation":"https://pith.science/pith/6QGDCYCWG46J5VGC4NZASUGDRN/action/citation_signature","submit_replication":"https://pith.science/pith/6QGDCYCWG46J5VGC4NZASUGDRN/action/replication_record"}},"created_at":"2026-05-17T23:55:39.058879+00:00","updated_at":"2026-05-17T23:55:39.058879+00:00"}