{"meta":{"page":1,"per_page":50,"max_per_page":100,"total":27,"total_is_capped":false,"direct_labels_cover":0,"predictions_cover":27,"direct_label_status":"direct model label, unvalidated","prediction_status":"machine_predicted_unvalidated (Codex and Gemma teacher distillation)","score_status":"score_only:v0-immature-baseline (scores rank; they never assert a category)","snapshot":{"source":"OpenAlex, pinned release, all 482 partitions","release":"2026-06-24","frame_built":"2026-07-12"},"query_hash":"8b5fa1297c71","filters":{"venue":"Lecture notes in computational science and engineering"}},"results":[{"id":"W2064523606","doi":"10.1007/3-540-26825-1_24","title":"A New Cement to Glue Nonconforming Grids with Robin Interface Conditions: The Finite Element Case","year":2005,"lang":"en","type":"book-chapter","venue":"Lecture notes in computational science and engineering","topic":"Advanced Numerical Methods in Computational Mathematics","field":"Engineering","cited_by":58,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"McGill University","funders":"","keywords":"GLUE; Piecewise; Domain decomposition methods; Finite element method; Mathematics; Domain (mathematical analysis); Interface (matter); Applied mathematics; Algorithm; Mathematical analysis; Computer science; Structural engineering; Engineering; Parallel computing; Mechanical engineering","retraction":null,"screen_n_in":null,"score":{"opus":0.01506243933060667,"gpt":0.2784052994987885,"spread":0.2633428601681818,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0003008438,0.0003209362,0.0002484118,0.0003022156,0.0001334458,0.0001004212,0.0002262402,0.00007258316,0.00003662404],"category_scores_gemma":[0.0001929433,0.0002515922,0.00002877881,0.0003196263,0.00008822744,0.0001621089,0.000101355,0.0004075107,0.000009326152],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0004075537,"about_ca_system_score_gemma":0.0001168726,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000005557464,"about_ca_topic_score_gemma":0.00001621633,"domain_scores_codex":[0.9985196,0.000004598211,0.0003551692,0.0003067646,0.0005149689,0.00029892],"domain_scores_gemma":[0.998291,0.001231463,0.0000569775,0.0001542567,0.0001180793,0.0001482944],"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.000002941418,0.000002584111,7.317327e-7,0.00004587959,0.00001815029,0.00003203,0.0003810766,0.9499199,0.00004083211,0.009284409,0.00001733563,0.04025413],"study_design_scores_gemma":[0.0001718209,0.00007219345,0.00001102721,0.0004022848,0.00001710239,0.0003651207,0.00001112977,0.9650822,0.0001891048,0.02702219,0.006272743,0.0003830322],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0002457119,0.0003043909,0.9971089,0.0004847618,0.0001926413,0.0003909966,0.00001489016,0.0001006106,0.001157114],"genre_scores_gemma":[0.2061524,0.00001890924,0.7930197,0.0003474339,0.0002390078,0.00002759768,0.000009403811,0.00005904562,0.0001265378],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.2059067,"threshold_uncertainty_score":0.9999936,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4327511418","doi":"10.1007/978-3-030-95025-5","title":"Domain Decomposition Methods in Science and Engineering XXVI","year":2022,"lang":"en","type":"book","venue":"Lecture notes in computational science and engineering","topic":"Engineering Applied Research","field":"Engineering","cited_by":23,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Université Laval","funders":"","keywords":"Domain decomposition methods; Decomposition; Domain (mathematical analysis); Computer science; Chemistry; Mathematics; Physics; Thermodynamics; Organic chemistry; Mathematical analysis","retraction":null,"screen_n_in":null,"score":{"opus":0.009729502747124008,"gpt":0.3010428562295505,"spread":0.2913133534824264,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.002893645,0.0004096299,0.000392476,0.002385054,0.0001910689,0.00023132,0.0005152354,0.0001703041,0.00001801353],"category_scores_gemma":[0.0003947923,0.0004751911,0.00002985107,0.002291496,0.0003331387,0.0003444966,0.000346396,0.001310815,0.000001745318],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002033825,"about_ca_system_score_gemma":0.0004982895,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001125207,"about_ca_topic_score_gemma":0.000006140951,"domain_scores_codex":[0.996882,0.00001534805,0.0003953847,0.0006884392,0.001240408,0.0007784209],"domain_scores_gemma":[0.9985587,0.0008526216,0.00003303196,0.0002136617,0.0001255446,0.0002164141],"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.000002137513,0.000005470287,0.00001855597,0.0002293701,0.000007006297,0.00002100534,0.0003320793,0.9713132,0.0183309,0.002715147,0.00001580209,0.007009316],"study_design_scores_gemma":[0.0002466344,0.0000279729,0.002127872,0.0002106478,0.000005007133,0.00007304511,0.000006323976,0.9885157,0.0007166617,0.003602672,0.00392292,0.0005445246],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.03525329,0.003766037,0.9541238,0.0002111394,0.0008882227,0.0008444227,0.00002438824,0.0005795708,0.004309154],"genre_scores_gemma":[0.4839056,0.0002045028,0.51508,0.00007438122,0.0002507699,0.0001821646,0.00004042434,0.000185439,0.00007675598],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.4486523,"threshold_uncertainty_score":0.99977,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W51067668","doi":"10.1007/978-3-319-05789-7_16","title":"GPU-Based Parallel Reservoir Simulators","year":2014,"lang":"en","type":"book-chapter","venue":"Lecture notes in computational science and engineering","topic":"Advanced Numerical Methods in Computational Mathematics","field":"Engineering","cited_by":18,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Calgary","funders":"","keywords":"Speedup; Computer science; Parallel computing; Computational science; Benchmark (surveying); Graphics processing unit; Domain decomposition methods; CUDA; Multigrid method; General-purpose computing on graphics processing units; Graphics; Partial differential equation; Computer graphics (images); Mathematics; Finite element method","retraction":null,"screen_n_in":null,"score":{"opus":0.01917298842884821,"gpt":0.2698313368961596,"spread":0.2506583484673113,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0004236994,0.0003528917,0.0003624155,0.0004536201,0.00008332026,0.00006661291,0.0002852899,0.0001802811,0.00001690678],"category_scores_gemma":[0.0006767957,0.0003616027,0.0000509077,0.0002824198,0.0001920114,0.00009583912,0.00006649108,0.0004980083,0.00001031304],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002603173,"about_ca_system_score_gemma":0.00008499512,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":8.309265e-7,"about_ca_topic_score_gemma":0.000001096386,"domain_scores_codex":[0.9982311,0.00000683896,0.0003690289,0.0003815915,0.0006854986,0.0003259457],"domain_scores_gemma":[0.9974253,0.002054493,0.00005894863,0.0001803644,0.0001487084,0.0001321516],"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.000002059049,0.000002373826,0.000006382513,0.0001465781,0.000007585414,0.000004417377,0.00002888934,0.9662003,0.00002955143,0.022547,0.000007773496,0.0110171],"study_design_scores_gemma":[0.0001234183,0.00001836133,0.0000735237,0.0001903554,0.000005904058,0.000005226249,2.311351e-7,0.8020482,0.0000282116,0.1950862,0.002102437,0.0003179364],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0003284019,0.0003388344,0.9957581,0.0001547656,0.0003082956,0.0001685321,0.000006129839,0.000230838,0.00270614],"genre_scores_gemma":[0.3426599,0.00001354584,0.6567801,0.0002112422,0.0001659947,0.00001169943,0.00001368147,0.00008600955,0.00005784425],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.3423315,"threshold_uncertainty_score":0.9998836,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W12009016","doi":"10.1007/978-3-540-34469-8_18","title":"Optimized Schwarz Methods with Robin Conditions for the Advection-Diffusion Equation","year":2007,"lang":"en","type":"book-chapter","venue":"Lecture notes in computational science and engineering","topic":"Differential Equations and Numerical Methods","field":"Mathematics","cited_by":12,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"McGill University","funders":"","keywords":"Convergence (economics); Mathematics; Simple (philosophy); Schwarz alternating method; Applied mathematics; Diffusion; Advection; Mathematical optimization; Domain decomposition methods; Physics","retraction":null,"screen_n_in":null,"score":{"opus":0.07216578471844769,"gpt":0.3744615033843911,"spread":0.3022957186659434,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001367848,0.000203301,0.0002394232,0.0003294976,0.0003123424,0.00009023861,0.0001449997,0.000122716,0.00003313288],"category_scores_gemma":[0.001302784,0.0001381287,0.00005218025,0.0002801457,0.0001791333,0.0001093807,0.00004258118,0.0002695069,7.176952e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001244231,"about_ca_system_score_gemma":0.0001104333,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000009170623,"about_ca_topic_score_gemma":0.000006548302,"domain_scores_codex":[0.9988098,0.00001623316,0.0002772858,0.0002983404,0.0003936711,0.000204718],"domain_scores_gemma":[0.9930515,0.006372841,0.0001195581,0.0001264506,0.0002706845,0.00005901071],"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.00002093561,0.00001330533,0.0000010545,0.00004519852,0.00002357275,5.820254e-7,0.0001180615,0.6614425,0.0003647755,0.2803814,0.000004330997,0.05758422],"study_design_scores_gemma":[0.000261067,0.00005057924,0.00007978503,0.0001164512,0.00004395724,0.00000765973,0.000003232816,0.6701706,0.0001247539,0.3284416,0.0005355043,0.0001648053],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0001218167,0.0001247715,0.9978341,0.0003255178,0.0002184056,0.0004902474,0.000009344768,0.00004720667,0.0008285771],"genre_scores_gemma":[0.01900098,0.00001592366,0.9804845,0.00007844866,0.0001195438,0.00005256,0.0000243035,0.00003004358,0.0001936997],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.05741942,"threshold_uncertainty_score":0.5632724,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W25025378","doi":"10.1007/978-3-662-07969-0_36","title":"Modeling, Simulation and Observations for Freeway Traffic and Pedestrian","year":2003,"lang":"en","type":"book-chapter","venue":"Lecture notes in computational science and engineering","topic":"Traffic control and management","field":"Engineering","cited_by":10,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"La Cité Collégiale","funders":"","keywords":"Pedestrian; Bottleneck; Traffic flow (computer networking); Microscopic traffic flow model; Computer science; Simulation; Flow (mathematics); Space (punctuation); Statistical physics; Engineering; Transport engineering; Physics; Mechanics; Real-time computing; Computer security; Traffic generation model","retraction":null,"screen_n_in":null,"score":{"opus":0.02364427652826209,"gpt":0.2250640388842139,"spread":0.2014197623559519,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001547818,0.0001703197,0.0001513287,0.0002156727,0.00008455677,0.00008148382,0.00005148617,0.0000850997,0.000001225532],"category_scores_gemma":[0.00006985626,0.0001788751,0.00001677046,0.00007458888,0.00004399422,0.0001191927,0.00001804345,0.0001202709,1.24621e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00005407882,"about_ca_system_score_gemma":0.00002221506,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00000251936,"about_ca_topic_score_gemma":0.00003303642,"domain_scores_codex":[0.9992799,0.000001214817,0.000164007,0.0002358154,0.0001588484,0.0001602159],"domain_scores_gemma":[0.9996283,0.000189415,0.00001462703,0.00005393698,0.00005541851,0.00005828267],"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.000001272724,0.000001334668,0.000002512176,0.00008650856,0.000008159313,5.164837e-7,0.00009252957,0.9724278,0.00001778668,0.004222256,0.000002718235,0.02313662],"study_design_scores_gemma":[0.0002403659,0.00001582618,0.0002305847,0.0000600445,0.00001508218,0.000002351585,0.000001440738,0.9918193,5.614927e-7,0.005612737,0.001814398,0.0001873086],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0163703,0.001881999,0.9804956,0.0002306904,0.0001946712,0.0003913245,0.00001414929,0.0001184229,0.0003028419],"genre_scores_gemma":[0.9870242,0.00008376232,0.01268602,0.00005834807,0.00005884304,0.00001351328,0.00001539057,0.00002220219,0.00003776033],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9706539,"threshold_uncertainty_score":0.7294317,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W337437596","doi":"10.1007/978-3-642-57172-5_6","title":"ODE Software that Computes Guaranteed Bounds on the Solution","year":2000,"lang":"en","type":"book-chapter","venue":"Lecture notes in computational science and engineering","topic":"Numerical Methods and Algorithms","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Toronto","funders":"","keywords":"Ode; Ordinary differential equation; Solver; Computer science; Initial value problem; Software; Applied mathematics; Algorithm; Mathematics; Differential equation; Programming language; Mathematical analysis","retraction":null,"screen_n_in":null,"score":{"opus":0.02082231580631103,"gpt":0.2397656669589349,"spread":0.2189433511526238,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005743982,0.0002809895,0.0002392583,0.0002773651,0.0003027424,0.0003430384,0.0007659011,0.0001173866,0.00001542263],"category_scores_gemma":[0.0001771545,0.0002020548,0.00005790474,0.0003389626,0.0002470876,0.0002059134,0.0001783838,0.0004847464,0.00001126931],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001225803,"about_ca_system_score_gemma":0.0001287677,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001190578,"about_ca_topic_score_gemma":0.000001748261,"domain_scores_codex":[0.9980929,0.00001576365,0.0002072423,0.0005585878,0.0007811389,0.0003443502],"domain_scores_gemma":[0.9982405,0.001280419,0.0000707682,0.0002480311,0.00007666255,0.0000835676],"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.000003224207,0.00001064011,0.00001231898,0.00001593811,0.00001016623,0.00001405453,0.0001967629,0.4876934,0.00004951104,0.1515961,0.00002104629,0.3603768],"study_design_scores_gemma":[0.00008336751,0.0000521737,0.0004495248,0.000179748,0.000003140556,0.00002801378,3.706819e-7,0.74449,0.00006038495,0.251304,0.003078344,0.0002709096],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0001401571,0.0003641051,0.9953458,0.001927069,0.0003782916,0.0001496102,0.000004568029,0.0001134182,0.001577034],"genre_scores_gemma":[0.2144402,0.00007723259,0.7821426,0.002769294,0.0003440861,0.0000153555,0.000008248224,0.00003939704,0.0001636121],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.3601059,"threshold_uncertainty_score":0.8239557,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W3204586775","doi":"10.1007/978-3-030-81362-8_10","title":"Efficiently Transforming from Values of a Function on a Sparse Grid to Basis Coefficients","year":2021,"lang":"en","type":"book-chapter","venue":"Lecture notes in computational science and engineering","topic":"Probabilistic and Robust Engineering Design","field":"Decision Sciences","cited_by":7,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Queen's University","funders":"","keywords":"Sparse grid; Mathematics; Basis (linear algebra); Function (biology); Transformation (genetics); Piecewise; Basis function; Combinatorics; Discrete mathematics; Applied mathematics; Mathematical analysis; Geometry","retraction":null,"screen_n_in":null,"score":{"opus":0.03938774249785802,"gpt":0.2752484915521344,"spread":0.2358607490542764,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001281262,0.0002716445,0.0004242541,0.0009083156,0.0001094177,0.0001377499,0.0004105034,0.0001456777,0.00006012816],"category_scores_gemma":[0.002458065,0.0002271256,0.00008071543,0.0008149212,0.0001408965,0.0001098521,0.00009145546,0.0002785637,0.00001400814],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001523812,"about_ca_system_score_gemma":0.0002233529,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001419593,"about_ca_topic_score_gemma":0.00000640056,"domain_scores_codex":[0.9965196,0.00001272786,0.0005501495,0.0007400764,0.0019058,0.0002716708],"domain_scores_gemma":[0.9969388,0.002135473,0.00009907768,0.000254104,0.0004251877,0.0001473864],"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.0000183853,0.0000152831,0.00001567876,0.00001373153,0.000009811582,0.000006641402,0.0003023684,0.9670357,0.000569574,0.006662435,0.00001804432,0.02533236],"study_design_scores_gemma":[0.0003813797,0.0002446756,0.002248498,0.001011467,0.00003832938,0.000009450887,0.00001862406,0.9498981,0.0009314903,0.04185524,0.002777142,0.0005856483],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01313152,0.0003188,0.9839879,0.0001656367,0.0008894229,0.0002336315,0.00005963643,0.00003401727,0.001179385],"genre_scores_gemma":[0.9793105,0.000008573807,0.02008355,0.0001753648,0.0001639428,0.000006834615,0.0000202307,0.00002483101,0.0002062433],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9661789,"threshold_uncertainty_score":0.9261913,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1814820559","doi":"10.1007/978-3-319-05789-7_13","title":"Generating Equidistributed Meshes in 2D via Domain Decomposition","year":2014,"lang":"en","type":"book-chapter","venue":"Lecture notes in computational science and engineering","topic":"Advanced Numerical Analysis Techniques","field":"Engineering","cited_by":7,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Memorial University of Newfoundland","funders":"","keywords":"Equidistributed sequence; Polygon mesh; Decomposition; Domain (mathematical analysis); Computer science; Mathematics; Computer graphics (images); Combinatorics; Chemistry; Mathematical analysis","retraction":null,"screen_n_in":null,"score":{"opus":0.005706388967826693,"gpt":0.2328634928373393,"spread":0.2271571038695126,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0002876258,0.0002622717,0.0003046168,0.0004625024,0.00006072314,0.00005727709,0.0001635544,0.0001461648,0.000009120971],"category_scores_gemma":[0.00007049307,0.000273857,0.00003739311,0.0003328703,0.00008837611,0.0001307789,0.0000571382,0.0003661258,0.000002430924],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0003623939,"about_ca_system_score_gemma":0.0000242337,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000006898143,"about_ca_topic_score_gemma":0.0000207339,"domain_scores_codex":[0.9987063,0.000005076673,0.0003298659,0.000328963,0.000351482,0.0002783456],"domain_scores_gemma":[0.9995021,0.0002192899,0.00004231091,0.0001012925,0.00006521416,0.00006974469],"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.000001038822,0.000001814818,0.00001632836,0.00003430535,0.00000577824,0.000006424147,0.00003488853,0.9664673,0.007999827,0.002270095,0.000002514521,0.0231597],"study_design_scores_gemma":[0.0000796829,0.00001570426,0.0001359145,0.0001556119,0.000005093928,0.0000122227,4.027424e-7,0.9579674,0.000864719,0.04003944,0.0004178514,0.0003059396],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.004818261,0.0004285704,0.9937407,0.00006793085,0.00007127237,0.0001082256,0.000005313435,0.0001876167,0.0005720794],"genre_scores_gemma":[0.8567528,0.00003144811,0.1429522,0.00006224741,0.00009327778,0.00001201358,0.0000542109,0.0000331343,0.000008646877],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8519346,"threshold_uncertainty_score":0.9999714,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W180745420","doi":"10.1007/978-3-642-15337-2_44","title":"The Spectral-Element and Pseudo-Spectral Methods: A Comparative Study","year":2010,"lang":"en","type":"book-chapter","venue":"Lecture notes in computational science and engineering","topic":"Fluid Dynamics and Turbulent Flows","field":"Engineering","cited_by":6,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Ottawa","funders":"","keywords":"Spectral element method; Turbulence; Code (set theory); Element (criminal law); Spectral analysis; Spectral method; Physics; Finite element method; Mechanics; Mathematics; Computer science; Extended finite element method; Mathematical analysis; Set (abstract data type); Quantum mechanics","retraction":null,"screen_n_in":null,"score":{"opus":0.01327589709204965,"gpt":0.2664174855087761,"spread":0.2531415884167265,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005847958,0.0002883587,0.0002572178,0.0002083935,0.0002144174,0.0002033655,0.0002047199,0.00009540906,0.000008771203],"category_scores_gemma":[0.00004319707,0.0002263117,0.00002946663,0.0001397228,0.0001860584,0.00009035986,0.00007992037,0.0006489377,0.000001718616],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001116798,"about_ca_system_score_gemma":0.00004605187,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000007989452,"about_ca_topic_score_gemma":0.00009715505,"domain_scores_codex":[0.9987369,0.000007063103,0.0002557775,0.0003329988,0.0003658931,0.0003013198],"domain_scores_gemma":[0.9992033,0.0004782788,0.00003061397,0.0001349886,0.00006432374,0.00008855473],"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.000002710857,0.000006731802,0.00003520582,0.00001838111,0.00003221881,0.000006246627,0.0007051155,0.9743254,0.0006023191,0.0177997,0.000003293849,0.00646264],"study_design_scores_gemma":[0.0001711175,0.00005417127,0.001962739,0.00003761452,0.00001351537,0.00001742983,0.000006634308,0.9782743,0.00006124807,0.01803688,0.001089176,0.0002751205],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2498735,0.008481087,0.7189912,0.0009232073,0.003437611,0.002857761,0.00005223528,0.0005665193,0.01481685],"genre_scores_gemma":[0.9481049,0.0001537146,0.05141971,0.00002708027,0.0001568179,0.00002015423,0.000006441245,0.00003509225,0.00007608261],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.6982314,"threshold_uncertainty_score":0.9228724,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W3094161168","doi":"10.1007/978-3-030-56750-7_17","title":"Fully Discrete Schwarz Waveform Relaxation on Two Bounded Overlapping Subdomains","year":2020,"lang":"en","type":"book-chapter","venue":"Lecture notes in computational science and engineering","topic":"Advanced Numerical Methods in Computational Mathematics","field":"Engineering","cited_by":5,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Memorial University of Newfoundland","funders":"","keywords":"Schwarz alternating method; Waveform; Bounded function; Relaxation (psychology); Additive Schwarz method; Partial differential equation; Domain decomposition methods; Mathematics; Window (computing); Discrete time and continuous time; Parallelism (grammar); Algorithm; Mathematical analysis; Computer science; Applied mathematics; Parallel computing; Physics; Telecommunications","retraction":null,"screen_n_in":null,"score":{"opus":0.01740629637152355,"gpt":0.2648287025757347,"spread":0.2474224062042111,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0003119894,0.0004048122,0.0003799516,0.0004031152,0.0001383115,0.0001177168,0.0002478747,0.0001444104,0.00001107863],"category_scores_gemma":[0.0007485437,0.0004093123,0.00005995896,0.0003828607,0.0001677219,0.0002511482,0.00008904222,0.0007140554,0.00001667271],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0005515213,"about_ca_system_score_gemma":0.00009311142,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000001229702,"about_ca_topic_score_gemma":0.000001752506,"domain_scores_codex":[0.9979337,0.000006847566,0.0004283583,0.000473254,0.0008295957,0.0003282031],"domain_scores_gemma":[0.9983519,0.001128149,0.00009721832,0.0001529254,0.000116742,0.0001530566],"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.000004822593,0.000002633561,0.000002582552,0.0001046095,0.00001391289,0.000009908918,0.0001203441,0.8665492,0.000263466,0.1196203,0.00000334932,0.01330488],"study_design_scores_gemma":[0.0001531035,0.00003723369,0.0001046157,0.0002653548,0.000007667822,0.00001461356,0.000001305363,0.6731611,0.00008432473,0.3252175,0.0006227369,0.0003304149],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0007726599,0.0001995809,0.989042,0.0003629992,0.0004318017,0.0002604987,0.00001513929,0.0002860651,0.008629232],"genre_scores_gemma":[0.5415944,0.00003520887,0.4575014,0.0003290897,0.0003328605,0.00001620878,0.00003542879,0.0001095924,0.0000458592],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.5408217,"threshold_uncertainty_score":0.9998358,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2408295797","doi":"10.1007/978-3-642-35275-1_21","title":"Domain Decomposition Methods of Stochastic PDEs","year":2013,"lang":"en","type":"book-chapter","venue":"Lecture notes in computational science and engineering","topic":"Probabilistic and Robust Engineering Design","field":"Decision Sciences","cited_by":5,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Carleton University","funders":"","keywords":"Domain decomposition methods; Decomposition; Domain (mathematical analysis); Computer science; Applied mathematics; Mathematics; Mathematical optimization; Chemistry; Engineering; Mathematical analysis; Structural engineering","retraction":null,"screen_n_in":null,"score":{"opus":0.04186285457208082,"gpt":0.3462727279487045,"spread":0.3044098733766236,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002432618,0.0002357822,0.0003979515,0.0008154272,0.00008289208,0.0001254731,0.0004574584,0.0001587174,0.0000933371],"category_scores_gemma":[0.001790224,0.0001882989,0.00005984588,0.0004228233,0.0003155052,0.0001998934,0.0001268208,0.000278086,0.00001494252],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001209386,"about_ca_system_score_gemma":0.0001725427,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000006334991,"about_ca_topic_score_gemma":0.000001316902,"domain_scores_codex":[0.9975673,0.0000199559,0.0005582379,0.0004943706,0.001123853,0.0002362677],"domain_scores_gemma":[0.9955958,0.003501571,0.0001576972,0.0002120725,0.0004262668,0.000106645],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00000237848,0.000003958285,0.000002701978,0.00001771297,0.000005773134,0.00000146708,0.0001166792,0.8980033,0.000833565,0.08006176,0.00001461752,0.02093607],"study_design_scores_gemma":[0.00008430269,0.00003134602,0.0003570193,0.0001423209,0.000006597172,0.0000180607,0.000002184312,0.4912118,0.00006127817,0.5075161,0.0003742402,0.0001947026],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0005585243,0.0005158209,0.9963995,0.0001398864,0.0002334001,0.0001837991,0.000006697297,0.00002820936,0.001934207],"genre_scores_gemma":[0.3820817,0.000005010968,0.617512,0.00004183332,0.00008178472,0.000008084558,0.000005081843,0.00002038604,0.0002441292],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.4274544,"threshold_uncertainty_score":0.7678606,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2898585087","doi":"10.1007/978-3-030-39647-3_49","title":"Sparse Approximation of Multivariate Functions from Small Datasets Via Weighted Orthogonal Matching Pursuit","year":2020,"lang":"en","type":"book-chapter","venue":"Lecture notes in computational science and engineering","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":4,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Simon Fraser University","funders":"","keywords":"Matching pursuit; Pointwise; Greedy algorithm; Multivariate statistics; Extension (predicate logic); Matching (statistics); Mathematics; Pattern recognition (psychology); Algorithm; Minification; Computer science; Selection (genetic algorithm); Mathematical optimization; Artificial intelligence; Compressed sensing; Statistics","retraction":null,"screen_n_in":null,"score":{"opus":0.01678031587194484,"gpt":0.2155749162761791,"spread":0.1987946004042342,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0001323144,0.0002632905,0.0002833938,0.0002961467,0.00006400626,0.00006335271,0.0002136824,0.00014616,0.00001496632],"category_scores_gemma":[0.00004850921,0.0002760772,0.00003977269,0.0001889277,0.00008778922,0.0001518146,0.0001013483,0.0003833539,0.000003704698],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00008374423,"about_ca_system_score_gemma":0.00005140542,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00004200941,"about_ca_topic_score_gemma":0.00002107194,"domain_scores_codex":[0.9987751,0.000004869725,0.0003095695,0.0003429726,0.0003867385,0.0001807029],"domain_scores_gemma":[0.999381,0.0002340598,0.00007355343,0.0001460541,0.00008739313,0.00007792622],"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.000005360666,0.000004916261,0.000007674363,0.00004160956,0.00003166106,0.000009699083,0.0001320681,0.9686449,0.01361954,0.00383127,0.0000149965,0.01365637],"study_design_scores_gemma":[0.0001227063,0.00001598746,0.0004720849,0.0002899379,0.00002373319,0.000009054744,0.000001055037,0.948044,0.00171579,0.0484638,0.0005554871,0.0002863461],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.005540777,0.0003212093,0.9924744,0.00006826665,0.0002461204,0.0001751495,0.0001685416,0.0002456033,0.0007598759],"genre_scores_gemma":[0.90267,0.00002027191,0.09648152,0.00005318926,0.0001405373,0.000006022052,0.0005776621,0.00004364427,0.000007109787],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8971293,"threshold_uncertainty_score":0.9999691,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1811923464","doi":"10.1007/978-3-319-18827-0_9","title":"A Stochastic Domain Decomposition Method for Time Dependent Mesh Generation","year":2016,"lang":"en","type":"book-chapter","venue":"Lecture notes in computational science and engineering","topic":"Computer Graphics and Visualization Techniques","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Memorial University of Newfoundland","funders":"","keywords":"Domain decomposition methods; Decomposition; Computer science; Domain (mathematical analysis); Mathematical optimization; Mathematics; Engineering; Chemistry; Structural engineering; Mathematical analysis","retraction":null,"screen_n_in":null,"score":{"opus":0.01276623286790985,"gpt":0.2878334940297469,"spread":0.2750672611618371,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007673423,0.0002332466,0.0002183466,0.0006495371,0.0001673048,0.0002614168,0.0004094438,0.0001334897,0.000004838271],"category_scores_gemma":[0.0000662431,0.0002121957,0.00005163171,0.0002035981,0.00005416014,0.0003135619,0.0001701931,0.0001289441,0.000002291586],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001678536,"about_ca_system_score_gemma":0.0001540489,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000001712143,"about_ca_topic_score_gemma":0.000003140945,"domain_scores_codex":[0.9984009,0.00001075246,0.0002829852,0.0005873805,0.0004830648,0.0002348695],"domain_scores_gemma":[0.9989122,0.0004404031,0.00010376,0.0001762108,0.0002847774,0.00008270449],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000002026324,0.000006223198,5.120652e-7,0.00001892981,0.000008916964,0.000001821629,0.0001135124,0.1479514,0.002163014,0.8086463,0.00001603132,0.04107141],"study_design_scores_gemma":[0.0001262704,0.00004761646,0.000009010189,0.00009556239,0.000003595451,0.00001868388,5.968644e-8,0.7395147,0.0002940554,0.2594635,0.0002191331,0.0002078325],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0000349889,0.0001200601,0.9985415,0.0003785417,0.0002064704,0.0003544125,0.00001103976,0.0001331701,0.0002198342],"genre_scores_gemma":[0.06887461,0.00001472907,0.9301741,0.0003533883,0.0003199412,0.00005744716,0.0000361588,0.00003309665,0.000136567],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.5915633,"threshold_uncertainty_score":0.8653091,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W219254201","doi":"10.1007/978-3-540-75199-1_42","title":"Optimized Schwarz Methods with the Yin-Yang Grid for Shallow Water Equations","year":2008,"lang":"en","type":"book-chapter","venue":"Lecture notes in computational science and engineering","topic":"Advanced Numerical Methods in Computational Mathematics","field":"Engineering","cited_by":4,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"GLS Industries (Canada); Environment and Climate Change Canada","funders":"","keywords":"Schwarz alternating method; Grid; Shallow water equations; Convergence (economics); Additive Schwarz method; Applied mathematics; Computer science; Mathematics; Mathematical optimization; Mathematical analysis; Geometry; Physics; Finite element method; Domain decomposition methods","retraction":null,"screen_n_in":null,"score":{"opus":0.0297035001646248,"gpt":0.2983675935814013,"spread":0.2686640934167765,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006355816,0.0003408387,0.0003491314,0.0002856076,0.0002363819,0.00007746382,0.000296186,0.0001251549,0.00001105078],"category_scores_gemma":[0.0004761768,0.0002234028,0.00005963913,0.0002204499,0.0002703637,0.0001681791,0.00007163416,0.0004293078,0.000002913429],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001863212,"about_ca_system_score_gemma":0.00007340107,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":8.033564e-7,"about_ca_topic_score_gemma":9.974045e-7,"domain_scores_codex":[0.998478,0.00001183979,0.0003103944,0.0003569386,0.0004869005,0.0003559395],"domain_scores_gemma":[0.995427,0.004042179,0.00005095622,0.0001669785,0.0002307698,0.00008211971],"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.000005433536,0.000003087187,3.038369e-7,0.00007542904,0.0000261426,0.000002613533,0.0002678043,0.9744136,0.0001697847,0.005972872,0.00001394526,0.01904903],"study_design_scores_gemma":[0.0002180605,0.00003472144,0.00001253779,0.0001129437,0.00002063189,0.00003445807,0.000002159334,0.9449956,0.0002899602,0.0504358,0.003508247,0.0003348881],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0000456942,0.0004853644,0.9970541,0.0005875466,0.0002949173,0.0004445867,0.00001681335,0.0001501383,0.0009208168],"genre_scores_gemma":[0.008766821,0.00004002011,0.990599,0.0001410829,0.0002042846,0.00007956655,0.00003098926,0.00007613685,0.0000621331],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.04446293,"threshold_uncertainty_score":0.9110103,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W134793575","doi":"10.1007/3-540-28438-9_7","title":"Computing Sparse Jacobian Matrices Optimally","year":2006,"lang":"en","type":"book-chapter","venue":"Lecture notes in computational science and engineering","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Lethbridge","funders":"","keywords":"Jacobian matrix and determinant; Row; Matrix (chemical analysis); Sparse matrix; Computation; A priori and a posteriori; Row and column spaces; Algorithm; Mathematics; Computer science; Mathematical optimization; Applied mathematics","retraction":null,"screen_n_in":null,"score":{"opus":0.008076137272474655,"gpt":0.2140298548552145,"spread":0.2059537175827398,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.000656306,0.0003030697,0.0002693742,0.0005691635,0.0002002827,0.0003749868,0.0007788941,0.000138254,0.000009270488],"category_scores_gemma":[0.00007902501,0.0002994521,0.00005002646,0.0004069433,0.0001574956,0.0003955981,0.0003393702,0.0003944025,0.00001133924],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001243155,"about_ca_system_score_gemma":0.0001928124,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001387012,"about_ca_topic_score_gemma":0.000003523464,"domain_scores_codex":[0.9980223,0.000007456046,0.0003177025,0.0006286696,0.0006412542,0.0003826309],"domain_scores_gemma":[0.9990034,0.000427791,0.0001142934,0.0002080454,0.0001405821,0.0001058839],"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":[8.342474e-7,0.000004800014,0.0000107637,0.00003303606,0.000004148862,0.00003057859,0.00007840485,0.8437666,0.00004155904,0.1300016,0.00001426074,0.02601337],"study_design_scores_gemma":[0.0001140216,0.00002431458,0.0003573628,0.0001747863,0.000004469377,0.00006383405,3.985667e-7,0.9360324,0.00004256109,0.06133416,0.001479784,0.0003719061],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0005390566,0.0006829345,0.987636,0.00029004,0.0003620845,0.0001370559,0.000004360538,0.0001468459,0.01020162],"genre_scores_gemma":[0.5176363,0.00002844693,0.4810755,0.0002919791,0.0004270358,0.000003128966,0.00001471732,0.00003586649,0.0004869848],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.5170972,"threshold_uncertainty_score":0.9999458,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W205177058","doi":"10.1007/978-3-642-11304-8_28","title":"Recent Advances in Schwarz Waveform Moving Mesh Methods – A New Moving Subdomain Method","year":2010,"lang":"en","type":"book-chapter","venue":"Lecture notes in computational science and engineering","topic":"Advanced Numerical Methods in Computational Mathematics","field":"Engineering","cited_by":3,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Memorial University of Newfoundland","funders":"","keywords":"Domain decomposition methods; Partial differential equation; Computer science; Schwarz alternating method; Waveform; Domain (mathematical analysis); Relaxation (psychology); Coupling (piping); Algorithm; Mathematical optimization; Mathematics; Finite element method; Mathematical analysis; Physics; Mechanical engineering; Engineering","retraction":null,"screen_n_in":null,"score":{"opus":0.01735652974286154,"gpt":0.3209278718059628,"spread":0.3035713420631012,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.001690886,0.0005290419,0.0006297069,0.0009199809,0.0001082169,0.0001057821,0.0004170902,0.0003280182,0.00003655666],"category_scores_gemma":[0.00206416,0.0005414698,0.00006534137,0.000739814,0.0001590133,0.0005336386,0.0001763415,0.001412824,0.000003602005],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0005583529,"about_ca_system_score_gemma":0.000220927,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000003954526,"about_ca_topic_score_gemma":0.00001913966,"domain_scores_codex":[0.9973595,0.00002666484,0.0006905213,0.0006302625,0.0007381425,0.0005549379],"domain_scores_gemma":[0.9957072,0.00357029,0.0001241385,0.0002243088,0.0001567831,0.0002173151],"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.000002281883,0.000003003971,0.000003121183,0.00008667281,0.000005621033,0.000006733541,0.0001389989,0.5791951,0.0006390448,0.0109027,6.275831e-7,0.4090161],"study_design_scores_gemma":[0.0001423117,0.0000146668,0.00005247433,0.0002743669,0.000007164808,0.00003556495,0.000002767858,0.6229897,0.0004481259,0.3688836,0.006744097,0.0004052194],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.00008005201,0.005829135,0.9896211,0.0001923521,0.0007046621,0.0002992708,0.000005496862,0.0002019072,0.00306602],"genre_scores_gemma":[0.001551744,0.0009905259,0.9969628,0.000108694,0.0002192082,0.00001676292,0.00000825917,0.00009531505,0.00004663963],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.4086109,"threshold_uncertainty_score":0.9997037,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W250981282","doi":"10.1007/978-3-642-59721-3_28","title":"Ten Years Using Discontinuous Galerkin Methods for Polymer Processing Problems","year":2000,"lang":"en","type":"book-chapter","venue":"Lecture notes in computational science and engineering","topic":"Rheology and Fluid Dynamics Studies","field":"Chemical Engineering","cited_by":2,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Polytechnique Montréal","funders":"","keywords":"Extrusion; Nonlinear system; Molding (decorative); Swell; Viscoelasticity; Galerkin method; Process (computing); Computer simulation; Polymer; Computer science; Materials science; Applied mathematics; Mathematical optimization; Mechanics; Mathematics; Mechanical engineering; Algorithm; Engineering; Composite material; Simulation; Physics; Thermodynamics","retraction":null,"screen_n_in":null,"score":{"opus":0.01553520030389008,"gpt":0.278839933548532,"spread":0.2633047332446419,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.000332905,0.0002535212,0.0003136194,0.0002879007,0.0001281212,0.00005340566,0.0001688587,0.000191156,0.00001295277],"category_scores_gemma":[0.0001364748,0.0002499032,0.00005144365,0.0001554081,0.0002085533,0.0001535567,0.00007191118,0.0003257546,8.895141e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001243896,"about_ca_system_score_gemma":0.0000925658,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001027164,"about_ca_topic_score_gemma":0.000003249573,"domain_scores_codex":[0.9987786,0.000003646175,0.0002648861,0.0004170213,0.0001966244,0.0003391965],"domain_scores_gemma":[0.9993998,0.0003257932,0.0000568157,0.00008178126,0.00007699018,0.00005883072],"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.000005322231,0.000003837266,0.00001404893,0.00009643693,0.00001793739,0.000002431268,0.0001998832,0.917445,0.006371208,0.01053157,4.485146e-7,0.06531189],"study_design_scores_gemma":[0.0001503555,0.00001418433,0.00008582145,0.0002737669,0.00001898928,0.00002214281,0.000001013188,0.9847732,0.0001316197,0.01390885,0.0003185254,0.0003015351],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.000639964,0.003855182,0.9938519,0.00007082364,0.0001314334,0.0001991873,0.00001051544,0.00006239909,0.001178575],"genre_scores_gemma":[0.3000274,0.0001267308,0.6965575,0.0001760895,0.0004331378,0.00005201134,0.00004258691,0.000139585,0.002444955],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.2993875,"threshold_uncertainty_score":0.9999954,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4393009367","doi":"10.1007/978-3-031-40594-5_17","title":"Optimally Convergent Isoparametric $$P^2$$ Mesh Generation","year":2024,"lang":"en","type":"book-chapter","venue":"Lecture notes in computational science and engineering","topic":"Advanced Numerical Analysis Techniques","field":"Engineering","cited_by":2,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Polytechnique Montréal","funders":"","keywords":"Mathematics; Computer science","retraction":null,"screen_n_in":null,"score":{"opus":0.01139031522515247,"gpt":0.2342620888581335,"spread":0.222871773632981,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0001704879,0.0002661629,0.0002470541,0.00079207,0.00004612551,0.00009861544,0.0001577142,0.000132398,0.00003178191],"category_scores_gemma":[0.00007808892,0.0002621525,0.0000500752,0.0005455626,0.00009261847,0.0001530846,0.00006428899,0.0003941504,0.0000174572],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0003199083,"about_ca_system_score_gemma":0.00004266567,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000002420945,"about_ca_topic_score_gemma":0.000004727125,"domain_scores_codex":[0.9986833,0.000001380255,0.0002661651,0.0003709241,0.0004521637,0.0002260872],"domain_scores_gemma":[0.9995725,0.0001201535,0.00002541395,0.0001054864,0.00009292782,0.00008357102],"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":[4.50582e-7,0.000001552035,0.000002088185,0.00004887886,0.00001629957,0.000009633895,0.00002420341,0.9710134,0.001128646,0.0165235,0.00002611422,0.01120518],"study_design_scores_gemma":[0.00003269281,0.00001659811,0.00002000039,0.00007773224,0.00001709231,0.00001169431,2.161416e-7,0.9638901,0.0005462871,0.0325091,0.002593223,0.0002852121],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0005663575,0.003454991,0.9891973,0.0001358934,0.0003681648,0.0001643219,0.00000886037,0.0004641574,0.005640003],"genre_scores_gemma":[0.9232385,0.0004306138,0.07552218,0.00009015054,0.0002511069,0.00001910407,0.00003797021,0.00007294679,0.0003374159],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9226722,"threshold_uncertainty_score":0.9999831,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2964558805","doi":"10.1007/978-3-030-56750-7_53","title":"Domain Decomposition for the Closest Point Method","year":2020,"lang":"en","type":"preprint","venue":"Lecture notes in computational science and engineering","topic":"Advanced Numerical Methods in Computational Mathematics","field":"Engineering","cited_by":2,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Memorial University of Newfoundland; Simon Fraser University","funders":"","keywords":"Discretization; Domain decomposition methods; Mathematics; Domain (mathematical analysis); Laplace transform; Laplace's equation; Elliptic operator; Helmholtz equation; Eigenvalues and eigenvectors; Mathematical analysis; Eigenfunction; Constant (computer programming); Boundary value problem; Pure mathematics; Physics; Computer science; Finite element method","retraction":null,"screen_n_in":null,"score":{"opus":0.02441710157014513,"gpt":0.3401901139027217,"spread":0.3157730123325766,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007836075,0.0002600126,0.0002781433,0.0001720286,0.0001348071,0.0001345201,0.0003600082,0.0001075298,0.000002073032],"category_scores_gemma":[0.000784728,0.0002190008,0.00005987013,0.0005647177,0.0001041565,0.0001087081,0.0002185446,0.00053678,0.000001055681],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002260492,"about_ca_system_score_gemma":0.0000815826,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00000258042,"about_ca_topic_score_gemma":0.000001099981,"domain_scores_codex":[0.9985636,0.0000206572,0.000331226,0.0003871402,0.0004153482,0.000282046],"domain_scores_gemma":[0.994856,0.004718208,0.00005627546,0.0001456018,0.0001365315,0.00008740521],"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.000003781238,0.000005159777,0.000004516548,0.0002321861,0.00001576969,0.000001389268,0.0003189083,0.9678147,0.0008963183,0.005952659,0.000007853917,0.0247468],"study_design_scores_gemma":[0.00008375662,0.000011547,0.0002908949,0.00007180047,0.000008673456,0.000009528466,0.000004792235,0.6459965,0.00031493,0.3528896,0.0001553211,0.0001626524],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.001463454,0.0005161545,0.9941227,0.002533484,0.0006416585,0.0005065242,0.00002124741,0.0001762979,0.00001842584],"genre_scores_gemma":[0.2928757,0.00001464855,0.706598,0.000216041,0.0001658598,0.0000912248,0.00001101608,0.00002749773,5.814204e-8],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.3469369,"threshold_uncertainty_score":0.8930592,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4391111829","doi":"10.1007/978-3-031-50769-4_44","title":"Cyclic and Chaotic Examples in Schwarz-Preconditioned Newton Methods","year":2024,"lang":"en","type":"book-chapter","venue":"Lecture notes in computational science and engineering","topic":"Advanced Numerical Methods in Computational Mathematics","field":"Engineering","cited_by":1,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Université Laval","funders":"","keywords":"Schwarz alternating method; Chaotic; Applied mathematics; Mathematics; Computer science; Physics; Artificial intelligence; Domain decomposition methods; Thermodynamics","retraction":null,"screen_n_in":null,"score":{"opus":0.02541006281528096,"gpt":0.3114487116093854,"spread":0.2860386487941045,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0005531823,0.0003174673,0.0003619769,0.0007694038,0.00005125368,0.00009743301,0.0001515857,0.0001590871,0.0000143541],"category_scores_gemma":[0.0004577254,0.0003287097,0.00003032543,0.0003895568,0.0001816716,0.0001853558,0.0001009634,0.000570499,0.000005314909],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002421065,"about_ca_system_score_gemma":0.00004613437,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000002650484,"about_ca_topic_score_gemma":0.00000426269,"domain_scores_codex":[0.9985644,0.00000951083,0.0003815239,0.0004296181,0.0003372878,0.0002777141],"domain_scores_gemma":[0.997676,0.002028577,0.00003838807,0.0001069297,0.00005462643,0.00009545217],"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":[9.793223e-7,0.000002381385,0.000004997516,0.000272527,0.00001002614,0.000009649078,0.000165617,0.9109336,0.0003606144,0.04785458,0.000001834246,0.04038321],"study_design_scores_gemma":[0.00006199457,0.0000102401,0.0002293471,0.0003141708,0.000006546878,0.00002819983,0.000001546842,0.5535426,0.00007304838,0.4450617,0.0004562548,0.0002143948],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.001386028,0.003090584,0.9923286,0.0002257738,0.0004294482,0.0002115238,0.00001063487,0.0001853,0.002132094],"genre_scores_gemma":[0.1002069,0.0001832837,0.8991678,0.00008045189,0.0001359779,0.00002413814,0.00001481798,0.00008585842,0.0001008413],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.3972071,"threshold_uncertainty_score":0.9999165,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4327511299","doi":"10.1007/978-3-030-95025-5_73","title":"A Multirate Accelerated Schwarz Waveform Relaxation Method","year":2022,"lang":"en","type":"book-chapter","venue":"Lecture notes in computational science and engineering","topic":"Advanced Numerical Methods in Computational Mathematics","field":"Engineering","cited_by":1,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Memorial University of Newfoundland","funders":"","keywords":"Schwarz alternating method; Waveform; Additive Schwarz method; Partial differential equation; Relaxation (psychology); Domain decomposition methods; Time domain; Iterative method; Mathematics; Applied mathematics; Computer science; Algorithm; Domain (mathematical analysis); Mathematical optimization; Mathematical analysis; Physics; Finite element method","retraction":null,"screen_n_in":null,"score":{"opus":0.02915889415817292,"gpt":0.2944392676581979,"spread":0.265280373500025,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0006470204,0.0003502081,0.0003477818,0.000577424,0.00016081,0.00007944486,0.0002627375,0.0001449813,0.00008886008],"category_scores_gemma":[0.0005806464,0.000368469,0.00004610711,0.0005290353,0.00009777437,0.0003018831,0.0001378008,0.0007678101,0.000006662969],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0006051188,"about_ca_system_score_gemma":0.0001017449,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000002979249,"about_ca_topic_score_gemma":0.000001318856,"domain_scores_codex":[0.9980732,0.00001147996,0.0004298945,0.0004245454,0.0007441699,0.0003167017],"domain_scores_gemma":[0.9982129,0.001279046,0.00009438953,0.0001480257,0.0001626099,0.0001030237],"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.000002512757,0.000003801656,0.000001672637,0.00008599847,0.00001351756,0.000007999845,0.0001366503,0.9147985,0.0002745976,0.02527389,0.000003658861,0.05939717],"study_design_scores_gemma":[0.0001281653,0.00002297439,0.00007380427,0.00008649129,0.000008835918,0.00003259991,0.000001518208,0.845269,0.0001204645,0.1512052,0.002703688,0.000347279],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0002132575,0.0003846002,0.9931148,0.0001252578,0.0004349737,0.0002559424,0.00001641175,0.0002762497,0.005178554],"genre_scores_gemma":[0.05529983,0.00006912361,0.9440888,0.0001317897,0.0001220396,0.00003771578,0.00004372386,0.0001016406,0.0001053971],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.1259313,"threshold_uncertainty_score":0.9998767,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W3141613148","doi":"10.1007/978-3-030-95025-5_41","title":"A Nonlinear Optimized Schwarz Preconditioner for Elliptic Optimal Control Problems","year":2022,"lang":"en","type":"book-chapter","venue":"Lecture notes in computational science and engineering","topic":"Advanced Numerical Methods in Computational Mathematics","field":"Engineering","cited_by":1,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Université Laval","funders":"Agence Nationale de la Recherche","keywords":"Schwarz alternating method; Preconditioner; Additive Schwarz method; Nonlinear system; Section (typography); Mathematics; Applied mathematics; Control (management); Computer science; Mathematical optimization; Control theory (sociology); Engineering; Domain decomposition methods; Structural engineering; Iterative method; Physics; Artificial intelligence; Finite element method","retraction":null,"screen_n_in":null,"score":{"opus":0.01621946726298982,"gpt":0.2570629610942613,"spread":0.2408434938312715,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0004815161,0.000344862,0.000421987,0.0004159947,0.0001545874,0.00007375733,0.0002507496,0.0001261547,0.0000736448],"category_scores_gemma":[0.000463119,0.0003674006,0.00007537124,0.0002315313,0.0001470173,0.0002142069,0.00006459248,0.0004968732,0.000003226567],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0003350915,"about_ca_system_score_gemma":0.0001037352,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":5.348615e-7,"about_ca_topic_score_gemma":2.759505e-7,"domain_scores_codex":[0.9982473,0.000007003696,0.0004340856,0.00041905,0.0005465667,0.0003459615],"domain_scores_gemma":[0.9975008,0.002012684,0.00008300779,0.0001288534,0.0001694769,0.0001051121],"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.000007574185,0.000008141086,5.692762e-7,0.0002110371,0.00002899599,0.000002686864,0.00008023266,0.9817251,0.00009748346,0.01279958,0.000006703147,0.005031884],"study_design_scores_gemma":[0.0004844986,0.00005731912,0.000005752984,0.0001158737,0.00002143398,0.00002512954,9.232878e-7,0.914084,0.00003261635,0.08033382,0.004464271,0.0003743622],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0001288785,0.0006012147,0.9969361,0.0001525552,0.0003973101,0.0006790175,0.0000986571,0.0001954648,0.000810769],"genre_scores_gemma":[0.02176257,0.0000445087,0.9774503,0.0001218503,0.0001932508,0.0001883704,0.00006990185,0.0001020314,0.00006724609],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.06764112,"threshold_uncertainty_score":0.9998778,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W77917621","doi":"10.1007/978-3-662-07969-0_32","title":"Microscopic Parameters and Macroscopic Features of Traffic Flow","year":2003,"lang":"en","type":"book-chapter","venue":"Lecture notes in computational science and engineering","topic":"Traffic control and management","field":"Engineering","cited_by":1,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Simon Fraser University","funders":"","keywords":"Inertia; Statistical physics; Microscopic traffic flow model; Traffic flow (computer networking); Flow (mathematics); Mechanics; Computer science; Classical mechanics; Mathematics; Physics; Statistics; Traffic generation model","retraction":null,"screen_n_in":null,"score":{"opus":0.005510851013002428,"gpt":0.1952745364254691,"spread":0.1897636854124667,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001198316,0.0002060496,0.0002344076,0.000274758,0.00004016938,0.00004879752,0.00009751576,0.00009299105,0.000004497765],"category_scores_gemma":[0.00003126601,0.0002045155,0.00002429166,0.0001057142,0.0001297468,0.00006189282,0.00002846622,0.0002039313,5.04725e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0000620935,"about_ca_system_score_gemma":0.00002458226,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000002194262,"about_ca_topic_score_gemma":0.00001456147,"domain_scores_codex":[0.9991534,0.000001879993,0.0001807104,0.0002377841,0.0002271671,0.0001990307],"domain_scores_gemma":[0.9996895,0.0001185388,0.00002398182,0.00007893195,0.00003235911,0.00005668527],"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.000001179329,0.000001894387,0.000003618776,0.0001591497,0.00001450484,0.000003178425,0.0001072583,0.9519792,0.0003067703,0.0008739014,0.00001467146,0.04653468],"study_design_scores_gemma":[0.0006000607,0.0000651103,0.003705539,0.0005148976,0.00004050447,0.00002831695,0.00000371775,0.9883461,0.0002439716,0.003262061,0.002604312,0.0005853819],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.4518098,0.05665653,0.4659964,0.001355446,0.005039739,0.002840137,0.000152047,0.001085339,0.0150645],"genre_scores_gemma":[0.977191,0.0001896527,0.02239751,0.00007660963,0.00002618224,0.000005874715,0.000006725406,0.00002618476,0.00008020124],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.5253812,"threshold_uncertainty_score":0.8339902,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4415755779","doi":"10.1007/978-3-031-76988-7_4","title":"Space-Time Spectral Methods for Linear and Nonlinear PDEs","year":2025,"lang":"en","type":"book-chapter","venue":"Lecture notes in computational science and engineering","topic":"Numerical methods for differential equations","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo; University of Manitoba; University of British Columbia","funders":"","keywords":"Discretization; Spectral method; Spectral space; Convergence (economics); Nonlinear system; Finite difference method; Spacetime; Spectral analysis; Boundary (topology)","retraction":null,"screen_n_in":null,"score":{"opus":0.03522261287328204,"gpt":0.3649885593643216,"spread":0.3297659464910396,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006804166,0.0002221765,0.0003389379,0.0003484538,0.0001130071,0.00006342785,0.0001339113,0.0001365863,0.00001536085],"category_scores_gemma":[0.002743803,0.0002064634,0.00005215522,0.0001797498,0.0001618041,0.00007546502,0.00008941076,0.0002605928,8.845002e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00008724016,"about_ca_system_score_gemma":0.0001245731,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000003313739,"about_ca_topic_score_gemma":0.000002181748,"domain_scores_codex":[0.9989263,0.0000124271,0.0002484372,0.0003638255,0.000226004,0.0002230398],"domain_scores_gemma":[0.9957445,0.003871365,0.00006704324,0.0001024291,0.0001378412,0.00007679252],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00002136865,0.00003188093,0.00001055609,0.000678444,0.00008224823,0.000002885481,0.0003519974,0.08981229,0.004135247,0.556574,0.00001681833,0.3482823],"study_design_scores_gemma":[0.00009364168,0.000025696,0.00002258004,0.0001203575,0.00002423617,0.000003401159,3.734968e-7,0.4417918,0.0002571316,0.556582,0.0009337861,0.0001449946],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0001928286,0.0002252625,0.9977786,0.0004595773,0.0001549733,0.0003033071,0.00002108664,0.00005085123,0.0008135457],"genre_scores_gemma":[0.0005915856,0.00001427712,0.9985318,0.00004872329,0.000135002,0.00001112996,0.00001154618,0.0000228698,0.0006331333],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.3519796,"threshold_uncertainty_score":0.8419334,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W3197915270","doi":"10.1007/978-3-030-95025-5_74","title":"A Convergence Analysis of the Parallel Schwarz Solution of the Continuous Closest Point Method","year":2022,"lang":"en","type":"book-chapter","venue":"Lecture notes in computational science and engineering","topic":"Advanced Numerical Methods in Computational Mathematics","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Memorial University of Newfoundland; Simon Fraser University","funders":"","keywords":"Discretization; Eigenvalues and eigenvectors; Laplace transform; Mathematics; Convergence (economics); Mathematical analysis; Laplace's equation; Applied mathematics; Point (geometry); Geometry; Partial differential equation; Physics","retraction":null,"screen_n_in":null,"score":{"opus":0.01498403758696438,"gpt":0.2678411094865135,"spread":0.2528570718995491,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005964725,0.000199136,0.0004066226,0.000321397,0.00009893309,0.00001275848,0.0004520607,0.00007677908,0.00003204692],"category_scores_gemma":[0.000652542,0.0001464777,0.000143965,0.001150908,0.0002581972,0.00008100642,0.0002246672,0.0004090422,2.117573e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001787833,"about_ca_system_score_gemma":0.00009074948,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00000776636,"about_ca_topic_score_gemma":0.000004638545,"domain_scores_codex":[0.9983749,0.00002511733,0.0004477405,0.0002402611,0.0007406821,0.0001712684],"domain_scores_gemma":[0.9978912,0.001503998,0.0001863933,0.0002265982,0.0001576555,0.00003413668],"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.000001762206,0.000004690909,0.00006608918,0.00007658559,0.00008113337,4.203872e-7,0.0001665486,0.9630656,0.0004038516,0.03296014,0.000001661079,0.003171475],"study_design_scores_gemma":[0.00006217821,0.00001141014,0.001923667,0.00008758498,0.0001069461,0.000006343222,0.000002692578,0.9213736,0.0002245065,0.07586439,0.0001902499,0.0001463973],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.001052917,0.0003737154,0.9971483,0.0001657299,0.0003773338,0.0002074439,0.00003016255,0.00003003048,0.0006143336],"genre_scores_gemma":[0.5750313,0.00002853953,0.4247853,0.00006024031,0.00002619488,0.00001220372,0.000004610657,0.00002656424,0.00002507923],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.5739784,"threshold_uncertainty_score":0.5973187,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4391108121","doi":"10.1007/978-3-031-50769-4_10","title":"Optimized Schwarz Method in Time for Transport Control","year":2024,"lang":"en","type":"book-chapter","venue":"Lecture notes in computational science and engineering","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Université Laval","funders":"Agence Nationale de la Recherche","keywords":"Control (management); Computer science; Artificial intelligence","retraction":null,"screen_n_in":null,"score":{"opus":0.007215478051978344,"gpt":0.2388544420674639,"spread":0.2316389640154855,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001278972,0.0002285565,0.0003119323,0.0005550492,0.00006026494,0.0001432423,0.0005398979,0.0001314103,0.00001061387],"category_scores_gemma":[0.0000864219,0.0002125133,0.00006464993,0.0003036641,0.000071224,0.0002383784,0.00006487669,0.0003154578,0.000006828189],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00009655669,"about_ca_system_score_gemma":0.0001637906,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0000040266,"about_ca_topic_score_gemma":0.000001385648,"domain_scores_codex":[0.9984791,0.000006122345,0.0002763108,0.0005538959,0.0004069361,0.0002776512],"domain_scores_gemma":[0.9988258,0.0008469992,0.00004116258,0.0001324184,0.00007951744,0.00007410593],"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.00000633307,0.000003630602,0.000001541754,0.00004972413,0.000007186743,0.00001721173,0.000106859,0.8018493,0.00006730027,0.1878707,0.000001378156,0.01001886],"study_design_scores_gemma":[0.0003211699,0.00002097803,0.00002968904,0.0001496225,0.000006165676,0.00001813198,1.305804e-7,0.772276,0.00003154366,0.2262189,0.0007318234,0.000195914],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.00003598147,0.0004595186,0.9970707,0.0005488369,0.0002503373,0.0003050409,0.00001660336,0.00008329653,0.001229656],"genre_scores_gemma":[0.04585016,0.0000137862,0.9525671,0.0002870951,0.0001739749,0.0000394001,0.00001348161,0.00003257754,0.001022432],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.04581418,"threshold_uncertainty_score":0.8666039,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4391111820","doi":"10.1007/978-3-031-50769-4_20","title":"Multigrid Interpretation of a Three-Level Parareal Algorithm","year":2024,"lang":"en","type":"book-chapter","venue":"Lecture notes in computational science and engineering","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Université Laval","funders":"Agence Nationale de la Recherche","keywords":"Multigrid method; Parallelism (grammar); Interpretation (philosophy); Computer science; Algorithm; Reduction (mathematics); Parallel computing; Mathematics; Programming language; Geometry","retraction":null,"screen_n_in":null,"score":{"opus":0.01290470622090739,"gpt":0.2300406576759649,"spread":0.2171359514550575,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004362477,0.0002144038,0.0002297538,0.0005014543,0.00005424623,0.0001295116,0.0004740108,0.0001083308,0.000006627747],"category_scores_gemma":[0.00008017328,0.0001969279,0.00005137182,0.0003145121,0.000151592,0.0002957286,0.000221588,0.0002730034,0.000005534172],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00008006954,"about_ca_system_score_gemma":0.0001533907,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000009775425,"about_ca_topic_score_gemma":0.00000811512,"domain_scores_codex":[0.9985405,0.000003611414,0.0002831855,0.0004569502,0.0005160015,0.0001997895],"domain_scores_gemma":[0.9992033,0.0003543239,0.00007415454,0.0001585164,0.0001421881,0.00006756768],"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.000001937467,0.000005146238,0.000003329581,0.00008811907,0.00001317459,0.0000176481,0.000375556,0.4138851,0.00006541673,0.2615995,0.000002334252,0.3239428],"study_design_scores_gemma":[0.00005828562,0.0000220506,0.0001047471,0.0002464355,0.000004685207,0.0000240081,4.353213e-7,0.7458125,0.00008674157,0.2533293,0.000154686,0.0001561162],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.000100855,0.0006858484,0.9963411,0.0001497577,0.0004642882,0.0001216977,0.00002064674,0.00006806551,0.002047735],"genre_scores_gemma":[0.4383313,0.00003325243,0.5609137,0.0001007274,0.00020539,0.00001083566,0.00001679452,0.00002928648,0.0003587155],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.4382304,"threshold_uncertainty_score":0.8030487,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null}]}