{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003905751,0.004276206,0.003089959,0.003609475,0.00349478,0.007331529,0.007221481,0.003280082,0.02968604],"category_scores_gemma":[0.03786219,0.001593119,0.002395367,0.003791706,0.005720423,0.01629267,0.007046205,0.008533512,0.004681176],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.008665629,"about_ca_system_score_gemma":0.004290978,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.004861363,"about_ca_topic_score_gemma":0.006392521,"domain_scores_codex":[0.994497,0.00136557,0.0001824633,0.0009873492,0.001197187,0.001770455],"domain_scores_gemma":[0.9479067,0.04236847,0.001870281,0.00255626,0.001766748,0.003531591],"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.0005631578,0.0003664695,0.001587792,0.0007338031,0.0001115438,0.0002076592,0.0009913738,0.08331976,0.003347562,0.8628305,0.02109834,0.02484201],"study_design_scores_gemma":[0.00007470139,0.00008369901,0.0001899539,0.0001146721,0.00005033085,0.0001078265,0.0001260799,0.2012717,0.00125586,0.7923921,0.004282285,0.00005076229],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1648889,0.006023823,0.5337382,0.0111996,0.0004878452,0.0006552056,0.00411328,0.003674186,0.275219],"genre_scores_gemma":[0.8609918,0.003985484,0.07538862,0.004374368,0.0007614499,0.0021359,0.003827601,0.001837501,0.04669734],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.02968604,"threshold_uncertainty_score":0.09930968,"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."}}