{"id":"W3114660220","doi":"10.4230/lipics.icalp.2016.27","title":"The Complexity Landscape of Fixed-Parameter Directed Steiner Network Problems","year":2016,"lang":"en","type":"article","venue":"SZTAKI Publication Repository (Hungarian Academy of Sciences)","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Waterloo","funders":"Hungarian Scientific Research Fund; Grantová Agentura České Republiky","keywords":"Steiner tree problem; Combinatorics; Parameterized complexity; Mathematics; Bounded function; Discrete mathematics; Path (computing); Directed graph; 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.002824674,0.002095691,0.003021044,0.001531515,0.001851922,0.00681919,0.004538604,0.003933516,0.01043125],"category_scores_gemma":[0.02454952,0.001203692,0.00217413,0.003363814,0.002421817,0.01150834,0.002984979,0.005071792,0.001300805],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.005982587,"about_ca_system_score_gemma":0.002585407,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.004939768,"about_ca_topic_score_gemma":0.003968877,"domain_scores_codex":[0.9957539,0.001258079,0.000188622,0.001195162,0.0008344232,0.000769901],"domain_scores_gemma":[0.9791433,0.01610065,0.001271694,0.001853423,0.000782166,0.0008488671],"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.0009868369,0.0005307956,0.005408418,0.00149681,0.0003385552,0.0006614183,0.000706231,0.5698988,0.004262666,0.2916971,0.05481254,0.06919991],"study_design_scores_gemma":[0.0001932528,0.00007666525,0.001091809,0.0001052393,0.00008136649,0.0003860498,0.0002431875,0.5606726,0.000987153,0.4277631,0.008352056,0.0000473967],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.4859302,0.008869118,0.3837472,0.02941759,0.0003727529,0.0006790381,0.01702439,0.002861241,0.07109844],"genre_scores_gemma":[0.8769765,0.004726423,0.09123059,0.002398574,0.0005541359,0.001023696,0.01018951,0.0009422631,0.01195825],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.01043125,"threshold_uncertainty_score":0.04340696,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.0437889203206143,"score_gpt":0.294142494946102,"score_spread":0.2503535746254876,"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."}}