{"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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0009646398,0.0005276311,0.0005137048,0.001538484,0.0003014151,0.0004076689,0.004388581,0.0003584061,0.000005075422],"category_scores_gemma":[0.00008500116,0.0004701735,0.00005928521,0.002426761,0.0004612305,0.0005573257,0.001656396,0.0009195983,0.00003666696],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0005833745,"about_ca_system_score_gemma":0.000377321,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00006425418,"about_ca_topic_score_gemma":0.0005886698,"domain_scores_codex":[0.9955787,0.00002559676,0.000575975,0.002301697,0.0007471334,0.0007708712],"domain_scores_gemma":[0.9958589,0.0003555608,0.0003637448,0.003009859,0.0002753016,0.0001366166],"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.00001036094,0.00004497032,0.0008985997,0.00003363751,0.0000105267,0.00003377161,0.001534198,0.02101831,0.0003167222,0.01853731,0.00002813489,0.9575335],"study_design_scores_gemma":[0.0007526444,0.0008090134,0.003629409,0.001865133,0.00002268528,0.0002713261,0.000002395547,0.55422,0.00880503,0.4179829,0.008702774,0.002936681],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0003247458,0.0001607294,0.9927655,0.0008733518,0.0002857245,0.001129969,0.000001875706,0.0004970888,0.003960993],"genre_scores_gemma":[0.2780768,0.00001509984,0.7202574,0.000860014,0.0001728048,0.0001808441,0.000005298436,0.00004999067,0.0003816864],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.9545968,"threshold_uncertainty_score":0.999775,"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."}}