{"id":"W2149458512","doi":"10.1007/978-3-642-21458-5_35","title":"Approximation Algorithms for Orienting Mixed Graphs","year":2011,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":12,"is_retracted":false,"has_abstract":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Logarithm; Computer science; Undirected graph; Approximation algorithm; Graph; Vertex (graph theory); Directed graph; Block graph; Combinatorics; Algorithm; Discrete mathematics; Line graph; Mathematics; Theoretical computer science; Pathwidth","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":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.001957578,0.0005297667,0.0005139493,0.001422607,0.0004612592,0.0004460701,0.004261224,0.000314959,0.00001263337],"category_scores_gemma":[0.0002331764,0.0004972183,0.0002189558,0.001009975,0.0008881452,0.001061134,0.001422406,0.0007269573,0.00002750062],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001976628,"about_ca_system_score_gemma":0.0003550397,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000006389283,"about_ca_topic_score_gemma":0.00001690059,"domain_scores_codex":[0.9954529,0.0000482781,0.0005694216,0.001889351,0.001037283,0.001002794],"domain_scores_gemma":[0.9965026,0.0007472216,0.0003639518,0.001616983,0.0005619854,0.0002071957],"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.000007779948,0.00001953198,0.0000108467,0.00004445543,0.000008798606,0.00001196869,0.000457065,0.001298834,0.0001038318,0.3554336,0.000007617452,0.6425956],"study_design_scores_gemma":[0.0002403848,0.0001484408,0.00001820783,0.0001431849,0.000004395884,0.00002230326,1.485372e-7,0.24519,0.003043896,0.7500086,0.0007293251,0.0004510997],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.00003549031,0.0002627158,0.9940059,0.000146171,0.002011709,0.0009767156,0.000008665627,0.0002257554,0.002326937],"genre_scores_gemma":[0.01816737,0.00002625532,0.9806526,0.0002776519,0.0002734484,0.00007146753,0.00001187666,0.00005564343,0.0004636708],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.6421446,"threshold_uncertainty_score":0.9997479,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.04011783219635234,"score_gpt":0.2884520227007706,"score_spread":0.2483341905044183,"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."}}