{"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0065940963,0.0026321567,0.97415876,0.00034430317,0.0003127193,0.000044106942,0.00009504041,0.00019382179,0.015624965],"genre_scores_gemma":[0.12700154,0.004317519,0.8122126,0.0002893777,0.00051008933,0.00025371896,0.00047303786,0.001307471,0.0536346],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992279,0.0004035759,0.000041218143,0.000052335392,0.00024057823,0.00003440809],"domain_scores_gemma":[0.9987791,0.00069664756,0.00008335032,0.00013966075,0.0002284802,0.000072694806],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016115009,0.0014505782,0.001123686,0.0012036334,0.0005215704,0.001222709,0.0014166881,0.0011603097,0.0061693657],"category_scores_gemma":[0.0038408702,0.00064871105,0.0010568645,0.0009140413,0.0014631818,0.0019111881,0.0018964118,0.0024791865,0.002575199],"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.00012657866,0.000042056232,0.00015772044,0.00027324384,0.00005708503,0.00012871662,0.00014361336,0.058695924,0.008708854,0.8643119,0.0070555746,0.060298868],"study_design_scores_gemma":[0.0000404874,0.00006632506,0.00023663425,0.0000691542,0.000035613866,0.0001558399,0.00004451321,0.5255484,0.005484903,0.44351584,0.024745747,0.00005649387],"about_ca_topic_score_codex":0.0010421904,"about_ca_topic_score_gemma":0.0012220383,"teacher_disagreement_score":0.0061693657,"about_ca_system_score_codex":0.00062624103,"about_ca_system_score_gemma":0.00073826604,"threshold_uncertainty_score":0.020638645},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.020109955,0.00026189836,0.9619767,0.00032360153,0.00018903145,0.00008528558,0.00033068119,0.0041979337,0.012524866],"genre_scores_gemma":[0.18149525,0.0004378853,0.7967408,0.00022567587,0.00027533344,0.00014390859,0.001818333,0.0013035977,0.017559169],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9994318,0.000083964005,0.000031909043,0.00013704624,0.00023065398,0.00008462416],"domain_scores_gemma":[0.9989114,0.00049753266,0.000057016365,0.00026240112,0.00021050508,0.00006108155],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00044166873,0.001475152,0.0015010529,0.0010380533,0.0007103511,0.0017005841,0.001244432,0.0011254315,0.021921907],"category_scores_gemma":[0.004533114,0.0007945843,0.0007329275,0.0018209802,0.0006596209,0.002549308,0.001673142,0.0015090477,0.0069222786],"study_design_candidate":"not_applicable","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.00038056888,0.00021805622,0.00083096145,0.00039315096,0.00009099884,0.00031220756,0.00019168005,0.17851925,0.025583524,0.04800237,0.04313764,0.70233953],"study_design_scores_gemma":[0.00012257774,0.00013382628,0.00039550013,0.00002872347,0.000040924115,0.00022395511,0.00013447182,0.8878559,0.01554853,0.08242023,0.013069835,0.000025559175],"about_ca_topic_score_codex":0.003530001,"about_ca_topic_score_gemma":0.010020352,"teacher_disagreement_score":0.021921907,"about_ca_system_score_codex":0.0005265649,"about_ca_system_score_gemma":0.0012030074,"threshold_uncertainty_score":0.073336065},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.28493476,0.17784904,0.41313243,0.0029825307,0.0011383303,0.00024243491,0.00049864274,0.00047966075,0.11874207],"genre_scores_gemma":[0.73470986,0.070965566,0.17174904,0.00054339186,0.00074429804,0.00019863306,0.00059815304,0.0007363325,0.019754704],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9963187,0.0020561842,0.00014204498,0.000181835,0.0012125021,0.00008865836],"domain_scores_gemma":[0.95989865,0.033136204,0.0007590942,0.0012203443,0.0046299044,0.00035574875],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0068527707,0.00061315036,0.0010457804,0.002798403,0.0005737689,0.0028772699,0.0019838768,0.001485532,0.0067079198],"category_scores_gemma":[0.03010681,0.0003251006,0.0006218922,0.003395034,0.0016890317,0.0042141313,0.0012816692,0.0007903392,0.001124081],"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.0016165165,0.000519187,0.0074633886,0.003556189,0.00044335658,0.00006824343,0.001219416,0.05285264,0.002019765,0.18336213,0.0057445373,0.74113464],"study_design_scores_gemma":[0.00023675984,0.002124456,0.032429304,0.0027428644,0.0007509065,0.0008464691,0.0052246344,0.60944474,0.0086550675,0.2654181,0.07183988,0.00028677794],"about_ca_topic_score_codex":0.0020372914,"about_ca_topic_score_gemma":0.002645647,"teacher_disagreement_score":0.0068527707,"about_ca_system_score_codex":0.00078858854,"about_ca_system_score_gemma":0.0010101767,"threshold_uncertainty_score":0.036241353},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00068934745,0.000032593056,0.99848205,0.000019279318,0.0000337162,0.000014893766,0.000018543178,0.000106390464,0.00060315104],"genre_scores_gemma":[0.045153998,0.00013822864,0.9502565,0.00010003605,0.000059245383,0.00018718322,0.00018462971,0.00029758888,0.003622496],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996351,0.000096628086,0.000019064597,0.000041067797,0.00018578346,0.000022392465],"domain_scores_gemma":[0.99942625,0.00025833305,0.00003497912,0.00006892374,0.00016334245,0.00004812529],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006488808,0.00052789995,0.0007752395,0.00050541124,0.00039114212,0.00066752214,0.001336026,0.0013019715,0.0051904935],"category_scores_gemma":[0.0013844782,0.00053274014,0.00095329183,0.00057246035,0.00047553354,0.00046664357,0.001440676,0.0013784545,0.0014461275],"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.00011288264,0.00013833982,0.0003807719,0.0002194268,0.00008756517,0.00015335444,0.00007660103,0.70178664,0.025834734,0.08825994,0.0063498276,0.17659995],"study_design_scores_gemma":[0.000006673776,0.000006610206,0.000018470926,0.000003872935,0.0000028922223,0.000016704827,0.0000016146828,0.99540097,0.00050925626,0.0029289718,0.0011002579,0.0000036688464],"about_ca_topic_score_codex":0.0013094647,"about_ca_topic_score_gemma":0.001721259,"teacher_disagreement_score":0.0051904935,"about_ca_system_score_codex":0.00034029793,"about_ca_system_score_gemma":0.00081834174,"threshold_uncertainty_score":0.017363906},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011797726,0.00011105628,0.98015255,0.000065389184,0.00008824968,0.00005212584,0.00010673519,0.0005956485,0.00703062],"genre_scores_gemma":[0.15091407,0.00023723485,0.84106237,0.00012615211,0.000033839173,0.00014778215,0.00047383783,0.0006538347,0.006350848],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99972016,0.00005407247,0.000015038369,0.000040216986,0.00014022697,0.000030209274],"domain_scores_gemma":[0.99962735,0.00019709795,0.000020912079,0.00007128958,0.00006308563,0.00002040098],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00032219745,0.00060484913,0.0007736672,0.00064374023,0.00032211852,0.001031707,0.0010636654,0.0009596577,0.00640437],"category_scores_gemma":[0.0012213732,0.00057746726,0.00068801705,0.00058860093,0.0005324769,0.0008322369,0.0018989977,0.0012877353,0.0017408503],"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.00012988994,0.00012127436,0.00056809717,0.0005708262,0.000054638138,0.00046924397,0.0005088987,0.5324592,0.06126214,0.15111078,0.010728686,0.24201638],"study_design_scores_gemma":[0.000020486392,0.000030236384,0.000097476426,0.000034933044,0.000007150955,0.0001645675,0.00006939564,0.9362059,0.0090353405,0.04434833,0.009972428,0.000013776518],"about_ca_topic_score_codex":0.00039089925,"about_ca_topic_score_gemma":0.0007149595,"teacher_disagreement_score":0.00640437,"about_ca_system_score_codex":0.0002966758,"about_ca_system_score_gemma":0.0003055959,"threshold_uncertainty_score":0.02142477},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.007107665,0.04189943,0.9130398,0.0012922663,0.002273119,0.000038928945,0.00009121119,0.00037274597,0.03388482],"genre_scores_gemma":[0.11480082,0.058201652,0.76446205,0.0010176778,0.0040056333,0.00016354122,0.00072517496,0.001013926,0.055609494],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995246,0.00015369241,0.000031050226,0.00005778407,0.00021058289,0.000022267295],"domain_scores_gemma":[0.9994456,0.0002101997,0.000032834858,0.00010196185,0.0001660335,0.000043255215],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009770957,0.000713575,0.0008128835,0.0009682738,0.00027423367,0.0010162968,0.0016833537,0.0009817465,0.0053923647],"category_scores_gemma":[0.0013130127,0.00038656333,0.000665775,0.0014363294,0.0010017648,0.0017912025,0.0014882775,0.0018616583,0.0026806032],"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.00013043292,0.00004600489,0.00026178808,0.0008055723,0.00006324231,0.00009152359,0.00014855801,0.044123262,0.01441884,0.31448796,0.016297461,0.6091254],"study_design_scores_gemma":[0.000040995914,0.00020052657,0.0006047804,0.00022968801,0.00006853226,0.00047699403,0.00007327798,0.4750769,0.011360539,0.19837576,0.31341818,0.00007382694],"about_ca_topic_score_codex":0.0003258096,"about_ca_topic_score_gemma":0.00037310657,"teacher_disagreement_score":0.0053923647,"about_ca_system_score_codex":0.00030633798,"about_ca_system_score_gemma":0.00048348735,"threshold_uncertainty_score":0.018039286},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011780734,0.00042481153,0.9597086,0.00041677238,0.00040987213,0.000090008834,0.00004958644,0.00044155426,0.026678208],"genre_scores_gemma":[0.15079963,0.00073218084,0.81981415,0.0004600457,0.00018264257,0.00018528361,0.00016495536,0.0014086214,0.0262525],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986804,0.00035794036,0.00008564858,0.00018621398,0.00059268,0.00009721355],"domain_scores_gemma":[0.9975448,0.00068089395,0.00019605136,0.0009485779,0.00040404566,0.00022552744],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019506968,0.0010838417,0.0014154724,0.001801449,0.0014736862,0.0027012227,0.0025162129,0.0026841736,0.007833758],"category_scores_gemma":[0.010416268,0.0010602742,0.0011068328,0.0014990375,0.00393355,0.0042220703,0.0052580205,0.003998314,0.0023541993],"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.00008975025,0.00005800506,0.00020802146,0.00014834205,0.000022530256,0.00024155987,0.0003912253,0.022465536,0.009011898,0.9166036,0.0046512685,0.046108164],"study_design_scores_gemma":[0.00007248247,0.00012865904,0.00022079358,0.00015976337,0.000043498632,0.0007750429,0.0001797231,0.29522657,0.010769912,0.64187825,0.050474666,0.00007065335],"about_ca_topic_score_codex":0.0007127289,"about_ca_topic_score_gemma":0.00087045657,"teacher_disagreement_score":0.007833758,"about_ca_system_score_codex":0.00053914194,"about_ca_system_score_gemma":0.000693309,"threshold_uncertainty_score":0.026206493},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.015102852,0.0013017323,0.9629625,0.00047832893,0.00029404552,0.000065791115,0.00020145375,0.00038179796,0.01921142],"genre_scores_gemma":[0.20907404,0.0016581267,0.74998677,0.00031109332,0.0002997381,0.0005547049,0.00060810853,0.0013221409,0.036185257],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99950564,0.00027813544,0.00002161815,0.00002563923,0.00013621901,0.000032875116],"domain_scores_gemma":[0.9993279,0.00030674206,0.00004220699,0.000116632524,0.00015203815,0.00005457929],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008477358,0.00081484095,0.0011726331,0.00081635104,0.0005242202,0.0008573797,0.0015408017,0.00093326496,0.006162806],"category_scores_gemma":[0.0024571854,0.00045035486,0.00080185814,0.001075447,0.0010709373,0.0012871178,0.00237194,0.002058297,0.0020606224],"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.00018859813,0.0000625564,0.00066665,0.00025186967,0.00009988317,0.00018435248,0.00018062908,0.18563384,0.0048647425,0.7088942,0.013331354,0.08564136],"study_design_scores_gemma":[0.000044774806,0.000032455446,0.00021720771,0.000030334457,0.00001231238,0.000047948026,0.000032043146,0.8168768,0.0014007817,0.17337023,0.00790969,0.000025411779],"about_ca_topic_score_codex":0.0021162813,"about_ca_topic_score_gemma":0.0027118977,"teacher_disagreement_score":0.006162806,"about_ca_system_score_codex":0.00051915937,"about_ca_system_score_gemma":0.0009395991,"threshold_uncertainty_score":0.020616591},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0009134387,0.0011708016,0.99491763,0.0001149603,0.00013845267,0.000011157502,0.000035992754,0.000059564787,0.0026381363],"genre_scores_gemma":[0.07931737,0.0058560246,0.89058536,0.00018704898,0.0005602767,0.00023182691,0.00048475421,0.0005016792,0.022275632],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9996307,0.00015779305,0.00001849132,0.000042047483,0.00012686745,0.000024070885],"domain_scores_gemma":[0.99921715,0.00047669225,0.000040479114,0.000068619986,0.00014863857,0.000048310816],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00089749286,0.0008687592,0.0009565131,0.0008717763,0.000271538,0.0010951207,0.0009402905,0.00088924804,0.00369139],"category_scores_gemma":[0.00234913,0.00053380296,0.0010636491,0.0008495706,0.0008199641,0.00084613176,0.001433778,0.002330681,0.001509586],"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.00004730664,0.000055445376,0.00029506724,0.0004988951,0.00006570282,0.00006285697,0.00013042102,0.28289625,0.007310385,0.49783847,0.016200464,0.19459885],"study_design_scores_gemma":[0.0000061212154,0.000007258863,0.00006430037,0.000036023863,0.000005506596,0.00003063215,0.000008946172,0.9193825,0.00047555155,0.07167597,0.008300421,0.0000067711103],"about_ca_topic_score_codex":0.0011754015,"about_ca_topic_score_gemma":0.0011502391,"teacher_disagreement_score":0.00369139,"about_ca_system_score_codex":0.0004459084,"about_ca_system_score_gemma":0.00064472936,"threshold_uncertainty_score":0.01234889},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.21594816,0.0012191971,0.77281797,0.0009361629,0.00020169128,0.00008543381,0.001626349,0.0011508804,0.006014242],"genre_scores_gemma":[0.9322059,0.00081561494,0.054631986,0.000058492147,0.00016842695,0.00016148199,0.0010128812,0.00012841308,0.010816777],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99970645,0.00008592246,0.000020786236,0.000073895026,0.00006611929,0.000046819016],"domain_scores_gemma":[0.9988121,0.0008706772,0.00008124327,0.00007342294,0.000106693304,0.000055911158],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007423505,0.0008144575,0.0011434795,0.00045878495,0.00053123134,0.0010830221,0.0017375975,0.0020733005,0.0025852285],"category_scores_gemma":[0.0027891384,0.0010459388,0.0010830583,0.00076811574,0.00068229606,0.0017754162,0.00083388924,0.0013711727,0.0003561156],"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.000022851595,0.000018339475,0.00054783764,0.000009517163,0.000007669677,0.000017158214,0.00001998311,0.9923206,0.00013003142,0.0035187993,0.0003023471,0.0030849213],"study_design_scores_gemma":[0.0000021797646,0.000002694606,0.00012252036,7.7004614e-7,0.0000016506752,0.0000030263407,0.0000029204962,0.99779594,0.00005167302,0.0019136798,0.000100442245,0.0000024351189],"about_ca_topic_score_codex":0.08019228,"about_ca_topic_score_gemma":0.05123596,"teacher_disagreement_score":0.08019228,"about_ca_system_score_codex":0.0011412313,"about_ca_system_score_gemma":0.0013816284,"threshold_uncertainty_score":0.15945101},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.016808461,0.39804837,0.52983326,0.0037356894,0.0067702616,0.00007823075,0.00018613433,0.00042764278,0.044112034],"genre_scores_gemma":[0.1352153,0.31029615,0.45210093,0.0014654957,0.0066527855,0.0002754798,0.000772421,0.0006970231,0.092524424],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990872,0.0002844791,0.00006791994,0.00010925313,0.00038673915,0.00006445345],"domain_scores_gemma":[0.99871945,0.0006844431,0.000046127247,0.00015310592,0.00031170077,0.00008520246],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0023664932,0.0013617702,0.0011323047,0.0014476548,0.0005694282,0.002188539,0.0014307711,0.001395485,0.0054166657],"category_scores_gemma":[0.0033388122,0.0008927985,0.0010029657,0.002590939,0.001557258,0.0021911447,0.0024609084,0.0027098272,0.0019282565],"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.00019095543,0.00024865105,0.0005598772,0.002212202,0.00017999831,0.00009463252,0.00040595286,0.0569258,0.0049904305,0.19495875,0.021140538,0.7180922],"study_design_scores_gemma":[0.000070414586,0.00033500462,0.0012415941,0.0011657292,0.00012955067,0.00030637177,0.00019526582,0.15873824,0.009846324,0.2154553,0.6124037,0.00011260689],"about_ca_topic_score_codex":0.0010761629,"about_ca_topic_score_gemma":0.0013099319,"teacher_disagreement_score":0.0054166657,"about_ca_system_score_codex":0.001102701,"about_ca_system_score_gemma":0.00084506464,"threshold_uncertainty_score":0.018120527},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008294629,0.00010047936,0.99099964,0.00006672763,0.000010442846,0.000012446791,0.000027045382,0.000059202488,0.00042932483],"genre_scores_gemma":[0.36274767,0.00069983973,0.63338697,0.00011612408,0.00008564135,0.00012989934,0.00031739214,0.00009702373,0.0024194259],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994387,0.00022989507,0.000023962972,0.00008085205,0.00019177336,0.0000347092],"domain_scores_gemma":[0.9992083,0.00052267034,0.00007406332,0.00010347787,0.000070778886,0.000020759004],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001302279,0.0006234566,0.0007785291,0.0005195074,0.00017242008,0.0007434874,0.00088014617,0.0004991,0.00087917806],"category_scores_gemma":[0.0032109607,0.00026771115,0.0004891155,0.0011680017,0.00062390603,0.0011115766,0.0013817108,0.0010449572,0.0002791508],"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.00020569538,0.000072155075,0.0005313752,0.00018131084,0.000082301114,0.00014196264,0.00007579555,0.70394677,0.029535664,0.070370235,0.0021768487,0.19267984],"study_design_scores_gemma":[0.0000032439093,0.000016776949,0.00005371215,0.0000030580495,0.0000028804914,0.000016792603,0.0000038741364,0.99100155,0.0016068191,0.006955968,0.0003322769,0.0000030503163],"about_ca_topic_score_codex":0.00068420457,"about_ca_topic_score_gemma":0.0006387241,"teacher_disagreement_score":0.001302279,"about_ca_system_score_codex":0.00031581667,"about_ca_system_score_gemma":0.0004390305,"threshold_uncertainty_score":0.006887138},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0010681192,0.00025052603,0.9958313,0.0001251895,0.000096867545,0.00001969311,0.000039296156,0.00006393652,0.0025050882],"genre_scores_gemma":[0.08238125,0.0010152623,0.9032973,0.00022827527,0.00023884769,0.00026692718,0.0003531644,0.00044342087,0.011775498],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99877805,0.00047984743,0.000043558037,0.00012660219,0.0005010906,0.00007076143],"domain_scores_gemma":[0.9985831,0.0007100789,0.000063940395,0.0001529356,0.00040088253,0.00008902526],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011479778,0.0008044503,0.0013663559,0.0009870986,0.00047886863,0.0015511195,0.0014351952,0.0016373721,0.007897856],"category_scores_gemma":[0.005849323,0.00044391782,0.0010362566,0.0007531899,0.00091831473,0.0016152229,0.0031782025,0.0036196124,0.0032008383],"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.00017718365,0.000105606334,0.0003160091,0.00053217023,0.00007505885,0.00014567698,0.00012893508,0.24119492,0.0084319385,0.5229539,0.012190843,0.21374775],"study_design_scores_gemma":[0.000014439001,0.000020324094,0.000054812193,0.000033113545,0.000008078901,0.00005872985,0.000023410408,0.8609012,0.00095861556,0.12890802,0.009007482,0.000011866307],"about_ca_topic_score_codex":0.0012290124,"about_ca_topic_score_gemma":0.0007166028,"teacher_disagreement_score":0.007897856,"about_ca_system_score_codex":0.0004419755,"about_ca_system_score_gemma":0.00097492157,"threshold_uncertainty_score":0.02642095},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.050751016,0.00039405114,0.8978769,0.000703919,0.00027499878,0.00008194377,0.0001740963,0.00014960025,0.049593482],"genre_scores_gemma":[0.524747,0.00048812185,0.42391494,0.0003975945,0.00019316321,0.00023188254,0.00048931176,0.0003965883,0.04914139],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99970406,0.00011807035,0.000011177167,0.00003528257,0.000097038974,0.000034355744],"domain_scores_gemma":[0.99943954,0.00035666386,0.00003212014,0.0000618858,0.000057745445,0.000052002903],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00057999685,0.0007730357,0.00081266434,0.00034538473,0.00035776,0.0012308985,0.001019579,0.001176344,0.005154339],"category_scores_gemma":[0.0015196247,0.00044881567,0.00047488237,0.00040178062,0.0010712649,0.0010575792,0.0018809483,0.0017657393,0.0006990573],"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.00044401822,0.00015020119,0.000358215,0.00027748084,0.00005010845,0.00041323673,0.0002597101,0.53549767,0.018717807,0.38248917,0.006950766,0.05439175],"study_design_scores_gemma":[0.00003070609,0.000050638682,0.0001025162,0.000022721786,0.0000060827265,0.00006994372,0.000055510052,0.9398289,0.0021600921,0.054604765,0.0030584706,0.000009710644],"about_ca_topic_score_codex":0.00061395735,"about_ca_topic_score_gemma":0.0007009309,"teacher_disagreement_score":0.005154339,"about_ca_system_score_codex":0.00034045902,"about_ca_system_score_gemma":0.00050541415,"threshold_uncertainty_score":0.017242968},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0049798265,0.00020168221,0.98288983,0.00017673666,0.00020543186,0.0000421712,0.000095863696,0.0005454063,0.010863102],"genre_scores_gemma":[0.09268435,0.00050139904,0.8763253,0.00018712934,0.0002363223,0.00019353199,0.00037850766,0.000783181,0.028710404],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99964964,0.00009354976,0.000016413382,0.000030672654,0.00018383069,0.000025840942],"domain_scores_gemma":[0.99967325,0.00014203505,0.000022159084,0.000054303408,0.00008118128,0.000027091219],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005104391,0.00071128627,0.000837076,0.00051416917,0.00044756813,0.00065861957,0.00080522534,0.0009507209,0.00756898],"category_scores_gemma":[0.0010604681,0.00035639375,0.0006635326,0.0005160937,0.00087545975,0.00064259977,0.0014153065,0.001766025,0.0020108998],"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.0004185198,0.00016871086,0.0003041572,0.00040547812,0.000077135526,0.0002580433,0.00022991857,0.39630845,0.048994247,0.21123993,0.022355035,0.31924036],"study_design_scores_gemma":[0.000034632885,0.000059008104,0.00011970555,0.000021541997,0.00001001093,0.00005247784,0.000017656772,0.9433311,0.0070395507,0.034915965,0.014382351,0.000015872232],"about_ca_topic_score_codex":0.0014614396,"about_ca_topic_score_gemma":0.0020033342,"teacher_disagreement_score":0.00756898,"about_ca_system_score_codex":0.00029970604,"about_ca_system_score_gemma":0.0007797832,"threshold_uncertainty_score":0.025320768},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01847954,0.0019570044,0.9365731,0.0008675388,0.0005048025,0.0000918168,0.00009390422,0.00016810534,0.041264173],"genre_scores_gemma":[0.48128507,0.0053227735,0.4250917,0.0006343261,0.0011485734,0.0005174553,0.0005292275,0.0012285402,0.08424229],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99858785,0.000664391,0.00003391237,0.00011699951,0.00052023167,0.0000767025],"domain_scores_gemma":[0.99385875,0.004069709,0.00022349239,0.00028382603,0.001322206,0.00024206439],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003072313,0.0013714371,0.0012931068,0.0017604707,0.0008835357,0.0017248951,0.0017308383,0.0014283975,0.008373672],"category_scores_gemma":[0.014460853,0.00048562937,0.0014071915,0.0011216081,0.002873517,0.0019152939,0.0030812626,0.0030184155,0.0014605945],"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.00028717244,0.00007643714,0.00059238134,0.00048860954,0.0000722356,0.00025721308,0.00022489748,0.22806303,0.006825912,0.70856696,0.006945949,0.047599234],"study_design_scores_gemma":[0.000010864133,0.00005188854,0.0001488167,0.000041839714,0.00001267583,0.00010076964,0.00003825758,0.91571134,0.0012249738,0.07906448,0.0035759413,0.000018231307],"about_ca_topic_score_codex":0.0024594082,"about_ca_topic_score_gemma":0.0010697065,"teacher_disagreement_score":0.008373672,"about_ca_system_score_codex":0.0011515185,"about_ca_system_score_gemma":0.0015082166,"threshold_uncertainty_score":0.028012753},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011496304,0.000058435096,0.9826355,0.000061046965,0.00004236342,0.000028818484,0.0001472864,0.001411677,0.0041185906],"genre_scores_gemma":[0.10064684,0.00024259186,0.8918248,0.00006378423,0.000027733451,0.00007151858,0.0007373267,0.0007105755,0.005674962],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997696,0.000035758127,0.000010866681,0.00002810373,0.00013114039,0.000024559355],"domain_scores_gemma":[0.9995796,0.00016877662,0.000018858827,0.00013739918,0.00007820919,0.000017269775],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00030258053,0.0005343785,0.00053893815,0.0004858449,0.00020175589,0.0010075172,0.0006479168,0.0004910551,0.0057607],"category_scores_gemma":[0.0018731955,0.00028666327,0.0004298003,0.0009879825,0.00042034395,0.0010896132,0.0013985358,0.0009788685,0.0028745336],"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.00018451863,0.000066403205,0.0004878901,0.00019575744,0.00003174608,0.00015636747,0.00014703254,0.08588625,0.061704297,0.056629904,0.012691351,0.7818185],"study_design_scores_gemma":[0.000033315653,0.000073938405,0.0004234045,0.000030806776,0.000016298003,0.0002764388,0.00012833427,0.8603419,0.045237932,0.073454365,0.019962586,0.000020717593],"about_ca_topic_score_codex":0.0012477618,"about_ca_topic_score_gemma":0.001981503,"teacher_disagreement_score":0.0057607,"about_ca_system_score_codex":0.00020695201,"about_ca_system_score_gemma":0.0003780808,"threshold_uncertainty_score":0.019271433},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0052690003,0.00007082051,0.9634907,0.00006203392,0.00009554093,0.000034658242,0.00031922295,0.025555128,0.0051028617],"genre_scores_gemma":[0.20680873,0.00028965666,0.7676464,0.00029524567,0.00013290961,0.00041027687,0.0023133792,0.010222202,0.011881145],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984744,0.00022104172,0.00013759483,0.0002626751,0.00075860263,0.00014567949],"domain_scores_gemma":[0.99528366,0.0024137786,0.00029694583,0.0011426668,0.0006712525,0.00019161917],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0023418954,0.0012923342,0.0016855554,0.0015161026,0.0006971516,0.0015749894,0.0026157124,0.0022130895,0.016746188],"category_scores_gemma":[0.014662436,0.0011491325,0.0014243062,0.00090817467,0.0012798705,0.0027660856,0.0035779746,0.002268659,0.004838985],"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.0010051049,0.00033395784,0.0033087109,0.00072265515,0.0002348251,0.00029119098,0.00028280588,0.43316993,0.027732747,0.20915498,0.034775984,0.28898716],"study_design_scores_gemma":[0.00006529659,0.000035135556,0.00015498056,0.000029492137,0.000018716086,0.000051383875,0.000008258376,0.9508531,0.010509973,0.03163998,0.0066106184,0.00002308489],"about_ca_topic_score_codex":0.001977249,"about_ca_topic_score_gemma":0.002776451,"teacher_disagreement_score":0.016746188,"about_ca_system_score_codex":0.0010338046,"about_ca_system_score_gemma":0.0022047563,"threshold_uncertainty_score":0.05602157},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.003068594,0.00029704857,0.96910524,0.00016987638,0.00046323406,0.000062154286,0.000101463556,0.000322568,0.026409868],"genre_scores_gemma":[0.07800059,0.0007626953,0.8643143,0.00040165908,0.00042325916,0.00024190778,0.00044210046,0.0009669784,0.054446485],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997296,0.00008202081,0.000009683996,0.00001942716,0.00013740761,0.000021913942],"domain_scores_gemma":[0.99970764,0.000085300504,0.000017839626,0.000054424105,0.000089670386,0.000045070745],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00047464113,0.0007763714,0.00077128806,0.00056891714,0.0004417024,0.0010015626,0.0015938127,0.0012638253,0.0153423445],"category_scores_gemma":[0.0010844402,0.00042138304,0.0007419081,0.00062406244,0.00054185686,0.0009006517,0.0017620727,0.0020205518,0.005905801],"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.00022922293,0.00015296867,0.0002449994,0.0003380764,0.000097174176,0.00028222948,0.00014657939,0.2650919,0.024272159,0.4459587,0.021685354,0.24150074],"study_design_scores_gemma":[0.00003971307,0.000054267774,0.000070167196,0.00003405152,0.00001442249,0.00012191713,0.00001924333,0.9364372,0.0026652245,0.037164632,0.02335682,0.00002242084],"about_ca_topic_score_codex":0.0005403166,"about_ca_topic_score_gemma":0.0007926966,"teacher_disagreement_score":0.0153423445,"about_ca_system_score_codex":0.00026231134,"about_ca_system_score_gemma":0.0007078032,"threshold_uncertainty_score":0.05132526},"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":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0015416176,0.052875265,0.67590135,0.0015565169,0.009514498,0.000075927186,0.0007659034,0.0016660057,0.25610283],"genre_scores_gemma":[0.013474664,0.03625865,0.2146496,0.00064999703,0.0032738438,0.00021583395,0.0014606675,0.0017725646,0.72824425],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9997763,0.000032528565,0.000009204367,0.000037431015,0.00013199612,0.000012479104],"domain_scores_gemma":[0.9997441,0.00009522634,0.000010980086,0.00003742517,0.000088199995,0.000024077748],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00029324504,0.0014055851,0.001053506,0.0013050411,0.0003818075,0.001763516,0.0006025539,0.0005890249,0.04083322],"category_scores_gemma":[0.00075248576,0.0005137118,0.0007453415,0.0020519667,0.00065277173,0.0014924593,0.0009255607,0.0016825221,0.030806389],"study_design_candidate":"not_applicable","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.000024969282,0.000042818985,0.00009558805,0.0005458155,0.000030955867,0.000052807918,0.00008861983,0.010104235,0.0045674457,0.12872435,0.3280695,0.5276529],"study_design_scores_gemma":[0.000010950298,0.000032682135,0.00039220267,0.00026709397,0.000018558268,0.00026344275,0.00005158286,0.02831663,0.0023976665,0.15153246,0.81669486,0.000021887847],"about_ca_topic_score_codex":0.000616289,"about_ca_topic_score_gemma":0.0009278671,"teacher_disagreement_score":0.04083322,"about_ca_system_score_codex":0.00047309967,"about_ca_system_score_gemma":0.0005403089,"threshold_uncertainty_score":0.13660067},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.001920759,0.0006100255,0.98269,0.00022976355,0.000389504,0.000023257913,0.000086903296,0.00019869441,0.013851184],"genre_scores_gemma":[0.1894719,0.0025868616,0.6793543,0.00048520404,0.0006326974,0.00041072877,0.0005086563,0.0022473426,0.12430234],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996861,0.000115069284,0.000015699925,0.000035117788,0.00012526523,0.00002274769],"domain_scores_gemma":[0.9996438,0.00016141348,0.000022764349,0.000053198775,0.000094912175,0.000023955185],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005453993,0.0010835495,0.0010488929,0.0006638409,0.0005272502,0.0010687573,0.0011076132,0.0011388367,0.011184194],"category_scores_gemma":[0.0011483293,0.00036903104,0.0007802299,0.0007429736,0.0010620842,0.0011709505,0.0012581097,0.0018304243,0.0024075394],"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.000111671936,0.000032121116,0.000087178625,0.0002226972,0.00004849797,0.0000656309,0.00008521982,0.20608337,0.0059666615,0.706044,0.011788803,0.06946413],"study_design_scores_gemma":[0.000012716104,0.000032123746,0.00006542665,0.000027962158,0.00001598927,0.000036272544,0.000019772508,0.8153499,0.0020835362,0.16171339,0.02062498,0.000017981642],"about_ca_topic_score_codex":0.0017035421,"about_ca_topic_score_gemma":0.0017234546,"teacher_disagreement_score":0.011184194,"about_ca_system_score_codex":0.0008341192,"about_ca_system_score_gemma":0.0007941259,"threshold_uncertainty_score":0.03741485},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.015713783,0.00046634008,0.9136948,0.000787113,0.0003644507,0.000045375204,0.00016476944,0.00092501316,0.067838326],"genre_scores_gemma":[0.3934104,0.000606208,0.5514718,0.00041908547,0.00020034229,0.000118284835,0.000299998,0.0014278895,0.052046053],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997359,0.00006952879,0.000008488624,0.000031531243,0.00012512974,0.000029393941],"domain_scores_gemma":[0.99970394,0.00008343682,0.000026737784,0.00007341495,0.00008110059,0.00003128994],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00040698977,0.00046226237,0.00050864957,0.0007051965,0.0006515662,0.0024156165,0.0015630212,0.0009920743,0.015801638],"category_scores_gemma":[0.0012162908,0.00028160846,0.00055295124,0.00062580104,0.001224852,0.0012512768,0.0012290048,0.0014949426,0.0026791377],"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.00008850549,0.000034100176,0.000111115725,0.00008479294,0.0000106111775,0.00009696549,0.00010221828,0.062376525,0.0057041356,0.8996377,0.0036557734,0.028097633],"study_design_scores_gemma":[0.000039723935,0.00003550207,0.00017473032,0.000027081234,0.0000081111,0.00011238945,0.000062464605,0.7011362,0.0036648961,0.26974705,0.024969906,0.00002187987],"about_ca_topic_score_codex":0.0019381202,"about_ca_topic_score_gemma":0.0020863742,"teacher_disagreement_score":0.015801638,"about_ca_system_score_codex":0.0008095036,"about_ca_system_score_gemma":0.00049223466,"threshold_uncertainty_score":0.05286175},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.22525828,0.002972122,0.5746574,0.002602901,0.0009784806,0.00009481881,0.0001999932,0.00066506444,0.19257101],"genre_scores_gemma":[0.77570266,0.0011800384,0.1640748,0.00022749862,0.00036380187,0.00010421239,0.0002169321,0.00039209056,0.057737973],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99956506,0.00019572918,0.000016589529,0.00003196215,0.00016000961,0.000030681647],"domain_scores_gemma":[0.9991266,0.0005328907,0.00006407062,0.0000847233,0.00012109993,0.00007056559],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000551489,0.0005989864,0.000558171,0.0007385908,0.001053059,0.0010833492,0.000685989,0.001219068,0.0048134355],"category_scores_gemma":[0.0040093507,0.0003799713,0.00050594343,0.00079745083,0.002232963,0.0013773062,0.0013912978,0.0016411805,0.00052998087],"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.000059107613,0.000015164029,0.0001928554,0.00007045761,0.000007851487,0.0001345281,0.00017359345,0.03936628,0.0011335562,0.94576484,0.0033928733,0.0096889855],"study_design_scores_gemma":[0.000022375254,0.000037329046,0.0002283798,0.000027109147,0.0000073605634,0.00014895762,0.00006770539,0.40572155,0.0011022618,0.5850358,0.0075835343,0.00001767805],"about_ca_topic_score_codex":0.0015399451,"about_ca_topic_score_gemma":0.0018554748,"teacher_disagreement_score":0.0048134355,"about_ca_system_score_codex":0.00067257683,"about_ca_system_score_gemma":0.00047578674,"threshold_uncertainty_score":0.016102552},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.024031674,0.0003783023,0.93695134,0.00029835256,0.00039089104,0.000080034595,0.00021554346,0.0007695799,0.036884215],"genre_scores_gemma":[0.34830415,0.00031881148,0.6327631,0.00028982462,0.00011369049,0.00019589177,0.00048660816,0.0006347947,0.016893154],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997148,0.0000671352,0.000012279302,0.00004161207,0.00012829737,0.000035853787],"domain_scores_gemma":[0.9996561,0.00014144783,0.000018789104,0.000098569246,0.00006752441,0.000017523831],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00036981027,0.00061294035,0.0008047432,0.0004665118,0.00028793392,0.0008342627,0.0013576173,0.0012719319,0.011919783],"category_scores_gemma":[0.0016748314,0.00041839742,0.00049621065,0.00060243305,0.0005704568,0.00095536857,0.0017467893,0.0015039645,0.002008249],"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.00048247576,0.0001133289,0.00032181205,0.0005199758,0.00004846617,0.00025020205,0.0001473481,0.44921502,0.03634166,0.17052908,0.018874956,0.32315576],"study_design_scores_gemma":[0.00003080942,0.000037412927,0.00007665017,0.000023250715,0.000006956541,0.00009243316,0.000020221967,0.95617396,0.005984587,0.032890264,0.0046526166,0.0000107977485],"about_ca_topic_score_codex":0.00036214944,"about_ca_topic_score_gemma":0.00062896323,"teacher_disagreement_score":0.011919783,"about_ca_system_score_codex":0.00039663704,"about_ca_system_score_gemma":0.00039007768,"threshold_uncertainty_score":0.039875686},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0032438799,0.010819695,0.9324813,0.0005272248,0.0017968842,0.000023392757,0.000093631825,0.00036784186,0.050646137],"genre_scores_gemma":[0.12552738,0.017938394,0.58618677,0.00057115935,0.002600172,0.00017946774,0.0005941321,0.0011906901,0.26521188],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99978167,0.000051116025,0.000009956657,0.00002343572,0.00012247394,0.000011271971],"domain_scores_gemma":[0.9996661,0.00017084459,0.000014683496,0.000038828977,0.00008573859,0.000023846582],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000372718,0.0007425924,0.0005106567,0.0008954121,0.00035054216,0.0010196865,0.0008968385,0.0008744514,0.009287921],"category_scores_gemma":[0.00093014236,0.00026010833,0.0005611944,0.0009707554,0.0010518644,0.0012903842,0.00089775026,0.0015446505,0.0033951001],"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.000023504643,0.00005122642,0.00008836423,0.00033685484,0.00002932163,0.000053578442,0.00016173936,0.039232455,0.0072122337,0.7558743,0.023844095,0.17309225],"study_design_scores_gemma":[0.000008930288,0.00002502732,0.00020499389,0.000082121864,0.000013311445,0.0001246868,0.000057339486,0.35171294,0.0024229314,0.52541465,0.11990861,0.000024464192],"about_ca_topic_score_codex":0.0008802078,"about_ca_topic_score_gemma":0.0014115651,"teacher_disagreement_score":0.009287921,"about_ca_system_score_codex":0.00037975708,"about_ca_system_score_gemma":0.00035869662,"threshold_uncertainty_score":0.031071186},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04934888,0.0011509202,0.86881626,0.00053288654,0.00044647857,0.0001258392,0.00065538136,0.0041647507,0.074758545],"genre_scores_gemma":[0.5861893,0.0011426222,0.36993083,0.0002763281,0.0001243505,0.00024732383,0.0010853016,0.0011109939,0.03989283],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9998615,0.00003034013,0.0000055820774,0.000013509318,0.000071913535,0.00001715758],"domain_scores_gemma":[0.9997135,0.00008966398,0.000016000888,0.000056273737,0.00009083511,0.000033758748],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00018320773,0.00043963795,0.00063187454,0.00033242296,0.00038422886,0.00079300674,0.0016444088,0.0008864512,0.007980154],"category_scores_gemma":[0.0010945695,0.000411673,0.00040451062,0.0005834439,0.00039246524,0.00093456986,0.0012373031,0.0011173759,0.0018880329],"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.00015887147,0.00011026513,0.00067027676,0.00014051734,0.00006666656,0.00014742727,0.00007783043,0.88077205,0.013986783,0.045290094,0.009588031,0.04899118],"study_design_scores_gemma":[0.000011413754,0.000010385723,0.00004879973,0.000005360852,0.0000034436769,0.000021142489,0.0000042758656,0.9913489,0.001527995,0.0039671822,0.0030454653,0.0000056177278],"about_ca_topic_score_codex":0.002738054,"about_ca_topic_score_gemma":0.0032869952,"teacher_disagreement_score":0.007980154,"about_ca_system_score_codex":0.00044015332,"about_ca_system_score_gemma":0.0007024248,"threshold_uncertainty_score":0.026696324},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.527067,0.0029381076,0.38169,0.000808207,0.00022305842,0.00005958245,0.00067641656,0.00063169125,0.08590601],"genre_scores_gemma":[0.98622894,0.0009466329,0.006805582,0.000029641707,0.00011992065,0.000022357117,0.0001230093,0.00009058182,0.005633286],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9999229,0.0000146900975,0.0000033861706,0.000019631409,0.000030228572,0.000009195582],"domain_scores_gemma":[0.9995732,0.00021999635,0.00007413942,0.00005204037,0.00005084567,0.000029732353],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00024107828,0.0003434131,0.0003677182,0.0006555664,0.00021959294,0.00093191693,0.00036515426,0.00038708994,0.0021239968],"category_scores_gemma":[0.001850056,0.00044092536,0.00017348227,0.0006239173,0.000710962,0.0020074444,0.00031983264,0.0007384289,0.00023484389],"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.00012975231,0.0001128566,0.01040682,0.00018495282,0.00004813883,0.00034276798,0.00033101873,0.4080192,0.040435497,0.48228863,0.0043745777,0.053325783],"study_design_scores_gemma":[0.000014061349,0.00005463237,0.01561855,0.000030362233,0.000032666005,0.00033365557,0.00012891863,0.51063526,0.0052879425,0.4618505,0.0059422473,0.000071248614],"about_ca_topic_score_codex":0.0007955983,"about_ca_topic_score_gemma":0.0006956152,"teacher_disagreement_score":0.0021239968,"about_ca_system_score_codex":0.00047901564,"about_ca_system_score_gemma":0.00023326793,"threshold_uncertainty_score":0.0071055293},"labels":[],"label_agreement":null}]}