{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:EPWAV6NVHNBZBEASDE7OP64GAA","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":"9e1af2788e4edddc3b58ec158df577cf1fcbdae6a3f97c8883b701f1f445bbad","cross_cats_sorted":["cs.DM","cs.NI","cs.PF"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2017-07-18T21:30:30Z","title_canon_sha256":"20ffc530e2856591847ddc9a699fcbd24f9a2954465ca79618c34001cf0590c0"},"schema_version":"1.0","source":{"id":"1707.05866","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1707.05866","created_at":"2026-05-17T23:49:18Z"},{"alias_kind":"arxiv_version","alias_value":"1707.05866v2","created_at":"2026-05-17T23:49:18Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1707.05866","created_at":"2026-05-17T23:49:18Z"},{"alias_kind":"pith_short_12","alias_value":"EPWAV6NVHNBZ","created_at":"2026-05-18T12:31:12Z"},{"alias_kind":"pith_short_16","alias_value":"EPWAV6NVHNBZBEAS","created_at":"2026-05-18T12:31:12Z"},{"alias_kind":"pith_short_8","alias_value":"EPWAV6NV","created_at":"2026-05-18T12:31:12Z"}],"graph_snapshots":[{"event_id":"sha256:ea9b0fb560e52aa6220792fd500b3763819d16935e9aebd16eeed1e7a4693e77","target":"graph","created_at":"2026-05-17T23:49:18Z","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 consider a system of $N$ servers inter-connected by some underlying graph topology $G_N$. Tasks arrive at the various servers as independent Poisson processes of rate $\\lambda$. Each incoming task is irrevocably assigned to whichever server has the smallest number of tasks among the one where it appears and its neighbors in $G_N$. Tasks have unit-mean exponential service times and leave the system upon service completion.\n  The above model has been extensively investigated in the case $G_N$ is a clique. Since the servers are exchangeable in that case, the queue length process is quite tract","authors_text":"Debankur Mukherjee, Johan S.H. van Leeuwaarden, Sem C. Borst","cross_cats":["cs.DM","cs.NI","cs.PF"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2017-07-18T21:30:30Z","title":"Asymptotically Optimal Load Balancing Topologies"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1707.05866","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:05647f10152525e0ff7411e3ea132d52606d92b4ad2b0f22336e25887d4f360b","target":"record","created_at":"2026-05-17T23:49:18Z","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":"9e1af2788e4edddc3b58ec158df577cf1fcbdae6a3f97c8883b701f1f445bbad","cross_cats_sorted":["cs.DM","cs.NI","cs.PF"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2017-07-18T21:30:30Z","title_canon_sha256":"20ffc530e2856591847ddc9a699fcbd24f9a2954465ca79618c34001cf0590c0"},"schema_version":"1.0","source":{"id":"1707.05866","kind":"arxiv","version":2}},"canonical_sha256":"23ec0af9b53b43909012193ee7fb86001ca8f66c20876f75a14fff3674a2d0b6","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"23ec0af9b53b43909012193ee7fb86001ca8f66c20876f75a14fff3674a2d0b6","first_computed_at":"2026-05-17T23:49:18.021734Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:49:18.021734Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"pw4BLhwgkAfubMToJ6UVsoxe7CS0zaYIHgLeL0HGDqtj4FhNMp4/rWh7mcqaZHpJv8zD3W0xA2dSbVhcmKGBAw==","signature_status":"signed_v1","signed_at":"2026-05-17T23:49:18.022224Z","signed_message":"canonical_sha256_bytes"},"source_id":"1707.05866","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:05647f10152525e0ff7411e3ea132d52606d92b4ad2b0f22336e25887d4f360b","sha256:ea9b0fb560e52aa6220792fd500b3763819d16935e9aebd16eeed1e7a4693e77"],"state_sha256":"d6341b8f10d93978d9a07afa0cdd7b5492c40f5c337ab3a912b44eaaea1c6614"}