{"meta":{"page":1,"per_page":50,"max_per_page":100,"total":74,"total_is_capped":false,"direct_labels_cover":0,"predictions_cover":74,"direct_label_status":"direct model label, unvalidated","prediction_status":"machine_predicted_unvalidated (Codex and Gemma teacher distillation)","score_status":"score_only:v0-immature-baseline (scores rank; they never assert a category)","snapshot":{"source":"OpenAlex, pinned release, all 482 partitions","release":"2026-06-24","frame_built":"2026-07-12"},"query_hash":"be689f0a511f","filters":{"venue":"Numerical Algorithms"}},"results":[{"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.02880830279725132,"gpt":0.2799854235218669,"spread":0.2511771207246156,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003174885,0.0001634927,0.000227625,0.0001047564,0.0001820017,0.0001531002,0.0004521826,0.00008541828,0.0001668783],"category_scores_gemma":[0.00005595167,0.0001457366,0.0001742179,0.0006975335,0.00002567539,0.0006677893,0.00007327901,0.0001003033,0.00009771653],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001072429,"about_ca_system_score_gemma":0.00006990253,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002274414,"about_ca_topic_score_gemma":0.000002451447,"domain_scores_codex":[0.9984192,0.00005354091,0.0003725928,0.0005173286,0.0003478461,0.0002894968],"domain_scores_gemma":[0.998977,0.0001264803,0.0001265766,0.0003504736,0.0002683872,0.0001510919],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000003069532,0.0003055662,0.0001904032,0.000006026361,0.00003743724,3.833292e-7,0.0001719442,0.01291383,0.00005466429,0.01190152,0.0007607951,0.9736543],"study_design_scores_gemma":[0.000506713,0.00006394319,0.001241112,0.000002726933,0.00001341652,0.0000036285,0.000004024951,0.9727883,0.0001407767,0.002937808,0.02210284,0.0001946999],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0000324987,0.00006159984,0.9932193,0.005350889,0.0001717449,0.0003540905,0.0000159245,0.0002311142,0.0005628567],"genre_scores_gemma":[0.02495264,0.00000930301,0.9725329,0.0007924158,0.0004192393,0.00008165993,0.00005362986,0.00001226383,0.001145974],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.9734597,"threshold_uncertainty_score":0.5942968,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.03378618326497619,"gpt":0.3240845600247492,"spread":0.290298376759773,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.001591251,0.0008856406,0.001314886,0.0003476751,0.0004389695,0.002886455,0.002719598,0.000333119,0.0002483673],"category_scores_gemma":[0.0005983592,0.0007454238,0.0005861482,0.002452269,0.0004517789,0.006748209,0.001328647,0.001041623,0.0004173773],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002855523,"about_ca_system_score_gemma":0.0001696832,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0002765161,"about_ca_topic_score_gemma":0.000003898901,"domain_scores_codex":[0.9935613,0.0008272519,0.001162349,0.001789515,0.001103541,0.001556022],"domain_scores_gemma":[0.9961096,0.0006438214,0.0003542558,0.001618667,0.0003528451,0.000920783],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"not_applicable","study_design_scores_codex":[0.00002506557,0.0005122194,0.000005191785,0.00002597561,0.00009315046,0.0001806896,0.0004295864,0.0001814072,0.001461337,0.02014596,0.0001605764,0.9767789],"study_design_scores_gemma":[0.004784868,0.004047797,0.0006438384,0.0004052688,0.0001913437,0.001776326,0.001672683,0.1905018,0.05846026,0.3161727,0.4169583,0.004384826],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0001087936,0.002323733,0.9734024,0.01836645,0.003774373,0.0004783675,0.000007801528,0.0009139298,0.0006241343],"genre_scores_gemma":[0.001357801,0.0005902064,0.992246,0.004336316,0.0008685809,0.0001488556,0.00001106232,0.00009322807,0.0003479776],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.972394,"threshold_uncertainty_score":0.9994997,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.06371311389702866,"gpt":0.3967710520424536,"spread":0.3330579381454249,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001510538,0.0001809056,0.0004370513,0.0001062346,0.0001063332,0.00003673758,0.0005053462,0.00006428166,0.000008502606],"category_scores_gemma":[0.0004363601,0.0001515146,0.0001106284,0.0005170224,0.0001581071,0.0003368112,0.0002299334,0.0001324223,0.0000017581],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001824236,"about_ca_system_score_gemma":0.0001034732,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0002149944,"about_ca_topic_score_gemma":8.366147e-7,"domain_scores_codex":[0.998296,0.0003253252,0.0004843351,0.0003902812,0.000225052,0.0002790622],"domain_scores_gemma":[0.9982491,0.0005998893,0.0003234124,0.000319241,0.0003406905,0.000167718],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0006107062,0.001186031,0.00348259,0.0005020819,0.0005840659,0.00002042093,0.01150967,0.02310183,0.0267431,0.1661245,0.0007007035,0.7654343],"study_design_scores_gemma":[0.001174366,0.0004011901,0.00004316799,0.00001917378,0.00002130071,0.00002350675,0.0001442019,0.9285871,0.06384926,0.003975532,0.001575019,0.0001861948],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.02923611,0.0005197507,0.9688386,0.0001969955,0.0007040637,0.00032603,0.00001361301,0.0000699167,0.00009498001],"genre_scores_gemma":[0.03171853,0.00003452592,0.9677699,0.00003082029,0.0001763188,0.00005347558,0.000004097637,0.00001383803,0.0001985081],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.9054853,"threshold_uncertainty_score":0.6178586,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.02034384223175341,"gpt":0.302818244369146,"spread":0.2824744021373926,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001834831,0.0002514718,0.0006748012,0.0001709466,0.0001034131,0.00005208208,0.0001289733,0.0001299553,0.00030915],"category_scores_gemma":[0.0003735494,0.0002018684,0.0002116612,0.001116595,0.0001758967,0.000255247,0.00003477766,0.0001976747,0.00001382809],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004157542,"about_ca_system_score_gemma":0.00001848741,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00008973489,"about_ca_topic_score_gemma":0.000002336356,"domain_scores_codex":[0.9980304,0.00009987703,0.0005852531,0.0004325307,0.0005101471,0.0003418069],"domain_scores_gemma":[0.9986286,0.0005255921,0.0002183192,0.0002314427,0.0001589235,0.0002371107],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0003596504,0.003859947,0.007531547,0.0004077451,0.001729273,0.00006286889,0.002268201,0.0003420742,0.00381856,0.1644911,0.00155639,0.8135726],"study_design_scores_gemma":[0.002469459,0.002267896,0.1714163,0.0001110805,0.002065779,0.00008969782,0.0003746986,0.2268745,0.002393939,0.5902814,0.0004110197,0.00124424],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1025289,0.0001383515,0.8937902,0.0009365731,0.0001042937,0.0003933852,0.0001278086,0.0001710911,0.001809353],"genre_scores_gemma":[0.8978479,0.00002184217,0.1011966,0.0001247513,0.0001089059,0.00001982583,0.00006770794,0.00001752941,0.0005949202],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.8123284,"threshold_uncertainty_score":0.8231953,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.01631380251456081,"gpt":0.323244523130922,"spread":0.3069307206163612,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004660001,0.0002940047,0.0005281589,0.00007061674,0.000108526,0.00004646522,0.0002340494,0.000084128,0.00001961132],"category_scores_gemma":[0.0003700729,0.0002185159,0.0001091722,0.0003812955,0.00008244325,0.00008616277,0.00005734084,0.0002169276,0.00001335098],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00007442214,"about_ca_system_score_gemma":0.00001338788,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000001539436,"about_ca_topic_score_gemma":4.232809e-8,"domain_scores_codex":[0.9984378,0.0001366551,0.0004001307,0.0003485857,0.000249126,0.0004276981],"domain_scores_gemma":[0.9974424,0.001902845,0.00008896893,0.0002709781,0.0001141429,0.0001806957],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00003985656,0.0001046795,0.000002723037,0.00009408674,0.00003691274,8.481517e-7,0.00009205747,0.4073087,0.0004105206,0.002215413,0.00006177605,0.5896325],"study_design_scores_gemma":[0.0009810077,0.0002981828,0.0000195389,0.00004987749,0.00003413465,0.00001567506,0.00002419889,0.9635486,0.0009267357,0.02129845,0.01246176,0.0003418487],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.000180068,0.00009006477,0.9971387,0.0001363398,0.0002699932,0.0006611607,0.000008537148,0.0005894465,0.0009256295],"genre_scores_gemma":[0.003398521,0.000005946372,0.9958295,0.00008944447,0.0001539051,0.0003246023,0.00001252161,0.0001007882,0.00008479726],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.5892906,"threshold_uncertainty_score":0.891082,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.03218140093965833,"gpt":0.2978391016094539,"spread":0.2656577006697955,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0003935295,0.0005659775,0.0009318917,0.0001201124,0.0002922508,0.0001362346,0.0005361969,0.0002084427,0.000198045],"category_scores_gemma":[0.0009505315,0.0004026347,0.0002469378,0.0004492475,0.0002579217,0.000263933,0.0001312249,0.0003826138,0.0001368161],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00007870756,"about_ca_system_score_gemma":0.00006317221,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00007744441,"about_ca_topic_score_gemma":0.000003460913,"domain_scores_codex":[0.9965716,0.0001323568,0.0006757136,0.0008837968,0.0007642303,0.0009723091],"domain_scores_gemma":[0.9955368,0.002851774,0.0002756626,0.000526177,0.0002647181,0.0005448917],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.001207987,0.003236876,0.0002841465,0.0008826074,0.0005262094,0.0001235675,0.001120574,0.0001885454,0.0004872131,0.03760325,0.016292,0.938047],"study_design_scores_gemma":[0.008744218,0.005466578,0.002638239,0.0002409696,0.000649346,0.0002314939,0.0006016436,0.8509669,0.001808983,0.07001276,0.05577261,0.002866253],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.008103993,0.00007482664,0.987776,0.0006168676,0.0003319656,0.0008137561,0.0002360086,0.0003811687,0.001665368],"genre_scores_gemma":[0.09806176,0.000008588287,0.8962288,0.000523946,0.001039133,0.0004121188,0.00003576361,0.000156662,0.003533234],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.9351808,"threshold_uncertainty_score":0.9998425,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.05887183484248058,"gpt":0.3193487290901874,"spread":0.2604768942477068,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001997838,0.0001640293,0.0004385499,0.00009894131,0.0001696437,0.000009978112,0.0001835915,0.000115969,0.0008811431],"category_scores_gemma":[0.0004874268,0.0001357803,0.0001608586,0.0006055057,0.0001095505,0.00007710759,0.00005702801,0.0001775474,0.0005703935],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004054279,"about_ca_system_score_gemma":0.00007337164,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00007715867,"about_ca_topic_score_gemma":0.000001642945,"domain_scores_codex":[0.9985051,0.00006103674,0.0005931207,0.0002541376,0.0003054186,0.0002812042],"domain_scores_gemma":[0.9986176,0.0005629424,0.00012519,0.0003764286,0.0001155216,0.000202338],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0003323389,0.01026802,0.00716621,0.001168471,0.00191161,0.0002484293,0.01871227,0.00155364,0.03831412,0.5591451,0.2415483,0.1196315],"study_design_scores_gemma":[0.003385102,0.003630175,0.004942824,0.0004591023,0.0006289794,0.001071587,0.002574511,0.02889855,0.04011443,0.7959932,0.1154038,0.002897664],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.7144961,0.000119473,0.2637959,0.001607138,0.0009112536,0.001030389,0.00009557897,0.0004502157,0.01749401],"genre_scores_gemma":[0.8498983,0.00003002829,0.1368972,0.0001921723,0.0001195765,0.0001332287,0.000008209608,0.00004893208,0.01267236],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.2368482,"threshold_uncertainty_score":0.96479,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.006695384604352538,"gpt":0.2500003093397013,"spread":0.2433049247353488,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00008476787,0.0002482545,0.0003563509,0.0001077963,0.000069178,0.00003763364,0.0003254203,0.0001570999,0.0001824023],"category_scores_gemma":[0.00008794104,0.0002221995,0.0002017847,0.0003228498,0.00007488053,0.0001588444,0.00005172652,0.0004351977,0.0001098211],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004172927,"about_ca_system_score_gemma":0.00001125924,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0000201768,"about_ca_topic_score_gemma":0.000004583756,"domain_scores_codex":[0.9987437,0.00001005021,0.000317898,0.0003009443,0.0001723669,0.0004550681],"domain_scores_gemma":[0.9992629,0.0001239163,0.00004005963,0.0003137861,0.00005121229,0.0002081451],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00004472818,0.0001600562,0.0003929306,0.00004293359,0.0001631744,0.00001165757,0.00008923859,0.0003270624,0.1065826,0.0003609002,0.03438283,0.8574419],"study_design_scores_gemma":[0.000595115,0.0001977781,0.0006705251,0.0000125896,0.0000563588,0.00002835706,0.00001931131,0.4657851,0.06908374,0.002022295,0.4607123,0.0008165383],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0151402,0.0000740403,0.9798829,0.0002196993,0.0009354698,0.000302262,0.00004913289,0.00179749,0.001598812],"genre_scores_gemma":[0.7205711,0.00001498144,0.2780317,0.0002086284,0.0006959442,0.0001628846,0.00002793048,0.00009072173,0.0001960505],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8566254,"threshold_uncertainty_score":0.9061033,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.02031301153516308,"gpt":0.2514376002324644,"spread":0.2311245886973013,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004855177,0.0001719145,0.000323013,0.00009128852,0.00009480916,0.00007940566,0.0008694389,0.00007593737,0.000256847],"category_scores_gemma":[0.0001638566,0.0001408424,0.0001659299,0.0005265456,0.00006396354,0.0004969521,0.0002187137,0.0001338628,0.00009855084],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003972477,"about_ca_system_score_gemma":0.00003936056,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0000831055,"about_ca_topic_score_gemma":4.456452e-7,"domain_scores_codex":[0.9984272,0.00008662335,0.0003905727,0.0004133456,0.0002602025,0.0004220309],"domain_scores_gemma":[0.9985728,0.0004801715,0.0001435475,0.0004726974,0.0001579951,0.0001728447],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0000205473,0.0004228717,0.001565286,0.0001163075,0.00004924308,0.000004187651,0.0006823967,0.000006792,0.001331796,0.03023473,0.0008274604,0.9647384],"study_design_scores_gemma":[0.001574421,0.0006484162,0.007880232,0.00005890821,0.00002634257,0.00002847586,0.0001655087,0.8964114,0.02913287,0.05658785,0.006733792,0.0007517827],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.008358293,0.0001312424,0.9889482,0.0003812963,0.0005034547,0.0005349444,0.00002039329,0.0001400944,0.0009820445],"genre_scores_gemma":[0.8281379,0.000006494271,0.1713427,0.0001444431,0.0001375393,0.0001001276,0.000005607726,0.00001361461,0.0001115955],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9639866,"threshold_uncertainty_score":0.5743386,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.03719747129132631,"gpt":0.2419152012457536,"spread":0.2047177299544273,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001947605,0.0001444039,0.0003666685,0.00006859016,0.0002710996,0.00002654393,0.0002716463,0.00008092552,0.000083085],"category_scores_gemma":[0.0004323181,0.0001277994,0.0001618621,0.0003037347,0.0000999523,0.00007971082,0.0000605874,0.0001277164,0.000153454],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00005220921,"about_ca_system_score_gemma":0.00002450168,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001673461,"about_ca_topic_score_gemma":0.000001140635,"domain_scores_codex":[0.9987841,0.000006810738,0.0005208435,0.0003291927,0.00006707143,0.000292018],"domain_scores_gemma":[0.9985763,0.000674191,0.0003430967,0.0002494448,0.0000869999,0.00006989481],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0000324152,0.0001679395,0.00001503068,0.00001198876,0.00005892304,3.537481e-8,0.0001337326,0.002646409,0.00004293819,0.9618152,0.0001063996,0.03496901],"study_design_scores_gemma":[0.0003749892,0.000178286,0.0009378954,0.000008402072,0.00002703598,7.486815e-7,0.00002359784,0.9268423,0.00001260416,0.07057795,0.0008610786,0.0001551131],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.00005805942,0.0002834648,0.9978338,0.0005358885,0.0002353846,0.0004348374,0.0001913401,0.00003539535,0.0003918326],"genre_scores_gemma":[0.9804087,0.000002046947,0.01865341,0.0000621896,0.0003873213,0.0003209617,0.00002986352,0.00002295708,0.0001125601],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9803506,"threshold_uncertainty_score":0.5211507,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.03473668100141149,"gpt":0.3292401859836325,"spread":0.294503504982221,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001598588,0.0001356285,0.0003324564,0.0001483724,0.00004981419,0.00001829074,0.0000716428,0.00005487667,0.00003246607],"category_scores_gemma":[0.0002735666,0.0001305361,0.00007947444,0.00114405,0.00003951346,0.0001190261,0.00001531604,0.0001312184,9.901307e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003623996,"about_ca_system_score_gemma":0.00001338707,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000004950229,"about_ca_topic_score_gemma":1.973208e-7,"domain_scores_codex":[0.999172,0.00003964769,0.0002705466,0.0001971579,0.0001615391,0.0001591634],"domain_scores_gemma":[0.9985037,0.001155778,0.00005619346,0.00007168021,0.00008732819,0.0001252887],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00001252306,0.00001077322,0.0002273765,0.00003580646,0.0004989262,3.17394e-7,0.0001748955,0.8666385,0.00107758,0.0006881402,0.00001061298,0.1306245],"study_design_scores_gemma":[0.0002447419,0.00006993658,0.003419179,0.000005766363,0.0002559453,0.000001012571,0.00004720028,0.9937448,0.0006608094,0.0005593116,0.0008374763,0.000153844],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.001388541,0.00008560538,0.9977614,0.0002690819,0.00006763452,0.0001408694,0.00003512574,0.0001593177,0.00009237294],"genre_scores_gemma":[0.2092977,0.000003841437,0.7904509,0.0000887055,0.00005056654,0.0000351719,0.00004777422,0.00002377912,0.000001536798],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.2079092,"threshold_uncertainty_score":0.5323107,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.007193687431960727,"gpt":0.1934667173052149,"spread":0.1862730298732542,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0001530885,0.0001838605,0.0002481778,0.0000532955,0.00006799513,0.00004673209,0.000199552,0.00009798856,0.000197167],"category_scores_gemma":[0.00002441056,0.0001641589,0.0001153459,0.0002047748,0.00003588199,0.000130632,0.00001994762,0.0001954407,0.0008800232],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002786422,"about_ca_system_score_gemma":0.00001107214,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00003937122,"about_ca_topic_score_gemma":6.990631e-7,"domain_scores_codex":[0.9990179,0.00005443671,0.0002111892,0.0001962743,0.0001787912,0.0003413846],"domain_scores_gemma":[0.9993904,0.00005697913,0.00002045716,0.0002689876,0.00001195421,0.0002512232],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"not_applicable","study_design_scores_codex":[0.00003019443,0.0001460034,0.002040864,0.0002182185,0.0002558201,0.00003980577,0.001983652,0.01278604,0.005265993,0.06129381,0.05119794,0.8647417],"study_design_scores_gemma":[0.00100497,0.0002469178,0.0036666,0.00005446956,0.00003808443,0.00006024084,0.0001583875,0.2948028,0.00220668,0.02224828,0.6745493,0.000963224],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.149842,0.006011997,0.7861993,0.001099353,0.01073631,0.000749442,0.00002695237,0.005914544,0.03942009],"genre_scores_gemma":[0.9952722,0.00001990515,0.002347661,0.000173885,0.00129025,0.00001615385,0.000006071376,0.00004811968,0.0008257495],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.8637784,"threshold_uncertainty_score":0.9998979,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":false,"ca_fund":true,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.09974512545404286,"gpt":0.416837690776917,"spread":0.3170925653228742,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaresearch","metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00160476,0.0004733829,0.0008904864,0.000291213,0.000372191,0.0001270724,0.0004054553,0.0002522584,0.0005963783],"category_scores_gemma":[0.01352232,0.0003972039,0.000424091,0.002126285,0.0001473668,0.0001627256,0.0000813783,0.0004382578,0.00008599916],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001524638,"about_ca_system_score_gemma":0.0001348572,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00003772039,"about_ca_topic_score_gemma":0.000001542457,"domain_scores_codex":[0.9960593,0.0009566268,0.000853969,0.0007628933,0.0004732713,0.0008939703],"domain_scores_gemma":[0.9936894,0.004519934,0.0003117736,0.0006741469,0.0003895131,0.0004152716],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00002254931,0.0008938619,0.0001204552,0.0001897105,0.0002093675,0.000002834508,0.0004103257,0.00004862088,0.001084648,0.09112094,0.0004041788,0.9054925],"study_design_scores_gemma":[0.001388799,0.0004836744,0.000174128,0.00003723824,0.0002886936,0.00003199215,0.0001070936,0.04087647,0.002309819,0.870379,0.08313122,0.0007918652],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0004170408,0.0003264914,0.9943936,0.0003727384,0.0009544648,0.001346247,0.0000299741,0.0003263207,0.001833154],"genre_scores_gemma":[0.002136489,0.00001938166,0.9951712,0.0001399496,0.0001857742,0.0007432167,0.00001714284,0.0001362813,0.001450583],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.9047006,"threshold_uncertainty_score":0.999848,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"Western University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics","retraction":null,"screen_n_in":null,"score":{"opus":0.2189245133800095,"gpt":0.3802055099552841,"spread":0.1612809965752746,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001610815,0.0001344744,0.0004394652,0.00003451771,0.00007457389,0.000007441799,0.0003143678,0.00005926217,0.00062022],"category_scores_gemma":[0.0006740064,0.00009331381,0.0002924476,0.00039919,0.0001981581,0.00004114864,0.000077041,0.0001186327,0.000009128099],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002794744,"about_ca_system_score_gemma":0.00003301396,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00006004723,"about_ca_topic_score_gemma":0.000001869989,"domain_scores_codex":[0.9985649,0.0001373879,0.0005408388,0.0001774048,0.0003910871,0.0001883743],"domain_scores_gemma":[0.9979633,0.001193473,0.0003092532,0.0002813517,0.0001606347,0.00009195383],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0000296514,0.001084384,0.0001716675,0.0003187838,0.0001871866,3.03367e-7,0.0006653734,0.0002744193,0.0005286719,0.3180162,0.004488522,0.6742349],"study_design_scores_gemma":[0.0005324201,0.0001145655,0.001020036,0.0000389817,0.00007155668,0.000002820953,0.00001538145,0.09592858,0.0008650635,0.8991783,0.002120505,0.0001118419],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0008213082,0.00007149657,0.9965477,0.001498467,0.0001871615,0.0004479748,0.00008078438,0.00003167907,0.000313404],"genre_scores_gemma":[0.04726493,0.000002858718,0.9521841,0.0001046295,0.00007714074,0.00002246692,0.000005087643,0.00002130514,0.0003175188],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.674123,"threshold_uncertainty_score":0.6790974,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.08175538393039966,"gpt":0.366052991347989,"spread":0.2842976074175894,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005075486,0.0003211094,0.0005830367,0.000113198,0.0004138337,0.00005708371,0.0005951713,0.0001778996,0.00009513111],"category_scores_gemma":[0.001117296,0.0002201779,0.0003819866,0.0006885071,0.0001667931,0.00009754454,0.00005153378,0.0003196905,0.000006871816],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00009085009,"about_ca_system_score_gemma":0.00006853562,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00005466149,"about_ca_topic_score_gemma":5.226894e-7,"domain_scores_codex":[0.9971403,0.0003524201,0.000791607,0.0005009398,0.0006658146,0.0005489541],"domain_scores_gemma":[0.9963599,0.00206785,0.0003494351,0.0007241746,0.000267988,0.0002306213],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0004301336,0.0105855,0.00003424894,0.00009852175,0.0003490893,0.000001820288,0.001370446,0.01763376,0.01275553,0.3186201,0.000383272,0.6377376],"study_design_scores_gemma":[0.0007556455,0.0006469366,0.0008117161,0.000008700884,0.0002658365,0.000004484144,0.0001040941,0.9277958,0.001016527,0.06819004,0.0001183839,0.0002818042],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.002276698,0.0000483632,0.9953714,0.00050001,0.0003049536,0.001105351,0.00006179475,0.0001784191,0.0001529944],"genre_scores_gemma":[0.535663,0.000001799655,0.4638354,0.00005533974,0.0001984428,0.0001163354,0.00005458255,0.00002695902,0.00004816118],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9101621,"threshold_uncertainty_score":0.8978596,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.07707987753617833,"gpt":0.3508645522657172,"spread":0.2737846747295388,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0001613756,0.0003925395,0.0007454141,0.0001807493,0.00008366351,0.00001340232,0.0001899707,0.0001792311,0.0001220531],"category_scores_gemma":[0.0001154263,0.0003652482,0.000250935,0.001000391,0.0001099673,0.0001533351,0.00002285831,0.0002051163,0.00001853394],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0003501684,"about_ca_system_score_gemma":0.00003536272,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00009350557,"about_ca_topic_score_gemma":6.64883e-8,"domain_scores_codex":[0.9979731,0.0001776255,0.0006465159,0.000351658,0.0003272473,0.0005238953],"domain_scores_gemma":[0.9987904,0.0003942225,0.0000881724,0.0004046197,0.00007016357,0.0002524208],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00003134734,0.0003682442,0.0009741268,0.00007831764,0.0002546452,0.00006769273,0.000809687,0.3110875,0.064633,0.0001070291,0.00004018687,0.6215482],"study_design_scores_gemma":[0.0005149212,0.0002493564,0.001530467,0.0000176285,0.00004757251,0.0001496057,0.00002143836,0.9580063,0.03231183,0.0001495956,0.006595311,0.0004059187],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.01953727,0.001071053,0.9771018,0.00001514697,0.0007250481,0.0002255906,0.00000897038,0.0005603101,0.0007548317],"genre_scores_gemma":[0.2783303,0.00009053467,0.7212253,0.00001011194,0.0001953614,0.00002941954,0.000005591543,0.00008244503,0.00003092293],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.6469188,"threshold_uncertainty_score":0.99988,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.1106866237674137,"gpt":0.4370157396886069,"spread":0.3263291159211932,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003934794,0.0001697827,0.0003269955,0.00006814777,0.0003029886,0.00004137819,0.00007616496,0.00008827188,0.0000296337],"category_scores_gemma":[0.002188574,0.0001205918,0.0001467697,0.0001104023,0.0001258536,0.0001277552,0.00004336113,0.00006895616,0.00000654936],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00007050736,"about_ca_system_score_gemma":0.00003781144,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001728841,"about_ca_topic_score_gemma":8.010268e-7,"domain_scores_codex":[0.9988075,0.0001296917,0.0003045904,0.0003043973,0.0001322873,0.0003215446],"domain_scores_gemma":[0.9902381,0.009215873,0.0001118195,0.000147603,0.0001806473,0.0001059337],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00004937844,0.0001950458,0.00003966139,0.00007346651,0.0001146291,4.747772e-7,0.0001953741,0.00001050454,0.003428839,0.1658201,0.001631996,0.8284405],"study_design_scores_gemma":[0.001502336,0.0003390594,0.001249768,0.00009796056,0.0001553234,0.00004059573,0.0002220407,0.3440184,0.005778704,0.6315031,0.01456888,0.0005238289],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.001215788,0.00006009819,0.9956722,0.00192836,0.0002689688,0.0004670208,0.00007954524,0.0001449475,0.0001630231],"genre_scores_gemma":[0.1608726,0.000005325873,0.8381277,0.00008613447,0.0003088689,0.0001136555,0.00000928884,0.00003370178,0.0004427204],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.8279167,"threshold_uncertainty_score":0.4917592,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.09488628490794512,"gpt":0.3830505601114902,"spread":0.2881642752035452,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007470268,0.0002763448,0.0003379246,0.00009507748,0.0001739338,0.00004137538,0.0003017657,0.00007889535,0.00005318951],"category_scores_gemma":[0.0009180118,0.0002002832,0.0001739042,0.0004936941,0.00007054955,0.00008633996,0.00007183996,0.000276136,0.0001184375],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001144851,"about_ca_system_score_gemma":0.00001863178,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000003339039,"about_ca_topic_score_gemma":2.376586e-7,"domain_scores_codex":[0.9982615,0.0001586647,0.0004433337,0.000314932,0.000374263,0.0004472799],"domain_scores_gemma":[0.9884107,0.01105244,0.00008949122,0.000268339,0.00007882183,0.0001002062],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00002239425,0.00003394579,0.000001459702,0.00001909031,0.00008847713,0.000001437252,0.0002015669,0.4073387,0.00007125028,0.003553485,0.0005300882,0.5881381],"study_design_scores_gemma":[0.0002682878,0.0001972115,0.0001721129,0.0000239349,0.00003209282,0.000001815309,0.0001759137,0.9119121,0.0006132553,0.07096893,0.01539448,0.0002398976],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.00003874632,0.0002319621,0.9965027,0.0007990176,0.0008079091,0.0006080299,0.0000466759,0.000537476,0.0004274868],"genre_scores_gemma":[0.01062755,0.0000664699,0.9877325,0.0002282187,0.000411671,0.0005918521,0.0000318183,0.00008552291,0.0002244184],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.5878982,"threshold_uncertainty_score":0.8167312,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.06135734977768593,"gpt":0.3175204641062478,"spread":0.2561631143285619,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004453724,0.0001925334,0.0002836023,0.0001829655,0.0002080797,0.0001949077,0.0007407455,0.00009012114,0.00008310557],"category_scores_gemma":[0.0001628071,0.0001660104,0.0002088524,0.002052891,0.0000353041,0.0003754499,0.0002198166,0.0001233973,0.0003174478],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00007897458,"about_ca_system_score_gemma":0.00008321895,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001014477,"about_ca_topic_score_gemma":0.000002112255,"domain_scores_codex":[0.9979199,0.00007052419,0.0004203829,0.0006722125,0.0004816262,0.0004353726],"domain_scores_gemma":[0.9987544,0.0001761465,0.0001226175,0.0004480788,0.0002972874,0.0002014039],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0001032126,0.001867063,0.006621507,0.0001736171,0.0007274306,0.00005698841,0.001787346,0.2126735,0.001445893,0.1321911,0.02312922,0.6192232],"study_design_scores_gemma":[0.0006108104,0.000094387,0.004196092,0.000004830124,0.00001417689,0.000003472089,0.000006567715,0.9809114,0.0001501032,0.005793673,0.0079878,0.0002267072],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0006312468,0.00001876576,0.9925344,0.00489072,0.000506205,0.0003999981,0.00003481274,0.0006978126,0.0002860482],"genre_scores_gemma":[0.1228626,0.00004270592,0.868838,0.001614151,0.0008592333,0.0004058024,0.0004305905,0.00005612785,0.004890841],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.7682379,"threshold_uncertainty_score":0.6769707,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.1271586609638799,"gpt":0.3883227309792588,"spread":0.2611640700153789,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.000265811,0.0003749029,0.0006060477,0.00006614944,0.0002466428,0.00007153303,0.0004143911,0.0002010673,0.001407961],"category_scores_gemma":[0.002310132,0.0003229671,0.0003167496,0.0009526599,0.0001364873,0.0001512964,0.0001041252,0.0002007965,0.0002618357],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000172945,"about_ca_system_score_gemma":0.00003165972,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00004369141,"about_ca_topic_score_gemma":0.000004381188,"domain_scores_codex":[0.9974365,0.0001520806,0.0006108044,0.0005656119,0.0005167745,0.0007182309],"domain_scores_gemma":[0.9976529,0.001031572,0.0001981779,0.0005327736,0.0002168309,0.0003677258],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00005802478,0.002060979,0.001277443,0.0001815935,0.0003275278,0.00001837163,0.0003574033,0.0001080763,0.00006601599,0.06439268,0.02438311,0.9067688],"study_design_scores_gemma":[0.001320877,0.0004112085,0.0006870755,0.00003427025,0.0002352504,0.00002844397,0.00008230339,0.2913942,0.00009681002,0.6832952,0.02167875,0.0007355806],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.001801983,0.0000967349,0.9929257,0.001593979,0.0007554917,0.0007257418,0.0001307239,0.0004623965,0.001507224],"genre_scores_gemma":[0.02284413,0.000005060004,0.975095,0.0002877168,0.0003116681,0.0002727151,0.00001906261,0.00007665579,0.001088008],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.9060332,"threshold_uncertainty_score":0.9999222,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.03902062534026454,"gpt":0.302384397322267,"spread":0.2633637719820024,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000343721,0.0002089013,0.0004045306,0.00006114367,0.00003179919,0.00001151025,0.0002556074,0.00006040866,0.00003518407],"category_scores_gemma":[0.0004005914,0.0001499976,0.00005681595,0.0006732806,0.00005136318,0.00008962801,0.00005449044,0.0002517637,0.000003075952],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001078179,"about_ca_system_score_gemma":0.00003270828,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00008909997,"about_ca_topic_score_gemma":0.00001633945,"domain_scores_codex":[0.998476,0.00008540512,0.0005467737,0.0002538746,0.0003440378,0.000293875],"domain_scores_gemma":[0.9968764,0.002753698,0.00005744548,0.0001652267,0.0000627871,0.0000844219],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0001085752,0.0000909687,0.0004904502,0.0001859823,0.00003437633,0.000005191751,0.002086,0.7582097,0.0006875705,0.001048063,0.000005045085,0.2370481],"study_design_scores_gemma":[0.0006846812,0.0002867684,0.0009514473,0.0000503966,0.00001277724,0.000002290302,0.0002598774,0.9858263,0.001135295,0.01042468,0.0001763949,0.0001890822],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.002746016,0.00007998655,0.9956965,0.0005920165,0.00009180174,0.0006771217,0.00002535665,0.00005474939,0.00003648335],"genre_scores_gemma":[0.1826527,0.00002305427,0.8168522,0.0001586131,0.00005596836,0.0002228246,0.000007908859,0.00002494165,0.000001838614],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.236859,"threshold_uncertainty_score":0.6116725,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.10801369033901,"gpt":0.4575237875804916,"spread":0.3495100972414815,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006328661,0.0001969572,0.0004889311,0.0001015568,0.0003377838,0.00008393392,0.0004771943,0.0001168871,0.0008252934],"category_scores_gemma":[0.002487469,0.0001764574,0.0002303529,0.0001360818,0.0001991425,0.0003139543,0.0001486782,0.0002701219,0.00003655645],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00005135123,"about_ca_system_score_gemma":0.00002969956,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001319439,"about_ca_topic_score_gemma":0.000003070823,"domain_scores_codex":[0.9982154,0.0003140332,0.0005724524,0.0003118396,0.0002868192,0.00029943],"domain_scores_gemma":[0.9975169,0.0008508408,0.00064884,0.000721078,0.000122875,0.0001395075],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00003062045,0.0003708691,0.001060687,0.00006681561,0.0001488113,0.000002213533,0.0003827637,0.000007616168,0.01532368,0.0244404,0.0001033669,0.9580622],"study_design_scores_gemma":[0.0004237496,0.0001913043,0.01615014,0.00005179492,0.0001047057,0.00001143741,0.00004037554,0.04864247,0.02246725,0.9113327,0.0003086573,0.0002754053],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.00672223,0.00001713827,0.9887839,0.0002715914,0.0006394584,0.0002294782,0.00001579355,0.0001043301,0.003216106],"genre_scores_gemma":[0.1839136,0.000002117408,0.815578,0.00001835839,0.0001850569,0.00002694113,0.000007582998,0.0000328957,0.0002353354],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.9577867,"threshold_uncertainty_score":0.9036384,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.06072766935198908,"gpt":0.3282124186020278,"spread":0.2674847492500387,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0003794977,0.0004456036,0.001013152,0.0004248546,0.000214272,0.00004814451,0.0005587855,0.0002898508,0.001399252],"category_scores_gemma":[0.001245569,0.0004307493,0.0003706677,0.001408313,0.0002675918,0.0001910703,0.000226893,0.0006648832,0.0001073898],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0003223192,"about_ca_system_score_gemma":0.0001977617,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0005640377,"about_ca_topic_score_gemma":0.00006285588,"domain_scores_codex":[0.9957833,0.0005645962,0.001329619,0.0006288921,0.0008076476,0.0008858913],"domain_scores_gemma":[0.9965161,0.001938327,0.0003914313,0.0006102039,0.0001706957,0.0003732254],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0003963028,0.01501155,0.002015377,0.0001949443,0.0008661897,0.00003115339,0.003560885,0.004417693,0.01804492,0.06943313,0.004830842,0.881197],"study_design_scores_gemma":[0.003558028,0.0004504271,0.008983833,0.00009078342,0.0002216621,0.00002144966,0.0000859148,0.9061705,0.002309727,0.07517923,0.001769351,0.001159117],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02356356,0.00003473441,0.971105,0.00356124,0.0003417989,0.0005946981,0.000147869,0.0002445368,0.0004065326],"genre_scores_gemma":[0.7700606,0.000002373264,0.2288399,0.0001665998,0.0004155209,0.00008672511,0.00008788914,0.000072218,0.0002681687],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9017528,"threshold_uncertainty_score":0.9998145,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.05674016216338719,"gpt":0.3545631090474876,"spread":0.2978229468841004,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0002794763,0.0002043977,0.0004731151,0.000122526,0.00007635926,0.00002710289,0.0002026072,0.000116944,0.003072171],"category_scores_gemma":[0.0005548464,0.0001612907,0.0001716979,0.0005378894,0.00006762936,0.0001259212,0.0000312617,0.0002425758,0.0001448089],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003902816,"about_ca_system_score_gemma":0.00002084187,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00004469869,"about_ca_topic_score_gemma":2.748092e-7,"domain_scores_codex":[0.9982761,0.0002853628,0.0005157187,0.0002841034,0.0003874156,0.0002513101],"domain_scores_gemma":[0.9984807,0.0007639218,0.0001501581,0.0003794848,0.00008807131,0.0001377094],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0001378071,0.0008044894,0.00006591615,0.00005371105,0.00006632649,0.000003769769,0.0001585815,0.00001308042,0.001008609,0.03334116,0.0007815011,0.9635651],"study_design_scores_gemma":[0.002463796,0.00245031,0.01076564,0.0004872254,0.0002795396,0.00001621262,0.0001337726,0.2795767,0.007402191,0.6698474,0.02537066,0.001206477],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.4127034,0.0002384201,0.5577258,0.001999874,0.0007085698,0.001155392,0.0001123899,0.0006464606,0.02470974],"genre_scores_gemma":[0.7678334,0.00004701387,0.2287602,0.0006257644,0.000309107,0.00003558576,0.00004442472,0.00007321669,0.002271393],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9623586,"threshold_uncertainty_score":0.9978392,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.021588814093994,"gpt":0.2919303539596967,"spread":0.2703415398657028,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.001480465,0.0005538646,0.0007035445,0.0004494548,0.00055823,0.0003804518,0.002129242,0.0002442963,0.00009667371],"category_scores_gemma":[0.0003760053,0.0004851977,0.000477755,0.002311035,0.00008451858,0.0007898011,0.0002378768,0.0005102091,0.0003924973],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001650544,"about_ca_system_score_gemma":0.0001658819,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002280666,"about_ca_topic_score_gemma":2.817897e-7,"domain_scores_codex":[0.9955958,0.0002691638,0.0007817264,0.001227189,0.000884155,0.001241932],"domain_scores_gemma":[0.9969686,0.0007393261,0.0002697835,0.00112032,0.0002998307,0.000602156],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00004008225,0.0006934322,0.00002725167,0.00002463274,0.00004807336,0.00006405847,0.0002955928,0.0002093689,0.0002866608,0.09652146,0.004158094,0.8976313],"study_design_scores_gemma":[0.00277062,0.002155316,0.001306939,0.00004671595,0.00006745217,0.0002000978,0.00009728172,0.7858517,0.005816136,0.08991174,0.1100313,0.001744722],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0003836623,0.0006816627,0.9910551,0.002566139,0.001398045,0.0008485468,0.00003954191,0.0007029077,0.002324422],"genre_scores_gemma":[0.1218118,0.00006883313,0.8723754,0.001732261,0.00126322,0.0001597706,0.00003490518,0.00005222299,0.002501607],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.8958866,"threshold_uncertainty_score":0.99976,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.05893164806147973,"gpt":0.3683083009248282,"spread":0.3093766528633485,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006679611,0.0002200329,0.0004715585,0.00004452154,0.0002577349,0.00003638876,0.0004178695,0.0001284396,0.00003270596],"category_scores_gemma":[0.003066515,0.000147358,0.0003763274,0.0004081199,0.0001833894,0.00008127531,0.000034589,0.0002577319,0.000008141415],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00009105914,"about_ca_system_score_gemma":0.00006273967,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001259888,"about_ca_topic_score_gemma":0.000001895811,"domain_scores_codex":[0.9979162,0.0001978332,0.0006521968,0.0003374968,0.0004202972,0.0004759887],"domain_scores_gemma":[0.9951869,0.003732052,0.0002480171,0.0005587917,0.000110152,0.000164059],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0001006138,0.000533406,0.00002324031,0.00003039113,0.00005008834,7.178328e-7,0.0002455022,0.00003411009,0.0007558499,0.03555692,0.001499911,0.9611692],"study_design_scores_gemma":[0.0008810939,0.0007093461,0.0009021892,0.0000244303,0.0001290225,0.000004035154,0.0001461168,0.04092597,0.002781377,0.9066972,0.04650583,0.0002934294],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.002751394,0.00007869241,0.9882747,0.006555967,0.0003828852,0.001080838,0.00004627768,0.0001311756,0.0006981007],"genre_scores_gemma":[0.1298556,0.00003801851,0.8688697,0.000342673,0.0002548318,0.000204338,0.00001178029,0.00004956354,0.0003735081],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.9608758,"threshold_uncertainty_score":0.6009086,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.01784414276592345,"gpt":0.2301613547935339,"spread":0.2123172120276105,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000077509,0.00008977643,0.000137671,0.00005173691,0.0001175565,0.00001634031,0.0001265365,0.00003844213,0.0008732367],"category_scores_gemma":[0.00006138442,0.00007170807,0.0000727044,0.0003425693,0.00007142127,0.0001185103,0.00002252601,0.00009484222,0.0001533114],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000008333549,"about_ca_system_score_gemma":0.00008459263,"about_ca_topic_candidate":true,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.006887629,"about_ca_topic_score_gemma":0.0008207079,"domain_scores_codex":[0.9992037,0.00001732059,0.0001884429,0.0001542797,0.0001955286,0.0002406724],"domain_scores_gemma":[0.999588,0.00006985191,0.0000540179,0.0001337337,0.00004451773,0.0001098738],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"observational","study_design_scores_codex":[0.00002079439,0.0002186429,0.004063898,0.00001411407,0.00002633359,0.00001583453,0.0001321223,0.0208633,0.00006548574,0.004939344,0.00008553057,0.9695546],"study_design_scores_gemma":[0.001262113,0.0006753557,0.4962838,0.00002901356,0.00005713747,0.00005895985,0.0001786644,0.4271269,0.00009806895,0.06754538,0.006147057,0.0005375722],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0287036,0.0003097862,0.9442241,0.002871847,0.0007049949,0.0002597992,0.0003402678,0.0001751075,0.02241045],"genre_scores_gemma":[0.98484,0.00001510919,0.0144673,0.00008219141,0.00007863186,0.000001139528,0.0001403942,0.000002819656,0.0003723757],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.969017,"threshold_uncertainty_score":0.9997256,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.03137423783720586,"gpt":0.3528893357103434,"spread":0.3215150978731376,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002505421,0.0002995963,0.0005217741,0.00005990646,0.0001214526,0.00005307603,0.0002722832,0.00007991569,0.00001193659],"category_scores_gemma":[0.0004019534,0.000242362,0.0001031862,0.0002916713,0.00005705963,0.0001993348,0.00001515885,0.0001295969,0.000004877941],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0000562175,"about_ca_system_score_gemma":0.00001965879,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000001509802,"about_ca_topic_score_gemma":7.566914e-8,"domain_scores_codex":[0.9985231,0.00003614648,0.0003716716,0.0003772082,0.0002402635,0.0004516526],"domain_scores_gemma":[0.9977835,0.001529773,0.00008364017,0.000238228,0.0001718354,0.0001930452],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0001398116,0.0001990159,0.00000604807,0.00007814641,0.00005785837,0.000001988202,0.0001146012,0.6300607,0.0007505377,0.001849102,0.00009578148,0.3666464],"study_design_scores_gemma":[0.001002968,0.0008407437,0.00004629912,0.00003318755,0.00005328426,0.00001465334,0.00004032796,0.9566973,0.00300833,0.03689674,0.001002948,0.0003632217],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0002395638,0.000152816,0.9976664,0.00009856158,0.000264996,0.0008916141,0.00006385542,0.0005297296,0.00009247515],"genre_scores_gemma":[0.009195424,0.000005622795,0.9901429,0.0001382058,0.0001294702,0.0002478859,0.00003926535,0.0000691821,0.00003205572],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.3662832,"threshold_uncertainty_score":0.9883236,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.03466162384952067,"gpt":0.2947263157861348,"spread":0.2600646919366142,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0002405627,0.0001252792,0.0002946432,0.00004191016,0.00007238265,0.000007569284,0.0001221574,0.00008265356,0.001058167],"category_scores_gemma":[0.0002171225,0.00007583218,0.0001008819,0.0002421405,0.0001056185,0.00003612561,0.00001482668,0.0001896284,0.00001598049],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001902632,"about_ca_system_score_gemma":0.00002007088,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00009273723,"about_ca_topic_score_gemma":0.000005436428,"domain_scores_codex":[0.9990331,0.0001049673,0.0003685857,0.0001256471,0.0002385834,0.0001291069],"domain_scores_gemma":[0.9988702,0.0006311682,0.00009837734,0.0002892154,0.00004656147,0.00006446151],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0006543675,0.003631377,0.000509951,0.0006715275,0.0002042971,0.00000206265,0.002516445,0.00007456023,0.001556192,0.1931007,0.004717714,0.7923608],"study_design_scores_gemma":[0.003596459,0.004506215,0.02400679,0.001156606,0.0004080118,0.00003796967,0.0006058349,0.0698935,0.05308059,0.8071903,0.03450785,0.001009898],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9212461,0.0000211181,0.008617432,0.001530934,0.0002362264,0.0006269832,0.00009656961,0.00006112327,0.0675635],"genre_scores_gemma":[0.9947861,0.00001134743,0.003413569,0.0001195705,0.00004909134,0.000008482839,0.000001986168,0.00001315539,0.00159672],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.7913509,"threshold_uncertainty_score":0.999855,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.05418572371415838,"gpt":0.3461291579028326,"spread":0.2919434341886742,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004572603,0.0002098323,0.0003299749,0.0001826449,0.0002578392,0.0001066589,0.0002728273,0.0002095154,0.0001178196],"category_scores_gemma":[0.001051074,0.0001962769,0.0001565776,0.0004582661,0.00015372,0.0002748515,0.00004823601,0.0006383962,0.00002489968],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00009342077,"about_ca_system_score_gemma":0.0001565713,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00009441207,"about_ca_topic_score_gemma":0.00004251982,"domain_scores_codex":[0.9981878,0.00006185509,0.0004907147,0.000435866,0.0003744762,0.0004493154],"domain_scores_gemma":[0.9982652,0.0008848423,0.0001060452,0.0004052538,0.0001383967,0.0002002735],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0001788973,0.02104965,0.004194353,0.0004990945,0.0004039423,0.00001925648,0.002236556,0.02682361,0.009708203,0.8770243,0.002536447,0.05532571],"study_design_scores_gemma":[0.000583734,0.0001162756,0.001366752,0.000009556776,0.0000416103,0.000009294153,0.00005666282,0.9222314,0.00004239866,0.07318015,0.002125434,0.0002367809],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.01740555,0.000009063111,0.9800207,0.0003035685,0.0002930383,0.000641503,0.0001056547,0.0001425694,0.00107833],"genre_scores_gemma":[0.2866635,0.000001563767,0.7121427,0.00007782356,0.0004573007,0.0002345567,0.0002148622,0.00004734622,0.0001603322],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.8954077,"threshold_uncertainty_score":0.8003939,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.04929126396213066,"gpt":0.3769092674746912,"spread":0.3276180035125605,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003080661,0.000160195,0.0004234674,0.0001049806,0.00006805724,0.00002467442,0.00009001508,0.00002921192,0.00006587044],"category_scores_gemma":[0.000006575058,0.0001401515,0.00005883247,0.000554684,0.00004349127,0.000180201,0.00002449827,0.0002109506,0.000003080846],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002335857,"about_ca_system_score_gemma":0.00001462528,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0006979014,"about_ca_topic_score_gemma":0.000001799327,"domain_scores_codex":[0.9986163,0.0003039802,0.0004501955,0.0001870519,0.0001544019,0.0002880789],"domain_scores_gemma":[0.9993746,0.0002149829,0.0001448235,0.0001114343,0.00005076106,0.0001033985],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00001842875,0.00151657,0.4624674,0.000020718,0.0001588213,5.143822e-7,0.03024038,0.0007432845,0.004279873,0.000597647,0.000006653646,0.4999497],"study_design_scores_gemma":[0.00184803,0.0008232426,0.3959674,0.0001033093,0.0001583625,0.000007088803,0.01410443,0.5803091,0.00544362,0.0005423985,0.0001107375,0.0005822898],"study_design_candidate":"observational","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.5963769,0.00007183835,0.4030701,0.00003069045,0.00002532276,0.0001394479,0.000004720937,0.00001278455,0.0002681958],"genre_scores_gemma":[0.9656107,0.000001874748,0.03426297,0.00001362739,0.00006987678,0.00001290254,0.00001025896,0.0000079499,0.000009795079],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.5795658,"threshold_uncertainty_score":0.5715213,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.1016144034810564,"gpt":0.351534477393832,"spread":0.2499200739127755,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004784364,0.0002731108,0.0003816537,0.00006920928,0.0002997534,0.00008626292,0.0005638941,0.0001566206,0.0004606998],"category_scores_gemma":[0.004197462,0.0001525007,0.0002066999,0.0004894765,0.00009171744,0.0002182596,0.0001748165,0.0001452217,0.00002819433],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001322407,"about_ca_system_score_gemma":0.0001473434,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0006599313,"about_ca_topic_score_gemma":0.00001608732,"domain_scores_codex":[0.9978779,0.0001867826,0.0004894202,0.0004025943,0.0004713273,0.0005719501],"domain_scores_gemma":[0.9936658,0.005029854,0.0002223139,0.0006290195,0.0002232627,0.0002297712],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00005297918,0.0001268297,0.00002432047,0.00002157359,0.0001433068,8.745504e-7,0.0001728122,0.00003028869,0.006502514,0.2995099,0.002428582,0.690986],"study_design_scores_gemma":[0.0009830931,0.0001201434,0.0002413342,0.00003898977,0.0001126606,0.000002692657,0.00004556751,0.08040199,0.004669107,0.9067209,0.006369808,0.0002937688],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0004145526,0.00008575151,0.9898794,0.008359236,0.0004327506,0.0003908576,0.00003032985,0.0002290878,0.0001780212],"genre_scores_gemma":[0.03744007,0.0000255361,0.9563974,0.0002860592,0.00075495,0.0003321986,0.000009559574,0.00007895396,0.004675228],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.6906922,"threshold_uncertainty_score":0.6218798,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.01510306989429395,"gpt":0.362093451082811,"spread":0.346990381188517,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004322809,0.0001834251,0.0006075753,0.00005136089,0.00009768039,0.00001215859,0.00005320348,0.0001591647,0.00009779903],"category_scores_gemma":[0.0003362941,0.0001595869,0.0003904088,0.0002289706,0.00003831987,0.00006720083,0.00003424054,0.0002593251,0.000128977],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00007552346,"about_ca_system_score_gemma":0.00005706574,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000008882399,"about_ca_topic_score_gemma":1.514478e-8,"domain_scores_codex":[0.9985904,0.0001552652,0.0002949672,0.0004215437,0.0001341288,0.0004037559],"domain_scores_gemma":[0.9983951,0.0009693978,0.0001070502,0.0002866783,0.0001192183,0.0001225836],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000501138,0.00007841762,0.0004565139,0.00009412652,0.0002459096,0.000006420914,0.0002226065,0.00711767,0.2183685,0.0002886541,0.0001219736,0.7724981],"study_design_scores_gemma":[0.003338391,0.00169634,0.009780132,0.00009478095,0.0003162302,0.00003056392,0.0001663525,0.8702429,0.09537197,0.002890544,0.0154321,0.000639698],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2306302,0.000357808,0.7647656,0.0003148719,0.000708233,0.001097855,0.000008949649,0.0001595535,0.001956941],"genre_scores_gemma":[0.690839,0.00000856157,0.3070238,0.0003715775,0.0007716736,0.00007352624,0.00005245295,0.00003717316,0.0008222043],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8631252,"threshold_uncertainty_score":0.6507765,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.02295699096269615,"gpt":0.2615219915960272,"spread":0.2385650006333311,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003582269,0.0002162435,0.0003016896,0.0001152961,0.0001718096,0.0000992018,0.0004894606,0.0000441145,0.00003926033],"category_scores_gemma":[0.0001373653,0.0001854523,0.00007376147,0.0005876062,0.00008659865,0.0002928317,0.0002491584,0.0002151724,0.00005210163],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002545927,"about_ca_system_score_gemma":0.00001279458,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00005966428,"about_ca_topic_score_gemma":0.000005762532,"domain_scores_codex":[0.9982859,0.00005745439,0.0002916965,0.0006603498,0.0002168296,0.0004876927],"domain_scores_gemma":[0.998962,0.0002684156,0.00006237161,0.0004689796,0.00006459934,0.0001736753],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00002138695,0.000522589,0.00203381,0.00005203222,0.00004326368,0.00009485368,0.0008110309,0.0005887314,0.0007394117,0.06820334,0.001431339,0.9254582],"study_design_scores_gemma":[0.001187981,0.0001848254,0.001302805,0.00002244919,0.000009903543,0.0001126112,0.00001599385,0.9494797,0.0005894774,0.03182407,0.01483226,0.0004379046],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.03068651,0.001478704,0.9593312,0.005414812,0.0008421349,0.0007513324,0.00001458249,0.0003879404,0.001092839],"genre_scores_gemma":[0.5931096,0.00008289616,0.4047028,0.0007621105,0.0004380142,0.0001179742,0.000002352602,0.00003417638,0.0007501215],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.948891,"threshold_uncertainty_score":0.7562526,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.01537253563966097,"gpt":0.2955199968666041,"spread":0.2801474612269432,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000140869,0.0002009333,0.0004699689,0.0000613047,0.00002719897,0.00001419593,0.0002101495,0.00008346068,0.00003185541],"category_scores_gemma":[0.0006036845,0.0001809718,0.0002023701,0.0002328833,0.00003192628,0.00007464815,0.00001243697,0.0001595521,0.00001546186],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0000512888,"about_ca_system_score_gemma":0.00002589801,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000001433869,"about_ca_topic_score_gemma":5.627347e-8,"domain_scores_codex":[0.9988334,0.0000352633,0.0004218847,0.0001917196,0.0002224845,0.0002952023],"domain_scores_gemma":[0.9979521,0.00155377,0.00007073509,0.000171814,0.00008576593,0.0001658118],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00006862049,0.00009112133,0.0000427956,0.00006263635,0.00009628366,0.000002670514,0.00008380733,0.05032336,0.001919511,0.004720191,0.000622094,0.9419669],"study_design_scores_gemma":[0.0008730617,0.0005421259,0.0004571171,0.00005598303,0.00004884515,0.00001519286,0.000009977864,0.8850905,0.002756823,0.108877,0.001003488,0.000269825],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0002663806,0.0002326073,0.997775,0.0001071109,0.0003989826,0.0002925874,0.00002306859,0.0002549345,0.0006493615],"genre_scores_gemma":[0.3438308,0.000005715564,0.655836,0.0001300076,0.0001371288,0.00001000187,0.00000298251,0.00002447944,0.00002281224],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.9416971,"threshold_uncertainty_score":0.7379814,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.03341095265633933,"gpt":0.2884768538702902,"spread":0.2550659012139509,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001257212,0.0002696716,0.0003579406,0.00005021912,0.000109846,0.00009621244,0.0001557512,0.0001186078,0.0003194843],"category_scores_gemma":[0.0001254194,0.0002370316,0.00008432881,0.0004042034,0.0000633107,0.000193348,0.00001639037,0.0002725408,0.00004163147],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00005960637,"about_ca_system_score_gemma":0.00003746638,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000008333012,"about_ca_topic_score_gemma":4.449562e-7,"domain_scores_codex":[0.9985588,0.0000853348,0.0003043539,0.000384265,0.0002727462,0.0003944977],"domain_scores_gemma":[0.9990152,0.0003241578,0.0000575967,0.000185613,0.00009579162,0.0003217025],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.001440813,0.0005698997,0.0009105272,0.000412286,0.0002885696,0.00003787569,0.003890801,0.2777516,0.2715056,0.0005318439,0.0005827221,0.4420774],"study_design_scores_gemma":[0.001106385,0.002029973,0.002726586,0.00001643795,0.00003393279,0.000006364743,0.00006638935,0.9835693,0.008736719,0.0002880364,0.001057892,0.0003619633],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1305379,0.00009446406,0.8676816,0.0005445167,0.00008318823,0.0003978452,0.00002761103,0.0004873603,0.0001454824],"genre_scores_gemma":[0.7066328,0.000006459227,0.2922091,0.0006336372,0.0002027562,0.0001388509,0.0001005976,0.00005394992,0.00002182173],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.7058177,"threshold_uncertainty_score":0.9665869,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.04149493161548064,"gpt":0.3580176124486658,"spread":0.3165226808331852,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002328551,0.0002630856,0.0003768149,0.00007056214,0.00008787723,0.00003157516,0.0001433798,0.00008941221,0.00008643465],"category_scores_gemma":[0.0004734861,0.0002162091,0.00009898566,0.0003796953,0.00005879093,0.0001183494,0.00001916637,0.0001980053,0.00001506459],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00008086842,"about_ca_system_score_gemma":0.00002458179,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":8.171621e-7,"about_ca_topic_score_gemma":4.290671e-8,"domain_scores_codex":[0.9986685,0.0001361057,0.0003471844,0.0002809843,0.0002133344,0.0003539053],"domain_scores_gemma":[0.9979043,0.001577295,0.00006779111,0.0002072144,0.0001097299,0.0001336493],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00004702483,0.0001972478,0.00002521582,0.000167596,0.0001318128,0.000004423443,0.00009417314,0.08663412,0.001566709,0.006307879,0.000120387,0.9047034],"study_design_scores_gemma":[0.0005355192,0.0002615014,0.00004617038,0.00002256414,0.00004221954,0.00002788663,0.00002486548,0.9368699,0.006126784,0.04433864,0.0113516,0.000352408],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0005218541,0.0001486999,0.9974298,0.00003628015,0.0004797835,0.0003740646,0.00001540206,0.0003474678,0.0006466358],"genre_scores_gemma":[0.008103194,0.00001033791,0.9913327,0.00004669299,0.0001839131,0.0001603145,0.0000229195,0.00008878787,0.00005116334],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.904351,"threshold_uncertainty_score":0.8816753,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.09395097368211223,"gpt":0.3795944641367546,"spread":0.2856434904546423,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003473417,0.0002032291,0.000408742,0.00008592701,0.0007637439,0.0001590437,0.0003112944,0.0001161787,0.0002489408],"category_scores_gemma":[0.002056816,0.0001675749,0.0002244025,0.0001202236,0.0001755107,0.0002796793,0.0000924274,0.0001470781,0.000007898416],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00005928681,"about_ca_system_score_gemma":0.00006511816,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0000945685,"about_ca_topic_score_gemma":0.000005889097,"domain_scores_codex":[0.9983873,0.00009384748,0.0005568484,0.0003350929,0.0003417632,0.0002851282],"domain_scores_gemma":[0.9977149,0.0007939303,0.0005407431,0.0005869722,0.000228998,0.0001344185],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.000359376,0.006578333,0.002326174,0.001118516,0.0008587872,0.000005492324,0.003544377,0.0003004491,0.04556375,0.1539581,0.005403887,0.7799828],"study_design_scores_gemma":[0.003355735,0.001239727,0.0121515,0.0003175902,0.0004841491,0.000007021425,0.0003822851,0.220393,0.006492791,0.7037535,0.05041372,0.001008991],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.007148876,0.00002783607,0.988914,0.001089322,0.0004954038,0.0007424765,0.0001531614,0.00007154412,0.001357339],"genre_scores_gemma":[0.458867,0.00002194352,0.5381156,0.00008217033,0.0003014406,0.0003947565,0.00019538,0.00006565981,0.001956144],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.7789738,"threshold_uncertainty_score":0.6833506,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.08276352994104468,"gpt":0.3634561516944471,"spread":0.2806926217534024,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003370852,0.0002121524,0.0003051084,0.00002018248,0.0001041018,0.00003399485,0.0003435902,0.0000576144,0.00005583224],"category_scores_gemma":[0.0007131527,0.0001517707,0.0001351775,0.0004031027,0.00004770621,0.00006618506,0.00007665444,0.0002446786,0.00004342524],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004809144,"about_ca_system_score_gemma":0.00001386867,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":9.530797e-7,"about_ca_topic_score_gemma":3.204108e-8,"domain_scores_codex":[0.9987369,0.00009538249,0.000396486,0.0002433985,0.0002034987,0.0003243639],"domain_scores_gemma":[0.9948279,0.004694085,0.00006093298,0.0001846255,0.00007109213,0.0001613671],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00000767027,0.00001792358,0.000001763273,0.0000742949,0.00006713006,6.627484e-7,0.0001796818,0.265867,0.0001718142,0.001971146,0.0007434697,0.7308975],"study_design_scores_gemma":[0.0002095987,0.00009194302,0.00001483637,0.000006511216,0.00002960018,0.000001579174,0.00004562004,0.8271781,0.001214268,0.03327172,0.1377608,0.0001754872],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.000004597699,0.0004325277,0.9954451,0.002362527,0.0003452071,0.0006003242,0.00001905601,0.0004131389,0.0003774628],"genre_scores_gemma":[0.001581457,0.00002809167,0.9967419,0.000847048,0.0003720202,0.0003283609,0.000007633593,0.00006647831,0.00002703518],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.730722,"threshold_uncertainty_score":0.6189029,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.01492559523215981,"gpt":0.2953748768807683,"spread":0.2804492816486085,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001706176,0.0002022722,0.0002778843,0.00007987725,0.000221365,0.00003811579,0.0001256079,0.00003624246,0.00009461073],"category_scores_gemma":[0.00002596453,0.0001839386,0.00005924524,0.0002526776,0.00005178892,0.0002100129,0.00005539479,0.0002308667,0.000003524199],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00007913112,"about_ca_system_score_gemma":0.0000167924,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000001119811,"about_ca_topic_score_gemma":6.302433e-8,"domain_scores_codex":[0.9988621,0.0001197455,0.0002420227,0.0002867894,0.0002469224,0.0002423776],"domain_scores_gemma":[0.9982145,0.001460042,0.00006844497,0.0001267633,0.00001739429,0.000112828],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0001465277,0.0001255457,0.00002589818,0.00008957548,0.00009577267,0.000009871968,0.0003270852,0.9448029,0.0001787809,0.00613042,0.0008425358,0.0472251],"study_design_scores_gemma":[0.0008585703,0.0008557169,0.0002015664,0.00002431409,0.0000278802,0.00006987542,0.0004024094,0.813847,0.0005987541,0.1769179,0.00580491,0.0003911028],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.004816417,0.00009323042,0.9930579,0.0004667045,0.0001580584,0.000435401,0.0001387165,0.0003734504,0.0004601258],"genre_scores_gemma":[0.0185976,0.00001142664,0.980439,0.0002997107,0.00006150852,0.000404414,0.00008186519,0.00007208515,0.00003240852],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.1707875,"threshold_uncertainty_score":0.7500796,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.1137789021045145,"gpt":0.4744715413494847,"spread":0.3606926392449702,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.001230193,0.0004708673,0.0007815305,0.0001958428,0.0002710008,0.0002067045,0.0004734534,0.0003078238,0.0002317661],"category_scores_gemma":[0.001746885,0.0003956185,0.0004937559,0.0008450909,0.0001009738,0.0003158627,0.0000787242,0.0004183418,0.00004968245],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001412415,"about_ca_system_score_gemma":0.0002036543,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00009743089,"about_ca_topic_score_gemma":0.000005414586,"domain_scores_codex":[0.9965551,0.0003851841,0.0008579253,0.0009303938,0.0004733453,0.0007979975],"domain_scores_gemma":[0.9941183,0.004394234,0.0001529412,0.0006048658,0.0003521357,0.000377495],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0001020203,0.000930492,0.00000291241,0.0009781974,0.0003613279,0.00000852989,0.0008977416,0.0004874011,0.003407591,0.1121791,0.002120654,0.878524],"study_design_scores_gemma":[0.0004887211,0.0005648382,0.000003305987,0.00006487563,0.0002151146,0.00001249089,0.00005188995,0.5258361,0.002264563,0.4112475,0.05888233,0.0003682428],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.00009848645,0.0001871866,0.9930346,0.001606495,0.001265282,0.002263903,0.0004990008,0.000798199,0.0002468567],"genre_scores_gemma":[0.0008145519,0.000008659909,0.9941441,0.0004819219,0.001407636,0.001758892,0.0001820113,0.0002431534,0.0009590819],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.8781558,"threshold_uncertainty_score":0.9998496,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.1229195283622032,"gpt":0.4592171687068867,"spread":0.3362976403446835,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000987808,0.0002074978,0.0004786474,0.00008673228,0.0002161239,0.00004061616,0.0002801007,0.00007254438,0.0002171236],"category_scores_gemma":[0.0008578271,0.0001340861,0.0001820255,0.0004497903,0.00005086274,0.0001550486,0.0001195292,0.0002086958,0.00002001239],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004310655,"about_ca_system_score_gemma":0.00007579523,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0000712429,"about_ca_topic_score_gemma":0.00001148243,"domain_scores_codex":[0.9981281,0.0004140643,0.0005035569,0.0003023695,0.0003739095,0.0002780253],"domain_scores_gemma":[0.9959884,0.002860261,0.0002368416,0.0005712326,0.0002848328,0.000058385],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.002320406,0.03465346,0.0242166,0.001515226,0.008138231,0.00007864901,0.2078525,0.01787402,0.08023089,0.42509,0.004251497,0.1937786],"study_design_scores_gemma":[0.006215852,0.00545985,0.002917103,0.0001635491,0.001239936,0.0001103665,0.045649,0.7783784,0.009922819,0.1386618,0.009897828,0.001383438],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.1049168,0.00005510292,0.8925171,0.000256924,0.0003548582,0.001664611,0.00004519265,0.00005546799,0.0001339598],"genre_scores_gemma":[0.07985345,6.571247e-7,0.9187309,0.00002757092,0.0000968274,0.00009812872,0.000003633083,0.00005259639,0.001136259],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.7605044,"threshold_uncertainty_score":0.5467872,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.01946746877301521,"gpt":0.2497056394969522,"spread":0.230238170723937,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002728344,0.0001281663,0.0002546085,0.00003602106,0.0001553246,0.0000740399,0.0003829731,0.00005487608,0.000002345973],"category_scores_gemma":[0.0001252506,0.00006869494,0.0001109403,0.0001346859,0.00008275701,0.0002210083,0.00005430579,0.00003253888,0.000002697533],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002765557,"about_ca_system_score_gemma":0.0000742257,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00004967047,"about_ca_topic_score_gemma":0.000001498496,"domain_scores_codex":[0.9989974,0.00002516547,0.0002910762,0.000285392,0.0001389103,0.000261988],"domain_scores_gemma":[0.9979896,0.00151131,0.0001050032,0.0001948978,0.0001169234,0.00008228607],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00004174935,0.00003610361,0.00004877538,0.00004196654,0.00003352933,2.675901e-7,0.0001810774,0.00004003898,0.001082035,0.004686266,0.0008327087,0.9929755],"study_design_scores_gemma":[0.009097582,0.00223167,0.006432579,0.0002567606,0.0001517279,0.0000766263,0.0001488755,0.8098584,0.02746487,0.06581843,0.07734007,0.001122351],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.003640739,0.0004300735,0.9920244,0.00246196,0.0005412727,0.0007423628,0.000070522,0.00007109237,0.0000175319],"genre_scores_gemma":[0.8592573,0.00003790475,0.1391449,0.0001366875,0.0005834138,0.0004850338,0.000003845881,0.0000213875,0.0003294391],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9918531,"threshold_uncertainty_score":0.2801298,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.01070531117536427,"gpt":0.218028392457166,"spread":0.2073230812818018,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00004097429,0.0001394198,0.0002744809,0.00001433643,0.00006723518,0.00001516679,0.0001858203,0.00002930722,0.00004948577],"category_scores_gemma":[0.000001967943,0.00009906818,0.0001475263,0.0002715239,0.000107817,0.00006036443,0.00006401166,0.0001057534,0.000002302532],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000007608069,"about_ca_system_score_gemma":0.00008262687,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001209454,"about_ca_topic_score_gemma":1.783583e-7,"domain_scores_codex":[0.999033,0.00006017334,0.0002449507,0.0001880332,0.0003104396,0.000163427],"domain_scores_gemma":[0.9994566,0.00002112964,0.0002018638,0.0001395625,0.000112242,0.00006863556],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0004857811,0.002367423,0.006737168,0.0004060772,0.001693781,0.00002097537,0.002921723,0.02112332,0.07033101,0.5120711,0.001581617,0.38026],"study_design_scores_gemma":[0.001781103,0.001013318,0.003326478,0.000134618,0.0002636354,0.000004075115,0.0007608489,0.7076249,0.1995019,0.08418592,0.0008177453,0.0005854873],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2013244,0.0001547349,0.7971615,0.0004463867,0.0001623148,0.0001389241,0.00007877942,0.00002413158,0.0005088929],"genre_scores_gemma":[0.9976528,0.000002064071,0.002002285,0.00008388834,0.0001907635,0.000005030088,0.00002126091,0.00002084093,0.00002104258],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.7963285,"threshold_uncertainty_score":0.4039883,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.1347211694251127,"gpt":0.4522147365095032,"spread":0.3174935670843905,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0007438833,0.0004625025,0.0008075584,0.0003164997,0.0006229677,0.0001539897,0.0004494351,0.0002788515,0.00265146],"category_scores_gemma":[0.004544454,0.0004304822,0.0005275231,0.001661016,0.0001552756,0.0002350264,0.000224243,0.0003825173,0.0004065856],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001107001,"about_ca_system_score_gemma":0.000100701,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001908122,"about_ca_topic_score_gemma":0.00000636701,"domain_scores_codex":[0.9960313,0.0006584798,0.0009945508,0.0007899803,0.0005389832,0.0009866805],"domain_scores_gemma":[0.9930449,0.005250254,0.0003110215,0.0006445491,0.0003607878,0.0003885212],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0002562969,0.002294418,0.00004321871,0.0003927173,0.0008577153,0.00001111229,0.001518664,0.0002000391,0.06650963,0.1378355,0.01219959,0.7778811],"study_design_scores_gemma":[0.001881337,0.0003128554,0.0004232765,0.00002581711,0.0002794954,0.000005408052,0.0001479841,0.2161094,0.008839325,0.7490267,0.02216481,0.0007836185],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.001876108,0.00002643113,0.992796,0.0007316072,0.001858806,0.001138805,0.0002292452,0.001081323,0.0002616827],"genre_scores_gemma":[0.01800928,0.000008750176,0.9743919,0.0001489932,0.0008718175,0.001476547,0.0004651877,0.0001627329,0.004464734],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.7770975,"threshold_uncertainty_score":0.9998147,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.0225661602452816,"gpt":0.3147945893417288,"spread":0.2922284290964472,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002090302,0.0002179875,0.000306353,0.00007262688,0.00003786836,0.0000689556,0.000128286,0.00007628958,0.00003302033],"category_scores_gemma":[0.0001400223,0.0002048611,0.00005388812,0.0003550278,0.00004912582,0.0001371446,0.00005776521,0.0002367616,0.00004183863],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001021886,"about_ca_system_score_gemma":0.00001340615,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000002564949,"about_ca_topic_score_gemma":2.226818e-7,"domain_scores_codex":[0.998738,0.00003242599,0.0003874027,0.0002984759,0.0002126939,0.0003309986],"domain_scores_gemma":[0.9985533,0.001161303,0.00002376484,0.0001329684,0.00002452304,0.000104125],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00002462009,0.0001362264,0.0001115469,0.0007466505,0.0001317188,0.00005700379,0.0006888134,0.139979,0.002436279,0.008142019,0.0007483389,0.8467978],"study_design_scores_gemma":[0.0002642334,0.0001113906,0.0001050647,0.00009334392,0.00001340464,0.00001505766,0.00004837706,0.9593227,0.0004700769,0.03026841,0.009035097,0.0002528316],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.009121934,0.0009230998,0.9883224,0.0001204323,0.0005236912,0.0003082389,0.00004991806,0.0003873153,0.0002429805],"genre_scores_gemma":[0.1002383,0.00005664305,0.8992606,0.00006317522,0.0001367112,0.0000674052,0.00001227164,0.00007207906,0.00009272318],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.8465449,"threshold_uncertainty_score":0.8353994,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.08544542573919696,"gpt":0.3618550979825634,"spread":0.2764096722433664,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005732031,0.0003061134,0.0005809472,0.00008695087,0.0003138365,0.00003114983,0.0005313641,0.000120161,0.0003447717],"category_scores_gemma":[0.002577628,0.0001904072,0.0002739091,0.0004941389,0.0006173035,0.0002217219,0.0001529392,0.000460292,0.00009391255],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001108204,"about_ca_system_score_gemma":0.00008364869,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001204369,"about_ca_topic_score_gemma":0.000008277488,"domain_scores_codex":[0.9974859,0.0001877653,0.0008046649,0.0003002652,0.0007636362,0.000457769],"domain_scores_gemma":[0.9961557,0.002564651,0.0003114102,0.0005839723,0.0002579317,0.0001262686],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0000706498,0.001259974,0.0006914564,0.0002480486,0.000361732,0.00002945723,0.01258232,0.0000441604,0.001197444,0.9158136,0.02492627,0.04277494],"study_design_scores_gemma":[0.0004028306,0.0001372862,0.0001553354,0.00008648191,0.00009151779,0.00005412667,0.001618052,0.00560995,0.003704226,0.9866135,0.00123584,0.0002909032],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1743374,0.0006767653,0.8062523,0.001653816,0.0004074997,0.001283205,0.0001633642,0.0004690404,0.01475661],"genre_scores_gemma":[0.8198752,0.0001248753,0.1720525,0.0002891812,0.000166548,0.0002241909,0.00003372413,0.0001212062,0.007112618],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.6455378,"threshold_uncertainty_score":0.7764578,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.04831527197452042,"gpt":0.3224646853747276,"spread":0.2741494134002072,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0001691239,0.0001643063,0.0002026879,0.0001277721,0.0002123085,0.00007309535,0.0002382017,0.00009378647,0.001728707],"category_scores_gemma":[0.0009518806,0.0001155301,0.0002513145,0.0005591012,0.0001246647,0.0001367497,0.00007769143,0.0004330889,0.0001648914],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001577381,"about_ca_system_score_gemma":0.0001309675,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00004817444,"about_ca_topic_score_gemma":0.00002203339,"domain_scores_codex":[0.9985731,0.0001003239,0.000385968,0.0002560862,0.0004625662,0.0002219779],"domain_scores_gemma":[0.9979572,0.001430437,0.00009307476,0.0003488065,0.0001060481,0.00006444874],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000008395871,0.0004315987,0.00001217329,0.00008849083,0.0001660198,0.000004263306,0.0007075461,0.0002145537,0.003543142,0.9653493,0.007447987,0.02202651],"study_design_scores_gemma":[0.0001893731,0.0001230285,0.0007879012,0.0002892361,0.0001263852,0.00001459028,0.0001471686,0.503895,0.002524295,0.4830461,0.008588035,0.0002688147],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02249993,0.0001289689,0.9658998,0.002025437,0.001854484,0.0003409755,0.0001150402,0.0001906858,0.00694467],"genre_scores_gemma":[0.9782162,0.000001186991,0.01700484,0.000102763,0.0002067114,0.00003904378,0.00001504621,0.0000367175,0.004377529],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9557163,"threshold_uncertainty_score":0.9991838,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.06232660415006911,"gpt":0.3394059472646809,"spread":0.2770793431146118,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002933689,0.0001494197,0.0003120168,0.0003040845,0.00009870182,0.00006561745,0.00008736917,0.00008240047,0.0004690031],"category_scores_gemma":[0.0006127514,0.0001299681,0.0001103473,0.001395558,0.00008161091,0.0001969758,0.00005491745,0.0001718238,0.00003958946],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0000513701,"about_ca_system_score_gemma":0.00005654259,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00004257092,"about_ca_topic_score_gemma":0.000001195678,"domain_scores_codex":[0.9985531,0.0001237325,0.0004346544,0.0002957639,0.0003879213,0.0002048531],"domain_scores_gemma":[0.9986805,0.000832813,0.00008338354,0.0001780633,0.0001135015,0.0001117265],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00002101958,0.0004766794,0.0002910621,0.0003618547,0.00023599,0.000003843223,0.0003264451,0.0001593246,0.007463811,0.1412599,0.001047385,0.8483527],"study_design_scores_gemma":[0.0006193483,0.0002394854,0.001674871,0.00006962001,0.0002637377,0.00003166111,0.0001900179,0.4032856,0.002712718,0.5839568,0.006536828,0.0004193126],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.01702688,0.0003782738,0.9808977,0.0003468655,0.0004304325,0.0002299038,0.00006984102,0.0001696327,0.0004504563],"genre_scores_gemma":[0.1237504,0.00003598109,0.8742885,0.00002904987,0.0002189062,0.00009738779,0.00006639761,0.00004352456,0.001469851],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.8479334,"threshold_uncertainty_score":0.5299944,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.04604667643643701,"gpt":0.2855975527531398,"spread":0.2395508763167028,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001660803,0.0001824814,0.0003971591,0.0000819643,0.0003227069,0.0000405915,0.001630708,0.00004567817,0.0003561459],"category_scores_gemma":[0.0003111043,0.0001342969,0.0001599148,0.001365694,0.0001141273,0.0001880823,0.000954836,0.0004253532,0.00000426956],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003661431,"about_ca_system_score_gemma":0.0001199484,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001287488,"about_ca_topic_score_gemma":0.000001072552,"domain_scores_codex":[0.9971985,0.0005443631,0.0005615368,0.000393992,0.0009424715,0.0003591006],"domain_scores_gemma":[0.9974886,0.001289637,0.0003548705,0.0006724356,0.00009843288,0.00009600275],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0001136783,0.001413952,0.001878292,0.000250419,0.0003171444,0.00004328491,0.01811287,0.00507136,0.001949422,0.4763363,0.001862632,0.4926506],"study_design_scores_gemma":[0.0007144202,0.0004209753,0.0005676628,0.00001929253,0.00002402212,0.00005878981,0.0008682024,0.9353588,0.004394911,0.04596997,0.011238,0.0003649734],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.00672865,0.0001061525,0.9854491,0.006181377,0.0004034161,0.0002952681,0.0001958689,0.00009733509,0.0005428776],"genre_scores_gemma":[0.7282808,0.000003347829,0.2706393,0.0006862346,0.0001607293,0.0001107861,0.00002655801,0.00002350647,0.00006873416],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9302874,"threshold_uncertainty_score":0.5476468,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null}]}