{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:PKB35RNG4545INWWHEP7GCP43S","short_pith_number":"pith:PKB35RNG","schema_version":"1.0","canonical_sha256":"7a83bec5a6e779d436d6391ff309fcdca331c2279153a8c0e5f5298ff8f37cc6","source":{"kind":"arxiv","id":"1807.01804","version":2},"attestation_state":"computed","paper":{"title":"Optimal Ball Recycling","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Alex Conway, Jake Christensen, Mart\\'in Farach-Colton, Meng-Tsung Tsai, Michael A. Bender, Rob Johnson","submitted_at":"2018-07-04T22:49:10Z","abstract_excerpt":"Balls-and-bins games have been a wildly successful tool for modeling load balancing problems. In this paper, we study a new scenario, which we call the ball recycling game, defined as follows:\n  Throw m balls into n bins i.i.d. according to a given probability distribution p. Then, at each time step, pick a non-empty bin and recycle its balls: take the balls from the selected bin and re-throw them according to p.\n  This balls-and-bins game closely models memory-access heuristics in databases. The goal is to have a bin-picking method that maximizes the recycling rate, defined to be the expected"},"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":"1807.01804","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-07-04T22:49:10Z","cross_cats_sorted":[],"title_canon_sha256":"78e3f999356bfb36c0d2ed2694c004cbd21b2b6074d16d8ff6376d1b20f57a49","abstract_canon_sha256":"2d0e4129135f64ac54150e649e0bf81b744c7ee2600a3822a762d8653c0ead71"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:01:43.304106Z","signature_b64":"V0E9eAfyXUCQIv7MzVSZkN3Ig3pUrrSwI5AbhhpUKZL2hcxRrvjDO7NfrGc0sZL/JWyGS2TJicXGPikIm0M0Bw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"7a83bec5a6e779d436d6391ff309fcdca331c2279153a8c0e5f5298ff8f37cc6","last_reissued_at":"2026-05-18T00:01:43.303614Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:01:43.303614Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Optimal Ball Recycling","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Alex Conway, Jake Christensen, Mart\\'in Farach-Colton, Meng-Tsung Tsai, Michael A. Bender, Rob Johnson","submitted_at":"2018-07-04T22:49:10Z","abstract_excerpt":"Balls-and-bins games have been a wildly successful tool for modeling load balancing problems. In this paper, we study a new scenario, which we call the ball recycling game, defined as follows:\n  Throw m balls into n bins i.i.d. according to a given probability distribution p. Then, at each time step, pick a non-empty bin and recycle its balls: take the balls from the selected bin and re-throw them according to p.\n  This balls-and-bins game closely models memory-access heuristics in databases. The goal is to have a bin-picking method that maximizes the recycling rate, defined to be the expected"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1807.01804","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":"1807.01804","created_at":"2026-05-18T00:01:43.303687+00:00"},{"alias_kind":"arxiv_version","alias_value":"1807.01804v2","created_at":"2026-05-18T00:01:43.303687+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1807.01804","created_at":"2026-05-18T00:01:43.303687+00:00"},{"alias_kind":"pith_short_12","alias_value":"PKB35RNG4545","created_at":"2026-05-18T12:32:46.962924+00:00"},{"alias_kind":"pith_short_16","alias_value":"PKB35RNG4545INWW","created_at":"2026-05-18T12:32:46.962924+00:00"},{"alias_kind":"pith_short_8","alias_value":"PKB35RNG","created_at":"2026-05-18T12:32:46.962924+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/PKB35RNG4545INWWHEP7GCP43S","json":"https://pith.science/pith/PKB35RNG4545INWWHEP7GCP43S.json","graph_json":"https://pith.science/api/pith-number/PKB35RNG4545INWWHEP7GCP43S/graph.json","events_json":"https://pith.science/api/pith-number/PKB35RNG4545INWWHEP7GCP43S/events.json","paper":"https://pith.science/paper/PKB35RNG"},"agent_actions":{"view_html":"https://pith.science/pith/PKB35RNG4545INWWHEP7GCP43S","download_json":"https://pith.science/pith/PKB35RNG4545INWWHEP7GCP43S.json","view_paper":"https://pith.science/paper/PKB35RNG","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1807.01804&json=true","fetch_graph":"https://pith.science/api/pith-number/PKB35RNG4545INWWHEP7GCP43S/graph.json","fetch_events":"https://pith.science/api/pith-number/PKB35RNG4545INWWHEP7GCP43S/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/PKB35RNG4545INWWHEP7GCP43S/action/timestamp_anchor","attest_storage":"https://pith.science/pith/PKB35RNG4545INWWHEP7GCP43S/action/storage_attestation","attest_author":"https://pith.science/pith/PKB35RNG4545INWWHEP7GCP43S/action/author_attestation","sign_citation":"https://pith.science/pith/PKB35RNG4545INWWHEP7GCP43S/action/citation_signature","submit_replication":"https://pith.science/pith/PKB35RNG4545INWWHEP7GCP43S/action/replication_record"}},"created_at":"2026-05-18T00:01:43.303687+00:00","updated_at":"2026-05-18T00:01:43.303687+00:00"}