{"id":"W2950818896","doi":"10.48550/arxiv.1107.4824","title":"Approximation Algorithms for Digraph Width Parameters","year":2011,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Waterloo","funders":"","keywords":"Treewidth; Digraph; Pathwidth; Combinatorics; Mathematics; Bounded function; Discrete mathematics; Partial k-tree; Approximation algorithm; Directed graph; 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.001709965,0.001871031,0.00120246,0.001949382,0.0008543449,0.003471463,0.002856246,0.00169568,0.00639242],"category_scores_gemma":[0.008472651,0.0009639023,0.001608689,0.003465529,0.0008450219,0.00572067,0.002605892,0.003297418,0.00153406],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.003738678,"about_ca_system_score_gemma":0.00228381,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003161706,"about_ca_topic_score_gemma":0.007775671,"domain_scores_codex":[0.998318,0.0002903928,0.0001085158,0.0005517289,0.0003812129,0.0003502793],"domain_scores_gemma":[0.9959432,0.002123212,0.0003299175,0.001112265,0.0002585648,0.0002327247],"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.000993097,0.0007448973,0.004795045,0.0006900661,0.0002258066,0.0001436725,0.0005676551,0.3683993,0.01226151,0.1252377,0.02473539,0.4612059],"study_design_scores_gemma":[0.0001450263,0.00007123108,0.0004918419,0.0000451091,0.00008501812,0.0001621247,0.0001610968,0.8513895,0.004368536,0.138356,0.004701991,0.00002250171],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.08263812,0.00143554,0.8951659,0.001539697,0.0001334004,0.0002131133,0.001340008,0.004180057,0.01335417],"genre_scores_gemma":[0.3583319,0.001154852,0.628499,0.0005027072,0.00009928011,0.0003604925,0.003760878,0.0005308776,0.006760012],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.00639242,"threshold_uncertainty_score":0.02712607,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.1534640730755815,"score_gpt":0.2340380670938897,"score_spread":0.08057399401830825,"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."}}