{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:BQSDQGIJFDLAZWOSASYLAF7O7H","short_pith_number":"pith:BQSDQGIJ","schema_version":"1.0","canonical_sha256":"0c2438190928d60cd9d204b0b017eef9ddcafa8c29f12bde88e067750853f560","source":{"kind":"arxiv","id":"1808.05389","version":1},"attestation_state":"computed","paper":{"title":"Simple Load Balancing","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DC","authors_text":"Dominik Kaaser, Peter Kling, Petra Berenbrink, Tom Friedetzky","submitted_at":"2018-08-16T09:36:14Z","abstract_excerpt":"We consider the following load balancing process for $m$ tokens distributed arbitrarily among $n$ nodes connected by a complete graph: In each time step a pair of nodes is selected uniformly at random. Let $\\ell_1$ and $\\ell_2$ be their respective number of tokens. The two nodes exchange tokens such that they have $\\lceil(\\ell_1 + \\ell_2)/2\\rceil$ and $\\lfloor(\\ell_1 + \\ell_2)/2\\rfloor$ tokens, respectively. We provide a simple analysis showing that this process reaches almost perfect balance within $O(n\\log{n} + n \\log{\\Delta})$ steps, where $\\Delta$ is the maximal initial load difference bet"},"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":"1808.05389","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2018-08-16T09:36:14Z","cross_cats_sorted":[],"title_canon_sha256":"78a0953f72d95d129f403eb40a5abfea8b18063e571fef5f0f34c0572f7e5ac6","abstract_canon_sha256":"7ba9f6c3ba941150e680a315259d38d79e06db922f5a2cdc2c0cd219e8ff4afb"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:07:57.234664Z","signature_b64":"LrzO5+G3H/l3i58H4wD44yOpp2bybjPQNKSmf0DycY+Bf7CrIxEyDByYW1d83fBMuMyYHeWjuTn6g4Qkp7bdDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0c2438190928d60cd9d204b0b017eef9ddcafa8c29f12bde88e067750853f560","last_reissued_at":"2026-05-18T00:07:57.233974Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:07:57.233974Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Simple Load Balancing","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DC","authors_text":"Dominik Kaaser, Peter Kling, Petra Berenbrink, Tom Friedetzky","submitted_at":"2018-08-16T09:36:14Z","abstract_excerpt":"We consider the following load balancing process for $m$ tokens distributed arbitrarily among $n$ nodes connected by a complete graph: In each time step a pair of nodes is selected uniformly at random. Let $\\ell_1$ and $\\ell_2$ be their respective number of tokens. The two nodes exchange tokens such that they have $\\lceil(\\ell_1 + \\ell_2)/2\\rceil$ and $\\lfloor(\\ell_1 + \\ell_2)/2\\rfloor$ tokens, respectively. We provide a simple analysis showing that this process reaches almost perfect balance within $O(n\\log{n} + n \\log{\\Delta})$ steps, where $\\Delta$ is the maximal initial load difference bet"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1808.05389","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":"1808.05389","created_at":"2026-05-18T00:07:57.234079+00:00"},{"alias_kind":"arxiv_version","alias_value":"1808.05389v1","created_at":"2026-05-18T00:07:57.234079+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1808.05389","created_at":"2026-05-18T00:07:57.234079+00:00"},{"alias_kind":"pith_short_12","alias_value":"BQSDQGIJFDLA","created_at":"2026-05-18T12:32:16.446611+00:00"},{"alias_kind":"pith_short_16","alias_value":"BQSDQGIJFDLAZWOS","created_at":"2026-05-18T12:32:16.446611+00:00"},{"alias_kind":"pith_short_8","alias_value":"BQSDQGIJ","created_at":"2026-05-18T12:32:16.446611+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/BQSDQGIJFDLAZWOSASYLAF7O7H","json":"https://pith.science/pith/BQSDQGIJFDLAZWOSASYLAF7O7H.json","graph_json":"https://pith.science/api/pith-number/BQSDQGIJFDLAZWOSASYLAF7O7H/graph.json","events_json":"https://pith.science/api/pith-number/BQSDQGIJFDLAZWOSASYLAF7O7H/events.json","paper":"https://pith.science/paper/BQSDQGIJ"},"agent_actions":{"view_html":"https://pith.science/pith/BQSDQGIJFDLAZWOSASYLAF7O7H","download_json":"https://pith.science/pith/BQSDQGIJFDLAZWOSASYLAF7O7H.json","view_paper":"https://pith.science/paper/BQSDQGIJ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1808.05389&json=true","fetch_graph":"https://pith.science/api/pith-number/BQSDQGIJFDLAZWOSASYLAF7O7H/graph.json","fetch_events":"https://pith.science/api/pith-number/BQSDQGIJFDLAZWOSASYLAF7O7H/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/BQSDQGIJFDLAZWOSASYLAF7O7H/action/timestamp_anchor","attest_storage":"https://pith.science/pith/BQSDQGIJFDLAZWOSASYLAF7O7H/action/storage_attestation","attest_author":"https://pith.science/pith/BQSDQGIJFDLAZWOSASYLAF7O7H/action/author_attestation","sign_citation":"https://pith.science/pith/BQSDQGIJFDLAZWOSASYLAF7O7H/action/citation_signature","submit_replication":"https://pith.science/pith/BQSDQGIJFDLAZWOSASYLAF7O7H/action/replication_record"}},"created_at":"2026-05-18T00:07:57.234079+00:00","updated_at":"2026-05-18T00:07:57.234079+00:00"}