{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004088656,0.001289529,0.002319204,0.002601071,0.001572658,0.003379085,0.003295946,0.003706431,0.003542759],"category_scores_gemma":[0.05912819,0.00152904,0.001890301,0.002001232,0.003911692,0.009342906,0.003854454,0.004379791,0.0007187151],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.003704732,"about_ca_system_score_gemma":0.001037403,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001685755,"about_ca_topic_score_gemma":0.00142953,"domain_scores_codex":[0.9969329,0.0007619319,0.0001674057,0.0007845862,0.0007342377,0.0006189862],"domain_scores_gemma":[0.9652638,0.02617476,0.003036187,0.001954498,0.001523238,0.002047385],"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.001384145,0.0002100345,0.007000412,0.00121476,0.0002747466,0.001082905,0.001081625,0.1788013,0.02465641,0.7293738,0.0101287,0.04479109],"study_design_scores_gemma":[0.0001646779,0.0002504932,0.002937348,0.0002385712,0.000119532,0.0009111188,0.0001798752,0.5100458,0.005602907,0.474683,0.004766344,0.0001003283],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3136034,0.008410989,0.6510978,0.005065848,0.0002545989,0.0002392486,0.0008684539,0.001399006,0.01906069],"genre_scores_gemma":[0.9379284,0.002838913,0.0525118,0.001220835,0.0002922877,0.000329505,0.0005430904,0.0002995231,0.004035649],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.004088656,"threshold_uncertainty_score":0.02687979,"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."}}