{"id":"W4410156455","doi":"10.1145/3734525","title":"A \\(\\boldsymbol{O}(\\textbf{log}\\,\\boldsymbol{k})\\) -Approximation for <scp>Directed Steiner Tree</scp> in Planar Graphs","year":2025,"lang":"en","type":"article","venue":"ACM Transactions on Algorithms","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Alberta","funders":"","keywords":"Steiner tree problem; Combinatorics; Mathematics; Planar; Binary logarithm; Approximation algorithm; Planar graph; Discrete mathematics; Tree (set theory); Computer science; Graph","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.001678441,0.003937135,0.002714966,0.002360271,0.001552061,0.004456434,0.006857381,0.003531396,0.0424485],"category_scores_gemma":[0.008815062,0.001213004,0.003202877,0.005720306,0.001386168,0.01144117,0.005147402,0.004946887,0.01786452],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.005414257,"about_ca_system_score_gemma":0.004808922,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.009516758,"about_ca_topic_score_gemma":0.01736578,"domain_scores_codex":[0.9973218,0.0003633465,0.0001557593,0.0005448346,0.0008742427,0.0007401318],"domain_scores_gemma":[0.9942638,0.002328983,0.0004602403,0.002047668,0.0004664446,0.0004328723],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.003177736,0.00182455,0.002104431,0.001992238,0.0003921367,0.0004985501,0.0005217536,0.1432546,0.02804532,0.04126497,0.1789281,0.5979956],"study_design_scores_gemma":[0.0007774174,0.000500588,0.001401365,0.0002578318,0.0002925459,0.001085058,0.0004149978,0.8605568,0.01784809,0.0857252,0.03103894,0.0001010818],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.09770779,0.004436585,0.7645888,0.007890929,0.001284126,0.0009220461,0.006857684,0.03930213,0.07700987],"genre_scores_gemma":[0.2151912,0.001541226,0.7396452,0.00161497,0.0004767067,0.0007432985,0.009395416,0.004047803,0.02734416],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.0424485,"threshold_uncertainty_score":0.1420044,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02066447745728899,"score_gpt":0.2940247605298569,"score_spread":0.2733602830725679,"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."}}