{"meta":{"query_hash":"2da40dcb5435","filters":{"venue":"BIT Numerical Mathematics"},"cohort_total":37,"direct_labels_cover":0,"predictions_cover":37,"exported":37,"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/2da40dcb5435","api":"https://metacan.xera.ac/api/v1/cohort?venue=BIT+Numerical+Mathematics"},"results":[{"id":"W116296291","doi":"10.1023/a:1022380116022","title":"A Relation Between the Weighted Logarithmic Norm of a Matrix and the Lyapunov Equation","year":2000,"lang":"en","type":"article","venue":"BIT Numerical Mathematics","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":26,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto; Canada Research Chairs; Memorial University of Newfoundland","funders":"","keywords":"Mathematics; Logarithm; Eigenvalues and eigenvectors; Norm (philosophy); Positive-definite matrix; Matrix (chemical analysis); Applied mathematics; Pure mathematics; Mathematical analysis; Physics","score_opus":0.015426329057278391,"score_gpt":0.2456220619465703,"score_spread":0.2301957328892919,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W116296291","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.03869453,0.0009812004,0.94554496,0.0009582785,0.00035684914,0.000021454616,0.000076479206,0.00012529013,0.0132409455],"genre_scores_gemma":[0.78963786,0.0020164999,0.18331334,0.0006777102,0.00060198153,0.00011311837,0.00023241347,0.00024987935,0.023157218],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99948573,0.00018091736,0.000029571826,0.0001098008,0.00016268663,0.000031397103],"domain_scores_gemma":[0.9963253,0.0018704976,0.00044070344,0.0002134942,0.0009182084,0.00023169407],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012773004,0.0005964331,0.00040005447,0.00089969835,0.0003654886,0.00113909,0.00085108576,0.00091683114,0.0036722054],"category_scores_gemma":[0.010345577,0.0001939069,0.00030822813,0.000768843,0.0018719103,0.0035146468,0.0013274539,0.0017190138,0.0006224431],"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.000066830384,0.000032115087,0.00063301105,0.0001057198,0.00001940599,0.00009617868,0.00015315904,0.034611713,0.0073264064,0.9222938,0.00169399,0.0329676],"study_design_scores_gemma":[0.000009015271,0.00007549359,0.0004863657,0.000032491876,0.000010129232,0.00016656375,0.00004174873,0.34345865,0.0016895769,0.650293,0.0037024773,0.000034441407],"about_ca_topic_score_codex":0.0005493066,"about_ca_topic_score_gemma":0.0005791186,"teacher_disagreement_score":0.0036722054,"about_ca_system_score_codex":0.0004721536,"about_ca_system_score_gemma":0.0005007056,"threshold_uncertainty_score":0.012284756},"labels":[],"label_agreement":null},{"id":"W1535819777","doi":"10.1023/a:1021900403785","title":"Overlapping Schwarz Waveform Relaxation for the Heat Equation in N Dimensions","year":2002,"lang":"en","type":"article","venue":"BIT Numerical Mathematics","topic":"Advanced Mathematical Modeling in Engineering","field":"Computer Science","cited_by":53,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Mathematics; Bounded function; Convergence (economics); Compact convergence; Schwarz alternating method; Normal convergence; Modes of convergence (annotated index); Relaxation (psychology); Convergence tests; Applied mathematics; Rate of convergence; Additive Schwarz method; Mathematical analysis; Domain decomposition methods; Computer science; Finite element method; Discrete mathematics; Physics","score_opus":0.0535534274884741,"score_gpt":0.26076236078900883,"score_spread":0.20720893330053472,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1535819777","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.27577156,0.0019241815,0.6322171,0.0029764175,0.00082893716,0.000109791465,0.00018428285,0.00021557353,0.085772194],"genre_scores_gemma":[0.8795671,0.0010844404,0.07722344,0.0006879804,0.00035787403,0.00016866527,0.00030899723,0.00031295014,0.040288545],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99963784,0.00014983187,0.000017819302,0.000030500136,0.00010029282,0.000063586296],"domain_scores_gemma":[0.99891806,0.00055103307,0.000110673725,0.00011694069,0.00013946004,0.0001639334],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013877057,0.000733401,0.00053631293,0.00085793546,0.00083387765,0.0011893916,0.0011615853,0.0013012345,0.007231278],"category_scores_gemma":[0.0047832467,0.0004281968,0.0006736562,0.0005309466,0.0019685277,0.0028897237,0.0019506513,0.0018298267,0.00066129083],"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.00018341366,0.00003635546,0.00028575392,0.0000760632,0.000015534875,0.00013814178,0.00015341133,0.04396914,0.002454821,0.9425863,0.0017496782,0.008351433],"study_design_scores_gemma":[0.000041199928,0.000032910597,0.0002563113,0.000023844326,0.000006656323,0.000071559276,0.00008513456,0.5875791,0.00079152605,0.40953395,0.0015517432,0.000026132357],"about_ca_topic_score_codex":0.0016062114,"about_ca_topic_score_gemma":0.001586113,"teacher_disagreement_score":0.007231278,"about_ca_system_score_codex":0.00088076276,"about_ca_system_score_gemma":0.0008436007,"threshold_uncertainty_score":0.024191022},"labels":[],"label_agreement":null},{"id":"W1545311513","doi":"10.1023/a:1021944218806","title":"Fast Fourier Transform Solvers and Preconditioners for Quadratic Spline Collocation","year":2002,"lang":"en","type":"article","venue":"BIT Numerical Mathematics","topic":"Advanced Numerical Methods in Computational Mathematics","field":"Engineering","cited_by":15,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Preconditioner; Mathematics; Rate of convergence; Partial differential equation; Elliptic partial differential equation; Condition number; Applied mathematics; Constant coefficients; Dirichlet boundary condition; Fast Fourier transform; Boundary value problem; Mathematical analysis; Linear system; Computer science; Algorithm; Eigenvalues and eigenvectors","score_opus":0.02938821307998853,"score_gpt":0.26460464908493314,"score_spread":0.2352164360049446,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1545311513","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.0016302561,0.000109497196,0.9960284,0.00008297307,0.000071088965,0.000014841675,0.000032649117,0.00032979567,0.0017004053],"genre_scores_gemma":[0.05587184,0.0004413337,0.9308825,0.000078918616,0.00014071126,0.0001317998,0.00030859574,0.0007889691,0.011355208],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99905425,0.0002786995,0.000045176024,0.00006762349,0.00049164845,0.000062649975],"domain_scores_gemma":[0.9979693,0.0009720128,0.00010492844,0.00038115715,0.00050725637,0.00006524313],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001066484,0.0007263522,0.0009018363,0.00061847316,0.00078309915,0.0013007902,0.0012840751,0.001705807,0.008562252],"category_scores_gemma":[0.0062725944,0.0006410889,0.00080852566,0.001016784,0.00093678123,0.0020182445,0.0016516338,0.0031425864,0.00290684],"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.00032236846,0.00012455875,0.00033755696,0.0003421766,0.000056079236,0.00018307152,0.00035870608,0.26489133,0.016966688,0.35843584,0.01963382,0.33834776],"study_design_scores_gemma":[0.000030255876,0.000019270157,0.0000645399,0.000017025846,0.0000067092024,0.000050423987,0.000022974255,0.94244504,0.004973839,0.04249798,0.009857852,0.000014056502],"about_ca_topic_score_codex":0.0023594925,"about_ca_topic_score_gemma":0.0034969389,"teacher_disagreement_score":0.008562252,"about_ca_system_score_codex":0.00043487462,"about_ca_system_score_gemma":0.0012489775,"threshold_uncertainty_score":0.028643548},"labels":[],"label_agreement":null},{"id":"W1967726010","doi":"10.1007/s10543-010-0272-6","title":"High order local linearization methods: An approach for constructing A-stable explicit schemes for stochastic differential equations with additive noise","year":2010,"lang":"en","type":"article","venue":"BIT Numerical Mathematics","topic":"Stochastic processes and financial applications","field":"Economics, Econometrics and Finance","cited_by":24,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University; Montreal Neurological Institute and Hospital","funders":"","keywords":"Mathematics; Linearization; Integrator; Ordinary differential equation; Stochastic differential equation; Stability (learning theory); Convergence (economics); Applied mathematics; Differential equation; Order of accuracy; Attractor; Rate of convergence; Numerical stability; Mathematical analysis; Numerical analysis; Nonlinear system; Computer science","score_opus":0.0359320948880303,"score_gpt":0.2766361208859967,"score_spread":0.24070402599796642,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1967726010","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.0060669226,0.000114336835,0.9919199,0.00009307264,0.00004090284,0.00002301893,0.000010601222,0.00010185858,0.00162932],"genre_scores_gemma":[0.49485052,0.00062771194,0.486349,0.00029977452,0.00013980738,0.0003606524,0.000102277074,0.0003767222,0.016893564],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9996507,0.00020151671,0.00001934432,0.000028075156,0.00007969476,0.000020671374],"domain_scores_gemma":[0.99892575,0.0005781153,0.00011421673,0.00013167999,0.00017433635,0.000075957214],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014894039,0.0007787339,0.0006665108,0.0009958053,0.0005980791,0.0010112349,0.0011001512,0.0011720741,0.0024752237],"category_scores_gemma":[0.0030548193,0.00042171293,0.00079914334,0.00044817716,0.0015893037,0.0013736757,0.0024890713,0.001855285,0.0006128898],"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.00010405906,0.00011238448,0.00069655274,0.00026272726,0.00007461772,0.00015688282,0.00047830405,0.33217284,0.014239908,0.5946526,0.0018716069,0.05517763],"study_design_scores_gemma":[0.00000907408,0.000033432218,0.000041393505,0.000015420257,0.0000061993132,0.000012019826,0.000019033812,0.9592722,0.0012758283,0.037970837,0.0013341582,0.000010399754],"about_ca_topic_score_codex":0.0011172785,"about_ca_topic_score_gemma":0.0012789633,"teacher_disagreement_score":0.0024752237,"about_ca_system_score_codex":0.0005691574,"about_ca_system_score_gemma":0.00071124965,"threshold_uncertainty_score":0.008280456},"labels":[],"label_agreement":null},{"id":"W1973647496","doi":"10.1007/s10543-014-0505-1","title":"On the positivity of Poisson integrators for the Lotka–Volterra equations","year":2014,"lang":"en","type":"article","venue":"BIT Numerical Mathematics","topic":"Numerical methods for differential equations","field":"Mathematics","cited_by":9,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Dawson College","funders":"","keywords":"Integrator; Poisson distribution; Mathematics; Applied mathematics; Volterra integral equation; Ordinary differential equation; Differential equation; Exponential integrator; Partial differential equation; Population; Mathematical analysis; Computer science; Differential algebraic equation; Integral equation; Statistics","score_opus":0.10373033108643588,"score_gpt":0.36522923034023974,"score_spread":0.2614988992538039,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1973647496","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.17247994,0.0054600714,0.68576276,0.005723983,0.0011259229,0.00011975149,0.00016702001,0.00023262523,0.12892792],"genre_scores_gemma":[0.91871446,0.003023021,0.045588262,0.0012849988,0.0005749935,0.00016238795,0.00013502475,0.00042697237,0.030089838],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985892,0.0006182097,0.0000748241,0.00015202795,0.000403971,0.00016157939],"domain_scores_gemma":[0.99188656,0.0044325227,0.00079435855,0.000474323,0.0014542312,0.00095798017],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0063521294,0.0010010231,0.00149465,0.002212242,0.0027372856,0.0037356114,0.0021997856,0.0019540547,0.0054182205],"category_scores_gemma":[0.01974918,0.0007794021,0.0015709947,0.0011629171,0.0067023775,0.007056365,0.00454661,0.0040699984,0.0006310052],"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.000027006166,0.000013502974,0.00012988168,0.000047977046,0.000009043708,0.000048535687,0.00015314284,0.003193878,0.00081151514,0.99290633,0.00051384536,0.0021454056],"study_design_scores_gemma":[0.000020455711,0.000029069684,0.00026113633,0.00006469011,0.000016938919,0.00010999363,0.00008226923,0.13247757,0.00052395416,0.864145,0.0022359365,0.00003297217],"about_ca_topic_score_codex":0.0024197889,"about_ca_topic_score_gemma":0.0020894085,"teacher_disagreement_score":0.0063521294,"about_ca_system_score_codex":0.00216484,"about_ca_system_score_gemma":0.0020235751,"threshold_uncertainty_score":0.033593655},"labels":[],"label_agreement":null},{"id":"W1977219132","doi":"10.1007/s10543-006-0049-0","title":"Condition Numbers for Structured Least Squares Problems","year":2006,"lang":"en","type":"article","venue":"BIT Numerical Mathematics","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":23,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"","keywords":"Mathematics; Toeplitz matrix; Total least squares; Least-squares function approximation; Generalized least squares; Non-linear least squares; Linear least squares; Applied mathematics; Algebra over a field; Statistics; Explained sum of squares; Pure mathematics; Regression analysis; Linear model","score_opus":0.011017620092355728,"score_gpt":0.24290098895045403,"score_spread":0.2318833688580983,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1977219132","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.0064076437,0.00042834377,0.9831335,0.0007508077,0.00022984862,0.00006495122,0.0002532589,0.000249926,0.008481709],"genre_scores_gemma":[0.26528603,0.0018787383,0.707992,0.00090261985,0.0009844983,0.0012679512,0.0018509893,0.0008350274,0.019002154],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9966355,0.0013677969,0.00014555186,0.00033546565,0.0013391046,0.00017662994],"domain_scores_gemma":[0.9793682,0.015150779,0.0012622969,0.001375362,0.0022817377,0.0005615653],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004074739,0.0013737711,0.00096642086,0.0016058643,0.0009979217,0.0027212116,0.0017733173,0.0018963143,0.016770268],"category_scores_gemma":[0.043509085,0.0006610847,0.00049070513,0.0022381446,0.0027364893,0.0055113644,0.0019895448,0.0042507285,0.0035144163],"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.00012908477,0.000043105247,0.00032054677,0.00022975032,0.000019000643,0.00006761137,0.000097404576,0.06107397,0.0018200574,0.8679586,0.012782247,0.05545863],"study_design_scores_gemma":[0.00002630522,0.00002402729,0.00011378957,0.000046634836,0.0000052272057,0.000029343073,0.000023123683,0.23811464,0.00071803865,0.75803024,0.0028490846,0.000019501791],"about_ca_topic_score_codex":0.0010100915,"about_ca_topic_score_gemma":0.0015125487,"teacher_disagreement_score":0.016770268,"about_ca_system_score_codex":0.0012901974,"about_ca_system_score_gemma":0.0020959547,"threshold_uncertainty_score":0.056102157},"labels":[],"label_agreement":null},{"id":"W1982585708","doi":"10.1007/s10543-012-0373-5","title":"Superconvergent interpolants for collocation methods applied to Volterra integro-differential equations with delay","year":2012,"lang":"en","type":"article","venue":"BIT Numerical Mathematics","topic":"Differential Equations and Numerical Methods","field":"Mathematics","cited_by":21,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Collocation method; Superconvergence; Collocation (remote sensing); Orthogonal collocation; Mathematics; Differential equation; Applied mathematics; Mathematical analysis; Computer science; Ordinary differential equation; Finite element method","score_opus":0.11641433173198117,"score_gpt":0.41802981246433,"score_spread":0.30161548073234884,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1982585708","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.059492946,0.00064923026,0.935396,0.00012806506,0.0003732524,0.000053925036,0.000046532816,0.00014542068,0.0037147135],"genre_scores_gemma":[0.62422717,0.0011385976,0.36402842,0.00013613414,0.00014574632,0.00016624463,0.00017844462,0.00038481818,0.009594398],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9997061,0.00015383161,0.000017358421,0.000017793553,0.000085429005,0.000019446054],"domain_scores_gemma":[0.99864954,0.00071268366,0.000086176675,0.0001919649,0.00028655815,0.00007304672],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001451668,0.0004922689,0.000530681,0.0006629924,0.0005672435,0.0009336753,0.00072208524,0.00075272424,0.0017710524],"category_scores_gemma":[0.0031041515,0.00025424582,0.00039066494,0.00069614575,0.0008636531,0.00078663527,0.0010079445,0.0014146226,0.0003359522],"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.00069077185,0.0003075281,0.0026490209,0.00032885952,0.000088230314,0.00034705515,0.00069699413,0.3099157,0.03454582,0.4441851,0.0028035515,0.20344135],"study_design_scores_gemma":[0.0000116178335,0.000049721802,0.000149333,0.000023556435,0.0000075569997,0.000026344167,0.00003254982,0.975371,0.003823155,0.017452633,0.0030426076,0.000009905176],"about_ca_topic_score_codex":0.0013489479,"about_ca_topic_score_gemma":0.0023582007,"teacher_disagreement_score":0.0017710524,"about_ca_system_score_codex":0.0004928295,"about_ca_system_score_gemma":0.0006318899,"threshold_uncertainty_score":0.007677257},"labels":[],"label_agreement":null},{"id":"W1989095828","doi":"10.1007/s10543-012-0399-8","title":"Efficient methods for Volterra integral equations with highly oscillatory Bessel kernels","year":2013,"lang":"en","type":"article","venue":"BIT Numerical Mathematics","topic":"Fractional Differential Equations Solutions","field":"Mathematics","cited_by":62,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Memorial University of Newfoundland","funders":"","keywords":"Bessel function; Volterra integral equation; Mathematics; Piecewise; Integral equation; Mathematical analysis; Collocation method; Collocation (remote sensing); Bessel process; Convergence (economics); Applied mathematics; Constant (computer programming); Orthogonal polynomials; Differential equation; Computer science","score_opus":0.07701120780305769,"score_gpt":0.38058546694131434,"score_spread":0.30357425913825664,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1989095828","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.012560907,0.00056744495,0.98040056,0.00024062788,0.00017806236,0.000040670522,0.00003937774,0.00013940706,0.0058330083],"genre_scores_gemma":[0.26259813,0.0009499836,0.7139547,0.00022473537,0.00025389224,0.0002913779,0.00016532764,0.0005444001,0.021017414],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99956805,0.00015457296,0.000030162219,0.00002602545,0.00017948981,0.000041693347],"domain_scores_gemma":[0.99868983,0.00072546786,0.00007745781,0.00016425505,0.00026947062,0.00007351189],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013965479,0.0008655562,0.0009840984,0.00110955,0.00091577426,0.0014857146,0.0016843916,0.0014299204,0.004886556],"category_scores_gemma":[0.0040674363,0.0005178968,0.00081273244,0.0010104693,0.0011406579,0.0020860536,0.0021396615,0.0019756162,0.0012069098],"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.00017915397,0.00020911511,0.0007151081,0.00033584677,0.00011676598,0.00019511962,0.0004244025,0.21629514,0.011333273,0.62918967,0.003959679,0.13704681],"study_design_scores_gemma":[0.000025619709,0.000013583848,0.00007678781,0.00002101395,0.000010699701,0.000033618937,0.000029346262,0.9143293,0.000969114,0.08157997,0.0028990211,0.000011870743],"about_ca_topic_score_codex":0.0020908257,"about_ca_topic_score_gemma":0.0038625344,"teacher_disagreement_score":0.004886556,"about_ca_system_score_codex":0.0008479495,"about_ca_system_score_gemma":0.0010659092,"threshold_uncertainty_score":0.01634717},"labels":[],"label_agreement":null},{"id":"W2003787642","doi":"10.1007/s10543-010-0285-1","title":"Stability of collocation methods for delay differential equations with vanishing delays","year":2010,"lang":"en","type":"article","venue":"BIT Numerical Mathematics","topic":"Differential Equations and Numerical Methods","field":"Mathematics","cited_by":19,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Memorial University of Newfoundland","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Orthogonal collocation; Collocation (remote sensing); Mathematics; Piecewise; Collocation method; Delay differential equation; Exponential stability; Ordinary differential equation; Mathematical analysis; Applied mathematics; Differential equation; Nonlinear system; Computer science; Physics","score_opus":0.09032094547931405,"score_gpt":0.4079312092951325,"score_spread":0.31761026381581847,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2003787642","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.061641857,0.0012240764,0.9305186,0.0004775907,0.00023988994,0.000062241845,0.000046526344,0.000105989595,0.005683263],"genre_scores_gemma":[0.85925806,0.0011231846,0.12575766,0.00018284723,0.00017787758,0.00023730662,0.00014920169,0.0002731995,0.012840696],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99935514,0.00034983354,0.000034114044,0.00007095197,0.00014635632,0.000043567245],"domain_scores_gemma":[0.99444157,0.003874686,0.0003934906,0.0002643637,0.00085699925,0.00016897991],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021983008,0.0009599536,0.00064750994,0.001227391,0.0007883759,0.001490463,0.0010072433,0.0013631611,0.0018306673],"category_scores_gemma":[0.009948388,0.00046696715,0.00057504344,0.00057620986,0.0022249266,0.001428543,0.0021692046,0.0016301343,0.00030169074],"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.0006535317,0.00009931862,0.002239729,0.0003645373,0.00012367583,0.00016347098,0.0009085538,0.54923606,0.017831739,0.37635884,0.0020181276,0.050002377],"study_design_scores_gemma":[0.0000110383735,0.000021141825,0.000092111404,0.000020788322,0.000005647046,0.000009378676,0.00002589701,0.9741746,0.0009022934,0.02405005,0.00067718106,0.000009800305],"about_ca_topic_score_codex":0.004085159,"about_ca_topic_score_gemma":0.001713439,"teacher_disagreement_score":0.004085159,"about_ca_system_score_codex":0.0010295773,"about_ca_system_score_gemma":0.0011415744,"threshold_uncertainty_score":0.011625826},"labels":[],"label_agreement":null},{"id":"W2013758652","doi":"10.1007/s10543-006-0106-8","title":"Solving differential-algebraic equations by Taylor series (II): Computing the System Jacobian","year":2006,"lang":"en","type":"article","venue":"BIT Numerical Mathematics","topic":"Modeling and Simulation Systems","field":"Computer Science","cited_by":43,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"","keywords":"Jacobian matrix and determinant; Taylor series; Automatic differentiation; Nonlinear system; Mathematics; Algorithm; Applied mathematics; Algebraic equation; Code (set theory); Computation; Differential algebraic equation; Series (stratigraphy); Computer science; Differential equation; Ordinary differential equation; Mathematical analysis","score_opus":0.01650819104786249,"score_gpt":0.227166666810932,"score_spread":0.2106584757630695,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2013758652","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.020088911,0.00008279144,0.97282016,0.00011832101,0.000100074714,0.000030039342,0.000025141164,0.0007568556,0.0059776385],"genre_scores_gemma":[0.40527394,0.00024349822,0.5856936,0.0000827496,0.000090806425,0.000054424207,0.000131474,0.00069316855,0.007736354],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9998272,0.000031043633,0.00001037108,0.000025404437,0.0000848428,0.000021122709],"domain_scores_gemma":[0.99954385,0.00021012634,0.000030619904,0.000071911745,0.00011728723,0.000026209103],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00046130235,0.0004877648,0.0005734496,0.0005163845,0.00040784126,0.0006960376,0.000720676,0.0004489941,0.00472103],"category_scores_gemma":[0.0025934624,0.0002764002,0.00044750565,0.00052414427,0.00055985764,0.0011133797,0.0006698004,0.0008654819,0.0011182043],"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.00017308762,0.00013909905,0.002123832,0.0003422636,0.00005412492,0.00031496282,0.0003796428,0.42788345,0.034462225,0.16260228,0.007003935,0.36452118],"study_design_scores_gemma":[0.00001542849,0.00002447712,0.0001706649,0.000010019222,0.000010000942,0.000060778097,0.000026712296,0.9690165,0.0071850247,0.02105862,0.0024148484,0.000007001866],"about_ca_topic_score_codex":0.0027797457,"about_ca_topic_score_gemma":0.003223506,"teacher_disagreement_score":0.00472103,"about_ca_system_score_codex":0.00045636896,"about_ca_system_score_gemma":0.0008432444,"threshold_uncertainty_score":0.015793383},"labels":[],"label_agreement":null},{"id":"W2026422355","doi":"10.1007/s10543-010-0301-5","title":"Gibbs phenomenon and its removal for a class of orthogonal expansions","year":2010,"lang":"en","type":"article","venue":"BIT Numerical Mathematics","topic":"Mathematical functions and polynomials","field":"Mathematics","cited_by":12,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Gibbs phenomenon; Phenomenon; Mathematics; Classification of discontinuities; Eigenfunction; Mathematical analysis; Statistical physics; Fourier transform; Physics; Eigenvalues and eigenvectors; Quantum mechanics","score_opus":0.052763212739514315,"score_gpt":0.3207871811564155,"score_spread":0.26802396841690124,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2026422355","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.28849888,0.0023658643,0.57747704,0.003333954,0.0011715697,0.00010990403,0.00024063064,0.00063277595,0.12616946],"genre_scores_gemma":[0.9025639,0.0011820124,0.059876204,0.0011883816,0.001137491,0.00014982618,0.00028692337,0.00060980633,0.033005454],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985965,0.00046599482,0.00006663578,0.00019699875,0.0004673224,0.00020650806],"domain_scores_gemma":[0.9973002,0.0011664096,0.00030403302,0.00053637417,0.00029432643,0.00039866174],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002478394,0.000916494,0.0015480217,0.002341735,0.0026065921,0.0028737,0.0017062381,0.0022592118,0.0053174887],"category_scores_gemma":[0.008544804,0.00068522256,0.0020094335,0.0012319308,0.0046213693,0.004261016,0.0035700882,0.0044703702,0.00072529877],"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.0000133171125,0.00001225069,0.00009702585,0.000015733154,0.0000049833125,0.000037563805,0.00006481195,0.0003409756,0.0006903696,0.9962256,0.00059524766,0.0019022636],"study_design_scores_gemma":[0.000020143747,0.00002192045,0.00035543827,0.00002026338,0.000014916009,0.0003125501,0.000054191067,0.027058544,0.0008079137,0.9684976,0.0028103434,0.000026151461],"about_ca_topic_score_codex":0.00082080846,"about_ca_topic_score_gemma":0.0007359178,"teacher_disagreement_score":0.0053174887,"about_ca_system_score_codex":0.0008343442,"about_ca_system_score_gemma":0.00096432574,"threshold_uncertainty_score":0.017788768},"labels":[],"label_agreement":null},{"id":"W2034834278","doi":"10.1007/s10543-009-0225-0","title":"Rate of convergence of Local Linearization schemes for random differential equations","year":2009,"lang":"en","type":"article","venue":"BIT Numerical Mathematics","topic":"Numerical methods for differential equations","field":"Mathematics","cited_by":11,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University; Montreal Neurological Institute and Hospital","funders":"","keywords":"Discretization; Mathematics; Linearization; Convergence (economics); Rate of convergence; Applied mathematics; Mathematical analysis; Order (exchange); Nonlinear system; Computer science; Key (lock); Physics","score_opus":0.06994256565394194,"score_gpt":0.3639990631491104,"score_spread":0.2940564974951685,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2034834278","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.29403743,0.0039751567,0.67642534,0.0024784065,0.0003137746,0.00024808597,0.00030951717,0.0010640139,0.021148331],"genre_scores_gemma":[0.9181709,0.002003679,0.057569962,0.00034932437,0.00020908583,0.00039404634,0.0005188105,0.0008008569,0.019983303],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9979115,0.0011532384,0.00009084448,0.0001998349,0.00038269538,0.00026178098],"domain_scores_gemma":[0.94705707,0.0411449,0.0025298095,0.002816725,0.0047514136,0.0017000446],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.011554081,0.0012912602,0.0014481057,0.0022702937,0.0013727387,0.002281408,0.00211947,0.002191494,0.0059388704],"category_scores_gemma":[0.048806172,0.00072693045,0.0010350883,0.0007897659,0.0037632913,0.004025532,0.004886201,0.0036109914,0.0008428728],"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.0010703377,0.00021991153,0.005905673,0.0007400449,0.00015482288,0.0003011584,0.0013386031,0.28140032,0.021220174,0.6550752,0.0044885143,0.028085226],"study_design_scores_gemma":[0.000037590824,0.00013121526,0.0007846943,0.000072423536,0.000027967812,0.00010299626,0.00010240957,0.9461968,0.004157496,0.047366887,0.00097144465,0.000047995378],"about_ca_topic_score_codex":0.0021283135,"about_ca_topic_score_gemma":0.0009476822,"teacher_disagreement_score":0.011554081,"about_ca_system_score_codex":0.0017979573,"about_ca_system_score_gemma":0.0014408118,"threshold_uncertainty_score":0.061104536},"labels":[],"label_agreement":null},{"id":"W2051958060","doi":"10.1007/s10543-006-0075-y","title":"Some observations on local least squares","year":2006,"lang":"en","type":"article","venue":"BIT Numerical Mathematics","topic":"Advanced Numerical Analysis Techniques","field":"Engineering","cited_by":12,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary; University of Waterloo","funders":"","keywords":"Least-squares function approximation; Mathematics; Generalized least squares; Residual sum of squares; Non-linear least squares; Total least squares; Explained sum of squares; Applied mathematics; Statistics; Mathematical optimization; Algorithm; Regression analysis","score_opus":0.016503751052845943,"score_gpt":0.23404344205685487,"score_spread":0.21753969100400894,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2051958060","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.01484477,0.008132677,0.89950806,0.012163548,0.0010027786,0.000042100262,0.0003608175,0.0004923567,0.06345293],"genre_scores_gemma":[0.4965127,0.015949912,0.3892208,0.007980232,0.0101229865,0.00027659754,0.0010437294,0.001739593,0.077153504],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9969326,0.0011777116,0.00015026738,0.0005028402,0.001085145,0.00015143107],"domain_scores_gemma":[0.97497106,0.01873749,0.0009840933,0.0028862485,0.0021888583,0.00023225388],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0059902477,0.0015013632,0.0010830562,0.0021249945,0.0017396508,0.0025215116,0.001818903,0.0017796049,0.01008435],"category_scores_gemma":[0.031808645,0.0010463065,0.0011301823,0.0034796936,0.007578482,0.008022848,0.0032562313,0.006203464,0.0024752826],"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.00015060426,0.000051185132,0.0008935793,0.0004821763,0.000052154563,0.00029218878,0.00072022766,0.014742803,0.0021353127,0.90245575,0.02242571,0.05559831],"study_design_scores_gemma":[0.000029591729,0.00003727782,0.0011816514,0.00011829368,0.000029064518,0.00024587367,0.00017232964,0.04096686,0.002305997,0.9293537,0.025495537,0.00006393844],"about_ca_topic_score_codex":0.0028904316,"about_ca_topic_score_gemma":0.0024899428,"teacher_disagreement_score":0.01008435,"about_ca_system_score_codex":0.0012061237,"about_ca_system_score_gemma":0.0005621366,"threshold_uncertainty_score":0.033735573},"labels":[],"label_agreement":null},{"id":"W2056736630","doi":"10.1007/s10543-007-0134-z","title":"Energy drift in molecular dynamics simulations","year":2007,"lang":"en","type":"article","venue":"BIT Numerical Mathematics","topic":"Quantum, superfluid, helium dynamics","field":"Physics and Astronomy","cited_by":15,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Verlet integration; Statistical physics; Brownian motion; Molecular dynamics; Hamiltonian (control theory); Energy (signal processing); Stochastic differential equation; Dynamics (music); Physics; Hamiltonian system; Classical mechanics; Mathematics; Quantum mechanics; Mathematical optimization","score_opus":0.005888820163109136,"score_gpt":0.24436614977475704,"score_spread":0.23847732961164791,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2056736630","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.5783419,0.003840452,0.37836307,0.003970517,0.0009846444,0.00021477883,0.0003087269,0.0005736551,0.033402275],"genre_scores_gemma":[0.9487593,0.0007210655,0.043932647,0.00030995076,0.00009928735,0.00014898686,0.000146612,0.00023934881,0.005642887],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99936694,0.00031175383,0.000028416753,0.00004745301,0.00017598073,0.00006948226],"domain_scores_gemma":[0.9967451,0.0022735407,0.00020853305,0.0002544622,0.0003483354,0.00016991365],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0025708938,0.00047244396,0.00086995703,0.0012095643,0.00118113,0.0016103496,0.0011599245,0.0018056183,0.002227759],"category_scores_gemma":[0.014124957,0.000524949,0.00036568916,0.0011706471,0.0018020947,0.0030293295,0.0018693685,0.0015317496,0.00033287422],"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.00018697653,0.00008124303,0.0015284881,0.00010126144,0.0000361506,0.00007363505,0.00016333317,0.8299108,0.0023813695,0.15574211,0.0007722155,0.009022433],"study_design_scores_gemma":[0.0000105319605,0.0000062427416,0.0000851518,0.000008074611,0.0000021555047,0.0000049722184,0.000008333326,0.98973596,0.00034638614,0.009473451,0.00031390984,0.0000048557354],"about_ca_topic_score_codex":0.0048982766,"about_ca_topic_score_gemma":0.0026857187,"teacher_disagreement_score":0.0048982766,"about_ca_system_score_codex":0.0017753848,"about_ca_system_score_gemma":0.0011381627,"threshold_uncertainty_score":0.013596356},"labels":[],"label_agreement":null},{"id":"W2067134767","doi":"10.1007/s10543-010-0277-1","title":"Convergence and stability of a stabilized finite volume method for the stationary Navier-Stokes equations","year":2010,"lang":"en","type":"article","venue":"BIT Numerical Mathematics","topic":"Advanced Numerical Methods in Computational Mathematics","field":"Engineering","cited_by":34,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Superconvergence; Mathematics; Finite element method; Norm (philosophy); Mathematical analysis; Finite volume method; Mixed finite element method; Convergence (economics); hp-FEM; Extended finite element method; Rate of convergence; Applied mathematics; Finite element limit analysis; Physics; Mechanics; Computer science","score_opus":0.03925458276625492,"score_gpt":0.3323226077610098,"score_spread":0.29306802499475487,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2067134767","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.16734476,0.00038231286,0.8216987,0.00056456233,0.00032612192,0.000087311586,0.000058115646,0.00024583357,0.009292201],"genre_scores_gemma":[0.88832486,0.00024548025,0.09997248,0.00015855503,0.00015010429,0.00023172684,0.00015113477,0.00020852263,0.010557118],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99963343,0.00015404975,0.00001258022,0.000041960666,0.00012711741,0.000030754054],"domain_scores_gemma":[0.9979873,0.0010001247,0.00014993153,0.00008271497,0.000625985,0.00015397569],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014326151,0.00077159907,0.0006227701,0.0008678086,0.00069738517,0.0011706487,0.0011705651,0.0013920326,0.001957288],"category_scores_gemma":[0.005385173,0.00032605507,0.0005217457,0.00028100208,0.0020831304,0.0008056582,0.0017082357,0.0009451674,0.00029594105],"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.0005682585,0.00014666584,0.0013533201,0.00014942141,0.000077393524,0.00017158898,0.0003334273,0.7382986,0.029525483,0.1953686,0.0018247908,0.032182436],"study_design_scores_gemma":[0.000010149667,0.00003175277,0.000051323044,0.0000042379565,0.0000028188936,0.0000069813013,0.0000072140274,0.99443674,0.00082246424,0.004379176,0.00024143443,0.0000056772196],"about_ca_topic_score_codex":0.0041793473,"about_ca_topic_score_gemma":0.0014623209,"teacher_disagreement_score":0.0041793473,"about_ca_system_score_codex":0.00073160446,"about_ca_system_score_gemma":0.0012400533,"threshold_uncertainty_score":0.00831008},"labels":[],"label_agreement":null},{"id":"W2068874164","doi":"10.1007/s10543-006-0091-y","title":"An Arnoldi-type algorithm for computing page rank","year":2006,"lang":"en","type":"article","venue":"BIT Numerical Mathematics","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":108,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"PageRank; Computation; Convergence (economics); Algorithm; Rank (graph theory); Matrix (chemical analysis); Computer science; Arnoldi iteration; Type (biology); Mathematics; Generalized minimal residual method; Mathematical optimization; Iterative method; Theoretical computer science; Combinatorics","score_opus":0.01507716441216068,"score_gpt":0.26552127964239675,"score_spread":0.2504441152302361,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2068874164","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.003178275,0.000130748,0.99070895,0.00014990976,0.00017408817,0.000060993196,0.000104133884,0.0017671899,0.0037257525],"genre_scores_gemma":[0.061089136,0.0002143368,0.9283003,0.00014701385,0.0001696964,0.00020233926,0.000375644,0.0005387484,0.008962791],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990101,0.0002078106,0.00007306118,0.00014163184,0.0004905374,0.00007685079],"domain_scores_gemma":[0.99795,0.0005810554,0.00009760789,0.00054598646,0.0007123519,0.00011301051],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00093518844,0.0010252123,0.0011302598,0.0019139214,0.0010945747,0.0020118274,0.001656988,0.0011305043,0.010041451],"category_scores_gemma":[0.0068984586,0.0005708946,0.00073421944,0.0021802285,0.001015388,0.0028156184,0.001875257,0.0024062272,0.0065999967],"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.00040941962,0.00020767956,0.00089938974,0.00029808207,0.000096828604,0.00015589497,0.0002394428,0.056291904,0.020752653,0.21986003,0.022964513,0.67782414],"study_design_scores_gemma":[0.00011804653,0.0001592128,0.00034298847,0.000044160977,0.000043870587,0.00022893737,0.000078436635,0.7189972,0.019807,0.23996142,0.02013121,0.000087486536],"about_ca_topic_score_codex":0.0014046256,"about_ca_topic_score_gemma":0.0030340957,"teacher_disagreement_score":0.010041451,"about_ca_system_score_codex":0.00073013274,"about_ca_system_score_gemma":0.0015529527,"threshold_uncertainty_score":0.033591986},"labels":[],"label_agreement":null},{"id":"W2076296366","doi":"10.1007/s10543-008-0163-2","title":"Polynomial cost for solving IVP for high-index DAE","year":2008,"lang":"en","type":"article","venue":"BIT Numerical Mathematics","topic":"Numerical methods for differential equations","field":"Mathematics","cited_by":15,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto; Western University","funders":"","keywords":"Mathematics; Polynomial; Polygon mesh; Residual; Applied mathematics; Algebraic number; Algebraic equation; Taylor series; Differential equation; Differential algebraic equation; Differential (mechanical device); Algorithm; Mathematical analysis; Ordinary differential equation; Nonlinear system; Geometry","score_opus":0.13402119184115874,"score_gpt":0.3708053924682942,"score_spread":0.23678420062713545,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2076296366","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.011023388,0.00021812167,0.9800689,0.00030908085,0.00010934061,0.00004708165,0.00008259636,0.00032882162,0.007812575],"genre_scores_gemma":[0.43812725,0.00044442317,0.5440848,0.00020466757,0.00017770214,0.00029887984,0.0003702038,0.0006264855,0.01566558],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994752,0.00013090002,0.00002694744,0.000052693144,0.00023838993,0.000075872194],"domain_scores_gemma":[0.998154,0.0010954032,0.00008941626,0.00027794507,0.00029260418,0.00009072602],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001100678,0.0008225071,0.0008992253,0.0005094298,0.00066071976,0.0010219174,0.0012474807,0.000927761,0.0098397],"category_scores_gemma":[0.006390725,0.00028381083,0.00042865952,0.0008337486,0.0009155043,0.0015009586,0.0012429494,0.0017151093,0.001375528],"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.00040027374,0.00014925218,0.0008999342,0.0004668521,0.00005900632,0.00020325278,0.00016836755,0.48393542,0.006753692,0.27922016,0.011994878,0.21574892],"study_design_scores_gemma":[0.000015950782,0.000019210374,0.00009679008,0.000008719593,0.0000063889247,0.000019080375,0.00001870303,0.962932,0.0006803353,0.034758344,0.001439321,0.0000051852358],"about_ca_topic_score_codex":0.0060341656,"about_ca_topic_score_gemma":0.009959553,"teacher_disagreement_score":0.0098397,"about_ca_system_score_codex":0.0010085073,"about_ca_system_score_gemma":0.0013522041,"threshold_uncertainty_score":0.032917142},"labels":[],"label_agreement":null},{"id":"W2080524162","doi":"10.1007/s10543-006-0112-x","title":"Artificial time integration","year":2007,"lang":"en","type":"article","venue":"BIT Numerical Mathematics","topic":"Control Systems and Identification","field":"Engineering","cited_by":28,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Computer science; Mathematics","score_opus":0.01058409441577221,"score_gpt":0.21666134232411371,"score_spread":0.2060772479083415,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2080524162","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.0073007476,0.0017661939,0.90007585,0.00094978133,0.0017440944,0.00004415301,0.00014002282,0.0006714939,0.0873077],"genre_scores_gemma":[0.41546196,0.0033956452,0.41380104,0.00078597234,0.0010095286,0.00024383911,0.0007084361,0.0006842029,0.16390944],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99965477,0.00007684342,0.000018404417,0.00006447076,0.0001697341,0.00001586153],"domain_scores_gemma":[0.99949,0.00016296496,0.00003637589,0.00011995158,0.00016316745,0.00002753196],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00045535757,0.00047685328,0.00056685135,0.00063128315,0.00045058376,0.0014950217,0.0006178884,0.00092676614,0.013125391],"category_scores_gemma":[0.0019831406,0.00019393298,0.0005232061,0.0005164022,0.0008389693,0.0012717532,0.001026258,0.0016505356,0.0035798587],"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.000055072258,0.000030474586,0.00025644375,0.00015286954,0.000035231926,0.000066557026,0.00009165908,0.06814416,0.007619896,0.786422,0.009098217,0.1280274],"study_design_scores_gemma":[0.000018787467,0.000035013352,0.00029266122,0.000049744933,0.000019844958,0.00013387397,0.000025775158,0.57016325,0.006086426,0.33077553,0.09237428,0.00002480447],"about_ca_topic_score_codex":0.0008140978,"about_ca_topic_score_gemma":0.00051324564,"teacher_disagreement_score":0.013125391,"about_ca_system_score_codex":0.00063097547,"about_ca_system_score_gemma":0.00050708477,"threshold_uncertainty_score":0.043908775},"labels":[],"label_agreement":null},{"id":"W2085613094","doi":"10.1007/s10543-004-3828-5","title":"On the Divergence of Collocation Solutions in Smooth Piecewise Polynomial Spaces for Volterra Integral Equations","year":2004,"lang":"en","type":"article","venue":"BIT Numerical Mathematics","topic":"Fractional Differential Equations Solutions","field":"Mathematics","cited_by":9,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Memorial University of Newfoundland","funders":"","keywords":"Mathematics; Orthogonal collocation; Collocation method; Piecewise; Collocation (remote sensing); Volterra integral equation; Divergence (linguistics); Polynomial; Mathematical analysis; Integral equation; Ordinary differential equation; Applied mathematics; Differential equation; Computer science","score_opus":0.10820289438945625,"score_gpt":0.33072960823175596,"score_spread":0.22252671384229972,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2085613094","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.19547944,0.0036415565,0.77757007,0.00269347,0.0006094651,0.00007719803,0.00008752389,0.0001949988,0.019646328],"genre_scores_gemma":[0.9101173,0.0016385274,0.07278011,0.0005475633,0.0002535934,0.000078447345,0.0001957907,0.00033131562,0.014057367],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987822,0.000673443,0.000060080594,0.00010690492,0.00027473463,0.00010264506],"domain_scores_gemma":[0.99054176,0.0060904566,0.00067077146,0.00036093037,0.0015441144,0.0007918704],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004916047,0.0012810396,0.0012909245,0.002265837,0.0014218416,0.0028414112,0.0015083633,0.0029793482,0.00240311],"category_scores_gemma":[0.026712514,0.00065776677,0.0010267446,0.0012405566,0.0046805227,0.004803243,0.004712654,0.004610732,0.0002616654],"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.00024948592,0.00014985602,0.0016535453,0.0002953815,0.000052285664,0.00036960543,0.0010839588,0.078288466,0.0058782096,0.89179766,0.0019720637,0.018209467],"study_design_scores_gemma":[0.000028307759,0.0000682977,0.0004160465,0.00008850795,0.000014305289,0.00015551045,0.00022651088,0.6204757,0.0008714798,0.37588286,0.0017345748,0.000037790986],"about_ca_topic_score_codex":0.003421787,"about_ca_topic_score_gemma":0.0016628079,"teacher_disagreement_score":0.004916047,"about_ca_system_score_codex":0.0023545667,"about_ca_system_score_gemma":0.0011869702,"threshold_uncertainty_score":0.02599883},"labels":[],"label_agreement":null},{"id":"W2092048620","doi":"10.1007/s10543-014-0492-2","title":"An algorithm for continuous piecewise linear bounding of discrete time series data","year":2014,"lang":"en","type":"article","venue":"BIT Numerical Mathematics","topic":"Time Series Analysis and Forecasting","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Guelph","funders":"","keywords":"Bounding overwatch; Algorithm; Series (stratigraphy); Mathematics; Piecewise linear function; Piecewise; Applied mathematics; Computer science; Mathematical analysis; Artificial intelligence","score_opus":0.023410379136058684,"score_gpt":0.2755881841118188,"score_spread":0.2521778049757601,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2092048620","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.00086004677,0.0000712355,0.99784267,0.00005697004,0.000037039903,0.00001654249,0.00003933912,0.00066404586,0.0004121515],"genre_scores_gemma":[0.051934935,0.00017360527,0.94427544,0.00010001747,0.00006597386,0.0001815222,0.00035952972,0.00039433193,0.0025146117],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985324,0.0003331232,0.00013801115,0.00031665422,0.00054144225,0.00013838493],"domain_scores_gemma":[0.9949261,0.0030146006,0.0002048642,0.00088266726,0.0008047361,0.00016707316],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0024786605,0.0011452849,0.0013833657,0.001701069,0.000760397,0.002243883,0.002664756,0.001601584,0.0090102125],"category_scores_gemma":[0.012327714,0.0008662678,0.0012141406,0.0020197711,0.0010185592,0.0027504654,0.0038259935,0.0041922987,0.002666755],"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.00041050205,0.00010482017,0.00084162137,0.00031817576,0.0001001522,0.00013167194,0.0002419809,0.26774624,0.010165983,0.11218487,0.01027351,0.5974804],"study_design_scores_gemma":[0.000022285429,0.000026877615,0.000093400384,0.000021676999,0.00001678806,0.000048645506,0.000014830366,0.96619695,0.0026144648,0.027051672,0.003878676,0.000013668396],"about_ca_topic_score_codex":0.00539272,"about_ca_topic_score_gemma":0.0037318654,"teacher_disagreement_score":0.0090102125,"about_ca_system_score_codex":0.0014387786,"about_ca_system_score_gemma":0.0019115682,"threshold_uncertainty_score":0.030142188},"labels":[],"label_agreement":null},{"id":"W2095175934","doi":"10.1007/s10543-006-0055-2","title":"Superconvergence in Collocation Methods on Quasi-Graded Meshes for Functional Differential Equations with Vanishing Delays","year":2006,"lang":"en","type":"article","venue":"BIT Numerical Mathematics","topic":"Differential Equations and Numerical Methods","field":"Mathematics","cited_by":23,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Memorial University of Newfoundland","funders":"","keywords":"Superconvergence; Mathematics; Piecewise; Collocation (remote sensing); Nonlinear system; Collocation method; Polynomial; Polygon mesh; Mathematical analysis; Degree of a polynomial; Applied mathematics; Differential equation; Finite element method; Geometry; Computer science","score_opus":0.09789838969182385,"score_gpt":0.3735161774857028,"score_spread":0.27561778779387897,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2095175934","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.2847531,0.0009077671,0.7029076,0.00061980484,0.0004640331,0.00009756289,0.00005754476,0.00017895632,0.010013552],"genre_scores_gemma":[0.91616446,0.00044210063,0.07412396,0.00015643415,0.00009831642,0.000106603366,0.00010349551,0.00019718465,0.008607433],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994205,0.00029605775,0.000033080003,0.000046587993,0.00013616598,0.00006754552],"domain_scores_gemma":[0.99541557,0.0026420655,0.00031346144,0.00048104487,0.000838984,0.0003087957],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0022158476,0.0007016212,0.0007450269,0.0012230235,0.00090212387,0.0016988493,0.0012590243,0.0012811738,0.0018055538],"category_scores_gemma":[0.009599146,0.00048215917,0.00051438215,0.00059417915,0.0027544599,0.0016486619,0.0027754123,0.0015550014,0.00020125846],"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.0006304063,0.00022851343,0.0037652454,0.00026072352,0.000094417526,0.00034050934,0.00093222666,0.4778984,0.011151767,0.4537611,0.002270724,0.048666082],"study_design_scores_gemma":[0.000013515608,0.000039352493,0.0001709114,0.000016963204,0.000007104323,0.000016732514,0.00005641023,0.96212345,0.0009252989,0.03590622,0.0007158783,0.000008159903],"about_ca_topic_score_codex":0.0043206983,"about_ca_topic_score_gemma":0.004729105,"teacher_disagreement_score":0.0043206983,"about_ca_system_score_codex":0.0010518468,"about_ca_system_score_gemma":0.0008979668,"threshold_uncertainty_score":0.01171869},"labels":[],"label_agreement":null},{"id":"W2106633940","doi":"10.1007/s10543-005-0019-y","title":"Solving Differential-Algebraic Equations by Taylor Series (I): Computing Taylor Coefficients","year":2005,"lang":"en","type":"article","venue":"BIT Numerical Mathematics","topic":"Modeling and Simulation Systems","field":"Computer Science","cited_by":75,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"","keywords":"Taylor series; Series (stratigraphy); Taylor's theorem; Mathematics; Nonlinear system; Algebraic number; Applied mathematics; Automatic differentiation; Code (set theory); Algebraic equation; Differential (mechanical device); Order (exchange); Algebra over a field; Algorithm; Computer science; Mathematical analysis; Computation; Pure mathematics","score_opus":0.02643840364679785,"score_gpt":0.2643242923844076,"score_spread":0.23788588873760974,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2106633940","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.0068629724,0.00023209919,0.9877452,0.0001341217,0.00017476945,0.000028828696,0.00002762368,0.00034538345,0.004448941],"genre_scores_gemma":[0.15777962,0.00122136,0.8284145,0.00012887953,0.00023729907,0.000115970186,0.0001997887,0.0006332231,0.011269427],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9996111,0.00007726877,0.000025787998,0.000053556058,0.00019952933,0.00003284768],"domain_scores_gemma":[0.9992778,0.00032763643,0.000053124855,0.0000996187,0.00020830148,0.000033536595],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00080783607,0.0007801351,0.0008528584,0.00091842026,0.00052948983,0.0011319607,0.00094324525,0.00065539085,0.0048396834],"category_scores_gemma":[0.0041150283,0.0004291504,0.0007189654,0.0012930348,0.0009432237,0.002144556,0.0011463762,0.0014659697,0.002065241],"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.00013165442,0.0001048291,0.0010383982,0.0006051704,0.00007130184,0.00015514916,0.0003927807,0.16469607,0.031184886,0.35662892,0.0119161345,0.4330747],"study_design_scores_gemma":[0.0000286417,0.00005179224,0.00020897132,0.000055169796,0.000035248075,0.0001414745,0.000060305076,0.853,0.019401327,0.114025,0.012969683,0.000022437049],"about_ca_topic_score_codex":0.0010472649,"about_ca_topic_score_gemma":0.0009112795,"teacher_disagreement_score":0.0048396834,"about_ca_system_score_codex":0.00047004706,"about_ca_system_score_gemma":0.00080897,"threshold_uncertainty_score":0.01619035},"labels":[],"label_agreement":null},{"id":"W2110313341","doi":"10.1007/s10543-010-0283-3","title":"Analysis of and workarounds for element reversal for a finite element-based algorithm for warping triangular and tetrahedral meshes","year":2010,"lang":"en","type":"article","venue":"BIT Numerical Mathematics","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":53,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Polygon mesh; Finite element method; Algorithm; Tetrahedron; Volume mesh; Vertex (graph theory); Boundary (topology); Mathematics; Mesh generation; Image warping; Stiffness matrix; Triangle mesh; Dimension (graph theory); Geometry; Computer science; Mathematical analysis; Combinatorics; Graph","score_opus":0.021898097847507375,"score_gpt":0.28652208233149434,"score_spread":0.26462398448398694,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2110313341","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.23490185,0.0003047729,0.75571907,0.0003559716,0.00010861677,0.00011039818,0.000044377386,0.00069911545,0.0077557573],"genre_scores_gemma":[0.7776629,0.00011094107,0.21732762,0.00008217296,0.000025553363,0.0001245915,0.00012821992,0.0004677538,0.0040703327],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990176,0.00023060876,0.00004468909,0.00012030596,0.00044665765,0.00014005014],"domain_scores_gemma":[0.9883441,0.0085352445,0.00065554207,0.00096848607,0.0012789603,0.0002176889],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020791693,0.0005716875,0.00052750733,0.00064467406,0.0007413893,0.0012766077,0.0012667092,0.0008339464,0.007611648],"category_scores_gemma":[0.019094924,0.0005733698,0.00042439075,0.0004716291,0.00098329,0.0013539019,0.0008641787,0.0009849586,0.00054709014],"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.0016613452,0.0003466175,0.006645245,0.0002896737,0.000059041187,0.00035185943,0.000694144,0.6128643,0.04246885,0.09404425,0.0031392234,0.23743546],"study_design_scores_gemma":[0.00002500744,0.00007905108,0.00048685362,0.000012765391,0.000014626816,0.00006782827,0.0000850199,0.98448074,0.0076708584,0.006274053,0.0007908789,0.0000121927915],"about_ca_topic_score_codex":0.0012958568,"about_ca_topic_score_gemma":0.0020388055,"teacher_disagreement_score":0.007611648,"about_ca_system_score_codex":0.0006700848,"about_ca_system_score_gemma":0.0010413334,"threshold_uncertainty_score":0.025463521},"labels":[],"label_agreement":null},{"id":"W2133262123","doi":"10.1023/a:1022307527408","title":"A Recursive Test for P-Matrices","year":2000,"lang":"en","type":"article","venue":"BIT Numerical Mathematics","topic":"Polynomial and algebraic computation","field":"Computer Science","cited_by":40,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Regina","funders":"","keywords":"MATLAB; Mathematics; Matrix (chemical analysis); Computer science; Schur decomposition; Algorithm; Combinatorics; Schur complement; Physics; Eigenvalues and eigenvectors; Programming language","score_opus":0.014698049277087961,"score_gpt":0.24981889765869147,"score_spread":0.23512084838160352,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2133262123","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.10132219,0.0003619703,0.87005794,0.0018973938,0.00036557007,0.00020707044,0.0006755611,0.0033008067,0.021811541],"genre_scores_gemma":[0.7892133,0.00016535244,0.19769089,0.0006830276,0.00041507167,0.00026012247,0.0015215557,0.0006161913,0.009434464],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9955635,0.0015572859,0.00024812235,0.0009185639,0.0010738025,0.00063874014],"domain_scores_gemma":[0.9709952,0.019842751,0.0010940313,0.0038252217,0.0030866752,0.0011561115],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0026403542,0.0012287836,0.0014452147,0.002148529,0.0018377877,0.003402894,0.002901655,0.0027476666,0.011640803],"category_scores_gemma":[0.03152819,0.00054154656,0.0015398887,0.0018995019,0.0041458304,0.007370513,0.004609069,0.0030771391,0.0033785354],"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.0019753734,0.00031958762,0.0069996784,0.00043492857,0.00015039094,0.000547387,0.00047395803,0.024914276,0.023021087,0.7008005,0.017398259,0.22296463],"study_design_scores_gemma":[0.00020516329,0.00053655374,0.0015899177,0.00010267888,0.00009437902,0.0005111213,0.00018407706,0.22126032,0.023517203,0.7446812,0.0072023496,0.00011499885],"about_ca_topic_score_codex":0.0017234653,"about_ca_topic_score_gemma":0.001772735,"teacher_disagreement_score":0.011640803,"about_ca_system_score_codex":0.0012904562,"about_ca_system_score_gemma":0.0025281613,"threshold_uncertainty_score":0.038942397},"labels":[],"label_agreement":null},{"id":"W2145868901","doi":"10.1023/b:bitn.0000014566.23457.85","title":"An Algorithm for Combined Code and Carrier Phase Based GPS Positioning","year":2003,"lang":"en","type":"article","venue":"BIT Numerical Mathematics","topic":"GNSS positioning and interference","field":"Engineering","cited_by":13,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Global Positioning System; Algorithm; Position (finance); Computer science; Code (set theory); GPS signals; Time to first fix; GPS/INS; Assisted GPS; Reliability (semiconductor); Phase (matter); Kinematics; Telecommunications","score_opus":0.01593071988128326,"score_gpt":0.2690526226503188,"score_spread":0.25312190276903557,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2145868901","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.00095487846,0.0000483039,0.99782,0.00002885106,0.00005821569,0.000016941845,0.000016003973,0.0002867043,0.0007700645],"genre_scores_gemma":[0.01901378,0.00011149847,0.9769309,0.000038288912,0.000046388388,0.00010029251,0.000107191554,0.000067004206,0.0035845928],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993493,0.000080174155,0.00003678504,0.000111394475,0.00038215079,0.000040151685],"domain_scores_gemma":[0.9993969,0.00013702197,0.000034492277,0.00009337709,0.00031547635,0.000022680768],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00055810215,0.0008733265,0.0006928206,0.0011128564,0.0008072451,0.0013982141,0.0013695615,0.0011416537,0.004886588],"category_scores_gemma":[0.002203892,0.0005536373,0.0005486698,0.0014377444,0.0005833649,0.001400503,0.0016918475,0.0011511451,0.0041329847],"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.0001771984,0.00005854081,0.00059968553,0.000112859314,0.00006718212,0.000098703684,0.00014554191,0.12564291,0.024722774,0.059240088,0.005481773,0.7836527],"study_design_scores_gemma":[0.000056593362,0.00010207188,0.0005202904,0.00003206723,0.000052203315,0.00030341322,0.000036894762,0.93806523,0.013738227,0.02395062,0.023098929,0.000043501685],"about_ca_topic_score_codex":0.002734556,"about_ca_topic_score_gemma":0.004471493,"teacher_disagreement_score":0.004886588,"about_ca_system_score_codex":0.00069605384,"about_ca_system_score_gemma":0.0012263206,"threshold_uncertainty_score":0.01634729},"labels":[],"label_agreement":null},{"id":"W2594345700","doi":"10.1007/s10543-018-0696-y","title":"Well-balanced mesh-based and meshless schemes for the shallow-water equations","year":2018,"lang":"en","type":"preprint","venue":"BIT Numerical Mathematics","topic":"Computational Fluid Dynamics and Aerodynamics","field":"Engineering","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Memorial University of Newfoundland","funders":"Natural Sciences and Engineering Research Council of Canada; Canada Research Chairs","keywords":"Consistency (knowledge bases); Shallow water equations; Mathematics; Applied mathematics; Polygon mesh; Flux (metallurgy); Finite difference; Momentum (technical analysis); Mathematical analysis; Computer science; Geometry; Materials science","score_opus":0.016899035054237906,"score_gpt":0.24798556418148246,"score_spread":0.23108652912724456,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2594345700","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.040834058,0.0017170646,0.9482357,0.00071001274,0.000524772,0.000066504654,0.00017702603,0.00026953788,0.0074652852],"genre_scores_gemma":[0.56652796,0.0015996394,0.40065756,0.0005087126,0.000461813,0.00024054058,0.000606698,0.000528296,0.028868785],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99957424,0.00013499263,0.00002881844,0.000036309633,0.00018651506,0.000039123726],"domain_scores_gemma":[0.99913484,0.00022717234,0.00011510327,0.00016411414,0.0002642115,0.000094669085],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009586269,0.0007971423,0.0008435811,0.00072674756,0.00047459273,0.0011867858,0.0015082827,0.0019053429,0.00230649],"category_scores_gemma":[0.0043041185,0.00037546738,0.00058639975,0.0006072234,0.0011977404,0.0027008462,0.002531788,0.0020473541,0.0006963919],"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.00044506864,0.00014949667,0.001156762,0.00034364616,0.00007070281,0.00016212212,0.00030571883,0.36700997,0.025843197,0.50393516,0.006397779,0.09418043],"study_design_scores_gemma":[0.000028010623,0.000030896106,0.00014417608,0.000017901973,0.000009670348,0.00002402669,0.000014242539,0.94649905,0.0012656673,0.049532097,0.0024199772,0.000014295747],"about_ca_topic_score_codex":0.0024554818,"about_ca_topic_score_gemma":0.002969842,"teacher_disagreement_score":0.0024554818,"about_ca_system_score_codex":0.0008664474,"about_ca_system_score_gemma":0.0009038028,"threshold_uncertainty_score":0.007716},"labels":[],"label_agreement":null},{"id":"W27617868","doi":"10.1023/a:1021920724315","title":"A Spline Collocation Method for Linear Volterra Integro-Differential Equations with Weakly Singular Kernels","year":2001,"lang":"en","type":"article","venue":"BIT Numerical Mathematics","topic":"Advanced Numerical Analysis Techniques","field":"Engineering","cited_by":25,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Memorial University of Newfoundland","funders":"","keywords":"Mathematics; Piecewise; Applied mathematics; Polynomial; Collocation (remote sensing); Convergence (economics); Collocation method; Initial value problem; Piecewise linear function; Differential equation; Mathematical analysis; Ordinary differential equation; Computer science","score_opus":0.020846266814706943,"score_gpt":0.3000792706158918,"score_spread":0.2792330038011849,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W27617868","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.016699817,0.00016886462,0.9818464,0.00005758379,0.00011689684,0.000016318005,0.000016526614,0.000101682694,0.00097594433],"genre_scores_gemma":[0.38524175,0.0005325289,0.6049625,0.00007015893,0.000109789165,0.00012832484,0.00010487661,0.00019586581,0.008654149],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9998128,0.00007800975,0.000011654925,0.000016973316,0.000066176224,0.000014451603],"domain_scores_gemma":[0.9995826,0.00017972967,0.000026694897,0.00004426399,0.00013075162,0.000035975736],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005998108,0.00038588495,0.00065693416,0.00044485572,0.00040938478,0.00055606687,0.0006801358,0.000985005,0.001458436],"category_scores_gemma":[0.0013726935,0.00027209573,0.00053745613,0.0005993393,0.0005992311,0.00040040642,0.00085336686,0.00097454234,0.00045152748],"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.000386404,0.00017103978,0.0013362765,0.00027862866,0.00009336461,0.00024917847,0.00034516834,0.56542706,0.04657669,0.14576216,0.0025963914,0.23677763],"study_design_scores_gemma":[0.000008726085,0.000026032429,0.00007802057,0.000009325803,0.0000069937555,0.000014624304,0.000010507544,0.99086964,0.0010011303,0.006254123,0.0017101996,0.00001079199],"about_ca_topic_score_codex":0.0031533933,"about_ca_topic_score_gemma":0.0030895728,"teacher_disagreement_score":0.0031533933,"about_ca_system_score_codex":0.0002919039,"about_ca_system_score_gemma":0.0006061915,"threshold_uncertainty_score":0.006270051},"labels":[],"label_agreement":null},{"id":"W2921421400","doi":"10.1007/s10543-019-00747-6","title":"Weak backward error analysis for stochastic Hamiltonian Systems","year":2019,"lang":"en","type":"article","venue":"BIT Numerical Mathematics","topic":"Stochastic processes and financial applications","field":"Economics, Econometrics and Finance","cited_by":19,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"MacEwan University","funders":"Canadian Network for Research and Innovation in Machining Technology, Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Hamiltonian system; Discretization; Ergodic theory; Hamiltonian (control theory); Invariant (physics); Applied mathematics; Symplectic geometry; Discretization error; Numerical approximation; Error analysis; Numerical analysis; Mathematical analysis; Mathematical physics; Mathematical optimization","score_opus":0.03707954119187995,"score_gpt":0.2472527597454245,"score_spread":0.21017321855354454,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2921421400","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.03843596,0.0014655285,0.94694,0.0022892137,0.00047546992,0.000048026897,0.00012611705,0.00011552662,0.010104184],"genre_scores_gemma":[0.8024291,0.0023396465,0.13366847,0.000904174,0.0007665784,0.00027737138,0.0005346338,0.0004878786,0.058592085],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99854136,0.00078230887,0.000074014446,0.00014489998,0.0003441547,0.0001133113],"domain_scores_gemma":[0.9901751,0.006305813,0.0009316362,0.00045369106,0.001415386,0.00071829616],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0055093393,0.0016062817,0.0017281355,0.002691178,0.00088197965,0.0025883794,0.0019137374,0.002771096,0.0048509426],"category_scores_gemma":[0.019692563,0.0007722942,0.0010435221,0.0011358594,0.00482577,0.0042622294,0.00538608,0.0030449512,0.00041415027],"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.00007276912,0.000051240746,0.00048793206,0.00013184203,0.00007643577,0.00006526186,0.00013033074,0.10905469,0.0012941705,0.88242745,0.00093740015,0.005270418],"study_design_scores_gemma":[0.000019344,0.000017152288,0.00014054663,0.000028565139,0.0000110747715,0.000015591842,0.000022209562,0.68832976,0.0002887691,0.31047633,0.0006330911,0.0000175199],"about_ca_topic_score_codex":0.0060353265,"about_ca_topic_score_gemma":0.003705765,"teacher_disagreement_score":0.0060353265,"about_ca_system_score_codex":0.0021287936,"about_ca_system_score_gemma":0.0023902114,"threshold_uncertainty_score":0.029136479},"labels":[],"label_agreement":null},{"id":"W2955329227","doi":"10.1007/s10543-021-00864-1","title":"A posteriori error analysis for Schwarz overlapping domain decomposition methods","year":2021,"lang":"en","type":"preprint","venue":"BIT Numerical Mathematics","topic":"Advanced Numerical Methods in Computational Mathematics","field":"Engineering","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"Division of Mathematical Sciences","keywords":"Domain decomposition methods; Discretization; Schwarz alternating method; Additive Schwarz method; A priori and a posteriori; Partial differential equation; Mortar methods; Mathematics; Applied mathematics; Domain (mathematical analysis); Multiplicative function; Numerical analysis; Approximation error; Error analysis; Discretization error; Decomposition method (queueing theory); Decomposition; Algorithm; Computer science; Finite element method; Mathematical analysis; Discrete mathematics","score_opus":0.05816146696286391,"score_gpt":0.4075510216186753,"score_spread":0.3493895546558114,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2955329227","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.016221547,0.0006087874,0.97660863,0.00023646606,0.000105622734,0.000031687272,0.000064766056,0.00008854752,0.006034067],"genre_scores_gemma":[0.43856564,0.0014850624,0.5360879,0.00031394578,0.00033898625,0.00029246867,0.0004893423,0.00070173835,0.021724857],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99810106,0.00094667735,0.00007635936,0.00012686252,0.00066189276,0.00008716623],"domain_scores_gemma":[0.9917932,0.005684153,0.00038511647,0.00058091903,0.0013276057,0.00022899023],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004344405,0.0013962813,0.0009407596,0.0017957969,0.0005728288,0.001641279,0.0011410813,0.0015432913,0.0031401436],"category_scores_gemma":[0.012241403,0.00049314625,0.0008672738,0.00079096487,0.0020085433,0.0019217508,0.002684226,0.002598433,0.00062782556],"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.00049233274,0.00013111623,0.0013805547,0.0005594252,0.000114046634,0.00018441818,0.00039795178,0.31442425,0.01703767,0.605218,0.004209832,0.05585051],"study_design_scores_gemma":[0.000008113532,0.000022821356,0.00017295132,0.000031269105,0.000009616349,0.00003569573,0.000024076771,0.9487008,0.0020305405,0.047550756,0.0014017016,0.000011640889],"about_ca_topic_score_codex":0.0015589924,"about_ca_topic_score_gemma":0.0010953299,"teacher_disagreement_score":0.004344405,"about_ca_system_score_codex":0.0007608294,"about_ca_system_score_gemma":0.0010295612,"threshold_uncertainty_score":0.022975683},"labels":[],"label_agreement":null},{"id":"W2981569021","doi":"10.1007/s10543-020-00820-5","title":"Accurate quadrature of nearly singular line integrals in two and three dimensions by singularity swapping","year":2020,"lang":"en","type":"preprint","venue":"BIT Numerical Mathematics","topic":"Electromagnetic Scattering and Analysis","field":"Physics and Astronomy","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":"Simon Fraser University","funders":"Kungliga Tekniska Högskolan; Knut och Alice Wallenbergs Stiftelse; Flatiron Health; Simons Foundation","keywords":"Singularity; Quadrature (astronomy); Laplace transform; Mathematics; Mathematical analysis; Line integral; Stokes flow; Applied mathematics; Flow (mathematics); Geometry; Integral equation; Physics","score_opus":0.021392308875466105,"score_gpt":0.29273246697233357,"score_spread":0.27134015809686746,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2981569021","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.13197182,0.00010663722,0.862536,0.00013282157,0.000047324404,0.000024557314,0.000043216773,0.00047523994,0.0046622977],"genre_scores_gemma":[0.73564327,0.00008638352,0.26048663,0.00008056753,0.000027315897,0.00004278285,0.00009330509,0.000254605,0.0032851873],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996246,0.00013001515,0.000016911445,0.00002758608,0.0001641154,0.00003672818],"domain_scores_gemma":[0.99925894,0.00033619237,0.00007124612,0.00012162248,0.00014429589,0.000067692454],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00084086775,0.00035750345,0.0004983556,0.0005203484,0.00022333607,0.0009658341,0.00066524255,0.00066299277,0.002371614],"category_scores_gemma":[0.002380856,0.00022184578,0.0003561827,0.00047467847,0.00090612535,0.0007404065,0.0013014805,0.0007005308,0.0007036378],"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.0004837845,0.00012204128,0.0022944289,0.00013916435,0.00006154403,0.0004643689,0.00036923846,0.6159436,0.07270755,0.22635356,0.002420268,0.07864043],"study_design_scores_gemma":[0.000011002675,0.00001808814,0.00012325663,0.0000043926943,0.0000018283554,0.000025968693,0.000010316765,0.98706645,0.0031173725,0.008876742,0.00073829247,0.0000062312733],"about_ca_topic_score_codex":0.00076775317,"about_ca_topic_score_gemma":0.00070332637,"teacher_disagreement_score":0.002371614,"about_ca_system_score_codex":0.0004126504,"about_ca_system_score_gemma":0.00031402544,"threshold_uncertainty_score":0.007933795},"labels":[],"label_agreement":null},{"id":"W3003576863","doi":"10.1007/s10543-020-00825-0","title":"Error estimation and uncertainty quantification for first time to a threshold value","year":2020,"lang":"en","type":"preprint","venue":"BIT Numerical Mathematics","topic":"Probabilistic and Robust Engineering Design","field":"Decision Sciences","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"National Science Foundation","keywords":"A priori and a posteriori; Bounded function; Representation (politics); Mathematics; Applied mathematics; Function (biology); Value (mathematics); Maximum a posteriori estimation; Mathematical optimization; Statistics; Mathematical analysis; Maximum likelihood","score_opus":0.1631738410868106,"score_gpt":0.36721305909936097,"score_spread":0.20403921801255037,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3003576863","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.0047017005,0.00056480535,0.9897606,0.0004449409,0.00021466592,0.000027285074,0.000036927548,0.00018012461,0.0040688915],"genre_scores_gemma":[0.43992347,0.0019946517,0.5246345,0.0012886375,0.00085463736,0.00026700273,0.00027127596,0.0012906779,0.029475184],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99377924,0.0015209488,0.00037394685,0.0016786784,0.002096461,0.00055075245],"domain_scores_gemma":[0.98846054,0.0057313773,0.0010315732,0.0019010156,0.0024373853,0.00043816757],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0063502816,0.0018106048,0.0020885118,0.0037374774,0.0017590349,0.0050662267,0.0032591328,0.0035679042,0.008092058],"category_scores_gemma":[0.03468367,0.00101782,0.0023896329,0.0032882409,0.0055754213,0.010034036,0.007572004,0.008082281,0.0019358221],"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.00014171879,0.000044675013,0.00046207124,0.0004590043,0.000074732845,0.00017275466,0.00045556473,0.063869536,0.0076071806,0.8659513,0.0024514794,0.058309928],"study_design_scores_gemma":[0.000010000888,0.000086626584,0.00026430198,0.00017259558,0.000055671742,0.00023331388,0.00006798704,0.40004516,0.011912104,0.57986826,0.007229454,0.000054476735],"about_ca_topic_score_codex":0.0021793148,"about_ca_topic_score_gemma":0.0008191601,"teacher_disagreement_score":0.008092058,"about_ca_system_score_codex":0.0031325773,"about_ca_system_score_gemma":0.0024400267,"threshold_uncertainty_score":0.03358388},"labels":[],"label_agreement":null},{"id":"W3134733524","doi":"10.1007/s10543-021-00875-y","title":"Arbitrary high order A-stable and B-convergent numerical methods for ODEs via deferred correction","year":2021,"lang":"en","type":"preprint","venue":"BIT Numerical Mathematics","topic":"Numerical methods for differential equations","field":"Mathematics","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Ode; Ordinary differential equation; Convergence (economics); Sequence (biology); Midpoint; Scheme (mathematics); Order of accuracy; Mathematics; Order (exchange); Applied mathematics; Stability (learning theory); Numerical analysis; Numerical stability; Mathematical analysis; Differential equation; Computer science; Geometry","score_opus":0.08910634030375586,"score_gpt":0.4011625593434389,"score_spread":0.31205621903968306,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3134733524","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.05310372,0.0013503822,0.9197873,0.0007475046,0.00070630555,0.000089883935,0.000086466585,0.0005037526,0.023624668],"genre_scores_gemma":[0.6127642,0.0010860715,0.33283886,0.00072987366,0.00036216233,0.00024860224,0.00017138028,0.0009318353,0.050867043],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99948007,0.00019871004,0.000028496694,0.000052747102,0.00020346169,0.000036494574],"domain_scores_gemma":[0.99806863,0.0007488666,0.000168695,0.000261406,0.00054643373,0.00020593646],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001566873,0.000876999,0.0006881911,0.00134183,0.0010407041,0.0013021922,0.001278727,0.0013943685,0.002947603],"category_scores_gemma":[0.00707531,0.00035733718,0.0006507982,0.0007186846,0.002339676,0.0016775412,0.0030342196,0.0028361226,0.0009569205],"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.00035637285,0.00010656138,0.0006203586,0.00027429505,0.00004977807,0.00030521338,0.0005294769,0.08008623,0.014734411,0.8592978,0.0043821395,0.039257262],"study_design_scores_gemma":[0.000049120583,0.00006527092,0.0002031771,0.000052232674,0.000013914394,0.000079552934,0.00003966746,0.7897746,0.004221055,0.20040408,0.005069577,0.000027737653],"about_ca_topic_score_codex":0.0031703596,"about_ca_topic_score_gemma":0.0030830149,"teacher_disagreement_score":0.0031703596,"about_ca_system_score_codex":0.0011762202,"about_ca_system_score_gemma":0.0013782069,"threshold_uncertainty_score":0.009860694},"labels":[],"label_agreement":null},{"id":"W424092915","doi":"10.1023/a:1021956304751","title":"Mono-Implicit Runge-Kutta-Nyström Methods with Application to Boundary Value Ordinary Differential Equations","year":2001,"lang":"en","type":"article","venue":"BIT Numerical Mathematics","topic":"Numerical methods for differential equations","field":"Mathematics","cited_by":9,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Saint Mary's University","funders":"","keywords":"Runge–Kutta methods; Ordinary differential equation; Boundary value problem; Mathematics; Differential equation; Applied mathematics; Initial value problem; Order (exchange); Explicit and implicit methods; L-stability; Computer science; Mathematical analysis; Differential algebraic equation","score_opus":0.05798208207617285,"score_gpt":0.39739599120800134,"score_spread":0.3394139091318285,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W424092915","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.024299914,0.0014782395,0.96674037,0.00025324282,0.00029722907,0.00005413021,0.000037910835,0.00031258372,0.0065265084],"genre_scores_gemma":[0.4231969,0.002309665,0.5445469,0.00018109579,0.0002688274,0.0004134301,0.00013399996,0.0005261447,0.028423045],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99960667,0.00014589504,0.000027939224,0.000046976154,0.00014112677,0.000031479787],"domain_scores_gemma":[0.9989182,0.0005485547,0.00011305436,0.00011234372,0.00023584899,0.00007204885],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014021852,0.00084939745,0.001412912,0.00092059997,0.00093736284,0.0012271636,0.0016797659,0.0021005773,0.0027430553],"category_scores_gemma":[0.004514162,0.0006158172,0.0007341418,0.0008087064,0.001652712,0.0019537478,0.0026495985,0.002296654,0.0008263411],"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.00028080988,0.0003050073,0.0012178356,0.00050456077,0.00009695659,0.00030473748,0.00083384034,0.51143044,0.012695313,0.3283839,0.002265804,0.14168079],"study_design_scores_gemma":[0.000014205859,0.000021923019,0.000089503046,0.000019196948,0.0000074538184,0.00002222131,0.000016696407,0.9804279,0.0007622625,0.016728675,0.0018766567,0.000013250121],"about_ca_topic_score_codex":0.0032284572,"about_ca_topic_score_gemma":0.0050636726,"teacher_disagreement_score":0.0032284572,"about_ca_system_score_codex":0.0005949436,"about_ca_system_score_gemma":0.001461945,"threshold_uncertainty_score":0.009176493},"labels":[],"label_agreement":null},{"id":"W43115652","doi":"10.1023/a:1021975414321","title":"Factorised Preconditionings of Successive Approximations in Finite Precision","year":2001,"lang":"en","type":"article","venue":"BIT Numerical Mathematics","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Linear map; Mathematics; Operator (biology); Matrix (chemical analysis); Applied mathematics; Transformation (genetics); Linear system; System of linear equations; Transformation matrix; Numerical analysis; Computer science; Calculus (dental); Mathematical analysis; Pure mathematics; Physics","score_opus":0.016736023984367084,"score_gpt":0.25884864634894533,"score_spread":0.24211262236457826,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W43115652","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.033329304,0.00038305865,0.95869815,0.00017314836,0.00036990704,0.0000471671,0.000075661104,0.0007105016,0.0062131183],"genre_scores_gemma":[0.40665784,0.0006263973,0.57986766,0.00012671342,0.00023057268,0.00013795678,0.00024490335,0.00065072987,0.011457183],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99920183,0.00032156278,0.000047098,0.00006606701,0.0002927466,0.00007078004],"domain_scores_gemma":[0.998086,0.00082017505,0.00015121812,0.00044386915,0.0004062107,0.000092623624],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011362826,0.0008826904,0.00076915516,0.00066212105,0.00042942906,0.0010146202,0.00097118976,0.00090471614,0.008405049],"category_scores_gemma":[0.0064877807,0.0003981457,0.0005718875,0.0010482192,0.0011944586,0.001301915,0.0011998313,0.0015048368,0.0015336025],"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.0010030292,0.0001901927,0.0007087901,0.00042384054,0.00011730329,0.00027211723,0.00049515394,0.36172733,0.033485785,0.28007743,0.009854929,0.3116441],"study_design_scores_gemma":[0.0000350112,0.000103527505,0.00012852655,0.00002380985,0.0000140279435,0.000054164175,0.000036864127,0.94248503,0.008021981,0.04426925,0.0048095686,0.00001822906],"about_ca_topic_score_codex":0.0026083803,"about_ca_topic_score_gemma":0.0049402537,"teacher_disagreement_score":0.008405049,"about_ca_system_score_codex":0.00046778106,"about_ca_system_score_gemma":0.00076669926,"threshold_uncertainty_score":0.028117716},"labels":[],"label_agreement":null},{"id":"W4319170691","doi":"10.1007/s10543-023-00947-1","title":"Error estimation for the time to a threshold value in evolutionary partial differential equations","year":2023,"lang":"en","type":"article","venue":"BIT Numerical Mathematics","topic":"Model Reduction and Neural Networks","field":"Physics and Astronomy","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"Division of Mathematical Sciences; Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Hyperbolic partial differential equation; Partial differential equation; Bounded function; Parabolic partial differential equation; A priori and a posteriori; Nonlinear system; Applied mathematics; Initial value problem; Mathematical analysis; Physics","score_opus":0.04219432222678553,"score_gpt":0.29984809014977587,"score_spread":0.25765376792299033,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4319170691","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.023928683,0.0003461543,0.97324127,0.00071084534,0.0001300825,0.000020927044,0.000034440793,0.00013383049,0.0014537438],"genre_scores_gemma":[0.7986613,0.0005649764,0.19141883,0.00029395605,0.00019052294,0.00013900167,0.000173894,0.0004086572,0.008148806],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988954,0.00047689994,0.00007545178,0.00021751126,0.00021889007,0.00011575304],"domain_scores_gemma":[0.98061407,0.015621038,0.0008724743,0.000695257,0.0017410747,0.0004559906],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0057661566,0.0008053608,0.0012743925,0.0013608866,0.00073440984,0.0018365207,0.0019589737,0.0024978265,0.0024071008],"category_scores_gemma":[0.036545876,0.00055740227,0.0008110841,0.0008089889,0.002815273,0.0031519632,0.0030124192,0.0030169608,0.00026707255],"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.00021780981,0.000040430215,0.0016859046,0.00018602528,0.00006748817,0.0000727159,0.00022197783,0.69463146,0.0026733638,0.27264926,0.0009497292,0.026603842],"study_design_scores_gemma":[0.0000038244907,0.000006490494,0.00009641998,0.000011352249,0.000003975984,0.0000062993695,0.0000060800676,0.97045374,0.00038590896,0.028893368,0.00012508627,0.000007482877],"about_ca_topic_score_codex":0.0072835106,"about_ca_topic_score_gemma":0.0029804562,"teacher_disagreement_score":0.0072835106,"about_ca_system_score_codex":0.0018780393,"about_ca_system_score_gemma":0.0017452578,"threshold_uncertainty_score":0.03049469},"labels":[],"label_agreement":null},{"id":"W4321350826","doi":"10.1007/s10543-023-00955-1","title":"An Hermite-Obreschkoff method for stiff high-index DAE","year":2023,"lang":"en","type":"article","venue":"BIT Numerical Mathematics","topic":"Numerical methods for differential equations","field":"Mathematics","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Jacobian matrix and determinant; Backward differentiation formula; Nonlinear system; Computation; Mathematics; Applied mathematics; Numerical analysis; Hermite polynomials; Algebraic equation; Numerical integration; Differential algebraic equation; Differential equation; Computer science; Mathematical analysis; Algorithm; Ordinary differential equation","score_opus":0.09374138366752967,"score_gpt":0.43080308216811414,"score_spread":0.3370616985005845,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4321350826","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.0061888266,0.0003234462,0.9846001,0.00017274055,0.00020598312,0.000046720816,0.000057923942,0.00017728074,0.008226927],"genre_scores_gemma":[0.20523289,0.0008192234,0.74618083,0.00052020815,0.00027724507,0.00034700276,0.00027010997,0.0006441273,0.045708347],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99952304,0.00018195157,0.00002221402,0.000036400725,0.00020537451,0.000031005646],"domain_scores_gemma":[0.99942195,0.00019442668,0.000034423014,0.00010806491,0.00017563833,0.00006558457],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012408255,0.0007264844,0.00092698523,0.0007134801,0.0007959957,0.001148663,0.001307969,0.0014612192,0.005620508],"category_scores_gemma":[0.0019091634,0.00036514312,0.0006387931,0.00070533936,0.0011123064,0.0011497648,0.0015573166,0.0018244236,0.001792074],"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.0002035293,0.00020876658,0.00082896923,0.00031249144,0.00012812839,0.00027008957,0.00024173896,0.1893017,0.018862953,0.6691789,0.0073424475,0.113120265],"study_design_scores_gemma":[0.000018013168,0.000024435398,0.00012083192,0.000025520698,0.000011413257,0.000059397193,0.000013963732,0.94590604,0.0013649197,0.0464369,0.0059938827,0.000024617912],"about_ca_topic_score_codex":0.0017626742,"about_ca_topic_score_gemma":0.004854645,"teacher_disagreement_score":0.005620508,"about_ca_system_score_codex":0.0006552403,"about_ca_system_score_gemma":0.0010332784,"threshold_uncertainty_score":0.018802464},"labels":[],"label_agreement":null},{"id":"W4383553031","doi":"10.1007/s10543-023-00981-z","title":"Backward Euler method for stochastic differential equations with non-Lipschitz coefficients driven by fractional Brownian motion","year":2023,"lang":"en","type":"article","venue":"BIT Numerical Mathematics","topic":"Stochastic processes and financial applications","field":"Economics, Econometrics and Finance","cited_by":8,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"China Scholarship Council","keywords":"Lipschitz continuity; Mathematics; Stochastic differential equation; Euler method; Rate of convergence; Backward Euler method; Mathematical analysis; Euler's formula; Brownian motion; Fractional Brownian motion; Geometric Brownian motion; Convergence (economics); Applied mathematics; Euler equations; Diffusion process; Statistics","score_opus":0.03365659819015417,"score_gpt":0.2701859446325642,"score_spread":0.23652934644241,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4383553031","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.008948467,0.0009817447,0.9851246,0.00067935477,0.00037357814,0.000044071778,0.000083483,0.00007203586,0.0036926528],"genre_scores_gemma":[0.39284402,0.003487066,0.5437034,0.00079647946,0.00074300263,0.00072466256,0.00072691974,0.00055830355,0.0564162],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99948174,0.00026986594,0.000025652584,0.00005916127,0.00012050945,0.00004318621],"domain_scores_gemma":[0.99737394,0.0017364756,0.00017313991,0.00011612672,0.00040948964,0.00019087283],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0028371706,0.001203326,0.0016567546,0.001282703,0.00069395883,0.0016144603,0.0017974826,0.002281026,0.0036648365],"category_scores_gemma":[0.0076517267,0.0007476777,0.0013422896,0.0008372005,0.0020066986,0.0026483978,0.0027810798,0.0035790473,0.0005423116],"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.000120029246,0.000085312095,0.00074755354,0.00027744457,0.000101425365,0.0001702665,0.00016813654,0.26938906,0.0035530573,0.7052887,0.0018776637,0.018221362],"study_design_scores_gemma":[0.000019948857,0.000013884892,0.00007291312,0.000019421417,0.000011083194,0.000018481973,0.000008668062,0.934539,0.00021351165,0.06346823,0.0016045186,0.00001032823],"about_ca_topic_score_codex":0.006986535,"about_ca_topic_score_gemma":0.0048900954,"teacher_disagreement_score":0.006986535,"about_ca_system_score_codex":0.0015801499,"about_ca_system_score_gemma":0.0029891164,"threshold_uncertainty_score":0.015004575},"labels":[],"label_agreement":null}]}