{"id":"W3048214410","doi":"10.1016/j.akcej.2019.12.016","title":"The <i>k</i>-conversion number of regular graphs","year":2020,"lang":"en","type":"article","venue":"AKCE International Journal of Graphs and Combinatorics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Victoria","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Combinatorics; Mathematics; Maximal independent set; Vertex (graph theory); Dominating set; Upper and lower bounds; Set (abstract data type); Discrete mathematics; Graph; Chordal graph; 1-planar graph; Computer science","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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007771645,0.0004743367,0.0005350765,0.001154762,0.001096025,0.002244148,0.001501749,0.000713405,0.00490636],"category_scores_gemma":[0.005615583,0.0005003604,0.0005157465,0.001025873,0.002036863,0.002563486,0.001264298,0.001732864,0.0004862844],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001911064,"about_ca_system_score_gemma":0.0008216195,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001235123,"about_ca_topic_score_gemma":0.001300479,"domain_scores_codex":[0.998975,0.0001576087,0.00006385121,0.000285717,0.0002613719,0.0002564612],"domain_scores_gemma":[0.9940942,0.003250996,0.0006146239,0.001011218,0.0003423306,0.0006867351],"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.0008520338,0.0003098804,0.01209635,0.0005503539,0.00007879107,0.0005055979,0.001026984,0.1019364,0.0386035,0.7583439,0.0102405,0.07545571],"study_design_scores_gemma":[0.0001253947,0.0002636846,0.01005595,0.0001557783,0.0000934069,0.001442715,0.0004313016,0.2940868,0.04442857,0.6290331,0.01977614,0.0001071554],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.8196622,0.0007969688,0.1018537,0.001333053,0.00006728147,0.0001605102,0.001026029,0.0009625034,0.0741377],"genre_scores_gemma":[0.9676762,0.0003443923,0.02556265,0.0001576411,0.00003919897,0.0001336702,0.0005730074,0.0001123111,0.005401005],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.00490636,"threshold_uncertainty_score":0.01641339,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01333744342552978,"score_gpt":0.275077607849234,"score_spread":0.2617401644237042,"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."}}