{"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003575477,0.0003765527,0.0009804724,0.0002397819,0.0004146316,0.00005216518,0.001839368,0.0002559973,0.0001701698],"category_scores_gemma":[0.0008061537,0.000237548,0.0006388273,0.001108713,0.000590342,0.00016571,0.0002887893,0.001962551,0.000002646544],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0003171292,"about_ca_system_score_gemma":0.001541276,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000005852072,"about_ca_topic_score_gemma":0.000002509646,"domain_scores_codex":[0.9957452,0.0006090284,0.001701042,0.0001809821,0.0008825574,0.000881122],"domain_scores_gemma":[0.994671,0.001700486,0.001967522,0.0007198522,0.0008546437,0.0000864468],"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.0003359024,0.0003951483,0.001916685,0.0002560562,0.001007473,0.000008696137,0.001316048,0.00001076177,0.00009739839,0.9920061,0.001329502,0.0013202],"study_design_scores_gemma":[0.001345475,0.0004578708,0.0004207559,0.0004658164,0.0008675744,0.0001897443,0.0007882377,0.00008914374,0.002988635,0.9885005,0.003687998,0.00019828],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9097702,0.04917593,0.01017099,0.001619688,0.005822383,0.0004219176,0.000005325629,0.00001600992,0.02299758],"genre_scores_gemma":[0.9899213,0.008172845,0.00005699359,0.00008097627,0.0001491928,0.000001369771,1.71352e-7,0.000028668,0.001588468],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.08015114,"threshold_uncertainty_score":0.9686927,"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."}}