{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:ZAAMZO2RSACPST5MXET3ASSX7S","short_pith_number":"pith:ZAAMZO2R","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"},"canonical_sha256":"c800ccbb519004f94facb927b04a57fc88d7b13e6b323c8c512715bb00078776","source":{"kind":"arxiv","id":"1311.5806","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1311.5806","created_at":"2026-05-18T02:27:32Z"},{"alias_kind":"arxiv_version","alias_value":"1311.5806v2","created_at":"2026-05-18T02:27:32Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1311.5806","created_at":"2026-05-18T02:27:32Z"},{"alias_kind":"pith_short_12","alias_value":"ZAAMZO2RSACP","created_at":"2026-05-18T12:28:09Z"},{"alias_kind":"pith_short_16","alias_value":"ZAAMZO2RSACPST5M","created_at":"2026-05-18T12:28:09Z"},{"alias_kind":"pith_short_8","alias_value":"ZAAMZO2R","created_at":"2026-05-18T12:28:09Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:ZAAMZO2RSACPST5MXET3ASSX7S","target":"record","payload":{"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"},"canonical_sha256":"c800ccbb519004f94facb927b04a57fc88d7b13e6b323c8c512715bb00078776","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"},"source_kind":"arxiv","source_id":"1311.5806","source_version":2,"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-05-18T02:27:32Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"WjPD2hrD5dPBDRMNPMS+VL3V4Vbnzx2Lco3kW20GNrTkuSXVPIziqvRxQ7+uHEbfcnvo3cGFiMKItpyulbznBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-24T17:41:39.147768Z"},"content_sha256":"94bc1e0dc46937db7e9f918ac946e7b7ec94bdc6a4ed5b615896c574076ca8ab","schema_version":"1.0","event_id":"sha256:94bc1e0dc46937db7e9f918ac946e7b7ec94bdc6a4ed5b615896c574076ca8ab"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:ZAAMZO2RSACPST5MXET3ASSX7S","target":"graph","payload":{"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"},"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-05-18T02:27:32Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Tt3cMs5Jpm1ykMwhLXQkgyvCM7KnNEoeyqImS0Xh4NA8zR0+JnheLE5ZTY7VQwxL76JZbEPlZnzCvJe5cOnPAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-24T17:41:39.148376Z"},"content_sha256":"894372ed58853ca4ac049e4d81a0652ba9044a9a8f4f4541e56770a58d6c8b58","schema_version":"1.0","event_id":"sha256:894372ed58853ca4ac049e4d81a0652ba9044a9a8f4f4541e56770a58d6c8b58"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/ZAAMZO2RSACPST5MXET3ASSX7S/bundle.json","state_url":"https://pith.science/pith/ZAAMZO2RSACPST5MXET3ASSX7S/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/ZAAMZO2RSACPST5MXET3ASSX7S/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-05-24T17:41:39Z","links":{"resolver":"https://pith.science/pith/ZAAMZO2RSACPST5MXET3ASSX7S","bundle":"https://pith.science/pith/ZAAMZO2RSACPST5MXET3ASSX7S/bundle.json","state":"https://pith.science/pith/ZAAMZO2RSACPST5MXET3ASSX7S/state.json","well_known_bundle":"https://pith.science/.well-known/pith/ZAAMZO2RSACPST5MXET3ASSX7S/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:ZAAMZO2RSACPST5MXET3ASSX7S","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":"028530b2249d436d64ac29b6693561cc0dcf9829745b72994eafe11ced87c402","cross_cats_sorted":["cs.PF","math.OC","math.PR"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2013-11-22T16:44:35Z","title_canon_sha256":"6cec7f7e764398c58628fe9a718e1383222c31c5915d443ae5eb0fb4de210425"},"schema_version":"1.0","source":{"id":"1311.5806","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1311.5806","created_at":"2026-05-18T02:27:32Z"},{"alias_kind":"arxiv_version","alias_value":"1311.5806v2","created_at":"2026-05-18T02:27:32Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1311.5806","created_at":"2026-05-18T02:27:32Z"},{"alias_kind":"pith_short_12","alias_value":"ZAAMZO2RSACP","created_at":"2026-05-18T12:28:09Z"},{"alias_kind":"pith_short_16","alias_value":"ZAAMZO2RSACPST5M","created_at":"2026-05-18T12:28:09Z"},{"alias_kind":"pith_short_8","alias_value":"ZAAMZO2R","created_at":"2026-05-18T12:28:09Z"}],"graph_snapshots":[{"event_id":"sha256:894372ed58853ca4ac049e4d81a0652ba9044a9a8f4f4541e56770a58d6c8b58","target":"graph","created_at":"2026-05-18T02:27:32Z","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"},"paper":{"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","authors_text":"Arpan Mukhopadhyay, Ravi R. Mazumdar","cross_cats":["cs.PF","math.OC","math.PR"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2013-11-22T16:44:35Z","title":"Analysis of Load Balancing in Large Heterogeneous Processor Sharing Systems"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1311.5806","kind":"arxiv","version":2},"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:94bc1e0dc46937db7e9f918ac946e7b7ec94bdc6a4ed5b615896c574076ca8ab","target":"record","created_at":"2026-05-18T02:27:32Z","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":"028530b2249d436d64ac29b6693561cc0dcf9829745b72994eafe11ced87c402","cross_cats_sorted":["cs.PF","math.OC","math.PR"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2013-11-22T16:44:35Z","title_canon_sha256":"6cec7f7e764398c58628fe9a718e1383222c31c5915d443ae5eb0fb4de210425"},"schema_version":"1.0","source":{"id":"1311.5806","kind":"arxiv","version":2}},"canonical_sha256":"c800ccbb519004f94facb927b04a57fc88d7b13e6b323c8c512715bb00078776","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"c800ccbb519004f94facb927b04a57fc88d7b13e6b323c8c512715bb00078776","first_computed_at":"2026-05-18T02:27:32.763211Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:27:32.763211Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"182lErUD6LuVE3cvMZu7RGrrlC8JnBT+DJGf7aHcAqdJxSoV4VQ13FZw9IdLBEFSPJ0wNPrySkEmSaH7L7n1Bw==","signature_status":"signed_v1","signed_at":"2026-05-18T02:27:32.763963Z","signed_message":"canonical_sha256_bytes"},"source_id":"1311.5806","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:94bc1e0dc46937db7e9f918ac946e7b7ec94bdc6a4ed5b615896c574076ca8ab","sha256:894372ed58853ca4ac049e4d81a0652ba9044a9a8f4f4541e56770a58d6c8b58"],"state_sha256":"7f6454678f9a890d254738cdc82e110a3ab9c36e7efea0c1ff72e58fe3761950"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"mHfaZXK/jYvfQN5xGTVknNXnN0Q8QCGQOYMEu7k5neHpFiFDAmW3Tkw8f7T8hrM8EeZMMPMoaPJGcvtBQp7yCg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-24T17:41:39.151657Z","bundle_sha256":"09307b9dd2fd05abc710eea36ec52328445952d852d7c5ebc9a65f9f91168367"}}