{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001596129,0.0007509309,0.0008187637,0.0008909294,0.001518479,0.00233152,0.001132128,0.001083546,0.01184688],"category_scores_gemma":[0.009976592,0.0005212185,0.0005446167,0.0004673966,0.003030748,0.005439466,0.002107218,0.001643293,0.0007565406],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.003034184,"about_ca_system_score_gemma":0.001649906,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002361583,"about_ca_topic_score_gemma":0.002072683,"domain_scores_codex":[0.9985298,0.0005778398,0.00005481769,0.0002892382,0.0002501237,0.0002981405],"domain_scores_gemma":[0.9916456,0.005625109,0.0004287199,0.0004431824,0.0004188227,0.001438449],"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.0005777049,0.0001215046,0.001852212,0.0001818161,0.00003735646,0.0002243605,0.0007212877,0.0307413,0.006161924,0.9403021,0.005002815,0.01407557],"study_design_scores_gemma":[0.0000921252,0.0001389995,0.0006105869,0.00004545964,0.00002303444,0.000148978,0.0002510818,0.1779097,0.002452222,0.8115351,0.006762181,0.00003056709],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.5962045,0.0006264562,0.2252412,0.004340976,0.0001847278,0.0003484816,0.0007523039,0.0006320036,0.1716693],"genre_scores_gemma":[0.9729605,0.000180516,0.01627978,0.0003142978,0.00006232828,0.0001889638,0.0001831291,0.00008476492,0.009745678],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.01184688,"threshold_uncertainty_score":0.03963172,"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."}}