{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:ZAAMZO2RSACPST5MXET3ASSX7S","short_pith_number":"pith:ZAAMZO2R","schema_version":"1.0","canonical_sha256":"c800ccbb519004f94facb927b04a57fc88d7b13e6b323c8c512715bb00078776","source":{"kind":"arxiv","id":"1311.5806","version":2},"attestation_state":"computed","paper":{"title":"Analysis of Load Balancing in Large Heterogeneous Processor Sharing Systems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.PF","math.OC","math.PR"],"primary_cat":"cs.DC","authors_text":"Arpan Mukhopadhyay, Ravi R. Mazumdar","submitted_at":"2013-11-22T16:44:35Z","abstract_excerpt":"We analyze randomized dynamic load balancing schemes for multi-server processor sharing systems when the number of servers in the system is large and the servers have heterogeneous service rates. In particular, we focus on the classical power-of-two load balancing scheme and a variant of it in which a newly arrived job is assigned to the server having the least instantaneous Lagrange shadow cost among two randomly chosen servers. The instantaneous Lagrange shadow cost at a server is given by the ratio of the number of unfinished jobs at the server to the capacity of the server. Two different a"},"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":"1311.5806","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2013-11-22T16:44:35Z","cross_cats_sorted":["cs.PF","math.OC","math.PR"],"title_canon_sha256":"6cec7f7e764398c58628fe9a718e1383222c31c5915d443ae5eb0fb4de210425","abstract_canon_sha256":"028530b2249d436d64ac29b6693561cc0dcf9829745b72994eafe11ced87c402"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:27:32.763963Z","signature_b64":"182lErUD6LuVE3cvMZu7RGrrlC8JnBT+DJGf7aHcAqdJxSoV4VQ13FZw9IdLBEFSPJ0wNPrySkEmSaH7L7n1Bw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c800ccbb519004f94facb927b04a57fc88d7b13e6b323c8c512715bb00078776","last_reissued_at":"2026-05-18T02:27:32.763211Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:27:32.763211Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Analysis of Load Balancing in Large Heterogeneous Processor Sharing Systems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.PF","math.OC","math.PR"],"primary_cat":"cs.DC","authors_text":"Arpan Mukhopadhyay, Ravi R. Mazumdar","submitted_at":"2013-11-22T16:44:35Z","abstract_excerpt":"We analyze randomized dynamic load balancing schemes for multi-server processor sharing systems when the number of servers in the system is large and the servers have heterogeneous service rates. In particular, we focus on the classical power-of-two load balancing scheme and a variant of it in which a newly arrived job is assigned to the server having the least instantaneous Lagrange shadow cost among two randomly chosen servers. The instantaneous Lagrange shadow cost at a server is given by the ratio of the number of unfinished jobs at the server to the capacity of the server. Two different a"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1311.5806","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":"1311.5806","created_at":"2026-05-18T02:27:32.763304+00:00"},{"alias_kind":"arxiv_version","alias_value":"1311.5806v2","created_at":"2026-05-18T02:27:32.763304+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1311.5806","created_at":"2026-05-18T02:27:32.763304+00:00"},{"alias_kind":"pith_short_12","alias_value":"ZAAMZO2RSACP","created_at":"2026-05-18T12:28:09.283467+00:00"},{"alias_kind":"pith_short_16","alias_value":"ZAAMZO2RSACPST5M","created_at":"2026-05-18T12:28:09.283467+00:00"},{"alias_kind":"pith_short_8","alias_value":"ZAAMZO2R","created_at":"2026-05-18T12:28:09.283467+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/ZAAMZO2RSACPST5MXET3ASSX7S","json":"https://pith.science/pith/ZAAMZO2RSACPST5MXET3ASSX7S.json","graph_json":"https://pith.science/api/pith-number/ZAAMZO2RSACPST5MXET3ASSX7S/graph.json","events_json":"https://pith.science/api/pith-number/ZAAMZO2RSACPST5MXET3ASSX7S/events.json","paper":"https://pith.science/paper/ZAAMZO2R"},"agent_actions":{"view_html":"https://pith.science/pith/ZAAMZO2RSACPST5MXET3ASSX7S","download_json":"https://pith.science/pith/ZAAMZO2RSACPST5MXET3ASSX7S.json","view_paper":"https://pith.science/paper/ZAAMZO2R","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1311.5806&json=true","fetch_graph":"https://pith.science/api/pith-number/ZAAMZO2RSACPST5MXET3ASSX7S/graph.json","fetch_events":"https://pith.science/api/pith-number/ZAAMZO2RSACPST5MXET3ASSX7S/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/ZAAMZO2RSACPST5MXET3ASSX7S/action/timestamp_anchor","attest_storage":"https://pith.science/pith/ZAAMZO2RSACPST5MXET3ASSX7S/action/storage_attestation","attest_author":"https://pith.science/pith/ZAAMZO2RSACPST5MXET3ASSX7S/action/author_attestation","sign_citation":"https://pith.science/pith/ZAAMZO2RSACPST5MXET3ASSX7S/action/citation_signature","submit_replication":"https://pith.science/pith/ZAAMZO2RSACPST5MXET3ASSX7S/action/replication_record"}},"created_at":"2026-05-18T02:27:32.763304+00:00","updated_at":"2026-05-18T02:27:32.763304+00:00"}