{"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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0008088927,0.0004306103,0.0004949875,0.001791373,0.00042803,0.000191263,0.001945157,0.0002760645,0.00001118004],"category_scores_gemma":[0.0003678686,0.0004341785,0.0002896633,0.003699124,0.0001609721,0.000698727,0.00003864288,0.0006347444,0.0000410234],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001944878,"about_ca_system_score_gemma":0.0001818521,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00007141253,"about_ca_topic_score_gemma":0.0002647554,"domain_scores_codex":[0.9965473,0.0002757859,0.0006324741,0.001083079,0.000548928,0.0009124472],"domain_scores_gemma":[0.9958778,0.001879677,0.0001222609,0.001652198,0.0002777292,0.0001903111],"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.0000840327,0.0009642405,0.000118636,0.0001229626,0.000200163,0.00002569018,0.001257272,0.002269318,0.003958604,0.06424094,0.0006645735,0.9260936],"study_design_scores_gemma":[0.007734815,0.0008941308,0.006414001,0.0004042322,0.00009998642,0.00003594116,0.0009056116,0.2815502,0.05374759,0.6362617,0.0112165,0.0007353168],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.006008958,0.000230144,0.9877095,0.001229955,0.0006692116,0.001399236,0.00007496138,0.0007052801,0.001972795],"genre_scores_gemma":[0.2640624,0.0003024635,0.7193965,0.001040994,0.00009190176,0.002827007,0.00007692207,0.0001263672,0.01207537],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.9253582,"threshold_uncertainty_score":0.999811,"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."}}