{"id":"W2097697106","doi":"","title":"Tough2_MP: A parallel version of TOUGH2","year":2003,"lang":"en","type":"paratext","venue":"University of North Texas Digital Library (University of North Texas)","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":true,"ca_institutions":"","funders":"Lawrence Berkeley National Laboratory; Laboratory Directed Research and Development; U.S. Department of Energy","keywords":"Computer science; Algorithm","routes":{"ca_aff":false,"ca_fund":false,"ca_venue":false,"about_ca":true,"invisible_to_affiliation_only":true},"retraction":null,"screen":null,"direct_labels":[],"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.00009107043,0.0006119611,0.001247233,0.0009753631,0.0002905141,0.00008691651,0.004309136,0.0004097248,0.001165929],"category_scores_gemma":[0.00001942811,0.0008353376,0.0007240551,0.001631454,0.000665038,0.003722479,0.002183081,0.0005336541,0.0008941665],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00009722688,"about_ca_system_score_gemma":0.0007039768,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000238083,"about_ca_topic_score_gemma":0.00008819135,"domain_scores_codex":[0.9969825,0.0001807268,0.0005054515,0.001032354,0.0007443709,0.0005546311],"domain_scores_gemma":[0.9963372,0.0001886663,0.001467726,0.00132174,0.0003614893,0.0003231957],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","study_design_scores_codex":[0.0003632077,0.0008518418,0.330081,0.0006833391,0.0004982222,0.0001686339,0.000182064,0.01059738,1.506472e-7,0.0009086217,0.6459728,0.009692761],"study_design_scores_gemma":[0.002128932,0.000868905,0.2278792,0.0005289201,0.0001612164,0.00002012607,0.00004148521,0.003438079,0.00004626908,0.0001431938,0.7632872,0.001456525],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","genre_codex":"methods","genre_gemma":"other","genre_scores_codex":[0.1608396,0.001090671,0.4710348,0.0006829806,0.001126047,0.001711578,0.005965326,0.000895056,0.3566539],"genre_scores_gemma":[0.2110953,0.004908353,0.2375133,0.00022038,0.0001224761,1.136768e-7,0.005219564,0.0001482766,0.5407723],"genre_candidate":"other","genre_consensus":null,"teacher_disagreement_score":0.2335215,"threshold_uncertainty_score":0.9998838,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01020408695422574,"score_gpt":0.1820242617473551,"score_spread":0.1718201747931293,"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."}}