{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2022:DVILD5PIPP6Q4YLRJ2PAKEIEOZ","short_pith_number":"pith:DVILD5PI","canonical_record":{"source":{"id":"2205.06558","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2022-05-13T10:57:33Z","cross_cats_sorted":[],"title_canon_sha256":"ecff1eeab4380e044d93b24df6c94a2cc85c7fcabd9528ef05143aa63b92c94d","abstract_canon_sha256":"2bf01b16d131e952f2694a35225f742bede3943c2a499487a170ca4de1086c05"},"schema_version":"1.0"},"canonical_sha256":"1d50b1f5e87bfd0e61714e9e051104767ba0ede7cf50533c4552248a3e33c795","source":{"kind":"arxiv","id":"2205.06558","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2205.06558","created_at":"2026-07-05T04:22:59Z"},{"alias_kind":"arxiv_version","alias_value":"2205.06558v1","created_at":"2026-07-05T04:22:59Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2205.06558","created_at":"2026-07-05T04:22:59Z"},{"alias_kind":"pith_short_12","alias_value":"DVILD5PIPP6Q","created_at":"2026-07-05T04:22:59Z"},{"alias_kind":"pith_short_16","alias_value":"DVILD5PIPP6Q4YLR","created_at":"2026-07-05T04:22:59Z"},{"alias_kind":"pith_short_8","alias_value":"DVILD5PI","created_at":"2026-07-05T04:22:59Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2022:DVILD5PIPP6Q4YLRJ2PAKEIEOZ","target":"record","payload":{"canonical_record":{"source":{"id":"2205.06558","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2022-05-13T10:57:33Z","cross_cats_sorted":[],"title_canon_sha256":"ecff1eeab4380e044d93b24df6c94a2cc85c7fcabd9528ef05143aa63b92c94d","abstract_canon_sha256":"2bf01b16d131e952f2694a35225f742bede3943c2a499487a170ca4de1086c05"},"schema_version":"1.0"},"canonical_sha256":"1d50b1f5e87bfd0e61714e9e051104767ba0ede7cf50533c4552248a3e33c795","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T04:22:59.513473Z","signature_b64":"3KT6tWDk0qFeMqeaFeCmpCIROX0Cfs43vwIJPohDy9jsBd8aMvi4INOLewT5gjcTcLeMqZhFQ2yk568VR6oMCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1d50b1f5e87bfd0e61714e9e051104767ba0ede7cf50533c4552248a3e33c795","last_reissued_at":"2026-07-05T04:22:59.513058Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T04:22:59.513058Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2205.06558","source_version":1,"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-07-05T04:22:59Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Re7WCfdZpvNDFAzctbNKnohJLmCotfvB7AZ6arVVgHTpWhDay/POWqlt5+KrW9Ycs4a5U9eavq0GbXHOpOIeBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-21T13:48:06.543782Z"},"content_sha256":"4773dc02b3374e901ca7a95d716a1afb590a440d7670e776a2c320f75e6a51a2","schema_version":"1.0","event_id":"sha256:4773dc02b3374e901ca7a95d716a1afb590a440d7670e776a2c320f75e6a51a2"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2022:DVILD5PIPP6Q4YLRJ2PAKEIEOZ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Balanced Allocations: The Heavily Loaded Case with Deletions","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Nikhil Bansal, William Kuszmaul","submitted_at":"2022-05-13T10:57:33Z","abstract_excerpt":"In the 2-choice allocation problem, $m$ balls are placed into $n$ bins, and each ball must choose between two random bins $i, j \\in [n]$ that it has been assigned to. It has been known for more than two decades, that if each ball follows the Greedy strategy (i.e., always pick the less-full bin), then the maximum load will be $m/n + O(\\log \\log n)$ with high probability in $n$ (and $m / n + O(\\log m)$ with high probability in $m$). It has remained open whether the same bounds hold in the dynamic version of the same game, where balls are inserted/deleted with up to $m$ balls present at a time.\n "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2205.06558","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/2205.06558/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"},"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-07-05T04:22:59Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"cYmLOrVONfJ2Vv82LuKmYp333LavZn5mABFs61lzyzzQi0HfDkYbddcJwD6mvmROhbyt0lx992rSaatIJ9N6CA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-21T13:48:06.544500Z"},"content_sha256":"6c932db80afae10a30d9af6fe7bed36aaeadc05b6605ff13af5ad619251207e4","schema_version":"1.0","event_id":"sha256:6c932db80afae10a30d9af6fe7bed36aaeadc05b6605ff13af5ad619251207e4"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/DVILD5PIPP6Q4YLRJ2PAKEIEOZ/bundle.json","state_url":"https://pith.science/pith/DVILD5PIPP6Q4YLRJ2PAKEIEOZ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/DVILD5PIPP6Q4YLRJ2PAKEIEOZ/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-08-21T13:48:06Z","links":{"resolver":"https://pith.science/pith/DVILD5PIPP6Q4YLRJ2PAKEIEOZ","bundle":"https://pith.science/pith/DVILD5PIPP6Q4YLRJ2PAKEIEOZ/bundle.json","state":"https://pith.science/pith/DVILD5PIPP6Q4YLRJ2PAKEIEOZ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/DVILD5PIPP6Q4YLRJ2PAKEIEOZ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2022:DVILD5PIPP6Q4YLRJ2PAKEIEOZ","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":"2bf01b16d131e952f2694a35225f742bede3943c2a499487a170ca4de1086c05","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2022-05-13T10:57:33Z","title_canon_sha256":"ecff1eeab4380e044d93b24df6c94a2cc85c7fcabd9528ef05143aa63b92c94d"},"schema_version":"1.0","source":{"id":"2205.06558","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2205.06558","created_at":"2026-07-05T04:22:59Z"},{"alias_kind":"arxiv_version","alias_value":"2205.06558v1","created_at":"2026-07-05T04:22:59Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2205.06558","created_at":"2026-07-05T04:22:59Z"},{"alias_kind":"pith_short_12","alias_value":"DVILD5PIPP6Q","created_at":"2026-07-05T04:22:59Z"},{"alias_kind":"pith_short_16","alias_value":"DVILD5PIPP6Q4YLR","created_at":"2026-07-05T04:22:59Z"},{"alias_kind":"pith_short_8","alias_value":"DVILD5PI","created_at":"2026-07-05T04:22:59Z"}],"graph_snapshots":[{"event_id":"sha256:6c932db80afae10a30d9af6fe7bed36aaeadc05b6605ff13af5ad619251207e4","target":"graph","created_at":"2026-07-05T04:22:59Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2205.06558/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"In the 2-choice allocation problem, $m$ balls are placed into $n$ bins, and each ball must choose between two random bins $i, j \\in [n]$ that it has been assigned to. It has been known for more than two decades, that if each ball follows the Greedy strategy (i.e., always pick the less-full bin), then the maximum load will be $m/n + O(\\log \\log n)$ with high probability in $n$ (and $m / n + O(\\log m)$ with high probability in $m$). It has remained open whether the same bounds hold in the dynamic version of the same game, where balls are inserted/deleted with up to $m$ balls present at a time.\n ","authors_text":"Nikhil Bansal, William Kuszmaul","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2022-05-13T10:57:33Z","title":"Balanced Allocations: The Heavily Loaded Case with Deletions"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2205.06558","kind":"arxiv","version":1},"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:4773dc02b3374e901ca7a95d716a1afb590a440d7670e776a2c320f75e6a51a2","target":"record","created_at":"2026-07-05T04:22:59Z","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":"2bf01b16d131e952f2694a35225f742bede3943c2a499487a170ca4de1086c05","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2022-05-13T10:57:33Z","title_canon_sha256":"ecff1eeab4380e044d93b24df6c94a2cc85c7fcabd9528ef05143aa63b92c94d"},"schema_version":"1.0","source":{"id":"2205.06558","kind":"arxiv","version":1}},"canonical_sha256":"1d50b1f5e87bfd0e61714e9e051104767ba0ede7cf50533c4552248a3e33c795","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"1d50b1f5e87bfd0e61714e9e051104767ba0ede7cf50533c4552248a3e33c795","first_computed_at":"2026-07-05T04:22:59.513058Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T04:22:59.513058Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"3KT6tWDk0qFeMqeaFeCmpCIROX0Cfs43vwIJPohDy9jsBd8aMvi4INOLewT5gjcTcLeMqZhFQ2yk568VR6oMCQ==","signature_status":"signed_v1","signed_at":"2026-07-05T04:22:59.513473Z","signed_message":"canonical_sha256_bytes"},"source_id":"2205.06558","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:4773dc02b3374e901ca7a95d716a1afb590a440d7670e776a2c320f75e6a51a2","sha256:6c932db80afae10a30d9af6fe7bed36aaeadc05b6605ff13af5ad619251207e4"],"state_sha256":"3b8d945f611211aabe12e98e18039526f87589de86cc3a41003ee55ea51c771b"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"7huWaLFb8Ipe5QRJAfs7ZL4AKq4VmcqeS6W2BX9LxjWQp0FavvWj62Eop7VCl5MHx8kxxwJOsA2VWs4SfXoeBw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-21T13:48:06.548878Z","bundle_sha256":"75163fbc6bd6e89c569f4c58e9a125dcd4a88d3595e6c305a9986f83bb0ec02b"}}