{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:VTUJ4DOU6FNZVDREUOE3XA7GAA","short_pith_number":"pith:VTUJ4DOU","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"},"canonical_sha256":"ace89e0dd4f15b9a8e24a389bb83e600172fae21d594f20d762246bd26579683","source":{"kind":"arxiv","id":"1504.03878","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1504.03878","created_at":"2026-05-18T02:18:41Z"},{"alias_kind":"arxiv_version","alias_value":"1504.03878v1","created_at":"2026-05-18T02:18:41Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1504.03878","created_at":"2026-05-18T02:18:41Z"},{"alias_kind":"pith_short_12","alias_value":"VTUJ4DOU6FNZ","created_at":"2026-05-18T12:29:47Z"},{"alias_kind":"pith_short_16","alias_value":"VTUJ4DOU6FNZVDRE","created_at":"2026-05-18T12:29:47Z"},{"alias_kind":"pith_short_8","alias_value":"VTUJ4DOU","created_at":"2026-05-18T12:29:47Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:VTUJ4DOU6FNZVDREUOE3XA7GAA","target":"record","payload":{"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"},"canonical_sha256":"ace89e0dd4f15b9a8e24a389bb83e600172fae21d594f20d762246bd26579683","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"},"source_kind":"arxiv","source_id":"1504.03878","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-18T02:18:41Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Y/Y+lmitsXl+Q0fFecEX6X3tn/ig+7jnBzsy79gqBSYkS/w8J5XmHGB8/PxdNdJVn+CMtTqQmKsJMq9chXK7CA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-22T09:29:31.530791Z"},"content_sha256":"cdd82c428fb926a83025f925dfc765a6a7cf694d00072009eccd4ca120cd4f77","schema_version":"1.0","event_id":"sha256:cdd82c428fb926a83025f925dfc765a6a7cf694d00072009eccd4ca120cd4f77"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:VTUJ4DOU6FNZVDREUOE3XA7GAA","target":"graph","payload":{"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"},"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-18T02:18:41Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"p9wld2+2JZjwsan3BGcypLhc0hU0S/iLB0v21Slx7XrS05PQItyr04QXnBh4JTKKjn8zAtFRX9yG1F+Y5u3RCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-22T09:29:31.531144Z"},"content_sha256":"650403d2da55edb6db678ec3f399bb977e61a16eae160cb5db8a23ba1892242a","schema_version":"1.0","event_id":"sha256:650403d2da55edb6db678ec3f399bb977e61a16eae160cb5db8a23ba1892242a"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/VTUJ4DOU6FNZVDREUOE3XA7GAA/bundle.json","state_url":"https://pith.science/pith/VTUJ4DOU6FNZVDREUOE3XA7GAA/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/VTUJ4DOU6FNZVDREUOE3XA7GAA/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-22T09:29:31Z","links":{"resolver":"https://pith.science/pith/VTUJ4DOU6FNZVDREUOE3XA7GAA","bundle":"https://pith.science/pith/VTUJ4DOU6FNZVDREUOE3XA7GAA/bundle.json","state":"https://pith.science/pith/VTUJ4DOU6FNZVDREUOE3XA7GAA/state.json","well_known_bundle":"https://pith.science/.well-known/pith/VTUJ4DOU6FNZVDREUOE3XA7GAA/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:VTUJ4DOU6FNZVDREUOE3XA7GAA","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":"ba15bc738164eae4d0b9827ed7ceefd66d3e9ca70ddd076d02a29a3d1fc17bd4","cross_cats_sorted":["cs.DC","cs.IT","math.IT","math.PR"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-04-15T12:13:35Z","title_canon_sha256":"a4cbaae804c3511ff52e9540d754870f2742692eb3541b0ae81de7298f0ea880"},"schema_version":"1.0","source":{"id":"1504.03878","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1504.03878","created_at":"2026-05-18T02:18:41Z"},{"alias_kind":"arxiv_version","alias_value":"1504.03878v1","created_at":"2026-05-18T02:18:41Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1504.03878","created_at":"2026-05-18T02:18:41Z"},{"alias_kind":"pith_short_12","alias_value":"VTUJ4DOU6FNZ","created_at":"2026-05-18T12:29:47Z"},{"alias_kind":"pith_short_16","alias_value":"VTUJ4DOU6FNZVDRE","created_at":"2026-05-18T12:29:47Z"},{"alias_kind":"pith_short_8","alias_value":"VTUJ4DOU","created_at":"2026-05-18T12:29:47Z"}],"graph_snapshots":[{"event_id":"sha256:650403d2da55edb6db678ec3f399bb977e61a16eae160cb5db8a23ba1892242a","target":"graph","created_at":"2026-05-18T02:18:41Z","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 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","authors_text":"Bruno Sericola (INRIA - IRISA), Emmanuelle Anceaume (INRIA - SUPELEC, Ernst Schulte-Geers, INRIA - IRISA), IRISA), Yann Busnel (ENSAI","cross_cats":["cs.DC","cs.IT","math.IT","math.PR"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-04-15T12:13:35Z","title":"Optimization results for a generalized coupon collector problem"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1504.03878","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:cdd82c428fb926a83025f925dfc765a6a7cf694d00072009eccd4ca120cd4f77","target":"record","created_at":"2026-05-18T02:18:41Z","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":"ba15bc738164eae4d0b9827ed7ceefd66d3e9ca70ddd076d02a29a3d1fc17bd4","cross_cats_sorted":["cs.DC","cs.IT","math.IT","math.PR"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-04-15T12:13:35Z","title_canon_sha256":"a4cbaae804c3511ff52e9540d754870f2742692eb3541b0ae81de7298f0ea880"},"schema_version":"1.0","source":{"id":"1504.03878","kind":"arxiv","version":1}},"canonical_sha256":"ace89e0dd4f15b9a8e24a389bb83e600172fae21d594f20d762246bd26579683","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"ace89e0dd4f15b9a8e24a389bb83e600172fae21d594f20d762246bd26579683","first_computed_at":"2026-05-18T02:18:41.820969Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:18:41.820969Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"gZSZD+fpvKkT6t5tlpJN+xN/SW0O9tceMAMYT7/JW+2X66IqIEbOOnBjbbwOcGnyDKxh5nr/XCf1pRpSeYo5DQ==","signature_status":"signed_v1","signed_at":"2026-05-18T02:18:41.821538Z","signed_message":"canonical_sha256_bytes"},"source_id":"1504.03878","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:cdd82c428fb926a83025f925dfc765a6a7cf694d00072009eccd4ca120cd4f77","sha256:650403d2da55edb6db678ec3f399bb977e61a16eae160cb5db8a23ba1892242a"],"state_sha256":"25fa85e364244a75cffc4929d1eb73d31ccd3ebf6524361108f2190aeaaeaee3"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"daGEBF9djWGcYaOrUAhGrsNNctZhSdYtOunf690S/dr2kmF2aOWq/DCQYKg8NAvTXjrOlOS85w7hd+opfRqrCg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-22T09:29:31.533182Z","bundle_sha256":"deef05cb6527fb570ff23dec1c0a00b1e938e1d3421099d916a650702b2213f7"}}