{"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","author_layer_release":"2026-06-26"},"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","authors":[{"name":"Bernardo Cockburn","is_ca":false},{"name":"Guido Kanschat","is_ca":false},{"name":"Dominik Schötzau","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000538961,0.0004797198,0.0006296503,0.0006580402,0.0003867436,0.0008390545,0.001091975,0.0008716995,0.00246208],"category_scores_gemma":[0.000667097,0.0002069646,0.0005315535,0.000338768,0.0009018007,0.0007829749,0.0009978603,0.0008900372,0.000819125],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0005321405,"about_ca_system_score_gemma":0.000669066,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001443056,"about_ca_topic_score_gemma":0.001298107,"domain_scores_codex":[0.9997073,0.00009250206,0.00000984737,0.00004105271,0.0001300443,0.00001922411],"domain_scores_gemma":[0.9997908,0.00008627566,0.00002061914,0.00003056071,0.00004752759,0.00002421377],"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.0001504782,0.0001187716,0.002275867,0.0006257053,0.00005599798,0.0004495061,0.0005238978,0.4952988,0.05244137,0.1291848,0.003900153,0.3149746],"study_design_scores_gemma":[0.00001516836,0.00004070339,0.0001667647,0.00002988327,0.000009204499,0.00007870702,0.00003094162,0.9786882,0.003667781,0.00780241,0.009452322,0.00001786966],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.004975072,0.0002622664,0.992968,0.00008232715,0.00004938957,0.0000213377,0.00002164761,0.0001839141,0.001436001],"genre_scores_gemma":[0.2318147,0.0006720051,0.7555785,0.0001940194,0.00008318911,0.0002296513,0.0001585437,0.0002706514,0.01099883],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.00246208,"threshold_uncertainty_score":0.008236527,"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","authors":[{"name":"Steven J. Ruuth","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001485143,0.0008666658,0.0009633386,0.0004161821,0.0003090058,0.0009594822,0.0009319826,0.000869039,0.002266187],"category_scores_gemma":[0.002994019,0.000445974,0.0005426314,0.0003161275,0.001229267,0.00100797,0.001793047,0.0009991203,0.000472888],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0005305462,"about_ca_system_score_gemma":0.0008309927,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0008429921,"about_ca_topic_score_gemma":0.001059043,"domain_scores_codex":[0.9995447,0.0001974824,0.0000201806,0.00005845919,0.0001298088,0.00004945858],"domain_scores_gemma":[0.9990453,0.0004837613,0.0001270149,0.0001258655,0.0001727201,0.00004541233],"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.00009832379,0.00003888894,0.0003433782,0.0001452181,0.00002504765,0.00005080692,0.00007808778,0.921519,0.003804519,0.04234271,0.00074976,0.03080429],"study_design_scores_gemma":[0.00000996793,0.00003858015,0.00006872698,0.00001004625,0.000005432556,0.000008522697,0.000007444547,0.9918551,0.00110138,0.006113984,0.0007757644,0.000005096697],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.02735996,0.0002933741,0.965988,0.0001287009,0.00003779394,0.00003151718,0.00003575106,0.0002919516,0.005832993],"genre_scores_gemma":[0.7380543,0.0004321677,0.2515713,0.000111638,0.00006027741,0.0001772578,0.0001350341,0.0003875552,0.009070554],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.002266187,"threshold_uncertainty_score":0.007854283,"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","authors":[{"name":"Pierrick Gaudry","is_ca":false},{"name":"Emmanuel Thomé","is_ca":false},{"name":"Nicolas Thériault","is_ca":true},{"name":"Claus Diem","is_ca":false}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001466854,0.0006464257,0.0009932366,0.00113815,0.0007568175,0.001925439,0.001295008,0.000483755,0.004486797],"category_scores_gemma":[0.006829435,0.0002817446,0.0006027188,0.00103835,0.001836466,0.0030255,0.003434342,0.002299795,0.001289581],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0006567183,"about_ca_system_score_gemma":0.0007008006,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0002085108,"about_ca_topic_score_gemma":0.0003072092,"domain_scores_codex":[0.99858,0.0003374105,0.00006521691,0.0002372478,0.0006511117,0.0001289432],"domain_scores_gemma":[0.9978856,0.0007641781,0.0001340165,0.0008576675,0.0002394221,0.0001189802],"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.0004369788,0.00009389096,0.001848544,0.0002275597,0.000041434,0.0004284446,0.0003283201,0.02893034,0.02292778,0.5882847,0.004821859,0.3516301],"study_design_scores_gemma":[0.0001254842,0.000380079,0.001287248,0.00007335677,0.00005185261,0.001088686,0.0001168938,0.3501492,0.04179935,0.5696054,0.03519522,0.0001272632],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.04493378,0.0004128553,0.9456434,0.0003277749,0.0001555621,0.00007612318,0.00003779661,0.001181922,0.007230836],"genre_scores_gemma":[0.3663037,0.0004801771,0.6269546,0.0001929711,0.0003185632,0.00009145051,0.0001173072,0.0005037363,0.005037361],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.004486797,"threshold_uncertainty_score":0.01500982,"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","authors":[{"name":"P. B. Borwein","is_ca":true},{"name":"Ron Ferguson","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00140147,0.002891835,0.001455981,0.003734585,0.002329588,0.004044786,0.002520656,0.001606989,0.08632122],"category_scores_gemma":[0.005483904,0.001253025,0.002309796,0.005611766,0.001678762,0.00615616,0.002720505,0.004333007,0.1027602],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001747652,"about_ca_system_score_gemma":0.001370489,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002407804,"about_ca_topic_score_gemma":0.002228324,"domain_scores_codex":[0.9977868,0.0003986665,0.0002494813,0.0004251362,0.0009170497,0.000222929],"domain_scores_gemma":[0.9990532,0.0002822736,0.00006061944,0.0002221927,0.0003345172,0.00004721398],"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.0001192956,0.00006942317,0.0001652664,0.0007030015,0.00003850588,0.0003263008,0.0002972995,0.001882219,0.003640087,0.6369852,0.1673477,0.1884258],"study_design_scores_gemma":[0.00002098164,0.00005038165,0.0001441906,0.000121308,0.000009721163,0.0006567814,0.0000579609,0.002181482,0.002380157,0.2859841,0.7083148,0.000078084],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.002688526,0.02152022,0.6661278,0.003022598,0.004243174,0.0004008321,0.006803317,0.01167222,0.2835213],"genre_scores_gemma":[0.08028163,0.02333088,0.6312187,0.008224489,0.003877051,0.002163721,0.01580966,0.01898364,0.2161103],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.08632122,"threshold_uncertainty_score":0.2887732,"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","authors":[{"name":"Edlyn Teske","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003595403,0.0008276086,0.001139902,0.00178348,0.001375277,0.002141994,0.001394756,0.001691847,0.008791092],"category_scores_gemma":[0.02037883,0.0004562415,0.001156345,0.001511391,0.002425481,0.004051389,0.002564334,0.002489084,0.003643109],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001113103,"about_ca_system_score_gemma":0.001431547,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001672935,"about_ca_topic_score_gemma":0.001322679,"domain_scores_codex":[0.9962091,0.002039154,0.0001261997,0.0004574084,0.0007888207,0.000379226],"domain_scores_gemma":[0.991937,0.005251719,0.0003351355,0.00146879,0.0007525521,0.0002548172],"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.0002377925,0.00008449637,0.0007258101,0.0001047539,0.00003364661,0.0001585138,0.0002699915,0.04513151,0.002619934,0.8919305,0.005113598,0.05358944],"study_design_scores_gemma":[0.00009651704,0.00009926535,0.0001634522,0.00004759222,0.00001555956,0.0001305153,0.00005224869,0.492129,0.003193418,0.4957926,0.008229475,0.00005042931],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0212213,0.0005103611,0.9648561,0.0006806173,0.0002020924,0.0001687262,0.00007997778,0.0009839626,0.01129688],"genre_scores_gemma":[0.4782806,0.001110357,0.493236,0.0007954694,0.0004763754,0.0009275095,0.0003418444,0.0009594749,0.02387228],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.008791092,"threshold_uncertainty_score":0.02940911,"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","authors":[{"name":"Adam M. Oberman","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001111676,0.0003363916,0.0005375105,0.000519265,0.0004135788,0.0006762188,0.0007762582,0.0007448739,0.0009531367],"category_scores_gemma":[0.002678484,0.0002389469,0.0005525455,0.0002206129,0.00125518,0.001504723,0.002088129,0.001403049,0.0002140206],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0006955738,"about_ca_system_score_gemma":0.0006059359,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0004432527,"about_ca_topic_score_gemma":0.000412102,"domain_scores_codex":[0.9997442,0.00005823347,0.00001753358,0.000047129,0.0001148181,0.00001814611],"domain_scores_gemma":[0.999491,0.0001729089,0.00006426292,0.00007613753,0.0001050947,0.00009061435],"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.0000739345,0.00005636152,0.0007792246,0.0001108792,0.00001450766,0.0001998308,0.000438442,0.09971021,0.03716614,0.8149015,0.0007470902,0.04580185],"study_design_scores_gemma":[0.00004486951,0.0002491226,0.0002738543,0.00006129514,0.00001181761,0.0003041635,0.00009304922,0.7892604,0.01567337,0.1811553,0.01283381,0.00003890895],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.06464407,0.0001569889,0.9317518,0.0001248568,0.00003873694,0.00004877671,0.00002499528,0.00007347216,0.003136378],"genre_scores_gemma":[0.3865793,0.0003711633,0.6020599,0.00009715515,0.000034383,0.000173773,0.0001181176,0.0001111791,0.01045509],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.001111676,"threshold_uncertainty_score":0.005879164,"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","authors":[{"name":"Yong Zhang","is_ca":true},{"name":"Bin Dong","is_ca":false},{"name":"Zhaosong Lu","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009931183,0.0008665621,0.0008900032,0.0007752657,0.0002913003,0.0008790381,0.0009361962,0.0009601521,0.002698618],"category_scores_gemma":[0.001765797,0.0003169064,0.0008295335,0.0008017358,0.0008104209,0.0009820617,0.001303428,0.001138574,0.001168079],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0007474116,"about_ca_system_score_gemma":0.0009533878,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001918406,"about_ca_topic_score_gemma":0.001561773,"domain_scores_codex":[0.9995301,0.00009923702,0.00002214419,0.00008101614,0.0002258606,0.00004165727],"domain_scores_gemma":[0.9996843,0.00009786838,0.00004374524,0.0000393603,0.0001120944,0.00002258462],"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.0002282254,0.00008139498,0.0003343046,0.0004782052,0.00009051941,0.0001647911,0.0001976807,0.3050105,0.03868438,0.3255078,0.0122621,0.31696],"study_design_scores_gemma":[0.000009701108,0.00005375837,0.0001167835,0.0000255713,0.00001724824,0.00007596778,0.00002194337,0.9498538,0.004908283,0.03719528,0.007708602,0.00001307125],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.002159178,0.0002535426,0.9956169,0.0001162221,0.00003682619,0.00001368765,0.00002721174,0.00008660386,0.001689923],"genre_scores_gemma":[0.1335003,0.002436511,0.8444697,0.0003118628,0.0002480411,0.000230429,0.0005674723,0.0003373479,0.01789836],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.002698618,"threshold_uncertainty_score":0.009027839,"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","authors":[{"name":"Jesús Carrero","is_ca":false},{"name":"Bernardo Cockburn","is_ca":false},{"name":"Dominik Schötzau","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009309368,0.0009448617,0.0007170851,0.0008060597,0.0003402056,0.0009108759,0.001070238,0.001697563,0.002798293],"category_scores_gemma":[0.001795811,0.0004171998,0.0009462179,0.0004737317,0.001469544,0.0009917213,0.002015824,0.001287017,0.000992981],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0007661606,"about_ca_system_score_gemma":0.0007881604,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001801883,"about_ca_topic_score_gemma":0.001414862,"domain_scores_codex":[0.9994185,0.0002193611,0.00001814902,0.00009622418,0.0002103356,0.00003750532],"domain_scores_gemma":[0.9994332,0.0002664578,0.00005413196,0.00007058738,0.0001179821,0.00005765451],"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.0001142548,0.00008507296,0.001459145,0.0003010952,0.0000931113,0.000257394,0.0002800054,0.6759789,0.02816383,0.1735983,0.003282584,0.1163863],"study_design_scores_gemma":[0.000009559557,0.00002519924,0.00008067858,0.00001225378,0.000005633317,0.00004341794,0.00001451535,0.9807209,0.001841922,0.01410641,0.003128989,0.00001049904],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.006204355,0.0001911506,0.9906905,0.0001135864,0.00004619751,0.00002268815,0.00003784773,0.0001113141,0.00258248],"genre_scores_gemma":[0.2372845,0.0004622884,0.7471189,0.0003083438,0.0001154656,0.0003302609,0.0003013049,0.0003725016,0.01370643],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.002798293,"threshold_uncertainty_score":0.009361207,"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","authors":[{"name":"Alin Bostan","is_ca":false},{"name":"François Morain","is_ca":false},{"name":"Bruno Salvy","is_ca":false},{"name":"Éric Schost","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003491446,0.002568861,0.001614712,0.004493881,0.001498691,0.004951979,0.002720816,0.00175921,0.01165628],"category_scores_gemma":[0.01517916,0.000943005,0.002585183,0.004335005,0.002432906,0.01392731,0.005513641,0.004597502,0.0058715],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002743893,"about_ca_system_score_gemma":0.0020019,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001480814,"about_ca_topic_score_gemma":0.001490053,"domain_scores_codex":[0.9956672,0.0007294873,0.0003919726,0.001015584,0.001717993,0.0004777497],"domain_scores_gemma":[0.9932278,0.002768265,0.0004187796,0.002060731,0.001294463,0.0002300022],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"not_applicable","study_design_scores_codex":[0.0004561805,0.0002147639,0.002415956,0.0006244788,0.0001213406,0.0001057929,0.0006055023,0.02552611,0.006903836,0.4574948,0.01601931,0.4895119],"study_design_scores_gemma":[0.0001485614,0.0001955962,0.0007211986,0.0001542037,0.00006046312,0.0002700817,0.0002513422,0.08683928,0.01067096,0.8713038,0.02928819,0.00009643311],"study_design_candidate":"not_applicable","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.01945496,0.001736602,0.9627548,0.0006136888,0.0003506218,0.0001467384,0.0003966571,0.003319907,0.01122595],"genre_scores_gemma":[0.1957631,0.00215876,0.7817287,0.0004539357,0.000699508,0.0004571277,0.002423988,0.001781287,0.01453358],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.01165628,"threshold_uncertainty_score":0.03899413,"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","authors":[{"name":"Nils Bruin","is_ca":true},{"name":"Michael Stoll","is_ca":false}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003745994,0.0004399155,0.0007451817,0.001101897,0.000759663,0.001379171,0.0006112366,0.0005012354,0.005043516],"category_scores_gemma":[0.001679075,0.0002290607,0.0006002282,0.00066449,0.0006997029,0.001370343,0.001762467,0.0008574442,0.001680478],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0007136681,"about_ca_system_score_gemma":0.0004104866,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0008555538,"about_ca_topic_score_gemma":0.001045942,"domain_scores_codex":[0.9995418,0.00005028489,0.00002519937,0.00007557077,0.0002175752,0.00008969177],"domain_scores_gemma":[0.9995035,0.0001700023,0.00002766393,0.0001016528,0.0001292584,0.00006792413],"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.0004782965,0.00016878,0.004678165,0.0003423574,0.00004470126,0.0007053353,0.001158641,0.02288884,0.04517457,0.6115121,0.007657534,0.3051907],"study_design_scores_gemma":[0.0001187825,0.0002240295,0.003131213,0.00008913375,0.0000303899,0.0008418392,0.0003679961,0.2578618,0.06438327,0.6270896,0.0457711,0.00009091326],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.4058309,0.0002315793,0.5557951,0.0003524943,0.00009667323,0.0001473841,0.000539039,0.001960198,0.03504665],"genre_scores_gemma":[0.7299734,0.0001615838,0.2515666,0.00009950697,0.00005500566,0.000131609,0.001202678,0.0007793669,0.01603022],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.005043516,"threshold_uncertainty_score":0.01687223,"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","authors":[{"name":"James D. Currie","is_ca":true},{"name":"Narad Rampersad","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003028709,0.001368992,0.001257645,0.001699793,0.003732112,0.003058573,0.002478856,0.002395045,0.02429801],"category_scores_gemma":[0.01526001,0.0008200958,0.002544686,0.001772997,0.005495484,0.007533239,0.006443961,0.006250668,0.003890759],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.004169567,"about_ca_system_score_gemma":0.00276436,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.007347043,"about_ca_topic_score_gemma":0.006892199,"domain_scores_codex":[0.996636,0.0005548556,0.000137582,0.000946562,0.000856542,0.0008684601],"domain_scores_gemma":[0.9905088,0.004609582,0.0004801048,0.001499432,0.002142628,0.0007594562],"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.0001295038,0.00007678784,0.001598624,0.0001509874,0.00003065659,0.0002190872,0.0003063328,0.002110201,0.0008966345,0.9526339,0.03174179,0.01010563],"study_design_scores_gemma":[0.00007105841,0.00005515973,0.0009947727,0.00007178989,0.000031421,0.0002793527,0.0001748588,0.01265756,0.001140144,0.9431667,0.04131747,0.00003952885],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"other","genre_gemma":"empirical","genre_scores_codex":[0.1354565,0.003338174,0.1513094,0.05994169,0.006418846,0.0001884108,0.002636131,0.001694925,0.6390159],"genre_scores_gemma":[0.8446797,0.001881945,0.05097716,0.01480569,0.002653725,0.0003473923,0.002704357,0.0005331456,0.08141693],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.02429801,"threshold_uncertainty_score":0.08128494,"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","authors":[{"name":"Thomas P. Wihler","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005064232,0.0003924499,0.0004055202,0.0003116457,0.0003267867,0.0003561299,0.001131541,0.000815596,0.001461044],"category_scores_gemma":[0.00133634,0.0002262207,0.0002659355,0.0002455277,0.0005855815,0.0006259606,0.001033024,0.0007250859,0.0003361616],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001975605,"about_ca_system_score_gemma":0.0003057556,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000334794,"about_ca_topic_score_gemma":0.0004358879,"domain_scores_codex":[0.9997498,0.00007514569,0.00001269992,0.00002735988,0.0001211586,0.000013726],"domain_scores_gemma":[0.9994843,0.0003075799,0.00004650764,0.00007403738,0.00006425685,0.00002330743],"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.0001677972,0.0001474211,0.001195033,0.0002716127,0.00003593039,0.0002391255,0.0002149577,0.4899745,0.1771116,0.0409887,0.001175116,0.2884782],"study_design_scores_gemma":[0.00001125883,0.00003648519,0.0001343768,0.000008797528,0.000004835594,0.0000755034,0.00000624422,0.9852715,0.007580834,0.004944921,0.001914425,0.00001085],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.006516291,0.00006505825,0.9927072,0.0000434179,0.00001435423,0.00001213847,0.000009088449,0.0001465027,0.0004860151],"genre_scores_gemma":[0.2779572,0.0001917888,0.7183253,0.00008794644,0.00003049928,0.0001583172,0.00005289213,0.000104443,0.00309155],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.001461044,"threshold_uncertainty_score":0.00488764,"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","authors":[{"name":"Len Bos","is_ca":true},{"name":"Jean-Paul Calvi","is_ca":false},{"name":"N. Levenberg","is_ca":false},{"name":"Alvise Sommariva","is_ca":false},{"name":"Michelangelo Vianello","is_ca":false}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008745781,0.0008113218,0.0008262533,0.001019818,0.0003982427,0.001165793,0.001020808,0.001212685,0.00256689],"category_scores_gemma":[0.005992298,0.0003583641,0.0005369181,0.001025852,0.001293263,0.001433401,0.001647466,0.001477602,0.001216349],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000489236,"about_ca_system_score_gemma":0.000400196,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0008884988,"about_ca_topic_score_gemma":0.001278999,"domain_scores_codex":[0.9993675,0.0002097435,0.00002486818,0.00004963389,0.0003060389,0.00004217012],"domain_scores_gemma":[0.9991019,0.000452471,0.00008350362,0.0001767032,0.0001421168,0.00004334529],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0001310049,0.00003421938,0.0007336356,0.0001249902,0.00002466676,0.0001015022,0.0001460622,0.5591825,0.008888063,0.3422097,0.001537158,0.08688659],"study_design_scores_gemma":[0.000007713026,0.00002399728,0.00007428599,0.00001400713,0.000003186776,0.00002823464,0.00002692799,0.8882819,0.003301814,0.1060257,0.002202786,0.000009396787],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.004193242,0.00002762666,0.994864,0.00003960421,0.00001542818,0.00001052512,0.00001761094,0.0001042633,0.0007277413],"genre_scores_gemma":[0.2121953,0.0001543268,0.7842576,0.00005044027,0.00003176159,0.0001046784,0.0001605908,0.00020377,0.002841562],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.00256689,"threshold_uncertainty_score":0.008587122,"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","authors":[{"name":"Allan Hungria","is_ca":false},{"name":"Jean‐Philippe Lessard","is_ca":true},{"name":"J. D. Mireles James","is_ca":false}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0045259,0.001406259,0.0009386825,0.002220809,0.0007451543,0.002760064,0.001871018,0.001170592,0.006884423],"category_scores_gemma":[0.01811711,0.0005609232,0.001314182,0.00131159,0.002101623,0.005396673,0.002633751,0.003455914,0.0030906],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001644688,"about_ca_system_score_gemma":0.001334658,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002013138,"about_ca_topic_score_gemma":0.00120121,"domain_scores_codex":[0.9974456,0.001163221,0.0001283594,0.0001674899,0.0009704489,0.0001248366],"domain_scores_gemma":[0.9962866,0.00205483,0.0002917845,0.0005400331,0.0006853456,0.0001412605],"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.00003248852,0.0000170061,0.000172013,0.0001696507,0.0000162191,0.0000586073,0.0001406849,0.04509944,0.001647329,0.9225361,0.004010288,0.02610005],"study_design_scores_gemma":[0.00001288157,0.00002101532,0.0001535754,0.00005788355,0.000008647135,0.00003539113,0.00004089703,0.546519,0.0009780675,0.4383769,0.01377395,0.00002173852],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.00484234,0.001550746,0.9760377,0.0008364869,0.0002535493,0.00003106659,0.00009383955,0.0004548553,0.0158994],"genre_scores_gemma":[0.2785482,0.005547861,0.6850449,0.0005145731,0.001073354,0.0004979101,0.0004581359,0.002875807,0.02543923],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.006884423,"threshold_uncertainty_score":0.02393556,"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","authors":[{"name":"Vassil S. Dimitrov","is_ca":true},{"name":"Laurent Imbert","is_ca":true},{"name":"Pradeep Kumar Mishra","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008398123,0.0008981468,0.0006411074,0.001437505,0.001010806,0.002864428,0.001030988,0.000933252,0.008409549],"category_scores_gemma":[0.003337626,0.0004463362,0.0006029015,0.001913525,0.001569113,0.003708355,0.002505434,0.002327521,0.006100088],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0008812236,"about_ca_system_score_gemma":0.0008614254,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0004451482,"about_ca_topic_score_gemma":0.000360843,"domain_scores_codex":[0.9989573,0.0001884364,0.00009224343,0.0002184942,0.0004295465,0.0001139375],"domain_scores_gemma":[0.9993076,0.0001529911,0.0000601278,0.0002605026,0.0001656001,0.00005308385],"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.000162963,0.00003021183,0.0003168685,0.0001681341,0.000009959461,0.0002663802,0.0002081492,0.006129957,0.01359987,0.8469387,0.005864005,0.1263048],"study_design_scores_gemma":[0.00008174356,0.0002018834,0.0003075086,0.0001697132,0.00002842537,0.001614508,0.0001121812,0.09015799,0.04337376,0.6495623,0.2142742,0.0001157879],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.01379304,0.001081152,0.9528986,0.000429694,0.0005181573,0.0001117032,0.0001541611,0.001304649,0.02970887],"genre_scores_gemma":[0.2509769,0.002083648,0.7195783,0.0003447292,0.0004785552,0.0002763163,0.0004220472,0.0007444428,0.02509503],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.008409549,"threshold_uncertainty_score":0.0281328,"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","authors":[{"name":"John Friedlander","is_ca":true},{"name":"Carl Pomerance","is_ca":false},{"name":"Igor E. Shparlinski","is_ca":false}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000786744,0.0003963265,0.0004071576,0.0009892762,0.001087874,0.001898588,0.0005930001,0.0008029894,0.01256307],"category_scores_gemma":[0.007395184,0.0002121862,0.0004737457,0.0006094821,0.00182208,0.002218383,0.001012518,0.001599917,0.00174296],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00147136,"about_ca_system_score_gemma":0.000653249,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001398481,"about_ca_topic_score_gemma":0.0007678504,"domain_scores_codex":[0.9995964,0.0001119665,0.00001213358,0.00007527466,0.0001028348,0.0001013997],"domain_scores_gemma":[0.9984659,0.0009505328,0.00008339518,0.0002233547,0.0001690218,0.00010783],"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.00005007343,0.000006702282,0.0001821957,0.00001567095,0.000003080626,0.0000934,0.00007302698,0.001475243,0.0003605549,0.9872217,0.003372402,0.007145948],"study_design_scores_gemma":[0.00003459636,0.00002450408,0.0002519966,0.00001805949,0.000007341647,0.0002087335,0.00004195812,0.02038878,0.001488516,0.9615547,0.01596221,0.00001855561],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"other","genre_gemma":"empirical","genre_scores_codex":[0.1905642,0.002051557,0.3925826,0.008599916,0.001315556,0.0001071338,0.0004879964,0.001179528,0.4031115],"genre_scores_gemma":[0.9406532,0.0003916176,0.02357054,0.000441331,0.0003222408,0.00007617407,0.00009731911,0.000289767,0.03415769],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01256307,"threshold_uncertainty_score":0.04202771,"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","authors":[{"name":"Andreas Enge","is_ca":false}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001983917,0.001754545,0.001921485,0.001448494,0.001482052,0.007330658,0.002890481,0.001480197,0.02297007],"category_scores_gemma":[0.01623911,0.0007343027,0.002407079,0.00233162,0.001847872,0.01275353,0.005099511,0.003989005,0.009000111],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.004040537,"about_ca_system_score_gemma":0.003297976,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.004148918,"about_ca_topic_score_gemma":0.006655243,"domain_scores_codex":[0.9966096,0.0003791277,0.0002274918,0.0009239771,0.001257836,0.0006020862],"domain_scores_gemma":[0.9924091,0.004167018,0.0004677998,0.001756386,0.0007828803,0.0004168113],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.002778847,0.0007724381,0.01107681,0.0026465,0.0004339059,0.001422437,0.001749961,0.1229664,0.02603283,0.3286075,0.100524,0.4009884],"study_design_scores_gemma":[0.000390915,0.0001293969,0.001196311,0.00008712283,0.0001355915,0.0004799494,0.0004146174,0.2768881,0.01541627,0.6908712,0.01390599,0.0000845113],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2563856,0.002250095,0.6489664,0.0088851,0.0006802136,0.0003780259,0.006153252,0.02652498,0.04977629],"genre_scores_gemma":[0.7539713,0.001033437,0.2114807,0.0009599536,0.0006899275,0.0002131019,0.007507621,0.002746986,0.02139704],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.02297007,"threshold_uncertainty_score":0.07684255,"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","authors":[{"name":"Richard J. McIntosh","is_ca":true},{"name":"Eric L. F. Roettger","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001054431,0.0007437018,0.00112477,0.002688319,0.002415445,0.002687148,0.0007584236,0.00142844,0.03034919],"category_scores_gemma":[0.009700951,0.0005721077,0.001078898,0.002560026,0.001359903,0.004210245,0.001680362,0.00184123,0.006707649],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001510838,"about_ca_system_score_gemma":0.001118396,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001042822,"about_ca_topic_score_gemma":0.001697265,"domain_scores_codex":[0.9994332,0.00009019348,0.00003660377,0.0001602449,0.0001684008,0.0001114338],"domain_scores_gemma":[0.9979772,0.001241437,0.0001394865,0.0002107367,0.0003075701,0.0001236979],"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.0004062328,0.00008590436,0.001775547,0.0003380635,0.00003228952,0.001455258,0.0007365027,0.00188548,0.004234481,0.8825603,0.02805137,0.07843857],"study_design_scores_gemma":[0.00009343764,0.0000936297,0.0006729535,0.0001347891,0.00004004189,0.001226685,0.000595567,0.01018176,0.006588546,0.9022634,0.07806449,0.00004461248],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.410984,0.006253666,0.2144799,0.008121968,0.001758149,0.0002429952,0.002244182,0.002123802,0.3537914],"genre_scores_gemma":[0.7751668,0.001638306,0.1437505,0.001373017,0.0005030501,0.0001798289,0.003376591,0.0008751085,0.07313669],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.03034919,"threshold_uncertainty_score":0.1015282,"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","authors":[{"name":"James A. Muir","is_ca":true},{"name":"Douglas R. Stinson","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000982694,0.0006374473,0.0006641943,0.001114778,0.00225992,0.003561353,0.001455868,0.0008602812,0.01660369],"category_scores_gemma":[0.0052502,0.000888739,0.001505923,0.001203288,0.002142496,0.006163104,0.002553096,0.002089277,0.003820353],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001182908,"about_ca_system_score_gemma":0.0007902951,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002199607,"about_ca_topic_score_gemma":0.002748064,"domain_scores_codex":[0.9984772,0.000237137,0.0001552021,0.0005373675,0.0004027897,0.000190298],"domain_scores_gemma":[0.9980799,0.0007415256,0.0001580823,0.0003280815,0.0005511849,0.0001411082],"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.0001206308,0.00003788275,0.0006571212,0.0001603333,0.00003211617,0.0002523096,0.0007655647,0.0006812974,0.002443405,0.967348,0.005783293,0.02171795],"study_design_scores_gemma":[0.00003361056,0.00004673611,0.0006252252,0.00005618964,0.00005112974,0.0004254768,0.0003517209,0.003029493,0.004095163,0.9480346,0.04321514,0.00003539047],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1691359,0.001655476,0.4643888,0.003709708,0.0007956378,0.0002256398,0.002939005,0.002171735,0.3549781],"genre_scores_gemma":[0.7551953,0.0007710156,0.1333067,0.001062679,0.0005895429,0.0003729209,0.00353516,0.001366157,0.1038005],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01660369,"threshold_uncertainty_score":0.05554485,"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","authors":[{"name":"Len Bos","is_ca":true},{"name":"Mark A. Taylor","is_ca":false},{"name":"Beth Wingate","is_ca":false}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009233882,0.0005487154,0.0005422576,0.001149836,0.0008993903,0.002426145,0.0007475416,0.0009098801,0.006198657],"category_scores_gemma":[0.004722666,0.0003266101,0.0005058851,0.0009272074,0.002144972,0.002785777,0.00166069,0.001646102,0.003122937],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0005637998,"about_ca_system_score_gemma":0.0005471621,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001219206,"about_ca_topic_score_gemma":0.0009404845,"domain_scores_codex":[0.9993744,0.0001415984,0.00003313926,0.00009311124,0.0002884175,0.00006936553],"domain_scores_gemma":[0.9986978,0.000399709,0.0001248047,0.0002114553,0.0004722863,0.00009394958],"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.00009983033,0.00002057963,0.0006112923,0.00008499666,0.000009892811,0.00009097477,0.0002826047,0.0134023,0.003950805,0.9383042,0.002248161,0.04089439],"study_design_scores_gemma":[0.00002108014,0.00005130816,0.0004065929,0.0000675101,0.00001081086,0.0002966971,0.0002280199,0.1488046,0.007959184,0.8215961,0.02051287,0.00004517711],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.07127927,0.0003794007,0.9026431,0.0002755094,0.0001429735,0.00004857015,0.0001247622,0.0003315475,0.02477487],"genre_scores_gemma":[0.6446385,0.0006797491,0.3351309,0.0002694758,0.0001115865,0.0001665828,0.0003913412,0.0007410892,0.01787073],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.006198657,"threshold_uncertainty_score":0.02073652,"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","authors":[{"name":"Martin J. Gander","is_ca":true},{"name":"Laurence Halpern","is_ca":false}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001249484,0.0008759838,0.0008713416,0.0007424806,0.0008948079,0.001462591,0.0009571489,0.001237884,0.006490482],"category_scores_gemma":[0.005470063,0.000437204,0.0006188496,0.0009284627,0.001600229,0.002235268,0.001876212,0.002370377,0.002505027],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0005270977,"about_ca_system_score_gemma":0.0007999159,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0005295262,"about_ca_topic_score_gemma":0.0004135334,"domain_scores_codex":[0.9989076,0.0003623153,0.00007086165,0.00008712059,0.0004980016,0.00007415127],"domain_scores_gemma":[0.9983793,0.0008184012,0.0001269694,0.0002644986,0.0003423934,0.00006828747],"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.00008806961,0.00004427856,0.0001731809,0.0001694978,0.00002142771,0.0001782482,0.0001637883,0.07137133,0.01413898,0.8630165,0.005390222,0.04524434],"study_design_scores_gemma":[0.00006505306,0.00004404385,0.000112811,0.00007332858,0.00001878188,0.0001724798,0.00005444772,0.5474759,0.01185409,0.4064197,0.03368445,0.00002495727],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.004450687,0.0006384082,0.9811081,0.0004987098,0.0001788238,0.00004706985,0.00004143301,0.00024499,0.01279175],"genre_scores_gemma":[0.2112118,0.002056703,0.7658256,0.0005473886,0.0005435772,0.000633699,0.0003288724,0.0008627163,0.0179898],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.006490482,"threshold_uncertainty_score":0.02171278,"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","authors":[{"name":"Willem Hundsdorfer","is_ca":false},{"name":"Steven J. Ruuth","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.006389929,0.0007048603,0.0006203575,0.0009459354,0.0007026253,0.001050123,0.001084415,0.0009002738,0.002484],"category_scores_gemma":[0.01806705,0.0003404508,0.0008902933,0.0004405238,0.002880567,0.00275709,0.00213563,0.002823834,0.0005058103],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0006036297,"about_ca_system_score_gemma":0.0008913577,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001190314,"about_ca_topic_score_gemma":0.000648763,"domain_scores_codex":[0.9968176,0.001254566,0.0001185927,0.0002474531,0.001367496,0.0001942971],"domain_scores_gemma":[0.9849678,0.0104074,0.0009625896,0.0009266456,0.002421811,0.0003137303],"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.0001686804,0.0001123417,0.001593683,0.0007134476,0.00005356608,0.0005477816,0.0007235837,0.120021,0.03059813,0.7602184,0.00195315,0.08329621],"study_design_scores_gemma":[0.00001833642,0.0001405258,0.0006608766,0.0001543896,0.00002077654,0.0003114726,0.00007439307,0.7797406,0.009475993,0.2029368,0.006428836,0.00003708261],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.02996558,0.003571806,0.9417971,0.0008833815,0.0001099215,0.00009166873,0.0000477898,0.000138415,0.02339423],"genre_scores_gemma":[0.788498,0.004329331,0.1932818,0.0006509328,0.0003976564,0.000455098,0.0001446216,0.0004056614,0.01183682],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.006389929,"threshold_uncertainty_score":0.03379357,"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","authors":[{"name":"Youness Lamzouri","is_ca":true},{"name":"Xiannan Li","is_ca":false},{"name":"K. Soundararajan","is_ca":false}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003604805,0.001333761,0.001453478,0.002701684,0.002649607,0.003811428,0.002551364,0.002883181,0.1238208],"category_scores_gemma":[0.03722627,0.0005495784,0.001723812,0.001797712,0.00274661,0.005088938,0.002679961,0.006949595,0.06441551],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.005872377,"about_ca_system_score_gemma":0.002769648,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.009464268,"about_ca_topic_score_gemma":0.01065851,"domain_scores_codex":[0.9959884,0.0006612052,0.0003430062,0.0006918924,0.002011959,0.0003033906],"domain_scores_gemma":[0.9858423,0.003316527,0.0004727369,0.001436392,0.008399664,0.0005324073],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","study_design_scores_codex":[0.00001555538,0.000006907268,0.00004923958,0.00008038789,0.000008237845,0.00005043088,0.00002695913,0.00007271776,0.00005250617,0.02206766,0.9713765,0.006192967],"study_design_scores_gemma":[0.00001911502,0.00001757878,0.0005822569,0.0001900318,0.00003178549,0.0002378321,0.00006758354,0.0009536512,0.0006025566,0.04751477,0.9497328,0.00005000154],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","genre_codex":"editorial","genre_gemma":"other","genre_scores_codex":[0.0006721679,0.004128549,0.01404086,0.1553847,0.7482374,0.00006611507,0.002905229,0.001391104,0.07317386],"genre_scores_gemma":[0.03691833,0.008343918,0.01882356,0.07799209,0.1655567,0.0003508076,0.004773798,0.006352045,0.6808888],"genre_candidate":"other","genre_consensus":null,"teacher_disagreement_score":0.1238208,"threshold_uncertainty_score":0.4142217,"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","authors":[{"name":"John Friedlander","is_ca":true},{"name":"Igor E. Shparlinski","is_ca":false}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003397959,0.0009550101,0.0009056174,0.002402894,0.001089675,0.002102586,0.001558704,0.001018278,0.0118232],"category_scores_gemma":[0.02025468,0.0005239747,0.001052617,0.001350185,0.003683152,0.005470878,0.003063682,0.003140717,0.002573543],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001748401,"about_ca_system_score_gemma":0.0009711031,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000514761,"about_ca_topic_score_gemma":0.0002583981,"domain_scores_codex":[0.9977372,0.000946163,0.0000733144,0.0003808534,0.0005611831,0.0003014149],"domain_scores_gemma":[0.9886452,0.007767619,0.0007159768,0.00135207,0.001075002,0.0004441473],"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.00008735184,0.00002184158,0.0006319545,0.00005804653,0.00001539134,0.0001231114,0.0001827109,0.006856658,0.002397857,0.9761714,0.002216651,0.01123695],"study_design_scores_gemma":[0.00006635728,0.0000895898,0.0004787376,0.00005165309,0.00002578622,0.0003972761,0.00006275862,0.1571677,0.006052895,0.8277301,0.007839018,0.00003805603],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.05075166,0.000654046,0.9110639,0.00148675,0.0001460997,0.00009207532,0.0002822787,0.0004501891,0.03507304],"genre_scores_gemma":[0.8707598,0.001436179,0.0924591,0.0007857612,0.001041032,0.0005584793,0.0004638048,0.0007529867,0.03174275],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.0118232,"threshold_uncertainty_score":0.03955257,"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","authors":[{"name":"Chun‐Hua Guo","is_ca":true},{"name":"Peter Lancaster","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001198313,0.001035409,0.000691272,0.0008425717,0.0009405952,0.001780823,0.001712355,0.001374013,0.02113873],"category_scores_gemma":[0.008528688,0.0005473493,0.0009735609,0.001065808,0.0009841889,0.003264042,0.003766027,0.00239187,0.006251094],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0009595453,"about_ca_system_score_gemma":0.0008458549,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002361309,"about_ca_topic_score_gemma":0.003684876,"domain_scores_codex":[0.9991193,0.000278744,0.00005924837,0.0001860105,0.0002424822,0.0001142094],"domain_scores_gemma":[0.9975376,0.00145021,0.0001270431,0.0003138518,0.0004314698,0.0001398729],"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.0001845397,0.0001732276,0.001426748,0.0004459497,0.00008874652,0.0002010578,0.0005433804,0.1712251,0.002422773,0.5832943,0.03669091,0.2033034],"study_design_scores_gemma":[0.00004363947,0.00002738812,0.0001415765,0.00002803456,0.000008657512,0.00006008266,0.0001023834,0.5022758,0.0008207746,0.4871742,0.009300921,0.00001653665],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.008536661,0.0003938414,0.9728413,0.0008441802,0.0001941427,0.00006617871,0.0001533574,0.0009013442,0.01606903],"genre_scores_gemma":[0.2344099,0.0007828944,0.7151266,0.0006160045,0.0003790409,0.0003966107,0.001099007,0.001468665,0.04572128],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.02113873,"threshold_uncertainty_score":0.07071608,"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","authors":[{"name":"Sebastian Pauli","is_ca":true},{"name":"Xavier-François Roblot","is_ca":false}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001709761,0.001073607,0.001131652,0.001582451,0.001698051,0.003646805,0.001319255,0.0008047635,0.01506648],"category_scores_gemma":[0.005540324,0.0004640606,0.001766613,0.001670871,0.002713617,0.009086708,0.002994753,0.002041926,0.002813427],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00275649,"about_ca_system_score_gemma":0.001015911,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002773097,"about_ca_topic_score_gemma":0.004354186,"domain_scores_codex":[0.9990315,0.0001725345,0.00006629468,0.0002615477,0.000250048,0.0002179367],"domain_scores_gemma":[0.9983877,0.0009178646,0.00009388558,0.000194087,0.0002769141,0.0001294793],"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.0002178962,0.0000359784,0.0009420178,0.0002587258,0.00002837221,0.0001419979,0.0004724212,0.005731904,0.001084619,0.9511377,0.006468154,0.0334803],"study_design_scores_gemma":[0.0000347566,0.00003663488,0.0003547363,0.00006910711,0.00002784646,0.0001157431,0.0001545599,0.01257033,0.001487594,0.9734409,0.01168409,0.00002361249],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2539605,0.001532441,0.6149784,0.002162793,0.0005076005,0.0002041231,0.002163912,0.002351465,0.1221388],"genre_scores_gemma":[0.714721,0.001063316,0.2303934,0.0005617695,0.000388572,0.0002547943,0.003456052,0.001089677,0.04807137],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01506648,"threshold_uncertainty_score":0.0504024,"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","authors":[{"name":"Koray Karabina","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004337055,0.000409016,0.0004156089,0.0007533004,0.0004942441,0.0008736295,0.0006090518,0.000507796,0.00377914],"category_scores_gemma":[0.002692081,0.0001554643,0.0004914035,0.0007668776,0.0009636906,0.002355661,0.001259066,0.0009719515,0.000692515],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0004466424,"about_ca_system_score_gemma":0.0002985297,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0002069895,"about_ca_topic_score_gemma":0.0003422791,"domain_scores_codex":[0.9996093,0.00005812126,0.00003854711,0.00007185325,0.0001701606,0.00005207591],"domain_scores_gemma":[0.9992378,0.0002586802,0.0001075699,0.0002337909,0.0001199488,0.00004220222],"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.0004707808,0.0001351902,0.001557751,0.0002547072,0.00004059195,0.0004796412,0.0005739932,0.02152571,0.08074823,0.4949564,0.004231773,0.3950253],"study_design_scores_gemma":[0.000149283,0.0008962184,0.000986343,0.0001086661,0.00008748245,0.00151862,0.0002832013,0.2316506,0.131589,0.5970373,0.03558522,0.0001080837],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2386686,0.0006784266,0.7448301,0.0005648565,0.0002477728,0.000185694,0.0001290589,0.001466268,0.0132291],"genre_scores_gemma":[0.7253829,0.0004100336,0.2680147,0.0002550641,0.0002178225,0.00009218931,0.0002202227,0.0002115743,0.005195624],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.00377914,"threshold_uncertainty_score":0.0126425,"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","authors":[{"name":"Bin Han","is_ca":true},{"name":"Thomas Yu","is_ca":false},{"name":"Yonggang Xue","is_ca":false}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001029575,0.0003241746,0.000454492,0.0005312319,0.0003139102,0.001147569,0.0009499798,0.000591394,0.003346377],"category_scores_gemma":[0.003163158,0.000254534,0.0005987586,0.0005881652,0.0009659529,0.001190841,0.001495168,0.001029057,0.0007468057],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0006116206,"about_ca_system_score_gemma":0.0006161204,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0009761489,"about_ca_topic_score_gemma":0.001576443,"domain_scores_codex":[0.9993715,0.00008775725,0.00004558712,0.00007549005,0.0003644722,0.0000552297],"domain_scores_gemma":[0.9991284,0.0002543079,0.00010018,0.0002920793,0.0001843787,0.0000407394],"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.0001100641,0.00005954673,0.001055861,0.00008731501,0.00001777416,0.00007629082,0.0002957115,0.1933424,0.02283921,0.6319885,0.001104726,0.1490226],"study_design_scores_gemma":[0.00001860377,0.00007616815,0.000299305,0.00001553151,0.00001353223,0.0001118648,0.00003876038,0.9136641,0.01685747,0.05368136,0.0152043,0.00001900376],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.02245212,0.0000668593,0.9730348,0.00003549895,0.00002202499,0.00002588623,0.00002609939,0.0001947095,0.004142014],"genre_scores_gemma":[0.4655515,0.000301556,0.5184006,0.00006170889,0.00003133637,0.00009295991,0.0002016599,0.0001663657,0.01519227],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.003346377,"threshold_uncertainty_score":0.01119477,"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","authors":[{"name":"Bin Han","is_ca":true},{"name":"Thomas Yu","is_ca":false},{"name":"Bruce Piper","is_ca":false}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001161439,0.0004529885,0.0005411387,0.0007153609,0.0003232682,0.0007633574,0.0006379106,0.0007068848,0.002823864],"category_scores_gemma":[0.002499764,0.0002123558,0.0006349401,0.0008167412,0.0008284876,0.001219359,0.0009482242,0.001454078,0.0003860387],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0004407285,"about_ca_system_score_gemma":0.0004030959,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0006136696,"about_ca_topic_score_gemma":0.0005850176,"domain_scores_codex":[0.9996419,0.00007129429,0.00002405321,0.00005022532,0.0001707241,0.0000417193],"domain_scores_gemma":[0.9994283,0.0001995958,0.00009449842,0.0001220363,0.000121288,0.00003425896],"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.00007568813,0.00003990714,0.0009634934,0.00007571491,0.00001755317,0.0001980639,0.0001521824,0.07918837,0.01818371,0.8361017,0.001297577,0.06370614],"study_design_scores_gemma":[0.00001444286,0.0001279132,0.0006351483,0.00002640426,0.00001753082,0.0003622426,0.00005304143,0.8369073,0.01652739,0.1268994,0.01839145,0.00003777247],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.01674448,0.0001809718,0.9791203,0.0001015329,0.00004543484,0.00002176662,0.00005471266,0.00008221642,0.003648631],"genre_scores_gemma":[0.5085809,0.0007800165,0.4807182,0.0001203476,0.0001267464,0.0001208673,0.0002259291,0.0001330011,0.009193975],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.002823864,"threshold_uncertainty_score":0.00944674,"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","authors":[{"name":"Peter Borwein","is_ca":true},{"name":"Ron Ferguson","is_ca":true},{"name":"Michael J. Mossinghoff","is_ca":false}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002572034,0.000956977,0.001150072,0.002984568,0.002596123,0.006110563,0.001766768,0.001915262,0.02845001],"category_scores_gemma":[0.01578628,0.0006539738,0.001507545,0.001579911,0.003866306,0.008162971,0.003490372,0.002618104,0.006492214],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002366981,"about_ca_system_score_gemma":0.001208165,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000880334,"about_ca_topic_score_gemma":0.001207652,"domain_scores_codex":[0.9971533,0.0007086715,0.0001791375,0.0004333233,0.001033093,0.0004925216],"domain_scores_gemma":[0.99672,0.001128975,0.0002395393,0.0005191972,0.000983958,0.0004083123],"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.0001151035,0.00003144047,0.0003150273,0.00008065787,0.00001359009,0.0002465359,0.0002153639,0.001082865,0.003001153,0.9679712,0.006357021,0.02057006],"study_design_scores_gemma":[0.00003004347,0.00005015492,0.0004040223,0.00005032765,0.0000202895,0.0003336906,0.0001128834,0.01010629,0.007357332,0.9584454,0.0230254,0.00006407538],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2040564,0.002060693,0.4098627,0.002890253,0.005777466,0.0001500412,0.0005260755,0.003040948,0.3716354],"genre_scores_gemma":[0.7584669,0.001043821,0.07379849,0.001732241,0.001180243,0.0003218733,0.0004615492,0.005014745,0.1579802],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.02845001,"threshold_uncertainty_score":0.09517479,"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","authors":[{"name":"Bin Han","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004590295,0.0005152198,0.0003371703,0.001433469,0.0004126175,0.001165584,0.0004943556,0.0008062492,0.003386507],"category_scores_gemma":[0.00173007,0.0002798263,0.0003075703,0.000527353,0.001098169,0.00162654,0.001021291,0.001159539,0.0008329989],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0003273199,"about_ca_system_score_gemma":0.0002154273,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0002276401,"about_ca_topic_score_gemma":0.0001681933,"domain_scores_codex":[0.9997116,0.00003918736,0.00001253076,0.00006594985,0.0001122987,0.0000585113],"domain_scores_gemma":[0.999054,0.000176596,0.0002522368,0.0001195403,0.0002296109,0.0001680376],"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.0001322775,0.00004075579,0.0007566549,0.00009465329,0.00001739738,0.0003566366,0.0002890358,0.01027149,0.060808,0.8883481,0.001431423,0.03745358],"study_design_scores_gemma":[0.00004312267,0.0002512989,0.00267622,0.00005851392,0.00002472674,0.000940129,0.0002658993,0.2590145,0.0188087,0.7020627,0.01578301,0.0000711248],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3257354,0.000988253,0.6523998,0.0005053906,0.0001791153,0.0000491098,0.000281515,0.0002150314,0.01964627],"genre_scores_gemma":[0.8906508,0.0009224619,0.09112488,0.0003610596,0.0004098689,0.00008554079,0.0005179291,0.0001393989,0.01578815],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.003386507,"threshold_uncertainty_score":0.01132894,"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","authors":[{"name":"M. Farhloul","is_ca":true},{"name":"Serge Nicaise","is_ca":false},{"name":"Luc Paquet","is_ca":false}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008957433,0.0007810876,0.0007254134,0.001039066,0.0005288084,0.001269241,0.0008299529,0.001468179,0.001131083],"category_scores_gemma":[0.002840456,0.0004076574,0.0004853119,0.0004752433,0.001543255,0.001701009,0.001379291,0.001061908,0.0002184757],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000411863,"about_ca_system_score_gemma":0.0006445834,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001971502,"about_ca_topic_score_gemma":0.001209182,"domain_scores_codex":[0.9996204,0.0001121484,0.00001804614,0.00005800949,0.0001581648,0.00003328772],"domain_scores_gemma":[0.9993203,0.0002405427,0.0001353205,0.00004787233,0.0001890684,0.00006688687],"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.000121643,0.00007827606,0.001995561,0.0004390251,0.00008700837,0.0006879644,0.0004588433,0.3457069,0.03118423,0.5918182,0.001508804,0.02591364],"study_design_scores_gemma":[0.000007328724,0.0000394518,0.0002598133,0.00002290684,0.000006591837,0.0001281244,0.00005513701,0.9580121,0.001993419,0.03716458,0.002296876,0.00001359587],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.09457189,0.001520293,0.8954425,0.0005944988,0.0001231751,0.00007903554,0.00007141894,0.00006164806,0.007535381],"genre_scores_gemma":[0.7547314,0.001730458,0.2263644,0.0002818143,0.0002439262,0.0002271284,0.0001723057,0.0001140805,0.01613452],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.001971502,"threshold_uncertainty_score":0.004737198,"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","authors":[{"name":"Samuel Broadbent","is_ca":true},{"name":"Habiba Kadiri","is_ca":true},{"name":"Allysa Lumley","is_ca":true},{"name":"Nathan Ng","is_ca":true},{"name":"Kirsten Wilk","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.01020052,0.00381463,0.001727895,0.005747055,0.002328063,0.006163992,0.003368471,0.002832027,0.0276716],"category_scores_gemma":[0.04494758,0.00114156,0.002537669,0.003045141,0.005193001,0.01645777,0.007024849,0.01580025,0.01157312],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00505589,"about_ca_system_score_gemma":0.001579484,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002005432,"about_ca_topic_score_gemma":0.002502552,"domain_scores_codex":[0.9949676,0.001327234,0.0002257686,0.001030095,0.001602032,0.0008472965],"domain_scores_gemma":[0.9754621,0.01804397,0.0008300283,0.002512405,0.002279073,0.0008725004],"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.0001492986,0.00006245777,0.0006044854,0.0002729933,0.00003981774,0.0001064258,0.0002776829,0.006555542,0.001659717,0.9498948,0.009847887,0.03052895],"study_design_scores_gemma":[0.00002188831,0.00005728463,0.0005665098,0.0001878567,0.00006829818,0.0001969245,0.000085167,0.05101411,0.003311487,0.9266074,0.017822,0.00006109146],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02815741,0.008967658,0.7876961,0.005822453,0.001748164,0.0001148414,0.0006812511,0.001476432,0.1653357],"genre_scores_gemma":[0.639002,0.01066421,0.2613985,0.005456351,0.004631445,0.0009692712,0.001987966,0.003922971,0.07196736],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.0276716,"threshold_uncertainty_score":0.09257072,"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","authors":[{"name":"Peter Borwein","is_ca":true},{"name":"Kevin G. Hare","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00113213,0.0008233284,0.0006639982,0.002616623,0.001648339,0.003378633,0.001060215,0.000771487,0.01943279],"category_scores_gemma":[0.006223365,0.0003739061,0.001031753,0.002032891,0.002751146,0.006039387,0.002045617,0.002273694,0.003952322],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002091153,"about_ca_system_score_gemma":0.0007533212,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001762456,"about_ca_topic_score_gemma":0.001627923,"domain_scores_codex":[0.9993374,0.0001244863,0.0000358531,0.0001091763,0.0002792663,0.0001138469],"domain_scores_gemma":[0.998558,0.0007421533,0.0001472972,0.0001397977,0.0002440095,0.0001687856],"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.00003001972,0.000008702666,0.0001775135,0.00003826975,0.000003831418,0.00005821673,0.0002105883,0.0007632871,0.0003033784,0.9876837,0.002829997,0.007892526],"study_design_scores_gemma":[0.000008327937,0.0000103149,0.0003066208,0.00002989528,0.000004940774,0.00006949064,0.0001062154,0.00503265,0.000497812,0.9880816,0.00584156,0.00001058669],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"other","genre_gemma":"empirical","genre_scores_codex":[0.2625901,0.00353188,0.2568666,0.006007102,0.001119869,0.0000828609,0.001024926,0.0008616922,0.4679151],"genre_scores_gemma":[0.8801968,0.002097329,0.06403939,0.0009088956,0.001002271,0.0001354785,0.0008385229,0.0006072753,0.05017405],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01943279,"threshold_uncertainty_score":0.06500912,"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","authors":[{"name":"Reinier Bröker","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001114235,0.001128836,0.0008795903,0.001649294,0.001011056,0.003214244,0.001670341,0.0008743048,0.03763596],"category_scores_gemma":[0.004633719,0.0005674347,0.00133925,0.001757561,0.001036471,0.003551385,0.003023024,0.003021343,0.01771169],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001642325,"about_ca_system_score_gemma":0.001761525,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002250001,"about_ca_topic_score_gemma":0.003378914,"domain_scores_codex":[0.9989973,0.0001473468,0.00007515805,0.0002571544,0.000385775,0.0001373009],"domain_scores_gemma":[0.998929,0.0003900724,0.0000380843,0.0002554038,0.0003207602,0.00006667653],"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.0002364824,0.0001225722,0.000437032,0.0003441559,0.0000537384,0.0001067344,0.0002827129,0.01126861,0.00452945,0.5440558,0.06302191,0.3755407],"study_design_scores_gemma":[0.0001201649,0.0000944312,0.0003079188,0.00007837959,0.00004095866,0.0002018041,0.0001425563,0.111509,0.006782836,0.80463,0.07603683,0.00005518239],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.00645607,0.0003765525,0.955105,0.0006850386,0.0003635295,0.0001087826,0.0009659058,0.004088056,0.03185114],"genre_scores_gemma":[0.1502588,0.0006024534,0.790368,0.0005175732,0.0003343991,0.0003094824,0.003427986,0.002303451,0.05187787],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.03763596,"threshold_uncertainty_score":0.1259048,"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","authors":[{"name":"A. J. van der Poorten","is_ca":false},{"name":"H. J. J. te Riele","is_ca":false},{"name":"Hywel C Williams","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002249319,0.0008133631,0.0009864833,0.0007631344,0.00134709,0.002649387,0.001189942,0.001020545,0.01698338],"category_scores_gemma":[0.01539784,0.0004062531,0.001252514,0.0007563294,0.002574991,0.004380417,0.002462722,0.00189659,0.002630221],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002036148,"about_ca_system_score_gemma":0.002580915,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003809197,"about_ca_topic_score_gemma":0.004077077,"domain_scores_codex":[0.9976664,0.0005856249,0.0001416777,0.0006026344,0.0006506345,0.0003531065],"domain_scores_gemma":[0.9912856,0.005859477,0.000441145,0.001413975,0.0008075566,0.0001921809],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","study_design_scores_codex":[0.002124578,0.0001891301,0.00742057,0.000749109,0.0001706267,0.0005876209,0.001026888,0.06587695,0.01203953,0.7975606,0.04142483,0.07082952],"study_design_scores_gemma":[0.0003002992,0.0001753529,0.001798342,0.0001201468,0.00007874056,0.0001821904,0.0002246265,0.1590553,0.0175653,0.8012301,0.01918509,0.00008451561],"study_design_candidate":"not_applicable","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.6361504,0.00113639,0.1893211,0.00700723,0.000895944,0.0001279868,0.003058932,0.008321704,0.1539803],"genre_scores_gemma":[0.9611309,0.0001947587,0.02305136,0.0004513527,0.0001632601,0.00008356813,0.001917883,0.0005262422,0.01248069],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.01698338,"threshold_uncertainty_score":0.05681509,"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","authors":[{"name":"Peter Walsh","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003723422,0.001515986,0.001730719,0.001352372,0.001647945,0.005069193,0.003867945,0.001661175,0.01004033],"category_scores_gemma":[0.01604396,0.0006455812,0.002445526,0.001764357,0.004306491,0.01618623,0.003956065,0.005271176,0.002060276],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.003299623,"about_ca_system_score_gemma":0.003410211,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002414175,"about_ca_topic_score_gemma":0.003214699,"domain_scores_codex":[0.9940154,0.001046901,0.0003354696,0.0009341022,0.002570705,0.001097535],"domain_scores_gemma":[0.979602,0.01397655,0.0007434299,0.004104678,0.001173368,0.0004000427],"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.003296623,0.0002982724,0.003591236,0.000766089,0.0002384608,0.000372705,0.0006639368,0.1951557,0.03860526,0.5913899,0.007518997,0.1581028],"study_design_scores_gemma":[0.0001678737,0.0001840376,0.0006083847,0.00006085109,0.0001142546,0.0001778341,0.00009149268,0.6207934,0.02591597,0.3467044,0.005102374,0.00007908675],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.08315648,0.0006083483,0.8978396,0.00154643,0.0001576987,0.0002312882,0.0002521258,0.002012803,0.01419516],"genre_scores_gemma":[0.5884463,0.0007640465,0.3976303,0.0006216496,0.0003612399,0.0005269802,0.0010068,0.001034446,0.009608228],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01004033,"threshold_uncertainty_score":0.03358829,"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","authors":[{"name":"Michael J. Jacobson","is_ca":true},{"name":"Hugh C. Williams","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002010361,0.0007754246,0.001019187,0.003185768,0.001923321,0.003197408,0.001405726,0.001154697,0.01477504],"category_scores_gemma":[0.02302483,0.001125562,0.001009291,0.001765412,0.004735016,0.006251971,0.003545799,0.004158287,0.002262574],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002320663,"about_ca_system_score_gemma":0.0009573395,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001422631,"about_ca_topic_score_gemma":0.001304312,"domain_scores_codex":[0.9978587,0.0005647009,0.00005720806,0.000425674,0.0007114456,0.0003822056],"domain_scores_gemma":[0.9903795,0.005643797,0.0007258319,0.000765696,0.001198894,0.001286248],"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.0001250043,0.00003746765,0.001344405,0.00008056602,0.00001101682,0.0002301776,0.0003623936,0.001925201,0.0009503614,0.9778203,0.005222075,0.01189101],"study_design_scores_gemma":[0.00004402675,0.0000442493,0.001170534,0.00002832444,0.00001159487,0.0004944387,0.000119486,0.01886669,0.0008950533,0.973254,0.005037614,0.00003396123],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.5760915,0.002395961,0.2565806,0.0085471,0.001365855,0.00009294474,0.0008818457,0.00137242,0.1526717],"genre_scores_gemma":[0.941833,0.0006240792,0.02183815,0.0007691312,0.001685107,0.0001055672,0.0004633022,0.0003322579,0.03234942],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.01477504,"threshold_uncertainty_score":0.04942745,"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","authors":[{"name":"Joshua Knauer","is_ca":true},{"name":"J. Richstein","is_ca":false}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002567179,0.0008996341,0.001380795,0.002093421,0.003102856,0.005591688,0.001118037,0.002620525,0.05182656],"category_scores_gemma":[0.01310561,0.000633289,0.001022053,0.001778452,0.004012471,0.01259358,0.003222596,0.005957465,0.01155475],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.003596055,"about_ca_system_score_gemma":0.001582265,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001301702,"about_ca_topic_score_gemma":0.001971363,"domain_scores_codex":[0.9986922,0.0004390341,0.00006732601,0.0003420104,0.0002967496,0.0001625939],"domain_scores_gemma":[0.9970496,0.001560363,0.0001597315,0.0004769503,0.0005303904,0.000222993],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","study_design_scores_codex":[0.00002478269,0.000008008925,0.00005028894,0.00005459636,0.00000292278,0.00003746671,0.0001166007,0.0001332267,0.0001097957,0.9728382,0.0158513,0.01077278],"study_design_scores_gemma":[0.000009478112,0.000007379006,0.0000349929,0.00004104387,0.000002300316,0.00005586636,0.00006275182,0.0006789715,0.0001858592,0.9531626,0.04575197,0.000006695392],"study_design_candidate":"not_applicable","study_design_consensus":null,"genre_codex":"other","genre_gemma":"empirical","genre_scores_codex":[0.04178876,0.02842788,0.1011316,0.09007534,0.007970827,0.00007321476,0.001066869,0.001776235,0.7276892],"genre_scores_gemma":[0.5345034,0.02203036,0.1250515,0.01835074,0.009000132,0.0002449961,0.001929324,0.00265985,0.2862297],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.05182656,"threshold_uncertainty_score":0.1733771,"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","authors":[{"name":"Peter Borwein","is_ca":true},{"name":"Michael J. Mossinghoff","is_ca":false}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005764356,0.0005948413,0.0003133248,0.001402448,0.0009228776,0.001338371,0.0004491814,0.0003653919,0.01371383],"category_scores_gemma":[0.002769993,0.0002196989,0.0005685661,0.0009629366,0.001160736,0.001523484,0.0008684199,0.001253829,0.003551046],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001528259,"about_ca_system_score_gemma":0.000628438,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002873742,"about_ca_topic_score_gemma":0.003433237,"domain_scores_codex":[0.9995804,0.00007529549,0.00001488317,0.00007721601,0.0001317157,0.0001204417],"domain_scores_gemma":[0.999273,0.0002255858,0.0001348045,0.00004813508,0.0002181322,0.0001003482],"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.00007812851,0.0000273574,0.0006748198,0.00007808158,0.000008856587,0.0002399861,0.0004371248,0.002181977,0.002176337,0.9693745,0.006042191,0.01868058],"study_design_scores_gemma":[0.00005587942,0.0001225499,0.002641391,0.00007363004,0.00002351868,0.0005925688,0.00050858,0.02466788,0.008266347,0.8945694,0.06840917,0.0000690677],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.4356584,0.001022483,0.2338368,0.00201312,0.0008462343,0.0001417229,0.001203732,0.001138687,0.3241389],"genre_scores_gemma":[0.8923085,0.000669757,0.04034299,0.0003058017,0.0002610592,0.00007832485,0.0006061415,0.0003215134,0.06510594],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.01371383,"threshold_uncertainty_score":0.04587734,"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","authors":[{"name":"Richard E. Crandall","is_ca":false},{"name":"Ernst W. Mayer","is_ca":false},{"name":"Jason S. Papadopoulos","is_ca":false}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001558505,0.001036215,0.0007305295,0.001807089,0.002500928,0.004016959,0.0007312357,0.0009714562,0.04476613],"category_scores_gemma":[0.004007586,0.000512676,0.001422791,0.001169022,0.00416244,0.004822462,0.002499189,0.003380944,0.01881318],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00213116,"about_ca_system_score_gemma":0.001347041,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001100106,"about_ca_topic_score_gemma":0.001231178,"domain_scores_codex":[0.9984205,0.0002424784,0.00008825375,0.0004257812,0.0005651133,0.0002579518],"domain_scores_gemma":[0.9983562,0.0004857404,0.0001485833,0.0003452897,0.0004617996,0.0002024456],"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.0001787663,0.00002098757,0.0003160356,0.0001042016,0.00002032206,0.0002258187,0.000335167,0.0003871597,0.001676589,0.9389228,0.02847205,0.02933999],"study_design_scores_gemma":[0.0000345472,0.0001054261,0.0009463956,0.00005053172,0.00002251692,0.000602573,0.0001279806,0.000922562,0.004513866,0.6064097,0.3861924,0.00007147363],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"other","genre_gemma":"empirical","genre_scores_codex":[0.03675279,0.001786975,0.1468553,0.007317998,0.006338861,0.00006056295,0.001073829,0.003107344,0.7967064],"genre_scores_gemma":[0.5948098,0.001843579,0.07785203,0.003132201,0.002997499,0.0001221653,0.001313729,0.002262786,0.3156662],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.04476613,"threshold_uncertainty_score":0.1497576,"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","authors":[{"name":"Bin Han","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006202414,0.0009607226,0.0008139624,0.001061214,0.0006532276,0.001187163,0.001244676,0.001302893,0.01233191],"category_scores_gemma":[0.001988262,0.0005709458,0.000853253,0.0006312383,0.0005331577,0.0009279295,0.001871097,0.00168415,0.006846617],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0004966806,"about_ca_system_score_gemma":0.001372614,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001142298,"about_ca_topic_score_gemma":0.001457781,"domain_scores_codex":[0.9994859,0.00004945161,0.00005122673,0.0001264359,0.0002088631,0.00007810914],"domain_scores_gemma":[0.9995632,0.0001209594,0.0000324337,0.00007395564,0.0001830194,0.00002642722],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0002264734,0.00012023,0.0005641935,0.0002768075,0.00006202921,0.000299049,0.0002976477,0.04778416,0.06195822,0.05418431,0.0123925,0.8218344],"study_design_scores_gemma":[0.0001851997,0.0001832471,0.0005540929,0.00006771304,0.00006688663,0.0007400277,0.0002107571,0.8296708,0.05725715,0.06160069,0.04937692,0.00008648018],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.001212314,0.0000298433,0.9969442,0.00003496824,0.00002265724,0.00005748767,0.00004024228,0.0006613167,0.0009968651],"genre_scores_gemma":[0.01980345,0.00006497095,0.9775795,0.00004743916,0.00001875168,0.0001825733,0.0002638382,0.000141781,0.001897657],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01233191,"threshold_uncertainty_score":0.04125434,"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","authors":[{"name":"Richard P. Brent","is_ca":false},{"name":"Colin Percival","is_ca":true},{"name":"Paul Zimmermann","is_ca":false}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.006693456,0.002194585,0.001454411,0.002794332,0.001331641,0.004502727,0.002403378,0.001466539,0.0139393],"category_scores_gemma":[0.04128893,0.0006229791,0.001288542,0.002065411,0.004583294,0.006924685,0.005656742,0.004534956,0.004919813],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.003207754,"about_ca_system_score_gemma":0.002124748,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002777587,"about_ca_topic_score_gemma":0.001980687,"domain_scores_codex":[0.9922338,0.001106155,0.0004193404,0.001134657,0.004240069,0.0008659666],"domain_scores_gemma":[0.9721868,0.01715198,0.001304136,0.00412823,0.004564511,0.0006643601],"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.0009980913,0.00006972948,0.00222209,0.0005164662,0.0001049694,0.0004220027,0.0004661289,0.106175,0.004658584,0.7924222,0.01413657,0.07780816],"study_design_scores_gemma":[0.00004009782,0.00008289965,0.0006540829,0.0002930505,0.00004943625,0.0002386714,0.0001027255,0.4570923,0.008017148,0.5197058,0.01366018,0.00006362541],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.04334421,0.005175562,0.845475,0.003488718,0.001536126,0.00006958407,0.0007059704,0.002015573,0.09818941],"genre_scores_gemma":[0.7790099,0.003674528,0.1616793,0.001220423,0.001473322,0.000335085,0.001420378,0.00230654,0.04888058],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.0139393,"threshold_uncertainty_score":0.04663157,"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)","authors":[{"name":"Matthew Greenberg","is_ca":true},{"name":"John Voight","is_ca":false}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001034238,0.0007011644,0.000625005,0.00217371,0.001028136,0.002870707,0.001302606,0.000644863,0.008692767],"category_scores_gemma":[0.004762944,0.000409618,0.0007338736,0.00163041,0.001586707,0.005064348,0.002273791,0.001075246,0.001567716],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001074939,"about_ca_system_score_gemma":0.0007904496,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0009139656,"about_ca_topic_score_gemma":0.001467032,"domain_scores_codex":[0.999084,0.0001747997,0.00006617687,0.0002116408,0.0003068822,0.0001564604],"domain_scores_gemma":[0.9987973,0.0004801117,0.0001039523,0.0002578828,0.0002498154,0.0001109078],"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.0002208082,0.0001151517,0.002427087,0.0002582218,0.00005689181,0.0001840972,0.0006925898,0.03128249,0.01127788,0.8537607,0.004361791,0.09536228],"study_design_scores_gemma":[0.00003738723,0.0000616383,0.0004225716,0.00002236807,0.00002000169,0.00007338908,0.0001699462,0.1552639,0.01202517,0.8275031,0.00436641,0.00003409084],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2547337,0.0002567189,0.729393,0.0003355434,0.0001493584,0.00008613524,0.0004219637,0.002227828,0.01239579],"genre_scores_gemma":[0.7867309,0.000191367,0.2050557,0.00008357161,0.0001162923,0.0000904875,0.0007042897,0.0005390555,0.006488372],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.008692767,"threshold_uncertainty_score":0.02908021,"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","authors":[{"name":"Bin Han","is_ca":true},{"name":"Qingtang Jiang","is_ca":false},{"name":"Zuowei Shen","is_ca":false},{"name":"Xiaosheng Zhuang","is_ca":false}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000690921,0.0009504329,0.0007085395,0.001339465,0.0007984511,0.001498833,0.001059196,0.0009303139,0.007041963],"category_scores_gemma":[0.001615108,0.0004287311,0.0006433888,0.0005905967,0.001410901,0.00155287,0.001490765,0.001433746,0.001778296],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0007105071,"about_ca_system_score_gemma":0.000413088,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001188006,"about_ca_topic_score_gemma":0.001137166,"domain_scores_codex":[0.9996316,0.00009081883,0.00001611188,0.00008170823,0.0001095599,0.0000702415],"domain_scores_gemma":[0.9995131,0.00007532706,0.00006899392,0.00009267905,0.0001468587,0.000102896],"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.00006048859,0.00001738029,0.0002332772,0.00004961763,0.000009795536,0.0001102968,0.0001268636,0.007227968,0.00497227,0.9671068,0.002525372,0.01755982],"study_design_scores_gemma":[0.00004691398,0.0002645803,0.0007713105,0.00005945706,0.0000248936,0.0004981024,0.0003290859,0.2532813,0.007474961,0.7057632,0.03138987,0.00009628734],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.07628285,0.0003511123,0.8991559,0.0003537715,0.0003855163,0.00007286308,0.0002182288,0.0004481883,0.02273166],"genre_scores_gemma":[0.7095354,0.0007784353,0.2456649,0.0004873987,0.0004942447,0.000183769,0.0007572672,0.0005964459,0.04150207],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.007041963,"threshold_uncertainty_score":0.02355772,"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","authors":[{"name":"Lassina Dembélé","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001070451,0.0006243644,0.0005642354,0.001576686,0.000962361,0.001593182,0.00132454,0.0005906806,0.005415148],"category_scores_gemma":[0.00347391,0.0003284399,0.0006423931,0.001188489,0.001811975,0.004661557,0.002088663,0.00133011,0.001705973],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0006690332,"about_ca_system_score_gemma":0.0008438721,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0006633619,"about_ca_topic_score_gemma":0.001151176,"domain_scores_codex":[0.9993273,0.0001811564,0.00004964235,0.0001320678,0.0002273437,0.00008253696],"domain_scores_gemma":[0.9992253,0.0001999326,0.00006716668,0.0003036813,0.0001431064,0.00006083724],"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.0001331998,0.0000550859,0.001590625,0.0001028622,0.00002260001,0.0001603846,0.0003324992,0.01835136,0.005129835,0.8194527,0.003145087,0.1515237],"study_design_scores_gemma":[0.00004923834,0.0001096746,0.0005082796,0.00003790368,0.00001336926,0.000306883,0.0001745939,0.1561934,0.01319314,0.8047938,0.02455171,0.00006803073],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.05099411,0.0002250835,0.9371359,0.0004010584,0.0001889443,0.00009971106,0.0001118262,0.0008809996,0.009962396],"genre_scores_gemma":[0.2795488,0.000329548,0.7120801,0.0001851826,0.0001228063,0.00009664386,0.0002523563,0.0002514737,0.007133021],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.005415148,"threshold_uncertainty_score":0.01811546,"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","authors":[{"name":"Ioan Florin Bugariu","is_ca":true},{"name":"Sorin Micu","is_ca":true},{"name":"Ionel Rovenţa","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008534555,0.0007290891,0.0006666359,0.0006260417,0.0002710724,0.001095539,0.0008080493,0.001426338,0.001331541],"category_scores_gemma":[0.002440606,0.0003039861,0.000633044,0.000213047,0.001639776,0.0007899386,0.001376652,0.001229591,0.0001655833],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0008888181,"about_ca_system_score_gemma":0.0007373393,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003921832,"about_ca_topic_score_gemma":0.001650624,"domain_scores_codex":[0.9997435,0.00009354132,0.00001289388,0.00003892211,0.00008158391,0.00002953419],"domain_scores_gemma":[0.9994625,0.0002526717,0.0001001792,0.00004330515,0.00008663486,0.00005469054],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0001619584,0.00008533752,0.001184324,0.0001940302,0.00003819807,0.0002061895,0.0002318416,0.7555103,0.02641023,0.2051732,0.0003920526,0.0104124],"study_design_scores_gemma":[0.00001230427,0.00001953345,0.00004778432,0.000006522059,0.000002348938,0.000007724608,0.000006647303,0.9959253,0.0006652779,0.003019091,0.0002829901,0.000004574518],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.09407865,0.0004626085,0.8998817,0.0004025469,0.0001194806,0.00006808467,0.00006228626,0.0000840521,0.00484051],"genre_scores_gemma":[0.8987942,0.0003942421,0.09302139,0.000126939,0.000055594,0.000225611,0.00009326354,0.00005548262,0.007233278],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.003921832,"threshold_uncertainty_score":0.007798016,"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","authors":[{"name":"Andrew Arnold","is_ca":true},{"name":"Michael Monagan","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000823241,0.001180374,0.0007493589,0.003105005,0.001248862,0.00253238,0.001407407,0.0007688961,0.06630375],"category_scores_gemma":[0.00656341,0.0004389497,0.001623081,0.0022222,0.0008705018,0.002932901,0.00272224,0.00183038,0.02360433],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001535208,"about_ca_system_score_gemma":0.001415608,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003048732,"about_ca_topic_score_gemma":0.00564436,"domain_scores_codex":[0.9988403,0.0001370204,0.00006720416,0.0002283576,0.0005331972,0.0001939988],"domain_scores_gemma":[0.9985038,0.0004657406,0.00008197198,0.0004230852,0.0004540059,0.00007135997],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0002136802,0.0001029206,0.00172915,0.0005897421,0.00005834266,0.0002857901,0.0004581674,0.01223055,0.009205897,0.3070043,0.0646924,0.603429],"study_design_scores_gemma":[0.0001504129,0.000153885,0.001957857,0.0002208404,0.00007532766,0.0007274288,0.0005040977,0.1183057,0.05183424,0.624224,0.2017035,0.0001426449],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0240989,0.0005297099,0.8692265,0.0006954351,0.0005849812,0.0002816191,0.002328726,0.009934676,0.09231955],"genre_scores_gemma":[0.2013229,0.000734828,0.7431112,0.0005001164,0.0002792621,0.0004299081,0.005375735,0.004534866,0.04371113],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.06630375,"threshold_uncertainty_score":0.2218082,"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","authors":[{"name":"Bin Han","is_ca":true},{"name":"Xiaosheng Zhuang","is_ca":false}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001506167,0.001002182,0.0008232889,0.0009796689,0.0005182521,0.002644819,0.001311482,0.001133004,0.006814589],"category_scores_gemma":[0.005936256,0.0004268548,0.001272431,0.001447862,0.0008044208,0.004220439,0.00214875,0.001861683,0.003247957],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0009542902,"about_ca_system_score_gemma":0.001194053,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0013673,"about_ca_topic_score_gemma":0.002244744,"domain_scores_codex":[0.9989662,0.0002193007,0.0001166325,0.0002336435,0.0003326881,0.0001314981],"domain_scores_gemma":[0.9982038,0.0009791878,0.0001487207,0.0002822312,0.0003313997,0.00005468911],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0002661182,0.0001336768,0.0008629767,0.0003530283,0.0000587398,0.0002768599,0.0004402033,0.06819792,0.007810299,0.4184123,0.007491407,0.4956966],"study_design_scores_gemma":[0.00009523645,0.0001215825,0.0002547679,0.00009941783,0.0000317363,0.0003260191,0.0002247296,0.6096366,0.01000293,0.3627501,0.01641906,0.00003777515],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.006777307,0.0001151668,0.990401,0.0001403422,0.00003773458,0.00004416978,0.00007593528,0.0004827116,0.001925622],"genre_scores_gemma":[0.08138299,0.0003337046,0.9108529,0.0001011129,0.0001195243,0.000228695,0.0006450218,0.0002116306,0.006124432],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.006814589,"threshold_uncertainty_score":0.02279711,"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","authors":[{"name":"Rong-Qing Jia","is_ca":true},{"name":"Wei Zhao","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001626819,0.0006214852,0.000667283,0.001607685,0.0004225925,0.0009709885,0.0004246777,0.0007720513,0.001216772],"category_scores_gemma":[0.00366663,0.0002879858,0.0005798079,0.00137026,0.001474893,0.001151696,0.001473236,0.001557165,0.0003948385],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0003088047,"about_ca_system_score_gemma":0.0004815109,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0004272556,"about_ca_topic_score_gemma":0.0003549001,"domain_scores_codex":[0.999658,0.0001451704,0.00002061587,0.00002673451,0.0001113557,0.00003818099],"domain_scores_gemma":[0.9990902,0.0004317063,0.00009945146,0.0001112978,0.0001935823,0.00007376916],"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.00004323685,0.00005771083,0.0005124702,0.0001640874,0.00002074942,0.0001031739,0.0002597905,0.08310419,0.0116955,0.8603138,0.0009177037,0.04280756],"study_design_scores_gemma":[0.00001364413,0.00006547279,0.0002759525,0.0000533463,0.000008514586,0.00009457313,0.0001168726,0.6305196,0.004068933,0.3590145,0.005742246,0.00002625557],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.04364005,0.002470969,0.9456761,0.0006187477,0.0001347998,0.00002911469,0.00004823586,0.0001128689,0.007269028],"genre_scores_gemma":[0.6187325,0.006523447,0.3684795,0.000203565,0.0003168548,0.000147761,0.0001598727,0.0001322246,0.005304359],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.001626819,"threshold_uncertainty_score":0.008603573,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null}]}