{"id":"W3189029205","doi":"10.37236/10808","title":"Linear Bounds for Cycle-Free Saturation Games","year":2022,"lang":"en","type":"article","venue":"The Electronic Journal of Combinatorics","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":2,"is_retracted":false,"has_abstract":true,"ca_institutions":"Concordia University","funders":"Natural Sciences and Engineering Research Council of Canada; European Commission; Simon Fraser University; National Science Foundation","keywords":"Combinatorics; Graph; Mathematics; Saturation (graph theory); Discrete mathematics; Order (exchange)","routes":{"ca_aff":true,"ca_fund":true,"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.002078744,0.0001240556,0.0002387756,0.00009473142,0.0007664426,0.00002637264,0.000884708,0.00004016636,0.00003195854],"category_scores_gemma":[0.0005132995,0.00008263365,0.0002222761,0.0002364121,0.00005261342,0.0000900977,0.0001759468,0.0007993583,2.192523e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0003060524,"about_ca_system_score_gemma":0.0002459445,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":7.881125e-7,"about_ca_topic_score_gemma":0.00000138276,"domain_scores_codex":[0.9984581,0.0001945913,0.0004095293,0.0000848219,0.0004756669,0.0003772191],"domain_scores_gemma":[0.9981571,0.0007225046,0.0005116411,0.000382242,0.0001885973,0.00003795977],"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.000169816,0.00007309628,0.00001712055,0.00001464535,0.0001095874,0.000001582096,0.0007674856,0.00009109622,0.0000692778,0.9927097,0.005531792,0.0004448229],"study_design_scores_gemma":[0.001089961,0.000832719,0.00002177359,0.000004863134,0.0001044055,0.0001971188,0.0003314789,0.0003109588,0.000339115,0.9627752,0.03389382,0.00009854325],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9566663,0.006705112,0.02769659,0.003515305,0.003288157,0.0005792307,0.0000160184,0.00005110656,0.001482159],"genre_scores_gemma":[0.998687,0.0001476895,0.0001784432,0.0001347975,0.0002502462,0.00001300874,0.000001298312,0.00002837953,0.0005590932],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.04202073,"threshold_uncertainty_score":0.5894934,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01488447098645233,"score_gpt":0.2808253127870409,"score_spread":0.2659408418005885,"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."}}