{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2021:4SVNN7NPS67L4G5JLGFG4E3HII","short_pith_number":"pith:4SVNN7NP","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"},"canonical_sha256":"e4aad6fdaf97bebe1ba9598a6e13674222e5a16f824437d49ce96bc3c3f4fcb1","source":{"kind":"arxiv","id":"2106.00121","version":4},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2106.00121","created_at":"2026-07-05T11:08:53Z"},{"alias_kind":"arxiv_version","alias_value":"2106.00121v4","created_at":"2026-07-05T11:08:53Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2106.00121","created_at":"2026-07-05T11:08:53Z"},{"alias_kind":"pith_short_12","alias_value":"4SVNN7NPS67L","created_at":"2026-07-05T11:08:53Z"},{"alias_kind":"pith_short_16","alias_value":"4SVNN7NPS67L4G5J","created_at":"2026-07-05T11:08:53Z"},{"alias_kind":"pith_short_8","alias_value":"4SVNN7NP","created_at":"2026-07-05T11:08:53Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2021:4SVNN7NPS67L4G5JLGFG4E3HII","target":"record","payload":{"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"},"canonical_sha256":"e4aad6fdaf97bebe1ba9598a6e13674222e5a16f824437d49ce96bc3c3f4fcb1","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"},"source_kind":"arxiv","source_id":"2106.00121","source_version":4,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-07-05T11:08:53Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"XzJpqeQnTT+LQmkt8aLmYWwUUe60ObBsHIxsUqj2yrNdg1NxewY/IA9V78sLQw3F7kSypfGjjpPaJcULO7K1AQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-27T18:17:57.652134Z"},"content_sha256":"dad912fafaa5cb8ff86889b0ee95cade78eb7abcce1cd4c8e372627e91d55528","schema_version":"1.0","event_id":"sha256:dad912fafaa5cb8ff86889b0ee95cade78eb7abcce1cd4c8e372627e91d55528"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2021:4SVNN7NPS67L4G5JLGFG4E3HII","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-07-05T11:08:53Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"83CgRLKFGjxi5sVZNydI4YZdTkzuPNNPEKP8lq8IWiexOaN6KD909y9Xny5XuIYlxxLhU3TxIj4ywRDS0AgmAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-27T18:17:57.652524Z"},"content_sha256":"49f4d4400d1ea81624ae89a642d7d8de04b59ac84d0c757b3873cd89a8ee012f","schema_version":"1.0","event_id":"sha256:49f4d4400d1ea81624ae89a642d7d8de04b59ac84d0c757b3873cd89a8ee012f"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/4SVNN7NPS67L4G5JLGFG4E3HII/bundle.json","state_url":"https://pith.science/pith/4SVNN7NPS67L4G5JLGFG4E3HII/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/4SVNN7NPS67L4G5JLGFG4E3HII/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-07-27T18:17:57Z","links":{"resolver":"https://pith.science/pith/4SVNN7NPS67L4G5JLGFG4E3HII","bundle":"https://pith.science/pith/4SVNN7NPS67L4G5JLGFG4E3HII/bundle.json","state":"https://pith.science/pith/4SVNN7NPS67L4G5JLGFG4E3HII/state.json","well_known_bundle":"https://pith.science/.well-known/pith/4SVNN7NPS67L4G5JLGFG4E3HII/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2021:4SVNN7NPS67L4G5JLGFG4E3HII","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"3b56f661d85b7315f62954c687b30aa4db927f3b8ad11f57f658a2c5d9ec675f","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.PR","submitted_at":"2021-05-31T22:21:00Z","title_canon_sha256":"5a4221c1445ea098131be3d06ddc92e357e5080d2942ae2553b6a5436aa0fd12"},"schema_version":"1.0","source":{"id":"2106.00121","kind":"arxiv","version":4}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2106.00121","created_at":"2026-07-05T11:08:53Z"},{"alias_kind":"arxiv_version","alias_value":"2106.00121v4","created_at":"2026-07-05T11:08:53Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2106.00121","created_at":"2026-07-05T11:08:53Z"},{"alias_kind":"pith_short_12","alias_value":"4SVNN7NPS67L","created_at":"2026-07-05T11:08:53Z"},{"alias_kind":"pith_short_16","alias_value":"4SVNN7NPS67L4G5J","created_at":"2026-07-05T11:08:53Z"},{"alias_kind":"pith_short_8","alias_value":"4SVNN7NP","created_at":"2026-07-05T11:08:53Z"}],"graph_snapshots":[{"event_id":"sha256:49f4d4400d1ea81624ae89a642d7d8de04b59ac84d0c757b3873cd89a8ee012f","target":"graph","created_at":"2026-07-05T11:08:53Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2106.00121/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"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","authors_text":"Debankur Mukherjee, Sayan Banerjee, Zhisheng Zhao","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.PR","submitted_at":"2021-05-31T22:21:00Z","title":"Many-server asymptotics for Join-the-Shortest Queue in the Super-Halfin-Whitt Scaling Window"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2106.00121","kind":"arxiv","version":4},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:dad912fafaa5cb8ff86889b0ee95cade78eb7abcce1cd4c8e372627e91d55528","target":"record","created_at":"2026-07-05T11:08:53Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"3b56f661d85b7315f62954c687b30aa4db927f3b8ad11f57f658a2c5d9ec675f","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.PR","submitted_at":"2021-05-31T22:21:00Z","title_canon_sha256":"5a4221c1445ea098131be3d06ddc92e357e5080d2942ae2553b6a5436aa0fd12"},"schema_version":"1.0","source":{"id":"2106.00121","kind":"arxiv","version":4}},"canonical_sha256":"e4aad6fdaf97bebe1ba9598a6e13674222e5a16f824437d49ce96bc3c3f4fcb1","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"e4aad6fdaf97bebe1ba9598a6e13674222e5a16f824437d49ce96bc3c3f4fcb1","first_computed_at":"2026-07-05T11:08:53.408411Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T11:08:53.408411Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"UJFpIQ6nNN+DN1eLdhCbe+yx1hYeBoT2s4ObBNW7o1jfCRMI5u/7FYGEuPrel6T8ZH6RzVgir860zDWIs6cSDw==","signature_status":"signed_v1","signed_at":"2026-07-05T11:08:53.408865Z","signed_message":"canonical_sha256_bytes"},"source_id":"2106.00121","source_kind":"arxiv","source_version":4}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:dad912fafaa5cb8ff86889b0ee95cade78eb7abcce1cd4c8e372627e91d55528","sha256:49f4d4400d1ea81624ae89a642d7d8de04b59ac84d0c757b3873cd89a8ee012f"],"state_sha256":"2936770453b388acb25c88330edfbb310b062de9b6d9355662a852d8d4406490"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"wwHtMTml7NpkQ14+GcCsVhjn41N9n8dKgezrIJ1MSNHXdnIfSWSjNnW94a7kpN95tju+Cc+ZvEv0m4L+c6PKDA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-27T18:17:57.654935Z","bundle_sha256":"c30d7f28a8657eff1935fc209d8938e15002a91b87cf78636509813cbd1ab440"}}