{"id":"W4226108027","doi":"10.4230/lipics.icalp.2023.63","title":"An O(log k)-Approximation for Directed Steiner Tree in Planar Graphs","year":2023,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Alberta","funders":"","keywords":"Steiner tree problem; Combinatorics; Mathematics; Bipartite graph; Minor (academic); Constant (computer programming); Linear programming relaxation; Discrete mathematics; Approximation algorithm; Dual (grammatical number); Tree (set theory); Linear programming; Algorithm; Graph; Computer science; Law","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.0003998269,0.0003111174,0.000369555,0.0008826667,0.0001553681,0.0001451804,0.00202443,0.0002891097,0.000005448252],"category_scores_gemma":[0.00003998785,0.0003727646,0.000221871,0.001398507,0.00009210255,0.0004866028,0.0005818282,0.0004322924,0.00001993073],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001239734,"about_ca_system_score_gemma":0.0001102263,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0003632408,"about_ca_topic_score_gemma":0.001210701,"domain_scores_codex":[0.9977978,0.0001593753,0.0002621632,0.001254036,0.0001090899,0.0004175634],"domain_scores_gemma":[0.9981015,0.0002038414,0.0001959942,0.001226652,0.0001342444,0.0001378113],"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.00007245529,0.0003136418,0.003725321,0.0001716766,0.00009131452,0.0002088227,0.0006206293,0.06503762,0.00008895646,0.923528,0.0006445141,0.005497084],"study_design_scores_gemma":[0.0004709956,0.0000678153,0.006405808,0.00005925847,0.00001719638,0.000001001719,0.00004923115,0.6162544,0.00004540221,0.3761895,0.0001262256,0.00031314],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1755838,0.00002517013,0.8207259,0.000197716,0.0009601166,0.0007870487,0.00008590279,0.001137967,0.0004963866],"genre_scores_gemma":[0.977401,0.00006551276,0.02151132,0.00005972144,0.00007324318,0.00001161092,0.0001901937,0.00003026652,0.0006571785],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.8018172,"threshold_uncertainty_score":0.9998724,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.1119947188683434,"score_gpt":0.2181126986295274,"score_spread":0.106117979761184,"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."}}