{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:7B2TWBB2NP44VIRDTI7WE2KM2D","short_pith_number":"pith:7B2TWBB2","canonical_record":{"source":{"id":"1412.3626","kind":"arxiv","version":5},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2014-12-11T12:20:09Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"c8a603311f251413925a949c7af8fefdfdded8cbe2089d608ed88a132d563544","abstract_canon_sha256":"fcc5dd756504f7692a002459e52a018d36339b3bbcf60799498d8ba3844a4a48"},"schema_version":"1.0"},"canonical_sha256":"f8753b043a6bf9caa2239a3f62694cd0d0c9cffe684a30d9a8ec8ee6bcc45863","source":{"kind":"arxiv","id":"1412.3626","version":5},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1412.3626","created_at":"2026-05-18T01:27:46Z"},{"alias_kind":"arxiv_version","alias_value":"1412.3626v5","created_at":"2026-05-18T01:27:46Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1412.3626","created_at":"2026-05-18T01:27:46Z"},{"alias_kind":"pith_short_12","alias_value":"7B2TWBB2NP44","created_at":"2026-05-18T12:28:16Z"},{"alias_kind":"pith_short_16","alias_value":"7B2TWBB2NP44VIRD","created_at":"2026-05-18T12:28:16Z"},{"alias_kind":"pith_short_8","alias_value":"7B2TWBB2","created_at":"2026-05-18T12:28:16Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:7B2TWBB2NP44VIRDTI7WE2KM2D","target":"record","payload":{"canonical_record":{"source":{"id":"1412.3626","kind":"arxiv","version":5},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2014-12-11T12:20:09Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"c8a603311f251413925a949c7af8fefdfdded8cbe2089d608ed88a132d563544","abstract_canon_sha256":"fcc5dd756504f7692a002459e52a018d36339b3bbcf60799498d8ba3844a4a48"},"schema_version":"1.0"},"canonical_sha256":"f8753b043a6bf9caa2239a3f62694cd0d0c9cffe684a30d9a8ec8ee6bcc45863","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:27:46.449160Z","signature_b64":"xV8pTxwkyt6ssZ7/O4sIkJPlb8yBrDoxL9LVH1hivzPS8ix3Vh2NBf6KAi14l5ZbUrpaCG0iHzE9jBh9OdW+Bg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f8753b043a6bf9caa2239a3f62694cd0d0c9cffe684a30d9a8ec8ee6bcc45863","last_reissued_at":"2026-05-18T01:27:46.448393Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:27:46.448393Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1412.3626","source_version":5,"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-18T01:27:46Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"78JAR/3eGLOrYD+XlUUb2xjFcstOkPSxQLtFCy+XoBH6Gbfa7VV/vTEhLchDi05gbm0y/bevRuUGCZUhEK8TBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T10:01:05.171908Z"},"content_sha256":"ad5fa4f08064cb85ce5f9cb8b9228df859c6ed6c4286f3d4bd33bf3a87c1b5ff","schema_version":"1.0","event_id":"sha256:ad5fa4f08064cb85ce5f9cb8b9228df859c6ed6c4286f3d4bd33bf3a87c1b5ff"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:7B2TWBB2NP44VIRDTI7WE2KM2D","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"The Coupon Collector's Problem Revisited: Generalizing the Double Dixie Cup Problem of Newman and Shepp","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"math.PR","authors_text":"Aristides V. Doumas, Vassilis G. Papanicolaou","submitted_at":"2014-12-11T12:20:09Z","abstract_excerpt":"The \"double Dixie cup problem\" of D.J. Newman and L. Shepp (1960) is a well-known variant of the coupon collector's problem, where the object of study is the number $T_{m}(N)$ of coupons that a collector has to buy in order to complete $m$ sets of all $N$ existing different coupons. More precisely, the problem is to determine the asymptotics of the expectation (and the variance) of $T_{m}(N)$, as well as its limit distribution, as the number $N$ of different coupons becomes arbitrarily large. The classical case of the problem, namely the case of equal coupon probabilities, is here extended to "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1412.3626","kind":"arxiv","version":5},"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-18T01:27:46Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"3+wrwEGrsJkfhlAd0NN+hSzq+OmFvJJmrjh27m6LDTN41zswjpS901a9/ayFVoD1zDpXorwodhSEeTF3r+HoBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T10:01:05.172408Z"},"content_sha256":"2ffbf2d951ce74a66b666fd40de25eed3bfcfe0906409df7378183ab9ce674a4","schema_version":"1.0","event_id":"sha256:2ffbf2d951ce74a66b666fd40de25eed3bfcfe0906409df7378183ab9ce674a4"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/7B2TWBB2NP44VIRDTI7WE2KM2D/bundle.json","state_url":"https://pith.science/pith/7B2TWBB2NP44VIRDTI7WE2KM2D/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/7B2TWBB2NP44VIRDTI7WE2KM2D/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-05-31T10:01:05Z","links":{"resolver":"https://pith.science/pith/7B2TWBB2NP44VIRDTI7WE2KM2D","bundle":"https://pith.science/pith/7B2TWBB2NP44VIRDTI7WE2KM2D/bundle.json","state":"https://pith.science/pith/7B2TWBB2NP44VIRDTI7WE2KM2D/state.json","well_known_bundle":"https://pith.science/.well-known/pith/7B2TWBB2NP44VIRDTI7WE2KM2D/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:7B2TWBB2NP44VIRDTI7WE2KM2D","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":"fcc5dd756504f7692a002459e52a018d36339b3bbcf60799498d8ba3844a4a48","cross_cats_sorted":["math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2014-12-11T12:20:09Z","title_canon_sha256":"c8a603311f251413925a949c7af8fefdfdded8cbe2089d608ed88a132d563544"},"schema_version":"1.0","source":{"id":"1412.3626","kind":"arxiv","version":5}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1412.3626","created_at":"2026-05-18T01:27:46Z"},{"alias_kind":"arxiv_version","alias_value":"1412.3626v5","created_at":"2026-05-18T01:27:46Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1412.3626","created_at":"2026-05-18T01:27:46Z"},{"alias_kind":"pith_short_12","alias_value":"7B2TWBB2NP44","created_at":"2026-05-18T12:28:16Z"},{"alias_kind":"pith_short_16","alias_value":"7B2TWBB2NP44VIRD","created_at":"2026-05-18T12:28:16Z"},{"alias_kind":"pith_short_8","alias_value":"7B2TWBB2","created_at":"2026-05-18T12:28:16Z"}],"graph_snapshots":[{"event_id":"sha256:2ffbf2d951ce74a66b666fd40de25eed3bfcfe0906409df7378183ab9ce674a4","target":"graph","created_at":"2026-05-18T01:27:46Z","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":"The \"double Dixie cup problem\" of D.J. Newman and L. Shepp (1960) is a well-known variant of the coupon collector's problem, where the object of study is the number $T_{m}(N)$ of coupons that a collector has to buy in order to complete $m$ sets of all $N$ existing different coupons. More precisely, the problem is to determine the asymptotics of the expectation (and the variance) of $T_{m}(N)$, as well as its limit distribution, as the number $N$ of different coupons becomes arbitrarily large. The classical case of the problem, namely the case of equal coupon probabilities, is here extended to ","authors_text":"Aristides V. Doumas, Vassilis G. Papanicolaou","cross_cats":["math.CO"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2014-12-11T12:20:09Z","title":"The Coupon Collector's Problem Revisited: Generalizing the Double Dixie Cup Problem of Newman and Shepp"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1412.3626","kind":"arxiv","version":5},"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:ad5fa4f08064cb85ce5f9cb8b9228df859c6ed6c4286f3d4bd33bf3a87c1b5ff","target":"record","created_at":"2026-05-18T01:27:46Z","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":"fcc5dd756504f7692a002459e52a018d36339b3bbcf60799498d8ba3844a4a48","cross_cats_sorted":["math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2014-12-11T12:20:09Z","title_canon_sha256":"c8a603311f251413925a949c7af8fefdfdded8cbe2089d608ed88a132d563544"},"schema_version":"1.0","source":{"id":"1412.3626","kind":"arxiv","version":5}},"canonical_sha256":"f8753b043a6bf9caa2239a3f62694cd0d0c9cffe684a30d9a8ec8ee6bcc45863","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"f8753b043a6bf9caa2239a3f62694cd0d0c9cffe684a30d9a8ec8ee6bcc45863","first_computed_at":"2026-05-18T01:27:46.448393Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:27:46.448393Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"xV8pTxwkyt6ssZ7/O4sIkJPlb8yBrDoxL9LVH1hivzPS8ix3Vh2NBf6KAi14l5ZbUrpaCG0iHzE9jBh9OdW+Bg==","signature_status":"signed_v1","signed_at":"2026-05-18T01:27:46.449160Z","signed_message":"canonical_sha256_bytes"},"source_id":"1412.3626","source_kind":"arxiv","source_version":5}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:ad5fa4f08064cb85ce5f9cb8b9228df859c6ed6c4286f3d4bd33bf3a87c1b5ff","sha256:2ffbf2d951ce74a66b666fd40de25eed3bfcfe0906409df7378183ab9ce674a4"],"state_sha256":"568111c52541e0db52043de18b5ee6a750a8e741b43bf7f1495c6795b2fcd888"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"2WuQDn2p5DINWo3xDNCxw6njOShRh7GfLk6l9C7mdV6SB2h1xGSpjV75mx7Vq2N6+n7ITpsyh4lqPT4U5aNNAA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-31T10:01:05.176020Z","bundle_sha256":"65b047c81e776c249f5cdce23e6204367dad62055e69a69e9c8423b741db41f0"}}