{"id":"W2036569687","doi":"10.5555/1283383.1283507","title":"An efficient cost-sharing mechanism for the prize-collecting Steiner forest problem","year":2007,"lang":"en","type":"article","venue":"Research Showcase @ Carnegie Mellon University (Carnegie Mellon University)","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":33,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Waterloo","funders":"","keywords":"Combinatorics; Steiner tree problem; Path (computing); Terminal (telecommunication); Graph; Connection (principal bundle); Connectivity; Mathematics; Enhanced Data Rates for GSM Evolution; Computer science; Set (abstract data type); Discrete mathematics; Computer network; 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","sts","open_science"],"consensus_categories":[],"category_scores_codex":[0.005457386,0.0006165395,0.0006021409,0.002561001,0.004847623,0.0007073762,0.006143126,0.0003894945,0.0000342064],"category_scores_gemma":[0.0002632101,0.0006219887,0.0005706647,0.005922309,0.00077641,0.001417755,0.002711232,0.001554089,0.00003314757],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001658073,"about_ca_system_score_gemma":0.0007407431,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002173915,"about_ca_topic_score_gemma":0.003292848,"domain_scores_codex":[0.9926497,0.0006981394,0.0004408782,0.001985952,0.001814482,0.002410873],"domain_scores_gemma":[0.9918745,0.002712435,0.0003000508,0.002296905,0.001851557,0.0009646242],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0006908397,0.0007269367,0.0004477507,0.0001709093,0.0003182719,0.00258913,0.003486278,0.0120076,0.003197483,0.9603673,0.001019284,0.01497822],"study_design_scores_gemma":[0.007311816,0.001924406,0.0004252004,0.0003042689,0.0003037771,0.0001704286,0.03226052,0.7325382,0.01205781,0.01247907,0.1980129,0.002211558],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0820597,0.0001418032,0.8892943,0.001133395,0.0008694879,0.003964273,0.00006748451,0.0007671236,0.0217024],"genre_scores_gemma":[0.9480844,0.0003473836,0.03322397,0.000119122,0.0004630691,0.000007621922,0.00004541297,0.0000968872,0.01761217],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9478883,"threshold_uncertainty_score":0.9996231,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.103616335557666,"score_gpt":0.3297581427751367,"score_spread":0.2261418072174707,"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."}}