{"id":"W284364393","doi":"10.1002/jgt.22074","title":"The Game Saturation Number of a Graph","year":2016,"lang":"en","type":"preprint","venue":"Journal of Graph Theory","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":4,"is_retracted":false,"has_abstract":true,"ca_institutions":"Toronto Metropolitan University","funders":"State Administration of Foreign Experts Affairs; National Science Foundation","keywords":"Combinatorics; Vertex (graph theory); Saturation (graph theory); Graph; Mathematics; Upper and lower bounds; 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":[],"consensus_categories":[],"category_scores_codex":[0.004359685,0.0003958283,0.0008206922,0.0002497571,0.0002495927,0.00007119265,0.001173678,0.0004481762,0.0001370751],"category_scores_gemma":[0.001091944,0.0001763648,0.00130549,0.000188729,0.0005824093,0.0001284409,0.0004379339,0.001239764,0.000002120002],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0000461831,"about_ca_system_score_gemma":0.0001232306,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000001211545,"about_ca_topic_score_gemma":0.000003192786,"domain_scores_codex":[0.9962304,0.0009596889,0.001493581,0.0002262668,0.0007670204,0.000323098],"domain_scores_gemma":[0.9916561,0.003499178,0.003199885,0.0008075864,0.0007183286,0.0001189761],"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.0006932021,0.0000688625,0.0003573296,0.0001833152,0.0008972155,0.00001543766,0.001275618,0.000003150714,0.0006421167,0.9849343,0.002115484,0.008813985],"study_design_scores_gemma":[0.0004541401,0.00007459401,0.0008295533,0.0006941287,0.0003299504,0.000204111,0.000238593,0.000001467156,0.001139558,0.9944184,0.001376763,0.0002387321],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9664993,0.004364342,0.01056195,0.0006052803,0.005816226,0.0005752484,0.0001060813,0.00004864302,0.01142298],"genre_scores_gemma":[0.9954605,0.00169184,0.001684182,0.00007269792,0.0006891607,0.000008115062,0.000001889976,0.00004244694,0.0003491661],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.02896125,"threshold_uncertainty_score":0.7191946,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02219536104993084,"score_gpt":0.3148948340988094,"score_spread":0.2926994730488785,"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."}}