{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008879987,0.000952278,0.0008666385,0.002073464,0.00148422,0.002662251,0.002278997,0.001194964,0.008657959],"category_scores_gemma":[0.006611355,0.000677152,0.001342861,0.00155861,0.002284738,0.005797097,0.002632291,0.004900255,0.001685192],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001409286,"about_ca_system_score_gemma":0.0005618074,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0008544571,"about_ca_topic_score_gemma":0.001128534,"domain_scores_codex":[0.9988025,0.0001490221,0.00006102017,0.0003817228,0.0002851111,0.0003206098],"domain_scores_gemma":[0.9941286,0.003921485,0.000366663,0.0007208718,0.0003352717,0.0005271909],"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.0003506466,0.0001769328,0.005030006,0.0007194056,0.00007206443,0.0006628103,0.0007471861,0.03688006,0.02838065,0.8419155,0.01459909,0.07046561],"study_design_scores_gemma":[0.00003889679,0.0001305961,0.003738653,0.0001504697,0.00009512893,0.001246802,0.0002596303,0.07973292,0.02278101,0.8688825,0.02285321,0.00009013827],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.4699522,0.006043724,0.3159582,0.004247415,0.0009347486,0.0001775803,0.001214684,0.001325485,0.2001459],"genre_scores_gemma":[0.9335861,0.002556567,0.04483458,0.000767244,0.0002769613,0.0002207501,0.0009072339,0.0003082498,0.01654221],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.008657959,"threshold_uncertainty_score":0.02896374,"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."}}