{"meta":{"page":1,"per_page":50,"max_per_page":100,"total":32,"total_is_capped":false,"direct_labels_cover":0,"predictions_cover":32,"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":"9a14fe199900","filters":{"venue":"International Journal of Computer Mathematics"}},"results":[{"id":"W2050024620","doi":"10.1080/00207160.2012.685468","title":"Packing equal circles into a circle with circular prohibited areas","year":2012,"lang":"en","type":"article","venue":"International Journal of Computer Mathematics","topic":"Optimization and Packing Problems","field":"Engineering","cited_by":31,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":false,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"","funders":"University of Waterloo","keywords":"Circle packing; Mathematics; Packing problems; Domain (mathematical analysis); RADIUS; Lattice (music); Sphere packing; Hexagonal lattice; Maxima and minima; Hexagonal crystal system; Maxima; Geometry; Combinatorics; Mathematical analysis; Computer science","retraction":null,"screen_n_in":null,"score":{"opus":0.01230553617681728,"gpt":0.2322135809874888,"spread":0.2199080448106715,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002709173,0.0001211176,0.0001876204,0.0002013834,0.00002581064,0.0001120405,0.0002827145,0.00004565271,0.00003932136],"category_scores_gemma":[0.00001890212,0.0001077136,0.00007370925,0.0001094886,0.00002450409,0.0003836202,0.00003377772,0.0001633835,0.00001917549],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00007801801,"about_ca_system_score_gemma":0.00002345075,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":8.625898e-7,"about_ca_topic_score_gemma":5.126161e-7,"domain_scores_codex":[0.9988633,0.00001817326,0.0004276031,0.000054087,0.0004729217,0.0001639507],"domain_scores_gemma":[0.9991572,0.00007519776,0.0002059876,0.0001043925,0.0003521451,0.0001050356],"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.00006950361,0.001338611,0.01525183,0.00100096,0.003217968,0.0002192109,0.03754668,0.8313853,0.003588169,0.02048563,0.00385996,0.08203623],"study_design_scores_gemma":[0.004414104,0.0003984431,0.008291907,0.003390598,0.000235121,0.005361479,0.0005256513,0.939384,0.007136618,0.01429697,0.01520041,0.001364652],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1118247,0.0001559291,0.8862665,0.0001044659,0.0009503751,0.00006761349,0.000001584481,0.00007184158,0.000556921],"genre_scores_gemma":[0.8676379,0.00001711058,0.1316276,0.00007571202,0.0005998458,0.000001473384,0.000003898374,0.00003049711,0.000005921031],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.7558132,"threshold_uncertainty_score":0.4392435,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2164690815","doi":"10.1080/00207160412331284042","title":"Partial sums of certain classes of analytic functions","year":2004,"lang":"en","type":"article","venue":"International Journal of Computer Mathematics","topic":"Analytic and geometric function theory","field":"Mathematics","cited_by":31,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":true},"ca_institutions":"University of Victoria","funders":"","keywords":"Convexity; Mathematics; Unit disk; Function (biology); Analytic function; Regular polygon; Class (philosophy); Image (mathematics); Unit (ring theory); Convex function; Combinatorics; Pseudoconvex function; Pure mathematics; Convex analysis; Convex optimization; Geometry; Computer science; Finance; Artificial intelligence","retraction":null,"screen_n_in":null,"score":{"opus":0.03615549521122084,"gpt":0.3115945827025006,"spread":0.2754390874912797,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006674895,0.0001420095,0.0005033271,0.0006201662,0.00002324347,0.00002196288,0.0004787766,0.00007005351,0.0001976862],"category_scores_gemma":[0.0005380929,0.0001137922,0.0003707403,0.000344505,0.0001186365,0.0001609027,0.00007820943,0.0001663709,0.00001176864],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00009240115,"about_ca_system_score_gemma":0.0001748037,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000005758785,"about_ca_topic_score_gemma":0.000001448011,"domain_scores_codex":[0.9975848,0.00003605519,0.001324543,0.00009356711,0.0008357338,0.0001253493],"domain_scores_gemma":[0.996174,0.0007756147,0.001505339,0.0002067031,0.001262678,0.00007566169],"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.0003288107,0.003592513,0.002064107,0.0006103155,0.004516491,0.0001116463,0.004023771,0.02143354,0.001074279,0.9457601,0.008108283,0.008376142],"study_design_scores_gemma":[0.003270112,0.0008451557,0.0005134117,0.0008623248,0.0005883091,0.0006254506,0.001262199,0.01181414,0.007974451,0.9701865,0.001761666,0.0002963203],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2167276,0.00005084467,0.78127,0.0002987573,0.0008240552,0.00005889465,0.00001068276,0.00001064849,0.0007484836],"genre_scores_gemma":[0.9133469,0.00002473235,0.0857366,0.00004399074,0.00044058,8.416627e-7,0.00000223561,0.00001687374,0.0003872703],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.6966193,"threshold_uncertainty_score":0.464031,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2038152738","doi":"10.1080/00207160.2011.584973","title":"A Bessel polynomial approach for solving general linear Fredholm integro-differential–difference equations","year":2011,"lang":"en","type":"article","venue":"International Journal of Computer Mathematics","topic":"Fractional Differential Equations Solutions","field":"Mathematics","cited_by":24,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":false,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"","funders":"University of Windsor","keywords":"Mathematics; Bessel function; Bessel polynomials; Algebraic equation; Mathematical analysis; Collocation method; Fredholm integral equation; Matrix (chemical analysis); Differential equation; Polynomial; Collocation (remote sensing); Integral equation; Classical orthogonal polynomials; Orthogonal polynomials; Nonlinear system; Ordinary differential equation; Gegenbauer polynomials","retraction":null,"screen_n_in":null,"score":{"opus":0.1285900337476875,"gpt":0.3370790504074543,"spread":0.2084890166597668,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0004697822,0.0003117062,0.0005236269,0.0005485863,0.0001647873,0.0001333051,0.001092905,0.0001546172,0.0001338858],"category_scores_gemma":[0.0007678227,0.0002745519,0.0005062121,0.0001553479,0.0001091731,0.0003835504,0.0001871642,0.0003919555,0.00001051782],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002123056,"about_ca_system_score_gemma":0.0002413891,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001967201,"about_ca_topic_score_gemma":0.00000785765,"domain_scores_codex":[0.9971078,0.0000649722,0.001420817,0.0002414909,0.0008595573,0.0003053572],"domain_scores_gemma":[0.9955137,0.00104925,0.001196554,0.0003088694,0.001774178,0.0001574996],"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.000296219,0.006532387,0.0001607589,0.0002431833,0.00248407,0.00002336601,0.009053688,0.001310445,0.006141778,0.953418,0.01089028,0.00944579],"study_design_scores_gemma":[0.002118074,0.0003187958,0.0006892488,0.0002786663,0.0003848812,0.0002913352,0.0002965845,0.7549192,0.002155879,0.2377735,0.0002922313,0.0004816199],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.06193218,0.00002364155,0.9345868,0.0001686804,0.00204444,0.0003491557,0.00006654689,0.00006026684,0.0007683072],"genre_scores_gemma":[0.3691657,0.000008594322,0.6288666,0.00005499958,0.001499889,0.00002990216,0.00003241433,0.00004215548,0.0002997362],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.7536087,"threshold_uncertainty_score":0.9999707,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1984724866","doi":"10.1080/00207160.2013.867021","title":"Analysis of queueing-time distributions for MAP/D<sub><i>N</i></sub>/1 queue","year":2014,"lang":"en","type":"article","venue":"International Journal of Computer Mathematics","topic":"Advanced Queuing Theory Analysis","field":"Business, Management and Accounting","cited_by":22,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"Royal Military College of Canada","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Queueing theory; Computer science; Markovian arrival process; Queue; Transmission (telecommunications); Probability-generating function; Layered queueing network; Mean value analysis; Bulk queue; Markov process; Real-time computing; Variable (mathematics); Algorithm; Mathematics; Applied mathematics; Random variable; Computer network; Statistics; Telecommunications; Mathematical analysis","retraction":null,"screen_n_in":null,"score":{"opus":0.008874086341083479,"gpt":0.2432223164166641,"spread":0.2343482300755806,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009248639,0.0001516673,0.0005183844,0.0008630953,0.00005743179,0.0001415123,0.0006481195,0.00004857402,0.00004287076],"category_scores_gemma":[0.0003198791,0.0001356471,0.0005796265,0.0004757068,0.00005831317,0.0005697827,0.0001345697,0.0001026943,0.00002715801],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00005209394,"about_ca_system_score_gemma":0.00001863817,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0000033003,"about_ca_topic_score_gemma":0.000005682663,"domain_scores_codex":[0.9983668,0.0000193101,0.0008762751,0.0001278701,0.0004664237,0.0001432968],"domain_scores_gemma":[0.9962296,0.0004941844,0.001548735,0.0002008202,0.001507423,0.00001921847],"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.0002380256,0.001367399,0.00136136,0.0004486447,0.01464064,0.00002337413,0.0004431243,0.1935806,0.01875884,0.7303058,0.007452988,0.03137922],"study_design_scores_gemma":[0.0005932295,0.0000328139,0.0003110108,0.0001965263,0.002138003,0.00001038734,0.00002760491,0.8563226,0.002854903,0.1310419,0.006263753,0.0002072877],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.164149,0.00001197504,0.8345017,0.000637506,0.0004063172,0.00006638197,0.00001870756,0.00002186053,0.0001865112],"genre_scores_gemma":[0.9641907,0.000004399329,0.03369647,0.0003851933,0.001601023,0.000003838456,0.00006843993,0.00002321511,0.00002678327],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.8008053,"threshold_uncertainty_score":0.5531528,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2055755790","doi":"10.1080/00207160.2010.521550","title":"A full discrete two-grid finite-volume method for a nonlinear parabolic problem","year":2011,"lang":"en","type":"article","venue":"International Journal of Computer Mathematics","topic":"Advanced Numerical Methods in Computational Mathematics","field":"Engineering","cited_by":18,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Calgary","funders":"","keywords":"Mathematics; Finite volume method; Nonlinear system; Parabolic partial differential equation; Norm (philosophy); Finite volume method for one-dimensional steady state diffusion; Grid; Mathematical analysis; Applied mathematics; Partial differential equation; Geometry; Numerical partial differential equations; Mechanics; Physics","retraction":null,"screen_n_in":null,"score":{"opus":0.03777899872686231,"gpt":0.3398450795350296,"spread":0.3020660808081673,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006595954,0.0002511946,0.0004861965,0.0002444499,0.0000330678,0.00006397114,0.0007826199,0.000066188,0.00004971955],"category_scores_gemma":[0.00023862,0.0002188342,0.0002775287,0.0001432217,0.00004336957,0.0002723118,0.00009658031,0.0002659235,0.00002194323],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00008860196,"about_ca_system_score_gemma":0.00004086808,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":5.088564e-7,"about_ca_topic_score_gemma":3.072087e-7,"domain_scores_codex":[0.997922,0.00005261604,0.001116625,0.0001382785,0.0005351338,0.0002353463],"domain_scores_gemma":[0.9970443,0.001365797,0.0005253112,0.0001814275,0.0007561406,0.0001270537],"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.0002916221,0.0009046408,0.00004759039,0.0007936514,0.001923963,0.0001267012,0.008464584,0.8164737,0.0007389904,0.05336671,0.003096946,0.1137709],"study_design_scores_gemma":[0.0006591444,0.0002078903,0.00000940129,0.0001909381,0.00004953065,0.0003326214,0.00003485581,0.7735655,0.0005809015,0.2204036,0.003772011,0.0001936624],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.001038161,0.00007207922,0.9959743,0.0001108184,0.001847444,0.0002404859,0.00004920676,0.00009475517,0.0005727574],"genre_scores_gemma":[0.003253626,0.00002320336,0.9951282,0.0001116535,0.001357428,0.00001999106,0.000006821029,0.00006979959,0.00002925141],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.1670369,"threshold_uncertainty_score":0.8923802,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2017662701","doi":"10.1080/00207160212122","title":"An Efficient Method for Second Order Boundary Value Problems with Two Point Boundary Conditions","year":2002,"lang":"en","type":"article","venue":"International Journal of Computer Mathematics","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":18,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of New Brunswick","funders":"","keywords":"Mathematics; Boundary value problem; Mathematical analysis; Perturbation (astronomy); Applied mathematics; Singular boundary method; Order (exchange); Coefficient matrix; Mixed boundary condition; Finite element method; Boundary element method; Eigenvalues and eigenvectors","retraction":null,"screen_n_in":null,"score":{"opus":0.01637678035827442,"gpt":0.2998546005393218,"spread":0.2834778201810474,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009942338,0.0002034672,0.0003154755,0.0002828059,0.0001654599,0.0006920615,0.001501486,0.00004435002,0.0001895278],"category_scores_gemma":[0.00002695103,0.0001555331,0.0001544215,0.0001860164,0.00008273766,0.0006955591,0.0001243381,0.0002236253,0.00001602797],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00007952985,"about_ca_system_score_gemma":0.0001162491,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":9.428175e-7,"about_ca_topic_score_gemma":0.000001385835,"domain_scores_codex":[0.9980531,0.0001097883,0.000699119,0.000227251,0.0006815186,0.0002292281],"domain_scores_gemma":[0.9973301,0.0004451482,0.0006377782,0.0003366095,0.00109732,0.0001529908],"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.00005209176,0.002863769,0.00001868697,0.0001893293,0.0007768458,0.0002419824,0.008663213,0.1576481,0.0006240286,0.7947468,0.006601236,0.02757396],"study_design_scores_gemma":[0.001397384,0.0005029781,0.00001486513,0.0001661545,0.0000271031,0.002226814,0.00003757135,0.8883621,0.0004919232,0.09924433,0.007331244,0.0001975619],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.007130458,0.00008614829,0.9895865,0.001180125,0.001205402,0.000245231,0.00003271836,0.00005161957,0.0004818158],"genre_scores_gemma":[0.03981387,0.000004261694,0.9587647,0.0006174735,0.0006218627,0.00001068252,0.000005788324,0.00002134672,0.0001400277],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.730714,"threshold_uncertainty_score":0.6673565,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2113758534","doi":"10.1080/00207160.2010.548519","title":"Efficient and accurate finite difference schemes for solving one-dimensional Burgers’ equation","year":2011,"lang":"en","type":"article","venue":"International Journal of Computer Mathematics","topic":"Numerical methods for differential equations","field":"Mathematics","cited_by":16,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Calgary","funders":"","keywords":"Mathematics; Burgers' equation; Richardson extrapolation; Compact finite difference; Heat equation; Finite difference method; Finite difference; Mathematical analysis; Extrapolation; Partial differential equation; Crank–Nicolson method; Boundary value problem; Nonlinear system; Dirichlet boundary condition; Applied mathematics","retraction":null,"screen_n_in":null,"score":{"opus":0.1878486685284824,"gpt":0.3620734883832482,"spread":0.1742248198547658,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007156282,0.0001795383,0.0003759588,0.0002461433,0.00007275649,0.00008386319,0.000387417,0.00006886364,0.00006142198],"category_scores_gemma":[0.001307285,0.0001502877,0.0001797771,0.00008115749,0.00007063025,0.0001089372,0.0001432853,0.0001688049,0.000004020476],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00005893664,"about_ca_system_score_gemma":0.00005134947,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000001744372,"about_ca_topic_score_gemma":5.285529e-7,"domain_scores_codex":[0.9980832,0.0000518323,0.0009100215,0.0001518211,0.0006230016,0.0001800848],"domain_scores_gemma":[0.9952557,0.002571658,0.0009569977,0.0001488549,0.0009562239,0.0001105296],"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.0004838817,0.004758854,0.0004722803,0.0006242302,0.002377762,0.00004524882,0.01594562,0.002003089,0.01023711,0.7651314,0.0004069765,0.1975136],"study_design_scores_gemma":[0.0007541699,0.0001693377,0.0004885833,0.0003745552,0.0001121509,0.00005542535,0.00005137508,0.3377031,0.002043929,0.6580192,0.00005594757,0.0001722357],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.2106863,0.00002568279,0.78814,0.0001613164,0.0007525929,0.0001646908,0.00001008354,0.00002078414,0.00003857431],"genre_scores_gemma":[0.3103293,0.000004852834,0.6893266,0.00005678811,0.0002273698,0.000006739993,0.000002184558,0.0000192465,0.00002692672],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.3357,"threshold_uncertainty_score":0.6128556,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4306943628","doi":"10.1080/00207160.2022.2137672","title":"Modified inertial extragradient methods for finding minimum-norm solution of the variational inequality problem with applications to optimal control problem","year":2022,"lang":"en","type":"article","venue":"International Journal of Computer Mathematics","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":16,"is_retracted":false,"has_abstract":true,"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":"Thailand Science Research and Innovation; University of Phayao; China Scholarship Council","keywords":"Variational inequality; Hilbert space; Mathematics; Inertial frame of reference; Lipschitz continuity; Norm (philosophy); Convergence (economics); Mathematical optimization; Optimal control; Applied mathematics; Mathematical analysis","retraction":null,"screen_n_in":null,"score":{"opus":0.03339700161161386,"gpt":0.3274912516270442,"spread":0.2940942500154303,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001582558,0.0001354732,0.0002816211,0.0003020419,0.0002063791,0.0001175888,0.001483041,0.0000293664,0.00001850501],"category_scores_gemma":[0.00005128286,0.00009784901,0.0002171919,0.0004900799,0.00002665185,0.0002737607,0.0003258694,0.0001575467,5.909704e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001969943,"about_ca_system_score_gemma":0.0002701773,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000004587405,"about_ca_topic_score_gemma":0.000001538537,"domain_scores_codex":[0.9976268,0.0001928673,0.0009553923,0.0001890132,0.0008905024,0.0001454168],"domain_scores_gemma":[0.9965641,0.0005211698,0.001232693,0.0002295885,0.001378371,0.00007406985],"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.00005829111,0.0004101755,0.00004926629,0.00001981923,0.0003065862,5.254459e-7,0.00185268,0.7039661,0.0004292979,0.2887765,0.0001949349,0.003935877],"study_design_scores_gemma":[0.001177337,0.0002277346,0.0002605143,0.00003273402,0.00006679854,0.00008402977,0.00004359668,0.9781703,0.0001716637,0.01825625,0.0013869,0.0001221102],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.001282535,0.00001172039,0.992483,0.005189962,0.0003147718,0.000593325,0.0000399149,0.00001528956,0.00006952363],"genre_scores_gemma":[0.1935475,8.421741e-7,0.8057921,0.0003193235,0.0001641021,0.0001201618,0.000008083568,0.000008247744,0.00003965309],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.2742043,"threshold_uncertainty_score":0.3990167,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2134676649","doi":"10.1080/00207160008804986","title":"A split-correct parallel algorithm for solving tridiagonal symmetric toeplitz systems","year":2000,"lang":"en","type":"article","venue":"International Journal of Computer Mathematics","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":15,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of New Brunswick","funders":"","keywords":"Tridiagonal matrix; Toeplitz matrix; Tridiagonal matrix algorithm; Mathematics; Diagonally dominant matrix; Diagonal; Linear system; Algorithm; Applied mathematics; Levinson recursion; System of linear equations; Algebra over a field; Mathematical analysis; Pure mathematics; Eigenvalues and eigenvectors; Geometry; Invertible matrix","retraction":null,"screen_n_in":null,"score":{"opus":0.01633063061697472,"gpt":0.2645873229879092,"spread":0.2482566923709345,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001243409,0.0002202146,0.0004346808,0.0004066685,0.00008448774,0.0005762106,0.002120494,0.00007487742,0.00005737525],"category_scores_gemma":[0.0000440546,0.0001844863,0.0003480525,0.0002739368,0.0000325325,0.0006737598,0.0001323594,0.0002094859,0.00004491267],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001025746,"about_ca_system_score_gemma":0.000124308,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000002631101,"about_ca_topic_score_gemma":8.131111e-8,"domain_scores_codex":[0.9975768,0.00006288513,0.001010964,0.0002262447,0.0008396985,0.0002834477],"domain_scores_gemma":[0.9974054,0.0008668869,0.000602475,0.0002814821,0.0006974833,0.000146318],"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.00002676405,0.0003927142,0.000004637732,0.00005062378,0.0003181589,0.0001125303,0.0006521107,0.005618392,0.00001932523,0.1661195,0.002837616,0.8238476],"study_design_scores_gemma":[0.001133528,0.0002282207,0.00001779362,0.0002096613,0.00002373185,0.001596403,0.00002303376,0.9360663,0.00009070662,0.04492044,0.01547669,0.0002134745],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.001738802,0.0003731714,0.9935762,0.0003440148,0.003174137,0.0002216522,0.00001922985,0.00005414842,0.0004986057],"genre_scores_gemma":[0.008324332,0.00007460954,0.9884859,0.0002207339,0.002215565,0.00001264295,0.000004367192,0.00002119961,0.000640632],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.9304479,"threshold_uncertainty_score":0.7523133,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1990598022","doi":"10.1080/00207160108805105","title":"Morphisms preserving densities","year":2001,"lang":"en","type":"article","venue":"International Journal of Computer Mathematics","topic":"semigroups and automata theory","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Western University","funders":"","keywords":"Endomorphism; Mathematics; Morphism; Monoid; Ideal (ethics); Pure mathematics; Permutation (music); Confluence; Free monoid; Algebra over a field; Discrete mathematics","retraction":null,"screen_n_in":null,"score":{"opus":0.0162750095180927,"gpt":0.2538739956881347,"spread":0.237598986170042,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004297685,0.0001077786,0.0001872957,0.000208098,0.00003378635,0.0003099592,0.002012915,0.00003370011,0.0000454449],"category_scores_gemma":[0.00003761126,0.00008750366,0.0001285146,0.0001036838,0.00002757991,0.0007550882,0.0003888577,0.0001281015,0.0000285592],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004487861,"about_ca_system_score_gemma":0.00004398006,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000001704186,"about_ca_topic_score_gemma":4.109111e-7,"domain_scores_codex":[0.9986069,0.0000323761,0.0004934399,0.00009701408,0.0006345702,0.0001357449],"domain_scores_gemma":[0.9985648,0.0002220728,0.00040865,0.0002463171,0.000490304,0.00006783061],"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.00003730413,0.0008755162,0.000970875,0.00005685032,0.0007844625,0.002865035,0.01023655,0.006098552,0.002010225,0.7952052,0.02570643,0.1551531],"study_design_scores_gemma":[0.0006695961,0.0001310217,0.0008840678,0.0003297933,0.00001504411,0.007229418,0.0001125942,0.7065001,0.001030047,0.2711819,0.01168034,0.0002361069],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.1027896,0.00009928258,0.8929126,0.001536287,0.001687773,0.0000296552,6.084913e-7,0.00004539902,0.000898795],"genre_scores_gemma":[0.4365946,0.00006670757,0.5614217,0.0007057407,0.000973171,7.908239e-7,5.650634e-7,0.00001141759,0.0002252898],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.7004015,"threshold_uncertainty_score":0.374053,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2164694224","doi":"10.1080/00207160802647365","title":"A Galerkin approach incorporating integrated radial basis function networks for the solution of 2D biharmonic equations","year":2009,"lang":"en","type":"article","venue":"International Journal of Computer Mathematics","topic":"Numerical methods in engineering","field":"Engineering","cited_by":10,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":false,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"","funders":"University of Guelph","keywords":"Biharmonic equation; Mathematics; Galerkin method; Discretization; Basis function; Mathematical analysis; Nonlinear system; Dirichlet boundary condition; Convergence (economics); Function (biology); Basis (linear algebra); Applied mathematics; Radial basis function; Boundary value problem; Geometry; Computer science","retraction":null,"screen_n_in":null,"score":{"opus":0.0312118066374505,"gpt":0.2673607938983041,"spread":0.2361489872608536,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006382476,0.0001262383,0.000226938,0.0001773803,0.00003321746,0.00005208727,0.0003719007,0.00006205821,0.000004985815],"category_scores_gemma":[0.0001449889,0.00009504009,0.0001611387,0.0001953134,0.0000252512,0.0001615652,0.00002087533,0.0002485632,5.122667e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001086378,"about_ca_system_score_gemma":0.00002391926,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":7.161179e-7,"about_ca_topic_score_gemma":1.829518e-7,"domain_scores_codex":[0.9988053,0.00003027301,0.0006786524,0.00006357572,0.0003040493,0.0001181861],"domain_scores_gemma":[0.9984078,0.0007159093,0.0003400113,0.0001095903,0.0003872229,0.00003946644],"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.00001993167,0.0000732541,0.000005720929,0.000025737,0.0002327707,8.773956e-7,0.0001948743,0.8954179,0.001500718,0.006550726,0.0003319038,0.09564561],"study_design_scores_gemma":[0.0003419965,0.0001107434,0.0001208847,0.0001181532,0.00006335994,0.00003984834,0.00003622149,0.9923288,0.0006426966,0.005992665,0.0001198437,0.00008484678],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.002126096,0.0002633386,0.9954971,0.0001291641,0.001706366,0.0001427716,0.00000413508,0.000043694,0.0000873452],"genre_scores_gemma":[0.5403988,0.000017416,0.4589701,0.00002459229,0.000566042,0.000004204676,0.00000338497,0.00001282607,0.000002645012],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.5382727,"threshold_uncertainty_score":0.3875623,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2063884065","doi":"10.1080/00207160701690425","title":"Testing the number of components of the mixture of two inverse Weibull distributions","year":2008,"lang":"en","type":"article","venue":"International Journal of Computer Mathematics","topic":"Bayesian Methods and Mixture Models","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":false,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"","funders":"Memorial University of Newfoundland","keywords":"Mathematics; Weibull distribution; Likelihood-ratio test; Statistics; Maximization; Test statistic; Statistic; Applied mathematics; Inverse; Expectation–maximization algorithm; Score test; Maximum likelihood; Statistical hypothesis testing; Mathematical optimization","retraction":null,"screen_n_in":null,"score":{"opus":0.0459856150671948,"gpt":0.3049401981709952,"spread":0.2589545831038004,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005395591,0.0001044017,0.0002784628,0.00006099559,0.0000527703,0.00001901167,0.001911022,0.00003572948,0.000006672883],"category_scores_gemma":[0.000130465,0.00005858082,0.0002212857,0.0002297704,0.0001785095,0.0001632443,0.0003745229,0.0002026519,0.000001131715],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002587015,"about_ca_system_score_gemma":0.0001010429,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001118021,"about_ca_topic_score_gemma":6.794672e-7,"domain_scores_codex":[0.9982079,0.0001219104,0.0007989156,0.0000786907,0.0006963779,0.00009624738],"domain_scores_gemma":[0.9966261,0.0005728522,0.001317804,0.0003285558,0.001116458,0.00003819064],"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.00003638877,0.001965328,0.0151716,0.0002158577,0.001092678,0.00008187293,0.0132006,0.003112977,0.02498117,0.9095169,0.00694743,0.02367719],"study_design_scores_gemma":[0.002186482,0.0001566087,0.02747175,0.00144136,0.000124516,0.005649564,0.00004637711,0.4074612,0.02532263,0.5289903,0.0008449224,0.0003042554],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.1837972,0.00002257794,0.8146189,0.0005967397,0.0006194378,0.00005745019,0.00001149099,0.000004046119,0.0002721524],"genre_scores_gemma":[0.4755492,0.000005327419,0.524278,0.00005749345,0.00009205324,3.459933e-7,4.133363e-7,0.00000350771,0.00001366478],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.4043483,"threshold_uncertainty_score":0.3551187,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2004973266","doi":"10.1080/00207160.2013.770842","title":"The extended homotopy perturbation method for the boundary layer flow due to a stretching sheet with partial slip","year":2013,"lang":"en","type":"article","venue":"International Journal of Computer Mathematics","topic":"Nanofluid Flow and Heat Transfer","field":"Engineering","cited_by":8,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Western University; Trinity Western University","funders":"","keywords":"Boundary layer; Homotopy perturbation method; Slip (aerodynamics); Homotopy analysis method; Perturbation (astronomy); Materials science; Mechanics; Homotopy; Geometry; Composite material; Mathematics; Mathematical analysis; Physics; Pure mathematics; Thermodynamics","retraction":null,"screen_n_in":null,"score":{"opus":0.01193653029787388,"gpt":0.2568941312501591,"spread":0.2449576009522852,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003998956,0.0001282688,0.0001697419,0.00006977739,0.0001120642,0.0003828035,0.0004731813,0.00003559269,0.00003283985],"category_scores_gemma":[0.00002244525,0.00006576739,0.0001155758,0.0000537829,0.00001898,0.0002092011,0.00002387441,0.0001686013,0.00001081072],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0000545524,"about_ca_system_score_gemma":0.00003807976,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000002246677,"about_ca_topic_score_gemma":0.000004835757,"domain_scores_codex":[0.9989367,0.00002336675,0.0004106627,0.00006704978,0.0004074271,0.0001548258],"domain_scores_gemma":[0.9985843,0.0007360372,0.00005663294,0.0001332967,0.0004268383,0.00006289656],"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.00024635,0.0003307576,0.00004293864,0.0001851331,0.003116852,0.00006415592,0.01751556,0.3620612,0.005017225,0.03865294,0.05257569,0.5201912],"study_design_scores_gemma":[0.0005210338,0.0001316276,0.0002041105,0.0001200268,0.00004590266,0.0002863423,0.0001060363,0.9774559,0.001551289,0.00935261,0.01011666,0.0001084829],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.02516958,0.0001204828,0.9702018,0.002877247,0.001198501,0.000311487,0.000006503051,0.00002568692,0.00008866149],"genre_scores_gemma":[0.2542823,0.00004765298,0.7431066,0.0004691931,0.001885161,0.00006299215,0.000002581173,0.00004767416,0.00009590392],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.6153947,"threshold_uncertainty_score":0.3691383,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2044454975","doi":"10.1080/00207160.2010.519384","title":"Sextic spline collocation methods for nonlinear fifth-order boundary value problems","year":2011,"lang":"en","type":"article","venue":"International Journal of Computer Mathematics","topic":"Fractional Differential Equations Solutions","field":"Mathematics","cited_by":8,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Saint Paul University","funders":"","keywords":"Mathematics; Spline (mechanical); Boundary value problem; Thin plate spline; Hermite spline; Applied mathematics; Smoothing spline; Collocation (remote sensing); Nonlinear system; Convergence (economics); Spline interpolation; M-spline; Mathematical analysis; Computer science","retraction":null,"screen_n_in":null,"score":{"opus":0.1140108873208979,"gpt":0.4097421885001198,"spread":0.2957313011792219,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001179889,0.0002175398,0.0003997135,0.0003831644,0.0001185506,0.0001124131,0.0006726164,0.0001104311,0.0001681659],"category_scores_gemma":[0.0009473652,0.0001936513,0.0002844109,0.0002031588,0.00008475211,0.0003957574,0.0001060656,0.0002440141,0.0000199536],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001972936,"about_ca_system_score_gemma":0.0002793045,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000005286703,"about_ca_topic_score_gemma":0.000004778296,"domain_scores_codex":[0.9976459,0.0001139555,0.001289368,0.0001672061,0.0005809105,0.0002026313],"domain_scores_gemma":[0.9944436,0.001348839,0.001137294,0.0002496372,0.002716611,0.0001040418],"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.0002607002,0.006816803,0.00008327619,0.0006017206,0.00305849,0.00002256925,0.01421004,0.002906966,0.002045858,0.9067901,0.009058385,0.05414503],"study_design_scores_gemma":[0.001117521,0.0002554545,0.0001384344,0.0002790053,0.0002140616,0.0003102331,0.0000964424,0.3350025,0.0007094692,0.6507862,0.01086924,0.0002214047],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.007692785,0.00006972592,0.9884148,0.0005672985,0.00232505,0.0004318748,0.00003852679,0.00004539314,0.0004145007],"genre_scores_gemma":[0.01033654,0.00002296205,0.9882328,0.0001345949,0.0009253357,0.00003045387,0.00002969657,0.00004805882,0.0002395711],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.3320956,"threshold_uncertainty_score":0.7896871,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2898766459","doi":"10.1080/00207160.2018.1542133","title":"A second-order box solver for nonlinear delayed convection-diffusion equations with Neumann boundary conditions","year":2018,"lang":"en","type":"article","venue":"International Journal of Computer Mathematics","topic":"Differential Equations and Numerical Methods","field":"Mathematics","cited_by":7,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"York University","funders":"Natural Sciences and Engineering Research Council of Canada; Education Department of Jiangxi Province; National Natural Science Foundation of China","keywords":"Mathematics; Solver; Neumann boundary condition; Nonlinear system; Extrapolation; Norm (philosophy); Applied mathematics; Boundary value problem; Neumann series; Mathematical analysis; Rate of convergence; Von Neumann architecture; Boundary (topology); Convergence (economics); Von Neumann stability analysis; Mathematical optimization; Computer science","retraction":null,"screen_n_in":null,"score":{"opus":0.0416119706775501,"gpt":0.3624068748213308,"spread":0.3207949041437808,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004943878,0.0002054279,0.0003827451,0.0002966091,0.0002102532,0.0002082562,0.000437804,0.00008492012,0.000663317],"category_scores_gemma":[0.000392299,0.0001573692,0.000205161,0.000192709,0.0001778263,0.0003203198,0.00007766137,0.0001961802,0.00002074176],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00008595966,"about_ca_system_score_gemma":0.0001927014,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000002173531,"about_ca_topic_score_gemma":0.0000226069,"domain_scores_codex":[0.9980646,0.00006619046,0.0009027114,0.0001628232,0.0006058634,0.000197862],"domain_scores_gemma":[0.9943208,0.001541866,0.0008583793,0.0002114398,0.00295017,0.0001173884],"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.001109864,0.009949935,0.0002289898,0.0004966205,0.007230543,0.00009486116,0.01208075,0.0005666384,0.007065358,0.8615794,0.061945,0.03765205],"study_design_scores_gemma":[0.004465642,0.002545716,0.0001811339,0.0005605915,0.0004413244,0.0005677974,0.0002875318,0.3311237,0.002344893,0.6255005,0.03147251,0.0005086741],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.06986168,0.00001042895,0.9269477,0.0006879661,0.001626402,0.0002736366,0.00007119478,0.00003776772,0.0004832826],"genre_scores_gemma":[0.08920921,0.000005801394,0.9082409,0.0003330932,0.001663521,0.0000203958,0.00003465883,0.00004411686,0.000448324],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.330557,"threshold_uncertainty_score":0.7262857,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2093960185","doi":"10.1080/00207160701546668","title":"New second- and fourth-order accurate numerical schemes for the nonlinear cubic Schrödinger equation","year":2007,"lang":"en","type":"article","venue":"International Journal of Computer Mathematics","topic":"Numerical methods for differential equations","field":"Mathematics","cited_by":6,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":false,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"","funders":"Ryerson University","keywords":"Mathematics; Lanczos resampling; Legendre polynomials; Nonlinear system; Nonlinear Schrödinger equation; Chebyshev polynomials; Orthogonal polynomials; Applied mathematics; Numerical analysis; Polynomial; Mathematical analysis; Schrödinger equation; Eigenvalues and eigenvectors; Physics; Quantum mechanics","retraction":null,"screen_n_in":null,"score":{"opus":0.0862737725345553,"gpt":0.3920779674893471,"spread":0.3058041949547918,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00136118,0.000189834,0.0003436923,0.000194141,0.00009480626,0.0001863364,0.0005490753,0.00008193306,0.0001378387],"category_scores_gemma":[0.001341736,0.0001283473,0.0001982336,0.0001607185,0.00005032921,0.0002770474,0.0001271396,0.000269982,0.000006828406],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00006615941,"about_ca_system_score_gemma":0.0001007292,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000002088228,"about_ca_topic_score_gemma":0.000003238709,"domain_scores_codex":[0.9979588,0.00004492593,0.0009983757,0.0001371881,0.0006443934,0.0002162917],"domain_scores_gemma":[0.9929538,0.004858455,0.0008989702,0.0001813489,0.0009692182,0.0001381489],"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.0003493878,0.001048855,0.000202391,0.0002551751,0.002381427,0.00003632952,0.005146279,0.0004726237,0.002523711,0.2785263,0.005534586,0.7035229],"study_design_scores_gemma":[0.001887394,0.0003048044,0.0002156737,0.0002452419,0.0002502827,0.0003740218,0.0001839628,0.2626873,0.003169625,0.7145479,0.01583786,0.0002958941],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0186272,0.00008066069,0.9780531,0.001519546,0.001372016,0.0002602617,0.000007196312,0.00002415549,0.00005586552],"genre_scores_gemma":[0.01806837,0.00001661709,0.9799198,0.0001521176,0.001611167,0.000003537372,0.000002616162,0.00003438815,0.0001914042],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.703227,"threshold_uncertainty_score":0.5233852,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2096541859","doi":"10.1080/00207160.2011.606905","title":"The extended homotopy perturbation method and boundary layer flow due to condensation and natural convection on a porous vertical plate","year":2011,"lang":"en","type":"article","venue":"International Journal of Computer Mathematics","topic":"Fractional Differential Equations Solutions","field":"Mathematics","cited_by":5,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Trinity Western University; Western University","funders":"United Arab Emirates University","keywords":"Mathematics; Boundary layer; Homotopy analysis method; Homotopy perturbation method; Perturbation (astronomy); Porous medium; Porosity; Natural convection; Mechanics; Mathematical analysis; Geometry; Homotopy; Convection; Materials science; Physics; Composite material; Pure mathematics","retraction":null,"screen_n_in":null,"score":{"opus":0.05162499091816072,"gpt":0.3329235075926743,"spread":0.2812985166745136,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00063359,0.0001657271,0.0002386221,0.0002288656,0.000208464,0.0002044338,0.0002215094,0.00007343989,0.00002987645],"category_scores_gemma":[0.0006089028,0.0001198397,0.00008343993,0.00008436915,0.00008270192,0.0002848966,0.00008676705,0.0002895127,0.00001085968],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001345292,"about_ca_system_score_gemma":0.00006166912,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000004601339,"about_ca_topic_score_gemma":0.0000136587,"domain_scores_codex":[0.9983247,0.0001255365,0.0006388137,0.0001501572,0.0006174295,0.0001433974],"domain_scores_gemma":[0.9972803,0.001429135,0.000303146,0.0001445191,0.0007412367,0.0001016501],"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.0007132242,0.001004202,0.00006256987,0.0000668796,0.001051452,0.00009735362,0.01115567,0.0002396233,0.001891418,0.9095982,0.002035719,0.0720837],"study_design_scores_gemma":[0.001039334,0.0004309441,0.008087712,0.0001991486,0.0001256177,0.002154717,0.0003039522,0.2133184,0.00136829,0.7723927,0.0003633757,0.0002158092],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2563407,0.00004603769,0.7402261,0.00150476,0.001419836,0.0002187378,0.000006445914,0.00002543259,0.000211968],"genre_scores_gemma":[0.708163,0.00002281058,0.2910746,0.0002476983,0.0003404406,0.000009295129,0.000003417121,0.00002052923,0.0001182385],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.4518223,"threshold_uncertainty_score":0.488692,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2091011159","doi":"10.1080/0020716031000148205","title":"Language equations for timed alternating finite automata","year":2003,"lang":"en","type":"article","venue":"International Journal of Computer Mathematics","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Lethbridge","funders":"","keywords":"Computation; Computer science; Automaton; Finite-state machine; Timed automaton; Deterministic automaton; ω-automaton; Set (abstract data type); Quantum finite automata; Asynchronous communication; Theoretical computer science; Automata theory; Algorithm; Algebra over a field; Mathematics; Programming language; Pure mathematics","retraction":null,"screen_n_in":null,"score":{"opus":0.04358645793215987,"gpt":0.3512650919097619,"spread":0.307678633977602,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001321775,0.0001183932,0.000192007,0.0002533603,0.00005358785,0.0002486969,0.001469346,0.00004310396,0.00001363284],"category_scores_gemma":[0.001158541,0.0001059308,0.0001459845,0.0001350767,0.0000229925,0.000661932,0.0001040901,0.0001275665,0.00001815603],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00007976967,"about_ca_system_score_gemma":0.00009490581,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":6.514665e-7,"about_ca_topic_score_gemma":2.360215e-7,"domain_scores_codex":[0.9983478,0.0000800269,0.0007099731,0.0001272797,0.0005832001,0.0001517229],"domain_scores_gemma":[0.9971951,0.0009302783,0.0007805293,0.0003005266,0.0007262444,0.00006735769],"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.000007265244,0.000285259,0.00002221368,0.00003779614,0.0001852879,0.00002499813,0.00404605,0.008274942,0.0007370162,0.9345735,0.0006777626,0.05112792],"study_design_scores_gemma":[0.0007060603,0.0001058991,0.00003684429,0.0001031924,0.00001289366,0.0002153226,0.00004473512,0.956172,0.00472786,0.03516522,0.002584558,0.0001253675],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.003395343,0.00003776534,0.9929966,0.0003343566,0.002268714,0.000129821,0.000004929032,0.00004877618,0.0007836993],"genre_scores_gemma":[0.08446603,0.000006226343,0.9149326,0.0001907334,0.0003052462,0.000006224799,0.000002211835,0.00001185728,0.00007886937],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.9478971,"threshold_uncertainty_score":0.4319734,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1992893569","doi":"10.1080/00207160.2012.681305","title":"Composition and orbits of language operations: finiteness and upper bounds","year":2012,"lang":"en","type":"article","venue":"International Journal of Computer Mathematics","topic":"semigroups and automata theory","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Manitoba; University of Waterloo","funders":"","keywords":"Closure (psychology); Mathematics; Complement (music); Suffix; Prefix; Equivalence (formal languages); Regular language; Natural number; Bounded function; Discrete mathematics; Set (abstract data type); Monoid; Equivalence relation; Combinatorics; Computer science; Linguistics; Automaton","retraction":null,"screen_n_in":null,"score":{"opus":0.0109472149380337,"gpt":0.2687221071613251,"spread":0.2577748922232914,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003640124,0.00007439618,0.0001541784,0.0001420967,0.00002808427,0.0001356025,0.0003437515,0.0000276399,0.00000721897],"category_scores_gemma":[0.00001735846,0.00005905944,0.00003768267,0.00005309691,0.00004046059,0.0007183312,0.0001714606,0.00006852906,0.000001698988],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001385518,"about_ca_system_score_gemma":0.00001783934,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000001816452,"about_ca_topic_score_gemma":1.885328e-7,"domain_scores_codex":[0.999214,0.00003188475,0.0003450048,0.00005747976,0.0002702536,0.00008138399],"domain_scores_gemma":[0.9992705,0.0001660384,0.0001897022,0.0001000838,0.0002154226,0.00005825454],"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.0000247839,0.001022232,0.00372371,0.0001803784,0.0004348883,0.00005391492,0.03854279,0.0005492991,0.01346781,0.8145592,0.0004386663,0.1270023],"study_design_scores_gemma":[0.003415492,0.0005074892,0.03550458,0.001750853,0.0001162,0.009680589,0.001230377,0.8735586,0.01965506,0.05251075,0.001316112,0.0007539392],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.51005,0.0003864779,0.4888718,0.0002400832,0.0003511762,0.0000233191,0.000002101036,0.000007242808,0.00006784766],"genre_scores_gemma":[0.7586887,0.00006167623,0.240886,0.0001537907,0.0001960254,4.933526e-7,9.425427e-7,0.000003910923,0.000008394399],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.8730093,"threshold_uncertainty_score":0.2408374,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2145436131","doi":"10.1080/00207160.2012.704994","title":"Undecidability of state complexity","year":2012,"lang":"en","type":"article","venue":"International Journal of Computer Mathematics","topic":"semigroups and automata theory","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Western University; Queen's University","funders":"","keywords":"Undecidable problem; Alphabet; Mathematics; State (computer science); Regular language; Computational complexity theory; Discrete mathematics; Algebra over a field; Automaton; Algorithm; Theoretical computer science; Pure mathematics; Computer science; Decidability; Linguistics","retraction":null,"screen_n_in":null,"score":{"opus":0.0382326455436364,"gpt":0.2957965192233195,"spread":0.2575638736796831,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001029219,0.0000993885,0.0002529105,0.0001450544,0.00001830834,0.00006893539,0.001478682,0.00002613587,0.00003011842],"category_scores_gemma":[0.00005196397,0.00007827578,0.0001516346,0.0001030661,0.00007852566,0.0007039355,0.0003209211,0.0001171667,0.00001214596],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00005616864,"about_ca_system_score_gemma":0.00004962558,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00000204464,"about_ca_topic_score_gemma":3.228089e-7,"domain_scores_codex":[0.9983701,0.00006000447,0.0007013494,0.00007160889,0.0006447987,0.0001521761],"domain_scores_gemma":[0.9980602,0.0003236396,0.0007223071,0.0002634074,0.0005342248,0.00009620008],"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.00002902962,0.002155813,0.00460815,0.0001007758,0.0004818684,0.00003031872,0.008673404,0.0006202805,0.001316927,0.8986878,0.002198707,0.08109697],"study_design_scores_gemma":[0.001130059,0.000242542,0.02499169,0.0002976979,0.00002516084,0.001037357,0.00009402782,0.1445225,0.01095439,0.8138855,0.002505943,0.0003131395],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2217158,0.00006092924,0.7762326,0.000293973,0.001362596,0.00003635211,0.000003687817,0.0000168551,0.0002772007],"genre_scores_gemma":[0.6349,0.000006462662,0.3647624,0.0001002384,0.0002162829,2.806556e-7,3.689942e-7,0.000004107911,0.000009805945],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.4131843,"threshold_uncertainty_score":0.3191994,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2155951397","doi":"10.1080/00207160108805067","title":"A parallel numerical algorithm for fredholm integro-differential two-point boundary value problems","year":2001,"lang":"en","type":"article","venue":"International Journal of Computer Mathematics","topic":"Differential Equations and Numerical Methods","field":"Mathematics","cited_by":4,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of New Brunswick","funders":"","keywords":"Mathematics; Boundary value problem; Nonlinear system; Fredholm theory; Fredholm integral equation; Differential equation; Numerical analysis; Mathematical analysis; Algorithm; Integral equation","retraction":null,"screen_n_in":null,"score":{"opus":0.05419527125526193,"gpt":0.3645561615159993,"spread":0.3103608902607374,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008011231,0.0003147192,0.0007080645,0.0003053134,0.00009519389,0.0003043191,0.000928216,0.0001064565,0.0002357569],"category_scores_gemma":[0.0003552283,0.0002451713,0.0005746435,0.0001618278,0.00008618192,0.0003119391,0.0001825683,0.000369781,0.00001460398],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001472173,"about_ca_system_score_gemma":0.0001206385,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000007011715,"about_ca_topic_score_gemma":0.000001118883,"domain_scores_codex":[0.9968613,0.0001387337,0.001495794,0.0002271746,0.000952944,0.0003240134],"domain_scores_gemma":[0.9961101,0.001339262,0.001062583,0.0002606771,0.001034358,0.0001930518],"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.0002334833,0.005113267,0.00005610457,0.0001984397,0.002189964,0.0001614772,0.002759933,0.001130497,0.000609018,0.2884839,0.01071915,0.6883447],"study_design_scores_gemma":[0.002121564,0.0004005053,0.00003101542,0.0002821465,0.0001321786,0.0007079744,0.00006120939,0.4236001,0.0001444909,0.566513,0.005776198,0.0002295963],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.007281522,0.00005464302,0.9884325,0.0008294104,0.002587125,0.0003643349,0.00002634609,0.00005371124,0.000370464],"genre_scores_gemma":[0.022457,0.00004322383,0.9750391,0.0001801896,0.001995506,0.00002682019,0.00001303486,0.00005846324,0.0001866944],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.6881151,"threshold_uncertainty_score":0.9997795,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2050600071","doi":"10.1080/00207160903023565","title":"CsegGraph: a graph colouring instance generator","year":2009,"lang":"en","type":"article","venue":"International Journal of Computer Mathematics","topic":"Scheduling and Timetabling Solutions","field":"Decision Sciences","cited_by":4,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Lethbridge","funders":"","keywords":"Mathematics; Combinatorics; Block graph; Partition (number theory); Frequency partition of a graph; Graph partition; Graph; Discrete mathematics; Petersen graph; Butterfly graph; Line graph; Graph power; Voltage graph; Pathwidth","retraction":null,"screen_n_in":null,"score":{"opus":0.08652782290873272,"gpt":0.3839386795999732,"spread":0.2974108566912405,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001894731,0.0001146285,0.0002880486,0.000651905,0.00007557114,0.0004210133,0.00135524,0.00004749988,0.0000602321],"category_scores_gemma":[0.0007348604,0.00008380541,0.0002732702,0.0004295091,0.00004340091,0.0003448433,0.00005697793,0.0001990849,0.00005261307],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0000414156,"about_ca_system_score_gemma":0.00009829578,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":5.569103e-7,"about_ca_topic_score_gemma":9.025069e-7,"domain_scores_codex":[0.9968409,0.00005954896,0.001056728,0.0001406186,0.001742605,0.000159621],"domain_scores_gemma":[0.9965574,0.0005640552,0.0008402707,0.0002360675,0.001685083,0.0001171423],"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.0002511294,0.003769745,0.004909242,0.00001743137,0.001456218,0.0009487429,0.009989869,0.09105106,0.005510128,0.4639473,0.09812565,0.3200234],"study_design_scores_gemma":[0.001600757,0.0003790604,0.006464391,0.0002996659,0.00005488846,0.001333582,0.0002255802,0.09784247,0.001711978,0.873055,0.0166925,0.0003401295],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3306374,0.0001881772,0.6639196,0.002477325,0.002027988,0.000038329,0.00000397799,0.00002041222,0.0006867968],"genre_scores_gemma":[0.6993208,0.00002349075,0.2992027,0.0005922838,0.0007484897,3.525298e-7,4.006479e-7,0.000005273936,0.0001061581],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.4091077,"threshold_uncertainty_score":0.4059841,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2049175577","doi":"10.1080/00207160701623046","title":"A note on the lower bound of edge guards of polyhedral terrains","year":2008,"lang":"en","type":"article","venue":"International Journal of Computer Mathematics","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"Carleton University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Combinatorics; Upper and lower bounds; Constructive proof; Mathematics; Vertex (graph theory); Enhanced Data Rates for GSM Evolution; Terrain; Guard (computer science); Discrete mathematics; Graph; Computer science; Mathematical analysis","retraction":null,"screen_n_in":null,"score":{"opus":0.02967696798934623,"gpt":0.2863352492231511,"spread":0.2566582812338049,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004606502,0.0001164879,0.0002401263,0.0002852557,0.00005085779,0.00004662791,0.001250608,0.00003898986,0.0000224991],"category_scores_gemma":[0.00009598132,0.0000801232,0.0002132601,0.0002150966,0.00009858347,0.0002687311,0.0001681534,0.000147322,0.000006784965],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004356365,"about_ca_system_score_gemma":0.0002053273,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000001977246,"about_ca_topic_score_gemma":5.790898e-7,"domain_scores_codex":[0.9980085,0.00005491356,0.0007538976,0.000100873,0.0009801217,0.0001017029],"domain_scores_gemma":[0.9974733,0.000501436,0.0008192396,0.0002405691,0.0009197767,0.00004568511],"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.0002457942,0.005499015,0.0003924381,0.000119334,0.001162768,0.0003762998,0.02375254,0.04886752,0.01443275,0.804193,0.02074509,0.08021341],"study_design_scores_gemma":[0.003066932,0.003094982,0.01419956,0.001051734,0.00006619673,0.005359491,0.0001094991,0.7929757,0.04923977,0.1226877,0.007533592,0.0006148955],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3047951,0.00002986048,0.6920475,0.001359575,0.001274558,0.00005431609,0.000003903366,0.000006575083,0.000428625],"genre_scores_gemma":[0.857263,0.00001630406,0.1418886,0.000321835,0.0004399582,7.79192e-7,0.000001036912,0.000005900932,0.00006257141],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.7441081,"threshold_uncertainty_score":0.3267329,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2008315247","doi":"10.1080/00207160212120","title":"Removal of Contrived Chaos in Finite-difference Methods","year":2002,"lang":"en","type":"article","venue":"International Journal of Computer Mathematics","topic":"Mathematical and Theoretical Epidemiology and Ecology Models","field":"Medicine","cited_by":3,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Manitoba","funders":"","keywords":"Mathematics; CHAOS (operating system); Runge–Kutta methods; Integrator; Applied mathematics; Initial value problem; Numerical analysis; Finite difference method; Numerical methods for ordinary differential equations; Numerical integration; Finite difference; Mathematical analysis; Differential equation; Ordinary differential equation; Computer science","retraction":null,"screen_n_in":null,"score":{"opus":0.06853121547310442,"gpt":0.3694951497026031,"spread":0.3009639342294987,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009977226,0.00009631915,0.0006058085,0.0001849466,0.000009057486,0.000005080866,0.0002377452,0.0001047256,0.000517825],"category_scores_gemma":[0.001193033,0.00006637897,0.0001669822,0.00006353301,0.000140681,0.00004004702,0.00005635292,0.0002622465,0.00001308819],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002497945,"about_ca_system_score_gemma":0.000018156,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":6.670217e-7,"about_ca_topic_score_gemma":1.897986e-7,"domain_scores_codex":[0.9985059,0.000116204,0.0009569938,0.00007709277,0.0002205692,0.0001232394],"domain_scores_gemma":[0.996913,0.002144103,0.0004276606,0.0001069739,0.0003303967,0.00007792538],"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.0003413927,0.002966687,0.0009488089,0.00031408,0.0007613419,0.001572796,0.00283423,0.0006425047,0.001549668,0.9337854,0.0003691073,0.05391392],"study_design_scores_gemma":[0.001902585,0.0003688002,0.0009661568,0.0005853464,0.00006260118,0.003255559,0.00002754406,0.6794358,0.0006918902,0.312367,0.0002547292,0.00008192713],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.162922,0.0001562027,0.8314142,0.002082384,0.0003445713,0.00007977107,0.00000155074,0.000005660701,0.002993737],"genre_scores_gemma":[0.6392148,0.00007949609,0.3599533,0.0004511568,0.0001447811,0.000001063819,5.358426e-7,0.000005524968,0.0001493417],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.6787933,"threshold_uncertainty_score":0.5669821,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4405575790","doi":"10.1080/00207160.2024.2443498","title":"Linear anchored Gaussian mixture model for location and width computations of objects in thick line shape","year":2024,"lang":"en","type":"article","venue":"International Journal of Computer Mathematics","topic":"Bayesian Methods and Mixture Models","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Université de Sherbrooke","funders":"","keywords":"Computation; Mathematics; Gaussian; Line (geometry); Line width; Line segment; Algorithm; Geometry; Mathematical analysis; Physics; Optics","retraction":null,"screen_n_in":null,"score":{"opus":0.02885945332940998,"gpt":0.3273526727614272,"spread":0.2984932194320172,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006641696,0.0001271088,0.0002706014,0.000386718,0.00002018414,0.0001432724,0.0005724404,0.00007452739,0.000001363318],"category_scores_gemma":[0.00005806841,0.0001037172,0.0000992508,0.0002201431,0.0000345834,0.0004209381,0.0001063035,0.0001936401,6.359026e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004068457,"about_ca_system_score_gemma":0.0001743607,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":9.660687e-7,"about_ca_topic_score_gemma":0.000002758048,"domain_scores_codex":[0.9986493,0.00003947044,0.0006835202,0.0001622756,0.0003528314,0.0001126299],"domain_scores_gemma":[0.9985116,0.0003794117,0.0002925783,0.000134046,0.0006213754,0.0000610143],"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.00003722917,0.0004368969,0.00002327319,0.000747172,0.000287931,0.00006417651,0.01789486,0.0926382,0.0007411371,0.6212336,0.0008901485,0.2650054],"study_design_scores_gemma":[0.0003115901,0.00007958271,0.00004510001,0.0005921074,0.00001278146,0.0001289416,0.000007829898,0.7516733,0.0002060575,0.2468338,0.00003857786,0.00007038126],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.00346117,0.000438892,0.9934183,0.001805518,0.0006574076,0.0001443719,0.000008619065,0.00002018223,0.00004550511],"genre_scores_gemma":[0.3456922,0.00004535465,0.6539015,0.0001218609,0.0002070327,0.000002128508,0.000002128467,0.000008580101,0.00001924745],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.6590351,"threshold_uncertainty_score":0.4229464,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1976814637","doi":"10.1080/00207160.2012.655690","title":"Improved asymptotical stability criteria for static recurrent neural networks","year":2012,"lang":"en","type":"article","venue":"International Journal of Computer Mathematics","topic":"Neural Networks Stability and Synchronization","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Guelph","funders":"","keywords":"Artificial neural network; Mathematics; Stability (learning theory); Lyapunov function; Recurrent neural network; Linear matrix inequality; Control theory (sociology); Exponential stability; Work (physics); Matrix (chemical analysis); Mathematical optimization; Applied mathematics; Computer science; Nonlinear system; Artificial intelligence; Machine learning; Control (management); Engineering","retraction":null,"screen_n_in":null,"score":{"opus":0.03799118890128999,"gpt":0.3113418657063425,"spread":0.2733506768050525,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001147067,0.0001687785,0.0002913418,0.00009762273,0.00005868133,0.0002717625,0.001083194,0.00006585359,0.00002581792],"category_scores_gemma":[0.0001696813,0.0001386086,0.0002024043,0.0001156004,0.00005084048,0.001091918,0.0002333154,0.0002155795,0.000001693868],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001343529,"about_ca_system_score_gemma":0.00004924307,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":4.860963e-7,"about_ca_topic_score_gemma":6.690314e-7,"domain_scores_codex":[0.998041,0.0001170929,0.0008953445,0.0001538738,0.0004712498,0.0003213868],"domain_scores_gemma":[0.9973609,0.0007634908,0.0005247419,0.0002618085,0.000911284,0.0001778063],"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.0005315047,0.009127853,0.00584484,0.0008222188,0.001372511,0.0000505271,0.0187305,0.05057824,0.001329086,0.3351424,0.01151002,0.5649602],"study_design_scores_gemma":[0.0005149713,0.0002426656,0.0004765744,0.00005341362,0.00001786094,0.0001514319,0.00001748093,0.9917438,0.0001504802,0.006157687,0.000337021,0.0001366319],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.03892267,0.00008766595,0.9534925,0.001297869,0.005928657,0.0002154354,0.000004986018,0.00003268046,0.00001757572],"genre_scores_gemma":[0.6945257,0.000008835848,0.3038309,0.0002388548,0.001375397,0.000004394275,0.000003564576,0.000009571143,0.000002780634],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9411655,"threshold_uncertainty_score":0.5652296,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2046275899","doi":"10.1080/00207160.2013.833611","title":"Inverse function, Taylor's expansion and extended Schröder's processes","year":2013,"lang":"en","type":"article","venue":"International Journal of Computer Mathematics","topic":"Iterative Methods for Nonlinear Equations","field":"Mathematics","cited_by":1,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"Université de Sherbrooke","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Taylor series; Inverse function; Logarithm; Inverse; Trigonometric functions; Applied mathematics; Function (biology); Inverse trigonometric functions; Trigonometry; Nonlinear system; Mathematical analysis; Geometry","retraction":null,"screen_n_in":null,"score":{"opus":0.05420179723638368,"gpt":0.3441049937811738,"spread":0.2899031965447901,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005187252,0.0001782882,0.0003031882,0.0002992726,0.00006579833,0.0002342381,0.0003528427,0.00006440164,0.0002037153],"category_scores_gemma":[0.0008523593,0.0001390108,0.00009315205,0.0001431858,0.00007754384,0.0007229232,0.0001234782,0.0002091094,0.00003927096],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00005066275,"about_ca_system_score_gemma":0.00009003417,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000002260437,"about_ca_topic_score_gemma":0.000003645566,"domain_scores_codex":[0.9982298,0.00008548181,0.0007898938,0.0001297568,0.0006261,0.0001389738],"domain_scores_gemma":[0.9957828,0.0008380564,0.0007068876,0.000159504,0.002410038,0.0001027415],"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.0002907605,0.008263225,0.002815716,0.002728719,0.005235886,0.000315832,0.04430192,0.0008091858,0.01574041,0.4320557,0.08587971,0.4015629],"study_design_scores_gemma":[0.001133084,0.000321078,0.0006749554,0.000419555,0.0001031925,0.0005527277,0.0004982018,0.03624224,0.001434735,0.9565705,0.001795931,0.0002537807],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.2003575,0.00005982275,0.7975313,0.0007566767,0.000819741,0.0001847349,0.000004102088,0.00003261094,0.0002535224],"genre_scores_gemma":[0.1125395,0.0000299286,0.8860286,0.0002754647,0.0008705714,0.00000957977,0.000003698906,0.00003320745,0.0002094624],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.5245148,"threshold_uncertainty_score":0.5668696,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4413997677","doi":"10.1080/00207160.2025.2539888","title":"Exact simulation of the 3/2 stochastic volatility model with stochastic jump intensity","year":2025,"lang":"en","type":"article","venue":"International Journal of Computer Mathematics","topic":"Stochastic processes and financial applications","field":"Economics, Econometrics and Finance","cited_by":1,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"Canadian Chiropractic Association","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Jump; Stochastic volatility; Mathematics; Applied mathematics; Stochastic modelling; Volatility (finance); SABR volatility model; Statistical physics; Econometrics; Statistics; Physics","retraction":null,"screen_n_in":null,"score":{"opus":0.02437216304418508,"gpt":0.2546094397743287,"spread":0.2302372767301436,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002721431,0.0001091758,0.0003368859,0.000187135,0.0000493192,0.00003729554,0.000566105,0.00004809406,0.000007847693],"category_scores_gemma":[0.0001940305,0.0000831291,0.0001313442,0.0002065935,0.0000805969,0.0001322347,0.0001182695,0.0001623961,0.000003455465],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00008738985,"about_ca_system_score_gemma":0.00009376906,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000006482039,"about_ca_topic_score_gemma":0.000002471175,"domain_scores_codex":[0.9988094,0.000003059281,0.0008357922,0.0001218623,0.0001363022,0.00009356959],"domain_scores_gemma":[0.9978017,0.000193988,0.001043493,0.0002150745,0.0007169503,0.00002882754],"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.00004889286,0.0001958614,0.0001875897,0.00003337142,0.0001335262,4.583666e-7,0.0004396171,0.7061455,0.000006349545,0.2921474,0.00005583669,0.0006056075],"study_design_scores_gemma":[0.0002706886,0.00002631133,0.001136007,0.000139759,0.00001702921,0.000008969209,0.00001326341,0.6680325,0.000009963169,0.3302771,0.00001850586,0.0000498777],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.03705443,0.00008110025,0.961449,0.0005306478,0.0004800346,0.0001403934,0.00003353824,0.000006695517,0.0002241144],"genre_scores_gemma":[0.9731499,0.000001384727,0.02655949,0.0001305331,0.00009774808,0.000003310215,0.000001138048,0.000007915995,0.00004857242],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9360955,"threshold_uncertainty_score":0.3389906,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2036075041","doi":"10.1080/00207160310001650035","title":"MPI-implementation of PFI-code for numerical modeling of the anatomy of breast cancer","year":2004,"lang":"en","type":"article","venue":"International Journal of Computer Mathematics","topic":"Radiomics and Machine Learning in Medical Imaging","field":"Medicine","cited_by":1,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":false,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"","funders":"McMaster University","keywords":"Breast cancer; Code (set theory); Mathematics; Computer science; Medicine; Calculus (dental); Cancer; Internal medicine; Programming language; Orthodontics","retraction":null,"screen_n_in":null,"score":{"opus":0.01791043722781813,"gpt":0.3760433536059672,"spread":0.3581329163781491,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002755577,0.00006328036,0.0002692425,0.0001005657,0.00001158585,0.000006212451,0.0002409647,0.0000226056,0.00001975721],"category_scores_gemma":[0.0000461142,0.00004160431,0.0001830613,0.00006338973,0.00004287799,0.00005499409,0.00004118075,0.0001236975,9.178507e-8],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00005923001,"about_ca_system_score_gemma":0.0001767268,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0000334147,"about_ca_topic_score_gemma":0.000001601944,"domain_scores_codex":[0.9986753,0.0000119158,0.0006987898,0.0000485182,0.0004998538,0.0000655594],"domain_scores_gemma":[0.9983087,0.00007798365,0.0007378036,0.00007897854,0.0007595874,0.00003690536],"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.000558291,0.002298448,0.02886218,0.001935897,0.003451355,0.00002986257,0.01234666,0.7654791,0.01947837,0.04727004,0.001142565,0.1171472],"study_design_scores_gemma":[0.004297289,0.0001965158,0.005579645,0.001859818,0.0002252518,0.0006114657,0.0003097069,0.966632,0.006342414,0.01371047,0.0001575334,0.00007786498],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.399009,0.00003532776,0.5971245,0.003424797,0.0002875422,0.00007955021,0.00002115152,0.00000164284,0.00001650075],"genre_scores_gemma":[0.8790931,0.00002451872,0.1205018,0.0001432816,0.0002224746,0.000001156982,0.000001503836,0.000008862366,0.000003257388],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.4800841,"threshold_uncertainty_score":0.1696575,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1973223598","doi":"10.1080/00207160701576103","title":"A parallel adaptive finite-element package based on ALBERTA","year":2008,"lang":"en","type":"article","venue":"International Journal of Computer Mathematics","topic":"Advanced Numerical Methods in Computational Mathematics","field":"Engineering","cited_by":1,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":false,"ca_fund":false,"ca_venue":false,"about_ca":true},"ca_institutions":"","funders":"","keywords":"Scalability; Finite element method; Computer science; Computational science; Parallel computing; Computation; Toolbox; Key (lock); Adaptive mesh refinement; Distributed memory; Computer engineering; Algorithm; Shared memory; Programming language; Engineering","retraction":null,"screen_n_in":null,"score":{"opus":0.03681951002409145,"gpt":0.2961535995969111,"spread":0.2593340895728196,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002097697,0.0002116204,0.0003405168,0.000240067,0.00003666555,0.00002975635,0.0005574057,0.00005212654,0.00006764914],"category_scores_gemma":[0.0002308382,0.0001827589,0.0001826486,0.0001205936,0.00005348265,0.0001417455,0.00004999131,0.0002703214,0.00005238179],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001491365,"about_ca_system_score_gemma":0.00004273703,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":4.745698e-7,"about_ca_topic_score_gemma":2.648322e-7,"domain_scores_codex":[0.9980621,0.00004153627,0.0007805707,0.0001026873,0.0008476457,0.0001654425],"domain_scores_gemma":[0.9964808,0.002503766,0.000334061,0.0001784456,0.0003999982,0.0001029885],"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.00003268545,0.0002712849,0.00002239565,0.00003117351,0.000175268,0.000130968,0.0006151967,0.9863184,0.00001767887,0.00635511,0.001493199,0.00453662],"study_design_scores_gemma":[0.0007009232,0.0002312253,0.00007475878,0.0002258234,0.00001512454,0.0002187777,0.00002093859,0.9624176,0.0002591423,0.03439766,0.001260342,0.0001776553],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.002452305,0.00002499022,0.9942493,0.0002295881,0.001126762,0.0001004063,0.000007457661,0.00004739264,0.001761794],"genre_scores_gemma":[0.1931322,0.00002195448,0.8060564,0.00029694,0.0004161962,0.000004443593,0.000002455585,0.00003607873,0.00003333416],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.1906799,"threshold_uncertainty_score":0.7452693,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2090639626","doi":"10.1080/00207160701779541","title":"On the definition of stochastic λ-transducers","year":2008,"lang":"en","type":"article","venue":"International Journal of Computer Mathematics","topic":"semigroups and automata theory","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"Saint Mary's University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Transducer; Automaton; Probabilistic logic; Computer science; Probabilistic automaton; Stochastic process; Algorithm; Mathematics; Theoretical computer science; Artificial intelligence; Acoustics; Statistics","retraction":null,"screen_n_in":null,"score":{"opus":0.03240573483781448,"gpt":0.244535145360683,"spread":0.2121294105228686,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003617277,0.00008512747,0.0001560811,0.0001418364,0.0000387195,0.00003999183,0.001290512,0.00002455778,0.00002318413],"category_scores_gemma":[0.00006100411,0.00005386114,0.0001367505,0.0000923406,0.00006585022,0.0001987645,0.00007719218,0.0001297018,0.00001464722],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000027842,"about_ca_system_score_gemma":0.0000564516,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":6.264774e-7,"about_ca_topic_score_gemma":7.357128e-8,"domain_scores_codex":[0.9987244,0.00003912671,0.0004498388,0.00006895546,0.0006363924,0.00008129662],"domain_scores_gemma":[0.9982126,0.0007634092,0.0004531533,0.0001959212,0.0003414117,0.00003351556],"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.00001182171,0.0002372259,0.000004645,0.000008026844,0.0001176127,0.00005343118,0.002608434,0.002005297,0.0002954611,0.9903802,0.001505281,0.00277252],"study_design_scores_gemma":[0.0006894433,0.0003400948,0.000371817,0.0004148436,0.00001597841,0.002237373,0.00006795652,0.1831148,0.001895542,0.8106187,0.00008227036,0.0001512405],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1560511,0.0000212631,0.8416651,0.001047268,0.0007312679,0.00003639478,0.000001785496,0.00001254634,0.0004332493],"genre_scores_gemma":[0.8707324,0.00001083366,0.1286947,0.0003987631,0.0001500818,7.000635e-7,3.605116e-7,0.000005311154,0.000006762973],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.7146814,"threshold_uncertainty_score":0.2398114,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4412779934","doi":"10.1080/00207160.2025.2540547","title":"Efficient calibration of the shifted square-root diffusion model to credit default swap spreads using asymptotic approximations","year":2025,"lang":"en","type":"article","venue":"International Journal of Computer Mathematics","topic":"Credit Risk and Financial Regulations","field":"Economics, Econometrics and Finance","cited_by":0,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Western University","funders":"","keywords":"Mathematics; Square root; Calibration; Swap (finance); Applied mathematics; Credit default swap; Diffusion; Mathematical analysis; Econometrics; Statistics; Credit risk; Economics; Geometry; Actuarial science; Physics; Finance","retraction":null,"screen_n_in":null,"score":{"opus":0.02883492706162135,"gpt":0.2649199185719709,"spread":0.2360849915103496,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003281086,0.0001099871,0.00028949,0.0004359082,0.00008121291,0.00007913401,0.0005174132,0.00006558234,0.00001476171],"category_scores_gemma":[0.000186087,0.00009449146,0.0002047408,0.0003154844,0.00004013147,0.0000998264,0.0001631442,0.0001238266,0.000003736935],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001594728,"about_ca_system_score_gemma":0.0000958466,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001692066,"about_ca_topic_score_gemma":0.000007364555,"domain_scores_codex":[0.9984781,0.00001314075,0.001092163,0.0001186109,0.0001897876,0.0001082143],"domain_scores_gemma":[0.9984486,0.0001094597,0.000823394,0.0002110161,0.0003636143,0.00004390157],"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.00001294178,0.0003054161,0.003882566,0.00002940025,0.00007078902,7.940596e-7,0.001224955,0.6819307,0.0001474592,0.3115424,0.0003807281,0.0004719138],"study_design_scores_gemma":[0.0003226715,0.00002355048,0.0146961,0.000233258,0.00001862348,0.000009525559,0.00002633859,0.9212244,0.0001388553,0.06308132,0.0001495753,0.0000757677],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.4402775,0.00003307654,0.5577611,0.0005744927,0.0009226064,0.0001066624,0.00003335865,0.000004555326,0.0002866509],"genre_scores_gemma":[0.9213582,0.000003132895,0.07824367,0.00005196352,0.0002248332,0.000002600872,0.00000316824,0.00001016921,0.0001022746],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.4810807,"threshold_uncertainty_score":0.385325,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null}]}