{"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001118809,0.0000969174,0.00009487971,0.00005619756,0.0002284589,0.00004775824,0.0003208852,0.00005033026,0.000007642892],"category_scores_gemma":[0.00005582388,0.00008332858,0.00008476039,0.0003175956,0.0007629732,0.00001155347,0.0001978837,0.00003480048,0.000006035856],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001043324,"about_ca_system_score_gemma":0.00002582261,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":2.43851e-7,"about_ca_topic_score_gemma":1.321701e-7,"domain_scores_codex":[0.9988924,0.00003985782,0.0001393912,0.0003014711,0.0001997716,0.0004271476],"domain_scores_gemma":[0.9993461,0.00002134016,0.00004665033,0.0003090256,0.0001226647,0.0001542252],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","study_design_scores_codex":[0.00002419251,0.0001056413,0.002120159,0.00001613525,0.00003241729,1.694923e-7,0.0001394991,0.0005033698,0.1008259,0.8431776,0.0003063639,0.05274854],"study_design_scores_gemma":[0.0005911952,0.0003359802,0.00495533,0.00001521748,0.00007474368,0.00002465544,0.00003970013,0.4108537,0.5405546,0.03923226,0.002755553,0.0005670475],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3950494,0.0000655995,0.6043189,0.00003227614,0.0002658322,0.00008881883,0.000001018136,0.00001116146,0.0001670396],"genre_scores_gemma":[0.8997003,0.000002258086,0.09975369,0.00008197456,0.0004166989,0.00001268866,0.00001419014,0.000007736814,0.00001042422],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.8039453,"threshold_uncertainty_score":0.3398041,"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."}}