{"id":"W2963992790","doi":"10.1002/rsa.20828","title":"Notes on growing a tree in a graph","year":2018,"lang":"en","type":"article","venue":"Random Structures and Algorithms","topic":"Stochastic processes and statistical mechanics","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":true,"ca_institutions":"Carleton University; University of Ottawa; University of British Columbia; McGill University","funders":"Natural Sciences and Engineering Research Council of Canada; Simons Institute for the Theory of Computing, University of California Berkeley; University of California Berkeley; National Science Foundation","keywords":"Combinatorics; Vertex (graph theory); Spanning tree; Graph; Mathematics; Enhanced Data Rates for GSM Evolution; Random graph; Tree (set theory); Discrete mathematics; Computer science; Artificial intelligence","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.002251829,0.0007283138,0.0009660486,0.001883773,0.001579068,0.001658552,0.001691005,0.002201447,0.005619067],"category_scores_gemma":[0.01655674,0.0003947003,0.0009379842,0.00240745,0.004132074,0.004212788,0.002045707,0.002721832,0.0007168483],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001174078,"about_ca_system_score_gemma":0.0005856206,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002499002,"about_ca_topic_score_gemma":0.001528752,"domain_scores_codex":[0.9989533,0.0003336052,0.0000557625,0.0002217137,0.0003117411,0.0001238032],"domain_scores_gemma":[0.99035,0.007673652,0.0004995127,0.0004434839,0.000486569,0.0005468008],"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.0001355272,0.00003771817,0.001110861,0.0002404578,0.00003181278,0.0004174899,0.0005834235,0.05411924,0.003626954,0.9104599,0.01044398,0.01879258],"study_design_scores_gemma":[0.00004246729,0.0000919598,0.0007738351,0.00005304712,0.00002654308,0.0001850182,0.0001523004,0.09451543,0.0008663955,0.8975764,0.005685392,0.00003138301],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3048683,0.01108005,0.5806233,0.01673322,0.002814077,0.0001264746,0.0009353695,0.0009628815,0.08185624],"genre_scores_gemma":[0.8785615,0.005643979,0.08298689,0.00292871,0.003443104,0.0002152797,0.0006923455,0.0005927765,0.02493548],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.005619067,"threshold_uncertainty_score":0.0187977,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02932689345265869,"score_gpt":0.3103326056642347,"score_spread":0.2810057122115759,"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."}}