{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:YZL7H6I6HBBZHTUJ7CGLZYTYLU","short_pith_number":"pith:YZL7H6I6","canonical_record":{"source":{"id":"1905.08933","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2019-05-22T03:07:51Z","cross_cats_sorted":["math.PR"],"title_canon_sha256":"58a4d087644fca402c656116e4af34a9420852c0d740a29efba790204d8f7682","abstract_canon_sha256":"26a61cd78bf08dd4a045769107ff6b2b8028c8f0745544808ddaf64bf1c8c4d8"},"schema_version":"1.0"},"canonical_sha256":"c657f3f91e384393ce89f88cbce2785d08cfc802edf3694e47e7ac39f248d15e","source":{"kind":"arxiv","id":"1905.08933","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1905.08933","created_at":"2026-05-17T23:45:24Z"},{"alias_kind":"arxiv_version","alias_value":"1905.08933v1","created_at":"2026-05-17T23:45:24Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1905.08933","created_at":"2026-05-17T23:45:24Z"},{"alias_kind":"pith_short_12","alias_value":"YZL7H6I6HBBZ","created_at":"2026-05-18T12:33:33Z"},{"alias_kind":"pith_short_16","alias_value":"YZL7H6I6HBBZHTUJ","created_at":"2026-05-18T12:33:33Z"},{"alias_kind":"pith_short_8","alias_value":"YZL7H6I6","created_at":"2026-05-18T12:33:33Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:YZL7H6I6HBBZHTUJ7CGLZYTYLU","target":"record","payload":{"canonical_record":{"source":{"id":"1905.08933","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2019-05-22T03:07:51Z","cross_cats_sorted":["math.PR"],"title_canon_sha256":"58a4d087644fca402c656116e4af34a9420852c0d740a29efba790204d8f7682","abstract_canon_sha256":"26a61cd78bf08dd4a045769107ff6b2b8028c8f0745544808ddaf64bf1c8c4d8"},"schema_version":"1.0"},"canonical_sha256":"c657f3f91e384393ce89f88cbce2785d08cfc802edf3694e47e7ac39f248d15e","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:45:24.822720Z","signature_b64":"0moV8AMPk5KVPkk+yGUzf0WVQRJKfn2qeT+xjLuDU3ztawv8UYBXTa1IEJtZQofTXtMv/8x/xJsde1qZQBVhDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c657f3f91e384393ce89f88cbce2785d08cfc802edf3694e47e7ac39f248d15e","last_reissued_at":"2026-05-17T23:45:24.822307Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:45:24.822307Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1905.08933","source_version":1,"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-17T23:45:24Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"W04dgjU+1ieY+npOsoRPPEzsPGbxBbqdB86grNMskEVuSQ/xfiHddzzamEl0VbpNbiT8Qw00506ixIJuE8TvCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-29T17:31:28.499100Z"},"content_sha256":"5c3f4818ed7a9f5af84637bf8051443623e3b2aec1c3bcce1b440f6d248bbc71","schema_version":"1.0","event_id":"sha256:5c3f4818ed7a9f5af84637bf8051443623e3b2aec1c3bcce1b440f6d248bbc71"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:YZL7H6I6HBBZHTUJ7CGLZYTYLU","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A Short Note on the Average Maximal Number of Balls in a Bin","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.PR"],"primary_cat":"math.CO","authors_text":"Marcus Michelen","submitted_at":"2019-05-22T03:07:51Z","abstract_excerpt":"We analyze the asymptotic behavior of the average maximal number of balls in a bin obtained by throwing uniformly at random $r$ balls without replacement into $n$ bins, $T$ times. Writing the expected maximum as $\\frac{r}{n}T+ C_{n,r}\\sqrt{T} + o(\\sqrt{T})$, a recent preprint of Behrouzi-Far and Zeilberger asks for an explicit expression for $C_{n,r}$ in terms of $n,r$ and $\\pi$. In this short note, we find an expression for $C_{n,r}$ in terms of $n, r$ and the expected maximum of $n$ independent standard Gaussians. This provides asymptotics for large $n$ as well as closed forms for small $n$-"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1905.08933","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"},"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-17T23:45:24Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"SjgPx3mv9qZDy6nyo2q/Ak6ztcEV14yuA4yZrPaJEN2FIX475U5nlQ8XZ+2WPMLQN6WQX5dpw0vdq4y99rSpBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-29T17:31:28.499466Z"},"content_sha256":"7257acf7227b9ac29bcc8dcec1fef1cb414e845efa4c3eb35b69282c8e35c708","schema_version":"1.0","event_id":"sha256:7257acf7227b9ac29bcc8dcec1fef1cb414e845efa4c3eb35b69282c8e35c708"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/YZL7H6I6HBBZHTUJ7CGLZYTYLU/bundle.json","state_url":"https://pith.science/pith/YZL7H6I6HBBZHTUJ7CGLZYTYLU/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/YZL7H6I6HBBZHTUJ7CGLZYTYLU/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-06-29T17:31:28Z","links":{"resolver":"https://pith.science/pith/YZL7H6I6HBBZHTUJ7CGLZYTYLU","bundle":"https://pith.science/pith/YZL7H6I6HBBZHTUJ7CGLZYTYLU/bundle.json","state":"https://pith.science/pith/YZL7H6I6HBBZHTUJ7CGLZYTYLU/state.json","well_known_bundle":"https://pith.science/.well-known/pith/YZL7H6I6HBBZHTUJ7CGLZYTYLU/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:YZL7H6I6HBBZHTUJ7CGLZYTYLU","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":"26a61cd78bf08dd4a045769107ff6b2b8028c8f0745544808ddaf64bf1c8c4d8","cross_cats_sorted":["math.PR"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2019-05-22T03:07:51Z","title_canon_sha256":"58a4d087644fca402c656116e4af34a9420852c0d740a29efba790204d8f7682"},"schema_version":"1.0","source":{"id":"1905.08933","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1905.08933","created_at":"2026-05-17T23:45:24Z"},{"alias_kind":"arxiv_version","alias_value":"1905.08933v1","created_at":"2026-05-17T23:45:24Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1905.08933","created_at":"2026-05-17T23:45:24Z"},{"alias_kind":"pith_short_12","alias_value":"YZL7H6I6HBBZ","created_at":"2026-05-18T12:33:33Z"},{"alias_kind":"pith_short_16","alias_value":"YZL7H6I6HBBZHTUJ","created_at":"2026-05-18T12:33:33Z"},{"alias_kind":"pith_short_8","alias_value":"YZL7H6I6","created_at":"2026-05-18T12:33:33Z"}],"graph_snapshots":[{"event_id":"sha256:7257acf7227b9ac29bcc8dcec1fef1cb414e845efa4c3eb35b69282c8e35c708","target":"graph","created_at":"2026-05-17T23:45:24Z","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":"We analyze the asymptotic behavior of the average maximal number of balls in a bin obtained by throwing uniformly at random $r$ balls without replacement into $n$ bins, $T$ times. Writing the expected maximum as $\\frac{r}{n}T+ C_{n,r}\\sqrt{T} + o(\\sqrt{T})$, a recent preprint of Behrouzi-Far and Zeilberger asks for an explicit expression for $C_{n,r}$ in terms of $n,r$ and $\\pi$. In this short note, we find an expression for $C_{n,r}$ in terms of $n, r$ and the expected maximum of $n$ independent standard Gaussians. This provides asymptotics for large $n$ as well as closed forms for small $n$-","authors_text":"Marcus Michelen","cross_cats":["math.PR"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2019-05-22T03:07:51Z","title":"A Short Note on the Average Maximal Number of Balls in a Bin"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1905.08933","kind":"arxiv","version":1},"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:5c3f4818ed7a9f5af84637bf8051443623e3b2aec1c3bcce1b440f6d248bbc71","target":"record","created_at":"2026-05-17T23:45:24Z","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":"26a61cd78bf08dd4a045769107ff6b2b8028c8f0745544808ddaf64bf1c8c4d8","cross_cats_sorted":["math.PR"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2019-05-22T03:07:51Z","title_canon_sha256":"58a4d087644fca402c656116e4af34a9420852c0d740a29efba790204d8f7682"},"schema_version":"1.0","source":{"id":"1905.08933","kind":"arxiv","version":1}},"canonical_sha256":"c657f3f91e384393ce89f88cbce2785d08cfc802edf3694e47e7ac39f248d15e","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"c657f3f91e384393ce89f88cbce2785d08cfc802edf3694e47e7ac39f248d15e","first_computed_at":"2026-05-17T23:45:24.822307Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:45:24.822307Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"0moV8AMPk5KVPkk+yGUzf0WVQRJKfn2qeT+xjLuDU3ztawv8UYBXTa1IEJtZQofTXtMv/8x/xJsde1qZQBVhDQ==","signature_status":"signed_v1","signed_at":"2026-05-17T23:45:24.822720Z","signed_message":"canonical_sha256_bytes"},"source_id":"1905.08933","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:5c3f4818ed7a9f5af84637bf8051443623e3b2aec1c3bcce1b440f6d248bbc71","sha256:7257acf7227b9ac29bcc8dcec1fef1cb414e845efa4c3eb35b69282c8e35c708"],"state_sha256":"b1bf1f944ca7b74520caca3334037691c5fa469e82bbecaae7d29f6be9e90d1e"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ygiQZlhU+RCe8il3y1ote3akzl9n5Kjmuettz4H+J4mCWpK0VESsYhUvNZSKh86YcfGZsk9N2UwP6vVWhDInDg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-29T17:31:28.501341Z","bundle_sha256":"575d5654c684f0797349237aa7cab32c62fc6ffa66e1c552de0fd93150c622da"}}