{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00150926,0.001400474,0.001716255,0.000784595,0.0008766634,0.001650142,0.003035064,0.001564832,0.008722509],"category_scores_gemma":[0.004772073,0.0005839151,0.0009949139,0.0022986,0.0007150086,0.00315109,0.001980103,0.002315101,0.002023547],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00235879,"about_ca_system_score_gemma":0.003173874,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003557987,"about_ca_topic_score_gemma":0.006086821,"domain_scores_codex":[0.9988737,0.0003407253,0.00004952031,0.0002479588,0.0002370256,0.0002510665],"domain_scores_gemma":[0.9983501,0.000877203,0.0001367388,0.0003466273,0.0001493937,0.0001399616],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.001317258,0.0006798799,0.001860703,0.0006815997,0.0001478012,0.0002437987,0.0004159431,0.5141062,0.005550834,0.08495274,0.06027839,0.3297649],"study_design_scores_gemma":[0.0001432326,0.00008579376,0.000243881,0.00002881613,0.00002554511,0.0001311918,0.0000834243,0.9391544,0.001043735,0.05517174,0.003874337,0.00001380551],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0797964,0.001209845,0.8869016,0.003166938,0.0002712568,0.0004098524,0.001365336,0.003749478,0.02312929],"genre_scores_gemma":[0.3335056,0.0004756023,0.6512554,0.0006392875,0.0001488187,0.0005408395,0.002100772,0.0005300104,0.0108037],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.008722509,"threshold_uncertainty_score":0.02917969,"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."}}