{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:PKB35RNG4545INWWHEP7GCP43S","short_pith_number":"pith:PKB35RNG","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"},"canonical_sha256":"7a83bec5a6e779d436d6391ff309fcdca331c2279153a8c0e5f5298ff8f37cc6","source":{"kind":"arxiv","id":"1807.01804","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1807.01804","created_at":"2026-05-18T00:01:43Z"},{"alias_kind":"arxiv_version","alias_value":"1807.01804v2","created_at":"2026-05-18T00:01:43Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1807.01804","created_at":"2026-05-18T00:01:43Z"},{"alias_kind":"pith_short_12","alias_value":"PKB35RNG4545","created_at":"2026-05-18T12:32:46Z"},{"alias_kind":"pith_short_16","alias_value":"PKB35RNG4545INWW","created_at":"2026-05-18T12:32:46Z"},{"alias_kind":"pith_short_8","alias_value":"PKB35RNG","created_at":"2026-05-18T12:32:46Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:PKB35RNG4545INWWHEP7GCP43S","target":"record","payload":{"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"},"canonical_sha256":"7a83bec5a6e779d436d6391ff309fcdca331c2279153a8c0e5f5298ff8f37cc6","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"},"source_kind":"arxiv","source_id":"1807.01804","source_version":2,"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-18T00:01:43Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"FdvkgvuKym1zPXkNhs0mPD4SsrUM776Lnk/ZvKEokC1S2LjrW1JA50bBlx7ZpA8DfeI2pE87Y6fpPxiXn7TXAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T16:30:34.431130Z"},"content_sha256":"fc362d408ae01d2738aa85e2df76671cb7e145293afd8bf890f8ccd5c06d44fc","schema_version":"1.0","event_id":"sha256:fc362d408ae01d2738aa85e2df76671cb7e145293afd8bf890f8ccd5c06d44fc"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:PKB35RNG4545INWWHEP7GCP43S","target":"graph","payload":{"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"},"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-18T00:01:43Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"WmCJWRWkyVjsv4zG45YY1ha20EImOA+0RwONm4Tz628YBswgX/zFmhfhfni1Y1lWqKWt5bdaZYihBYLBNLNzAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T16:30:34.431712Z"},"content_sha256":"b0d618c83d72f843ee059e8fafec101dfb473a5cf8b45a2f7e57f15f5caf643e","schema_version":"1.0","event_id":"sha256:b0d618c83d72f843ee059e8fafec101dfb473a5cf8b45a2f7e57f15f5caf643e"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/PKB35RNG4545INWWHEP7GCP43S/bundle.json","state_url":"https://pith.science/pith/PKB35RNG4545INWWHEP7GCP43S/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/PKB35RNG4545INWWHEP7GCP43S/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-30T16:30:34Z","links":{"resolver":"https://pith.science/pith/PKB35RNG4545INWWHEP7GCP43S","bundle":"https://pith.science/pith/PKB35RNG4545INWWHEP7GCP43S/bundle.json","state":"https://pith.science/pith/PKB35RNG4545INWWHEP7GCP43S/state.json","well_known_bundle":"https://pith.science/.well-known/pith/PKB35RNG4545INWWHEP7GCP43S/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:PKB35RNG4545INWWHEP7GCP43S","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":"2d0e4129135f64ac54150e649e0bf81b744c7ee2600a3822a762d8653c0ead71","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-07-04T22:49:10Z","title_canon_sha256":"78e3f999356bfb36c0d2ed2694c004cbd21b2b6074d16d8ff6376d1b20f57a49"},"schema_version":"1.0","source":{"id":"1807.01804","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1807.01804","created_at":"2026-05-18T00:01:43Z"},{"alias_kind":"arxiv_version","alias_value":"1807.01804v2","created_at":"2026-05-18T00:01:43Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1807.01804","created_at":"2026-05-18T00:01:43Z"},{"alias_kind":"pith_short_12","alias_value":"PKB35RNG4545","created_at":"2026-05-18T12:32:46Z"},{"alias_kind":"pith_short_16","alias_value":"PKB35RNG4545INWW","created_at":"2026-05-18T12:32:46Z"},{"alias_kind":"pith_short_8","alias_value":"PKB35RNG","created_at":"2026-05-18T12:32:46Z"}],"graph_snapshots":[{"event_id":"sha256:b0d618c83d72f843ee059e8fafec101dfb473a5cf8b45a2f7e57f15f5caf643e","target":"graph","created_at":"2026-05-18T00:01:43Z","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":"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","authors_text":"Alex Conway, Jake Christensen, Mart\\'in Farach-Colton, Meng-Tsung Tsai, Michael A. Bender, Rob Johnson","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-07-04T22:49:10Z","title":"Optimal Ball Recycling"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1807.01804","kind":"arxiv","version":2},"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:fc362d408ae01d2738aa85e2df76671cb7e145293afd8bf890f8ccd5c06d44fc","target":"record","created_at":"2026-05-18T00:01:43Z","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":"2d0e4129135f64ac54150e649e0bf81b744c7ee2600a3822a762d8653c0ead71","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-07-04T22:49:10Z","title_canon_sha256":"78e3f999356bfb36c0d2ed2694c004cbd21b2b6074d16d8ff6376d1b20f57a49"},"schema_version":"1.0","source":{"id":"1807.01804","kind":"arxiv","version":2}},"canonical_sha256":"7a83bec5a6e779d436d6391ff309fcdca331c2279153a8c0e5f5298ff8f37cc6","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"7a83bec5a6e779d436d6391ff309fcdca331c2279153a8c0e5f5298ff8f37cc6","first_computed_at":"2026-05-18T00:01:43.303614Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:01:43.303614Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"V0E9eAfyXUCQIv7MzVSZkN3Ig3pUrrSwI5AbhhpUKZL2hcxRrvjDO7NfrGc0sZL/JWyGS2TJicXGPikIm0M0Bw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:01:43.304106Z","signed_message":"canonical_sha256_bytes"},"source_id":"1807.01804","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:fc362d408ae01d2738aa85e2df76671cb7e145293afd8bf890f8ccd5c06d44fc","sha256:b0d618c83d72f843ee059e8fafec101dfb473a5cf8b45a2f7e57f15f5caf643e"],"state_sha256":"6180d403b77c82af6e857050171dd4381633c6c0596d36bde3a38c9443767e03"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"SZzBdkvpCIm/4czDuixMOQWfO0pHIOdYGYpomEYi2OjhFaBGay7rrnl4l+1jakbcFc2rfDsLkjSUO/NfXy59BQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-30T16:30:34.433927Z","bundle_sha256":"e36a799b7534656a79a1b1cc240f666ce0553c11c8ce0741d9bdf0105b39e6d0"}}