{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:VTUJ4DOU6FNZVDREUOE3XA7GAA","short_pith_number":"pith:VTUJ4DOU","schema_version":"1.0","canonical_sha256":"ace89e0dd4f15b9a8e24a389bb83e600172fae21d594f20d762246bd26579683","source":{"kind":"arxiv","id":"1504.03878","version":1},"attestation_state":"computed","paper":{"title":"Optimization results for a generalized coupon collector problem","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DC","cs.IT","math.IT","math.PR"],"primary_cat":"cs.DS","authors_text":"Bruno Sericola (INRIA - IRISA), Emmanuelle Anceaume (INRIA - SUPELEC, Ernst Schulte-Geers, INRIA - IRISA), IRISA), Yann Busnel (ENSAI","submitted_at":"2015-04-15T12:13:35Z","abstract_excerpt":"We study in this paper a generalized coupon collector problem, which consists in analyzing the time needed to collect a given number of distinct coupons that are drawn from a set of coupons with an arbitrary probability distribution. We suppose that a special coupon called the null coupon can be drawn but never belongs to any collection. In this context, we prove that the almost uniform distribution, for which all the non-null coupons have the same drawing probability, is the distribution which stochastically minimizes the time needed to collect a fixed number of distinct coupons. Moreover, we"},"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":"1504.03878","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-04-15T12:13:35Z","cross_cats_sorted":["cs.DC","cs.IT","math.IT","math.PR"],"title_canon_sha256":"a4cbaae804c3511ff52e9540d754870f2742692eb3541b0ae81de7298f0ea880","abstract_canon_sha256":"ba15bc738164eae4d0b9827ed7ceefd66d3e9ca70ddd076d02a29a3d1fc17bd4"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:18:41.821538Z","signature_b64":"gZSZD+fpvKkT6t5tlpJN+xN/SW0O9tceMAMYT7/JW+2X66IqIEbOOnBjbbwOcGnyDKxh5nr/XCf1pRpSeYo5DQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ace89e0dd4f15b9a8e24a389bb83e600172fae21d594f20d762246bd26579683","last_reissued_at":"2026-05-18T02:18:41.820969Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:18:41.820969Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Optimization results for a generalized coupon collector problem","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DC","cs.IT","math.IT","math.PR"],"primary_cat":"cs.DS","authors_text":"Bruno Sericola (INRIA - IRISA), Emmanuelle Anceaume (INRIA - SUPELEC, Ernst Schulte-Geers, INRIA - IRISA), IRISA), Yann Busnel (ENSAI","submitted_at":"2015-04-15T12:13:35Z","abstract_excerpt":"We study in this paper a generalized coupon collector problem, which consists in analyzing the time needed to collect a given number of distinct coupons that are drawn from a set of coupons with an arbitrary probability distribution. We suppose that a special coupon called the null coupon can be drawn but never belongs to any collection. In this context, we prove that the almost uniform distribution, for which all the non-null coupons have the same drawing probability, is the distribution which stochastically minimizes the time needed to collect a fixed number of distinct coupons. Moreover, we"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1504.03878","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":"1504.03878","created_at":"2026-05-18T02:18:41.821063+00:00"},{"alias_kind":"arxiv_version","alias_value":"1504.03878v1","created_at":"2026-05-18T02:18:41.821063+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1504.03878","created_at":"2026-05-18T02:18:41.821063+00:00"},{"alias_kind":"pith_short_12","alias_value":"VTUJ4DOU6FNZ","created_at":"2026-05-18T12:29:47.479230+00:00"},{"alias_kind":"pith_short_16","alias_value":"VTUJ4DOU6FNZVDRE","created_at":"2026-05-18T12:29:47.479230+00:00"},{"alias_kind":"pith_short_8","alias_value":"VTUJ4DOU","created_at":"2026-05-18T12:29:47.479230+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/VTUJ4DOU6FNZVDREUOE3XA7GAA","json":"https://pith.science/pith/VTUJ4DOU6FNZVDREUOE3XA7GAA.json","graph_json":"https://pith.science/api/pith-number/VTUJ4DOU6FNZVDREUOE3XA7GAA/graph.json","events_json":"https://pith.science/api/pith-number/VTUJ4DOU6FNZVDREUOE3XA7GAA/events.json","paper":"https://pith.science/paper/VTUJ4DOU"},"agent_actions":{"view_html":"https://pith.science/pith/VTUJ4DOU6FNZVDREUOE3XA7GAA","download_json":"https://pith.science/pith/VTUJ4DOU6FNZVDREUOE3XA7GAA.json","view_paper":"https://pith.science/paper/VTUJ4DOU","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1504.03878&json=true","fetch_graph":"https://pith.science/api/pith-number/VTUJ4DOU6FNZVDREUOE3XA7GAA/graph.json","fetch_events":"https://pith.science/api/pith-number/VTUJ4DOU6FNZVDREUOE3XA7GAA/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/VTUJ4DOU6FNZVDREUOE3XA7GAA/action/timestamp_anchor","attest_storage":"https://pith.science/pith/VTUJ4DOU6FNZVDREUOE3XA7GAA/action/storage_attestation","attest_author":"https://pith.science/pith/VTUJ4DOU6FNZVDREUOE3XA7GAA/action/author_attestation","sign_citation":"https://pith.science/pith/VTUJ4DOU6FNZVDREUOE3XA7GAA/action/citation_signature","submit_replication":"https://pith.science/pith/VTUJ4DOU6FNZVDREUOE3XA7GAA/action/replication_record"}},"created_at":"2026-05-18T02:18:41.821063+00:00","updated_at":"2026-05-18T02:18:41.821063+00:00"}