{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:GBDGRWEVB3XDMFVRDYG7LJ62WH","short_pith_number":"pith:GBDGRWEV","schema_version":"1.0","canonical_sha256":"304668d8950eee3616b11e0df5a7dab1ff420e2c21cc6cf90f69701c77b07502","source":{"kind":"arxiv","id":"1904.07532","version":1},"attestation_state":"computed","paper":{"title":"Parallel Balanced Allocations: The Heavily Loaded Case","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DC","authors_text":"Christoph Lenzen, Eylon Yogev, Merav Parter","submitted_at":"2019-04-16T08:31:33Z","abstract_excerpt":"We study parallel algorithms for the classical balls-into-bins problem, in which $m$ balls acting in parallel as separate agents are placed into $n$ bins. Algorithms operate in synchronous rounds, in each of which balls and bins exchange messages once. The goal is to minimize the maximal load over all bins using a small number of rounds and few messages.\n  While the case of $m=n$ balls has been extensively studied, little is known about the heavily loaded case. In this work, we consider parallel algorithms for this somewhat neglected regime of $m\\gg n$. The naive solution of allocating each ba"},"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":"1904.07532","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2019-04-16T08:31:33Z","cross_cats_sorted":[],"title_canon_sha256":"9400acc293129cab8b6202bead5469972c0effe9c7bc5f3d8ca14033cf3a2563","abstract_canon_sha256":"2d60b9bfe71707250a7c9b7248ef0263fef9c08816e5073ac8247aa13ef34f7b"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:48:24.960252Z","signature_b64":"TlKw5cbhr9IpmTtX40vB16/WGMSgQQ4C8LfOix0dtzdgOv7L1mo8NtXG0jQNj2BW0RhwKWNrcV4YxVnariBqDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"304668d8950eee3616b11e0df5a7dab1ff420e2c21cc6cf90f69701c77b07502","last_reissued_at":"2026-05-17T23:48:24.959561Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:48:24.959561Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Parallel Balanced Allocations: The Heavily Loaded Case","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DC","authors_text":"Christoph Lenzen, Eylon Yogev, Merav Parter","submitted_at":"2019-04-16T08:31:33Z","abstract_excerpt":"We study parallel algorithms for the classical balls-into-bins problem, in which $m$ balls acting in parallel as separate agents are placed into $n$ bins. Algorithms operate in synchronous rounds, in each of which balls and bins exchange messages once. The goal is to minimize the maximal load over all bins using a small number of rounds and few messages.\n  While the case of $m=n$ balls has been extensively studied, little is known about the heavily loaded case. In this work, we consider parallel algorithms for this somewhat neglected regime of $m\\gg n$. The naive solution of allocating each ba"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1904.07532","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":"1904.07532","created_at":"2026-05-17T23:48:24.959681+00:00"},{"alias_kind":"arxiv_version","alias_value":"1904.07532v1","created_at":"2026-05-17T23:48:24.959681+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1904.07532","created_at":"2026-05-17T23:48:24.959681+00:00"},{"alias_kind":"pith_short_12","alias_value":"GBDGRWEVB3XD","created_at":"2026-05-18T12:33:18.533446+00:00"},{"alias_kind":"pith_short_16","alias_value":"GBDGRWEVB3XDMFVR","created_at":"2026-05-18T12:33:18.533446+00:00"},{"alias_kind":"pith_short_8","alias_value":"GBDGRWEV","created_at":"2026-05-18T12:33:18.533446+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/GBDGRWEVB3XDMFVRDYG7LJ62WH","json":"https://pith.science/pith/GBDGRWEVB3XDMFVRDYG7LJ62WH.json","graph_json":"https://pith.science/api/pith-number/GBDGRWEVB3XDMFVRDYG7LJ62WH/graph.json","events_json":"https://pith.science/api/pith-number/GBDGRWEVB3XDMFVRDYG7LJ62WH/events.json","paper":"https://pith.science/paper/GBDGRWEV"},"agent_actions":{"view_html":"https://pith.science/pith/GBDGRWEVB3XDMFVRDYG7LJ62WH","download_json":"https://pith.science/pith/GBDGRWEVB3XDMFVRDYG7LJ62WH.json","view_paper":"https://pith.science/paper/GBDGRWEV","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1904.07532&json=true","fetch_graph":"https://pith.science/api/pith-number/GBDGRWEVB3XDMFVRDYG7LJ62WH/graph.json","fetch_events":"https://pith.science/api/pith-number/GBDGRWEVB3XDMFVRDYG7LJ62WH/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/GBDGRWEVB3XDMFVRDYG7LJ62WH/action/timestamp_anchor","attest_storage":"https://pith.science/pith/GBDGRWEVB3XDMFVRDYG7LJ62WH/action/storage_attestation","attest_author":"https://pith.science/pith/GBDGRWEVB3XDMFVRDYG7LJ62WH/action/author_attestation","sign_citation":"https://pith.science/pith/GBDGRWEVB3XDMFVRDYG7LJ62WH/action/citation_signature","submit_replication":"https://pith.science/pith/GBDGRWEVB3XDMFVRDYG7LJ62WH/action/replication_record"}},"created_at":"2026-05-17T23:48:24.959681+00:00","updated_at":"2026-05-17T23:48:24.959681+00:00"}