{"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":"software","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"software","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0016506765,0.00013440917,0.9758261,0.00008479562,0.00012044877,0.00013609305,0.0010271171,0.012575379,0.008445034],"genre_scores_gemma":[0.021616729,0.00028063316,0.9616611,0.00013523236,0.00003993368,0.00080737757,0.0024022432,0.0039785663,0.00907811],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99946386,0.00011011288,0.00003169896,0.00005524175,0.00029091947,0.000048205053],"domain_scores_gemma":[0.9990779,0.0003822028,0.000038095714,0.00010143832,0.00035416632,0.000046147765],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007849344,0.0009964145,0.0010480578,0.0007687279,0.00063256174,0.0008624413,0.0025839747,0.0009506843,0.026349321],"category_scores_gemma":[0.0023337498,0.0007170034,0.0011641169,0.0010323643,0.00045692292,0.000747062,0.0011201821,0.0020385871,0.008658242],"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.0003160641,0.0002142554,0.001412166,0.0007823811,0.00014443227,0.0003513391,0.0003076824,0.4895636,0.027555196,0.080233425,0.08716849,0.3119509],"study_design_scores_gemma":[0.00009382101,0.000040927447,0.00030141926,0.0000484162,0.000029816412,0.00016304215,0.000024177634,0.85902774,0.005216826,0.011713745,0.1232968,0.000043212996],"about_ca_topic_score_codex":0.008681002,"about_ca_topic_score_gemma":0.011008514,"teacher_disagreement_score":0.026349321,"about_ca_system_score_codex":0.0005214785,"about_ca_system_score_gemma":0.0022929441,"threshold_uncertainty_score":0.08814728},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.040735595,0.00032414473,0.95271415,0.00008782606,0.000032527114,0.000026341011,0.000028349856,0.00014696123,0.005904061],"genre_scores_gemma":[0.97314835,0.00019287987,0.023777457,0.000033944496,0.0000350476,0.00008137473,0.00007924158,0.0000395014,0.0026122753],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995253,0.00013442322,0.000031330328,0.00007654422,0.00018960744,0.00004283112],"domain_scores_gemma":[0.99932444,0.00019442628,0.000088837325,0.000033448723,0.0003382076,0.000020642015],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010707786,0.0007313336,0.00054449734,0.00058596255,0.00027505064,0.0006574569,0.0009478091,0.00049138494,0.001837547],"category_scores_gemma":[0.0019751932,0.00019793151,0.00039683955,0.00028462673,0.0005393999,0.00087268895,0.0009023684,0.00057459367,0.00026892862],"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.00014083146,0.00003747025,0.00062603067,0.0002418704,0.0000560035,0.00029563278,0.00018322606,0.8045639,0.039068893,0.10010879,0.0012023933,0.053475],"study_design_scores_gemma":[0.0000034900595,0.000028350492,0.00008838731,0.000005993291,0.00000499001,0.00001881119,0.0000099044755,0.99192667,0.0015609697,0.0060584215,0.00028971577,0.0000042887627],"about_ca_topic_score_codex":0.0009964516,"about_ca_topic_score_gemma":0.00077566295,"teacher_disagreement_score":0.001837547,"about_ca_system_score_codex":0.00073559984,"about_ca_system_score_gemma":0.00040027706,"threshold_uncertainty_score":0.006147206},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.39609766,0.001044403,0.59045535,0.00080252375,0.000068352274,0.00013113233,0.0003217926,0.00047998474,0.010598761],"genre_scores_gemma":[0.9804786,0.00027930483,0.01633273,0.000043798507,0.00003171064,0.000050779887,0.000112457004,0.00007690199,0.0025937092],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99955183,0.0001520918,0.000014892273,0.00005832919,0.000112164606,0.00011068587],"domain_scores_gemma":[0.9966995,0.0023691347,0.00031294758,0.00008085546,0.00040741975,0.00013005732],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016302895,0.0005859595,0.0006432695,0.0008559092,0.00057266717,0.0010860731,0.0011339579,0.00080923253,0.002672419],"category_scores_gemma":[0.005785074,0.00029264844,0.0005064819,0.00066421495,0.0007768284,0.0011223326,0.0006895606,0.0010755181,0.00031586332],"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.00014408387,0.000105650615,0.0032816723,0.00008932474,0.000041957075,0.0002827373,0.00035052854,0.8943617,0.006942561,0.085020676,0.0012399248,0.008139174],"study_design_scores_gemma":[0.0000022585677,0.000008022398,0.00018590277,0.0000021285662,0.000001956776,0.000011410275,0.000022088767,0.9970504,0.00015862363,0.0024772503,0.00007486336,0.000005006954],"about_ca_topic_score_codex":0.013346688,"about_ca_topic_score_gemma":0.0056836405,"teacher_disagreement_score":0.013346688,"about_ca_system_score_codex":0.0023610597,"about_ca_system_score_gemma":0.0013313758,"threshold_uncertainty_score":0.026538014},"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":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.431382,0.0011254181,0.45452243,0.001173017,0.0004619216,0.00018693779,0.0004304224,0.0009887157,0.10972906],"genre_scores_gemma":[0.8938286,0.0007749539,0.07796585,0.00031079663,0.00028532493,0.00018062511,0.00027734507,0.00022995302,0.026146574],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9984394,0.00030109045,0.00013906074,0.00044980246,0.00040022095,0.00027046676],"domain_scores_gemma":[0.99773824,0.0007999481,0.00022247231,0.00051851,0.00042526473,0.00029568342],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001804742,0.00042801013,0.00048320886,0.0014751492,0.0015321479,0.0028789681,0.00049454597,0.0006944673,0.0036066398],"category_scores_gemma":[0.0036133875,0.00044376295,0.0009146852,0.00065679365,0.0045789275,0.0067273783,0.003046285,0.0018766241,0.00068648806],"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.000026039119,0.000015603839,0.0003015918,0.000024868536,0.00000515865,0.00009762329,0.00047430512,0.00039246553,0.0025364552,0.98718876,0.00028999674,0.008646953],"study_design_scores_gemma":[0.000018031822,0.00007142225,0.00076050457,0.00003350857,0.000023587692,0.0005426313,0.00039373795,0.004509557,0.008434383,0.9668733,0.018308913,0.000030338655],"about_ca_topic_score_codex":0.00094255403,"about_ca_topic_score_gemma":0.000608178,"teacher_disagreement_score":0.0036066398,"about_ca_system_score_codex":0.0011146951,"about_ca_system_score_gemma":0.00094975403,"threshold_uncertainty_score":0.012065411},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7841524,0.0017421725,0.18634108,0.0007894712,0.00007579433,0.00012484269,0.0006839142,0.000550868,0.025539463],"genre_scores_gemma":[0.959442,0.00083212677,0.034423284,0.000066145796,0.00015527217,0.00015549237,0.0006523909,0.0001206487,0.0041526225],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.996407,0.00039482684,0.0003636247,0.0008351433,0.0012093488,0.0007901332],"domain_scores_gemma":[0.9682644,0.024396688,0.0025689711,0.002420686,0.0009271853,0.0014221417],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0024803728,0.0009557569,0.0015288994,0.0026901965,0.0026796102,0.0047667976,0.0017789622,0.0011081657,0.0074700206],"category_scores_gemma":[0.013254342,0.00097499177,0.0025737209,0.0013793154,0.006118491,0.0114904195,0.004350452,0.0026779745,0.00067715195],"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.0010791267,0.00025113512,0.010298116,0.0004186342,0.00008616099,0.0007065834,0.0019671672,0.023542153,0.014342194,0.9028709,0.00087642483,0.0435614],"study_design_scores_gemma":[0.00007615071,0.000182425,0.0019235453,0.000109693196,0.00012796775,0.0007101937,0.0004252823,0.08736259,0.026839636,0.8788867,0.0032826748,0.000073062925],"about_ca_topic_score_codex":0.0017423749,"about_ca_topic_score_gemma":0.0010318898,"teacher_disagreement_score":0.0074700206,"about_ca_system_score_codex":0.0027125191,"about_ca_system_score_gemma":0.0017097237,"threshold_uncertainty_score":0.024989665},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06449563,0.00014221728,0.92698294,0.00020990608,0.00011167096,0.00008009792,0.000036500463,0.00019349814,0.0077475654],"genre_scores_gemma":[0.71349317,0.0003161466,0.266014,0.0001053652,0.00009607491,0.00018448131,0.00007557623,0.00013744285,0.019577602],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9998752,0.000048459693,0.0000042249744,0.000010363788,0.000051127045,0.000010609355],"domain_scores_gemma":[0.99977607,0.00010219204,0.000021295145,0.000016053309,0.000062827814,0.000021559856],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00035692897,0.00041334447,0.00039385012,0.00048062328,0.00033876038,0.00045567128,0.0005656419,0.0005865356,0.0023010492],"category_scores_gemma":[0.00085790677,0.00019818477,0.0003612951,0.0002011403,0.00080289034,0.0005601499,0.000789005,0.00065809407,0.00033638807],"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.00015558687,0.00008523392,0.0006333881,0.00012280289,0.000033424527,0.0005284576,0.00018563434,0.8161501,0.04054092,0.07485158,0.0012766703,0.065436244],"study_design_scores_gemma":[0.0000061752203,0.000017173817,0.000058269907,0.0000031538916,0.0000013718073,0.000022613107,0.000006808165,0.99491334,0.001209094,0.003265198,0.000493748,0.0000030323856],"about_ca_topic_score_codex":0.001739467,"about_ca_topic_score_gemma":0.0010156028,"teacher_disagreement_score":0.0023010492,"about_ca_system_score_codex":0.0003865613,"about_ca_system_score_gemma":0.0005787351,"threshold_uncertainty_score":0.007697761},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.017856428,0.00028146408,0.97742486,0.00020984365,0.00016014476,0.00003774847,0.000014993825,0.00014575284,0.0038687545],"genre_scores_gemma":[0.51045996,0.0005441655,0.47804657,0.00023314179,0.00013287859,0.00026465658,0.00005476205,0.00019540316,0.010068437],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99924564,0.00024601453,0.00004547813,0.00004136978,0.00037795305,0.000043539134],"domain_scores_gemma":[0.9982486,0.0009496514,0.00012503442,0.0003185791,0.00029831112,0.000059770085],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013359707,0.0004152061,0.00057509524,0.00053279323,0.000582453,0.00081621256,0.0010276271,0.00077950757,0.0016232852],"category_scores_gemma":[0.0062085288,0.00025827764,0.0006547456,0.00027018198,0.0013911413,0.00086088915,0.0022223187,0.0014541743,0.00034900114],"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.00012581439,0.00009331346,0.001387444,0.0003543459,0.00007339053,0.0002934328,0.00045364685,0.17015563,0.03643268,0.7003375,0.0012872475,0.08900551],"study_design_scores_gemma":[0.000021916549,0.000041140072,0.00017345214,0.000028900942,0.000009754166,0.00008294482,0.000016252736,0.9323702,0.0067813736,0.055591952,0.004863955,0.000018066907],"about_ca_topic_score_codex":0.0008318162,"about_ca_topic_score_gemma":0.00077172916,"teacher_disagreement_score":0.0016232852,"about_ca_system_score_codex":0.00052119716,"about_ca_system_score_gemma":0.0008241448,"threshold_uncertainty_score":0.007065356},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0015785526,0.00017464189,0.99617153,0.000110861336,0.00009976136,0.000046003996,0.000024028433,0.00013114835,0.0016635546],"genre_scores_gemma":[0.06544145,0.00041119306,0.9205056,0.00017295299,0.00011268699,0.00041300445,0.00013265078,0.00034529588,0.012465115],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99946624,0.00014500543,0.00002013778,0.000036895173,0.00029410166,0.00003771235],"domain_scores_gemma":[0.99945825,0.00021753837,0.000038674574,0.00009722768,0.00014494537,0.000043263513],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008345764,0.0005897872,0.00086998724,0.0007654571,0.00065073586,0.0007508529,0.0014387887,0.0015440233,0.0044330875],"category_scores_gemma":[0.0018397559,0.0005314018,0.00070643116,0.0006451123,0.0009348094,0.001193883,0.0015122233,0.0017976767,0.0016253045],"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.000121817946,0.00016962289,0.0004026083,0.0005988235,0.00009375053,0.00039904416,0.00029813583,0.24623857,0.04263393,0.491344,0.009888477,0.20781116],"study_design_scores_gemma":[0.000047273086,0.00003821025,0.00013421269,0.000038988044,0.000015170693,0.00015738427,0.000017135388,0.9172514,0.0042446144,0.057351217,0.020674529,0.000029891402],"about_ca_topic_score_codex":0.0011287503,"about_ca_topic_score_gemma":0.0013593743,"teacher_disagreement_score":0.0044330875,"about_ca_system_score_codex":0.00042171477,"about_ca_system_score_gemma":0.001005607,"threshold_uncertainty_score":0.014830172},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.014357037,0.00054874487,0.8893616,0.0006708149,0.00048148815,0.0005064059,0.006331454,0.057757355,0.02998506],"genre_scores_gemma":[0.17216192,0.0008061729,0.77223593,0.0002742143,0.00026386583,0.002149815,0.017403316,0.008496037,0.026208723],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994929,0.00011150317,0.0000487826,0.000051865904,0.000218831,0.00007609194],"domain_scores_gemma":[0.99861324,0.00030497438,0.00008696345,0.0003001076,0.00059869204,0.00009599896],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006808768,0.0009796317,0.00081710046,0.000889523,0.00095123425,0.00093707396,0.0024363466,0.00079072115,0.01673807],"category_scores_gemma":[0.0032064724,0.00037941636,0.00086107664,0.0015969108,0.00033292308,0.0006199808,0.0009863911,0.0017628386,0.0075793928],"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.0010174852,0.00032620173,0.0053209453,0.0014527786,0.00033837615,0.0016591916,0.00083003065,0.25026584,0.035203185,0.09943551,0.27768612,0.32646433],"study_design_scores_gemma":[0.00023356997,0.00013255418,0.0025524723,0.00005814371,0.00007805676,0.0006505905,0.00006941492,0.7548672,0.028697355,0.030996772,0.18158104,0.00008282879],"about_ca_topic_score_codex":0.0028551274,"about_ca_topic_score_gemma":0.0013909686,"teacher_disagreement_score":0.01673807,"about_ca_system_score_codex":0.0004951327,"about_ca_system_score_gemma":0.0012710128,"threshold_uncertainty_score":0.05599439},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0053283656,0.0003478017,0.9917218,0.00007712708,0.00004989163,0.000018895938,0.00001474445,0.0000437381,0.002397601],"genre_scores_gemma":[0.2172787,0.0017418894,0.7714069,0.0001241295,0.00011747917,0.00013511407,0.000084568914,0.000078468525,0.00903274],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9998516,0.00004171556,0.000008752499,0.000020783309,0.00006458007,0.0000125743045],"domain_scores_gemma":[0.9998512,0.000060646922,0.000013203088,0.00001545645,0.00004802579,0.000011410465],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004647211,0.0004774457,0.00045696317,0.0004317276,0.00031105292,0.0004913187,0.00070400466,0.0006203097,0.0014191896],"category_scores_gemma":[0.0007415275,0.0001613106,0.0005185716,0.00047210924,0.00049176544,0.0007082867,0.0005414305,0.001234277,0.00052650244],"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.000092929775,0.00010369517,0.00063307874,0.0005250324,0.00005036724,0.0003110204,0.00039081802,0.31252927,0.05263954,0.4992737,0.0013194061,0.13213116],"study_design_scores_gemma":[0.00001064017,0.00004694959,0.00007912418,0.000016165417,0.000008123538,0.00009906268,0.00003338531,0.9645015,0.0033842786,0.026166184,0.005642194,0.000012450456],"about_ca_topic_score_codex":0.0017212599,"about_ca_topic_score_gemma":0.0015392519,"teacher_disagreement_score":0.0017212599,"about_ca_system_score_codex":0.0003536383,"about_ca_system_score_gemma":0.0007023558,"threshold_uncertainty_score":0.004747629},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.026028391,0.0006972776,0.9694148,0.00018269605,0.00020773214,0.00002806286,0.000026715632,0.000111036294,0.0033033653],"genre_scores_gemma":[0.5370169,0.0017477535,0.44180217,0.00014928833,0.0002501342,0.00019080906,0.00020777434,0.00024680264,0.018388294],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9996567,0.00014847527,0.000022950824,0.000033004617,0.000107397325,0.000031459906],"domain_scores_gemma":[0.99859506,0.0007522429,0.00009112066,0.00011405747,0.00037269155,0.0000748598],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010757681,0.0005090194,0.0009823173,0.0008488549,0.0005730237,0.0010594043,0.0009922911,0.0017489301,0.0026276007],"category_scores_gemma":[0.0038434165,0.00035992256,0.00072208565,0.0007791084,0.0010471252,0.0006386617,0.0013045421,0.0016758123,0.0006444206],"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.00026480574,0.000131908,0.002155258,0.00047596646,0.00009386231,0.00024985353,0.0004884287,0.6825948,0.011586045,0.11149854,0.0027520466,0.1877085],"study_design_scores_gemma":[0.0000060998987,0.00001663289,0.00009364566,0.000019666222,0.0000029139437,0.000017236453,0.000018889641,0.9907873,0.0005863212,0.006852505,0.0015920065,0.0000067910805],"about_ca_topic_score_codex":0.003586795,"about_ca_topic_score_gemma":0.0035978446,"teacher_disagreement_score":0.003586795,"about_ca_system_score_codex":0.0004686116,"about_ca_system_score_gemma":0.0007797267,"threshold_uncertainty_score":0.008790255},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0126417065,0.00040864723,0.97786486,0.00017137494,0.0001097578,0.000052975225,0.000027662232,0.00011803604,0.008604923],"genre_scores_gemma":[0.31636375,0.0018375297,0.65601087,0.00031748318,0.00026398888,0.00029292444,0.00013170416,0.00038678898,0.024395028],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991841,0.00030315656,0.00004391098,0.00010133017,0.00029814022,0.00006939544],"domain_scores_gemma":[0.99830985,0.0008841451,0.00011821824,0.00020974208,0.00040063832,0.00007751005],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0026052895,0.0009898093,0.0010755535,0.0011719514,0.00053802814,0.0010957359,0.0014677563,0.0013054743,0.003209574],"category_scores_gemma":[0.0069059804,0.00034469692,0.0013921227,0.00092388055,0.0025046803,0.002955988,0.0015694123,0.002145392,0.0011536694],"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.000067292596,0.00003625655,0.00024635156,0.00013309445,0.00002445936,0.00013731184,0.0002546649,0.0855131,0.0050465264,0.8733494,0.0010264708,0.03416509],"study_design_scores_gemma":[0.000028951943,0.00009676184,0.0001476112,0.000043667504,0.00001881716,0.00012412624,0.00003020159,0.6544751,0.0048608817,0.33411363,0.006006118,0.000054201304],"about_ca_topic_score_codex":0.0013300292,"about_ca_topic_score_gemma":0.0010487036,"teacher_disagreement_score":0.003209574,"about_ca_system_score_codex":0.00072723906,"about_ca_system_score_gemma":0.00086925435,"threshold_uncertainty_score":0.013778269},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.029921109,0.0182351,0.83868796,0.022255715,0.0051881587,0.00023027156,0.0011499888,0.0013451774,0.08298662],"genre_scores_gemma":[0.3878342,0.014537457,0.56182826,0.008256264,0.005198525,0.000484379,0.00160935,0.0015269794,0.018724615],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.98773474,0.0021542495,0.0007615756,0.002136409,0.0050403294,0.0021726782],"domain_scores_gemma":[0.9581083,0.031405617,0.0010102659,0.005425669,0.002950079,0.001100094],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.009155561,0.0024346171,0.0027766346,0.0033744564,0.0036748163,0.0049745506,0.007824802,0.0027453273,0.01258352],"category_scores_gemma":[0.039238665,0.002097475,0.004787309,0.004426661,0.008922828,0.01650323,0.009158179,0.02537385,0.003306859],"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.0007123156,0.0002328416,0.002330421,0.0009571347,0.00012642259,0.0006446841,0.0009218457,0.029222706,0.007840865,0.8001765,0.045126144,0.111708],"study_design_scores_gemma":[0.000080824604,0.000253657,0.0011968078,0.00033156053,0.00012455066,0.00043995172,0.0002091917,0.051740807,0.009105585,0.880053,0.056337617,0.00012637711],"about_ca_topic_score_codex":0.0048046126,"about_ca_topic_score_gemma":0.0037201564,"teacher_disagreement_score":0.01258352,"about_ca_system_score_codex":0.004249104,"about_ca_system_score_gemma":0.001872904,"threshold_uncertainty_score":0.048419774},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.54882634,0.00079324556,0.43592176,0.00028137298,0.000049855953,0.000098615994,0.0001903026,0.00018701519,0.0136515815],"genre_scores_gemma":[0.8939929,0.0003635729,0.10180968,0.000043298907,0.000020790265,0.00008619807,0.00017829223,0.000046947705,0.003458382],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99911565,0.00032175344,0.000051322168,0.00019753208,0.00015207517,0.0001616863],"domain_scores_gemma":[0.9975914,0.0013453579,0.00043431853,0.0002968013,0.00013942046,0.00019280562],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00073070603,0.00062032416,0.0009987763,0.000726644,0.0007034285,0.0015280821,0.0011504118,0.0011314184,0.002794196],"category_scores_gemma":[0.0033710343,0.0004735398,0.00061933696,0.0013484611,0.0011678532,0.002257322,0.0016300372,0.00058792275,0.000296686],"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.00052228145,0.00012820473,0.0014397157,0.00025302992,0.00006154058,0.00048151592,0.00013577843,0.88754296,0.0058475602,0.07558052,0.001110664,0.026896223],"study_design_scores_gemma":[0.000044660654,0.00018167034,0.00036568943,0.000023794719,0.000021811804,0.0002576792,0.00010913851,0.96775895,0.0053651617,0.023508685,0.0023433797,0.000019508634],"about_ca_topic_score_codex":0.0020348975,"about_ca_topic_score_gemma":0.0015186187,"teacher_disagreement_score":0.002794196,"about_ca_system_score_codex":0.0006933533,"about_ca_system_score_gemma":0.00051872805,"threshold_uncertainty_score":0.009347558},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.021980707,0.00009933829,0.93862563,0.0002917199,0.00011196398,0.0003907109,0.0017423918,0.031545103,0.005212393],"genre_scores_gemma":[0.20846125,0.000095971285,0.7782673,0.00019154437,0.00004695895,0.00057275215,0.00491831,0.0028725013,0.0045733955],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99936205,0.00015459006,0.00002661243,0.00017050537,0.00020299366,0.000083330364],"domain_scores_gemma":[0.9986368,0.0005907389,0.00008421803,0.00042958322,0.00017115977,0.00008755076],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00095057685,0.0008214907,0.0005240319,0.0011089963,0.0003318957,0.0011373531,0.0024051345,0.00089056906,0.011948583],"category_scores_gemma":[0.004474912,0.00051313144,0.0008844563,0.0010408137,0.00046797196,0.0014275672,0.0014914875,0.0013060706,0.002313775],"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.00088889024,0.0004970071,0.0038280038,0.00048914074,0.00013424996,0.0004911824,0.00017727513,0.38640735,0.024084669,0.07417276,0.06527809,0.44355133],"study_design_scores_gemma":[0.00009846928,0.00007194383,0.00031682046,0.000011214866,0.000012688344,0.00011274528,0.000019332274,0.9553507,0.00846413,0.02338451,0.012140019,0.000017358845],"about_ca_topic_score_codex":0.0022546323,"about_ca_topic_score_gemma":0.0029807421,"teacher_disagreement_score":0.011948583,"about_ca_system_score_codex":0.0010919616,"about_ca_system_score_gemma":0.0015044357,"threshold_uncertainty_score":0.039972007},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0060824757,0.00021920049,0.9909452,0.00016400615,0.00007341526,0.00004951506,0.000043815773,0.00013708207,0.0022852067],"genre_scores_gemma":[0.1584683,0.00033335484,0.8345891,0.00015112468,0.00009213194,0.00031352608,0.00016717945,0.00011798608,0.0057672486],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997868,0.000060516606,0.000010201469,0.00003154356,0.00009672122,0.00001413279],"domain_scores_gemma":[0.99977833,0.0000898362,0.000019013127,0.00003612103,0.000049168368,0.000027432272],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00038478035,0.00040319067,0.0007615373,0.0002853367,0.00044860653,0.00048007202,0.0012882339,0.0013108236,0.0018858388],"category_scores_gemma":[0.00089016056,0.0002833361,0.0005684318,0.00030110197,0.00059933844,0.0007668399,0.0012580622,0.0008518293,0.0004938789],"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.00007996437,0.00012513131,0.00086736114,0.0004292683,0.000050660998,0.0003420164,0.00017784744,0.7387263,0.027028829,0.08517529,0.004252152,0.14274523],"study_design_scores_gemma":[0.000012260816,0.00001640239,0.000065632084,0.0000066955577,0.0000026367725,0.000058303725,0.000005210419,0.99321777,0.0007416581,0.0031889242,0.0026774162,0.000007187931],"about_ca_topic_score_codex":0.0015653758,"about_ca_topic_score_gemma":0.0012048779,"teacher_disagreement_score":0.0018858388,"about_ca_system_score_codex":0.000285362,"about_ca_system_score_gemma":0.00089867547,"threshold_uncertainty_score":0.0063087344},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.33418944,0.00065135845,0.6597871,0.000670289,0.000120748475,0.0004005902,0.0003447101,0.00053723826,0.0032984097],"genre_scores_gemma":[0.8079903,0.0002368394,0.18874311,0.00032115408,0.00013295918,0.00042474671,0.00094626105,0.0001901168,0.0010145743],"study_design_codex":"observational","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9749553,0.01007088,0.0015310437,0.0053725755,0.007143302,0.0009269014],"domain_scores_gemma":[0.7893478,0.17477049,0.010504071,0.016403925,0.0069456175,0.0020279668],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.03137385,0.0016897918,0.0028850466,0.00603012,0.0017237935,0.0046354015,0.003596899,0.0042987736,0.0040788413],"category_scores_gemma":[0.19551708,0.0010065885,0.0024930693,0.0028990475,0.005135407,0.0070452043,0.0048012943,0.0036995327,0.0011607396],"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.0056231716,0.0009261317,0.41574293,0.0010181651,0.0023528964,0.0019061799,0.0029130278,0.072453834,0.026473729,0.13665545,0.0021314423,0.33180305],"study_design_scores_gemma":[0.00053923106,0.001635375,0.10699994,0.00047669004,0.00079434284,0.0059009898,0.0018045321,0.5626666,0.037870407,0.27114797,0.00953052,0.00063349446],"about_ca_topic_score_codex":0.0008134193,"about_ca_topic_score_gemma":0.00036411037,"teacher_disagreement_score":0.03137385,"about_ca_system_score_codex":0.0010769899,"about_ca_system_score_gemma":0.0012779672,"threshold_uncertainty_score":0.1659227},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.004524,0.0008449797,0.9822923,0.00090054737,0.00036315637,0.000065269356,0.00017026471,0.00018616805,0.01065335],"genre_scores_gemma":[0.25382632,0.0031896061,0.719425,0.0029323355,0.0012649109,0.0012670654,0.00069034693,0.00045760226,0.016946694],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99564385,0.0010743409,0.0005107659,0.0011061609,0.001327951,0.00033705455],"domain_scores_gemma":[0.9955942,0.0023154048,0.00036136154,0.00043807892,0.0010462587,0.0002447313],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004096418,0.0009586009,0.0010887728,0.0015713307,0.0015985614,0.0031040998,0.0024453632,0.002404686,0.0051045865],"category_scores_gemma":[0.0060894093,0.0008022494,0.0018546714,0.0019837664,0.008043929,0.008012153,0.0033587054,0.005223435,0.0016131741],"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.0000071470477,0.0000068983013,0.000058407626,0.000038287093,0.0000052366822,0.0000713819,0.00020683659,0.0015243184,0.00065386685,0.9936991,0.00042681166,0.0033016163],"study_design_scores_gemma":[0.000009368504,0.000038738755,0.000068506575,0.0000479369,0.000015771726,0.00023780725,0.00007036826,0.018017115,0.0010118183,0.9423332,0.038117178,0.00003206292],"about_ca_topic_score_codex":0.0010960537,"about_ca_topic_score_gemma":0.0007201161,"teacher_disagreement_score":0.0051045865,"about_ca_system_score_codex":0.0015020437,"about_ca_system_score_gemma":0.001621763,"threshold_uncertainty_score":0.021664202},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01900487,0.0006577422,0.95081294,0.0013104245,0.00026968392,0.00019374245,0.0008951024,0.0004028608,0.026452651],"genre_scores_gemma":[0.5146487,0.0017403257,0.44130844,0.0010360575,0.00039470673,0.001325821,0.0026801382,0.0003925821,0.036473233],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9981969,0.00033207223,0.00024062746,0.00031118788,0.00071287405,0.00020641164],"domain_scores_gemma":[0.9971814,0.001436223,0.0003381939,0.00013686421,0.0008261646,0.00008114653],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013245209,0.0007414133,0.0006690909,0.00096375484,0.0008271754,0.002180386,0.001162987,0.0012955267,0.0071501373],"category_scores_gemma":[0.007641653,0.00054533797,0.0018386153,0.0011145418,0.001435647,0.0037788008,0.0015785227,0.002973077,0.0015196493],"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.000011297802,0.000013975519,0.00019846225,0.000054725086,0.000011277791,0.00021790079,0.0004661931,0.009387586,0.00095885724,0.9820062,0.0015328035,0.0051408876],"study_design_scores_gemma":[0.000033045522,0.000012783426,0.00008076363,0.000025610694,0.000017021446,0.00017556215,0.000118758326,0.09075284,0.00084436225,0.89176834,0.016150022,0.00002096031],"about_ca_topic_score_codex":0.0054601342,"about_ca_topic_score_gemma":0.004521857,"teacher_disagreement_score":0.0071501373,"about_ca_system_score_codex":0.0019347648,"about_ca_system_score_gemma":0.0015967458,"threshold_uncertainty_score":0.023919642},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.016174303,0.0004777703,0.9780124,0.00018421619,0.00015237623,0.000107418025,0.000076467964,0.00033720105,0.0044777966],"genre_scores_gemma":[0.15832156,0.00071112934,0.83138937,0.00008649847,0.00006110644,0.00035018384,0.00016672903,0.00014940264,0.008764003],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995347,0.00010060107,0.00003228536,0.000022075614,0.00027172393,0.0000386442],"domain_scores_gemma":[0.9990645,0.0003083057,0.00010148137,0.00018453789,0.0002880002,0.00005321365],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00083811034,0.0005328742,0.0007132279,0.0006752338,0.00058186287,0.00080782454,0.0016395827,0.0010872864,0.0024417532],"category_scores_gemma":[0.002497437,0.0003117539,0.00067807094,0.00079581863,0.0008608535,0.0011460192,0.0007901784,0.0017815611,0.00071783445],"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.00019547582,0.00017313706,0.0018245972,0.00065742404,0.000098142205,0.00035318677,0.0007583513,0.4903979,0.041974314,0.2797363,0.0040470227,0.17978416],"study_design_scores_gemma":[0.000019849647,0.000023811672,0.00010288934,0.000013753435,0.000005224738,0.00006236424,0.000017508199,0.9885831,0.0025809787,0.0054083467,0.0031654192,0.000016712369],"about_ca_topic_score_codex":0.0034190645,"about_ca_topic_score_gemma":0.0044464963,"teacher_disagreement_score":0.0034190645,"about_ca_system_score_codex":0.0010046073,"about_ca_system_score_gemma":0.001589791,"threshold_uncertainty_score":0.008168519},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12675855,0.00059494516,0.8642186,0.0002961192,0.00016486074,0.00006135302,0.000043481083,0.00017095654,0.00769113],"genre_scores_gemma":[0.8887567,0.00058700994,0.098842666,0.00006301939,0.00009160824,0.00011846871,0.00005654562,0.00005763494,0.011426322],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.999892,0.000046943427,0.00000307833,0.000009631756,0.000037170917,0.000011183641],"domain_scores_gemma":[0.9998147,0.00010696043,0.000017374636,0.0000105157205,0.0000335582,0.000016830954],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00023919444,0.00036740807,0.00029227065,0.00041718016,0.00023984666,0.00032884625,0.0004747753,0.0004365031,0.00083433866],"category_scores_gemma":[0.0008003738,0.00015531095,0.00031531876,0.00024312088,0.0009813379,0.00050786283,0.00078118814,0.0005423565,0.000117762225],"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.00015089092,0.000060886072,0.000760646,0.00019788308,0.00004927029,0.00068558595,0.00020738384,0.732623,0.06284177,0.15685567,0.000861516,0.044705473],"study_design_scores_gemma":[0.000009807825,0.000024467157,0.0001397541,0.00000382937,0.0000024693236,0.00004557282,0.000011843747,0.9846144,0.0030146367,0.011674282,0.00045257536,0.0000064331343],"about_ca_topic_score_codex":0.002163524,"about_ca_topic_score_gemma":0.00085168646,"teacher_disagreement_score":0.002163524,"about_ca_system_score_codex":0.0003344667,"about_ca_system_score_gemma":0.0004651849,"threshold_uncertainty_score":0.004301846},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.02316478,0.0006796254,0.97295296,0.00012452732,0.00010224755,0.00005317489,0.000040022085,0.00024310916,0.0026394585],"genre_scores_gemma":[0.30569735,0.00070304604,0.68860525,0.00007927535,0.00004470177,0.00022865826,0.00020297062,0.00008709567,0.0043515936],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99965525,0.00007070454,0.000027345628,0.00002495841,0.00019092666,0.000030874213],"domain_scores_gemma":[0.99932396,0.0002807959,0.00006193024,0.00011070539,0.00019705448,0.000025543985],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007343577,0.00046296394,0.0008143806,0.00046318027,0.000460092,0.00049500907,0.001182134,0.0010084651,0.0011976584],"category_scores_gemma":[0.0018391825,0.00025189284,0.0006161744,0.00047980098,0.0005697376,0.00094647176,0.00063802104,0.0011848728,0.00033611493],"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.00012008693,0.00012423978,0.001793947,0.000538082,0.00005374222,0.00015913289,0.0005057484,0.7182704,0.036814038,0.0860824,0.0017081132,0.1538301],"study_design_scores_gemma":[0.000014018808,0.000017498225,0.00009101622,0.000012060145,0.000004831067,0.000026749483,0.000011628296,0.991852,0.0037091011,0.0019068588,0.0023446768,0.000009617039],"about_ca_topic_score_codex":0.0037582675,"about_ca_topic_score_gemma":0.0032952714,"teacher_disagreement_score":0.0037582675,"about_ca_system_score_codex":0.00061728037,"about_ca_system_score_gemma":0.0009941136,"threshold_uncertainty_score":0.007472813},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.006496354,0.000101013036,0.9908716,0.00009373128,0.00006571483,0.000057982958,0.000032670672,0.0009193817,0.0013614909],"genre_scores_gemma":[0.060721997,0.000099823315,0.93445486,0.00006722349,0.00003706473,0.0001565677,0.00015221951,0.00020683912,0.004103375],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99944204,0.00008895376,0.000030033536,0.000073201096,0.00030627838,0.000059478713],"domain_scores_gemma":[0.9990729,0.00023125536,0.00005269937,0.00015671011,0.00044057705,0.000045942772],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007363219,0.0009582776,0.000701669,0.0007599537,0.0009224759,0.0007410305,0.001112449,0.000988643,0.005617942],"category_scores_gemma":[0.0024570464,0.0005495007,0.00052634865,0.0010357931,0.00071706186,0.0010108433,0.0010387147,0.0014302214,0.0021532902],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005328158,0.00017830114,0.0010285643,0.00024241534,0.00010669078,0.00036806735,0.0003335577,0.24308279,0.033349738,0.02872214,0.010692082,0.6813627],"study_design_scores_gemma":[0.000095674885,0.00010078324,0.0001600866,0.000009947262,0.000017150796,0.00018425766,0.000042273867,0.9685579,0.014332619,0.009503859,0.0069738356,0.000021726299],"about_ca_topic_score_codex":0.005038107,"about_ca_topic_score_gemma":0.0068939105,"teacher_disagreement_score":0.005617942,"about_ca_system_score_codex":0.0004516814,"about_ca_system_score_gemma":0.0017114222,"threshold_uncertainty_score":0.018793881},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.60055375,0.00048288112,0.3754602,0.005542258,0.00015809538,0.00029150952,0.0013847997,0.0014281449,0.014698398],"genre_scores_gemma":[0.9497259,0.0003199525,0.04367675,0.0003643394,0.00019446969,0.00023482501,0.0009436781,0.0002732951,0.004266729],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99252105,0.0013105005,0.00047225825,0.0020428512,0.0021760073,0.0014774625],"domain_scores_gemma":[0.9279216,0.058552057,0.0027876934,0.005573893,0.0034409242,0.0017238725],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004285796,0.00088712637,0.0014424443,0.0013751279,0.00237237,0.006692309,0.0038716504,0.0021370975,0.0067767925],"category_scores_gemma":[0.029040396,0.0008121507,0.0032706792,0.0013776289,0.0069971127,0.01407873,0.0038560578,0.0074548437,0.00040697286],"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.0008816615,0.0005675254,0.010941722,0.0005913034,0.00019425376,0.00066889747,0.0014210878,0.13443668,0.01256944,0.7953691,0.00411573,0.0382426],"study_design_scores_gemma":[0.00007721754,0.00009190532,0.0010027762,0.000032047607,0.000066941655,0.000122876,0.0002191611,0.20894478,0.011003122,0.77687925,0.0015015737,0.000058360944],"about_ca_topic_score_codex":0.004105948,"about_ca_topic_score_gemma":0.0032492806,"teacher_disagreement_score":0.0067767925,"about_ca_system_score_codex":0.004138863,"about_ca_system_score_gemma":0.0046473634,"threshold_uncertainty_score":0.030029655},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.003310369,0.00004589904,0.9950824,0.000054577304,0.00003118589,0.000031225736,0.000012544605,0.00029138458,0.0011403518],"genre_scores_gemma":[0.05784987,0.000151926,0.9387962,0.00004092778,0.000024720666,0.00022144052,0.00006765494,0.0001338435,0.0027133208],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999708,0.00004931043,0.000019227458,0.00003447696,0.00016535832,0.000023644967],"domain_scores_gemma":[0.9994337,0.00019176141,0.000044018103,0.000101159065,0.00019174314,0.00003769534],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008997498,0.00055226276,0.00085803727,0.000475195,0.0007741403,0.00081425486,0.0012584248,0.0009040393,0.0028610332],"category_scores_gemma":[0.0018025537,0.00045204838,0.00054901745,0.00079059263,0.00075762824,0.0009136438,0.0011313526,0.0011592419,0.0010474066],"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.00019665649,0.00013646533,0.000726862,0.00020036487,0.00004816081,0.00024902195,0.0002452024,0.603897,0.025809044,0.09455613,0.0030603772,0.2708747],"study_design_scores_gemma":[0.000036815098,0.00003020174,0.000063943975,0.000009134633,0.000008976262,0.00008523338,0.000010668972,0.9775982,0.0036162403,0.014367691,0.004162392,0.000010510178],"about_ca_topic_score_codex":0.0022297248,"about_ca_topic_score_gemma":0.0018430909,"teacher_disagreement_score":0.0028610332,"about_ca_system_score_codex":0.0005394737,"about_ca_system_score_gemma":0.0011949035,"threshold_uncertainty_score":0.009571075},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.753248,0.0011253804,0.15628602,0.00070965284,0.000094327916,0.000053778214,0.00026603302,0.00021050223,0.08800636],"genre_scores_gemma":[0.9771039,0.0004469134,0.01458705,0.00006866737,0.00013559908,0.000047423448,0.00032498513,0.00006189645,0.007223638],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989993,0.00013924319,0.00006546574,0.00015470822,0.00048228828,0.00015894021],"domain_scores_gemma":[0.9980122,0.00079617946,0.00021786822,0.00018320362,0.00050262874,0.00028787446],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011942254,0.00050047226,0.00067536643,0.0029313692,0.0013107132,0.0039060628,0.00079201587,0.0005122933,0.0052855387],"category_scores_gemma":[0.005756422,0.0003949478,0.0007410323,0.0016671387,0.0028429718,0.004336465,0.0020798757,0.0010859992,0.00036850566],"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.0000332768,0.000015463967,0.00096171093,0.000041790874,0.000011551894,0.00015705758,0.00017275248,0.002435147,0.0016928792,0.98436487,0.0006152121,0.009498303],"study_design_scores_gemma":[0.000013524646,0.000036978225,0.002407904,0.00002736283,0.000020163505,0.0010607643,0.00025392583,0.0352678,0.0033488784,0.9501366,0.007400383,0.000025823725],"about_ca_topic_score_codex":0.00048290013,"about_ca_topic_score_gemma":0.00040025896,"teacher_disagreement_score":0.0052855387,"about_ca_system_score_codex":0.0013125401,"about_ca_system_score_gemma":0.0004353267,"threshold_uncertainty_score":0.017681837},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0085312715,0.00016239198,0.99034977,0.00003168564,0.000015437547,0.000009369276,0.000008573879,0.000085216314,0.00080631685],"genre_scores_gemma":[0.24587268,0.00043635318,0.75081915,0.000051909254,0.00003138703,0.000097169584,0.000060814542,0.0000827634,0.0025478776],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99981874,0.000082360326,0.0000066173807,0.000019494966,0.000060655188,0.000012057049],"domain_scores_gemma":[0.999882,0.00006408611,0.00001128233,0.000013751856,0.000022484803,0.000006273026],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000493048,0.0005396823,0.00046346118,0.0002614776,0.00018905236,0.00036795417,0.0006805138,0.0006042317,0.00068927056],"category_scores_gemma":[0.00068673503,0.00025205524,0.0003140123,0.00026928858,0.00035936353,0.0007200745,0.00053711765,0.0006853992,0.00026479797],"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.000079488134,0.00007007943,0.00041504754,0.00013128069,0.000029872424,0.00009209624,0.00010822011,0.81913203,0.024714239,0.033750594,0.00051029964,0.12096677],"study_design_scores_gemma":[0.0000020657951,0.000018308749,0.000035613783,0.0000028723534,0.0000018619419,0.00001657968,0.000003118148,0.99689686,0.0009296641,0.0013798319,0.0007097129,0.0000034866293],"about_ca_topic_score_codex":0.0009902437,"about_ca_topic_score_gemma":0.0012501886,"teacher_disagreement_score":0.0009902437,"about_ca_system_score_codex":0.00025523093,"about_ca_system_score_gemma":0.00033450112,"threshold_uncertainty_score":0.0026075244},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.012020942,0.00031600165,0.9844758,0.00009723299,0.0001720677,0.00007368699,0.00010745901,0.00025916114,0.0024776317],"genre_scores_gemma":[0.12864745,0.00057827163,0.8607456,0.00011042666,0.00006915769,0.0004576161,0.00038489027,0.00017751218,0.008828995],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99985325,0.00003093285,0.000008646247,0.000017526285,0.00007512294,0.000014448233],"domain_scores_gemma":[0.9997447,0.000104120096,0.000026650943,0.000032543303,0.00006294015,0.000029022725],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004603693,0.00046954615,0.0007559424,0.00027371722,0.0003715611,0.00042133083,0.0008558697,0.0008288426,0.0025247629],"category_scores_gemma":[0.0006492965,0.00028500718,0.00053494214,0.00026431924,0.0003546077,0.0006105609,0.00073750096,0.0011094444,0.0007113893],"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.00019291328,0.0002212885,0.0035775977,0.0009848302,0.00011483291,0.0005679705,0.0004296035,0.62983173,0.09745395,0.15136467,0.0061541414,0.1091065],"study_design_scores_gemma":[0.000013390706,0.000024452229,0.000109916255,0.000012658603,0.000006146759,0.000052122337,0.000008589813,0.99056774,0.0031709136,0.0019068859,0.004119475,0.0000076125916],"about_ca_topic_score_codex":0.0023256084,"about_ca_topic_score_gemma":0.0025805617,"teacher_disagreement_score":0.0025247629,"about_ca_system_score_codex":0.00024141847,"about_ca_system_score_gemma":0.0014443555,"threshold_uncertainty_score":0.008446157},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.003209185,0.00017925532,0.99538934,0.00009770977,0.00005022009,0.000029084316,0.000008754501,0.00005992654,0.0009765114],"genre_scores_gemma":[0.16343005,0.00061209645,0.8319342,0.00016317864,0.0001313778,0.00026145295,0.00007767549,0.00013168665,0.0032583573],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99943167,0.0002831059,0.00003511407,0.00004985122,0.00016493561,0.000035282785],"domain_scores_gemma":[0.9993056,0.0003274135,0.000082936305,0.00007448734,0.00015435136,0.000055202363],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017059109,0.0012068707,0.0009500273,0.00074381696,0.0003288613,0.00057715253,0.0013727256,0.0010661844,0.00198119],"category_scores_gemma":[0.0038119347,0.00040150934,0.0006886766,0.00061989325,0.00089209224,0.0013456772,0.0014069531,0.0015866372,0.00043319789],"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.00019918525,0.0001310585,0.00061044516,0.00044861433,0.000087640634,0.00031173433,0.00023063053,0.60066175,0.018916797,0.23376594,0.0033452474,0.14129096],"study_design_scores_gemma":[0.000011640578,0.000052279618,0.00008837431,0.00001162693,0.0000039568376,0.000030336665,0.0000069817056,0.98902285,0.0013554889,0.008039283,0.00136662,0.000010490631],"about_ca_topic_score_codex":0.001371347,"about_ca_topic_score_gemma":0.0018606164,"teacher_disagreement_score":0.00198119,"about_ca_system_score_codex":0.00049443945,"about_ca_system_score_gemma":0.0009453474,"threshold_uncertainty_score":0.009021819},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0025152634,0.000087297645,0.9969469,0.000022655004,0.0000068587296,0.0000060119387,0.000022150789,0.00024646352,0.00014646455],"genre_scores_gemma":[0.3169458,0.00073451264,0.6768388,0.00011750352,0.00006425057,0.00012614489,0.0005782827,0.00032365686,0.004271122],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99956447,0.00009986857,0.000020617223,0.00012129508,0.00014445349,0.000049359383],"domain_scores_gemma":[0.9994854,0.00018715272,0.00007252883,0.00008380419,0.00013953232,0.00003157624],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007813635,0.00075347774,0.0007421948,0.0014119813,0.00027182995,0.001153152,0.0019080689,0.0010950639,0.0018215774],"category_scores_gemma":[0.0024739432,0.00060764374,0.0012708779,0.0015272646,0.0005697227,0.0016562688,0.0009976655,0.0013027393,0.0012803638],"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.00030259322,0.000077832185,0.002679092,0.00018595128,0.00013708416,0.00020470294,0.00021340455,0.6887257,0.025005613,0.03818421,0.002465089,0.24181876],"study_design_scores_gemma":[0.000002398519,0.0000101328515,0.00019072303,0.0000039568204,0.000008235428,0.00004418543,0.000007584076,0.9938862,0.0012819745,0.004063219,0.0004916247,0.00000978221],"about_ca_topic_score_codex":0.004403199,"about_ca_topic_score_gemma":0.003929259,"teacher_disagreement_score":0.004403199,"about_ca_system_score_codex":0.0005598342,"about_ca_system_score_gemma":0.0006144178,"threshold_uncertainty_score":0.008755147},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.038960345,0.00019175808,0.9585287,0.0002216386,0.00002803211,0.00002295117,0.000035952606,0.000169479,0.0018410392],"genre_scores_gemma":[0.84901595,0.000552142,0.1469121,0.00013212994,0.000054842098,0.00010446658,0.00017305985,0.00012337118,0.0029318586],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994288,0.00025558937,0.000031532807,0.000091690774,0.00015158586,0.00004078135],"domain_scores_gemma":[0.99593496,0.002680187,0.00038166504,0.0003718292,0.0005350354,0.00009622361],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0023022299,0.0005843413,0.0007104814,0.00088413863,0.00031738137,0.00096192426,0.0012044453,0.0013205393,0.0018790165],"category_scores_gemma":[0.017763393,0.00037390433,0.00067937135,0.000867699,0.00096914655,0.002265158,0.0013182724,0.0018496546,0.00035093975],"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.000023254095,0.000025624406,0.0011426865,0.00004876664,0.000016909424,0.00015038456,0.000109606866,0.88441366,0.0029443828,0.096237466,0.0005255894,0.01436161],"study_design_scores_gemma":[0.0000019883896,0.0000030904168,0.00007674711,0.000003792008,0.0000014198906,0.000017535656,0.0000056634226,0.9901571,0.00016029539,0.0094573395,0.00011111049,0.000003967163],"about_ca_topic_score_codex":0.0040562428,"about_ca_topic_score_gemma":0.001890126,"teacher_disagreement_score":0.0040562428,"about_ca_system_score_codex":0.0011230914,"about_ca_system_score_gemma":0.001033083,"threshold_uncertainty_score":0.0121755},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.45327678,0.00040856833,0.5308835,0.0005614462,0.0001170195,0.000049032333,0.00040556127,0.0006756735,0.013622505],"genre_scores_gemma":[0.9780066,0.000075084245,0.020686604,0.000051778563,0.00001396066,0.000031296364,0.00010608761,0.000036062524,0.000992504],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997075,0.00008945368,0.000015510483,0.00003229999,0.00009469146,0.000060448016],"domain_scores_gemma":[0.99887925,0.00067699625,0.00013558388,0.000111082336,0.00013590221,0.000061190716],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008248259,0.0003798275,0.0005842157,0.00039644726,0.00030677786,0.000724621,0.00071228377,0.001084403,0.0016162005],"category_scores_gemma":[0.002457708,0.00023516946,0.0005345815,0.0004486219,0.0006695987,0.00088910694,0.00072217983,0.00086525024,0.00014811842],"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.000031943837,0.000018835526,0.0006909895,0.000012988763,0.000008585015,0.00006167797,0.000023483975,0.97834057,0.0007823081,0.017916888,0.00018124102,0.0019305155],"study_design_scores_gemma":[0.0000021805329,0.000003232533,0.000045646688,7.4976475e-7,5.455607e-7,0.0000035713138,0.000001619994,0.9986161,0.000090318405,0.0011889109,0.000045373,0.0000017576284],"about_ca_topic_score_codex":0.008517027,"about_ca_topic_score_gemma":0.0035911482,"teacher_disagreement_score":0.008517027,"about_ca_system_score_codex":0.0005455189,"about_ca_system_score_gemma":0.00090382784,"threshold_uncertainty_score":0.016934931},"labels":[],"label_agreement":null}]}