{"id":"W974563791","doi":"10.1016/j.jda.2015.05.013","title":"On the hardness of full Steiner tree problems","year":2015,"lang":"en","type":"article","venue":"Journal of Discrete Algorithms","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":false,"ca_institutions":"Carleton University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Steiner tree problem; Combinatorics; k-minimum spanning tree; Mathematics; Gomory–Hu tree; Vertex (graph theory); K-ary tree; Tree (set theory); Time complexity; Approximation algorithm; Discrete mathematics; Bottleneck; Graph; Tree structure; Binary tree; Computer science","routes":{"ca_aff":true,"ca_fund":true,"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":[],"consensus_categories":[],"category_scores_codex":[0.001392724,0.0001812732,0.0003577073,0.000194014,0.00008656254,0.0001248033,0.001761891,0.00005825765,0.00001841153],"category_scores_gemma":[0.0001762924,0.0001033702,0.0002643501,0.0005599621,0.0001541462,0.0005086352,0.0002358331,0.0003836507,0.00001236535],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004155469,"about_ca_system_score_gemma":0.0001677612,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001641097,"about_ca_topic_score_gemma":0.000006491017,"domain_scores_codex":[0.9977619,0.0001703008,0.0006336177,0.0001870927,0.000982573,0.0002645297],"domain_scores_gemma":[0.997887,0.0002185448,0.0006255467,0.0005722647,0.0004947284,0.0002018991],"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.000378258,0.001460094,0.000436388,0.000133951,0.0009195708,0.0003450185,0.01127263,0.005827904,0.003164018,0.5105132,0.08468693,0.380862],"study_design_scores_gemma":[0.006695556,0.01026235,0.002655723,0.001057622,0.0001672233,0.001596624,0.001757588,0.2993971,0.008473244,0.6184933,0.04815311,0.001290584],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.03318045,0.001250754,0.9444712,0.01037123,0.003594713,0.0003504189,0.00002120845,0.00005521369,0.006704769],"genre_scores_gemma":[0.8159813,0.000125185,0.1807225,0.000854295,0.001139374,0.00001470656,0.000002760859,0.00004869772,0.001111188],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.7828009,"threshold_uncertainty_score":0.4215316,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.05273686323686087,"score_gpt":0.2655842799530101,"score_spread":0.2128474167161492,"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."}}