{"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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0005982217,0.0002703958,0.0004219545,0.0002170785,0.0002813909,0.0004007383,0.0004913765,0.0001256579,0.000004555527],"category_scores_gemma":[0.0000598359,0.0002475415,0.00009570779,0.0004667142,0.000168629,0.0007677687,0.0004278164,0.000235037,0.00000162885],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00005035635,"about_ca_system_score_gemma":0.00003188682,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00003951864,"about_ca_topic_score_gemma":0.00007458061,"domain_scores_codex":[0.998224,0.00006928715,0.000327078,0.0004871905,0.0002097981,0.0006826224],"domain_scores_gemma":[0.9986548,0.000524962,0.0001022887,0.0004468939,0.00004686447,0.0002241778],"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.0002262798,0.0008192409,0.150368,0.00008092248,0.0001368273,0.00002480487,0.004222448,0.00005536097,0.0001100576,0.7376967,0.004098632,0.1021607],"study_design_scores_gemma":[0.01688473,0.001065971,0.1686963,0.000251689,0.00006935057,0.00009143699,0.0002673723,0.4009978,0.0002287853,0.3632592,0.04653793,0.00164943],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.6037306,0.02933463,0.3569645,0.001504272,0.002996949,0.001503316,0.000009710492,0.0003936444,0.003562385],"genre_scores_gemma":[0.985692,0.0001777475,0.01346876,0.00022193,0.0001485824,0.00009347906,0.000003608047,0.00002176308,0.0001721554],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.4009424,"threshold_uncertainty_score":0.9999977,"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."}}