{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:AE4F3FGCDVRP6IOUABEXE5RRVR","short_pith_number":"pith:AE4F3FGC","schema_version":"1.0","canonical_sha256":"01385d94c21d62ff21d40049727631ac7df408f2747f5c7024ac9762312e909b","source":{"kind":"arxiv","id":"1905.07827","version":2},"attestation_state":"computed","paper":{"title":"On the Average Maximal Number of Balls in a Bin Resulting from Throwing r Balls into n Bins T times","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Amir Behrouzi-Far, Doron Zeilberger","submitted_at":"2019-05-19T23:24:19Z","abstract_excerpt":"We use the holonomic ansatz to estimate the asymptotic behavior, in $T$, of the average maximal number of balls in a bin that is obtained when one throws uniformly at random (without replacement) $r$ balls into $n$ bins, $T$ times. Our approach works, in principle, for any fixed $n$ and $r$. We were able to do the cases $(n,r)$ = $(2,1),(3,1),(4,1), (4,2)$, but things get too complicated for larger values of $n$ and $r$. We are pledging a \\$150 donation to the OEIS for an explicit expression, (in terms of $n$, $r$, and $\\pi$) for the constant $C_{n,r}$ such that that average equals $\\frac{n}{r"},"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":"1905.07827","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2019-05-19T23:24:19Z","cross_cats_sorted":[],"title_canon_sha256":"9f5385795f2d18b6e37b01f582c6ce96ed8d22e4509a27d6dcb41b2efbd12a2a","abstract_canon_sha256":"b2c2b295af5b7f70e22797d27845bdfefa4e0f33cc331c502cc6765840dd57a8"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:45:19.770117Z","signature_b64":"uQHQ7r+v18bAEnxSHa4dU+dMuMbt6Br9f8h7YbBNHLzfjQdt+yEQsahwvhK6R3klhR8q6cOEeUu/fqELthcLAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"01385d94c21d62ff21d40049727631ac7df408f2747f5c7024ac9762312e909b","last_reissued_at":"2026-05-17T23:45:19.769475Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:45:19.769475Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On the Average Maximal Number of Balls in a Bin Resulting from Throwing r Balls into n Bins T times","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Amir Behrouzi-Far, Doron Zeilberger","submitted_at":"2019-05-19T23:24:19Z","abstract_excerpt":"We use the holonomic ansatz to estimate the asymptotic behavior, in $T$, of the average maximal number of balls in a bin that is obtained when one throws uniformly at random (without replacement) $r$ balls into $n$ bins, $T$ times. Our approach works, in principle, for any fixed $n$ and $r$. We were able to do the cases $(n,r)$ = $(2,1),(3,1),(4,1), (4,2)$, but things get too complicated for larger values of $n$ and $r$. We are pledging a \\$150 donation to the OEIS for an explicit expression, (in terms of $n$, $r$, and $\\pi$) for the constant $C_{n,r}$ such that that average equals $\\frac{n}{r"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1905.07827","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":"1905.07827","created_at":"2026-05-17T23:45:19.769569+00:00"},{"alias_kind":"arxiv_version","alias_value":"1905.07827v2","created_at":"2026-05-17T23:45:19.769569+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1905.07827","created_at":"2026-05-17T23:45:19.769569+00:00"},{"alias_kind":"pith_short_12","alias_value":"AE4F3FGCDVRP","created_at":"2026-05-18T12:33:12.712433+00:00"},{"alias_kind":"pith_short_16","alias_value":"AE4F3FGCDVRP6IOU","created_at":"2026-05-18T12:33:12.712433+00:00"},{"alias_kind":"pith_short_8","alias_value":"AE4F3FGC","created_at":"2026-05-18T12:33:12.712433+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"1908.02415","citing_title":"Redundancy Scheduling in Systems with Bi-Modal Job Service Time Distribution","ref_index":29,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/AE4F3FGCDVRP6IOUABEXE5RRVR","json":"https://pith.science/pith/AE4F3FGCDVRP6IOUABEXE5RRVR.json","graph_json":"https://pith.science/api/pith-number/AE4F3FGCDVRP6IOUABEXE5RRVR/graph.json","events_json":"https://pith.science/api/pith-number/AE4F3FGCDVRP6IOUABEXE5RRVR/events.json","paper":"https://pith.science/paper/AE4F3FGC"},"agent_actions":{"view_html":"https://pith.science/pith/AE4F3FGCDVRP6IOUABEXE5RRVR","download_json":"https://pith.science/pith/AE4F3FGCDVRP6IOUABEXE5RRVR.json","view_paper":"https://pith.science/paper/AE4F3FGC","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1905.07827&json=true","fetch_graph":"https://pith.science/api/pith-number/AE4F3FGCDVRP6IOUABEXE5RRVR/graph.json","fetch_events":"https://pith.science/api/pith-number/AE4F3FGCDVRP6IOUABEXE5RRVR/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/AE4F3FGCDVRP6IOUABEXE5RRVR/action/timestamp_anchor","attest_storage":"https://pith.science/pith/AE4F3FGCDVRP6IOUABEXE5RRVR/action/storage_attestation","attest_author":"https://pith.science/pith/AE4F3FGCDVRP6IOUABEXE5RRVR/action/author_attestation","sign_citation":"https://pith.science/pith/AE4F3FGCDVRP6IOUABEXE5RRVR/action/citation_signature","submit_replication":"https://pith.science/pith/AE4F3FGCDVRP6IOUABEXE5RRVR/action/replication_record"}},"created_at":"2026-05-17T23:45:19.769569+00:00","updated_at":"2026-05-17T23:45:19.769569+00:00"}