{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2012:CBOCYJSQT5MB7CE4YMM23ZOK7V","short_pith_number":"pith:CBOCYJSQ","schema_version":"1.0","canonical_sha256":"105c2c26509f581f889cc319ade5cafd79af38d9801a304d6ad5158e7435f4f2","source":{"kind":"arxiv","id":"1202.0920","version":2},"attestation_state":"computed","paper":{"title":"The weighted words collector","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DM","authors_text":"Dani\\`ele Gardy (PRISM), INRIA Saclay - Ile de France), J\\'er\\'emie Du Boisberranger (PRISM), Yann Ponty (LIX","submitted_at":"2012-02-04T20:33:40Z","abstract_excerpt":"Motivated by applications in bioinformatics, we consider the word collector problem, i.e. the expected number of calls to a random weighted generator of words of length $n$ before the full collection is obtained. The originality of this instance of the non-uniform coupon collector lies in the, potentially large, multiplicity of the words/coupons of a given probability/composition. We obtain a general theorem that gives an asymptotic equivalent for the expected waiting time of a general version of the Coupon Collector. This theorem is especially well-suited for classes of coupons featuring high"},"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":"1202.0920","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2012-02-04T20:33:40Z","cross_cats_sorted":[],"title_canon_sha256":"54add771583789ced784f1da0bdc949597c53ce80c3ac41b5cb3c0cadd9a718d","abstract_canon_sha256":"430b0c54a0745b4f71faa330eadfc94e28713374568fd9adabb8ab379afe52f3"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:57:40.275079Z","signature_b64":"FAGlsJGmNwajPA5mtqhz0593bpiJwF8tkRJBUQtgB8ZVeEVgEqgQmQA3p4ljO+McA/pugTn/GrOMFjK9VH9ACw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"105c2c26509f581f889cc319ade5cafd79af38d9801a304d6ad5158e7435f4f2","last_reissued_at":"2026-05-18T03:57:40.274554Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:57:40.274554Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"The weighted words collector","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DM","authors_text":"Dani\\`ele Gardy (PRISM), INRIA Saclay - Ile de France), J\\'er\\'emie Du Boisberranger (PRISM), Yann Ponty (LIX","submitted_at":"2012-02-04T20:33:40Z","abstract_excerpt":"Motivated by applications in bioinformatics, we consider the word collector problem, i.e. the expected number of calls to a random weighted generator of words of length $n$ before the full collection is obtained. The originality of this instance of the non-uniform coupon collector lies in the, potentially large, multiplicity of the words/coupons of a given probability/composition. We obtain a general theorem that gives an asymptotic equivalent for the expected waiting time of a general version of the Coupon Collector. This theorem is especially well-suited for classes of coupons featuring high"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1202.0920","kind":"arxiv","version":2},"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":"1202.0920","created_at":"2026-05-18T03:57:40.274665+00:00"},{"alias_kind":"arxiv_version","alias_value":"1202.0920v2","created_at":"2026-05-18T03:57:40.274665+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1202.0920","created_at":"2026-05-18T03:57:40.274665+00:00"},{"alias_kind":"pith_short_12","alias_value":"CBOCYJSQT5MB","created_at":"2026-05-18T12:27:01.376967+00:00"},{"alias_kind":"pith_short_16","alias_value":"CBOCYJSQT5MB7CE4","created_at":"2026-05-18T12:27:01.376967+00:00"},{"alias_kind":"pith_short_8","alias_value":"CBOCYJSQ","created_at":"2026-05-18T12:27:01.376967+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/CBOCYJSQT5MB7CE4YMM23ZOK7V","json":"https://pith.science/pith/CBOCYJSQT5MB7CE4YMM23ZOK7V.json","graph_json":"https://pith.science/api/pith-number/CBOCYJSQT5MB7CE4YMM23ZOK7V/graph.json","events_json":"https://pith.science/api/pith-number/CBOCYJSQT5MB7CE4YMM23ZOK7V/events.json","paper":"https://pith.science/paper/CBOCYJSQ"},"agent_actions":{"view_html":"https://pith.science/pith/CBOCYJSQT5MB7CE4YMM23ZOK7V","download_json":"https://pith.science/pith/CBOCYJSQT5MB7CE4YMM23ZOK7V.json","view_paper":"https://pith.science/paper/CBOCYJSQ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1202.0920&json=true","fetch_graph":"https://pith.science/api/pith-number/CBOCYJSQT5MB7CE4YMM23ZOK7V/graph.json","fetch_events":"https://pith.science/api/pith-number/CBOCYJSQT5MB7CE4YMM23ZOK7V/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/CBOCYJSQT5MB7CE4YMM23ZOK7V/action/timestamp_anchor","attest_storage":"https://pith.science/pith/CBOCYJSQT5MB7CE4YMM23ZOK7V/action/storage_attestation","attest_author":"https://pith.science/pith/CBOCYJSQT5MB7CE4YMM23ZOK7V/action/author_attestation","sign_citation":"https://pith.science/pith/CBOCYJSQT5MB7CE4YMM23ZOK7V/action/citation_signature","submit_replication":"https://pith.science/pith/CBOCYJSQT5MB7CE4YMM23ZOK7V/action/replication_record"}},"created_at":"2026-05-18T03:57:40.274665+00:00","updated_at":"2026-05-18T03:57:40.274665+00:00"}