{"id":"W2751738974","doi":"","title":"Optimal control for context-sensitive probabilistic Boolean networks with perturbation using probabilisitic model checking","year":2016,"lang":"en","type":"article","venue":"IEEE Conference Proceedings","topic":"Gene Regulatory Network Analysis","field":"Biochemistry, Genetics and Molecular Biology","cited_by":0,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Calgary","funders":"","keywords":"Reachability; Probabilistic logic; Computer science; Model checking; Optimal control; Context (archaeology); Computation; Reachability problem; Theoretical computer science; Time horizon; Mathematical optimization; Algorithm; Artificial intelligence; Mathematics","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.0003592154,0.0003235771,0.000350967,0.00005916239,0.0001676846,0.00009032238,0.0001941881,0.0002114762,0.000003496964],"category_scores_gemma":[0.0001377106,0.0002316394,0.0001333772,0.0001125742,0.00022991,0.00002883869,0.00003383758,0.00008189979,0.000001117249],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0000907021,"about_ca_system_score_gemma":0.0002294573,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00000310838,"about_ca_topic_score_gemma":0.0000104409,"domain_scores_codex":[0.9982524,0.00002279446,0.0003083395,0.0007184759,0.0001885739,0.0005094205],"domain_scores_gemma":[0.9981706,0.00004133137,0.0002377269,0.0001885113,0.001219457,0.0001424103],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.001247602,0.00007431258,0.002112084,0.0001188675,0.0003364802,0.000001295604,0.0002686444,0.1988369,0.7926148,0.002224192,0.0002133022,0.001951527],"study_design_scores_gemma":[0.001851117,0.000414032,0.0001489312,0.0002510404,0.0002768496,0.00002714271,0.0001841105,0.9452639,0.05046528,0.0005691393,0.00006791738,0.0004805326],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.5386012,0.00004383104,0.4605581,0.00009053253,0.00003050659,0.0005872102,0.00001025374,0.00002318575,0.000055203],"genre_scores_gemma":[0.9934425,0.00001339946,0.005553758,0.0001371568,0.0003045756,0.0001632918,0.00001485523,0.000055087,0.0003153154],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.746427,"threshold_uncertainty_score":0.9445981,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01968407382662073,"score_gpt":0.2344103602858129,"score_spread":0.2147262864591921,"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."}}