{"id":"W2018558025","doi":"10.1016/j.tcs.2014.10.009","title":"Approximation algorithms for digraph width parameters","year":2014,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Treewidth; Digraph; Pathwidth; Mathematics; Combinatorics; Bounded function; Discrete mathematics; Partial k-tree; Approximation algorithm; Directed graph; Algorithm; 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":["sts"],"consensus_categories":[],"category_scores_codex":[0.003562173,0.0002080549,0.0002346333,0.0003558386,0.0005849993,0.0005472456,0.00338094,0.00005507559,0.000005628514],"category_scores_gemma":[0.0003993825,0.0001711687,0.0001165004,0.001638617,0.0032997,0.00108055,0.0007600315,0.0001843708,0.00003818646],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004916419,"about_ca_system_score_gemma":0.00006737574,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":8.839415e-7,"about_ca_topic_score_gemma":1.604195e-7,"domain_scores_codex":[0.9968266,0.00017961,0.0002893657,0.0009697712,0.0008556469,0.0008789791],"domain_scores_gemma":[0.9970633,0.001031507,0.00008198206,0.001161385,0.0003067923,0.0003550371],"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.000009026924,0.0000317116,0.0000128203,0.000007867167,0.0000025848,5.482466e-7,0.0001229607,0.0003357549,0.0003491652,0.7937126,0.00001701055,0.205398],"study_design_scores_gemma":[0.0001821718,0.0002214637,0.00007904595,0.000008379505,0.00000148426,0.000006908249,0.000001561663,0.49849,0.004460729,0.4963001,0.0001150874,0.0001330652],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.005847376,0.00000981755,0.9909377,0.0008149762,0.0004723488,0.0004556732,0.000001814403,0.0002938581,0.001166415],"genre_scores_gemma":[0.481162,0.000001069162,0.5184327,0.0003007642,0.00005512179,0.00003464565,8.994469e-7,0.000007367463,0.000005382785],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.4981543,"threshold_uncertainty_score":0.9994128,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02255028058774398,"score_gpt":0.2985672680989592,"score_spread":0.2760169875112152,"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."}}