{"meta":{"page":1,"per_page":50,"max_per_page":100,"total":37,"total_is_capped":false,"direct_labels_cover":0,"predictions_cover":37,"direct_label_status":"direct model label, unvalidated","prediction_status":"machine_predicted_unvalidated (Codex and Gemma teacher distillation)","score_status":"score_only:v0-immature-baseline (scores rank; they never assert a category)","snapshot":{"source":"OpenAlex, pinned release, all 482 partitions","release":"2026-06-24","frame_built":"2026-07-12"},"query_hash":"2da40dcb5435","filters":{"venue":"BIT Numerical Mathematics"}},"results":[{"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.01507716441216068,"gpt":0.2655212796423967,"spread":0.2504441152302361,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004783767,0.0002067942,0.0003188028,0.00006830085,0.0002053836,0.0002070361,0.0008429874,0.000083142,0.00002346157],"category_scores_gemma":[0.00005375494,0.000177471,0.0001126368,0.0004418699,0.00004517272,0.0002496857,0.0001183598,0.0001171095,0.0000850614],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002385313,"about_ca_system_score_gemma":0.00003143238,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000008338767,"about_ca_topic_score_gemma":2.089412e-7,"domain_scores_codex":[0.9984846,0.0000594946,0.0004136703,0.0003661958,0.0002619326,0.0004140677],"domain_scores_gemma":[0.9986145,0.0003977142,0.0001650603,0.0005989192,0.0001060211,0.0001177141],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000005959771,0.001087413,0.00002064775,0.0001502812,0.0000297298,0.00002351458,0.0005626075,0.0005243282,0.001519858,0.6416856,0.00169709,0.3526929],"study_design_scores_gemma":[0.0003106579,0.0001640079,0.00002694056,0.000020065,0.00001075216,0.00002823542,0.00002794748,0.8524691,0.0009596049,0.141644,0.004093096,0.0002456155],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.001942985,0.00006957263,0.9958491,0.0001470983,0.0003364607,0.0002906387,0.000006978064,0.0003821373,0.0009749964],"genre_scores_gemma":[0.05800691,0.000002108284,0.9411253,0.0001618886,0.0003683897,0.00001008976,0.00001000406,0.00002484873,0.0002904621],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.8519447,"threshold_uncertainty_score":0.7237055,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.02643840364679785,"gpt":0.2643242923844076,"spread":0.2378858887376097,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002929457,0.0002297151,0.0003581643,0.00009709273,0.000353283,0.0003811051,0.0006684569,0.00008597955,0.00005381425],"category_scores_gemma":[0.0002125485,0.0002011106,0.0001088241,0.000440966,0.00004203466,0.0003444668,0.0002376377,0.0001499016,0.0003178474],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0000688778,"about_ca_system_score_gemma":0.00002295016,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000006510868,"about_ca_topic_score_gemma":7.735965e-7,"domain_scores_codex":[0.9978579,0.00007883354,0.0006941628,0.0003877098,0.0005744905,0.0004069168],"domain_scores_gemma":[0.9984657,0.0004064242,0.0002674591,0.0005634953,0.0001286756,0.000168268],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00002514123,0.00363965,0.0005003467,0.0006485946,0.0002703283,0.00001323397,0.03335468,0.2100825,0.01180752,0.4995285,0.01142434,0.2287052],"study_design_scores_gemma":[0.0002440145,0.00003481693,0.00001464598,0.00003770778,0.000009687626,0.000009492723,0.00007848931,0.9958743,0.000370426,0.001187995,0.001894858,0.0002435688],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01596031,0.00007682227,0.9818548,0.0007415932,0.0002814957,0.0002231532,0.000006968443,0.0003991559,0.0004557129],"genre_scores_gemma":[0.8579392,0.000001306422,0.1413108,0.0001618583,0.0001376395,0.000009742103,0.000009616957,0.00002179488,0.0004079789],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8419789,"threshold_uncertainty_score":0.8201053,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.07701120780305769,"gpt":0.3805854669413143,"spread":0.3035742591382566,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0004301491,0.0003411071,0.0005159001,0.0001981894,0.000342056,0.0001257498,0.0003089335,0.0001478371,0.0002805826],"category_scores_gemma":[0.002666238,0.0002570776,0.0002273035,0.0005005267,0.0001658372,0.0001287305,0.00008273217,0.0002462188,0.0002761812],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002109449,"about_ca_system_score_gemma":0.0001284848,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0000464538,"about_ca_topic_score_gemma":0.00000489068,"domain_scores_codex":[0.9978504,0.0001267735,0.0007294128,0.0003761306,0.0004378227,0.0004794412],"domain_scores_gemma":[0.9938511,0.004426155,0.000352103,0.0005924584,0.0005575386,0.0002206212],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00001384381,0.001463645,0.00001363146,0.0002295944,0.0001917758,5.024227e-7,0.0009036201,0.001395282,0.00252927,0.9852853,0.003125055,0.004848471],"study_design_scores_gemma":[0.0005119885,0.0001725983,0.0001498059,0.0001025861,0.0002059898,0.00001270331,0.0003963864,0.6061483,0.0004379348,0.3903785,0.00108604,0.0003971592],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.01516789,0.00003351752,0.9797325,0.0009344468,0.0002341096,0.001520426,0.00003449001,0.0002816904,0.002060898],"genre_scores_gemma":[0.3162531,0.000001109441,0.6816313,0.00007807816,0.00009416464,0.000901001,0.00001880632,0.00007048199,0.0009519791],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.604753,"threshold_uncertainty_score":0.9999881,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.02189809784750738,"gpt":0.2865220823314943,"spread":0.2646239844839869,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000545134,0.0001182684,0.0003167476,0.0002084012,0.0001136942,0.00008740404,0.0001478119,0.0000506227,0.00000361977],"category_scores_gemma":[0.000262784,0.0001062498,0.0001447019,0.0004787881,0.00002979471,0.0001073435,0.00004195721,0.00004135295,1.284743e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001213165,"about_ca_system_score_gemma":0.00004469491,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000001904625,"about_ca_topic_score_gemma":0.000003312547,"domain_scores_codex":[0.9990175,0.00001359252,0.0003708974,0.0002541491,0.0001638528,0.0001799773],"domain_scores_gemma":[0.9980868,0.001324895,0.0001837803,0.0001756115,0.0001578001,0.00007118269],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00006971189,0.0006074528,0.000242159,0.0006708525,0.0009931714,6.834593e-7,0.001168125,0.005573261,0.003006566,0.07424824,0.0004489915,0.9129708],"study_design_scores_gemma":[0.0009387301,0.0002529398,0.00007959567,0.00001253185,0.0002898373,7.331672e-7,0.00003823026,0.9855731,0.001394825,0.009123359,0.002170685,0.0001253984],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.007603443,0.00006737611,0.9910734,0.0003933636,0.00008840115,0.0006829163,0.00006423969,0.00002257858,0.000004252528],"genre_scores_gemma":[0.07749677,0.000003591672,0.9220546,0.0001167033,0.00006306956,0.0001693568,0.00004999375,0.000007924385,0.00003794109],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.9799999,"threshold_uncertainty_score":0.433274,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.0535534274884741,"gpt":0.2607623607890088,"spread":0.2072089333005347,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002991315,0.0001479384,0.0002065958,0.00007902244,0.0001318277,0.00006811907,0.0004177937,0.00006314152,0.000009568826],"category_scores_gemma":[0.00101623,0.0001039445,0.00007420615,0.0004563981,0.00002337911,0.0003354732,0.0001193885,0.0001566929,0.00005564314],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001048645,"about_ca_system_score_gemma":0.000007693919,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000002368583,"about_ca_topic_score_gemma":4.619683e-7,"domain_scores_codex":[0.99875,0.00001304303,0.0004322882,0.0002270238,0.0002763594,0.000301266],"domain_scores_gemma":[0.9979126,0.001382381,0.00008271172,0.0005064817,0.00005668394,0.00005911619],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000001861352,0.0002681696,0.000008685583,0.0001635516,0.00001531861,0.000002157951,0.002300489,0.2388998,0.0009098447,0.7432067,0.0001700632,0.0140533],"study_design_scores_gemma":[0.0001741512,0.00002936853,0.00001926253,0.00008391355,0.00000644152,0.00000749536,0.00004156619,0.9076963,0.0001073999,0.09139743,0.0003093492,0.0001273368],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.001166393,0.000141515,0.9961805,0.001334053,0.0001518134,0.0004725623,8.019244e-7,0.0001818883,0.0003704667],"genre_scores_gemma":[0.3794724,0.00002858697,0.6201463,0.000111192,0.00003677232,0.0001176387,6.994588e-7,0.00001876055,0.00006762477],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.6687965,"threshold_uncertainty_score":0.4238734,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.01650819104786249,"gpt":0.227166666810932,"spread":0.2106584757630695,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000359248,0.0001993605,0.0003061579,0.0000556363,0.0008544456,0.0004173026,0.0007058479,0.00007054031,0.00001011368],"category_scores_gemma":[0.00007063053,0.0001366628,0.0001097839,0.0004027415,0.00004470083,0.0002069841,0.0002465324,0.0001373318,0.00007740805],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00006519217,"about_ca_system_score_gemma":0.00002418329,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00007131113,"about_ca_topic_score_gemma":0.000002594598,"domain_scores_codex":[0.9981142,0.000114695,0.0006576,0.0002979351,0.0004854367,0.0003301671],"domain_scores_gemma":[0.9984537,0.0004605985,0.0002919632,0.0006178761,0.0001030427,0.0000727906],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000002039011,0.0002822374,0.0001225594,0.0002853078,0.00004580412,0.000004174531,0.004301663,0.01932638,0.001892799,0.9666847,0.004091523,0.002960802],"study_design_scores_gemma":[0.0001281072,0.00002595992,0.00002972461,0.00007323121,0.00001219526,0.00001911639,0.0002459427,0.9951032,0.0001422138,0.003409401,0.0006326205,0.0001782922],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01724995,0.00007306357,0.9797008,0.0007399147,0.0003227358,0.0002494837,0.000005112809,0.0004414981,0.001217459],"genre_scores_gemma":[0.9576836,4.590358e-7,0.04147094,0.00005423076,0.0001706684,0.00001538318,0.000007708994,0.00001954276,0.0005774205],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9757768,"threshold_uncertainty_score":0.6571791,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.01469804927708796,"gpt":0.2498188976586915,"spread":0.2351208483816035,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00009588797,0.0001061569,0.0001637763,0.00003808176,0.00008938053,0.00009954976,0.0004375518,0.00003670395,0.00007326027],"category_scores_gemma":[0.0001475387,0.00008728093,0.00007994039,0.0003153325,0.00001991489,0.0001748284,0.00004468157,0.00004849473,0.0003054047],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0000198217,"about_ca_system_score_gemma":0.00002951218,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000003809136,"about_ca_topic_score_gemma":2.226789e-7,"domain_scores_codex":[0.9991986,0.00001053889,0.0002248271,0.0002045958,0.0001479445,0.0002134969],"domain_scores_gemma":[0.9988886,0.0006800636,0.00007459478,0.0002342521,0.00004005804,0.00008245116],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000009040095,0.0007460282,0.0000311354,0.00012751,0.00002571661,0.000007745874,0.002088285,0.0002036653,0.0002077623,0.1645839,0.01266552,0.8193037],"study_design_scores_gemma":[0.0005124428,0.0003661806,0.000215766,0.00006015887,0.0000189885,0.00004137296,0.00003101903,0.5038253,0.0007501009,0.4427952,0.05101095,0.0003725176],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.007035382,0.00008878513,0.9874288,0.001527497,0.0001032011,0.0002641788,0.000006015081,0.0002008301,0.003345311],"genre_scores_gemma":[0.1692008,0.00002679859,0.8280097,0.0006467686,0.0002249767,0.00007698217,0.000004140809,0.00001854669,0.001791335],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.8189312,"threshold_uncertainty_score":0.3925462,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Calgary","funders":"","keywords":"Superconvergence; Mathematics; Finite element method; Norm (philosophy); 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","retraction":null,"screen_n_in":null,"score":{"opus":0.03925458276625492,"gpt":0.3323226077610098,"spread":0.2930680249947549,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007984992,0.0002071733,0.0004079644,0.00004829179,0.0001196027,0.000022391,0.0002487612,0.00008527856,0.0001548191],"category_scores_gemma":[0.005279483,0.000157202,0.0001044106,0.000334668,0.0002207735,0.0001152615,0.00006558806,0.0002667329,0.000007735199],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002412446,"about_ca_system_score_gemma":0.00003578667,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00000266034,"about_ca_topic_score_gemma":0.000001214191,"domain_scores_codex":[0.9985287,0.00006618196,0.0006778588,0.0002010358,0.0002981874,0.0002280695],"domain_scores_gemma":[0.9794173,0.01967238,0.000178258,0.0003974166,0.0002392018,0.00009551122],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0001307139,0.001465075,0.0009800509,0.007933081,0.0006707341,0.000002682469,0.01343248,0.2263325,0.08738181,0.4684755,0.000641484,0.1925539],"study_design_scores_gemma":[0.0001855028,0.00004341986,0.00010527,0.00001772397,0.00005167416,0.000003902149,0.0002503185,0.822745,0.001821899,0.173671,0.0009514199,0.0001529265],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.006332677,0.0001459128,0.9919064,0.0002423507,0.0002832434,0.0007284459,0.0001149638,0.0001357971,0.00011022],"genre_scores_gemma":[0.1612421,0.00002067361,0.8384137,0.00003160928,0.00003768938,0.0001922029,0.000006341447,0.00004044348,0.00001528184],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.5964125,"threshold_uncertainty_score":0.6410509,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of British Columbia","funders":"","keywords":"Computer science; Mathematics","retraction":null,"screen_n_in":null,"score":{"opus":0.01058409441577221,"gpt":0.2166613423241137,"spread":0.2060772479083415,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0001989943,0.00008262227,0.0001309377,0.00005254359,0.00002964775,0.00004037559,0.00006569771,0.00005381523,0.0001121819],"category_scores_gemma":[0.0000603769,0.00007322309,0.0000447334,0.0001553403,0.000009445939,0.00006292886,0.000006586013,0.00006522626,0.001260474],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004316039,"about_ca_system_score_gemma":0.000003211078,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000004247386,"about_ca_topic_score_gemma":0.000003484912,"domain_scores_codex":[0.9993203,0.000005286204,0.0003234693,0.00007349298,0.0001326004,0.000144885],"domain_scores_gemma":[0.9996679,0.00006582486,0.00003522497,0.0001493405,0.00003054085,0.00005118917],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0000140779,0.0002817647,0.00004228948,0.000213013,0.0000738669,0.00001302357,0.001758076,0.0009385016,0.6458443,0.03866306,0.01165781,0.3005002],"study_design_scores_gemma":[0.0001415683,0.00004123339,0.001155121,0.00006996192,0.00003691468,0.00002632339,0.0002251771,0.9478496,0.02672631,0.01208075,0.01126046,0.0003865801],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.05523348,0.00005947545,0.9322436,0.0000636329,0.0002918034,0.000179443,0.000002400669,0.0003690792,0.01155707],"genre_scores_gemma":[0.9946142,0.000001822606,0.004675951,0.000008985947,0.0001902487,0.000007402832,0.000007125153,0.00002104457,0.0004731499],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9469111,"threshold_uncertainty_score":0.9995171,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.01542632905727839,"gpt":0.2456220619465703,"spread":0.2301957328892919,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008215103,0.0001124432,0.0002259641,0.0000351115,0.0001588816,0.00007225003,0.0004956823,0.00005654059,0.00007607161],"category_scores_gemma":[0.00008363141,0.00005687087,0.00006884669,0.000424545,0.000171876,0.000158955,0.00009216868,0.0001370818,0.00006600311],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001189071,"about_ca_system_score_gemma":0.00001904327,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001214471,"about_ca_topic_score_gemma":1.738707e-7,"domain_scores_codex":[0.9988892,0.0001572969,0.0003779839,0.0001545497,0.0002736412,0.0001473214],"domain_scores_gemma":[0.9981739,0.001139538,0.000176824,0.0004324693,0.00003927731,0.00003800728],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00002019404,0.00007498656,0.0001312841,0.00005494557,0.00003894589,0.000001201953,0.002858964,0.00006027888,0.00002006926,0.9150758,0.0000747033,0.0815886],"study_design_scores_gemma":[0.0006488863,0.00005389012,0.001115991,0.00003255412,0.00004291148,0.00001977606,0.00004138246,0.5429724,0.0001093558,0.4536991,0.001150027,0.0001137397],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.03547475,0.000197298,0.959102,0.002510394,0.00004822915,0.0004097048,0.000002887257,0.00007256028,0.002182219],"genre_scores_gemma":[0.8902616,0.00004823791,0.1086355,0.00009352189,0.00009772481,0.00002519106,0.000002757475,0.00001175382,0.0008237512],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8547868,"threshold_uncertainty_score":0.2319127,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.02084626681470694,"gpt":0.3000792706158918,"spread":0.2792330038011849,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001329936,0.000285943,0.0004944765,0.000130625,0.000087942,0.00004013045,0.0002131536,0.0001097819,0.00009888914],"category_scores_gemma":[0.000263149,0.0002275876,0.000147883,0.0006652048,0.00004554479,0.000127367,0.00003374525,0.0001825588,0.0000323698],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001139107,"about_ca_system_score_gemma":0.0000169892,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000009395893,"about_ca_topic_score_gemma":0.000003671106,"domain_scores_codex":[0.9986067,0.00002498651,0.0005073248,0.0002601229,0.0002715502,0.0003292956],"domain_scores_gemma":[0.9988144,0.0004098583,0.000120055,0.0003660042,0.0001627202,0.0001269402],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0005592079,0.005268806,0.0002821289,0.002909542,0.002761674,0.00006993839,0.004597221,0.3351789,0.2700222,0.09278303,0.005510639,0.2800567],"study_design_scores_gemma":[0.0002649146,0.0001613343,0.00001254482,0.00007320164,0.0001643757,0.00001562215,0.00007262173,0.9781909,0.008134161,0.008542799,0.004052467,0.0003150445],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.00211507,0.00004901759,0.9960144,0.0001589515,0.00004530638,0.0005221769,0.00001091009,0.0007598383,0.000324322],"genre_scores_gemma":[0.2168879,0.00001873306,0.7822614,0.00004950049,0.0001223896,0.0002255757,0.00004478145,0.00008333661,0.000306361],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.643012,"threshold_uncertainty_score":0.9280754,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.0359320948880303,"gpt":0.2766361208859967,"spread":0.2407040259979664,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002236392,0.0002121519,0.0004843573,0.0001060834,0.0002822799,0.0001000395,0.0002108731,0.0001460568,0.00005830906],"category_scores_gemma":[0.00108145,0.0002028322,0.00007747411,0.0003879683,0.0001127239,0.0001785528,0.00003757537,0.0001690479,0.00001086547],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003060779,"about_ca_system_score_gemma":0.00005920978,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002898348,"about_ca_topic_score_gemma":0.000003520204,"domain_scores_codex":[0.9985893,0.000004036165,0.0005840298,0.0004469669,0.00005400124,0.0003217005],"domain_scores_gemma":[0.998216,0.0006373725,0.0004566622,0.0003048801,0.0002686642,0.0001163849],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00002370676,0.0003686984,0.000006512769,0.0000926074,0.00003737,3.331941e-8,0.0002554915,0.0006865633,0.0003150489,0.993366,0.000008961063,0.004838991],"study_design_scores_gemma":[0.0007096478,0.0001445666,0.00001522376,0.00001205041,0.00005033683,0.000003541087,0.0004200301,0.7445095,0.0004421623,0.2528929,0.0004970811,0.0003028993],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0009810525,0.00002480611,0.9967808,0.00006602209,0.0001306817,0.001171046,0.0006424523,0.00007321947,0.0001299646],"genre_scores_gemma":[0.2815839,7.096497e-7,0.7165025,0.00003320949,0.000194646,0.001336502,0.0002639536,0.00004369611,0.00004085656],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.743823,"threshold_uncertainty_score":0.8271258,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.09789838969182385,"gpt":0.3735161774857028,"spread":0.275617787793879,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0006931685,0.0003582329,0.0006331514,0.0002188634,0.0002276135,0.0001136326,0.0002376305,0.000141344,0.0002699677],"category_scores_gemma":[0.001776095,0.0002816442,0.0001854924,0.0007327638,0.00009114885,0.0001910428,0.00004521607,0.0002386774,0.0000196561],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001536078,"about_ca_system_score_gemma":0.00007804397,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00008880494,"about_ca_topic_score_gemma":0.0000447754,"domain_scores_codex":[0.9973928,0.000294766,0.0008875489,0.000460264,0.0005143694,0.0004501931],"domain_scores_gemma":[0.9931836,0.005833965,0.0002853033,0.000414281,0.0001710934,0.0001117941],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0001435642,0.003704226,0.0002230146,0.0003025904,0.00008183682,0.000002592966,0.0004191425,0.0007885513,0.005135607,0.9808442,0.0006278383,0.007726863],"study_design_scores_gemma":[0.001569049,0.0007079732,0.001301878,0.0001884893,0.0002172271,0.000009295658,0.0004291679,0.2687078,0.005621076,0.7203205,0.0003273985,0.000600085],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0508793,0.00001949717,0.9470302,0.0002781735,0.0002355452,0.0008755936,0.00001970276,0.0001338354,0.0005280856],"genre_scores_gemma":[0.4900747,0.000002289499,0.5090369,0.00003990962,0.0001119084,0.0003674637,0.0000403333,0.00005153193,0.0002749833],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.4391954,"threshold_uncertainty_score":0.9999636,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.01101762009235573,"gpt":0.242900988950454,"spread":0.2318833688580983,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001654509,0.0001513363,0.0002114248,0.00004718208,0.0001298601,0.0001381166,0.0004343629,0.00006538925,0.00004859785],"category_scores_gemma":[0.000049144,0.0001245174,0.0001020624,0.0002378853,0.00004688829,0.0002045924,0.00006383419,0.00007386253,0.00006105692],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002436002,"about_ca_system_score_gemma":0.00002151861,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000009529771,"about_ca_topic_score_gemma":0.000001364889,"domain_scores_codex":[0.9989406,0.00002823088,0.0003032211,0.0002442458,0.000214922,0.0002687415],"domain_scores_gemma":[0.9992003,0.000198807,0.000147027,0.000326142,0.00006355389,0.00006419577],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.000003536347,0.0001771289,0.00002722434,0.0002050562,0.00001302422,0.000002921816,0.0002788433,0.0005345691,0.0007327822,0.9907202,0.002817102,0.004487577],"study_design_scores_gemma":[0.0003897987,0.00009013953,0.0001131609,0.000034348,0.00001279141,0.0000330002,0.00004139782,0.1507611,0.001834429,0.8392325,0.007211597,0.0002457594],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.003221941,0.000036947,0.9935717,0.0003405587,0.0001943729,0.0003852379,0.00001864445,0.0002233257,0.002007265],"genre_scores_gemma":[0.5080029,0.000001327596,0.4907469,0.0001217757,0.0002087028,0.00008414433,0.00002261711,0.00002156047,0.0007901493],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.5047809,"threshold_uncertainty_score":0.5077673,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Toronto","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Collocation method; Superconvergence; Collocation (remote sensing); Orthogonal collocation; Mathematics; Differential equation; Applied mathematics; Mathematical analysis; Computer science; Ordinary differential equation; Finite element method","retraction":null,"screen_n_in":null,"score":{"opus":0.1164143317319812,"gpt":0.41802981246433,"spread":0.3016154807323488,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0008962007,0.0004258268,0.0007687081,0.0002199031,0.0002113067,0.00009459686,0.0003672201,0.0001619103,0.000522993],"category_scores_gemma":[0.001852371,0.0003144365,0.0001995907,0.0006248247,0.00007086025,0.0001770887,0.0001414643,0.0002087332,0.0001193201],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001570303,"about_ca_system_score_gemma":0.00005504283,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0000127759,"about_ca_topic_score_gemma":0.000003847631,"domain_scores_codex":[0.9974075,0.0001978119,0.0008600573,0.000384771,0.0004356355,0.0007142578],"domain_scores_gemma":[0.9955954,0.002814169,0.0002634046,0.0006042388,0.0002228319,0.0004999622],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0002956962,0.004105595,0.000098592,0.0006702209,0.0004945862,7.283882e-7,0.008751282,0.00003284739,0.02314774,0.8906321,0.003039773,0.06873085],"study_design_scores_gemma":[0.007126737,0.003650705,0.001114102,0.001017534,0.003667504,0.0001047,0.008734078,0.3585714,0.08517906,0.4930304,0.03245094,0.005352841],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.01470607,0.00002253314,0.9818037,0.0002154554,0.0004929455,0.00164218,0.00003412391,0.0001892064,0.0008938006],"genre_scores_gemma":[0.3946374,0.000001629971,0.6039737,0.0001206111,0.0001795531,0.0006994379,0.00002467633,0.00007305785,0.0002898941],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.3976017,"threshold_uncertainty_score":0.9999308,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.03707954119187995,"gpt":0.2472527597454245,"spread":0.2101732185535445,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0002455252,0.0001930819,0.0007746544,0.0002300154,0.00009767775,0.00008543183,0.0003155384,0.0001169035,0.0001394729],"category_scores_gemma":[0.0002062116,0.0001993299,0.0002891551,0.0009201721,0.00003404227,0.00007749341,0.00005167411,0.00009495072,0.001721939],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00007134121,"about_ca_system_score_gemma":0.00002302389,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00005744874,"about_ca_topic_score_gemma":0.000002525369,"domain_scores_codex":[0.9983985,0.00000217305,0.0007549004,0.0004308025,0.00006432644,0.0003493391],"domain_scores_gemma":[0.9986306,0.0002298262,0.0004400969,0.0005102691,0.00007396453,0.0001151913],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000006513034,0.0001581061,0.0006079422,0.0001741291,0.0002045173,1.397492e-7,0.0001674867,0.003173814,0.000007833679,0.9952418,0.0001626872,0.00009500316],"study_design_scores_gemma":[0.0005571463,0.0001490304,0.00242191,0.00003544379,0.0001990685,0.00000447776,0.0002818775,0.6713615,0.000002950707,0.310117,0.01432845,0.0005411843],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.003199596,0.0005154986,0.9906936,0.0002627957,0.000267647,0.0008250232,0.0003044903,0.0000696573,0.003861669],"genre_scores_gemma":[0.9637032,0.000005234229,0.03398115,0.00008784085,0.000119194,0.0004238995,0.00003755963,0.00004526872,0.001596686],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9605036,"threshold_uncertainty_score":0.9990553,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.09032094547931405,"gpt":0.4079312092951325,"spread":0.3176102638158185,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00119167,0.0002944569,0.0007248626,0.0001036969,0.0001954033,0.000071259,0.0003492418,0.0001579538,0.0003781774],"category_scores_gemma":[0.006334199,0.0002206254,0.0002239966,0.0005188344,0.000181012,0.0001578546,0.00008225811,0.0003107504,0.000004897862],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0000398317,"about_ca_system_score_gemma":0.0001028348,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001796499,"about_ca_topic_score_gemma":0.00001728931,"domain_scores_codex":[0.997732,0.0002264441,0.000948563,0.0003601232,0.0003724481,0.0003604591],"domain_scores_gemma":[0.9904215,0.007664497,0.0005828013,0.0007012487,0.0004523921,0.000177538],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0001121866,0.0027411,0.0001229184,0.0008774049,0.000221602,5.974322e-7,0.001496961,0.00001579507,0.1095819,0.8321445,0.00009922707,0.05258583],"study_design_scores_gemma":[0.001265993,0.0006830564,0.0001610028,0.00009797088,0.0006457214,0.00001468348,0.0004922124,0.2577724,0.07475603,0.6628889,0.0006399514,0.0005821027],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.07612015,0.000009056923,0.921888,0.0001150058,0.0002469171,0.0009725179,0.00003622822,0.0001098634,0.0005022928],"genre_scores_gemma":[0.4069055,0.000001040757,0.592763,0.00001157679,0.00005194706,0.0001728049,0.00001284947,0.00004157086,0.00003970874],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.3307854,"threshold_uncertainty_score":0.8996844,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.02938821307998853,"gpt":0.2646046490849331,"spread":0.2352164360049446,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001495812,0.0002361134,0.0003631807,0.00008121616,0.0001031886,0.00004130244,0.0001189078,0.00009331066,0.0001155596],"category_scores_gemma":[0.0003011816,0.0002260399,0.0000858244,0.0002656539,0.00007988801,0.0001695205,0.00001418642,0.0001271471,0.00003881511],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00007722618,"about_ca_system_score_gemma":0.000005893979,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":2.721367e-7,"about_ca_topic_score_gemma":2.805452e-7,"domain_scores_codex":[0.9987819,0.00001584083,0.0005037915,0.0001953501,0.0002252135,0.0002779616],"domain_scores_gemma":[0.9984401,0.001080795,0.00008501607,0.0001932916,0.00006041862,0.0001403159],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00004665429,0.001570857,0.00005156222,0.009652178,0.0007127255,0.00001087039,0.01263986,0.2874648,0.002551244,0.1266831,0.01418394,0.5444323],"study_design_scores_gemma":[0.0003625899,0.00007864326,0.000009723212,0.00005474157,0.00004922672,0.00001795761,0.0001941721,0.868893,0.0004246629,0.128103,0.001557959,0.0002542329],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.002210872,0.0001581202,0.9942967,0.0003136694,0.0001637541,0.000658452,0.00003123234,0.0002983572,0.001868818],"genre_scores_gemma":[0.06730464,0.00006218337,0.9319403,0.00008578813,0.00008629602,0.000211029,0.00001289894,0.00007640659,0.000220434],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.5814283,"threshold_uncertainty_score":0.9217638,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.005888820163109136,"gpt":0.244366149774757,"spread":0.2384773296116479,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001661622,0.0002200052,0.0003057023,0.0001387152,0.00005810145,0.00003805039,0.0002250998,0.00008033677,0.0002121149],"category_scores_gemma":[0.00002737341,0.0002209342,0.0001163707,0.0005288617,0.00005159845,0.00008649549,0.00008396081,0.0001945593,0.00006125782],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001215543,"about_ca_system_score_gemma":0.00006195367,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0002207565,"about_ca_topic_score_gemma":0.00005224409,"domain_scores_codex":[0.9984876,0.00002638862,0.0005423615,0.0002401652,0.0002615369,0.0004419551],"domain_scores_gemma":[0.9990336,0.0002938563,0.00009962415,0.0003800781,0.00005718743,0.0001356358],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000005801314,0.0006886438,0.01558436,0.00002860215,0.0000415492,0.00002108009,0.0004181014,0.004298843,0.001210117,0.9707882,0.0000368834,0.00687783],"study_design_scores_gemma":[0.0003404235,0.00003188584,0.0005396718,0.00003401442,0.00002462874,0.000002366105,0.0003385749,0.885909,0.0006027996,0.1111894,0.0006606816,0.0003266082],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2066209,0.00002082883,0.7859353,0.0001099364,0.00007416344,0.0001039913,0.00003002367,0.00004663611,0.007058165],"genre_scores_gemma":[0.968469,9.331791e-7,0.03099596,0.00009116524,0.00007250964,0.000008282394,0.00007183887,0.00005102543,0.0002392763],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.8816102,"threshold_uncertainty_score":0.9009437,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.1340211918411587,"gpt":0.3708053924682942,"spread":0.2367842006271355,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.000510173,0.0004429157,0.0009900478,0.0001495428,0.0005362629,0.00006429898,0.0004969889,0.0002456272,0.0001551486],"category_scores_gemma":[0.006101847,0.0003916134,0.0004684655,0.0003674835,0.0001760483,0.0001544145,0.0001259332,0.0002287336,0.00005992228],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001537942,"about_ca_system_score_gemma":0.0001147516,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001997261,"about_ca_topic_score_gemma":0.000003839697,"domain_scores_codex":[0.9971008,0.00006275686,0.001054764,0.0005051626,0.0004742409,0.0008022593],"domain_scores_gemma":[0.9923344,0.005923926,0.0004914838,0.0006805424,0.0002690159,0.0003006553],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.001067284,0.01115346,0.0008559837,0.005563235,0.001555498,0.00003461746,0.006570753,0.0001717531,0.02034323,0.6530005,0.1787398,0.1209439],"study_design_scores_gemma":[0.003364204,0.0005724176,0.0002519317,0.0001373282,0.0003866216,0.00006545574,0.0002365692,0.0455449,0.005617971,0.9267691,0.01596218,0.001091303],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.01511453,0.00002499659,0.980205,0.0005684155,0.0005908019,0.002646384,0.0001611163,0.0003291343,0.0003596204],"genre_scores_gemma":[0.1585762,0.000007954381,0.8382288,0.0001602012,0.0005332336,0.001093731,0.00003619635,0.000166164,0.001197589],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.2737687,"threshold_uncertainty_score":0.9998536,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.01593071988128326,"gpt":0.2690526226503188,"spread":0.2531219027690356,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00008896025,0.0001289868,0.0001765052,0.00003802753,0.00009013312,0.00006779632,0.0000631845,0.00005629595,0.0000394879],"category_scores_gemma":[0.00004531322,0.0001256017,0.00003667031,0.00008140567,0.00002930238,0.00007777473,0.000003801417,0.00007917303,0.000007946903],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002371551,"about_ca_system_score_gemma":0.00001056976,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000001052604,"about_ca_topic_score_gemma":1.412691e-7,"domain_scores_codex":[0.9993989,0.0000174391,0.0001899058,0.0001239767,0.0000843328,0.0001853715],"domain_scores_gemma":[0.9995496,0.0001077737,0.00002711218,0.0001523656,0.00004499696,0.0001181522],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0002672088,0.0153661,0.0007866803,0.006459107,0.001434537,0.0001021746,0.01917584,0.06742892,0.2772644,0.3475444,0.033567,0.2306035],"study_design_scores_gemma":[0.0009374095,0.0003512795,0.000009306503,0.0000594205,0.000032382,0.00001426868,0.00009079422,0.9816035,0.01346039,0.002599784,0.0006490076,0.0001924465],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02816315,0.00005031096,0.9696111,0.0000215389,0.0000909836,0.0001678315,0.0001026146,0.0002074097,0.001585081],"genre_scores_gemma":[0.7755086,0.000002175509,0.2242806,0.00006158443,0.00001673178,0.0000472122,0.00003433808,0.00002486287,0.00002387798],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9141746,"threshold_uncertainty_score":0.5121889,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.01650375105284594,"gpt":0.2340434420568549,"spread":0.2175396910040089,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0000477759,0.0002243872,0.0003245824,0.00009097633,0.00006516856,0.00003025504,0.0001990108,0.00008538949,0.00005514357],"category_scores_gemma":[0.00004409443,0.0001946181,0.0001284864,0.0004434806,0.00007161419,0.000137758,0.00003110706,0.0001894093,0.0002873355],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000116021,"about_ca_system_score_gemma":0.00000560401,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0000152787,"about_ca_topic_score_gemma":0.000001905801,"domain_scores_codex":[0.9988278,0.00001248388,0.0003993759,0.0001793693,0.0002840768,0.0002969093],"domain_scores_gemma":[0.99933,0.0001615577,0.00005341885,0.0003383424,0.00003604001,0.00008062011],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00001336696,0.001508707,0.0004246236,0.0004292099,0.0001484408,0.00004289478,0.0001528492,0.3562127,0.01227319,0.5717882,0.03296204,0.02404376],"study_design_scores_gemma":[0.0002624812,0.0001539216,0.001475708,0.0001095387,0.00007471405,0.00001120283,0.0001013586,0.6441278,0.01428485,0.3152628,0.02332236,0.0008132663],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0110593,0.0001711975,0.9829825,0.0002533964,0.00006198126,0.0001515461,0.00001145472,0.0015021,0.003806476],"genre_scores_gemma":[0.8761181,0.00002652763,0.1229515,0.0001774319,0.0002234697,0.00006599455,0.00002143863,0.00007664206,0.0003389068],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8650588,"threshold_uncertainty_score":0.7936293,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.05276321273951431,"gpt":0.3207871811564155,"spread":0.2680239684169012,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006060335,0.0002660622,0.0007006565,0.0001060377,0.0001422147,0.00003342786,0.0002116985,0.0001972158,0.0005853177],"category_scores_gemma":[0.002520261,0.000208163,0.0001920839,0.0002263832,0.0001076014,0.00008412872,0.0001047389,0.0002525943,0.0000326001],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001275021,"about_ca_system_score_gemma":0.00006837424,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000001503568,"about_ca_topic_score_gemma":0.00000323134,"domain_scores_codex":[0.9981704,0.00003290379,0.0008465011,0.0002830529,0.0003071305,0.0003599993],"domain_scores_gemma":[0.9961027,0.002694125,0.0003314083,0.0004615464,0.0001848374,0.0002253786],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00002910507,0.0006509533,0.00001209739,0.001048021,0.00006236715,0.00000215061,0.0006254982,6.998503e-7,0.02411153,0.9702684,0.001911382,0.001277767],"study_design_scores_gemma":[0.001038484,0.0003386961,0.00003220803,0.0001604741,0.0002632271,0.0001866765,0.0003633978,0.02123435,0.005535294,0.9496431,0.02069622,0.0005078249],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.831622,0.0001259689,0.1514314,0.0008986864,0.0005013114,0.001655013,0.0001942746,0.0001951859,0.01337615],"genre_scores_gemma":[0.5034828,0.00001714574,0.4938199,0.0001037576,0.0002733507,0.0001763061,0.000009141986,0.00009140226,0.002026203],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.3423885,"threshold_uncertainty_score":0.8488643,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.06994256565394194,"gpt":0.3639990631491104,"spread":0.2940564974951685,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000435499,0.0002496646,0.0008588636,0.0001376673,0.00008292776,0.00001682116,0.0002953104,0.0001450759,0.0002055415],"category_scores_gemma":[0.004607344,0.0002119142,0.0003339327,0.0005136884,0.0001776197,0.0001019648,0.00004514124,0.0001254995,0.000008293158],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003161992,"about_ca_system_score_gemma":0.00006546399,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000005519228,"about_ca_topic_score_gemma":6.034228e-7,"domain_scores_codex":[0.9977153,0.0001485914,0.001253637,0.0002496932,0.0003443906,0.0002883668],"domain_scores_gemma":[0.994685,0.003564725,0.0007741298,0.0004383125,0.0004206438,0.0001171948],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0002295446,0.002441912,0.00002472793,0.000856356,0.0001706937,4.560754e-7,0.0006733528,0.0001454281,0.06177763,0.9052777,0.0001613094,0.0282409],"study_design_scores_gemma":[0.001620715,0.0003792661,0.00007840399,0.0001265249,0.0002853041,0.000001169954,0.000124994,0.1628429,0.07336487,0.7608191,0.0001176487,0.00023905],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01535455,0.00002958727,0.9832087,0.0001847182,0.0001566128,0.000824764,0.00005793404,0.00007812498,0.0001049728],"genre_scores_gemma":[0.5757776,0.000006622178,0.423959,0.00002270089,0.00004488015,0.00003911505,0.00002215959,0.00002488923,0.0001030425],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.560423,"threshold_uncertainty_score":0.8641611,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.1082028943894563,"gpt":0.330729608231756,"spread":0.2225267138422997,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004020964,0.0001961494,0.0003083687,0.0002044821,0.0002983222,0.0000376387,0.0002988584,0.0001009693,0.0001181507],"category_scores_gemma":[0.005458292,0.0001486113,0.0001813899,0.000651992,0.0001763381,0.0001299213,0.0000649744,0.0001975352,0.00005037766],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002929305,"about_ca_system_score_gemma":0.0001925234,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001473278,"about_ca_topic_score_gemma":0.0001750794,"domain_scores_codex":[0.9983538,0.00006586799,0.0006682987,0.0002153531,0.0003892944,0.0003074013],"domain_scores_gemma":[0.9956627,0.003328098,0.0003286494,0.000408604,0.000205991,0.00006594614],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00002193491,0.001240349,0.00001617886,0.00005462105,0.00003149883,2.145723e-7,0.0009534447,0.002841275,0.0008905722,0.9923397,0.0013883,0.000221919],"study_design_scores_gemma":[0.0007706518,0.0002064921,0.0005511837,0.000225383,0.0000980506,0.00000213115,0.0009640084,0.07532969,0.0007876822,0.9206604,0.0001701973,0.0002341305],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.07305355,0.00002132278,0.9206277,0.004160627,0.0002274474,0.001083302,0.0001087392,0.00006186092,0.0006554179],"genre_scores_gemma":[0.9522908,0.000005735391,0.04697284,0.00006165387,0.00005684759,0.0003952489,0.00002242853,0.00002819886,0.0001662787],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.8792372,"threshold_uncertainty_score":0.6534479,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.05798208207617285,"gpt":0.3973959912080013,"spread":0.3394139091318285,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0007601116,0.0007124752,0.001185684,0.000357688,0.0005213501,0.0002237602,0.0008121993,0.0002746666,0.0004967967],"category_scores_gemma":[0.001915285,0.0005782209,0.0003266388,0.001874378,0.0001882153,0.0002568913,0.0003393282,0.0005311793,0.0004096285],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002815085,"about_ca_system_score_gemma":0.0001300584,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00007304995,"about_ca_topic_score_gemma":0.00001057755,"domain_scores_codex":[0.9953564,0.0005261424,0.001329632,0.0008861246,0.000967717,0.0009339273],"domain_scores_gemma":[0.9933624,0.003552305,0.0005695297,0.001539381,0.0003075992,0.000668789],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0003412845,0.005855617,0.0003173101,0.0006833266,0.0009315817,0.000028721,0.002782529,0.000588059,0.04652743,0.6632269,0.001454734,0.2772625],"study_design_scores_gemma":[0.0009449224,0.0007391722,0.0006741938,0.0001740812,0.0008484949,0.0000990035,0.0003203894,0.06042441,0.002410763,0.9223299,0.009816746,0.001217948],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.02218793,0.00004348036,0.971934,0.001112184,0.00022401,0.001846529,0.00003631342,0.0006397991,0.001975803],"genre_scores_gemma":[0.08736844,0.00000924206,0.9100491,0.0002600173,0.0002804902,0.0008932673,0.00004463201,0.0002101987,0.0008845536],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.2760445,"threshold_uncertainty_score":0.9996669,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.1037303310864359,"gpt":0.3652292303402397,"spread":0.2614988992538039,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaresearch"],"consensus_categories":[],"category_scores_codex":[0.001502815,0.0002761704,0.0005089748,0.00007186616,0.000343223,0.00005658997,0.0006066266,0.0001049407,0.0001300136],"category_scores_gemma":[0.02141075,0.0001388147,0.0003645843,0.0004632362,0.000227876,0.00005593197,0.00009719479,0.0002875995,0.0000435517],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00005484373,"about_ca_system_score_gemma":0.00003332334,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002547961,"about_ca_topic_score_gemma":0.000006255129,"domain_scores_codex":[0.9978547,0.0003523564,0.0006958629,0.0002460104,0.000513858,0.0003372393],"domain_scores_gemma":[0.9577637,0.0405784,0.0004718277,0.0008989724,0.0001958186,0.00009131051],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00001683286,0.000511325,0.000002957167,0.00009518703,0.00008485907,7.725756e-8,0.0005844398,0.00001837041,0.0008231326,0.9824565,0.0009572257,0.01444907],"study_design_scores_gemma":[0.0002204928,0.0002627551,0.00004624786,0.00008763702,0.0002019999,0.00000160111,0.0002484347,0.1091511,0.002758562,0.8863174,0.0005334198,0.0001704166],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.00522352,0.00001169544,0.987855,0.004331792,0.0002240917,0.001044059,0.0000384484,0.00008942839,0.001181924],"genre_scores_gemma":[0.777118,0.000002612698,0.221769,0.0003614746,0.0001125208,0.0003189447,0.000005117456,0.00006985026,0.0002424776],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.7718945,"threshold_uncertainty_score":0.9868323,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.03365659819015417,"gpt":0.2701859446325642,"spread":0.23652934644241,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001565826,0.0001903946,0.0003927096,0.0001604759,0.0002597925,0.00007118017,0.0002107766,0.000105337,0.0001147635],"category_scores_gemma":[0.0003824089,0.0001868283,0.0001103954,0.0006764465,0.00004742524,0.00009165354,0.0000495703,0.0001278619,0.0006997426],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00006229452,"about_ca_system_score_gemma":0.00002730815,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002239866,"about_ca_topic_score_gemma":0.00000184067,"domain_scores_codex":[0.9986268,0.000003651241,0.0005283094,0.0004024933,0.0001044732,0.0003342813],"domain_scores_gemma":[0.9986871,0.0005213889,0.0003378251,0.0002506231,0.00008822297,0.0001148681],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00005058982,0.001174395,0.0001382452,0.0002188198,0.000156839,7.022596e-7,0.0007870422,0.01344873,0.000268971,0.9757069,0.00436691,0.003681835],"study_design_scores_gemma":[0.000702515,0.000122376,0.0008200674,0.00002662533,0.00003614223,0.000002870518,0.0000712711,0.8874433,0.00001995091,0.1086352,0.001824498,0.0002952026],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.001029312,0.0000241305,0.996554,0.0005348203,0.000199315,0.000609139,0.0006676513,0.000106501,0.0002751798],"genre_scores_gemma":[0.8358121,0.00000496364,0.1616652,0.0001172666,0.0002333082,0.0009705672,0.0004387322,0.0000839343,0.0006738979],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8739945,"threshold_uncertainty_score":0.8994009,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.02341037913605868,"gpt":0.2755881841118188,"spread":0.2521778049757601,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006251584,0.0001626778,0.0004891741,0.00005455187,0.0001354771,0.0001518097,0.001371054,0.00005328367,0.00002472758],"category_scores_gemma":[0.0002827191,0.0001302513,0.00009517128,0.0002962541,0.00007808462,0.0006720173,0.0004120462,0.00006753061,0.0000256769],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001000265,"about_ca_system_score_gemma":0.0000222399,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00000902308,"about_ca_topic_score_gemma":6.787532e-7,"domain_scores_codex":[0.9985691,0.00004141901,0.0004830789,0.0003668132,0.000252357,0.0002872418],"domain_scores_gemma":[0.9979394,0.0002487708,0.0003111408,0.001273143,0.0001096204,0.0001179143],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00002097738,0.0007837705,0.0001146534,0.0004559031,0.0002745525,0.000006522702,0.002801899,0.0004413169,0.004363935,0.1285718,0.001633508,0.8605312],"study_design_scores_gemma":[0.0001466516,0.0002836928,0.000009859248,0.00003676042,0.00004135412,0.00001104139,0.00007071583,0.9858903,0.0005277932,0.006391881,0.006416814,0.0001730912],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0007637664,0.00002795705,0.9983262,0.0001636336,0.00006796771,0.000146962,0.00004929608,0.00009786325,0.0003563237],"genre_scores_gemma":[0.02254077,0.0000035322,0.9768814,0.0000381108,0.0001446027,0.000007839761,0.00004944742,0.0000221114,0.0003121594],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.985449,"threshold_uncertainty_score":0.5311494,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.0213923088754661,"gpt":0.2927324669723336,"spread":0.2713401580968675,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0001745989,0.0003498063,0.0009247419,0.00008539583,0.00005457287,0.000106797,0.0002613694,0.0001133037,0.00007002184],"category_scores_gemma":[0.00007821028,0.0003078766,0.0002088936,0.0003374619,0.00008709614,0.00003504567,0.0004226013,0.0008337849,0.000007029168],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002024805,"about_ca_system_score_gemma":0.00006142903,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0007060202,"about_ca_topic_score_gemma":0.000007713314,"domain_scores_codex":[0.9983268,0.00006404851,0.0006543194,0.0004431605,0.0002271697,0.0002844728],"domain_scores_gemma":[0.9987929,0.0001886957,0.0004053551,0.0004115721,0.00007299193,0.0001284658],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"bench_or_experimental","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.000306319,0.01517179,0.1015738,0.01345492,0.009037887,0.0002096725,0.03262142,0.008740379,0.5059516,0.1881981,0.01028093,0.1144532],"study_design_scores_gemma":[0.001190234,0.0002951738,0.001189287,0.002490663,0.0008828646,0.000005231304,0.0006863135,0.2919626,0.006953938,0.6926094,0.000267683,0.001466687],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.7362958,0.0008576469,0.2606121,0.001282148,0.00006370778,0.0003065453,0.00009447367,0.00004940624,0.0004381175],"genre_scores_gemma":[0.9595664,0.00001246974,0.04007858,0.00005453369,0.00009116116,0.00001786291,0.00008612518,0.00003568147,0.00005713932],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.5044113,"threshold_uncertainty_score":0.9999374,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.05816146696286391,"gpt":0.4075510216186753,"spread":0.3493895546558114,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0009239993,0.0008239575,0.002127127,0.0004919485,0.0001478125,0.000288498,0.0006416577,0.0005605984,0.00009750752],"category_scores_gemma":[0.001064679,0.0008610677,0.001238409,0.001384212,0.00008576261,0.0001441842,0.0006062968,0.0008359367,0.00001635175],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0004315338,"about_ca_system_score_gemma":0.00008362462,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0000023335,"about_ca_topic_score_gemma":8.084502e-7,"domain_scores_codex":[0.9961578,0.0002332131,0.001588336,0.0007927381,0.0005723538,0.0006555685],"domain_scores_gemma":[0.9938786,0.003883125,0.0005353282,0.001077946,0.000348527,0.0002764463],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00002853394,0.0005376393,0.00002736198,0.008019061,0.005249874,0.00002753358,0.002718126,0.9503353,0.006760743,0.009031182,0.0001894107,0.01707526],"study_design_scores_gemma":[0.0002332399,0.00004538403,0.00007076566,0.000402701,0.001183621,0.00002291301,0.000365613,0.7760859,0.0008297712,0.2193813,0.0005353615,0.0008435424],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.008257213,0.0007502424,0.9874868,0.0001311831,0.0008089764,0.001097973,0.0001280959,0.0008207394,0.0005187105],"genre_scores_gemma":[0.01310285,0.00004473571,0.9853745,0.0001169191,0.0002573964,0.000575433,0.0002590132,0.0002383063,0.00003081961],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.2103501,"threshold_uncertainty_score":0.999384,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.09374138366752967,"gpt":0.4308030821681141,"spread":0.3370616985005845,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.001509761,0.0005216376,0.001068208,0.0003215761,0.0003272755,0.0001598295,0.0008053163,0.0002983581,0.0003397621],"category_scores_gemma":[0.004684435,0.0004497292,0.0003991129,0.001472345,0.00009965472,0.0002370237,0.0001850458,0.0003484306,0.0004099784],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00009944673,"about_ca_system_score_gemma":0.00007926202,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0000336389,"about_ca_topic_score_gemma":0.000004667038,"domain_scores_codex":[0.996107,0.0003733753,0.001109438,0.0007135247,0.0007700592,0.0009265313],"domain_scores_gemma":[0.9912498,0.006312457,0.0004369672,0.001271177,0.0002517227,0.0004778737],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0001358569,0.002983046,0.0001198511,0.001551391,0.0004197057,0.00002713126,0.001758491,0.0005412118,0.01476996,0.6696264,0.007145087,0.3009219],"study_design_scores_gemma":[0.0007697306,0.0002946239,0.0003351422,0.00006540909,0.0001893254,0.00001082083,0.0003499849,0.1986174,0.001590696,0.7948883,0.002358186,0.0005304695],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.01720493,0.00001025204,0.9783549,0.0006882412,0.0005113792,0.001324984,0.0001322609,0.001343642,0.0004293556],"genre_scores_gemma":[0.03896573,0.000005978124,0.9583637,0.0001754029,0.0003054114,0.0005775664,0.00008272252,0.0002381029,0.001285454],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.3003914,"threshold_uncertainty_score":0.9997954,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.01689903505423791,"gpt":0.2479855641814825,"spread":0.2310865291272446,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002088114,0.0003193189,0.0003790591,0.00006285841,0.0001404549,0.0001553812,0.0003288825,0.0001833267,0.0000483298],"category_scores_gemma":[0.00009275824,0.0002130464,0.0001606362,0.0000783154,0.0000918365,0.00002764143,0.0002177488,0.0002596428,0.00003371762],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00006656798,"about_ca_system_score_gemma":0.0000384111,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000003248643,"about_ca_topic_score_gemma":0.000005917001,"domain_scores_codex":[0.9987661,0.000012962,0.0004190365,0.0002704543,0.0002408747,0.0002906159],"domain_scores_gemma":[0.9984503,0.0008545398,0.00006597307,0.0004151399,0.0001365014,0.00007749166],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00002171409,0.000255264,0.00009140207,0.003455864,0.00066268,0.000003281944,0.0008231055,0.9038226,0.0009245319,0.08469004,0.001586229,0.003663276],"study_design_scores_gemma":[0.0002107312,0.00001942596,0.00005570443,0.0001087052,0.00009762472,0.00000147393,0.00001935366,0.9618313,0.00008979386,0.03550319,0.001770598,0.0002921276],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02484298,0.0002066706,0.9725096,0.0007024256,0.000448859,0.0006759856,0.0001205764,0.0002110526,0.0002818231],"genre_scores_gemma":[0.885335,0.00006718732,0.1133302,0.0001463492,0.0002509318,0.0003472214,0.0002707912,0.0001167839,0.0001355785],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.860492,"threshold_uncertainty_score":0.8687781,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.01673602398436708,"gpt":0.2588486463489453,"spread":0.2421126223645783,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002443972,0.0001110924,0.000237863,0.0001367428,0.00004960972,0.0000509881,0.0005093714,0.00005855871,0.000134826],"category_scores_gemma":[0.0004346297,0.00009440345,0.00006372701,0.0007032973,0.00003677572,0.0003637489,0.0001129969,0.0001088162,0.00005637513],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0000226885,"about_ca_system_score_gemma":0.00002749387,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000005174393,"about_ca_topic_score_gemma":4.776314e-7,"domain_scores_codex":[0.9989116,0.00005627747,0.0004284028,0.0001922244,0.0002331025,0.0001784329],"domain_scores_gemma":[0.9984075,0.0008876587,0.0002235005,0.0003547192,0.00006436145,0.00006219158],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00002895183,0.002532678,0.001709094,0.0004198938,0.00005063843,0.00005084525,0.01325708,0.004160499,0.001169374,0.9120293,0.0003622317,0.06422942],"study_design_scores_gemma":[0.0004824467,0.0001072431,0.0008474367,0.0001534004,0.000007556363,0.0000165263,0.0001449389,0.651859,0.002255576,0.3432856,0.000603865,0.000236346],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02312528,0.00002439599,0.9733028,0.000153134,0.00008530551,0.0001931283,0.00000518656,0.00006419901,0.00304656],"genre_scores_gemma":[0.8043351,0.00001195597,0.1953019,0.00003156434,0.00002465422,0.00002754734,0.000004185199,0.000008246396,0.0002548026],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.7812099,"threshold_uncertainty_score":0.3849661,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.08910634030375586,"gpt":0.4011625593434389,"spread":0.3120562190396831,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.001388021,0.001116789,0.002546557,0.0002803333,0.0003591295,0.0003872399,0.0006207681,0.0009661979,0.000598379],"category_scores_gemma":[0.008119156,0.001035776,0.0007431413,0.0008137366,0.0002098275,0.0001873952,0.001192533,0.001372188,0.00002464407],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002992166,"about_ca_system_score_gemma":0.000321678,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001594729,"about_ca_topic_score_gemma":0.000005505952,"domain_scores_codex":[0.9939844,0.0009532673,0.001956486,0.001439564,0.0006884523,0.0009778576],"domain_scores_gemma":[0.98897,0.007212899,0.001150879,0.001430978,0.0006789742,0.000556259],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0005624721,0.01705256,0.0002967037,0.0257425,0.006781536,0.00007255217,0.009770363,0.001106484,0.01581119,0.1643052,0.008009878,0.7504886],"study_design_scores_gemma":[0.000649034,0.0001877196,0.00007380949,0.0004136125,0.001132116,0.00005709566,0.0003502082,0.2019061,0.004325198,0.7883109,0.001450565,0.001143652],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.005091695,0.0006123462,0.9870671,0.0004884935,0.00361079,0.002236548,0.00008389504,0.0005232149,0.0002859272],"genre_scores_gemma":[0.008829812,0.0001376194,0.9878337,0.0002074476,0.0003651082,0.001228861,0.0002395078,0.000329877,0.0008280281],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.7493449,"threshold_uncertainty_score":0.9992093,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.04219432222678553,"gpt":0.2998480901497759,"spread":0.2576537679229903,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00009127768,0.0001004376,0.0001378948,0.00005300597,0.0001347183,0.000032778,0.0001174042,0.00003045284,0.0005959105],"category_scores_gemma":[0.00003611527,0.00007224953,0.00008077439,0.0003503429,0.00002098131,0.00005060712,0.00004721124,0.0000931437,0.000681363],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001980429,"about_ca_system_score_gemma":0.00002236327,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001103599,"about_ca_topic_score_gemma":1.672848e-7,"domain_scores_codex":[0.9992387,0.00001853776,0.0002396784,0.0001426321,0.0001510649,0.0002093413],"domain_scores_gemma":[0.9993108,0.0003922904,0.00005327152,0.0001616295,0.00002189656,0.00006010419],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00004777476,0.0005338509,0.00008695255,0.00003620281,0.00006744316,6.123637e-7,0.0008678726,0.7420108,0.0006568531,0.1973885,0.04090116,0.01740194],"study_design_scores_gemma":[0.0001732251,0.00002527481,0.0001552574,0.00001629006,0.00001991175,2.87059e-7,0.00006836824,0.9807464,0.00006169428,0.01767364,0.0009719155,0.00008773919],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01704315,0.000006080613,0.9795788,0.002082321,0.0001482286,0.0006330379,0.00003151503,0.00006906428,0.0004077922],"genre_scores_gemma":[0.9931938,5.406716e-7,0.004053665,0.00006169348,0.0003146512,0.0004123242,0.00007628946,0.00001981639,0.001867188],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9761507,"threshold_uncertainty_score":0.8757769,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.1631738410868106,"gpt":0.367213059099361,"spread":0.2040392180125504,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaresearch","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.001441157,0.0003228381,0.0007234429,0.0001554076,0.0001412009,0.0003597276,0.0007293596,0.0002755266,0.00009944438],"category_scores_gemma":[0.01156081,0.0002436622,0.0001484118,0.0004016724,0.0000661636,0.00006446117,0.0004581792,0.000266134,0.0008226351],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00009032946,"about_ca_system_score_gemma":0.0001113266,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000005700261,"about_ca_topic_score_gemma":5.409846e-7,"domain_scores_codex":[0.9971286,0.00004568522,0.0009587532,0.0007960928,0.0008092237,0.0002616124],"domain_scores_gemma":[0.9956769,0.002631842,0.0003719765,0.0008077893,0.0002390729,0.0002723609],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00004745567,0.0001722609,0.000007027791,0.0007219061,0.00005213721,0.000002260335,0.001480044,0.9194306,0.0001448378,0.03900744,0.03256864,0.006365396],"study_design_scores_gemma":[0.00009650889,0.00006732996,0.00003632084,0.0001177169,0.00004855284,0.000002938076,0.00003973814,0.7497486,0.00002181816,0.2469636,0.002626336,0.0002305086],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.001321128,0.00006257222,0.9906232,0.005723063,0.0002167478,0.001479645,0.0001321564,0.0001614957,0.0002800431],"genre_scores_gemma":[0.2399015,0.000006248657,0.7579451,0.0003195653,0.0001819518,0.0004740504,0.00009024139,0.00007284977,0.001008571],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.2385803,"threshold_uncertainty_score":0.9999554,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null}]}