{"meta":{"query_hash":"8b5fa1297c71","filters":{"venue":"Lecture notes in computational science and engineering"},"cohort_total":27,"direct_labels_cover":0,"predictions_cover":27,"exported":27,"export_cap":100000,"truncated":false,"label_status":"direct model label, unvalidated","prediction_status":"machine_predicted_unvalidated (Codex and Gemma teacher distillation)","score_status":"score_only:v0-immature-baseline","snapshot":{"source":"OpenAlex, pinned release, all 482 partitions","release":"2026-06-24","frame_built":"2026-07-12"},"permalink":"https://metacan.xera.ac/q/8b5fa1297c71","api":"https://metacan.xera.ac/api/v1/cohort?venue=Lecture+notes+in+computational+science+and+engineering"},"results":[{"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.07216578471844769,"score_gpt":0.3744615033843911,"score_spread":0.3022957186659434,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W12009016","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00012181665,0.00012477151,0.9978341,0.00032551785,0.00021840558,0.00049024745,0.000009344768,0.000047206668,0.0008285771],"genre_scores_gemma":[0.019000981,0.000015923662,0.9804845,0.00007844866,0.000119543845,0.000052560004,0.000024303496,0.000030043579,0.00019369966],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99880975,0.000016233162,0.00027728584,0.00029834043,0.00039367107,0.00020471799],"domain_scores_gemma":[0.99305147,0.006372841,0.00011955811,0.00012645063,0.0002706845,0.000059010712],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013678476,0.00020330104,0.00023942321,0.00032949756,0.00031234237,0.00009023861,0.0001449997,0.00012271597,0.000033132877],"category_scores_gemma":[0.0013027841,0.00013812867,0.000052180254,0.00028014573,0.00017913329,0.0001093807,0.000042581185,0.00026950694,7.1769523e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002093561,0.000013305332,0.0000010545001,0.00004519852,0.00002357275,5.820254e-7,0.00011806153,0.6614425,0.0003647755,0.28038144,0.0000043309974,0.05758422],"study_design_scores_gemma":[0.00026106698,0.000050579238,0.00007978503,0.00011645116,0.000043957243,0.00000765973,0.0000032328155,0.6701706,0.00012475386,0.32844162,0.00053550425,0.00016480527],"about_ca_topic_score_codex":0.000009170623,"about_ca_topic_score_gemma":0.0000065483023,"teacher_disagreement_score":0.057419416,"about_ca_system_score_codex":0.00012442307,"about_ca_system_score_gemma":0.00011043329,"threshold_uncertainty_score":0.56327236},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.008076137272474655,"score_gpt":0.2140298548552145,"score_spread":0.20595371758273984,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W134793575","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0005390566,0.0006829345,0.98763597,0.00029003998,0.00036208448,0.00013705587,0.0000043605382,0.00014684588,0.010201625],"genre_scores_gemma":[0.5176363,0.000028446932,0.48107553,0.00029197906,0.00042703576,0.0000031289662,0.000014717319,0.00003586649,0.00048698476],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99802226,0.0000074560458,0.0003177025,0.00062866963,0.00064125424,0.00038263094],"domain_scores_gemma":[0.9990034,0.000427791,0.00011429341,0.00020804543,0.00014058208,0.00010588391],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.000656306,0.00030306968,0.00026937423,0.00056916353,0.00020028265,0.00037498676,0.00077889406,0.00013825404,0.000009270488],"category_scores_gemma":[0.00007902501,0.00029945208,0.000050026458,0.00040694326,0.00015749558,0.00039559806,0.0003393702,0.0003944025,0.000011339235],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[8.3424743e-7,0.0000048000143,0.000010763702,0.000033036064,0.0000041488624,0.00003057859,0.000078404846,0.8437666,0.00004155904,0.13000159,0.000014260743,0.026013365],"study_design_scores_gemma":[0.00011402162,0.00002431458,0.00035736285,0.00017478628,0.0000044693766,0.00006383405,3.9856667e-7,0.9360324,0.00004256109,0.061334163,0.001479784,0.00037190615],"about_ca_topic_score_codex":0.000013870116,"about_ca_topic_score_gemma":0.0000035234643,"teacher_disagreement_score":0.51709723,"about_ca_system_score_codex":0.00012431545,"about_ca_system_score_gemma":0.00019281241,"threshold_uncertainty_score":0.99994576},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.013275897092049646,"score_gpt":0.26641748550877614,"score_spread":0.2531415884167265,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W180745420","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.24987353,0.008481087,0.7189912,0.00092320726,0.0034376108,0.0028577605,0.000052235282,0.0005665193,0.014816853],"genre_scores_gemma":[0.9481049,0.00015371457,0.05141971,0.000027080268,0.00015681786,0.000020154228,0.0000064412448,0.00003509225,0.00007608261],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987369,0.000007063103,0.0002557775,0.00033299884,0.0003658931,0.00030131976],"domain_scores_gemma":[0.99920326,0.0004782788,0.000030613974,0.00013498864,0.000064323736,0.00008855473],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00058479584,0.00028835866,0.00025721785,0.00020839353,0.0002144174,0.0002033655,0.00020471985,0.00009540906,0.000008771203],"category_scores_gemma":[0.000043197066,0.00022631172,0.000029466628,0.00013972285,0.00018605837,0.00009035986,0.00007992037,0.00064893765,0.0000017186157],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000027108567,0.0000067318024,0.000035205816,0.000018381112,0.000032218813,0.000006246627,0.0007051155,0.9743254,0.0006023191,0.017799703,0.0000032938485,0.0064626397],"study_design_scores_gemma":[0.00017111754,0.000054171272,0.0019627386,0.000037614518,0.000013515368,0.000017429827,0.000006634308,0.97827435,0.000061248065,0.018036876,0.0010891762,0.00027512046],"about_ca_topic_score_codex":0.000007989452,"about_ca_topic_score_gemma":0.000097155054,"teacher_disagreement_score":0.6982314,"about_ca_system_score_codex":0.0001116798,"about_ca_system_score_gemma":0.000046051875,"threshold_uncertainty_score":0.9228724},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.012766232867909852,"score_gpt":0.2878334940297469,"score_spread":0.27506726116183705,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1811923464","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0000349889,0.00012006007,0.9985415,0.00037854168,0.00020647039,0.00035441254,0.000011039757,0.00013317014,0.00021983417],"genre_scores_gemma":[0.068874605,0.000014729073,0.93017405,0.0003533883,0.0003199412,0.000057447156,0.000036158795,0.000033096654,0.00013656699],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984009,0.000010752465,0.00028298525,0.0005873805,0.0004830648,0.00023486945],"domain_scores_gemma":[0.99891216,0.0004404031,0.00010376002,0.00017621076,0.00028477743,0.000082704486],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007673423,0.00023324657,0.00021834658,0.00064953713,0.00016730475,0.0002614168,0.0004094438,0.0001334897,0.0000048382713],"category_scores_gemma":[0.0000662431,0.00021219574,0.000051631712,0.0002035981,0.000054160144,0.00031356188,0.00017019309,0.0001289441,0.0000022915863],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000020263242,0.0000062231984,5.1206524e-7,0.000018929806,0.000008916964,0.0000018216294,0.00011351238,0.14795136,0.002163014,0.80864626,0.000016031321,0.04107141],"study_design_scores_gemma":[0.0001262704,0.00004761646,0.000009010189,0.00009556239,0.000003595451,0.000018683875,5.968644e-8,0.7395147,0.00029405538,0.25946346,0.0002191331,0.00020783246],"about_ca_topic_score_codex":0.0000017121425,"about_ca_topic_score_gemma":0.0000031409452,"teacher_disagreement_score":0.59156334,"about_ca_system_score_codex":0.00016785364,"about_ca_system_score_gemma":0.00015404887,"threshold_uncertainty_score":0.8653091},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.005706388967826693,"score_gpt":0.23286349283733931,"score_spread":0.22715710386951263,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1814820559","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0048182607,0.00042857043,0.99374074,0.00006793085,0.00007127237,0.00010822559,0.000005313435,0.0001876167,0.0005720794],"genre_scores_gemma":[0.8567528,0.000031448115,0.14295222,0.00006224741,0.000093277784,0.000012013577,0.000054210897,0.000033134304,0.000008646877],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987063,0.0000050766726,0.0003298659,0.00032896298,0.00035148195,0.00027834557],"domain_scores_gemma":[0.9995021,0.00021928987,0.000042310912,0.0001012925,0.00006521416,0.00006974469],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00028762576,0.00026227167,0.00030461678,0.00046250244,0.00006072314,0.000057277088,0.00016355436,0.00014616479,0.000009120971],"category_scores_gemma":[0.00007049307,0.00027385703,0.00003739311,0.00033287032,0.00008837611,0.00013077886,0.000057138204,0.00036612578,0.0000024309243],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000010388221,0.0000018148179,0.000016328357,0.000034305354,0.0000057782404,0.0000064241467,0.00003488853,0.96646726,0.007999827,0.0022700953,0.0000025145207,0.023159698],"study_design_scores_gemma":[0.0000796829,0.000015704256,0.00013591445,0.0001556119,0.0000050939284,0.000012222698,4.0274242e-7,0.9579674,0.000864719,0.04003944,0.00041785138,0.00030593955],"about_ca_topic_score_codex":0.000006898143,"about_ca_topic_score_gemma":0.000020733898,"teacher_disagreement_score":0.85193455,"about_ca_system_score_codex":0.00036239385,"about_ca_system_score_gemma":0.000024233705,"threshold_uncertainty_score":0.9999714},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.017356529742861535,"score_gpt":0.32092787180596277,"score_spread":0.3035713420631012,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W205177058","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000080052014,0.005829135,0.9896211,0.00019235206,0.00070466206,0.00029927076,0.0000054968623,0.00020190724,0.0030660203],"genre_scores_gemma":[0.0015517442,0.0009905259,0.99696285,0.000108694,0.0002192082,0.000016762922,0.00000825917,0.00009531505,0.000046639634],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99735945,0.000026664844,0.0006905213,0.0006302625,0.00073814247,0.00055493787],"domain_scores_gemma":[0.99570715,0.00357029,0.00012413852,0.00022430878,0.00015678314,0.00021731514],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0016908855,0.00052904186,0.0006297069,0.0009199809,0.00010821692,0.00010578213,0.0004170902,0.0003280182,0.000036556663],"category_scores_gemma":[0.0020641598,0.0005414698,0.00006534137,0.00073981396,0.00015901327,0.0005336386,0.00017634149,0.0014128244,0.0000036020049],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000002281883,0.0000030039714,0.0000031211832,0.00008667281,0.0000056210333,0.000006733541,0.00013899895,0.5791951,0.0006390448,0.010902695,6.275831e-7,0.40901613],"study_design_scores_gemma":[0.00014231174,0.000014666795,0.000052474326,0.00027436693,0.0000071648083,0.000035564946,0.0000027678584,0.6229897,0.00044812594,0.36888355,0.0067440975,0.00040521935],"about_ca_topic_score_codex":0.000003954526,"about_ca_topic_score_gemma":0.000019139656,"teacher_disagreement_score":0.4086109,"about_ca_system_score_codex":0.00055835285,"about_ca_system_score_gemma":0.000220927,"threshold_uncertainty_score":0.9997037},"labels":[],"label_agreement":null},{"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.015062439330606671,"score_gpt":0.2784052994987885,"score_spread":0.2633428601681818,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2064523606","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0002457119,0.00030439088,0.9971089,0.00048476184,0.0001926413,0.0003909966,0.0000148901645,0.00010061062,0.0011571144],"genre_scores_gemma":[0.20615242,0.00001890924,0.79301965,0.00034743393,0.0002390078,0.000027597684,0.000009403811,0.00005904562,0.00012653782],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985196,0.000004598211,0.00035516918,0.0003067646,0.0005149689,0.00029892],"domain_scores_gemma":[0.99829096,0.0012314632,0.000056977497,0.00015425668,0.00011807931,0.00014829439],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0003008438,0.0003209362,0.00024841182,0.00030221563,0.00013344579,0.00010042118,0.0002262402,0.000072583156,0.00003662404],"category_scores_gemma":[0.00019294329,0.0002515922,0.000028778812,0.00031962633,0.00008822744,0.0001621089,0.00010135501,0.0004075107,0.000009326152],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000029414184,0.0000025841107,7.317327e-7,0.00004587959,0.000018150295,0.000032030002,0.0003810766,0.9499199,0.000040832114,0.009284409,0.000017335635,0.040254127],"study_design_scores_gemma":[0.00017182088,0.00007219345,0.00001102721,0.0004022848,0.000017102393,0.00036512068,0.000011129768,0.9650822,0.00018910485,0.02702219,0.0062727425,0.0003830322],"about_ca_topic_score_codex":0.000005557464,"about_ca_topic_score_gemma":0.000016216334,"teacher_disagreement_score":0.20590672,"about_ca_system_score_codex":0.00040755366,"about_ca_system_score_gemma":0.00011687257,"threshold_uncertainty_score":0.9999936},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.029703500164624797,"score_gpt":0.2983675935814013,"score_spread":0.2686640934167765,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W219254201","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000045694203,0.00048536438,0.9970541,0.00058754656,0.00029491726,0.0004445867,0.000016813347,0.0001501383,0.0009208168],"genre_scores_gemma":[0.008766821,0.000040020106,0.990599,0.0001410829,0.0002042846,0.000079566555,0.00003098926,0.00007613685,0.0000621331],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998478,0.000011839793,0.00031039436,0.00035693857,0.00048690054,0.00035593953],"domain_scores_gemma":[0.995427,0.0040421793,0.00005095622,0.00016697845,0.00023076983,0.00008211971],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00063558156,0.0003408387,0.0003491314,0.00028560762,0.00023638188,0.00007746382,0.00029618604,0.00012515491,0.000011050775],"category_scores_gemma":[0.00047617676,0.00022340284,0.00005963913,0.00022044995,0.00027036373,0.00016817915,0.00007163416,0.00042930775,0.0000029134292],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000005433536,0.000003087187,3.0383686e-7,0.000075429045,0.000026142596,0.0000026135326,0.00026780428,0.9744136,0.00016978467,0.005972872,0.000013945264,0.019049032],"study_design_scores_gemma":[0.00021806051,0.000034721437,0.000012537791,0.00011294371,0.000020631885,0.000034458066,0.0000021593337,0.9449956,0.00028996018,0.0504358,0.003508247,0.0003348881],"about_ca_topic_score_codex":8.033564e-7,"about_ca_topic_score_gemma":9.974045e-7,"teacher_disagreement_score":0.044462927,"about_ca_system_score_codex":0.00018632118,"about_ca_system_score_gemma":0.00007340107,"threshold_uncertainty_score":0.9110103},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.04186285457208082,"score_gpt":0.34627272794870445,"score_spread":0.3044098733766236,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2408295797","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0005585243,0.00051582087,0.99639946,0.00013988635,0.0002334001,0.00018379907,0.0000066972966,0.000028209355,0.0019342073],"genre_scores_gemma":[0.3820817,0.000005010968,0.617512,0.000041833322,0.00008178472,0.0000080845575,0.0000050818426,0.000020386036,0.00024412925],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9975673,0.000019955904,0.0005582379,0.00049437064,0.001123853,0.0002362677],"domain_scores_gemma":[0.99559575,0.0035015715,0.00015769717,0.00021207251,0.0004262668,0.00010664501],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0024326183,0.00023578224,0.00039795155,0.0008154272,0.00008289208,0.0001254731,0.0004574584,0.00015871745,0.000093337105],"category_scores_gemma":[0.0017902235,0.00018829889,0.000059845876,0.0004228233,0.0003155052,0.0001998934,0.00012682077,0.000278086,0.000014942518],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00000237848,0.0000039582847,0.0000027019778,0.00001771297,0.0000057731336,0.0000014670802,0.00011667918,0.89800334,0.000833565,0.08006176,0.000014617521,0.020936066],"study_design_scores_gemma":[0.00008430269,0.00003134602,0.00035701934,0.00014232087,0.0000065971717,0.000018060704,0.0000021843123,0.49121183,0.00006127817,0.50751615,0.00037424022,0.00019470257],"about_ca_topic_score_codex":0.000006334991,"about_ca_topic_score_gemma":0.0000013169023,"teacher_disagreement_score":0.42745435,"about_ca_system_score_codex":0.00012093859,"about_ca_system_score_gemma":0.00017254271,"threshold_uncertainty_score":0.7678606},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.023644276528262086,"score_gpt":0.22506403888421395,"score_spread":0.20141976235595185,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W25025378","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.016370296,0.001881999,0.98049563,0.00023069039,0.00019467121,0.00039132446,0.0000141492865,0.000118422926,0.0003028419],"genre_scores_gemma":[0.9870242,0.00008376232,0.012686019,0.000058348065,0.000058843038,0.000013513276,0.00001539057,0.000022202194,0.000037760332],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992799,0.0000012148165,0.00016400703,0.00023581539,0.00015884837,0.00016021595],"domain_scores_gemma":[0.9996283,0.00018941505,0.000014627035,0.000053936983,0.000055418514,0.00005828267],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00015478175,0.00017031966,0.00015132867,0.00021567271,0.00008455677,0.00008148382,0.000051486168,0.0000850997,0.0000012255321],"category_scores_gemma":[0.00006985626,0.00017887514,0.000016770462,0.00007458888,0.00004399422,0.000119192686,0.000018043445,0.0001202709,1.2462101e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000012727243,0.0000013346682,0.000002512176,0.00008650856,0.000008159313,5.1648374e-7,0.00009252957,0.9724278,0.000017786679,0.0042222557,0.0000027182348,0.023136616],"study_design_scores_gemma":[0.00024036589,0.000015826177,0.00023058473,0.000060044502,0.000015082184,0.000002351585,0.0000014407382,0.9918193,5.614927e-7,0.005612737,0.0018143978,0.00018730856],"about_ca_topic_score_codex":0.0000025193601,"about_ca_topic_score_gemma":0.00003303642,"teacher_disagreement_score":0.9706539,"about_ca_system_score_codex":0.000054078817,"about_ca_system_score_gemma":0.000022215057,"threshold_uncertainty_score":0.7294317},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.01553520030389008,"score_gpt":0.27883993354853204,"score_spread":0.26330473324464193,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W250981282","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00063996395,0.0038551823,0.9938519,0.00007082364,0.00013143338,0.00019918734,0.00001051544,0.000062399085,0.0011785747],"genre_scores_gemma":[0.30002743,0.00012673078,0.69655746,0.0001760895,0.00043313776,0.00005201134,0.00004258691,0.00013958495,0.0024449553],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99877864,0.000003646175,0.00026488607,0.00041702128,0.00019662437,0.0003391965],"domain_scores_gemma":[0.9993998,0.00032579323,0.000056815705,0.00008178126,0.00007699018,0.00005883072],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00033290504,0.00025352123,0.00031361936,0.00028790074,0.0001281212,0.00005340566,0.00016885866,0.00019115598,0.000012952767],"category_scores_gemma":[0.00013647477,0.00024990315,0.000051443647,0.00015540811,0.00020855326,0.00015355666,0.00007191118,0.00032575458,8.8951407e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000053222307,0.0000038372664,0.000014048929,0.00009643693,0.000017937393,0.0000024312683,0.00019988316,0.917445,0.0063712085,0.010531567,4.4851464e-7,0.06531189],"study_design_scores_gemma":[0.00015035548,0.000014184332,0.00008582145,0.00027376693,0.000018989283,0.00002214281,0.000001013188,0.9847732,0.00013161966,0.013908847,0.00031852545,0.0003015351],"about_ca_topic_score_codex":0.000010271638,"about_ca_topic_score_gemma":0.000003249573,"teacher_disagreement_score":0.29938745,"about_ca_system_score_codex":0.00012438961,"about_ca_system_score_gemma":0.0000925658,"threshold_uncertainty_score":0.99999535},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.01678031587194484,"score_gpt":0.21557491627617908,"score_spread":0.19879460040423425,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2898585087","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0055407775,0.0003212093,0.99247444,0.00006826665,0.00024612035,0.00017514953,0.00016854158,0.00024560327,0.0007598759],"genre_scores_gemma":[0.90267,0.000020271915,0.09648152,0.00005318926,0.00014053733,0.0000060220523,0.0005776621,0.000043644268,0.0000071097866],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987751,0.0000048697248,0.00030956947,0.00034297263,0.00038673845,0.00018070292],"domain_scores_gemma":[0.999381,0.00023405976,0.00007355343,0.0001460541,0.00008739313,0.00007792622],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00013231442,0.0002632905,0.0002833938,0.0002961467,0.000064006264,0.00006335271,0.0002136824,0.00014615996,0.000014966321],"category_scores_gemma":[0.000048509206,0.00027607725,0.00003977269,0.00018892769,0.00008778922,0.00015181463,0.00010134826,0.00038335394,0.0000037046984],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000053606664,0.0000049162613,0.000007674363,0.000041609565,0.00003166106,0.000009699083,0.0001320681,0.96864486,0.013619545,0.0038312697,0.000014996502,0.013656367],"study_design_scores_gemma":[0.00012270632,0.000015987462,0.00047208488,0.00028993792,0.000023733191,0.000009054744,0.0000010550369,0.948044,0.0017157904,0.048463795,0.00055548706,0.00028634613],"about_ca_topic_score_codex":0.000042009415,"about_ca_topic_score_gemma":0.000021071945,"teacher_disagreement_score":0.8971293,"about_ca_system_score_codex":0.000083744235,"about_ca_system_score_gemma":0.000051405415,"threshold_uncertainty_score":0.9999691},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.024417101570145133,"score_gpt":0.34019011390272175,"score_spread":0.3157730123325766,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2964558805","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0014634543,0.00051615445,0.99412274,0.0025334836,0.0006416585,0.00050652423,0.00002124741,0.00017629786,0.00001842584],"genre_scores_gemma":[0.29287568,0.00001464855,0.706598,0.00021604096,0.0001658598,0.0000912248,0.00001101608,0.000027497726,5.814204e-8],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985636,0.000020657199,0.00033122604,0.0003871402,0.00041534816,0.00028204598],"domain_scores_gemma":[0.994856,0.004718208,0.000056275458,0.00014560176,0.00013653148,0.000087405206],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007836075,0.0002600126,0.00027814327,0.00017202864,0.00013480711,0.00013452006,0.00036000824,0.000107529806,0.000002073032],"category_scores_gemma":[0.00078472804,0.00021900077,0.000059870126,0.00056471775,0.00010415654,0.00010870815,0.00021854458,0.00053678005,0.0000010556813],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000003781238,0.000005159777,0.000004516548,0.00023218612,0.000015769692,0.0000013892677,0.00031890828,0.9678147,0.0008963183,0.0059526586,0.000007853917,0.024746798],"study_design_scores_gemma":[0.00008375662,0.000011547005,0.0002908949,0.000071800474,0.000008673456,0.000009528466,0.0000047922354,0.6459965,0.00031493005,0.3528896,0.00015532106,0.00016265239],"about_ca_topic_score_codex":0.0000025804197,"about_ca_topic_score_gemma":0.0000010999811,"teacher_disagreement_score":0.34693694,"about_ca_system_score_codex":0.00022604925,"about_ca_system_score_gemma":0.0000815826,"threshold_uncertainty_score":0.8930592},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.017406296371523546,"score_gpt":0.26482870257573465,"score_spread":0.2474224062042111,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3094161168","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0007726599,0.00019958089,0.98904204,0.00036299924,0.00043180172,0.0002604987,0.000015139292,0.0002860651,0.008629232],"genre_scores_gemma":[0.5415944,0.00003520887,0.45750138,0.00032908973,0.00033286048,0.000016208776,0.000035428795,0.00010959243,0.000045859197],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99793375,0.000006847566,0.00042835833,0.00047325395,0.00082959566,0.00032820314],"domain_scores_gemma":[0.99835193,0.0011281489,0.00009721832,0.00015292538,0.000116742,0.0001530566],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00031198937,0.0004048122,0.00037995158,0.00040311518,0.00013831147,0.00011771682,0.00024787473,0.00014441041,0.000011078628],"category_scores_gemma":[0.00074854365,0.00040931228,0.00005995896,0.0003828607,0.00016772185,0.00025114825,0.00008904222,0.00071405544,0.000016672715],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000004822593,0.000002633561,0.0000025825525,0.000104609484,0.0000139128915,0.000009908918,0.00012034406,0.8665492,0.00026346603,0.11962031,0.0000033493204,0.013304882],"study_design_scores_gemma":[0.00015310354,0.000037233694,0.000104615705,0.00026535484,0.000007667822,0.000014613558,0.0000013053632,0.67316115,0.000084324725,0.3252175,0.0006227369,0.00033041486],"about_ca_topic_score_codex":0.0000012297024,"about_ca_topic_score_gemma":0.0000017525056,"teacher_disagreement_score":0.54082173,"about_ca_system_score_codex":0.00055152125,"about_ca_system_score_gemma":0.00009311142,"threshold_uncertainty_score":0.99983585},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.016219467262989822,"score_gpt":0.2570629610942613,"score_spread":0.2408434938312715,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3141613148","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00012887854,0.0006012147,0.99693614,0.00015255524,0.0003973101,0.00067901745,0.000098657096,0.00019546483,0.00081076904],"genre_scores_gemma":[0.021762569,0.0000445087,0.97745025,0.000121850346,0.00019325083,0.00018837038,0.00006990185,0.00010203143,0.00006724609],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982473,0.0000070036963,0.00043408564,0.00041905002,0.0005465667,0.00034596154],"domain_scores_gemma":[0.99750084,0.0020126835,0.00008300779,0.00012885337,0.00016947689,0.00010511214],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0004815161,0.00034486203,0.00042198697,0.0004159947,0.00015458737,0.00007375733,0.0002507496,0.00012615466,0.0000736448],"category_scores_gemma":[0.00046311904,0.00036740064,0.000075371245,0.00023153126,0.00014701732,0.00021420693,0.00006459248,0.0004968732,0.000003226567],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000007574185,0.000008141086,5.6927615e-7,0.00021103713,0.000028995993,0.0000026868638,0.00008023266,0.9817251,0.00009748346,0.01279958,0.000006703147,0.0050318837],"study_design_scores_gemma":[0.00048449857,0.000057319125,0.0000057529837,0.00011587367,0.000021433983,0.000025129544,9.232878e-7,0.914084,0.000032616354,0.08033382,0.004464271,0.0003743622],"about_ca_topic_score_codex":5.348615e-7,"about_ca_topic_score_gemma":2.7595053e-7,"teacher_disagreement_score":0.06764112,"about_ca_system_score_codex":0.00033509146,"about_ca_system_score_gemma":0.00010373517,"threshold_uncertainty_score":0.9998778},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.014984037586964382,"score_gpt":0.26784110948651346,"score_spread":0.2528570718995491,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3197915270","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0010529165,0.00037371536,0.99714833,0.00016572994,0.00037733378,0.00020744391,0.000030162551,0.00003003048,0.0006143336],"genre_scores_gemma":[0.57503134,0.000028539527,0.42478526,0.000060240305,0.000026194884,0.00001220372,0.0000046106566,0.000026564245,0.000025079233],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99837494,0.00002511733,0.00044774055,0.00024026114,0.00074068207,0.00017126845],"domain_scores_gemma":[0.99789125,0.0015039983,0.00018639326,0.00022659819,0.00015765546,0.000034136683],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005964725,0.000199136,0.00040662257,0.00032139698,0.00009893309,0.000012758481,0.00045206066,0.00007677908,0.000032046923],"category_scores_gemma":[0.000652542,0.0001464777,0.00014396498,0.0011509081,0.00025819716,0.00008100642,0.0002246672,0.00040904217,2.117573e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000017622062,0.0000046909095,0.00006608918,0.000076585595,0.00008113337,4.203872e-7,0.0001665486,0.9630656,0.00040385156,0.032960143,0.0000016610787,0.0031714754],"study_design_scores_gemma":[0.00006217821,0.0000114101385,0.0019236669,0.00008758498,0.00010694608,0.000006343222,0.0000026925777,0.9213736,0.00022450654,0.07586439,0.00019024988,0.00014639726],"about_ca_topic_score_codex":0.00000776636,"about_ca_topic_score_gemma":0.000004638545,"teacher_disagreement_score":0.5739784,"about_ca_system_score_codex":0.00017878329,"about_ca_system_score_gemma":0.000090749476,"threshold_uncertainty_score":0.5973187},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.039387742497858015,"score_gpt":0.27524849155213443,"score_spread":0.23586074905427643,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3204586775","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.013131522,0.00031879998,0.9839879,0.00016563667,0.0008894229,0.00023363152,0.00005963643,0.000034017274,0.001179385],"genre_scores_gemma":[0.97931045,0.000008573807,0.020083552,0.00017536481,0.00016394275,0.0000068346153,0.000020230698,0.000024831013,0.00020624326],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99651957,0.000012727863,0.00055014953,0.0007400764,0.0019058,0.00027167078],"domain_scores_gemma":[0.99693877,0.0021354726,0.000099077675,0.00025410397,0.00042518773,0.00014738644],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012812623,0.00027164447,0.0004242541,0.00090831565,0.000109417684,0.0001377499,0.00041050345,0.00014567774,0.000060128157],"category_scores_gemma":[0.0024580646,0.0002271256,0.00008071543,0.00081492116,0.00014089655,0.0001098521,0.00009145546,0.0002785637,0.000014008137],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000018385304,0.000015283096,0.000015678765,0.0000137315255,0.000009811582,0.000006641402,0.0003023684,0.9670357,0.00056957395,0.006662435,0.000018044317,0.025332361],"study_design_scores_gemma":[0.0003813797,0.00024467555,0.0022484981,0.001011467,0.000038329377,0.000009450887,0.000018624063,0.94989806,0.0009314903,0.041855242,0.0027771415,0.0005856483],"about_ca_topic_score_codex":0.00001419593,"about_ca_topic_score_gemma":0.0000064005603,"teacher_disagreement_score":0.9661789,"about_ca_system_score_codex":0.0001523812,"about_ca_system_score_gemma":0.00022335294,"threshold_uncertainty_score":0.9261913},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.020822315806311033,"score_gpt":0.23976566695893486,"score_spread":0.21894335115262384,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W337437596","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00014015706,0.0003641051,0.9953458,0.0019270689,0.0003782916,0.00014961023,0.0000045680295,0.00011341822,0.0015770339],"genre_scores_gemma":[0.2144402,0.00007723259,0.7821426,0.0027692937,0.00034408612,0.000015355505,0.000008248224,0.000039397037,0.00016361213],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9980929,0.000015763651,0.00020724234,0.00055858784,0.0007811389,0.0003443502],"domain_scores_gemma":[0.99824053,0.0012804193,0.000070768205,0.00024803108,0.00007666255,0.0000835676],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005743982,0.00028098948,0.00023925834,0.00027736506,0.0003027424,0.00034303835,0.0007659011,0.00011738663,0.000015422625],"category_scores_gemma":[0.00017715448,0.00020205481,0.000057904745,0.00033896262,0.0002470876,0.00020591341,0.00017838375,0.00048474644,0.000011269307],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000003224207,0.0000106401085,0.000012318984,0.000015938107,0.000010166228,0.000014054528,0.00019676289,0.4876934,0.000049511036,0.1515961,0.000021046291,0.36037683],"study_design_scores_gemma":[0.00008336751,0.0000521737,0.00044952476,0.00017974798,0.000003140556,0.000028013781,3.706819e-7,0.74449,0.000060384948,0.25130397,0.0030783436,0.00027090957],"about_ca_topic_score_codex":0.000011905778,"about_ca_topic_score_gemma":0.0000017482612,"teacher_disagreement_score":0.36010593,"about_ca_system_score_codex":0.00012258027,"about_ca_system_score_gemma":0.00012876772,"threshold_uncertainty_score":0.82395566},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.02915889415817292,"score_gpt":0.2944392676581979,"score_spread":0.265280373500025,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4327511299","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00021325746,0.00038460016,0.99311477,0.00012525781,0.00043497366,0.0002559424,0.000016411754,0.0002762497,0.0051785535],"genre_scores_gemma":[0.055299833,0.00006912361,0.94408876,0.0001317897,0.00012203958,0.000037715785,0.000043723856,0.00010164055,0.00010539711],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9980732,0.00001147996,0.0004298945,0.00042454543,0.00074416987,0.00031670165],"domain_scores_gemma":[0.99821293,0.0012790462,0.00009438953,0.00014802572,0.00016260991,0.00010302368],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0006470204,0.00035020808,0.00034778175,0.00057742395,0.00016080998,0.00007944486,0.00026273754,0.00014498127,0.000088860084],"category_scores_gemma":[0.00058064645,0.00036846896,0.000046107114,0.00052903534,0.00009777437,0.0003018831,0.0001378008,0.0007678101,0.000006662969],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000025127567,0.0000038016558,0.000001672637,0.00008599847,0.000013517563,0.000007999845,0.00013665034,0.9147985,0.0002745976,0.025273895,0.0000036588615,0.059397172],"study_design_scores_gemma":[0.00012816534,0.000022974386,0.000073804265,0.000086491294,0.000008835918,0.000032599906,0.0000015182085,0.84526896,0.00012046448,0.15120521,0.0027036876,0.000347279],"about_ca_topic_score_codex":0.0000029792486,"about_ca_topic_score_gemma":0.0000013188557,"teacher_disagreement_score":0.12593132,"about_ca_system_score_codex":0.00060511875,"about_ca_system_score_gemma":0.00010174493,"threshold_uncertainty_score":0.99987674},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.009729502747124008,"score_gpt":0.30104285622955046,"score_spread":0.29131335348242643,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4327511418","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.035253286,0.0037660366,0.9541238,0.00021113937,0.00088822265,0.00084442267,0.000024388244,0.0005795708,0.004309154],"genre_scores_gemma":[0.48390558,0.0002045028,0.51508,0.00007438122,0.00025076987,0.00018216461,0.00004042434,0.00018543896,0.00007675598],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.996882,0.000015348047,0.00039538468,0.0006884392,0.0012404078,0.0007784209],"domain_scores_gemma":[0.9985587,0.0008526216,0.000033031956,0.00021366174,0.00012554461,0.00021641408],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.002893645,0.00040962992,0.000392476,0.0023850538,0.0001910689,0.00023131995,0.00051523536,0.00017030415,0.000018013528],"category_scores_gemma":[0.00039479233,0.00047519113,0.00002985107,0.0022914961,0.00033313874,0.00034449657,0.000346396,0.0013108152,0.0000017453181],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000021375126,0.0000054702873,0.00001855597,0.00022937005,0.000007006297,0.000021005337,0.00033207933,0.97131324,0.018330898,0.002715147,0.000015802094,0.0070093162],"study_design_scores_gemma":[0.00024663436,0.000027972896,0.0021278716,0.00021064779,0.0000050071335,0.000073045114,0.000006323976,0.98851573,0.00071666174,0.0036026724,0.0039229197,0.00054452464],"about_ca_topic_score_codex":0.000011252072,"about_ca_topic_score_gemma":0.000006140951,"teacher_disagreement_score":0.4486523,"about_ca_system_score_codex":0.002033825,"about_ca_system_score_gemma":0.00049828953,"threshold_uncertainty_score":0.99977},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université Laval","funders":"Agence Nationale de la Recherche","keywords":"Control (management); Computer science; Artificial intelligence","score_opus":0.007215478051978344,"score_gpt":0.23885444206746387,"score_spread":0.23163896401548553,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4391108121","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000035981466,0.00045951857,0.9970707,0.0005488369,0.0002503373,0.00030504086,0.00001660336,0.00008329653,0.0012296557],"genre_scores_gemma":[0.045850158,0.000013786198,0.9525671,0.00028709514,0.00017397494,0.000039400104,0.000013481615,0.00003257754,0.0010224315],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99847907,0.0000061223445,0.0002763108,0.0005538959,0.00040693607,0.00027765118],"domain_scores_gemma":[0.9988258,0.0008469992,0.000041162577,0.00013241843,0.00007951744,0.000074105934],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001278972,0.00022855648,0.00031193226,0.0005550492,0.00006026494,0.00014324232,0.0005398979,0.00013141034,0.000010613873],"category_scores_gemma":[0.000086421904,0.00021251326,0.00006464993,0.00030366413,0.000071224,0.00023837839,0.000064876695,0.00031545776,0.000006828189],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00000633307,0.000003630602,0.0000015417544,0.000049724134,0.000007186743,0.00001721173,0.000106859006,0.8018493,0.00006730027,0.1878707,0.000001378156,0.010018865],"study_design_scores_gemma":[0.00032116994,0.000020978032,0.000029689036,0.00014962246,0.0000061656765,0.000018131985,1.3058042e-7,0.772276,0.000031543663,0.22621888,0.00073182344,0.00019591402],"about_ca_topic_score_codex":0.0000040266,"about_ca_topic_score_gemma":0.000001385648,"teacher_disagreement_score":0.045814175,"about_ca_system_score_codex":0.000096556694,"about_ca_system_score_gemma":0.00016379058,"threshold_uncertainty_score":0.8666039},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.012904706220907395,"score_gpt":0.23004065767596488,"score_spread":0.21713595145505749,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4391111820","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00010085495,0.00068584835,0.9963411,0.0001497577,0.00046428823,0.00012169767,0.000020646743,0.000068065514,0.002047735],"genre_scores_gemma":[0.43833128,0.00003325243,0.56091374,0.00010072741,0.00020539002,0.000010835656,0.000016794516,0.000029286484,0.00035871554],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99854046,0.0000036114143,0.0002831855,0.00045695022,0.0005160015,0.00019978949],"domain_scores_gemma":[0.99920326,0.00035432386,0.000074154545,0.00015851641,0.00014218807,0.00006756768],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004362477,0.00021440382,0.00022975382,0.0005014543,0.00005424623,0.00012951162,0.0004740108,0.000108330845,0.0000066277466],"category_scores_gemma":[0.00008017328,0.0001969279,0.00005137182,0.00031451212,0.00015159204,0.00029572865,0.000221588,0.0002730034,0.0000055341716],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000019374675,0.0000051462384,0.0000033295805,0.00008811907,0.00001317459,0.000017648095,0.00037555603,0.41388506,0.00006541673,0.26159954,0.000002334252,0.32394275],"study_design_scores_gemma":[0.000058285623,0.000022050595,0.0001047471,0.00024643546,0.0000046852074,0.000024008095,4.353213e-7,0.7458125,0.000086741566,0.25332934,0.00015468597,0.00015611619],"about_ca_topic_score_codex":0.0000097754255,"about_ca_topic_score_gemma":0.00000811512,"teacher_disagreement_score":0.43823043,"about_ca_system_score_codex":0.00008006954,"about_ca_system_score_gemma":0.00015339072,"threshold_uncertainty_score":0.8030487},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.025410062815280965,"score_gpt":0.3114487116093854,"score_spread":0.28603864879410446,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4391111829","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0013860278,0.0030905844,0.9923286,0.00022577381,0.00042944818,0.00021152377,0.000010634871,0.0001853,0.0021320935],"genre_scores_gemma":[0.100206874,0.0001832837,0.8991678,0.00008045189,0.00013597794,0.000024138144,0.000014817976,0.000085858424,0.000100841324],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99856436,0.00000951083,0.00038152395,0.00042961814,0.00033728778,0.00027771413],"domain_scores_gemma":[0.997676,0.0020285773,0.000038388065,0.00010692967,0.00005462643,0.000095452175],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0005531823,0.00031746732,0.00036197694,0.00076940376,0.000051253683,0.00009743301,0.00015158566,0.00015908713,0.000014354099],"category_scores_gemma":[0.0004577254,0.00032870975,0.000030325431,0.00038955678,0.00018167155,0.00018535582,0.000100963436,0.00057049905,0.0000053149092],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[9.793223e-7,0.0000023813855,0.0000049975156,0.000272527,0.000010026137,0.0000096490785,0.00016561704,0.9109336,0.00036061445,0.04785458,0.0000018342456,0.040383212],"study_design_scores_gemma":[0.00006199457,0.000010240097,0.00022934709,0.00031417076,0.000006546878,0.000028199833,0.0000015468415,0.55354255,0.00007304838,0.44506168,0.00045625475,0.00021439481],"about_ca_topic_score_codex":0.0000026504838,"about_ca_topic_score_gemma":0.00000426269,"teacher_disagreement_score":0.3972071,"about_ca_system_score_codex":0.00024210651,"about_ca_system_score_gemma":0.000046134373,"threshold_uncertainty_score":0.9999165},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal","funders":"","keywords":"Mathematics; Computer science","score_opus":0.011390315225152473,"score_gpt":0.2342620888581335,"score_spread":0.22287177363298102,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4393009367","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0005663575,0.0034549912,0.98919725,0.00013589338,0.00036816476,0.00016432193,0.00000886037,0.00046415738,0.0056400034],"genre_scores_gemma":[0.9232385,0.00043061379,0.075522184,0.00009015054,0.00025110686,0.000019104073,0.00003797021,0.000072946794,0.00033741593],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986833,0.0000013802552,0.00026616512,0.00037092413,0.00045216372,0.0002260872],"domain_scores_gemma":[0.99957246,0.0001201535,0.000025413947,0.00010548638,0.00009292782,0.00008357102],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00017048787,0.00026616288,0.00024705412,0.00079207,0.000046125515,0.00009861544,0.00015771424,0.00013239795,0.000031781914],"category_scores_gemma":[0.000078088924,0.00026215246,0.000050075196,0.0005455626,0.000092618466,0.0001530846,0.000064288986,0.00039415035,0.000017457198],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[4.5058195e-7,0.0000015520352,0.0000020881848,0.000048878865,0.000016299573,0.000009633895,0.000024203415,0.9710134,0.0011286457,0.016523505,0.000026114216,0.011205184],"study_design_scores_gemma":[0.00003269281,0.000016598115,0.000020000389,0.00007773224,0.000017092314,0.000011694309,2.161416e-7,0.96389014,0.0005462871,0.032509103,0.0025932228,0.00028521213],"about_ca_topic_score_codex":0.0000024209448,"about_ca_topic_score_gemma":0.000004727125,"teacher_disagreement_score":0.92267215,"about_ca_system_score_codex":0.00031990834,"about_ca_system_score_gemma":0.000042665673,"threshold_uncertainty_score":0.9999831},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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)","score_opus":0.035222612873282044,"score_gpt":0.3649885593643216,"score_spread":0.3297659464910396,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4415755779","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00019282856,0.00022526251,0.9977786,0.00045957728,0.00015497326,0.00030330708,0.000021086642,0.00005085123,0.0008135457],"genre_scores_gemma":[0.0005915856,0.000014277121,0.99853176,0.00004872329,0.00013500199,0.000011129964,0.000011546178,0.000022869797,0.00063313334],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989263,0.000012427105,0.00024843722,0.0003638255,0.00022600403,0.00022303975],"domain_scores_gemma":[0.9957445,0.003871365,0.00006704324,0.000102429105,0.00013784123,0.00007679252],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006804166,0.00022217655,0.00033893794,0.00034845382,0.00011300712,0.00006342785,0.0001339113,0.00013658627,0.000015360854],"category_scores_gemma":[0.002743803,0.0002064634,0.000052155225,0.00017974984,0.00016180413,0.00007546502,0.00008941076,0.0002605928,8.845002e-7],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000021368654,0.00003188093,0.000010556094,0.000678444,0.00008224823,0.0000028854806,0.00035199735,0.089812286,0.004135247,0.556574,0.000016818329,0.3482823],"study_design_scores_gemma":[0.000093641676,0.000025696003,0.000022580043,0.00012035754,0.000024236168,0.0000034011593,3.734968e-7,0.44179183,0.00025713156,0.556582,0.0009337861,0.0001449946],"about_ca_topic_score_codex":0.000003313739,"about_ca_topic_score_gemma":0.0000021817482,"teacher_disagreement_score":0.35197955,"about_ca_system_score_codex":0.00008724016,"about_ca_system_score_gemma":0.00012457308,"threshold_uncertainty_score":0.84193337},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.019172988428848212,"score_gpt":0.26983133689615957,"score_spread":0.25065834846731133,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W51067668","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00032840186,0.00033883436,0.99575806,0.00015476563,0.0003082956,0.00016853215,0.0000061298388,0.00023083804,0.0027061403],"genre_scores_gemma":[0.34265992,0.0000135458395,0.65678006,0.0002112422,0.00016599472,0.000011699426,0.000013681471,0.000086009546,0.000057844245],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982311,0.00000683896,0.00036902894,0.0003815915,0.0006854986,0.00032594567],"domain_scores_gemma":[0.9974253,0.0020544927,0.000058948634,0.0001803644,0.0001487084,0.00013215156],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00042369936,0.00035289172,0.00036241548,0.00045362007,0.000083320265,0.00006661291,0.0002852899,0.00018028113,0.000016906777],"category_scores_gemma":[0.0006767957,0.00036160272,0.000050907704,0.0002824198,0.00019201143,0.000095839125,0.00006649108,0.0004980083,0.000010313039],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000002059049,0.0000023738264,0.0000063825128,0.00014657814,0.0000075854136,0.000004417377,0.000028889337,0.9662003,0.000029551427,0.022546995,0.000007773496,0.011017096],"study_design_scores_gemma":[0.00012341827,0.00001836133,0.0000735237,0.00019035541,0.0000059040576,0.000005226249,2.3113506e-7,0.8020482,0.000028211602,0.19508621,0.0021024372,0.00031793644],"about_ca_topic_score_codex":8.3092647e-7,"about_ca_topic_score_gemma":0.0000010963862,"teacher_disagreement_score":0.34233153,"about_ca_system_score_codex":0.00026031726,"about_ca_system_score_gemma":0.000084995125,"threshold_uncertainty_score":0.9998836},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.005510851013002428,"score_gpt":0.1952745364254691,"score_spread":0.1897636854124667,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W77917621","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.45180982,0.056656532,0.46599644,0.0013554458,0.0050397394,0.0028401366,0.00015204701,0.0010853388,0.015064501],"genre_scores_gemma":[0.97719103,0.0001896527,0.022397514,0.000076609635,0.000026182237,0.0000058747146,0.0000067254064,0.000026184764,0.00008020124],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99915344,0.0000018799927,0.00018071041,0.00023778409,0.00022716708,0.0001990307],"domain_scores_gemma":[0.9996895,0.00011853885,0.000023981816,0.000078931946,0.000032359112,0.000056685272],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00011983155,0.00020604959,0.00023440756,0.000274758,0.00004016938,0.000048797523,0.00009751576,0.00009299105,0.0000044977646],"category_scores_gemma":[0.00003126601,0.00020451554,0.00002429166,0.00010571422,0.00012974684,0.000061892824,0.00002846622,0.00020393127,5.04725e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000011793292,0.0000018943866,0.0000036187762,0.00015914971,0.000014504836,0.0000031784255,0.00010725825,0.9519792,0.0003067703,0.00087390136,0.000014671462,0.04653468],"study_design_scores_gemma":[0.00060006074,0.000065110304,0.0037055393,0.00051489763,0.000040504474,0.000028316954,0.0000037177497,0.9883461,0.0002439716,0.003262061,0.002604312,0.0005853819],"about_ca_topic_score_codex":0.0000021942617,"about_ca_topic_score_gemma":0.000014561474,"teacher_disagreement_score":0.5253812,"about_ca_system_score_codex":0.0000620935,"about_ca_system_score_gemma":0.00002458226,"threshold_uncertainty_score":0.8339902},"labels":[],"label_agreement":null}]}