{"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":"codex-gemma-dda1882f352a","candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.003238181,0.0001885007,0.0002797991,0.0002461688,0.00083256,0.0002378538,0.003656034,0.0001425632,0.00001860856],"category_scores_gemma":[0.0006264037,0.0001065711,0.0001224368,0.002362327,0.002876124,0.001422366,0.000525086,0.0002626345,0.00001540278],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004449057,"about_ca_system_score_gemma":0.0001749489,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000009287293,"about_ca_topic_score_gemma":0.000002738417,"domain_scores_codex":[0.9961994,0.0005273084,0.0008218361,0.0007142447,0.001113753,0.0006234917],"domain_scores_gemma":[0.996646,0.001238767,0.0008562195,0.0006412248,0.0004330872,0.0001846697],"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.00002871694,0.00007861396,0.01288426,0.0000226121,0.00004183001,3.079833e-7,0.000150779,0.0001441884,0.03157325,0.9291208,0.005859404,0.02009526],"study_design_scores_gemma":[0.001921086,0.0006737209,0.2510203,0.0003707095,0.00003423037,0.0001050609,0.0001057306,0.05525798,0.09016403,0.5229918,0.07628509,0.001070166],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1405786,0.004243264,0.573638,0.1704297,0.002603073,0.006051,0.00006431741,0.002359194,0.1000329],"genre_scores_gemma":[0.9763868,0.00004177391,0.02088445,0.0001903611,0.0001378509,0.00008388974,0.000001014495,0.000012654,0.002261171],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.8358082,"threshold_uncertainty_score":0.9998375,"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."}}