{"id":"W2122000012","doi":"10.1017/s0963548306007644","title":"Randomized Algorithms for Determining the Majority on Graphs","year":2006,"lang":"en","type":"article","venue":"Combinatorics Probability Computing","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":16,"is_retracted":false,"has_abstract":true,"ca_institutions":"Université du Québec en Outaouais","funders":"","keywords":"Randomized algorithm; Node (physics); Undirected graph; Combinatorics; Graph; Algorithm; Computer science; Task (project management); Upper and lower bounds; Simple (philosophy); Mathematics; Discrete mathematics; Theoretical computer science","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":[],"consensus_categories":[],"category_scores_codex":[0.006349237,0.0003108399,0.0005735146,0.000163231,0.001015959,0.0003064905,0.002030749,0.0001050093,0.000001077166],"category_scores_gemma":[0.001621154,0.0002269699,0.0003926814,0.001062911,0.0004250215,0.0002732434,0.0006651003,0.0004735909,0.000007357844],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001807146,"about_ca_system_score_gemma":0.00008572265,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0000173124,"about_ca_topic_score_gemma":0.000002116825,"domain_scores_codex":[0.9962751,0.0008154317,0.0006629691,0.0008607901,0.0006200691,0.0007656626],"domain_scores_gemma":[0.9912729,0.006502388,0.0002783901,0.001277294,0.0005691567,0.00009987186],"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.0005292399,0.0002563278,0.001380967,0.00004075202,0.00001554614,0.000001479304,0.0001208656,0.000789302,0.000007374426,0.9855909,0.00008005038,0.01118719],"study_design_scores_gemma":[0.02662788,0.0001099226,0.0009335502,0.0000196785,0.000008130735,0.000002297054,0.000005231722,0.1638029,0.0003129804,0.8077597,0.0001951668,0.0002225672],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1846041,0.0001062848,0.808852,0.0007067341,0.001081715,0.00268608,0.000003283608,0.000427296,0.00153251],"genre_scores_gemma":[0.9580962,0.000001946162,0.04147286,0.0001219952,0.00008949088,0.0001279382,0.000005473414,0.00002359229,0.00006051228],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.7734921,"threshold_uncertainty_score":0.9255565,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.040548659523732,"score_gpt":0.3082475723341714,"score_spread":0.2676989128104394,"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."}}