{"id":"W2162824303","doi":"10.1007/978-3-540-77294-1_4","title":"Cleaning Random d-Regular Graphs with Brushes Using a Degree-Greedy Algorithm","year":2007,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":12,"is_retracted":false,"has_abstract":false,"ca_institutions":"University of Waterloo; Dalhousie University","funders":"","keywords":"Combinatorics; Greedy algorithm; Degree (music); Graph; Random graph; Mathematics; Discrete mathematics; Algorithm; Physics","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.00270018,0.0009141568,0.0009329473,0.002486427,0.0006850941,0.0007854342,0.005119807,0.0004178844,0.00001756404],"category_scores_gemma":[0.00009442569,0.0007645771,0.0002375794,0.002312158,0.002435067,0.001281076,0.001869026,0.001652375,0.00002157691],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0004178716,"about_ca_system_score_gemma":0.0007570944,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00005079074,"about_ca_topic_score_gemma":0.0001304661,"domain_scores_codex":[0.9927238,0.0001012334,0.0007025173,0.002449258,0.002416502,0.001606748],"domain_scores_gemma":[0.995358,0.001021244,0.0004231329,0.002208438,0.000574691,0.0004144158],"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.00005724112,0.00002862137,0.00006085473,0.00003212101,0.0000361559,0.0006399725,0.0004691748,0.02940493,0.000209305,0.02877839,0.000001850559,0.9402814],"study_design_scores_gemma":[0.001270244,0.0003615406,0.00004801745,0.0007698499,0.00001766921,0.0005486163,8.191784e-7,0.6673067,0.00206034,0.3261427,0.0003510698,0.001122476],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0002028362,0.0009242279,0.995233,0.0001006922,0.0007257387,0.0007348275,0.000005089957,0.000277075,0.001796501],"genre_scores_gemma":[0.0148952,0.00003924857,0.9839104,0.000554917,0.0003117662,0.000007988682,0.00000343823,0.00009218461,0.0001848184],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.9391589,"threshold_uncertainty_score":0.9994805,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.04270676464780494,"score_gpt":0.2905287732685444,"score_spread":0.2478220086207394,"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."}}