{"id":"W2970866601","doi":"10.1137/20m1362899","title":"Want to Gather? No Need to Chatter!","year":2020,"lang":"en","type":"preprint","venue":"SIAM Journal on Computing","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"ca_institutions":"Université du Québec en Outaouais","funders":"Natural Sciences and Engineering Research Council of Canada; Université du Québec en Outaouais","keywords":"Node (physics); A priori and a posteriori; Computer science; Task (project management); Product (mathematics); Time complexity; Polynomial; Upper and lower bounds; Theoretical computer science; Mathematics; Algorithm; Engineering","routes":{"ca_aff":true,"ca_fund":true,"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","scholarly_communication","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.001029635,0.0003646731,0.0004797946,0.0004335986,0.0003530753,0.001543039,0.00245294,0.0001352319,0.00006703558],"category_scores_gemma":[0.0002496191,0.0003329238,0.0002195464,0.0005508241,0.00001313941,0.000126703,0.003295695,0.001766408,0.001353997],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002039335,"about_ca_system_score_gemma":0.0003104614,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000006843606,"about_ca_topic_score_gemma":7.035558e-7,"domain_scores_codex":[0.9967874,0.0002651309,0.0006829875,0.0007553587,0.0008709016,0.0006382767],"domain_scores_gemma":[0.9974583,0.0001311396,0.0003280769,0.0006330118,0.0004451336,0.001004297],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00004229732,0.0001204729,0.00007145655,0.00009776972,0.0000960515,0.0003060087,0.007816114,0.8611285,0.0007173545,0.005758736,0.03375869,0.09008652],"study_design_scores_gemma":[0.0004437161,0.0006528504,0.0002845609,0.001164815,0.000006246534,0.0001019361,0.00005794068,0.95433,0.0002066206,0.002302374,0.03977306,0.0006758589],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.002540852,0.00002562835,0.932467,0.0561933,0.003226315,0.0004884684,0.000002871424,0.0002225456,0.004832953],"genre_scores_gemma":[0.3765562,0.00003004892,0.5826017,0.03709234,0.003087095,0.00000907137,0.000005052234,0.00007934156,0.0005390557],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.3740154,"threshold_uncertainty_score":0.9999123,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.04709621463748689,"score_gpt":0.3100520172083028,"score_spread":0.262955802570816,"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."}}