{"id":"W4405806035","doi":"10.1016/j.ejc.2024.104104","title":"On heroes in digraphs with forbidden induced forests","year":2024,"lang":"en","type":"article","venue":"European Journal of Combinatorics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"ca_institutions":"","funders":"H2020 European Research Council; Natural Sciences and Engineering Research Council of Canada; Ministry of Colleges and Universities; Grantová Agentura České Republiky","keywords":"Mathematics; Combinatorics; Digraph","routes":{"ca_aff":false,"ca_fund":true,"ca_venue":false,"about_ca":false,"invisible_to_affiliation_only":true},"retraction":null,"screen":null,"direct_labels":[],"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001465856,0.0001409553,0.0001802918,0.0006775968,0.00004980428,0.0002289222,0.001136137,0.00001759192,0.000003355013],"category_scores_gemma":[0.0001121529,0.00009964357,0.00007929045,0.001399593,0.00004351213,0.0006354069,0.0001351428,0.0006761855,0.00003341288],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00007063302,"about_ca_system_score_gemma":0.00009757764,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":4.42568e-7,"about_ca_topic_score_gemma":0.000002259046,"domain_scores_codex":[0.9981886,0.0004081913,0.0003327065,0.0002030625,0.0005872165,0.0002802219],"domain_scores_gemma":[0.9989505,0.0003086764,0.0001138754,0.000338035,0.0001448947,0.000144046],"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.00008197891,0.0001376971,0.001948891,0.00003024179,0.00003843667,0.005975033,0.000829467,0.0002427804,0.0001960311,0.9728709,0.0004928732,0.01715564],"study_design_scores_gemma":[0.0026485,0.006900024,0.03053683,0.001263555,0.00001312327,0.0007310173,0.0001505246,0.002226684,0.001726413,0.9481068,0.005185704,0.0005108521],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9072323,0.0005962159,0.08279433,0.0005173145,0.0007752892,0.0001082473,4.630204e-7,0.00006786396,0.00790796],"genre_scores_gemma":[0.9988308,0.00003583232,0.0008972408,0.00003969827,0.00003841392,7.57231e-7,1.301741e-7,0.00002940542,0.0001277425],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.09159847,"threshold_uncertainty_score":0.4063347,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01995709647949996,"score_gpt":0.2727091763123095,"score_spread":0.2527520798328095,"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."}}