{"id":"W2172997278","doi":"10.1016/j.tcs.2012.03.044","title":"Approximation algorithms for orienting mixed graphs","year":2012,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Gene Regulatory Network Analysis","field":"Biochemistry, Genetics and Molecular Biology","cited_by":8,"is_retracted":false,"has_abstract":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Logarithm; Approximation algorithm; Undirected graph; Vertex (graph theory); Mathematics; Combinatorics; Graph; Directed graph; Mixed graph; Discrete mathematics; Algorithm; Computer science; Line graph; Voltage 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.00190987,0.002639374,0.002316976,0.002525361,0.001213002,0.003176053,0.005247604,0.002642378,0.01206531],"category_scores_gemma":[0.01276618,0.001496351,0.001969197,0.004298288,0.001512495,0.007333802,0.00380647,0.004172528,0.002005593],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002829918,"about_ca_system_score_gemma":0.001469811,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.004252969,"about_ca_topic_score_gemma":0.006130766,"domain_scores_codex":[0.9986927,0.0004376139,0.00006301792,0.000342108,0.0002795922,0.0001850283],"domain_scores_gemma":[0.9919791,0.005595576,0.0004273116,0.001140799,0.0004436982,0.000413487],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000692209,0.0005711901,0.002194482,0.0008003305,0.0001821221,0.0001748391,0.0005009563,0.4607562,0.002900522,0.2296208,0.02718148,0.2744249],"study_design_scores_gemma":[0.0001025346,0.00005677434,0.0002140764,0.00005272279,0.00005861466,0.00007496936,0.0000914988,0.7238256,0.0007745555,0.2719221,0.002811613,0.00001494895],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0451122,0.001073291,0.9402706,0.001052242,0.0001344255,0.0002010731,0.0007660378,0.00160502,0.009785203],"genre_scores_gemma":[0.2568469,0.001121677,0.7273602,0.0005773653,0.0002219302,0.0005993089,0.00312058,0.0009593255,0.009192625],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.01206531,"threshold_uncertainty_score":0.04036254,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01106377089287277,"score_gpt":0.2541082268524995,"score_spread":0.2430444559596267,"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."}}