{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002518491,0.0005486194,0.001186707,0.001630037,0.001077491,0.001519459,0.001395373,0.001235537,0.002603589],"category_scores_gemma":[0.01190996,0.0005413159,0.0008724714,0.0009152632,0.002177848,0.002880262,0.001764478,0.001463116,0.0003634911],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002150923,"about_ca_system_score_gemma":0.0006997494,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003192946,"about_ca_topic_score_gemma":0.003726591,"domain_scores_codex":[0.9990181,0.0003976031,0.00004175777,0.0002237535,0.0001603404,0.0001584573],"domain_scores_gemma":[0.9928033,0.004360918,0.0009936892,0.0004876689,0.0004791619,0.0008752751],"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.0001259063,0.00005142744,0.002381271,0.00009852466,0.00005143558,0.0005891351,0.0003116638,0.0789523,0.001955056,0.90939,0.001301667,0.004791679],"study_design_scores_gemma":[0.00006861832,0.00005595995,0.0007581461,0.00003606086,0.00002710613,0.0002169523,0.0001079515,0.4263092,0.000515695,0.5700624,0.001808738,0.00003308184],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.5751867,0.001635256,0.407123,0.001720481,0.0001049721,0.00008587435,0.0004852984,0.0005438696,0.01311461],"genre_scores_gemma":[0.9763262,0.0008258277,0.01752258,0.0001699949,0.00006690758,0.00009106105,0.0002205445,0.00005865455,0.004718346],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.003192946,"threshold_uncertainty_score":0.01560611,"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."}}