{"id":"W4253133138","doi":"10.1002/net.20106","title":"Variations of the prize‐collecting Steiner tree problem","year":2006,"lang":"en","type":"article","venue":"Networks","topic":"Auction Theory and Applications","field":"Decision Sciences","cited_by":9,"is_retracted":false,"has_abstract":true,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Steiner tree problem; Bottleneck; Combinatorics; Spanning tree; Mathematics; k-minimum spanning tree; Graph; Tree (set theory); Path (computing); Discrete mathematics; Time complexity; K-ary tree; Computer science; 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":[],"consensus_categories":[],"category_scores_codex":[0.00100332,0.00005802404,0.0001007471,0.00004511572,0.0003623358,0.0000559997,0.0004021127,0.0000553529,0.0002437179],"category_scores_gemma":[0.0001731499,0.0000342191,0.00008565598,0.001304758,0.00007581909,0.00008182925,0.00006941413,0.000112329,0.00002892392],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001277864,"about_ca_system_score_gemma":0.00003177421,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002561481,"about_ca_topic_score_gemma":0.00009952538,"domain_scores_codex":[0.9988281,0.0001391909,0.0004012804,0.0001752078,0.0003378534,0.0001183318],"domain_scores_gemma":[0.9984587,0.0006659308,0.0002805434,0.0004257556,0.0001491699,0.00001984485],"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.00001248409,0.0001290376,0.01164475,0.000001412647,0.00001382323,1.474406e-7,0.0002090856,0.2002749,0.0006619352,0.6772272,0.06868687,0.04113834],"study_design_scores_gemma":[0.00038456,0.00002377278,0.05897694,0.00001804331,0.00003061229,0.000006510356,0.0002273861,0.07564039,0.0007172468,0.7635661,0.1002471,0.0001613398],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02818849,0.00009976604,0.7339741,0.00262081,0.0004827925,0.0005452977,0.000007159805,0.00006914043,0.2340125],"genre_scores_gemma":[0.9757082,7.965658e-7,0.001753506,0.00007276628,0.0002717142,0.00003077139,0.000001257902,0.000005113142,0.02215584],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9475197,"threshold_uncertainty_score":0.2786831,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.04312057372365112,"score_gpt":0.3182009348621068,"score_spread":0.2750803611384557,"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."}}