{"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005072589,0.0000942502,0.0001548728,0.0001058358,0.0001089008,0.0001002478,0.001534872,0.00003836065,0.0000050733],"category_scores_gemma":[0.0001518171,0.0000666044,0.0001488816,0.0004762476,0.0001666495,0.0004617874,0.0002930552,0.0002575961,0.000002422038],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001693067,"about_ca_system_score_gemma":0.00004655249,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000002489889,"about_ca_topic_score_gemma":1.729954e-7,"domain_scores_codex":[0.9984456,0.00009008809,0.000369761,0.0001342175,0.0008178183,0.0001425104],"domain_scores_gemma":[0.9981463,0.0003163521,0.0003622488,0.0001688639,0.0008644905,0.0001417379],"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.00008320979,0.00004451524,0.009979792,0.000006518029,0.00008449687,0.00004197624,0.0002171524,0.00000595859,0.0004079626,0.982585,0.0008289846,0.005714422],"study_design_scores_gemma":[0.0007845544,0.0002697321,0.001659387,0.00002816077,0.00000886513,0.0001299811,0.0001304455,0.0008480226,0.003507994,0.983988,0.008553584,0.00009123864],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9257882,0.002064441,0.05434156,0.01365816,0.002471568,0.0001500853,0.000005388339,0.00003773284,0.001482891],"genre_scores_gemma":[0.9967528,0.001661402,0.00126061,0.0002597582,0.00002236928,8.22964e-7,3.400396e-7,0.000006195385,0.00003567644],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.07096465,"threshold_uncertainty_score":0.2852199,"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."}}