{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000585389,0.0004873257,0.0005714459,0.001524428,0.001119528,0.002002611,0.001392086,0.000740379,0.005075927],"category_scores_gemma":[0.004568674,0.0005339997,0.0007164682,0.001178661,0.002262186,0.002774535,0.001216123,0.001212485,0.0006739502],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001275562,"about_ca_system_score_gemma":0.0006109026,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001207228,"about_ca_topic_score_gemma":0.001105114,"domain_scores_codex":[0.9987695,0.0001695063,0.000104276,0.0004236182,0.0002996595,0.0002334098],"domain_scores_gemma":[0.9954231,0.002264402,0.0005932961,0.0007954264,0.0003719727,0.000551725],"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.001048438,0.0003434133,0.01178627,0.0007710267,0.0001244743,0.001137455,0.00191463,0.06717605,0.041154,0.7462085,0.01077684,0.1175588],"study_design_scores_gemma":[0.0001935808,0.0003881657,0.01116453,0.0001806639,0.0001422038,0.003484792,0.0009084001,0.2210115,0.03466059,0.7038615,0.02384552,0.000158548],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.8781105,0.0007076614,0.07066192,0.0008373675,0.00006357241,0.000161346,0.001259161,0.001016602,0.0471818],"genre_scores_gemma":[0.9690896,0.0004476765,0.02153554,0.0001992107,0.00004616867,0.0001642469,0.00103123,0.0001617965,0.007324537],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.005075927,"threshold_uncertainty_score":0.01698071,"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."}}