{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:EPWAV6NVHNBZBEASDE7OP64GAA","short_pith_number":"pith:EPWAV6NV","schema_version":"1.0","canonical_sha256":"23ec0af9b53b43909012193ee7fb86001ca8f66c20876f75a14fff3674a2d0b6","source":{"kind":"arxiv","id":"1707.05866","version":2},"attestation_state":"computed","paper":{"title":"Asymptotically Optimal Load Balancing Topologies","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM","cs.NI","cs.PF"],"primary_cat":"math.PR","authors_text":"Debankur Mukherjee, Johan S.H. van Leeuwaarden, Sem C. Borst","submitted_at":"2017-07-18T21:30:30Z","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"},"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":"1707.05866","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2017-07-18T21:30:30Z","cross_cats_sorted":["cs.DM","cs.NI","cs.PF"],"title_canon_sha256":"20ffc530e2856591847ddc9a699fcbd24f9a2954465ca79618c34001cf0590c0","abstract_canon_sha256":"9e1af2788e4edddc3b58ec158df577cf1fcbdae6a3f97c8883b701f1f445bbad"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:49:18.022224Z","signature_b64":"pw4BLhwgkAfubMToJ6UVsoxe7CS0zaYIHgLeL0HGDqtj4FhNMp4/rWh7mcqaZHpJv8zD3W0xA2dSbVhcmKGBAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"23ec0af9b53b43909012193ee7fb86001ca8f66c20876f75a14fff3674a2d0b6","last_reissued_at":"2026-05-17T23:49:18.021734Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:49:18.021734Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Asymptotically Optimal Load Balancing Topologies","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM","cs.NI","cs.PF"],"primary_cat":"math.PR","authors_text":"Debankur Mukherjee, Johan S.H. van Leeuwaarden, Sem C. Borst","submitted_at":"2017-07-18T21:30:30Z","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"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1707.05866","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":"1707.05866","created_at":"2026-05-17T23:49:18.021808+00:00"},{"alias_kind":"arxiv_version","alias_value":"1707.05866v2","created_at":"2026-05-17T23:49:18.021808+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1707.05866","created_at":"2026-05-17T23:49:18.021808+00:00"},{"alias_kind":"pith_short_12","alias_value":"EPWAV6NVHNBZ","created_at":"2026-05-18T12:31:12.930513+00:00"},{"alias_kind":"pith_short_16","alias_value":"EPWAV6NVHNBZBEAS","created_at":"2026-05-18T12:31:12.930513+00:00"},{"alias_kind":"pith_short_8","alias_value":"EPWAV6NV","created_at":"2026-05-18T12:31:12.930513+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/EPWAV6NVHNBZBEASDE7OP64GAA","json":"https://pith.science/pith/EPWAV6NVHNBZBEASDE7OP64GAA.json","graph_json":"https://pith.science/api/pith-number/EPWAV6NVHNBZBEASDE7OP64GAA/graph.json","events_json":"https://pith.science/api/pith-number/EPWAV6NVHNBZBEASDE7OP64GAA/events.json","paper":"https://pith.science/paper/EPWAV6NV"},"agent_actions":{"view_html":"https://pith.science/pith/EPWAV6NVHNBZBEASDE7OP64GAA","download_json":"https://pith.science/pith/EPWAV6NVHNBZBEASDE7OP64GAA.json","view_paper":"https://pith.science/paper/EPWAV6NV","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1707.05866&json=true","fetch_graph":"https://pith.science/api/pith-number/EPWAV6NVHNBZBEASDE7OP64GAA/graph.json","fetch_events":"https://pith.science/api/pith-number/EPWAV6NVHNBZBEASDE7OP64GAA/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/EPWAV6NVHNBZBEASDE7OP64GAA/action/timestamp_anchor","attest_storage":"https://pith.science/pith/EPWAV6NVHNBZBEASDE7OP64GAA/action/storage_attestation","attest_author":"https://pith.science/pith/EPWAV6NVHNBZBEASDE7OP64GAA/action/author_attestation","sign_citation":"https://pith.science/pith/EPWAV6NVHNBZBEASDE7OP64GAA/action/citation_signature","submit_replication":"https://pith.science/pith/EPWAV6NVHNBZBEASDE7OP64GAA/action/replication_record"}},"created_at":"2026-05-17T23:49:18.021808+00:00","updated_at":"2026-05-17T23:49:18.021808+00:00"}