{"id":"W2522164511","doi":"10.1007/s00373-018-1964-y","title":"Brushing Number and Zero-Forcing Number of Graphs and Their Line Graphs","year":2018,"lang":"en","type":"article","venue":"Graphs and Combinatorics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"ca_institutions":"Memorial University of Newfoundland; University of Regina; University of Ottawa","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Graph; Line graph; Upper and lower bounds; Set (abstract data type); Line (geometry); Graph power","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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.000717347,0.000307218,0.0004037045,0.0002566312,0.0004558773,0.0001916174,0.0005246199,0.0001378651,0.000008983465],"category_scores_gemma":[0.00006209916,0.0002586212,0.00009041679,0.001434928,0.000751519,0.0006661124,0.0006517645,0.0003218661,0.000003528948],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001093606,"about_ca_system_score_gemma":0.00002896327,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00006182706,"about_ca_topic_score_gemma":0.000008472935,"domain_scores_codex":[0.9980295,0.0001205323,0.0003537663,0.0006325539,0.000333207,0.0005303827],"domain_scores_gemma":[0.9983783,0.0003053843,0.0001600954,0.0005996989,0.0002834288,0.0002730405],"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.00002042231,0.00006181429,0.0714749,0.00005488483,0.00004091806,0.000005925509,0.001116805,3.558548e-7,0.0005110998,0.914929,0.0000927771,0.01169111],"study_design_scores_gemma":[0.0007843784,0.000214242,0.007334566,0.00006420195,0.0000109002,0.0000952778,0.0001617204,0.001239737,0.002629385,0.9867805,0.000380447,0.0003046172],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9806257,0.001063599,0.01571468,0.0001224586,0.0003169536,0.0002133675,0.000007841709,0.000131291,0.001804075],"genre_scores_gemma":[0.9959069,0.001038925,0.002797145,0.0001049898,0.00001034999,0.00001167683,0.000001735289,0.00002537683,0.0001028257],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.07185154,"threshold_uncertainty_score":0.9999866,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01777300888601583,"score_gpt":0.2793316129552443,"score_spread":0.2615586040692284,"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."}}