{"id":"W1871140597","doi":"10.1002/jgt.21995","title":"Rainbow Arborescence in Random Digraphs","year":2015,"lang":"en","type":"article","venue":"Journal of Graph Theory","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":6,"is_retracted":false,"has_abstract":true,"ca_institutions":"Toronto Metropolitan University; University of Toronto","funders":"Natural Sciences and Engineering Research Council of Canada; Engineering and Physical Sciences Research Council; Ryerson University; National Science Foundation","keywords":"Combinatorics; Mathematics; Rainbow; Vertex (graph theory); Random graph; Discrete mathematics; Tree (set theory); Graph; Asymptotically optimal algorithm; Algorithm","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005414096,0.0001961623,0.0005219923,0.0006478806,0.00007570999,0.0000305944,0.0005341322,0.0001191098,0.00004385897],"category_scores_gemma":[0.002036519,0.0001342625,0.0003424702,0.0004723976,0.0002731436,0.0002319852,0.00007172444,0.0005191651,0.00000172045],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003755818,"about_ca_system_score_gemma":0.0001067889,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000002396768,"about_ca_topic_score_gemma":0.000004797166,"domain_scores_codex":[0.9976968,0.0006083769,0.000768267,0.000136644,0.0004989084,0.000290996],"domain_scores_gemma":[0.9975547,0.001134309,0.0005324302,0.0003240945,0.0002361456,0.0002183088],"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.00187221,0.0001458066,0.005907872,0.00003206671,0.0001118572,0.0001726418,0.004465835,0.0000213297,0.0001675452,0.9822738,0.002704936,0.002124075],"study_design_scores_gemma":[0.003563673,0.0001642666,0.001490265,0.0001280479,0.0000503389,0.0001845879,0.001005902,0.000006543851,0.0003716957,0.9920437,0.0008278259,0.00016314],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9831974,0.002267741,0.003091636,0.0001693402,0.00128147,0.0001908076,0.000003823628,0.00002884071,0.009768941],"genre_scores_gemma":[0.9957632,0.000130041,0.003583826,0.0001822447,0.0001938129,0.000002351271,2.447765e-7,0.00002557945,0.0001186836],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.01256582,"threshold_uncertainty_score":0.5475067,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.04533237273199347,"score_gpt":0.3087719109937553,"score_spread":0.2634395382617619,"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."}}