{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:GBDGRWEVB3XDMFVRDYG7LJ62WH","short_pith_number":"pith:GBDGRWEV","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"},"canonical_sha256":"304668d8950eee3616b11e0df5a7dab1ff420e2c21cc6cf90f69701c77b07502","source":{"kind":"arxiv","id":"1904.07532","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1904.07532","created_at":"2026-05-17T23:48:24Z"},{"alias_kind":"arxiv_version","alias_value":"1904.07532v1","created_at":"2026-05-17T23:48:24Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1904.07532","created_at":"2026-05-17T23:48:24Z"},{"alias_kind":"pith_short_12","alias_value":"GBDGRWEVB3XD","created_at":"2026-05-18T12:33:18Z"},{"alias_kind":"pith_short_16","alias_value":"GBDGRWEVB3XDMFVR","created_at":"2026-05-18T12:33:18Z"},{"alias_kind":"pith_short_8","alias_value":"GBDGRWEV","created_at":"2026-05-18T12:33:18Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:GBDGRWEVB3XDMFVRDYG7LJ62WH","target":"record","payload":{"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"},"canonical_sha256":"304668d8950eee3616b11e0df5a7dab1ff420e2c21cc6cf90f69701c77b07502","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"},"source_kind":"arxiv","source_id":"1904.07532","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-05-17T23:48:24Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"hMWcck0S3H8cfstFhY/TL+kMBQAkxucHj+iCou3qIlGJ00heDYuyEUzUMyZyOvoffZgz1qynGFBiasvldvLDAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T23:18:14.650081Z"},"content_sha256":"e8b9d603b522cd01dd475cd1a4283c0046fd518b1e12526130a6423bc5d55a72","schema_version":"1.0","event_id":"sha256:e8b9d603b522cd01dd475cd1a4283c0046fd518b1e12526130a6423bc5d55a72"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:GBDGRWEVB3XDMFVRDYG7LJ62WH","target":"graph","payload":{"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"},"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-05-17T23:48:24Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"AYv7+wKmN9/KJ+8LdQ2GY9DZ3/XMFf59UhAIL61j7mcF5f4USBEAy5dgJdjrHHJTsQK9e8YC6Q4LYNJgGDsnCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T23:18:14.650765Z"},"content_sha256":"292aa1afd33938765a6a2489d2a13c86d71bd68153e6cdf07194c43b6b4434f3","schema_version":"1.0","event_id":"sha256:292aa1afd33938765a6a2489d2a13c86d71bd68153e6cdf07194c43b6b4434f3"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/GBDGRWEVB3XDMFVRDYG7LJ62WH/bundle.json","state_url":"https://pith.science/pith/GBDGRWEVB3XDMFVRDYG7LJ62WH/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/GBDGRWEVB3XDMFVRDYG7LJ62WH/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-05-27T23:18:14Z","links":{"resolver":"https://pith.science/pith/GBDGRWEVB3XDMFVRDYG7LJ62WH","bundle":"https://pith.science/pith/GBDGRWEVB3XDMFVRDYG7LJ62WH/bundle.json","state":"https://pith.science/pith/GBDGRWEVB3XDMFVRDYG7LJ62WH/state.json","well_known_bundle":"https://pith.science/.well-known/pith/GBDGRWEVB3XDMFVRDYG7LJ62WH/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:GBDGRWEVB3XDMFVRDYG7LJ62WH","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":"2d60b9bfe71707250a7c9b7248ef0263fef9c08816e5073ac8247aa13ef34f7b","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2019-04-16T08:31:33Z","title_canon_sha256":"9400acc293129cab8b6202bead5469972c0effe9c7bc5f3d8ca14033cf3a2563"},"schema_version":"1.0","source":{"id":"1904.07532","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1904.07532","created_at":"2026-05-17T23:48:24Z"},{"alias_kind":"arxiv_version","alias_value":"1904.07532v1","created_at":"2026-05-17T23:48:24Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1904.07532","created_at":"2026-05-17T23:48:24Z"},{"alias_kind":"pith_short_12","alias_value":"GBDGRWEVB3XD","created_at":"2026-05-18T12:33:18Z"},{"alias_kind":"pith_short_16","alias_value":"GBDGRWEVB3XDMFVR","created_at":"2026-05-18T12:33:18Z"},{"alias_kind":"pith_short_8","alias_value":"GBDGRWEV","created_at":"2026-05-18T12:33:18Z"}],"graph_snapshots":[{"event_id":"sha256:292aa1afd33938765a6a2489d2a13c86d71bd68153e6cdf07194c43b6b4434f3","target":"graph","created_at":"2026-05-17T23:48:24Z","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"},"paper":{"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","authors_text":"Christoph Lenzen, Eylon Yogev, Merav Parter","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2019-04-16T08:31:33Z","title":"Parallel Balanced Allocations: The Heavily Loaded Case"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1904.07532","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:e8b9d603b522cd01dd475cd1a4283c0046fd518b1e12526130a6423bc5d55a72","target":"record","created_at":"2026-05-17T23:48:24Z","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":"2d60b9bfe71707250a7c9b7248ef0263fef9c08816e5073ac8247aa13ef34f7b","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2019-04-16T08:31:33Z","title_canon_sha256":"9400acc293129cab8b6202bead5469972c0effe9c7bc5f3d8ca14033cf3a2563"},"schema_version":"1.0","source":{"id":"1904.07532","kind":"arxiv","version":1}},"canonical_sha256":"304668d8950eee3616b11e0df5a7dab1ff420e2c21cc6cf90f69701c77b07502","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"304668d8950eee3616b11e0df5a7dab1ff420e2c21cc6cf90f69701c77b07502","first_computed_at":"2026-05-17T23:48:24.959561Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:48:24.959561Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"TlKw5cbhr9IpmTtX40vB16/WGMSgQQ4C8LfOix0dtzdgOv7L1mo8NtXG0jQNj2BW0RhwKWNrcV4YxVnariBqDQ==","signature_status":"signed_v1","signed_at":"2026-05-17T23:48:24.960252Z","signed_message":"canonical_sha256_bytes"},"source_id":"1904.07532","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:e8b9d603b522cd01dd475cd1a4283c0046fd518b1e12526130a6423bc5d55a72","sha256:292aa1afd33938765a6a2489d2a13c86d71bd68153e6cdf07194c43b6b4434f3"],"state_sha256":"1ec7a72b648865820c8c78186c952f161ff05d7a47c75dcaea3a28163fb9a4c1"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"888QbjzDwitt5HGfmeTcyMuVAUOe97+/fDlxQ7f1FZ+bOiCI7vw+/cFJJfo9xnnInSnXrldGFspl/lJwS0DSDw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-27T23:18:14.654203Z","bundle_sha256":"35fb97890b44b706c2d8dac133caf70aebc7049deed17330bb087c43cc703090"}}