{"id":"W169878834","doi":"10.1007/978-3-642-22993-0_10","title":"Faster Coupon Collecting via Replication with Applications in Gossiping","year":2011,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Peer-to-Peer Network Technologies","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"ca_institutions":"Simon Fraser University","funders":"Engineering and Physical Sciences Research Council","keywords":"Computer science; Replica; Sequence (biology); Replication (statistics); Coupon; Gossip; Constructive; Extension (predicate logic); Matching (statistics); Asymptotically optimal algorithm; Theoretical computer science; Algorithm; Mathematics; Process (computing); Statistics; Programming language","routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false,"invisible_to_affiliation_only":false},"retraction":null,"screen":null,"direct_labels":[],"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002832666,0.0009876173,0.002046322,0.001201556,0.001666354,0.002771959,0.002749668,0.00152383,0.007029753],"category_scores_gemma":[0.008514892,0.0009317433,0.0007567079,0.001926557,0.001028627,0.004115884,0.002340695,0.002140932,0.001925226],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0009795588,"about_ca_system_score_gemma":0.001030975,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001359642,"about_ca_topic_score_gemma":0.001562749,"domain_scores_codex":[0.997623,0.000763792,0.0001471183,0.0004138206,0.0008018446,0.0002504515],"domain_scores_gemma":[0.9907373,0.003763097,0.0002930732,0.003888122,0.001034361,0.0002841552],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00347625,0.0007704036,0.003507868,0.0007291176,0.0002403251,0.0003787054,0.001277411,0.1126299,0.0886104,0.1989327,0.0215123,0.5679347],"study_design_scores_gemma":[0.0002394148,0.0003927303,0.0008610016,0.00006519738,0.0001672688,0.000399924,0.0001826207,0.8320373,0.06057077,0.0877345,0.01723486,0.000114465],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.08084952,0.001416181,0.8926311,0.0004221131,0.000566441,0.0003189375,0.0001831102,0.01008374,0.01352883],"genre_scores_gemma":[0.5361914,0.000437139,0.4459931,0.0001667,0.000345012,0.0003139274,0.000298668,0.001061844,0.01519206],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.007029753,"threshold_uncertainty_score":0.02351683,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02447469517799488,"score_gpt":0.2499125393805907,"score_spread":0.2254378442025958,"validation_status":"score_only:v0-immature-baseline","note":"Baseline scores from an immature model (maturity gate not passed). Scores rank; they never assert a category."}}