{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:5ZA4EOPUGOLXSIAPZKDQUPHBM7","short_pith_number":"pith:5ZA4EOPU","schema_version":"1.0","canonical_sha256":"ee41c239f4339779200fca870a3ce167c35893a2c0f5f16900300a6b99f8ab28","source":{"kind":"arxiv","id":"1602.08298","version":2},"attestation_state":"computed","paper":{"title":"Balanced Allocation: Patience is not a Virtue","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"cs.DS","authors_text":"Amanda Redlich, Eli Upfal, John Augustine, William K. Moses Jr.","submitted_at":"2016-02-26T12:45:25Z","abstract_excerpt":"Load balancing is a well-studied problem, with balls-in-bins being the primary framework. The greedy algorithm $\\mathsf{Greedy}[d]$ of Azar et al. places each ball by probing $d > 1$ random bins and placing the ball in the least loaded of them. With high probability, the maximum load under $\\mathsf{Greedy}[d]$ is exponentially lower than the result when balls are placed uniformly randomly. V\\\"ocking showed that a slightly asymmetric variant, $\\mathsf{Left}[d]$, provides a further significant improvement. However, this improvement comes at an additional computational cost of imposing structure "},"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":"1602.08298","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-02-26T12:45:25Z","cross_cats_sorted":["cs.DM"],"title_canon_sha256":"8bbcac41c68a74225facd3642f14675b691092bc040aaaa3dc14b08cf62c5ce8","abstract_canon_sha256":"1829d54d4922ce2ec9c690409968762dd59e365a07975b543ba12437e809f668"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:25:21.500947Z","signature_b64":"xHLtYaROHN62Rbys3QXDisvJhpCmwz9ZHQrdWltCGkel5bra40l9/S6vfi3G+8//TcTKLWULWBaQUB/Pma5DBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ee41c239f4339779200fca870a3ce167c35893a2c0f5f16900300a6b99f8ab28","last_reissued_at":"2026-05-18T00:25:21.500376Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:25:21.500376Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Balanced Allocation: Patience is not a Virtue","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"cs.DS","authors_text":"Amanda Redlich, Eli Upfal, John Augustine, William K. Moses Jr.","submitted_at":"2016-02-26T12:45:25Z","abstract_excerpt":"Load balancing is a well-studied problem, with balls-in-bins being the primary framework. The greedy algorithm $\\mathsf{Greedy}[d]$ of Azar et al. places each ball by probing $d > 1$ random bins and placing the ball in the least loaded of them. With high probability, the maximum load under $\\mathsf{Greedy}[d]$ is exponentially lower than the result when balls are placed uniformly randomly. V\\\"ocking showed that a slightly asymmetric variant, $\\mathsf{Left}[d]$, provides a further significant improvement. However, this improvement comes at an additional computational cost of imposing structure "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1602.08298","kind":"arxiv","version":2},"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":"1602.08298","created_at":"2026-05-18T00:25:21.500456+00:00"},{"alias_kind":"arxiv_version","alias_value":"1602.08298v2","created_at":"2026-05-18T00:25:21.500456+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1602.08298","created_at":"2026-05-18T00:25:21.500456+00:00"},{"alias_kind":"pith_short_12","alias_value":"5ZA4EOPUGOLX","created_at":"2026-05-18T12:30:01.593930+00:00"},{"alias_kind":"pith_short_16","alias_value":"5ZA4EOPUGOLXSIAP","created_at":"2026-05-18T12:30:01.593930+00:00"},{"alias_kind":"pith_short_8","alias_value":"5ZA4EOPU","created_at":"2026-05-18T12:30:01.593930+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/5ZA4EOPUGOLXSIAPZKDQUPHBM7","json":"https://pith.science/pith/5ZA4EOPUGOLXSIAPZKDQUPHBM7.json","graph_json":"https://pith.science/api/pith-number/5ZA4EOPUGOLXSIAPZKDQUPHBM7/graph.json","events_json":"https://pith.science/api/pith-number/5ZA4EOPUGOLXSIAPZKDQUPHBM7/events.json","paper":"https://pith.science/paper/5ZA4EOPU"},"agent_actions":{"view_html":"https://pith.science/pith/5ZA4EOPUGOLXSIAPZKDQUPHBM7","download_json":"https://pith.science/pith/5ZA4EOPUGOLXSIAPZKDQUPHBM7.json","view_paper":"https://pith.science/paper/5ZA4EOPU","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1602.08298&json=true","fetch_graph":"https://pith.science/api/pith-number/5ZA4EOPUGOLXSIAPZKDQUPHBM7/graph.json","fetch_events":"https://pith.science/api/pith-number/5ZA4EOPUGOLXSIAPZKDQUPHBM7/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/5ZA4EOPUGOLXSIAPZKDQUPHBM7/action/timestamp_anchor","attest_storage":"https://pith.science/pith/5ZA4EOPUGOLXSIAPZKDQUPHBM7/action/storage_attestation","attest_author":"https://pith.science/pith/5ZA4EOPUGOLXSIAPZKDQUPHBM7/action/author_attestation","sign_citation":"https://pith.science/pith/5ZA4EOPUGOLXSIAPZKDQUPHBM7/action/citation_signature","submit_replication":"https://pith.science/pith/5ZA4EOPUGOLXSIAPZKDQUPHBM7/action/replication_record"}},"created_at":"2026-05-18T00:25:21.500456+00:00","updated_at":"2026-05-18T00:25:21.500456+00:00"}