{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001766372,0.0004828856,0.0006906652,0.0004019983,0.002363406,0.002599895,0.0009938986,0.003842301,0.02954566],"category_scores_gemma":[0.01097568,0.0005603312,0.000461451,0.0005254774,0.00337937,0.01058887,0.002658278,0.003712854,0.01101323],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0005869527,"about_ca_system_score_gemma":0.0005364799,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001184934,"about_ca_topic_score_gemma":0.001702496,"domain_scores_codex":[0.998771,0.0005504197,0.00004027951,0.0002958464,0.0001632419,0.0001792038],"domain_scores_gemma":[0.9953066,0.00264403,0.0003636345,0.00052072,0.00043043,0.0007345318],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0006963936,0.0002727556,0.005980588,0.001130225,0.0001012969,0.001120459,0.007717462,0.001886592,0.005264759,0.5554923,0.2665524,0.1537848],"study_design_scores_gemma":[0.00007748051,0.0001564597,0.003122856,0.000332109,0.00005488226,0.001767564,0.01180027,0.007029647,0.00178457,0.6693459,0.3044071,0.0001211782],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"commentary","genre_gemma":"empirical","genre_scores_codex":[0.09047997,0.008439689,0.141959,0.4551433,0.00573894,0.0001525264,0.001055719,0.00125563,0.2957753],"genre_scores_gemma":[0.6848326,0.005316182,0.05620365,0.03208538,0.002330519,0.0002668564,0.00100316,0.0006141231,0.2173476],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.02954566,"threshold_uncertainty_score":0.09884012,"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."}}