{"id":"W2949081670","doi":"10.48550/arxiv.1305.0172","title":"An Optimal Algorithm for the Euclidean Bottleneck Full Steiner Tree Problem","year":2013,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"VLSI and FPGA Design Techniques","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"ca_institutions":"Carleton University","funders":"","keywords":"Steiner tree problem; Combinatorics; k-minimum spanning tree; Mathematics; K-ary tree; Disjoint sets; Logarithm; Matching (statistics); Tree (set theory); Spanning tree; Euclidean minimum spanning tree; Discrete mathematics; Gomory–Hu tree; Upper and lower bounds; Minimum degree spanning tree; Tree structure; Binary tree","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.0002202869,0.0004355735,0.0003579694,0.0001674337,0.0001406883,0.0001249605,0.00105157,0.0004291054,0.0001029077],"category_scores_gemma":[0.000005683759,0.0003910672,0.0002641966,0.0001842833,0.00008906268,0.0002656671,0.0002502546,0.0005695861,0.00005237789],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000154489,"about_ca_system_score_gemma":0.0000447842,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00007812952,"about_ca_topic_score_gemma":0.00002756318,"domain_scores_codex":[0.9985819,0.00004959201,0.0002277513,0.0006169186,0.00007290212,0.0004509144],"domain_scores_gemma":[0.9985132,0.000108114,0.00009643649,0.0009890054,0.0001353358,0.0001579102],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00005037131,0.000144208,0.000099714,0.0003499445,0.0005969511,0.00007939532,0.0003474558,0.8347308,0.00131175,0.007954214,0.0138987,0.1404365],"study_design_scores_gemma":[0.0003477634,0.0001556471,0.00007606178,0.00006013474,0.0001833797,0.00000389556,0.0001069235,0.9874371,0.001158283,0.005558119,0.00435235,0.0005603355],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.03068149,0.0002337062,0.9636283,0.0000258388,0.000317254,0.001314546,0.0001024436,0.001245265,0.002451148],"genre_scores_gemma":[0.950308,0.0005573324,0.04665207,0.00003785336,0.000367424,0.00004227662,0.00009462647,0.0001411988,0.001799272],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9196265,"threshold_uncertainty_score":0.9998541,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.04220076924491658,"score_gpt":0.1779886769648603,"score_spread":0.1357879077199437,"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."}}