{"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":"602093b27092","filters":{"venue":"Numerische Mathematik"}},"results":[{"id":"W1994111439","doi":"10.1007/s00211-003-0511-8","title":"A penalty method for American options with jump diffusion processes","year":2004,"lang":"en","type":"article","venue":"Numerische Mathematik","topic":"Stochastic processes and financial applications","field":"Economics, Econometrics and Finance","cited_by":204,"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":"Mathematics; Discretization; Jump diffusion; Convergence (economics); Applied mathematics; Jump; Numerical analysis; Partial differential equation; Jump process; Constraint (computer-aided design); Penalty method; Mathematical optimization; Mathematical analysis","retraction":null,"screen_n_in":null,"score":{"opus":0.02501519338906372,"gpt":0.2657437974798527,"spread":0.240728604090789,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002063484,0.0001747714,0.0004052531,0.0001125299,0.0002399093,0.00006231438,0.0002334702,0.00004847001,0.00004209584],"category_scores_gemma":[0.0002109807,0.0001575785,0.00007769794,0.0006210657,0.00007799095,0.00013835,0.00003523202,0.00009292808,0.000198659],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004892104,"about_ca_system_score_gemma":0.00007801403,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0002228801,"about_ca_topic_score_gemma":0.00005515672,"domain_scores_codex":[0.998877,0.000001795507,0.0003974115,0.0004076765,0.0000460873,0.0002700278],"domain_scores_gemma":[0.9989933,0.00009249841,0.0004223648,0.0003031261,0.0001057543,0.00008294678],"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.00002569617,0.0002506288,0.0001179234,0.0001823265,0.00002865771,4.078206e-7,0.0008067171,0.0001149785,0.00006990853,0.9968274,0.00008147456,0.001493861],"study_design_scores_gemma":[0.0009912592,0.0002942533,0.0009553519,0.0000683254,0.00002871978,0.00002481153,0.0004247824,0.00113513,0.0004303435,0.9769784,0.01824844,0.0004202426],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.006098933,0.000484384,0.9876966,0.001253789,0.00003426374,0.000581417,0.0001857387,0.00008867404,0.003576201],"genre_scores_gemma":[0.2849045,0.0000576678,0.7129723,0.000239849,0.0001118083,0.001344023,0.00003041938,0.00005261474,0.0002867304],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.2788056,"threshold_uncertainty_score":0.6425863,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1994841670","doi":"10.1007/s00211-005-0604-7","title":"Interior penalty method for the indefinite time-harmonic Maxwell equations","year":2005,"lang":"en","type":"article","venue":"Numerische Mathematik","topic":"Advanced Numerical Methods in Computational Mathematics","field":"Engineering","cited_by":163,"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":"Mathematics; Discretization; Degree of a polynomial; Norm (philosophy); Discontinuous Galerkin method; A priori and a posteriori; Numerical analysis; Maxwell's equations; Biharmonic equation; Applied mathematics; Galerkin method; Discretization error; Mathematical analysis; Duality (order theory); Polynomial; Finite element method; Boundary value problem; Pure mathematics","retraction":null,"screen_n_in":null,"score":{"opus":0.03581440229569535,"gpt":0.3297836893753553,"spread":0.29396928707966,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00081427,0.0002903651,0.0003724807,0.00008697982,0.0001861197,0.00007365851,0.0004713587,0.00009502914,0.000451119],"category_scores_gemma":[0.0008370981,0.000217696,0.0001956059,0.0003072856,0.0000560692,0.0001939332,0.00008115526,0.0002972459,0.0005775584],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00009377603,"about_ca_system_score_gemma":0.00002360673,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":5.480881e-7,"about_ca_topic_score_gemma":5.858274e-7,"domain_scores_codex":[0.9984539,0.00007622369,0.0005868563,0.0002419691,0.0002809167,0.0003600997],"domain_scores_gemma":[0.9933877,0.005795009,0.0001444483,0.0004831645,0.0001007627,0.0000889022],"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.00005126006,0.0002201459,0.00000568959,0.000822674,0.0006650955,0.000002169598,0.004352463,0.4016145,0.01428412,0.06744889,0.01532197,0.495211],"study_design_scores_gemma":[0.0002599331,0.00002845816,0.000007489237,0.00004393109,0.00007121395,0.00001761876,0.0001029625,0.8970064,0.004774313,0.06366357,0.03375569,0.0002684513],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0003262542,0.0005117459,0.993152,0.0008019439,0.0002015011,0.0006709413,0.00003841958,0.0004528993,0.003844339],"genre_scores_gemma":[0.02339059,0.00002530314,0.9746957,0.0002781986,0.000258546,0.0004533364,0.00001710615,0.0001138684,0.0007673948],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.4953918,"threshold_uncertainty_score":0.8877387,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2159823040","doi":"10.1007/s00211-008-0152-z","title":"A numerical scheme for the impulse control formulation for pricing variable annuities with a guaranteed minimum withdrawal benefit (GMWB)","year":2008,"lang":"en","type":"article","venue":"Numerische Mathematik","topic":"Stochastic processes and financial applications","field":"Economics, Econometrics and Finance","cited_by":114,"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":"Hamilton–Jacobi–Bellman equation; Mathematics; Impulse control; Variational inequality; Impulse (physics); Variable (mathematics); Viscosity solution; Mathematical optimization; Numerical analysis; Scheme (mathematics); Stochastic control; Convergence (economics); Optimal control; Control theory (sociology); Applied mathematics; Control (management); Computer science; Economics; Mathematical analysis","retraction":null,"screen_n_in":null,"score":{"opus":0.02175010386436422,"gpt":0.2194519705894879,"spread":0.1977018667251237,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003116273,0.0002238445,0.0005030392,0.00007981328,0.0006369205,0.00006606692,0.0002754326,0.0000999794,0.00003465016],"category_scores_gemma":[0.0002289293,0.0001728807,0.0001384477,0.0003002487,0.00005933347,0.0002017263,0.00002053691,0.0001042285,0.00003285123],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004563991,"about_ca_system_score_gemma":0.00005882633,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000096685,"about_ca_topic_score_gemma":0.000004458398,"domain_scores_codex":[0.9985578,0.000001739399,0.0005970752,0.0003839461,0.00006561575,0.0003937971],"domain_scores_gemma":[0.9985037,0.0004628458,0.0004762867,0.000355216,0.0001455392,0.00005640514],"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.0002516796,0.0001264045,0.0005147281,0.0001370912,0.0001122013,2.589224e-7,0.001531717,0.0003732217,0.00009294949,0.9962976,0.0002897551,0.0002723944],"study_design_scores_gemma":[0.005154817,0.0006452774,0.002157273,0.00008955838,0.00009463357,0.00007623837,0.0005409958,0.449409,0.0001836754,0.5149662,0.02592848,0.0007538144],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.009142903,0.0007187162,0.9860615,0.0005569017,0.00007754021,0.001752388,0.0003400732,0.00006581155,0.001284156],"genre_scores_gemma":[0.9011027,0.00001013113,0.09546134,0.0003124294,0.0002085384,0.002455957,0.00002314248,0.0000547421,0.0003710178],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8919598,"threshold_uncertainty_score":0.704987,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2060499935","doi":"10.1007/s00211-002-0442-9","title":"Uniform exponential long time decay for the space semi-discretization of a locally damped wave equation via an artificial numerical viscosity","year":2003,"lang":"en","type":"article","venue":"Numerische Mathematik","topic":"Stability and Controllability of Differential Equations","field":"Engineering","cited_by":93,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"York University","funders":"","keywords":"Discretization; Mathematics; Mathematical analysis; Wave equation; Damped wave; Exponential decay; Numerical analysis; Viscosity solution; Exponential function; Viscosity; Uniform convergence; Physics","retraction":null,"screen_n_in":null,"score":{"opus":0.02439456513337823,"gpt":0.2352452344048618,"spread":0.2108506692714836,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006324472,0.0002250561,0.0003518075,0.00005997816,0.0002042798,0.00007155449,0.0001771574,0.0001404798,0.0004149365],"category_scores_gemma":[0.0002998744,0.0001863698,0.0001741639,0.0002444655,0.00009041188,0.0002738555,0.00001858714,0.0001388459,0.00003734537],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00006109878,"about_ca_system_score_gemma":0.00005077641,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002041419,"about_ca_topic_score_gemma":0.00004347027,"domain_scores_codex":[0.9984588,0.0001220062,0.0005600484,0.0002472661,0.0003324014,0.0002794733],"domain_scores_gemma":[0.9986644,0.0004654974,0.0001418594,0.0004762716,0.0001635346,0.00008838822],"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.0009118607,0.002714748,0.0005297333,0.001444624,0.001104132,0.000002233147,0.02302208,0.2049241,0.4952321,0.2194323,0.0004147396,0.0502674],"study_design_scores_gemma":[0.000506517,0.0001173469,0.0003191847,0.00002516636,0.0001468671,0.000003379287,0.0004110989,0.9274285,0.05958674,0.01110909,0.0001045378,0.0002415004],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1506354,0.00004425176,0.8473594,0.0001264454,0.0001808405,0.0008446453,0.0000245199,0.0001315324,0.000652894],"genre_scores_gemma":[0.9931834,0.000002766004,0.006427302,0.00001129763,0.0000847497,0.0001310297,0.00007466834,0.00004010709,0.00004465207],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.842548,"threshold_uncertainty_score":0.7599939,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2039747090","doi":"10.1007/pl00005475","title":"A minimal stabilisation procedure for mixed finite element methods","year":2001,"lang":"en","type":"article","venue":"Numerische Mathematik","topic":"Advanced Numerical Methods in Computational Mathematics","field":"Engineering","cited_by":89,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Université Laval","funders":"","keywords":"Finite element method; Mathematics; Discretization; Numerical analysis; Stability (learning theory); Mathematical optimization; Section (typography); Applied mathematics; Mathematical analysis; Computer science","retraction":null,"screen_n_in":null,"score":{"opus":0.04539489669600057,"gpt":0.3577109925673333,"spread":0.3123160958713327,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00076428,0.0002934115,0.0004077246,0.0001009447,0.00009335625,0.00004388503,0.0002299449,0.0001066539,0.000167703],"category_scores_gemma":[0.001385478,0.0002759373,0.0001384462,0.0003462013,0.00004138166,0.000186529,0.00004069743,0.0001643733,0.00004718201],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00009025099,"about_ca_system_score_gemma":0.00002301806,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":3.46916e-7,"about_ca_topic_score_gemma":5.568744e-7,"domain_scores_codex":[0.9983792,0.00008673458,0.0006131403,0.0002841261,0.0002606694,0.0003760772],"domain_scores_gemma":[0.9971712,0.00213779,0.0001384782,0.0003204273,0.00012591,0.000106258],"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.0001841067,0.0006921826,0.0001886197,0.004699363,0.0005251361,0.000008983899,0.007169233,0.3791889,0.02922255,0.04567587,0.007757042,0.524688],"study_design_scores_gemma":[0.0004913665,0.00009983353,0.00005796268,0.00007271276,0.00005008763,0.0000231793,0.0004745702,0.7665977,0.01183855,0.189194,0.03068301,0.0004170048],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.008493816,0.0002056038,0.9871023,0.0001366978,0.0003230632,0.000854931,0.00001904351,0.000532336,0.002332259],"genre_scores_gemma":[0.0373687,0.00002259058,0.9613999,0.0000614503,0.0001522431,0.0007010215,0.00001891863,0.0001036608,0.0001715931],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.524271,"threshold_uncertainty_score":0.9999693,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2088291682","doi":"10.1007/s00211-007-0123-9","title":"Energy-conserved splitting FDTD methods for Maxwell’s equations","year":2007,"lang":"en","type":"article","venue":"Numerische Mathematik","topic":"Electromagnetic Simulation and Numerical Methods","field":"Engineering","cited_by":87,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"York University","funders":"","keywords":"Mathematics; Divergence (linguistics); Dissipative system; Maxwell's equations; Convergence (economics); Numerical analysis; Energy (signal processing); Finite-difference time-domain method; Applied mathematics; Mathematical analysis; Conserved quantity; Space (punctuation); Scattering-matrix method; Order (exchange); Mathematical physics; Physics; Quantum mechanics; Computer science","retraction":null,"screen_n_in":null,"score":{"opus":0.03127591187150139,"gpt":0.3548937820485665,"spread":0.3236178701770651,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001738633,0.0002227746,0.0003238819,0.0001281614,0.0001180562,0.00004352341,0.0001847877,0.0001341918,0.0002938835],"category_scores_gemma":[0.0005628857,0.000217271,0.0001605161,0.000374016,0.00003127743,0.00008774349,0.00002276804,0.0001405779,0.00002165347],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004521757,"about_ca_system_score_gemma":0.00001487367,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000005883139,"about_ca_topic_score_gemma":0.000002255189,"domain_scores_codex":[0.9985388,0.00009257227,0.0005519245,0.0002216616,0.0001328782,0.0004621882],"domain_scores_gemma":[0.9967302,0.002642863,0.0000847773,0.000321628,0.00007561511,0.0001448971],"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.00002633063,0.00007832718,0.00003016317,0.0002078473,0.0001176716,0.000001679922,0.000681438,0.00102865,0.1655743,0.05060772,0.001501692,0.7801442],"study_design_scores_gemma":[0.000706864,0.0001163277,0.0001124808,0.00004644069,0.00007758574,0.00001268505,0.0001984365,0.6588805,0.1844606,0.04733546,0.1074923,0.0005602805],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.002459069,0.0006976719,0.9746413,0.0001178342,0.0002811691,0.0002377278,0.000003338302,0.000512423,0.02104945],"genre_scores_gemma":[0.1202799,0.00001268489,0.8781741,0.0001824475,0.0001352405,0.00008452828,0.0000196382,0.00007692135,0.001034571],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.7795839,"threshold_uncertainty_score":0.8860053,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2963183022","doi":"10.1007/s00211-019-01051-9","title":"Correcting for unknown errors in sparse high-dimensional function approximation","year":2019,"lang":"en","type":"article","venue":"Numerische Mathematik","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":76,"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; Simon Fraser University","funders":"","keywords":"Pointwise; Lasso (programming language); Mathematics; A priori and a posteriori; Bounded function; Applied mathematics; Mathematical optimization; Focus (optics); Function approximation; Algorithm; Function (biology); Approximation algorithm; Computer science; Artificial intelligence; Mathematical analysis","retraction":null,"screen_n_in":null,"score":{"opus":0.01301465891576105,"gpt":0.2198687291655071,"spread":0.2068540702497461,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000181662,0.0001533793,0.0002191548,0.0001183404,0.00003262825,0.00002420535,0.00007884133,0.00009650573,0.00008850787],"category_scores_gemma":[0.00003135416,0.0001500348,0.00005588953,0.0001462532,0.000009474263,0.0001504947,0.00002057029,0.0001373341,0.0001024418],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004458399,"about_ca_system_score_gemma":0.000008723,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001496267,"about_ca_topic_score_gemma":0.000006812937,"domain_scores_codex":[0.9992242,0.00001647505,0.0002489523,0.0001799067,0.0001288146,0.0002016404],"domain_scores_gemma":[0.9995707,0.00007973791,0.00006223037,0.0002177294,0.00004217757,0.00002747179],"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.0003802155,0.0005094023,0.002622907,0.001344034,0.0003181088,0.00001184966,0.00351158,0.375364,0.4270121,0.0336707,0.03019843,0.1250567],"study_design_scores_gemma":[0.0007814583,0.0001025217,0.0008425858,0.0003524474,0.00002862527,0.00002731701,0.0002021446,0.8683017,0.1136824,0.01299898,0.002237292,0.0004424854],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9005697,0.00007259782,0.09495255,0.00002440291,0.0006606484,0.0005237445,0.000002612511,0.0005803945,0.002613366],"genre_scores_gemma":[0.9746137,0.000001556243,0.02494839,0.00003180009,0.00005857724,0.00006809779,0.00002207991,0.00004531175,0.0002104968],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.4929377,"threshold_uncertainty_score":0.6118243,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2035741281","doi":"10.1007/s002110100314","title":"Scaled total least squares fundamentals","year":2002,"lang":"de","type":"article","venue":"Numerische Mathematik","topic":"Statistical and numerical algorithms","field":"Mathematics","cited_by":73,"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":"Overdetermined system; Mathematics; Singular value decomposition; Singular value; Uniqueness; Total least squares; Least-squares function approximation; Rank (graph theory); Orthant; Limit (mathematics); Matrix (chemical analysis); Hermitian matrix; Applied mathematics; Eigenvalues and eigenvectors; Combinatorics; Algorithm; Pure mathematics; Mathematical analysis; Statistics; Physics; Quantum mechanics; Estimator","retraction":null,"screen_n_in":null,"score":{"opus":0.05522751584311948,"gpt":0.2830154772127262,"spread":0.2277879613696067,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.000478186,0.001025807,0.00160284,0.0001771684,0.0004771198,0.0004121537,0.0006973362,0.0004655877,0.06368644],"category_scores_gemma":[0.001052946,0.000875329,0.0006296914,0.0006972479,0.0005270213,0.0003078491,0.0003868571,0.0008519801,0.04393409],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001512147,"about_ca_system_score_gemma":0.00002908987,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00003538734,"about_ca_topic_score_gemma":0.00000149657,"domain_scores_codex":[0.9942321,0.0003087236,0.001646445,0.001040361,0.001364502,0.00140792],"domain_scores_gemma":[0.9957979,0.001484436,0.000609778,0.001167039,0.0001727447,0.0007680925],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"not_applicable","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0002719456,0.01373874,0.0004285399,0.005713742,0.003023561,0.0007655206,0.01652205,0.00001776468,0.00283089,0.1433238,0.6086329,0.2047305],"study_design_scores_gemma":[0.01253045,0.003955131,0.001203587,0.004192424,0.004958935,0.001183311,0.008184361,0.2235522,0.01023263,0.4794955,0.2404703,0.01004116],"study_design_candidate":"not_applicable","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1812813,0.07023075,0.4081635,0.01754726,0.01494196,0.009425341,0.005358441,0.004195068,0.2888564],"genre_scores_gemma":[0.6614749,0.001210794,0.2341367,0.001146966,0.00440217,0.0005002616,0.0001296157,0.000772464,0.09622612],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.4801936,"threshold_uncertainty_score":0.9993697,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2013286893","doi":"10.1007/s00211-007-0112-z","title":"Bivariate Lagrange interpolation at the Padua points: the ideal theory approach","year":2007,"lang":"en","type":"article","venue":"Numerische Mathematik","topic":"Advanced Numerical Analysis Techniques","field":"Engineering","cited_by":59,"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":"Mathematics; Lagrange polynomial; Interpolation (computer graphics); Trigonometric interpolation; Birkhoff interpolation; Bivariate analysis; Ideal (ethics); Polynomial interpolation; Applied mathematics; Spline interpolation; Nearest-neighbor interpolation; Linear interpolation; Inverse quadratic interpolation; Convergence (economics); Bilinear interpolation; Combinatorics; Algebra over a field; Mathematical analysis; Pure mathematics; Polynomial; Statistics; Law","retraction":null,"screen_n_in":null,"score":{"opus":0.01052672511055293,"gpt":0.243051529999483,"spread":0.23252480488893,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001550309,0.0002508191,0.0002573183,0.00007103769,0.0002176343,0.00004963647,0.0004625162,0.00009755207,0.0002812481],"category_scores_gemma":[0.0001173375,0.0001313962,0.0001715489,0.0004555557,0.0001310106,0.0001588433,0.0001326211,0.0003506805,0.000217096],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0000800682,"about_ca_system_score_gemma":0.000003858383,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001430938,"about_ca_topic_score_gemma":0.00001144056,"domain_scores_codex":[0.9985887,0.0001015006,0.0004296357,0.000218456,0.000303083,0.0003585574],"domain_scores_gemma":[0.9986484,0.0004830943,0.0001190176,0.0006490107,0.00003936132,0.0000611042],"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.000507938,0.0007717046,0.00135573,0.0009306823,0.002580604,0.00003747807,0.03818373,0.005265332,0.1710701,0.4034229,0.07103594,0.3048378],"study_design_scores_gemma":[0.001147922,0.0001598524,0.003881031,0.0002131552,0.0006915577,0.0002425242,0.007871365,0.298088,0.06585,0.4363574,0.183179,0.002318161],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.008732024,0.000677988,0.9460403,0.0002860386,0.00007684349,0.0003374431,0.000005906618,0.0006902199,0.04315324],"genre_scores_gemma":[0.9480831,0.00006141884,0.05035609,0.0003398656,0.0001597474,0.0001018108,0.00001929284,0.00009110655,0.0007875871],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9393511,"threshold_uncertainty_score":0.5358182,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1970535101","doi":"10.1007/s00211-013-0569-x","title":"A spatially continuous max-flow and min-cut framework for binary labeling problems","year":2013,"lang":"en","type":"article","venue":"Numerische Mathematik","topic":"Digital Image Processing Techniques","field":"Computer Science","cited_by":57,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Western University","funders":"","keywords":"Mathematics; Flow (mathematics); Binary number; A priori and a posteriori; Mathematical optimization; Maximum flow problem; Regular polygon; Convergence (economics); Cut; Minimum cut; Algorithm; Maximum cut; Segmentation; Applied mathematics; Graph; Combinatorics; Computer science; Image segmentation; Artificial intelligence; Geometry","retraction":null,"screen_n_in":null,"score":{"opus":0.0179829033841774,"gpt":0.2563476440346922,"spread":0.2383647406505148,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0003038003,0.0002427442,0.0003300977,0.00009364813,0.0001316019,0.001148379,0.0007773069,0.0001286271,0.00003162278],"category_scores_gemma":[0.0003379943,0.0002097605,0.00006726648,0.0002192341,0.0000815965,0.001341391,0.0003848037,0.0001651807,0.0001169048],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001553737,"about_ca_system_score_gemma":0.00004483583,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0000162701,"about_ca_topic_score_gemma":9.930749e-7,"domain_scores_codex":[0.9985295,0.00002351844,0.000358744,0.0004733328,0.0002299191,0.0003850002],"domain_scores_gemma":[0.9986578,0.0002386355,0.0002140772,0.000566602,0.000208255,0.0001145808],"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.00001903802,0.0008241729,0.0004381091,0.002395671,0.0001584396,0.0000281072,0.009397068,0.00003519977,0.02915076,0.1388606,0.03081409,0.7878787],"study_design_scores_gemma":[0.000295642,0.0002782783,0.0000374109,0.0006847836,0.00001690213,0.00006584323,0.00006356534,0.1504585,0.01417448,0.8295793,0.003804388,0.0005409635],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.007559393,0.0004473084,0.9860867,0.001377967,0.00009241657,0.0008947184,0.000004676623,0.0007829412,0.002753913],"genre_scores_gemma":[0.07314377,0.00001157957,0.9252388,0.0003251361,0.0000434151,0.0004909792,0.000002633894,0.000038407,0.000705229],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.7873378,"threshold_uncertainty_score":0.9998885,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1974572502","doi":"10.1007/s00211-005-0608-3","title":"Finite element methods for optimal control problems governed by integral equations and integro-differential equations","year":2005,"lang":"en","type":"article","venue":"Numerische Mathematik","topic":"Advanced Numerical Methods in Computational Mathematics","field":"Engineering","cited_by":57,"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; Galerkin method; A priori and a posteriori; Finite element method; Integral equation; Estimator; Fredholm integral equation; Applied mathematics; Integro-differential equation; Partial differential equation; Differential equation; Optimal control; Mathematical analysis; Mathematical optimization; First-order partial differential equation","retraction":null,"screen_n_in":null,"score":{"opus":0.0307923658071267,"gpt":0.341065200403088,"spread":0.3102728345959613,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0005347469,0.0003499873,0.0004960895,0.00009268752,0.000143368,0.00009310293,0.0002321365,0.000120445,0.0002002766],"category_scores_gemma":[0.001594653,0.0003191368,0.0001351255,0.000187715,0.00007902856,0.0002625363,0.00005395872,0.0002790247,0.00003113038],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001226925,"about_ca_system_score_gemma":0.00001902426,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000001625635,"about_ca_topic_score_gemma":0.000001556745,"domain_scores_codex":[0.9982137,0.0001196077,0.0007346259,0.0003063774,0.0002403117,0.0003853806],"domain_scores_gemma":[0.9943763,0.004911359,0.0001805764,0.0002712843,0.000118781,0.0001417239],"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.00005088781,0.0004564911,0.000006819651,0.0007635706,0.0005788737,3.722938e-7,0.003174683,0.5743663,0.02604587,0.07435171,0.002776439,0.317428],"study_design_scores_gemma":[0.0008850456,0.00007209078,0.00000270271,0.0000596906,0.00009326873,0.000002639739,0.0001548766,0.9518468,0.003472981,0.03401369,0.009062934,0.0003333136],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0004850446,0.0005401446,0.9965394,0.0003447147,0.0001687402,0.0009883502,0.0001315891,0.0003446557,0.0004573839],"genre_scores_gemma":[0.1371105,0.00001916466,0.8615443,0.00007537135,0.0001228297,0.0007389265,0.00005015984,0.00008427948,0.0002545422],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.3774805,"threshold_uncertainty_score":0.9999261,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2067511295","doi":"10.1007/s00211-007-0106-x","title":"Finite element approximation of spatially extended predator–prey interactions with the Holling type II functional response","year":2007,"lang":"en","type":"article","venue":"Numerische Mathematik","topic":"Mathematical and Theoretical Epidemiology and Ecology Models","field":"Medicine","cited_by":56,"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":"Discretization; Mathematics; Finite element method; A priori and a posteriori; Type (biology); Nonlinear system; Applied mathematics; Functional response; Diffusion; Reaction–diffusion system; Numerical analysis; Space (punctuation); Mathematical analysis; Class (philosophy); Discrete modelling; Discrete system; Predation; Predator; Physics; Algorithm; Computer science","retraction":null,"screen_n_in":null,"score":{"opus":0.03454186282393774,"gpt":0.3000965811200912,"spread":0.2655547182961535,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.002514197,0.0001497879,0.0003591637,0.00007348604,0.0002000754,0.00000538138,0.00008862734,0.0001065013,0.001981432],"category_scores_gemma":[0.001218845,0.00008186772,0.0000883074,0.0001805259,0.0002433002,0.00006828875,0.00005377679,0.0002971072,0.00006154031],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002310131,"about_ca_system_score_gemma":0.00006634997,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000001970809,"about_ca_topic_score_gemma":0.00000658619,"domain_scores_codex":[0.9987178,0.0001340851,0.0004975577,0.0001971465,0.0002139973,0.0002393947],"domain_scores_gemma":[0.9973063,0.001874672,0.000232158,0.0003158644,0.0001804993,0.00009053956],"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.03491986,0.003402622,0.001240795,0.0008614961,0.001297257,0.0000365899,0.007328117,0.002429554,0.02434174,0.9169387,0.002864876,0.004338358],"study_design_scores_gemma":[0.01086886,0.01176749,0.03973858,0.001994976,0.002630417,0.001213915,0.00512888,0.4723895,0.09466327,0.346475,0.01149196,0.001637196],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.4193799,0.00003194915,0.5690778,0.002161616,0.00007313644,0.0003576876,0.000003390695,0.00004007333,0.008874455],"genre_scores_gemma":[0.9847128,0.000005251929,0.01348559,0.0003940544,0.00006542575,0.0000359429,0.00001778191,0.0000153987,0.001267713],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.5704638,"threshold_uncertainty_score":0.9989309,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2009402935","doi":"10.1007/s00211-009-0245-3","title":"Error analysis of variational integrators of unconstrained Lagrangian systems","year":2009,"lang":"de","type":"article","venue":"Numerische Mathematik","topic":"Numerical methods for differential equations","field":"Mathematics","cited_by":47,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Saskatchewan","funders":"","keywords":"Variational integrator; Mathematics; Variational analysis; Integrator; Singularity; Lagrangian; Applied mathematics; Symmetry (geometry); Variational method; Numerical analysis; Error analysis; Variational principle; Order (exchange); Mathematical analysis; Luke's variational principle; Hamilton's principle; Classical mechanics; Equations of motion; Geometry; Computer science; Physics","retraction":null,"screen_n_in":null,"score":{"opus":0.04763449942194269,"gpt":0.3404475544683849,"spread":0.2928130550464422,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.001671841,0.0005872364,0.002578849,0.001163775,0.0001098619,0.00006879056,0.0006698599,0.0004664726,0.001523417],"category_scores_gemma":[0.002449253,0.0005123647,0.00112299,0.003607827,0.0002735041,0.0001806758,0.00006760495,0.0004510517,0.00008442624],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00007909015,"about_ca_system_score_gemma":0.0002272699,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001301448,"about_ca_topic_score_gemma":0.00001127425,"domain_scores_codex":[0.9943216,0.0007470885,0.002716226,0.0005343205,0.001178451,0.0005023513],"domain_scores_gemma":[0.9933542,0.00201743,0.002580828,0.001154321,0.0006450871,0.0002481295],"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.0001520946,0.004213931,0.0007398875,0.00194653,0.01935227,0.000007178157,0.01033748,0.001435299,0.01767885,0.9342669,0.0005429171,0.009326654],"study_design_scores_gemma":[0.003604174,0.001752105,0.008184523,0.002421902,0.07705322,0.00001592271,0.01009006,0.2945144,0.01133386,0.5866296,0.001696447,0.002703788],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.04887076,0.001149742,0.9420393,0.0003496965,0.0009485524,0.001130436,0.001331769,0.0001250072,0.004054786],"genre_scores_gemma":[0.7510349,0.00002607611,0.2480714,0.00002781897,0.0001421953,0.00003077196,0.0002015755,0.00005800067,0.000407278],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.7021641,"threshold_uncertainty_score":0.9997328,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1988452081","doi":"10.1007/s00211-006-0054-x","title":"On the numerical condition of a generalized Hankel eigenvalue problem","year":2006,"lang":"en","type":"article","venue":"Numerische Mathematik","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":44,"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":"Vandermonde matrix; Mathematics; Eigenvalues and eigenvectors; Hankel matrix; Matrix (chemical analysis); Quadrature (astronomy); Combinatorics; Mathematical analysis; Algebra over a field; Applied mathematics; Pure mathematics","retraction":null,"screen_n_in":null,"score":{"opus":0.01118333507087427,"gpt":0.2346430918108054,"spread":0.2234597567399311,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005471105,0.000166357,0.0002434355,0.00005889887,0.0001408717,0.00007689514,0.0007192228,0.0000598833,0.0003344973],"category_scores_gemma":[0.00004197094,0.0001043582,0.0001291057,0.0003290387,0.00006961901,0.0001638101,0.0001025502,0.000134238,0.0002238535],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001468875,"about_ca_system_score_gemma":0.00003079659,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002788997,"about_ca_topic_score_gemma":3.197068e-7,"domain_scores_codex":[0.9986179,0.0001703251,0.000363283,0.0002638093,0.0003568897,0.0002278281],"domain_scores_gemma":[0.9987794,0.0002706999,0.0002365975,0.0006176209,0.00005650737,0.00003914476],"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.000006686248,0.0001543983,0.000004776536,0.00002815262,0.000014257,0.000003201514,0.000381579,0.0002170714,0.002861759,0.9918149,0.003661907,0.0008513676],"study_design_scores_gemma":[0.0004661628,0.0001282623,0.00008435069,0.00006305828,0.0000148419,0.00003455489,0.0000364214,0.05436635,0.05156008,0.8887564,0.0042375,0.0002520504],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.05062711,0.00008543283,0.9201439,0.001602331,0.000132558,0.0004181779,0.00001081842,0.0001696644,0.02681002],"genre_scores_gemma":[0.8987357,0.000002665025,0.0992872,0.0003624171,0.0001030651,0.00009806779,0.000007014223,0.0000196549,0.001384216],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8481086,"threshold_uncertainty_score":0.4255603,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1987744915","doi":"10.1007/s002110100289","title":"Entrywise perturbation theory for diagonally dominant M-matrices with applications","year":2002,"lang":"en","type":"article","venue":"Numerische Mathematik","topic":"Matrix Theory and Algorithms","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":"University of Windsor","funders":"","keywords":"Diagonally dominant matrix; Mathematics; Diagonal; Inverse; Tridiagonal matrix; Combinatorics; Eigenvalues and eigenvectors; Electronic circuit; Pure mathematics; Geometry; Invertible matrix; Physics; Quantum mechanics","retraction":null,"screen_n_in":null,"score":{"opus":0.01238587040981794,"gpt":0.2248017604779382,"spread":0.2124158900681202,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004512468,0.0001770361,0.000199117,0.00007967179,0.0002408281,0.0001604691,0.000694739,0.00005560902,0.0002034112],"category_scores_gemma":[0.00004901712,0.0001241008,0.00008577843,0.0003091859,0.00004993465,0.0004325323,0.00006994681,0.00008433303,0.0002081478],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001748322,"about_ca_system_score_gemma":0.00001690684,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":4.43399e-7,"about_ca_topic_score_gemma":1.889768e-7,"domain_scores_codex":[0.9988663,0.00005634808,0.0002433364,0.0003519234,0.0002266221,0.0002554959],"domain_scores_gemma":[0.9985619,0.0005048265,0.0001847265,0.0005712917,0.00009185176,0.00008536984],"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.00001373284,0.0001896032,0.000004990456,0.00009371161,0.00002979859,0.000001995081,0.002144872,0.0000216714,0.0002654794,0.9511485,0.0008386988,0.04524699],"study_design_scores_gemma":[0.001399615,0.0002905284,0.00002429463,0.00009923949,0.00008552928,0.0001223057,0.0003486731,0.1289234,0.00809803,0.699714,0.1601451,0.0007492441],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0004651075,0.0006789723,0.9874488,0.0007744999,0.00005880741,0.0007318911,0.00001098003,0.0001637877,0.009667157],"genre_scores_gemma":[0.1761782,0.0001470021,0.7934942,0.000616818,0.0004395421,0.002793526,0.00001735134,0.00006625581,0.02624719],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.2514344,"threshold_uncertainty_score":0.5060685,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2016012726","doi":"10.1007/s00211-009-0285-8","title":"A posteriori error estimation for hp-version time-stepping methods for parabolic partial differential equations","year":2010,"lang":"en","type":"article","venue":"Numerische Mathematik","topic":"Advanced Numerical Methods in Computational Mathematics","field":"Engineering","cited_by":43,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"University of British Columbia","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Estimator; Discontinuous Galerkin method; Discretization; Partial differential equation; Time stepping; Galerkin method; A priori and a posteriori; Applied mathematics; Numerical analysis; Error analysis; Parabolic partial differential equation; Series (stratigraphy); Mathematical analysis; Finite element method; Statistics","retraction":null,"screen_n_in":null,"score":{"opus":0.03550431527130006,"gpt":0.3816430805358426,"spread":0.3461387652645426,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.000564656,0.0003299608,0.0005056044,0.0001328243,0.0002344607,0.00008567525,0.0002800295,0.0001912083,0.0001868626],"category_scores_gemma":[0.002043189,0.0003220865,0.0002268449,0.0002128841,0.00005946331,0.0002742195,0.00005658457,0.0002554203,0.00009015573],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004586088,"about_ca_system_score_gemma":0.00002787619,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":5.484818e-7,"about_ca_topic_score_gemma":2.990441e-7,"domain_scores_codex":[0.9983453,0.00007177767,0.0006461655,0.000320014,0.0002073285,0.0004094592],"domain_scores_gemma":[0.9958785,0.003233215,0.0002058186,0.0003889218,0.0001599969,0.0001335387],"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.0001409974,0.0003155854,0.000003581415,0.001902367,0.0003024423,6.953344e-7,0.002392231,0.08431028,0.5437933,0.03652105,0.001429907,0.3288876],"study_design_scores_gemma":[0.0005734673,0.00006459677,0.000009020077,0.0000539384,0.00009392589,0.000007906596,0.0000399925,0.9046657,0.02720416,0.06368774,0.00326199,0.0003375407],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.009242582,0.00004078188,0.9873167,0.0001021327,0.001085094,0.001347864,0.0000784098,0.0005221067,0.0002643877],"genre_scores_gemma":[0.0491406,0.0000016048,0.9493679,0.00002992737,0.0002893849,0.0008153204,0.00008746912,0.0001191791,0.0001485977],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.8203554,"threshold_uncertainty_score":0.9999231,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2126897161","doi":"10.1007/s002110000134","title":"An additive Schwarz preconditioner for p -version boundary element approximation of the hypersingular operator in three dimensions","year":2000,"lang":"en","type":"article","venue":"Numerische Mathematik","topic":"Numerical methods in engineering","field":"Engineering","cited_by":39,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Manitoba; Research Manitoba","funders":"","keywords":"Preconditioner; Mathematics; Additive Schwarz method; Condition number; Boundary element method; Mathematical analysis; Diagonal; Schwarz alternating method; Bounded function; Matrix (chemical analysis); Element (criminal law); Krylov subspace; Finite element method; Geometry; Domain decomposition methods; Eigenvalues and eigenvectors; Linear system","retraction":null,"screen_n_in":null,"score":{"opus":0.0105324272863478,"gpt":0.2467673514646481,"spread":0.2362349241783003,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002969244,0.0001731508,0.000249147,0.00007506015,0.00009235391,0.00002350168,0.0002149905,0.00008539303,0.0005748414],"category_scores_gemma":[0.00006880953,0.0001399394,0.00008877335,0.0002587436,0.0000491803,0.0002627449,0.00001957254,0.0001664814,0.00001974238],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00008991046,"about_ca_system_score_gemma":0.00001804039,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000004327094,"about_ca_topic_score_gemma":0.000003131657,"domain_scores_codex":[0.9989953,0.00004876791,0.0003517543,0.0001837559,0.0001908217,0.0002296229],"domain_scores_gemma":[0.9993732,0.0001105,0.00004693998,0.0003742897,0.00004026099,0.0000548021],"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.0001188275,0.0009101338,0.0004413913,0.001336743,0.0003421841,0.0000039701,0.009810252,0.5165871,0.3232035,0.008273272,0.002599067,0.1363736],"study_design_scores_gemma":[0.001161502,0.0001513735,0.001691515,0.0004452869,0.00007522033,0.00001208955,0.0007169764,0.810329,0.1603418,0.01475245,0.00975946,0.0005633603],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.8165437,0.00018195,0.1796727,0.00004564978,0.0002660734,0.000951738,0.0001286146,0.0001748619,0.002034703],"genre_scores_gemma":[0.77815,0.00001256132,0.2214359,0.00002369564,0.00005203472,0.0002058678,0.00002689201,0.00005670638,0.00003629977],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.2937419,"threshold_uncertainty_score":0.629411,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2025017973","doi":"10.1007/s002110100265","title":"Convergence of cascade algorithms in Sobolev spaces and integrals of wavelets","year":2002,"lang":"en","type":"article","venue":"Numerische Mathematik","topic":"Mathematical Analysis and Transform Methods","field":"Mathematics","cited_by":30,"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":"","keywords":"Mathematics; Cascade; Sobolev space; Wavelet; Dilation (metric space); Convergence (economics); Algorithm; Sequence (biology); Computation; Inverse; Characterization (materials science); Mathematical analysis; Combinatorics; Geometry; Physics; Computer science","retraction":null,"screen_n_in":null,"score":{"opus":0.0918905678875565,"gpt":0.3389530412031784,"spread":0.2470624733156219,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.001033289,0.000238962,0.001011244,0.0001873162,0.00002712799,0.00001427862,0.0002289454,0.0001322389,0.001381485],"category_scores_gemma":[0.0005628706,0.0001752408,0.000178582,0.0004022018,0.0001893972,0.0001230085,0.00005511538,0.0001914461,0.00001305568],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001016626,"about_ca_system_score_gemma":0.000008986634,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00005016091,"about_ca_topic_score_gemma":0.00002262011,"domain_scores_codex":[0.9979428,0.0001295036,0.001031325,0.0002573152,0.0003772091,0.0002618715],"domain_scores_gemma":[0.998274,0.0007815608,0.0003889432,0.0003825801,0.00008300404,0.0000898568],"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.00003573732,0.002263798,0.00283251,0.008292445,0.0005110126,0.00002969376,0.0292223,0.000006206428,0.01569376,0.90343,0.0008853951,0.03679713],"study_design_scores_gemma":[0.001350706,0.000210506,0.000588103,0.001196816,0.0003075881,0.00006971342,0.002837313,0.04815127,0.1494994,0.7945839,0.0005599383,0.0006447745],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9372995,0.0008036216,0.04745839,0.0002743775,0.00004192923,0.000386308,0.00002089909,0.0000361716,0.01367879],"genre_scores_gemma":[0.7889354,0.0002473041,0.2102176,0.00001167353,0.00001228012,0.00002086112,7.416442e-7,0.00002463486,0.000529559],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.1627592,"threshold_uncertainty_score":0.9995314,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2621986455","doi":"10.1007/s00211-017-0893-7","title":"A conjugate gradient like method for p-norm minimization in functional spaces","year":2017,"lang":"en","type":"article","venue":"Numerische Mathematik","topic":"Numerical methods in inverse problems","field":"Mathematics","cited_by":30,"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; Banach space; Conjugate gradient method; Hilbert space; Norm (philosophy); Gradient descent; Dual norm; Linear form; Regularization (linguistics); Mathematical analysis; Combinatorics; Applied mathematics; Discrete mathematics; Algorithm","retraction":null,"screen_n_in":null,"score":{"opus":0.1285364358480767,"gpt":0.39701146513672,"spread":0.2684750292886433,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.001951747,0.0003284115,0.0006464365,0.0001542611,0.0004123636,0.0002372086,0.0005322243,0.0001902051,0.0003577568],"category_scores_gemma":[0.003943417,0.0002882962,0.0002115155,0.000129545,0.0001376213,0.0003627223,0.0001875235,0.0002510742,0.00007058709],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00009418216,"about_ca_system_score_gemma":0.00005644052,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00005511993,"about_ca_topic_score_gemma":0.00003181876,"domain_scores_codex":[0.9977232,0.0001901033,0.0006983086,0.0005306107,0.0003792613,0.0004784678],"domain_scores_gemma":[0.9963384,0.001563633,0.0007935087,0.001022695,0.000153019,0.0001287964],"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.0005035662,0.001462301,0.002459725,0.002327579,0.0004255206,0.00002274825,0.00752086,0.0002277014,0.006938877,0.8896241,0.05005,0.03843702],"study_design_scores_gemma":[0.001794781,0.0001175574,0.0003490823,0.0002206931,0.0001003222,0.00002876696,0.0005284793,0.03299984,0.004499727,0.9370538,0.02179682,0.0005101335],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.008760166,0.00006341538,0.975567,0.001294379,0.0009527567,0.001287106,0.00003053138,0.0001570374,0.01188763],"genre_scores_gemma":[0.01594524,0.00001589847,0.980529,0.0001602945,0.0001596503,0.0006364382,0.00000927267,0.0000870326,0.002457252],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.0474297,"threshold_uncertainty_score":0.9999569,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2039279171","doi":"10.1007/s00211-014-0646-9","title":"Penalty: finite element approximation of Stokes equations with slip boundary conditions","year":2014,"lang":"en","type":"article","venue":"Numerische Mathematik","topic":"Advanced Numerical Methods in Computational Mathematics","field":"Engineering","cited_by":29,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Université Laval","funders":"","keywords":"Mathematics; Slip (aerodynamics); Boundary value problem; Mathematical analysis; Finite element method; Boundary (topology); Boundary element method; Penalty method; Convergence (economics); Stokes flow; Mixed boundary condition; Numerical analysis; Geometry; Mathematical optimization; Physics","retraction":null,"screen_n_in":null,"score":{"opus":0.02126333453919228,"gpt":0.2814996843807744,"spread":0.2602363498415821,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003615923,0.0002151185,0.0003546938,0.0001316265,0.0001107047,0.00003292851,0.0001845514,0.00005648197,0.0001952858],"category_scores_gemma":[0.0004581623,0.0001872508,0.00006670012,0.0003383281,0.0001085953,0.0002183953,0.00003094229,0.0001676116,0.00007083339],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004421707,"about_ca_system_score_gemma":0.00002445135,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":9.086689e-7,"about_ca_topic_score_gemma":7.950414e-7,"domain_scores_codex":[0.9986062,0.00007428385,0.0005345023,0.0001728445,0.000395916,0.0002162645],"domain_scores_gemma":[0.997736,0.001490533,0.0002093542,0.0003503399,0.0001377611,0.00007600247],"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.00001642242,0.0003027546,0.00007741965,0.001492362,0.0002245504,0.000001243996,0.002067694,0.7635503,0.003864347,0.2135591,0.0006170787,0.01422681],"study_design_scores_gemma":[0.0003640049,0.000109307,0.0001072076,0.0001692644,0.00005974364,0.000008625519,0.0002442713,0.8090289,0.005873572,0.1820507,0.001699174,0.0002853074],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.007751322,0.00005951276,0.9831598,0.00008106558,0.00009283135,0.0003187373,0.00003240791,0.0002779804,0.008226341],"genre_scores_gemma":[0.4572744,0.000004766428,0.5424221,0.00002793839,0.00004013057,0.0001061933,0.00003417133,0.00004315864,0.00004713375],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.4495231,"threshold_uncertainty_score":0.7635866,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2108087611","doi":"10.1007/s00211-004-0535-8","title":"The optimal rate of convergence of the p-version of the boundary element method in two dimensions","year":2004,"lang":"en","type":"article","venue":"Numerische Mathematik","topic":"Advanced Numerical Methods in Computational Mathematics","field":"Engineering","cited_by":23,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Manitoba","funders":"","keywords":"Mathematics; Sobolev space; Rate of convergence; Convergence (economics); Boundary (topology); Element (criminal law); Boundary element method; Singular integral; Mathematical analysis; Applied mathematics; Finite element method; Integral equation","retraction":null,"screen_n_in":null,"score":{"opus":0.01415187802465448,"gpt":0.3133914756659482,"spread":0.2992395976412937,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009473545,0.0001546785,0.0003170979,0.00003465396,0.00009915999,0.000006067854,0.0005436853,0.00003694788,0.00002322337],"category_scores_gemma":[0.0005298716,0.00008213916,0.0001511658,0.0005083476,0.0002214629,0.0000625842,0.0002122179,0.0002278648,0.00000357311],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00005561654,"about_ca_system_score_gemma":0.00005751866,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001228179,"about_ca_topic_score_gemma":0.000003284531,"domain_scores_codex":[0.9984747,0.0002004226,0.0006881441,0.0001228173,0.0003334249,0.0001804498],"domain_scores_gemma":[0.9977248,0.001265147,0.0003417488,0.0005472336,0.0000950083,0.00002605099],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"bench_or_experimental","study_design_scores_codex":[0.00001903608,0.0001162477,0.0001570986,0.000321056,0.0000747853,4.620356e-7,0.001901228,0.8900574,0.04961836,0.05598741,0.00007198563,0.001674891],"study_design_scores_gemma":[0.0008525429,0.00005000139,0.001200621,0.0005892526,0.00006301122,0.00001115492,0.00108144,0.1405469,0.5040301,0.3508323,0.0005247564,0.0002178563],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2429242,0.0002726498,0.7549508,0.0002470173,0.0003919666,0.0004745914,0.00001816268,0.00002727597,0.0006934282],"genre_scores_gemma":[0.5625765,0.0000307413,0.4373059,0.0000171277,0.000007909864,0.0000174029,3.308267e-7,0.00002033518,0.00002366417],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.7495105,"threshold_uncertainty_score":0.3349538,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2080460578","doi":"10.1007/s00211-006-0006-5","title":"Linear Complexity Solution of Parabolic Integro-differential Equations","year":2006,"lang":"en","type":"article","venue":"Numerische Mathematik","topic":"Advanced Mathematical Modeling in Engineering","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":"McGill University","funders":"","keywords":"Mathematics; Discretization; Galerkin method; Work (physics); Mathematical analysis; Integer (computer science); Numerical analysis; Parabolic partial differential equation; Differential equation; Space (punctuation); Combinatorics; Finite element method; Physics","retraction":null,"screen_n_in":null,"score":{"opus":0.04013664053943961,"gpt":0.2760915167865393,"spread":0.2359548762470997,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001617322,0.0001739998,0.0003089743,0.00009828793,0.00007702968,0.00003233034,0.0005643202,0.00006968037,0.00004295578],"category_scores_gemma":[0.0001487366,0.000156923,0.0001048986,0.0002823139,0.00007968239,0.0003032714,0.0001763633,0.0001606898,0.00007203528],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002963932,"about_ca_system_score_gemma":0.00002316226,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002601051,"about_ca_topic_score_gemma":0.000002658876,"domain_scores_codex":[0.9986343,0.00002991255,0.0005073889,0.0002505305,0.0003153866,0.0002625191],"domain_scores_gemma":[0.9988986,0.0001820659,0.0001841043,0.0005790854,0.0001039007,0.00005224292],"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.000001878109,0.0001931031,0.000006548181,0.0001084573,0.00001263041,8.123768e-7,0.0002911953,0.01279774,0.01508601,0.9705874,0.000120818,0.0007933985],"study_design_scores_gemma":[0.0001441778,0.00001744508,0.00006914883,0.00005027066,0.00000820922,0.000005369438,0.000009069044,0.7953376,0.008923062,0.1952346,0.00006395903,0.0001371391],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01219891,0.00006098497,0.9850702,0.0001079989,0.0001362094,0.0001584801,0.00000443463,0.0002917358,0.001971024],"genre_scores_gemma":[0.5751107,9.67878e-7,0.4247275,0.000006266561,0.00004828099,0.00001696044,0.000003978234,0.00001155037,0.00007371306],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.7825398,"threshold_uncertainty_score":0.6399134,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2166485094","doi":"10.1007/s00211-006-0040-3","title":"Error analysis of an enhanced DtN-FE method for exterior scattering problems","year":2006,"lang":"en","type":"article","venue":"Numerische Mathematik","topic":"Electromagnetic Simulation and Numerical Methods","field":"Engineering","cited_by":23,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":false,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"","funders":"McGill University; Fonds Québécois de la Recherche sur la Nature et les Technologies; National Science Foundation","keywords":"Mathematics; Perturbation (astronomy); Mathematical analysis; Sobolev space; Hypersurface; Eigenvalues and eigenvectors; Applied mathematics","retraction":null,"screen_n_in":null,"score":{"opus":0.0183810416812905,"gpt":0.3126299136054117,"spread":0.2942488719241212,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004670196,0.0002111,0.0005889828,0.0002581289,0.00004531496,0.00003038915,0.00018449,0.0001041067,0.0004103667],"category_scores_gemma":[0.00004867978,0.0001990365,0.0002054509,0.0008299324,0.00002622725,0.0001162601,0.00001619853,0.00009421571,0.000008808147],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002471323,"about_ca_system_score_gemma":0.00000747629,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00003077347,"about_ca_topic_score_gemma":0.00001228019,"domain_scores_codex":[0.9986447,0.00007771294,0.0005579307,0.0002501552,0.0001740904,0.0002953775],"domain_scores_gemma":[0.9990882,0.0002832111,0.0001278603,0.0003689008,0.0000616415,0.0000701346],"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.00001391386,0.00008623631,0.00002722125,0.0002497774,0.0002728659,2.906551e-7,0.0003932841,0.1018949,0.8734903,0.0003789643,0.00007686049,0.02311538],"study_design_scores_gemma":[0.000336378,0.0001229446,0.001414716,0.00002404544,0.0004149988,0.000001840394,0.00004946471,0.8062127,0.188342,0.002000389,0.0008185804,0.0002619229],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.2735497,0.0001053096,0.7238291,0.00001817219,0.0000567346,0.0002816193,0.00001554573,0.0001957535,0.001948065],"genre_scores_gemma":[0.4592105,0.000002294977,0.5403221,0.00001824728,0.0000402411,0.0001224427,0.00002806982,0.0000439041,0.0002122167],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.7043178,"threshold_uncertainty_score":0.8116474,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2589197426","doi":"10.1007/s00211-017-0869-7","title":"Newton–Noda iteration for finding the Perron pair of a weakly irreducible nonnegative tensor","year":2017,"lang":"en","type":"article","venue":"Numerische Mathematik","topic":"Tensor decomposition and applications","field":"Mathematics","cited_by":22,"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":"Mathematics; Tensor (intrinsic definition); Numerical analysis; Newton's method; Applied mathematics; Mathematical analysis; Pure mathematics; Nonlinear system","retraction":null,"screen_n_in":null,"score":{"opus":0.1304136527241463,"gpt":0.3979500100665251,"spread":0.2675363573423787,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004709186,0.0001932046,0.0003289199,0.00005954413,0.0008931656,0.0001990058,0.0005005113,0.00008757285,0.0001925835],"category_scores_gemma":[0.0007093649,0.0001350838,0.0002042351,0.0000757774,0.0001428574,0.0002816179,0.00007902073,0.0001329855,0.00006721402],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002706984,"about_ca_system_score_gemma":0.00003378456,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001733465,"about_ca_topic_score_gemma":0.000009481629,"domain_scores_codex":[0.9987929,0.00003787412,0.0004577057,0.0002674359,0.0002217732,0.000222251],"domain_scores_gemma":[0.99737,0.0005433162,0.0007491153,0.001076207,0.0002140194,0.00004731253],"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.00007018503,0.000596286,0.0003466747,0.0005508625,0.0001734368,9.146328e-7,0.01020674,0.0000169399,0.04740307,0.8701727,0.06731982,0.003142345],"study_design_scores_gemma":[0.002113418,0.0002128359,0.004726924,0.0006309325,0.0003780715,0.00005320036,0.005830889,0.01885249,0.122953,0.8061351,0.0372841,0.0008290406],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.827417,0.00009516125,0.1150596,0.02270394,0.0003647259,0.003718745,0.0002514689,0.0002934031,0.03009592],"genre_scores_gemma":[0.9344178,0.000003868738,0.06016877,0.0001017444,0.0001652307,0.0005128828,0.00001603937,0.00004768185,0.004566029],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.1070008,"threshold_uncertainty_score":0.6869598,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1976069054","doi":"10.1007/pl00005447","title":"Componentwise perturbation analyses for the QR factorization","year":2001,"lang":"de","type":"article","venue":"Numerische Mathematik","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":22,"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; Perturbation (astronomy); Triangular matrix; Factorization; Bounded function; QR decomposition; Estimator; Condition number; Combinatorics; Numerical analysis; Applied mathematics; Mathematical analysis; Pure mathematics; Algorithm; Eigenvalues and eigenvectors; Statistics; Physics","retraction":null,"screen_n_in":null,"score":{"opus":0.07914751566550819,"gpt":0.332675034205905,"spread":0.2535275185403968,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008288475,0.0003541935,0.0003870706,0.0001160589,0.0007078903,0.0005892574,0.001122379,0.0001463971,0.0004329748],"category_scores_gemma":[0.0002820696,0.0002393976,0.0003020605,0.0006575843,0.0001008571,0.0005687603,0.0001694002,0.0002052548,0.000512011],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004816928,"about_ca_system_score_gemma":0.00006465916,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001606961,"about_ca_topic_score_gemma":8.616852e-7,"domain_scores_codex":[0.9977949,0.0001841511,0.000575908,0.0005158217,0.0004823702,0.0004468262],"domain_scores_gemma":[0.9971061,0.001152798,0.0004433324,0.0009571154,0.0002223638,0.0001183279],"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.0003384459,0.001741806,0.0003670668,0.0009468031,0.001877554,0.00003570068,0.04450291,0.005175788,0.01084472,0.7461138,0.02283484,0.1652206],"study_design_scores_gemma":[0.0006649698,0.0001311893,0.0001950718,0.000102042,0.0003294138,0.00002392704,0.0004400254,0.7424675,0.002968653,0.04332177,0.2088808,0.0004746021],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.001537212,0.004231753,0.9867425,0.003209954,0.001952071,0.0008813246,0.00003146933,0.0001587711,0.001254923],"genre_scores_gemma":[0.9006777,0.001881636,0.06838115,0.001186398,0.003998598,0.0004154412,0.0001719868,0.0001393755,0.02314773],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9183614,"threshold_uncertainty_score":0.9762352,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2083936573","doi":"10.1007/s00211-008-0172-8","title":"On optimal condition numbers for Markov chains","year":2008,"lang":"de","type":"article","venue":"Numerische Mathematik","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":20,"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":"Mathematics; Combinatorics; Markov chain; Ergodic theory; Ergodicity; Inverse; Norm (philosophy); Stationary distribution; Discrete mathematics; Mathematical analysis; Statistics","retraction":null,"screen_n_in":null,"score":{"opus":0.0202761657136511,"gpt":0.264963043820058,"spread":0.2446868781064069,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0007462406,0.0004736617,0.0005626829,0.000155734,0.0006987156,0.0001714246,0.0009610793,0.0002377617,0.0008782016],"category_scores_gemma":[0.0002076663,0.0004491907,0.0003783216,0.0003594555,0.0002201284,0.0004357309,0.0001643655,0.0003362873,0.002447573],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00006732247,"about_ca_system_score_gemma":0.0001317648,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000005610061,"about_ca_topic_score_gemma":2.385672e-7,"domain_scores_codex":[0.9972504,0.0001550374,0.0005901772,0.000772036,0.0005308542,0.0007015063],"domain_scores_gemma":[0.9976312,0.000654667,0.0003872348,0.0009471253,0.0001309319,0.0002488437],"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.0002662818,0.001197411,0.00001034006,0.0006134032,0.0003695566,0.0002227058,0.01638796,0.0005723547,0.0003653915,0.8786987,0.09032776,0.01096812],"study_design_scores_gemma":[0.006478189,0.002654047,0.0001147924,0.0009623457,0.0003217962,0.0008374884,0.0008066487,0.6752206,0.01849347,0.09126967,0.1995984,0.003242497],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.03257117,0.0005685919,0.9498866,0.001400937,0.002550111,0.001182509,0.0001911878,0.0003235956,0.01132536],"genre_scores_gemma":[0.5348003,0.0003772062,0.4148244,0.002765398,0.003064264,0.0006682911,0.0002046075,0.0002483832,0.04304712],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.787429,"threshold_uncertainty_score":0.999796,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1997780371","doi":"10.1007/s00211-012-0455-y","title":"Iterative methods for the solution of a singular control formulation of a GMWB pricing problem","year":2012,"lang":"en","type":"article","venue":"Numerische Mathematik","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":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo","funders":"","keywords":"Mathematics; Discretization; Singular control; Mathematical optimization; Convergence (economics); Applied mathematics; Nonlinear system; Singular solution; Scaling; Optimal control; Mathematical analysis","retraction":null,"screen_n_in":null,"score":{"opus":0.04092930086216542,"gpt":0.3031758311843536,"spread":0.2622465303221882,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009800935,0.00008698723,0.0003145476,0.00006322555,0.0001001139,0.00001067292,0.0001189521,0.00005625974,0.00001744895],"category_scores_gemma":[0.0003079351,0.0000705012,0.0001074861,0.0001923611,0.00003397619,0.0001621633,0.0000196153,0.00004930512,0.000007320824],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002103836,"about_ca_system_score_gemma":0.00001251597,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00003269916,"about_ca_topic_score_gemma":5.980914e-7,"domain_scores_codex":[0.9991259,0.000006224179,0.0005601147,0.0001154379,0.00002633046,0.0001659893],"domain_scores_gemma":[0.9986221,0.0003564357,0.0007179158,0.0001886991,0.00009172213,0.00002310465],"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.00001655879,0.00009444034,0.0003005657,0.0001508462,0.0000489069,2.97116e-9,0.002896185,0.00003307945,0.002338715,0.9870964,0.00001838083,0.007005872],"study_design_scores_gemma":[0.0009330759,0.0001238913,0.00270627,0.00007132808,0.00008140789,0.000003031065,0.0002678616,0.1078782,0.0079804,0.8743662,0.005369425,0.0002188886],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.001708909,0.002345796,0.9935657,0.0001800734,0.00006036401,0.0007731279,0.0000503981,0.00001091938,0.001304763],"genre_scores_gemma":[0.7102662,0.00000566759,0.2893758,0.00001918079,0.00004471882,0.000250296,0.000003468745,0.0000103126,0.000024365],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.7085572,"threshold_uncertainty_score":0.2874955,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1512306938","doi":"10.1007/s00211-015-0723-8","title":"Convergence of the embedded mean-variance optimal points with discrete sampling","year":2015,"lang":"en","type":"article","venue":"Numerische Mathematik","topic":"Stochastic processes and financial applications","field":"Economics, Econometrics and Finance","cited_by":16,"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":"Mathematics; Embedding; Applied mathematics; Sequence (biology); Convergence (economics); Spurious relationship; Stochastic differential equation; Numerical analysis; Partial differential equation; Limit (mathematics); Mathematical analysis; Mathematical optimization; Statistics; Computer science","retraction":null,"screen_n_in":null,"score":{"opus":0.05173194826676521,"gpt":0.2508436250622726,"spread":0.1991116767955075,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003136061,0.0001358213,0.000323328,0.0000375544,0.00008659216,0.00002761192,0.0004130179,0.00005711021,0.00007553041],"category_scores_gemma":[0.0001911045,0.0001022453,0.00007011676,0.0003593173,0.0001132808,0.0001326516,0.00009011068,0.0001142295,0.0001932664],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002570301,"about_ca_system_score_gemma":0.00005576094,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0000648056,"about_ca_topic_score_gemma":0.000005780175,"domain_scores_codex":[0.9989982,0.000003885564,0.0004494545,0.0002739718,0.00007676238,0.0001977768],"domain_scores_gemma":[0.998818,0.00004166572,0.0004890527,0.0004915622,0.00008536597,0.00007435832],"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.00002281862,0.00005593306,0.001136743,0.0000484515,0.0000289208,2.948244e-7,0.002265092,0.000248802,0.00005435128,0.9958894,0.0001552284,0.00009391423],"study_design_scores_gemma":[0.00154419,0.0001922979,0.005852797,0.0002118453,0.00004602649,0.0000372279,0.001827904,0.01312694,0.002788522,0.9628534,0.01075665,0.0007622088],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.03872856,0.0004054896,0.9508666,0.00044635,0.0001364118,0.0002584484,0.00008643069,0.00002750674,0.00904414],"genre_scores_gemma":[0.9336299,0.000006941319,0.06588854,0.00007684465,0.00004853808,0.00007586577,0.000003118602,0.00002303718,0.0002472507],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8949013,"threshold_uncertainty_score":0.4169443,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2982262031","doi":"10.1007/s00211-022-01291-2","title":"Rigorous numerics for nonlinear heat equations in the complex plane of time","year":2022,"lang":"en","type":"article","venue":"Numerische Mathematik","topic":"Stability and Controllability of Differential Equations","field":"Engineering","cited_by":16,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"McGill University","funders":"Japan Society for the Promotion of Science; National Institutes of Health","keywords":"Mathematics; Initial value problem; Cauchy problem; Nonlinear system; Heat equation; Cauchy distribution; Fixed point; Banach space; Mathematical analysis; Singularity; Applied mathematics","retraction":null,"screen_n_in":null,"score":{"opus":0.02612422237683499,"gpt":0.241937234614109,"spread":0.215813012237274,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0004829422,0.0001125671,0.0002657382,0.00006277466,0.0001512187,0.00001780739,0.0002964851,0.00002950116,0.000939099],"category_scores_gemma":[0.0001478168,0.00009809656,0.000106959,0.0002490802,0.00004007706,0.00004819586,0.00003249815,0.0001470417,0.00002244482],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0000399241,"about_ca_system_score_gemma":0.00002185579,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0000322174,"about_ca_topic_score_gemma":0.00002446536,"domain_scores_codex":[0.9990029,0.00008662215,0.0003693229,0.0001207386,0.0002468839,0.0001735022],"domain_scores_gemma":[0.9987165,0.0008636174,0.00003670352,0.0003298168,0.00003143653,0.00002195524],"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.0004004577,0.005484832,0.001094195,0.002368091,0.0007270881,0.000005934981,0.07036985,0.7216568,0.093291,0.07172412,0.01457719,0.01830047],"study_design_scores_gemma":[0.0008497804,0.0001410272,0.00040136,0.000008459464,0.00004695314,0.000003089696,0.001908483,0.9791145,0.0003098353,0.0116221,0.005403165,0.0001912557],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.5885159,0.0003763535,0.3979165,0.002385196,0.0002961034,0.002904895,0.001751293,0.0003129239,0.005540851],"genre_scores_gemma":[0.9939101,0.000002234457,0.005356875,0.00007246394,0.00003262379,0.0004322558,0.0001344029,0.00002060538,0.0000383906],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.4053942,"threshold_uncertainty_score":0.9999742,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2612062628","doi":"10.1007/s00211-017-0897-3","title":"An analysis of Schwarz waveform relaxation domain decomposition methods for the imaginary-time linear Schrödinger and Gross-Pitaevskii equations","year":2017,"lang":"en","type":"article","venue":"Numerische Mathematik","topic":"Numerical methods for differential equations","field":"Mathematics","cited_by":14,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Université de Montréal; Carleton University; Statistics Canada","funders":"Agence Nationale de la Recherche","keywords":"Mathematics; Domain decomposition methods; Discretization; Partial differential equation; Mathematical analysis; Nonlinear system; Rate of convergence; Relaxation (psychology); Schwarz alternating method; Numerical analysis; Applied mathematics; Finite element method; Quantum mechanics","retraction":null,"screen_n_in":null,"score":{"opus":0.06871300535366258,"gpt":0.4651305856117182,"spread":0.3964175802580556,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003192427,0.0002961043,0.0007689151,0.0003112178,0.00128197,0.0002627689,0.0006429449,0.0001586313,0.0002141846],"category_scores_gemma":[0.004240509,0.0002133782,0.0003923363,0.0003798726,0.0003435715,0.0007505853,0.0001481449,0.0002107257,0.00001310703],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004767341,"about_ca_system_score_gemma":0.00003772987,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00005127551,"about_ca_topic_score_gemma":0.0000138218,"domain_scores_codex":[0.9977275,0.0003671301,0.0008303502,0.0004228464,0.0003324714,0.0003197418],"domain_scores_gemma":[0.9926134,0.004056118,0.001298436,0.001547727,0.0003527475,0.0001315553],"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.0002261647,0.001407428,0.0008785194,0.0005514491,0.004489251,0.000001250208,0.009450987,0.0002561098,0.1927037,0.6457384,0.0001311726,0.1441655],"study_design_scores_gemma":[0.0004912136,0.0001452749,0.002474464,0.00004965681,0.00253792,0.000003722244,0.000374317,0.3898122,0.006025076,0.5976784,0.0001396584,0.0002680756],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.07343978,0.00006729095,0.9241244,0.0007462011,0.00009354854,0.0009044564,0.00008257134,0.00009011104,0.0004516887],"genre_scores_gemma":[0.1777785,0.00001178304,0.8215824,0.00002072371,0.00007576913,0.00023586,0.00006138277,0.00005241914,0.0001811869],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.3895561,"threshold_uncertainty_score":0.986001,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W3172168456","doi":"10.1007/s00211-022-01303-1","title":"Crouzeix-Raviart finite element method for non-autonomous variational problems with Lavrentiev gap","year":2022,"lang":"en","type":"article","venue":"Numerische Mathematik","topic":"Advanced Numerical Methods in Computational Mathematics","field":"Engineering","cited_by":10,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"University of British Columbia","funders":"Natural Sciences and Engineering Research Council of Canada; Universität Bielefeld; Deutsche Forschungsgemeinschaft","keywords":"Finite element method; Mathematics; Convergence (economics); Scheme (mathematics); Applied mathematics; Element (criminal law); Numerical analysis; Mathematical analysis; Physics","retraction":null,"screen_n_in":null,"score":{"opus":0.02759806005989038,"gpt":0.2979661649734861,"spread":0.2703681049135957,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0008636831,0.0003443506,0.0004754917,0.0001373091,0.0003160351,0.00005897004,0.0003810199,0.00005360061,0.0005940148],"category_scores_gemma":[0.0001351209,0.0003220936,0.0001321925,0.0004184043,0.00003093645,0.0001503892,0.0001345862,0.0003380826,0.00003475768],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001809098,"about_ca_system_score_gemma":0.00005951112,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000001743072,"about_ca_topic_score_gemma":4.563049e-7,"domain_scores_codex":[0.9978638,0.00009717435,0.0006310604,0.0003792118,0.0005939841,0.0004347942],"domain_scores_gemma":[0.9977129,0.001448787,0.0002257788,0.0003901192,0.0001175592,0.0001048858],"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.00002866951,0.0002099836,0.00001538166,0.000519865,0.0001984199,0.000002901582,0.001197368,0.9696565,0.0007209558,0.01953902,0.001862826,0.006048144],"study_design_scores_gemma":[0.0007280015,0.0002282358,0.00001848284,0.00003881435,0.00006171392,0.00003916869,0.0002366425,0.8537892,0.0008052096,0.1143006,0.0293247,0.0004292621],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0003083413,0.00008620853,0.9943566,0.0001644617,0.0003416155,0.001191486,0.0001461735,0.0003810578,0.003024074],"genre_scores_gemma":[0.01444722,0.000004174137,0.9819221,0.0001367588,0.0001162443,0.002619953,0.00008612668,0.0001486339,0.0005187452],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.1158673,"threshold_uncertainty_score":0.9999231,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4247319463","doi":"10.1007/s002110100317","title":"Bounds for the least squares distance using scaled total least squares","year":2002,"lang":"en","type":"article","venue":"Numerische Mathematik","topic":"Statistical and numerical algorithms","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":"McGill University","funders":"","keywords":"Overdetermined system; Mathematics; Residual; Least-squares function approximation; Generalized minimal residual method; Upper and lower bounds; Applied mathematics; Norm (philosophy); Ordinary least squares; Combinatorics; Statistics; Algorithm; Mathematical analysis","retraction":null,"screen_n_in":null,"score":{"opus":0.1319097240340675,"gpt":0.3371127111819647,"spread":0.2052029871478973,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0003872685,0.000450185,0.0006560651,0.0000574206,0.0006657319,0.0002292324,0.0004987348,0.0001444438,0.001927673],"category_scores_gemma":[0.001237175,0.0002910177,0.0003394443,0.0003618265,0.0003503846,0.0001959737,0.0001209105,0.0003094968,0.0002299406],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0000692876,"about_ca_system_score_gemma":0.00001981854,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00003194219,"about_ca_topic_score_gemma":0.000008447138,"domain_scores_codex":[0.9972879,0.00008794844,0.0007833333,0.0005037165,0.000615437,0.0007217092],"domain_scores_gemma":[0.9961993,0.00243747,0.0003193922,0.000688178,0.0001566448,0.0001990124],"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.0005758316,0.004454641,0.0005878184,0.003741318,0.001264623,0.00008584185,0.01479385,0.0002511467,0.003617664,0.6710078,0.1383368,0.1612827],"study_design_scores_gemma":[0.002353487,0.0004399518,0.0003528264,0.0004412457,0.0004738574,0.000282709,0.003210838,0.595835,0.001331644,0.3656609,0.02808901,0.001528602],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02557683,0.001196581,0.9660106,0.001284506,0.0004462514,0.001083921,0.0002958458,0.0002855054,0.00381999],"genre_scores_gemma":[0.7841934,0.00003213437,0.2072076,0.0002113382,0.0007581767,0.000384735,0.00001291858,0.0001827999,0.007016931],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.758803,"threshold_uncertainty_score":0.9999542,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2101853980","doi":"10.1007/s00211-013-0591-z","title":"A three level finite element approximation of a pattern formation model in developmental biology","year":2013,"lang":"en","type":"article","venue":"Numerische Mathematik","topic":"Nonlinear Dynamics and Pattern Formation","field":"Computer Science","cited_by":7,"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":"Turing; Reaction–diffusion system; Numerical analysis; Finite element method; Applied mathematics; A priori and a posteriori; Mathematics; Piecewise linear function; Schematic; Domain (mathematical analysis); Mathematical and theoretical biology; Computer science; Mathematical analysis; Bioinformatics","retraction":null,"screen_n_in":null,"score":{"opus":0.05521716986835067,"gpt":0.251001992513648,"spread":0.1957848226452973,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000278125,0.0001198714,0.0001675545,0.0001640446,0.00003374392,0.00005158217,0.0003531789,0.0000609665,0.00003725755],"category_scores_gemma":[0.00001626976,0.0001045683,0.00003819571,0.0001851134,0.00001406026,0.0008646429,0.0001399383,0.00008181434,0.0001260892],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00005067938,"about_ca_system_score_gemma":0.00003409131,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00009498411,"about_ca_topic_score_gemma":0.00007849131,"domain_scores_codex":[0.9989655,0.00002239718,0.000510169,0.0001548587,0.0001637598,0.0001832971],"domain_scores_gemma":[0.9994043,0.00003384408,0.0002461712,0.0002158193,0.00006941313,0.00003052237],"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.00001242152,0.0008974753,0.01685792,0.001026246,0.00007842258,0.000001700652,0.0340801,0.01202837,0.02794895,0.1012388,0.0006060604,0.8052235],"study_design_scores_gemma":[0.0002747088,0.00002371901,0.001449777,0.00004093841,0.000001434966,0.000004263818,0.00006738129,0.960797,0.002131993,0.03508308,0.00001295918,0.0001128102],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1800281,0.000006579527,0.8188258,0.0001722832,0.00002780466,0.0003145981,0.00001088786,0.00002728678,0.0005865723],"genre_scores_gemma":[0.7332801,0.000002927527,0.2665057,0.00006792947,0.000005823745,0.00008257023,0.00003879501,0.000005824038,0.00001036743],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9487686,"threshold_uncertainty_score":0.4264171,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4391491017","doi":"10.1007/s00211-023-01391-7","title":"Stability of the minimum energy path","year":2024,"lang":"en","type":"article","venue":"Numerische Mathematik","topic":"Quantum, superfluid, helium dynamics","field":"Physics and Astronomy","cited_by":4,"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":"Path (computing); Stability (learning theory); Energy landscape; Convergence (economics); String (physics); Energy (signal processing); Numerical analysis; Mathematics; Potential energy; Statistical physics; Applied mathematics; Mathematical optimization; Physics; Computer science; Classical mechanics; Mathematical analysis; Thermodynamics; Mathematical physics","retraction":null,"screen_n_in":null,"score":{"opus":0.0091375768273657,"gpt":0.2246191664787332,"spread":0.2154815896513675,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0002164266,0.0001697832,0.0002325662,0.00002701546,0.00006145355,0.00004798258,0.0003222145,0.00004414454,0.001368087],"category_scores_gemma":[0.00001357795,0.0001114578,0.0002343502,0.0002501093,0.00009654275,0.0001053865,0.0001350615,0.000161881,0.00007170141],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001929168,"about_ca_system_score_gemma":0.0001035982,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001699308,"about_ca_topic_score_gemma":0.000004076623,"domain_scores_codex":[0.9988931,0.00006916039,0.0003434798,0.0002457531,0.0002400272,0.0002084658],"domain_scores_gemma":[0.9990944,0.0001419479,0.00006710055,0.0006047977,0.00004519728,0.00004654624],"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.000009878405,0.0003501285,0.01130692,0.0004547593,0.0002285056,0.00000202894,0.003899353,0.00001579953,0.03650331,0.9321408,0.005157358,0.009931136],"study_design_scores_gemma":[0.0009159605,0.0001849229,0.002855991,0.001096194,0.000424132,0.00001573399,0.006459482,0.2212598,0.2366675,0.4581876,0.07041006,0.001522559],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9378675,0.0004539131,0.02886719,0.0003762235,0.0005591786,0.0001804134,0.0001723654,0.00008933697,0.03143388],"genre_scores_gemma":[0.9984649,0.000002957455,0.0006823467,0.00002081122,0.0001258033,0.00003192937,0.000009382192,0.0000342097,0.0006276633],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.4739532,"threshold_uncertainty_score":0.9995448,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4403878268","doi":"10.1007/s00211-024-01442-7","title":"Finite element methods for the stretching and bending of thin structures with folding","year":2024,"lang":"en","type":"article","venue":"Numerische Mathematik","topic":"Advanced Materials and Mechanics","field":"Engineering","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 Ottawa","funders":"","keywords":"Finite element method; Mathematics; Folding (DSP implementation); Bending; Numerical analysis; Element (criminal law); Geometry; Structural engineering; Mathematical analysis; Composite material; Materials science; Engineering","retraction":null,"screen_n_in":null,"score":{"opus":0.01690459420273659,"gpt":0.3076819889153218,"spread":0.2907773947125852,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003387207,0.0001218576,0.0001704097,0.000035045,0.00005775598,0.00006079596,0.00007118243,0.00003165414,0.00002951103],"category_scores_gemma":[0.00003250044,0.00007179959,0.00003214466,0.0000623645,0.00001185425,0.0001134719,0.00002868078,0.00007621764,3.710888e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001084031,"about_ca_system_score_gemma":0.00000613378,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000001936522,"about_ca_topic_score_gemma":0.000001138495,"domain_scores_codex":[0.9994946,0.00001215718,0.0001770475,0.0001108032,0.00006647337,0.0001389066],"domain_scores_gemma":[0.9993765,0.0004274933,0.00003306659,0.0001291682,0.00001173878,0.00002197028],"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.0000257024,0.00001021863,0.000003901464,0.004755059,0.0005249653,0.000002608316,0.009747508,0.08234978,0.2918923,0.4055383,0.0002193849,0.2049302],"study_design_scores_gemma":[0.0001584359,0.00005060766,0.000003185444,0.0002918328,0.0001073722,0.00001097546,0.00132915,0.6845464,0.2402867,0.06598561,0.007060723,0.0001689563],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02506478,0.002984325,0.9711124,0.00002842339,0.0002664945,0.0002502624,0.00001907638,0.0001259307,0.0001482603],"genre_scores_gemma":[0.5832648,0.0001373321,0.4164432,0.00000609163,0.00004712985,0.00004375711,0.000001934392,0.00003846263,0.00001734465],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.6021966,"threshold_uncertainty_score":0.2927902,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4403761393","doi":"10.1007/s00211-024-01443-6","title":"On the adaptive Levin method","year":2024,"lang":"en","type":"article","venue":"Numerische Mathematik","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 Toronto","funders":"","keywords":"Mathematics; Numerical analysis; Applied mathematics; Calculus (dental); Mathematical optimization; Mathematical analysis","retraction":null,"screen_n_in":null,"score":{"opus":0.02564679192034099,"gpt":0.2852614830705678,"spread":0.2596146911502268,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.001166719,0.0001508144,0.0001451506,0.00006170845,0.0001334144,0.0003136573,0.0008873002,0.00004484403,0.0004566969],"category_scores_gemma":[0.00008702621,0.00008363241,0.0001160712,0.0003954557,0.00003175254,0.0002320364,0.0001665226,0.0002538413,0.00201728],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001608828,"about_ca_system_score_gemma":0.00003558837,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000002613627,"about_ca_topic_score_gemma":1.293138e-7,"domain_scores_codex":[0.998852,0.0001911998,0.0001683156,0.0003249997,0.0002599738,0.0002035376],"domain_scores_gemma":[0.9980351,0.001225656,0.0000395489,0.000629777,0.00002103333,0.00004887552],"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.000001909074,0.00002029097,5.020126e-8,0.0000190798,0.00002521871,0.00001604021,0.001767661,0.00001879205,0.000186979,0.965053,0.006213574,0.02667745],"study_design_scores_gemma":[0.00004855008,0.00007168519,0.000002105072,0.0001105457,0.000009224791,0.00005042761,0.0001295999,0.2671396,0.007520321,0.6903776,0.03437245,0.0001678997],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0004030007,0.0003169938,0.9408578,0.0041583,0.0003644682,0.0001568226,0.000003383031,0.0003539218,0.05338534],"genre_scores_gemma":[0.3219168,0.00001798498,0.6606721,0.002373237,0.0003738165,0.0001783346,0.00000127523,0.00005917923,0.0144073],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.3215137,"threshold_uncertainty_score":0.9987597,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4393301193","doi":"10.1007/s00211-025-01499-y","title":"An ordinary differential equation for entropic optimal transport and its linearly constrained variants","year":2025,"lang":"en","type":"article","venue":"Numerische Mathematik","topic":"Nonlinear Partial Differential Equations","field":"Mathematics","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 Alberta","funders":"Agence Nationale de la Recherche","keywords":"Ordinary differential equation; Applied mathematics; Mathematics; Physics; Mathematical optimization; Differential equation; Mathematical analysis","retraction":null,"screen_n_in":null,"score":{"opus":0.05104947344411299,"gpt":0.3446703751820704,"spread":0.2936209017379574,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0002822292,0.0003042502,0.0004998971,0.000164639,0.0002369225,0.000093309,0.0002386185,0.0001895287,0.0003847485],"category_scores_gemma":[0.0003896236,0.0002834762,0.0001389764,0.0001966855,0.00007008659,0.0002930606,0.00003733024,0.0001716168,0.00001902827],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002879864,"about_ca_system_score_gemma":0.0001167048,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000007929139,"about_ca_topic_score_gemma":0.000008146022,"domain_scores_codex":[0.9982108,0.00009932845,0.0006468184,0.0004348611,0.0002485837,0.0003596342],"domain_scores_gemma":[0.9986915,0.0004188753,0.0001987079,0.0003776276,0.000179658,0.0001336119],"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.0003661118,0.001800764,0.0002575645,0.00130605,0.0004838313,0.000007760677,0.002381697,0.00005888161,0.08877848,0.8984551,0.0004549777,0.005648796],"study_design_scores_gemma":[0.007927069,0.001023696,0.004708676,0.0005554898,0.001569886,0.00003039219,0.0007971554,0.672355,0.03225799,0.2766589,0.0007967988,0.001318952],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.4488083,0.00003385159,0.5492375,0.0002160138,0.0001711817,0.0008289736,0.0001135854,0.0001387826,0.0004518546],"genre_scores_gemma":[0.9131379,0.000007469621,0.08529223,0.0000381496,0.0001758845,0.0002226186,0.0001462504,0.00004808934,0.0009313968],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.6722961,"threshold_uncertainty_score":0.9999617,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null}]}