{"meta":{"query_hash":"9a14fe199900","filters":{"venue":"International Journal of Computer Mathematics"},"cohort_total":32,"direct_labels_cover":0,"predictions_cover":32,"exported":32,"export_cap":100000,"truncated":false,"label_status":"direct model label, unvalidated","prediction_status":"machine_predicted_unvalidated (Codex and Gemma teacher distillation)","score_status":"score_only:v0-immature-baseline","snapshot":{"source":"OpenAlex, pinned release, all 482 partitions","release":"2026-06-24","frame_built":"2026-07-12"},"permalink":"https://metacan.xera.ac/q/9a14fe199900","api":"https://metacan.xera.ac/api/v1/cohort?venue=International+Journal+of+Computer+Mathematics"},"results":[{"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,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.03681951002409145,"score_gpt":0.29615359959691107,"score_spread":0.2593340895728196,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1973223598","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.002452305,0.000024990219,0.9942493,0.00022958807,0.0011267615,0.000100406345,0.0000074576615,0.000047392637,0.0017617941],"genre_scores_gemma":[0.19313224,0.000021954482,0.8060564,0.00029693998,0.00041619624,0.000004443593,0.0000024555854,0.000036078734,0.000033334163],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99806213,0.00004153627,0.00078057067,0.00010268727,0.0008476457,0.00016544246],"domain_scores_gemma":[0.99648076,0.0025037657,0.00033406095,0.00017844558,0.00039999821,0.000102988495],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00020976966,0.00021162038,0.00034051677,0.00024006705,0.000036665555,0.000029756347,0.0005574057,0.00005212654,0.00006764914],"category_scores_gemma":[0.00023083822,0.00018275893,0.00018264855,0.000120593635,0.00005348265,0.00014174548,0.000049991308,0.00027032138,0.000052381794],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000032685446,0.0002712849,0.00002239565,0.000031173506,0.00017526797,0.00013096795,0.00061519665,0.9863184,0.000017678873,0.0063551096,0.0014931989,0.0045366203],"study_design_scores_gemma":[0.0007009232,0.00023122529,0.00007475878,0.00022582343,0.000015124544,0.00021877767,0.000020938593,0.9624176,0.00025914225,0.03439766,0.0012603423,0.00017765528],"about_ca_topic_score_codex":4.7456982e-7,"about_ca_topic_score_gemma":2.6483215e-7,"teacher_disagreement_score":0.19067994,"about_ca_system_score_codex":0.00014913654,"about_ca_system_score_gemma":0.000042737025,"threshold_uncertainty_score":0.7452693},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.03799118890128999,"score_gpt":0.31134186570634254,"score_spread":0.27335067680505254,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1976814637","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.038922668,0.00008766595,0.95349246,0.0012978687,0.0059286566,0.00021543543,0.0000049860178,0.000032680462,0.000017575723],"genre_scores_gemma":[0.6945257,0.000008835848,0.3038309,0.00023885482,0.0013753973,0.0000043942755,0.0000035645758,0.000009571143,0.0000027806336],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99804103,0.00011709285,0.0008953445,0.00015387376,0.00047124978,0.00032138682],"domain_scores_gemma":[0.9973609,0.0007634908,0.0005247419,0.0002618085,0.000911284,0.00017780627],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011470673,0.00016877847,0.00029134183,0.00009762273,0.00005868133,0.00027176255,0.0010831936,0.000065853594,0.000025817915],"category_scores_gemma":[0.00016968128,0.00013860864,0.00020240432,0.000115600415,0.000050840485,0.0010919184,0.00023331544,0.00021557952,0.0000016938683],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00053150475,0.0091278525,0.00584484,0.0008222188,0.0013725107,0.0000505271,0.018730499,0.050578244,0.0013290861,0.33514243,0.011510015,0.56496024],"study_design_scores_gemma":[0.0005149713,0.00024266564,0.00047657435,0.000053413616,0.000017860944,0.00015143194,0.00001748093,0.9917438,0.00015048018,0.0061576874,0.00033702096,0.00013663188],"about_ca_topic_score_codex":4.860963e-7,"about_ca_topic_score_gemma":6.6903135e-7,"teacher_disagreement_score":0.9411655,"about_ca_system_score_codex":0.00013435289,"about_ca_system_score_gemma":0.000049243074,"threshold_uncertainty_score":0.5652296},"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,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_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","score_opus":0.008874086341083479,"score_gpt":0.24322231641666409,"score_spread":0.23434823007558062,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1984724866","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.16414899,0.000011975043,0.83450174,0.00063750596,0.0004063172,0.000066381974,0.000018707564,0.000021860531,0.00018651121],"genre_scores_gemma":[0.96419066,0.0000043993286,0.03369647,0.0003851933,0.0016010226,0.000003838456,0.000068439935,0.000023215112,0.000026783273],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99836683,0.000019310097,0.0008762751,0.00012787011,0.00046642375,0.0001432968],"domain_scores_gemma":[0.99622965,0.00049418444,0.0015487348,0.00020082021,0.0015074228,0.000019218467],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00092486385,0.00015166734,0.00051838445,0.0008630953,0.000057431793,0.00014151233,0.0006481195,0.00004857402,0.000042870764],"category_scores_gemma":[0.00031987907,0.0001356471,0.00057962653,0.00047570677,0.00005831317,0.00056978274,0.0001345697,0.00010269432,0.000027158014],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002380256,0.0013673994,0.0013613596,0.00044864474,0.014640644,0.000023374128,0.0004431243,0.19358057,0.018758843,0.7303058,0.007452988,0.03137922],"study_design_scores_gemma":[0.0005932295,0.0000328139,0.0003110108,0.00019652628,0.0021380032,0.0000103873435,0.00002760491,0.85632265,0.002854903,0.13104185,0.0062637534,0.00020728767],"about_ca_topic_score_codex":0.0000033002998,"about_ca_topic_score_gemma":0.000005682663,"teacher_disagreement_score":0.8008053,"about_ca_system_score_codex":0.00005209394,"about_ca_system_score_gemma":0.00001863817,"threshold_uncertainty_score":0.5531528},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.0162750095180927,"score_gpt":0.25387399568813473,"score_spread":0.23759898617004205,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1990598022","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10278955,0.00009928258,0.8929126,0.0015362869,0.001687773,0.000029655204,6.0849135e-7,0.000045399018,0.000898795],"genre_scores_gemma":[0.43659464,0.00006670757,0.5614217,0.0007057407,0.00097317103,7.9082395e-7,5.6506343e-7,0.000011417589,0.00022528978],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99860686,0.0000323761,0.0004934399,0.000097014075,0.0006345702,0.00013574486],"domain_scores_gemma":[0.99856484,0.00022207279,0.00040864997,0.00024631707,0.000490304,0.00006783061],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004297685,0.000107778586,0.00018729574,0.000208098,0.000033786353,0.00030995917,0.0020129147,0.00003370011,0.0000454449],"category_scores_gemma":[0.000037611262,0.000087503664,0.00012851464,0.000103683844,0.00002757991,0.0007550882,0.00038885768,0.00012810151,0.000028559201],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000037304133,0.0008755162,0.000970875,0.00005685032,0.0007844625,0.0028650353,0.010236553,0.0060985517,0.0020102246,0.7952052,0.02570643,0.15515305],"study_design_scores_gemma":[0.00066959613,0.00013102175,0.00088406785,0.00032979334,0.000015044109,0.007229418,0.00011259424,0.70650005,0.0010300474,0.2711819,0.01168034,0.00023610686],"about_ca_topic_score_codex":0.0000017041863,"about_ca_topic_score_gemma":4.1091113e-7,"teacher_disagreement_score":0.7004015,"about_ca_system_score_codex":0.00004487861,"about_ca_system_score_gemma":0.00004398006,"threshold_uncertainty_score":0.374053},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.010947214938033701,"score_gpt":0.26872210716132505,"score_spread":0.25777489222329136,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1992893569","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.51005,0.0003864779,0.48887178,0.00024008316,0.0003511762,0.000023319099,0.0000021010364,0.000007242808,0.000067847664],"genre_scores_gemma":[0.75868875,0.000061676226,0.24088605,0.00015379071,0.0001960254,4.933526e-7,9.425427e-7,0.0000039109227,0.000008394399],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999214,0.00003188475,0.0003450048,0.000057479763,0.0002702536,0.000081383994],"domain_scores_gemma":[0.9992705,0.00016603844,0.00018970224,0.000100083846,0.00021542257,0.000058254536],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003640124,0.00007439618,0.0001541784,0.00014209672,0.00002808427,0.00013560249,0.00034375154,0.000027639897,0.00000721897],"category_scores_gemma":[0.00001735846,0.000059059435,0.000037682672,0.000053096912,0.000040460585,0.0007183312,0.00017146063,0.00006852906,0.0000016989884],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000024783898,0.001022232,0.00372371,0.00018037835,0.0004348883,0.000053914915,0.03854279,0.0005492991,0.013467805,0.8145592,0.00043866626,0.12700231],"study_design_scores_gemma":[0.003415492,0.0005074892,0.035504576,0.0017508529,0.00011620005,0.009680589,0.0012303775,0.8735586,0.019655058,0.052510753,0.001316112,0.0007539392],"about_ca_topic_score_codex":0.0000018164516,"about_ca_topic_score_gemma":1.8853275e-7,"teacher_disagreement_score":0.87300926,"about_ca_system_score_codex":0.000013855177,"about_ca_system_score_gemma":0.00001783934,"threshold_uncertainty_score":0.2408374},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.011936530297873879,"score_gpt":0.2568941312501591,"score_spread":0.2449576009522852,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2004973266","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.025169583,0.000120482764,0.97020185,0.0028772468,0.0011985005,0.00031148698,0.000006503051,0.000025686924,0.000088661494],"genre_scores_gemma":[0.25428227,0.000047652982,0.7431066,0.00046919307,0.0018851609,0.00006299215,0.0000025811726,0.000047674162,0.000095903924],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99893665,0.000023366745,0.00041066267,0.00006704978,0.00040742708,0.00015482577],"domain_scores_gemma":[0.9985843,0.00073603715,0.000056632944,0.0001332967,0.00042683835,0.00006289656],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003998956,0.00012826883,0.00016974189,0.00006977739,0.00011206416,0.00038280353,0.0004731813,0.00003559269,0.000032839846],"category_scores_gemma":[0.000022445247,0.00006576739,0.00011557581,0.000053782904,0.000018980005,0.00020920105,0.00002387441,0.00016860131,0.000010810716],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00024635004,0.00033075758,0.00004293864,0.0001851331,0.0031168521,0.000064155916,0.017515559,0.3620612,0.005017225,0.03865294,0.05257569,0.5201912],"study_design_scores_gemma":[0.00052103377,0.00013162762,0.00020411052,0.0001200268,0.000045902663,0.00028634234,0.00010603629,0.97745585,0.001551289,0.0093526095,0.010116659,0.00010848292],"about_ca_topic_score_codex":0.0000022466772,"about_ca_topic_score_gemma":0.000004835757,"teacher_disagreement_score":0.6153947,"about_ca_system_score_codex":0.000054552398,"about_ca_system_score_gemma":0.000038079765,"threshold_uncertainty_score":0.36913833},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.06853121547310442,"score_gpt":0.3694951497026031,"score_spread":0.3009639342294987,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2008315247","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.16292195,0.00015620269,0.83141416,0.0020823842,0.00034457125,0.000079771075,0.0000015507395,0.000005660701,0.0029937373],"genre_scores_gemma":[0.63921475,0.000079496094,0.35995334,0.0004511568,0.00014478105,0.0000010638191,5.3584256e-7,0.000005524968,0.00014934171],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985059,0.00011620401,0.00095699384,0.00007709277,0.0002205692,0.00012323938],"domain_scores_gemma":[0.99691296,0.002144103,0.00042766056,0.00010697392,0.00033039667,0.000077925375],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009977226,0.00009631915,0.0006058085,0.00018494664,0.000009057486,0.0000050808662,0.00023774522,0.00010472558,0.000517825],"category_scores_gemma":[0.0011930334,0.00006637897,0.00016698216,0.00006353301,0.00014068105,0.00004004702,0.00005635292,0.00026224653,0.00001308819],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003413927,0.002966687,0.00094880885,0.00031408,0.0007613419,0.0015727964,0.00283423,0.0006425047,0.0015496684,0.93378544,0.00036910726,0.05391392],"study_design_scores_gemma":[0.0019025852,0.00036880016,0.00096615683,0.00058534637,0.000062601175,0.003255559,0.000027544063,0.67943585,0.0006918902,0.31236702,0.00025472924,0.00008192713],"about_ca_topic_score_codex":6.6702165e-7,"about_ca_topic_score_gemma":1.8979856e-7,"teacher_disagreement_score":0.6787933,"about_ca_system_score_codex":0.000024979454,"about_ca_system_score_gemma":0.000018155995,"threshold_uncertainty_score":0.5669821},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.01637678035827442,"score_gpt":0.29985460053932184,"score_spread":0.2834778201810474,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2017662701","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.007130458,0.00008614829,0.9895865,0.0011801246,0.0012054018,0.00024523097,0.000032718362,0.00005161957,0.00048181578],"genre_scores_gemma":[0.039813872,0.000004261694,0.9587647,0.0006174735,0.00062186265,0.000010682518,0.0000057883235,0.00002134672,0.00014002771],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9980531,0.00010978826,0.000699119,0.00022725097,0.0006815186,0.00022922807],"domain_scores_gemma":[0.9973301,0.00044514824,0.0006377782,0.0003366095,0.0010973205,0.00015299083],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009942338,0.0002034672,0.0003154755,0.00028280588,0.0001654599,0.0006920615,0.0015014864,0.000044350018,0.00018952777],"category_scores_gemma":[0.000026951033,0.00015553307,0.00015442149,0.00018601639,0.00008273766,0.00069555914,0.00012433807,0.00022362528,0.000016027974],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005209176,0.0028637694,0.000018686973,0.00018932925,0.0007768458,0.00024198236,0.008663213,0.1576481,0.0006240286,0.79474676,0.006601236,0.027573962],"study_design_scores_gemma":[0.0013973837,0.0005029781,0.000014865128,0.00016615451,0.000027103104,0.0022268144,0.00003757135,0.88836205,0.0004919232,0.099244334,0.0073312437,0.00019756188],"about_ca_topic_score_codex":9.428175e-7,"about_ca_topic_score_gemma":0.0000013858347,"teacher_disagreement_score":0.73071396,"about_ca_system_score_codex":0.00007952985,"about_ca_system_score_gemma":0.00011624907,"threshold_uncertainty_score":0.6673565},"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,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_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","score_opus":0.017910437227818134,"score_gpt":0.37604335360596725,"score_spread":0.3581329163781491,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2036075041","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.39900905,0.00003532776,0.59712446,0.0034247967,0.00028754224,0.000079550206,0.000021151523,0.00000164284,0.000016500753],"genre_scores_gemma":[0.8790931,0.000024518717,0.12050183,0.00014328162,0.00022247463,0.0000011569816,0.0000015038355,0.000008862366,0.0000032573885],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99867535,0.000011915797,0.00069878984,0.000048518195,0.0004998538,0.0000655594],"domain_scores_gemma":[0.9983087,0.00007798365,0.0007378036,0.00007897854,0.0007595874,0.00003690536],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00027555772,0.00006328036,0.00026924248,0.00010056568,0.000011585855,0.0000062124514,0.00024096474,0.000022605604,0.000019757214],"category_scores_gemma":[0.000046114204,0.000041604308,0.00018306127,0.00006338973,0.000042877986,0.000054994092,0.000041180745,0.00012369754,9.178507e-8],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00055829104,0.0022984475,0.028862184,0.0019358973,0.0034513548,0.000029862567,0.012346663,0.76547915,0.019478371,0.047270045,0.0011425647,0.1171472],"study_design_scores_gemma":[0.0042972886,0.00019651584,0.0055796453,0.0018598177,0.00022525183,0.00061146566,0.00030970693,0.966632,0.0063424143,0.013710473,0.00015753342,0.00007786498],"about_ca_topic_score_codex":0.000033414704,"about_ca_topic_score_gemma":0.0000016019436,"teacher_disagreement_score":0.48008406,"about_ca_system_score_codex":0.000059230006,"about_ca_system_score_gemma":0.00017672677,"threshold_uncertainty_score":0.16965745},"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,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_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","score_opus":0.1285900337476875,"score_gpt":0.3370790504074543,"score_spread":0.2084890166597668,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2038152738","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06193218,0.00002364155,0.93458676,0.0001686804,0.0020444395,0.00034915566,0.00006654689,0.00006026684,0.00076830725],"genre_scores_gemma":[0.36916575,0.000008594322,0.62886655,0.00005499958,0.0014998887,0.000029902161,0.000032414333,0.000042155483,0.00029973625],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9971078,0.0000649722,0.0014208172,0.0002414909,0.0008595573,0.00030535724],"domain_scores_gemma":[0.9955137,0.0010492504,0.001196554,0.00030886938,0.0017741778,0.0001574996],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00046978216,0.00031170624,0.00052362686,0.0005485863,0.00016478727,0.00013330509,0.0010929047,0.00015461717,0.00013388584],"category_scores_gemma":[0.0007678227,0.00027455186,0.00050621206,0.00015534787,0.00010917314,0.0003835504,0.00018716419,0.00039195552,0.000010517819],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00029621905,0.0065323873,0.00016075894,0.00024318333,0.0024840704,0.00002336601,0.009053688,0.0013104454,0.006141778,0.953418,0.010890275,0.00944579],"study_design_scores_gemma":[0.002118074,0.00031879576,0.00068924885,0.0002786663,0.00038488125,0.00029133522,0.0002965845,0.7549192,0.0021558788,0.23777354,0.0002922313,0.00048161994],"about_ca_topic_score_codex":0.000019672014,"about_ca_topic_score_gemma":0.0000078576495,"teacher_disagreement_score":0.7536087,"about_ca_system_score_codex":0.00021230563,"about_ca_system_score_gemma":0.00024138908,"threshold_uncertainty_score":0.9999707},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.11401088732089794,"score_gpt":0.4097421885001198,"score_spread":0.29573130117922186,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2044454975","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0076927855,0.000069725924,0.9884148,0.0005672985,0.0023250496,0.0004318748,0.00003852679,0.00004539314,0.0004145007],"genre_scores_gemma":[0.010336543,0.00002296205,0.9882328,0.00013459488,0.00092533574,0.000030453872,0.000029696574,0.00004805882,0.00023957112],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9976459,0.00011395549,0.0012893684,0.00016720606,0.00058091054,0.00020263126],"domain_scores_gemma":[0.9944436,0.0013488391,0.0011372945,0.0002496372,0.0027166107,0.0001040418],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011798886,0.00021753981,0.00039971346,0.00038316436,0.00011855064,0.00011241306,0.00067261636,0.00011043105,0.00016816589],"category_scores_gemma":[0.00094736525,0.0001936513,0.00028441093,0.00020315875,0.00008475211,0.00039575744,0.000106065636,0.00024401408,0.000019953603],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00026070018,0.0068168025,0.00008327619,0.0006017206,0.0030584903,0.000022569246,0.014210037,0.0029069665,0.002045858,0.90679014,0.009058385,0.05414503],"study_design_scores_gemma":[0.0011175213,0.00025545448,0.00013843436,0.00027900527,0.00021406164,0.00031023312,0.000096442396,0.3350025,0.0007094692,0.6507862,0.0108692385,0.00022140474],"about_ca_topic_score_codex":0.000005286703,"about_ca_topic_score_gemma":0.0000047782955,"teacher_disagreement_score":0.33209556,"about_ca_system_score_codex":0.00019729359,"about_ca_system_score_gemma":0.00027930454,"threshold_uncertainty_score":0.7896871},"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,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_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","score_opus":0.05420179723638368,"score_gpt":0.34410499378117376,"score_spread":0.2899031965447901,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2046275899","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.20035747,0.000059822745,0.7975313,0.0007566767,0.00081974105,0.00018473492,0.0000041020876,0.000032610944,0.00025352242],"genre_scores_gemma":[0.11253951,0.000029928604,0.8860286,0.0002754647,0.0008705714,0.0000095797695,0.0000036989056,0.000033207452,0.00020946242],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9982298,0.00008548181,0.0007898938,0.00012975684,0.0006261,0.00013897382],"domain_scores_gemma":[0.9957828,0.0008380564,0.0007068876,0.00015950396,0.0024100381,0.00010274151],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005187252,0.00017828819,0.00030318822,0.00029927256,0.000065798326,0.00023423812,0.00035284273,0.00006440164,0.00020371527],"category_scores_gemma":[0.0008523593,0.00013901081,0.00009315205,0.00014318581,0.00007754384,0.0007229232,0.00012347817,0.00020910938,0.000039270963],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00029076054,0.008263225,0.0028157155,0.002728719,0.005235886,0.000315832,0.044301923,0.0008091858,0.015740406,0.43205574,0.085879706,0.4015629],"study_design_scores_gemma":[0.0011330842,0.000321078,0.00067495543,0.000419555,0.000103192506,0.00055272767,0.00049820176,0.036242243,0.0014347349,0.9565705,0.0017959308,0.00025378074],"about_ca_topic_score_codex":0.0000022604368,"about_ca_topic_score_gemma":0.0000036455665,"teacher_disagreement_score":0.5245148,"about_ca_system_score_codex":0.00005066275,"about_ca_system_score_gemma":0.00009003417,"threshold_uncertainty_score":0.5668696},"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,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_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","score_opus":0.029676967989346232,"score_gpt":0.28633524922315107,"score_spread":0.25665828123380485,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2049175577","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.30479512,0.000029860481,0.6920475,0.0013595754,0.0012745576,0.000054316093,0.0000039033657,0.000006575083,0.00042862503],"genre_scores_gemma":[0.85726297,0.000016304059,0.14188865,0.00032183496,0.00043995815,7.7919196e-7,0.0000010369118,0.000005900932,0.00006257141],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9980085,0.000054913562,0.0007538976,0.00010087305,0.0009801217,0.000101702906],"domain_scores_gemma":[0.9974733,0.000501436,0.00081923965,0.0002405691,0.0009197767,0.000045685112],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00046065025,0.00011648787,0.00024012626,0.00028525566,0.000050857794,0.000046627905,0.0012506077,0.000038989856,0.0000224991],"category_scores_gemma":[0.00009598132,0.0000801232,0.00021326012,0.00021509662,0.00009858347,0.00026873106,0.00016815343,0.00014732202,0.0000067849646],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002457942,0.0054990146,0.00039243815,0.00011933398,0.0011627682,0.00037629984,0.023752542,0.048867524,0.014432752,0.804193,0.020745095,0.08021341],"study_design_scores_gemma":[0.0030669323,0.0030949824,0.014199559,0.0010517337,0.00006619673,0.0053594913,0.000109499095,0.79297566,0.049239766,0.12268768,0.007533592,0.00061489554],"about_ca_topic_score_codex":0.000001977246,"about_ca_topic_score_gemma":5.7908983e-7,"teacher_disagreement_score":0.74410814,"about_ca_system_score_codex":0.000043563647,"about_ca_system_score_gemma":0.00020532728,"threshold_uncertainty_score":0.32673293},"labels":[],"label_agreement":null},{"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,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_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","score_opus":0.012305536176817277,"score_gpt":0.23221358098748876,"score_spread":0.21990804481067147,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2050024620","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11182474,0.00015592913,0.8862665,0.000104465944,0.0009503751,0.00006761349,0.0000015844807,0.00007184158,0.000556921],"genre_scores_gemma":[0.86763793,0.000017110577,0.1316276,0.00007571202,0.00059984584,0.000001473384,0.0000038983744,0.00003049711,0.0000059210306],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988633,0.000018173265,0.00042760314,0.000054087,0.00047292167,0.00016395068],"domain_scores_gemma":[0.99915725,0.000075197764,0.00020598761,0.000104392515,0.00035214509,0.00010503564],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00027091728,0.000121117555,0.0001876204,0.0002013834,0.000025810636,0.000112040485,0.00028271446,0.000045652705,0.00003932136],"category_scores_gemma":[0.000018902116,0.00010771365,0.00007370925,0.000109488574,0.000024504094,0.00038362024,0.00003377772,0.0001633835,0.000019175493],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000069503614,0.0013386109,0.015251835,0.0010009597,0.003217968,0.00021921091,0.037546683,0.83138525,0.003588169,0.020485634,0.0038599598,0.08203623],"study_design_scores_gemma":[0.004414104,0.0003984431,0.008291907,0.0033905983,0.00023512104,0.0053614792,0.0005256513,0.93938404,0.007136618,0.014296972,0.015200408,0.0013646517],"about_ca_topic_score_codex":8.6258984e-7,"about_ca_topic_score_gemma":5.1261605e-7,"teacher_disagreement_score":0.7558132,"about_ca_system_score_codex":0.000078018005,"about_ca_system_score_gemma":0.00002345075,"threshold_uncertainty_score":0.4392435},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.08652782290873272,"score_gpt":0.3839386795999732,"score_spread":0.29741085669124045,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2050600071","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.33063737,0.00018817719,0.6639196,0.0024773248,0.0020279877,0.000038329003,0.00000397799,0.000020412219,0.00068679685],"genre_scores_gemma":[0.6993208,0.000023490746,0.29920274,0.0005922838,0.0007484897,3.5252978e-7,4.0064793e-7,0.000005273936,0.00010615806],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9968409,0.00005954896,0.001056728,0.00014061858,0.0017426048,0.00015962103],"domain_scores_gemma":[0.99655735,0.00056405517,0.0008402707,0.00023606754,0.0016850833,0.0001171423],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018947314,0.00011462852,0.00028804856,0.000651905,0.00007557114,0.0004210133,0.0013552402,0.000047499878,0.000060232098],"category_scores_gemma":[0.0007348604,0.00008380541,0.00027327018,0.00042950906,0.000043400905,0.00034484328,0.000056977926,0.00019908485,0.00005261307],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002511294,0.0037697447,0.0049092416,0.000017431374,0.0014562181,0.0009487429,0.009989869,0.09105106,0.0055101276,0.46394733,0.09812565,0.32002345],"study_design_scores_gemma":[0.0016007567,0.00037906042,0.0064643915,0.00029966587,0.000054888464,0.0013335824,0.0002255802,0.09784247,0.0017119775,0.873055,0.016692502,0.0003401295],"about_ca_topic_score_codex":5.569103e-7,"about_ca_topic_score_gemma":9.0250694e-7,"teacher_disagreement_score":0.40910766,"about_ca_system_score_codex":0.000041415602,"about_ca_system_score_gemma":0.00009829578,"threshold_uncertainty_score":0.4059841},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.03777899872686231,"score_gpt":0.3398450795350296,"score_spread":0.3020660808081673,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2055755790","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0010381613,0.00007207922,0.9959743,0.0001108184,0.001847444,0.00024048585,0.000049206756,0.00009475517,0.0005727574],"genre_scores_gemma":[0.0032536257,0.000023203364,0.9951282,0.00011165351,0.0013574278,0.000019991063,0.000006821029,0.00006979959,0.000029251405],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.997922,0.000052616044,0.0011166248,0.00013827853,0.00053513376,0.0002353463],"domain_scores_gemma":[0.99704427,0.0013657972,0.00052531116,0.00018142749,0.00075614057,0.00012705373],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006595954,0.00025119458,0.00048619648,0.00024444988,0.000033067805,0.000063971136,0.0007826199,0.000066188,0.000049719554],"category_scores_gemma":[0.00023861996,0.00021883425,0.00027752866,0.00014322167,0.000043369575,0.0002723118,0.00009658031,0.00026592347,0.00002194323],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00029162213,0.00090464076,0.000047590394,0.0007936514,0.001923963,0.00012670115,0.008464584,0.81647366,0.0007389904,0.053366713,0.0030969456,0.113770925],"study_design_scores_gemma":[0.0006591444,0.00020789028,0.00000940129,0.00019093805,0.00004953065,0.0003326214,0.000034855813,0.7735655,0.0005809015,0.22040358,0.0037720106,0.00019366237],"about_ca_topic_score_codex":5.0885643e-7,"about_ca_topic_score_gemma":3.0720867e-7,"teacher_disagreement_score":0.16703688,"about_ca_system_score_codex":0.000088601955,"about_ca_system_score_gemma":0.000040868083,"threshold_uncertainty_score":0.8923802},"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,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_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","score_opus":0.0459856150671948,"score_gpt":0.3049401981709952,"score_spread":0.25895458310380043,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2063884065","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.18379721,0.000022577937,0.8146189,0.0005967397,0.00061943784,0.00005745019,0.000011490989,0.000004046119,0.00027215242],"genre_scores_gemma":[0.47554922,0.0000053274193,0.524278,0.000057493453,0.00009205324,3.459933e-7,4.1333632e-7,0.0000035077103,0.000013664777],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99820787,0.0001219104,0.0007989156,0.0000786907,0.0006963779,0.00009624738],"domain_scores_gemma":[0.99662614,0.00057285215,0.0013178039,0.00032855582,0.0011164576,0.00003819064],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005395591,0.00010440171,0.00027846277,0.000060995586,0.0000527703,0.00001901167,0.0019110224,0.00003572948,0.000006672883],"category_scores_gemma":[0.00013046498,0.00005858082,0.00022128574,0.00022977045,0.0001785095,0.0001632443,0.00037452293,0.00020265188,0.0000011317151],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000036388767,0.0019653277,0.0151716,0.00021585768,0.0010926777,0.00008187293,0.013200598,0.0031129774,0.02498117,0.90951693,0.00694743,0.02367719],"study_design_scores_gemma":[0.0021864816,0.00015660873,0.027471745,0.00144136,0.00012451601,0.0056495643,0.000046377114,0.40746123,0.02532263,0.5289903,0.00084492244,0.0003042554],"about_ca_topic_score_codex":0.000011180212,"about_ca_topic_score_gemma":6.794672e-7,"teacher_disagreement_score":0.40434825,"about_ca_system_score_codex":0.000025870153,"about_ca_system_score_gemma":0.00010104293,"threshold_uncertainty_score":0.3551187},"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,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_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","score_opus":0.032405734837814476,"score_gpt":0.24453514536068305,"score_spread":0.21212941052286857,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2090639626","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15605107,0.000021263097,0.84166515,0.0010472683,0.0007312679,0.000036394777,0.000001785496,0.000012546337,0.00043324928],"genre_scores_gemma":[0.8707324,0.000010833658,0.12869474,0.00039876314,0.00015008177,7.0006354e-7,3.6051165e-7,0.0000053111544,0.000006762973],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987244,0.000039126706,0.00044983882,0.00006895546,0.00063639245,0.000081296625],"domain_scores_gemma":[0.9982126,0.00076340925,0.00045315328,0.0001959212,0.00034141165,0.000033515564],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00036172773,0.00008512747,0.00015608109,0.0001418364,0.0000387195,0.000039991828,0.0012905122,0.00002455778,0.000023184126],"category_scores_gemma":[0.000061004113,0.000053861142,0.00013675046,0.0000923406,0.00006585022,0.00019876448,0.000077192184,0.0001297018,0.000014647225],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000011821712,0.00023722595,0.000004645,0.000008026844,0.00011761273,0.000053431184,0.002608434,0.002005297,0.00029546107,0.9903802,0.0015052807,0.0027725198],"study_design_scores_gemma":[0.0006894433,0.00034009482,0.000371817,0.00041484355,0.000015978407,0.0022373728,0.00006795652,0.18311477,0.0018955419,0.8106187,0.00008227036,0.0001512405],"about_ca_topic_score_codex":6.264774e-7,"about_ca_topic_score_gemma":7.357128e-8,"teacher_disagreement_score":0.7146814,"about_ca_system_score_codex":0.000027841998,"about_ca_system_score_gemma":0.0000564516,"threshold_uncertainty_score":0.23981142},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.04358645793215987,"score_gpt":0.3512650919097619,"score_spread":0.30767863397760203,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2091011159","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0033953434,0.000037765338,0.9929966,0.00033435665,0.0022687141,0.00012982101,0.0000049290315,0.000048776183,0.00078369933],"genre_scores_gemma":[0.084466025,0.0000062263434,0.9149326,0.00019073342,0.00030524618,0.000006224799,0.0000022118347,0.000011857276,0.000078869365],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983478,0.0000800269,0.0007099731,0.0001272797,0.00058320013,0.00015172287],"domain_scores_gemma":[0.99719507,0.0009302783,0.00078052934,0.00030052665,0.00072624435,0.00006735769],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013217754,0.000118393174,0.00019200696,0.00025336028,0.00005358785,0.00024869686,0.0014693458,0.000043103955,0.000013632843],"category_scores_gemma":[0.0011585408,0.00010593083,0.00014598454,0.00013507667,0.0000229925,0.00066193205,0.00010409014,0.00012756648,0.000018156028],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000007265244,0.00028525898,0.000022213677,0.000037796137,0.00018528792,0.000024998135,0.0040460504,0.008274942,0.0007370162,0.9345735,0.00067776255,0.051127918],"study_design_scores_gemma":[0.0007060603,0.00010589906,0.000036844285,0.00010319236,0.000012893661,0.00021532258,0.000044735116,0.95617205,0.0047278595,0.035165224,0.0025845584,0.00012536751],"about_ca_topic_score_codex":6.514665e-7,"about_ca_topic_score_gemma":2.3602153e-7,"teacher_disagreement_score":0.9478971,"about_ca_system_score_codex":0.00007976967,"about_ca_system_score_gemma":0.00009490581,"threshold_uncertainty_score":0.43197337},"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,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_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","score_opus":0.0862737725345553,"score_gpt":0.3920779674893471,"score_spread":0.3058041949547918,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2093960185","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0186272,0.00008066069,0.9780531,0.0015195456,0.0013720158,0.0002602617,0.0000071963123,0.00002415549,0.00005586552],"genre_scores_gemma":[0.01806837,0.000016617088,0.9799198,0.00015211762,0.0016111666,0.0000035373723,0.0000026161624,0.00003438815,0.00019140424],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99795884,0.00004492593,0.0009983757,0.00013718812,0.00064439344,0.00021629168],"domain_scores_gemma":[0.99295384,0.0048584547,0.0008989702,0.00018134888,0.0009692182,0.0001381489],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013611803,0.00018983404,0.00034369226,0.00019414104,0.00009480626,0.00018633642,0.00054907525,0.00008193306,0.00013783874],"category_scores_gemma":[0.0013417357,0.00012834734,0.0001982336,0.00016071851,0.00005032921,0.00027704742,0.00012713965,0.000269982,0.000006828406],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003493878,0.0010488555,0.00020239098,0.00025517505,0.0023814265,0.000036329522,0.0051462795,0.00047262374,0.0025237107,0.2785263,0.0055345856,0.7035229],"study_design_scores_gemma":[0.0018873936,0.00030480445,0.00021567375,0.00024524194,0.0002502827,0.00037402177,0.00018396284,0.26268727,0.0031696248,0.71454793,0.015837861,0.0002958941],"about_ca_topic_score_codex":0.0000020882283,"about_ca_topic_score_gemma":0.000003238709,"teacher_disagreement_score":0.70322704,"about_ca_system_score_codex":0.00006615941,"about_ca_system_score_gemma":0.000100729194,"threshold_uncertainty_score":0.5233852},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.051624990918160724,"score_gpt":0.33292350759267425,"score_spread":0.28129851667451355,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2096541859","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.25634068,0.000046037687,0.7402261,0.0015047599,0.0014198357,0.00021873783,0.000006445914,0.000025432586,0.00021196804],"genre_scores_gemma":[0.70816296,0.000022810582,0.2910746,0.00024769828,0.00034044063,0.000009295129,0.0000034171212,0.000020529233,0.00011823848],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9983247,0.0001255365,0.00063881365,0.00015015717,0.0006174295,0.00014339737],"domain_scores_gemma":[0.9972803,0.0014291352,0.00030314602,0.00014451912,0.00074123667,0.00010165014],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00063359,0.0001657271,0.00023862215,0.00022886563,0.00020846403,0.00020443383,0.00022150944,0.00007343989,0.000029876452],"category_scores_gemma":[0.00060890283,0.00011983967,0.00008343993,0.00008436915,0.00008270192,0.00028489664,0.00008676705,0.00028951274,0.000010859679],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0007132242,0.0010042017,0.00006256987,0.0000668796,0.0010514525,0.000097353615,0.011155669,0.00023962327,0.0018914185,0.9095982,0.0020357186,0.072083704],"study_design_scores_gemma":[0.0010393336,0.0004309441,0.008087712,0.00019914862,0.00012561769,0.0021547172,0.00030395223,0.21331836,0.0013682902,0.77239275,0.0003633757,0.00021580918],"about_ca_topic_score_codex":0.0000046013392,"about_ca_topic_score_gemma":0.000013658698,"teacher_disagreement_score":0.45182225,"about_ca_system_score_codex":0.00013452924,"about_ca_system_score_gemma":0.00006166912,"threshold_uncertainty_score":0.48869202},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.18784866852848245,"score_gpt":0.3620734883832482,"score_spread":0.17422481985476576,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2113758534","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2106863,0.000025682793,0.78814,0.00016131643,0.0007525929,0.00016469085,0.000010083537,0.000020784137,0.00003857431],"genre_scores_gemma":[0.3103293,0.0000048528336,0.6893266,0.00005678811,0.00022736976,0.000006739993,0.0000021845583,0.000019246496,0.000026926717],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99808323,0.0000518323,0.0009100215,0.00015182106,0.0006230016,0.00018008475],"domain_scores_gemma":[0.9952557,0.0025716582,0.00095699774,0.00014885492,0.0009562239,0.00011052957],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007156282,0.00017953833,0.00037595883,0.00024614335,0.00007275649,0.00008386319,0.00038741704,0.000068863636,0.000061421975],"category_scores_gemma":[0.0013072849,0.00015028773,0.00017977707,0.000081157494,0.00007063025,0.000108937194,0.00014328533,0.00016880492,0.0000040204764],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00048388174,0.0047588544,0.0004722803,0.0006242302,0.002377762,0.00004524882,0.015945617,0.0020030888,0.0102371145,0.76513135,0.0004069765,0.1975136],"study_design_scores_gemma":[0.00075416995,0.00016933765,0.00048858335,0.00037455518,0.000112150876,0.00005542535,0.00005137508,0.33770308,0.0020439287,0.6580192,0.00005594757,0.00017223565],"about_ca_topic_score_codex":0.0000017443722,"about_ca_topic_score_gemma":5.285529e-7,"teacher_disagreement_score":0.3357,"about_ca_system_score_codex":0.00005893664,"about_ca_system_score_gemma":0.00005134947,"threshold_uncertainty_score":0.61285555},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.01633063061697472,"score_gpt":0.2645873229879092,"score_spread":0.2482566923709345,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2134676649","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0017388018,0.00037317144,0.9935762,0.0003440148,0.0031741366,0.0002216522,0.00001922985,0.000054148415,0.0004986057],"genre_scores_gemma":[0.008324332,0.00007460954,0.98848593,0.00022073393,0.002215565,0.0000126429495,0.000004367192,0.000021199612,0.000640632],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9975768,0.00006288513,0.0010109643,0.00022624471,0.00083969854,0.00028344773],"domain_scores_gemma":[0.99740535,0.0008668869,0.000602475,0.00028148215,0.0006974833,0.00014631801],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012434089,0.0002202146,0.0004346808,0.0004066685,0.00008448774,0.00057621056,0.0021204937,0.00007487742,0.00005737525],"category_scores_gemma":[0.0000440546,0.0001844863,0.00034805248,0.0002739368,0.000032532498,0.0006737598,0.00013235945,0.00020948585,0.000044912667],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000026764053,0.00039271417,0.0000046377318,0.000050623785,0.00031815888,0.00011253025,0.00065211067,0.0056183925,0.000019325227,0.16611953,0.0028376163,0.8238476],"study_design_scores_gemma":[0.001133528,0.00022822071,0.000017793616,0.00020966132,0.000023731855,0.0015964027,0.000023033761,0.9360663,0.00009070662,0.044920444,0.015476692,0.00021347454],"about_ca_topic_score_codex":0.000002631101,"about_ca_topic_score_gemma":8.1311114e-8,"teacher_disagreement_score":0.93044794,"about_ca_system_score_codex":0.00010257462,"about_ca_system_score_gemma":0.00012430802,"threshold_uncertainty_score":0.75231326},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.038232645543636395,"score_gpt":0.2957965192233195,"score_spread":0.25756387367968314,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2145436131","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.22171581,0.000060929244,0.7762326,0.000293973,0.0013625958,0.000036352114,0.0000036878173,0.000016855096,0.00027720074],"genre_scores_gemma":[0.63490003,0.000006462662,0.3647624,0.000100238445,0.00021628295,2.8065557e-7,3.6899417e-7,0.000004107911,0.0000098059445],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99837005,0.000060004473,0.0007013494,0.00007160889,0.00064479874,0.00015217606],"domain_scores_gemma":[0.9980602,0.00032363963,0.00072230713,0.00026340736,0.00053422485,0.00009620008],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010292195,0.000099388504,0.0002529105,0.0001450544,0.000018308338,0.00006893539,0.0014786819,0.000026135873,0.000030118417],"category_scores_gemma":[0.000051963965,0.00007827578,0.00015163457,0.000103066086,0.000078525656,0.0007039355,0.00032092107,0.00011716666,0.000012145956],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000029029616,0.0021558127,0.00460815,0.00010077585,0.00048186837,0.000030318715,0.008673404,0.00062028045,0.0013169266,0.8986878,0.0021987068,0.08109697],"study_design_scores_gemma":[0.0011300594,0.00024254197,0.024991687,0.0002976979,0.000025160838,0.0010373567,0.00009402782,0.14452247,0.01095439,0.8138855,0.0025059427,0.0003131395],"about_ca_topic_score_codex":0.0000020446405,"about_ca_topic_score_gemma":3.228089e-7,"teacher_disagreement_score":0.41318426,"about_ca_system_score_codex":0.00005616864,"about_ca_system_score_gemma":0.00004962558,"threshold_uncertainty_score":0.31919935},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.05419527125526193,"score_gpt":0.3645561615159993,"score_spread":0.3103608902607374,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2155951397","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0072815223,0.000054643024,0.98843247,0.0008294104,0.0025871247,0.00036433488,0.000026346086,0.000053711243,0.00037046403],"genre_scores_gemma":[0.022457,0.00004322383,0.97503906,0.0001801896,0.001995506,0.00002682019,0.000013034859,0.00005846324,0.00018669442],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99686134,0.00013873371,0.0014957939,0.00022717465,0.000952944,0.0003240134],"domain_scores_gemma":[0.9961101,0.0013392618,0.0010625826,0.00026067713,0.0010343576,0.00019305176],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008011231,0.0003147192,0.0007080645,0.00030531338,0.000095193885,0.00030431908,0.00092821603,0.00010645648,0.00023575687],"category_scores_gemma":[0.0003552283,0.00024517128,0.0005746435,0.0001618278,0.00008618192,0.0003119391,0.00018256831,0.00036978096,0.000014603984],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00023348327,0.0051132673,0.000056104567,0.0001984397,0.002189964,0.00016147722,0.0027599328,0.0011304973,0.00060901797,0.28848395,0.010719148,0.6883447],"study_design_scores_gemma":[0.0021215645,0.0004005053,0.000031015425,0.00028214653,0.00013217861,0.00070797437,0.00006120939,0.4236001,0.00014449091,0.566513,0.005776198,0.00022959628],"about_ca_topic_score_codex":0.000007011715,"about_ca_topic_score_gemma":0.0000011188827,"teacher_disagreement_score":0.6881151,"about_ca_system_score_codex":0.00014721729,"about_ca_system_score_gemma":0.00012063847,"threshold_uncertainty_score":0.99977946},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.036155495211220835,"score_gpt":0.31159458270250057,"score_spread":0.2754390874912797,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2164690815","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.21672758,0.00005084467,0.78127,0.00029875725,0.00082405517,0.00005889465,0.0000106827565,0.000010648492,0.00074848364],"genre_scores_gemma":[0.9133469,0.000024732351,0.0857366,0.00004399074,0.00044058,8.416627e-7,0.0000022356103,0.000016873739,0.00038727027],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99758476,0.000036055186,0.0013245435,0.00009356711,0.0008357338,0.0001253493],"domain_scores_gemma":[0.996174,0.0007756147,0.0015053394,0.00020670315,0.0012626784,0.000075661694],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006674895,0.00014200948,0.00050332706,0.0006201662,0.000023243469,0.00002196288,0.00047877664,0.00007005351,0.00019768624],"category_scores_gemma":[0.0005380929,0.00011379216,0.00037074025,0.00034450504,0.000118636526,0.00016090268,0.00007820943,0.00016637094,0.000011768645],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00032881065,0.0035925133,0.0020641072,0.00061031553,0.0045164907,0.00011164628,0.0040237713,0.021433538,0.0010742794,0.94576013,0.008108283,0.008376142],"study_design_scores_gemma":[0.0032701117,0.0008451557,0.0005134117,0.00086232484,0.0005883091,0.00062545063,0.0012621988,0.011814137,0.007974451,0.9701865,0.0017616657,0.0002963203],"about_ca_topic_score_codex":0.0000057587854,"about_ca_topic_score_gemma":0.0000014480114,"teacher_disagreement_score":0.6966193,"about_ca_system_score_codex":0.00009240115,"about_ca_system_score_gemma":0.00017480373,"threshold_uncertainty_score":0.46403095},"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,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_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","score_opus":0.031211806637450497,"score_gpt":0.26736079389830414,"score_spread":0.23614898726085365,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2164694224","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0021260956,0.00026333862,0.9954971,0.00012916408,0.0017063664,0.00014277159,0.0000041350804,0.000043694003,0.0000873452],"genre_scores_gemma":[0.5403988,0.000017416005,0.45897013,0.000024592295,0.00056604197,0.0000042046763,0.0000033849701,0.000012826071,0.0000026450123],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988053,0.000030273013,0.00067865243,0.00006357572,0.00030404935,0.000118186144],"domain_scores_gemma":[0.9984078,0.0007159093,0.00034001126,0.000109590284,0.0003872229,0.00003946644],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00063824764,0.00012623827,0.00022693799,0.00017738031,0.00003321746,0.00005208727,0.00037190074,0.00006205821,0.000004985815],"category_scores_gemma":[0.00014498894,0.00009504009,0.00016113865,0.00019531343,0.000025251196,0.0001615652,0.00002087533,0.00024856318,5.122667e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000019931675,0.0000732541,0.0000057209295,0.000025737,0.00023277073,8.7739556e-7,0.00019487427,0.89541787,0.0015007176,0.006550726,0.00033190378,0.095645614],"study_design_scores_gemma":[0.00034199652,0.00011074344,0.0001208847,0.00011815318,0.00006335994,0.000039848343,0.000036221492,0.99232876,0.00064269657,0.0059926654,0.00011984369,0.00008484678],"about_ca_topic_score_codex":7.1611794e-7,"about_ca_topic_score_gemma":1.8295184e-7,"teacher_disagreement_score":0.5382727,"about_ca_system_score_codex":0.00010863784,"about_ca_system_score_gemma":0.000023919258,"threshold_uncertainty_score":0.38756227},"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,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_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","score_opus":0.0416119706775501,"score_gpt":0.3624068748213308,"score_spread":0.32079490414378076,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2898766459","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06986168,0.000010428947,0.92694765,0.0006879661,0.001626402,0.00027363657,0.00007119478,0.000037767724,0.00048328255],"genre_scores_gemma":[0.089209214,0.0000058013943,0.90824085,0.00033309322,0.001663521,0.000020395804,0.000034658828,0.000044116863,0.00044832402],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9980646,0.00006619046,0.00090271136,0.00016282324,0.0006058634,0.00019786201],"domain_scores_gemma":[0.99432075,0.0015418655,0.0008583793,0.00021143981,0.0029501696,0.000117388394],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00049438776,0.0002054279,0.00038274506,0.00029660913,0.00021025323,0.00020825623,0.00043780397,0.00008492012,0.00066331704],"category_scores_gemma":[0.00039229903,0.00015736917,0.00020516096,0.000192709,0.0001778263,0.00032031976,0.00007766137,0.0001961802,0.000020741763],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0011098641,0.009949935,0.0002289898,0.0004966205,0.0072305426,0.000094861156,0.012080753,0.0005666384,0.007065358,0.86157936,0.061945003,0.037652053],"study_design_scores_gemma":[0.004465642,0.0025457165,0.00018113392,0.0005605915,0.00044132443,0.0005677974,0.00028753176,0.33112368,0.0023448926,0.6255005,0.03147251,0.00050867413],"about_ca_topic_score_codex":0.0000021735314,"about_ca_topic_score_gemma":0.000022606897,"teacher_disagreement_score":0.33055702,"about_ca_system_score_codex":0.00008595966,"about_ca_system_score_gemma":0.00019270137,"threshold_uncertainty_score":0.7262857},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia, Okanagan Campus; University of British Columbia","funders":"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","score_opus":0.03339700161161386,"score_gpt":0.3274912516270442,"score_spread":0.2940942500154303,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4306943628","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0012825349,0.0000117203945,0.99248296,0.005189962,0.0003147718,0.000593325,0.0000399149,0.000015289563,0.00006952363],"genre_scores_gemma":[0.19354749,8.421741e-7,0.8057921,0.00031932347,0.00016410214,0.00012016177,0.000008083568,0.000008247744,0.000039653092],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9976268,0.00019286732,0.0009553923,0.00018901321,0.00089050236,0.0001454168],"domain_scores_gemma":[0.9965641,0.0005211698,0.0012326931,0.00022958849,0.0013783706,0.000074069845],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015825583,0.00013547321,0.00028162115,0.0003020419,0.00020637907,0.000117588825,0.0014830414,0.000029366402,0.00001850501],"category_scores_gemma":[0.00005128286,0.000097849006,0.00021719193,0.00049007987,0.000026651851,0.0002737607,0.00032586936,0.00015754673,5.9097044e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005829111,0.00041017547,0.000049266288,0.00001981923,0.00030658624,5.254459e-7,0.0018526805,0.7039661,0.00042929794,0.28877646,0.00019493492,0.003935877],"study_design_scores_gemma":[0.001177337,0.00022773456,0.00026051432,0.00003273402,0.000066798544,0.00008402977,0.00004359668,0.97817034,0.00017166369,0.018256254,0.0013868997,0.00012211017],"about_ca_topic_score_codex":0.000004587405,"about_ca_topic_score_gemma":0.0000015385367,"teacher_disagreement_score":0.27420425,"about_ca_system_score_codex":0.0001969943,"about_ca_system_score_gemma":0.00027017735,"threshold_uncertainty_score":0.39901668},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.02885945332940998,"score_gpt":0.32735267276142715,"score_spread":0.2984932194320172,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4405575790","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0034611705,0.00043889202,0.99341834,0.0018055177,0.0006574076,0.00014437188,0.000008619065,0.000020182228,0.00004550511],"genre_scores_gemma":[0.34569216,0.000045354645,0.6539015,0.000121860896,0.0002070327,0.0000021285075,0.0000021284668,0.000008580101,0.000019247445],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986493,0.000039470444,0.0006835202,0.00016227558,0.00035283135,0.00011262989],"domain_scores_gemma":[0.99851155,0.0003794117,0.00029257828,0.00013404603,0.0006213754,0.0000610143],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00066416955,0.00012710884,0.00027060136,0.000386718,0.00002018414,0.00014327237,0.00057244045,0.00007452739,0.0000013633181],"category_scores_gemma":[0.000058068406,0.00010371719,0.0000992508,0.00022014308,0.0000345834,0.00042093807,0.000106303545,0.00019364012,6.359026e-7],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000037229165,0.0004368969,0.000023273193,0.00074717205,0.00028793103,0.000064176515,0.01789486,0.0926382,0.00074113713,0.6212336,0.00089014845,0.2650054],"study_design_scores_gemma":[0.00031159012,0.000079582715,0.000045100012,0.0005921074,0.000012781461,0.00012894164,0.000007829898,0.7516733,0.00020605749,0.24683379,0.00003857786,0.00007038126],"about_ca_topic_score_codex":9.660687e-7,"about_ca_topic_score_gemma":0.0000027580477,"teacher_disagreement_score":0.6590351,"about_ca_system_score_codex":0.00004068457,"about_ca_system_score_gemma":0.00017436067,"threshold_uncertainty_score":0.42294642},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.02883492706162135,"score_gpt":0.26491991857197095,"score_spread":0.2360849915103496,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4412779934","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.44027752,0.00003307654,0.5577611,0.00057449273,0.00092260644,0.00010666237,0.00003335865,0.0000045553256,0.0002866509],"genre_scores_gemma":[0.92135817,0.0000031328946,0.078243665,0.000051963518,0.00022483319,0.0000026008722,0.0000031682398,0.000010169215,0.0001022746],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99847806,0.0000131407505,0.001092163,0.00011861087,0.00018978758,0.00010821427],"domain_scores_gemma":[0.9984486,0.000109459674,0.000823394,0.00021101606,0.00036361426,0.00004390157],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00032810858,0.000109987064,0.00028949,0.0004359082,0.00008121291,0.000079134006,0.0005174132,0.00006558234,0.000014761708],"category_scores_gemma":[0.000186087,0.00009449146,0.00020474085,0.00031548445,0.00004013147,0.0000998264,0.0001631442,0.00012382658,0.000003736935],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000012941785,0.00030541615,0.0038825665,0.00002940025,0.00007078902,7.940596e-7,0.0012249552,0.68193066,0.00014745921,0.3115424,0.00038072807,0.00047191384],"study_design_scores_gemma":[0.00032267155,0.000023550476,0.014696095,0.00023325798,0.000018623483,0.000009525559,0.000026338586,0.9212244,0.0001388553,0.063081324,0.00014957528,0.000075767704],"about_ca_topic_score_codex":0.000016920661,"about_ca_topic_score_gemma":0.0000073645547,"teacher_disagreement_score":0.48108068,"about_ca_system_score_codex":0.0001594728,"about_ca_system_score_gemma":0.000095846604,"threshold_uncertainty_score":0.38532498},"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,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_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","score_opus":0.024372163044185085,"score_gpt":0.2546094397743287,"score_spread":0.23023727673014363,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4413997677","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.037054434,0.000081100254,0.961449,0.0005306478,0.0004800346,0.0001403934,0.000033538243,0.0000066955167,0.00022411438],"genre_scores_gemma":[0.9731499,0.0000013847273,0.026559494,0.00013053307,0.00009774808,0.000003310215,0.0000011380477,0.000007915995,0.000048572423],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988094,0.0000030592814,0.0008357922,0.00012186232,0.00013630222,0.00009356959],"domain_scores_gemma":[0.99780166,0.00019398797,0.0010434929,0.0002150745,0.00071695034,0.00002882754],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00027214305,0.0001091758,0.00033688592,0.00018713495,0.0000493192,0.000037295536,0.000566105,0.00004809406,0.000007847693],"category_scores_gemma":[0.00019403054,0.000083129096,0.00013134418,0.00020659351,0.000080596896,0.0001322347,0.00011826954,0.00016239613,0.0000034554646],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000048892856,0.00019586139,0.00018758971,0.00003337142,0.00013352622,4.5836663e-7,0.00043961708,0.7061455,0.0000063495454,0.2921474,0.00005583669,0.0006056075],"study_design_scores_gemma":[0.00027068856,0.000026311325,0.0011360073,0.00013975897,0.000017029206,0.000008969209,0.00001326341,0.6680325,0.000009963169,0.3302771,0.000018505856,0.000049877704],"about_ca_topic_score_codex":0.0000064820388,"about_ca_topic_score_gemma":0.0000024711749,"teacher_disagreement_score":0.9360955,"about_ca_system_score_codex":0.000087389846,"about_ca_system_score_gemma":0.000093769064,"threshold_uncertainty_score":0.33899063},"labels":[],"label_agreement":null}]}