{"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000167116,0.0001651505,0.0003131985,0.0000887158,0.0001008109,0.00004231109,0.00008925261,0.00007406392,0.00005206932],"category_scores_gemma":[0.0009545718,0.0001140239,0.00004540734,0.0001505507,0.00007644943,0.00005048714,0.00003325003,0.0001345915,0.000002727859],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000009750961,"about_ca_system_score_gemma":0.00001230182,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0000277021,"about_ca_topic_score_gemma":0.000045133,"domain_scores_codex":[0.9990824,0.00002730284,0.0002198882,0.0002474154,0.0001773044,0.0002456153],"domain_scores_gemma":[0.9986744,0.001030135,0.00005031301,0.0001301136,0.00003805257,0.00007701024],"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.0004554761,0.00004011964,0.000021624,0.00008970238,0.00003248762,0.00003069021,0.0006275385,0.000002304805,0.0003056933,0.8204725,0.0001319658,0.1777899],"study_design_scores_gemma":[0.003676318,0.0002717273,0.0003002989,0.00007616462,0.00002339219,0.00002101084,0.00008160574,0.008165579,0.0009647752,0.9861598,0.00009359243,0.0001657289],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1934799,0.0003116784,0.8031351,0.0004587756,0.0005393013,0.0004797082,0.00005022212,0.00009559094,0.001449775],"genre_scores_gemma":[0.954621,0.00002442411,0.04480672,0.0002249606,0.0002667865,0.00001461251,0.000001845921,0.00001861712,0.00002104547],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.7611411,"threshold_uncertainty_score":0.4649758,"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."}}