{"id":"W2953316317","doi":"10.48550/arxiv.1302.2127","title":"An LMP O(log n)-Approximation Algorithm for Node Weighted Prize Collecting Steiner Tree","year":2013,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Waterloo","funders":"","keywords":"Steiner tree problem; Combinatorics; Mathematics; Undirected graph; Graph; Approximation algorithm; Node (physics); Tree (set theory); Dual (grammatical number); 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":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.000416947,0.0004778595,0.0005059995,0.000521726,0.0005361684,0.0004395218,0.002557341,0.0004152763,0.00003978797],"category_scores_gemma":[0.00003295781,0.0005458099,0.0003320828,0.001026358,0.0001351139,0.0009455219,0.001273864,0.0005936085,0.00003777332],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002498114,"about_ca_system_score_gemma":0.000232964,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0002450323,"about_ca_topic_score_gemma":0.00005495212,"domain_scores_codex":[0.9970867,0.0002018611,0.0003604075,0.001594935,0.0001684093,0.0005876996],"domain_scores_gemma":[0.9970031,0.0002432623,0.0004310276,0.001602956,0.0004687465,0.0002509395],"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.00008155515,0.001337473,0.0007185909,0.0004908017,0.0006465783,0.0001849097,0.002171588,0.05136395,0.0004925105,0.6403643,0.002669991,0.2994777],"study_design_scores_gemma":[0.0007943318,0.0001219427,0.0002332728,0.00006750425,0.0000543304,0.000004866627,0.0000798274,0.8553624,0.0003307676,0.1417882,0.0005886979,0.000573859],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.03875178,0.00003344531,0.9571442,0.0001253908,0.000959597,0.001100441,0.00005202204,0.0005501574,0.001282946],"genre_scores_gemma":[0.4339013,0.00005108772,0.5626625,0.00017724,0.0003692454,0.00002741895,0.0001487244,0.00005403535,0.002608507],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.8039985,"threshold_uncertainty_score":0.9996994,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.07647743396466734,"score_gpt":0.2116192681216035,"score_spread":0.1351418341569362,"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."}}