{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2010:MH47563BAZRX46GR2Y3IBSFJZB","short_pith_number":"pith:MH47563B","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"},"canonical_sha256":"61f9fefb6106637e78d1d63680c8a9c860927f9f4612cff139ef0be48bd6ff21","source":{"kind":"arxiv","id":"1010.5608","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1010.5608","created_at":"2026-05-17T23:41:13Z"},{"alias_kind":"arxiv_version","alias_value":"1010.5608v2","created_at":"2026-05-17T23:41:13Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1010.5608","created_at":"2026-05-17T23:41:13Z"},{"alias_kind":"pith_short_12","alias_value":"MH47563BAZRX","created_at":"2026-05-18T12:26:10Z"},{"alias_kind":"pith_short_16","alias_value":"MH47563BAZRX46GR","created_at":"2026-05-18T12:26:10Z"},{"alias_kind":"pith_short_8","alias_value":"MH47563B","created_at":"2026-05-18T12:26:10Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2010:MH47563BAZRX46GR2Y3IBSFJZB","target":"record","payload":{"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"},"canonical_sha256":"61f9fefb6106637e78d1d63680c8a9c860927f9f4612cff139ef0be48bd6ff21","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"},"source_kind":"arxiv","source_id":"1010.5608","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-17T23:41:13Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"CY0lmrGG4RZRKBhgKRB9uEoOtdZwra6dXM8fAw42p4U2GngA/J8g/KJrkTd6SDYsL5jPHnAlTuQDX3k9XfDtCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T15:19:25.281354Z"},"content_sha256":"ab906c99f07341db1cc254b3ec78322a6ed401c1b36a0c3f3a35171cfcc28593","schema_version":"1.0","event_id":"sha256:ab906c99f07341db1cc254b3ec78322a6ed401c1b36a0c3f3a35171cfcc28593"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2010:MH47563BAZRX46GR2Y3IBSFJZB","target":"graph","payload":{"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"},"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:41:13Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"8nyrIjYNu3EAoF1MtAYS3HyEz3RkTfUFpw7fYkqHGj+saDKQK1/IIygpoTGo4SKhFL6U6yns4sP6q0Epp/wSAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T15:19:25.281779Z"},"content_sha256":"3e68f4b91fa0f913a372c35dd7af8c5cd46bac1a41b3517f1d171d2dcac063f4","schema_version":"1.0","event_id":"sha256:3e68f4b91fa0f913a372c35dd7af8c5cd46bac1a41b3517f1d171d2dcac063f4"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/MH47563BAZRX46GR2Y3IBSFJZB/bundle.json","state_url":"https://pith.science/pith/MH47563BAZRX46GR2Y3IBSFJZB/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/MH47563BAZRX46GR2Y3IBSFJZB/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-05T15:19:25Z","links":{"resolver":"https://pith.science/pith/MH47563BAZRX46GR2Y3IBSFJZB","bundle":"https://pith.science/pith/MH47563BAZRX46GR2Y3IBSFJZB/bundle.json","state":"https://pith.science/pith/MH47563BAZRX46GR2Y3IBSFJZB/state.json","well_known_bundle":"https://pith.science/.well-known/pith/MH47563BAZRX46GR2Y3IBSFJZB/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2010:MH47563BAZRX46GR2Y3IBSFJZB","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":"6d7c73dbb954cc5d17a892e08903aa48821348392920957f801d557e1820cf16","cross_cats_sorted":["cs.DM","cs.PF","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2010-10-27T08:56:31Z","title_canon_sha256":"75829c591b61ba28e904a5d812096801f082f41810855a26969801bae74c16a5"},"schema_version":"1.0","source":{"id":"1010.5608","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1010.5608","created_at":"2026-05-17T23:41:13Z"},{"alias_kind":"arxiv_version","alias_value":"1010.5608v2","created_at":"2026-05-17T23:41:13Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1010.5608","created_at":"2026-05-17T23:41:13Z"},{"alias_kind":"pith_short_12","alias_value":"MH47563BAZRX","created_at":"2026-05-18T12:26:10Z"},{"alias_kind":"pith_short_16","alias_value":"MH47563BAZRX46GR","created_at":"2026-05-18T12:26:10Z"},{"alias_kind":"pith_short_8","alias_value":"MH47563B","created_at":"2026-05-18T12:26:10Z"}],"graph_snapshots":[{"event_id":"sha256:3e68f4b91fa0f913a372c35dd7af8c5cd46bac1a41b3517f1d171d2dcac063f4","target":"graph","created_at":"2026-05-17T23:41:13Z","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":"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.","authors_text":"Ao Kevin Tang, Weiyu Xu","cross_cats":["cs.DM","cs.PF","math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2010-10-27T08:56:31Z","title":"A Generalized Coupon Collector Problem"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1010.5608","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:ab906c99f07341db1cc254b3ec78322a6ed401c1b36a0c3f3a35171cfcc28593","target":"record","created_at":"2026-05-17T23:41:13Z","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":"6d7c73dbb954cc5d17a892e08903aa48821348392920957f801d557e1820cf16","cross_cats_sorted":["cs.DM","cs.PF","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2010-10-27T08:56:31Z","title_canon_sha256":"75829c591b61ba28e904a5d812096801f082f41810855a26969801bae74c16a5"},"schema_version":"1.0","source":{"id":"1010.5608","kind":"arxiv","version":2}},"canonical_sha256":"61f9fefb6106637e78d1d63680c8a9c860927f9f4612cff139ef0be48bd6ff21","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"61f9fefb6106637e78d1d63680c8a9c860927f9f4612cff139ef0be48bd6ff21","first_computed_at":"2026-05-17T23:41:13.860375Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:41:13.860375Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"NhKmhxzTEoe3xDM5urLB6pQKQxdeQas44q20uEjpj7/DGMA5eV4SQRmCSm1N/s39AwU/ugwlu6o+SDKPDP05Dg==","signature_status":"signed_v1","signed_at":"2026-05-17T23:41:13.860911Z","signed_message":"canonical_sha256_bytes"},"source_id":"1010.5608","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:ab906c99f07341db1cc254b3ec78322a6ed401c1b36a0c3f3a35171cfcc28593","sha256:3e68f4b91fa0f913a372c35dd7af8c5cd46bac1a41b3517f1d171d2dcac063f4"],"state_sha256":"be2441d0dc1d56457845e6d90ec4c5ce85bbbedadc6ae3284690975e122983cc"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"GvKciZ8G1INSLHr04mmXiGaGRt9Y7iHJzRt46ngpS1J9r8Fznfr8bUT9P+m+3Hd5osIN4orIBWEw11MOcyjKDQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-05T15:19:25.283848Z","bundle_sha256":"3a8579c32fde2480ce14e97f209270dce013c785694e14ab0d5c05576f8a8459"}}