{"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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":[],"category_scores_codex":[0.00134963,0.0007035835,0.0006380936,0.001511679,0.0003216908,0.0006706229,0.006794524,0.0004031464,0.0001349726],"category_scores_gemma":[0.0002298106,0.0006084854,0.0002208797,0.001074359,0.002397583,0.001022941,0.003279791,0.001071498,0.00046529],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002935311,"about_ca_system_score_gemma":0.000510888,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00000719391,"about_ca_topic_score_gemma":0.0001072626,"domain_scores_codex":[0.9941466,0.00006688019,0.0005905933,0.002313309,0.00161579,0.001266865],"domain_scores_gemma":[0.995087,0.0009026634,0.0002683783,0.002920309,0.0004788143,0.0003428591],"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.00003655534,0.00008128439,0.0002746533,0.00009043328,0.00004291956,0.0004321337,0.001581547,0.009184616,0.0006112057,0.1323919,0.0003984557,0.8548743],"study_design_scores_gemma":[0.0003241007,0.0004085425,0.00008602908,0.0002859227,0.000005519651,0.00008499116,1.239585e-7,0.1778501,0.001456352,0.8120331,0.006570823,0.0008944414],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0002125605,0.0003427932,0.9886364,0.0005698117,0.001901468,0.0005030879,0.000006281514,0.0002236887,0.007603886],"genre_scores_gemma":[0.08242271,0.00005695914,0.9074224,0.002642659,0.001643589,0.00003584151,0.000008339318,0.0001291092,0.005638413],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.8539798,"threshold_uncertainty_score":0.9996367,"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."}}