{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001264408,0.001189988,0.002769743,0.001918238,0.001459708,0.001381533,0.003153171,0.00258793,0.007741935],"category_scores_gemma":[0.007524769,0.001353145,0.002365935,0.002032213,0.001345457,0.002489037,0.005032886,0.0021246,0.002242487],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000731311,"about_ca_system_score_gemma":0.000942097,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001744602,"about_ca_topic_score_gemma":0.003008003,"domain_scores_codex":[0.99886,0.0001839826,0.00006614425,0.0003409487,0.0004110463,0.0001379846],"domain_scores_gemma":[0.9962181,0.001608386,0.000161286,0.001436021,0.0003239437,0.0002521791],"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.0008733469,0.000432017,0.002111694,0.0006997118,0.0002353564,0.0002780489,0.0004025104,0.2920723,0.04252192,0.0728759,0.01681449,0.5706828],"study_design_scores_gemma":[0.0001296443,0.0001202057,0.0003297972,0.00003426686,0.00005364393,0.0001975536,0.0001090616,0.9257614,0.007771485,0.06030539,0.005152097,0.00003547809],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02552022,0.0002571786,0.9689042,0.0002061805,0.0001532568,0.000156826,0.0001283697,0.001798059,0.002875652],"genre_scores_gemma":[0.1137149,0.0001938492,0.8785407,0.0001681638,0.00007345481,0.0001950354,0.0003938472,0.0006040047,0.00611598],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.007741935,"threshold_uncertainty_score":0.02589935,"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."}}