{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2010:MH47563BAZRX46GR2Y3IBSFJZB","short_pith_number":"pith:MH47563B","schema_version":"1.0","canonical_sha256":"61f9fefb6106637e78d1d63680c8a9c860927f9f4612cff139ef0be48bd6ff21","source":{"kind":"arxiv","id":"1010.5608","version":2},"attestation_state":"computed","paper":{"title":"A Generalized Coupon Collector Problem","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM","cs.PF","math.IT"],"primary_cat":"cs.IT","authors_text":"Ao Kevin Tang, Weiyu Xu","submitted_at":"2010-10-27T08:56:31Z","abstract_excerpt":"This paper provides analysis to a generalized version of the coupon collector problem, in which the collector gets $d$ distinct coupons each run and she chooses the one that she has the least so far. On the asymptotic case when the number of coupons $n$ goes to infinity, we show that on average $\\frac{n\\log n}{d} + \\frac{n}{d}(m-1)\\log\\log{n}+O(mn)$ runs are needed to collect $m$ sets of coupons. An efficient exact algorithm is also developed for any finite case to compute the average needed runs exactly. Numerical examples are provided to verify our theoretical predictions."},"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":"1010.5608","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2010-10-27T08:56:31Z","cross_cats_sorted":["cs.DM","cs.PF","math.IT"],"title_canon_sha256":"75829c591b61ba28e904a5d812096801f082f41810855a26969801bae74c16a5","abstract_canon_sha256":"6d7c73dbb954cc5d17a892e08903aa48821348392920957f801d557e1820cf16"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:41:13.860911Z","signature_b64":"NhKmhxzTEoe3xDM5urLB6pQKQxdeQas44q20uEjpj7/DGMA5eV4SQRmCSm1N/s39AwU/ugwlu6o+SDKPDP05Dg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"61f9fefb6106637e78d1d63680c8a9c860927f9f4612cff139ef0be48bd6ff21","last_reissued_at":"2026-05-17T23:41:13.860375Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:41:13.860375Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A Generalized Coupon Collector Problem","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM","cs.PF","math.IT"],"primary_cat":"cs.IT","authors_text":"Ao Kevin Tang, Weiyu Xu","submitted_at":"2010-10-27T08:56:31Z","abstract_excerpt":"This paper provides analysis to a generalized version of the coupon collector problem, in which the collector gets $d$ distinct coupons each run and she chooses the one that she has the least so far. On the asymptotic case when the number of coupons $n$ goes to infinity, we show that on average $\\frac{n\\log n}{d} + \\frac{n}{d}(m-1)\\log\\log{n}+O(mn)$ runs are needed to collect $m$ sets of coupons. An efficient exact algorithm is also developed for any finite case to compute the average needed runs exactly. Numerical examples are provided to verify our theoretical predictions."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1010.5608","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":"1010.5608","created_at":"2026-05-17T23:41:13.860459+00:00"},{"alias_kind":"arxiv_version","alias_value":"1010.5608v2","created_at":"2026-05-17T23:41:13.860459+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1010.5608","created_at":"2026-05-17T23:41:13.860459+00:00"},{"alias_kind":"pith_short_12","alias_value":"MH47563BAZRX","created_at":"2026-05-18T12:26:10.704358+00:00"},{"alias_kind":"pith_short_16","alias_value":"MH47563BAZRX46GR","created_at":"2026-05-18T12:26:10.704358+00:00"},{"alias_kind":"pith_short_8","alias_value":"MH47563B","created_at":"2026-05-18T12:26:10.704358+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/MH47563BAZRX46GR2Y3IBSFJZB","json":"https://pith.science/pith/MH47563BAZRX46GR2Y3IBSFJZB.json","graph_json":"https://pith.science/api/pith-number/MH47563BAZRX46GR2Y3IBSFJZB/graph.json","events_json":"https://pith.science/api/pith-number/MH47563BAZRX46GR2Y3IBSFJZB/events.json","paper":"https://pith.science/paper/MH47563B"},"agent_actions":{"view_html":"https://pith.science/pith/MH47563BAZRX46GR2Y3IBSFJZB","download_json":"https://pith.science/pith/MH47563BAZRX46GR2Y3IBSFJZB.json","view_paper":"https://pith.science/paper/MH47563B","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1010.5608&json=true","fetch_graph":"https://pith.science/api/pith-number/MH47563BAZRX46GR2Y3IBSFJZB/graph.json","fetch_events":"https://pith.science/api/pith-number/MH47563BAZRX46GR2Y3IBSFJZB/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/MH47563BAZRX46GR2Y3IBSFJZB/action/timestamp_anchor","attest_storage":"https://pith.science/pith/MH47563BAZRX46GR2Y3IBSFJZB/action/storage_attestation","attest_author":"https://pith.science/pith/MH47563BAZRX46GR2Y3IBSFJZB/action/author_attestation","sign_citation":"https://pith.science/pith/MH47563BAZRX46GR2Y3IBSFJZB/action/citation_signature","submit_replication":"https://pith.science/pith/MH47563BAZRX46GR2Y3IBSFJZB/action/replication_record"}},"created_at":"2026-05-17T23:41:13.860459+00:00","updated_at":"2026-05-17T23:41:13.860459+00:00"}