{"id":"W2922964563","doi":"10.22108/toc.2019.112258.1579","title":"A lower bound on the $k$-conversion number of graphs of maximum degree $k+1$","year":2019,"lang":"en","type":"article","venue":"DOAJ (DOAJ: Directory of Open Access Journals)","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":1,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Victoria","funders":"","keywords":"Mathematics; Combinatorics; Degree (music); Upper and lower bounds; Discrete mathematics; Physics; Mathematical analysis","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":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.001782558,0.0003293346,0.0009155794,0.0004209689,0.0002036817,0.0001921908,0.002887249,0.0001679189,0.0245057],"category_scores_gemma":[0.0004332068,0.0002105348,0.0004682263,0.0006862709,0.0003520557,0.0006827476,0.0009271171,0.0004613714,0.00002092508],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003789354,"about_ca_system_score_gemma":0.00007216434,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001509732,"about_ca_topic_score_gemma":0.000007537632,"domain_scores_codex":[0.9970713,0.000346105,0.000984083,0.0003330709,0.0009376976,0.0003277333],"domain_scores_gemma":[0.9954726,0.001531306,0.001418362,0.001087246,0.0003717498,0.0001187984],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"observational","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.001867315,0.001006376,0.607361,0.001039204,0.00125271,0.00002939524,0.001619984,0.00002717392,0.0435509,0.2698699,0.06710342,0.00527268],"study_design_scores_gemma":[0.0007038901,0.00003420559,0.09247769,0.0006712864,0.0001342547,0.0000150218,0.0002101542,0.00001628775,0.04273868,0.8609402,0.001747188,0.0003111464],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9615816,0.0009464411,0.00003741969,0.00006782083,0.0009876637,0.0005891114,0.00004201516,0.00001542348,0.03573253],"genre_scores_gemma":[0.997832,0.0009830435,0.0003056343,0.000204146,0.00005116802,0.000009046015,0.000001962375,0.00005383027,0.0005591905],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.5910703,"threshold_uncertainty_score":0.976386,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.2258618023843894,"score_gpt":0.5081293171777996,"score_spread":0.2822675147934102,"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."}}