{"meta":{"page":1,"per_page":50,"max_per_page":100,"total":177,"total_is_capped":false,"direct_labels_cover":0,"predictions_cover":177,"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":"fb3bb03b9d75","filters":{"venue":"Mathematics of Computation"}},"results":[{"id":"W2014339952","doi":"10.1090/s0025-5718-04-01718-1","title":"A locally conservative LDG method for the incompressible Navier-Stokes equations","year":2004,"lang":"en","type":"article","venue":"Mathematics of Computation","topic":"Advanced Numerical Methods in Computational Mathematics","field":"Engineering","cited_by":305,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of British Columbia","funders":"Mathematisches Forschungsinstitut Oberwolfach; University of Minnesota; National Science Foundation","keywords":"Mathematics; Discretization; Navier–Stokes equations; Mathematical analysis; Uniqueness; Applied mathematics; Convergence (economics); Fixed-point iteration; Discontinuous Galerkin method; Incompressible flow; Divergence (linguistics); Iterative method; Compressibility; Finite element method; Fixed point; Mathematical optimization; Flow (mathematics); Geometry","retraction":null,"screen_n_in":null,"score":{"opus":0.04671312687074364,"gpt":0.3610357050598986,"spread":0.3143225781891549,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005070631,0.0001777257,0.000317078,0.00008493763,0.0001217546,0.0000295622,0.0002324263,0.00005935097,0.000005053128],"category_scores_gemma":[0.0007353677,0.0001420249,0.0001034799,0.0003383936,0.00009066138,0.0001314784,0.00003741336,0.0001231267,0.000007925384],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00007520035,"about_ca_system_score_gemma":0.00004745045,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000003297199,"about_ca_topic_score_gemma":0.000001693188,"domain_scores_codex":[0.9987723,0.00003999673,0.0006010985,0.0001298915,0.0002867317,0.0001700071],"domain_scores_gemma":[0.9915864,0.007631147,0.0002250319,0.0001976395,0.0003185259,0.00004123988],"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.000004443718,0.00006597209,8.039539e-7,0.0003823537,0.00006769239,2.027416e-7,0.001362034,0.8792402,0.0007852949,0.1054486,0.00004060306,0.01260176],"study_design_scores_gemma":[0.0002819092,0.00003310335,0.00001020651,0.00009498077,0.00003393764,0.000002819512,0.0001925686,0.5510332,0.003306602,0.4448755,0.00004896539,0.0000862513],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.001220401,0.0001827662,0.9967206,0.0002683605,0.0001857342,0.000764129,0.00002201235,0.0001786179,0.0004573546],"genre_scores_gemma":[0.122241,0.000007561515,0.8774638,0.00005178318,0.00003886069,0.0001354852,0.00001030056,0.00004037213,0.00001089942],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.3394268,"threshold_uncertainty_score":0.5791609,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1965490868","doi":"10.1090/s0025-5718-05-01772-2","title":"Global optimization of explicit strong-stability-preserving Runge-Kutta methods","year":2005,"lang":"en","type":"article","venue":"Mathematics of Computation","topic":"Computational Fluid Dynamics and Aerodynamics","field":"Engineering","cited_by":145,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"Simon Fraser University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Runge–Kutta methods; Mathematics; Discretization; Mathematical proof; Stability (learning theory); Variety (cybernetics); Applied mathematics; Partial differential equation; Nonlinear system; Mathematical optimization; Numerical analysis; Mathematical analysis; Computer science","retraction":null,"screen_n_in":null,"score":{"opus":0.01799556574394693,"gpt":0.296725076487288,"spread":0.2787295107433411,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003361713,0.0001315245,0.000259902,0.00007349671,0.00002495882,0.0000186228,0.0001626164,0.00005776947,0.00002067829],"category_scores_gemma":[0.00006079417,0.0001458846,0.00007565221,0.0002678224,0.00002219289,0.0001541213,0.00005846797,0.00005089057,0.000001220212],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00009940325,"about_ca_system_score_gemma":0.00002007994,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000003472454,"about_ca_topic_score_gemma":0.000009951053,"domain_scores_codex":[0.9989054,0.00003341379,0.0005907015,0.0001147511,0.0002308981,0.0001248941],"domain_scores_gemma":[0.9992013,0.0002355958,0.0001427953,0.000176649,0.0002063488,0.00003733894],"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.000002204498,0.00007162256,0.0000781214,0.0002843517,0.00003136146,7.220569e-8,0.0003133804,0.9696421,0.0007737212,0.02280401,0.00001848311,0.005980585],"study_design_scores_gemma":[0.0001887338,0.00002169756,0.0004056817,0.00005295742,0.00002344411,0.000001764825,0.00008736613,0.9871906,0.0005694471,0.01133994,0.000008542523,0.0001098195],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.1954202,0.00008265446,0.8027503,0.0000280969,0.00009788581,0.0001429876,0.00001538636,0.00007570586,0.001386823],"genre_scores_gemma":[0.4977917,0.000006313936,0.5021281,0.000002127293,0.00002233399,0.000003006734,0.00003086125,0.00001224993,0.000003317645],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.3023715,"threshold_uncertainty_score":0.5949,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2160886236","doi":"10.1090/s0025-5718-06-01900-4","title":"A double large prime variation for small genus hyperelliptic index calculus","year":2006,"lang":"en","type":"article","venue":"Mathematics of Computation","topic":"Cryptography and Residue Arithmetic","field":"Computer Science","cited_by":135,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo","funders":"","keywords":"Mathematics; Prime (order theory); Hyperelliptic curve cryptography; Genus; Logarithm; Context (archaeology); Variation (astronomy); Discrete logarithm; Heuristic; Field (mathematics); Algorithm; Calculus (dental); Pure mathematics; Combinatorics; Computer science; Mathematical optimization; Mathematical analysis","retraction":null,"screen_n_in":null,"score":{"opus":0.0146945947311421,"gpt":0.2393141835337826,"spread":0.2246195888026405,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003409777,0.000109216,0.0001937112,0.0001760744,0.00009021877,0.00007761233,0.0002606495,0.00005288514,0.000001210009],"category_scores_gemma":[0.00001602715,0.000102602,0.0001014074,0.000375313,0.00002755118,0.0001309129,0.00005605912,0.00004873311,0.000006836096],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001925615,"about_ca_system_score_gemma":0.00003694401,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00006477145,"about_ca_topic_score_gemma":0.00002934015,"domain_scores_codex":[0.9990281,0.00002051229,0.0003668134,0.0001885351,0.0002045351,0.0001914826],"domain_scores_gemma":[0.999083,0.0001987929,0.000280221,0.0002239912,0.0001846833,0.00002930042],"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.00002603495,0.0009649009,0.00022245,0.0004248683,0.00005615194,0.000002279166,0.002414425,0.03786847,0.001739057,0.9472824,0.0001267452,0.008872201],"study_design_scores_gemma":[0.00099346,0.00007991727,0.003946462,0.0000284134,0.0000215584,0.000005829997,0.00001904251,0.8494511,0.001653419,0.1435928,0.00008848859,0.0001195037],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1360646,0.00004809714,0.8629118,0.00009796158,0.0001081616,0.0003814434,0.000003154415,0.00007690899,0.0003079113],"genre_scores_gemma":[0.6667925,9.712181e-7,0.3330977,0.00001284443,0.00003320171,0.00001854485,0.000008931393,0.000007684403,0.00002755639],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8115827,"threshold_uncertainty_score":0.4183986,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2006138621","doi":"10.1090/s0025-5718-03-01576-x","title":"A complete description of Golay pairs for lengths up to 100","year":2003,"lang":"en","type":"article","venue":"Mathematics of Computation","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":134,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"Simon Fraser University","funders":"Natural Sciences and Engineering Research Council of Canada; Mitacs","keywords":"Binary Golay code; Mathematics; Combinatorics; Autocorrelation; Binary number; Complementary sequences; Algorithm; Discrete mathematics; Arithmetic; Statistics","retraction":null,"screen_n_in":null,"score":{"opus":0.05357796670888526,"gpt":0.2778968689995173,"spread":0.224318902290632,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006204232,0.00008840716,0.0002004402,0.0001786444,0.00005012663,0.00003124003,0.0002526185,0.00003015222,0.000003820483],"category_scores_gemma":[0.0001427223,0.00008816369,0.0001010953,0.0003593993,0.0000271364,0.0001514043,0.00003337569,0.0000297112,0.000004883342],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001168491,"about_ca_system_score_gemma":0.00002217704,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00000146293,"about_ca_topic_score_gemma":0.000001082164,"domain_scores_codex":[0.9991488,0.00005599446,0.0003527751,0.0001450076,0.0001787272,0.0001186651],"domain_scores_gemma":[0.9989686,0.0003493619,0.0002076883,0.0002293934,0.000205841,0.00003910577],"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.00001128106,0.0001211528,0.00003038171,0.0002745334,0.00002282742,1.237682e-7,0.005407071,0.002919137,0.008733336,0.9760274,0.0003715287,0.00608119],"study_design_scores_gemma":[0.0004954455,0.0003904218,0.000174277,0.0001292108,0.00002010603,0.00000451816,0.0003538713,0.1821255,0.01072054,0.804759,0.0006668249,0.0001602834],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1110366,0.00001494649,0.8877012,0.00005810941,0.0001682891,0.0003010952,0.000004778934,0.0000428225,0.0006722108],"genre_scores_gemma":[0.6340188,4.748631e-7,0.3659202,0.00002144938,0.000005340273,0.00001118773,0.000001940088,0.000004814844,0.0000157187],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.5229822,"threshold_uncertainty_score":0.3595211,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1985265065","doi":"10.1090/s0025-5718-00-01213-8","title":"On random walks for Pollard’s rho method","year":2000,"lang":"en","type":"article","venue":"Mathematics of Computation","topic":"Chaos-based Image/Signal Encryption","field":"Computer Science","cited_by":116,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo","funders":"","keywords":"Mathematics; Random walk; Discrete mathematics; Calculus (dental); Statistical physics; Combinatorics; Statistics","retraction":null,"screen_n_in":null,"score":{"opus":0.01595771176100456,"gpt":0.3034019074326976,"spread":0.287444195671693,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007090659,0.0001321222,0.0002598041,0.000131537,0.00006835938,0.00006863091,0.0003202763,0.00005146021,0.00004090774],"category_scores_gemma":[0.0001204299,0.0001235147,0.0001205001,0.0002286817,0.00002078185,0.0002212982,0.00002476113,0.00006189114,0.00005710779],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003948018,"about_ca_system_score_gemma":0.00003894531,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000004824922,"about_ca_topic_score_gemma":6.137142e-7,"domain_scores_codex":[0.9988153,0.00007165477,0.0003983959,0.0002216479,0.0003331359,0.0001598471],"domain_scores_gemma":[0.9982083,0.001126699,0.0001906343,0.0002789088,0.0001490643,0.00004632475],"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.0001924081,0.0006121372,0.000001114246,0.0004495089,0.00006562126,0.000002871758,0.003699796,0.2273686,0.007253152,0.2244232,0.002604133,0.5333274],"study_design_scores_gemma":[0.00126997,0.0001656015,0.00001792454,0.00005554335,0.00001207199,0.000005342086,0.00001010525,0.7209538,0.007422046,0.2698645,0.0001235191,0.00009966404],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.01309449,0.00001655386,0.9836675,0.0003695784,0.00009961865,0.0004738498,0.000005125815,0.0001133513,0.00215991],"genre_scores_gemma":[0.2062428,0.000002457469,0.7933699,0.0001445956,0.00003137656,0.00002437275,0.000009318286,0.00001358354,0.0001615703],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.5332277,"threshold_uncertainty_score":0.5036783,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2092046358","doi":"10.1090/s0025-5718-04-01688-6","title":"A convergent difference scheme for the infinity Laplacian: construction of absolutely minimizing Lipschitz extensions","year":2004,"lang":"en","type":"article","venue":"Mathematics of Computation","topic":"Nonlinear Partial Differential Equations","field":"Mathematics","cited_by":107,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Simon Fraser University","funders":"","keywords":"Mathematics; Lipschitz continuity; Uniqueness; Mathematical analysis; Degenerate energy levels; Partial differential equation; Viscosity solution; Elliptic curve; Applied mathematics","retraction":null,"screen_n_in":null,"score":{"opus":0.1033465203931477,"gpt":0.3489103763016562,"spread":0.2455638559085084,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003359684,0.0001542907,0.0003636053,0.00009906739,0.0001436022,0.00002026182,0.0001695859,0.00007798265,0.00001636109],"category_scores_gemma":[0.001191274,0.0001219544,0.0001628075,0.0001995513,0.0001782229,0.00006770514,0.00005675362,0.0001009919,0.000005119033],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003316021,"about_ca_system_score_gemma":0.0001121263,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001826073,"about_ca_topic_score_gemma":0.00002861189,"domain_scores_codex":[0.9985346,0.00003698649,0.0007953864,0.0001466228,0.0003255564,0.00016086],"domain_scores_gemma":[0.9968455,0.001684391,0.0006943255,0.0002751174,0.0004549593,0.00004573007],"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.00005932028,0.0008624629,0.0000732874,0.001097319,0.0002043696,3.567479e-7,0.004042387,0.003519326,0.02088262,0.9660369,0.00007949078,0.003142129],"study_design_scores_gemma":[0.001289267,0.0001523176,0.0009055377,0.0003467929,0.0002207949,0.000009127895,0.000877866,0.1404747,0.02209268,0.8334314,0.00002104374,0.0001784929],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.4138173,0.0000185712,0.5851547,0.0001786465,0.0001526564,0.0005091531,0.00003059845,0.00003084128,0.0001075586],"genre_scores_gemma":[0.5638325,0.000006468509,0.4360369,0.000009506808,0.00003675968,0.00003020837,0.00001317892,0.00001642299,0.00001811814],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.1500151,"threshold_uncertainty_score":0.4973157,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2963347434","doi":"10.1090/s0025-5718-2012-02631-7","title":"ℓ₀ Minimization for wavelet frame based image restoration","year":2012,"lang":"en","type":"article","venue":"Mathematics of Computation","topic":"Image and Signal Denoising Methods","field":"Computer Science","cited_by":98,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"Simon Fraser University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Wavelet; Piecewise; Minification; Frame (networking); Image restoration; Norm (philosophy); Smoothness; Convergence (economics); Image (mathematics); Mathematical optimization; Multiresolution analysis; Algorithm; Image processing; Wavelet transform; Artificial intelligence; Computer science; Discrete wavelet transform; Mathematical analysis","retraction":null,"screen_n_in":null,"score":{"opus":0.03765610048838298,"gpt":0.3198635464808601,"spread":0.2822074459924772,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007849779,0.0000921368,0.0001577231,0.0001275202,0.00006897089,0.00007881544,0.0001899593,0.00005386088,0.000003568962],"category_scores_gemma":[0.000295013,0.00009001001,0.00005928328,0.0002166663,0.00002270575,0.0006644622,0.00002732278,0.00003936761,0.00000936085],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002528354,"about_ca_system_score_gemma":0.00003710964,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000001405456,"about_ca_topic_score_gemma":1.296667e-7,"domain_scores_codex":[0.9990896,0.00007907146,0.0003285048,0.0001142337,0.0002318262,0.00015674],"domain_scores_gemma":[0.998697,0.0005078468,0.0002622209,0.0002046196,0.0002858678,0.0000424335],"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.000141609,0.002771819,0.0001813497,0.003252094,0.0001121563,0.000002749594,0.0258018,0.04366364,0.2548456,0.4965185,0.01143535,0.1612733],"study_design_scores_gemma":[0.0004698491,0.00006657373,0.0001907187,0.00003782161,0.00001351236,0.000001911107,0.0000226726,0.9015552,0.05752035,0.03987364,0.0001434617,0.0001042779],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.008607685,0.00002706494,0.9902259,0.0002134839,0.0002215075,0.0002744367,0.000002503995,0.00006989096,0.0003575054],"genre_scores_gemma":[0.2419289,3.980913e-7,0.7578815,0.00007081512,0.00005201755,0.00001201089,0.0000192286,0.000008769156,0.00002637791],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.8578916,"threshold_uncertainty_score":0.3670502,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2001512608","doi":"10.1090/s0025-5718-05-01804-1","title":"Hybridized globally divergence-free LDG methods. Part I: The Stokes problem","year":2005,"lang":"en","type":"article","venue":"Mathematics of Computation","topic":"Advanced Numerical Methods in Computational Mathematics","field":"Engineering","cited_by":94,"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; University of Minnesota; National Science Foundation","keywords":"Divergence (linguistics); Discretization; Algorithm; Mathematics; Computer science; Mathematical analysis","retraction":null,"screen_n_in":null,"score":{"opus":0.02897475390651265,"gpt":0.3292748126333911,"spread":0.3003000587268785,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009069645,0.0002215471,0.0003713323,0.00007225886,0.00008929649,0.00003863655,0.0005596579,0.00005577533,0.00003522969],"category_scores_gemma":[0.0005466132,0.0001725899,0.0001119797,0.0003456809,0.0001027894,0.0001773751,0.0001377653,0.0001578678,0.00003474502],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00007350924,"about_ca_system_score_gemma":0.00002017281,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":8.256029e-7,"about_ca_topic_score_gemma":8.349563e-7,"domain_scores_codex":[0.9982233,0.0001245153,0.0007826528,0.0001579154,0.0004848376,0.0002267904],"domain_scores_gemma":[0.9971886,0.001908617,0.0002668115,0.0003829016,0.0001936072,0.00005951507],"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.000004325195,0.00009246288,0.000004516711,0.0003573982,0.00007317802,4.736428e-7,0.001020288,0.8663164,0.0007103263,0.02515827,0.001768042,0.1044943],"study_design_scores_gemma":[0.0002024574,0.00002136588,0.00002117945,0.00006818051,0.00003339212,0.000008226306,0.00009087407,0.5877715,0.003435687,0.4067155,0.001492465,0.0001391834],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.005736677,0.0003250337,0.9882165,0.0003182173,0.0002443223,0.0004224268,0.00001297197,0.0002976605,0.004426233],"genre_scores_gemma":[0.03366521,0.00003858919,0.9660129,0.0000491793,0.0001126088,0.00003638033,0.000005807128,0.00004228989,0.00003705893],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.3815572,"threshold_uncertainty_score":0.7038013,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2048276889","doi":"10.1090/s0025-5718-08-02066-8","title":"Fast algorithms for computing isogenies between elliptic curves","year":2008,"lang":"en","type":"article","venue":"Mathematics of Computation","topic":"Cryptography and Residue Arithmetic","field":"Computer Science","cited_by":87,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Western University","funders":"Agence Nationale de la Recherche","keywords":"Mathematics; Isogeny; Elliptic curve; Prime (order theory); Degree (music); Algorithm; Field (mathematics); Schoof's algorithm; Power series; Finite field; Discrete mathematics; Pure mathematics; Combinatorics; Mathematical analysis; Quarter period","retraction":null,"screen_n_in":null,"score":{"opus":0.04918734259861358,"gpt":0.2914900139444828,"spread":0.2423026713458692,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002864839,0.0001293722,0.0002924003,0.0001611927,0.0001776567,0.00002992766,0.0003968093,0.00004478625,0.000001065633],"category_scores_gemma":[0.00005100951,0.0001200611,0.0001396866,0.0003734336,0.00009263838,0.000178069,0.0000902113,0.00006102258,0.000005855862],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000009480763,"about_ca_system_score_gemma":0.00003415108,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000003523888,"about_ca_topic_score_gemma":3.225047e-7,"domain_scores_codex":[0.9988524,0.00002958972,0.0004445702,0.0001990998,0.0002861919,0.0001881979],"domain_scores_gemma":[0.9986371,0.0006258401,0.0002685123,0.0002206352,0.0001997606,0.00004812714],"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.00003030805,0.00325653,0.009673555,0.02110512,0.001531467,0.00004666866,0.08779833,0.1474749,0.003826084,0.3157562,0.009674973,0.3998259],"study_design_scores_gemma":[0.0004957641,0.0001874915,0.003866001,0.0003837516,0.00004199034,0.00003552192,0.00009828119,0.9412798,0.004388957,0.04892794,0.00004186077,0.0002525871],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.07772832,0.0003976023,0.9210101,0.0001824004,0.0001004448,0.0003186227,0.000005362724,0.000103334,0.0001538482],"genre_scores_gemma":[0.4817684,0.00003066333,0.518104,0.00002481745,0.00004031906,0.000004638128,0.000008288127,0.000007662641,0.0000111808],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.793805,"threshold_uncertainty_score":0.4895949,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2048908137","doi":"10.1090/s0025-5718-09-02255-8","title":"Two-cover descent on hyperelliptic curves","year":2009,"lang":"en","type":"article","venue":"Mathematics of Computation","topic":"Algebraic Geometry and Number Theory","field":"Mathematics","cited_by":84,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"Simon Fraser University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Descent (aeronautics); Cover (algebra); Hyperelliptic curve; Applied mathematics; Pure mathematics; Algebra over a field; Geography","retraction":null,"screen_n_in":null,"score":{"opus":0.03759851546770775,"gpt":0.3147224846851815,"spread":0.2771239692174738,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000483673,0.0001612734,0.0003183713,0.0001104042,0.000049721,0.00001468845,0.0001513726,0.00004862511,0.000100096],"category_scores_gemma":[0.0003401175,0.0001425839,0.0001008187,0.0002057575,0.00003755881,0.000082309,0.00001781937,0.0001075429,0.000144017],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002905355,"about_ca_system_score_gemma":0.0000181289,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":6.035738e-7,"about_ca_topic_score_gemma":1.077626e-7,"domain_scores_codex":[0.9987878,0.0000558758,0.0004590331,0.0001496957,0.0003817986,0.0001657487],"domain_scores_gemma":[0.9986017,0.000698954,0.0002868216,0.0002564442,0.0001057108,0.0000503593],"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.00006131644,0.002255126,0.00003130051,0.001855564,0.00008709275,0.000007184452,0.00189045,0.001835763,0.001551783,0.9763394,0.0059308,0.008154232],"study_design_scores_gemma":[0.0004924472,0.0002301221,0.0001513543,0.0007817965,0.00006327148,0.000012442,0.0001087467,0.005767677,0.008194916,0.9840073,0.00002260402,0.0001673413],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.8322824,0.0001526291,0.1382863,0.0003976854,0.0001289005,0.00043537,0.000003858876,0.0001329147,0.02818003],"genre_scores_gemma":[0.9574753,0.000018991,0.04186507,0.0003030357,0.00004299412,0.000003292488,0.000006656036,0.00001703295,0.0002676159],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.125193,"threshold_uncertainty_score":0.5814403,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2148206455","doi":"10.1090/s0025-5718-2010-02407-x","title":"A proof of Dejean’s conjecture","year":2010,"lang":"en","type":"article","venue":"Mathematics of Computation","topic":"Analytic Number Theory Research","field":"Mathematics","cited_by":82,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Winnipeg","funders":"Natural Sciences and Engineering Research Council of Canada; Western Canada Research Grid","keywords":"Conjecture; Mathematics; Combinatorics; Pure mathematics; Discrete mathematics","retraction":null,"screen_n_in":null,"score":{"opus":0.04013396915795872,"gpt":0.3566230848938615,"spread":0.3164891157359028,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008115668,0.0001132495,0.0003511714,0.0001305313,0.00002728699,0.00001047046,0.0002204032,0.0000908129,0.0001504509],"category_scores_gemma":[0.0009036093,0.00009608751,0.00009349751,0.0001988503,0.0001541668,0.00005864634,0.00006114977,0.0001984237,0.000008633639],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001042867,"about_ca_system_score_gemma":0.00006511434,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000004170804,"about_ca_topic_score_gemma":0.00001241272,"domain_scores_codex":[0.9987212,0.00004257597,0.0005333818,0.0001170774,0.0004420494,0.0001437364],"domain_scores_gemma":[0.9978878,0.001035397,0.0004099159,0.0003057123,0.0003129391,0.00004819507],"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.00002505324,0.0007945822,0.0002682237,0.002309344,0.000129503,0.000002845904,0.004573886,0.0002224404,0.0234396,0.9633008,0.0008852573,0.004048495],"study_design_scores_gemma":[0.000330917,0.0000679025,0.00004595767,0.00007742421,0.00004257747,0.00001463516,0.000226598,0.02998741,0.0584501,0.91065,0.00002044325,0.00008600779],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.726248,0.000006265199,0.267516,0.00007674029,0.00005566829,0.0003340594,0.000005978116,0.00002930085,0.005727997],"genre_scores_gemma":[0.8358858,2.975498e-7,0.1638442,0.000003668513,0.00002396679,0.000006256914,0.000003214033,0.00002096604,0.0002116609],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.1096377,"threshold_uncertainty_score":0.3918335,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2009673783","doi":"10.1090/s0025-5718-06-01815-1","title":"Locking-free adaptive discontinuous Galerkin FEM for linear elasticity problems","year":2006,"lang":"en","type":"article","venue":"Mathematics of Computation","topic":"Advanced Numerical Methods in Computational Mathematics","field":"Engineering","cited_by":77,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"McGill University","funders":"Schweizerischer Nationalfonds zur Förderung der Wissenschaftlichen Forschung; National Science Foundation","keywords":"Mathematics; Finite element method; Linear elasticity; Discontinuous Galerkin method; Polygon mesh; A priori and a posteriori; Galerkin method; Robustness (evolution); Elasticity (physics); Compressibility; Applied mathematics; Mathematical optimization; Mathematical analysis; Geometry; Structural engineering; Mechanics","retraction":null,"screen_n_in":null,"score":{"opus":0.02686040646853365,"gpt":0.2742122395938992,"spread":0.2473518331253656,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002442626,0.0002111089,0.0003970504,0.0001072446,0.00005245287,0.00001965373,0.0002129062,0.00007308448,0.000004057468],"category_scores_gemma":[0.0003196924,0.0002098237,0.0001054783,0.0002179352,0.00006595546,0.000111329,0.00004756264,0.0001039951,0.00000610811],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0000635218,"about_ca_system_score_gemma":0.00001351983,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000002310024,"about_ca_topic_score_gemma":0.000002053348,"domain_scores_codex":[0.9986124,0.00002340069,0.0006909333,0.0001630294,0.0002933616,0.000216859],"domain_scores_gemma":[0.9977023,0.001562959,0.0002562868,0.0002025771,0.0002380751,0.00003777858],"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.000006300465,0.0001380553,0.000007959638,0.0008554951,0.00003126467,4.352791e-7,0.0002534485,0.9694135,0.0008437877,0.02550482,0.0002564846,0.002688435],"study_design_scores_gemma":[0.0002639634,0.00006050129,0.00005205773,0.0001162384,0.00002306119,0.000002808188,0.00003765838,0.5705305,0.001760398,0.4269944,0.00003303155,0.0001254703],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.02480852,0.00007448192,0.9728228,0.00002223384,0.0001762127,0.0006337549,0.00004190358,0.0002597991,0.001160287],"genre_scores_gemma":[0.3652676,0.000001143621,0.6345182,0.000003549642,0.00008317272,0.00004416242,0.00001613897,0.00004432964,0.00002167932],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.4014896,"threshold_uncertainty_score":0.8556361,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1963612676","doi":"10.1090/s0025-5718-2011-02442-7","title":"Geometric weakly admissible meshes, discrete least squares approximations and approximate Fekete points","year":2011,"lang":"en","type":"article","venue":"Mathematics of Computation","topic":"Advanced Numerical Analysis Techniques","field":"Engineering","cited_by":74,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Calgary","funders":"Natural Sciences and Engineering Research Council of Canada; Gruppo Nazionale per il Calcolo Scientifico; Università degli Studi di Padova; Istituto Nazionale di Alta Matematica \"Francesco Severi\"","keywords":"Mathematics; Polygon mesh; Interpolation (computer graphics); Factorization; Lagrange polynomial; Applied mathematics; Mathematical analysis; Algorithm; Geometry; Image (mathematics); Computer science","retraction":null,"screen_n_in":null,"score":{"opus":0.0229928913247207,"gpt":0.2437091432089181,"spread":0.2207162518841974,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001531843,0.000154425,0.00029078,0.0003326631,0.00004520476,0.0000219271,0.0001149437,0.00005148537,0.00002685122],"category_scores_gemma":[0.00008020156,0.0001436567,0.00005695017,0.0005591922,0.00005442608,0.0002309676,0.0000446975,0.00008324638,0.000008162237],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002346624,"about_ca_system_score_gemma":0.000005441647,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00000536312,"about_ca_topic_score_gemma":0.000001005268,"domain_scores_codex":[0.9990897,0.00001655564,0.0004131748,0.0001374832,0.0001907345,0.0001523781],"domain_scores_gemma":[0.9994496,0.00009157557,0.0001408354,0.0001692307,0.00007778651,0.00007093881],"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.0001473951,0.002983395,0.003605401,0.02405211,0.002381314,0.00002910611,0.04628316,0.2767944,0.0410912,0.1978198,0.003398178,0.4014145],"study_design_scores_gemma":[0.0001540054,0.00005963244,0.0006610968,0.00009611222,0.00006622588,0.000006388014,0.0002249231,0.8369919,0.01944402,0.1420555,0.00002594731,0.0002142528],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.05158677,0.0001720799,0.9438803,0.00001533412,0.00001825132,0.0002069542,0.000007769538,0.0003471003,0.003765501],"genre_scores_gemma":[0.6138173,0.0000304339,0.3860781,0.000003409461,0.000005596484,0.00001699724,0.00001075524,0.00002149633,0.0000159459],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.5622305,"threshold_uncertainty_score":0.585815,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1906421350","doi":"10.1090/mcom/3046","title":"Rigorous numerics for analytic solutions of differential equations: the radii polynomial approach","year":2015,"lang":"en","type":"article","venue":"Mathematics of Computation","topic":"Numerical Methods and Algorithms","field":"Computer Science","cited_by":73,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Université Laval","funders":"National Science Foundation","keywords":"Mathematics; Homoclinic orbit; Nonlinear system; Polynomial; Ordinary differential equation; Bounding overwatch; Operator (biology); Interval arithmetic; Mathematical analysis; Applied mathematics; Differential equation; Partial differential equation","retraction":null,"screen_n_in":null,"score":{"opus":0.1111380474367099,"gpt":0.3245036518008521,"spread":0.2133656043641421,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005896824,0.00009227206,0.0002457177,0.00007814026,0.00008180069,0.00004391964,0.0004175785,0.00003455238,7.679932e-7],"category_scores_gemma":[0.0003402654,0.00006536754,0.0001033199,0.0003517173,0.00008094425,0.0001277421,0.00009627517,0.00005267718,0.000001499668],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002430195,"about_ca_system_score_gemma":0.00007596245,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001240695,"about_ca_topic_score_gemma":2.753434e-7,"domain_scores_codex":[0.9989102,0.00008146318,0.0004276977,0.0001377457,0.0002991417,0.0001437798],"domain_scores_gemma":[0.9983257,0.0007383961,0.0003631569,0.0002602477,0.0002609901,0.00005150959],"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.00003714091,0.002650949,0.000027256,0.0006553591,0.0003109235,5.444034e-7,0.01579138,0.1200998,0.001763332,0.5868234,0.00364263,0.2681973],"study_design_scores_gemma":[0.0003402603,0.0001087906,0.00003520021,0.00001095254,0.00003190614,0.000002310962,0.0001624879,0.9252053,0.0002565973,0.07374214,0.0000361544,0.00006786462],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.00176306,0.00006342288,0.9971657,0.0002039453,0.0002105372,0.0003398341,0.000006890002,0.00002957945,0.0002170056],"genre_scores_gemma":[0.3733534,7.141954e-7,0.626553,0.000008966245,0.00003980935,0.00001695493,0.000005102578,0.000005104097,0.00001695032],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.8051056,"threshold_uncertainty_score":0.2665611,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2061405134","doi":"10.1090/s0025-5718-07-02048-0","title":"The double-base number system and its application to elliptic curve cryptography","year":2007,"lang":"en","type":"article","venue":"Mathematics of Computation","topic":"Cryptography and Residue Arithmetic","field":"Computer Science","cited_by":66,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Calgary","funders":"Natural Sciences and Engineering Research Council of Canada; Centre National de la Recherche Scientifique; University of Calgary","keywords":"Scalar multiplication; Mathematics; Elliptic curve; Elliptic curve cryptography; Elliptic curve point multiplication; Side channel attack; Edwards curve; Multiplication (music); Cryptography; Scalar (mathematics); Schoof's algorithm; Base (topology); Binary number; Point (geometry); Arithmetic; Algorithm; Pure mathematics; Combinatorics; Computer science; Public-key cryptography; Mathematical analysis; Encryption; Quarter period; Geometry","retraction":null,"screen_n_in":null,"score":{"opus":0.01174996913210005,"gpt":0.2629183333873865,"spread":0.2511683642552864,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000879121,0.0001087375,0.0001405646,0.0001417751,0.000189525,0.00009856753,0.0003196486,0.00004319193,3.664501e-7],"category_scores_gemma":[0.00001437499,0.00008093512,0.000058519,0.0007350962,0.00004032045,0.0001224918,0.00008479853,0.00006147693,0.00002568671],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001430205,"about_ca_system_score_gemma":0.00001306845,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000006435463,"about_ca_topic_score_gemma":0.000006376189,"domain_scores_codex":[0.9989183,0.00002595856,0.0003824173,0.0001917588,0.0003012854,0.0001803019],"domain_scores_gemma":[0.9988272,0.0004345061,0.000184856,0.0002711896,0.0001977481,0.00008445281],"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.000013731,0.00007785434,0.0001873287,0.0002442732,0.00002110534,0.000001332432,0.001627745,0.001581315,0.0008635341,0.980492,0.00003221965,0.01485755],"study_design_scores_gemma":[0.00125183,0.0001868405,0.006727315,0.0002943529,0.00005760686,0.00007483737,0.001017109,0.8697045,0.01657752,0.1032728,0.0003832679,0.0004519926],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.147756,0.0001749605,0.8505381,0.0001528769,0.00009020854,0.0004416603,6.708756e-7,0.00008118066,0.000764353],"genre_scores_gemma":[0.880784,0.000007817996,0.1191374,0.00001794351,0.00002133137,0.00001878279,0.000001135795,0.000007267955,0.000004369998],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.8772192,"threshold_uncertainty_score":0.3300439,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1984582452","doi":"10.1090/s0025-5718-00-01282-5","title":"Period of the power generator and small values of Carmichael’s function","year":2000,"lang":"lv","type":"article","venue":"Mathematics of Computation","topic":"Chaos-based Image/Signal Encryption","field":"Computer Science","cited_by":66,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Toronto","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Algorithm; Materials science; Computer science","retraction":null,"screen_n_in":null,"score":{"opus":0.01521681275199926,"gpt":0.226492021710375,"spread":0.2112752089583757,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005326947,0.000194944,0.0003898339,0.0001205135,0.00008237967,0.00004856166,0.000332634,0.00009409405,0.00006304472],"category_scores_gemma":[0.00006131205,0.0001627334,0.0001374493,0.0003963073,0.0002413924,0.0002163989,0.0001131289,0.000108729,0.000007669732],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003503331,"about_ca_system_score_gemma":0.0001208167,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00003397739,"about_ca_topic_score_gemma":0.000004125095,"domain_scores_codex":[0.9981551,0.0001511256,0.0007944084,0.0002522061,0.0004928194,0.0001543555],"domain_scores_gemma":[0.9982303,0.0001844378,0.0007141244,0.0004130219,0.0004116984,0.00004645818],"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.000360085,0.003213061,0.001079543,0.007822414,0.0006287867,0.000006195809,0.1301516,0.1959008,0.3849326,0.06892518,0.0008496356,0.2061302],"study_design_scores_gemma":[0.0009240809,0.0006295484,0.005201543,0.0006474509,0.0001758508,0.00002460048,0.0005394404,0.9003364,0.05281129,0.03841293,0.00003853933,0.0002583638],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.7020525,0.0003279719,0.29665,0.0001376376,0.0002100808,0.0002852557,0.00001220467,0.00001667619,0.0003076567],"genre_scores_gemma":[0.9529248,0.00002258128,0.04684425,0.00003400414,0.00003310927,0.000003457384,0.000003736093,0.00001672734,0.000117354],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.7044356,"threshold_uncertainty_score":0.6636074,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2052917298","doi":"10.1090/s0025-5718-01-01363-1","title":"Computing discrete logarithms in high-genus hyperelliptic Jacobians in provably subexponential time","year":2001,"lang":"en","type":"article","venue":"Mathematics of Computation","topic":"Cryptography and Residue Arithmetic","field":"Computer Science","cited_by":64,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":false,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"","funders":"University of Waterloo","keywords":"Mathematics; Logarithm; Genus; Finite field; Combinatorics; Discrete logarithm; Field (mathematics); Binary logarithm; Discrete mathematics; Mathematical analysis; Pure mathematics; Computer science","retraction":null,"screen_n_in":null,"score":{"opus":0.008492376036877417,"gpt":0.2311297978497164,"spread":0.2226374218128389,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004708964,0.0001565738,0.0003257221,0.0004825104,0.00004828333,0.00007392118,0.0004261533,0.00007769776,0.000005874892],"category_scores_gemma":[0.00003712939,0.0001528464,0.00007272125,0.0009780764,0.00005971064,0.0002458827,0.0001324622,0.0001512702,0.00002896981],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003676471,"about_ca_system_score_gemma":0.00003842995,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000107579,"about_ca_topic_score_gemma":0.00004970524,"domain_scores_codex":[0.99843,0.00008510302,0.0006062474,0.0002790132,0.0003172119,0.0002824259],"domain_scores_gemma":[0.9991742,0.0002427259,0.0002171733,0.0002549543,0.00006588706,0.0000450285],"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.00008552998,0.003901027,0.01322357,0.001237005,0.0001386336,0.0005017782,0.03308444,0.7364379,0.01193425,0.1026777,0.0001822257,0.096596],"study_design_scores_gemma":[0.0008016802,0.00009282313,0.01279467,0.0002007809,0.000008036871,0.00003634198,0.00008741951,0.9496947,0.0003522685,0.03573433,0.00001027719,0.0001866658],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.5004359,0.00003254609,0.4988671,0.0001416623,0.00007446665,0.0001940911,7.320725e-7,0.00004023963,0.0002132351],"genre_scores_gemma":[0.8218463,0.000007705693,0.1780694,0.00001526641,0.00001990922,0.000004122904,0.000005962196,0.00001064026,0.00002071783],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.3214104,"threshold_uncertainty_score":0.6232893,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2053957691","doi":"10.1090/s0025-5718-07-01955-2","title":"A search for Fibonacci-Wieferich and Wolstenholme primes","year":2007,"lang":"en","type":"article","venue":"Mathematics of Computation","topic":"Analytic Number Theory Research","field":"Mathematics","cited_by":60,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Calgary; University of Regina","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Fibonacci number; Mathematics; Prime (order theory); Combinatorics; Modulo; Quotient; Arithmetic; Discrete mathematics","retraction":null,"screen_n_in":null,"score":{"opus":0.07774741676647924,"gpt":0.3979644036053545,"spread":0.3202169868388753,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002595016,0.0001294232,0.0003214682,0.0001794114,0.00007465406,0.00003161997,0.0001454986,0.00007588117,0.00001878739],"category_scores_gemma":[0.0005006248,0.0001172825,0.0000710967,0.0002066483,0.0001036589,0.00008600731,0.0000813809,0.00009724354,0.000007346067],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0000361859,"about_ca_system_score_gemma":0.00004404423,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000004048886,"about_ca_topic_score_gemma":0.0000026762,"domain_scores_codex":[0.9985798,0.000036183,0.0005129033,0.0001749825,0.0004188519,0.0002772963],"domain_scores_gemma":[0.9959144,0.003276666,0.0001740249,0.0001980453,0.0003536821,0.00008315415],"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.0001656328,0.000663504,0.001426306,0.003937179,0.0002080746,0.000004979152,0.008448012,0.0001022075,0.005556057,0.9590269,0.001064049,0.01939714],"study_design_scores_gemma":[0.0008106488,0.000177536,0.0004971671,0.0001342999,0.00005797592,0.0000202912,0.001578251,0.03990281,0.02411394,0.9324747,0.00005971355,0.0001726876],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.4858266,0.00002593773,0.5115449,0.00006435566,0.00001700414,0.0004507206,0.000003843965,0.00003294403,0.002033619],"genre_scores_gemma":[0.7261862,0.000002674954,0.2733258,0.000009962288,0.000033247,0.000009939351,0.000005378767,0.00002857037,0.0003982471],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.2403596,"threshold_uncertainty_score":0.4782642,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2000840326","doi":"10.1090/s0025-5718-05-01769-2","title":"Minimality and other properties of the width-𝑤 nonadjacent form","year":2005,"lang":"lv","type":"article","venue":"Mathematics of Computation","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":60,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Algorithm; Annotation; Computer science; Artificial intelligence","retraction":null,"screen_n_in":null,"score":{"opus":0.03504730502769028,"gpt":0.245026918921621,"spread":0.2099796138939307,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006316702,0.0001426852,0.0002544149,0.00006865941,0.00009734302,0.00005377376,0.0004004695,0.00005586334,0.000007391616],"category_scores_gemma":[0.00004707024,0.00009894112,0.000120654,0.0002613931,0.0002701187,0.0001734173,0.0002290197,0.00007880965,0.000003461963],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001568277,"about_ca_system_score_gemma":0.00004419689,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000009518064,"about_ca_topic_score_gemma":0.000009771411,"domain_scores_codex":[0.9987409,0.00008643536,0.0005245334,0.0001696685,0.0003355156,0.0001430056],"domain_scores_gemma":[0.9988602,0.0001307657,0.0004900483,0.0003397485,0.0001444848,0.00003468444],"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.00008105337,0.001702619,0.001775162,0.003958866,0.0002246296,3.841091e-7,0.09957519,0.002860186,0.01384203,0.725988,0.0002508127,0.149741],"study_design_scores_gemma":[0.0007658994,0.0002501457,0.00335586,0.00149545,0.0001145093,0.00001691658,0.0008147842,0.6632863,0.06050566,0.2683966,0.0006723909,0.0003254586],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.8505498,0.0004794526,0.146888,0.0006665012,0.0001242483,0.0003219909,0.000006084907,0.00002051217,0.0009434479],"genre_scores_gemma":[0.9573113,0.000008074733,0.04251076,0.00008648454,0.00003099433,0.000003673245,1.860854e-7,0.000008777182,0.00003975626],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.6604261,"threshold_uncertainty_score":0.4034702,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2050724454","doi":"10.1090/s0025-5718-00-01262-x","title":"Tensor product Gauss-Lobatto points are Fekete points for the cube","year":2000,"lang":"en","type":"article","venue":"Mathematics of Computation","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":59,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Calgary","funders":"","keywords":"Tensor product; Mathematics; Simplex; Tensor (intrinsic definition); Quadrature (astronomy); Pure mathematics; Geometry","retraction":null,"screen_n_in":null,"score":{"opus":0.02062821264115689,"gpt":0.2670022820283079,"spread":0.246374069387151,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007667263,0.0001390509,0.0002189086,0.00005678636,0.0001546831,0.0001080554,0.0006201664,0.00003268246,0.00004759129],"category_scores_gemma":[0.0001323871,0.00009849901,0.00009869943,0.0002345289,0.00005455954,0.0002632644,0.00006191352,0.00006963213,0.00008503778],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001499408,"about_ca_system_score_gemma":0.00002458671,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00000202749,"about_ca_topic_score_gemma":6.121141e-7,"domain_scores_codex":[0.998849,0.0000579489,0.0003781478,0.0002409959,0.0002808263,0.0001931335],"domain_scores_gemma":[0.9985047,0.0005685406,0.000252911,0.0004572827,0.0001764671,0.00004009657],"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.00009174332,0.001016449,0.00007651027,0.001481093,0.0002321242,0.000008262577,0.009285466,0.0238086,0.000480389,0.365423,0.009069896,0.5890265],"study_design_scores_gemma":[0.0004444952,0.00007666767,0.0004517847,0.0001025121,0.00002580368,0.00002234044,0.0000929567,0.6344751,0.003016946,0.3598916,0.001230048,0.0001697129],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.03453549,0.000100959,0.9604598,0.002942457,0.0002040467,0.0007136326,0.00001078105,0.0001091541,0.0009236931],"genre_scores_gemma":[0.4838411,0.00001646427,0.5146637,0.0002701737,0.0001550262,0.00005192915,0.0000062639,0.00002314021,0.0009722079],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.6106665,"threshold_uncertainty_score":0.4016673,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2092129801","doi":"10.1090/s0025-5718-04-01635-7","title":"Absorbing boundary conditions for the wave equation and parallel computing","year":2004,"lang":"en","type":"article","venue":"Mathematics of Computation","topic":"Electromagnetic Simulation and Numerical Methods","field":"Engineering","cited_by":57,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"McGill University","funders":"","keywords":"Waveform; Mathematics; Boundary value problem; Boundary (topology); Truncation (statistics); Computation; Relaxation (psychology); Wave equation; Singular boundary method; Mathematical analysis; Applied mathematics; Algorithm; Computer science; Boundary element method; Finite element method","retraction":null,"screen_n_in":null,"score":{"opus":0.04045567179797793,"gpt":0.3042376302594416,"spread":0.2637819584614637,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000187125,0.0000609326,0.00009971451,0.00003654665,0.00009254573,0.00002511871,0.00002904173,0.0000255489,0.000003788178],"category_scores_gemma":[0.00007274619,0.000051201,0.00002701973,0.0000809065,0.00003511538,0.00004187521,0.000007035017,0.00004167438,9.701018e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001831195,"about_ca_system_score_gemma":0.000008220572,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000001611339,"about_ca_topic_score_gemma":4.54031e-7,"domain_scores_codex":[0.9995667,0.000009779788,0.0002123381,0.00005215009,0.00008089731,0.00007810118],"domain_scores_gemma":[0.9989834,0.0008389358,0.00005763236,0.00005254295,0.00004992728,0.00001751881],"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.000002068737,0.00001960239,0.0000051,0.0001493146,0.00002308326,8.933879e-8,0.001296074,0.9537907,0.002529033,0.02698866,0.00002173828,0.01517448],"study_design_scores_gemma":[0.0003279095,0.00003980675,0.0007766897,0.00003047603,0.00001865467,0.000002982356,0.00009070924,0.8344946,0.0006295979,0.1635255,0.00001468917,0.00004839457],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1543355,0.0001196402,0.8448851,0.0001031746,0.00005855118,0.0002218822,0.000001717974,0.00005845681,0.0002159602],"genre_scores_gemma":[0.6924378,0.000006051745,0.3074991,0.00001565161,0.00001705717,0.00000622822,0.000007163593,0.000008475138,0.00000257558],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.5381022,"threshold_uncertainty_score":0.2087916,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2036507234","doi":"10.1090/s0025-5718-05-01794-1","title":"On monotonicity and boundedness properties of linear multistep methods","year":2005,"lang":"en","type":"article","venue":"Mathematics of Computation","topic":"Numerical methods for differential equations","field":"Mathematics","cited_by":53,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"Simon Fraser University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Monotonic function; Mathematics; Linear multistep method; Applied mathematics; Nonlinear system; Focus (optics); Stability (learning theory); Runge–Kutta methods; Calculus (dental); Mathematical analysis; Numerical analysis; Differential equation; Computer science","retraction":null,"screen_n_in":null,"score":{"opus":0.1212551847545832,"gpt":0.4248783118106237,"spread":0.3036231270560405,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006661426,0.0001339521,0.0004168248,0.0001054761,0.0000557955,0.00001241204,0.000100507,0.00006507669,0.000007845992],"category_scores_gemma":[0.001448249,0.0001098377,0.00007112861,0.0001308028,0.0001223018,0.00008081698,0.00005030741,0.0000890595,0.000002210467],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002732069,"about_ca_system_score_gemma":0.00002060217,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000006723195,"about_ca_topic_score_gemma":0.00000313716,"domain_scores_codex":[0.9987014,0.0001794162,0.0006223801,0.0001377353,0.0002490181,0.0001100446],"domain_scores_gemma":[0.9978511,0.001285868,0.0004464742,0.0001908343,0.0001839908,0.00004170914],"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.00008620285,0.00242662,0.00002626411,0.003430062,0.0001926305,3.26776e-7,0.01475083,0.004573127,0.08201201,0.5972614,0.00001688388,0.2952237],"study_design_scores_gemma":[0.0003149877,0.00009471989,0.00004474823,0.000174082,0.00005541503,0.000001646571,0.0001528801,0.2873312,0.1041,0.6076283,0.000008568003,0.00009339047],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.4030887,0.00002538005,0.5963549,0.00004408305,0.00003094747,0.0002303228,0.000001849979,0.0000261262,0.0001976418],"genre_scores_gemma":[0.4359548,0.00000217498,0.5639729,0.000006105171,0.00001012027,0.000008591685,9.356694e-7,0.00001315991,0.00003113322],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.2951303,"threshold_uncertainty_score":0.4479052,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2594047390","doi":"10.1090/mcom/3261","title":"Corrigendum to \\lq\\lq Conditional bounds for the least quadratic non-residue and related problems\\rq\\rq","year":2017,"lang":"en","type":"erratum","venue":"Mathematics of Computation","topic":"Analytic Number Theory Research","field":"Mathematics","cited_by":53,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"York University","funders":"Natural Sciences and Engineering Research Council of Canada; Simons Foundation; National Science Foundation","keywords":"Mathematics; Residue (chemistry); Quadratic equation; Applied mathematics; Quadratic residue; Combinatorics; Chemistry","retraction":null,"screen_n_in":null,"score":{"opus":0.08729605179255123,"gpt":0.373097258113363,"spread":0.2858012063208117,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.002173548,0.0005246459,0.001104655,0.0003258291,0.000694457,0.0003423528,0.0008683117,0.0004892955,0.0001555219],"category_scores_gemma":[0.002218645,0.000413715,0.0002730938,0.0002075791,0.0004735888,0.0001685487,0.0002768433,0.0007120537,0.00008450185],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000145335,"about_ca_system_score_gemma":0.0005335271,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00003232589,"about_ca_topic_score_gemma":0.0001069391,"domain_scores_codex":[0.9964433,0.0001274458,0.001290684,0.0005103,0.001127774,0.0005004437],"domain_scores_gemma":[0.9940785,0.002325698,0.001542239,0.0009434313,0.0009310003,0.0001791702],"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.00003741736,0.000336602,0.00001072652,0.007002454,0.0007588778,0.000005859069,0.00474387,0.0003948344,0.00005185931,0.1208095,0.8652895,0.000558463],"study_design_scores_gemma":[0.0007613496,0.0002254478,0.0000967409,0.001472523,0.0005087046,0.0000486374,0.0005772043,0.158328,0.00004519683,0.833043,0.004473872,0.0004193849],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"other","genre_scores_codex":[0.002473901,0.0005168589,0.9226418,0.002948812,0.008775034,0.009893534,0.0008104833,0.0002073081,0.05173224],"genre_scores_gemma":[0.1319737,0.0001165001,0.08439671,0.0001586906,0.001530897,0.001230073,0.002092455,0.0006493402,0.7778516],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8608156,"threshold_uncertainty_score":0.9998315,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2014937115","doi":"10.1090/s0025-5718-00-01283-7","title":"On the distribution of the power generator","year":2000,"lang":"lv","type":"article","venue":"Mathematics of Computation","topic":"Chaos-based Image/Signal Encryption","field":"Computer Science","cited_by":50,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Toronto","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Algorithm; Computer science; Artificial intelligence","retraction":null,"screen_n_in":null,"score":{"opus":0.01495320323212815,"gpt":0.2381929573223819,"spread":0.2232397540902537,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000744266,0.0002008776,0.0002608678,0.00004580311,0.0001733281,0.00009111651,0.0007413058,0.00008261465,0.000191245],"category_scores_gemma":[0.0001968297,0.0001260563,0.0001914493,0.0006087804,0.000200973,0.0001810934,0.00009773728,0.0001835068,0.000107438],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00008386349,"about_ca_system_score_gemma":0.0001145596,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001340965,"about_ca_topic_score_gemma":0.000001076678,"domain_scores_codex":[0.9978481,0.0002361723,0.0006874819,0.0002346565,0.0008003362,0.0001932638],"domain_scores_gemma":[0.9976752,0.0007184105,0.0005882797,0.0006730171,0.0003054682,0.00003957419],"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.00007440046,0.001813794,0.00003158649,0.0005543613,0.000139964,0.000002653089,0.01011564,0.2336379,0.01223466,0.6947502,0.009927765,0.03671714],"study_design_scores_gemma":[0.0003848008,0.0002447577,0.001312735,0.0004356208,0.00004720587,0.000007193434,0.00007880881,0.8699874,0.02832514,0.09884796,0.0001555997,0.0001728262],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.5729714,0.00004994796,0.4241816,0.001258421,0.0002439518,0.0004064114,0.00003735484,0.00002335953,0.0008275669],"genre_scores_gemma":[0.9944448,0.000007592905,0.005163733,0.0001571615,0.00003847783,0.000007621958,0.00001339832,0.00001443522,0.0001527255],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.6363495,"threshold_uncertainty_score":0.5140426,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2091356782","doi":"10.1090/s0025-5718-05-01748-5","title":"Algorithms for hyperbolic quadratic eigenvalue problems","year":2005,"lang":"en","type":"article","venue":"Mathematics of Computation","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":47,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Calgary; University of Regina","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Positive-definite matrix; Eigenvalues and eigenvectors; Mathematics; Hermitian matrix; Quadratic equation; Lambda; Matrix (chemical analysis); Pure mathematics; Mathematical analysis; Applied mathematics; Combinatorics; Geometry; Quantum mechanics; Physics","retraction":null,"screen_n_in":null,"score":{"opus":0.03144884872393362,"gpt":0.2860411006219882,"spread":0.2545922518980546,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005610693,0.0001289197,0.0002365262,0.0001100179,0.00008345843,0.0000767728,0.0004290847,0.00004831364,0.000006603248],"category_scores_gemma":[0.00005701628,0.0001179648,0.00009178305,0.0002167006,0.00003276939,0.0003677329,0.00006371021,0.00005099655,0.00003525514],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0000225242,"about_ca_system_score_gemma":0.00003942409,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000001667826,"about_ca_topic_score_gemma":8.747042e-7,"domain_scores_codex":[0.9988902,0.00003437181,0.000453348,0.0001967986,0.0002400967,0.0001852282],"domain_scores_gemma":[0.9989641,0.0003078572,0.000251561,0.0002701526,0.0001550787,0.00005119859],"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.000003667524,0.0005562009,0.000004150697,0.0007017743,0.0000473484,6.278532e-7,0.006974253,0.06736103,0.001621763,0.6828353,0.0003852646,0.2395086],"study_design_scores_gemma":[0.0002764967,0.00008034603,0.000009687962,0.00004012856,0.000009591875,0.000008260365,0.00003438066,0.7576169,0.004058016,0.2373231,0.0004349951,0.0001081049],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.01100398,0.00009461096,0.9870099,0.0003871502,0.00012698,0.0004940351,0.000003841608,0.000117191,0.0007623402],"genre_scores_gemma":[0.2774735,0.000003418077,0.7222024,0.00004584862,0.00008992627,0.00003574906,0.000005180352,0.0000111463,0.0001328404],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.6902559,"threshold_uncertainty_score":0.4810464,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2086333750","doi":"10.1090/s0025-5718-01-01306-0","title":"On the computation of all extensions of a 𝑝-adic field of a given degree","year":2001,"lang":"lv","type":"article","venue":"Mathematics of Computation","topic":"advanced mathematical theories","field":"Mathematics","cited_by":45,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"Concordia University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Algorithm; Annotation; Computer science; Artificial intelligence; Mathematics","retraction":null,"screen_n_in":null,"score":{"opus":0.09292717424728529,"gpt":0.3585904859363687,"spread":0.2656633116890834,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.001232103,0.0003950955,0.001394434,0.0003085349,0.00007143675,0.00001374928,0.0004678125,0.0002234257,0.0001115182],"category_scores_gemma":[0.004848042,0.0003052745,0.0003881712,0.0006355053,0.0005170451,0.0001322235,0.0001763606,0.0002708451,0.00001606181],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004427147,"about_ca_system_score_gemma":0.00009283865,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001551051,"about_ca_topic_score_gemma":0.000005485451,"domain_scores_codex":[0.9957021,0.0002519052,0.002455403,0.0002753368,0.001011189,0.0003040158],"domain_scores_gemma":[0.9814601,0.01347867,0.003243758,0.0007090619,0.00103091,0.00007748636],"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.0002447722,0.002845937,0.00001900611,0.00786813,0.0004662289,0.000005167021,0.0158217,0.01353278,0.005958252,0.9476691,0.0006418027,0.004927132],"study_design_scores_gemma":[0.0007211796,0.0008903579,0.00005292315,0.003412097,0.0003870292,0.00001737538,0.002297814,0.1070065,0.02192502,0.8630771,0.000007445127,0.000205161],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3864566,0.0001445591,0.6085711,0.0004485674,0.0001013562,0.0009535336,0.00003882484,0.00002819604,0.003257317],"genre_scores_gemma":[0.8516332,0.00005178161,0.1480992,0.00004060499,0.00002235108,0.00001510454,0.000009325666,0.00005469953,0.00007379985],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.4651766,"threshold_uncertainty_score":0.9999399,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2028982966","doi":"10.1090/s0025-5718-2012-02625-1","title":"Squaring in cyclotomic subgroups","year":2012,"lang":"en","type":"article","venue":"Mathematics of Computation","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":44,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo","funders":"","keywords":"Exponentiation; Mathematics; Multiplicative group; Exponent; Computation; Pairing; Multiplicative function; Arithmetic; Discrete mathematics; Algorithm; Mathematical analysis","retraction":null,"screen_n_in":null,"score":{"opus":0.01687242764727304,"gpt":0.2551459051146664,"spread":0.2382734774673934,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005166944,0.00006173936,0.000114267,0.0001717147,0.00002234284,0.00002281793,0.0002284094,0.00002514354,0.000002757057],"category_scores_gemma":[0.00002204746,0.00006170766,0.00003967426,0.0003143589,0.00001702817,0.0003262278,0.00007013509,0.00004889237,0.00001328119],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001319975,"about_ca_system_score_gemma":0.00000678979,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000002963958,"about_ca_topic_score_gemma":9.198795e-7,"domain_scores_codex":[0.9993988,0.00003247915,0.0002245061,0.00007593597,0.0001270486,0.0001411917],"domain_scores_gemma":[0.9995157,0.0001700147,0.0001035748,0.0001577472,0.00002314806,0.00002979989],"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.000002455771,0.0002653865,0.005156086,0.0001052216,0.000006904859,5.475359e-7,0.007472903,0.001642075,0.001259737,0.9708428,0.0000189611,0.01322689],"study_design_scores_gemma":[0.000350624,0.0000475813,0.02205351,0.0001062855,0.000006172094,0.00001090578,0.0001855027,0.3318522,0.004283464,0.6408924,0.00003042737,0.0001809136],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.4691582,0.00002869739,0.5293822,0.00001808915,0.00006994913,0.00005022392,9.432345e-8,0.00003428599,0.001258303],"genre_scores_gemma":[0.8727107,0.000001030086,0.1272506,0.0000118674,0.00001458772,0.000003654042,5.695891e-7,0.000003839998,0.000003123297],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.4035525,"threshold_uncertainty_score":0.2516365,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2001972447","doi":"10.1090/s0025-5718-04-01704-1","title":"Noninterpolatory Hermite subdivision schemes","year":2004,"lang":"en","type":"article","venue":"Mathematics of Computation","topic":"Advanced Numerical Analysis Techniques","field":"Engineering","cited_by":43,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Alberta","funders":"Natural Sciences and Engineering Research Council of Canada; National Science Foundation","keywords":"Subdivision; Hermite polynomials; Mathematics; Bivariate analysis; Subdivision surface; Hermite interpolation; Cubic Hermite spline; Hermite spline; Applied mathematics; Pure mathematics; Mathematical analysis; Geometry; Statistics; Polygon mesh; Spline interpolation; Geography; Bicubic interpolation; Thin plate spline; Polynomial","retraction":null,"screen_n_in":null,"score":{"opus":0.006241548197502896,"gpt":0.240579837570993,"spread":0.2343382893734901,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00005312624,0.00007871936,0.0001534357,0.00007919397,0.00001400593,0.000007424752,0.00006912518,0.00003098252,0.000005858292],"category_scores_gemma":[0.00001580486,0.00007566367,0.00005127345,0.0001431614,0.00002294461,0.00009595968,0.00001616856,0.00005282084,0.00001771794],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004110639,"about_ca_system_score_gemma":0.000003992953,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000001058513,"about_ca_topic_score_gemma":3.396666e-7,"domain_scores_codex":[0.999496,0.000003444189,0.0002353308,0.00006118416,0.0001293389,0.00007468891],"domain_scores_gemma":[0.9997472,0.00003341221,0.00005808519,0.00009455839,0.00004367427,0.00002311932],"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.000004164056,0.0002313964,0.00008418508,0.0006962958,0.0001022699,0.000003588677,0.001334504,0.8719184,0.06214749,0.03204416,0.0001254384,0.03130807],"study_design_scores_gemma":[0.0002259992,0.00004739363,0.0001490122,0.0001851367,0.00002357,0.000003658092,0.00005351707,0.6412014,0.2055788,0.152211,0.0001436065,0.000176819],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2638031,0.000057907,0.7349881,0.000007104419,0.00001790409,0.00005030589,6.712091e-7,0.0002401041,0.0008348029],"genre_scores_gemma":[0.7680804,0.000007374878,0.2318756,0.000005228856,0.000007644736,0.000001675154,0.00000324622,0.00001378474,0.000005134319],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.5042772,"threshold_uncertainty_score":0.3085475,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2058195144","doi":"10.1090/s0025-5718-03-01623-5","title":"Multivariate refinable Hermite interpolant","year":2003,"lang":"en","type":"article","venue":"Mathematics of Computation","topic":"Advanced Numerical Analysis Techniques","field":"Engineering","cited_by":42,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Alberta","funders":"Natural Sciences and Engineering Research Council of Canada; National Science Foundation","keywords":"Hermite polynomials; Hermite interpolation; Mathematics; Subdivision; Spline (mechanical); Cubic Hermite spline; Pure mathematics; Applied mathematics; Bivariate analysis; Algebra over a field; Mathematical analysis; Polynomial; Bicubic interpolation","retraction":null,"screen_n_in":null,"score":{"opus":0.01050577592330419,"gpt":0.2535120038455955,"spread":0.2430062279222913,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00009062622,0.00007376836,0.0001598778,0.00006408528,0.00001257209,0.000007095672,0.00005005188,0.00002640287,0.00001261718],"category_scores_gemma":[0.0000498955,0.00006865123,0.00003908663,0.0001480209,0.00001312347,0.00006661306,0.000008021013,0.00004778796,0.00001373973],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002531356,"about_ca_system_score_gemma":0.000002739481,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000002080806,"about_ca_topic_score_gemma":4.233694e-7,"domain_scores_codex":[0.9995204,0.00001180686,0.0002377676,0.00005797024,0.00008924898,0.0000828542],"domain_scores_gemma":[0.9997191,0.00006312157,0.00005993213,0.00009456604,0.00004342713,0.00001989079],"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.000008007567,0.0004710686,0.0001387014,0.00151729,0.0002665792,0.000008635346,0.00308647,0.6681711,0.1034318,0.1916921,0.0009628478,0.03024539],"study_design_scores_gemma":[0.000109476,0.00002289188,0.00004636909,0.00006003722,0.00001739109,0.000003670664,0.00005658737,0.8430306,0.06460222,0.09143088,0.000504217,0.000115689],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.04180668,0.00004130233,0.9508002,0.000003847365,0.00002585249,0.00006397247,9.311329e-7,0.0002081074,0.007049082],"genre_scores_gemma":[0.6870189,0.000004749249,0.3129123,0.000003724616,0.000002860219,0.000004358196,0.000002044599,0.00001193011,0.00003906249],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.6452123,"threshold_uncertainty_score":0.2799516,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2023411861","doi":"10.1090/s0025-5718-08-02036-x","title":"Sign changes in sums of the Liouville function","year":2008,"lang":"en","type":"article","venue":"Mathematics of Computation","topic":"Analytic Number Theory Research","field":"Mathematics","cited_by":41,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"Simon Fraser University","funders":"National Institute of Standards and Technology; Natural Sciences and Engineering Research Council of Canada; Mitacs; Simon Fraser University","keywords":"Mathematics; Lambda; Multiplicative function; Sign (mathematics); Riemann zeta function; Function (biology); Prime (order theory); Integer (computer science); Combinatorics; Maxima and minima; Riemann hypothesis; Discrete mathematics; Pure mathematics; Mathematical analysis; Physics; Quantum mechanics","retraction":null,"screen_n_in":null,"score":{"opus":0.08065966435084237,"gpt":0.3272897556344406,"spread":0.2466300912835983,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006578358,0.00009135115,0.0002680036,0.0001468428,0.00004510766,0.000003934602,0.0001865886,0.00005523701,0.00005078265],"category_scores_gemma":[0.0004127865,0.0000670912,0.00006825392,0.0004192165,0.000138296,0.00004832917,0.00006944519,0.0001003821,0.000008068565],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003319527,"about_ca_system_score_gemma":0.00004506676,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001452767,"about_ca_topic_score_gemma":0.00004234012,"domain_scores_codex":[0.9988104,0.0001025907,0.0004090016,0.00009918711,0.0004490813,0.000129801],"domain_scores_gemma":[0.9984704,0.0007748614,0.0003146947,0.0002499974,0.0001686723,0.00002132435],"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.0002527343,0.002935946,0.01265409,0.00582633,0.0003663872,0.00001355675,0.05446995,0.005716298,0.02240878,0.8818999,0.005942024,0.00751403],"study_design_scores_gemma":[0.000622008,0.0001251524,0.003254754,0.0002651962,0.0000392871,0.00001571954,0.00137566,0.03665235,0.01775195,0.9397595,0.00001826564,0.0001201392],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9325008,0.00002167969,0.06285509,0.0001280479,0.00005724347,0.0003560215,0.00000250061,0.00001981936,0.004058773],"genre_scores_gemma":[0.9905088,0.000006464091,0.009037783,0.000008820766,0.0000177476,0.000008949373,0.000001486912,0.00001691902,0.0003930065],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.058008,"threshold_uncertainty_score":0.27359,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1979763552","doi":"10.1090/s0025-5718-09-02320-5","title":"The structure of balanced multivariate biorthogonal multiwavelets and dual multiframelets","year":2009,"lang":"en","type":"article","venue":"Mathematics of Computation","topic":"Mathematical Analysis and Transform Methods","field":"Mathematics","cited_by":39,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Alberta","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Biorthogonal system; Orthonormal basis; Univariate; Mathematics; Wavelet; Applied mathematics; Property (philosophy); Orthogonalization; Order (exchange); Multiresolution analysis; Multivariate statistics; Dual (grammatical number); Algorithm; Computer science; Wavelet transform; Discrete wavelet transform; Artificial intelligence; Statistics","retraction":null,"screen_n_in":null,"score":{"opus":0.02841022300064903,"gpt":0.3409996028791354,"spread":0.3125893798784863,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006111018,0.0001929992,0.0005395687,0.00008050098,0.0001075917,0.00002972942,0.0001320254,0.00009714962,0.00001311628],"category_scores_gemma":[0.0006095144,0.0001217398,0.0001319264,0.0001939271,0.0001345664,0.00007140197,0.00002425114,0.0001321912,6.728984e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000008694672,"about_ca_system_score_gemma":0.00001882904,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000003570549,"about_ca_topic_score_gemma":0.000005345039,"domain_scores_codex":[0.9982445,0.00009202414,0.0008932785,0.0001684965,0.0004129865,0.0001887161],"domain_scores_gemma":[0.9969891,0.00194884,0.0005416818,0.0002313326,0.0002287162,0.00006032357],"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.00007447707,0.0008373269,0.00006819833,0.001435422,0.0003117314,0.000003160629,0.005911307,0.0004282187,0.1402669,0.7189063,0.00004751464,0.1317094],"study_design_scores_gemma":[0.0006505178,0.0001061291,0.001517385,0.0001371017,0.0001161917,0.0000108723,0.0001776757,0.1670931,0.02583547,0.8042058,0.000009598869,0.0001401467],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.6664002,0.00005175999,0.3327753,0.0001710824,0.00002972503,0.0002975888,0.0000183345,0.00002563307,0.0002303812],"genre_scores_gemma":[0.6491325,0.000009131151,0.3508063,0.00000862303,0.00001286425,0.000001002917,0.000003740947,0.000009041724,0.0000168051],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.1666649,"threshold_uncertainty_score":0.4964404,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1972785700","doi":"10.1090/s0025-5718-00-01186-8","title":"A mixed formulation of Boussinesq equations: Analysis of nonsingular solutions","year":2000,"lang":"en","type":"article","venue":"Mathematics of Computation","topic":"Advanced Numerical Methods in Computational Mathematics","field":"Engineering","cited_by":38,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Université de Moncton","funders":"","keywords":"Mathematics; Uniqueness; Invertible matrix; Finite element method; Convergence (economics); Applied mathematics; Mathematical analysis; Mixed finite element method; Element (criminal law); Pure mathematics","retraction":null,"screen_n_in":null,"score":{"opus":0.05420266250477231,"gpt":0.3087461615267744,"spread":0.2545434990220021,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003144631,0.0001250602,0.0005023269,0.0004357243,0.00003386863,0.000006075709,0.0001055665,0.00005888338,0.00005774141],"category_scores_gemma":[0.0003699629,0.000131015,0.0001659037,0.001399628,0.00006167873,0.0001279168,0.0000145126,0.00005420648,0.00000334419],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003441307,"about_ca_system_score_gemma":0.00001786672,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000002674873,"about_ca_topic_score_gemma":0.000001429598,"domain_scores_codex":[0.9984473,0.00003891962,0.0009620963,0.00009463181,0.0003382608,0.000118819],"domain_scores_gemma":[0.9975557,0.001597585,0.0003333728,0.0001984213,0.000285894,0.00002903179],"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.000003701123,0.0001303012,0.00001569884,0.000373077,0.0003021013,9.695838e-8,0.0007556158,0.9497367,0.002076674,0.02433401,0.000006642323,0.02226545],"study_design_scores_gemma":[0.0001396924,0.00002821958,0.0006478102,0.0000819464,0.0003947518,6.896944e-7,0.00006240288,0.8529958,0.00256322,0.1429926,0.000004374584,0.00008848123],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1883735,0.00007235272,0.8107134,0.000008811555,0.00003877538,0.000157288,0.00002120202,0.00005906915,0.0005556355],"genre_scores_gemma":[0.5358749,0.000005691685,0.4640666,0.00000127637,0.000005318032,0.000004208159,0.00002524248,0.0000120286,0.000004730009],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.3475014,"threshold_uncertainty_score":0.5342638,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W3137959625","doi":"10.1090/mcom/3643","title":"Sharper bounds for the Chebyshev function 𝜃(𝑥)","year":2021,"lang":"en","type":"article","venue":"Mathematics of Computation","topic":"Analytic Number Theory Research","field":"Mathematics","cited_by":38,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Lethbridge","funders":"Natural Sciences and Engineering Research Council of Canada; University of Lethbridge","keywords":"Algorithm; Artificial intelligence; Annotation; Computer science; Mathematics","retraction":null,"screen_n_in":null,"score":{"opus":0.09665988299223457,"gpt":0.3805234659972421,"spread":0.2838635830050075,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001001239,0.0001096464,0.0002357427,0.00005059406,0.0001378547,0.00005836058,0.0001649339,0.00005850344,0.0001775826],"category_scores_gemma":[0.001070135,0.0000809898,0.0001462166,0.000233987,0.00007900783,0.00007897409,0.00006544839,0.0000948785,0.00002453917],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003590499,"about_ca_system_score_gemma":0.00008814856,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00000177181,"about_ca_topic_score_gemma":0.000005198212,"domain_scores_codex":[0.998816,0.00005367392,0.0004165527,0.0001520295,0.0003888458,0.0001728953],"domain_scores_gemma":[0.9958435,0.003021547,0.0002022641,0.0003238342,0.0005749801,0.00003391661],"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.00004737221,0.0004261992,0.00004433113,0.001158483,0.0003075898,0.000001616241,0.002176192,0.0006418025,0.00203604,0.9775776,0.008871553,0.006711246],"study_design_scores_gemma":[0.0003867156,0.00004352509,0.00007012486,0.0000557782,0.0001368717,0.00001006431,0.001045734,0.1237253,0.002823317,0.870945,0.0006738619,0.00008373555],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.04088302,0.0001013408,0.9542378,0.0005311472,0.0001314258,0.0004210664,0.000008236734,0.00004559571,0.003640404],"genre_scores_gemma":[0.8790559,0.00000830706,0.1172325,0.00007171211,0.0001341484,0.00007459179,0.00002534182,0.00004754842,0.003349897],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8381729,"threshold_uncertainty_score":0.3302668,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1981675591","doi":"10.1090/s0025-5718-01-01336-9","title":"Some computations on the spectra of Pisot and Salem numbers","year":2001,"lang":"en","type":"article","venue":"Mathematics of Computation","topic":"semigroups and automata theory","field":"Computer Science","cited_by":36,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"Simon Fraser University","funders":"Natural Sciences and Engineering Research Council of Canada; Mitacs","keywords":"Mathematics; Combinatorics; Computation; Line (geometry); Class (philosophy); Discrete mathematics; Algorithm; Geometry","retraction":null,"screen_n_in":null,"score":{"opus":0.01916743748532824,"gpt":0.2511285033220414,"spread":0.2319610658367132,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003237362,0.0000877691,0.0001627983,0.00008257235,0.00006295901,0.00003939212,0.0002784002,0.00002520673,0.000005305891],"category_scores_gemma":[0.00004101967,0.00006473306,0.00004207465,0.0002208538,0.00008254088,0.0001614734,0.00006357091,0.00005549043,0.000009062497],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00000972773,"about_ca_system_score_gemma":0.00001642742,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000005894528,"about_ca_topic_score_gemma":8.828018e-7,"domain_scores_codex":[0.9992083,0.00004369562,0.0002972749,0.0001231597,0.00022976,0.00009783419],"domain_scores_gemma":[0.9986842,0.0007641642,0.0002345454,0.000228292,0.00006286217,0.00002599722],"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.000002346508,0.0001344763,0.00004510853,0.00005981971,0.00001819465,0.000001296346,0.002525242,0.004230682,0.0005402474,0.9867501,0.0001926877,0.005499835],"study_design_scores_gemma":[0.0001540313,0.0000696988,0.001117356,0.00007099723,0.0000066613,0.00001421493,0.0002015251,0.4640875,0.001388328,0.532809,0.00001683118,0.00006387079],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.4198292,0.00005141211,0.5780194,0.0007202722,0.00005746122,0.0001287562,0.000001724165,0.0000451617,0.001146604],"genre_scores_gemma":[0.9196983,0.00001811464,0.0801311,0.00009912863,0.00002165778,0.000002913621,0.000001813863,0.000006529181,0.00002043276],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.499869,"threshold_uncertainty_score":0.2639737,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2110949086","doi":"10.1090/s0025-5718-08-02091-7","title":"A 𝑝-adic algorithm to compute the Hilbert class polynomial","year":2008,"lang":"en","type":"article","venue":"Mathematics of Computation","topic":"advanced mathematical theories","field":"Mathematics","cited_by":36,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Calgary","funders":"","keywords":"Mathematics; Discriminant; Polynomial; Rounding; Riemann hypothesis; Quadratic equation; Algorithm; Class (philosophy); Discrete mathematics; Combinatorics; Pure mathematics; Mathematical analysis; Geometry; Computer science","retraction":null,"screen_n_in":null,"score":{"opus":0.04958351190012712,"gpt":0.3246229484439618,"spread":0.2750394365438347,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005706648,0.000284032,0.0006039828,0.0001420141,0.0002417574,0.00002806999,0.0004507307,0.0000910812,0.00003106474],"category_scores_gemma":[0.0008437285,0.0002070999,0.0001678325,0.0004417833,0.0002792618,0.0001383919,0.0001893853,0.0001869711,0.0001095668],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00006941125,"about_ca_system_score_gemma":0.00006245545,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000004464998,"about_ca_topic_score_gemma":0.000002521186,"domain_scores_codex":[0.9977947,0.00009005333,0.0008873794,0.0002558613,0.0006369703,0.0003349986],"domain_scores_gemma":[0.9960792,0.002568181,0.0004288777,0.0005292993,0.0002672901,0.0001271626],"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.00006420212,0.001374143,0.00001873405,0.000930019,0.0002707456,0.00002818356,0.0280921,0.00528261,0.001072167,0.9123482,0.02440183,0.02611704],"study_design_scores_gemma":[0.0005472794,0.0001590058,0.00004780409,0.000163005,0.00006375053,0.0001467579,0.0004403566,0.08825792,0.002457512,0.9065174,0.0008988882,0.0003002473],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.07669808,0.00002806973,0.9174877,0.0006196559,0.0001889127,0.0007993372,0.00001285242,0.0001718732,0.003993483],"genre_scores_gemma":[0.2133841,0.00000495217,0.7857609,0.0001516367,0.0001389294,0.00004371563,0.000005118037,0.00006013459,0.0004504741],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.136686,"threshold_uncertainty_score":0.8445288,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2150932406","doi":"10.1090/s0025-5718-00-01234-5","title":"Computer verification of the Ankeny–Artin–Chowla Conjecture for all primes less than 100000000000","year":2000,"lang":"en","type":"article","venue":"Mathematics of Computation","topic":"Analytic Number Theory Research","field":"Mathematics","cited_by":30,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Manitoba","funders":"Australian Research Council; Centrum Wiskunde and Informatica; Natural Sciences and Engineering Research Council of Canada; Nederlandse Organisatie voor Wetenschappelijk Onderzoek; European Research Consortium for Informatics and Mathematics","keywords":"Conjecture; Mathematics; Combinatorics; Modulo; Prime (order theory); Bernoulli number; Assertion; Integer (computer science); Rational number; Discrete mathematics; Arithmetic; Computer science","retraction":null,"screen_n_in":null,"score":{"opus":0.05808456210056037,"gpt":0.3470531889874262,"spread":0.2889686268868658,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00110653,0.0002673943,0.0005985004,0.0001205106,0.000119537,0.00004245083,0.0006203876,0.0001588235,0.0002016299],"category_scores_gemma":[0.0001957692,0.0002008619,0.0003053084,0.0003413506,0.0002717326,0.0001320242,0.00007473333,0.000178926,0.0000208393],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00006140092,"about_ca_system_score_gemma":0.0001125699,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000016777,"about_ca_topic_score_gemma":0.00000808462,"domain_scores_codex":[0.997463,0.0001981546,0.001021434,0.0003047694,0.0006871145,0.0003254566],"domain_scores_gemma":[0.9965783,0.001581253,0.0006762054,0.0007032117,0.0003892291,0.00007180942],"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.0008805034,0.005380689,0.001881416,0.01134564,0.001887911,0.000004230686,0.04151405,0.02365834,0.01402117,0.7199799,0.0213725,0.1580737],"study_design_scores_gemma":[0.001660543,0.0002710742,0.001097931,0.0004605148,0.0002962862,0.00002300136,0.0005252732,0.1782889,0.03627416,0.7799981,0.0007197061,0.0003845492],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.8208922,0.00004202606,0.1740191,0.0004537315,0.0001071087,0.001573151,0.0000531246,0.000078283,0.002781281],"genre_scores_gemma":[0.9146578,0.000008440093,0.08382893,0.00004191886,0.0000952203,0.00004778693,0.00002772189,0.00006193046,0.001230243],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.1576891,"threshold_uncertainty_score":0.8190911,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1991405149","doi":"10.1090/s0025-5718-00-01246-1","title":"A polynomial-time complexity bound for the computation of the singular part of a Puiseux expansion of an algebraic function","year":2000,"lang":"en","type":"article","venue":"Mathematics of Computation","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":29,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Ottawa","funders":"","keywords":"Mathematics; Algebraic function; Algebraic number; Rational function; Function field of an algebraic variety; Polynomial; Logarithm; Newton polygon; Function (biology); Real algebraic geometry; Field (mathematics); Algebraic surface; Singular point of an algebraic variety; Algebraic extension; Power series; Algebraic element; Upper and lower bounds; Pure mathematics; Discrete mathematics; Mathematical analysis","retraction":null,"screen_n_in":null,"score":{"opus":0.02686176452219246,"gpt":0.2551159990401332,"spread":0.2282542345179407,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008181677,0.0001205078,0.0002985435,0.00009760517,0.0001377127,0.00002751852,0.0004755167,0.00005026599,0.00001491678],"category_scores_gemma":[0.00005141895,0.00008527529,0.0001941126,0.0004555912,0.0002607882,0.0002087452,0.00006009565,0.00005330145,0.000001087363],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001048399,"about_ca_system_score_gemma":0.00005544587,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001566257,"about_ca_topic_score_gemma":0.000002778298,"domain_scores_codex":[0.9985714,0.0001489803,0.0006470726,0.0001643168,0.0003534742,0.0001147619],"domain_scores_gemma":[0.9980406,0.0005455257,0.0006952322,0.0004172039,0.0002771568,0.00002423883],"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.0007627998,0.002704085,0.0001545881,0.002362937,0.0004971311,3.937166e-7,0.02618737,0.1769376,0.06891166,0.2288281,0.000812758,0.4918406],"study_design_scores_gemma":[0.0005156751,0.0004488577,0.001758031,0.0001789525,0.00007852977,0.000002629342,0.0001211532,0.7332245,0.01328466,0.2502644,0.00003405428,0.00008857237],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.52448,0.00003321803,0.4748885,0.00006406744,0.00008140172,0.0003413368,0.000006105112,0.00001870793,0.00008668697],"genre_scores_gemma":[0.9497571,0.000001600399,0.05016292,0.00001993213,0.00002126799,0.000009254461,0.000008460472,0.0000089743,0.00001051168],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.5562869,"threshold_uncertainty_score":0.3477425,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2008496693","doi":"10.1090/s0025-5718-02-01418-7","title":"New quadratic polynomials with high densities of prime values","year":2002,"lang":"en","type":"article","venue":"Mathematics of Computation","topic":"Analytic Number Theory Research","field":"Mathematics","cited_by":29,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Calgary; University of Manitoba","funders":"University of Waterloo","keywords":"Discriminant; Mathematics; Riemann hypothesis; Combinatorics; Polynomial; Quadratic equation; Prime (order theory); Order (exchange); Class number; Delta; Discrete mathematics; Pure mathematics; Mathematical analysis; Geometry; Physics","retraction":null,"screen_n_in":null,"score":{"opus":0.05804371422392374,"gpt":0.317600054715775,"spread":0.2595563404918512,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005073004,0.0001620141,0.000544566,0.0001710276,0.00004118006,0.00002399511,0.0001971593,0.00006065163,0.0003051996],"category_scores_gemma":[0.0003258052,0.0001308263,0.00007537197,0.0002356432,0.0001388651,0.0001172476,0.00004924221,0.00008489359,0.00003649562],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003541534,"about_ca_system_score_gemma":0.00005572167,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00003870367,"about_ca_topic_score_gemma":0.000006203399,"domain_scores_codex":[0.9982971,0.0000943221,0.0006582345,0.000143242,0.0006223071,0.0001848263],"domain_scores_gemma":[0.9974207,0.001377661,0.0005321052,0.000324012,0.0002749878,0.00007054367],"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.0001695775,0.001886343,0.000561635,0.005571967,0.001106654,0.00001893417,0.0450878,0.002900703,0.008774941,0.9111609,0.01255257,0.010208],"study_design_scores_gemma":[0.0007707491,0.0002793407,0.00009687374,0.0004063945,0.0001620408,0.00002207425,0.001192437,0.04950486,0.03115819,0.9162185,0.00000329424,0.0001852372],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.6120355,0.00004694307,0.3847945,0.0001110838,0.00002473533,0.0003171532,0.000003709132,0.0000461435,0.002620261],"genre_scores_gemma":[0.7156644,0.000003132021,0.2825896,0.000004965412,0.00002953692,0.000002965764,0.000002090349,0.00002748497,0.001675893],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.1036289,"threshold_uncertainty_score":0.5334942,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2073568805","doi":"10.1090/s0025-5718-05-01723-0","title":"The continuing search for Wieferich primes","year":2005,"lang":"en","type":"article","venue":"Mathematics of Computation","topic":"Mathematics and Applications","field":"Mathematics","cited_by":29,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"Simon Fraser University","funders":"Killam Trusts; Dalhousie University","keywords":"Mathematics; Prime (order theory); Congruence (geometry); Computation; Discrete mathematics; Combinatorics; Algorithm; Geometry","retraction":null,"screen_n_in":null,"score":{"opus":0.05444991498185719,"gpt":0.3663539798274647,"spread":0.3119040648456075,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009524187,0.0001220929,0.0002407608,0.0000497468,0.0001537012,0.00006577723,0.0002443108,0.00004666374,0.00001117301],"category_scores_gemma":[0.0003089523,0.00008792525,0.0001036307,0.0001367276,0.00007068149,0.00006643361,0.00004750318,0.00006797833,0.00001098129],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002679011,"about_ca_system_score_gemma":0.00002537234,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000001051358,"about_ca_topic_score_gemma":0.000004752488,"domain_scores_codex":[0.9987634,0.00002382858,0.0006031678,0.0001266459,0.0002841465,0.0001988577],"domain_scores_gemma":[0.9960604,0.002964032,0.0003225398,0.0002907051,0.0003242811,0.00003806152],"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.000009638095,0.0003796775,0.000008477999,0.0006667593,0.00006415265,6.281789e-8,0.006158493,0.0006505387,0.001990888,0.9418172,0.01000643,0.03824763],"study_design_scores_gemma":[0.0005599298,0.00006524565,0.00002329507,0.0001487055,0.00007124516,0.000005268132,0.0009894627,0.3167637,0.01975928,0.6515054,0.009915795,0.0001926381],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1843484,0.00007477391,0.8103687,0.0008969613,0.00003758338,0.001080468,0.00000959488,0.00007652438,0.003107069],"genre_scores_gemma":[0.5329895,0.00000947115,0.4662536,0.00001004636,0.00007676829,0.00009916521,0.000004914577,0.00002528485,0.0005312432],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.3486411,"threshold_uncertainty_score":0.3585488,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2049582538","doi":"10.1090/s0025-5718-00-01221-7","title":"Rudin-Shapiro-like polynomials in 𝐿₄","year":2000,"lang":"en","type":"article","venue":"Mathematics of Computation","topic":"Mathematical functions and polynomials","field":"Mathematics","cited_by":28,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Simon Fraser University","funders":"","keywords":"Mathematics; Combinatorics; Degree (music); Norm (philosophy); Orthogonal polynomials; Sequence (biology); Difference polynomials; Polynomial; Discrete orthogonal polynomials; Classical orthogonal polynomials; Discrete mathematics; Mathematical analysis","retraction":null,"screen_n_in":null,"score":{"opus":0.04815084716178829,"gpt":0.3240518667922016,"spread":0.2759010196304133,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0007985916,0.0002252397,0.0006265632,0.000223088,0.00005742667,0.00003628619,0.0002029578,0.0001282136,0.002238078],"category_scores_gemma":[0.0002668032,0.0002052024,0.0001425928,0.000354037,0.00007124846,0.0001337902,0.00003297077,0.0001328112,0.0002404621],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0000503197,"about_ca_system_score_gemma":0.00004060441,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002261379,"about_ca_topic_score_gemma":0.00001397903,"domain_scores_codex":[0.9979009,0.00008410131,0.001162246,0.0002214638,0.0003519279,0.0002793855],"domain_scores_gemma":[0.9978811,0.001314745,0.0002961222,0.0003488519,0.00008047759,0.00007873906],"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.0003088477,0.008276724,0.0006913127,0.007038043,0.0004023418,0.00003642198,0.02411525,0.006302615,0.008564003,0.774245,0.04906259,0.1209568],"study_design_scores_gemma":[0.001112025,0.0001284189,0.0002841018,0.000403997,0.00006947508,0.00002380869,0.0003192994,0.03357631,0.002034261,0.9602764,0.001398434,0.0003734633],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9254121,0.00006811936,0.03297758,0.0002146115,0.0001655137,0.0006354668,0.00001337795,0.000116027,0.04039724],"genre_scores_gemma":[0.839991,0.00002347214,0.1571328,0.00007281003,0.00007968145,0.00004003029,0.00001153394,0.00005141391,0.002597335],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.1860314,"threshold_uncertainty_score":0.998674,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2167556014","doi":"10.1090/s0025-5718-02-01479-5","title":"The twenty-fourth Fermat number is composite","year":2002,"lang":"en","type":"article","venue":"Mathematics of Computation","topic":"Cryptography and Residue Arithmetic","field":"Computer Science","cited_by":28,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":false,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"","funders":"Reed College; Division of Mathematical Sciences; University of Southern Mississippi; University of Georgia; Case Western Reserve University; Dalhousie University; Northern Illinois University; Microsoft Research","keywords":"Mathematics; Primality test; Modulo; Fast Fourier transform; Piecewise; Fermat number; Arithmetic; Discrete mathematics; Algorithm; Composite number; Fermat's Last Theorem; Combinatorics; Prime number; Mathematical analysis","retraction":null,"screen_n_in":null,"score":{"opus":0.01637513456064799,"gpt":0.2459259994582746,"spread":0.2295508648976267,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001892416,0.00009877543,0.0001357279,0.00005469974,0.0002069528,0.0001478604,0.0004790447,0.0000335201,0.00001935158],"category_scores_gemma":[0.00001342813,0.00006924225,0.00009508203,0.0003451332,0.00007384001,0.0001669655,0.0001029659,0.00007527971,0.0001346943],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000008380523,"about_ca_system_score_gemma":0.000005213259,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000002907352,"about_ca_topic_score_gemma":7.505903e-7,"domain_scores_codex":[0.999034,0.00004050859,0.0003094215,0.0001312398,0.0003295032,0.0001553496],"domain_scores_gemma":[0.9990155,0.0003266737,0.0001902338,0.0003197445,0.0001078175,0.00004010122],"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.000008040127,0.00132544,0.001274033,0.0005436573,0.000298743,0.00001674221,0.0370575,0.01054196,0.001023896,0.7703789,0.02765653,0.1498746],"study_design_scores_gemma":[0.0002252441,0.00002446036,0.0007067323,0.0000447618,0.00001216063,0.00002722517,0.00006026997,0.8767378,0.001211585,0.120077,0.0007611277,0.0001115776],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.05299435,0.0001594464,0.9393144,0.001522562,0.0001840059,0.000155665,0.000001336733,0.00008106295,0.005587198],"genre_scores_gemma":[0.806102,0.00004766877,0.1935748,0.0001118013,0.00001883959,0.000004619822,8.780605e-7,0.00000721798,0.0001321786],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8661959,"threshold_uncertainty_score":0.2823617,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2045357246","doi":"10.1090/s0025-5718-2014-02856-1","title":"Algorithm for constructing symmetric dual framelet filter banks","year":2014,"lang":"en","type":"article","venue":"Mathematics of Computation","topic":"Mathematical Analysis and Transform Methods","field":"Mathematics","cited_by":28,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Alberta","funders":"","keywords":"Dual (grammatical number); Filter (signal processing); Algorithm; Mathematics; Filter design; Computer science; Filter bank; Computer vision","retraction":null,"screen_n_in":null,"score":{"opus":0.05102594684463761,"gpt":0.3460891226227808,"spread":0.2950631757781432,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001765974,0.0002157185,0.0007168968,0.0002480614,0.00008503992,0.00004876217,0.0001474379,0.0001224982,0.00006262284],"category_scores_gemma":[0.001440973,0.000179256,0.0002801868,0.0003685842,0.00007894515,0.00009658666,0.00003240734,0.0001213868,0.000008567707],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001835075,"about_ca_system_score_gemma":0.00001850842,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000001890979,"about_ca_topic_score_gemma":8.207517e-7,"domain_scores_codex":[0.9980336,0.0000947092,0.0009802353,0.0002251618,0.0004121336,0.0002541728],"domain_scores_gemma":[0.9938027,0.005036919,0.0005079363,0.0002516145,0.0003246233,0.00007626781],"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.000003920764,0.0003052119,0.000007693948,0.001566881,0.0001448795,3.718928e-7,0.0007461935,0.0001002331,0.0002248256,0.646319,0.0001575063,0.3504233],"study_design_scores_gemma":[0.0003976202,0.00007496322,0.000004600477,0.00008776957,0.0001381334,0.000007833803,0.0001247325,0.4084144,0.003701431,0.5868461,0.00007630473,0.0001261511],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.03527563,0.00001283324,0.9594126,0.00006968377,0.00009245043,0.0004504886,0.00001516973,0.0000747638,0.004596371],"genre_scores_gemma":[0.1368315,0.000001443772,0.8629174,0.00002556378,0.00008386631,0.00003129314,0.00001433025,0.00003349288,0.0000611044],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.4083141,"threshold_uncertainty_score":0.7309846,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1969155620","doi":"10.1090/s0025-5718-07-01931-x","title":"Error bounds on complex floating-point multiplication","year":2007,"lang":"en","type":"article","venue":"Mathematics of Computation","topic":"Numerical Methods and Algorithms","field":"Computer Science","cited_by":28,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Simon Fraser University","funders":"","keywords":"Mathematics; Arithmetic underflow; Double-precision floating-point format; Arithmetic; Base (topology); Floating point; Single-precision floating-point format; Multiplication (music); Product (mathematics); IEEE floating point; Value (mathematics); Approximation error; Discrete mathematics; Algorithm; Combinatorics; Mathematical analysis; Geometry; Computer science; Statistics","retraction":null,"screen_n_in":null,"score":{"opus":0.06061191258833785,"gpt":0.3590213579512863,"spread":0.2984094453629484,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000944614,0.0001112953,0.0001961028,0.0001194178,0.00007709946,0.00005250373,0.000320506,0.00004475309,0.000005350437],"category_scores_gemma":[0.000115689,0.00009934082,0.00005491738,0.0003237519,0.00003910915,0.0001419515,0.00007072427,0.00008582579,0.00003186563],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003374579,"about_ca_system_score_gemma":0.00001387513,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000006696031,"about_ca_topic_score_gemma":6.677201e-7,"domain_scores_codex":[0.9987884,0.00004271387,0.0004604543,0.0001991409,0.0003384617,0.000170824],"domain_scores_gemma":[0.9985422,0.0006575979,0.0003163118,0.0002888521,0.000131967,0.0000630879],"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.00001055895,0.0007302345,0.00004043276,0.0001583023,0.00002405586,0.000003217062,0.003177745,0.00493728,0.01690229,0.2344099,0.000285222,0.7393208],"study_design_scores_gemma":[0.0002526577,0.0001638949,0.001962779,0.00004040242,0.000004244523,0.000004792417,0.00008771358,0.8717772,0.00797499,0.1173797,0.0002249818,0.0001265975],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.01874681,0.000005697044,0.9774457,0.0002697639,0.0001315768,0.000184227,0.00000120153,0.0001098244,0.00310518],"genre_scores_gemma":[0.387958,3.643869e-7,0.6119159,0.00007677927,0.00002643998,0.000001690208,0.000003711212,0.000006094393,0.0000109721],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.8668399,"threshold_uncertainty_score":0.4051001,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2056631054","doi":"10.1090/s0025-5718-2010-02423-8","title":"Computing systems of Hecke eigenvalues associated to Hilbert modular forms","year":2010,"lang":"en","type":"article","venue":"Mathematics of Computation","topic":"Advanced Algebra and Geometry","field":"Mathematics","cited_by":28,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Calgary","funders":"University of Sydney","keywords":"Mathematics; Modular form; Eigenvalues and eigenvectors; Hecke operator; Cohomology; Pure mathematics; Algebra over a field; Modular design; Field (mathematics)","retraction":null,"screen_n_in":null,"score":{"opus":0.0257139000694979,"gpt":0.3193453051840094,"spread":0.2936314051145115,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006970734,0.0001741319,0.0005502882,0.0002165704,0.00006182462,0.00002158649,0.0002088507,0.0001161901,0.000008974652],"category_scores_gemma":[0.001157655,0.0001564645,0.0001059693,0.0003994922,0.00004566278,0.0001056202,0.0000819868,0.0001499854,0.00001066539],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002954626,"about_ca_system_score_gemma":0.00002653233,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00000677918,"about_ca_topic_score_gemma":0.000007976516,"domain_scores_codex":[0.9982684,0.00003126838,0.0008569331,0.0001678933,0.0004629184,0.0002126496],"domain_scores_gemma":[0.9977084,0.0007787333,0.0007389834,0.0002874166,0.000412364,0.00007409276],"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.00002504994,0.001690474,0.00131537,0.003932809,0.0003682147,0.000003907133,0.01109351,0.06421736,0.06052703,0.850871,0.0005834294,0.005371889],"study_design_scores_gemma":[0.0005239236,0.0001561346,0.0009906864,0.0004536336,0.00007307032,0.000009373393,0.0007491872,0.2693122,0.0162544,0.7111841,0.00001577509,0.0002775098],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.628881,0.00001240439,0.3699364,0.00001780921,0.0001624724,0.0003092783,0.000008507969,0.00005523608,0.0006168029],"genre_scores_gemma":[0.8733479,6.476813e-7,0.1264986,0.00001114387,0.0000347362,0.000004882538,0.00001277633,0.0000315556,0.00005774977],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.2444669,"threshold_uncertainty_score":0.6380438,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1758200638","doi":"10.1090/mcom/3205","title":"Symmetric canonical quincunx tight framelets with high vanishing moments and smoothness","year":2016,"lang":"en","type":"article","venue":"Mathematics of Computation","topic":"Mathematical Analysis and Transform Methods","field":"Mathematics","cited_by":28,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Alberta","funders":"Natural Sciences and Engineering Research Council of Canada; Simons Foundation","keywords":"Mathematics; Symmetry (geometry); Combinatorics; Mathematical physics; Mathematical analysis; Geometry","retraction":null,"screen_n_in":null,"score":{"opus":0.03225048713407334,"gpt":0.3134937958569637,"spread":0.2812433087228903,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008201691,0.0002252422,0.0006402924,0.0002071596,0.00007321811,0.00004789159,0.0001621009,0.0001003338,0.00007073997],"category_scores_gemma":[0.0004179827,0.0001264965,0.00008215479,0.0003858785,0.0001206538,0.0001898587,0.00005064074,0.00009330065,0.000007045667],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000038475,"about_ca_system_score_gemma":0.00003472922,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001308349,"about_ca_topic_score_gemma":0.00001015256,"domain_scores_codex":[0.9981315,0.00008806724,0.000703683,0.0002552454,0.0005808918,0.0002406285],"domain_scores_gemma":[0.9967058,0.002350431,0.0003786925,0.0002584913,0.0001926879,0.0001139127],"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.00003127217,0.0007089422,0.0003931699,0.001734737,0.0003045081,0.000007701669,0.00101138,0.0000269696,0.001631609,0.9718806,0.00007497262,0.02219412],"study_design_scores_gemma":[0.001111695,0.0001837342,0.0006085872,0.0006153214,0.000250758,0.00001843798,0.00007557648,0.005432472,0.00584025,0.9855782,0.00002437346,0.0002606323],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.4480214,0.00001963084,0.5502537,0.0002611169,0.00002183473,0.0001971753,0.000006006959,0.00004022018,0.001178863],"genre_scores_gemma":[0.6866754,0.00001093407,0.313142,0.00001166603,0.00001725317,0.0000126267,0.0000018404,0.00002592644,0.0001024049],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.2386539,"threshold_uncertainty_score":0.5158376,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1634195488","doi":"10.1090/s0025-5718-06-01914-4","title":"Quaternionic Manin symbols, Brandt matrices, and Hilbert modular forms","year":2006,"lang":"en","type":"article","venue":"Mathematics of Computation","topic":"Algebraic Geometry and Number Theory","field":"Mathematics","cited_by":28,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Calgary","funders":"University of Calgary; Brandeis University","keywords":"Mathematics; Modular form; Quadratic equation; Generalization; Prime (order theory); Quadratic field; Norm (philosophy); Pure mathematics; Finite field; Coprime integers; Field (mathematics); Algebra over a field; Quadratic form (statistics); Quadratic residue; Discrete mathematics; Combinatorics; Mathematical analysis; Quadratic function; Geometry","retraction":null,"screen_n_in":null,"score":{"opus":0.01450173597033348,"gpt":0.2595373755066365,"spread":0.245035639536303,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005470567,0.000180385,0.0003566762,0.0001531575,0.00007983876,0.00004049494,0.0001282586,0.00009386145,0.00003789285],"category_scores_gemma":[0.00008249574,0.0001576255,0.0000758188,0.0001976693,0.0000628104,0.0001690109,0.00005946123,0.00008783869,0.00002278159],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002421648,"about_ca_system_score_gemma":0.0000141631,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0000248327,"about_ca_topic_score_gemma":0.000006469833,"domain_scores_codex":[0.9986966,0.00004308679,0.0005842226,0.0001795746,0.0003064932,0.0001900757],"domain_scores_gemma":[0.9987758,0.0005237312,0.0003641959,0.0002057206,0.00008937065,0.00004120257],"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.00002443942,0.0004677371,0.0005374101,0.001789492,0.00007186615,0.000004929582,0.001035409,0.0006587838,0.0007830666,0.9920502,0.000606208,0.001970476],"study_design_scores_gemma":[0.0005740959,0.00005310824,0.0009596869,0.000133101,0.00006646209,0.0000412482,0.0002093859,0.01891767,0.00245455,0.9763728,0.00004001227,0.0001779052],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.8046388,0.0001805397,0.1916752,0.00005901469,0.00004784246,0.0002525767,0.000004736946,0.00007505777,0.003066268],"genre_scores_gemma":[0.9541879,0.00001202508,0.04530957,0.00001231353,0.00004521411,0.000009493086,0.00002152027,0.0000307407,0.0003711884],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.1495492,"threshold_uncertainty_score":0.6427782,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2042126572","doi":"10.1090/mcom/3064","title":"Approximation of the controls for the beam equation with vanishing viscosity","year":2015,"lang":"en","type":"article","venue":"Mathematics of Computation","topic":"Stability and Controllability of Differential Equations","field":"Engineering","cited_by":27,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Toronto Metropolitan University","funders":"Consiliul National al Cercetarii Stiintifice","keywords":"Mathematics; Controllability; Mathematical analysis; Spurious relationship; Boundary value problem; Boundary (topology); Convergence (economics); Beam (structure); Finite difference method; Viscosity; Finite difference; Viscosity solution; Applied mathematics; Physics","retraction":null,"screen_n_in":null,"score":{"opus":0.03977644850557643,"gpt":0.2376974809657562,"spread":0.1979210324601798,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004713685,0.00006962871,0.0001548192,0.00002177173,0.00005768869,0.00002348473,0.0001220062,0.00003062234,0.000001272333],"category_scores_gemma":[0.0003046407,0.00004176532,0.00005677027,0.0001094285,0.00005568048,0.0001068564,0.00001187169,0.00004406696,5.025175e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003107485,"about_ca_system_score_gemma":0.00002871361,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000009690122,"about_ca_topic_score_gemma":0.00002618768,"domain_scores_codex":[0.9993125,0.00002393575,0.0002970183,0.00005661585,0.0002431142,0.00006688379],"domain_scores_gemma":[0.9986351,0.0007531169,0.0001583334,0.0001659403,0.0002714446,0.00001603465],"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.00003069284,0.0001004935,0.0001090666,0.0003629878,0.00007387024,4.643488e-9,0.004176849,0.9757146,0.002329551,0.01258547,0.00003192589,0.004484516],"study_design_scores_gemma":[0.0006609019,0.00005648279,0.0009311761,0.00004018443,0.00008015839,2.79837e-7,0.0006167145,0.9297909,0.004941397,0.0628304,0.000005928559,0.00004544156],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2816111,0.00002829895,0.7172961,0.0001899434,0.00006669485,0.0006591271,0.000007526673,0.00002496416,0.0001162274],"genre_scores_gemma":[0.9850522,5.076949e-7,0.01485774,0.000006437305,0.00001818655,0.00004561027,0.000007820552,0.000008486873,0.000002953173],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.7034412,"threshold_uncertainty_score":0.1703141,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2064908122","doi":"10.1090/s0025-5718-2011-02467-1","title":"Calculating cyclotomic polynomials","year":2011,"lang":"lv","type":"article","venue":"Mathematics of Computation","topic":"Analytic Number Theory Research","field":"Mathematics","cited_by":27,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"Simon Fraser University","funders":"Natural Sciences and Engineering Research Council of Canada; Mitacs","keywords":"Algorithm; Artificial intelligence; Annotation; Computer science; Mathematics","retraction":null,"screen_n_in":null,"score":{"opus":0.1141309653254998,"gpt":0.3513512157484001,"spread":0.2372202504229003,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.002123561,0.0004002986,0.00098228,0.0003513269,0.0001409983,0.00005788151,0.0005268753,0.0002507007,0.0007900221],"category_scores_gemma":[0.001044612,0.0004024237,0.0003199208,0.0004386381,0.0003029647,0.0002006651,0.0002681498,0.0003143655,0.0005035663],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001341771,"about_ca_system_score_gemma":0.0001789646,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001105615,"about_ca_topic_score_gemma":0.000008937779,"domain_scores_codex":[0.9961818,0.000283579,0.001763709,0.0003779483,0.000848074,0.0005448493],"domain_scores_gemma":[0.995796,0.001582594,0.001316047,0.0006556087,0.000468039,0.0001816576],"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.0002695024,0.005072438,0.001705818,0.01320918,0.001807858,0.00007296093,0.1209896,0.0008707999,0.008294287,0.8313709,0.002154739,0.01418189],"study_design_scores_gemma":[0.0009763111,0.0002082766,0.0004334519,0.0009733764,0.000419018,0.00004103096,0.004173978,0.227939,0.01137462,0.7529684,0.00001271573,0.0004798963],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.6813715,0.0001198521,0.2779333,0.00003961937,0.0002120797,0.0009127865,0.00002675467,0.0001023964,0.03928174],"genre_scores_gemma":[0.8359857,0.00001019169,0.1629599,0.0000167607,0.00009432755,0.00001282995,0.00000931565,0.00009973698,0.000811173],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.2270682,"threshold_uncertainty_score":0.9998428,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1996637148","doi":"10.1090/s0025-5718-2012-02618-4","title":"Algorithms for matrix extension and orthogonal wavelet filter banks over algebraic number fields","year":2012,"lang":"en","type":"article","venue":"Mathematics of Computation","topic":"Mathematical Analysis and Transform Methods","field":"Mathematics","cited_by":26,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Alberta","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Algebraic extension; Algebraic number; Wavelet; Orthogonal matrix; Field (mathematics); Algebraic number field; Matrix (chemical analysis); Algebra over a field; Filter (signal processing); Rational number; Discrete mathematics; Algorithm; Pure mathematics; Mathematical analysis; Computer science; Orthogonal basis","retraction":null,"screen_n_in":null,"score":{"opus":0.07551442773268005,"gpt":0.3980562090061455,"spread":0.3225417812734654,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001270156,0.0002226922,0.0005674866,0.00008946434,0.00008461144,0.00003369537,0.00009586906,0.0001515095,0.0001714724],"category_scores_gemma":[0.0003494963,0.0001750003,0.0002110662,0.0001435834,0.00006002812,0.0001997792,0.00004592668,0.0001130373,0.000008558746],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001379791,"about_ca_system_score_gemma":0.00001356735,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000002391297,"about_ca_topic_score_gemma":0.000001785818,"domain_scores_codex":[0.9983249,0.00006097462,0.0007536159,0.0001949378,0.0003650248,0.0003005849],"domain_scores_gemma":[0.9973004,0.001873059,0.000306665,0.000226077,0.0001759651,0.0001178306],"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.00003934945,0.001143423,0.0003196894,0.004171995,0.000296405,0.000001158576,0.004189102,0.00003858116,0.0007403094,0.9559748,0.001993526,0.03109162],"study_design_scores_gemma":[0.000625229,0.00005798298,0.0006755065,0.0001381588,0.0002713499,0.00002612434,0.0001054843,0.1331744,0.001475268,0.8631006,0.0001188257,0.0002310633],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.3188564,0.00004981772,0.6797584,0.00009040933,0.00006891495,0.000352157,0.00001490261,0.00003407967,0.0007749877],"genre_scores_gemma":[0.4511183,0.000006968764,0.5485265,0.00003167355,0.00006197915,0.0000246941,0.00001525767,0.00002574571,0.0001889153],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.1331358,"threshold_uncertainty_score":0.7136304,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2083459883","doi":"10.1090/s0025-5718-2011-02448-8","title":"Riesz bases of wavelets and applications to numerical solutions of elliptic equations","year":2011,"lang":"en","type":"article","venue":"Mathematics of Computation","topic":"Numerical methods in engineering","field":"Engineering","cited_by":26,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"McMaster University; University of Alberta","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Biharmonic equation; Mathematics; Sobolev space; Wavelet; Mathematical analysis; Unit square; Elliptic curve; Finite element method; Bounded function; Unit sphere; Boundary value problem; Pure mathematics","retraction":null,"screen_n_in":null,"score":{"opus":0.0634521390617127,"gpt":0.2798153344291723,"spread":0.2163631953674596,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001393388,0.00007791689,0.0002137234,0.0001280364,0.00001737069,0.000002367233,0.0000743865,0.0000305599,0.00001053032],"category_scores_gemma":[0.0001481645,0.00008367445,0.00003154793,0.0002914256,0.000043534,0.00004657323,0.00002837076,0.0000428555,0.000002955213],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001282586,"about_ca_system_score_gemma":0.000007205783,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000004473214,"about_ca_topic_score_gemma":2.778806e-7,"domain_scores_codex":[0.9993163,0.00001304669,0.000395703,0.00006666261,0.0001162162,0.00009209188],"domain_scores_gemma":[0.9992351,0.0004054657,0.00008451449,0.0001346518,0.00009575069,0.00004453629],"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.000005504663,0.0004070598,0.0000785611,0.002352713,0.0001325392,2.942972e-7,0.007176095,0.6985359,0.04138463,0.1968091,0.00005118422,0.0530664],"study_design_scores_gemma":[0.0001008326,0.0000640351,0.0006245025,0.00009421733,0.00004936794,0.000001983841,0.0001712019,0.9346989,0.02377031,0.04027658,0.00003114048,0.0001169685],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01573348,0.00006294186,0.9828398,0.000006324883,0.00003401157,0.0002206799,0.00001127732,0.00005515634,0.001036308],"genre_scores_gemma":[0.5416459,0.000002935489,0.4583121,0.000001161519,0.000005446529,0.00001941595,0.00000154436,0.000009755559,0.000001716792],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.5259124,"threshold_uncertainty_score":0.3412145,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null}]}