{"id":"W7114780409","doi":"10.37236/13517","title":"Extremal Number of Arborescences","year":2025,"lang":"","type":"article","venue":"The Electronic Journal of Combinatorics","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Toronto","funders":"National Research, Development and Innovation Office; Innovációs és Technológiai Minisztérium; Nemzeti Kutatási Fejlesztési és Innovációs Hivatal; Magyar Tudományos Akadémia","keywords":"Eulerian path; Upper and lower bounds; Bipartite graph; Graph; Transitive relation; Orientation (vector space); Tournament; Minification","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.0007620422,0.0005083948,0.0007660325,0.001085857,0.001088154,0.00152814,0.001178717,0.0007650797,0.004738809],"category_scores_gemma":[0.004829955,0.0004926299,0.0005924089,0.0007333401,0.001062679,0.002234651,0.001083131,0.000898199,0.0002560533],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001073297,"about_ca_system_score_gemma":0.0003456575,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0004515307,"about_ca_topic_score_gemma":0.0008229217,"domain_scores_codex":[0.9992952,0.0001271406,0.00003734841,0.0002473906,0.0001385718,0.0001543234],"domain_scores_gemma":[0.9968461,0.001543407,0.000543688,0.000302914,0.0002376658,0.0005262087],"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.0007175361,0.0002821668,0.02461649,0.0006951289,0.0003166254,0.001397,0.000598188,0.1989186,0.0396185,0.6499252,0.008884169,0.07403038],"study_design_scores_gemma":[0.00008543366,0.000235365,0.00969753,0.0000826401,0.0001461053,0.002009998,0.0004521622,0.3716222,0.01586191,0.5887392,0.01099479,0.00007257613],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.884068,0.0009854013,0.09239284,0.0008471311,0.00007169005,0.00003623435,0.0004046563,0.0002397615,0.02095429],"genre_scores_gemma":[0.9741912,0.0003724334,0.02046209,0.00009084097,0.00007318905,0.00004627259,0.0003856958,0.0001082232,0.004269962],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.004738809,"threshold_uncertainty_score":0.01585287,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.008349927471902786,"score_gpt":0.2995931588540293,"score_spread":0.2912432313821265,"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."}}