{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:TAGPHCPV4IERY5HGUOVL4L756Y","short_pith_number":"pith:TAGPHCPV","schema_version":"1.0","canonical_sha256":"980cf389f5e2091c74e6a3aabe2ffdf6024dc84ec7611131c188f6ab11adb024","source":{"kind":"arxiv","id":"1712.08555","version":1},"attestation_state":"computed","paper":{"title":"Scalable Load Balancing in Networked Systems: Universality Properties and Stochastic Coupling Methods","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.PR"],"primary_cat":"cs.PF","authors_text":"Debankur Mukherjee, Johan S.H. van Leeuwaarden, Mark van der Boor, Sem C. Borst","submitted_at":"2017-12-22T16:36:54Z","abstract_excerpt":"We present an overview of scalable load balancing algorithms which provide favorable delay performance in large-scale systems, and yet only require minimal implementation overhead. Aimed at a broad audience, the paper starts with an introduction to the basic load balancing scenario, consisting of a single dispatcher where tasks arrive that must immediately be forwarded to one of $N$ single-server queues.\n  A popular class of load balancing algorithms are so-called power-of-$d$ or JSQ($d$) policies, where an incoming task is assigned to a server with the shortest queue among $d$ servers selecte"},"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":"1712.08555","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.PF","submitted_at":"2017-12-22T16:36:54Z","cross_cats_sorted":["math.PR"],"title_canon_sha256":"39bb22e527f3a2fd07bc3658bc3cd758f7c9a61a4b6bcf91eb1af4f0754caa06","abstract_canon_sha256":"87de5d7a34a4486175cf0a851decac67aa134470050b8f55e4ced9c17953c815"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:27:23.091659Z","signature_b64":"TXpeCMgFD+N3Ji0BCT3JeEKSn3TNgL/s8Z31/mocfmaY990HFs1bJavJ0zdPqJs+Cixgz9oPBvilQGVwrKBeBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"980cf389f5e2091c74e6a3aabe2ffdf6024dc84ec7611131c188f6ab11adb024","last_reissued_at":"2026-05-18T00:27:23.091157Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:27:23.091157Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Scalable Load Balancing in Networked Systems: Universality Properties and Stochastic Coupling Methods","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.PR"],"primary_cat":"cs.PF","authors_text":"Debankur Mukherjee, Johan S.H. van Leeuwaarden, Mark van der Boor, Sem C. Borst","submitted_at":"2017-12-22T16:36:54Z","abstract_excerpt":"We present an overview of scalable load balancing algorithms which provide favorable delay performance in large-scale systems, and yet only require minimal implementation overhead. Aimed at a broad audience, the paper starts with an introduction to the basic load balancing scenario, consisting of a single dispatcher where tasks arrive that must immediately be forwarded to one of $N$ single-server queues.\n  A popular class of load balancing algorithms are so-called power-of-$d$ or JSQ($d$) policies, where an incoming task is assigned to a server with the shortest queue among $d$ servers selecte"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1712.08555","kind":"arxiv","version":1},"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":"1712.08555","created_at":"2026-05-18T00:27:23.091234+00:00"},{"alias_kind":"arxiv_version","alias_value":"1712.08555v1","created_at":"2026-05-18T00:27:23.091234+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1712.08555","created_at":"2026-05-18T00:27:23.091234+00:00"},{"alias_kind":"pith_short_12","alias_value":"TAGPHCPV4IER","created_at":"2026-05-18T12:31:43.269735+00:00"},{"alias_kind":"pith_short_16","alias_value":"TAGPHCPV4IERY5HG","created_at":"2026-05-18T12:31:43.269735+00:00"},{"alias_kind":"pith_short_8","alias_value":"TAGPHCPV","created_at":"2026-05-18T12:31:43.269735+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/TAGPHCPV4IERY5HGUOVL4L756Y","json":"https://pith.science/pith/TAGPHCPV4IERY5HGUOVL4L756Y.json","graph_json":"https://pith.science/api/pith-number/TAGPHCPV4IERY5HGUOVL4L756Y/graph.json","events_json":"https://pith.science/api/pith-number/TAGPHCPV4IERY5HGUOVL4L756Y/events.json","paper":"https://pith.science/paper/TAGPHCPV"},"agent_actions":{"view_html":"https://pith.science/pith/TAGPHCPV4IERY5HGUOVL4L756Y","download_json":"https://pith.science/pith/TAGPHCPV4IERY5HGUOVL4L756Y.json","view_paper":"https://pith.science/paper/TAGPHCPV","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1712.08555&json=true","fetch_graph":"https://pith.science/api/pith-number/TAGPHCPV4IERY5HGUOVL4L756Y/graph.json","fetch_events":"https://pith.science/api/pith-number/TAGPHCPV4IERY5HGUOVL4L756Y/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/TAGPHCPV4IERY5HGUOVL4L756Y/action/timestamp_anchor","attest_storage":"https://pith.science/pith/TAGPHCPV4IERY5HGUOVL4L756Y/action/storage_attestation","attest_author":"https://pith.science/pith/TAGPHCPV4IERY5HGUOVL4L756Y/action/author_attestation","sign_citation":"https://pith.science/pith/TAGPHCPV4IERY5HGUOVL4L756Y/action/citation_signature","submit_replication":"https://pith.science/pith/TAGPHCPV4IERY5HGUOVL4L756Y/action/replication_record"}},"created_at":"2026-05-18T00:27:23.091234+00:00","updated_at":"2026-05-18T00:27:23.091234+00:00"}