{"id":"W1975508655","doi":"10.1109/focs.2013.67","title":"An LMP O(log n)-Approximation Algorithm for Node Weighted Prize Collecting Steiner Tree","year":2013,"lang":"en","type":"article","venue":"","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":21,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Waterloo","funders":"","keywords":"Steiner tree problem; Combinatorics; Approximation algorithm; Mathematics; Undirected graph; Graph; Node (physics); Tree (set theory); Discrete mathematics; Computer science","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.0003002114,0.0001837119,0.0002005749,0.0001777764,0.0003748619,0.0004696913,0.0008365933,0.00008372904,0.0001204876],"category_scores_gemma":[0.00002698903,0.0001572814,0.00009649321,0.000648928,0.00004487513,0.001217861,0.0001375478,0.0001120225,0.00005312901],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0000413791,"about_ca_system_score_gemma":0.00005127038,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001656192,"about_ca_topic_score_gemma":0.00003272705,"domain_scores_codex":[0.9984695,0.00006282704,0.0003100933,0.0004985798,0.0002586234,0.0004004226],"domain_scores_gemma":[0.9987223,0.0001861317,0.0001029543,0.0005925249,0.0002605287,0.0001355817],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000002092906,0.0001738381,0.00005590776,0.00001408102,0.00002266497,0.000001012693,0.0004405491,0.0000192028,0.001648371,0.04570315,0.002903917,0.9490152],"study_design_scores_gemma":[0.0005930389,0.0001673237,0.000573991,0.000009306223,0.000004875095,0.000008134199,0.00007914932,0.9483521,0.004227142,0.04422252,0.00151664,0.000245788],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.004121376,0.00001842166,0.9890701,0.0009257865,0.0003681217,0.0007678819,0.00000462778,0.0004656715,0.004258036],"genre_scores_gemma":[0.01992905,0.000002109792,0.9774901,0.0004866284,0.0001740294,0.0002250492,0.00001619699,0.0000151079,0.001661717],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.9487695,"threshold_uncertainty_score":0.6413749,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02558195332576888,"score_gpt":0.2619176437730184,"score_spread":0.2363356904472495,"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."}}