{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2023:BS5JDG4QTQIPGQYLF3LVFDOXNE","short_pith_number":"pith:BS5JDG4Q","schema_version":"1.0","canonical_sha256":"0cba919b909c10f3430b2ed7528dd7690d06d1964ea73c808c2b9f1997a1b5d4","source":{"kind":"arxiv","id":"2302.10317","version":2},"attestation_state":"computed","paper":{"title":"Load Balancing in Parallel Queues and Rank-based Diffusions","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.PR","authors_text":"Amarjit Budhiraja, Benjamin Estevez, Sayan Banerjee","submitted_at":"2023-02-20T21:04:33Z","abstract_excerpt":"Consider a system with $K$ parallel queues in which the server for each queue processes jobs at rate $n$ and the total arrival rate to the system is $nK-\\upsilon \\sqrt{n}$ where $\\upsilon \\in (0, \\infty)$ and $n$ is large. We study rank-based routing policies in which $O(\\sqrt{n})$ of the incoming jobs are routed to servers with probabilities depending on their ranked queue-length and the remaining jobs are routed uniformly at random. A particular case, referred to as the marginal join-the-shortest-queue (MJSQ) policy, is one in which the $O(\\sqrt{n})$ jobs are routed using the join-the-shorte"},"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":"2302.10317","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2023-02-20T21:04:33Z","cross_cats_sorted":[],"title_canon_sha256":"69d8223aa099da0407825977b74a454e6051edfa96d1f36866e15c4f3472dcf3","abstract_canon_sha256":"5f3374d030fd23baffd276926cf1c76d0c124584c96db6b99e4f866027ebdcee"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T07:45:26.457541Z","signature_b64":"8qHgddaYTtd9k/EKUULeO7NDfrCB2Xf0hg528tiFkwJkaTGSy9F06nQvAaHJZpVyt4rLSWWux5+1WYuhZCJTAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0cba919b909c10f3430b2ed7528dd7690d06d1964ea73c808c2b9f1997a1b5d4","last_reissued_at":"2026-07-05T07:45:26.457017Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T07:45:26.457017Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Load Balancing in Parallel Queues and Rank-based Diffusions","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.PR","authors_text":"Amarjit Budhiraja, Benjamin Estevez, Sayan Banerjee","submitted_at":"2023-02-20T21:04:33Z","abstract_excerpt":"Consider a system with $K$ parallel queues in which the server for each queue processes jobs at rate $n$ and the total arrival rate to the system is $nK-\\upsilon \\sqrt{n}$ where $\\upsilon \\in (0, \\infty)$ and $n$ is large. We study rank-based routing policies in which $O(\\sqrt{n})$ of the incoming jobs are routed to servers with probabilities depending on their ranked queue-length and the remaining jobs are routed uniformly at random. A particular case, referred to as the marginal join-the-shortest-queue (MJSQ) policy, is one in which the $O(\\sqrt{n})$ jobs are routed using the join-the-shorte"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2302.10317","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2302.10317/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":"2302.10317","created_at":"2026-07-05T07:45:26.457078+00:00"},{"alias_kind":"arxiv_version","alias_value":"2302.10317v2","created_at":"2026-07-05T07:45:26.457078+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2302.10317","created_at":"2026-07-05T07:45:26.457078+00:00"},{"alias_kind":"pith_short_12","alias_value":"BS5JDG4QTQIP","created_at":"2026-07-05T07:45:26.457078+00:00"},{"alias_kind":"pith_short_16","alias_value":"BS5JDG4QTQIPGQYL","created_at":"2026-07-05T07:45:26.457078+00:00"},{"alias_kind":"pith_short_8","alias_value":"BS5JDG4Q","created_at":"2026-07-05T07:45:26.457078+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":2,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/BS5JDG4QTQIPGQYLF3LVFDOXNE","json":"https://pith.science/pith/BS5JDG4QTQIPGQYLF3LVFDOXNE.json","graph_json":"https://pith.science/api/pith-number/BS5JDG4QTQIPGQYLF3LVFDOXNE/graph.json","events_json":"https://pith.science/api/pith-number/BS5JDG4QTQIPGQYLF3LVFDOXNE/events.json","paper":"https://pith.science/paper/BS5JDG4Q"},"agent_actions":{"view_html":"https://pith.science/pith/BS5JDG4QTQIPGQYLF3LVFDOXNE","download_json":"https://pith.science/pith/BS5JDG4QTQIPGQYLF3LVFDOXNE.json","view_paper":"https://pith.science/paper/BS5JDG4Q","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2302.10317&json=true","fetch_graph":"https://pith.science/api/pith-number/BS5JDG4QTQIPGQYLF3LVFDOXNE/graph.json","fetch_events":"https://pith.science/api/pith-number/BS5JDG4QTQIPGQYLF3LVFDOXNE/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/BS5JDG4QTQIPGQYLF3LVFDOXNE/action/timestamp_anchor","attest_storage":"https://pith.science/pith/BS5JDG4QTQIPGQYLF3LVFDOXNE/action/storage_attestation","attest_author":"https://pith.science/pith/BS5JDG4QTQIPGQYLF3LVFDOXNE/action/author_attestation","sign_citation":"https://pith.science/pith/BS5JDG4QTQIPGQYLF3LVFDOXNE/action/citation_signature","submit_replication":"https://pith.science/pith/BS5JDG4QTQIPGQYLF3LVFDOXNE/action/replication_record"}},"created_at":"2026-07-05T07:45:26.457078+00:00","updated_at":"2026-07-05T07:45:26.457078+00:00"}