{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2021:4SVNN7NPS67L4G5JLGFG4E3HII","short_pith_number":"pith:4SVNN7NP","schema_version":"1.0","canonical_sha256":"e4aad6fdaf97bebe1ba9598a6e13674222e5a16f824437d49ce96bc3c3f4fcb1","source":{"kind":"arxiv","id":"2106.00121","version":4},"attestation_state":"computed","paper":{"title":"Many-server asymptotics for Join-the-Shortest Queue in the Super-Halfin-Whitt Scaling Window","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"math.PR","authors_text":"Debankur Mukherjee, Sayan Banerjee, Zhisheng Zhao","submitted_at":"2021-05-31T22:21:00Z","abstract_excerpt":"The Join-the-Shortest Queue (JSQ) policy is a classical benchmark for the performance of many-server queueing systems due to its strong optimality properties. While the exact analysis of the JSQ policy is an open question to date, even under Markovian assumption on the service requirements, recently, there has been a significant progress in understanding its many-server asymptotic behavior since the work of Eschenfeldt and Gamarnik (Math.~Oper.~Res.~43 (2018) 867--886).\n  In this paper, we analyze the many-server limits of the JSQ policy in the \\emph{super-Halfin-Whitt} scaling window when loa"},"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":"2106.00121","kind":"arxiv","version":4},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.PR","submitted_at":"2021-05-31T22:21:00Z","cross_cats_sorted":[],"title_canon_sha256":"5a4221c1445ea098131be3d06ddc92e357e5080d2942ae2553b6a5436aa0fd12","abstract_canon_sha256":"3b56f661d85b7315f62954c687b30aa4db927f3b8ad11f57f658a2c5d9ec675f"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:08:53.408865Z","signature_b64":"UJFpIQ6nNN+DN1eLdhCbe+yx1hYeBoT2s4ObBNW7o1jfCRMI5u/7FYGEuPrel6T8ZH6RzVgir860zDWIs6cSDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e4aad6fdaf97bebe1ba9598a6e13674222e5a16f824437d49ce96bc3c3f4fcb1","last_reissued_at":"2026-07-05T11:08:53.408411Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:08:53.408411Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Many-server asymptotics for Join-the-Shortest Queue in the Super-Halfin-Whitt Scaling Window","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"math.PR","authors_text":"Debankur Mukherjee, Sayan Banerjee, Zhisheng Zhao","submitted_at":"2021-05-31T22:21:00Z","abstract_excerpt":"The Join-the-Shortest Queue (JSQ) policy is a classical benchmark for the performance of many-server queueing systems due to its strong optimality properties. While the exact analysis of the JSQ policy is an open question to date, even under Markovian assumption on the service requirements, recently, there has been a significant progress in understanding its many-server asymptotic behavior since the work of Eschenfeldt and Gamarnik (Math.~Oper.~Res.~43 (2018) 867--886).\n  In this paper, we analyze the many-server limits of the JSQ policy in the \\emph{super-Halfin-Whitt} scaling window when loa"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2106.00121","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2106.00121/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"2106.00121","created_at":"2026-07-05T11:08:53.408464+00:00"},{"alias_kind":"arxiv_version","alias_value":"2106.00121v4","created_at":"2026-07-05T11:08:53.408464+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2106.00121","created_at":"2026-07-05T11:08:53.408464+00:00"},{"alias_kind":"pith_short_12","alias_value":"4SVNN7NPS67L","created_at":"2026-07-05T11:08:53.408464+00:00"},{"alias_kind":"pith_short_16","alias_value":"4SVNN7NPS67L4G5J","created_at":"2026-07-05T11:08:53.408464+00:00"},{"alias_kind":"pith_short_8","alias_value":"4SVNN7NP","created_at":"2026-07-05T11:08:53.408464+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2605.29641","citing_title":"Experimentation for Different Scheduling Policies on Queues: Mixed Differences-in-Q Estimators Based on Little's Law","ref_index":9,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/4SVNN7NPS67L4G5JLGFG4E3HII","json":"https://pith.science/pith/4SVNN7NPS67L4G5JLGFG4E3HII.json","graph_json":"https://pith.science/api/pith-number/4SVNN7NPS67L4G5JLGFG4E3HII/graph.json","events_json":"https://pith.science/api/pith-number/4SVNN7NPS67L4G5JLGFG4E3HII/events.json","paper":"https://pith.science/paper/4SVNN7NP"},"agent_actions":{"view_html":"https://pith.science/pith/4SVNN7NPS67L4G5JLGFG4E3HII","download_json":"https://pith.science/pith/4SVNN7NPS67L4G5JLGFG4E3HII.json","view_paper":"https://pith.science/paper/4SVNN7NP","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2106.00121&json=true","fetch_graph":"https://pith.science/api/pith-number/4SVNN7NPS67L4G5JLGFG4E3HII/graph.json","fetch_events":"https://pith.science/api/pith-number/4SVNN7NPS67L4G5JLGFG4E3HII/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/4SVNN7NPS67L4G5JLGFG4E3HII/action/timestamp_anchor","attest_storage":"https://pith.science/pith/4SVNN7NPS67L4G5JLGFG4E3HII/action/storage_attestation","attest_author":"https://pith.science/pith/4SVNN7NPS67L4G5JLGFG4E3HII/action/author_attestation","sign_citation":"https://pith.science/pith/4SVNN7NPS67L4G5JLGFG4E3HII/action/citation_signature","submit_replication":"https://pith.science/pith/4SVNN7NPS67L4G5JLGFG4E3HII/action/replication_record"}},"created_at":"2026-07-05T11:08:53.408464+00:00","updated_at":"2026-07-05T11:08:53.408464+00:00"}