{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.01051761,0.002777657,0.004136711,0.002581744,0.002956199,0.006046157,0.008206433,0.004984918,0.006647574],"category_scores_gemma":[0.05591996,0.001963801,0.002431936,0.004190116,0.006089559,0.01606632,0.006770684,0.006634994,0.002025149],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.005158265,"about_ca_system_score_gemma":0.004799338,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003241495,"about_ca_topic_score_gemma":0.0043202,"domain_scores_codex":[0.9797882,0.009686023,0.0009146727,0.004035816,0.002598238,0.002977069],"domain_scores_gemma":[0.9073517,0.07224523,0.004680553,0.0117906,0.002010013,0.001921973],"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.00360842,0.0009359199,0.003926756,0.001072264,0.0004858525,0.0002460374,0.0007413917,0.4135832,0.007383203,0.3693695,0.02605041,0.172597],"study_design_scores_gemma":[0.00039914,0.0001258121,0.0003037688,0.00004468543,0.00007129728,0.00008977314,0.00006693347,0.5113345,0.001998564,0.4830668,0.002450374,0.00004834698],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.06777526,0.001742074,0.9128399,0.003470536,0.0002698044,0.0004685856,0.0007324831,0.004053987,0.008647351],"genre_scores_gemma":[0.4777888,0.00124848,0.5058901,0.001554955,0.0008858436,0.001307753,0.002029905,0.001208986,0.008085332],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01051761,"threshold_uncertainty_score":0.05562311,"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."}}