{"meta":{"query_hash":"be689f0a511f","filters":{"venue":"Numerical Algorithms"},"cohort_total":74,"direct_labels_cover":0,"predictions_cover":74,"exported":74,"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/be689f0a511f","api":"https://metacan.xera.ac/api/v1/cohort?venue=Numerical+Algorithms"},"results":[{"id":"W1606462009","doi":"10.1023/a:1016030016985","title":"Block Orderings for Tensor-Product Grids in Two and Three Dimensions","year":2002,"lang":"en","type":"article","venue":"Numerical Algorithms","topic":"Matrix Theory and Algorithms","field":"Computer Science","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":"University of British Columbia","funders":"","keywords":"Numerical analysis; Mathematics; Theory of computation; Diagonal; Applied mathematics; Convergence (economics); Lexicographical order; Mathematical optimization; Iterative method; Algorithm; Mathematical analysis; Combinatorics; Geometry","score_opus":0.022956990962696152,"score_gpt":0.26152199159602724,"score_spread":0.23856500063333108,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1606462009","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.020637091,0.0005956485,0.96672165,0.0002910692,0.0002463793,0.00007975395,0.00035296075,0.0009101948,0.010165231],"genre_scores_gemma":[0.176577,0.00089609955,0.80701905,0.00019603762,0.00010445135,0.00033455537,0.0009468525,0.001077133,0.012848858],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994855,0.00018469278,0.000040257426,0.000032241,0.00019708276,0.000060241706],"domain_scores_gemma":[0.99822754,0.00053303206,0.00012938636,0.00045271488,0.0004743859,0.00018287393],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00085122365,0.00054330134,0.0006205512,0.0008731313,0.000820584,0.0012624022,0.0009588493,0.00048006405,0.008160492],"category_scores_gemma":[0.0039581847,0.00037891883,0.00037901473,0.0014927428,0.00084865635,0.0016698979,0.0010233106,0.0012747913,0.002056616],"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.00026288893,0.00010594394,0.00071559264,0.00022119076,0.000022312264,0.00008229193,0.0002596846,0.08576814,0.007590092,0.7352653,0.020472022,0.14923456],"study_design_scores_gemma":[0.000064728345,0.000072939874,0.0002738358,0.00003549223,0.000013634976,0.000046657704,0.000080894155,0.54359835,0.0048738034,0.4183208,0.032586593,0.000032233555],"about_ca_topic_score_codex":0.0034828351,"about_ca_topic_score_gemma":0.008099482,"teacher_disagreement_score":0.008160492,"about_ca_system_score_codex":0.0007131677,"about_ca_system_score_gemma":0.0010265816,"threshold_uncertainty_score":0.027299583},"labels":[],"label_agreement":null},{"id":"W1620056035","doi":"10.1023/a:1019147900265","title":"Birkhoff interpolation on unity and on Möbius transform of the roots of unity","year":2000,"lang":"en","type":"article","venue":"Numerical Algorithms","topic":"Mathematical functions and polynomials","field":"Mathematics","cited_by":9,"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 Alberta","funders":"","keywords":"Mathematics; Interpolation (computer graphics); Theory of computation; Combinatorics; Root of unity; Type (biology); Pure mathematics; Mathematical analysis; Discrete mathematics; Algebra over a field; Algorithm; Computer science; Physics","score_opus":0.03466162384952067,"score_gpt":0.29472631578613484,"score_spread":0.2600646919366142,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1620056035","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.101456456,0.0042698183,0.8106001,0.0013979069,0.0007504278,0.000051211486,0.00011124332,0.00041089216,0.080952],"genre_scores_gemma":[0.77651846,0.00368628,0.18948992,0.00043403788,0.00070716045,0.00008586197,0.00015504743,0.00049944164,0.02842379],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989748,0.00042656422,0.00003521886,0.000117122785,0.00029694627,0.00014929274],"domain_scores_gemma":[0.99821043,0.0009891154,0.00015852568,0.00025228903,0.0002589906,0.00013069683],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021325632,0.00079115713,0.001030303,0.002611306,0.0010109089,0.0020352092,0.0012445315,0.0007974641,0.0048871953],"category_scores_gemma":[0.011695578,0.00034382028,0.0006496047,0.0022580845,0.003798367,0.003635501,0.0024292218,0.0035142407,0.0012385106],"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.000036678925,0.000005650584,0.00009149312,0.000027336677,0.0000030026115,0.000014313297,0.00010287055,0.0034515732,0.00053755805,0.98322994,0.0004642613,0.01203538],"study_design_scores_gemma":[0.000011068818,0.000016299757,0.000109960274,0.000028600962,0.000004225584,0.0000376587,0.000048371425,0.031065112,0.0010311932,0.9626508,0.004982035,0.000014736983],"about_ca_topic_score_codex":0.0020154812,"about_ca_topic_score_gemma":0.0011917129,"teacher_disagreement_score":0.0048871953,"about_ca_system_score_codex":0.0016760151,"about_ca_system_score_gemma":0.00087679666,"threshold_uncertainty_score":0.016349316},"labels":[],"label_agreement":null},{"id":"W1630012462","doi":"10.1023/a:1025516122243","title":"Galerkin Methods for Nonlinear Ordinary Differential Equation with Impulses","year":2003,"lang":"en","type":"article","venue":"Numerical Algorithms","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":"Université de Sherbrooke","funders":"","keywords":"Mathematics; Ordinary differential equation; Uniqueness; Theory of computation; Simple (philosophy); Mathematical analysis; Applied mathematics; Numerical analysis; Differential equation; Algorithm","score_opus":0.04149493161548064,"score_gpt":0.3580176124486658,"score_spread":0.3165226808331852,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1630012462","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.0046377927,0.0010660207,0.9900213,0.00026588826,0.0001833757,0.000026012125,0.00002943863,0.00017805921,0.0035921375],"genre_scores_gemma":[0.24682587,0.0040028547,0.70645434,0.00029265074,0.00057441636,0.0004763775,0.00031294828,0.00073122536,0.040329408],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994646,0.00025051404,0.000023053783,0.000036895955,0.00019351265,0.00003150736],"domain_scores_gemma":[0.99880993,0.00079865806,0.00008627489,0.00008894007,0.00016825918,0.00004789965],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010259041,0.00089358527,0.0009451422,0.0008936721,0.00069622835,0.0012010725,0.0010342874,0.0016493205,0.0025920838],"category_scores_gemma":[0.003763134,0.00051420444,0.00061768765,0.00089935126,0.0018836727,0.0015057436,0.002245955,0.0029616768,0.0009053784],"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.00012352277,0.00014460222,0.00047749942,0.00043906155,0.00006440024,0.00013287643,0.00039560883,0.5228189,0.007918239,0.34037283,0.0044468194,0.12266561],"study_design_scores_gemma":[0.00001366394,0.000012454717,0.00007422833,0.000021947923,0.0000060367497,0.00002832895,0.000021582051,0.9277606,0.00095936435,0.0656318,0.005457456,0.000012608922],"about_ca_topic_score_codex":0.0015306867,"about_ca_topic_score_gemma":0.0015422513,"teacher_disagreement_score":0.0025920838,"about_ca_system_score_codex":0.00057740044,"about_ca_system_score_gemma":0.0009020942,"threshold_uncertainty_score":0.008671403},"labels":[],"label_agreement":null},{"id":"W1645461841","doi":"10.1023/a:1016652822276","title":"Birkhoff interpolation on non-uniformly distributed roots of unity","year":2000,"lang":"en","type":"article","venue":"Numerical Algorithms","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":"University of Alberta","funders":"","keywords":"Mathematics; Maple; Interpolation (computer graphics); Theory of computation; Linear interpolation; Combinatorics; Pure mathematics; Discrete mathematics; Applied mathematics; Mathematical analysis; Algorithm; Computer science; Motion (physics)","score_opus":0.00658792249143084,"score_gpt":0.23754368707295415,"score_spread":0.2309557645815233,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1645461841","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.019114625,0.00041669974,0.9710498,0.0001568185,0.00014428567,0.000028970604,0.000032670552,0.0002265393,0.0088296095],"genre_scores_gemma":[0.4660178,0.0012990473,0.514638,0.00019985264,0.00016881392,0.00015766373,0.00016574466,0.0006740211,0.016679006],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9984982,0.0007397149,0.00005689509,0.00012227555,0.00045098184,0.00013190634],"domain_scores_gemma":[0.9966499,0.0021264416,0.00016918276,0.00049702247,0.00046261764,0.00009477033],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0030651137,0.0010660934,0.0014330299,0.0016124302,0.00068912865,0.0013015461,0.0014444847,0.0010799916,0.0043813465],"category_scores_gemma":[0.016557036,0.00050313125,0.000510516,0.0020903044,0.0021942297,0.002399391,0.0025128257,0.002627322,0.0014314157],"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.00039622904,0.000055860648,0.00035555832,0.00026787398,0.000023488545,0.000111326764,0.0003551283,0.11807084,0.008534311,0.771464,0.0022674336,0.09809787],"study_design_scores_gemma":[0.00004014735,0.000044565964,0.00014586886,0.000053578802,0.000010014111,0.0000678447,0.000053086766,0.75024885,0.00586765,0.2381251,0.005313907,0.000029346444],"about_ca_topic_score_codex":0.0015588439,"about_ca_topic_score_gemma":0.0015484064,"teacher_disagreement_score":0.0043813465,"about_ca_system_score_codex":0.0010110693,"about_ca_system_score_gemma":0.0007119641,"threshold_uncertainty_score":0.01621002},"labels":[],"label_agreement":null},{"id":"W1655710639","doi":"10.1023/a:1021190918665","title":"Global Error Estimators for Order 7, 8 Runge–Kutta Pairs","year":2002,"lang":"en","type":"article","venue":"Numerical Algorithms","topic":"Numerical methods for differential equations","field":"Mathematics","cited_by":14,"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":"Mathematics; Estimator; Runge–Kutta methods; Theory of computation; Initial value problem; Applied mathematics; Approximation error; Quadrature (astronomy); Sequence (biology); Differential equation; Mathematical analysis; Algorithm; Statistics","score_opus":0.12715866096387993,"score_gpt":0.3883227309792588,"score_spread":0.2611640700153789,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1655710639","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.012601132,0.00023346947,0.9856134,0.000037429218,0.000058654063,0.000029227982,0.000036892878,0.00029099864,0.001098794],"genre_scores_gemma":[0.36652678,0.00041830254,0.6227973,0.0001233523,0.00016305922,0.00036071474,0.00058597204,0.001058364,0.007966081],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9980907,0.00085422065,0.00011655913,0.00029522483,0.000483999,0.00015922388],"domain_scores_gemma":[0.9927049,0.0033568298,0.0008211611,0.0013949138,0.0014740605,0.00024814412],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0059547797,0.0013980378,0.0016334513,0.0020367992,0.0006954902,0.0017080497,0.0013906487,0.0019882803,0.00453793],"category_scores_gemma":[0.015653381,0.0007273753,0.0010839088,0.0008201427,0.0014693387,0.0030934482,0.003615295,0.0019853371,0.0015896903],"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.0013545769,0.00025298225,0.0071601337,0.00058413984,0.000385447,0.00015827118,0.0007086826,0.32917175,0.021551326,0.25501192,0.005913779,0.377747],"study_design_scores_gemma":[0.00008077904,0.00040725054,0.002336784,0.00014531924,0.00011660125,0.00012140881,0.000110120985,0.87785244,0.020723516,0.092364036,0.0056573665,0.00008428812],"about_ca_topic_score_codex":0.0003437834,"about_ca_topic_score_gemma":0.00047093214,"teacher_disagreement_score":0.0059547797,"about_ca_system_score_codex":0.00055647193,"about_ca_system_score_gemma":0.00078572653,"threshold_uncertainty_score":0.031492293},"labels":[],"label_agreement":null},{"id":"W1667785455","doi":"10.1023/a:1021108323034","title":"A New View of the Computational Complexity of IVP for ODE","year":2002,"lang":"en","type":"article","venue":"Numerical Algorithms","topic":"Numerical methods for differential equations","field":"Mathematics","cited_by":16,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics","score_opus":0.21892451338000948,"score_gpt":0.3802055099552841,"score_spread":0.16128099657527464,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1667785455","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.005202675,0.0019248164,0.9662212,0.0047774035,0.00065737375,0.00003741124,0.00012483312,0.00022965667,0.020824626],"genre_scores_gemma":[0.3167835,0.007601599,0.64006585,0.0044163927,0.0069750613,0.0005563836,0.0004573831,0.0010760047,0.02206793],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99650073,0.000952141,0.0001833908,0.00053207116,0.0016162287,0.00021533013],"domain_scores_gemma":[0.9876337,0.008503159,0.00044471576,0.0018730654,0.0011670213,0.0003784602],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0038426497,0.001873824,0.0017130221,0.0021447039,0.0015276558,0.0056964112,0.0044298773,0.0026549262,0.010259413],"category_scores_gemma":[0.021399727,0.0009255607,0.0015708946,0.0018753409,0.0068129697,0.019322619,0.0048192614,0.011142511,0.0014675027],"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.000042770716,0.000032155698,0.00019952576,0.00014291496,0.000020915953,0.00007097964,0.00011817181,0.020034274,0.0009364641,0.9579398,0.0044697486,0.015992114],"study_design_scores_gemma":[0.000009985462,0.000018298453,0.000071308146,0.000024207042,0.000008901291,0.00005970208,0.000024465564,0.14004646,0.0005121919,0.8536367,0.0055695507,0.000018256984],"about_ca_topic_score_codex":0.0014201136,"about_ca_topic_score_gemma":0.0009894709,"teacher_disagreement_score":0.010259413,"about_ca_system_score_codex":0.0014628195,"about_ca_system_score_gemma":0.0012188868,"threshold_uncertainty_score":0.03432119},"labels":[],"label_agreement":null},{"id":"W1964064560","doi":"10.1007/s11075-008-9158-y","title":"Closed-form evaluations of certain definite integrals by employing the Cauchy integral theorem","year":2008,"lang":"en","type":"article","venue":"Numerical Algorithms","topic":"Advanced Mathematical Identities","field":"Mathematics","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":"University of Victoria","funders":"","keywords":"Mathematics; Cauchy's integral formula; Methods of contour integration; Cauchy's integral theorem; Cauchy distribution; Residue theorem; Computation; Pure mathematics; Theory of computation; Function (biology); Improper integral; Cauchy principal value; Mathematical analysis; Integral equation; Cauchy problem; Initial value problem; Singular integral; Cauchy boundary condition; Boundary value problem","score_opus":0.08544542573919696,"score_gpt":0.3618550979825634,"score_spread":0.27640967224336643,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1964064560","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.008315766,0.00012613885,0.9857679,0.00009117609,0.00005340123,0.000021072381,0.000016009952,0.0001277106,0.005480876],"genre_scores_gemma":[0.25569353,0.0006910379,0.73073375,0.00015229055,0.00013194175,0.00012244664,0.00010238891,0.0004554669,0.011917175],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99940026,0.00020145507,0.00003570478,0.00005437023,0.0002712783,0.000036911704],"domain_scores_gemma":[0.99829715,0.0008292357,0.00010677253,0.000191067,0.00049878465,0.00007706828],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0026036943,0.0007959711,0.0006923236,0.0010976095,0.00057298335,0.0022552588,0.0010887028,0.0010015935,0.0047145146],"category_scores_gemma":[0.009138815,0.00032819607,0.00053451123,0.0008366199,0.001500267,0.0030620862,0.0015078261,0.0015902929,0.0011842704],"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.00006649365,0.00008240436,0.00026337805,0.00017190457,0.000025316562,0.00008068053,0.00022070395,0.039211325,0.006090546,0.8795003,0.0018375742,0.07244933],"study_design_scores_gemma":[0.000027939934,0.000037863196,0.00011527416,0.0000511287,0.000013753271,0.00012604431,0.00006537384,0.62966865,0.0051867557,0.3597738,0.004908456,0.000024920966],"about_ca_topic_score_codex":0.00060119096,"about_ca_topic_score_gemma":0.0010426408,"teacher_disagreement_score":0.0047145146,"about_ca_system_score_codex":0.00066817104,"about_ca_system_score_gemma":0.0009791693,"threshold_uncertainty_score":0.015771627},"labels":[],"label_agreement":null},{"id":"W1969652671","doi":"10.1007/s11075-013-9770-3","title":"Stability of rootfinding for barycentric Lagrange interpolants","year":2013,"lang":"en","type":"article","venue":"Numerical Algorithms","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":24,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"","keywords":"Mathematics; Eigenvalues and eigenvectors; Barycentric coordinate system; Companion matrix; Lagrange polynomial; Basis (linear algebra); Condition number; Monomial basis; Polynomial basis; Matrix (chemical analysis); Monomial; Polynomial; Theory of computation; Computation; Applied mathematics; Univariate; Matrix polynomial; Polynomial matrix; Combinatorics; Mathematical analysis; Algorithm; Geometry","score_opus":0.020313011535163076,"score_gpt":0.2514376002324644,"score_spread":0.23112458869730135,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1969652671","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.09984847,0.00033840237,0.8910086,0.00033354046,0.0000803324,0.00005401596,0.00008977193,0.0002929665,0.0079539735],"genre_scores_gemma":[0.79722506,0.00028065903,0.19338423,0.00011650185,0.00006209552,0.00014213669,0.00023274288,0.00046608516,0.008090453],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985973,0.0005602747,0.000046954687,0.0001877326,0.00048145372,0.00012635207],"domain_scores_gemma":[0.99031234,0.0071171937,0.00061410625,0.0005837793,0.0011113613,0.00026119707],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0030003195,0.0006906781,0.0008701738,0.0013564987,0.001184914,0.0025097057,0.0018669846,0.0012699649,0.0047131544],"category_scores_gemma":[0.026511278,0.00059070764,0.00047903598,0.001040268,0.0024035985,0.0022150984,0.0030638187,0.0018805884,0.0009482892],"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.00081005436,0.00009321086,0.002093912,0.00020580222,0.000043842145,0.00012642532,0.0006321454,0.31653607,0.009468251,0.57871205,0.0029261063,0.08835219],"study_design_scores_gemma":[0.000021973474,0.000038152888,0.00014462412,0.000026602107,0.0000054640304,0.000029055704,0.0000671013,0.8536024,0.003264333,0.14193381,0.00084856915,0.000017816685],"about_ca_topic_score_codex":0.0027224843,"about_ca_topic_score_gemma":0.0024256953,"teacher_disagreement_score":0.0047131544,"about_ca_system_score_codex":0.0013372819,"about_ca_system_score_gemma":0.0014166753,"threshold_uncertainty_score":0.015867412},"labels":[],"label_agreement":null},{"id":"W1974529128","doi":"10.1007/s11075-014-9901-5","title":"A simple moving mesh method for blowup problems","year":2014,"lang":"en","type":"article","venue":"Numerical Algorithms","topic":"Computational Fluid Dynamics and Aerodynamics","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":"McMaster University; Cape Breton University","funders":"","keywords":"Mathematics; Diagonal; Nonlinear system; Simple (philosophy); Generator (circuit theory); Mathematical analysis; Space (punctuation); Partial differential equation; Infinity; Theory of computation; Applied mathematics; Geometry; Algorithm; Computer science; Physics","score_opus":0.008022311898380478,"score_gpt":0.24659954403469952,"score_spread":0.23857723213631904,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1974529128","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.0071463296,0.00034421662,0.98518026,0.00014722995,0.00056006626,0.000060176113,0.00007025706,0.00040824883,0.006083229],"genre_scores_gemma":[0.1461004,0.00062034646,0.8215017,0.00031651263,0.00033931906,0.00030563932,0.00030481818,0.00070483837,0.029806415],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99976784,0.0000536037,0.000012810725,0.00002307235,0.00012822832,0.000014546081],"domain_scores_gemma":[0.9997644,0.000072787334,0.000013893852,0.00004967131,0.00007007885,0.000029096876],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00036345926,0.00047787433,0.0007612515,0.0006071548,0.00056667824,0.00061469455,0.0015951935,0.0012058796,0.008463383],"category_scores_gemma":[0.0011818114,0.00028086815,0.00063773774,0.0005900273,0.0005876693,0.0009073547,0.0011698435,0.0010306155,0.0017687567],"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.00032034545,0.00014308978,0.00057129894,0.0005172274,0.00009841002,0.0004309334,0.00021204258,0.19727331,0.05715787,0.32656607,0.014910656,0.4017987],"study_design_scores_gemma":[0.000045610923,0.000077176264,0.00022838588,0.000022114597,0.00002053596,0.00011408349,0.000018246325,0.9380648,0.0030052555,0.03354716,0.024832191,0.000024521736],"about_ca_topic_score_codex":0.0010045856,"about_ca_topic_score_gemma":0.0013344492,"teacher_disagreement_score":0.008463383,"about_ca_system_score_codex":0.00023734545,"about_ca_system_score_gemma":0.0004141688,"threshold_uncertainty_score":0.028312862},"labels":[],"label_agreement":null},{"id":"W1975156486","doi":"10.1023/b:numa.0000049464.45146.88","title":"Exact Solutions of Extended Boussinesq Equations","year":2004,"lang":"en","type":"article","venue":"Numerical Algorithms","topic":"Coastal and Marine Dynamics","field":"Earth and Planetary Sciences","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":"Université Laval; University of Toronto; Fields Institute for Research in Mathematical Sciences","funders":"","keywords":"Mathematics; Boussinesq approximation (buoyancy); Numerical analysis; Nonlinear system; Range (aeronautics); Exact solutions in general relativity; Theory of computation; Applied mathematics; Mathematical analysis; Algorithm; Physics; Mechanics","score_opus":0.017844142765923447,"score_gpt":0.23016135479353395,"score_spread":0.2123172120276105,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1975156486","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.033170067,0.0011620225,0.9505382,0.00039728603,0.0002274868,0.00004780695,0.00009282204,0.00017138313,0.014192979],"genre_scores_gemma":[0.44325027,0.001957111,0.5179688,0.000267563,0.00030523582,0.0002672704,0.00035987786,0.0003403819,0.035283558],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9997143,0.00009357981,0.000015284135,0.00003015999,0.000113744696,0.000032917873],"domain_scores_gemma":[0.9991793,0.00035805037,0.00007202997,0.00007831989,0.00026112626,0.00005119149],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00086965616,0.0006089581,0.0009163848,0.0007303579,0.00061784923,0.0009704789,0.0013608439,0.001179019,0.0043385555],"category_scores_gemma":[0.0043111537,0.00040618976,0.00044954722,0.00092221395,0.001228025,0.0016388663,0.0017073854,0.0013021617,0.00077287876],"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.00006886771,0.000040269097,0.00058380945,0.00015913301,0.000026607519,0.00007204257,0.0002362641,0.5697809,0.0018441919,0.35770875,0.0026227434,0.06685653],"study_design_scores_gemma":[0.00001885645,0.000009875773,0.00009338738,0.000017317667,0.0000033512745,0.000022231128,0.000020426634,0.9295379,0.00032212038,0.06675541,0.00319053,0.000008682115],"about_ca_topic_score_codex":0.009519136,"about_ca_topic_score_gemma":0.006498264,"teacher_disagreement_score":0.009519136,"about_ca_system_score_codex":0.00083945435,"about_ca_system_score_gemma":0.0010988414,"threshold_uncertainty_score":0.018927455},"labels":[],"label_agreement":null},{"id":"W1975654827","doi":"10.1007/s11075-009-9317-9","title":"Quadratic spline collocation for one-dimensional linear parabolic partial differential equations","year":2009,"lang":"en","type":"article","venue":"Numerical Algorithms","topic":"Differential Equations and Numerical Methods","field":"Mathematics","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":"University of Toronto","funders":"","keywords":"Mathematics; Discretization; Partial differential equation; Applied mathematics; Collocation (remote sensing); Spline (mechanical); Orthogonal collocation; Parabolic partial differential equation; Tridiagonal matrix; Collocation method; Dimension (graph theory); Quadratic equation; Mathematical optimization; Mathematical analysis; Ordinary differential equation; Differential equation; Computer science; Geometry","score_opus":0.10306374602243626,"score_gpt":0.3891902368052939,"score_spread":0.2861264907828577,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1975654827","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.02763874,0.00075300096,0.96834815,0.00036964903,0.00017246805,0.000027810998,0.00003157837,0.00013498087,0.0025235007],"genre_scores_gemma":[0.64449435,0.0016827459,0.33167848,0.00017949425,0.00027327248,0.00021329541,0.00023636055,0.00028564574,0.0209562],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994462,0.00024722656,0.000030478359,0.000043775217,0.00018428772,0.000047977548],"domain_scores_gemma":[0.99811757,0.0010537914,0.00014421564,0.00013496957,0.00044526558,0.00010420225],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015940883,0.00056254584,0.0012946855,0.00066180463,0.00063081825,0.0009989019,0.0012600302,0.0015917221,0.0014409703],"category_scores_gemma":[0.005534149,0.0005417903,0.0005737517,0.0010560664,0.0016412259,0.0010976943,0.0019327289,0.0016219876,0.0003765625],"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.00022170162,0.00012784933,0.0010613967,0.00032457573,0.00004605162,0.00011904692,0.00029037622,0.7957251,0.006037989,0.12668595,0.0023473059,0.06701262],"study_design_scores_gemma":[0.000009127113,0.000010492768,0.00006073758,0.000007125571,0.0000023883067,0.000008075763,0.00001005976,0.98842734,0.0002595352,0.010621634,0.0005759194,0.0000075434423],"about_ca_topic_score_codex":0.008491777,"about_ca_topic_score_gemma":0.0044766683,"teacher_disagreement_score":0.008491777,"about_ca_system_score_codex":0.00077981927,"about_ca_system_score_gemma":0.0012443045,"threshold_uncertainty_score":0.016884685},"labels":[],"label_agreement":null},{"id":"W1981707982","doi":"10.1023/b:numa.0000005350.20098.b1","title":"Characterization of Trimmed NURBS Surface Boundaries Using Topological Criteria","year":2003,"lang":"en","type":"article","venue":"Numerical Algorithms","topic":"Digital Image Processing Techniques","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é du Québec à Montréal; Polytechnique Montréal","funders":"","keywords":"Mathematics; Trimming; Topology (electrical circuits); Boundary (topology); Surface (topology); Gravitational singularity; Parametric surface; Parametric statistics; Point (geometry); Mathematical analysis; Geometry; Computer science; Combinatorics","score_opus":0.036045262179647666,"score_gpt":0.3065788427422236,"score_spread":0.2705335805625759,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1981707982","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.14492334,0.00020022999,0.8501072,0.00008981317,0.000029775354,0.00008812435,0.00009269208,0.00076138345,0.0037073987],"genre_scores_gemma":[0.67307967,0.00017101815,0.32419518,0.000051514897,0.000022519916,0.00011297552,0.00027370852,0.0003003965,0.0017930284],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99884665,0.00018063071,0.00006532472,0.00010917288,0.00071781414,0.00008042921],"domain_scores_gemma":[0.9941855,0.0022610135,0.00066369754,0.00088374974,0.0017668633,0.0002391778],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001441866,0.00067316456,0.0009480981,0.0028986824,0.0006991486,0.0023990704,0.0016256534,0.0014935674,0.0032606793],"category_scores_gemma":[0.012281752,0.00051162764,0.00042895632,0.00087048346,0.0014274654,0.0021004765,0.0012660447,0.0008523863,0.00055857364],"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.0010137926,0.00027354315,0.0070467154,0.00067941117,0.000063187246,0.0005727321,0.0013833208,0.39343873,0.13432151,0.103444435,0.0022893813,0.3554732],"study_design_scores_gemma":[0.000018257037,0.00017414731,0.0023018576,0.00007949016,0.000021229247,0.00031487003,0.00029516607,0.93691796,0.03915781,0.017754491,0.002918319,0.00004634763],"about_ca_topic_score_codex":0.000924671,"about_ca_topic_score_gemma":0.0012965074,"teacher_disagreement_score":0.0032606793,"about_ca_system_score_codex":0.00075913215,"about_ca_system_score_gemma":0.0009468989,"threshold_uncertainty_score":0.010908008},"labels":[],"label_agreement":null},{"id":"W1982479999","doi":"10.1007/s11075-009-9288-x","title":"The reliability/cost trade-off for a class of ODE solvers","year":2009,"lang":"en","type":"article","venue":"Numerical Algorithms","topic":"Numerical methods for differential equations","field":"Mathematics","cited_by":11,"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; Piecewise; Estimator; Runge–Kutta methods; Residual; Mathematics; Reliability (semiconductor); Mathematical optimization; Theory of computation; Applied mathematics; Polynomial; Piecewise linear function; Numerical analysis; Order of accuracy; Class (philosophy); Ordinary differential equation; Computer science; Algorithm; Differential equation; Mathematical analysis; Statistics","score_opus":0.05893164806147973,"score_gpt":0.36830830092482825,"score_spread":0.30937665286334853,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1982479999","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.054058075,0.0038132814,0.9287367,0.0018179937,0.00016740453,0.00007037775,0.00009211953,0.0003454511,0.010898641],"genre_scores_gemma":[0.76569533,0.003523347,0.22014274,0.00029643986,0.00042043132,0.00024387943,0.00015156211,0.0005563583,0.008969976],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9976966,0.0009083743,0.00012164721,0.00016796187,0.0009396579,0.00016569346],"domain_scores_gemma":[0.9798535,0.016067347,0.00088227727,0.0014443495,0.0013832498,0.00036931754],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0052069323,0.0011092674,0.0012872614,0.001169683,0.0008008723,0.0017075032,0.0013629659,0.0022270575,0.0028250378],"category_scores_gemma":[0.032398596,0.0006524893,0.00077717303,0.0010485477,0.0016642801,0.0024632672,0.0020210007,0.0020928255,0.00058632373],"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.00044816858,0.00012410476,0.0019035641,0.0005794099,0.000088643195,0.00019325453,0.0002041307,0.5345021,0.009001054,0.34185833,0.004167369,0.10693],"study_design_scores_gemma":[0.000028678016,0.00010327242,0.00037870367,0.000043550794,0.000033544373,0.00013938513,0.000022104761,0.88742864,0.001986671,0.108245425,0.001575792,0.000014184007],"about_ca_topic_score_codex":0.00055005535,"about_ca_topic_score_gemma":0.0005453694,"teacher_disagreement_score":0.0052069323,"about_ca_system_score_codex":0.00075834873,"about_ca_system_score_gemma":0.0010460314,"threshold_uncertainty_score":0.027537167},"labels":[],"label_agreement":null},{"id":"W1991794829","doi":"10.1007/s11075-012-9574-x","title":"A comparative study of numerical steepest descent, extrapolation, and sequence transformation methods in computing semi-infinite integrals","year":2012,"lang":"en","type":"article","venue":"Numerical Algorithms","topic":"Electromagnetic Scattering and Analysis","field":"Physics and Astronomy","cited_by":7,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Extrapolation; Theory of computation; Mathematics; Descent (aeronautics); Sequence (biology); Method of steepest descent; Numerical analysis; Applied mathematics; Transformation (genetics); Richardson extrapolation; Mathematical analysis; Algorithm; Physics","score_opus":0.04929126396213066,"score_gpt":0.3769092674746912,"score_spread":0.32761800351256054,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1991794829","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.06721884,0.0034727976,0.91820604,0.00054491364,0.00015938542,0.0000860875,0.000046928053,0.0009607855,0.009304267],"genre_scores_gemma":[0.36247566,0.0024018607,0.6298,0.00021251714,0.000117704636,0.00013985146,0.0001738517,0.0005845163,0.004094018],"study_design_codex":"simulation_or_modeling","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9972875,0.0016000705,0.00012763894,0.00010402716,0.0008057227,0.000075077376],"domain_scores_gemma":[0.98223853,0.013077504,0.00044533974,0.0014826597,0.0024623969,0.0002935847],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005579727,0.0006016051,0.0010984198,0.0015329126,0.0005957988,0.0015504477,0.001473682,0.0011590956,0.0017625651],"category_scores_gemma":[0.029708782,0.00028650998,0.00054947287,0.0022559327,0.001284105,0.0023366318,0.0011353208,0.0016822745,0.0005586375],"study_design_candidate":"bench_or_experimental","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.0008727058,0.000609838,0.0034844736,0.0007755036,0.00017253944,0.0001305414,0.000621987,0.47780657,0.0062774024,0.16442463,0.0030431594,0.34178066],"study_design_scores_gemma":[0.000025423353,0.00010513977,0.0003233129,0.000035862486,0.000013518295,0.000057342753,0.000048526945,0.98633957,0.002058423,0.009710429,0.001270718,0.000011709278],"about_ca_topic_score_codex":0.0029287294,"about_ca_topic_score_gemma":0.0033966044,"teacher_disagreement_score":0.005579727,"about_ca_system_score_codex":0.00072098506,"about_ca_system_score_gemma":0.0017814423,"threshold_uncertainty_score":0.02950877},"labels":[],"label_agreement":null},{"id":"W1993293547","doi":"10.1007/s11075-014-9910-4","title":"Some new periodic Golay pairs","year":2014,"lang":"en","type":"article","venue":"Numerical Algorithms","topic":"graph theory and CDMA systems","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":"Wilfrid Laurier University; University of Waterloo","funders":"","keywords":"Binary Golay code; Mathematics; Hadamard transform; Ternary Golay code; Combinatorics; Statistics; Mathematical analysis; Hamming code","score_opus":0.007193687431960727,"score_gpt":0.19346671730521492,"score_spread":0.1862730298732542,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1993293547","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.12326922,0.0024971897,0.8047191,0.0014911293,0.00094772864,0.00015600612,0.00022801074,0.0004154133,0.066276215],"genre_scores_gemma":[0.5645303,0.0016698505,0.390201,0.0009683031,0.0008661757,0.00032174477,0.00042420963,0.0003666162,0.040651683],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993412,0.00024580045,0.000030515346,0.00012798538,0.00019498567,0.000059517533],"domain_scores_gemma":[0.99879164,0.0006315687,0.00011469671,0.00017301567,0.00018318713,0.0001058669],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00094686856,0.00085459393,0.00072761136,0.0018509801,0.00151558,0.0019789264,0.0011772763,0.0014014408,0.010284889],"category_scores_gemma":[0.00606377,0.0005161202,0.0007309637,0.001831851,0.0013442829,0.0030467007,0.0017491824,0.0016191909,0.0013104797],"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.00013974175,0.00005953212,0.0005341382,0.00014308825,0.000029973198,0.00016490463,0.00019574993,0.016540235,0.0020360975,0.9209875,0.0055388217,0.053630304],"study_design_scores_gemma":[0.000054227487,0.000067645,0.0003135284,0.000045747594,0.000028719693,0.0003759477,0.000087189364,0.16702248,0.0021928754,0.8173768,0.012396411,0.000038556565],"about_ca_topic_score_codex":0.0003401607,"about_ca_topic_score_gemma":0.00050550135,"teacher_disagreement_score":0.010284889,"about_ca_system_score_codex":0.0007669857,"about_ca_system_score_gemma":0.00061637117,"threshold_uncertainty_score":0.034406424},"labels":[],"label_agreement":null},{"id":"W2002504778","doi":"10.1007/s11075-014-9884-2","title":"Optimized Schwarz methods for a diffusion problem with discontinuous coefficient","year":2014,"lang":"en","type":"article","venue":"Numerical Algorithms","topic":"Advanced Numerical Methods in Computational Mathematics","field":"Engineering","cited_by":37,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"John Abbott College","funders":"","keywords":"Mathematics; Theory of computation; Convergence (economics); Jump; Diffusion; Applied mathematics; Schwarz alternating method; Numerical analysis; Jump diffusion; Mathematical optimization; Mathematical analysis; Algorithm; Domain decomposition methods; Finite element method","score_opus":0.016313802514560806,"score_gpt":0.323244523130922,"score_spread":0.3069307206163612,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2002504778","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.020298386,0.0007878991,0.972864,0.0005066407,0.00017382945,0.000048479917,0.00005919283,0.000100832796,0.005160823],"genre_scores_gemma":[0.33544523,0.0015977337,0.6368011,0.00038423654,0.0002671129,0.0003576256,0.00028427484,0.0005579878,0.024304617],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99932194,0.00036455807,0.000039272407,0.000054380027,0.00017996508,0.000039820312],"domain_scores_gemma":[0.9977188,0.0014985182,0.00016422982,0.0001575168,0.0003460956,0.000114794326],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017364152,0.0013156277,0.001150214,0.0013495133,0.0005779499,0.0012975823,0.0016226463,0.002046124,0.0031266627],"category_scores_gemma":[0.005714083,0.00067296793,0.00087531086,0.00082787126,0.0021140429,0.0016638491,0.0024034155,0.0020952297,0.0005542738],"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.00036287864,0.00010004004,0.0006121942,0.00041490977,0.0001269026,0.0002860368,0.0002963543,0.40001506,0.014462224,0.5364562,0.0041316454,0.042735554],"study_design_scores_gemma":[0.00003530188,0.000029096695,0.00009879972,0.000018183864,0.000015602507,0.000036632366,0.000021778038,0.94284636,0.0012887744,0.053850383,0.0017374845,0.000021498387],"about_ca_topic_score_codex":0.0021162825,"about_ca_topic_score_gemma":0.002196279,"teacher_disagreement_score":0.0031266627,"about_ca_system_score_codex":0.0008986904,"about_ca_system_score_gemma":0.0011034128,"threshold_uncertainty_score":0.0104596615},"labels":[],"label_agreement":null},{"id":"W2012227840","doi":"10.1007/s11075-009-9266-3","title":"New interpolants for asymptotically correct defect control of BVODEs","year":2009,"lang":"en","type":"article","venue":"Numerical Algorithms","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":"Saint Mary's University; University of Toronto","funders":"","keywords":"Ode; Mathematics; Bounded function; Asymptotically optimal algorithm; Applied mathematics; Ordinary differential equation; Context (archaeology); Polygon mesh; Numerical analysis; Pointwise; Mathematical optimization; Differential equation; Mathematical analysis; Geometry","score_opus":0.015372535639660975,"score_gpt":0.29551999686660413,"score_spread":0.2801474612269432,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2012227840","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.02682225,0.0003557554,0.9668975,0.00020368754,0.00032255155,0.00005120804,0.00004987557,0.000191955,0.0051052617],"genre_scores_gemma":[0.61842734,0.0007178199,0.36057714,0.0003373061,0.00027118626,0.0002651428,0.00020084162,0.0005146476,0.018688636],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994367,0.0002043035,0.000032343887,0.00005700665,0.00021221038,0.00005745836],"domain_scores_gemma":[0.99818844,0.0008430065,0.00017300999,0.00018667456,0.00041025635,0.00019852669],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0022956543,0.00095913163,0.0012120064,0.0016098705,0.00064728846,0.0014813767,0.0018104386,0.0018101309,0.0027669247],"category_scores_gemma":[0.006586726,0.00043756398,0.0006983708,0.0007144998,0.0020660304,0.0015547674,0.0027747524,0.0022378254,0.0003655691],"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.00036063005,0.00012564419,0.0005358797,0.00017061735,0.000036749967,0.00012767661,0.00020850696,0.17580678,0.012338935,0.76346886,0.0022421316,0.044577565],"study_design_scores_gemma":[0.000023483806,0.000050631985,0.000061029234,0.000022004137,0.000007233566,0.000027227354,0.000021713751,0.9290597,0.0019543131,0.06694978,0.0018043873,0.000018543518],"about_ca_topic_score_codex":0.0011625505,"about_ca_topic_score_gemma":0.0013844991,"teacher_disagreement_score":0.0027669247,"about_ca_system_score_codex":0.0012879524,"about_ca_system_score_gemma":0.0009243626,"threshold_uncertainty_score":0.012140751},"labels":[],"label_agreement":null},{"id":"W2018029404","doi":"10.1007/s11075-013-9743-6","title":"Useful properties of the coefficients of the Slevinsky-Safouhi formula for differentiation","year":2013,"lang":"en","type":"article","venue":"Numerical Algorithms","topic":"Mathematical functions and polynomials","field":"Mathematics","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":"University of Alberta","funders":"","keywords":"Mathematics; Theory of computation; Orthogonality; Numerical differentiation; Recurrence relation; Characterization (materials science); Applied mathematics; Matrix (chemical analysis); Numerical analysis; Algebra over a field; Pure mathematics; Mathematical analysis; Algorithm; Geometry","score_opus":0.056245417150584204,"score_gpt":0.2699535389593699,"score_spread":0.2137081218087857,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2018029404","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.095699586,0.005874742,0.7832348,0.0029783568,0.0011239713,0.00011429398,0.00045053175,0.0004937559,0.11003003],"genre_scores_gemma":[0.77078336,0.0039459397,0.19229506,0.00067416154,0.0009382551,0.00016291249,0.00035991374,0.00052937906,0.030311078],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994937,0.00017375528,0.00003572958,0.000059378748,0.00018506209,0.000052389467],"domain_scores_gemma":[0.997341,0.0013876113,0.00020490076,0.00027977113,0.0006101546,0.00017662808],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021995427,0.0011004275,0.00070925493,0.0028508082,0.00083648,0.0018698161,0.0011855079,0.0011015822,0.0051403134],"category_scores_gemma":[0.016774854,0.00031490295,0.000580079,0.002267721,0.0025214374,0.0033689716,0.0015855884,0.0031492258,0.0014471007],"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.000030151368,0.000014162152,0.00036038397,0.00008236973,0.000007887403,0.000085549735,0.00020616375,0.0034976664,0.002176368,0.97319984,0.0018408641,0.018498655],"study_design_scores_gemma":[0.000025472227,0.000021142285,0.0004173972,0.000081008104,0.000013364483,0.00023333347,0.00006664345,0.059380695,0.0028268688,0.92740315,0.0095012495,0.00002967071],"about_ca_topic_score_codex":0.0010987076,"about_ca_topic_score_gemma":0.000980705,"teacher_disagreement_score":0.0051403134,"about_ca_system_score_codex":0.0009348815,"about_ca_system_score_gemma":0.0009677823,"threshold_uncertainty_score":0.01719606},"labels":[],"label_agreement":null},{"id":"W2024861657","doi":"10.1023/a:1024077930017","title":"Fourth-Order Symmetric DIRK Methods for Periodic Stiff Problems","year":2003,"lang":"en","type":"article","venue":"Numerical Algorithms","topic":"Numerical methods for differential equations","field":"Mathematics","cited_by":18,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Universidad de Zaragoza; Ryerson University","keywords":"Mathematics; Symplectic geometry; Numerical analysis; Homogeneous; Ode; Applied mathematics; Mathematical analysis; Runge–Kutta methods; Dispersion (optics); Nonlinear system; Stability (learning theory); Numerical integration; Theory of computation; Combinatorics; Algorithm; Physics; Computer science","score_opus":0.09974512545404286,"score_gpt":0.416837690776917,"score_spread":0.31709256532287416,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2024861657","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.01797629,0.0008206627,0.962822,0.00040828166,0.00044579868,0.000056027962,0.00009823156,0.00045698762,0.01691565],"genre_scores_gemma":[0.31195304,0.0015949942,0.62134826,0.00044715655,0.00036381593,0.00035685088,0.0005368957,0.0019283321,0.061470665],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993349,0.00022993675,0.00003397012,0.00004738483,0.00029067756,0.0000631262],"domain_scores_gemma":[0.9981438,0.00054362166,0.00015442031,0.00050618465,0.00051818014,0.00013374152],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013957887,0.00078086776,0.0014821761,0.0011208758,0.0010608789,0.0015338054,0.0022430378,0.0014813648,0.006605179],"category_scores_gemma":[0.00445121,0.0005895571,0.0007656822,0.0010418985,0.0018264758,0.0023962464,0.0024626825,0.0026605953,0.0022351216],"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.00019862656,0.00013276468,0.00053814385,0.00033474038,0.00005967037,0.0001418865,0.00030429754,0.19119003,0.0060532577,0.6955249,0.007837757,0.09768394],"study_design_scores_gemma":[0.000031451535,0.000023762363,0.00013484832,0.0000185279,0.000010176949,0.000052131698,0.00003401053,0.8610358,0.0018522233,0.13090494,0.005875114,0.000026897203],"about_ca_topic_score_codex":0.0017848492,"about_ca_topic_score_gemma":0.0026662152,"teacher_disagreement_score":0.006605179,"about_ca_system_score_codex":0.0009494925,"about_ca_system_score_gemma":0.0013083484,"threshold_uncertainty_score":0.022096515},"labels":[],"label_agreement":null},{"id":"W2027133122","doi":"10.1007/s11075-010-9375-z","title":"An analytical approach for solving nonlinear boundary value problems in finite domains","year":2010,"lang":"en","type":"article","venue":"Numerical Algorithms","topic":"Fractional Differential Equations Solutions","field":"Mathematics","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":"Western University","funders":"","keywords":"Mathematics; Homotopy analysis method; Theory of computation; Nonlinear system; Boundary value problem; Shooting method; Galerkin method; Homotopy; Numerical analysis; Applied mathematics; Sinc function; Mathematical analysis; Mathematical optimization; Algorithm","score_opus":0.05418572371415838,"score_gpt":0.34612915790283255,"score_spread":0.2919434341886742,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2027133122","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.0040259375,0.00037190164,0.9894031,0.00024233566,0.00016499856,0.000029802779,0.000008580515,0.000054930304,0.005698333],"genre_scores_gemma":[0.21059944,0.001655268,0.767309,0.0004074181,0.00031487393,0.0003007495,0.000057080586,0.00020501162,0.019151105],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9997043,0.00009310184,0.000017263877,0.000029729988,0.00013291503,0.000022695727],"domain_scores_gemma":[0.99948055,0.00026078487,0.000037820326,0.000044020206,0.0001423788,0.000034505036],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00092295854,0.0007965545,0.0007568207,0.0014007144,0.0010354231,0.00133105,0.0018912986,0.0017172833,0.0024802962],"category_scores_gemma":[0.0033519524,0.0005231849,0.0008726569,0.0008791307,0.0022711665,0.0018675907,0.0018574133,0.00178515,0.00054282823],"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.000041462663,0.00010367254,0.00024688497,0.00029011807,0.000041030253,0.00016027375,0.0002915184,0.27720672,0.010411439,0.65350425,0.0016540011,0.056048706],"study_design_scores_gemma":[0.000010834774,0.000019023511,0.000031681568,0.000029156769,0.000010364152,0.000054503926,0.000030813488,0.9131888,0.0010452026,0.08079201,0.004776152,0.000011452875],"about_ca_topic_score_codex":0.0019605919,"about_ca_topic_score_gemma":0.0018341211,"teacher_disagreement_score":0.0024802962,"about_ca_system_score_codex":0.0008716385,"about_ca_system_score_gemma":0.0012171292,"threshold_uncertainty_score":0.008297443},"labels":[],"label_agreement":null},{"id":"W2037586972","doi":"10.1007/s11075-013-9767-y","title":"On per-iteration complexity of high order Chebyshev methods for sparse functions with banded Hessians","year":2013,"lang":"en","type":"article","venue":"Numerical Algorithms","topic":"Advanced Optimization Algorithms Research","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":"Université de Sherbrooke; University of Ottawa","funders":"","keywords":"Theory of computation; Mathematics; Chebyshev filter; Applied mathematics; Order (exchange); Chebyshev iteration; Numerical analysis; Chebyshev polynomials; Mathematical optimization; Algorithm; Mathematical analysis","score_opus":0.09780373790638307,"score_gpt":0.403758183934134,"score_spread":0.3059544460277509,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2037586972","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.041448146,0.0010949093,0.94733703,0.0013410395,0.000244236,0.00007899362,0.00018398787,0.00036330477,0.007908347],"genre_scores_gemma":[0.4887652,0.0013505816,0.49270535,0.00059034396,0.00041654476,0.00050940237,0.0006392875,0.0012453009,0.013777928],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9969363,0.0013982148,0.00012863668,0.00022910874,0.0010408215,0.00026694717],"domain_scores_gemma":[0.95575815,0.038226448,0.000742569,0.0021598288,0.002474432,0.00063859543],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0062923343,0.001578005,0.0012700157,0.0010880687,0.001016795,0.0020010076,0.0020908497,0.0018817612,0.0074234344],"category_scores_gemma":[0.03445799,0.0006374983,0.00096554746,0.0011573773,0.0028091324,0.0040914277,0.0032572066,0.0047156936,0.0010623741],"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.0010362671,0.00032433588,0.0030280063,0.0005643591,0.00013483119,0.00026918997,0.00050017814,0.6638027,0.009054478,0.21199568,0.008359724,0.10093028],"study_design_scores_gemma":[0.000017032673,0.000029218569,0.00023207231,0.000018501123,0.000008597563,0.000027432736,0.00003287169,0.9695422,0.0010491019,0.028467707,0.0005638121,0.000011418763],"about_ca_topic_score_codex":0.0046475204,"about_ca_topic_score_gemma":0.0073279412,"teacher_disagreement_score":0.0074234344,"about_ca_system_score_codex":0.0018691595,"about_ca_system_score_gemma":0.0025091697,"threshold_uncertainty_score":0.033277392},"labels":[],"label_agreement":null},{"id":"W2038852905","doi":"10.1007/s11075-014-9930-0","title":"A fast SVD for multilevel block Hankel matrices with minimal memory storage","year":2014,"lang":"en","type":"article","venue":"Numerical Algorithms","topic":"Statistical and numerical algorithms","field":"Mathematics","cited_by":28,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"","keywords":"Hankel matrix; Singular value decomposition; Lanczos resampling; Tridiagonal matrix; Mathematics; Multiplication (music); Matrix (chemical analysis); Algorithm; Matrix decomposition; Matrix multiplication; Block (permutation group theory); Lanczos algorithm; Fast Fourier transform; Applied mathematics; Eigenvalues and eigenvectors; Mathematical analysis; Combinatorics; Physics","score_opus":0.03218140093965833,"score_gpt":0.29783910160945387,"score_spread":0.26565770066979555,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2038852905","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.0029915392,0.00022198181,0.99391717,0.00014076113,0.00019609396,0.000040265633,0.0001590949,0.00059522607,0.0017378291],"genre_scores_gemma":[0.046767384,0.00042796083,0.9455344,0.00016772586,0.00023929944,0.00015612657,0.00051954365,0.00035247175,0.0058351397],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99924755,0.0001430436,0.0000471517,0.00007531372,0.0004274172,0.000059547496],"domain_scores_gemma":[0.9984598,0.0005385051,0.000057669364,0.0003230363,0.00052010623,0.00010077648],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006709149,0.00093118293,0.0009434992,0.00080144755,0.0006199391,0.001357788,0.0010669352,0.0010368758,0.0092966305],"category_scores_gemma":[0.0044512083,0.000509196,0.0009264886,0.0013672502,0.00056180824,0.0018259727,0.001791935,0.0018826732,0.0049920967],"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.00050959596,0.00021188006,0.00062840816,0.00069340545,0.00020495677,0.00042582472,0.00032844424,0.11317167,0.059732947,0.13081206,0.04132131,0.6519595],"study_design_scores_gemma":[0.000062248866,0.00010236066,0.00018321311,0.00004645895,0.000029830357,0.00022954664,0.000052821008,0.9217202,0.013778809,0.04993788,0.0138144,0.00004225346],"about_ca_topic_score_codex":0.0025957476,"about_ca_topic_score_gemma":0.005046779,"teacher_disagreement_score":0.0092966305,"about_ca_system_score_codex":0.00036641434,"about_ca_system_score_gemma":0.0012230298,"threshold_uncertainty_score":0.031100333},"labels":[],"label_agreement":null},{"id":"W2042560167","doi":"10.1007/s11075-009-9268-1","title":"Convergence estimates for an optimized Schwarz method for PDEs with discontinuous coefficients","year":2009,"lang":"en","type":"article","venue":"Numerical Algorithms","topic":"Advanced Numerical Methods in Computational Mathematics","field":"Engineering","cited_by":9,"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 Manitoba","funders":"","keywords":"Domain decomposition methods; Mathematics; Rate of convergence; Partial differential equation; Schwarz alternating method; Mathematical analysis; Differential operator; Boundary value problem; Convergence (economics); Jump; Operator (biology); Spectral radius; Additive Schwarz method; Applied mathematics; Numerical analysis; Finite element method; Eigenvalues and eigenvectors; Computer science","score_opus":0.03137423783720586,"score_gpt":0.3528893357103434,"score_spread":0.3215150978731376,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2042560167","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.01545717,0.0009227473,0.9765978,0.00043317664,0.00017590747,0.00007304367,0.00006315065,0.00013248833,0.0061445804],"genre_scores_gemma":[0.3006014,0.0028610886,0.67252976,0.0005070658,0.00054922677,0.0005617012,0.0005380673,0.0010448518,0.020806825],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982362,0.0008894194,0.00008998912,0.00012484651,0.0005634343,0.0000961153],"domain_scores_gemma":[0.9889037,0.007199131,0.00052935927,0.0006799432,0.002156212,0.0005316009],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.007515449,0.0025393302,0.0012870408,0.0031024625,0.0007943454,0.0018593275,0.0020815658,0.0019212015,0.0046329848],"category_scores_gemma":[0.019438788,0.00077254523,0.001614136,0.00086353667,0.0036652773,0.002799023,0.0039116545,0.0037030496,0.0011110547],"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.0006178967,0.0001542182,0.0012977022,0.00090248085,0.00017858822,0.00028741456,0.00052451016,0.20075795,0.022723278,0.7127005,0.0065205293,0.05333495],"study_design_scores_gemma":[0.000025413952,0.00012914199,0.00031254702,0.0000848037,0.00004379143,0.00010088347,0.00006756494,0.9147677,0.004256899,0.07710459,0.0030597963,0.00004693343],"about_ca_topic_score_codex":0.0014382134,"about_ca_topic_score_gemma":0.0012201332,"teacher_disagreement_score":0.007515449,"about_ca_system_score_codex":0.0012843491,"about_ca_system_score_gemma":0.0014111317,"threshold_uncertainty_score":0.039745927},"labels":[],"label_agreement":null},{"id":"W2052261993","doi":"10.1007/s11075-009-9269-0","title":"Perturbation analysis and condition numbers of scaled total least squares problems","year":2009,"lang":"en","type":"article","venue":"Numerical Algorithms","topic":"Statistical and numerical algorithms","field":"Mathematics","cited_by":45,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"","keywords":"Overdetermined system; Uniqueness; Mathematics; Condition number; Perturbation (astronomy); Least-squares function approximation; Applied mathematics; Mathematical optimization; Statistics; Mathematical analysis","score_opus":0.020343842231753406,"score_gpt":0.302818244369146,"score_spread":0.2824744021373926,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2052261993","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.021197341,0.001255769,0.96143335,0.0017117698,0.000364965,0.000059912963,0.0001343902,0.00014595808,0.013696509],"genre_scores_gemma":[0.6651686,0.0032204413,0.30327782,0.0009713573,0.001101831,0.0006142356,0.0006488558,0.00078901753,0.024207873],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99694437,0.0017336672,0.000100681595,0.00026051636,0.0008234608,0.000137324],"domain_scores_gemma":[0.97932214,0.015945675,0.0011609307,0.0007941599,0.0022655278,0.00051162444],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005411895,0.0015344343,0.0010278559,0.0020559798,0.0008449108,0.0022695076,0.0018000691,0.0020001135,0.0054510916],"category_scores_gemma":[0.036378857,0.0006307151,0.0007064316,0.0014745558,0.004159134,0.0045237932,0.002645364,0.003395281,0.0006575694],"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.00008252826,0.000040713418,0.000412924,0.00020835025,0.00002949716,0.00008843914,0.00011005159,0.1569667,0.002589143,0.82260644,0.0033361134,0.013529117],"study_design_scores_gemma":[0.000009389609,0.0000119282095,0.00016339803,0.000024214834,0.000006054719,0.000024944216,0.000023670553,0.6422199,0.0006371077,0.35589674,0.0009651974,0.000017415796],"about_ca_topic_score_codex":0.0015530185,"about_ca_topic_score_gemma":0.0012153867,"teacher_disagreement_score":0.0054510916,"about_ca_system_score_codex":0.0013736424,"about_ca_system_score_gemma":0.0016161151,"threshold_uncertainty_score":0.028621197},"labels":[],"label_agreement":null},{"id":"W2052743064","doi":"10.1007/s11075-008-9199-2","title":"Numerical treatment of a twisted tail using extrapolation methods","year":2008,"lang":"en","type":"article","venue":"Numerical Algorithms","topic":"Numerical methods in engineering","field":"Engineering","cited_by":16,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Extrapolation; Mathematics; Theory of computation; Numerical analysis; Applied mathematics; Mathematical analysis; Calculus (dental); Algorithm; Medicine","score_opus":0.07707987753617833,"score_gpt":0.35086455226571717,"score_spread":0.2737846747295388,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2052743064","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.093815945,0.0008897056,0.8508188,0.00059375,0.00066898233,0.00010005294,0.00012485989,0.0005663581,0.05242148],"genre_scores_gemma":[0.8333129,0.0010271798,0.11430601,0.0004333491,0.0003272885,0.00016793677,0.00021379281,0.0006581961,0.04955329],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99975115,0.00008501599,0.000013037762,0.000022929604,0.00008370018,0.00004419683],"domain_scores_gemma":[0.99940884,0.00017829031,0.00005899014,0.00008608378,0.00016785026,0.00010001066],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00064742053,0.00078070554,0.001170641,0.0011125273,0.0008813555,0.0013864785,0.0015209089,0.0016563864,0.0060085543],"category_scores_gemma":[0.0025731751,0.00033234246,0.0009326729,0.0009993046,0.0016658732,0.0014771115,0.0024062733,0.0016278853,0.00089946954],"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.0001873035,0.00009876594,0.00092361483,0.00015862759,0.000040019917,0.0008496397,0.00024158746,0.4804642,0.008001331,0.48779988,0.0028194692,0.018415544],"study_design_scores_gemma":[0.000012926058,0.000018631532,0.000109778484,0.00002136572,0.000007130704,0.000085158434,0.00003186104,0.95210004,0.0008776874,0.045472324,0.0012502412,0.0000128210895],"about_ca_topic_score_codex":0.0009856457,"about_ca_topic_score_gemma":0.0006033133,"teacher_disagreement_score":0.0060085543,"about_ca_system_score_codex":0.00050160993,"about_ca_system_score_gemma":0.00060998887,"threshold_uncertainty_score":0.020100653},"labels":[],"label_agreement":null},{"id":"W2056712685","doi":"10.1007/s11075-008-9189-4","title":"Monotonic sequences related to zeros of Bessel functions","year":2008,"lang":"en","type":"article","venue":"Numerical Algorithms","topic":"Mathematical functions and polynomials","field":"Mathematics","cited_by":25,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"York University","funders":"","keywords":"Mathematics; Bessel function; Monotonic function; Function (biology); Modulo; Theory of computation; Mathematical analysis; Pure mathematics; Discrete mathematics; Algorithm","score_opus":0.058871834842480576,"score_gpt":0.31934872909018736,"score_spread":0.26047689424770676,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2056712685","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.28572008,0.0014573884,0.6806268,0.00060876115,0.00030939715,0.00006357996,0.00010675815,0.00021516457,0.030892143],"genre_scores_gemma":[0.8250985,0.0016867559,0.15628336,0.00024343698,0.0002901132,0.00012060111,0.00017364357,0.00024755322,0.015856016],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993383,0.000263163,0.000039549683,0.00007599389,0.00021139169,0.00007155221],"domain_scores_gemma":[0.9938281,0.0034819483,0.00091883074,0.00043412822,0.0010111704,0.00032578534],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020935743,0.0007160362,0.00042584926,0.0020367778,0.00079415314,0.0020069059,0.0011680017,0.0009360447,0.004901527],"category_scores_gemma":[0.019356916,0.0004583671,0.00035723735,0.0012237856,0.0021111579,0.0028097737,0.0013007233,0.0018846958,0.00073305366],"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.000085038235,0.000018958315,0.00065029593,0.000076441225,0.000008337861,0.00008414166,0.00018785351,0.008950311,0.0028781209,0.97097653,0.0005940015,0.015489915],"study_design_scores_gemma":[0.000025400197,0.000051553776,0.0005816634,0.0000947075,0.000013959794,0.00022678214,0.00014362662,0.17658015,0.004687677,0.81502956,0.002533686,0.000031203053],"about_ca_topic_score_codex":0.00039228215,"about_ca_topic_score_gemma":0.00044839486,"teacher_disagreement_score":0.004901527,"about_ca_system_score_codex":0.0008373205,"about_ca_system_score_gemma":0.00073509914,"threshold_uncertainty_score":0.016397238},"labels":[],"label_agreement":null},{"id":"W2066648277","doi":"10.1007/s11075-014-9872-6","title":"Adaptive time-stepping for the strong numerical solution of stochastic differential equations","year":2014,"lang":"en","type":"article","venue":"Numerical Algorithms","topic":"Stochastic processes and financial applications","field":"Economics, Econometrics and Finance","cited_by":22,"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; Toronto Metropolitan University","funders":"","keywords":"Adaptive stepsize; Mathematics; Stochastic differential equation; Richardson extrapolation; Numerical analysis; Brownian motion; Theory of computation; Extrapolation; Applied mathematics; Differential equation; Backward differentiation formula; Mathematical optimization; Ordinary differential equation; Differential algebraic equation; Algorithm; Mathematical analysis","score_opus":0.03719747129132631,"score_gpt":0.2419152012457536,"score_spread":0.2047177299544273,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2066648277","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.007891819,0.00031492405,0.9892681,0.0004386504,0.00019596289,0.0000372219,0.00002257702,0.00013834561,0.0016924129],"genre_scores_gemma":[0.46558636,0.0008999026,0.5216945,0.00046808354,0.00030042557,0.00080680597,0.00016822378,0.00028434343,0.009791391],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99926466,0.00039650258,0.000051489256,0.00006836119,0.0001770145,0.000042048443],"domain_scores_gemma":[0.9935777,0.0049736905,0.00034447538,0.0003093924,0.00058900344,0.00020568781],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0026568652,0.0009614785,0.0010171841,0.0007724418,0.0006301945,0.0010108516,0.0016707607,0.0021563598,0.0030257772],"category_scores_gemma":[0.016206406,0.00055751303,0.0007439737,0.0007965462,0.001992448,0.0012374041,0.0024402125,0.003142104,0.00049799844],"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.00019505202,0.00010611035,0.00074861007,0.0002815338,0.0001005293,0.00012139871,0.00015992402,0.76091856,0.0038342252,0.17701964,0.002276986,0.054237522],"study_design_scores_gemma":[0.000007926651,0.000007742381,0.000022007665,0.000005964931,0.0000023370371,0.000003901298,0.0000023744717,0.9900983,0.0001417966,0.009406264,0.0002982726,0.0000031108548],"about_ca_topic_score_codex":0.0052294023,"about_ca_topic_score_gemma":0.0036413958,"teacher_disagreement_score":0.0052294023,"about_ca_system_score_codex":0.0008730382,"about_ca_system_score_gemma":0.0019230308,"threshold_uncertainty_score":0.01405102},"labels":[],"label_agreement":null},{"id":"W2067877923","doi":"10.1007/s11075-005-9010-6","title":"Extrapolation algorithm for affine-convex feasibility problems","year":2005,"lang":"en","type":"article","venue":"Numerical Algorithms","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":84,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Okanagan University College; University of British Columbia, Okanagan Campus","funders":"","keywords":"Mathematics; Subgradient method; Linear subspace; Theory of computation; Hilbert space; Affine transformation; Countable set; Algorithm; Mathematical optimization; Regular polygon; Convex optimization; Applied mathematics; Discrete mathematics; Pure mathematics; Geometry","score_opus":0.02880830279725132,"score_gpt":0.27998542352186695,"score_spread":0.2511771207246156,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2067877923","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.005917444,0.0002310576,0.99119204,0.000120461635,0.00004822527,0.000029281138,0.000027120297,0.0001997725,0.0022345984],"genre_scores_gemma":[0.24327093,0.00064315286,0.74782604,0.00019338391,0.000106752945,0.0002824492,0.00024458842,0.0003760323,0.0070565725],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99951386,0.00020916417,0.000027858037,0.00005137936,0.00016049643,0.000037247613],"domain_scores_gemma":[0.9979717,0.0013709964,0.00011167971,0.0001773527,0.000286714,0.00008145991],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018421559,0.0008159089,0.0012191416,0.0008653623,0.00052325946,0.00080988207,0.0014365976,0.0013660645,0.0048547834],"category_scores_gemma":[0.0073746443,0.00057319604,0.00082346227,0.0009959433,0.00090598204,0.0017073936,0.0021526283,0.0024050544,0.0009457691],"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.00041703598,0.00012099839,0.0006611308,0.00034743175,0.00006413808,0.00026622883,0.0002163123,0.6982238,0.007829021,0.10924796,0.0044781775,0.17812769],"study_design_scores_gemma":[0.0000148322415,0.000021690696,0.000045012843,0.000017401742,0.0000065675654,0.000032786666,0.000009982749,0.9796435,0.0008748966,0.018183937,0.0011435003,0.0000058865826],"about_ca_topic_score_codex":0.0017158516,"about_ca_topic_score_gemma":0.0017422622,"teacher_disagreement_score":0.0048547834,"about_ca_system_score_codex":0.0005436588,"about_ca_system_score_gemma":0.00081095204,"threshold_uncertainty_score":0.016240835},"labels":[],"label_agreement":null},{"id":"W2068424476","doi":"10.1007/s11075-010-9385-x","title":"Polynomial algebra for Birkhoff interpolants","year":2010,"lang":"en","type":"article","venue":"Numerical Algorithms","topic":"Advanced Numerical Analysis Techniques","field":"Engineering","cited_by":25,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"","keywords":"Mathematics; Birkhoff interpolation; Lagrange polynomial; Quadrature (astronomy); Hermite interpolation; Interpolation (computer graphics); Hermite polynomials; Polynomial interpolation; Rational function; Clenshaw–Curtis quadrature; Polynomial; Applied mathematics; Numerical integration; Theory of computation; Gauss–Jacobi quadrature; Gauss–Kronrod quadrature formula; Mathematical analysis; Linear interpolation; Gaussian quadrature; Nyström method; Frame (networking); Algorithm; Integral equation","score_opus":0.006695384604352538,"score_gpt":0.2500003093397013,"score_spread":0.24330492473534876,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2068424476","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.061997056,0.0036183153,0.82847095,0.0019849744,0.00093446573,0.000079981655,0.00032953205,0.0005010389,0.1020836],"genre_scores_gemma":[0.78341204,0.004252861,0.15941152,0.0010151179,0.0012427276,0.00017276392,0.00060560793,0.00061513897,0.04927217],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987042,0.00037694935,0.00006221377,0.00019439288,0.000506087,0.00015612223],"domain_scores_gemma":[0.9985374,0.0005421546,0.0001531094,0.00020788946,0.0003829004,0.00017648685],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002325624,0.0010881579,0.0012829334,0.0029714054,0.0016861799,0.003153119,0.001538651,0.00096953206,0.008023272],"category_scores_gemma":[0.0051925075,0.00050835416,0.00087655615,0.0025613813,0.004021286,0.0053478703,0.002954989,0.005218645,0.001990257],"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.000020227746,0.000015766565,0.000058857593,0.000027167489,0.000005330122,0.000013955447,0.00007569337,0.0012993618,0.00035166965,0.99112016,0.0007606518,0.0062511745],"study_design_scores_gemma":[0.000009349203,0.000011068642,0.000068806345,0.000012256755,0.000005305356,0.00002037655,0.000026821152,0.015348842,0.00037418,0.9806599,0.0034517858,0.000011325596],"about_ca_topic_score_codex":0.0032601322,"about_ca_topic_score_gemma":0.0023742453,"teacher_disagreement_score":0.008023272,"about_ca_system_score_codex":0.0023565188,"about_ca_system_score_gemma":0.0010780344,"threshold_uncertainty_score":0.026840508},"labels":[],"label_agreement":null},{"id":"W2071465526","doi":"10.1007/s11075-009-9331-y","title":"An efficient unified approach for the numerical solution of delay differential equations","year":2009,"lang":"en","type":"article","venue":"Numerical Algorithms","topic":"Numerical methods for differential equations","field":"Mathematics","cited_by":16,"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":"Solver; Classification of discontinuities; Theory of computation; Runge–Kutta methods; Mathematics; Applied mathematics; Numerical analysis; Modular design; Initial value problem; Ordinary differential equation; Differential equation; Computer science; Mathematical optimization; Algorithm; Mathematical analysis","score_opus":0.08175538393039966,"score_gpt":0.366052991347989,"score_spread":0.28429760741758936,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2071465526","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.0021927245,0.00030108728,0.9951492,0.00005834244,0.00008209263,0.000021446636,0.000017705013,0.00008208073,0.0020954774],"genre_scores_gemma":[0.12150329,0.0013621326,0.8674405,0.00014609432,0.00021255827,0.00032893362,0.00014533459,0.00026257182,0.00859851],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99937016,0.00015026747,0.00003404721,0.000046133937,0.0003489987,0.00005040814],"domain_scores_gemma":[0.9994374,0.00017899905,0.000041805226,0.000098145414,0.0002019221,0.000041715455],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010270224,0.00082122895,0.0014449573,0.0012371818,0.0008008964,0.0013359817,0.0017520139,0.0011374891,0.002974221],"category_scores_gemma":[0.0027936248,0.00044730524,0.0010547976,0.0012155152,0.00089166395,0.00173012,0.002421569,0.0016004338,0.0010934435],"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.00006761677,0.00007767909,0.00032522096,0.0002205756,0.00006921656,0.0001261887,0.00017317025,0.23366062,0.010533958,0.65393966,0.0037643684,0.09704168],"study_design_scores_gemma":[0.000012541639,0.000023454162,0.0000524214,0.000014765464,0.0000143686975,0.000034738394,0.000010567617,0.95146865,0.0008646224,0.040852208,0.0066391667,0.000012460582],"about_ca_topic_score_codex":0.0016597166,"about_ca_topic_score_gemma":0.002430329,"teacher_disagreement_score":0.002974221,"about_ca_system_score_codex":0.0007661789,"about_ca_system_score_gemma":0.0015904133,"threshold_uncertainty_score":0.009949744},"labels":[],"label_agreement":null},{"id":"W2075200087","doi":"10.1007/s11075-009-9286-z","title":"Rayleigh quotient algorithms for nonsymmetric matrix pencils","year":2009,"lang":"en","type":"article","venue":"Numerical Algorithms","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Rayleigh quotient iteration; Mathematics; Eigenvalues and eigenvectors; Rayleigh quotient; Convergence (economics); Matrix (chemical analysis); Theory of computation; Iterative method; Quotient; Algorithm; Mathematical analysis; Applied mathematics; Algebra over a field; Pure mathematics; Preconditioner","score_opus":0.021588814093993998,"score_gpt":0.29193035395969674,"score_spread":0.27034153986570275,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2075200087","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.0034008906,0.00024813792,0.99393725,0.00010518611,0.00007458201,0.000028710714,0.00002570205,0.00025419978,0.0019252378],"genre_scores_gemma":[0.13854688,0.0008187317,0.84851676,0.00022791878,0.00017356219,0.00029196145,0.00024901025,0.0005480269,0.010627083],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9979674,0.0009609991,0.00011142327,0.00017528137,0.000672219,0.000112686816],"domain_scores_gemma":[0.9945872,0.0030017605,0.00024485428,0.00093289325,0.0010416743,0.00019163013],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0026031074,0.001322911,0.0010853036,0.0011255763,0.000601739,0.0021084002,0.0019786619,0.0011326467,0.008122864],"category_scores_gemma":[0.017135253,0.00051786914,0.00059676234,0.0014313373,0.0018614668,0.003981873,0.003170179,0.0021859996,0.0030416616],"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.00034512597,0.000118785705,0.00052308897,0.00023769481,0.00006511365,0.00011319251,0.00026175223,0.19508544,0.0056514596,0.51115716,0.007861693,0.27857953],"study_design_scores_gemma":[0.000045402936,0.0000492172,0.00006146363,0.000018232975,0.000008354482,0.00004257157,0.000030461226,0.80229783,0.0030836272,0.19039348,0.0039503393,0.000019067038],"about_ca_topic_score_codex":0.0013206928,"about_ca_topic_score_gemma":0.0016004652,"teacher_disagreement_score":0.008122864,"about_ca_system_score_codex":0.0007733882,"about_ca_system_score_gemma":0.0010945669,"threshold_uncertainty_score":0.027173698},"labels":[],"label_agreement":null},{"id":"W2078578895","doi":"10.1007/s11075-005-9007-1","title":"Numerical solutions of index-1 differential algebraic equations can be computed in polynomial time","year":2005,"lang":"en","type":"article","venue":"Numerical Algorithms","topic":"Numerical methods for differential equations","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":"Western University","funders":"","keywords":"Mathematics; Differential algebraic equation; Numerical partial differential equations; Exponential integrator; Ordinary differential equation; Polynomial; Differential algebraic geometry; Differential equation; Backward differentiation formula; Applied mathematics; Mathematical analysis; Exponential function; Algebraic equation; Nonlinear system","score_opus":0.06072766935198908,"score_gpt":0.3282124186020278,"score_spread":0.26748474925003873,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2078578895","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.018881576,0.00044275916,0.9595191,0.00045903213,0.0002477176,0.00008472773,0.00010134481,0.0011981926,0.019065605],"genre_scores_gemma":[0.38034543,0.0008945232,0.59726894,0.000203416,0.00019633245,0.00029599102,0.0004240494,0.00087410456,0.019497195],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99912435,0.00015697637,0.000047651203,0.00010113228,0.0004713391,0.00009866217],"domain_scores_gemma":[0.99672866,0.00200282,0.00026879655,0.00039164798,0.0005133952,0.00009467393],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013221174,0.0015378622,0.0010274803,0.00086598017,0.0011466111,0.002008166,0.0012172259,0.0014188598,0.0077692214],"category_scores_gemma":[0.012646121,0.00046359835,0.0005885092,0.0012526464,0.0016987692,0.0027359636,0.001763724,0.0022750294,0.0033214982],"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.00034708038,0.00016535388,0.0014447988,0.0006808335,0.00005891957,0.00021275051,0.00041564927,0.22824368,0.024670634,0.43190348,0.008216203,0.30364066],"study_design_scores_gemma":[0.000073142495,0.000024957042,0.0002517101,0.00004492598,0.00002242751,0.00007119798,0.00004773346,0.8086161,0.009609372,0.17367691,0.0075425263,0.00001899626],"about_ca_topic_score_codex":0.0022500781,"about_ca_topic_score_gemma":0.005306834,"teacher_disagreement_score":0.0077692214,"about_ca_system_score_codex":0.0012888103,"about_ca_system_score_gemma":0.0015759298,"threshold_uncertainty_score":0.025990665},"labels":[],"label_agreement":null},{"id":"W2085969366","doi":"10.1023/b:numa.0000049478.42605.cf","title":"Interval Arithmetic, Affine Arithmetic, Taylor Series Methods: Why, What Next?","year":2004,"lang":"en","type":"article","venue":"Numerical Algorithms","topic":"Numerical Methods and Algorithms","field":"Computer Science","cited_by":54,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"","keywords":"Affine arithmetic; Interval arithmetic; Mathematics; Taylor series; Interval (graph theory); Arithmetic; Affine transformation; Theory of computation; Arbitrary-precision arithmetic; Computation; Series (stratigraphy); Range (aeronautics); Saturation arithmetic; Discrete mathematics; Algebra over a field; Pure mathematics; Algorithm; Combinatorics; Mathematical analysis","score_opus":0.03378618326497619,"score_gpt":0.32408456002474917,"score_spread":0.290298376759773,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2085969366","genre_codex":"review","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0039204485,0.48755148,0.17076172,0.28234679,0.029332016,0.000074883275,0.00018923504,0.0006386232,0.025184743],"genre_scores_gemma":[0.13933288,0.50187343,0.1860257,0.0715104,0.07650543,0.0003761079,0.00024227348,0.0007028192,0.023430994],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9965618,0.0018860222,0.00017593034,0.00035492098,0.0008434209,0.0001778477],"domain_scores_gemma":[0.9883515,0.0062026326,0.0007238947,0.00086017104,0.0033722727,0.0004895284],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.008940325,0.00082920236,0.0017187659,0.0016807033,0.0009675025,0.0074725207,0.0016633922,0.0049010064,0.006976532],"category_scores_gemma":[0.030408971,0.00049755984,0.00095474307,0.002930274,0.009039964,0.015022381,0.0018056278,0.009130882,0.0035654402],"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.00011874306,0.000113833965,0.0011236955,0.0019134794,0.00010113736,0.000094640345,0.00060787576,0.001403917,0.00051095407,0.5363647,0.12064672,0.33700037],"study_design_scores_gemma":[0.00004024372,0.000050113267,0.00067607313,0.0016159699,0.00005715784,0.00022356056,0.0012612834,0.0038414293,0.00031985634,0.8147137,0.17712174,0.00007880518],"about_ca_topic_score_codex":0.0027557386,"about_ca_topic_score_gemma":0.0024045405,"teacher_disagreement_score":0.008940325,"about_ca_system_score_codex":0.0014300478,"about_ca_system_score_gemma":0.002190781,"threshold_uncertainty_score":0.047281504},"labels":[],"label_agreement":null},{"id":"W2091752560","doi":"10.1007/s11075-011-9500-7","title":"Subquadrature expansions for TSRK methods","year":2011,"lang":"en","type":"article","venue":"Numerical Algorithms","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":"Simon Fraser University","funders":"","keywords":"Mathematics; Recursion (computer science); Theory of computation; Ordinary differential equation; Maple; Algebra over a field; Applied mathematics; Series (stratigraphy); Representation (politics); Computation; Differential equation; Algorithm; Pure mathematics; Mathematical analysis","score_opus":0.2567141205711308,"score_gpt":0.4576120013893258,"score_spread":0.20089788081819498,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2091752560","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.0082154,0.0007023456,0.9627796,0.00029806478,0.0003804977,0.000062223626,0.00007044087,0.00042757601,0.027063845],"genre_scores_gemma":[0.25432062,0.0019496575,0.6652293,0.00075175846,0.0008352303,0.00052257505,0.0005011807,0.0026765324,0.07321317],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989568,0.00043783023,0.00005192215,0.0000695399,0.00042357642,0.00006034861],"domain_scores_gemma":[0.99830097,0.0007001089,0.00010625822,0.00030095142,0.00047697127,0.00011478062],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014020416,0.00093038747,0.0009924585,0.001665174,0.0007163778,0.0019100242,0.0015665159,0.0011523218,0.015802758],"category_scores_gemma":[0.0062770993,0.00044826476,0.0008843746,0.0011092076,0.0014800092,0.0025158715,0.0022645127,0.0029733784,0.005243946],"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.00009748929,0.00007609276,0.0003031367,0.00022748775,0.000026139931,0.0001000689,0.000218147,0.033593144,0.004889081,0.86604,0.0075293207,0.086900026],"study_design_scores_gemma":[0.000018845098,0.00003651298,0.00017268342,0.000053772612,0.000016202708,0.00006708455,0.000060364957,0.59347767,0.0017695997,0.38379472,0.020511132,0.00002140151],"about_ca_topic_score_codex":0.0011649167,"about_ca_topic_score_gemma":0.0022268624,"teacher_disagreement_score":0.015802758,"about_ca_system_score_codex":0.0007027572,"about_ca_system_score_gemma":0.0007458936,"threshold_uncertainty_score":0.052865565},"labels":[],"label_agreement":null},{"id":"W2131222327","doi":"10.1023/a:1022268319273","title":"Adaptive Monotone Rational Approximation on Finite Sets","year":2003,"lang":"en","type":"article","venue":"Numerical Algorithms","topic":"Numerical Methods and Algorithms","field":"Computer Science","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":"University of Victoria","funders":"","keywords":"Monotonic function; Monotone polygon; Mathematics; Theory of computation; Interval (graph theory); Code (set theory); Set (abstract data type); Applied mathematics; Discrete mathematics; Algorithm; Combinatorics; Computer science; Mathematical analysis","score_opus":0.03546421941878482,"score_gpt":0.2899272823238965,"score_spread":0.25446306290511167,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2131222327","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.012423633,0.0004146034,0.98242354,0.00027904284,0.000110258756,0.000025127056,0.000018140123,0.00012254472,0.004183131],"genre_scores_gemma":[0.5252448,0.0013966096,0.46090323,0.00023657153,0.000242993,0.00024055975,0.00012523163,0.00021991417,0.011390109],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9982728,0.00083592144,0.000073402465,0.00014963567,0.00056699343,0.00010124112],"domain_scores_gemma":[0.99343663,0.0048554204,0.00029978962,0.00056915794,0.00068314,0.00015594912],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0034621547,0.0011407916,0.0015707264,0.0013446913,0.000527747,0.0016640344,0.0017805388,0.001603967,0.0029721486],"category_scores_gemma":[0.017486956,0.00065178366,0.00090424204,0.0010034962,0.0028136815,0.00239416,0.003230357,0.002792712,0.0005572381],"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.00019261878,0.00004822174,0.00046206906,0.00019357009,0.000040297997,0.0000745742,0.00015649792,0.3463719,0.0026702778,0.59345907,0.0016947318,0.054636132],"study_design_scores_gemma":[0.000018011291,0.000017532338,0.000041044972,0.000015240686,0.000007304588,0.000018624016,0.000011179562,0.9128242,0.00049207883,0.08562433,0.0009243718,0.0000060439343],"about_ca_topic_score_codex":0.0020969464,"about_ca_topic_score_gemma":0.0012013837,"teacher_disagreement_score":0.0034621547,"about_ca_system_score_codex":0.0014065264,"about_ca_system_score_gemma":0.000801826,"threshold_uncertainty_score":0.018309832},"labels":[],"label_agreement":null},{"id":"W2234351191","doi":"10.1007/s11075-015-0095-2","title":"Software for the Gale transform of fewnomial systems and a Descartes rule for fewnomials","year":2016,"lang":"en","type":"article","venue":"Numerical Algorithms","topic":"Polynomial and algebraic computation","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 Toronto; Fields Institute for Research in Mathematical Sciences","funders":"National Key Research and Development Program of China; Directorate for Mathematical and Physical Sciences; Defense Advanced Research Projects Agency; National Natural Science Foundation of China; National Science Foundation","keywords":"Theory of computation; Software; Mathematics; Rule-based system; Computer science; Algorithm; Artificial intelligence; Programming language","score_opus":0.01946746877301521,"score_gpt":0.2497056394969522,"score_spread":0.23023817072393699,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2234351191","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.0023644727,0.00022415067,0.9477472,0.00012308967,0.00010981378,0.0000764513,0.0006318744,0.037657954,0.011064985],"genre_scores_gemma":[0.0830391,0.00053531217,0.87595177,0.00032662225,0.00017298464,0.0003150624,0.0031511458,0.019972049,0.016536],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99863017,0.00021380778,0.00019386309,0.0002850565,0.0005635263,0.00011358971],"domain_scores_gemma":[0.9965533,0.001638831,0.0001473646,0.0009170602,0.0006360443,0.00010746676],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020055547,0.0010505875,0.0012749156,0.0019637565,0.0008907528,0.004014964,0.00241205,0.0012631537,0.053553175],"category_scores_gemma":[0.010847992,0.0010104433,0.0021569263,0.0016336326,0.0012928619,0.004219838,0.0023199606,0.0029248665,0.019379364],"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.00029067206,0.00018257416,0.0021343313,0.0008309255,0.00015592256,0.0002431416,0.000596227,0.01148337,0.008505188,0.44097322,0.053795367,0.4808091],"study_design_scores_gemma":[0.00027655324,0.00007552992,0.000660841,0.0003259877,0.0000838749,0.0005546185,0.00015026434,0.14904948,0.03405621,0.5545977,0.26002908,0.0001399037],"about_ca_topic_score_codex":0.0012926303,"about_ca_topic_score_gemma":0.001957398,"teacher_disagreement_score":0.053553175,"about_ca_system_score_codex":0.0010342962,"about_ca_system_score_gemma":0.0013385084,"threshold_uncertainty_score":0.1791532},"labels":[],"label_agreement":null},{"id":"W2287475882","doi":"10.1007/s11075-015-0085-4","title":"Optimal Rates of Linear Convergence of Relaxed Alternating Projections and Generalized Douglas-Rachford Methods for Two Subspaces","year":2015,"lang":"en","type":"article","venue":"Numerical Algorithms","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":46,"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 British Columbia, Okanagan Campus; University of British Columbia","funders":"","keywords":"Linear subspace; Rate of convergence; Mathematics; Projection (relational algebra); Eigenvalues and eigenvectors; Theory of computation; Convergence (economics); Applied mathematics; Nonlinear system; Projection method; Intersection (aeronautics); Matrix (chemical analysis); Dykstra's projection algorithm; Mathematical optimization; Algorithm; Pure mathematics; Computer science","score_opus":0.06371311389702866,"score_gpt":0.39677105204245355,"score_spread":0.3330579381454249,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2287475882","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.025714288,0.0014629737,0.9646516,0.0009957702,0.00022945991,0.00014024635,0.00011898696,0.00029472986,0.006391978],"genre_scores_gemma":[0.3536458,0.0019746877,0.6291881,0.0006428455,0.00039902513,0.0010921205,0.0004356679,0.0010028766,0.011618773],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99258065,0.005106994,0.00029831432,0.00046414245,0.0010818732,0.000468086],"domain_scores_gemma":[0.9527837,0.036678243,0.001792425,0.0027937696,0.004174229,0.0017776005],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.019010352,0.0031697508,0.0018795738,0.002214816,0.0013763326,0.0035380947,0.0037799843,0.004220625,0.0065803854],"category_scores_gemma":[0.074877754,0.0015708706,0.0016934557,0.001979583,0.0062968293,0.0071101766,0.007594264,0.0061422503,0.001321449],"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.0012386988,0.00019488703,0.0010068341,0.00086259644,0.00013242773,0.00012847067,0.0008001527,0.31818643,0.0041638906,0.61390644,0.00489778,0.054481395],"study_design_scores_gemma":[0.0000760261,0.00012820153,0.00020693884,0.00012266381,0.000031220843,0.000069999136,0.00012514435,0.88295186,0.0028927855,0.11196343,0.0013713735,0.00006039524],"about_ca_topic_score_codex":0.002575047,"about_ca_topic_score_gemma":0.0023464542,"teacher_disagreement_score":0.019010352,"about_ca_system_score_codex":0.002394152,"about_ca_system_score_gemma":0.0039436966,"threshold_uncertainty_score":0.10053754},"labels":[],"label_agreement":null},{"id":"W2470937552","doi":"10.1007/s11075-016-0166-z","title":"A new high-order energy-preserving scheme for the modified Korteweg-de Vries equation","year":2016,"lang":"en","type":"article","venue":"Numerical Algorithms","topic":"Numerical methods for differential equations","field":"Mathematics","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":"York University","funders":"National Natural Science Foundation of China","keywords":"Mathematics; Korteweg–de Vries equation; Theory of computation; Order (exchange); Scheme (mathematics); Applied mathematics; Energy (signal processing); Mathematical physics; Mathematical analysis; Nonlinear system; Physics; Algorithm; Statistics","score_opus":0.10161440348105644,"score_gpt":0.351534477393832,"score_spread":0.24992007391277554,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2470937552","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.027061202,0.0005179552,0.96203166,0.0003086314,0.0005997335,0.00010852357,0.000087336295,0.00021149853,0.009073457],"genre_scores_gemma":[0.28022167,0.0008488081,0.6903412,0.00028340754,0.00031566777,0.0002662634,0.00027336058,0.00028542706,0.027164191],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9997559,0.000052431304,0.000017727516,0.000026805328,0.00012841796,0.00001860663],"domain_scores_gemma":[0.99978167,0.000039805822,0.000025348394,0.000050480816,0.00006316773,0.000039516093],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00050333847,0.00051488983,0.00082087377,0.00051715685,0.0005058636,0.0009123029,0.0017688315,0.0012469431,0.0026039504],"category_scores_gemma":[0.0010103283,0.00026576946,0.00075263204,0.0005140628,0.0008974168,0.0013433504,0.0016846483,0.0013844629,0.0007029125],"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.00025324832,0.0002320313,0.0008352231,0.00042073845,0.00008949358,0.0004896817,0.00034296387,0.2044341,0.076718815,0.5861353,0.0038220214,0.12622634],"study_design_scores_gemma":[0.000047721358,0.00006616747,0.0002110889,0.000017342094,0.000018481103,0.00013554523,0.000014898184,0.96004486,0.004116684,0.025290102,0.010007889,0.000029217394],"about_ca_topic_score_codex":0.0011810536,"about_ca_topic_score_gemma":0.0015095889,"teacher_disagreement_score":0.0026039504,"about_ca_system_score_codex":0.00050420786,"about_ca_system_score_gemma":0.0008511198,"threshold_uncertainty_score":0.0087111},"labels":[],"label_agreement":null},{"id":"W2523344345","doi":"10.1007/s11075-016-0188-6","title":"Numerical methods for computing sensitivities for ODEs and DDEs","year":2016,"lang":"en","type":"article","venue":"Numerical Algorithms","topic":"Fractional Differential Equations Solutions","field":"Mathematics","cited_by":15,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Adjoint equation; Mathematics; Ode; Ordinary differential equation; Applied mathematics; Classification of discontinuities; Computation; Discontinuity (linguistics); Delay differential equation; Numerical analysis; Differential equation; Mathematical optimization; Mathematical analysis; Algorithm","score_opus":0.11068662376741367,"score_gpt":0.43701573968860685,"score_spread":0.3263291159211932,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2523344345","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.0024496496,0.00059643236,0.9939062,0.00015485121,0.00012722865,0.000033952703,0.000035683937,0.00019280678,0.0025031464],"genre_scores_gemma":[0.13836959,0.0015048009,0.8528573,0.00022762774,0.0002188365,0.00036167112,0.00014191469,0.00041567316,0.0059025623],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.998844,0.00045873914,0.000088253895,0.00009560037,0.0004612255,0.000052071588],"domain_scores_gemma":[0.9956897,0.0027917307,0.00031637514,0.00041345897,0.0006518303,0.00013686542],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0025447286,0.0010514441,0.0010938117,0.001989171,0.0011226797,0.0015989663,0.0013720668,0.0015656465,0.003064486],"category_scores_gemma":[0.0148082,0.00068772107,0.001130676,0.001774339,0.0015653915,0.0016825404,0.002366339,0.0030671048,0.0007922699],"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.00008519548,0.000096819145,0.00096425455,0.0006294104,0.00013405943,0.000113770206,0.00033253647,0.49363083,0.008807357,0.34182072,0.002992218,0.15039293],"study_design_scores_gemma":[0.000009768214,0.000012835448,0.000120099015,0.000045765173,0.000014866053,0.00003425986,0.000017923505,0.9267348,0.0015321741,0.06730239,0.0041572456,0.0000179166],"about_ca_topic_score_codex":0.0034298387,"about_ca_topic_score_gemma":0.0031847502,"teacher_disagreement_score":0.0034298387,"about_ca_system_score_codex":0.0011794728,"about_ca_system_score_gemma":0.0015784424,"threshold_uncertainty_score":0.013458014},"labels":[],"label_agreement":null},{"id":"W2763895446","doi":"10.1007/s11075-017-0424-8","title":"Matrix-free monolithic homotopy continuation with application to computational aerodynamics","year":2017,"lang":"en","type":"article","venue":"Numerical Algorithms","topic":"Advanced Numerical Analysis Techniques","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"Natural Sciences and Engineering Research Council of Canada; University of Toronto; Canada Excellence Research Chairs, Government of Canada","keywords":"Theory of computation; Mathematics; Aerodynamics; Continuation; Homotopy; Homotopy analysis method; Matrix (chemical analysis); Algebra over a field; Applied mathematics; Calculus (dental); Topology (electrical circuits); Pure mathematics; Algorithm; Computer science; Combinatorics; Aerospace engineering; Engineering","score_opus":0.005511948689517506,"score_gpt":0.263346850406424,"score_spread":0.25783490171690654,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2763895446","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.008312918,0.00008706817,0.9835774,0.000095008814,0.00013821118,0.000027425684,0.000016233798,0.00052153016,0.0072242897],"genre_scores_gemma":[0.3070958,0.00031312252,0.6663987,0.00013354913,0.00015713529,0.00017077122,0.00007130232,0.00071003515,0.02494957],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99979264,0.00005686669,0.000008575283,0.00002589798,0.00009866021,0.000017409015],"domain_scores_gemma":[0.9994729,0.0001980608,0.00002489688,0.00011664366,0.00014954877,0.00003801879],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005498585,0.00060769235,0.00053423236,0.0007522219,0.0007716564,0.00094195124,0.0011921892,0.0011095041,0.006476244],"category_scores_gemma":[0.0020295214,0.00040408663,0.00047252257,0.0005328587,0.00082603603,0.0012445564,0.0018794155,0.0014941869,0.0020574764],"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.00025276552,0.00037318424,0.0006692079,0.0002521914,0.00005523356,0.00030463416,0.00038162913,0.18087846,0.046876498,0.43208283,0.0066998857,0.33117354],"study_design_scores_gemma":[0.00002319282,0.00005482789,0.00011187632,0.000016937349,0.000008828964,0.00007091388,0.000027411503,0.9347119,0.0067610117,0.051988896,0.0062075676,0.000016678467],"about_ca_topic_score_codex":0.00076306507,"about_ca_topic_score_gemma":0.0011764471,"teacher_disagreement_score":0.006476244,"about_ca_system_score_codex":0.00025410287,"about_ca_system_score_gemma":0.0006521906,"threshold_uncertainty_score":0.021665215},"labels":[],"label_agreement":null},{"id":"W2767825672","doi":"10.1007/s11075-017-0437-3","title":"Boundary layer preconditioners for finite-element discretizations of singularly perturbed reaction-diffusion problems","year":2017,"lang":"en","type":"article","venue":"Numerical Algorithms","topic":"Differential Equations and Numerical Methods","field":"Mathematics","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Memorial University of Newfoundland","funders":"Canadian Network for Research and Innovation in Machining Technology, Natural Sciences and Engineering Research Council of Canada; Irish Research Council","keywords":"Preconditioner; Mathematics; Discretization; Finite element method; Polygon mesh; Boundary layer; Singular perturbation; Numerical analysis; Applied mathematics; Mathematical analysis; Multigrid method; Boundary value problem; Linear system; Partial differential equation; Geometry","score_opus":0.09395097368211223,"score_gpt":0.3795944641367546,"score_spread":0.2856434904546423,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2767825672","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.017305354,0.0003078782,0.9767601,0.0003200108,0.0002733587,0.0000694356,0.000088263936,0.00055767933,0.004317973],"genre_scores_gemma":[0.27649406,0.0005398082,0.7097531,0.00031400265,0.00021512381,0.00050517765,0.000413435,0.0007069175,0.011058472],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992459,0.00033418948,0.00004738486,0.000054843716,0.000259108,0.000058620622],"domain_scores_gemma":[0.9978886,0.0010768555,0.00019148596,0.00029872815,0.00036484885,0.00017937511],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015781687,0.0008329736,0.0010618985,0.00068987213,0.00080648164,0.0012967044,0.0011583472,0.0018764158,0.0034890631],"category_scores_gemma":[0.0057186577,0.00045336742,0.0006531246,0.0003968435,0.0013003343,0.0013231522,0.002287465,0.0027397913,0.0011112505],"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.00059566175,0.00027122116,0.0010128287,0.0005905395,0.00012264271,0.00025837022,0.0006590074,0.55678874,0.05349703,0.22654083,0.009059861,0.15060326],"study_design_scores_gemma":[0.000033423385,0.000025338935,0.000091302536,0.000024777322,0.00000750484,0.000014286193,0.000019605543,0.9764929,0.004596917,0.015953552,0.0027313333,0.000009091637],"about_ca_topic_score_codex":0.0022823806,"about_ca_topic_score_gemma":0.0026083419,"teacher_disagreement_score":0.0034890631,"about_ca_system_score_codex":0.00054871663,"about_ca_system_score_gemma":0.0011398216,"threshold_uncertainty_score":0.011672139},"labels":[],"label_agreement":null},{"id":"W2771401084","doi":"10.1007/s11075-017-0450-6","title":"Preconditioning of spectral methods via Birkhoff interpolation","year":2017,"lang":"en","type":"article","venue":"Numerical Algorithms","topic":"Numerical methods for differential equations","field":"Mathematics","cited_by":12,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Preconditioner; Birkhoff interpolation; Interpolation (computer graphics); Matrix (chemical analysis); Identity matrix; Condition number; Applied mathematics; Collocation (remote sensing); Mathematical analysis; Eigenvalues and eigenvectors; Linear interpolation; Polynomial interpolation; Linear system","score_opus":0.10801369033901004,"score_gpt":0.45752378758049156,"score_spread":0.3495100972414815,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2771401084","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.018706413,0.0004571096,0.96885407,0.00023580596,0.0003957048,0.000044532928,0.000055684795,0.00040552777,0.01084512],"genre_scores_gemma":[0.4501844,0.0011097193,0.53138673,0.00036977997,0.00040496993,0.00023230852,0.00029135405,0.00095532596,0.015065496],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99892706,0.000546454,0.00004849456,0.00009713987,0.00028070447,0.000100153666],"domain_scores_gemma":[0.9982175,0.0006748951,0.00014007081,0.00040143155,0.000420151,0.00014586885],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015517139,0.00094273547,0.0009787543,0.0011824381,0.00071828783,0.0011229219,0.0009716382,0.00101374,0.0069293855],"category_scores_gemma":[0.0065038074,0.00035202224,0.00055812026,0.0009599549,0.0019931924,0.001975148,0.0022155598,0.0025033846,0.0019012124],"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.0006292648,0.00026124658,0.000643454,0.00038410208,0.000052842734,0.00012219149,0.00036269598,0.11223455,0.02200428,0.68847406,0.0066481484,0.16818321],"study_design_scores_gemma":[0.000051018054,0.00012665878,0.0002391776,0.000055175304,0.000015999836,0.000053549953,0.000062958236,0.7857527,0.0084408,0.19529416,0.00987284,0.000035020756],"about_ca_topic_score_codex":0.0017325924,"about_ca_topic_score_gemma":0.0024789327,"teacher_disagreement_score":0.0069293855,"about_ca_system_score_codex":0.00060498697,"about_ca_system_score_gemma":0.0011055298,"threshold_uncertainty_score":0.02318114},"labels":[],"label_agreement":null},{"id":"W2911603412","doi":"10.1007/s11075-019-00669-y","title":"Gating-enhanced IMEX splitting methods for cardiac monodomain simulation","year":2019,"lang":"en","type":"article","venue":"Numerical Algorithms","topic":"Cardiac electrophysiology and arrhythmias","field":"Medicine","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 Saskatchewan","funders":"","keywords":"Gating; Integrator; Mathematics; Ordinary differential equation; Scale (ratio); Partial differential equation; Exponential integrator; Biological system; Stability (learning theory); Exponential function; Mathematical analysis; Applied mathematics; Differential equation; Numerical stability; Mechanics; Numerical analysis; Computer science; Physics; Voltage; Differential algebraic equation; Biophysics","score_opus":0.015103069894293952,"score_gpt":0.362093451082811,"score_spread":0.34699038118851705,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2911603412","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.01708272,0.00020227038,0.9747868,0.00017384347,0.00007520637,0.000056110046,0.00006226318,0.00029328853,0.0072675156],"genre_scores_gemma":[0.58504075,0.0003893752,0.40016463,0.00027907785,0.00007943837,0.00030897834,0.00022605683,0.0005919835,0.012919702],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99987733,0.000050376762,0.0000064546794,0.000010430223,0.00003799299,0.000017384475],"domain_scores_gemma":[0.9995134,0.00022016033,0.00003542313,0.00006597136,0.000118466014,0.000046628724],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005217432,0.0005179,0.0005262443,0.00030871574,0.00039955004,0.0007091816,0.0008844967,0.00086865947,0.0042170053],"category_scores_gemma":[0.0017248531,0.00026069276,0.00031642482,0.00033497502,0.00049069436,0.0006850626,0.0012565684,0.0009578477,0.0007432289],"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.00023957087,0.00011775005,0.0011146587,0.00013923935,0.00004046709,0.00021217193,0.0003081939,0.7969238,0.012559741,0.12664668,0.0024789912,0.059218742],"study_design_scores_gemma":[0.000007729663,0.000007968779,0.00003506417,0.000005986604,0.0000017793268,0.000010554732,0.000008606745,0.99316615,0.0006255915,0.0052705165,0.0008572876,0.0000028319307],"about_ca_topic_score_codex":0.0020250075,"about_ca_topic_score_gemma":0.0020411236,"teacher_disagreement_score":0.0042170053,"about_ca_system_score_codex":0.00037290706,"about_ca_system_score_gemma":0.00062700635,"threshold_uncertainty_score":0.014107287},"labels":[],"label_agreement":null},{"id":"W2963660587","doi":"10.1007/s11075-019-00681-2","title":"A study of Schröder’s method for the matrix pth root using power series expansions","year":2019,"lang":"en","type":"article","venue":"Numerical Algorithms","topic":"Iterative Methods for Nonlinear Equations","field":"Mathematics","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Regina","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Invertible matrix; Diagonal matrix; Convergent matrix; Matrix (chemical analysis); Power series; Scalar (mathematics); Band matrix; Nonnegative matrix; Symmetric matrix; Eigenvalues and eigenvectors; Matrix splitting; Convergence (economics); Mathematical analysis; Pure mathematics; Square matrix; Diagonal; Geometry; Physics","score_opus":0.12291952836220321,"score_gpt":0.4592171687068867,"score_spread":0.3362976403446835,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2963660587","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.022287259,0.0025636703,0.9275185,0.0014681673,0.000687693,0.00010138791,0.000060077855,0.0002124504,0.045100793],"genre_scores_gemma":[0.37608746,0.0045936913,0.54596096,0.001160018,0.001265526,0.0003735517,0.00016930903,0.0013220332,0.06906746],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985329,0.00089028815,0.00004788865,0.000107806,0.00034836034,0.00007269713],"domain_scores_gemma":[0.99520653,0.0033333728,0.00021085965,0.0004595345,0.0005724259,0.00021724911],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003799773,0.0013577854,0.0012990581,0.0019356331,0.001123664,0.0016798434,0.0024512575,0.0021984829,0.006560985],"category_scores_gemma":[0.014547489,0.00060961716,0.0017158655,0.0017324119,0.0037125244,0.0038614958,0.002515716,0.0029231482,0.0013686143],"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.0000283763,0.000030606585,0.00013559089,0.00012693349,0.000027752187,0.00009178564,0.00014846213,0.016885845,0.000950101,0.96885365,0.0016913405,0.011029466],"study_design_scores_gemma":[0.000030842395,0.000041709227,0.00015832252,0.000080166035,0.00002385733,0.00012332418,0.00004800089,0.46877715,0.0012218314,0.5224779,0.0069748904,0.000041929296],"about_ca_topic_score_codex":0.002140911,"about_ca_topic_score_gemma":0.002133378,"teacher_disagreement_score":0.006560985,"about_ca_system_score_codex":0.001299516,"about_ca_system_score_gemma":0.0014553103,"threshold_uncertainty_score":0.021948695},"labels":[],"label_agreement":null},{"id":"W3000683368","doi":"10.1007/s11075-019-00853-0","title":"Computation of energy eigenvalues of the anharmonic Coulombic potential with irregular singularities","year":2020,"lang":"en","type":"article","venue":"Numerical Algorithms","topic":"Quantum Mechanics and Non-Hermitian Physics","field":"Physics and Astronomy","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Eigenvalues and eigenvectors; Computation; Theory of computation; Anharmonicity; Gravitational singularity; Transformation (genetics); Mathematics; Applied mathematics; Numerical analysis; Exponential function; Mathematical analysis; Algorithm; Physics; Quantum mechanics","score_opus":0.010705311175364269,"score_gpt":0.21802839245716604,"score_spread":0.20732308128180177,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3000683368","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.56997705,0.00032392037,0.4110365,0.00068660575,0.00012762124,0.00005620872,0.00010537236,0.00045892826,0.01722787],"genre_scores_gemma":[0.9159719,0.00008618678,0.08060112,0.000058991878,0.000031612355,0.000051127423,0.000085449064,0.0001757838,0.0029377628],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99975437,0.00010253873,0.000014041785,0.000025661171,0.00007315104,0.000030199448],"domain_scores_gemma":[0.9976978,0.0015150735,0.00015073795,0.00017958127,0.00025450386,0.00020238734],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010353792,0.00058236695,0.00072595984,0.0009442726,0.00085879915,0.0013797791,0.0012783026,0.0010508527,0.0030261425],"category_scores_gemma":[0.0062612244,0.00043009108,0.00030712844,0.0007823954,0.0012928464,0.0015803387,0.0012365698,0.00088510633,0.00032662286],"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.00026436054,0.00017976455,0.002055789,0.00017674548,0.00006093934,0.00031998428,0.0002539268,0.70942664,0.0041633025,0.25860366,0.0015290702,0.022965848],"study_design_scores_gemma":[0.000019299474,0.000008371202,0.00013938504,0.0000058255446,0.0000024157048,0.000014459893,0.000026503167,0.97082245,0.0004939574,0.02830265,0.0001590102,0.000005668318],"about_ca_topic_score_codex":0.0020175849,"about_ca_topic_score_gemma":0.0027403424,"teacher_disagreement_score":0.0030261425,"about_ca_system_score_codex":0.00086742954,"about_ca_system_score_gemma":0.0009036461,"threshold_uncertainty_score":0.010123432},"labels":[],"label_agreement":null},{"id":"W3001281533","doi":"10.1007/s11075-020-00879-9","title":"Mixed finite element methods for the Oseen problem","year":2020,"lang":"en","type":"article","venue":"Numerical Algorithms","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":"Université de Moncton","funders":"","keywords":"Mathematics; Piecewise; Finite element method; Theory of computation; Mathematical analysis; Galerkin method; Discontinuous Galerkin method; Tensor (intrinsic definition); Mixed finite element method; Pressure gradient; Applied mathematics; Geometry; Algorithm; Mechanics; Physics","score_opus":0.08276352994104468,"score_gpt":0.3634561516944471,"score_spread":0.2806926217534024,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3001281533","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.00609445,0.00033748063,0.988015,0.00014758826,0.000110389956,0.00002723181,0.00004872833,0.000088587374,0.0051305294],"genre_scores_gemma":[0.22679327,0.0007278734,0.7483203,0.00028317253,0.00020139774,0.00034370518,0.00025376488,0.00040945283,0.022667065],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993616,0.0002479139,0.0000333861,0.000045693483,0.00027556883,0.000035908623],"domain_scores_gemma":[0.99894077,0.0005600127,0.000092642054,0.00009404282,0.00024757566,0.00006502598],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010433806,0.00077304745,0.0008128072,0.00095144176,0.0005203873,0.0012103255,0.0013749171,0.0012647941,0.0057028453],"category_scores_gemma":[0.0033498951,0.00039723623,0.00079045404,0.00061901484,0.0008629025,0.0018574675,0.0023385144,0.0017287591,0.0009916263],"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.0003194048,0.0001718105,0.00088024716,0.0005050102,0.000114617214,0.00011299326,0.00034441435,0.3542665,0.01647978,0.48476622,0.0034934299,0.13854557],"study_design_scores_gemma":[0.000020520225,0.00003625686,0.000062332416,0.000033189277,0.0000107030855,0.000037340273,0.00003563384,0.95925444,0.001735585,0.032743435,0.0060161618,0.000014474592],"about_ca_topic_score_codex":0.0010099877,"about_ca_topic_score_gemma":0.0013682102,"teacher_disagreement_score":0.0057028453,"about_ca_system_score_codex":0.00040998703,"about_ca_system_score_gemma":0.0008054498,"threshold_uncertainty_score":0.019077957},"labels":[],"label_agreement":null},{"id":"W3009848594","doi":"10.1007/s11075-020-00892-y","title":"Superconvergence in H1-norm of a difference finite element method for the heat equation in a 3D spatial domain with almost-uniform mesh","year":2020,"lang":"en","type":"article","venue":"Numerical Algorithms","topic":"Advanced Numerical Methods in Computational Mathematics","field":"Engineering","cited_by":13,"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":"Superconvergence; Mathematics; Finite element method; Norm (philosophy); Bounded function; Heat equation; Interpolation (computer graphics); Mathematical analysis; Convergence (economics); Domain (mathematical analysis); Geometry; Applied mathematics; Computer science","score_opus":0.039020625340264535,"score_gpt":0.30238439732226696,"score_spread":0.26336377198200245,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3009848594","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.27708313,0.00064660213,0.7045708,0.0008805197,0.00034598817,0.000110880246,0.00017711248,0.00020440205,0.015980592],"genre_scores_gemma":[0.87137955,0.0003744953,0.11801158,0.0002938256,0.00013073071,0.00016545545,0.00037159567,0.00028270492,0.008989945],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99952257,0.0002302178,0.000024789699,0.00004621297,0.00013781297,0.00003837512],"domain_scores_gemma":[0.9962387,0.002401637,0.00022464395,0.00018750901,0.0007232858,0.0002242071],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002086704,0.00060481223,0.00058557425,0.00092712697,0.0005311179,0.0012839756,0.0010353097,0.0012183447,0.0020040073],"category_scores_gemma":[0.0062725744,0.0002527059,0.0004864865,0.0003977781,0.0019754197,0.0010361722,0.0014600939,0.0011197467,0.00017158219],"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.0006005072,0.00031735623,0.00524081,0.00047018292,0.00009591699,0.00043970472,0.00063054473,0.75387573,0.016456433,0.17918125,0.0033830144,0.039308626],"study_design_scores_gemma":[0.00000425022,0.000021240829,0.00014079212,0.000007341187,0.0000018221748,0.000015366295,0.00001563076,0.9938147,0.00049732445,0.0051931636,0.00028408342,0.000004321831],"about_ca_topic_score_codex":0.003803206,"about_ca_topic_score_gemma":0.0029762788,"teacher_disagreement_score":0.003803206,"about_ca_system_score_codex":0.0006675921,"about_ca_system_score_gemma":0.0008065669,"threshold_uncertainty_score":0.011035681},"labels":[],"label_agreement":null},{"id":"W3022521945","doi":"10.1007/s11075-020-00926-5","title":"An optimal 13-point finite difference scheme for a 2D Helmholtz equation with a perfectly matched layer boundary condition","year":2020,"lang":"en","type":"article","venue":"Numerical Algorithms","topic":"Electromagnetic Simulation and Numerical Methods","field":"Engineering","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Helmholtz equation; Theory of computation; Mathematical analysis; Perfectly matched layer; Scheme (mathematics); Boundary layer; Finite difference method; Layer (electronics); Finite difference; Blasius boundary layer; Finite difference scheme; Point (geometry); Boundary (topology); Boundary value problem; Geometry; Boundary layer thickness; Mechanics; Algorithm; Physics","score_opus":0.03341095265633933,"score_gpt":0.2884768538702902,"score_spread":0.2550659012139509,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3022521945","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.008163762,0.000083852225,0.9883272,0.0000706545,0.00008968901,0.000059229224,0.00006484117,0.00014984573,0.0029909785],"genre_scores_gemma":[0.08246395,0.00008502689,0.9136648,0.00007608305,0.00003021175,0.00018687097,0.0001494399,0.0001217471,0.003221828],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997501,0.00006107992,0.00001691455,0.000032017982,0.0001203556,0.000019579405],"domain_scores_gemma":[0.99969745,0.00011650764,0.000021888653,0.00003686094,0.00010421232,0.0000231342],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000585969,0.00042754746,0.000644922,0.0003697128,0.00040256447,0.00049344765,0.0013594488,0.0012007379,0.004820231],"category_scores_gemma":[0.0014369629,0.00037673375,0.00044560924,0.00037852206,0.0004473022,0.00076573837,0.0008731842,0.0008989778,0.00095501833],"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.0003975927,0.00028027335,0.0012877847,0.00047918787,0.000056890556,0.00023859215,0.00029536945,0.5427118,0.062389128,0.15697685,0.006350433,0.2285361],"study_design_scores_gemma":[0.000024163504,0.00002890862,0.000123141,0.000012168227,0.000005925419,0.000041268904,0.000009754041,0.99073493,0.002552238,0.0036080629,0.0028472708,0.000012194842],"about_ca_topic_score_codex":0.0020894313,"about_ca_topic_score_gemma":0.002953329,"teacher_disagreement_score":0.004820231,"about_ca_system_score_codex":0.00046758694,"about_ca_system_score_gemma":0.0012876218,"threshold_uncertainty_score":0.016125262},"labels":[],"label_agreement":null},{"id":"W3036170074","doi":"10.1007/s11075-021-01108-7","title":"A simple extrapolation method for clustered eigenvalues","year":2021,"lang":"en","type":"preprint","venue":"Numerical Algorithms","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"Directorate for Mathematical and Physical Sciences; Canadian Network for Research and Innovation in Machining Technology, Natural Sciences and Engineering Research Council of Canada","keywords":"Extrapolation; Eigenvalues and eigenvectors; Simple (philosophy); Convergence (economics); Power iteration; Mathematics; Applied mathematics; Inverse iteration; Mathematical optimization; Mathematical analysis; Iterative method; Physics","score_opus":0.034278272300960505,"score_gpt":0.3303777501401693,"score_spread":0.29609947783920876,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3036170074","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.004687502,0.00017817083,0.99103206,0.00009243531,0.00019443806,0.000052773183,0.00005466446,0.0006063371,0.0031015442],"genre_scores_gemma":[0.118239455,0.00045632466,0.86340535,0.00025971598,0.00023552611,0.00028343787,0.00020344168,0.00085869874,0.016057925],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995197,0.00016847737,0.00002153637,0.000054684286,0.00020727419,0.000028245218],"domain_scores_gemma":[0.9988726,0.00041817402,0.000050262828,0.00025906131,0.0003207421,0.00007918583],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009641543,0.0007764583,0.0009218626,0.0011006271,0.00064372213,0.00071953336,0.0016331389,0.0013356596,0.009795145],"category_scores_gemma":[0.004151979,0.00035748063,0.0007807048,0.0011067848,0.0006406967,0.0015086799,0.0016711926,0.0016326383,0.0037446576],"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.000510788,0.00040460695,0.0009853571,0.00081559015,0.00017176715,0.00057757396,0.00048574738,0.22136232,0.05068471,0.23648547,0.020881563,0.46663454],"study_design_scores_gemma":[0.000039078655,0.000060790917,0.0001982828,0.000049826063,0.000021601401,0.00014281733,0.000034192348,0.9305382,0.004691767,0.055498276,0.008695732,0.00002952094],"about_ca_topic_score_codex":0.0007733864,"about_ca_topic_score_gemma":0.0012066868,"teacher_disagreement_score":0.009795145,"about_ca_system_score_codex":0.00030649663,"about_ca_system_score_gemma":0.00058438163,"threshold_uncertainty_score":0.03276807},"labels":[],"label_agreement":null},{"id":"W3048289368","doi":"10.1007/s11075-020-00972-z","title":"Derivation and analysis of computational methods for fractional Laplacian equations with absorbing layers","year":2020,"lang":"en","type":"article","venue":"Numerical Algorithms","topic":"Numerical methods in engineering","field":"Engineering","cited_by":18,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Montréal; Carleton University","funders":"Natural Sciences and Engineering Research Council of Canada; Agence Nationale de la Recherche; Division of Mathematical Sciences; National University of Singapore; Canadian Network for Research and Innovation in Machining Technology, Natural Sciences and Engineering Research Council of Canada; Université de Lorraine","keywords":"Mathematics; Theory of computation; Computation; Fractional Laplacian; Boundary value problem; Applied mathematics; Numerical analysis; Laplace operator; Space (punctuation); Fourier transform; Mathematical analysis; Computer science; Algorithm","score_opus":0.034736681001411494,"score_gpt":0.32924018598363247,"score_spread":0.294503504982221,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3048289368","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.0052367984,0.0010740232,0.9766396,0.00041820653,0.00028375475,0.00008472277,0.000058941736,0.00007284041,0.016131112],"genre_scores_gemma":[0.25016624,0.003401134,0.7015543,0.0008019778,0.0006739298,0.0007294045,0.00027045593,0.000740838,0.04166179],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993299,0.00026346915,0.000045342946,0.00004758548,0.00027180405,0.000041780404],"domain_scores_gemma":[0.99820364,0.000862405,0.00014273371,0.0001806057,0.000534586,0.00007600539],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018088733,0.0013843385,0.0008251337,0.0017234292,0.000986825,0.0018049859,0.0019036923,0.0020834138,0.0037569162],"category_scores_gemma":[0.006284909,0.0005073429,0.0013704834,0.0010049643,0.0018870502,0.0019255156,0.0025075746,0.002781138,0.0011574803],"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.000026952614,0.00008063425,0.00029119654,0.00023557177,0.00003950199,0.00014633458,0.00023188774,0.13098852,0.005457376,0.8334985,0.0026119545,0.026391495],"study_design_scores_gemma":[0.000008629936,0.000018744482,0.000111037116,0.000057061265,0.000011436439,0.000075179276,0.00003062693,0.8839104,0.0013421553,0.107797906,0.0066177705,0.000018997207],"about_ca_topic_score_codex":0.002614068,"about_ca_topic_score_gemma":0.0028154643,"teacher_disagreement_score":0.0037569162,"about_ca_system_score_codex":0.0010704532,"about_ca_system_score_gemma":0.0017165233,"threshold_uncertainty_score":0.012568116},"labels":[],"label_agreement":null},{"id":"W3207349189","doi":"10.1007/s11075-022-01429-1","title":"A closest point method library for PDEs on surfaces with parallel domain decomposition solvers and preconditioners","year":2022,"lang":"en","type":"article","venue":"Numerical Algorithms","topic":"Advanced Numerical Methods in Computational Mathematics","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; Memorial University of Newfoundland","funders":"","keywords":"Domain decomposition methods; Theory of computation; Discretization; Partial differential equation; Parallel computing; Scalability; Computer science; Elliptic partial differential equation; Domain (mathematical analysis); Computational science; Software; Mathematics; Algorithm; Finite element method; Mathematical analysis","score_opus":0.014925595232159807,"score_gpt":0.2953748768807683,"score_spread":0.2804492816486085,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3207349189","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.0027583237,0.00023993375,0.97262615,0.00011478579,0.00007113102,0.00009203045,0.00080034917,0.01573302,0.007564146],"genre_scores_gemma":[0.04992767,0.0005884194,0.92722684,0.00016059834,0.0000818775,0.0007874477,0.0043997206,0.006383703,0.010443743],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99882597,0.00018464836,0.000065423555,0.00008466195,0.0007529024,0.00008651208],"domain_scores_gemma":[0.9985869,0.00049383607,0.00008800772,0.0002769171,0.00046268202,0.000091709946],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010506565,0.0012985719,0.0016222224,0.0015009014,0.0009789156,0.0017326593,0.0030220684,0.0017201344,0.024126953],"category_scores_gemma":[0.0031534978,0.0007174074,0.0014114489,0.0020963287,0.0007284123,0.001759148,0.0032450317,0.002208869,0.010661425],"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.0003164537,0.00040134182,0.0015733389,0.0015646976,0.00021785873,0.0006393888,0.00042192996,0.33821547,0.025621409,0.12115863,0.10248039,0.40738907],"study_design_scores_gemma":[0.00013607476,0.00006165673,0.00027609288,0.000086205335,0.000019485073,0.00021185921,0.000049962004,0.8726744,0.013275297,0.032516703,0.080642916,0.000049302096],"about_ca_topic_score_codex":0.0022058203,"about_ca_topic_score_gemma":0.0021825493,"teacher_disagreement_score":0.024126953,"about_ca_system_score_codex":0.00049648725,"about_ca_system_score_gemma":0.0017139398,"threshold_uncertainty_score":0.080712676},"labels":[],"label_agreement":null},{"id":"W4220881341","doi":"10.1007/s11075-022-01277-z","title":"Mixed formulation of a stationary seawater intrusion problem in confined aquifers","year":2022,"lang":"en","type":"article","venue":"Numerical Algorithms","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é de Moncton","funders":"","keywords":"Seawater intrusion; Mathematics; Partial differential equation; Aquifer; Theory of computation; Matrix (chemical analysis); Saltwater intrusion; Seawater; Hydraulic head; Partial derivative; Variable (mathematics); Finite element method; Norm (philosophy); Mathematical analysis; Applied mathematics; Groundwater; Geology; Thermodynamics; Physics; Geotechnical engineering; Chemistry","score_opus":0.02746399166153105,"score_gpt":0.275678627043386,"score_spread":0.24821463538185498,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4220881341","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.19078779,0.0011566821,0.7828606,0.0016436694,0.0004208265,0.00011735282,0.0004094276,0.00014404913,0.022459632],"genre_scores_gemma":[0.89607406,0.00047108746,0.08301192,0.00035433786,0.00024735494,0.00021205124,0.00030832813,0.00011355687,0.01920734],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99968135,0.00010718081,0.000020816702,0.00007147439,0.000079854304,0.00003925773],"domain_scores_gemma":[0.99908745,0.0005060017,0.000119607364,0.00003663559,0.00016182952,0.00008841737],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007005599,0.00073536363,0.00097594125,0.000813541,0.00047412855,0.001893113,0.0016778462,0.002232437,0.0025454478],"category_scores_gemma":[0.0027566615,0.00069954613,0.00071288337,0.00066136394,0.0016824523,0.0014499057,0.0022525608,0.0010949032,0.00017560169],"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.000111791036,0.00008621456,0.0017683577,0.00017337203,0.00007886211,0.00030099932,0.00009857878,0.91143537,0.0031410109,0.073811576,0.0012114411,0.0077824583],"study_design_scores_gemma":[0.000009083985,0.000014998527,0.00011495138,0.0000053725653,0.0000055025744,0.000014854484,0.000020010331,0.99560165,0.00019588828,0.0037246752,0.00028805278,0.000005005766],"about_ca_topic_score_codex":0.007544241,"about_ca_topic_score_gemma":0.0067410455,"teacher_disagreement_score":0.007544241,"about_ca_system_score_codex":0.00079120416,"about_ca_system_score_gemma":0.0011531283,"threshold_uncertainty_score":0.015000701},"labels":[],"label_agreement":null},{"id":"W4221125596","doi":"10.1007/s11075-021-01242-2","title":"Discrete mollification in Bernstein basis and space marching scheme for numerical solution of an inverse two-phase one-dimensional Stefan problem","year":2022,"lang":"en","type":"article","venue":"Numerical Algorithms","topic":"Differential Equations and Numerical Methods","field":"Mathematics","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":"Capilano University","funders":"","keywords":"Mathematics; Numerical integration; Convergence (economics); Applied mathematics; Numerical stability; Numerical analysis; Stability (learning theory); Basis (linear algebra); Basis function; Mathematical analysis; Geometry; Computer science","score_opus":0.07146243302512412,"score_gpt":0.37825916394814363,"score_spread":0.3067967309230195,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4221125596","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.05863739,0.0004486785,0.9339816,0.00033961146,0.00018509648,0.000052735035,0.000053150463,0.00013302967,0.006168744],"genre_scores_gemma":[0.55488867,0.00073216273,0.43253076,0.00013304828,0.00008898912,0.00016944793,0.00015054161,0.00016237149,0.011144008],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99979836,0.00006448825,0.000008930186,0.000020451966,0.00008225653,0.000025505662],"domain_scores_gemma":[0.9997372,0.000097227916,0.000026941296,0.00002955606,0.00007888112,0.00003012647],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00052934804,0.00035309608,0.0006376703,0.00034216064,0.00037886683,0.00062711036,0.0011105435,0.0009086832,0.0019497251],"category_scores_gemma":[0.001330782,0.00018547777,0.00039402215,0.0005013864,0.0007215611,0.00081263104,0.0011396892,0.001237549,0.0003036822],"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.0003963558,0.00020151128,0.001220118,0.0003101294,0.00004350612,0.00018953554,0.00043535736,0.48075813,0.02979543,0.3574061,0.0026818444,0.12656194],"study_design_scores_gemma":[0.00001384997,0.000021884629,0.000051343635,0.0000061973988,0.000002955507,0.00001539055,0.000018689785,0.99063313,0.001147893,0.006941972,0.0011408494,0.0000057893285],"about_ca_topic_score_codex":0.004781141,"about_ca_topic_score_gemma":0.00395004,"teacher_disagreement_score":0.004781141,"about_ca_system_score_codex":0.00051429216,"about_ca_system_score_gemma":0.0009629746,"threshold_uncertainty_score":0.009506583},"labels":[],"label_agreement":null},{"id":"W4226026780","doi":"10.1007/s11075-022-01304-z","title":"Approximating the diagonal of a Hessian: which sample set of points should be used","year":2022,"lang":"en","type":"article","venue":"Numerical Algorithms","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia, Okanagan Campus; University of British Columbia","funders":"Canadian Network for Research and Innovation in Machining Technology, Natural Sciences and Engineering Research Council of Canada","keywords":"Hessian matrix; Mathematics; Diagonal; Diagonal matrix; Matrix (chemical analysis); Main diagonal; Simplex; Combinatorics; Sample (material); Band matrix; Set (abstract data type); Block matrix; Applied mathematics; Mathematical analysis; Symmetric matrix; Square matrix; Geometry; Eigenvalues and eigenvectors; Computer science","score_opus":0.04604667643643701,"score_gpt":0.2855975527531398,"score_spread":0.2395508763167028,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4226026780","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.048161596,0.0004334477,0.9476625,0.0009813104,0.00009212235,0.00012281217,0.0003129916,0.00070775236,0.0015254086],"genre_scores_gemma":[0.35754436,0.00054501684,0.6381,0.00029964582,0.000097196316,0.0002108701,0.0008694871,0.00051598897,0.001817404],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991381,0.00024733547,0.00005199084,0.00018760333,0.0002864901,0.00008840634],"domain_scores_gemma":[0.99700433,0.0011364161,0.00019580504,0.00047237528,0.0010154458,0.00017566468],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017994463,0.00076477503,0.0013211784,0.0010466374,0.000737073,0.0013400358,0.0016955611,0.0023358879,0.004576796],"category_scores_gemma":[0.02084702,0.0007907607,0.0006184622,0.0008878722,0.0011329952,0.0029109477,0.0009823294,0.0016631902,0.0018879961],"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.0012473096,0.000524229,0.013074598,0.0010312838,0.00019963969,0.00019617293,0.0003597123,0.3363677,0.02920771,0.030323135,0.016091159,0.5713774],"study_design_scores_gemma":[0.0001236757,0.00012552916,0.0024495719,0.00021325491,0.000049337057,0.00011698341,0.00016658485,0.9562079,0.0136252185,0.024347639,0.0025388126,0.000035597204],"about_ca_topic_score_codex":0.0062532187,"about_ca_topic_score_gemma":0.0067136316,"teacher_disagreement_score":0.0062532187,"about_ca_system_score_codex":0.0006914051,"about_ca_system_score_gemma":0.0015826765,"threshold_uncertainty_score":0.015310943},"labels":[],"label_agreement":null},{"id":"W4313401694","doi":"10.1007/s11075-022-01462-0","title":"Extrapolation quadrature from equispaced samples of functions with jumps","year":2022,"lang":"en","type":"article","venue":"Numerical Algorithms","topic":"Mathematical functions and polynomials","field":"Mathematics","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"Natural Sciences and Engineering Research Council of Canada; Université de Fribourg","keywords":"Extrapolation; Quadrature (astronomy); Mathematics; Theory of computation; Numerical integration; Gauss–Kronrod quadrature formula; Applied mathematics; Richardson extrapolation; Clenshaw–Curtis quadrature; Gaussian quadrature; Euler's formula; Mathematical analysis; Nyström method; Algorithm; Integral equation","score_opus":0.0537033626567663,"score_gpt":0.29212690046311557,"score_spread":0.23842353780634928,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4313401694","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.06603807,0.00036045283,0.93014693,0.000075688,0.000071493945,0.000030456176,0.000025386344,0.00020594998,0.0030456614],"genre_scores_gemma":[0.668109,0.0003151284,0.32874796,0.000120422905,0.000048578193,0.000047102734,0.00010399216,0.00009571157,0.0024120545],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99938285,0.00019727499,0.0000341037,0.000058927995,0.00028715967,0.00003975747],"domain_scores_gemma":[0.99888974,0.00064460596,0.00008852929,0.00013706795,0.00020017849,0.00004001528],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002053088,0.00038327422,0.0007634549,0.0005935019,0.00022215607,0.0006948771,0.0006848632,0.0005058853,0.0016849379],"category_scores_gemma":[0.004215426,0.00019745143,0.00041018406,0.00078813406,0.0008320244,0.0008639659,0.0008344166,0.0009448473,0.00027914945],"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.0006454672,0.00019006315,0.0029552814,0.00030919953,0.00006711871,0.0006050554,0.00035989322,0.61560476,0.05737711,0.13403597,0.0013528941,0.18649715],"study_design_scores_gemma":[0.000016825199,0.000056791225,0.00026573596,0.000023333783,0.0000060502193,0.00006119129,0.000012602093,0.9834784,0.0060619237,0.009037581,0.0009703078,0.000009094364],"about_ca_topic_score_codex":0.00089605007,"about_ca_topic_score_gemma":0.00054441945,"teacher_disagreement_score":0.002053088,"about_ca_system_score_codex":0.00054282875,"about_ca_system_score_gemma":0.00034954454,"threshold_uncertainty_score":0.01085788},"labels":[],"label_agreement":null},{"id":"W4381489648","doi":"10.1007/s11075-023-01589-8","title":"Alternated inertial algorithms for split feasibility problems","year":2023,"lang":"en","type":"article","venue":"Numerical Algorithms","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":14,"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 British Columbia, Okanagan Campus; University of British Columbia","funders":"","keywords":"Deblurring; Monotonic function; Algorithm; Mathematics; Theory of computation; Convergence (economics); Inertial frame of reference; Subsequence; Set (abstract data type); Hilbert space; Mathematical optimization; Image (mathematics); Image processing; Computer science; Image restoration; Artificial intelligence; Mathematical analysis","score_opus":0.06135734977768593,"score_gpt":0.31752046410624785,"score_spread":0.2561631143285619,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4381489648","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.0076709064,0.00014278997,0.98794055,0.00011207585,0.000074154304,0.00003382921,0.000041217743,0.00013777062,0.0038467795],"genre_scores_gemma":[0.19328554,0.00025280518,0.7991673,0.00015499706,0.00012849267,0.0005106201,0.00028112848,0.00042430617,0.0057948153],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991129,0.0003408862,0.000050766983,0.00010959887,0.0003012884,0.00008452957],"domain_scores_gemma":[0.9971794,0.0016998086,0.0001904774,0.00035643502,0.00041609706,0.00015791041],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020097012,0.0010393858,0.001215322,0.0014096334,0.0008000291,0.0014317954,0.0023052974,0.001529289,0.0105192885],"category_scores_gemma":[0.008597259,0.0010125431,0.0009768407,0.0012476161,0.0015427317,0.0028248066,0.004018692,0.0027434442,0.0016476874],"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.00046162476,0.00024028252,0.0010379754,0.0002767685,0.00008368344,0.00014180063,0.00032354292,0.52025545,0.0035351543,0.28938755,0.0051223547,0.17913383],"study_design_scores_gemma":[0.00004226558,0.00005046871,0.00007797322,0.000017018327,0.000009061892,0.000022246411,0.000020409647,0.9477969,0.0004688255,0.049547546,0.0019385429,0.000008788249],"about_ca_topic_score_codex":0.0013265212,"about_ca_topic_score_gemma":0.002510249,"teacher_disagreement_score":0.0105192885,"about_ca_system_score_codex":0.000581041,"about_ca_system_score_gemma":0.0011058658,"threshold_uncertainty_score":0.035190523},"labels":[],"label_agreement":null},{"id":"W4383373599","doi":"10.1007/s11075-023-01594-x","title":"The Szegö kernel and oblique projections: conformal mapping of non-smooth regions","year":2023,"lang":"en","type":"article","venue":"Numerical Algorithms","topic":"Algebraic and Geometric Analysis","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Conformal map; Kernel (algebra); Connection (principal bundle); Regular polygon; Mathematical analysis; Domain (mathematical analysis); Function (biology); Oblique case; Pure mathematics; Geometry","score_opus":0.04173483078334084,"score_gpt":0.3091659705346947,"score_spread":0.26743113975135385,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4383373599","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.119618975,0.00056568085,0.8714335,0.00054480066,0.0000962837,0.000047589627,0.00008513424,0.00014518909,0.007462851],"genre_scores_gemma":[0.84810174,0.0010116221,0.14104716,0.00014254401,0.00015626878,0.000084957,0.0001743833,0.00019333385,0.009088045],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9997271,0.00010626236,0.00001175999,0.0000471998,0.00007383196,0.00003376362],"domain_scores_gemma":[0.99873024,0.00060584734,0.00015939673,0.00018241511,0.00017383296,0.00014818892],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010488913,0.00062072277,0.00059450173,0.001275226,0.0005248099,0.0019025231,0.00090240536,0.0007001968,0.0021490445],"category_scores_gemma":[0.0065479535,0.00045373055,0.00050262286,0.0007936172,0.0019030265,0.0027130833,0.0022561098,0.0014986657,0.0002748603],"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.000047532776,0.000020553985,0.0005642623,0.00004383278,0.000011750611,0.00005868026,0.00010425133,0.045312136,0.0013595329,0.9387191,0.00059679337,0.013161573],"study_design_scores_gemma":[0.000014290884,0.00001557071,0.0003207977,0.000012267844,0.000005149878,0.000047348945,0.000049481536,0.45220777,0.00072685786,0.5452883,0.0012992489,0.000012919347],"about_ca_topic_score_codex":0.0018168265,"about_ca_topic_score_gemma":0.0012376591,"teacher_disagreement_score":0.0021490445,"about_ca_system_score_codex":0.0008087095,"about_ca_system_score_gemma":0.0008326838,"threshold_uncertainty_score":0.007189274},"labels":[],"label_agreement":null},{"id":"W4385552099","doi":"10.1007/s11075-023-01612-y","title":"Incomplete double-cone factorizations of centrosymmetric matrices arising in spectral methods","year":2023,"lang":"en","type":"article","venue":"Numerical Algorithms","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University; University of British Columbia","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Biharmonic equation; Cone (formal languages); Theory of computation; Type (biology); Helmholtz equation; Helmholtz free energy; Partial differential equation; Mathematical analysis; Numerical analysis; Applied mathematics; Pure mathematics; Algorithm; Boundary value problem; Physics","score_opus":0.03775475680054412,"score_gpt":0.3341415677504152,"score_spread":0.29638681094987107,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4385552099","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.02103648,0.00026699074,0.9722668,0.00020838779,0.00010962274,0.00003292294,0.00009533302,0.00010039182,0.0058829654],"genre_scores_gemma":[0.41597793,0.0011745992,0.56891286,0.0002496817,0.00022853506,0.00017834402,0.00045625138,0.0003295682,0.012492274],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991014,0.00028115083,0.000038154056,0.00009372967,0.0004194036,0.00006631139],"domain_scores_gemma":[0.9965274,0.0015216904,0.0003359085,0.00038892095,0.0009364886,0.00028959263],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020009761,0.0009872909,0.000690976,0.0010125804,0.0007842215,0.0018773914,0.0012135688,0.0008770341,0.0053445585],"category_scores_gemma":[0.009092574,0.00044835018,0.0004331147,0.0011628302,0.0016262176,0.0025410773,0.0012630984,0.0020432342,0.0010297259],"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.00010425191,0.00007426612,0.00065281155,0.00019431754,0.000022409591,0.00016588524,0.00023993252,0.11981985,0.0036558749,0.8248705,0.004900957,0.045298982],"study_design_scores_gemma":[0.0000126635,0.000018226938,0.0001295841,0.000036211037,0.000004109606,0.00006222402,0.000078310106,0.71593946,0.0014203998,0.2796817,0.002600366,0.000016786655],"about_ca_topic_score_codex":0.0024606967,"about_ca_topic_score_gemma":0.0035737474,"teacher_disagreement_score":0.0053445585,"about_ca_system_score_codex":0.0006742037,"about_ca_system_score_gemma":0.0011904915,"threshold_uncertainty_score":0.017879367},"labels":[],"label_agreement":null},{"id":"W4385685797","doi":"10.1007/s11075-023-01635-5","title":"Adaptive discontinuous Galerkin finite element methods for the Allen-Cahn equation on polygonal meshes","year":2023,"lang":"en","type":"article","venue":"Numerical Algorithms","topic":"Advanced Numerical Methods in Computational Mathematics","field":"Engineering","cited_by":14,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"Basic and Applied Basic Research Foundation of Guangdong Province; Natural Science Foundation of Shaanxi Province; National Natural Science Foundation of China; China Postdoctoral Science Foundation; CMG Reservoir Simulation Foundation","keywords":"Polygon mesh; Discretization; Finite element method; Mathematics; Discontinuous Galerkin method; Allen–Cahn equation; Curvature; Galerkin method; Backward Euler method; Mesh generation; Applied mathematics; Algorithm; Mathematical analysis; Geometry","score_opus":0.09488628490794512,"score_gpt":0.38305056011149025,"score_spread":0.28816427520354515,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4385685797","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.014856621,0.00018214292,0.9806984,0.0001468051,0.0000739077,0.00003669914,0.000047918867,0.00008075762,0.0038767452],"genre_scores_gemma":[0.49769965,0.0005943607,0.48780042,0.0001317393,0.00011585564,0.0002359543,0.00019291043,0.00022572579,0.013003365],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996692,0.000108085245,0.0000137019,0.000038144804,0.00014778912,0.000023080152],"domain_scores_gemma":[0.99905115,0.00066045107,0.00005909874,0.000064700966,0.00013357513,0.000031007177],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00048068172,0.00041155415,0.00058444985,0.00049013575,0.0005021103,0.0008340071,0.0014477059,0.0012090409,0.002082382],"category_scores_gemma":[0.0031387184,0.00034272432,0.0004131211,0.0005754278,0.0011544775,0.00090802804,0.0013750186,0.001546136,0.00031965767],"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.00008168028,0.000059881564,0.00072793406,0.00014458009,0.000025069563,0.00012230211,0.00022119837,0.83002263,0.0068550264,0.11315168,0.0018582502,0.046729807],"study_design_scores_gemma":[0.0000055070964,0.000005173685,0.00003672198,0.000004608765,0.0000019525423,0.00001260212,0.000009445305,0.99347854,0.00043681043,0.005061697,0.0009433972,0.00000353808],"about_ca_topic_score_codex":0.00461788,"about_ca_topic_score_gemma":0.004488591,"teacher_disagreement_score":0.00461788,"about_ca_system_score_codex":0.00060021994,"about_ca_system_score_gemma":0.00072973175,"threshold_uncertainty_score":0.009181976},"labels":[],"label_agreement":null},{"id":"W4387530586","doi":"10.1007/s11075-023-01668-w","title":"Max-convolution through numerics and tropical geometry","year":2023,"lang":"en","type":"article","venue":"Numerical Algorithms","topic":"Polynomial and algebraic computation","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":"Western University","funders":"National Science Foundation","keywords":"Differentiable function; Mathematics; Convolution (computer science); Function (biology); Integer (computer science); Convergence (economics); Salient; Theory of computation; Algorithm; Applied mathematics; Mathematical analysis; Geometry; Computer science","score_opus":0.019586466382910547,"score_gpt":0.2573348117555992,"score_spread":0.23774834537268863,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4387530586","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.02014569,0.0012168083,0.91668254,0.0014989617,0.0005322375,0.000033007866,0.0001865625,0.001138247,0.058566004],"genre_scores_gemma":[0.65617,0.0019552072,0.29576418,0.0010737765,0.0012093814,0.00014779037,0.00037471176,0.002078433,0.04122641],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9981609,0.00061017275,0.000114603405,0.0003248916,0.0006098298,0.00017960108],"domain_scores_gemma":[0.99772674,0.0010365142,0.00018604982,0.00057618093,0.00036306752,0.000111410736],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0022643618,0.0010324764,0.0013912149,0.001776887,0.0017190474,0.0037959612,0.0014984065,0.00080917316,0.01408112],"category_scores_gemma":[0.01047946,0.00057085167,0.0010918014,0.0019675442,0.004038488,0.009649871,0.0045928215,0.0034164607,0.002755925],"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.000016770884,0.000006687648,0.00007223742,0.000025230496,0.0000060406514,0.000012580449,0.000045974604,0.002037246,0.00018689578,0.9866909,0.0011685884,0.009730828],"study_design_scores_gemma":[0.00000458938,0.000008229007,0.00005560052,0.000016022712,0.0000066703415,0.000035862467,0.000013766965,0.021502389,0.0007441027,0.9718959,0.005707968,0.000008854846],"about_ca_topic_score_codex":0.0014084982,"about_ca_topic_score_gemma":0.0011267875,"teacher_disagreement_score":0.01408112,"about_ca_system_score_codex":0.0021229803,"about_ca_system_score_gemma":0.0012498177,"threshold_uncertainty_score":0.047106028},"labels":[],"label_agreement":null},{"id":"W4388551341","doi":"10.1007/s11075-023-01698-4","title":"Second-order Rosenbrock-exponential (ROSEXP) methods for partitioned differential equations","year":2023,"lang":"en","type":"article","venue":"Numerical Algorithms","topic":"Numerical methods for differential equations","field":"Mathematics","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Environment and Climate Change Canada","funders":"National Science Foundation","keywords":"Exponential integrator; Mathematics; Integrator; Solver; Ordinary differential equation; Applied mathematics; Nonlinear system; Matrix exponential; Exponential function; Stability (learning theory); Differential equation; Linear system; Convergence (economics); Exponential stability; Numerical stability; Theory of computation; Numerical analysis; Differential algebraic equation; Mathematical optimization; Computer science; Algorithm; Mathematical analysis","score_opus":0.13472116942511272,"score_gpt":0.4522147365095032,"score_spread":0.31749356708439047,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4388551341","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.012503546,0.0001902149,0.9849229,0.00005951079,0.000042059008,0.000040123494,0.000020052823,0.00013201119,0.0020895572],"genre_scores_gemma":[0.2534197,0.00040889042,0.73825985,0.000082227445,0.000030495848,0.00017516644,0.000077918085,0.00015670837,0.007389113],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99977785,0.00007313295,0.0000146229495,0.000024204126,0.0000924906,0.000017705332],"domain_scores_gemma":[0.99949646,0.00021188594,0.000056425026,0.0000725818,0.00013374955,0.000028777038],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008138659,0.00059840153,0.0004744593,0.00039258238,0.00025744984,0.0005685347,0.0010102002,0.0006451827,0.0021760757],"category_scores_gemma":[0.001727013,0.00023276715,0.0005542651,0.00027265924,0.00056012557,0.0009970778,0.0010950821,0.001036732,0.00050137925],"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.000112639704,0.00014268898,0.0010650735,0.00027904526,0.00006229032,0.00024883548,0.00041932584,0.6504208,0.043603554,0.21719374,0.0011558613,0.085296206],"study_design_scores_gemma":[0.000012299517,0.000018828037,0.00004279795,0.000009253102,0.0000032925466,0.00003238499,0.000010038411,0.99170023,0.0022351502,0.0043645063,0.0015666138,0.000004544438],"about_ca_topic_score_codex":0.0013884758,"about_ca_topic_score_gemma":0.0016437819,"teacher_disagreement_score":0.0021760757,"about_ca_system_score_codex":0.00038359337,"about_ca_system_score_gemma":0.00064278475,"threshold_uncertainty_score":0.007279694},"labels":[],"label_agreement":null},{"id":"W4390748235","doi":"10.1007/s11075-023-01730-7","title":"The effect of splitting strategy on qualitative property preservation","year":2024,"lang":"en","type":"article","venue":"Numerical Algorithms","topic":"Mathematical and Theoretical Epidemiology and Ecology Models","field":"Medicine","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Saskatchewan","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Monotonic function; Property (philosophy); Operator splitting; Operator (biology); Qualitative analysis; Theory of computation; Applied mathematics; Mathematical analysis; Qualitative research; Algorithm; Chemistry","score_opus":0.04609510957583055,"score_gpt":0.3835856230001985,"score_spread":0.3374905134243679,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4390748235","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.24172045,0.00075349025,0.7467143,0.0014627269,0.00010781271,0.0000962827,0.000118526805,0.00034092434,0.008685395],"genre_scores_gemma":[0.87646866,0.00031483057,0.12137796,0.00022865366,0.00004769823,0.000079034304,0.00009053744,0.00014471871,0.0012477955],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99732274,0.0016365036,0.00015572201,0.0002964925,0.00040378008,0.00018482539],"domain_scores_gemma":[0.92055976,0.063942626,0.0030956634,0.007862918,0.0031148442,0.0014242515],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0130394455,0.0006833119,0.0010090523,0.0011182852,0.0008533648,0.0021130766,0.0016412148,0.001503996,0.004239819],"category_scores_gemma":[0.07002994,0.000496775,0.0006027604,0.00094531506,0.0038700048,0.005635169,0.0034236216,0.0013804737,0.00034266926],"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.0012701268,0.0003674536,0.010997404,0.00051952765,0.00020317938,0.00026553447,0.0010371857,0.35790178,0.021461964,0.45079646,0.0017601352,0.15341926],"study_design_scores_gemma":[0.000096082535,0.00021579166,0.0009787705,0.00005687069,0.000062895626,0.000108244945,0.00017574984,0.73633504,0.005840628,0.25528106,0.0008318863,0.000016936783],"about_ca_topic_score_codex":0.0011399058,"about_ca_topic_score_gemma":0.00092965196,"teacher_disagreement_score":0.0130394455,"about_ca_system_score_codex":0.0008903446,"about_ca_system_score_gemma":0.0017458426,"threshold_uncertainty_score":0.06895995},"labels":[],"label_agreement":null},{"id":"W4390775843","doi":"10.1007/s11075-023-01738-z","title":"An Hermite–Obreshkov method for 2nd-order linear initial-value problems for ODE","year":2024,"lang":"en","type":"article","venue":"Numerical Algorithms","topic":"Numerical methods for differential equations","field":"Mathematics","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo; Western University","funders":"Natural Sciences and Engineering Research Council of Canada; Ministerio de Ciencia e Innovación","keywords":"Mathematics; Ode; Applied mathematics; Hermite polynomials; Differential equation; Ordinary differential equation; Scalar (mathematics); Theory of computation; Numerical analysis; Initial value problem; Mathematical analysis; Algorithm","score_opus":0.11377890210451447,"score_gpt":0.47447154134948466,"score_spread":0.3606926392449702,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4390775843","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.0072709983,0.00065002,0.9818124,0.0003122181,0.0003697412,0.00008152483,0.00008164573,0.00014478562,0.009276678],"genre_scores_gemma":[0.22183214,0.0015847544,0.71307135,0.00059782836,0.0005047697,0.0006219073,0.00043690988,0.0007616509,0.06058866],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994029,0.00025196173,0.00003288108,0.00005679716,0.00020473367,0.00005085063],"domain_scores_gemma":[0.99918383,0.00034262778,0.00006348956,0.00009392739,0.00023466592,0.0000814839],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016921648,0.00079125894,0.001290139,0.0009972554,0.0008147574,0.0012761841,0.001561811,0.0021934644,0.004383452],"category_scores_gemma":[0.003062124,0.0005505686,0.0012407103,0.00080053316,0.0016550599,0.0014246982,0.002548093,0.0031165653,0.0014762516],"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.00021579598,0.00035065785,0.0008750363,0.00065745245,0.00013110314,0.00027792488,0.00040692656,0.35289332,0.023237417,0.513052,0.006683827,0.1012185],"study_design_scores_gemma":[0.000016608657,0.000034729397,0.00012223219,0.0000329407,0.0000107070355,0.00004923297,0.000017125189,0.9590696,0.0016759279,0.03105781,0.007883641,0.000029397566],"about_ca_topic_score_codex":0.0033799647,"about_ca_topic_score_gemma":0.005199081,"teacher_disagreement_score":0.004383452,"about_ca_system_score_codex":0.0010651682,"about_ca_system_score_gemma":0.002121711,"threshold_uncertainty_score":0.014664054},"labels":[],"label_agreement":null},{"id":"W4391910002","doi":"10.1007/s11075-023-01731-6","title":"Nullspaces yield new explicit Runge–Kutta pairs","year":2024,"lang":"en","type":"article","venue":"Numerical Algorithms","topic":"Numerical methods for differential equations","field":"Mathematics","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":"Butcher; Mathematics; Runge–Kutta methods; Applied mathematics; Parametric statistics; Pure mathematics; Isomorphism (crystallography); Algebra over a field; Mathematical analysis; Differential equation; Statistics; Law","score_opus":0.126163194480039,"score_gpt":0.3811040634701919,"score_spread":0.2549408689901529,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4391910002","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.043072283,0.00021876016,0.9256726,0.00026291606,0.000508069,0.00007868361,0.00009401385,0.0007048813,0.029387793],"genre_scores_gemma":[0.55082583,0.00056538056,0.39623418,0.00048229683,0.00030439466,0.00031240258,0.00043047464,0.0029211703,0.047923826],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990846,0.00028117397,0.00007833069,0.00015443619,0.0003005117,0.00010094028],"domain_scores_gemma":[0.9983096,0.00056337204,0.00015280537,0.00037957178,0.00036233125,0.00023226513],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012256778,0.0015259121,0.00087858055,0.0019498921,0.0014716723,0.0033186737,0.0013134204,0.0019109389,0.013348202],"category_scores_gemma":[0.0060824556,0.0008539806,0.0009722076,0.0008149232,0.0023395037,0.0050450405,0.0037071118,0.0029597287,0.0040280735],"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.000092830654,0.00009874708,0.0003454153,0.000080845966,0.000018848492,0.00015026389,0.0002702842,0.007767325,0.005254866,0.9506609,0.0022104527,0.033049308],"study_design_scores_gemma":[0.00003166709,0.00008575928,0.00023213951,0.000043534317,0.000019599769,0.00024917646,0.000096530326,0.10628192,0.006367339,0.87637013,0.010167995,0.0000541406],"about_ca_topic_score_codex":0.00012399092,"about_ca_topic_score_gemma":0.0002777276,"teacher_disagreement_score":0.013348202,"about_ca_system_score_codex":0.00049804617,"about_ca_system_score_gemma":0.00060391973,"threshold_uncertainty_score":0.04465413},"labels":[],"label_agreement":null},{"id":"W4392239459","doi":"10.1007/s11075-024-01784-1","title":"Differential equation software for the computation of error-controlled continuous approximate solutions","year":2024,"lang":"en","type":"article","venue":"Numerical Algorithms","topic":"Numerical methods for differential equations","field":"Mathematics","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":"Saint Mary's University","funders":"","keywords":"Solver; Computer science; Ode; Computation; Software; Collocation (remote sensing); Focus (optics); Ordinary differential equation; Mathematical optimization; Applied mathematics; Mathematics; Algorithm; Differential equation; Mathematical analysis","score_opus":0.12887983061742095,"score_gpt":0.38104091991114153,"score_spread":0.2521610892937206,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4392239459","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.0011563163,0.00007162302,0.9888004,0.000055857996,0.00006388583,0.00005145698,0.00022323114,0.007146445,0.0024307685],"genre_scores_gemma":[0.0668875,0.00032496458,0.91759324,0.00020905751,0.00007994189,0.0010205902,0.0011379548,0.005244608,0.0075022047],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99887604,0.00017913188,0.00013008615,0.000111625166,0.00062344095,0.00007969666],"domain_scores_gemma":[0.99659556,0.0017028815,0.00020586542,0.0004822128,0.00087022834,0.00014317918],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018666853,0.00089520146,0.0014518906,0.0010122919,0.0007412759,0.0015956478,0.0029866616,0.001741724,0.020911114],"category_scores_gemma":[0.008314984,0.0007604923,0.0011144174,0.0012074341,0.0009510462,0.001258405,0.00202408,0.0031022101,0.005484328],"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.00043102104,0.0003408587,0.0016359136,0.0011508372,0.0002767462,0.00033376995,0.00064908987,0.2822194,0.023780575,0.29640806,0.050457947,0.34231576],"study_design_scores_gemma":[0.00014960386,0.000032880977,0.00020331964,0.00007149814,0.00003070013,0.00009780059,0.00002359934,0.92465156,0.0092805885,0.029109305,0.03632192,0.00002718934],"about_ca_topic_score_codex":0.0024132137,"about_ca_topic_score_gemma":0.0025588304,"teacher_disagreement_score":0.020911114,"about_ca_system_score_codex":0.00096885796,"about_ca_system_score_gemma":0.0022149242,"threshold_uncertainty_score":0.06995469},"labels":[],"label_agreement":null},{"id":"W4393276830","doi":"10.1007/s11075-024-01808-w","title":"Fast and stable rational approximation of generalized hypergeometric functions","year":2024,"lang":"en","type":"article","venue":"Numerical Algorithms","topic":"Numerical methods for differential equations","field":"Mathematics","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Manitoba","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Theory of computation; Generalized hypergeometric function; Hypergeometric function; Barnes integral; Basic hypergeometric series; Rational function; Hypergeometric function of a matrix argument; Numerical analysis; Applied mathematics; Pure mathematics; Algebra over a field; Mathematical analysis; Algorithm","score_opus":0.06232660415006911,"score_gpt":0.33940594726468093,"score_spread":0.2770793431146118,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4393276830","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.03708195,0.0004132823,0.95349795,0.0003119138,0.00024208684,0.000043095304,0.000051746283,0.0002984693,0.008059575],"genre_scores_gemma":[0.6843348,0.0010269049,0.29540762,0.00024545725,0.0002730122,0.00020032394,0.00022069074,0.00061532087,0.017675791],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991315,0.00040720782,0.000027374814,0.00006667046,0.00027574116,0.00009156869],"domain_scores_gemma":[0.9976156,0.001217538,0.00018224125,0.00036747204,0.00044654857,0.00017072957],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00236794,0.0012377718,0.0012656292,0.0018108798,0.00073656853,0.00249131,0.0014933591,0.0014037438,0.0039321207],"category_scores_gemma":[0.01066879,0.00055526133,0.0008535149,0.0015064296,0.0025279184,0.0026529839,0.0025362305,0.0024406768,0.0012576843],"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.00016666431,0.000048664708,0.00065525476,0.0001233233,0.000052683765,0.00013452015,0.00025340426,0.20093405,0.004099424,0.75442857,0.0021353518,0.03696811],"study_design_scores_gemma":[0.000019832429,0.000011196841,0.00007604736,0.000015410113,0.0000064191627,0.000026143825,0.000028335531,0.8454026,0.00075888424,0.15262955,0.001011466,0.000014144999],"about_ca_topic_score_codex":0.003177512,"about_ca_topic_score_gemma":0.0031964062,"teacher_disagreement_score":0.0039321207,"about_ca_system_score_codex":0.0013683346,"about_ca_system_score_gemma":0.001375342,"threshold_uncertainty_score":0.013154268},"labels":[],"label_agreement":null},{"id":"W4399442338","doi":"10.1007/s11075-024-01854-4","title":"On solving 2D weakly singular Volterra integral equations of the second kind","year":2024,"lang":"en","type":"article","venue":"Numerical Algorithms","topic":"Fractional Differential Equations Solutions","field":"Mathematics","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Volterra integral equation; Theory of computation; Integral equation; Volterra equations; Singular integral; Mathematical analysis; Singular solution; Numerical analysis; Applied mathematics; Nonlinear system; Physics; Algorithm","score_opus":0.048315271974520416,"score_gpt":0.3224646853747276,"score_spread":0.2741494134002072,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4399442338","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.07213134,0.0013001334,0.90866804,0.00075476867,0.0003681871,0.00008055081,0.000047671554,0.00015453629,0.016494699],"genre_scores_gemma":[0.59212404,0.0017789529,0.3878918,0.0005221779,0.00030147514,0.00035517814,0.00015940015,0.00020982968,0.016657125],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9997173,0.00012858197,0.000015251826,0.000027378901,0.00007873555,0.00003272425],"domain_scores_gemma":[0.9989987,0.00072716473,0.000058991238,0.000048783273,0.00011635884,0.000050012055],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012721573,0.00085325626,0.0011529004,0.00082633283,0.0006223355,0.0011789287,0.00080763054,0.0014484567,0.0021691641],"category_scores_gemma":[0.0042095534,0.00029441487,0.0005910548,0.0008530449,0.0016768171,0.0013238305,0.0019458603,0.0012973895,0.00033410083],"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.00017075457,0.000119964876,0.0011243898,0.0003239327,0.00008484422,0.00018997744,0.0004047269,0.6853122,0.0053602904,0.23625807,0.0016382602,0.06901259],"study_design_scores_gemma":[0.000013188638,0.000018028932,0.00007478318,0.000015760772,0.0000048087168,0.00001472158,0.000024002393,0.9737051,0.0003340846,0.024986507,0.0008027674,0.0000063279117],"about_ca_topic_score_codex":0.003490909,"about_ca_topic_score_gemma":0.0024085338,"teacher_disagreement_score":0.003490909,"about_ca_system_score_codex":0.00065409445,"about_ca_system_score_gemma":0.0008374837,"threshold_uncertainty_score":0.0072565675},"labels":[],"label_agreement":null},{"id":"W4402093168","doi":"10.1007/s11075-024-01919-4","title":"VEMcomp: a Virtual Elements MATLAB package for bulk-surface PDEs in 2D and 3D","year":2024,"lang":"en","type":"article","venue":"Numerical Algorithms","topic":"Advanced Numerical Methods in Computational Mathematics","field":"Engineering","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"Gruppo Nazionale per il Calcolo Scientifico; Regione Puglia; Canada Research Chairs; Engineering and Physical Sciences Research Council; Ministero dell’Istruzione, dell’Università e della Ricerca; British Columbia Knowledge Development Fund; Natural Sciences and Engineering Research Council of Canada; European Commission; UK Research and Innovation; Ministero dell'Università e della Ricerca; Istituto Nazionale di Alta Matematica \"Francesco Severi\"","keywords":"Polygon mesh; Solver; Finite element method; MATLAB; Partial differential equation; Algorithm; Computer science; Surface (topology); Mesh generation; Geometry; Computational science; Mathematics; Mathematical analysis; Physics; Mathematical optimization; Thermodynamics","score_opus":0.022566160245281602,"score_gpt":0.31479458934172877,"score_spread":0.2922284290964472,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4402093168","genre_codex":"methods","genre_gemma":"software","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"software","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0013597147,0.00026782643,0.9511102,0.00018487612,0.00014285561,0.00008369393,0.00229324,0.035516582,0.0090410905],"genre_scores_gemma":[0.046625823,0.0011554317,0.881494,0.00054736383,0.0001354639,0.0015824893,0.009695379,0.034710687,0.024053387],"study_design_codex":"not_applicable","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99919635,0.00013392711,0.00008293302,0.000082683946,0.00042451115,0.0000796599],"domain_scores_gemma":[0.9982634,0.0008846222,0.000113574206,0.00017334786,0.000469999,0.00009515507],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010640139,0.0013416148,0.0011770973,0.0009735076,0.00061298476,0.0015425421,0.0032906185,0.0014558467,0.075278774],"category_scores_gemma":[0.0038896755,0.00097579055,0.001532277,0.00087343086,0.0007587615,0.0017491817,0.00240262,0.0021766205,0.023666648],"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.0002474991,0.00019375066,0.0015660828,0.0018718593,0.00023990034,0.00093264814,0.00060315576,0.279882,0.018150566,0.107359685,0.29939017,0.2895627],"study_design_scores_gemma":[0.00014484036,0.00006224958,0.0003649804,0.0002234462,0.000034820747,0.00040840489,0.00006933715,0.64381796,0.017535063,0.030348578,0.30689317,0.00009719756],"about_ca_topic_score_codex":0.0028284194,"about_ca_topic_score_gemma":0.003536518,"teacher_disagreement_score":0.075278774,"about_ca_system_score_codex":0.00046047746,"about_ca_system_score_gemma":0.0013876859,"threshold_uncertainty_score":0.2518326},"labels":[],"label_agreement":null},{"id":"W4404769895","doi":"10.1007/s11075-024-01986-7","title":"Explicit-implicit methods for stochastic susceptible-infected-recovered model","year":2024,"lang":"en","type":"article","venue":"Numerical Algorithms","topic":"Probabilistic and Robust Engineering Design","field":"Decision Sciences","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 Alberta","funders":"Fundamental Research Funds for the Central Universities; China Scholarship Council; National Natural Science Foundation of China","keywords":"Theory of computation; Mathematics; Applied mathematics; Calculus (dental); Mathematical economics; Algorithm; Medicine","score_opus":0.11949634076554967,"score_gpt":0.43646319936855477,"score_spread":0.3169668586030051,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4404769895","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.009208672,0.0005228443,0.9870046,0.00041104128,0.00007868372,0.000030691164,0.00007528753,0.00008994536,0.0025782883],"genre_scores_gemma":[0.66574067,0.0012229765,0.30718845,0.00044989094,0.00027105527,0.00045347546,0.00041195113,0.00034413606,0.0239175],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99939644,0.00027640437,0.0000292665,0.00007878028,0.00014778982,0.00007137174],"domain_scores_gemma":[0.99626476,0.0024885389,0.000389796,0.00020332869,0.00047827585,0.0001753321],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0023661577,0.0010026275,0.0017993066,0.0009517043,0.000661787,0.0013547281,0.0029822292,0.0029417034,0.0031888115],"category_scores_gemma":[0.008304308,0.00091422204,0.0010800239,0.0008505507,0.0022682801,0.0021223095,0.0030460127,0.0024433264,0.00037396813],"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.000027332308,0.000024830735,0.00028129868,0.0000717173,0.00002336804,0.000048420123,0.000046890753,0.9340206,0.00035472942,0.06044176,0.00040412278,0.004255026],"study_design_scores_gemma":[0.0000034487766,0.0000019724887,0.0000132007945,0.000003887913,0.0000018008029,0.0000044251165,0.0000027260533,0.99302626,0.000040657746,0.0067409794,0.00015798205,0.000002651362],"about_ca_topic_score_codex":0.010862042,"about_ca_topic_score_gemma":0.00857111,"teacher_disagreement_score":0.010862042,"about_ca_system_score_codex":0.001483873,"about_ca_system_score_gemma":0.002671058,"threshold_uncertainty_score":0.021597683},"labels":[],"label_agreement":null},{"id":"W4405648285","doi":"10.1007/s11075-024-01995-6","title":"Optimized Schwarz domain decomposition algorithms for the closest point method on closed manifolds","year":2024,"lang":"en","type":"article","venue":"Numerical Algorithms","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":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Memorial University of Newfoundland; Simon Fraser University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Additive Schwarz method; Schwarz alternating method; Mathematics; Domain decomposition methods; Embedding; Algorithm; Numerical analysis; Helmholtz equation; Surface (topology); Partial differential equation; Helmholtz free energy; Mathematical analysis; Finite element method; Applied mathematics; Geometry; Boundary value problem; Computer science","score_opus":0.03216924468785796,"score_gpt":0.3656332353149778,"score_spread":0.33346399062711984,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4405648285","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.004506871,0.00013735887,0.9929283,0.000095462194,0.00004546615,0.000021320411,0.000038205402,0.000095032185,0.0021319834],"genre_scores_gemma":[0.12606016,0.00040238205,0.865773,0.000117837546,0.00008715751,0.00022289755,0.00026667476,0.00044803208,0.006621849],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991561,0.0004110443,0.000036849622,0.000059802118,0.0002923864,0.000043825574],"domain_scores_gemma":[0.9980357,0.0010395326,0.00009937786,0.00022690468,0.0004937829,0.00010474265],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015104228,0.0009016297,0.0010308468,0.0009608229,0.0004372077,0.0012584865,0.001457179,0.0013294942,0.005643262],"category_scores_gemma":[0.0060741846,0.0004957436,0.0007719995,0.00080735085,0.00093581906,0.0016215028,0.0024399685,0.002174609,0.0016955289],"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.00030857563,0.00010598593,0.0005637646,0.00028274744,0.00007822413,0.000102005404,0.00020754313,0.43828914,0.0065321946,0.39221123,0.0075788046,0.1537398],"study_design_scores_gemma":[0.000016123444,0.000023515471,0.000059902777,0.000015289295,0.000004664804,0.000021916447,0.000019688821,0.94558567,0.0009137473,0.051194225,0.002135757,0.000009529631],"about_ca_topic_score_codex":0.001282005,"about_ca_topic_score_gemma":0.0016252317,"teacher_disagreement_score":0.005643262,"about_ca_system_score_codex":0.0006438792,"about_ca_system_score_gemma":0.0010935559,"threshold_uncertainty_score":0.01887852},"labels":[],"label_agreement":null},{"id":"W4408366230","doi":"10.1007/s11075-025-02041-9","title":"Cut-edge centralities in an undirected graph","year":2025,"lang":"en","type":"article","venue":"Numerical Algorithms","topic":"Graph theory and applications","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Manitoba","funders":"Natural Sciences and Engineering Research Council of Canada; Gruppo Nazionale per il Calcolo Scientifico; NextGenerationEU; Ministero dell'Università e della Ricerca","keywords":"Mathematics; Theory of computation; Undirected graph; Graph; Combinatorics; Enhanced Data Rates for GSM Evolution; Discrete mathematics; Computer science; Algorithm; Artificial intelligence","score_opus":0.0385007283488646,"score_gpt":0.3413768819822541,"score_spread":0.3028761536333895,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4408366230","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.17843153,0.0008245319,0.8072066,0.0008078957,0.000114391965,0.00008415781,0.00035075823,0.0004474006,0.01173275],"genre_scores_gemma":[0.74720335,0.0006444502,0.24341728,0.0003231403,0.00023698626,0.0002452152,0.00048729763,0.0003832847,0.007058864],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9983271,0.00069073687,0.000059605885,0.0004570022,0.00032934154,0.00013623289],"domain_scores_gemma":[0.96477824,0.02671147,0.0024328337,0.002281888,0.0024133304,0.0013821962],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003702372,0.0007898919,0.0013517109,0.0038692956,0.0014662336,0.0037418848,0.0028741786,0.00175302,0.0052548023],"category_scores_gemma":[0.030174835,0.0011527878,0.0007227345,0.0031396644,0.003438284,0.0059959996,0.0028588942,0.0030156476,0.000664782],"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.00032880824,0.00014628048,0.0027642907,0.00026866203,0.00007635873,0.00013730933,0.00044110155,0.06666949,0.0032380458,0.89674824,0.0031285887,0.026053008],"study_design_scores_gemma":[0.000037083217,0.000026423693,0.0005174438,0.000053363023,0.000030449299,0.00010975905,0.00009284266,0.20479983,0.001209292,0.7919353,0.00117068,0.000017422557],"about_ca_topic_score_codex":0.0011598173,"about_ca_topic_score_gemma":0.0018391178,"teacher_disagreement_score":0.0052548023,"about_ca_system_score_codex":0.0013844122,"about_ca_system_score_gemma":0.0011692523,"threshold_uncertainty_score":0.019580245},"labels":[],"label_agreement":null},{"id":"W4410747868","doi":"10.1007/s11075-025-02109-6","title":"Algebras behind the bispectrality of the Wilson rational functions and their $$ _4\\phi _3$$ limits","year":2025,"lang":"en","type":"article","venue":"Numerical Algorithms","topic":"Mathematical functions and polynomials","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":"Montreal Clinical Research Institute; Université de Montréal","funders":"","keywords":"Mathematics; Theory of computation; Rational function; Algebra over a field; Calculus (dental); Pure mathematics; Mathematical economics; Algorithm","score_opus":0.03497610199176973,"score_gpt":0.2978974493507911,"score_spread":0.2629213473590214,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4410747868","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.32517186,0.0021859808,0.34217623,0.0045792204,0.00078872195,0.000091768314,0.00027292827,0.0005680188,0.3241654],"genre_scores_gemma":[0.92609036,0.0011846902,0.047368042,0.00084136677,0.0007824844,0.00017394041,0.00015213108,0.00036852484,0.023038385],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985984,0.00043983577,0.00007431958,0.0001632783,0.0005016479,0.00022253631],"domain_scores_gemma":[0.9980932,0.0007168982,0.00021779387,0.0002634105,0.00038057787,0.0003281603],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0025352717,0.0010731524,0.0008327604,0.0037956634,0.002973835,0.004930493,0.0018910671,0.0015799393,0.0082191955],"category_scores_gemma":[0.008545405,0.0006380834,0.000877047,0.0016158936,0.007004366,0.009401933,0.0034989752,0.0044495477,0.0014497704],"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.0000038245716,0.000003809236,0.000020043355,0.000004599099,8.768122e-7,0.000007086189,0.000030396115,0.00015591654,0.00008471426,0.9988733,0.00013504793,0.00068029587],"study_design_scores_gemma":[0.0000029006394,0.0000021363799,0.0000311091,0.000005115299,9.120524e-7,0.000019241928,0.000014895906,0.0021998668,0.00011928954,0.99719125,0.00040808343,0.0000051967154],"about_ca_topic_score_codex":0.0017257837,"about_ca_topic_score_gemma":0.0012523303,"teacher_disagreement_score":0.0082191955,"about_ca_system_score_codex":0.0018471191,"about_ca_system_score_gemma":0.0012397275,"threshold_uncertainty_score":0.02749592},"labels":[],"label_agreement":null},{"id":"W4411857587","doi":"10.1007/s11075-025-02144-3","title":"The CMV bispectrality of the Jacobi polynomials on the unit circle","year":2025,"lang":"en","type":"article","venue":"Numerical Algorithms","topic":"Mathematical functions and polynomials","field":"Mathematics","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é de Montréal; Université du Québec à Montréal","funders":"","keywords":"Mathematics; Theory of computation; Jacobi polynomials; Unit circle; Jacobi operator; Gegenbauer polynomials; Unit (ring theory); Orthogonal polynomials; Classical orthogonal polynomials; Mathematical analysis; Mathematics education; Algorithm","score_opus":0.04905095008506859,"score_gpt":0.330756912285491,"score_spread":0.2817059622004224,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4411857587","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.22526142,0.001103326,0.5975519,0.001692224,0.0007965785,0.00006016431,0.0001958938,0.00038680367,0.17295182],"genre_scores_gemma":[0.92077357,0.0007688784,0.05750607,0.0003111053,0.0004016288,0.0000498222,0.00011149628,0.0003213614,0.01975606],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990854,0.00027741492,0.000028609971,0.00013562842,0.00035599997,0.0001169518],"domain_scores_gemma":[0.9983493,0.00059906836,0.00015350597,0.0002537215,0.00044696627,0.00019739357],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001109204,0.0006065192,0.00038761226,0.0015412471,0.0010054345,0.0025635494,0.0009025989,0.00064647343,0.0074058454],"category_scores_gemma":[0.008592088,0.00028569248,0.00036685527,0.0009566834,0.0026979616,0.0027398588,0.0017655258,0.0022020263,0.0011693983],"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.000024822548,0.000008140145,0.00010397299,0.000017230237,0.0000019930578,0.00001225748,0.00006532166,0.0024038912,0.00071855716,0.98652446,0.00068655005,0.009432901],"study_design_scores_gemma":[0.000008336528,0.000017555532,0.00017987496,0.000021210453,0.0000030563433,0.00006283808,0.000052301937,0.054229327,0.0016425948,0.9399459,0.0038206866,0.000016262386],"about_ca_topic_score_codex":0.0012116872,"about_ca_topic_score_gemma":0.00062874175,"teacher_disagreement_score":0.0074058454,"about_ca_system_score_codex":0.00091693026,"about_ca_system_score_gemma":0.00092260854,"threshold_uncertainty_score":0.024775028},"labels":[],"label_agreement":null},{"id":"W87731125","doi":"10.1023/a:1016658419067","title":"Birkhoff interpolation on some perturbed roots of unity: Revisited","year":2000,"lang":"en","type":"article","venue":"Numerical Algorithms","topic":"Differential Equations and Numerical Methods","field":"Mathematics","cited_by":11,"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 Alberta","funders":"","keywords":"Mathematics; Lacunary function; Interpolation (computer graphics); Complex plane; Theory of computation; Range (aeronautics); Birkhoff interpolation; Mathematical analysis; Root of unity; Plane (geometry); Pure mathematics; Trilinear interpolation; Applied mathematics; Linear interpolation; Geometry; Algorithm","score_opus":0.05674016216338719,"score_gpt":0.3545631090474876,"score_spread":0.29782294688410044,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W87731125","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.088032335,0.0045265206,0.8393459,0.004379358,0.001132381,0.000058385427,0.000080965874,0.00040691375,0.062037222],"genre_scores_gemma":[0.7779837,0.0033414098,0.18627316,0.0008047588,0.00065667,0.00007263038,0.00009570767,0.00047319423,0.030298766],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987562,0.0006083945,0.000046954356,0.00014813003,0.00031338495,0.0001269964],"domain_scores_gemma":[0.9965803,0.0017689021,0.0003315322,0.0005441005,0.00051896955,0.00025620143],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003649737,0.0009453528,0.0013192369,0.002217266,0.0015586006,0.0021703835,0.0021342004,0.0019913826,0.0039628614],"category_scores_gemma":[0.016557036,0.0004968515,0.00072153046,0.0023127252,0.0041358313,0.0046368563,0.0029416867,0.004066061,0.0008141649],"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.000058581623,0.000016640934,0.00017454734,0.000057156238,0.000008900474,0.00006018358,0.000178324,0.01092479,0.0009485522,0.97494024,0.0010529453,0.0115792025],"study_design_scores_gemma":[0.000017681941,0.000027751645,0.00020515197,0.00004042869,0.000008677792,0.00011136434,0.00009292592,0.1979987,0.0011956603,0.7951948,0.0050781383,0.000028641261],"about_ca_topic_score_codex":0.003108998,"about_ca_topic_score_gemma":0.002117763,"teacher_disagreement_score":0.0039628614,"about_ca_system_score_codex":0.0017450026,"about_ca_system_score_gemma":0.0010644809,"threshold_uncertainty_score":0.019301891},"labels":[],"label_agreement":null}]}