Pith. sign in

REVIEW 1 cited by

On the coupon-collector's problem with several parallel collections

Not yet reviewed by Pith; the record is open.

Re-run · record.json Download PDF Read on arXiv ↗

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 1609.04174 v1 pith:VO63TASU submitted 2016-09-14 math.PR

Marco Ferrante , Alessia Tagliavini This is my paper
classification math.PR
keywords collectionscouponsparallelarrivescasecompletecoupon-collectorequal
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
abstract

In this note we evaluate the expectation and variance of the waiting time to complete $m$ parallel collections of coupons, in the case of coupons which arrives independently, one by one and with equal probabilities.

Discussion (0). Sign in to comment.

Forward citations

Cited by 1 Pith paper

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

  1. Cache Management for Mixture-of-Experts LLMs -- extended version

    cs.LG 2025-09 conditional novelty 6.0 of 10

    The paper formalizes expert caching in MoE LLMs as layered paging, proves near-tight competitive lower bounds, and shows a layer-aware LRU variant beats standard LRU on real traces.

Pith tools