{"id":"W2905049628","doi":"10.48550/arxiv.1812.03250","title":"The $k$-conversion number of regular graphs","year":2018,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Markov Chains and Monte Carlo Methods","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Victoria","funders":"","keywords":"Combinatorics; Mathematics; Vertex (graph theory); Maximal independent 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":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":[],"consensus_categories":[],"category_scores_codex":[0.001040906,0.0002904318,0.0004272577,0.00009398192,0.0002119206,0.00002666005,0.0008677208,0.00037871,0.00007903058],"category_scores_gemma":[0.0002397404,0.0002414718,0.0004543021,0.0002749402,0.0004262974,0.00005876272,0.001054088,0.0004215962,0.000002193165],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00009424962,"about_ca_system_score_gemma":0.00008421939,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00007539481,"about_ca_topic_score_gemma":0.00003181423,"domain_scores_codex":[0.9983565,0.0003648146,0.0002874139,0.0005691018,0.0001234854,0.0002986563],"domain_scores_gemma":[0.9969886,0.0006011955,0.0004893853,0.001466812,0.0003416092,0.0001124332],"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.0001963374,0.0001139053,0.003805683,0.0005263372,0.0003484591,0.00007201055,0.0003017112,0.0001257642,0.00008477089,0.9793829,0.01455691,0.0004852565],"study_design_scores_gemma":[0.0006989081,0.00005790139,0.0001248161,0.0002891881,0.0004283432,0.000006590574,0.0005906959,0.008144351,0.002244378,0.9756044,0.01129535,0.0005151113],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9519591,0.00006360015,0.02203104,0.00004625633,0.0009371025,0.000394587,0.00002609828,0.0000934021,0.02444876],"genre_scores_gemma":[0.9824974,0.0005161357,0.004871096,0.00002316308,0.0001028211,9.801245e-7,0.000007974042,0.00004063471,0.01193979],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.03053825,"threshold_uncertainty_score":0.9846934,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.1187721685190923,"score_gpt":0.2557245374087653,"score_spread":0.136952368889673,"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."}}