{"id":"W2415039998","doi":"10.4230/lipics.swat.2016.3","title":"A Logarithmic Integrality Gap Bound for Directed Steiner Tree in Quasi-bipartite Graphs","year":2016,"lang":"en","type":"preprint","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada; Hausdorff Center for Mathematics; University of Waterloo","keywords":"Steiner tree problem; Bipartite graph; Combinatorics; Logarithm; Mathematics; Tree (set theory); Constant (computer programming); Discrete mathematics; Linear programming relaxation; Cover (algebra); Set (abstract data type); Upper and lower bounds; Computer science; Algorithm; Graph; Linear programming","routes":{"ca_aff":false,"ca_fund":true,"ca_venue":false,"about_ca":false,"invisible_to_affiliation_only":true},"retraction":null,"screen":null,"direct_labels":[],"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0018339,0.001193709,0.001577563,0.001273217,0.0004538897,0.001293575,0.004216314,0.0009151546,0.00002532824],"category_scores_gemma":[0.0003478805,0.001003859,0.001197348,0.0007885728,0.0004497553,0.001760525,0.002923715,0.001481061,0.00005442833],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0004903452,"about_ca_system_score_gemma":0.0003977494,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00016533,"about_ca_topic_score_gemma":0.0007891575,"domain_scores_codex":[0.9933546,0.0001760786,0.002704394,0.001140923,0.0008726104,0.001751407],"domain_scores_gemma":[0.9942912,0.0006736882,0.001257325,0.00264161,0.0007391305,0.0003970816],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.001449922,0.005414821,0.015794,0.01157911,0.002284006,0.00006829866,0.03518668,0.0002988434,0.0001746667,0.5989259,0.0328142,0.2960096],"study_design_scores_gemma":[0.00999209,0.0008566579,0.003112769,0.002733657,0.0001392093,0.00006639866,0.000430526,0.4202644,0.0006330765,0.4844171,0.07426927,0.003084861],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.07304386,0.0002916711,0.9013825,0.001903532,0.00638629,0.006892761,0.004692351,0.001301725,0.004105306],"genre_scores_gemma":[0.6729398,0.0003998032,0.3094428,0.002987726,0.00116315,0.006421428,0.004022266,0.0003675075,0.002255521],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.599896,"threshold_uncertainty_score":0.9997432,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.04235837561616695,"score_gpt":0.2944877939420583,"score_spread":0.2521294183258914,"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."}}