{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:UWTV4K7BMCSLT2SFHWJCXHX4NA","short_pith_number":"pith:UWTV4K7B","schema_version":"1.0","canonical_sha256":"a5a75e2be160a4b9ea453d922b9efc68045f8d0349cf7619aef6b9bef72f598b","source":{"kind":"arxiv","id":"2607.06211","version":1},"attestation_state":"computed","paper":{"title":"Load Balancing under Adaptive Bin Deletions","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Haim Kaplan, Shay Sapir, Uri Stemmer","submitted_at":"2026-07-07T12:34:50Z","abstract_excerpt":"We analyze a balls-and-bins game against an adaptive adversary that sequentially deletes bins. Starting with $n$ balls distributed across $n$ bins, the adversary deletes a bin in each step, forcing the algorithm to redistribute its balls to surviving bins. We prove that after $n/2$ rounds, uniform random redistribution yields optimal $O(n)$ recourse and $O(\\frac{\\log n}{\\log \\log n})$ maximum load. Furthermore, we show that applying the ``power of two choices'' reduces the maximum load to $O(\\log \\log n)$ while maintaining linear recourse.\n  We also consider a variation of this game where the "},"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":"2607.06211","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2026-07-07T12:34:50Z","cross_cats_sorted":[],"title_canon_sha256":"bd3fda95c6ff0ad5d423dea4ba1efb9fb8a251b95bbc2e471428cb71217cc8d1","abstract_canon_sha256":"5d9b9d45cf73381cc3faf0ebb4fa8b9e871cdf81db349fb5a7854dd9956e1891"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-08T01:19:17.897851Z","signature_b64":"4q1X17eirxO8nsowu0/Jbmk9KwC8BsjmTjyG20qURskVOhLFIr5aQrW9jO1FxOAw+AI5k5JnS1L3UW67kRoLCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a5a75e2be160a4b9ea453d922b9efc68045f8d0349cf7619aef6b9bef72f598b","last_reissued_at":"2026-07-08T01:19:17.897399Z","signature_status":"signed_v1","first_computed_at":"2026-07-08T01:19:17.897399Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Load Balancing under Adaptive Bin Deletions","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Haim Kaplan, Shay Sapir, Uri Stemmer","submitted_at":"2026-07-07T12:34:50Z","abstract_excerpt":"We analyze a balls-and-bins game against an adaptive adversary that sequentially deletes bins. Starting with $n$ balls distributed across $n$ bins, the adversary deletes a bin in each step, forcing the algorithm to redistribute its balls to surviving bins. We prove that after $n/2$ rounds, uniform random redistribution yields optimal $O(n)$ recourse and $O(\\frac{\\log n}{\\log \\log n})$ maximum load. Furthermore, we show that applying the ``power of two choices'' reduces the maximum load to $O(\\log \\log n)$ while maintaining linear recourse.\n  We also consider a variation of this game where the "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2607.06211","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2607.06211/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"2607.06211","created_at":"2026-07-08T01:19:17.897458+00:00"},{"alias_kind":"arxiv_version","alias_value":"2607.06211v1","created_at":"2026-07-08T01:19:17.897458+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2607.06211","created_at":"2026-07-08T01:19:17.897458+00:00"},{"alias_kind":"pith_short_12","alias_value":"UWTV4K7BMCSL","created_at":"2026-07-08T01:19:17.897458+00:00"},{"alias_kind":"pith_short_16","alias_value":"UWTV4K7BMCSLT2SF","created_at":"2026-07-08T01:19:17.897458+00:00"},{"alias_kind":"pith_short_8","alias_value":"UWTV4K7B","created_at":"2026-07-08T01:19:17.897458+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/UWTV4K7BMCSLT2SFHWJCXHX4NA","json":"https://pith.science/pith/UWTV4K7BMCSLT2SFHWJCXHX4NA.json","graph_json":"https://pith.science/api/pith-number/UWTV4K7BMCSLT2SFHWJCXHX4NA/graph.json","events_json":"https://pith.science/api/pith-number/UWTV4K7BMCSLT2SFHWJCXHX4NA/events.json","paper":"https://pith.science/paper/UWTV4K7B"},"agent_actions":{"view_html":"https://pith.science/pith/UWTV4K7BMCSLT2SFHWJCXHX4NA","download_json":"https://pith.science/pith/UWTV4K7BMCSLT2SFHWJCXHX4NA.json","view_paper":"https://pith.science/paper/UWTV4K7B","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2607.06211&json=true","fetch_graph":"https://pith.science/api/pith-number/UWTV4K7BMCSLT2SFHWJCXHX4NA/graph.json","fetch_events":"https://pith.science/api/pith-number/UWTV4K7BMCSLT2SFHWJCXHX4NA/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/UWTV4K7BMCSLT2SFHWJCXHX4NA/action/timestamp_anchor","attest_storage":"https://pith.science/pith/UWTV4K7BMCSLT2SFHWJCXHX4NA/action/storage_attestation","attest_author":"https://pith.science/pith/UWTV4K7BMCSLT2SFHWJCXHX4NA/action/author_attestation","sign_citation":"https://pith.science/pith/UWTV4K7BMCSLT2SFHWJCXHX4NA/action/citation_signature","submit_replication":"https://pith.science/pith/UWTV4K7BMCSLT2SFHWJCXHX4NA/action/replication_record"}},"created_at":"2026-07-08T01:19:17.897458+00:00","updated_at":"2026-07-08T01:19:17.897458+00:00"}