{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:3WBN3TS6Y63FR3QTSVWYRBK2KI","short_pith_number":"pith:3WBN3TS6","schema_version":"1.0","canonical_sha256":"dd82ddce5ec7b658ee13956d88855a52145dfce5935a0be9422466b6a0db15b3","source":{"kind":"arxiv","id":"1510.02657","version":2},"attestation_state":"computed","paper":{"title":"Universality of Load Balancing Schemes on Diffusion Scale","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.PR","authors_text":"D. Mukherjee, J.S.H. van Leeuwaarden, P.A. Whiting, S.C. Borst","submitted_at":"2015-10-09T12:58:34Z","abstract_excerpt":"We consider a system of $N$ parallel queues with identical exponential service rates and a single dispatcher where tasks arrive as a Poisson process. When a task arrives, the dispatcher always assigns it to an idle server, if there is any, and to a server with the shortest queue among $d$ randomly selected servers otherwise $(1 \\leq d \\leq N)$. This load balancing scheme subsumes the so-called Join-the-Idle Queue (JIQ) policy $(d = 1)$ and the celebrated Join-the-Shortest Queue (JSQ) policy $(d = N)$ as two crucial special cases. We develop a stochastic coupling construction to obtain the diff"},"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":"1510.02657","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2015-10-09T12:58:34Z","cross_cats_sorted":[],"title_canon_sha256":"4894c63d4e60b81f7430562878c517047102310a6cdf5d289ddb27301a0a32f7","abstract_canon_sha256":"9105efc48f32dcad34e25d355bddd8b46f9fd5c39221866bdc76aa55fa55a36b"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:55:14.409393Z","signature_b64":"dzrlrw+FaNqvEAZmpOYMO5iDyFa3s7DBctp3tS27A6dcHpVawTVG7sCF+Rnmg+B/RVQc2i/BB6ovjko3D4wEBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"dd82ddce5ec7b658ee13956d88855a52145dfce5935a0be9422466b6a0db15b3","last_reissued_at":"2026-05-18T00:55:14.408924Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:55:14.408924Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Universality of Load Balancing Schemes on Diffusion Scale","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.PR","authors_text":"D. Mukherjee, J.S.H. van Leeuwaarden, P.A. Whiting, S.C. Borst","submitted_at":"2015-10-09T12:58:34Z","abstract_excerpt":"We consider a system of $N$ parallel queues with identical exponential service rates and a single dispatcher where tasks arrive as a Poisson process. When a task arrives, the dispatcher always assigns it to an idle server, if there is any, and to a server with the shortest queue among $d$ randomly selected servers otherwise $(1 \\leq d \\leq N)$. This load balancing scheme subsumes the so-called Join-the-Idle Queue (JIQ) policy $(d = 1)$ and the celebrated Join-the-Shortest Queue (JSQ) policy $(d = N)$ as two crucial special cases. We develop a stochastic coupling construction to obtain the diff"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1510.02657","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":"1510.02657","created_at":"2026-05-18T00:55:14.408992+00:00"},{"alias_kind":"arxiv_version","alias_value":"1510.02657v2","created_at":"2026-05-18T00:55:14.408992+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1510.02657","created_at":"2026-05-18T00:55:14.408992+00:00"},{"alias_kind":"pith_short_12","alias_value":"3WBN3TS6Y63F","created_at":"2026-05-18T12:29:02.477457+00:00"},{"alias_kind":"pith_short_16","alias_value":"3WBN3TS6Y63FR3QT","created_at":"2026-05-18T12:29:02.477457+00:00"},{"alias_kind":"pith_short_8","alias_value":"3WBN3TS6","created_at":"2026-05-18T12:29:02.477457+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/3WBN3TS6Y63FR3QTSVWYRBK2KI","json":"https://pith.science/pith/3WBN3TS6Y63FR3QTSVWYRBK2KI.json","graph_json":"https://pith.science/api/pith-number/3WBN3TS6Y63FR3QTSVWYRBK2KI/graph.json","events_json":"https://pith.science/api/pith-number/3WBN3TS6Y63FR3QTSVWYRBK2KI/events.json","paper":"https://pith.science/paper/3WBN3TS6"},"agent_actions":{"view_html":"https://pith.science/pith/3WBN3TS6Y63FR3QTSVWYRBK2KI","download_json":"https://pith.science/pith/3WBN3TS6Y63FR3QTSVWYRBK2KI.json","view_paper":"https://pith.science/paper/3WBN3TS6","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1510.02657&json=true","fetch_graph":"https://pith.science/api/pith-number/3WBN3TS6Y63FR3QTSVWYRBK2KI/graph.json","fetch_events":"https://pith.science/api/pith-number/3WBN3TS6Y63FR3QTSVWYRBK2KI/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/3WBN3TS6Y63FR3QTSVWYRBK2KI/action/timestamp_anchor","attest_storage":"https://pith.science/pith/3WBN3TS6Y63FR3QTSVWYRBK2KI/action/storage_attestation","attest_author":"https://pith.science/pith/3WBN3TS6Y63FR3QTSVWYRBK2KI/action/author_attestation","sign_citation":"https://pith.science/pith/3WBN3TS6Y63FR3QTSVWYRBK2KI/action/citation_signature","submit_replication":"https://pith.science/pith/3WBN3TS6Y63FR3QTSVWYRBK2KI/action/replication_record"}},"created_at":"2026-05-18T00:55:14.408992+00:00","updated_at":"2026-05-18T00:55:14.408992+00:00"}