{"id":"W4380186075","doi":"10.48550/arxiv.2306.04710","title":"On heroes in digraphs with forbidden induced forests","year":2023,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada; Grantová Agentura České Republiky; Government of Ontario","keywords":"Combinatorics; Transitive relation; Tournament; Digraph; Mathematics; Degree (music); Bounded function; Class (philosophy); HERO; Discrete mathematics; Computer science; Physics; Artificial intelligence","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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000895521,0.0006068372,0.0009308024,0.001661642,0.002500255,0.002540455,0.0009354643,0.0007638696,0.005679306],"category_scores_gemma":[0.004656798,0.0007385183,0.0009299075,0.001474358,0.001984588,0.004197252,0.001496083,0.001350663,0.0004957488],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00235142,"about_ca_system_score_gemma":0.0006285441,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003489438,"about_ca_topic_score_gemma":0.004687042,"domain_scores_codex":[0.9989547,0.0002503435,0.000043562,0.0003331776,0.0001717408,0.0002464538],"domain_scores_gemma":[0.9936279,0.003807168,0.0007782538,0.0006851851,0.0003092334,0.0007922967],"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.0002413576,0.00009196695,0.003995194,0.00016806,0.00005639386,0.0004936872,0.001094413,0.0153297,0.004780925,0.9572085,0.003137639,0.01340217],"study_design_scores_gemma":[0.0001006086,0.0001223547,0.002406376,0.0000754193,0.00006576457,0.0008909287,0.0004239014,0.06038343,0.002823952,0.917206,0.01545213,0.000049162],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.766193,0.001384888,0.186786,0.001049083,0.0000892689,0.0001046799,0.0009970353,0.000574276,0.04282176],"genre_scores_gemma":[0.9454646,0.0008737747,0.03528266,0.0003289698,0.0001371702,0.0001027169,0.001113186,0.0001948152,0.01650212],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.005679306,"threshold_uncertainty_score":0.01899916,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.1236648898901003,"score_gpt":0.2342349635212969,"score_spread":0.1105700736311966,"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."}}