{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2010:2JZOHJFQ77JSXPF57ISBSCNMHS","short_pith_number":"pith:2JZOHJFQ","schema_version":"1.0","canonical_sha256":"d272e3a4b0ffd32bbcbdfa241909ac3c8369f7eff65220d7a276a204e5880b40","source":{"kind":"arxiv","id":"1005.2616","version":1},"attestation_state":"computed","paper":{"title":"Chains-into-Bins Processes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Colin Cooper, Petra Berenbrink, Tugkan Batu","submitted_at":"2010-05-14T19:47:37Z","abstract_excerpt":"The study of {\\em balls-into-bins processes} or {\\em occupancy problems} has a long history. These processes can be used to translate realistic problems into mathematical ones in a natural way.  In general, the goal of a balls-into-bins process is to allocate a set of independent objects (tasks, jobs, balls) to a set of resources (servers, bins, urns) and, thereby, to minimize the maximum load.  In this paper, we analyze the maximum load for the {\\em chains-into-bins} problem, which is defined as follows. There are  $n$ bins, and $m$ objects to be allocated. Each object consists of balls conne"},"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":"1005.2616","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2010-05-14T19:47:37Z","cross_cats_sorted":[],"title_canon_sha256":"1d9d0c9fc98039a52a62fd27c58e92a8c2b7ee7eb21c1f9e8e2de214cb8bec6c","abstract_canon_sha256":"9223bbc1c325f70156a64ef8d666d8ce1be1da794c01874df03b86b86e437f88"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:07:24.588010Z","signature_b64":"qjcystr7rjRLZskJUyIAOGgNisAvDb2Y+m/ztjvAJMz9r7Lm9fZf/H820ARqZwz5EBYcVRg/baG+a3PYKblkDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d272e3a4b0ffd32bbcbdfa241909ac3c8369f7eff65220d7a276a204e5880b40","last_reissued_at":"2026-05-18T02:07:24.587600Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:07:24.587600Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Chains-into-Bins Processes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Colin Cooper, Petra Berenbrink, Tugkan Batu","submitted_at":"2010-05-14T19:47:37Z","abstract_excerpt":"The study of {\\em balls-into-bins processes} or {\\em occupancy problems} has a long history. These processes can be used to translate realistic problems into mathematical ones in a natural way.  In general, the goal of a balls-into-bins process is to allocate a set of independent objects (tasks, jobs, balls) to a set of resources (servers, bins, urns) and, thereby, to minimize the maximum load.  In this paper, we analyze the maximum load for the {\\em chains-into-bins} problem, which is defined as follows. There are  $n$ bins, and $m$ objects to be allocated. Each object consists of balls conne"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1005.2616","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":"1005.2616","created_at":"2026-05-18T02:07:24.587667+00:00"},{"alias_kind":"arxiv_version","alias_value":"1005.2616v1","created_at":"2026-05-18T02:07:24.587667+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1005.2616","created_at":"2026-05-18T02:07:24.587667+00:00"},{"alias_kind":"pith_short_12","alias_value":"2JZOHJFQ77JS","created_at":"2026-05-18T12:26:03.138858+00:00"},{"alias_kind":"pith_short_16","alias_value":"2JZOHJFQ77JSXPF5","created_at":"2026-05-18T12:26:03.138858+00:00"},{"alias_kind":"pith_short_8","alias_value":"2JZOHJFQ","created_at":"2026-05-18T12:26:03.138858+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/2JZOHJFQ77JSXPF57ISBSCNMHS","json":"https://pith.science/pith/2JZOHJFQ77JSXPF57ISBSCNMHS.json","graph_json":"https://pith.science/api/pith-number/2JZOHJFQ77JSXPF57ISBSCNMHS/graph.json","events_json":"https://pith.science/api/pith-number/2JZOHJFQ77JSXPF57ISBSCNMHS/events.json","paper":"https://pith.science/paper/2JZOHJFQ"},"agent_actions":{"view_html":"https://pith.science/pith/2JZOHJFQ77JSXPF57ISBSCNMHS","download_json":"https://pith.science/pith/2JZOHJFQ77JSXPF57ISBSCNMHS.json","view_paper":"https://pith.science/paper/2JZOHJFQ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1005.2616&json=true","fetch_graph":"https://pith.science/api/pith-number/2JZOHJFQ77JSXPF57ISBSCNMHS/graph.json","fetch_events":"https://pith.science/api/pith-number/2JZOHJFQ77JSXPF57ISBSCNMHS/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/2JZOHJFQ77JSXPF57ISBSCNMHS/action/timestamp_anchor","attest_storage":"https://pith.science/pith/2JZOHJFQ77JSXPF57ISBSCNMHS/action/storage_attestation","attest_author":"https://pith.science/pith/2JZOHJFQ77JSXPF57ISBSCNMHS/action/author_attestation","sign_citation":"https://pith.science/pith/2JZOHJFQ77JSXPF57ISBSCNMHS/action/citation_signature","submit_replication":"https://pith.science/pith/2JZOHJFQ77JSXPF57ISBSCNMHS/action/replication_record"}},"created_at":"2026-05-18T02:07:24.587667+00:00","updated_at":"2026-05-18T02:07:24.587667+00:00"}