{"id":"W1994006656","doi":"10.1007/s00493-012-2552-z","title":"A sharp threshold for minimum bounded-depth and bounded-diameter spanning trees and Steiner trees in random networks","year":2012,"lang":"en","type":"article","venue":"COMBINATORICA","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":14,"is_retracted":false,"has_abstract":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Spanning tree; Minimum spanning tree; Steiner tree problem; Minimum weight; Minimum degree spanning tree; k-minimum spanning tree; Connected dominating set; Bounded function; Asymptotically optimal algorithm","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.008214921,0.002068116,0.004948751,0.004967889,0.002531863,0.009545278,0.007217721,0.006462222,0.006691589],"category_scores_gemma":[0.091038,0.003217438,0.002873475,0.003970787,0.007587801,0.02210185,0.007487856,0.01093858,0.001050294],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00589032,"about_ca_system_score_gemma":0.001899195,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001613633,"about_ca_topic_score_gemma":0.001424365,"domain_scores_codex":[0.9941755,0.001549352,0.0003711362,0.001469608,0.001319263,0.001115095],"domain_scores_gemma":[0.9001576,0.07969949,0.005468741,0.005027874,0.003301961,0.006344434],"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.001059166,0.0001727292,0.003366111,0.0008520248,0.0001326791,0.0003224998,0.001021577,0.03587304,0.007852519,0.9183963,0.009652257,0.02129906],"study_design_scores_gemma":[0.0001172288,0.0001382681,0.001504795,0.0001717017,0.0001264913,0.0004886337,0.0002424744,0.1525643,0.002718027,0.8386232,0.00320384,0.0001010206],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2623022,0.01308988,0.6712405,0.01417315,0.0006332561,0.000273409,0.001724429,0.002150126,0.03441308],"genre_scores_gemma":[0.9177482,0.003831917,0.06702667,0.002371128,0.001253804,0.000400473,0.000806177,0.0004894237,0.006072418],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.009545278,"threshold_uncertainty_score":0.04344517,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.0283076622867845,"score_gpt":0.2601603663748668,"score_spread":0.2318527040880823,"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."}}