{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003635461,0.003712052,0.003484661,0.004338619,0.002095002,0.008026169,0.008967317,0.004335119,0.02395246],"category_scores_gemma":[0.02498019,0.002452645,0.003053906,0.008850542,0.002151881,0.02122636,0.006077585,0.01066707,0.005102795],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.007841838,"about_ca_system_score_gemma":0.004566868,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.004575019,"about_ca_topic_score_gemma":0.009072648,"domain_scores_codex":[0.9961599,0.0007585549,0.000231382,0.00119133,0.0009934724,0.0006654368],"domain_scores_gemma":[0.983614,0.008919162,0.0007854702,0.00485308,0.0009739207,0.0008544119],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.001723929,0.001381704,0.003580431,0.001068404,0.0002688416,0.000142617,0.0008450716,0.1991279,0.005457881,0.2291581,0.05142839,0.5058168],"study_design_scores_gemma":[0.0003912164,0.0001149116,0.0004740536,0.0001374333,0.0002118246,0.0002001619,0.0003241888,0.5242262,0.003680113,0.4611349,0.009045859,0.00005915498],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.05066813,0.002148089,0.9149451,0.003288582,0.0003929959,0.0004205071,0.002269101,0.006621303,0.01924628],"genre_scores_gemma":[0.3239829,0.001909946,0.647743,0.001192573,0.0004931428,0.0008768475,0.00492852,0.0026807,0.01619236],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.02395246,"threshold_uncertainty_score":0.08012897,"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."}}