{"id":"W3099735866","doi":"","title":"A sharp threshold for minimum bounded-depth and bounded-diameter spanning trees and Steiner trees in random networks","year":2008,"lang":"en","type":"article","venue":"","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":16,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of British Columbia","funders":"","keywords":"Combinatorics; Mathematics; Bounded function; Spanning tree; Steiner tree problem; Minimum degree spanning tree; Minimum spanning tree; Minimum weight; Binary logarithm; Asymptotically optimal algorithm; Upper and lower bounds; Graph; k-minimum spanning tree; Discrete mathematics; K-ary tree; Tree structure; Algorithm; Mathematical analysis","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.0003744665,0.0002578419,0.0004011064,0.0002302996,0.0003372344,0.0003664981,0.0004263168,0.0001071256,0.00001119981],"category_scores_gemma":[0.00003261765,0.0002173552,0.0001011941,0.000355333,0.0002936583,0.0006249168,0.000318679,0.0001816503,0.000001110956],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002035771,"about_ca_system_score_gemma":0.00004573687,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000144183,"about_ca_topic_score_gemma":0.002046745,"domain_scores_codex":[0.9982765,0.00004484848,0.0003461412,0.0006315958,0.000201801,0.0004990755],"domain_scores_gemma":[0.9989101,0.0004512669,0.00007179411,0.0003854259,0.00004214809,0.0001392207],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.001325047,0.001087945,0.2387401,0.0001603177,0.0004491482,0.0004637569,0.0145931,0.002420111,0.0005570788,0.3746109,0.01631087,0.3492816],"study_design_scores_gemma":[0.006743397,0.0003332424,0.05185455,0.00007764369,0.00001270024,0.0001428835,0.0001214302,0.902333,0.0001114024,0.03278832,0.004909382,0.0005720209],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3797957,0.002745042,0.6130065,0.0007946647,0.0003028968,0.000587258,0.000004315311,0.0001813252,0.002582242],"genre_scores_gemma":[0.8885182,0.0003040016,0.1095026,0.0006214136,0.0001545428,0.00006770422,0.000004102147,0.00001910522,0.0008083876],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.8999129,"threshold_uncertainty_score":0.8863486,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.03766430405973071,"score_gpt":0.2539860380125754,"score_spread":0.2163217339528447,"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."}}