{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2026:GXX6WLMXWEB7DXL5IVUREU2ZQX","short_pith_number":"pith:GXX6WLMX","canonical_record":{"source":{"id":"2605.14206","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2026-05-14T00:02:16Z","cross_cats_sorted":[],"title_canon_sha256":"aa0ed376d2d0aecc217a2b84907f63a87f5e71415b6c1b5cdd471a436401fcec","abstract_canon_sha256":"277d84b1e5e065cacc0b593c2691c0881fc4b0485f5277280c745ef7150f359c"},"schema_version":"1.0"},"canonical_sha256":"35efeb2d97b103f1dd7d456912535985d79f9a98a45a3fa55040da3e2b86ecb6","source":{"kind":"arxiv","id":"2605.14206","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2605.14206","created_at":"2026-05-17T23:39:10Z"},{"alias_kind":"arxiv_version","alias_value":"2605.14206v1","created_at":"2026-05-17T23:39:10Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.14206","created_at":"2026-05-17T23:39:10Z"},{"alias_kind":"pith_short_12","alias_value":"GXX6WLMXWEB7","created_at":"2026-05-18T12:33:37Z"},{"alias_kind":"pith_short_16","alias_value":"GXX6WLMXWEB7DXL5","created_at":"2026-05-18T12:33:37Z"},{"alias_kind":"pith_short_8","alias_value":"GXX6WLMX","created_at":"2026-05-18T12:33:37Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2026:GXX6WLMXWEB7DXL5IVUREU2ZQX","target":"record","payload":{"canonical_record":{"source":{"id":"2605.14206","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2026-05-14T00:02:16Z","cross_cats_sorted":[],"title_canon_sha256":"aa0ed376d2d0aecc217a2b84907f63a87f5e71415b6c1b5cdd471a436401fcec","abstract_canon_sha256":"277d84b1e5e065cacc0b593c2691c0881fc4b0485f5277280c745ef7150f359c"},"schema_version":"1.0"},"canonical_sha256":"35efeb2d97b103f1dd7d456912535985d79f9a98a45a3fa55040da3e2b86ecb6","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:39:10.990815Z","signature_b64":"nwr/ZRXxyXxZxk9gnXkZ9acjNaY0IKxO5TBnZKAARQP2Uz3MDvhnYJS2ZqT7FP7iu9kfegmDLffzJHh8PjEJBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"35efeb2d97b103f1dd7d456912535985d79f9a98a45a3fa55040da3e2b86ecb6","last_reissued_at":"2026-05-17T23:39:10.990332Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:39:10.990332Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2605.14206","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-17T23:39:10Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"5rUgky6289yUyblKcqJVHiYRpSBhrz8gv5LDHlSCDQ64K5K+xx4SzMyytA9B2UFOMU5U58JiYuJU3R46OodfBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-10T15:45:46.799957Z"},"content_sha256":"6d700a57a5cd5772989b43babafe38610d235e63163b9a589f988d9e3e00015e","schema_version":"1.0","event_id":"sha256:6d700a57a5cd5772989b43babafe38610d235e63163b9a589f988d9e3e00015e"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2026:GXX6WLMXWEB7DXL5IVUREU2ZQX","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"The clumsy coupon collector's problem","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"The time for a clumsy coupon collector to acquire all m coupons obeys three different limiting laws as m grows, according to how the clumsiness probability p scales with m.","cross_cats":[],"primary_cat":"math.PR","authors_text":"Luke J. Attrill, Timothy M. Garoni","submitted_at":"2026-05-14T00:02:16Z","abstract_excerpt":"We consider a generalisation of the classical coupon collector's problem, in which at each time step a collector either receives a new copy of a randomly chosen coupon, or loses all their previously collected copies of that coupon. We consider the amount of time it takes this clumsy coupon collector to obtain the full set of $m$ coupons. We establish limit theorems as $m\\to\\infty$ for the clumsy coupon collection time, and describe the large $m$ asymptotics of its mean and variance. We identify three regimes, depending on how the probability of a clumsy update, $p$, scales with $m$. If $p=o(1/"},"claims":{"count":4,"items":[{"kind":"strongest_claim","text":"We establish limit theorems as m→∞ for the clumsy coupon collection time, and describe the large m asymptotics of its mean and variance. We identify three regimes, depending on how the probability of a clumsy update, p, scales with m.","source":"verdict.strongest_claim","status":"machine_extracted","claim_id":"C1","attestation":"unclaimed"},{"kind":"weakest_assumption","text":"The model assumes independent trials at each step with fixed clumsiness probability p, and that the loss removes all copies of exactly one randomly chosen coupon; the limiting statements further assume the stated scaling relations between p and m hold exactly.","source":"verdict.weakest_assumption","status":"machine_extracted","claim_id":"C2","attestation":"unclaimed"},{"kind":"one_line_summary","text":"The clumsy coupon collector time converges to Gumbel when p=o(1/m), exponential when p=ω(1/m), and a birth-death process when p=c/m.","source":"verdict.one_line_summary","status":"machine_extracted","claim_id":"C3","attestation":"unclaimed"},{"kind":"headline","text":"The time for a clumsy coupon collector to acquire all m coupons obeys three different limiting laws as m grows, according to how the clumsiness probability p scales with m.","source":"verdict.pith_extraction.headline","status":"machine_extracted","claim_id":"C4","attestation":"unclaimed"}],"snapshot_sha256":"2cf74bad79030818bddfe6d72d109ce0994e43e4680b84794c02f4358f41557c"},"source":{"id":"2605.14206","kind":"arxiv","version":1},"verdict":{"id":"6de63a16-8588-448d-800f-e61034e99ad8","model_set":{"reader":"grok-4.3"},"created_at":"2026-05-15T02:42:57.604602Z","strongest_claim":"We establish limit theorems as m→∞ for the clumsy coupon collection time, and describe the large m asymptotics of its mean and variance. We identify three regimes, depending on how the probability of a clumsy update, p, scales with m.","one_line_summary":"The clumsy coupon collector time converges to Gumbel when p=o(1/m), exponential when p=ω(1/m), and a birth-death process when p=c/m.","pipeline_version":"pith-pipeline@v0.9.0","weakest_assumption":"The model assumes independent trials at each step with fixed clumsiness probability p, and that the loss removes all copies of exactly one randomly chosen coupon; the limiting statements further assume the stated scaling relations between p and m hold exactly.","pith_extraction_headline":"The time for a clumsy coupon collector to acquire all m coupons obeys three different limiting laws as m grows, according to how the clumsiness probability p scales with m."},"references":{"count":31,"sample":[{"doi":"","year":2023,"title":"Saksham Aggarwal and Timothy M. Garoni. The clumsy coupon collector. In David R. Wood, Alison M. Etheridge, Jan de Gier, and Nalini Joshi, editors,2023 MATRIX Annals, volume 6 ofMATRIX Book Series, pa","work_id":"2dd796ea-9d4f-4c89-b430-eb233239b082","ref_index":1,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":2015,"title":"New results on a generalised coupon collector problem using Markov chains.J","work_id":"9f58a495-4182-4ba6-a3a7-cc1f856dd120","ref_index":2,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":1965,"title":"Baum and Patrick Billingsley","work_id":"518bee69-c2d0-4045-ac97-96f4908d36ae","ref_index":3,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":1989,"title":"The coupon-collector problem revisited.Department of Computer Science Technical Reports, 1989","work_id":"17b1af4f-a53b-43ae-8be6-6eb86bcd102d","ref_index":4,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":2008,"title":"The converse to Curtiss' theorem for one-sided moment generating functions","work_id":"96c1c6c6-ce88-4759-aaa8-41f88b553557","ref_index":5,"cited_arxiv_id":"0807.3392","is_internal_anchor":true}],"resolved_work":31,"snapshot_sha256":"7f8de1243f2bfa45d65f27e119c6e1dcb25ba27197a1c033579cf5fda653ecf0","internal_anchors":1},"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":"6de63a16-8588-448d-800f-e61034e99ad8"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-17T23:39:10Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"3nYJ1eUYIwh6LdYjsGrooqk7DZFuAlj9grOUu3lXo6dRF5D+2Q0KmthdAzx84cViOfWsg6OH3D7QmY8ocX9hAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-10T15:45:46.801163Z"},"content_sha256":"3ac3f02739a11783af9a5eaa671db691fc6588fa0ea3ccb35e3765aa816515b1","schema_version":"1.0","event_id":"sha256:3ac3f02739a11783af9a5eaa671db691fc6588fa0ea3ccb35e3765aa816515b1"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/GXX6WLMXWEB7DXL5IVUREU2ZQX/bundle.json","state_url":"https://pith.science/pith/GXX6WLMXWEB7DXL5IVUREU2ZQX/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/GXX6WLMXWEB7DXL5IVUREU2ZQX/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-10T15:45:46Z","links":{"resolver":"https://pith.science/pith/GXX6WLMXWEB7DXL5IVUREU2ZQX","bundle":"https://pith.science/pith/GXX6WLMXWEB7DXL5IVUREU2ZQX/bundle.json","state":"https://pith.science/pith/GXX6WLMXWEB7DXL5IVUREU2ZQX/state.json","well_known_bundle":"https://pith.science/.well-known/pith/GXX6WLMXWEB7DXL5IVUREU2ZQX/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:GXX6WLMXWEB7DXL5IVUREU2ZQX","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":"277d84b1e5e065cacc0b593c2691c0881fc4b0485f5277280c745ef7150f359c","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2026-05-14T00:02:16Z","title_canon_sha256":"aa0ed376d2d0aecc217a2b84907f63a87f5e71415b6c1b5cdd471a436401fcec"},"schema_version":"1.0","source":{"id":"2605.14206","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2605.14206","created_at":"2026-05-17T23:39:10Z"},{"alias_kind":"arxiv_version","alias_value":"2605.14206v1","created_at":"2026-05-17T23:39:10Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.14206","created_at":"2026-05-17T23:39:10Z"},{"alias_kind":"pith_short_12","alias_value":"GXX6WLMXWEB7","created_at":"2026-05-18T12:33:37Z"},{"alias_kind":"pith_short_16","alias_value":"GXX6WLMXWEB7DXL5","created_at":"2026-05-18T12:33:37Z"},{"alias_kind":"pith_short_8","alias_value":"GXX6WLMX","created_at":"2026-05-18T12:33:37Z"}],"graph_snapshots":[{"event_id":"sha256:3ac3f02739a11783af9a5eaa671db691fc6588fa0ea3ccb35e3765aa816515b1","target":"graph","created_at":"2026-05-17T23:39:10Z","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":4,"items":[{"attestation":"unclaimed","claim_id":"C1","kind":"strongest_claim","source":"verdict.strongest_claim","status":"machine_extracted","text":"We establish limit theorems as m→∞ for the clumsy coupon collection time, and describe the large m asymptotics of its mean and variance. We identify three regimes, depending on how the probability of a clumsy update, p, scales with m."},{"attestation":"unclaimed","claim_id":"C2","kind":"weakest_assumption","source":"verdict.weakest_assumption","status":"machine_extracted","text":"The model assumes independent trials at each step with fixed clumsiness probability p, and that the loss removes all copies of exactly one randomly chosen coupon; the limiting statements further assume the stated scaling relations between p and m hold exactly."},{"attestation":"unclaimed","claim_id":"C3","kind":"one_line_summary","source":"verdict.one_line_summary","status":"machine_extracted","text":"The clumsy coupon collector time converges to Gumbel when p=o(1/m), exponential when p=ω(1/m), and a birth-death process when p=c/m."},{"attestation":"unclaimed","claim_id":"C4","kind":"headline","source":"verdict.pith_extraction.headline","status":"machine_extracted","text":"The time for a clumsy coupon collector to acquire all m coupons obeys three different limiting laws as m grows, according to how the clumsiness probability p scales with m."}],"snapshot_sha256":"2cf74bad79030818bddfe6d72d109ce0994e43e4680b84794c02f4358f41557c"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"abstract_excerpt":"We consider a generalisation of the classical coupon collector's problem, in which at each time step a collector either receives a new copy of a randomly chosen coupon, or loses all their previously collected copies of that coupon. We consider the amount of time it takes this clumsy coupon collector to obtain the full set of $m$ coupons. We establish limit theorems as $m\\to\\infty$ for the clumsy coupon collection time, and describe the large $m$ asymptotics of its mean and variance. We identify three regimes, depending on how the probability of a clumsy update, $p$, scales with $m$. If $p=o(1/","authors_text":"Luke J. Attrill, Timothy M. Garoni","cross_cats":[],"headline":"The time for a clumsy coupon collector to acquire all m coupons obeys three different limiting laws as m grows, according to how the clumsiness probability p scales with m.","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2026-05-14T00:02:16Z","title":"The clumsy coupon collector's problem"},"references":{"count":31,"internal_anchors":1,"resolved_work":31,"sample":[{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":1,"title":"Saksham Aggarwal and Timothy M. Garoni. The clumsy coupon collector. In David R. Wood, Alison M. Etheridge, Jan de Gier, and Nalini Joshi, editors,2023 MATRIX Annals, volume 6 ofMATRIX Book Series, pa","work_id":"2dd796ea-9d4f-4c89-b430-eb233239b082","year":2023},{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":2,"title":"New results on a generalised coupon collector problem using Markov chains.J","work_id":"9f58a495-4182-4ba6-a3a7-cc1f856dd120","year":2015},{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":3,"title":"Baum and Patrick Billingsley","work_id":"518bee69-c2d0-4045-ac97-96f4908d36ae","year":1965},{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":4,"title":"The coupon-collector problem revisited.Department of Computer Science Technical Reports, 1989","work_id":"17b1af4f-a53b-43ae-8be6-6eb86bcd102d","year":1989},{"cited_arxiv_id":"0807.3392","doi":"","is_internal_anchor":true,"ref_index":5,"title":"The converse to Curtiss' theorem for one-sided moment generating functions","work_id":"96c1c6c6-ce88-4759-aaa8-41f88b553557","year":2008}],"snapshot_sha256":"7f8de1243f2bfa45d65f27e119c6e1dcb25ba27197a1c033579cf5fda653ecf0"},"source":{"id":"2605.14206","kind":"arxiv","version":1},"verdict":{"created_at":"2026-05-15T02:42:57.604602Z","id":"6de63a16-8588-448d-800f-e61034e99ad8","model_set":{"reader":"grok-4.3"},"one_line_summary":"The clumsy coupon collector time converges to Gumbel when p=o(1/m), exponential when p=ω(1/m), and a birth-death process when p=c/m.","pipeline_version":"pith-pipeline@v0.9.0","pith_extraction_headline":"The time for a clumsy coupon collector to acquire all m coupons obeys three different limiting laws as m grows, according to how the clumsiness probability p scales with m.","strongest_claim":"We establish limit theorems as m→∞ for the clumsy coupon collection time, and describe the large m asymptotics of its mean and variance. We identify three regimes, depending on how the probability of a clumsy update, p, scales with m.","weakest_assumption":"The model assumes independent trials at each step with fixed clumsiness probability p, and that the loss removes all copies of exactly one randomly chosen coupon; the limiting statements further assume the stated scaling relations between p and m hold exactly."}},"verdict_id":"6de63a16-8588-448d-800f-e61034e99ad8"}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:6d700a57a5cd5772989b43babafe38610d235e63163b9a589f988d9e3e00015e","target":"record","created_at":"2026-05-17T23:39:10Z","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":"277d84b1e5e065cacc0b593c2691c0881fc4b0485f5277280c745ef7150f359c","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2026-05-14T00:02:16Z","title_canon_sha256":"aa0ed376d2d0aecc217a2b84907f63a87f5e71415b6c1b5cdd471a436401fcec"},"schema_version":"1.0","source":{"id":"2605.14206","kind":"arxiv","version":1}},"canonical_sha256":"35efeb2d97b103f1dd7d456912535985d79f9a98a45a3fa55040da3e2b86ecb6","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"35efeb2d97b103f1dd7d456912535985d79f9a98a45a3fa55040da3e2b86ecb6","first_computed_at":"2026-05-17T23:39:10.990332Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:39:10.990332Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"nwr/ZRXxyXxZxk9gnXkZ9acjNaY0IKxO5TBnZKAARQP2Uz3MDvhnYJS2ZqT7FP7iu9kfegmDLffzJHh8PjEJBQ==","signature_status":"signed_v1","signed_at":"2026-05-17T23:39:10.990815Z","signed_message":"canonical_sha256_bytes"},"source_id":"2605.14206","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:6d700a57a5cd5772989b43babafe38610d235e63163b9a589f988d9e3e00015e","sha256:3ac3f02739a11783af9a5eaa671db691fc6588fa0ea3ccb35e3765aa816515b1"],"state_sha256":"bb769f08471db3598d50ba0df1faff14de2980fb0c1116c17c880ec0484a00f3"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"XUJWjdt9JwPGVAPDCp7Hk7NC6yHVQc/RNKd9yMRmSEK5+QHZaoSwDNVbjwyROk7YlKqTJPSnlevy4mr4zPu7Bg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-10T15:45:46.808649Z","bundle_sha256":"ba93019e1aee2e163668b41475bda4abfa7bc7fde3ab945da174dfc0e49b6415"}}