{"id":"W2900469667","doi":"10.1007/978-3-030-04618-7_1","title":"Minimum Diameter k-Steiner Forest","year":2018,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"ca_institutions":"Brock University","funders":"","keywords":"Steiner tree problem; Combinatorics; Approximation algorithm; Undirected graph; Graph; Mathematics; Enhanced Data Rates for GSM Evolution; Minimum spanning tree; Discrete mathematics; Computer science; Telecommunications","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.0001266551,0.0005697365,0.0008919961,0.0005782347,0.0007896707,0.001344658,0.001190104,0.0008447007,0.0131764],"category_scores_gemma":[0.0006854378,0.0005086314,0.0005258314,0.001455538,0.0003437928,0.002760779,0.0008687227,0.001359036,0.004257673],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0006350657,"about_ca_system_score_gemma":0.0003858042,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000395008,"about_ca_topic_score_gemma":0.0008412837,"domain_scores_codex":[0.9998291,0.0000158966,0.00001319132,0.00006290418,0.0000462409,0.00003263406],"domain_scores_gemma":[0.9996709,0.00009391878,0.00004033322,0.00006513932,0.00007078404,0.00005903116],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0009977961,0.0002151961,0.001775577,0.004604421,0.0001608722,0.0007214502,0.0004371962,0.03220412,0.06732982,0.36472,0.1304326,0.3964009],"study_design_scores_gemma":[0.0002039744,0.0003516758,0.006226146,0.000556011,0.0003230148,0.005997899,0.0005660189,0.07036777,0.0247079,0.641193,0.2494186,0.00008783555],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"other","genre_gemma":"empirical","genre_scores_codex":[0.2369907,0.0104111,0.33797,0.005158228,0.00151046,0.0003285588,0.01147669,0.002552338,0.393602],"genre_scores_gemma":[0.6001992,0.009148348,0.2868819,0.0006571714,0.0005451755,0.0002193489,0.009216452,0.001048989,0.09208333],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.0131764,"threshold_uncertainty_score":0.04407948,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02307190990746621,"score_gpt":0.2786902830341342,"score_spread":0.255618373126668,"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."}}