{"meta":{"query_hash":"fb3bb03b9d75","filters":{"venue":"Mathematics of Computation"},"cohort_total":177,"direct_labels_cover":0,"predictions_cover":177,"exported":177,"export_cap":100000,"truncated":false,"label_status":"direct model label, unvalidated","prediction_status":"machine_predicted_unvalidated (Codex and Gemma teacher distillation)","score_status":"score_only:v0-immature-baseline","snapshot":{"source":"OpenAlex, pinned release, all 482 partitions","release":"2026-06-24","frame_built":"2026-07-12"},"permalink":"https://metacan.xera.ac/q/fb3bb03b9d75","api":"https://metacan.xera.ac/api/v1/cohort?venue=Mathematics+of+Computation"},"results":[{"id":"W1496730074","doi":"10.1090/s0025-5718-07-01954-0","title":"Rational Landen transformations on ℝ","year":2007,"lang":"en","type":"article","venue":"Mathematics of Computation","topic":"Mathematical functions and polynomials","field":"Mathematics","cited_by":10,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Dalhousie University","funders":"National Science Foundation","keywords":"Mathematics; Transformation (genetics); Rational function; Line (geometry); Value (mathematics); Elliptic rational functions; Elliptic curve; Pure mathematics; Discrete mathematics; Algebra over a field; Combinatorics; Quarter period; Geometry","score_opus":0.05572778147790422,"score_gpt":0.3459780288984994,"score_spread":0.29025024742059513,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1496730074","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.18679135,0.00000250094,0.7793191,0.00027438227,0.00011124552,0.00038486504,0.000011486926,0.00006564721,0.03303943],"genre_scores_gemma":[0.74437875,6.115489e-7,0.2550833,0.000088162225,0.00006765495,0.000012886225,0.000011664341,0.000018526383,0.000338472],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986142,0.000020609263,0.0006960626,0.000110336114,0.00038952997,0.00016924759],"domain_scores_gemma":[0.99764436,0.0017483196,0.00017416329,0.00017902674,0.00016025496,0.00009385163],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010027183,0.00012604446,0.0002547937,0.00024805003,0.00008154924,0.000021124772,0.000107904816,0.00006125522,0.00015956178],"category_scores_gemma":[0.00045632705,0.00010780262,0.00008785833,0.00026734278,0.000023858902,0.00007481964,0.000013868273,0.00007571303,0.00014316318],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000032668915,0.0004981544,0.00001246435,0.00028733266,0.00003535993,7.561079e-7,0.0028180203,0.00078862783,0.0012003377,0.98550314,0.0051242574,0.003698858],"study_design_scores_gemma":[0.00050501456,0.00024271049,0.00029006077,0.0001754614,0.000046008918,0.000010295191,0.00036828473,0.007820701,0.01196708,0.9774651,0.000897731,0.00021153179],"about_ca_topic_score_codex":0.0000015758236,"about_ca_topic_score_gemma":0.000007645283,"teacher_disagreement_score":0.5575874,"about_ca_system_score_codex":0.000031726882,"about_ca_system_score_gemma":0.000024063194,"threshold_uncertainty_score":0.43960634},"labels":[],"label_agreement":null},{"id":"W1513700502","doi":"10.1090/s0025-5718-07-02083-2","title":"On the equation 𝑠²+𝑦^{2𝑝}=𝛼³","year":2007,"lang":"en","type":"article","venue":"Mathematics of Computation","topic":"Algebraic Geometry and Number Theory","field":"Mathematics","cited_by":10,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Fermat's Last Theorem; Integer (computer science); Modular form; Alpha (finance); Modular equation; Galois module; Pure mathematics; Algebra over a field; Statistics","score_opus":0.060336332911787596,"score_gpt":0.31809808639295994,"score_spread":0.25776175348117236,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1513700502","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.48992983,0.00000712898,0.49718273,0.0001577891,0.00008441306,0.00021197676,0.0000012119872,0.00004688124,0.012378045],"genre_scores_gemma":[0.9669614,8.801182e-7,0.032635592,0.000091288595,0.000051012805,0.00000548825,0.0000051544966,0.000021110614,0.00022805906],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99868083,0.000063898784,0.0005200434,0.00012190925,0.0004393873,0.00017391542],"domain_scores_gemma":[0.99376214,0.0053980947,0.00039102364,0.0002739435,0.00013872045,0.000036072917],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0024440093,0.00013335372,0.00020375956,0.0001254119,0.00010479536,0.00001975124,0.00018183622,0.000072029296,0.00011917094],"category_scores_gemma":[0.0012558138,0.000093977076,0.000085697386,0.0002920697,0.00007147891,0.00006891879,0.00003404033,0.00012540884,0.000096146054],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000020063162,0.00023199082,0.000011267083,0.00013710912,0.000030722826,0.0000010216725,0.0022004468,0.00020536718,0.00033006206,0.99358803,0.0008195445,0.002424395],"study_design_scores_gemma":[0.00020606212,0.00007649885,0.00015300451,0.00008999512,0.00002891945,0.000004987253,0.00079061306,0.007487949,0.009833467,0.9812027,0.000026193831,0.000099596466],"about_ca_topic_score_codex":0.0000015303075,"about_ca_topic_score_gemma":0.0000012718573,"teacher_disagreement_score":0.4770316,"about_ca_system_score_codex":0.000030968356,"about_ca_system_score_gemma":0.00001548955,"threshold_uncertainty_score":0.38322738},"labels":[],"label_agreement":null},{"id":"W1526628995","doi":"10.1090/s0025-5718-09-02237-6","title":"An algorithm for finding a nearly minimal balanced set in 𝔽_{𝕡}","year":2009,"lang":"lv","type":"article","venue":"Mathematics of Computation","topic":"Finite Group Theory Research","field":"Mathematics","cited_by":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"University of Waterloo","keywords":"Algorithm; Annotation; Computer science; Type (biology); Artificial intelligence; Mathematics; Biology","score_opus":0.07684009614675122,"score_gpt":0.38851292500824103,"score_spread":0.31167282886148984,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1526628995","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4677699,0.000057371264,0.5298541,0.00013774185,0.00010006159,0.0014404141,0.00013696647,0.000059571754,0.00044384444],"genre_scores_gemma":[0.5463948,0.0000054417287,0.45322177,0.000026777023,0.00009153514,0.00003020765,0.000089473775,0.00005201087,0.00008799186],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99646944,0.00024195605,0.0014395384,0.0004525579,0.00073751266,0.00065901084],"domain_scores_gemma":[0.9957905,0.0023771927,0.00073547644,0.0005282345,0.00041965066,0.00014898514],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0025273762,0.00039104308,0.0009253952,0.00059204944,0.0001167798,0.00017775476,0.0005272324,0.00029483976,0.000042153417],"category_scores_gemma":[0.00072091224,0.0004258644,0.0001979266,0.00064090395,0.000111613364,0.00040418192,0.000055584052,0.0003275451,0.000036549012],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00082987203,0.012357316,0.00028913037,0.01062333,0.0003892588,0.0000818306,0.13690995,0.009426565,0.02263975,0.27615166,0.0016987907,0.52860254],"study_design_scores_gemma":[0.0016139272,0.0011964424,0.00040701622,0.0005332362,0.0000491013,0.000009300235,0.001556826,0.6247569,0.00129846,0.3683051,0.000008556276,0.00026520144],"about_ca_topic_score_codex":0.000007923389,"about_ca_topic_score_gemma":0.0000067265405,"teacher_disagreement_score":0.6153303,"about_ca_system_score_codex":0.00016354625,"about_ca_system_score_gemma":0.00015109772,"threshold_uncertainty_score":0.99981934},"labels":[],"label_agreement":null},{"id":"W1633446687","doi":"10.1090/mcom/2978","title":"The self-power map and collecting all residue classes","year":2015,"lang":"en","type":"article","venue":"Mathematics of Computation","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Modulo; Mathematics; Combinatorics; Exponential function; Natural number; Discrete mathematics; Function (biology); Upper and lower bounds; Prime (order theory); Prime power; Exponential sum; Mathematical analysis","score_opus":0.03210874508694974,"score_gpt":0.27754703364778655,"score_spread":0.2454382885608368,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1633446687","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.19744495,0.00027879758,0.7958091,0.0009771554,0.00025975044,0.00019761524,4.304673e-7,0.00018020347,0.0048520314],"genre_scores_gemma":[0.82562685,0.0000043431423,0.17428616,0.000032803055,0.000010811375,0.0000036296085,3.076714e-7,0.0000045743996,0.00003053138],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.999343,0.000062857405,0.00019557225,0.00010460403,0.00019252446,0.00010144086],"domain_scores_gemma":[0.99888384,0.00061904715,0.0001453517,0.00017632854,0.00013267768,0.000042733755],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006997967,0.00006703788,0.00009572115,0.000057050533,0.000117602875,0.00014416347,0.0002477601,0.000024853658,4.0725735e-7],"category_scores_gemma":[0.00008953903,0.000049663795,0.000026404461,0.00019885822,0.000039758994,0.00014013043,0.00011361195,0.000049719656,0.0000041099293],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010373072,0.000120995865,0.00014266936,0.00009481195,0.000059409096,0.0000019738118,0.02043158,0.0005364535,0.00014793058,0.9694691,0.00381271,0.0051720496],"study_design_scores_gemma":[0.00025365147,0.00013954345,0.00018983369,0.00003846404,0.00001155763,0.000012485609,0.00094325957,0.13920972,0.0007375326,0.85719746,0.0011688228,0.000097666605],"about_ca_topic_score_codex":0.0000015350162,"about_ca_topic_score_gemma":0.0000024992735,"teacher_disagreement_score":0.6281819,"about_ca_system_score_codex":0.000010694841,"about_ca_system_score_gemma":0.00003751482,"threshold_uncertainty_score":0.20252307},"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,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_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","score_opus":0.01450173597033348,"score_gpt":0.25953737550663647,"score_spread":0.245035639536303,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1634195488","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8046388,0.00018053969,0.19167519,0.000059014692,0.000047842463,0.00025257666,0.0000047369463,0.00007505777,0.003066268],"genre_scores_gemma":[0.9541879,0.000012025079,0.04530957,0.000012313527,0.00004521411,0.000009493086,0.000021520274,0.0000307407,0.00037118842],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99869657,0.000043086788,0.00058422255,0.00017957459,0.0003064932,0.00019007566],"domain_scores_gemma":[0.9987758,0.00052373117,0.00036419593,0.00020572063,0.00008937065,0.00004120257],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00054705667,0.00018038499,0.00035667617,0.0001531575,0.000079838755,0.00004049494,0.00012825856,0.000093861454,0.000037892853],"category_scores_gemma":[0.00008249574,0.00015762552,0.000075818796,0.00019766932,0.0000628104,0.00016901092,0.000059461232,0.00008783869,0.000022781585],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000024439421,0.0004677371,0.0005374101,0.0017894921,0.000071866154,0.0000049295822,0.0010354086,0.00065878377,0.00078306656,0.9920502,0.000606208,0.0019704765],"study_design_scores_gemma":[0.0005740959,0.000053108237,0.0009596869,0.00013310097,0.00006646209,0.000041248197,0.00020938591,0.018917667,0.00245455,0.9763728,0.00004001227,0.00017790523],"about_ca_topic_score_codex":0.000024832698,"about_ca_topic_score_gemma":0.000006469833,"teacher_disagreement_score":0.14954916,"about_ca_system_score_codex":0.000024216479,"about_ca_system_score_gemma":0.000014163097,"threshold_uncertainty_score":0.6427782},"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,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_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","score_opus":0.03225048713407334,"score_gpt":0.3134937958569637,"score_spread":0.28124330872289033,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1758200638","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4480214,0.000019630845,0.55025375,0.00026111695,0.00002183473,0.00019717526,0.000006006959,0.000040220177,0.0011788625],"genre_scores_gemma":[0.68667537,0.000010934067,0.313142,0.000011666027,0.000017253165,0.000012626697,0.0000018403996,0.000025926438,0.00010240493],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9981315,0.00008806724,0.000703683,0.00025524537,0.0005808918,0.00024062855],"domain_scores_gemma":[0.9967058,0.002350431,0.0003786925,0.00025849135,0.00019268786,0.00011391271],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00082016905,0.00022524215,0.0006402924,0.00020715958,0.00007321811,0.000047891594,0.00016210087,0.000100333775,0.00007073997],"category_scores_gemma":[0.00041798266,0.00012649647,0.00008215479,0.00038587852,0.00012065382,0.00018985866,0.00005064074,0.00009330065,0.000007045667],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003127217,0.00070894224,0.00039316993,0.0017347372,0.0003045081,0.000007701669,0.0010113795,0.000026969596,0.0016316089,0.9718806,0.00007497262,0.02219412],"study_design_scores_gemma":[0.001111695,0.00018373423,0.00060858723,0.00061532145,0.000250758,0.000018437982,0.000075576485,0.0054324716,0.00584025,0.9855782,0.000024373463,0.00026063234],"about_ca_topic_score_codex":0.000013083494,"about_ca_topic_score_gemma":0.000010152565,"teacher_disagreement_score":0.23865394,"about_ca_system_score_codex":0.000038475,"about_ca_system_score_gemma":0.000034729223,"threshold_uncertainty_score":0.5158376},"labels":[],"label_agreement":null},{"id":"W1835442861","doi":"10.1090/s0025-5718-07-02013-3","title":"𝐶¹ spline wavelets on triangulations","year":2007,"lang":"en","type":"article","venue":"Mathematics of Computation","topic":"Advanced Numerical Analysis Techniques","field":"Engineering","cited_by":10,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"Natural Sciences and Engineering Research Council of Canada; Division of Mathematical Sciences; National University of Singapore; Vanderbilt University","keywords":"Mathematics; Wavelet; Spline (mechanical); Applied mathematics; Artificial intelligence; Computer science","score_opus":0.011901035537392399,"score_gpt":0.2798575348872014,"score_spread":0.267956499349809,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1835442861","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11494063,0.000011625119,0.88100594,0.000018468438,0.000023186458,0.000085517524,0.0000013078966,0.00021929252,0.0036940286],"genre_scores_gemma":[0.7278045,0.0000019816644,0.2721279,0.0000074333648,0.000017548722,0.000001696053,0.000008678898,0.000011583663,0.00001867049],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99941903,0.0000036482188,0.00029985988,0.00005477909,0.000139823,0.00008285543],"domain_scores_gemma":[0.9995855,0.00018074861,0.00006488518,0.000094968025,0.000049014707,0.000024893501],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00014750482,0.00007055518,0.00014446645,0.00012760366,0.000016314716,0.000004531378,0.000049290404,0.000031388674,0.000011076788],"category_scores_gemma":[0.000042735253,0.000067046756,0.00004483091,0.0002193365,0.000013812062,0.00004079129,0.0000066486355,0.000050005223,0.000015271775],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000118136395,0.0002771636,0.0000306894,0.00026136477,0.00008015757,0.00000364554,0.000761277,0.8258102,0.019870812,0.030704275,0.0005263747,0.12166222],"study_design_scores_gemma":[0.0001733592,0.00005032216,0.0006718352,0.000049388134,0.00002142451,0.0000015512042,0.000040358354,0.8590462,0.054132845,0.08553971,0.00015327371,0.000119698605],"about_ca_topic_score_codex":5.427866e-7,"about_ca_topic_score_gemma":9.798785e-7,"teacher_disagreement_score":0.6128639,"about_ca_system_score_codex":0.000028308057,"about_ca_system_score_gemma":0.0000017962366,"threshold_uncertainty_score":0.27340874},"labels":[],"label_agreement":null},{"id":"W1861085200","doi":"10.1090/s0025-5718-2013-02706-8","title":"Fundamental invariants for the action of $SL_3(\\mathbb {C}) \\times SL_3(\\mathbb {C}) \\times SL_3(\\mathbb {C})$ on $3 \\times 3 \\times 3$ arrays","year":2013,"lang":"en","type":"article","venue":"Mathematics of Computation","topic":"Advanced Algebra and Geometry","field":"Mathematics","cited_by":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University; University of Saskatchewan","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Monomial; Combinatorics; Lie algebra; Homogeneous; Action (physics); Lie group; Group (periodic table); Algebra over a field; Pure mathematics; Physics","score_opus":0.059420203348777845,"score_gpt":0.33881768487762426,"score_spread":0.2793974815288464,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1861085200","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.48233637,0.0004365816,0.5030013,0.0012923828,0.0010266699,0.00514815,0.00025146644,0.00047720305,0.0060298955],"genre_scores_gemma":[0.8519521,0.00007237404,0.14495043,0.00016389586,0.00027238938,0.00037078728,0.00012410339,0.00020158678,0.0018923834],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9947077,0.00018611949,0.0021984626,0.00074089883,0.0013174642,0.0008493567],"domain_scores_gemma":[0.98989785,0.0056838216,0.0023020867,0.0011145154,0.0007885085,0.00021322996],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.001162001,0.00088737754,0.0015047689,0.0005991097,0.0004977562,0.00021454607,0.00088342745,0.00039165773,0.0010012452],"category_scores_gemma":[0.001269539,0.00069416565,0.00063491554,0.000761692,0.00038361733,0.0009373024,0.00025227846,0.00044649138,0.0002946255],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00056946574,0.0065328614,0.00025765452,0.009772404,0.002413052,0.000009813625,0.016305333,0.017651336,0.022914693,0.8274865,0.053652205,0.042434648],"study_design_scores_gemma":[0.002215224,0.0007757228,0.00033019102,0.00087403634,0.00046296616,0.000037352893,0.005120275,0.11156222,0.037904046,0.8394786,0.00040098903,0.0008383938],"about_ca_topic_score_codex":0.000028133336,"about_ca_topic_score_gemma":0.000009582952,"teacher_disagreement_score":0.36961567,"about_ca_system_score_codex":0.00017743622,"about_ca_system_score_gemma":0.00015885626,"threshold_uncertainty_score":0.99991196},"labels":[],"label_agreement":null},{"id":"W1897223594","doi":"10.1090/s0025-5718-05-01777-1","title":"An old conjecture of Erdos–Turán on additive bases","year":2005,"lang":"lv","type":"article","venue":"Mathematics of Computation","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":23,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"Natural Sciences and Engineering Research Council of Canada; Mitacs","keywords":"Algorithm; Conjecture; Artificial intelligence; Mathematics; Computer science; Combinatorics","score_opus":0.018099139655915628,"score_gpt":0.27288815737612626,"score_spread":0.2547890177202106,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1897223594","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6798013,0.00029375163,0.31612003,0.00082838815,0.00035913498,0.0005275588,0.00010594481,0.0001288146,0.0018350828],"genre_scores_gemma":[0.84041417,0.000015198884,0.15920186,0.00020911777,0.000027803342,0.0000040528275,0.000028363884,0.000018511446,0.00008094325],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9977472,0.00013057662,0.00086021784,0.00037499244,0.00064916944,0.00023787268],"domain_scores_gemma":[0.9973393,0.0006247737,0.00088066724,0.0005497113,0.00049244496,0.00011307927],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00053005695,0.0002664667,0.00049906655,0.00029242577,0.00008965323,0.00007289891,0.00045160364,0.0001456118,0.00004835231],"category_scores_gemma":[0.00011378232,0.00024359045,0.00014139847,0.0004434095,0.000158084,0.0003075577,0.00007413956,0.00017311284,0.000051190378],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000042084528,0.0031561577,0.000031726675,0.0007632285,0.00013507325,0.0000057651737,0.017399471,0.28360853,0.005780424,0.6011349,0.0027640169,0.08517861],"study_design_scores_gemma":[0.00071928825,0.0010040338,0.00015368019,0.0007787512,0.000057980684,0.000009431717,0.00023148986,0.8259574,0.04076646,0.12998664,0.00008472033,0.00025012332],"about_ca_topic_score_codex":0.000020486958,"about_ca_topic_score_gemma":0.0000054376583,"teacher_disagreement_score":0.54234886,"about_ca_system_score_codex":0.000028041264,"about_ca_system_score_gemma":0.000088509434,"threshold_uncertainty_score":0.993333},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.11113804743670994,"score_gpt":0.32450365180085206,"score_spread":0.21336560436414212,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1906421350","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00176306,0.00006342288,0.99716574,0.00020394528,0.00021053718,0.00033983414,0.000006890002,0.00002957945,0.00021700557],"genre_scores_gemma":[0.3733534,7.141954e-7,0.626553,0.000008966245,0.000039809354,0.000016954935,0.000005102578,0.000005104097,0.000016950324],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989102,0.00008146318,0.00042769773,0.00013774565,0.00029914174,0.00014377983],"domain_scores_gemma":[0.9983257,0.0007383961,0.00036315687,0.00026024767,0.00026099005,0.000051509593],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00058968243,0.00009227206,0.00024571773,0.000078140256,0.00008180069,0.000043919645,0.00041757853,0.000034552377,7.679932e-7],"category_scores_gemma":[0.00034026537,0.00006536754,0.000103319864,0.00035171735,0.00008094425,0.0001277421,0.00009627517,0.000052677184,0.000001499668],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003714091,0.0026509494,0.000027255996,0.00065535906,0.00031092347,5.444034e-7,0.015791375,0.12009978,0.0017633317,0.5868234,0.0036426298,0.26819733],"study_design_scores_gemma":[0.00034026027,0.00010879058,0.000035200213,0.000010952535,0.00003190614,0.0000023109624,0.00016248794,0.92520535,0.0002565973,0.073742144,0.000036154404,0.000067864625],"about_ca_topic_score_codex":0.000012406947,"about_ca_topic_score_gemma":2.7534344e-7,"teacher_disagreement_score":0.80510557,"about_ca_system_score_codex":0.000024301955,"about_ca_system_score_gemma":0.000075962445,"threshold_uncertainty_score":0.2665611},"labels":[],"label_agreement":null},{"id":"W1918379444","doi":"10.1090/s0025-5718-00-01212-6","title":"Explicit primality criteria for (𝑝-1)𝑝ⁿ-1","year":2000,"lang":"en","type":"article","venue":"Mathematics of Computation","topic":"Analytic Number Theory Research","field":"Mathematics","cited_by":11,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Manitoba; University of Waterloo","funders":"","keywords":"Primality test; Mathematics; Prime (order theory); Combinatorics; Modulo; Discrete mathematics; Lucas sequence; Polynomial","score_opus":0.11871542019099565,"score_gpt":0.4284869693753057,"score_spread":0.30977154918431005,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1918379444","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.50658274,0.000009929897,0.48119098,0.00013469961,0.000029961195,0.0006476835,0.000019472829,0.00007589843,0.011308647],"genre_scores_gemma":[0.70013046,0.0000025704544,0.2980094,0.000020817652,0.00005632143,0.000048052818,0.00001496967,0.000035515204,0.0016819031],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99858457,0.0000682677,0.0005874156,0.00017953385,0.0003560516,0.00022416288],"domain_scores_gemma":[0.99792314,0.0012845546,0.00018712394,0.00030342265,0.00024114974,0.000060613467],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001100039,0.00013872549,0.00036468398,0.000078180725,0.00006955274,0.0000336592,0.00021641834,0.00006675427,0.00077562645],"category_scores_gemma":[0.00038133463,0.00013010918,0.00012949824,0.0001532644,0.00006091114,0.00010895673,0.000029756755,0.00006863333,0.000057548474],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00021038589,0.0015068126,0.000059980906,0.00426589,0.0002230638,0.0000027032145,0.007395674,0.0002937102,0.0038478766,0.9434566,0.009465303,0.029272009],"study_design_scores_gemma":[0.00050263177,0.00008175338,0.0000595598,0.000085539396,0.000046702233,0.0000059128934,0.00020799512,0.07656677,0.002888086,0.91921175,0.00021614198,0.00012715087],"about_ca_topic_score_codex":0.000004063288,"about_ca_topic_score_gemma":0.0000014615721,"teacher_disagreement_score":0.19354771,"about_ca_system_score_codex":0.00003889745,"about_ca_system_score_gemma":0.000036771577,"threshold_uncertainty_score":0.8492566},"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,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_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","score_opus":0.022992891324720703,"score_gpt":0.2437091432089181,"score_spread":0.22071625188419738,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1963612676","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.051586773,0.00017207995,0.94388026,0.000015334117,0.00001825132,0.0002069542,0.000007769538,0.00034710034,0.0037655008],"genre_scores_gemma":[0.6138173,0.000030433896,0.38607806,0.0000034094605,0.0000055964842,0.000016997243,0.000010755243,0.00002149633,0.0000159459],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99908966,0.000016555638,0.00041317477,0.00013748316,0.00019073454,0.00015237812],"domain_scores_gemma":[0.9994496,0.00009157557,0.00014083543,0.00016923071,0.00007778651,0.00007093881],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00015318426,0.00015442501,0.00029077998,0.00033266313,0.000045204764,0.0000219271,0.00011494372,0.00005148537,0.000026851221],"category_scores_gemma":[0.000080201564,0.0001436567,0.000056950168,0.0005591922,0.000054426077,0.00023096765,0.000044697495,0.00008324638,0.0000081622375],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001473951,0.0029833952,0.0036054011,0.02405211,0.002381314,0.000029106106,0.046283156,0.27679443,0.041091196,0.19781978,0.0033981784,0.40141454],"study_design_scores_gemma":[0.00015400536,0.000059632435,0.0006610968,0.00009611222,0.00006622588,0.0000063880143,0.00022492315,0.8369919,0.01944402,0.14205547,0.000025947314,0.00021425275],"about_ca_topic_score_codex":0.00000536312,"about_ca_topic_score_gemma":0.0000010052685,"teacher_disagreement_score":0.5622305,"about_ca_system_score_codex":0.000023466244,"about_ca_system_score_gemma":0.000005441647,"threshold_uncertainty_score":0.585815},"labels":[],"label_agreement":null},{"id":"W1965444722","doi":"10.1090/s0025-5718-06-01821-7","title":"Optimal 𝐶² two-dimensional interpolatory ternary subdivision schemes with two-ring stencils","year":2006,"lang":"en","type":"article","venue":"Mathematics of Computation","topic":"Advanced Numerical Analysis Techniques","field":"Engineering","cited_by":21,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Quadrilateral; Exponent; Smoothness; Subdivision; Ternary operation; Combinatorics; Uniform norm; Mathematical analysis; Geometry; Finite element method","score_opus":0.00647421579486388,"score_gpt":0.2418127085418627,"score_spread":0.23533849274699883,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1965444722","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.49301672,0.000047951115,0.5063089,0.0000035218775,0.000012151091,0.00006461465,0.0000011157559,0.00018590261,0.00035912593],"genre_scores_gemma":[0.61130786,5.455384e-7,0.38862616,0.0000034241584,0.000019208443,0.0000048235124,0.000008754885,0.000019773806,0.00000946721],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999073,0.000010701615,0.0003647206,0.00012561325,0.00029038385,0.0001355731],"domain_scores_gemma":[0.9995256,0.000097862576,0.00012252221,0.00012960623,0.00009419154,0.000030234976],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00009892725,0.00015043964,0.00024693194,0.00013102924,0.000030188909,0.00001657331,0.00009684798,0.000029097848,0.000011857842],"category_scores_gemma":[0.00000800874,0.0001297007,0.00005580963,0.00016886473,0.000043399214,0.0001766698,0.000039631865,0.00009617862,0.000010166414],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000065675035,0.00007006398,0.00022348225,0.00010938767,0.00003266841,0.0000037141629,0.0000816814,0.979096,0.017283192,0.0010579942,0.000042254167,0.0019930054],"study_design_scores_gemma":[0.00025659674,0.0000513476,0.00023334583,0.00016843542,0.000026558857,0.00000928295,0.000024908533,0.9530894,0.039765883,0.0062141228,0.00001049218,0.0001495988],"about_ca_topic_score_codex":0.0000137577845,"about_ca_topic_score_gemma":0.000002831137,"teacher_disagreement_score":0.118291125,"about_ca_system_score_codex":0.00005508239,"about_ca_system_score_gemma":0.000007459577,"threshold_uncertainty_score":0.5289041},"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,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_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","score_opus":0.017995565743946926,"score_gpt":0.296725076487288,"score_spread":0.27872951074334107,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1965490868","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.19542019,0.000082654464,0.8027503,0.000028096898,0.00009788581,0.00014298764,0.000015386358,0.00007570586,0.0013868234],"genre_scores_gemma":[0.49779168,0.0000063139355,0.5021281,0.0000021272929,0.00002233399,0.000003006734,0.000030861247,0.0000122499305,0.000003317645],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99890536,0.000033413795,0.00059070153,0.00011475108,0.00023089806,0.00012489408],"domain_scores_gemma":[0.9992013,0.00023559578,0.00014279534,0.00017664905,0.00020634884,0.000037338945],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003361713,0.00013152449,0.000259902,0.00007349671,0.00002495882,0.000018622804,0.0001626164,0.00005776947,0.000020678288],"category_scores_gemma":[0.000060794173,0.00014588457,0.00007565221,0.00026782244,0.000022192888,0.00015412127,0.000058467966,0.000050890572,0.0000012202116],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000002204498,0.00007162256,0.000078121404,0.00028435167,0.00003136146,7.220569e-8,0.00031338044,0.9696421,0.0007737212,0.022804014,0.000018483111,0.0059805852],"study_design_scores_gemma":[0.00018873379,0.00002169756,0.0004056817,0.00005295742,0.000023444109,0.0000017648246,0.00008736613,0.9871906,0.0005694471,0.011339945,0.000008542523,0.00010981949],"about_ca_topic_score_codex":0.0000034724537,"about_ca_topic_score_gemma":0.0000099510535,"teacher_disagreement_score":0.30237147,"about_ca_system_score_codex":0.000099403245,"about_ca_system_score_gemma":0.00002007994,"threshold_uncertainty_score":0.5949},"labels":[],"label_agreement":null},{"id":"W1965877647","doi":"10.1090/s0025-5718-01-01298-4","title":"The index calculus method using non-smooth polynomials","year":2001,"lang":"en","type":"article","venue":"Mathematics of Computation","topic":"Cryptography and Residue Arithmetic","field":"Computer Science","cited_by":14,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University; University of Toronto","funders":"","keywords":"Mathematics; Logarithm; Limit (mathematics); Interval (graph theory); Upper and lower bounds; Combinatorics; Degree (music); Heuristic; Variable (mathematics); Prime (order theory); Discrete mathematics; Calculus (dental); Mathematical analysis; Mathematical optimization","score_opus":0.020102899231603057,"score_gpt":0.30791873626531036,"score_spread":0.2878158370337073,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1965877647","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06366875,0.00008257268,0.9350999,0.00019869131,0.00015294914,0.00015938096,3.955931e-7,0.000031766845,0.0006055863],"genre_scores_gemma":[0.5867613,0.000008561739,0.41316006,0.000022523376,0.000023106559,0.0000025592956,3.586905e-7,0.000005844634,0.000015705637],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99897695,0.0000696918,0.00035619971,0.00014413489,0.00028041936,0.000172597],"domain_scores_gemma":[0.9987655,0.0005351792,0.0002496205,0.00029676425,0.00011246395,0.000040416347],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00067349937,0.00009939964,0.00017187613,0.00011969715,0.00019993796,0.00011610145,0.0004405131,0.000045582725,0.0000015601628],"category_scores_gemma":[0.0000402519,0.0000700014,0.00009083753,0.0005174621,0.000056126555,0.00015370948,0.00011033528,0.00007107425,0.0000042376564],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003157564,0.00071541825,0.00080976833,0.00032308407,0.00025109676,0.000028947032,0.01358123,0.32509565,0.013942228,0.24867205,0.0006016093,0.3959473],"study_design_scores_gemma":[0.00018924134,0.000027213728,0.00093436666,0.00003444595,0.0000113697615,0.000025086745,0.00015084844,0.9416228,0.0016282822,0.055201914,0.00008931601,0.000085112544],"about_ca_topic_score_codex":0.000037072965,"about_ca_topic_score_gemma":0.0000082099305,"teacher_disagreement_score":0.61652714,"about_ca_system_score_codex":0.00001642296,"about_ca_system_score_gemma":0.00004273477,"threshold_uncertainty_score":0.28545743},"labels":[],"label_agreement":null},{"id":"W1966213881","doi":"10.1090/s0025-5718-2011-02470-1","title":"Improvements to Turing’s method","year":2011,"lang":"en","type":"article","venue":"Mathematics of Computation","topic":"Analytic Number Theory Research","field":"Mathematics","cited_by":21,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Lethbridge","funders":"","keywords":"Algorithm; Annotation; Mathematics; Computer science; Artificial intelligence","score_opus":0.14439341375104497,"score_gpt":0.4140025260864571,"score_spread":0.2696091123354121,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1966213881","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15449168,0.0000024716667,0.82541937,0.000026517246,0.000045630943,0.0003822783,0.000002777759,0.00005615686,0.01957314],"genre_scores_gemma":[0.38984367,2.50949e-7,0.60957915,0.000018849958,0.000014037529,0.000013553636,0.0000011120453,0.000022550637,0.0005067944],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99866414,0.00006837375,0.00048414542,0.00016598131,0.00041395982,0.0002034269],"domain_scores_gemma":[0.9987404,0.00043942968,0.00021036927,0.00029504253,0.0002204496,0.00009431811],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011273868,0.00012505805,0.00028531952,0.00017401755,0.0000377907,0.000013238652,0.00025525954,0.000046558365,0.00018825923],"category_scores_gemma":[0.0004338836,0.00011345125,0.00007540975,0.0002271947,0.000028744218,0.000073995136,0.00012862109,0.00008069101,0.00010665286],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008020391,0.0014819192,0.00022574645,0.0015791231,0.0003028951,0.0000086465325,0.03412364,0.00013807406,0.007549783,0.9280676,0.0021969655,0.024245398],"study_design_scores_gemma":[0.0002583277,0.00012323975,0.00013803256,0.000075335,0.00004081453,0.0000044936464,0.0005924058,0.014143861,0.029054096,0.9554292,0.000018153642,0.00012207171],"about_ca_topic_score_codex":0.00001786077,"about_ca_topic_score_gemma":0.000002929325,"teacher_disagreement_score":0.23535201,"about_ca_system_score_codex":0.00003700363,"about_ca_system_score_gemma":0.000026486063,"threshold_uncertainty_score":0.4626408},"labels":[],"label_agreement":null},{"id":"W1968406684","doi":"10.1090/s0025-5718-04-01683-7","title":"More on the total number of prime factors of an odd perfect number","year":2004,"lang":"lv","type":"article","venue":"Mathematics of Computation","topic":"Analytic Number Theory Research","field":"Mathematics","cited_by":16,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Algorithm; Annotation; Artificial intelligence; Computer science; Mathematics","score_opus":0.04774830645407832,"score_gpt":0.3601177191843817,"score_spread":0.3123694127303034,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1968406684","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9645828,0.000011956757,0.028613904,0.00015800646,0.000093985975,0.00090856984,0.000072991366,0.00003323571,0.0055245394],"genre_scores_gemma":[0.9776935,0.000004701768,0.02169103,0.00000891622,0.000050802613,0.000008933504,0.000026857291,0.000092655464,0.00042262912],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99582255,0.00032424636,0.0015417059,0.00033335743,0.0015787,0.00039944175],"domain_scores_gemma":[0.9938612,0.0028639794,0.0014802623,0.00094718894,0.00071695884,0.00013039746],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0016648958,0.00043210335,0.001064504,0.00014471315,0.00011070337,0.00004153598,0.0005895813,0.00023746172,0.0006964579],"category_scores_gemma":[0.0010409704,0.00031729674,0.00040493504,0.0005325476,0.00062179915,0.0001914342,0.00017684595,0.00039729508,0.00015592016],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00028173433,0.009690976,0.0016860042,0.0075189904,0.0013572461,0.00001263747,0.08758039,0.020667683,0.005338808,0.86458623,0.00019861937,0.0010806625],"study_design_scores_gemma":[0.0017955982,0.0006890385,0.0019384798,0.0020209053,0.0005197019,0.00006404055,0.013661234,0.06319277,0.0923601,0.82324564,0.000002339157,0.00051012094],"about_ca_topic_score_codex":0.000101805206,"about_ca_topic_score_gemma":0.0000040234945,"teacher_disagreement_score":0.08702129,"about_ca_system_score_codex":0.00014533424,"about_ca_system_score_gemma":0.00025539548,"threshold_uncertainty_score":0.99992794},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.06061191258833785,"score_gpt":0.35902135795128626,"score_spread":0.2984094453629484,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1969155620","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.018746808,0.000005697044,0.9774457,0.00026976387,0.0001315768,0.00018422696,0.0000012015304,0.00010982439,0.0031051796],"genre_scores_gemma":[0.38795802,3.6438695e-7,0.6119159,0.00007677927,0.000026439977,0.000001690208,0.0000037112118,0.0000060943926,0.000010972105],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987884,0.000042713873,0.00046045432,0.0001991409,0.00033846174,0.00017082403],"domain_scores_gemma":[0.9985422,0.0006575979,0.00031631178,0.00028885214,0.000131967,0.0000630879],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000944614,0.000111295274,0.00019610279,0.00011941779,0.00007709946,0.00005250373,0.00032050602,0.000044753095,0.0000053504373],"category_scores_gemma":[0.000115689,0.00009934082,0.00005491738,0.00032375188,0.000039109145,0.00014195149,0.000070724265,0.00008582579,0.000031865628],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010558946,0.0007302345,0.00004043276,0.00015830234,0.000024055857,0.0000032170617,0.0031777448,0.0049372795,0.016902294,0.2344099,0.00028522202,0.73932076],"study_design_scores_gemma":[0.0002526577,0.00016389486,0.0019627786,0.00004040242,0.0000042445226,0.000004792417,0.00008771358,0.8717772,0.00797499,0.11737975,0.00022498184,0.00012659747],"about_ca_topic_score_codex":0.000006696031,"about_ca_topic_score_gemma":6.677201e-7,"teacher_disagreement_score":0.86683995,"about_ca_system_score_codex":0.000033745793,"about_ca_system_score_gemma":0.000013875128,"threshold_uncertainty_score":0.40510008},"labels":[],"label_agreement":null},{"id":"W1970043819","doi":"10.1090/s0025-5718-06-01843-6","title":"The monic integer transfinite diameter","year":2006,"lang":"lv","type":"article","venue":"Mathematics of Computation","topic":"Analytic Number Theory Research","field":"Mathematics","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Monic polynomial; Infimum and supremum; Transfinite number; Integer (computer science); Upper and lower bounds; Conjecture","score_opus":0.03535445283113081,"score_gpt":0.3198876848868083,"score_spread":0.2845332320556775,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1970043819","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.17869563,0.00069406396,0.7977297,0.00084984995,0.00027384618,0.001065369,0.00003378837,0.0000846084,0.020573147],"genre_scores_gemma":[0.9626388,0.00006215723,0.031849477,0.00001575287,0.00015661883,0.000028290651,0.000017854743,0.000099447214,0.0051316046],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9962321,0.00031706042,0.001540096,0.0002997772,0.0010600438,0.0005509462],"domain_scores_gemma":[0.9919092,0.0061278665,0.0006949013,0.00067383767,0.0005131801,0.00008100975],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0023294082,0.00036123968,0.00064001355,0.00018721368,0.0002879734,0.00020874044,0.0006020188,0.0001853534,0.00012823284],"category_scores_gemma":[0.0004976461,0.00026456438,0.00037102855,0.00049865386,0.00052719604,0.00014340768,0.00011630043,0.0003999218,0.00032971957],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009432078,0.001545168,0.00013581924,0.0027355598,0.0005095814,0.000012934218,0.0063843597,0.0030514563,0.0009775675,0.9690446,0.0060529397,0.009455653],"study_design_scores_gemma":[0.0005643718,0.00010672354,0.00008535431,0.0003491235,0.00021869187,0.000012339901,0.0011155161,0.20483585,0.0017734203,0.7903863,0.00031895778,0.0002333086],"about_ca_topic_score_codex":0.000064248874,"about_ca_topic_score_gemma":0.000059567083,"teacher_disagreement_score":0.7839432,"about_ca_system_score_codex":0.00011028218,"about_ca_system_score_gemma":0.00012799299,"threshold_uncertainty_score":0.9999806},"labels":[],"label_agreement":null},{"id":"W1970678811","doi":"10.1090/s0025-5718-2014-02902-5","title":"Artin prime producing polynomials","year":2014,"lang":"en","type":"article","venue":"Mathematics of Computation","topic":"Algebraic Geometry and Number Theory","field":"Mathematics","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Lethbridge","funders":"Natural Sciences and Engineering Research Council of Canada; Universities Space Research Association","keywords":"Mathematics; Combinatorics; Prime (order theory); Artin L-function; Integer (computer science); Conjecture; Discrete mathematics; Generalization; Modulo; Polynomial; Square number; Unique prime; Prime factor; Conductor; Mathematical analysis","score_opus":0.029142643327283623,"score_gpt":0.2958594629925581,"score_spread":0.2667168196652745,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1970678811","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.60719764,0.0000092854,0.38785306,0.00008278487,0.000081470076,0.00018287727,9.3006133e-7,0.00007509183,0.004516863],"genre_scores_gemma":[0.86598635,4.6120581e-7,0.13360983,0.000021815695,0.00008770782,0.0000064015203,0.0000036463116,0.000022665026,0.00026109538],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987436,0.000100458165,0.000565853,0.00016619044,0.00026080274,0.0001630823],"domain_scores_gemma":[0.997983,0.00111005,0.0004526598,0.00029357287,0.00011618924,0.00004452403],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015152964,0.00013231808,0.0003365431,0.00011488187,0.00005880702,0.000019497616,0.000143095,0.00006076788,0.00005595616],"category_scores_gemma":[0.0014711035,0.00012161357,0.000076353324,0.00018468354,0.000052553536,0.00009137556,0.000049027927,0.000078294725,0.00006025637],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000048229853,0.0012325771,0.00035887916,0.0025994524,0.00017215595,0.0000014168801,0.016967986,0.00086753373,0.023038961,0.91707164,0.0027165383,0.034924645],"study_design_scores_gemma":[0.00028642872,0.00006451501,0.00022558628,0.00012713944,0.00004057184,0.0000080742,0.00022463914,0.010522037,0.057542156,0.930768,0.00005053503,0.00014031566],"about_ca_topic_score_codex":0.0000021214692,"about_ca_topic_score_gemma":5.050349e-7,"teacher_disagreement_score":0.25878873,"about_ca_system_score_codex":0.000016801576,"about_ca_system_score_gemma":0.000018682818,"threshold_uncertainty_score":0.49592575},"labels":[],"label_agreement":null},{"id":"W1970827750","doi":"10.1090/s0025-5718-01-01331-x","title":"Proving the deterministic period breaking of linear congruential generators using two tile quasicrystals","year":2001,"lang":"en","type":"article","venue":"Mathematics of Computation","topic":"Quasicrystal Structures and Properties","field":"Materials Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Montréal","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Aperiodic graph; Pseudorandom number generator; Mathematics; Quasicrystal; Tile; Sequence (biology); Quadratic equation; Unitary state; Combinatorics; Discrete mathematics; Pure mathematics; Geometry; Algorithm","score_opus":0.030920014126261067,"score_gpt":0.29661515084154755,"score_spread":0.2656951367152865,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1970827750","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.92651004,0.00006370041,0.07288507,0.000014980384,0.0001668506,0.00019946872,0.00000917256,0.000019235638,0.00013146702],"genre_scores_gemma":[0.9698369,0.0000012409165,0.030041872,0.0000107397545,0.000081090664,0.0000027217761,0.0000026386545,0.000014550868,0.000008262597],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989474,0.00006179271,0.00047120036,0.00011646898,0.00026441642,0.00013875378],"domain_scores_gemma":[0.99915254,0.00010072312,0.00042828752,0.00014740683,0.00014744858,0.000023587172],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00032524933,0.00010928599,0.00023048065,0.00004120019,0.00015213588,0.000059614395,0.00016385443,0.000031254265,0.000067015404],"category_scores_gemma":[0.00007206694,0.000074332915,0.000057143603,0.00010101002,0.00013355518,0.00010252056,0.00006422007,0.00004271892,0.000002656041],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000020512995,0.000045144036,0.00010394601,0.00028891469,0.000011248154,0.0000026718556,0.0047775353,0.036647953,0.9553649,0.0009903745,0.0000057296284,0.0017410817],"study_design_scores_gemma":[0.0003949758,0.00012660118,0.00012329333,0.00023073293,0.00007397943,0.00010762351,0.0012378352,0.6391051,0.3505568,0.007807483,0.0000492365,0.00018635853],"about_ca_topic_score_codex":0.00009826134,"about_ca_topic_score_gemma":0.0000183948,"teacher_disagreement_score":0.6048081,"about_ca_system_score_codex":0.000018104061,"about_ca_system_score_gemma":0.000051261675,"threshold_uncertainty_score":0.30312082},"labels":[],"label_agreement":null},{"id":"W1971833212","doi":"10.1090/s0025-5718-06-01830-8","title":"Limiting set of second order spectra","year":2006,"lang":"en","type":"article","venue":"Mathematics of Computation","topic":"Spectral Theory in Mathematical Physics","field":"Mathematics","cited_by":16,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Division of Mathematical Sciences; Pacific Institute for the Mathematical Sciences","keywords":"Mathematics; Eigenvalues and eigenvectors; Hilbert space; Invertible matrix; Multiplicity (mathematics); Subspace topology; Combinatorics; Limiting; Order (exchange); Truncation (statistics); Spectrum (functional analysis); Spectral line; Generality; Mathematical analysis; Pure mathematics; Statistics; Physics; Quantum mechanics","score_opus":0.03673051730315482,"score_gpt":0.3128916688455222,"score_spread":0.2761611515423674,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1971833212","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6776813,0.000015515112,0.28574654,0.00003910954,0.000051077717,0.0003085809,0.000015662396,0.000085189,0.036056995],"genre_scores_gemma":[0.66686386,4.925706e-7,0.33288038,0.000005281147,0.00007751294,0.000005260462,0.000008916887,0.00003520523,0.00012308464],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9980056,0.00005872056,0.0010682096,0.00017606605,0.00046445034,0.00022694153],"domain_scores_gemma":[0.9966657,0.0018315824,0.0008247849,0.00032659105,0.00031552275,0.000035823334],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00058988755,0.00021154544,0.00057949795,0.00012764725,0.000042829615,0.00001961314,0.00022452383,0.00008412502,0.0002259301],"category_scores_gemma":[0.00043487898,0.00019916722,0.00014584012,0.00038490313,0.00013694268,0.00012371414,0.000053358912,0.00012799178,0.000022478474],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000007793639,0.00041324456,0.000028072775,0.0017510537,0.000046894995,0.0000014660329,0.0010927008,0.000712745,0.013877914,0.98128533,0.00048773325,0.000295049],"study_design_scores_gemma":[0.00032874156,0.00006958388,0.0001037026,0.00019279995,0.000060028982,0.00000863726,0.00028455618,0.015907772,0.06030598,0.9225603,0.000010271998,0.0001676228],"about_ca_topic_score_codex":0.000004880416,"about_ca_topic_score_gemma":0.000006659312,"teacher_disagreement_score":0.05872503,"about_ca_system_score_codex":0.000034828998,"about_ca_system_score_gemma":0.000032944492,"threshold_uncertainty_score":0.81218034},"labels":[],"label_agreement":null},{"id":"W1972140029","doi":"10.1090/s0025-5718-07-01941-2","title":"Computation of capacity","year":2007,"lang":"en","type":"article","venue":"Mathematics of Computation","topic":"Mathematics and Applications","field":"Mathematics","cited_by":26,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université Laval","funders":"Natural Sciences and Engineering Research Council of Canada; Canada Research Chairs","keywords":"Mathematics; Logarithm; Cantor set; Set (abstract data type); Computation; Upper and lower bounds; Property (philosophy); Plane (geometry); Compact space; Value (mathematics); Discrete mathematics; Applied mathematics; Combinatorics; Mathematical analysis; Algorithm; Geometry; Statistics; Computer science","score_opus":0.08763943873449292,"score_gpt":0.35795645348802646,"score_spread":0.27031701475353354,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1972140029","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.41646957,0.000007606142,0.57859737,0.000023638097,0.000030285411,0.00024773402,0.000005648683,0.000037253034,0.004580931],"genre_scores_gemma":[0.6055507,9.807003e-7,0.39438212,0.000004084804,0.000015428328,0.0000040783148,0.00000489472,0.00001498658,0.000022729739],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99821687,0.000022304457,0.0010421807,0.0001349109,0.00042166773,0.00016205889],"domain_scores_gemma":[0.99740666,0.0009987522,0.00091330556,0.00022826016,0.00039904838,0.000053988086],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011823893,0.00014103705,0.000392767,0.00018136125,0.000049305778,0.0000101007345,0.00015316607,0.00007800806,0.000016593629],"category_scores_gemma":[0.0002972041,0.00013474369,0.0001101262,0.00032334263,0.000097881595,0.00006890133,0.00003894498,0.00007952595,0.000007914695],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000018093477,0.001978193,0.00017577686,0.004177587,0.00012642429,0.0000010685543,0.008382293,0.0011843618,0.02349972,0.9496639,0.0027021877,0.008090405],"study_design_scores_gemma":[0.00039062873,0.000069534675,0.0003811691,0.00021982274,0.00006685409,0.000008571542,0.0005361622,0.048874557,0.034964576,0.91428995,0.000037800128,0.00016037791],"about_ca_topic_score_codex":0.000007968766,"about_ca_topic_score_gemma":0.0000071218383,"teacher_disagreement_score":0.18908113,"about_ca_system_score_codex":0.000025792153,"about_ca_system_score_gemma":0.000023335651,"threshold_uncertainty_score":0.5494688},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.05420266250477231,"score_gpt":0.30874616152677437,"score_spread":0.2545434990220021,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1972785700","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.18837349,0.00007235272,0.81071335,0.000008811555,0.000038775383,0.00015728804,0.000021202022,0.000059069152,0.00055563555],"genre_scores_gemma":[0.5358749,0.000005691685,0.46406662,0.0000012763703,0.0000053180324,0.000004208159,0.00002524248,0.000012028602,0.0000047300086],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984473,0.00003891962,0.0009620963,0.00009463181,0.0003382608,0.000118819014],"domain_scores_gemma":[0.9975557,0.0015975848,0.0003333728,0.00019842127,0.00028589403,0.000029031788],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003144631,0.00012506024,0.0005023269,0.00043572427,0.000033868626,0.0000060757093,0.00010556646,0.000058883375,0.000057741414],"category_scores_gemma":[0.00036996292,0.00013101503,0.00016590372,0.0013996284,0.00006167873,0.00012791676,0.000014512595,0.000054206477,0.0000033441902],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000037011225,0.00013030115,0.000015698835,0.00037307697,0.00030210134,9.695838e-8,0.0007556158,0.94973665,0.0020766743,0.024334013,0.000006642323,0.022265445],"study_design_scores_gemma":[0.0001396924,0.000028219578,0.00064781023,0.0000819464,0.00039475175,6.896944e-7,0.000062402876,0.8529958,0.0025632202,0.1429926,0.0000043745845,0.00008848123],"about_ca_topic_score_codex":0.000002674873,"about_ca_topic_score_gemma":0.0000014295985,"teacher_disagreement_score":0.3475014,"about_ca_system_score_codex":0.00003441307,"about_ca_system_score_gemma":0.00001786672,"threshold_uncertainty_score":0.5342638},"labels":[],"label_agreement":null},{"id":"W1973465423","doi":"10.1090/s0025-5718-07-02005-4","title":"On pseudospectra of matrix polynomials and their boundaries","year":2007,"lang":"en","type":"article","venue":"Mathematics of Computation","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":22,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"Natural Sciences and Engineering Research Council of Canada; Leverhulme Trust","keywords":"Mathematics; Eigenvalues and eigenvectors; Smoothness; Boundary (topology); Polynomial matrix; Matrix (chemical analysis); Polynomial; Boundary value problem; Matrix polynomial; Orthogonal polynomials; Pure mathematics; Mathematical analysis","score_opus":0.010126585259753617,"score_gpt":0.26624446897916476,"score_spread":0.25611788371941113,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1973465423","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.30150983,0.000054030108,0.6972832,0.00006254769,0.000075573655,0.000083762585,0.0000020915397,0.00002739887,0.0009015499],"genre_scores_gemma":[0.8368058,0.0000021543708,0.1631326,0.000013014652,0.00001493915,5.916543e-7,7.8648947e-7,0.000004552494,0.000025552203],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992442,0.000022921084,0.000358462,0.00011478852,0.00015101465,0.00010859849],"domain_scores_gemma":[0.99888134,0.000578451,0.00026127158,0.00017801403,0.00006884248,0.000032106876],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00079274486,0.00009187773,0.00021114918,0.00012253763,0.00006488667,0.00006863705,0.00020252404,0.000035559377,0.000004318058],"category_scores_gemma":[0.000058181737,0.00007383696,0.00004090665,0.00015844873,0.0001159007,0.00013734818,0.00005758609,0.000045609286,0.0000031734241],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010825077,0.00010060371,0.000008100218,0.00014621415,0.000015100197,8.579478e-7,0.0036667117,0.00026661027,0.002728057,0.9800684,0.00004193201,0.012946617],"study_design_scores_gemma":[0.00026964128,0.00018308683,0.00024557806,0.00006851895,0.0000052393475,0.000012519749,0.00017205157,0.08375942,0.07644825,0.83870584,0.00003232491,0.00009751524],"about_ca_topic_score_codex":0.0000033180334,"about_ca_topic_score_gemma":7.579837e-7,"teacher_disagreement_score":0.535296,"about_ca_system_score_codex":0.000008747904,"about_ca_system_score_gemma":0.000027024098,"threshold_uncertainty_score":0.3010984},"labels":[],"label_agreement":null},{"id":"W1977120869","doi":"10.1090/s0025-5718-03-01542-4","title":"A pseudospectral mapping theorem","year":2003,"lang":"en","type":"article","venue":"Mathematics of Computation","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":13,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Manitoba","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Banach space; Bounded function; Stability (learning theory); Applied mathematics; Spectral theorem; Pure mathematics; Algebra over a field; Mathematical analysis; Operator theory; Computer science","score_opus":0.01641740656565617,"score_gpt":0.24472559911375275,"score_spread":0.2283081925480966,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1977120869","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03467261,0.000028705634,0.9502609,0.00006208143,0.000119139586,0.000099042896,3.9938857e-7,0.000079679914,0.014677475],"genre_scores_gemma":[0.5591526,9.757496e-7,0.44077006,0.000014845429,0.0000081434555,0.0000018934545,4.0720525e-7,0.000003614637,0.000047429585],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99925417,0.0000591981,0.00025584557,0.00012493179,0.00018127116,0.00012459392],"domain_scores_gemma":[0.99937546,0.00017152031,0.00015193019,0.00020651618,0.00006237013,0.000032229756],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00052493357,0.000081332306,0.00014118891,0.000084690866,0.000049737362,0.000052460182,0.00026029485,0.000027052096,0.000015776965],"category_scores_gemma":[0.00006934253,0.00007364067,0.000054378976,0.00026273687,0.000028135608,0.0001957917,0.000032743163,0.00005032528,0.00002672614],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[3.8966218e-7,0.00006282557,0.0000075134444,0.000053041087,0.000007923319,0.0000013400709,0.0015273012,0.0007526481,0.00051837217,0.9935557,0.000032723496,0.0034802095],"study_design_scores_gemma":[0.00014850193,0.000024913083,0.000036276015,0.000027147078,0.000002676851,0.000019602032,0.000093512775,0.21506852,0.0068314527,0.7775978,0.000071770024,0.00007782105],"about_ca_topic_score_codex":4.886764e-7,"about_ca_topic_score_gemma":7.553454e-8,"teacher_disagreement_score":0.52448,"about_ca_system_score_codex":0.00001094837,"about_ca_system_score_gemma":0.000024616802,"threshold_uncertainty_score":0.30029795},"labels":[],"label_agreement":null},{"id":"W1978196283","doi":"10.1090/s0025-5718-2014-02916-5","title":"Linear relations of zeroes of the zeta-function","year":2014,"lang":"en","type":"article","venue":"Mathematics of Computation","topic":"Analytic Number Theory Research","field":"Mathematics","cited_by":20,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Lethbridge","funders":"Natural Sciences and Engineering Research Council of Canada; Alberta Innovates","keywords":"Mathematics; Conjecture; Riemann zeta function; Riemann hypothesis; Function (biology); Combinatorics; Pure mathematics","score_opus":0.04936643275089933,"score_gpt":0.33414141527094554,"score_spread":0.2847749825200462,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1978196283","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.43242434,0.0000062618487,0.5619533,0.00008571812,0.000049801045,0.0002149125,0.000004090992,0.000016137146,0.0052454504],"genre_scores_gemma":[0.9411395,7.404669e-7,0.058308452,0.000004172651,0.00002051002,0.00000348142,0.0000027892006,0.000016695107,0.0005036442],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985176,0.00014445263,0.0006663171,0.00009029446,0.00048629064,0.000095092786],"domain_scores_gemma":[0.9969609,0.0015746858,0.0006851104,0.00035483297,0.0004017095,0.000022769931],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010663524,0.00008877744,0.00030654253,0.00010017627,0.00004597193,0.000004310371,0.00020586039,0.00005946792,0.000054606582],"category_scores_gemma":[0.0013532684,0.00006317821,0.0001365341,0.00029381338,0.00015947173,0.00006103184,0.00007101025,0.000096116135,0.000011337808],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002214724,0.00042758422,0.00085289596,0.0011677566,0.00013237027,5.0090954e-8,0.0023845588,0.0052265613,0.003999885,0.9838865,0.00064467423,0.0012550474],"study_design_scores_gemma":[0.00023816417,0.00007029018,0.00061501254,0.00015325654,0.000106006024,0.0000013934954,0.00024087334,0.15409656,0.008403313,0.8360032,0.000021947917,0.000050028484],"about_ca_topic_score_codex":0.000006360404,"about_ca_topic_score_gemma":0.0000033366373,"teacher_disagreement_score":0.5087152,"about_ca_system_score_codex":0.000016212478,"about_ca_system_score_gemma":0.000036893212,"threshold_uncertainty_score":0.25763327},"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,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_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","score_opus":0.02841022300064903,"score_gpt":0.3409996028791354,"score_spread":0.31258937987848634,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1979763552","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6664002,0.00005175999,0.33277532,0.00017108244,0.000029725032,0.0002975888,0.000018334498,0.00002563307,0.0002303812],"genre_scores_gemma":[0.6491325,0.000009131151,0.35080633,0.00000862303,0.000012864252,0.0000010029166,0.0000037409466,0.000009041724,0.000016805105],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9982445,0.00009202414,0.0008932785,0.00016849648,0.0004129865,0.0001887161],"domain_scores_gemma":[0.99698913,0.0019488399,0.00054168183,0.0002313326,0.00022871619,0.000060323575],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006111018,0.00019299921,0.0005395687,0.00008050098,0.00010759174,0.000029729423,0.0001320254,0.00009714962,0.000013116276],"category_scores_gemma":[0.00060951436,0.00012173978,0.00013192644,0.0001939271,0.0001345664,0.00007140197,0.000024251138,0.00013219124,6.728984e-7],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000074477066,0.00083732686,0.00006819833,0.0014354215,0.00031173142,0.0000031606291,0.005911307,0.00042821866,0.14026693,0.7189063,0.000047514637,0.13170944],"study_design_scores_gemma":[0.0006505178,0.00010612908,0.0015173847,0.0001371017,0.00011619174,0.000010872298,0.00017767567,0.16709307,0.025835466,0.80420583,0.000009598869,0.00014014675],"about_ca_topic_score_codex":0.0000035705489,"about_ca_topic_score_gemma":0.0000053450385,"teacher_disagreement_score":0.16666485,"about_ca_system_score_codex":0.000008694672,"about_ca_system_score_gemma":0.000018829038,"threshold_uncertainty_score":0.49644044},"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,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_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","score_opus":0.019167437485328242,"score_gpt":0.2511285033220414,"score_spread":0.23196106583671317,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1981675591","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.41982925,0.000051412106,0.5780194,0.00072027225,0.000057461224,0.00012875622,0.0000017241648,0.0000451617,0.0011466038],"genre_scores_gemma":[0.9196983,0.000018114635,0.0801311,0.00009912863,0.000021657781,0.0000029136213,0.0000018138633,0.000006529181,0.000020432764],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992083,0.000043695618,0.00029727494,0.00012315968,0.00022976003,0.00009783419],"domain_scores_gemma":[0.99868417,0.0007641642,0.00023454543,0.00022829197,0.00006286217,0.000025997218],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00032373623,0.0000877691,0.00016279827,0.000082572355,0.00006295901,0.000039392122,0.0002784002,0.000025206728,0.0000053058907],"category_scores_gemma":[0.000041019674,0.00006473306,0.000042074647,0.00022085385,0.00008254088,0.0001614734,0.00006357091,0.000055490433,0.000009062497],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000023465077,0.00013447633,0.000045108533,0.000059819715,0.000018194645,0.0000012963461,0.0025252416,0.0042306823,0.00054024736,0.98675007,0.00019268774,0.005499835],"study_design_scores_gemma":[0.00015403125,0.0000696988,0.0011173558,0.00007099723,0.0000066612997,0.0000142149265,0.00020152508,0.4640875,0.0013883277,0.532809,0.000016831178,0.000063870786],"about_ca_topic_score_codex":0.000005894528,"about_ca_topic_score_gemma":8.8280177e-7,"teacher_disagreement_score":0.49986905,"about_ca_system_score_codex":0.00000972773,"about_ca_system_score_gemma":0.00001642742,"threshold_uncertainty_score":0.26397374},"labels":[],"label_agreement":null},{"id":"W1982363352","doi":"10.1090/s0025-5718-05-01790-4","title":"Gröbner bases and generalized Padé approximation","year":2005,"lang":"en","type":"article","venue":"Mathematics of Computation","topic":"Polynomial and algebraic computation","field":"Computer Science","cited_by":14,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"Office of Naval Research; Multidisciplinary University Research Initiative; Mitacs; National Security Agency; National Science Foundation","keywords":"Mathematics; Basis (linear algebra); Multivariate statistics; Applied mathematics; Degree (music); Standard basis; Algebra over a field; Pure mathematics; Geometry; Statistics","score_opus":0.01683051534729296,"score_gpt":0.24697828104676153,"score_spread":0.23014776569946857,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1982363352","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.25773752,0.000059808182,0.740854,0.00060411595,0.00005236324,0.00011581413,8.1392113e-7,0.000076266835,0.00049929734],"genre_scores_gemma":[0.579053,0.0000041371395,0.42079332,0.00006905457,0.000037455702,0.0000044881513,0.0000045216784,0.000004182541,0.000029880595],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991542,0.000034539305,0.00033342713,0.00016355365,0.00020632613,0.0001079725],"domain_scores_gemma":[0.99937236,0.00015179526,0.00020539094,0.00014159874,0.000085329964,0.00004354755],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00022685433,0.00009928637,0.00016442008,0.000113103524,0.00005669779,0.000072891096,0.00016106023,0.000032906166,0.0000048727175],"category_scores_gemma":[0.000038321534,0.00009076607,0.000035928184,0.00017126414,0.000030118856,0.00043839472,0.0000831328,0.000038053895,0.000012519602],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000006081978,0.00025955384,0.000048863392,0.00020495965,0.00002764528,8.9893126e-7,0.004244853,0.021500148,0.005128248,0.42524973,0.00063482317,0.5426942],"study_design_scores_gemma":[0.00033294075,0.000032161213,0.00044731778,0.000026833248,0.000006800123,0.00000920525,0.00001824998,0.90192056,0.005162761,0.09177683,0.0001675122,0.00009882423],"about_ca_topic_score_codex":0.000005656715,"about_ca_topic_score_gemma":0.000001843123,"teacher_disagreement_score":0.8804204,"about_ca_system_score_codex":0.000017052409,"about_ca_system_score_gemma":0.000022096423,"threshold_uncertainty_score":0.3701333},"labels":[],"label_agreement":null},{"id":"W1982924806","doi":"10.1090/s0025-5718-08-02134-0","title":"Prime factors of consecutive integers","year":2008,"lang":"en","type":"article","venue":"Mathematics of Computation","topic":"Analytic Number Theory Research","field":"Mathematics","cited_by":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia; University of Calgary","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Prime (order theory); Conjecture; Monotone polygon; Combinatorics; Sequence (biology); Discrete mathematics; Function (biology); Prime factor; Prime number; Geometry","score_opus":0.11399221531453352,"score_gpt":0.367318272199022,"score_spread":0.2533260568844885,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1982924806","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7712979,0.000009330187,0.22338901,0.000016083828,0.000024886976,0.00021737233,0.000007132585,0.000029933513,0.0050083795],"genre_scores_gemma":[0.9451974,0.0000033114577,0.054488204,0.0000026089958,0.000007784285,0.000002823265,0.0000055814508,0.0000208335,0.0002714193],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985863,0.000078347606,0.00059149275,0.00011816716,0.00047747392,0.00014823755],"domain_scores_gemma":[0.9970803,0.0018087011,0.00046397425,0.0002251625,0.00037080314,0.000051053034],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004370183,0.00012670056,0.00042682682,0.0001657228,0.00004414262,0.000004072236,0.00018240187,0.00006155506,0.00007531656],"category_scores_gemma":[0.0008917964,0.00010874695,0.00011656715,0.00023211635,0.00032626058,0.0000705275,0.00005899798,0.000104050305,0.000013418732],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012743719,0.0026148956,0.008032778,0.0029217214,0.0008362902,0.000022524182,0.09269079,0.00052422064,0.012427186,0.8757612,0.0030762681,0.0009646832],"study_design_scores_gemma":[0.0005558589,0.00016279075,0.0007552296,0.00020416075,0.000066571396,0.000027232705,0.0039162054,0.019435506,0.07942027,0.8952675,0.0000072704497,0.00018139044],"about_ca_topic_score_codex":0.0000127748945,"about_ca_topic_score_gemma":0.0000011879247,"teacher_disagreement_score":0.17389956,"about_ca_system_score_codex":0.000037471425,"about_ca_system_score_gemma":0.00009048104,"threshold_uncertainty_score":0.4434572},"labels":[],"label_agreement":null},{"id":"W1983669472","doi":"10.1090/s0025-5718-07-01962-x","title":"K3 surfaces with Picard number three and canonical vector heights","year":2007,"lang":"en","type":"article","venue":"Mathematics of Computation","topic":"Algebraic Geometry and Number Theory","field":"Mathematics","cited_by":13,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"National Science Foundation","keywords":"Mathematics; Picard group; Moduli space; K3 surface; Pure mathematics; Rational number; Computation; Moduli; Argument (complex analysis); Algebra over a field; Algorithm; Group (periodic table)","score_opus":0.02435014413489743,"score_gpt":0.29308197219358184,"score_spread":0.2687318280586844,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1983669472","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7711954,0.000025848924,0.22422859,0.000040150477,0.00003975758,0.00018310468,0.0000022668446,0.000051049887,0.0042338],"genre_scores_gemma":[0.86531097,0.0000018383056,0.13453566,0.000011083947,0.000032658143,0.0000024716899,0.000003226441,0.000022013668,0.000080116355],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99884754,0.000029178984,0.00042162713,0.00016444118,0.00034043076,0.00019679357],"domain_scores_gemma":[0.9979377,0.001401673,0.0002623044,0.00018693559,0.00013319224,0.00007821101],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007740608,0.00015953947,0.00033704477,0.000059196,0.00006905175,0.000022160115,0.00010201264,0.00008476655,0.000051144336],"category_scores_gemma":[0.00013189537,0.00012211478,0.000043315566,0.00019120924,0.00014121183,0.00009783438,0.000043451597,0.00010849492,0.000017004864],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00018370946,0.00068967056,0.008119356,0.0014370257,0.00029729554,0.000025171947,0.006228886,0.00015315227,0.00055821566,0.9787368,0.00027966578,0.0032910062],"study_design_scores_gemma":[0.0007227083,0.00014199213,0.0076780044,0.00018266936,0.00010326308,0.000084388885,0.00066234777,0.0025240048,0.0038093743,0.9838136,0.000036357083,0.0002413336],"about_ca_topic_score_codex":0.000008114069,"about_ca_topic_score_gemma":0.000052362873,"teacher_disagreement_score":0.09411551,"about_ca_system_score_codex":0.000020423025,"about_ca_system_score_gemma":0.000030063913,"threshold_uncertainty_score":0.49796966},"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,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Algorithm; Materials science; Computer science","score_opus":0.015216812751999258,"score_gpt":0.226492021710375,"score_spread":0.21127520895837573,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1984582452","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.70205253,0.0003279719,0.29664996,0.00013763763,0.00021008076,0.00028525566,0.000012204673,0.000016676191,0.00030765668],"genre_scores_gemma":[0.9529248,0.000022581276,0.046844248,0.000034004137,0.000033109274,0.0000034573839,0.0000037360928,0.000016727345,0.000117354015],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99815506,0.00015112555,0.0007944084,0.00025220614,0.0004928194,0.00015435548],"domain_scores_gemma":[0.9982303,0.00018443775,0.00071412435,0.00041302192,0.00041169842,0.00004645818],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00053269474,0.00019494405,0.00038983393,0.00012051348,0.00008237967,0.00004856166,0.00033263396,0.00009409405,0.00006304472],"category_scores_gemma":[0.00006131205,0.00016273335,0.00013744929,0.00039630727,0.00024139244,0.00021639885,0.000113128895,0.000108729015,0.0000076697315],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00036008505,0.0032130606,0.0010795435,0.007822414,0.0006287867,0.000006195809,0.1301516,0.19590078,0.38493258,0.06892518,0.0008496356,0.20613016],"study_design_scores_gemma":[0.0009240809,0.0006295484,0.005201543,0.0006474509,0.00017585084,0.00002460048,0.0005394404,0.9003364,0.052811295,0.038412932,0.000038539332,0.00025836378],"about_ca_topic_score_codex":0.00003397739,"about_ca_topic_score_gemma":0.000004125095,"teacher_disagreement_score":0.7044356,"about_ca_system_score_codex":0.000035033314,"about_ca_system_score_gemma":0.000120816694,"threshold_uncertainty_score":0.66360736},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Mathematics; Random walk; Discrete mathematics; Calculus (dental); Statistical physics; Combinatorics; Statistics","score_opus":0.015957711761004557,"score_gpt":0.30340190743269757,"score_spread":0.287444195671693,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1985265065","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01309449,0.00001655386,0.9836675,0.00036957843,0.00009961865,0.0004738498,0.0000051258153,0.00011335131,0.0021599103],"genre_scores_gemma":[0.20624281,0.0000024574692,0.7933699,0.0001445956,0.000031376556,0.000024372746,0.000009318286,0.000013583542,0.00016157032],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988153,0.00007165477,0.0003983959,0.00022164792,0.00033313595,0.00015984714],"domain_scores_gemma":[0.99820834,0.0011266995,0.00019063432,0.0002789088,0.00014906435,0.000046324752],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007090659,0.00013212218,0.00025980407,0.00013153696,0.000068359375,0.000068630914,0.0003202763,0.000051460214,0.000040907744],"category_scores_gemma":[0.00012042988,0.00012351469,0.00012050007,0.00022868169,0.000020781847,0.00022129822,0.000024761126,0.00006189114,0.000057107787],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00019240807,0.0006121372,0.0000011142464,0.0004495089,0.00006562126,0.0000028717584,0.003699796,0.22736864,0.007253152,0.22442318,0.0026041334,0.5333274],"study_design_scores_gemma":[0.0012699704,0.00016560152,0.000017924543,0.000055543354,0.000012071986,0.0000053420863,0.000010105254,0.72095376,0.007422046,0.26986447,0.00012351909,0.00009966404],"about_ca_topic_score_codex":0.000004824922,"about_ca_topic_score_gemma":6.137142e-7,"teacher_disagreement_score":0.53322774,"about_ca_system_score_codex":0.00003948018,"about_ca_system_score_gemma":0.00003894531,"threshold_uncertainty_score":0.5036783},"labels":[],"label_agreement":null},{"id":"W1986609382","doi":"10.1090/s0025-5718-02-01460-6","title":"Newman polynomials with prescribed vanishing and integer sets with distinct subset sums","year":2002,"lang":"lv","type":"article","venue":"Mathematics of Computation","topic":"Mathematical functions and polynomials","field":"Mathematics","cited_by":13,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Algorithm; Annotation; Computer science; Artificial intelligence; Mathematics","score_opus":0.044305586819888956,"score_gpt":0.26616342563684053,"score_spread":0.2218578388169516,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1986609382","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7175204,0.00054201554,0.2691488,0.0006296224,0.00019989558,0.0018817536,0.0001536391,0.00017361296,0.009750249],"genre_scores_gemma":[0.8655722,0.000037027083,0.13284416,0.000040939525,0.000102112805,0.00004129773,0.000034236917,0.00013352666,0.001194501],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99642605,0.0001856679,0.0014992647,0.0005418632,0.000795253,0.0005518981],"domain_scores_gemma":[0.994902,0.0025013164,0.0012784371,0.00066619023,0.000378053,0.00027400616],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00083280704,0.00067421404,0.001366014,0.00025639203,0.00026630264,0.0003566623,0.00028922717,0.000249881,0.0006271149],"category_scores_gemma":[0.00047794956,0.0004971337,0.00013528205,0.00042721684,0.00038254826,0.0004201996,0.0001375461,0.0003609707,0.000078199715],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0021243417,0.021593044,0.0056566643,0.08779983,0.0077045094,0.00030209013,0.24283682,0.0062298123,0.0038009225,0.49622732,0.07373488,0.05198975],"study_design_scores_gemma":[0.009103477,0.0047998517,0.001186227,0.011756712,0.0040936833,0.0007806462,0.0067221127,0.7426673,0.0042131008,0.21001676,0.0013515706,0.0033085614],"about_ca_topic_score_codex":0.00005877716,"about_ca_topic_score_gemma":0.00009336174,"teacher_disagreement_score":0.7364375,"about_ca_system_score_codex":0.00007553989,"about_ca_system_score_gemma":0.00005765873,"threshold_uncertainty_score":0.99974805},"labels":[],"label_agreement":null},{"id":"W1986650956","doi":"10.1090/s0025-5718-00-01207-2","title":"Three new factors of Fermat numbers","year":2000,"lang":"en","type":"article","venue":"Mathematics of Computation","topic":"Algebraic Geometry and Number Theory","field":"Mathematics","cited_by":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Dalhousie University","funders":"University of Regina","keywords":"Decimal; Mathematics; Fermat's Last Theorem; Arithmetic; Division (mathematics); Elliptic curve; Fermat number; Factor (programming language); Discrete mathematics; Pure mathematics; Computer science","score_opus":0.04095587710203039,"score_gpt":0.295662362060633,"score_spread":0.2547064849586026,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1986650956","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8456704,0.000021548207,0.14462768,0.000030658834,0.00005250827,0.00018108587,0.000005009157,0.000054597425,0.009356535],"genre_scores_gemma":[0.91987664,0.0000034491343,0.07956927,0.000007916957,0.00002608066,0.0000014768705,0.000008753144,0.000023930399,0.00048245702],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.998747,0.000026398573,0.0006178825,0.00012017464,0.00034176104,0.00014680973],"domain_scores_gemma":[0.99853873,0.00072086125,0.00034384208,0.00025131466,0.00007964039,0.00006561566],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00028053398,0.00015488041,0.00039782305,0.000096556454,0.000035545414,0.000009819918,0.00018704661,0.00008247589,0.001032925],"category_scores_gemma":[0.00014928634,0.00013807154,0.00012929541,0.00025655964,0.00007071273,0.00011489207,0.000024050487,0.000079444966,0.00004595042],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00014811466,0.0021551526,0.0027233742,0.004228654,0.0006018093,0.000005121781,0.037523996,0.0027967794,0.001999031,0.88058496,0.011312203,0.05592081],"study_design_scores_gemma":[0.00037299824,0.0000572977,0.000689347,0.00012809318,0.0000624131,0.0000060976095,0.0004273171,0.002637219,0.007906415,0.9875351,0.000043588665,0.000134108],"about_ca_topic_score_codex":0.000026495298,"about_ca_topic_score_gemma":0.000005520327,"teacher_disagreement_score":0.10695015,"about_ca_system_score_codex":0.000016495642,"about_ca_system_score_gemma":0.000035919915,"threshold_uncertainty_score":0.99988025},"labels":[],"label_agreement":null},{"id":"W1987329669","doi":"10.1090/s0025-5718-2015-02927-5","title":"Algorithms for Chow-Heegner points via iterated integrals","year":2015,"lang":"en","type":"article","venue":"Mathematics of Computation","topic":"Algebraic Geometry and Number Theory","field":"Mathematics","cited_by":11,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Mathematics; Iterated function; Pure mathematics; Mathematical analysis","score_opus":0.09380599328720027,"score_gpt":0.35231209998318086,"score_spread":0.2585061066959806,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1987329669","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.25388405,0.000023929999,0.743717,0.00012143289,0.00018986475,0.0004629238,0.000010822365,0.000089128975,0.0015008529],"genre_scores_gemma":[0.5945807,5.932621e-7,0.40484983,0.00004276875,0.000068347224,0.00003086641,0.00003890417,0.000035133,0.0003528622],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986159,0.00006671727,0.000622278,0.0001740986,0.00032039822,0.00020059469],"domain_scores_gemma":[0.99778885,0.0009133064,0.00041042647,0.0002296794,0.0005570759,0.00010065402],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012283156,0.00018498133,0.0004105026,0.0001571936,0.000047161637,0.00004004371,0.0001803112,0.00010478195,0.00003453762],"category_scores_gemma":[0.0009833254,0.0001602639,0.00011471089,0.00026754188,0.00005943279,0.00020502273,0.00004486479,0.000086935295,0.00004068031],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00030428416,0.0027993475,0.00009254462,0.003520642,0.0005985505,0.000007925505,0.031529553,0.0009636815,0.0021532944,0.8894928,0.024937572,0.043599773],"study_design_scores_gemma":[0.00091640675,0.00015009208,0.000010771686,0.00011377357,0.000059573922,0.000015234026,0.00083865394,0.073447466,0.0076185632,0.9165569,0.00010684634,0.0001657552],"about_ca_topic_score_codex":0.000002740158,"about_ca_topic_score_gemma":6.515584e-7,"teacher_disagreement_score":0.34069663,"about_ca_system_score_codex":0.000041398358,"about_ca_system_score_gemma":0.00003991932,"threshold_uncertainty_score":0.6535372},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.026861764522192456,"score_gpt":0.2551159990401332,"score_spread":0.22825423451794075,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1991405149","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.52448,0.000033218028,0.4748885,0.00006406744,0.00008140172,0.00034133677,0.000006105112,0.000018707926,0.000086686974],"genre_scores_gemma":[0.9497571,0.0000016003987,0.050162923,0.00001993213,0.000021267993,0.0000092544615,0.000008460472,0.0000089743,0.000010511678],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985714,0.00014898031,0.0006470726,0.0001643168,0.0003534742,0.0001147619],"domain_scores_gemma":[0.9980406,0.0005455257,0.00069523224,0.00041720388,0.0002771568,0.000024238825],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008181677,0.00012050781,0.00029854348,0.000097605174,0.0001377127,0.000027518523,0.00047551672,0.00005026599,0.000014916777],"category_scores_gemma":[0.00005141895,0.000085275286,0.00019411261,0.00045559122,0.00026078825,0.00020874519,0.00006009565,0.00005330145,0.0000010873626],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0007627998,0.002704085,0.00015458805,0.0023629374,0.00049713114,3.9371656e-7,0.026187373,0.1769376,0.068911664,0.22882812,0.000812758,0.49184057],"study_design_scores_gemma":[0.0005156751,0.0004488577,0.0017580308,0.00017895248,0.00007852977,0.0000026293421,0.0001211532,0.73322445,0.013284658,0.25026444,0.000034054283,0.00008857237],"about_ca_topic_score_codex":0.000015662572,"about_ca_topic_score_gemma":0.000002778298,"teacher_disagreement_score":0.5562869,"about_ca_system_score_codex":0.000010483991,"about_ca_system_score_gemma":0.00005544587,"threshold_uncertainty_score":0.34774253},"labels":[],"label_agreement":null},{"id":"W1991678091","doi":"10.1090/s0025-5718-2012-02588-9","title":"Convergence analysis of a class of massively parallel direction splitting algorithms for the Navier-Stokes equations in simple domains","year":2012,"lang":"en","type":"article","venue":"Mathematics of Computation","topic":"Advanced Numerical Methods in Computational Mathematics","field":"Engineering","cited_by":13,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Convergence (economics); Mathematics; Simple (philosophy); Compressibility; Navier–Stokes equations; Massively parallel; Class (philosophy); Applied mathematics; Algorithm; Numerical analysis; Time stepping; Mathematical analysis; Parallel computing; Computer science","score_opus":0.057316971588662426,"score_gpt":0.3556123532710453,"score_spread":0.29829538168238284,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1991678091","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08341317,0.00016432955,0.91579956,0.00001584743,0.00010646095,0.0003724504,0.000029703095,0.000028431543,0.0000700757],"genre_scores_gemma":[0.53361285,0.000008808763,0.46630794,0.0000018088492,0.000011867632,0.00003153988,0.000012790867,0.000010845205,0.0000015642785],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986166,0.000047317182,0.000840116,0.000082599916,0.00025950794,0.0001538592],"domain_scores_gemma":[0.9934095,0.005738873,0.00047231646,0.00014559721,0.00020592407,0.000027745018],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00070300815,0.00011788239,0.0004316567,0.00025170608,0.000035831035,0.0000049081527,0.00012637232,0.000049131522,0.0000049100568],"category_scores_gemma":[0.0006910518,0.000102239756,0.00014271255,0.00095003354,0.0000688571,0.00012967644,0.000024222363,0.00006954146,6.5053064e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000004402071,0.00011472252,0.00041436023,0.0004849559,0.00024923208,3.137485e-8,0.0022365586,0.96956986,0.0010567055,0.017979326,0.0000037250595,0.00788611],"study_design_scores_gemma":[0.00017501935,0.000022552784,0.0029720585,0.000054588556,0.00027512485,4.0125101e-7,0.00056325254,0.931214,0.0014818229,0.063146956,0.000010088782,0.00008417353],"about_ca_topic_score_codex":0.0000050113554,"about_ca_topic_score_gemma":0.000002615887,"teacher_disagreement_score":0.4501997,"about_ca_system_score_codex":0.000050351122,"about_ca_system_score_gemma":0.000011908952,"threshold_uncertainty_score":0.41692162},"labels":[],"label_agreement":null},{"id":"W1993844643","doi":"10.1090/s0025-5718-03-01559-x","title":"The arithmetic of certain cubic function fields","year":2003,"lang":"en","type":"article","venue":"Mathematics of Computation","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":16,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Mathematics; Ideal (ethics); Jacobian matrix and determinant; Ideal class group; Arithmetic; Arithmetic function; Algebraic number theory; Cryptography; Function field; Field (mathematics); Class (philosophy); Class field theory; Algebraic number; Function (biology); Discrete mathematics; Pure mathematics; Algebra over a field; Algorithm; Applied mathematics; Mathematical analysis; Computer science; Law","score_opus":0.01313094937652154,"score_gpt":0.23349545416482226,"score_spread":0.22036450478830072,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1993844643","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.060514577,0.00007414649,0.9364806,0.00008048265,0.00014917314,0.00008122627,1.8853817e-7,0.000025475687,0.002594144],"genre_scores_gemma":[0.94375724,0.000004190311,0.056182887,0.000013973905,0.0000049411187,0.0000033370916,3.6255278e-7,0.0000029251644,0.000030127918],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99934286,0.00007525579,0.00025201618,0.000080076024,0.00016970544,0.00008008588],"domain_scores_gemma":[0.99894595,0.0005278371,0.00018526525,0.0002251452,0.00009980088,0.000016018806],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00056948804,0.00005704549,0.000100626814,0.00006671908,0.000078063356,0.000030034513,0.00021897203,0.00002852924,0.0000032535163],"category_scores_gemma":[0.00009636801,0.000042430678,0.00006384923,0.00029739068,0.000044921315,0.000081610866,0.000025937738,0.000046587986,0.0000030042818],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000026880664,0.000060164228,0.00002203808,0.00004954422,0.0000149215575,1.18111636e-7,0.0006907338,0.0016799219,0.00026708937,0.97866005,0.000053756175,0.018498948],"study_design_scores_gemma":[0.000120606885,0.00011438134,0.0001589212,0.0000267418,0.000011015832,0.0000028674592,0.00012821888,0.08941771,0.0038723317,0.9059314,0.00016534748,0.000050462146],"about_ca_topic_score_codex":0.0000012107557,"about_ca_topic_score_gemma":0.0000011446783,"teacher_disagreement_score":0.88324267,"about_ca_system_score_codex":0.0000043394934,"about_ca_system_score_gemma":0.00001817297,"threshold_uncertainty_score":0.17302728},"labels":[],"label_agreement":null},{"id":"W1994937806","doi":"10.1090/s0025-5718-2012-02532-4","title":"The Prouhet-Tarry-Escott problem for Gaussian integers","year":2012,"lang":"en","type":"preprint","venue":"Mathematics of Computation","topic":"semigroups and automata theory","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada; University of Waterloo","keywords":"Ideal (ethics); Gaussian; Combinatorics; Gaussian integer; Mathematics; Discrete mathematics; Gaussian elimination; Physics; Quantum mechanics","score_opus":0.023728592431746548,"score_gpt":0.2803132365579818,"score_spread":0.2565846441262353,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1994937806","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0036752454,0.00035681514,0.9914428,0.0009134852,0.00072671275,0.0013748576,0.00001168724,0.00018068316,0.0013176913],"genre_scores_gemma":[0.39889663,0.000014987087,0.6005698,0.00003855613,0.00011569661,0.00020851629,0.000030332782,0.000030133202,0.00009536955],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99821556,0.00007427252,0.00070200564,0.00031360728,0.00037394583,0.00032061816],"domain_scores_gemma":[0.9972657,0.00079980673,0.00090804405,0.0007242053,0.00023583537,0.00006641594],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014050291,0.00026312255,0.00037867675,0.00010060344,0.00017224648,0.00029404278,0.0013335531,0.00016486298,0.0000017989519],"category_scores_gemma":[0.00009281117,0.00018525535,0.0002020984,0.00013511532,0.00009227397,0.00020472343,0.00070079527,0.00024578394,0.000012376279],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009336798,0.00027350508,0.000008686711,0.0024318458,0.00013371112,5.155847e-7,0.009051438,0.0054457593,0.00021817922,0.8852544,0.0018828408,0.09528979],"study_design_scores_gemma":[0.00013049682,0.000032907577,0.000023531913,0.00029173828,0.00002578204,0.000003883369,0.00012676722,0.41857934,0.00087006326,0.5794489,0.00030062877,0.00016598564],"about_ca_topic_score_codex":0.0000065463496,"about_ca_topic_score_gemma":0.0000023898335,"teacher_disagreement_score":0.4131336,"about_ca_system_score_codex":0.000058132347,"about_ca_system_score_gemma":0.00011855656,"threshold_uncertainty_score":0.7554494},"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,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_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","score_opus":0.07551442773268005,"score_gpt":0.3980562090061455,"score_spread":0.32254178127346544,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1996637148","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3188564,0.000049817718,0.67975837,0.00009040933,0.00006891495,0.00035215696,0.000014902606,0.000034079672,0.00077498774],"genre_scores_gemma":[0.4511183,0.000006968764,0.54852647,0.000031673546,0.000061979146,0.000024694104,0.000015257674,0.000025745709,0.00018891528],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9983249,0.000060974624,0.0007536159,0.00019493778,0.00036502475,0.0003005849],"domain_scores_gemma":[0.9973004,0.0018730591,0.000306665,0.00022607704,0.00017596512,0.00011783061],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012701565,0.00022269216,0.00056748657,0.00008946434,0.00008461144,0.000033695374,0.00009586906,0.00015150948,0.00017147243],"category_scores_gemma":[0.00034949632,0.00017500028,0.00021106622,0.00014358343,0.000060028116,0.00019977924,0.000045926685,0.00011303731,0.000008558746],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000039349452,0.001143423,0.0003196894,0.004171995,0.000296405,0.0000011585755,0.004189102,0.000038581158,0.0007403094,0.9559748,0.001993526,0.031091621],"study_design_scores_gemma":[0.000625229,0.000057982983,0.0006755065,0.00013815881,0.00027134985,0.000026124344,0.00010548428,0.1331744,0.001475268,0.8631006,0.0001188257,0.00023106327],"about_ca_topic_score_codex":0.0000023912967,"about_ca_topic_score_gemma":0.0000017858182,"teacher_disagreement_score":0.13313581,"about_ca_system_score_codex":0.000013797908,"about_ca_system_score_gemma":0.000013567353,"threshold_uncertainty_score":0.71363044},"labels":[],"label_agreement":null},{"id":"W1998762286","doi":"10.1090/s0025-5718-2012-02591-9","title":"Tabulation of cubic function fields via polynomial binary cubic forms","year":2012,"lang":"lv","type":"article","venue":"Mathematics of Computation","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Algorithm; Type (biology); Annotation; Artificial intelligence; Computer science; Mathematics; Biology","score_opus":0.019360540611317284,"score_gpt":0.2518147950766555,"score_spread":0.2324542544653382,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1998762286","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.42936978,0.00023783652,0.5688781,0.000056444762,0.0006906196,0.00020265173,0.0000029977055,0.000039152652,0.00052240567],"genre_scores_gemma":[0.97140545,0.000010852646,0.028282495,0.000026652398,0.00019502119,0.0000068581,0.00002015141,0.000018670062,0.00003387125],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99799997,0.00011468933,0.0008765067,0.00021750989,0.00047019406,0.0003211104],"domain_scores_gemma":[0.9979846,0.00038185754,0.0009049178,0.00040934153,0.00022260196,0.00009668887],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00096192124,0.00023684665,0.00041667887,0.00039763286,0.00012765329,0.00004851326,0.000341619,0.00019373455,0.000048989423],"category_scores_gemma":[0.00004626627,0.00023429419,0.0002424718,0.00067294633,0.00010883921,0.0008809476,0.00015782028,0.00016094053,0.000034221033],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00053233874,0.0055321055,0.0048390045,0.0054790243,0.0006582784,0.0000024034468,0.048956666,0.054964237,0.042406533,0.5823249,0.0016324661,0.25267202],"study_design_scores_gemma":[0.0008951535,0.0010498224,0.010370833,0.00043976295,0.00024380288,0.000017449052,0.00034532472,0.78652847,0.01152707,0.18804035,0.00010568252,0.00043630722],"about_ca_topic_score_codex":0.000011721624,"about_ca_topic_score_gemma":0.0000013663888,"teacher_disagreement_score":0.7315642,"about_ca_system_score_codex":0.000033158485,"about_ca_system_score_gemma":0.000046374913,"threshold_uncertainty_score":0.955424},"labels":[],"label_agreement":null},{"id":"W2000495889","doi":"10.1090/s0025-5718-03-01465-0","title":"A computational approach for solving 𝑦²=1^{𝑘}+2^{𝑘}+…+𝑥^{𝑘}","year":2003,"lang":"en","type":"article","venue":"Mathematics of Computation","topic":"Algebraic Geometry and Number Theory","field":"Mathematics","cited_by":19,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa; University of Calgary","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Quartic function; Quadratic equation; Integral equation; Class (philosophy); Riemann hypothesis; Applied mathematics; Pure mathematics; Mathematical analysis; Discrete mathematics; Geometry","score_opus":0.044373048392026986,"score_gpt":0.30366581488545624,"score_spread":0.25929276649342925,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2000495889","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10284626,0.000032902735,0.887826,0.000019459585,0.00007710677,0.000540854,0.000009041399,0.00007622943,0.008572132],"genre_scores_gemma":[0.4972886,4.2098281e-7,0.5024939,0.000014255666,0.000017817192,0.000028584858,0.000019780204,0.00002206716,0.000114541916],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985695,0.00005777355,0.0006165998,0.00020951558,0.00032637405,0.00022023128],"domain_scores_gemma":[0.99715686,0.0019101226,0.0004075961,0.00018662093,0.00028159586,0.000057203328],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011189011,0.00018085475,0.00039642962,0.00015457661,0.000120923796,0.000027317841,0.00014357454,0.00008995719,0.000036956662],"category_scores_gemma":[0.0010509182,0.00017661037,0.00015709377,0.00025013956,0.000074037984,0.00011551868,0.000022782559,0.00008415938,0.0000066118682],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000013842133,0.0005416404,0.000042874704,0.0010898211,0.00008093008,2.9595805e-7,0.0016300215,0.010802669,0.00016061909,0.9843406,0.0007626989,0.0005340078],"study_design_scores_gemma":[0.00063989096,0.000059553655,0.000017909999,0.000044628297,0.000054712677,0.000018743063,0.0006899024,0.13035291,0.0017525519,0.8661622,0.000044095003,0.0001629279],"about_ca_topic_score_codex":5.002529e-7,"about_ca_topic_score_gemma":8.707163e-8,"teacher_disagreement_score":0.39444235,"about_ca_system_score_codex":0.000029940555,"about_ca_system_score_gemma":0.000053053336,"threshold_uncertainty_score":0.7201962},"labels":[],"label_agreement":null},{"id":"W2000517377","doi":"10.1090/s0025-5718-03-01477-7","title":"Monic integer Chebyshev problem","year":2003,"lang":"en","type":"article","venue":"Mathematics of Computation","topic":"Analytic Number Theory Research","field":"Mathematics","cited_by":23,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"Natural Sciences and Engineering Research Council of Canada; Mitacs; National Science Foundation","keywords":"Monic polynomial; Mathematics; Integer (computer science); Chebyshev polynomials; Combinatorics; Conjecture; Constant (computer programming); Discrete mathematics; Chebyshev nodes; Polynomial; Mathematical analysis","score_opus":0.06262583910469922,"score_gpt":0.35996439520060447,"score_spread":0.29733855609590526,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2000517377","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2241491,0.00003641355,0.7040019,0.000076799166,0.00004825998,0.00050653575,0.000002185025,0.00009330967,0.07108553],"genre_scores_gemma":[0.75320256,0.0000024657725,0.24567519,0.000008186155,0.000011484345,0.000014635787,0.000002305044,0.00003171062,0.001051493],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99843764,0.000121264595,0.0005708383,0.00016715757,0.00047155962,0.00023150825],"domain_scores_gemma":[0.99823207,0.00085867837,0.00028186486,0.00029492108,0.00026729755,0.00006515831],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012769761,0.00014890675,0.00033599863,0.00013963989,0.000050522194,0.000027469187,0.00018598889,0.00007244954,0.00021852084],"category_scores_gemma":[0.00078325754,0.00013173283,0.00010336481,0.00029221718,0.0000915216,0.000095430114,0.0000423309,0.00014751985,0.00010479235],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000005850562,0.00038417467,0.00008514009,0.00070451386,0.00007324382,0.00000210473,0.0021320428,0.00027124194,0.00056110026,0.9940765,0.0009774262,0.000726694],"study_design_scores_gemma":[0.00032764339,0.00004826827,0.000011460413,0.00011430516,0.00003812571,0.00001645794,0.00062745396,0.01685344,0.005254309,0.9764778,0.0001036687,0.00012703781],"about_ca_topic_score_codex":0.0000028870675,"about_ca_topic_score_gemma":0.0000019635117,"teacher_disagreement_score":0.52905345,"about_ca_system_score_codex":0.00005609782,"about_ca_system_score_gemma":0.00007165055,"threshold_uncertainty_score":0.53719085},"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,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Algorithm; Annotation; Computer science; Artificial intelligence","score_opus":0.03504730502769028,"score_gpt":0.24502691892162096,"score_spread":0.20997961389393066,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2000840326","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.85054976,0.00047945263,0.14688802,0.0006665012,0.00012424833,0.00032199087,0.000006084907,0.000020512167,0.00094344787],"genre_scores_gemma":[0.9573113,0.000008074733,0.042510763,0.000086484535,0.000030994328,0.0000036732447,1.8608537e-7,0.000008777182,0.000039756258],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99874085,0.00008643536,0.0005245334,0.00016966846,0.0003355156,0.00014300559],"domain_scores_gemma":[0.99886024,0.00013076572,0.00049004826,0.0003397485,0.00014448485,0.000034684443],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006316702,0.00014268523,0.00025441492,0.00006865941,0.00009734302,0.000053773758,0.00040046952,0.00005586334,0.0000073916162],"category_scores_gemma":[0.000047070243,0.00009894112,0.00012065404,0.00026139314,0.0002701187,0.0001734173,0.0002290197,0.00007880965,0.000003461963],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000081053375,0.0017026187,0.0017751616,0.0039588665,0.00022462965,3.841091e-7,0.09957519,0.0028601862,0.013842033,0.72598803,0.00025081274,0.14974101],"study_design_scores_gemma":[0.0007658994,0.0002501457,0.0033558595,0.0014954499,0.00011450926,0.000016916576,0.0008147842,0.66328627,0.060505662,0.26839665,0.0006723909,0.0003254586],"about_ca_topic_score_codex":0.000009518064,"about_ca_topic_score_gemma":0.000009771411,"teacher_disagreement_score":0.6604261,"about_ca_system_score_codex":0.00001568277,"about_ca_system_score_gemma":0.000044196888,"threshold_uncertainty_score":0.4034702},"labels":[],"label_agreement":null},{"id":"W2001250256","doi":"10.1090/s0025-5718-03-01524-2","title":"Weakly nonoscillatory schemes for scalar conservation laws","year":2003,"lang":"en","type":"article","venue":"Mathematics of Computation","topic":"Computational Fluid Dynamics and Aerodynamics","field":"Engineering","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Manitoba","funders":"Office of Naval Research; Natural Sciences and Engineering Research Council of Canada; National Science Foundation","keywords":"Mathematics; Conservation law; Scalar (mathematics); Nonlinear system; Dimension (graph theory); Convergence (economics); Godunov's scheme; Class (philosophy); Applied mathematics; Mathematical analysis; Pure mathematics; Numerical analysis; Geometry","score_opus":0.009607431678969892,"score_gpt":0.2201880560637886,"score_spread":0.21058062438481873,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2001250256","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.35549828,0.000060161856,0.64318055,0.00001916613,0.00013104832,0.00018570002,0.000011801997,0.000067349116,0.00084593176],"genre_scores_gemma":[0.79681784,0.0000056477083,0.20304942,0.000015640657,0.000011482375,0.000013455928,0.00003989544,0.000023537406,0.000023102853],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993259,0.000009280666,0.00032918513,0.00008840113,0.00014148031,0.000105788786],"domain_scores_gemma":[0.9993981,0.0002400009,0.00007133408,0.00008644418,0.00017542468,0.000028669172],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00019861593,0.00010395842,0.00016424186,0.00007782905,0.00004003801,0.000021350726,0.000055936605,0.000048513797,0.0000043413374],"category_scores_gemma":[0.000074363736,0.00011523001,0.00006144039,0.00011984841,0.000022390639,0.00007839548,0.0000064781416,0.000039358318,0.0000051232846],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000023420894,0.00006943938,0.0001462623,0.00060253986,0.000051351744,2.0033957e-7,0.0002154895,0.61333156,0.0053879092,0.37768963,0.0005284234,0.0019748758],"study_design_scores_gemma":[0.00022943575,0.000021141224,0.00024792843,0.000035333156,0.000013523512,0.0000015934319,0.000030053183,0.9263909,0.0010316119,0.07105109,0.00083803857,0.00010937357],"about_ca_topic_score_codex":7.0070837e-7,"about_ca_topic_score_gemma":0.0000026402975,"teacher_disagreement_score":0.44131953,"about_ca_system_score_codex":0.000036920694,"about_ca_system_score_gemma":0.000025044386,"threshold_uncertainty_score":0.46989435},"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,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_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","score_opus":0.028974753906512645,"score_gpt":0.32927481263339115,"score_spread":0.3003000587268785,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2001512608","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0057366774,0.0003250337,0.98821646,0.00031821727,0.00024432226,0.00042242682,0.000012971968,0.0002976605,0.0044262325],"genre_scores_gemma":[0.033665206,0.00003858919,0.9660129,0.0000491793,0.000112608795,0.000036380326,0.0000058071278,0.00004228989,0.00003705893],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982233,0.00012451525,0.0007826528,0.00015791542,0.00048483757,0.00022679042],"domain_scores_gemma":[0.99718857,0.0019086171,0.0002668115,0.0003829016,0.00019360722,0.00005951507],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00090696453,0.00022154713,0.00037133225,0.00007225886,0.00008929649,0.00003863655,0.00055965787,0.000055775326,0.00003522969],"category_scores_gemma":[0.0005466132,0.00017258992,0.00011197968,0.0003456809,0.0001027894,0.00017737508,0.00013776527,0.00015786779,0.00003474502],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000004325195,0.000092462884,0.000004516711,0.00035739815,0.00007317802,4.7364276e-7,0.0010202882,0.8663164,0.0007103263,0.025158273,0.0017680424,0.10449431],"study_design_scores_gemma":[0.00020245744,0.000021365879,0.000021179447,0.00006818051,0.00003339212,0.000008226306,0.00009087407,0.58777153,0.003435687,0.40671545,0.0014924653,0.0001391834],"about_ca_topic_score_codex":8.2560285e-7,"about_ca_topic_score_gemma":8.3495627e-7,"teacher_disagreement_score":0.38155717,"about_ca_system_score_codex":0.00007350924,"about_ca_system_score_gemma":0.000020172813,"threshold_uncertainty_score":0.7038013},"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,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_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","score_opus":0.0062415481975028955,"score_gpt":0.240579837570993,"score_spread":0.2343382893734901,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2001972447","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2638031,0.000057907004,0.7349881,0.0000071044187,0.000017904089,0.000050305887,6.7120914e-7,0.0002401041,0.00083480286],"genre_scores_gemma":[0.76808035,0.0000073748784,0.23187557,0.000005228856,0.000007644736,0.0000016751538,0.0000032462203,0.000013784742,0.0000051343186],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99949604,0.0000034441887,0.0002353308,0.00006118416,0.00012933888,0.000074688905],"domain_scores_gemma":[0.99974716,0.000033412205,0.00005808519,0.00009455839,0.000043674267,0.000023119323],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000053126238,0.000078719364,0.00015343569,0.000079193975,0.000014005933,0.000007424752,0.00006912518,0.000030982523,0.000005858292],"category_scores_gemma":[0.00001580486,0.00007566367,0.00005127345,0.00014316136,0.000022944609,0.00009595968,0.000016168557,0.00005282084,0.000017717935],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000041640565,0.00023139638,0.00008418508,0.0006962958,0.00010226989,0.0000035886771,0.0013345039,0.87191844,0.062147494,0.03204416,0.00012543843,0.03130807],"study_design_scores_gemma":[0.00022599916,0.000047393627,0.0001490122,0.00018513674,0.000023569999,0.0000036580918,0.000053517073,0.64120144,0.20557882,0.15221101,0.00014360649,0.00017681897],"about_ca_topic_score_codex":0.0000010585131,"about_ca_topic_score_gemma":3.3966657e-7,"teacher_disagreement_score":0.5042772,"about_ca_system_score_codex":0.000041106392,"about_ca_system_score_gemma":0.000003992953,"threshold_uncertainty_score":0.3085475},"labels":[],"label_agreement":null},{"id":"W2003508782","doi":"10.1090/s0025-5718-03-01591-6","title":"Gaussian elimination is stable for the inverse of a diagonally dominant matrix","year":2003,"lang":"en","type":"article","venue":"Mathematics of Computation","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":12,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Diagonally dominant matrix; Mathematics; Diagonal; Sigma; Combinatorics; Inverse; Gaussian; Matrix (chemical analysis); Geometry; Pure mathematics; Physics; Invertible matrix; Chemistry","score_opus":0.018001114113116452,"score_gpt":0.2780450630124894,"score_spread":0.26004394889937293,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2003508782","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011572199,0.000057474266,0.9869641,0.00037575306,0.00012253557,0.00038288985,0.000007015451,0.00001557295,0.00050246716],"genre_scores_gemma":[0.52298063,0.000008934071,0.4767496,0.000034509503,0.0000113264705,0.000019763978,0.000002098569,0.0000069230186,0.00018618951],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999107,0.0000488386,0.00037344234,0.00012162316,0.0002321535,0.000116956646],"domain_scores_gemma":[0.99840957,0.0007492416,0.0003675167,0.0002458379,0.0002036751,0.000024188323],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009175867,0.00008821688,0.00017433325,0.00008128435,0.00007805659,0.000037157562,0.00030816242,0.000046117693,0.000010856673],"category_scores_gemma":[0.00015067667,0.00006389974,0.00008287628,0.00023360045,0.00004369175,0.00020416935,0.000036866226,0.000049158647,0.000004613274],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008310205,0.00017517166,0.0000054211982,0.00039506413,0.000031022937,3.6203446e-7,0.0048169154,0.004641555,0.0014319131,0.9815949,0.00060651975,0.006292818],"study_design_scores_gemma":[0.0003406847,0.0000748229,0.00003491381,0.000042688192,0.000022017199,0.0000040822983,0.00023468997,0.6558523,0.029875148,0.31313527,0.0003140141,0.00006936341],"about_ca_topic_score_codex":0.000003063501,"about_ca_topic_score_gemma":0.000001540345,"teacher_disagreement_score":0.66845965,"about_ca_system_score_codex":0.000013642409,"about_ca_system_score_gemma":0.000054878106,"threshold_uncertainty_score":0.26057556},"labels":[],"label_agreement":null},{"id":"W2004429972","doi":"10.1090/s0025-5718-07-02001-7","title":"Construction of hyperelliptic function fields of high three-rank","year":2007,"lang":"en","type":"article","venue":"Mathematics of Computation","topic":"Algebraic Geometry and Number Theory","field":"Mathematics","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University; University of Calgary","funders":"Natural Sciences and Engineering Research Council of Canada; National Science Foundation","keywords":"Mathematics; Rank (graph theory); Hyperelliptic curve; Ideal (ethics); Jacobian matrix and determinant; Genus; Function (biology); Field (mathematics); Hyperelliptic curve cryptography; Function field; Quadratic equation; Class (philosophy); Ideal class group; Pure mathematics; Finite field; Discrete mathematics; Combinatorics; Applied mathematics; Geometry; Computer science","score_opus":0.023302340569759352,"score_gpt":0.2685120920411471,"score_spread":0.24520975147138777,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2004429972","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5096795,0.00001628553,0.4891094,0.00000888276,0.000119580734,0.00010809457,0.0000020777172,0.000016359301,0.0009398138],"genre_scores_gemma":[0.8355889,0.0000023956618,0.1643328,0.0000039590636,0.000029467683,0.0000012961402,0.000005574062,0.000012242846,0.000023361497],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99861264,0.000027992246,0.0008184765,0.00010524863,0.00031888013,0.00011675019],"domain_scores_gemma":[0.99763197,0.0010935301,0.00076513505,0.00020531703,0.0002751423,0.000028924063],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00088075636,0.000114155686,0.00037989215,0.00019156189,0.000028375462,0.0000034598847,0.00009675179,0.00012154776,0.000078776866],"category_scores_gemma":[0.00025237433,0.00010879218,0.00009819386,0.00028955634,0.00013374051,0.00008100875,0.000025996804,0.00008689972,0.0000048688225],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013577442,0.000467359,0.00039896442,0.0022309178,0.0001492628,7.151708e-7,0.0014860868,0.000833495,0.003278308,0.97565836,0.000059639155,0.015301122],"study_design_scores_gemma":[0.00043192625,0.00019201869,0.0009909942,0.00015636152,0.00012397114,0.000011674393,0.0006653246,0.0027316234,0.03805761,0.95654744,0.000002614147,0.000088424254],"about_ca_topic_score_codex":0.000013635627,"about_ca_topic_score_gemma":0.0000065764857,"teacher_disagreement_score":0.3259094,"about_ca_system_score_codex":0.000013872395,"about_ca_system_score_gemma":0.000019964646,"threshold_uncertainty_score":0.44364163},"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,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_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","score_opus":0.05357796670888526,"score_gpt":0.27789686899951727,"score_spread":0.224318902290632,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2006138621","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.111036606,0.000014946494,0.88770115,0.000058109406,0.00016828906,0.00030109525,0.0000047789335,0.000042822503,0.0006722108],"genre_scores_gemma":[0.63401884,4.748631e-7,0.36592025,0.000021449385,0.000005340273,0.000011187726,0.000001940088,0.0000048148436,0.000015718699],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99914885,0.00005599446,0.00035277513,0.00014500758,0.00017872718,0.0001186651],"domain_scores_gemma":[0.9989686,0.00034936194,0.00020768828,0.00022939342,0.00020584099,0.000039105773],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006204232,0.00008840716,0.00020044019,0.00017864443,0.000050126626,0.00003124003,0.00025261845,0.00003015222,0.0000038204835],"category_scores_gemma":[0.00014272232,0.00008816369,0.0001010953,0.0003593993,0.000027136402,0.00015140428,0.000033375687,0.000029711196,0.0000048833417],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000011281061,0.0001211528,0.000030381709,0.0002745334,0.000022827424,1.2376825e-7,0.0054070707,0.0029191368,0.008733336,0.9760274,0.0003715287,0.0060811904],"study_design_scores_gemma":[0.0004954455,0.0003904218,0.000174277,0.00012921078,0.000020106034,0.00000451816,0.0003538713,0.18212548,0.010720538,0.804759,0.00066682487,0.00016028342],"about_ca_topic_score_codex":0.0000014629303,"about_ca_topic_score_gemma":0.0000010821644,"teacher_disagreement_score":0.52298224,"about_ca_system_score_codex":0.000011684912,"about_ca_system_score_gemma":0.000022177039,"threshold_uncertainty_score":0.3595211},"labels":[],"label_agreement":null},{"id":"W2008253814","doi":"10.1090/s0025-5718-2014-02886-x","title":"New bounds for $\\psi (x)$","year":2014,"lang":"en","type":"preprint","venue":"Mathematics of Computation","topic":"Analytic Number Theory Research","field":"Mathematics","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Lethbridge","funders":"","keywords":"Riemann hypothesis; Smoothing; Mathematics; Riemann zeta function; Prime (order theory); Chebyshev filter; Function (biology); Zero (linguistics); Discrete mathematics; Number theory; Pure mathematics; Applied mathematics; Combinatorics; Mathematical analysis; Statistics","score_opus":0.09693806253681478,"score_gpt":0.4060806616726146,"score_spread":0.3091425991357998,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2008253814","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.021696746,0.000037909656,0.9712378,0.00020922524,0.00026039084,0.0012192582,0.000026970969,0.00011730685,0.0051944344],"genre_scores_gemma":[0.20631953,0.000004089167,0.7900487,0.000017000928,0.00030109737,0.00006415045,0.000080338374,0.00010893562,0.0030561346],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9975523,0.00009076906,0.0010126794,0.00036100743,0.0006778105,0.000305484],"domain_scores_gemma":[0.99489355,0.002767974,0.0009824252,0.000687447,0.0005398385,0.00012877662],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0016325249,0.00032733215,0.0009167051,0.00024458306,0.000066003624,0.00010084115,0.0005762673,0.00031371714,0.000081863465],"category_scores_gemma":[0.001349503,0.00031919507,0.0003599173,0.00011914989,0.00008060616,0.00004742729,0.00042736877,0.0003250733,0.00003257795],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005963891,0.00039244222,0.00001797658,0.015109717,0.00050099567,0.0000012024361,0.003529892,0.004431294,0.00013948309,0.917774,0.04787247,0.010170853],"study_design_scores_gemma":[0.00044576675,0.0000665843,0.0000046334894,0.00047744,0.00017351151,0.0000032705193,0.00009396902,0.19180278,0.000535999,0.8059404,0.00023591515,0.00021970643],"about_ca_topic_score_codex":0.000014368345,"about_ca_topic_score_gemma":0.000005612163,"teacher_disagreement_score":0.18737149,"about_ca_system_score_codex":0.00009761501,"about_ca_system_score_gemma":0.00032254859,"threshold_uncertainty_score":0.99992603},"labels":[],"label_agreement":null},{"id":"W2008455956","doi":"10.1090/s0025-5718-02-01504-1","title":"Computational investigations of the Prouhet-Tarry-Escott Problem","year":2002,"lang":"en","type":"article","venue":"Mathematics of Computation","topic":"semigroups and automata theory","field":"Computer Science","cited_by":24,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"Natural Sciences and Engineering Research Council of Canada; Mitacs; Simon Fraser University; University of Pennsylvania","keywords":"Ideal (ethics); Mathematics; Applied mathematics","score_opus":0.021962969744656228,"score_gpt":0.2250022095139752,"score_spread":0.20303923976931898,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2008455956","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.111140564,0.00005759792,0.88490766,0.0010478487,0.000100364625,0.00034469625,0.0000053031363,0.00008021539,0.0023157322],"genre_scores_gemma":[0.6439588,9.660297e-7,0.3559149,0.000055014632,0.000009011827,0.00000733922,0.0000024055491,0.0000058593423,0.000045719808],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99876446,0.00006434042,0.0004944966,0.00014790035,0.00041478066,0.00011401421],"domain_scores_gemma":[0.99872327,0.00028374,0.0004585769,0.00030812228,0.0001926662,0.000033610897],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00027252364,0.00010376109,0.0001801819,0.00008876704,0.00008823517,0.0000388177,0.0005780128,0.00003957717,0.000014844987],"category_scores_gemma":[0.00006777286,0.0000783483,0.0000825722,0.00048057028,0.0001319118,0.0002511814,0.00014341934,0.00007370499,0.000014755382],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[6.821953e-7,0.00040027453,0.00026236233,0.0003444122,0.000035054138,4.1937977e-7,0.0074840826,0.11638189,0.0010311262,0.8640355,0.0013691199,0.008655085],"study_design_scores_gemma":[0.00012689528,0.000022431268,0.00045487517,0.00008441613,0.0000065428726,0.000006267265,0.00003631337,0.61573577,0.0016352483,0.3818128,0.000022248058,0.000056175613],"about_ca_topic_score_codex":0.0000041498233,"about_ca_topic_score_gemma":7.9942004e-7,"teacher_disagreement_score":0.5328182,"about_ca_system_score_codex":0.000017109975,"about_ca_system_score_gemma":0.000032436492,"threshold_uncertainty_score":0.31949508},"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,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_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","score_opus":0.05804371422392374,"score_gpt":0.31760005471577496,"score_spread":0.2595563404918512,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2008496693","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.61203545,0.000046943067,0.38479453,0.00011108382,0.000024735335,0.00031715317,0.000003709132,0.000046143505,0.0026202614],"genre_scores_gemma":[0.7156644,0.0000031320208,0.28258955,0.000004965412,0.00002953692,0.0000029657638,0.0000020903492,0.00002748497,0.0016758933],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9982971,0.0000943221,0.0006582345,0.000143242,0.00062230707,0.00018482632],"domain_scores_gemma":[0.99742067,0.0013776612,0.0005321052,0.00032401204,0.00027498783,0.00007054367],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005073004,0.0001620141,0.000544566,0.00017102764,0.00004118006,0.000023995106,0.0001971593,0.00006065163,0.00030519962],"category_scores_gemma":[0.0003258052,0.0001308263,0.000075371965,0.00023564321,0.00013886513,0.000117247604,0.00004924221,0.00008489359,0.000036495618],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00016957754,0.001886343,0.00056163495,0.005571967,0.0011066537,0.00001893417,0.045087796,0.002900703,0.008774941,0.9111609,0.012552574,0.010207996],"study_design_scores_gemma":[0.0007707491,0.00027934072,0.000096873744,0.0004063945,0.00016204079,0.00002207425,0.001192437,0.049504865,0.031158194,0.9162185,0.0000032942398,0.00018523716],"about_ca_topic_score_codex":0.000038703674,"about_ca_topic_score_gemma":0.000006203399,"teacher_disagreement_score":0.10362894,"about_ca_system_score_codex":0.000035415338,"about_ca_system_score_gemma":0.000055721666,"threshold_uncertainty_score":0.5334942},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.026860406468533646,"score_gpt":0.27421223959389923,"score_spread":0.24735183312536557,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2009673783","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.02480852,0.00007448192,0.9728228,0.00002223384,0.0001762127,0.0006337549,0.00004190358,0.00025979913,0.0011602867],"genre_scores_gemma":[0.36526763,0.0000011436214,0.6345182,0.0000035496416,0.000083172716,0.000044162418,0.000016138969,0.00004432964,0.000021679323],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986124,0.000023400686,0.00069093326,0.00016302938,0.00029336163,0.00021685899],"domain_scores_gemma":[0.9977023,0.001562959,0.00025628682,0.00020257711,0.00023807507,0.00003777858],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00024426257,0.00021110893,0.00039705043,0.000107244574,0.000052452866,0.000019653728,0.0002129062,0.000073084484,0.0000040574682],"category_scores_gemma":[0.0003196924,0.00020982366,0.0001054783,0.00021793516,0.00006595546,0.000111329,0.000047562644,0.000103995146,0.0000061081096],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000063004654,0.00013805531,0.0000079596375,0.0008554951,0.00003126467,4.3527908e-7,0.0002534485,0.9694135,0.00084378774,0.025504824,0.00025648458,0.0026884347],"study_design_scores_gemma":[0.00026396345,0.00006050129,0.000052057734,0.00011623837,0.000023061186,0.0000028081877,0.000037658385,0.5705305,0.001760398,0.42699435,0.00003303155,0.00012547032],"about_ca_topic_score_codex":0.0000023100238,"about_ca_topic_score_gemma":0.0000020533478,"teacher_disagreement_score":0.40148956,"about_ca_system_score_codex":0.0000635218,"about_ca_system_score_gemma":0.000013519834,"threshold_uncertainty_score":0.85563606},"labels":[],"label_agreement":null},{"id":"W2010179120","doi":"10.1090/s0025-5718-02-01519-3","title":"Corrigendum to “Period of the power generator and small values of Carmichael’s function”","year":2002,"lang":"en","type":"erratum","venue":"Mathematics of Computation","topic":"Analytic Number Theory Research","field":"Mathematics","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Mathematics; Assertion; Notation; Generator (circuit theory); Discrete mathematics; Power (physics); Period (music); Combinatorics; Calculus (dental); Arithmetic; Computer science; Philosophy","score_opus":0.06351048077376403,"score_gpt":0.3061374538684275,"score_spread":0.24262697309466347,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2010179120","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.48244587,0.0026779303,0.40398738,0.0008305445,0.023967572,0.006865134,0.0007117269,0.00020321856,0.07831064],"genre_scores_gemma":[0.50501215,0.00013099576,0.154421,0.00013150681,0.00081868604,0.00010278904,0.000107981636,0.00053289294,0.338742],"study_design_codex":"not_applicable","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99738103,0.00017080124,0.0010970905,0.00027197474,0.00085126,0.00022781423],"domain_scores_gemma":[0.9969477,0.00035496367,0.0011367875,0.00066469825,0.00081104605,0.00008478824],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00079712574,0.00030862767,0.0009487208,0.00026832582,0.00007145704,0.000023193841,0.0004470261,0.00028629132,0.00014234065],"category_scores_gemma":[0.0007319112,0.0002360802,0.00022716922,0.0003749699,0.00025034067,0.000039604507,0.0002910088,0.00034123784,0.000009348442],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008314155,0.0011860059,0.00013646553,0.013245048,0.0011751615,0.0000040469945,0.027397472,0.00032379106,0.0018581896,0.107965335,0.8453385,0.0012868268],"study_design_scores_gemma":[0.0011405197,0.00085503876,0.0003061716,0.003568265,0.0013054853,0.000048647566,0.004493121,0.04738431,0.004600973,0.9311865,0.0042137555,0.0008972377],"about_ca_topic_score_codex":0.000014553194,"about_ca_topic_score_gemma":0.000013961918,"teacher_disagreement_score":0.8411248,"about_ca_system_score_codex":0.000056668392,"about_ca_system_score_gemma":0.00015495488,"threshold_uncertainty_score":0.96270716},"labels":[],"label_agreement":null},{"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.046713126870743645,"score_gpt":0.36103570505989857,"score_spread":0.31432257818915493,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2014339952","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0012204014,0.0001827662,0.9967206,0.00026836045,0.00018573421,0.00076412904,0.00002201235,0.00017861788,0.0004573546],"genre_scores_gemma":[0.12224096,0.000007561515,0.87746376,0.000051783176,0.000038860686,0.00013548517,0.000010300564,0.000040372128,0.000010899424],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99877226,0.00003999673,0.00060109847,0.00012989149,0.0002867317,0.0001700071],"domain_scores_gemma":[0.9915864,0.0076311473,0.00022503191,0.00019763949,0.00031852588,0.000041239884],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005070631,0.0001777257,0.00031707803,0.00008493763,0.000121754594,0.000029562196,0.00023242626,0.000059350972,0.0000050531285],"category_scores_gemma":[0.0007353677,0.00014202493,0.000103479906,0.00033839364,0.00009066138,0.00013147843,0.00003741336,0.00012312667,0.000007925384],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000004443718,0.00006597209,8.0395387e-7,0.00038235367,0.00006769239,2.0274159e-7,0.0013620339,0.8792402,0.00078529486,0.105448626,0.000040603056,0.012601763],"study_design_scores_gemma":[0.00028190922,0.000033103348,0.000010206506,0.000094980765,0.000033937642,0.0000028195125,0.0001925686,0.5510332,0.0033066024,0.44487548,0.000048965394,0.0000862513],"about_ca_topic_score_codex":0.000003297199,"about_ca_topic_score_gemma":0.0000016931882,"teacher_disagreement_score":0.33942685,"about_ca_system_score_codex":0.000075200354,"about_ca_system_score_gemma":0.00004745045,"threshold_uncertainty_score":0.57916087},"labels":[],"label_agreement":null},{"id":"W2014664484","doi":"10.1090/s0025-5718-2014-02817-2","title":"Computation of the topological type of a real Riemann surface","year":2014,"lang":"en","type":"article","venue":"Mathematics of Computation","topic":"Polynomial and algebraic computation","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Center for Diagnosis and Research on Alzheimer's Disease","funders":"Agence Nationale de la Recherche","keywords":"Computation; Type (biology); Surface (topology); Riemann surface; Topology (electrical circuits); Mathematics; Riemann hypothesis; Computer science; Pure mathematics; Geometry; Geology; Algorithm; Combinatorics; Paleontology","score_opus":0.02789749109193495,"score_gpt":0.27876166687241455,"score_spread":0.2508641757804796,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2014664484","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.49611872,0.000009661504,0.5028229,0.00012126437,0.00013998066,0.00009876034,7.44924e-7,0.000021210984,0.00066675834],"genre_scores_gemma":[0.8977432,0.0000021274816,0.1022019,0.000015035358,0.000016036818,6.797659e-7,0.0000022487147,0.000004709761,0.000014057126],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99874043,0.000117303076,0.0005524323,0.00014435929,0.00034167108,0.000103779515],"domain_scores_gemma":[0.9984077,0.0004021678,0.0006396371,0.00022840327,0.00029512396,0.000026937685],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00043807345,0.00009856889,0.0002764641,0.00005401585,0.000043420743,0.000014796671,0.00041664363,0.000052539228,0.0000019615784],"category_scores_gemma":[0.00013457997,0.000072145674,0.00008570747,0.00042207472,0.000110941735,0.0001180507,0.00016232234,0.000059679147,0.0000033044198],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000025583495,0.0005673899,0.0009993584,0.00069489254,0.000056136723,3.573155e-7,0.005822177,0.28146735,0.017509492,0.6613797,0.00022592366,0.031251676],"study_design_scores_gemma":[0.000246301,0.00016911907,0.007994873,0.00009094392,0.000011851321,0.000002925818,0.000036562797,0.78194094,0.009709483,0.19971925,0.0000059051454,0.0000718261],"about_ca_topic_score_codex":0.000030250645,"about_ca_topic_score_gemma":0.000002735648,"teacher_disagreement_score":0.5004736,"about_ca_system_score_codex":0.000014053403,"about_ca_system_score_gemma":0.000049502676,"threshold_uncertainty_score":0.29420152},"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,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Algorithm; Computer science; Artificial intelligence","score_opus":0.01495320323212815,"score_gpt":0.23819295732238188,"score_spread":0.22323975409025373,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2014937115","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5729714,0.00004994796,0.4241816,0.0012584205,0.00024395184,0.0004064114,0.000037354836,0.000023359535,0.0008275669],"genre_scores_gemma":[0.99444485,0.000007592905,0.0051637334,0.00015716151,0.000038477832,0.0000076219576,0.000013398325,0.000014435216,0.00015272546],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9978481,0.00023617232,0.0006874819,0.00023465646,0.00080033625,0.0001932638],"domain_scores_gemma":[0.99767524,0.00071841053,0.00058827974,0.0006730171,0.00030546822,0.000039574188],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000744266,0.00020087758,0.00026086785,0.000045803114,0.00017332811,0.00009111651,0.00074130576,0.00008261465,0.00019124502],"category_scores_gemma":[0.00019682971,0.00012605629,0.0001914493,0.00060878036,0.00020097302,0.00018109345,0.00009773728,0.00018350684,0.00010743803],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000074400465,0.0018137936,0.000031586493,0.0005543613,0.00013996405,0.0000026530888,0.010115637,0.23363788,0.01223466,0.6947502,0.0099277655,0.03671714],"study_design_scores_gemma":[0.0003848008,0.0002447577,0.001312735,0.00043562084,0.000047205867,0.0000071934337,0.000078808815,0.86998737,0.028325137,0.09884796,0.00015559966,0.00017282621],"about_ca_topic_score_codex":0.000013409649,"about_ca_topic_score_gemma":0.000001076678,"teacher_disagreement_score":0.6363495,"about_ca_system_score_codex":0.00008386349,"about_ca_system_score_gemma":0.000114559596,"threshold_uncertainty_score":0.5140426},"labels":[],"label_agreement":null},{"id":"W2015967265","doi":"10.1090/s0025-5718-2014-02919-0","title":"A variant of the Bombieri-Vinogradov theorem with explicit constants and applications","year":2014,"lang":"en","type":"article","venue":"Mathematics of Computation","topic":"Analytic Number Theory Research","field":"Mathematics","cited_by":11,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia; University of Lethbridge","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Mean value theorem (divided differences); Constant (computer programming); Dirichlet distribution; Character (mathematics); Function (biology); Lambda; Value (mathematics); Pure mathematics; Discrete mathematics; Combinatorics; Mathematical analysis; Picard–Lindelöf theorem; Statistics; Fixed-point theorem; Geometry","score_opus":0.026919301046778712,"score_gpt":0.30025780007154446,"score_spread":0.27333849902476576,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2015967265","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.21698453,0.000011755585,0.7756952,0.00008433692,0.000009088882,0.00058074726,0.000006906886,0.000022785049,0.006604626],"genre_scores_gemma":[0.940903,0.0000023315024,0.058936413,0.00001059379,0.0000134828815,0.000030098885,0.0000013680634,0.000020051066,0.00008263986],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99883467,0.00010854696,0.00040468993,0.00013413998,0.00038695088,0.0001310305],"domain_scores_gemma":[0.99769616,0.0012461995,0.00040191098,0.00039114658,0.00022176167,0.00004280955],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00081334927,0.000114522736,0.00029849235,0.000069533235,0.0000750248,0.000017495402,0.00022016605,0.000042523614,0.000013755117],"category_scores_gemma":[0.00022535305,0.000072441755,0.00004757541,0.00026880644,0.0002909122,0.000048448805,0.00008848955,0.00008695099,0.0000026138073],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000013369508,0.00018162864,0.00024759333,0.00054326147,0.00005768967,1.9769621e-7,0.0011997811,0.000064764616,0.0004953561,0.99511737,0.000038812177,0.0020401513],"study_design_scores_gemma":[0.0004377311,0.00007327972,0.0002679561,0.00018642361,0.000080529906,0.000026688444,0.0007215241,0.035363443,0.0017693235,0.96095425,0.000031104995,0.00008774422],"about_ca_topic_score_codex":0.000004450193,"about_ca_topic_score_gemma":0.000004332787,"teacher_disagreement_score":0.7239185,"about_ca_system_score_codex":0.0000130921135,"about_ca_system_score_gemma":0.000039372444,"threshold_uncertainty_score":0.2954089},"labels":[],"label_agreement":null},{"id":"W2017251444","doi":"10.1090/s0025-5718-07-02077-7","title":"Corrigendum to “The monic integer transfinite diameter”","year":2007,"lang":"en","type":"erratum","venue":"Mathematics of Computation","topic":"Analytic Number Theory Research","field":"Mathematics","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Transfinite number; Mathematics; Monic polynomial; Integer (computer science); Pure mathematics; Arithmetic; Mathematical analysis; Computer science; Polynomial; Programming language","score_opus":0.10610028567301116,"score_gpt":0.37730627887209145,"score_spread":0.2712059931990803,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2017251444","genre_codex":"methods","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0007255587,0.00017637108,0.94091654,0.00047746528,0.00720999,0.0014830229,0.00007108617,0.00011894155,0.048821032],"genre_scores_gemma":[0.033241544,0.00013051911,0.25001428,0.0004817867,0.0024653054,0.00022456747,0.00046657425,0.0007768323,0.7121986],"study_design_codex":"not_applicable","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9959249,0.0001951287,0.00140107,0.00042209463,0.0014957464,0.0005610595],"domain_scores_gemma":[0.9959661,0.0015882164,0.000708225,0.00093580614,0.00062509824,0.00017656513],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.002802393,0.0004910831,0.0010285535,0.0005982219,0.00012593994,0.000088581175,0.0010223117,0.0004546299,0.00024995234],"category_scores_gemma":[0.0012588692,0.00037076938,0.00039901893,0.0007763221,0.00017887921,0.000073378855,0.00018626466,0.0010992712,0.00041304118],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000032154952,0.0003515974,0.0000024450467,0.0022680573,0.0003106493,0.000012796704,0.006939394,0.000117695454,0.00002110328,0.03895361,0.9468194,0.0041710837],"study_design_scores_gemma":[0.00050964154,0.00032404385,0.000016251635,0.0019323627,0.0005431366,0.00003881271,0.0016379457,0.052361727,0.00036947228,0.874688,0.06677667,0.00080189295],"about_ca_topic_score_codex":0.000024269993,"about_ca_topic_score_gemma":0.000089912864,"teacher_disagreement_score":0.88004273,"about_ca_system_score_codex":0.00017365959,"about_ca_system_score_gemma":0.0002411597,"threshold_uncertainty_score":0.9998744},"labels":[],"label_agreement":null},{"id":"W2020189493","doi":"10.1090/s0025-5718-2011-02555-x","title":"The distance to an irreducible polynomial, II","year":2011,"lang":"en","type":"article","venue":"Mathematics of Computation","topic":"Cryptography and Residue Arithmetic","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Simon Fraser University","keywords":"Mathematics; Combinatorics; Polynomial; Integer (computer science); Degree (music); Irreducible polynomial; Reciprocal polynomial; Discrete mathematics; Matrix polynomial; Mathematical analysis; Physics","score_opus":0.03058943922189559,"score_gpt":0.26009430080941054,"score_spread":0.22950486158751496,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2020189493","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11120367,0.000045924022,0.8859405,0.00019800277,0.00016440023,0.00014263655,7.4470734e-7,0.000053069616,0.0022510886],"genre_scores_gemma":[0.6836644,0.0000028306047,0.31625137,0.000023122942,0.000011346947,0.000005899341,4.3356073e-7,0.0000040050472,0.00003660307],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99928534,0.00002673598,0.0002345194,0.00014322695,0.00017875759,0.00013140641],"domain_scores_gemma":[0.9992609,0.000097132404,0.00011514684,0.00038145253,0.00008620538,0.00005918194],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000292334,0.00007243038,0.00009877736,0.000073472685,0.00022881672,0.000057843794,0.00055874867,0.000021509277,0.0000026934567],"category_scores_gemma":[0.000027132286,0.000051425577,0.00004306189,0.0003430906,0.0000503519,0.00019482986,0.000118412434,0.000039671937,0.000013917913],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000021142612,0.0008823452,0.00008283253,0.00009435268,0.000046806712,0.000003698051,0.04594296,0.0027296373,0.0014360185,0.86974996,0.0027204072,0.07628985],"study_design_scores_gemma":[0.00042586413,0.00086605956,0.0066936514,0.00011912064,0.000024074643,0.000023297902,0.00096670975,0.42992228,0.015826901,0.54309624,0.0016219129,0.00041390615],"about_ca_topic_score_codex":0.000014793905,"about_ca_topic_score_gemma":0.0000091394,"teacher_disagreement_score":0.5724607,"about_ca_system_score_codex":0.0000068886548,"about_ca_system_score_gemma":0.00002244361,"threshold_uncertainty_score":0.20970742},"labels":[],"label_agreement":null},{"id":"W2020806681","doi":"10.1090/s0025-5718-00-01247-3","title":"Irreducibility testing over local fields","year":2000,"lang":"en","type":"article","venue":"Mathematics of Computation","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"","keywords":"Mathematics; Irreducibility; Irreducible polynomial; Laurent series; Polynomial ring; Laurent polynomial; Field (mathematics); Minimal polynomial (linear algebra); Finite field; Polynomial; Rational number; Bivariate analysis; Ring (chemistry); Pure mathematics; Rational function; Discrete mathematics; Series (stratigraphy); Algebra over a field; Square-free polynomial; Matrix polynomial; Mathematical analysis; Statistics","score_opus":0.024501179995209718,"score_gpt":0.26311842031686306,"score_spread":0.23861724032165332,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2020806681","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.34366915,0.000009208973,0.65230983,0.0000494355,0.000036401067,0.000049530016,3.489867e-7,0.00006842192,0.003807712],"genre_scores_gemma":[0.8158536,3.2895534e-7,0.18406561,0.000033214536,0.00001170645,0.0000017954221,6.5030446e-7,0.0000029276398,0.000030161847],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999308,0.0000330499,0.00023942858,0.00015556166,0.00016487548,0.00009908493],"domain_scores_gemma":[0.99922043,0.00033510113,0.00007967636,0.0002741806,0.000061201805,0.000029405186],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003483538,0.000070342394,0.00011611711,0.000051797277,0.00005100937,0.000038303944,0.0002648734,0.000034485252,0.000054085776],"category_scores_gemma":[0.0000453125,0.0000671549,0.000051674953,0.00032751172,0.000048233822,0.00016969217,0.000040252424,0.000057699643,0.000017303377],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000059043714,0.00027804525,0.00019543793,0.00013390006,0.000015359832,0.000001774909,0.0025371425,0.023483261,0.00019581059,0.12337681,0.00018305887,0.8495935],"study_design_scores_gemma":[0.00010001692,0.00005711233,0.0012142332,0.000036098765,0.000003972917,0.0000046119976,0.00002117936,0.55460995,0.00056186295,0.44329202,0.00003201712,0.000066897046],"about_ca_topic_score_codex":0.0000058901574,"about_ca_topic_score_gemma":7.2939963e-7,"teacher_disagreement_score":0.8495266,"about_ca_system_score_codex":0.000007946553,"about_ca_system_score_gemma":0.000017223405,"threshold_uncertainty_score":0.27384973},"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,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_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","score_opus":0.08065966435084237,"score_gpt":0.3272897556344406,"score_spread":0.24663009128359825,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2023411861","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.93250084,0.000021679685,0.06285509,0.0001280479,0.00005724347,0.0003560215,0.0000025006102,0.000019819356,0.0040587727],"genre_scores_gemma":[0.9905088,0.0000064640913,0.009037783,0.000008820766,0.000017747603,0.000008949373,0.0000014869122,0.000016919023,0.00039300648],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99881035,0.000102590726,0.00040900163,0.00009918711,0.0004490813,0.00012980097],"domain_scores_gemma":[0.9984704,0.0007748614,0.0003146947,0.00024999736,0.00016867227,0.000021324346],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006578358,0.00009135115,0.0002680036,0.00014684277,0.00004510766,0.000003934602,0.00018658859,0.000055237007,0.00005078265],"category_scores_gemma":[0.00041278647,0.0000670912,0.000068253925,0.00041921652,0.000138296,0.00004832917,0.00006944519,0.00010038211,0.000008068565],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00025273432,0.0029359455,0.01265409,0.00582633,0.0003663872,0.000013556752,0.05446995,0.005716298,0.022408776,0.8818999,0.0059420243,0.0075140297],"study_design_scores_gemma":[0.000622008,0.0001251524,0.0032547542,0.00026519617,0.000039287097,0.000015719537,0.0013756598,0.036652353,0.017751953,0.9397595,0.000018265642,0.00012013918],"about_ca_topic_score_codex":0.000014527668,"about_ca_topic_score_gemma":0.00004234012,"teacher_disagreement_score":0.058007997,"about_ca_system_score_codex":0.00003319527,"about_ca_system_score_gemma":0.000045066758,"threshold_uncertainty_score":0.27358997},"labels":[],"label_agreement":null},{"id":"W2028838204","doi":"10.1090/s0025-5718-10-02330-6","title":"Computing matrix representations","year":2010,"lang":"en","type":"article","venue":"Mathematics of Computation","topic":"Finite Group Theory Research","field":"Mathematics","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University; Simon Fraser University","funders":"SFU Community Trust Endowment Fund; Simon Fraser University","keywords":"Mathematics; Character (mathematics); Abelian group; Algebra over a field; Representation (politics); Matrix (chemical analysis); Group (periodic table); Matrix representation; Degree (music); Irreducible representation; Arithmetic; Combinatorics; Pure mathematics; Geometry","score_opus":0.0651269276187661,"score_gpt":0.42359142350114226,"score_spread":0.35846449588237617,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2028838204","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7121287,0.000005098145,0.27883264,0.000099475874,0.00015361996,0.0003114607,0.000005671963,0.000119252814,0.008344075],"genre_scores_gemma":[0.6457644,4.6494313e-7,0.35396197,0.0000045151096,0.000052155305,0.000004672624,0.000008205111,0.000025203555,0.00017842527],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9984346,0.00007068349,0.0006186434,0.00018183822,0.00047975205,0.00021449744],"domain_scores_gemma":[0.9964458,0.0024115397,0.00035319894,0.00039758722,0.00032483265,0.000067049965],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011182282,0.00013395214,0.00028126073,0.00022149282,0.000107366235,0.000047009067,0.00027307542,0.00008774561,0.00012648976],"category_scores_gemma":[0.0015080948,0.00013059209,0.00009611315,0.00034248538,0.00012839965,0.00012110133,0.000113509166,0.00029067392,0.00006674908],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000101022,0.0004056927,0.00032538665,0.00054648716,0.000044785917,0.0000033162676,0.0036328575,0.00044646842,0.028529711,0.96214336,0.0009582654,0.0029535554],"study_design_scores_gemma":[0.000351136,0.000039425206,0.0003777793,0.00004938668,0.000025876949,0.000024584942,0.00048549302,0.116826616,0.005923094,0.8757286,0.000035101628,0.00013288515],"about_ca_topic_score_codex":0.0000074258414,"about_ca_topic_score_gemma":0.000009787334,"teacher_disagreement_score":0.11638015,"about_ca_system_score_codex":0.000014199108,"about_ca_system_score_gemma":0.00004349546,"threshold_uncertainty_score":0.53253907},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.016872427647273036,"score_gpt":0.2551459051146664,"score_spread":0.23827347746739336,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2028982966","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4691582,0.00002869739,0.52938217,0.000018089151,0.00006994913,0.000050223916,9.432345e-8,0.000034285986,0.0012583028],"genre_scores_gemma":[0.8727107,0.0000010300855,0.12725063,0.000011867397,0.0000145877175,0.0000036540416,5.6958913e-7,0.000003839998,0.0000031232973],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993988,0.000032479154,0.00022450615,0.00007593597,0.00012704862,0.00014119166],"domain_scores_gemma":[0.9995157,0.0001700147,0.00010357483,0.00015774718,0.000023148064,0.000029799889],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005166944,0.00006173936,0.000114266986,0.00017171467,0.000022342843,0.000022817934,0.00022840941,0.00002514354,0.0000027570575],"category_scores_gemma":[0.000022047458,0.00006170766,0.00003967426,0.00031435888,0.000017028167,0.0003262278,0.00007013509,0.00004889237,0.00001328119],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000024557708,0.0002653865,0.005156086,0.00010522161,0.0000069048588,5.4753593e-7,0.0074729025,0.0016420753,0.0012597367,0.97084284,0.000018961096,0.013226893],"study_design_scores_gemma":[0.00035062403,0.0000475813,0.022053514,0.00010628547,0.0000061720943,0.000010905777,0.00018550268,0.3318522,0.004283464,0.6408924,0.000030427373,0.00018091364],"about_ca_topic_score_codex":0.000002963958,"about_ca_topic_score_gemma":9.198795e-7,"teacher_disagreement_score":0.4035525,"about_ca_system_score_codex":0.000013199751,"about_ca_system_score_gemma":0.0000067897904,"threshold_uncertainty_score":0.25163653},"labels":[],"label_agreement":null},{"id":"W2029069536","doi":"10.1090/s0025-5718-03-01514-x","title":"On the unknotting number of minimal diagrams","year":2003,"lang":"en","type":"article","venue":"Mathematics of Computation","topic":"Geometric and Algebraic Topology","field":"Mathematics","cited_by":9,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"Deutsche Forschungsgemeinschaft","keywords":"Mathematics; Combinatorics; Crossing number (knot theory); Discrete mathematics; Pure mathematics; Knot (papermaking)","score_opus":0.04389850629047749,"score_gpt":0.32096857795281725,"score_spread":0.27707007166233977,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2029069536","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8768923,0.000008975818,0.10118636,0.000090802256,0.00006875981,0.00017510551,0.0000017517615,0.000019161647,0.021556756],"genre_scores_gemma":[0.92615193,8.7146174e-7,0.07367844,0.000017866374,0.000010006484,0.000005413281,0.0000010550783,0.0000130057715,0.00012137766],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989718,0.000085854525,0.00046839632,0.00009188123,0.0002554433,0.00012658778],"domain_scores_gemma":[0.9953472,0.0039009983,0.00043318604,0.00018447122,0.000113119706,0.00002104498],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006490799,0.00010034438,0.00025776026,0.000072569535,0.000045947785,0.0000070119045,0.00011843569,0.00005388591,0.00020687736],"category_scores_gemma":[0.0025000088,0.000068456866,0.00008071948,0.00030453355,0.000087367865,0.000024686995,0.000019731273,0.00007955904,0.000027705688],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000024985216,0.0002346333,0.0001889077,0.00016161353,0.000027719012,4.1146285e-7,0.0009919249,0.00007772745,0.000075051954,0.99700785,0.0006004253,0.0006312581],"study_design_scores_gemma":[0.00021787826,0.000059567385,0.00013794436,0.000062705505,0.000028430526,0.000009524924,0.0008448094,0.0022196956,0.0042677824,0.99206126,0.000021645234,0.00006873091],"about_ca_topic_score_codex":0.0000019024384,"about_ca_topic_score_gemma":6.743161e-7,"teacher_disagreement_score":0.049259625,"about_ca_system_score_codex":0.0000102744225,"about_ca_system_score_gemma":0.000020824009,"threshold_uncertainty_score":0.29929247},"labels":[],"label_agreement":null},{"id":"W2031855337","doi":"10.1090/s0025-5718-07-01935-7","title":"A fast, rigorous technique for computing the regulator of a real quadratic field","year":2007,"lang":"en","type":"article","venue":"Mathematics of Computation","topic":"Polynomial and algebraic computation","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Correctness; Mathematics; Regulator; Computation; Quadratic equation; Field (mathematics); Linear-quadratic regulator; Algorithm; Applied mathematics; Discrete mathematics; Mathematical optimization; Optimal control; Pure mathematics; Geometry","score_opus":0.014460199964147312,"score_gpt":0.27954016659564385,"score_spread":0.2650799666314965,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2031855337","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12906998,0.000012736103,0.869544,0.00021741053,0.000108038555,0.00056398724,0.0000012022386,0.000052369272,0.0004302712],"genre_scores_gemma":[0.6297257,4.8964546e-7,0.37018916,0.000026882302,0.00003380503,0.0000066001835,0.000001677911,0.000005476059,0.000010229228],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99875945,0.000031277392,0.0006338894,0.00015602811,0.00024969087,0.00016968521],"domain_scores_gemma":[0.99738246,0.0015935139,0.00053316395,0.00025278825,0.00020553466,0.000032520216],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011019888,0.00011043974,0.00023824535,0.00011564861,0.00008846293,0.000031139894,0.00042385727,0.00004963805,6.772017e-7],"category_scores_gemma":[0.00011708932,0.000084912965,0.00009950087,0.00030284305,0.000046005243,0.00011887997,0.000101074766,0.00006441568,9.970821e-7],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000054703432,0.0005060183,0.00007385909,0.0011501276,0.0000918666,0.000002603113,0.015870884,0.011988678,0.03634926,0.62108815,0.0005806707,0.3122432],"study_design_scores_gemma":[0.00032947975,0.000279577,0.0007640942,0.00014279915,0.00001678331,0.000015707836,0.00015685846,0.6952583,0.09036453,0.21253431,0.00001233088,0.00012519895],"about_ca_topic_score_codex":0.000027542768,"about_ca_topic_score_gemma":0.0000077778295,"teacher_disagreement_score":0.6832697,"about_ca_system_score_codex":0.000021434254,"about_ca_system_score_gemma":0.000053007738,"threshold_uncertainty_score":0.34626502},"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,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_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","score_opus":0.12125518475458319,"score_gpt":0.4248783118106237,"score_spread":0.3036231270560405,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2036507234","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.40308875,0.00002538005,0.5963549,0.000044083048,0.000030947474,0.00023032282,0.0000018499791,0.000026126198,0.0001976418],"genre_scores_gemma":[0.43595484,0.0000021749802,0.56397295,0.000006105171,0.000010120274,0.000008591685,9.356694e-7,0.000013159906,0.000031133222],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987014,0.00017941624,0.00062238006,0.00013773529,0.0002490181,0.00011004463],"domain_scores_gemma":[0.99785113,0.0012858675,0.0004464742,0.00019083433,0.0001839908,0.000041709143],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00066614256,0.00013395205,0.00041682477,0.00010547606,0.000055795495,0.000012412042,0.000100507044,0.00006507669,0.000007845992],"category_scores_gemma":[0.0014482494,0.0001098377,0.00007112861,0.00013080279,0.00012230183,0.00008081698,0.000050307408,0.000089059504,0.0000022104673],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008620285,0.0024266196,0.000026264113,0.003430062,0.00019263054,3.2677605e-7,0.014750828,0.0045731273,0.082012005,0.59726137,0.000016883878,0.29522368],"study_design_scores_gemma":[0.0003149877,0.000094719886,0.000044748227,0.00017408199,0.000055415032,0.0000016465711,0.00015288006,0.28733122,0.10409998,0.60762835,0.000008568003,0.000093390474],"about_ca_topic_score_codex":0.0000067231954,"about_ca_topic_score_gemma":0.0000031371599,"teacher_disagreement_score":0.29513028,"about_ca_system_score_codex":0.000027320693,"about_ca_system_score_gemma":0.000020602167,"threshold_uncertainty_score":0.44790515},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.03977644850557643,"score_gpt":0.23769748096575619,"score_spread":0.19792103246017975,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2042126572","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.28161108,0.000028298953,0.7172961,0.00018994343,0.000066694854,0.0006591271,0.0000075266726,0.000024964163,0.00011622745],"genre_scores_gemma":[0.9850522,5.0769495e-7,0.014857742,0.000006437305,0.000018186547,0.00004561027,0.000007820552,0.0000084868725,0.0000029531732],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99931246,0.000023935752,0.0002970183,0.000056615852,0.00024311418,0.00006688379],"domain_scores_gemma":[0.9986351,0.00075311685,0.00015833344,0.00016594029,0.00027144462,0.00001603465],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00047136855,0.00006962871,0.00015481924,0.000021771733,0.000057688692,0.00002348473,0.000122006204,0.00003062234,0.0000012723332],"category_scores_gemma":[0.00030464068,0.000041765325,0.000056770266,0.00010942855,0.000055680484,0.000106856365,0.000011871687,0.000044066965,5.0251754e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000030692838,0.00010049348,0.000109066605,0.0003629878,0.00007387024,4.6434883e-9,0.0041768495,0.97571456,0.0023295507,0.012585466,0.000031925887,0.004484516],"study_design_scores_gemma":[0.00066090195,0.000056482786,0.0009311761,0.000040184434,0.00008015839,2.79837e-7,0.00061671453,0.9297909,0.0049413973,0.062830396,0.000005928559,0.000045441557],"about_ca_topic_score_codex":0.000009690122,"about_ca_topic_score_gemma":0.000026187683,"teacher_disagreement_score":0.7034412,"about_ca_system_score_codex":0.00003107485,"about_ca_system_score_gemma":0.000028713606,"threshold_uncertainty_score":0.17031406},"labels":[],"label_agreement":null},{"id":"W2043254124","doi":"10.1090/s0025-5718-08-02084-x","title":"Short effective intervals containing primes in arithmetic progressions and the seven cubes problem","year":2008,"lang":"en","type":"article","venue":"Mathematics of Computation","topic":"Analytic Number Theory Research","field":"Mathematics","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Lethbridge","funders":"","keywords":"Modulo; Interval (graph theory); Integer (computer science); Prime (order theory); Interval arithmetic; Arithmetic progression; Multiple","score_opus":0.048151570084771354,"score_gpt":0.36335388129682455,"score_spread":0.3152023112120532,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2043254124","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9262686,0.000098825854,0.06957935,0.00016102413,0.000014658789,0.001602424,0.0000016648044,0.00003968282,0.0022337895],"genre_scores_gemma":[0.94101405,0.000008785733,0.05871835,0.0000072544753,0.000012364557,0.00011931387,0.0000019607933,0.000021427595,0.00009648568],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9984297,0.00031441497,0.00054871873,0.00016216538,0.0003590925,0.00018588595],"domain_scores_gemma":[0.9955707,0.0038618897,0.00018581052,0.00018108706,0.0001601679,0.000040319974],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018748521,0.00014136847,0.00046686493,0.00014625666,0.00010146714,0.000023960032,0.00016465495,0.000055452958,0.000006915003],"category_scores_gemma":[0.00086145336,0.000092751776,0.00006859074,0.00023077906,0.0004343813,0.00009562295,0.00013638359,0.00018881359,0.0000036415663],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00058511517,0.0019060342,0.016231783,0.003881676,0.00063741865,0.000058365804,0.19510783,0.0012697264,0.00033589592,0.74086416,0.00044834186,0.038673628],"study_design_scores_gemma":[0.0013364555,0.00012026665,0.002256245,0.00069199037,0.000056595483,0.00008114753,0.002428464,0.1269325,0.0006499988,0.86531603,0.0000029689331,0.00012732348],"about_ca_topic_score_codex":0.00001031498,"about_ca_topic_score_gemma":0.000008797407,"teacher_disagreement_score":0.19267938,"about_ca_system_score_codex":0.000040457333,"about_ca_system_score_gemma":0.00004007272,"threshold_uncertainty_score":0.37823075},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.05102594684463761,"score_gpt":0.3460891226227808,"score_spread":0.29506317577814317,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2045357246","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.035275634,0.000012833237,0.95941263,0.000069683774,0.000092450435,0.00045048865,0.000015169729,0.0000747638,0.0045963707],"genre_scores_gemma":[0.13683148,0.0000014437724,0.8629174,0.000025563784,0.00008386631,0.00003129314,0.000014330255,0.000033492877,0.0000611044],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9980336,0.000094709205,0.0009802353,0.00022516183,0.00041213358,0.00025417283],"domain_scores_gemma":[0.99380267,0.005036919,0.0005079363,0.00025161452,0.00032462325,0.00007626781],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017659739,0.00021571854,0.0007168968,0.00024806143,0.000085039916,0.00004876217,0.00014743794,0.00012249815,0.000062622836],"category_scores_gemma":[0.0014409729,0.00017925596,0.00028018682,0.0003685842,0.00007894515,0.000096586664,0.00003240734,0.00012138683,0.000008567707],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000039207644,0.0003052119,0.000007693948,0.0015668808,0.00014487951,3.718928e-7,0.0007461935,0.000100233076,0.00022482558,0.646319,0.00015750629,0.3504233],"study_design_scores_gemma":[0.00039762023,0.000074963216,0.0000046004766,0.00008776957,0.00013813344,0.000007833803,0.00012473253,0.40841436,0.0037014307,0.58684605,0.00007630473,0.00012615114],"about_ca_topic_score_codex":0.0000018909785,"about_ca_topic_score_gemma":8.207517e-7,"teacher_disagreement_score":0.40831414,"about_ca_system_score_codex":0.000018350747,"about_ca_system_score_gemma":0.00001850842,"threshold_uncertainty_score":0.7309846},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.04918734259861358,"score_gpt":0.29149001394448276,"score_spread":0.2423026713458692,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2048276889","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07772832,0.00039760233,0.9210101,0.00018240037,0.00010044479,0.00031862265,0.000005362724,0.00010333403,0.00015384817],"genre_scores_gemma":[0.48176843,0.000030663334,0.518104,0.000024817446,0.000040319057,0.000004638128,0.000008288127,0.000007662641,0.000011180802],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988524,0.00002958972,0.00044457018,0.00019909981,0.00028619193,0.00018819791],"domain_scores_gemma":[0.99863714,0.0006258401,0.0002685123,0.00022063522,0.00019976065,0.000048127138],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002864839,0.00012937219,0.0002924003,0.00016119267,0.00017765674,0.00002992766,0.00039680934,0.000044786255,0.0000010656331],"category_scores_gemma":[0.00005100951,0.000120061086,0.00013968656,0.00037343364,0.00009263838,0.00017806904,0.000090211295,0.000061022576,0.0000058558617],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000030308054,0.0032565296,0.009673555,0.021105116,0.0015314667,0.000046668658,0.08779833,0.14747487,0.0038260843,0.31575617,0.009674973,0.39982593],"study_design_scores_gemma":[0.0004957641,0.00018749146,0.0038660008,0.00038375155,0.000041990344,0.000035521916,0.00009828119,0.9412798,0.0043889573,0.048927937,0.00004186077,0.0002525871],"about_ca_topic_score_codex":0.0000035238877,"about_ca_topic_score_gemma":3.2250466e-7,"teacher_disagreement_score":0.793805,"about_ca_system_score_codex":0.000009480763,"about_ca_system_score_gemma":0.000034151082,"threshold_uncertainty_score":0.4895949},"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,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_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","score_opus":0.03759851546770775,"score_gpt":0.31472248468518155,"score_spread":0.2771239692174738,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2048908137","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.83228236,0.00015262915,0.13828628,0.00039768545,0.00012890054,0.00043537005,0.0000038588764,0.00013291472,0.028180027],"genre_scores_gemma":[0.9574753,0.000018990997,0.04186507,0.00030303566,0.00004299412,0.0000032924884,0.0000066560356,0.000017032953,0.00026761592],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987878,0.000055875797,0.00045903306,0.00014969565,0.00038179863,0.0001657487],"domain_scores_gemma":[0.99860173,0.00069895404,0.00028682163,0.0002564442,0.00010571075,0.000050359296],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000483673,0.00016127342,0.00031837125,0.000110404224,0.000049721002,0.000014688453,0.00015137259,0.00004862511,0.00010009601],"category_scores_gemma":[0.00034011755,0.00014258391,0.000100818696,0.00020575749,0.000037558813,0.000082309,0.000017819371,0.00010754285,0.00014401703],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000061316445,0.002255126,0.000031300515,0.0018555644,0.00008709275,0.0000071844515,0.0018904501,0.0018357633,0.0015517831,0.9763394,0.0059308005,0.008154232],"study_design_scores_gemma":[0.00049244723,0.00023012205,0.00015135434,0.0007817965,0.00006327148,0.000012441997,0.0001087467,0.005767677,0.008194916,0.9840073,0.000022604017,0.00016734129],"about_ca_topic_score_codex":6.035738e-7,"about_ca_topic_score_gemma":1.07762645e-7,"teacher_disagreement_score":0.12519298,"about_ca_system_score_codex":0.000029053548,"about_ca_system_score_gemma":0.000018128896,"threshold_uncertainty_score":0.5814403},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.04815084716178829,"score_gpt":0.3240518667922016,"score_spread":0.2759010196304133,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2049582538","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.92541206,0.000068119356,0.032977577,0.00021461146,0.00016551367,0.00063546683,0.000013377953,0.00011602703,0.040397238],"genre_scores_gemma":[0.839991,0.000023472143,0.15713277,0.00007281003,0.00007968145,0.00004003029,0.000011533935,0.000051413914,0.0025973353],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9979009,0.00008410131,0.0011622456,0.00022146382,0.00035192794,0.00027938545],"domain_scores_gemma":[0.99788105,0.001314745,0.00029612225,0.00034885193,0.00008047759,0.00007873906],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00079859165,0.00022523971,0.00062656315,0.00022308802,0.000057426674,0.000036286187,0.00020295777,0.00012821362,0.0022380783],"category_scores_gemma":[0.0002668032,0.00020520242,0.00014259283,0.00035403698,0.00007124846,0.00013379016,0.00003297077,0.00013281124,0.00024046215],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003088477,0.008276724,0.00069131266,0.0070380433,0.00040234183,0.000036421985,0.02411525,0.006302615,0.008564003,0.774245,0.049062587,0.1209568],"study_design_scores_gemma":[0.0011120252,0.00012841889,0.00028410178,0.00040399702,0.00006947508,0.000023808689,0.0003192994,0.03357631,0.0020342614,0.9602764,0.0013984337,0.00037346326],"about_ca_topic_score_codex":0.000022613794,"about_ca_topic_score_gemma":0.00001397903,"teacher_disagreement_score":0.18603136,"about_ca_system_score_codex":0.0000503197,"about_ca_system_score_gemma":0.000040604406,"threshold_uncertainty_score":0.99867404},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Tensor product; Mathematics; Simplex; Tensor (intrinsic definition); Quadrature (astronomy); Pure mathematics; Geometry","score_opus":0.020628212641156888,"score_gpt":0.2670022820283079,"score_spread":0.246374069387151,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2050724454","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03453549,0.00010095903,0.96045977,0.002942457,0.0002040467,0.0007136326,0.000010781047,0.00010915407,0.0009236931],"genre_scores_gemma":[0.48384112,0.000016464273,0.5146637,0.00027017368,0.0001550262,0.000051929153,0.0000062639,0.000023140212,0.00097220787],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998849,0.000057948895,0.00037814782,0.00024099591,0.00028082627,0.00019313346],"domain_scores_gemma":[0.9985047,0.0005685406,0.00025291104,0.0004572827,0.00017646715,0.00004009657],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007667263,0.00013905088,0.00021890856,0.000056786357,0.00015468309,0.00010805541,0.0006201664,0.00003268246,0.000047591293],"category_scores_gemma":[0.00013238714,0.00009849901,0.000098699435,0.00023452891,0.000054559536,0.0002632644,0.00006191352,0.00006963213,0.00008503778],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009174332,0.0010164492,0.000076510274,0.0014810927,0.00023212424,0.000008262577,0.009285466,0.023808604,0.00048038896,0.365423,0.009069896,0.58902645],"study_design_scores_gemma":[0.00044449518,0.000076667675,0.00045178467,0.000102512065,0.00002580368,0.000022340437,0.0000929567,0.6344751,0.0030169464,0.3598916,0.0012300481,0.00016971295],"about_ca_topic_score_codex":0.00000202749,"about_ca_topic_score_gemma":6.121141e-7,"teacher_disagreement_score":0.6106665,"about_ca_system_score_codex":0.000014994079,"about_ca_system_score_gemma":0.000024586712,"threshold_uncertainty_score":0.4016673},"labels":[],"label_agreement":null},{"id":"W2050813462","doi":"10.1090/s0025-5718-01-01312-6","title":"Jacobi sums and new families of irreducible polynomials of Gaussian periods","year":2001,"lang":"lv","type":"article","venue":"Mathematics of Computation","topic":"Advanced Algebra and Geometry","field":"Mathematics","cited_by":10,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Algorithm; Annotation; Computer science; Artificial intelligence","score_opus":0.04299581041631966,"score_gpt":0.31785225223258096,"score_spread":0.2748564418162613,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2050813462","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.84427047,0.0011547945,0.15150838,0.00012434642,0.0001539762,0.00043050677,0.00003500906,0.000024491574,0.0022980394],"genre_scores_gemma":[0.8720692,0.00037982652,0.12685263,0.00000875427,0.00006704889,0.0000027702545,0.000012283263,0.000044349636,0.00056313485],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99736315,0.00006175127,0.0015623254,0.00026879433,0.00047098738,0.00027299073],"domain_scores_gemma":[0.99671936,0.0008776179,0.0015876448,0.00042211998,0.00026656024,0.00012669372],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00046930194,0.00031884704,0.0011426205,0.0004269421,0.000058445738,0.000026605045,0.00021207349,0.00018620727,0.000097547476],"category_scores_gemma":[0.00047452425,0.00031142967,0.00017680283,0.00058489275,0.00029061938,0.00021225713,0.00012217619,0.00012955193,0.000008204554],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005866697,0.006984412,0.0071235425,0.05209576,0.0018856978,0.00002290556,0.14452708,0.013199729,0.08534707,0.494639,0.0034450954,0.19014303],"study_design_scores_gemma":[0.0026609781,0.0008692112,0.0035796845,0.0029201345,0.00062825467,0.00006701444,0.014783881,0.027870663,0.054065276,0.89174277,0.00014297428,0.0006691425],"about_ca_topic_score_codex":0.000044780674,"about_ca_topic_score_gemma":0.000012429441,"teacher_disagreement_score":0.3971038,"about_ca_system_score_codex":0.000028005335,"about_ca_system_score_gemma":0.000150276,"threshold_uncertainty_score":0.9999338},"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,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_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","score_opus":0.008492376036877417,"score_gpt":0.23112979784971635,"score_spread":0.22263742181283894,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2052917298","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.50043595,0.000032546093,0.4988671,0.00014166231,0.000074466654,0.00019409112,7.3207246e-7,0.000040239633,0.00021323506],"genre_scores_gemma":[0.8218463,0.000007705693,0.17806937,0.000015266405,0.000019909225,0.0000041229036,0.0000059621957,0.000010640265,0.000020717831],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99843,0.00008510302,0.0006062474,0.0002790132,0.00031721187,0.00028242587],"domain_scores_gemma":[0.99917424,0.00024272586,0.0002171733,0.00025495427,0.000065887056,0.000045028504],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00047089637,0.00015657382,0.0003257221,0.00048251043,0.000048283327,0.000073921175,0.0004261533,0.00007769776,0.0000058748924],"category_scores_gemma":[0.00003712939,0.00015284636,0.00007272125,0.0009780764,0.000059710637,0.0002458827,0.00013246216,0.00015127023,0.000028969807],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008552998,0.003901027,0.013223568,0.0012370049,0.00013863364,0.0005017782,0.03308444,0.73643786,0.01193425,0.10267767,0.0001822257,0.096596],"study_design_scores_gemma":[0.0008016802,0.00009282313,0.012794669,0.00020078085,0.000008036871,0.00003634198,0.00008741951,0.9496947,0.00035226846,0.035734326,0.000010277195,0.0001866658],"about_ca_topic_score_codex":0.000107579035,"about_ca_topic_score_gemma":0.000049705242,"teacher_disagreement_score":0.32141036,"about_ca_system_score_codex":0.000036764708,"about_ca_system_score_gemma":0.00003842995,"threshold_uncertainty_score":0.62328935},"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,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_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","score_opus":0.07774741676647924,"score_gpt":0.3979644036053545,"score_spread":0.3202169868388753,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2053957691","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4858266,0.000025937727,0.51154494,0.000064355656,0.000017004142,0.00045072063,0.0000038439653,0.00003294403,0.0020336185],"genre_scores_gemma":[0.72618616,0.0000026749535,0.2733258,0.0000099622885,0.000033246997,0.000009939351,0.000005378767,0.00002857037,0.0003982471],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985798,0.000036182995,0.00051290327,0.00017498246,0.00041885185,0.00027729632],"domain_scores_gemma":[0.9959144,0.0032766664,0.0001740249,0.00019804525,0.00035368212,0.00008315415],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002595016,0.00012942325,0.0003214682,0.00017941139,0.00007465406,0.000031619966,0.00014549858,0.000075881166,0.000018787392],"category_scores_gemma":[0.0005006248,0.00011728252,0.0000710967,0.0002066483,0.000103658924,0.000086007305,0.0000813809,0.000097243545,0.000007346067],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001656328,0.000663504,0.0014263062,0.0039371788,0.00020807462,0.000004979152,0.008448012,0.000102207516,0.0055560567,0.9590269,0.0010640492,0.01939714],"study_design_scores_gemma":[0.00081064884,0.00017753597,0.00049716706,0.00013429986,0.000057975918,0.000020291202,0.0015782507,0.03990281,0.024113936,0.9324747,0.00005971355,0.00017268758],"about_ca_topic_score_codex":0.0000040488862,"about_ca_topic_score_gemma":0.0000026761995,"teacher_disagreement_score":0.24035956,"about_ca_system_score_codex":0.0000361859,"about_ca_system_score_gemma":0.000044044227,"threshold_uncertainty_score":0.47826424},"labels":[],"label_agreement":null},{"id":"W2055581003","doi":"10.1090/s0025-5718-07-01980-1","title":"Efficient CM-constructions of elliptic curves over finite fields","year":2007,"lang":"en","type":"article","venue":"Mathematics of Computation","topic":"Cryptography and Residue Arithmetic","field":"Computer Science","cited_by":16,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Mathematics; Finite field; Elliptic curve; Order (exchange); Factorization; Omega; Combinatorics; Prime (order theory); Integer (computer science); Schoof's algorithm; Polynomial; Prime factor; Discrete mathematics; Quarter period; Mathematical analysis; Algorithm; Physics","score_opus":0.01107338181952988,"score_gpt":0.2570914250786089,"score_spread":0.246018043259079,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2055581003","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.22633849,0.00016300012,0.772361,0.000059121023,0.00012634747,0.000101182304,0.000001194881,0.000028216426,0.00082146056],"genre_scores_gemma":[0.7806173,0.000011496941,0.21933053,0.000020168483,0.000008891518,0.0000010235492,0.0000010861266,0.0000030981737,0.0000063929638],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990826,0.000017097263,0.00040818012,0.00011140917,0.00026564716,0.00011503169],"domain_scores_gemma":[0.99885076,0.00052521605,0.0002426781,0.00021646052,0.00013187001,0.000032996613],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00037771068,0.00007502056,0.00016233412,0.00020753336,0.000041336454,0.000012981157,0.00021646464,0.00004211196,0.00000766739],"category_scores_gemma":[0.000059557187,0.000068037014,0.000089247784,0.00048556243,0.000080394835,0.000049120492,0.00005514247,0.00006196245,0.0000033240417],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000104856135,0.0011694602,0.0007477427,0.0026916827,0.00013308584,0.000007459791,0.008103526,0.38185152,0.002176092,0.57449603,0.00032579445,0.028287081],"study_design_scores_gemma":[0.0002762543,0.000089247995,0.0046723206,0.00039917766,0.000027816399,0.000013172044,0.00012055861,0.9279404,0.006345742,0.05997894,0.0000126568775,0.00012365905],"about_ca_topic_score_codex":0.000006226239,"about_ca_topic_score_gemma":0.0000024043236,"teacher_disagreement_score":0.5542788,"about_ca_system_score_codex":0.000006194626,"about_ca_system_score_gemma":0.00002162458,"threshold_uncertainty_score":0.2774469},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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)","score_opus":0.025713900069497902,"score_gpt":0.31934530518400944,"score_spread":0.2936314051145115,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2056631054","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.62888104,0.0000124043945,0.36993644,0.000017809212,0.00016247235,0.00030927834,0.000008507969,0.000055236076,0.0006168029],"genre_scores_gemma":[0.87334794,6.476813e-7,0.12649855,0.000011143868,0.000034736197,0.0000048825377,0.000012776329,0.000031555603,0.00005774977],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99826837,0.000031268384,0.00085693307,0.0001678933,0.0004629184,0.0002126496],"domain_scores_gemma":[0.9977084,0.00077873335,0.00073898345,0.00028741662,0.00041236402,0.00007409276],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00069707335,0.00017413194,0.0005502882,0.00021657044,0.00006182462,0.000021586486,0.00020885067,0.00011619006,0.000008974652],"category_scores_gemma":[0.0011576548,0.00015646452,0.0001059693,0.00039949224,0.000045662782,0.0001056202,0.0000819868,0.0001499854,0.000010665393],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000025049936,0.0016904738,0.0013153701,0.0039328085,0.00036821468,0.0000039071333,0.011093508,0.06421736,0.06052703,0.85087097,0.00058342936,0.0053718886],"study_design_scores_gemma":[0.0005239236,0.00015613464,0.0009906864,0.00045363358,0.00007307032,0.000009373393,0.0007491872,0.2693122,0.016254395,0.7111841,0.000015775091,0.0002775098],"about_ca_topic_score_codex":0.0000067791802,"about_ca_topic_score_gemma":0.000007976516,"teacher_disagreement_score":0.24446692,"about_ca_system_score_codex":0.000029546263,"about_ca_system_score_gemma":0.000026532334,"threshold_uncertainty_score":0.63804376},"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,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_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","score_opus":0.010505775923304188,"score_gpt":0.25351200384559547,"score_spread":0.2430062279222913,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2058195144","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04180668,0.00004130233,0.95080024,0.0000038473654,0.000025852487,0.000063972475,9.3113294e-7,0.00020810743,0.007049082],"genre_scores_gemma":[0.68701893,0.000004749249,0.31291232,0.0000037246164,0.0000028602187,0.0000043581963,0.000002044599,0.000011930106,0.000039062492],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99952036,0.000011806857,0.00023776761,0.000057970243,0.00008924898,0.0000828542],"domain_scores_gemma":[0.9997191,0.00006312157,0.000059932132,0.000094566036,0.000043427128,0.000019890793],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00009062622,0.00007376836,0.00015987785,0.00006408528,0.000012572094,0.0000070956717,0.000050051884,0.00002640287,0.000012617183],"category_scores_gemma":[0.000049895498,0.00006865123,0.000039086626,0.00014802086,0.000013123468,0.00006661306,0.000008021013,0.000047787962,0.0000137397265],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008007567,0.0004710686,0.00013870138,0.0015172896,0.0002665792,0.000008635346,0.00308647,0.6681711,0.10343183,0.19169205,0.0009628478,0.030245386],"study_design_scores_gemma":[0.00010947596,0.000022891876,0.000046369092,0.000060037215,0.000017391094,0.0000036706642,0.000056587374,0.8430306,0.06460222,0.09143088,0.000504217,0.00011568899],"about_ca_topic_score_codex":0.0000020808063,"about_ca_topic_score_gemma":4.2336936e-7,"teacher_disagreement_score":0.6452123,"about_ca_system_score_codex":0.000025313564,"about_ca_system_score_gemma":0.0000027394813,"threshold_uncertainty_score":0.27995157},"labels":[],"label_agreement":null},{"id":"W2058800703","doi":"10.1090/s0025-5718-07-01961-8","title":"On univoque Pisot numbers","year":2007,"lang":"en","type":"article","venue":"Mathematics of Computation","topic":"Mathematical Dynamics and Fractals","field":"Mathematics","cited_by":20,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada; Ministère de l'Education Nationale, de l'Enseignement Supérieur et de la Recherche","keywords":"Mathematics; Limit (mathematics); Combinatorics; Mathematical analysis","score_opus":0.03153293648990579,"score_gpt":0.3398865702888251,"score_spread":0.3083536337989193,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2058800703","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.32850602,0.0000038021233,0.62014514,0.000053723685,0.00007158913,0.00023954661,0.00000420518,0.00007058225,0.05090537],"genre_scores_gemma":[0.7932261,0.0000012779255,0.20635805,0.0000417379,0.000025528338,0.000003250837,0.0000060534653,0.00003404652,0.0003039423],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9983355,0.000025662303,0.0007588338,0.00016618954,0.00047087696,0.00024293424],"domain_scores_gemma":[0.9964001,0.0026340955,0.0004308828,0.00028832952,0.00015760139,0.00008897105],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011499443,0.00018313213,0.00038104295,0.00017166862,0.000053798612,0.000022233215,0.00017551667,0.000105127714,0.00009012768],"category_scores_gemma":[0.00073190086,0.00016101223,0.00012141742,0.00023360823,0.000068340974,0.00006747408,0.000037695227,0.00013331804,0.00005665929],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000015470094,0.00054546166,0.000011073465,0.000479468,0.000032700882,0.000004494786,0.0008642215,0.00017205351,0.0004320566,0.99490327,0.00062008493,0.0019196551],"study_design_scores_gemma":[0.00032644792,0.00010448947,0.00006503678,0.00018499246,0.000028301645,0.000008520422,0.00022239261,0.038503695,0.0015321189,0.9588255,0.0000377462,0.00016074465],"about_ca_topic_score_codex":0.0000041743874,"about_ca_topic_score_gemma":0.000008460575,"teacher_disagreement_score":0.4647201,"about_ca_system_score_codex":0.00004730906,"about_ca_system_score_gemma":0.000019784171,"threshold_uncertainty_score":0.6565888},"labels":[],"label_agreement":null},{"id":"W2059246298","doi":"10.1090/s0025-5718-2014-02845-7","title":"Computing the moment polynomials of the zeta function","year":2014,"lang":"lv","type":"article","venue":"Mathematics of Computation","topic":"Analytic Number Theory Research","field":"Mathematics","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada; National Science Foundation","keywords":"Algorithm; Artificial intelligence; Computer science; Mathematics","score_opus":0.04013340533169223,"score_gpt":0.31729469720471465,"score_spread":0.2771612918730224,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2059246298","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.36266547,0.00008850594,0.6298758,0.00084571785,0.00042495783,0.0009854644,0.000011622568,0.000027777543,0.0050746715],"genre_scores_gemma":[0.9891781,0.0000058017804,0.009722139,0.000050880895,0.00017069979,0.0000057922393,0.0000045375086,0.00005216507,0.0008098849],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9958339,0.0007849501,0.0015458699,0.00025576743,0.0012278153,0.00035170518],"domain_scores_gemma":[0.9923837,0.004174406,0.0018952885,0.0009488965,0.0005343636,0.00006333629],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00477276,0.0002919764,0.0007220233,0.00012813981,0.00028042702,0.00007065073,0.00079944235,0.00014285246,0.00008638884],"category_scores_gemma":[0.0010487991,0.00017899756,0.00035547654,0.00053291034,0.00047143435,0.00008137619,0.00044364017,0.00032872477,0.000058249945],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009920077,0.0013861449,0.0005018301,0.005759461,0.00088931166,4.041665e-7,0.018534215,0.021183858,0.003953956,0.9242642,0.0036567573,0.019770695],"study_design_scores_gemma":[0.00064055424,0.00017385757,0.0007585111,0.000772625,0.00046125395,0.000007696373,0.0018965979,0.5257041,0.0039954144,0.46523595,0.00017738176,0.00017609405],"about_ca_topic_score_codex":0.000032420325,"about_ca_topic_score_gemma":0.0000073831025,"teacher_disagreement_score":0.6265126,"about_ca_system_score_codex":0.00009157198,"about_ca_system_score_gemma":0.00011994681,"threshold_uncertainty_score":0.7299309},"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,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_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","score_opus":0.011749969132100052,"score_gpt":0.2629183333873865,"score_spread":0.25116836425528644,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2061405134","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.14775601,0.00017496054,0.8505381,0.00015287692,0.000090208545,0.00044166032,6.708756e-7,0.00008118066,0.00076435297],"genre_scores_gemma":[0.880784,0.000007817996,0.11913741,0.00001794351,0.000021331369,0.000018782786,0.0000011357953,0.000007267955,0.000004369998],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989183,0.000025958561,0.00038241732,0.00019175875,0.0003012854,0.00018030187],"domain_scores_gemma":[0.9988272,0.00043450607,0.00018485602,0.0002711896,0.00019774809,0.00008445281],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000879121,0.00010873751,0.0001405646,0.00014177508,0.00018952505,0.00009856753,0.00031964862,0.000043191925,3.6645005e-7],"category_scores_gemma":[0.000014374993,0.00008093512,0.000058519003,0.00073509617,0.00004032045,0.0001224918,0.00008479853,0.00006147693,0.000025686712],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000013730996,0.00007785434,0.0001873287,0.00024427322,0.000021105336,0.0000013324321,0.0016277451,0.0015813147,0.0008635341,0.980492,0.000032219647,0.0148575455],"study_design_scores_gemma":[0.0012518297,0.00018684052,0.006727315,0.00029435285,0.00005760686,0.00007483737,0.0010171089,0.8697045,0.01657752,0.10327284,0.00038326794,0.0004519926],"about_ca_topic_score_codex":0.0000064354626,"about_ca_topic_score_gemma":0.000006376189,"teacher_disagreement_score":0.8772192,"about_ca_system_score_codex":0.000014302051,"about_ca_system_score_gemma":0.000013068454,"threshold_uncertainty_score":0.33004385},"labels":[],"label_agreement":null},{"id":"W2062719800","doi":"10.1090/s0025-5718-02-01419-9","title":"Rapid multiplication modulo the sum and difference of highly composite numbers","year":2002,"lang":"en","type":"article","venue":"Mathematics of Computation","topic":"Numerical Methods and Algorithms","field":"Computer Science","cited_by":16,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"Natural Sciences and Engineering Research Council of Canada; Mitacs","keywords":"Modulo; Mathematics; Rounding; Multiplication (music); Fast Fourier transform; Correctness; Arithmetic; Computation; Discrete mathematics; Algorithm; Combinatorics; Computer science","score_opus":0.03163010017467035,"score_gpt":0.26836416721988715,"score_spread":0.2367340670452168,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2062719800","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.082106024,0.00012509974,0.9165828,0.00064758095,0.000045677923,0.00013933977,0.0000014713154,0.000026158092,0.00032580903],"genre_scores_gemma":[0.5449038,0.000020007912,0.4550286,0.000022223854,0.0000061584724,0.0000032139917,5.067853e-7,0.0000028104698,0.000012640936],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99923116,0.000063585925,0.00029074049,0.00012909231,0.00020309635,0.0000823259],"domain_scores_gemma":[0.9988949,0.000486776,0.00026278157,0.00022980596,0.00009651294,0.000029243742],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00020948259,0.00007739832,0.00017181721,0.000040692106,0.000050965864,0.00003185892,0.00027428067,0.000024692481,0.000002129219],"category_scores_gemma":[0.000040606996,0.00005399454,0.000034404697,0.00020554403,0.00008783584,0.000095753174,0.00008383096,0.00005008737,0.0000025965662],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000028563481,0.00042861028,0.00019819311,0.00027843716,0.000037473394,4.982877e-7,0.0068867113,0.0020509076,0.019116487,0.0831296,0.00010000958,0.88777024],"study_design_scores_gemma":[0.00015069419,0.00004864552,0.002628272,0.00003304157,0.0000070025767,0.0000035033931,0.000031412525,0.93871427,0.00436378,0.053940434,0.000019675894,0.000059300866],"about_ca_topic_score_codex":0.000010751381,"about_ca_topic_score_gemma":2.4375385e-7,"teacher_disagreement_score":0.9366633,"about_ca_system_score_codex":0.0000062191707,"about_ca_system_score_gemma":0.0000030711487,"threshold_uncertainty_score":0.22018334},"labels":[],"label_agreement":null},{"id":"W2064619631","doi":"10.1090/s0025-5718-05-01758-8","title":"Point counting on Picard curves in large characteristic","year":2005,"lang":"en","type":"article","venue":"Mathematics of Computation","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":17,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo; University of Calgary","funders":"","keywords":"Mathematics; Cardinality (data modeling); Finite field; Jacobian matrix and determinant; Prime (order theory); Field (mathematics); Discrete mathematics; Point (geometry); Combinatorics; Pure mathematics; Applied mathematics; Geometry","score_opus":0.013230538641358442,"score_gpt":0.2572968505043444,"score_spread":0.24406631186298597,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2064619631","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3039079,0.00004114793,0.6939463,0.00047130912,0.000075773016,0.00011219726,0.000001500847,0.00005902339,0.0013848522],"genre_scores_gemma":[0.9511686,0.000008373464,0.048538174,0.00023472076,0.000029887138,0.000004863669,0.0000029700097,0.0000048870806,0.000007505586],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992101,0.000039769107,0.000299572,0.00012840885,0.00019575458,0.00012640396],"domain_scores_gemma":[0.9993489,0.00022924383,0.00016723083,0.00018231153,0.00005172634,0.000020585301],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00061064126,0.00007847184,0.00015808319,0.00015143547,0.000032508615,0.000032889166,0.00023905297,0.00002286863,0.000007456861],"category_scores_gemma":[0.00007032608,0.00007639107,0.000047800757,0.00025754297,0.000014574904,0.00019941221,0.00005592264,0.000070386945,0.00002452172],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009765347,0.00079685997,0.00050643727,0.00062331,0.000017656068,0.0000037935442,0.004493061,0.00224793,0.00069722976,0.9634005,0.00035753605,0.026845962],"study_design_scores_gemma":[0.0006981265,0.00018165806,0.011746033,0.0015263684,0.00001218024,0.0000092909695,0.00011141017,0.788897,0.0018521659,0.1943409,0.00033692713,0.00028796494],"about_ca_topic_score_codex":6.1651514e-7,"about_ca_topic_score_gemma":0.0000017069442,"teacher_disagreement_score":0.78664905,"about_ca_system_score_codex":0.00001609673,"about_ca_system_score_gemma":0.00001106841,"threshold_uncertainty_score":0.31151375},"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,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_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","score_opus":0.11413096532549975,"score_gpt":0.35135121574840006,"score_spread":0.2372202504229003,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2064908122","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6813715,0.00011985206,0.27793327,0.00003961937,0.00021207971,0.00091278646,0.000026754666,0.00010239638,0.039281745],"genre_scores_gemma":[0.8359857,0.000010191692,0.16295995,0.000016760703,0.00009432755,0.000012829948,0.00000931565,0.00009973698,0.000811173],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99618185,0.00028357902,0.0017637085,0.00037794828,0.000848074,0.00054484926],"domain_scores_gemma":[0.995796,0.0015825942,0.0013160474,0.0006556087,0.00046803904,0.00018165761],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0021235615,0.00040029857,0.00098228,0.00035132686,0.00014099825,0.000057881512,0.0005268753,0.00025070072,0.0007900221],"category_scores_gemma":[0.001044612,0.00040242367,0.00031992083,0.0004386381,0.00030296468,0.00020066508,0.00026814983,0.0003143655,0.0005035663],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002695024,0.005072438,0.0017058175,0.013209176,0.0018078579,0.00007296093,0.12098956,0.00087079994,0.008294287,0.83137095,0.0021547389,0.014181889],"study_design_scores_gemma":[0.0009763111,0.00020827657,0.00043345193,0.0009733764,0.00041901803,0.000041030962,0.0041739778,0.22793898,0.011374616,0.7529684,0.000012715731,0.00047989626],"about_ca_topic_score_codex":0.00011056145,"about_ca_topic_score_gemma":0.000008937779,"teacher_disagreement_score":0.22706819,"about_ca_system_score_codex":0.00013417714,"about_ca_system_score_gemma":0.00017896456,"threshold_uncertainty_score":0.99984276},"labels":[],"label_agreement":null},{"id":"W2066290790","doi":"10.1090/s0025-5718-04-01637-0","title":"Obstacles to the torsion-subgroup attack on the decision Diffie-Hellman Problem","year":2004,"lang":"en","type":"article","venue":"Mathematics of Computation","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Algorithm; Annotation; Mathematics; Type (biology); Computer science; Database; Artificial intelligence","score_opus":0.03172563743395274,"score_gpt":0.2802293361987362,"score_spread":0.24850369876478345,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2066290790","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.25830096,0.000026424026,0.73880756,0.001964577,0.00011149227,0.000362155,0.000004673079,0.000048914488,0.00037323113],"genre_scores_gemma":[0.73107415,0.000006129482,0.26857683,0.00028917997,0.000027970274,0.00001336447,0.0000040286122,0.000006386062,0.0000019222366],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987624,0.000043404525,0.00033149763,0.00021129838,0.00049697654,0.00015438115],"domain_scores_gemma":[0.99838513,0.0006849308,0.00016620073,0.0006115469,0.00010226111,0.000049903458],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005314372,0.000126656,0.00014011591,0.000089402965,0.00021875788,0.00014822774,0.0009117359,0.000037532816,0.000004729126],"category_scores_gemma":[0.000095525,0.000069755704,0.00008608325,0.0005278441,0.00004392878,0.00018102895,0.00023426591,0.00010477872,0.000077781275],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009331057,0.00033736063,0.000013383882,0.000044993114,0.000014281603,0.0000011789225,0.008311075,0.029099425,0.00018499268,0.940645,0.002594416,0.018744566],"study_design_scores_gemma":[0.00038615346,0.00027927238,0.0014404525,0.00030661043,0.000012045182,0.000006870359,0.00037665982,0.06177528,0.0026398976,0.9307784,0.0017998284,0.00019854773],"about_ca_topic_score_codex":0.000008962942,"about_ca_topic_score_gemma":0.000020387904,"teacher_disagreement_score":0.47277322,"about_ca_system_score_codex":0.000024855548,"about_ca_system_score_gemma":0.000023498002,"threshold_uncertainty_score":0.2844555},"labels":[],"label_agreement":null},{"id":"W2068348472","doi":"10.1090/s0025-5718-02-01527-2","title":"Corrigenda and addition to “Computer verification of the Ankeny-Artin-Chowla conjecture for all primes less than 100000000000”","year":2002,"lang":"en","type":"article","venue":"Mathematics of Computation","topic":"Algebraic Geometry and Number Theory","field":"Mathematics","cited_by":11,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Mathematics; Conjecture; Discrete mathematics; Arithmetic","score_opus":0.048606824211862354,"score_gpt":0.28392628601407083,"score_spread":0.23531946180220847,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2068348472","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7406805,0.00005401648,0.25700268,0.0003974916,0.00020263622,0.0010817591,0.00007183325,0.00005082633,0.00045826947],"genre_scores_gemma":[0.9224039,0.000006274788,0.07707727,0.00008450563,0.000082002756,0.000046968504,0.000022653852,0.00003518299,0.00024126975],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9983983,0.000099962956,0.0006944138,0.0002572468,0.0003424078,0.00020764579],"domain_scores_gemma":[0.99760497,0.001058414,0.00063309754,0.0003900705,0.0002427944,0.000070676404],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00053651305,0.00022104631,0.0004222176,0.00013812554,0.00011295554,0.000031352523,0.00025611368,0.0001264132,0.00007412781],"category_scores_gemma":[0.00026678928,0.00017468681,0.00014090148,0.00027690214,0.000117130796,0.00012372536,0.00007853973,0.00010352515,0.00000855447],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00033599872,0.0035404684,0.0009036672,0.009309608,0.0009310786,0.0000023968632,0.07570593,0.004836995,0.017658452,0.7117188,0.03391977,0.14113683],"study_design_scores_gemma":[0.0015123143,0.00052314036,0.0017737459,0.0006033251,0.00031421304,0.00003937588,0.0011298417,0.06216401,0.071738884,0.8589242,0.00076653383,0.00051039003],"about_ca_topic_score_codex":0.0000045857278,"about_ca_topic_score_gemma":0.0000032760388,"teacher_disagreement_score":0.18172337,"about_ca_system_score_codex":0.000030295885,"about_ca_system_score_gemma":0.000017944109,"threshold_uncertainty_score":0.7123521},"labels":[],"label_agreement":null},{"id":"W2071073006","doi":"10.1090/s0025-5718-09-02211-x","title":"Lower bounds for Z-numbers","year":2009,"lang":"en","type":"article","venue":"Mathematics of Computation","topic":"Analytic Number Theory Research","field":"Mathematics","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Simon Fraser University","keywords":"Mathematics; Iterated function; Combinatorics; Integer (computer science); Rational number; Lambda; Real number; Upper and lower bounds; Discrete mathematics; Mathematical analysis","score_opus":0.062414065073896186,"score_gpt":0.3869113960928604,"score_spread":0.3244973310189642,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2071073006","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.17872293,0.000012288532,0.80616057,0.00031948832,0.00007076313,0.00053296785,0.0000063939992,0.0000790542,0.014095553],"genre_scores_gemma":[0.74316186,0.0000010564534,0.2558333,0.000035089466,0.000043479966,0.000009601058,0.0000068986346,0.000019989715,0.000888695],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987692,0.000029753546,0.00047046543,0.00014583334,0.0003699227,0.0002147888],"domain_scores_gemma":[0.99814445,0.0010297188,0.00024290128,0.00024134213,0.0002840138,0.000057572728],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00079295505,0.0001267134,0.00031056086,0.00010975533,0.00006421019,0.000032849926,0.00018770728,0.00006533911,0.00004605125],"category_scores_gemma":[0.00058855175,0.000117749456,0.00013909567,0.00017771505,0.00006171651,0.00009447677,0.000020505242,0.0000719606,0.000019861334],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006199493,0.00073528854,0.000016959499,0.0005257381,0.000074228454,0.0000018631919,0.0017946544,0.00022822135,0.0009835117,0.9816211,0.0077831415,0.0061733047],"study_design_scores_gemma":[0.0004786173,0.00019834722,0.00002882474,0.00007183873,0.000044767734,0.000005579952,0.00020346713,0.042401936,0.0011740623,0.9551383,0.00013995063,0.0001142926],"about_ca_topic_score_codex":0.0000012396382,"about_ca_topic_score_gemma":0.0000013527805,"teacher_disagreement_score":0.56443894,"about_ca_system_score_codex":0.000042625452,"about_ca_system_score_gemma":0.000042027936,"threshold_uncertainty_score":0.48016834},"labels":[],"label_agreement":null},{"id":"W2073421907","doi":"10.1090/s0025-5718-07-01969-2","title":"Constructing representations of higher degrees of finite simple groups and covers","year":2007,"lang":"en","type":"article","venue":"Mathematics of Computation","topic":"Finite Group Theory Research","field":"Mathematics","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"Natural Sciences and Engineering Research Council of Canada; Mitacs; Simon Fraser University","keywords":"Mathematics; Simple group; Simple (philosophy); Multiplicity (mathematics); Character (mathematics); Combinatorics; Classification of finite simple groups; Finite group; Character table; Sporadic group; Group (periodic table); Irreducible representation; Normal subgroup; Group of Lie type; Group theory; p-group; Pure mathematics; Symmetric group; Mathematical analysis; Geometry","score_opus":0.07271940689966737,"score_gpt":0.3789684754039326,"score_spread":0.3062490685042652,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2073421907","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7568181,0.000023422239,0.23832206,0.000013760972,0.000031688654,0.00023161911,0.000021724525,0.000019545752,0.004518054],"genre_scores_gemma":[0.8145177,0.0000024124117,0.185388,0.0000018987857,0.000011895785,0.0000019501342,0.000010922193,0.000016958207,0.0000482814],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99841815,0.000063287756,0.00082806253,0.00012794937,0.00040653904,0.00015598124],"domain_scores_gemma":[0.99264413,0.006059398,0.0006915509,0.00022029942,0.00034117012,0.000043461423],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011988305,0.00010896693,0.00037159858,0.00024620423,0.00003687096,0.000009807262,0.000121898964,0.000067003435,0.00005008934],"category_scores_gemma":[0.0011728397,0.00010759968,0.000064887776,0.0003059428,0.00028423686,0.00010786887,0.00008537824,0.00008845287,0.0000013541245],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007043069,0.0003212285,0.0059332503,0.0023192845,0.00013471197,0.0000028129957,0.006041594,0.0014431402,0.0074498174,0.97223675,0.00013833593,0.003908637],"study_design_scores_gemma":[0.0009191171,0.00016200783,0.0037587632,0.00023361362,0.000081345504,0.000010885724,0.006205723,0.03425774,0.022354314,0.93186164,0.0000055308487,0.00014932598],"about_ca_topic_score_codex":0.000018646188,"about_ca_topic_score_gemma":0.000014867896,"teacher_disagreement_score":0.05769957,"about_ca_system_score_codex":0.00002150475,"about_ca_system_score_gemma":0.000024092105,"threshold_uncertainty_score":0.43877876},"labels":[],"label_agreement":null},{"id":"W2073450674","doi":"10.1090/s0025-5718-09-02215-7","title":"Computation of 𝑝-units in ray class fields of real quadratic number fields","year":2009,"lang":"en","type":"article","venue":"Mathematics of Computation","topic":"Algebraic Geometry and Number Theory","field":"Mathematics","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université Laval","funders":"","keywords":"Algorithm; Annotation; Computer science; Artificial intelligence; Mathematics","score_opus":0.03462815877863464,"score_gpt":0.3159915339496871,"score_spread":0.2813633751710525,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2073450674","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.74251145,0.000013066571,0.25167695,0.000076905075,0.00005492297,0.00022308616,0.0000031504812,0.000021859541,0.0054186317],"genre_scores_gemma":[0.9545176,0.00000673716,0.045360368,0.000019515452,0.000017877726,0.0000029193006,0.000011886335,0.000012189779,0.000050890718],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9981742,0.00011777807,0.001069285,0.00013472298,0.0003561193,0.00014791169],"domain_scores_gemma":[0.99758387,0.0011222834,0.00075003214,0.00020617734,0.0003035595,0.000034061],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007009529,0.00015381811,0.00055468205,0.00019131349,0.000022669921,0.0000071361774,0.00015733109,0.00016895686,0.00003834707],"category_scores_gemma":[0.0004354845,0.00015156584,0.000083462124,0.00057035836,0.00006562781,0.00011715921,0.000026843125,0.00014300579,0.000004863151],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00016630728,0.002391104,0.0011881271,0.0045809858,0.00013682625,0.000007397634,0.03303316,0.029285152,0.0015474468,0.91408634,0.0008933554,0.012683789],"study_design_scores_gemma":[0.0007397237,0.00022205185,0.0019144473,0.00047106412,0.000049474187,0.0000058010473,0.0011249593,0.053609468,0.0066156657,0.9351011,0.0000011008352,0.00014515148],"about_ca_topic_score_codex":0.00001984899,"about_ca_topic_score_gemma":0.000011336639,"teacher_disagreement_score":0.21200618,"about_ca_system_score_codex":0.000021000209,"about_ca_system_score_gemma":0.0000506437,"threshold_uncertainty_score":0.61806756},"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,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_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","score_opus":0.05444991498185719,"score_gpt":0.3663539798274647,"score_spread":0.3119040648456075,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2073568805","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.18434836,0.00007477391,0.81036866,0.0008969613,0.00003758338,0.0010804677,0.00000959488,0.00007652438,0.003107069],"genre_scores_gemma":[0.5329895,0.00000947115,0.4662536,0.000010046362,0.00007676829,0.00009916521,0.0000049145774,0.00002528485,0.00053124316],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987634,0.000023828577,0.0006031678,0.00012664594,0.00028414655,0.00019885774],"domain_scores_gemma":[0.9960604,0.0029640319,0.00032253982,0.0002907051,0.00032428114,0.000038061517],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009524187,0.0001220929,0.00024076078,0.000049746803,0.0001537012,0.000065777225,0.00024431082,0.000046663743,0.000011173009],"category_scores_gemma":[0.00030895232,0.000087925255,0.000103630686,0.00013672764,0.00007068149,0.00006643361,0.000047503177,0.000067978326,0.000010981289],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000096380945,0.00037967745,0.000008477999,0.0006667593,0.00006415265,6.281789e-8,0.0061584925,0.0006505387,0.001990888,0.9418172,0.01000643,0.03824763],"study_design_scores_gemma":[0.0005599298,0.00006524565,0.00002329507,0.00014870554,0.00007124516,0.0000052681316,0.0009894627,0.31676373,0.019759279,0.6515054,0.009915795,0.0001926381],"about_ca_topic_score_codex":0.0000010513579,"about_ca_topic_score_gemma":0.000004752488,"teacher_disagreement_score":0.34864113,"about_ca_system_score_codex":0.000026790105,"about_ca_system_score_gemma":0.000025372341,"threshold_uncertainty_score":0.3585488},"labels":[],"label_agreement":null},{"id":"W2073799044","doi":"10.1090/s0025-5718-01-01343-6","title":"The parallelized Pollard kangaroo method in real quadratic function fields","year":2001,"lang":"en","type":"article","venue":"Mathematics of Computation","topic":"Algebraic Geometry and Number Theory","field":"Mathematics","cited_by":17,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Mathematics; Quadratic equation; Heuristics; Divisor (algebraic geometry); Computation; Function (biology); Class (philosophy); Function field; Field (mathematics); Genus; Hyperelliptic curve cryptography; Distribution (mathematics); Applied mathematics; Discrete mathematics; Algorithm; Pure mathematics; Mathematical optimization; Computer science; Mathematical analysis; Artificial intelligence; Geometry","score_opus":0.04128872705733261,"score_gpt":0.3444220898967428,"score_spread":0.30313336283941017,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2073799044","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.42514324,0.0000476097,0.56731164,0.00027282082,0.00012787827,0.00027642914,6.875353e-7,0.000051797735,0.0067678797],"genre_scores_gemma":[0.91959,0.000048540252,0.07970151,0.00003345979,0.000048706752,0.000022800215,0.000005159988,0.00002034482,0.0005294842],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99844193,0.00023364037,0.00066573,0.00014391734,0.00031177563,0.0002029963],"domain_scores_gemma":[0.9963696,0.0028770226,0.00034386545,0.0002722414,0.00010125209,0.00003600493],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016985127,0.00014507896,0.0003146706,0.0001163058,0.000114027825,0.00003316784,0.00017294704,0.00010904422,0.000037324662],"category_scores_gemma":[0.0005359385,0.00010841746,0.0000954826,0.0003820976,0.000046275094,0.000095046664,0.00004078262,0.00015255225,0.00001807836],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003196692,0.000657109,0.0007365122,0.0005687468,0.00016954471,0.000010843658,0.008226864,0.0031929498,0.0003849139,0.9559842,0.0013670488,0.028381636],"study_design_scores_gemma":[0.00059487857,0.00008797196,0.00084406947,0.00007014303,0.00004836364,0.000016296653,0.0011942587,0.033397436,0.00024613366,0.96328205,0.00010054731,0.0001178309],"about_ca_topic_score_codex":0.000030715117,"about_ca_topic_score_gemma":0.000080485945,"teacher_disagreement_score":0.49444672,"about_ca_system_score_codex":0.000037506965,"about_ca_system_score_gemma":0.000028838633,"threshold_uncertainty_score":0.44211358},"labels":[],"label_agreement":null},{"id":"W2075274710","doi":"10.1090/s0025-5718-2011-02537-8","title":"An improved upper bound for the argument of the Riemann zeta-function on the critical line","year":2011,"lang":"en","type":"article","venue":"Mathematics of Computation","topic":"Analytic Number Theory Research","field":"Mathematics","cited_by":22,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Lethbridge","funders":"","keywords":"Mathematics; Critical line; Riemann zeta function; Riemann hypothesis; Function (biology); Line (geometry); Upper and lower bounds; Argument (complex analysis); Mathematical physics; Combinatorics; Mathematical analysis; Pure mathematics; Geometry; Physics","score_opus":0.12036620261915401,"score_gpt":0.3760737910334879,"score_spread":0.25570758841433394,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2075274710","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.25491118,0.000020111587,0.74034107,0.0012055922,0.00019242885,0.0015255412,0.00001726527,0.00003066985,0.0017561263],"genre_scores_gemma":[0.9773632,0.0000014005441,0.022188544,0.000082914084,0.000060410577,0.00007429918,0.0000026137438,0.000030886018,0.00019569816],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99842167,0.00017273075,0.00056501455,0.00015441922,0.0004911369,0.00019503156],"domain_scores_gemma":[0.99387085,0.004655532,0.00032522524,0.00067169004,0.00043992503,0.000036756795],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020421294,0.0001480688,0.00025525648,0.00004686269,0.00022349782,0.000034379507,0.00047808114,0.000065305474,0.0001056036],"category_scores_gemma":[0.0015131729,0.00006924673,0.00018645488,0.00015718586,0.00033521568,0.000077177596,0.00007338352,0.00016283899,0.000008535484],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000122038626,0.00081804575,0.000021980451,0.0003946323,0.00015518055,1.0796548e-7,0.004734246,0.000110071174,0.0011275791,0.99131453,0.0004707806,0.0007307905],"study_design_scores_gemma":[0.00023800833,0.0003365863,0.00014451359,0.000075848926,0.00019524591,0.0000020362072,0.0013527521,0.18831381,0.00682243,0.80243254,0.000019771262,0.0000664343],"about_ca_topic_score_codex":0.000010124399,"about_ca_topic_score_gemma":0.0000069612242,"teacher_disagreement_score":0.72245204,"about_ca_system_score_codex":0.000031247084,"about_ca_system_score_gemma":0.00005016186,"threshold_uncertainty_score":0.28237996},"labels":[],"label_agreement":null},{"id":"W2076473088","doi":"10.1090/s0025-5718-2011-02490-7","title":"The infrastructure of a global field of arbitrary unit rank","year":2011,"lang":"en","type":"article","venue":"Mathematics of Computation","topic":"Polynomial and algebraic computation","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"Carl von Ossietzky Universität Oldenburg; Schweizerischer Nationalfonds zur Förderung der Wissenschaftlichen Forschung; University of Calgary; National Science Foundation","keywords":"Field (mathematics); Rank (graph theory); Class (philosophy); Unit (ring theory); Interpretation (philosophy); Function (biology)","score_opus":0.016393943351044136,"score_gpt":0.2519302619105993,"score_spread":0.23553631855955517,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2076473088","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3221918,0.00004143071,0.67555493,0.00006876081,0.000103770944,0.00009015196,0.0000020231341,0.000017144674,0.0019300135],"genre_scores_gemma":[0.84520155,0.0000028898519,0.15476055,0.000017558403,0.000008858812,0.0000012833214,8.44826e-7,0.0000022957563,0.000004172085],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99915314,0.000032849202,0.00043068355,0.0000862766,0.00021003152,0.00008704651],"domain_scores_gemma":[0.9989022,0.00029626547,0.00042473304,0.00020543968,0.0001479373,0.000023423216],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00018778392,0.000076055796,0.0001707955,0.00003358951,0.00003612874,0.000011374804,0.00044041942,0.00003862209,0.000004025334],"category_scores_gemma":[0.00006353822,0.000055605105,0.00006496452,0.0002917557,0.00006166119,0.00012701846,0.00010448781,0.000047395657,0.0000013257032],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003105283,0.00017467325,0.0007938829,0.00027584383,0.00006531244,9.98442e-7,0.0054843393,0.0018015944,0.0006526244,0.86911845,0.0002570591,0.12134414],"study_design_scores_gemma":[0.00025826012,0.00016470742,0.011438482,0.00006728162,0.0000124385115,0.0000061156416,0.000102549544,0.17566219,0.012838408,0.7993688,0.000011695189,0.00006907092],"about_ca_topic_score_codex":0.000024640927,"about_ca_topic_score_gemma":0.00000368418,"teacher_disagreement_score":0.5230098,"about_ca_system_score_codex":0.0000071672553,"about_ca_system_score_gemma":0.000065366155,"threshold_uncertainty_score":0.22675104},"labels":[],"label_agreement":null},{"id":"W2077171587","doi":"10.1090/s0025-5718-2014-02906-2","title":"Directional Chebyshev-type methods for solving equations","year":2014,"lang":"en","type":"article","venue":"Mathematics of Computation","topic":"Iterative Methods for Nonlinear Equations","field":"Mathematics","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec à Montréal","funders":"","keywords":"Mathematics; Chebyshev filter; Convergence (economics); Type (biology); Chebyshev equation; Chebyshev iteration; Applied mathematics; Chebyshev polynomials; Numerical analysis; Chebyshev nodes; Mathematical optimization; Mathematical analysis; Orthogonal polynomials; Classical orthogonal polynomials","score_opus":0.17368261433700047,"score_gpt":0.4941220397465256,"score_spread":0.3204394254095251,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2077171587","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.007293306,0.000018827495,0.98958254,0.00012801384,0.00031784378,0.0005487322,0.000008962365,0.00010920928,0.0019925893],"genre_scores_gemma":[0.057310652,7.322747e-7,0.9421282,0.000019893905,0.00012715744,0.00005051414,0.000047439706,0.00004100877,0.00027440724],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985426,0.0002147907,0.0006659093,0.00018601556,0.00022103124,0.00016966657],"domain_scores_gemma":[0.98730016,0.011203365,0.00046170008,0.00022376544,0.00076703576,0.00004397606],"candidate_categories":["metaresearch"],"consensus_categories":[],"category_scores_codex":[0.0027383743,0.0001580653,0.00037767185,0.00019357711,0.00017223673,0.00003909861,0.00013639896,0.00007663366,0.00003486375],"category_scores_gemma":[0.011036215,0.0001535571,0.0001493345,0.00030857665,0.00005904284,0.00013492646,0.000037415684,0.00008693481,0.000009524685],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000012870968,0.00036967333,0.0000166861,0.0005546169,0.00010114926,3.6671796e-8,0.002652296,0.0025018905,0.01866189,0.9238997,0.00028452408,0.050944675],"study_design_scores_gemma":[0.0002034323,0.00006667394,0.000016105383,0.00004016252,0.00005427145,0.0000012426335,0.000054951044,0.4495487,0.009209094,0.5404521,0.00026453362,0.00008872069],"about_ca_topic_score_codex":0.0000020101772,"about_ca_topic_score_gemma":0.00000288727,"teacher_disagreement_score":0.4470468,"about_ca_system_score_codex":0.00004557852,"about_ca_system_score_gemma":0.00005039733,"threshold_uncertainty_score":0.99729425},"labels":[],"label_agreement":null},{"id":"W2077367469","doi":"10.1090/s0025-5718-2012-02636-6","title":"Some comments on Garsia numbers","year":2012,"lang":"en","type":"article","venue":"Mathematics of Computation","topic":"Mathematical Dynamics and Fractals","field":"Mathematics","cited_by":9,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada; University of Waterloo","keywords":"Mathematics; Combinatorics; Real number; Integer (computer science); Degree (music); Interval (graph theory); Discrete mathematics; Limit point; Polynomial; Limit (mathematics); Mathematical analysis","score_opus":0.05769845916597549,"score_gpt":0.34885637454755314,"score_spread":0.29115791538157765,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2077367469","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8082721,0.00005285419,0.15823914,0.00028179085,0.00039009328,0.0006752303,0.00002056157,0.00014863863,0.0319196],"genre_scores_gemma":[0.8889744,0.0000049336477,0.11056921,0.00010238089,0.00009873054,0.0000133618005,0.000011904202,0.00003811065,0.00018696822],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99844205,0.000047895755,0.000621017,0.00011865716,0.000474369,0.00029602705],"domain_scores_gemma":[0.9979922,0.0011014827,0.00041810868,0.00028441165,0.000083189276,0.000120618635],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006333794,0.00019135492,0.00040188356,0.00011079899,0.0000590701,0.000022858248,0.00016543239,0.00008941576,0.000076003314],"category_scores_gemma":[0.0003516477,0.00016582057,0.00012215752,0.00012352839,0.000052865398,0.00019559267,0.000054690747,0.00012048868,0.00012566331],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000076011947,0.001345897,0.00010500116,0.00058887055,0.000056010347,5.262271e-7,0.001728085,0.000054951033,0.00024162873,0.9927005,0.002274888,0.0008960215],"study_design_scores_gemma":[0.0003744154,0.00007455766,0.00018823186,0.00019904312,0.000053666256,0.000006064523,0.00020901837,0.030260114,0.0009137837,0.96743345,0.0000980979,0.00018955817],"about_ca_topic_score_codex":0.0000019710988,"about_ca_topic_score_gemma":3.3756442e-7,"teacher_disagreement_score":0.080702305,"about_ca_system_score_codex":0.000045293353,"about_ca_system_score_gemma":0.000010426741,"threshold_uncertainty_score":0.6761967},"labels":[],"label_agreement":null},{"id":"W2078353038","doi":"10.1090/s0025-5718-01-01352-7","title":"Smooth ideals in hyperelliptic function fields","year":2001,"lang":"en","type":"article","venue":"Mathematics of Computation","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":12,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"University of Waterloo","keywords":"Mathematics; Mathematical proof; Hyperelliptic curve cryptography; Hyperelliptic curve; Logarithm; Genus; Finite field; Discrete logarithm; Function (biology); Pure mathematics; Discrete mathematics; Algebra over a field; Mathematical analysis; Computer science; Geometry","score_opus":0.019933701301037207,"score_gpt":0.2488137992355454,"score_spread":0.2288800979345082,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2078353038","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.31755382,0.000029180721,0.67957556,0.00009536367,0.00008593671,0.000064543485,1.0485733e-7,0.00004309931,0.002552418],"genre_scores_gemma":[0.95111686,0.000007781362,0.048779294,0.000052846965,0.0000136047875,0.0000041711723,0.0000010488534,0.0000039025986,0.000020482748],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993286,0.00003576048,0.00026317124,0.00011899193,0.00015108577,0.00010235043],"domain_scores_gemma":[0.99944454,0.00019259295,0.00011112546,0.0001821722,0.000047752652,0.000021827464],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00033376302,0.00006869952,0.00012763137,0.00018442413,0.000028108987,0.000033445613,0.00020834485,0.000040629686,0.000010400319],"category_scores_gemma":[0.000027904762,0.00006731242,0.00004623276,0.0004552739,0.00001769236,0.00017971295,0.000041282834,0.000059372796,0.000015304771],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000018097271,0.00033508334,0.0010140943,0.00012917696,0.000014759546,0.0000063989987,0.0028832338,0.016914096,0.0007168635,0.8648538,0.00013423148,0.112980165],"study_design_scores_gemma":[0.00020869446,0.00010086306,0.0025290947,0.000054971013,0.0000050495455,0.000005798175,0.00006502193,0.25442564,0.0001808771,0.74224305,0.00010129558,0.000079608326],"about_ca_topic_score_codex":0.0000048752286,"about_ca_topic_score_gemma":0.000005116881,"teacher_disagreement_score":0.63356304,"about_ca_system_score_codex":0.000009327526,"about_ca_system_score_gemma":0.00001146309,"threshold_uncertainty_score":0.2744921},"labels":[],"label_agreement":null},{"id":"W2082437953","doi":"10.1090/s0025-5718-03-01562-x","title":"Elliptic curves with nonsplit mod 11 representations","year":2003,"lang":"en","type":"article","venue":"Mathematics of Computation","topic":"Algebraic Geometry and Number Theory","field":"Mathematics","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University; Simon Fraser University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Elliptic curve; Mathematics; Modular curve; Modular elliptic curve; Function (biology); Mod; Pure mathematics; Combinatorics; Quarter period","score_opus":0.03461006752526618,"score_gpt":0.30522113885229435,"score_spread":0.27061107132702816,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2082437953","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4312114,0.00010458056,0.55109686,0.000087046545,0.00004917817,0.0003883988,0.0000045161546,0.000081845385,0.016976163],"genre_scores_gemma":[0.79359865,0.000021233293,0.2058207,0.000031531345,0.000011954659,0.00002158047,0.000009966043,0.000028003733,0.0004563766],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99872255,0.00010062472,0.00047273887,0.00017387321,0.0003638495,0.00016634296],"domain_scores_gemma":[0.9979969,0.0010620308,0.00035222308,0.00033025604,0.00020341596,0.000055167944],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005740717,0.00015481755,0.00030809632,0.00019012686,0.00007878538,0.000017616378,0.00012383127,0.00004970279,0.00013811792],"category_scores_gemma":[0.0005473677,0.00013108425,0.000069373935,0.00058092887,0.000092638176,0.00013823592,0.000018521796,0.000082649865,0.000030828778],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000011078352,0.000665469,0.0006230226,0.0022958103,0.000108938715,0.0000043832742,0.0018477429,0.0012351704,0.0002088793,0.99081635,0.0020330376,0.00015009061],"study_design_scores_gemma":[0.00050427986,0.00008023078,0.00021107969,0.0005390604,0.00014959232,0.000053291817,0.0009875332,0.0035986614,0.006116411,0.9875037,0.000056632063,0.00019950482],"about_ca_topic_score_codex":0.0000031219006,"about_ca_topic_score_gemma":0.0000027467238,"teacher_disagreement_score":0.36238727,"about_ca_system_score_codex":0.0000135779555,"about_ca_system_score_gemma":0.000036617723,"threshold_uncertainty_score":0.5345461},"labels":[],"label_agreement":null},{"id":"W2082648355","doi":"10.1090/s0025-5718-04-01633-3","title":"Visualising Sha[2] in Abelian surfaces","year":2004,"lang":"en","type":"article","venue":"Mathematics of Computation","topic":"Algebraic Geometry and Number Theory","field":"Mathematics","cited_by":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Abelian group; Elliptic curve; Iterated function; Rank (graph theory); Surface (topology); Product (mathematics); Element (criminal law); Order (exchange)","score_opus":0.03873811676712617,"score_gpt":0.3335217885708288,"score_spread":0.29478367180370263,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2082648355","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.88339037,0.00003634796,0.11407788,0.00009102333,0.00006375082,0.0001816919,0.0000019517859,0.00005528998,0.0021016812],"genre_scores_gemma":[0.88611066,0.0000028795425,0.11379762,0.000015250975,0.000015521893,0.0000035267879,0.000004198867,0.000018672772,0.000031650074],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988688,0.000039758597,0.0005332242,0.00013246787,0.0002625237,0.00016320014],"domain_scores_gemma":[0.9989791,0.00049659616,0.00026068834,0.00015549765,0.00007359081,0.000034546825],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006982617,0.00012638618,0.0002922246,0.0001971892,0.00003779279,0.000019793642,0.00013019073,0.00007005462,0.00002663206],"category_scores_gemma":[0.00028602398,0.00012225451,0.000056941608,0.00038097825,0.000054333108,0.00014006198,0.00003719553,0.00009220458,0.000024715062],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000022575443,0.0011702804,0.0003566602,0.0014675463,0.000053518463,0.000011435399,0.015977869,0.016048644,0.0029973139,0.95927674,0.000071510156,0.002545911],"study_design_scores_gemma":[0.00060837535,0.000044362205,0.00041365818,0.00032113804,0.000015294541,0.000008558124,0.00094959524,0.0036404296,0.010183691,0.98368436,0.0000040629757,0.00012647494],"about_ca_topic_score_codex":0.000015909189,"about_ca_topic_score_gemma":0.000009390677,"teacher_disagreement_score":0.024407623,"about_ca_system_score_codex":0.00004797494,"about_ca_system_score_gemma":0.000030450925,"threshold_uncertainty_score":0.49853945},"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,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_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","score_opus":0.0634521390617127,"score_gpt":0.27981533442917234,"score_spread":0.21636319536745963,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2083459883","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01573348,0.00006294186,0.9828398,0.000006324883,0.000034011566,0.00022067993,0.000011277316,0.00005515634,0.001036308],"genre_scores_gemma":[0.5416459,0.0000029354894,0.45831212,0.0000011615193,0.000005446529,0.00001941595,0.0000015443595,0.000009755559,0.0000017167922],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993163,0.000013046688,0.000395703,0.000066662615,0.00011621617,0.000092091876],"domain_scores_gemma":[0.9992351,0.0004054657,0.00008451449,0.00013465177,0.00009575069,0.000044536286],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00013933884,0.00007791689,0.00021372335,0.00012803642,0.000017370692,0.0000023672328,0.0000743865,0.000030559902,0.000010530324],"category_scores_gemma":[0.00014816447,0.00008367445,0.000031547926,0.00029142562,0.000043533997,0.000046573226,0.000028370756,0.0000428555,0.0000029552134],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000055046635,0.00040705976,0.0000785611,0.0023527131,0.00013253922,2.942972e-7,0.0071760947,0.6985359,0.041384634,0.1968091,0.000051184223,0.053066395],"study_design_scores_gemma":[0.00010083264,0.0000640351,0.0006245025,0.00009421733,0.000049367936,0.0000019838405,0.0001712019,0.9346989,0.023770312,0.040276576,0.000031140484,0.00011696855],"about_ca_topic_score_codex":0.0000044732137,"about_ca_topic_score_gemma":2.7788064e-7,"teacher_disagreement_score":0.5259124,"about_ca_system_score_codex":0.000012825863,"about_ca_system_score_gemma":0.0000072057833,"threshold_uncertainty_score":0.3412145},"labels":[],"label_agreement":null},{"id":"W2085388238","doi":"10.1090/s0025-5718-01-01385-0","title":"Explicit bounds and heuristics on class numbers in hyperelliptic function fields","year":2001,"lang":"en","type":"article","venue":"Mathematics of Computation","topic":"Analytic Number Theory Research","field":"Mathematics","cited_by":23,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"University of Waterloo; Macquarie University","keywords":"Heuristics; Mathematics; Class (philosophy); Divisor (algebraic geometry); Function (biology); Function field; Field (mathematics); Hyperelliptic curve; Discrete mathematics; Algebraic number field; Hyperelliptic curve cryptography; Applied mathematics; Finite field; Mathematical optimization; Pure mathematics; Computer science; Artificial intelligence","score_opus":0.05978436572141114,"score_gpt":0.3403400953209738,"score_spread":0.28055572959956265,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2085388238","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7952932,0.000018760255,0.19171862,0.00013005556,0.000058196518,0.00024415983,0.0000014972413,0.00003762321,0.012497841],"genre_scores_gemma":[0.987632,0.00002887222,0.011621921,0.000041550014,0.000035715464,0.000011039488,0.000004857755,0.000027928943,0.0005961137],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986342,0.0000737747,0.0005003984,0.00018769487,0.00039716647,0.00020672257],"domain_scores_gemma":[0.9980832,0.0013315305,0.00018727507,0.00022926841,0.00010831642,0.00006042293],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00063287525,0.0001499482,0.0003166108,0.00020858698,0.000051091858,0.00003614883,0.00011033048,0.00010726703,0.000052277683],"category_scores_gemma":[0.00042723448,0.00014433001,0.00004857322,0.0002803349,0.000067104855,0.00008040593,0.000045056797,0.00019407264,0.000030505267],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00023628016,0.0012260615,0.0029187875,0.0015321879,0.00011190285,0.00003074678,0.004831351,0.0028015762,0.00030234785,0.9773626,0.0016501199,0.0069960495],"study_design_scores_gemma":[0.00060101337,0.00020009534,0.00039275535,0.00020236432,0.000038986505,0.000020929598,0.0008376587,0.13559346,0.000106632135,0.8617902,0.000073966046,0.0001419453],"about_ca_topic_score_codex":0.000015060136,"about_ca_topic_score_gemma":0.000029051213,"teacher_disagreement_score":0.19233876,"about_ca_system_score_codex":0.000060109913,"about_ca_system_score_gemma":0.000025642,"threshold_uncertainty_score":0.5885607},"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,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Algorithm; Annotation; Computer science; Artificial intelligence; Mathematics","score_opus":0.09292717424728529,"score_gpt":0.35859048593636866,"score_spread":0.26566331168908336,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2086333750","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.38645658,0.00014455912,0.60857105,0.00044856744,0.000101356156,0.0009535336,0.00003882484,0.00002819604,0.003257317],"genre_scores_gemma":[0.8516332,0.000051781608,0.14809917,0.00004060499,0.00002235108,0.0000151045415,0.000009325666,0.000054699532,0.00007379985],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99570215,0.00025190518,0.0024554026,0.0002753368,0.0010111892,0.00030401585],"domain_scores_gemma":[0.9814601,0.013478675,0.0032437579,0.00070906186,0.0010309102,0.00007748636],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0012321031,0.00039509547,0.0013944341,0.00030853495,0.00007143675,0.000013749278,0.0004678125,0.00022342574,0.00011151824],"category_scores_gemma":[0.0048480416,0.0003052745,0.0003881712,0.0006355053,0.0005170451,0.00013222355,0.00017636058,0.00027084514,0.000016061813],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00024477224,0.0028459372,0.000019006107,0.00786813,0.00046622893,0.000005167021,0.015821705,0.013532782,0.005958252,0.9476691,0.00064180273,0.004927132],"study_design_scores_gemma":[0.00072117965,0.00089035794,0.000052923155,0.0034120968,0.0003870292,0.000017375382,0.002297814,0.107006475,0.02192502,0.8630771,0.000007445127,0.00020516098],"about_ca_topic_score_codex":0.000015510512,"about_ca_topic_score_gemma":0.000005485451,"teacher_disagreement_score":0.46517658,"about_ca_system_score_codex":0.000044271466,"about_ca_system_score_gemma":0.00009283865,"threshold_uncertainty_score":0.9999399},"labels":[],"label_agreement":null},{"id":"W2088281981","doi":"10.1090/s0025-5718-2011-02409-9","title":"Asymptotic distributions of the zeros of certain classes of hypergeometric functions and polynomials","year":2011,"lang":"en","type":"article","venue":"Mathematics of Computation","topic":"Mathematical functions and polynomials","field":"Mathematics","cited_by":10,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"Foshan University","keywords":"Mathematics; Basic hypergeometric series; Generalized hypergeometric function; Hypergeometric distribution; Hypergeometric function; Confluent hypergeometric function; Hypergeometric function of a matrix argument; Pure mathematics; Hypergeometric identity; Gauss; Combinatorics; Discrete mathematics","score_opus":0.06962337845641808,"score_gpt":0.2856732853863994,"score_spread":0.21604990692998133,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2088281981","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8253106,0.00007436302,0.1716657,0.000030904474,0.00011836603,0.00041225122,0.0001292363,0.000015792419,0.0022428303],"genre_scores_gemma":[0.9614603,0.000011365945,0.038308803,0.0000021188273,0.0000120426885,0.0000114131,0.0000056160966,0.000016322978,0.00017199616],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9981399,0.000087927525,0.0012190195,0.0001215675,0.0002987972,0.00013278761],"domain_scores_gemma":[0.9962244,0.0018614016,0.001135702,0.00037346227,0.00036005222,0.0000449746],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005560606,0.00014967739,0.0006149373,0.00024544174,0.00006382467,0.0000054766924,0.00017980364,0.00009328508,0.00010970407],"category_scores_gemma":[0.0015516313,0.00010804793,0.00018725931,0.0006916815,0.00027255973,0.000073052965,0.00009165468,0.00007677771,0.0000020400564],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006679163,0.003740588,0.004248385,0.009100757,0.00054231164,2.7488852e-7,0.0062575527,0.00023020583,0.035584666,0.93578047,0.0012948643,0.003153166],"study_design_scores_gemma":[0.00096329907,0.00047134314,0.009298018,0.0009007649,0.00085474364,0.000018546456,0.0021886108,0.005883303,0.16119768,0.81790596,0.00003199799,0.00028570104],"about_ca_topic_score_codex":0.000032443717,"about_ca_topic_score_gemma":0.0000045257034,"teacher_disagreement_score":0.13614976,"about_ca_system_score_codex":0.000016645072,"about_ca_system_score_gemma":0.00006272091,"threshold_uncertainty_score":0.44060665},"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,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_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","score_opus":0.03144884872393362,"score_gpt":0.2860411006219882,"score_spread":0.25459225189805457,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2091356782","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011003976,0.000094610965,0.9870099,0.0003871502,0.00012698003,0.0004940351,0.000003841608,0.000117191026,0.0007623402],"genre_scores_gemma":[0.2774735,0.0000034180773,0.72220236,0.000045848625,0.00008992627,0.000035749064,0.000005180352,0.0000111463005,0.00013284043],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99889016,0.00003437181,0.000453348,0.00019679862,0.0002400967,0.00018522823],"domain_scores_gemma":[0.99896413,0.00030785718,0.000251561,0.00027015255,0.0001550787,0.000051198585],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005610693,0.00012891972,0.00023652625,0.00011001791,0.00008345843,0.0000767728,0.00042908467,0.000048313635,0.0000066032485],"category_scores_gemma":[0.00005701628,0.000117964766,0.00009178305,0.00021670059,0.000032769392,0.00036773286,0.000063710206,0.00005099655,0.000035255136],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000036675237,0.00055620086,0.0000041506974,0.0007017743,0.000047348403,6.2785324e-7,0.006974253,0.06736103,0.001621763,0.6828353,0.00038526463,0.23950864],"study_design_scores_gemma":[0.00027649672,0.00008034603,0.000009687962,0.00004012856,0.000009591875,0.000008260365,0.00003438066,0.7576169,0.0040580165,0.2373231,0.0004349951,0.00010810487],"about_ca_topic_score_codex":0.0000016678256,"about_ca_topic_score_gemma":8.747042e-7,"teacher_disagreement_score":0.6902559,"about_ca_system_score_codex":0.000022524202,"about_ca_system_score_gemma":0.000039424085,"threshold_uncertainty_score":0.48104638},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.10334652039314775,"score_gpt":0.34891037630165617,"score_spread":0.24556385590850843,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2092046358","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.41381732,0.000018571198,0.58515465,0.00017864647,0.00015265637,0.00050915306,0.00003059845,0.000030841282,0.00010755861],"genre_scores_gemma":[0.56383246,0.0000064685087,0.43603688,0.000009506808,0.000036759684,0.000030208368,0.000013178919,0.000016422988,0.000018118137],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99853456,0.000036986494,0.0007953864,0.00014662277,0.00032555644,0.00016085997],"domain_scores_gemma":[0.9968455,0.001684391,0.0006943255,0.00027511743,0.0004549593,0.000045730074],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00033596836,0.00015429074,0.00036360533,0.000099067394,0.00014360224,0.00002026182,0.00016958594,0.00007798265,0.00001636109],"category_scores_gemma":[0.0011912745,0.000121954414,0.0001628075,0.0001995513,0.00017822292,0.000067705136,0.000056753623,0.0001009919,0.000005119033],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005932028,0.0008624629,0.000073287396,0.0010973193,0.00020436964,3.567479e-7,0.0040423875,0.0035193262,0.020882623,0.9660369,0.000079490776,0.0031421294],"study_design_scores_gemma":[0.0012892674,0.0001523176,0.00090553774,0.0003467929,0.00022079494,0.000009127895,0.000877866,0.14047466,0.022092676,0.8334314,0.00002104374,0.00017849288],"about_ca_topic_score_codex":0.000018260727,"about_ca_topic_score_gemma":0.000028611894,"teacher_disagreement_score":0.15001512,"about_ca_system_score_codex":0.00003316021,"about_ca_system_score_gemma":0.000112126254,"threshold_uncertainty_score":0.49731568},"labels":[],"label_agreement":null},{"id":"W2092122626","doi":"10.1090/s0025-5718-09-02226-1","title":"General order multivariate Padé approximants for Pseudo-multivariate functions. II","year":2009,"lang":"en","type":"article","venue":"Mathematics of Computation","topic":"Mathematical functions and polynomials","field":"Mathematics","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"St. Francis Xavier University","funders":"Vlaamse regering; Natural Sciences and Engineering Research Council of Canada; Fonds Wetenschappelijk Onderzoek; National Natural Science Foundation of China","keywords":"Algorithm; Artificial intelligence; Mathematics; Computer science","score_opus":0.056684953001206774,"score_gpt":0.3414167565669277,"score_spread":0.2847318035657209,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2092122626","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.14370807,0.000017579363,0.85121053,0.0003742133,0.0003092387,0.0012139388,0.000050574792,0.00017669522,0.0029391905],"genre_scores_gemma":[0.26599464,0.0000022348145,0.7313457,0.000075099786,0.00018157826,0.00008327616,0.000051427804,0.000045809204,0.002220248],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99769866,0.000067238805,0.0011599414,0.00032999399,0.0003745505,0.00036960805],"domain_scores_gemma":[0.99714845,0.0011513316,0.00064020394,0.00041840508,0.0005309984,0.000110609224],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0008307801,0.00032914206,0.00069948565,0.00020882064,0.00031146884,0.000057100053,0.00021069338,0.00017569882,0.00012318246],"category_scores_gemma":[0.0011600754,0.000283052,0.000231194,0.00035362225,0.00005380356,0.00018826802,0.00005689452,0.00013354233,0.000031365937],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00019276653,0.004321138,0.000010829736,0.0016258503,0.00032672452,0.0000017049954,0.005241184,0.0032779984,0.02144773,0.9262334,0.016107107,0.021213548],"study_design_scores_gemma":[0.001389506,0.00036011124,0.00008133425,0.00013652307,0.00016277602,0.000009737506,0.00014557963,0.32679898,0.002049007,0.66815645,0.0004169813,0.00029306023],"about_ca_topic_score_codex":0.00000969365,"about_ca_topic_score_gemma":0.0000020473,"teacher_disagreement_score":0.32352096,"about_ca_system_score_codex":0.000048244336,"about_ca_system_score_gemma":0.00006094402,"threshold_uncertainty_score":0.99996215},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.04045567179797793,"score_gpt":0.3042376302594416,"score_spread":0.2637819584614637,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2092129801","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15433554,0.00011964019,0.84488505,0.00010317462,0.000058551177,0.00022188219,0.0000017179744,0.000058456808,0.00021596016],"genre_scores_gemma":[0.69243777,0.0000060517445,0.30749905,0.000015651614,0.000017057166,0.0000062282197,0.0000071635927,0.000008475138,0.00000257558],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99956673,0.000009779788,0.00021233814,0.00005215009,0.000080897305,0.000078101184],"domain_scores_gemma":[0.99898344,0.00083893584,0.000057632362,0.00005254295,0.000049927276,0.000017518805],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000187125,0.0000609326,0.00009971451,0.00003654665,0.00009254573,0.00002511871,0.000029041728,0.000025548898,0.000003788178],"category_scores_gemma":[0.00007274619,0.000051201,0.000027019729,0.0000809065,0.000035115376,0.000041875206,0.0000070350175,0.00004167438,9.701018e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000002068737,0.000019602387,0.0000051,0.00014931461,0.000023083257,8.933879e-8,0.0012960735,0.9537907,0.0025290332,0.026988665,0.000021738282,0.015174482],"study_design_scores_gemma":[0.00032790954,0.000039806753,0.0007766897,0.000030476025,0.000018654673,0.0000029823561,0.00009070924,0.8344946,0.00062959787,0.16352552,0.000014689167,0.000048394566],"about_ca_topic_score_codex":0.0000016113395,"about_ca_topic_score_gemma":4.5403095e-7,"teacher_disagreement_score":0.5381022,"about_ca_system_score_codex":0.000018311946,"about_ca_system_score_gemma":0.000008220572,"threshold_uncertainty_score":0.20879163},"labels":[],"label_agreement":null},{"id":"W2092948697","doi":"10.1090/s0025-5718-2013-02715-9","title":"Taking roots over high extensions of finite fields","year":2013,"lang":"en","type":"article","venue":"Mathematics of Computation","topic":"Cryptography and Residue Arithmetic","field":"Computer Science","cited_by":15,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"","keywords":"Mathematics; Finite field; Pure mathematics; Algebra over a field; Discrete mathematics","score_opus":0.014579519165931502,"score_gpt":0.24877991118498216,"score_spread":0.23420039201905066,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2092948697","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.31698212,0.00002467357,0.6822582,0.00011294384,0.000076048695,0.00009970657,5.475184e-7,0.000024386281,0.00042140097],"genre_scores_gemma":[0.7287705,0.0000027554825,0.27118006,0.000023229964,0.000007516599,0.0000034845757,0.0000010639948,0.0000032921337,0.000008131621],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992484,0.000022076438,0.0003125278,0.00010747439,0.00021337983,0.00009615658],"domain_scores_gemma":[0.99885756,0.00040564663,0.00030716695,0.00023273469,0.00016851723,0.000028382503],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00011384436,0.000071593786,0.00016381177,0.00014491743,0.000037740512,0.0000312417,0.00023881318,0.000045607583,0.000035678124],"category_scores_gemma":[0.000073865755,0.00006109421,0.00006787833,0.0002961023,0.00003740416,0.00019101881,0.00008930781,0.00005399232,0.0000103363645],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000042164947,0.00097432855,0.00081839075,0.00094200956,0.00013829146,0.0000060416983,0.008887627,0.15311758,0.010033335,0.7232701,0.0012131636,0.10059491],"study_design_scores_gemma":[0.0001798067,0.00005982958,0.029712444,0.00011124647,0.0000096410295,0.0000026451883,0.000039909428,0.6762255,0.0025342861,0.29104117,0.000003695493,0.0000798801],"about_ca_topic_score_codex":0.00006659306,"about_ca_topic_score_gemma":0.000002712323,"teacher_disagreement_score":0.5231079,"about_ca_system_score_codex":0.0000035257688,"about_ca_system_score_gemma":0.00001448073,"threshold_uncertainty_score":0.24913494},"labels":[],"label_agreement":null},{"id":"W2094186803","doi":"10.1090/s0025-5718-07-02033-9","title":"New techniques for bounds on the total number of prime factors of an odd perfect number","year":2007,"lang":"en","type":"article","venue":"Mathematics of Computation","topic":"Analytic Number Theory Research","field":"Mathematics","cited_by":18,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Prime number; Perfect number; Prime factor; Prime (order theory); Combinatorics","score_opus":0.05927435493318759,"score_gpt":0.3987101713435034,"score_spread":0.3394358164103158,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2094186803","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6282634,0.0000015464733,0.36557394,0.000023306055,0.000022307846,0.0005370236,0.000009493584,0.000032393124,0.00553654],"genre_scores_gemma":[0.8087349,4.7013575e-7,0.19067015,0.0000038659873,0.000043332715,0.00000647695,0.000008734811,0.000037580714,0.0004945072],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9981232,0.000080960795,0.0007932125,0.00015772559,0.00062087073,0.00022397928],"domain_scores_gemma":[0.99472225,0.0037864884,0.0006266612,0.0004058674,0.0003897084,0.00006904972],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002104378,0.0001800737,0.00046982634,0.00009817978,0.000056673038,0.000018147295,0.0002800165,0.00010837398,0.00018777959],"category_scores_gemma":[0.0007563272,0.0001280397,0.00018997402,0.00023569597,0.00014108329,0.0001004681,0.00005498881,0.00012562277,0.000008703734],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00027135914,0.0017250133,0.0011660194,0.0019739482,0.00034245898,0.0000012339319,0.012221141,0.00008510878,0.0089711435,0.96299094,0.0013345398,0.008917101],"study_design_scores_gemma":[0.0003308384,0.0002858361,0.0003915817,0.00021849517,0.00008154307,0.000010723231,0.0012144091,0.007318304,0.225349,0.7646438,0.00001303597,0.00014242082],"about_ca_topic_score_codex":0.000027577345,"about_ca_topic_score_gemma":0.0000044179296,"teacher_disagreement_score":0.21637785,"about_ca_system_score_codex":0.0000498484,"about_ca_system_score_gemma":0.00008787243,"threshold_uncertainty_score":0.5221307},"labels":[],"label_agreement":null},{"id":"W2095280521","doi":"10.1090/s0025-5718-06-01837-0","title":"Detecting perfect powers by factoring into coprimes","year":2006,"lang":"en","type":"article","venue":"Mathematics of Computation","topic":"Analytic Number Theory Research","field":"Mathematics","cited_by":25,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Division of Mathematical Sciences; Fields Institute for Research in Mathematical Sciences; National Science Foundation","keywords":"Primality test; Mathematics; Integer (computer science); Combinatorics; Fermat's Last Theorem; Factorization; Discrete mathematics; Prime factor; Number theory; Computation; Prime (order theory); Algorithm; Computer science","score_opus":0.02901898494787635,"score_gpt":0.3377607995136534,"score_spread":0.30874181456577704,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2095280521","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6367016,0.00003980329,0.35789585,0.000035662415,0.00004012364,0.00019189167,0.0000022073577,0.00008413007,0.0050087734],"genre_scores_gemma":[0.91577995,0.000001084143,0.0836963,0.000003784678,0.000037317302,0.0000062057125,0.000007616814,0.000037955073,0.0004297854],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9984713,0.00006749455,0.0005433754,0.0001766467,0.0005103766,0.00023077702],"domain_scores_gemma":[0.9978578,0.001377182,0.00032250196,0.00021819146,0.00017916193,0.000045145498],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00076267216,0.00016207634,0.00032755572,0.00013293017,0.00010334892,0.000045877216,0.00018826967,0.00007089478,0.00005283783],"category_scores_gemma":[0.00044241632,0.00015426287,0.00009827409,0.00022420441,0.00007882008,0.000115899384,0.000069611284,0.0001379735,0.00002879017],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00015092791,0.0036954475,0.0066405335,0.00923279,0.0010343445,0.00002861248,0.046818953,0.006608987,0.3179362,0.5587055,0.020240592,0.028907096],"study_design_scores_gemma":[0.000438568,0.000077044206,0.000062688814,0.00015197603,0.00006416384,0.000008244145,0.001144982,0.044232722,0.06960706,0.88392013,0.00006552192,0.00022692849],"about_ca_topic_score_codex":0.00008397244,"about_ca_topic_score_gemma":0.00000609587,"teacher_disagreement_score":0.3252146,"about_ca_system_score_codex":0.00009587296,"about_ca_system_score_gemma":0.000032314943,"threshold_uncertainty_score":0.6290657},"labels":[],"label_agreement":null},{"id":"W2101471654","doi":"10.1090/mcom3050","title":"Unconditional class group tabulation of imaginary quadratic fields to |Δ|<2⁴⁰","year":2015,"lang":"en","type":"article","venue":"Mathematics of Computation","topic":"Advanced Combinatorial Mathematics","field":"Mathematics","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary; University of Waterloo","funders":"Alberta Innovates - Technology Futures","keywords":"Mathematics; Quadratic equation; Group (periodic table); TRACE (psycholinguistics); Riemann hypothesis; Discriminant; Combinatorics; Bounded function; Factorization; Pure mathematics; Mathematical analysis; Algorithm; Geometry","score_opus":0.05677138909995796,"score_gpt":0.34473092154677204,"score_spread":0.2879595324468141,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2101471654","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.29688698,0.000016722233,0.6992593,0.00020350749,0.0003261965,0.00059036975,0.000018136954,0.00008278162,0.0026160213],"genre_scores_gemma":[0.6351243,5.4174984e-7,0.36466137,0.00001955564,0.000053862495,0.00002459768,0.00003444781,0.000031701406,0.000049587536],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99753565,0.00007580783,0.0011144702,0.00021409751,0.00085046416,0.00020952937],"domain_scores_gemma":[0.9968293,0.0010543563,0.00083663064,0.00039694732,0.00073677755,0.00014604031],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007077321,0.00023593348,0.0005936986,0.00025375275,0.00004268935,0.000021701357,0.00026228806,0.000118990785,0.000024089202],"category_scores_gemma":[0.0014296144,0.00023675295,0.00011049986,0.0004370612,0.00007775681,0.00026207886,0.00011185553,0.00012386889,0.000028418493],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000050025836,0.0009707361,0.000062151164,0.0012874407,0.000070367205,0.000003293984,0.005294444,0.011649461,0.0016796864,0.9737821,0.004402635,0.0007476604],"study_design_scores_gemma":[0.00080207014,0.0003426713,0.00007332988,0.00026963273,0.00006774075,0.000012437451,0.00041005804,0.051439755,0.0024397722,0.9438926,0.000041646443,0.00020829185],"about_ca_topic_score_codex":0.0000045187858,"about_ca_topic_score_gemma":0.0000051183088,"teacher_disagreement_score":0.33823735,"about_ca_system_score_codex":0.00010898074,"about_ca_system_score_gemma":0.000097578,"threshold_uncertainty_score":0.96545047},"labels":[],"label_agreement":null},{"id":"W2110599431","doi":"10.1090/s0025-5718-2011-02573-1","title":"The zeta function on the critical line: Numerical evidence for moments and random matrix theory models","year":2011,"lang":"en","type":"article","venue":"Mathematics of Computation","topic":"Analytic Number Theory Research","field":"Mathematics","cited_by":15,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"National Science Foundation","keywords":"Mathematics; Random matrix; Critical line; Matrix (chemical analysis); Mathematical analysis; Physics","score_opus":0.26089246871559624,"score_gpt":0.4298359578966427,"score_spread":0.16894348918104646,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2110599431","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.027154638,0.00013075581,0.9700165,0.00053624954,0.000076537355,0.0008794605,0.0000044719213,0.00003568262,0.0011657373],"genre_scores_gemma":[0.9710606,0.00002224614,0.02831535,0.000038299528,0.000044680415,0.00010247489,0.0000012351186,0.00003072925,0.0003844319],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9982959,0.00030569255,0.0005080487,0.00018304288,0.00047954152,0.00022777775],"domain_scores_gemma":[0.97308874,0.026020326,0.00020260843,0.00033290792,0.00029899308,0.000056420704],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0036862676,0.00015217625,0.00027024568,0.000055002143,0.0002854069,0.00006133857,0.00027071152,0.000062869105,0.0000311678],"category_scores_gemma":[0.004754532,0.00008396252,0.000108480446,0.00012766318,0.00027442118,0.00014714772,0.00008461151,0.00015080725,0.000013183761],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00069203204,0.00018268933,0.000004306223,0.00027604497,0.0000870664,3.7812214e-7,0.0019730425,0.00023170722,0.000037967282,0.9947003,0.0004089829,0.0014054936],"study_design_scores_gemma":[0.00035246933,0.00016951877,0.000007848407,0.00012510257,0.00009663471,0.0000033404358,0.00057689217,0.324489,0.00021706743,0.6738975,0.000004733578,0.000059880647],"about_ca_topic_score_codex":0.0000021357168,"about_ca_topic_score_gemma":5.010154e-7,"teacher_disagreement_score":0.9439059,"about_ca_system_score_codex":0.000027085267,"about_ca_system_score_gemma":0.00003316063,"threshold_uncertainty_score":0.5691962},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.04958351190012712,"score_gpt":0.32462294844396183,"score_spread":0.2750394365438347,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2110949086","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07669808,0.00002806973,0.91748774,0.00061965594,0.00018891273,0.0007993372,0.000012852421,0.00017187321,0.0039934833],"genre_scores_gemma":[0.21338408,0.00000495217,0.78576094,0.00015163666,0.00013892945,0.000043715627,0.0000051180373,0.000060134593,0.0004504741],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99779475,0.000090053334,0.0008873794,0.0002558613,0.00063697033,0.00033499862],"domain_scores_gemma":[0.9960792,0.0025681807,0.00042887765,0.0005292993,0.0002672901,0.0001271626],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005706648,0.00028403196,0.00060398283,0.0001420141,0.0002417574,0.000028069991,0.0004507307,0.0000910812,0.000031064737],"category_scores_gemma":[0.0008437285,0.00020709987,0.00016783255,0.0004417833,0.0002792618,0.0001383919,0.00018938535,0.00018697114,0.00010956681],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006420212,0.0013741428,0.000018734052,0.000930019,0.00027074563,0.000028183556,0.028092096,0.00528261,0.0010721668,0.9123482,0.024401834,0.026117044],"study_design_scores_gemma":[0.0005472794,0.00015900584,0.00004780409,0.00016300498,0.00006375053,0.00014675788,0.00044035658,0.08825792,0.0024575116,0.90651745,0.0008988882,0.00030024734],"about_ca_topic_score_codex":0.0000044649983,"about_ca_topic_score_gemma":0.0000025211864,"teacher_disagreement_score":0.136686,"about_ca_system_score_codex":0.000069411246,"about_ca_system_score_gemma":0.00006245545,"threshold_uncertainty_score":0.8445288},"labels":[],"label_agreement":null},{"id":"W2131741428","doi":"10.1090/mcom/2953","title":"Computing the truncated theta function via Mordell integral","year":2015,"lang":"en","type":"article","venue":"Mathematics of Computation","topic":"Advanced Mathematical Identities","field":"Mathematics","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"York University","funders":"Division of Mathematical Sciences; Natural Sciences and Engineering Research Council of Canada; University of Bath","keywords":"Mathematics; Function (biology); Combinatorics; Lambda; Poisson summation formula; Simple (philosophy); Riemann zeta function; Discrete mathematics; Mathematical analysis; Physics; Quantum mechanics","score_opus":0.10082816388571869,"score_gpt":0.34845010511631536,"score_spread":0.24762194123059666,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2131741428","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.14536805,0.00005386249,0.84611994,0.00015045358,0.00024412715,0.00045706666,0.0000025474676,0.00019200929,0.0074119465],"genre_scores_gemma":[0.86046463,0.0000014914791,0.1387924,0.000025742193,0.000074350515,0.000010903086,0.000010910716,0.000046784593,0.0005728091],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99796885,0.000109597786,0.0008541236,0.00019161831,0.00063155213,0.00024422823],"domain_scores_gemma":[0.9970478,0.0013187401,0.0006384853,0.00038858966,0.00052318943,0.00008320181],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011099207,0.0002348869,0.0004417107,0.00011732247,0.000108986605,0.00006121363,0.00031257627,0.000083964165,0.000021455427],"category_scores_gemma":[0.0010129797,0.00016189949,0.00012941658,0.00033209907,0.00017914193,0.00022125086,0.00013485199,0.00020077499,0.00006327377],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007609777,0.0010076533,0.000062670355,0.0012734903,0.0002606978,0.0000041504836,0.018547453,0.013327025,0.0011463959,0.95332295,0.0053320536,0.005639359],"study_design_scores_gemma":[0.00036441372,0.0000876279,0.000022507733,0.000100818055,0.00009003083,0.000017268429,0.002097958,0.24008314,0.00078928727,0.7561843,0.000033357548,0.00012932188],"about_ca_topic_score_codex":0.000013154571,"about_ca_topic_score_gemma":0.000007932352,"teacher_disagreement_score":0.71509653,"about_ca_system_score_codex":0.0000721776,"about_ca_system_score_gemma":0.00005001275,"threshold_uncertainty_score":0.6602069},"labels":[],"label_agreement":null},{"id":"W2139863157","doi":"10.1090/s0025-5718-2015-02925-1","title":"Conditional bounds for the least quadratic non-residue and related problems","year":2015,"lang":"en","type":"preprint","venue":"Mathematics of Computation","topic":"Analytic Number Theory Research","field":"Mathematics","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"York University","funders":"Natural Sciences and Engineering Research Council of Canada; Simons Foundation; National Science Foundation","keywords":"Mathematics; Quadratic residue; Quadratic equation; Riemann hypothesis; Residue (chemistry); Class number; Upper and lower bounds; Applied mathematics; Discrete mathematics; Pure mathematics; Mathematical analysis","score_opus":0.101732865647481,"score_gpt":0.38088359530541216,"score_spread":0.27915072965793114,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2139863157","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08055359,0.00026867847,0.9113806,0.00083834276,0.00022243975,0.0034908082,0.00015511399,0.00008480468,0.0030056494],"genre_scores_gemma":[0.93509007,0.000013589164,0.06267529,0.000012531806,0.00009143261,0.00029260726,0.00023070879,0.00008712551,0.0015066267],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9976435,0.000111634916,0.0009701133,0.0003136293,0.0007135284,0.00024765186],"domain_scores_gemma":[0.99396765,0.0037126737,0.00089087145,0.00046891288,0.0008703991,0.00008946803],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002641444,0.00029765634,0.00065590587,0.00016128352,0.00015754004,0.00013823618,0.00038846175,0.00025739532,0.000037963233],"category_scores_gemma":[0.0011393965,0.00022439133,0.00016409563,0.00013889285,0.00035796702,0.00007583968,0.0003774232,0.0004271081,0.000015034213],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007514331,0.0010873467,0.00008543547,0.022893827,0.001975189,0.000004508076,0.025146881,0.04979859,0.00018202422,0.8728613,0.024507778,0.0013819603],"study_design_scores_gemma":[0.00043158108,0.00005445887,0.0000351703,0.0003631427,0.00020721971,0.000015402127,0.00052201824,0.37978667,0.000038871167,0.61839724,0.000014068707,0.00013414692],"about_ca_topic_score_codex":0.000015371528,"about_ca_topic_score_gemma":0.000013027237,"teacher_disagreement_score":0.8545365,"about_ca_system_score_codex":0.00009828539,"about_ca_system_score_gemma":0.00033259002,"threshold_uncertainty_score":0.9150413},"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,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_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","score_opus":0.04013396915795872,"score_gpt":0.3566230848938615,"score_spread":0.31648911573590277,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2148206455","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.726248,0.000006265199,0.26751596,0.00007674029,0.000055668286,0.00033405935,0.0000059781164,0.000029300849,0.0057279966],"genre_scores_gemma":[0.83588576,2.975498e-7,0.1638442,0.0000036685128,0.000023966786,0.000006256914,0.0000032140329,0.000020966045,0.00021166091],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987212,0.000042575968,0.00053338177,0.00011707743,0.0004420494,0.00014373643],"domain_scores_gemma":[0.99788785,0.0010353969,0.0004099159,0.00030571225,0.00031293908,0.000048195066],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00081156683,0.000113249545,0.00035117145,0.0001305313,0.000027286995,0.00001047046,0.00022040318,0.0000908129,0.00015045094],"category_scores_gemma":[0.0009036093,0.00009608751,0.00009349751,0.00019885028,0.00015416676,0.00005864634,0.000061149774,0.0001984237,0.0000086336395],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002505324,0.00079458224,0.0002682237,0.0023093442,0.000129503,0.000002845904,0.0045738863,0.00022244037,0.023439595,0.96330076,0.0008852573,0.004048495],"study_design_scores_gemma":[0.00033091704,0.0000679025,0.00004595767,0.00007742421,0.00004257747,0.000014635159,0.00022659801,0.02998741,0.058450103,0.91065,0.000020443245,0.000086007785],"about_ca_topic_score_codex":0.0000041708045,"about_ca_topic_score_gemma":0.000012412716,"teacher_disagreement_score":0.10963772,"about_ca_system_score_codex":0.0000104286655,"about_ca_system_score_gemma":0.00006511434,"threshold_uncertainty_score":0.3918335},"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,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_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","score_opus":0.05808456210056037,"score_gpt":0.34705318898742615,"score_spread":0.28896862688686575,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2150932406","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.82089216,0.00004202606,0.17401914,0.00045373145,0.00010710871,0.0015731514,0.000053124604,0.000078283,0.0027812805],"genre_scores_gemma":[0.91465783,0.000008440093,0.083828926,0.00004191886,0.000095220305,0.00004778693,0.000027721886,0.000061930456,0.0012302432],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99746305,0.0001981546,0.0010214342,0.00030476943,0.00068711455,0.00032545655],"domain_scores_gemma":[0.9965783,0.001581253,0.00067620544,0.0007032117,0.0003892291,0.000071809416],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011065296,0.00026739432,0.00059850037,0.00012051058,0.00011953702,0.00004245083,0.0006203876,0.00015882355,0.00020162991],"category_scores_gemma":[0.00019576917,0.00020086192,0.00030530844,0.00034135065,0.0002717326,0.0001320242,0.00007473333,0.00017892603,0.000020839301],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0008805034,0.0053806887,0.001881416,0.011345635,0.0018879105,0.0000042306856,0.041514054,0.023658345,0.014021168,0.7199799,0.021372497,0.1580737],"study_design_scores_gemma":[0.0016605426,0.00027107424,0.0010979307,0.00046051483,0.00029628625,0.000023001361,0.0005252732,0.17828888,0.036274165,0.77999806,0.0007197061,0.0003845492],"about_ca_topic_score_codex":0.000016777001,"about_ca_topic_score_gemma":0.00000808462,"teacher_disagreement_score":0.15768914,"about_ca_system_score_codex":0.00006140092,"about_ca_system_score_gemma":0.000112569935,"threshold_uncertainty_score":0.81909114},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.014694594731142097,"score_gpt":0.2393141835337826,"score_spread":0.2246195888026405,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2160886236","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13606462,0.00004809714,0.86291176,0.00009796158,0.000108161614,0.00038144345,0.000003154415,0.00007690899,0.0003079113],"genre_scores_gemma":[0.6667925,9.712181e-7,0.33309773,0.000012844427,0.00003320171,0.000018544852,0.000008931393,0.000007684403,0.000027556385],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99902815,0.000020512285,0.0003668134,0.00018853505,0.00020453507,0.00019148261],"domain_scores_gemma":[0.999083,0.00019879291,0.000280221,0.00022399118,0.0001846833,0.000029300416],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003409777,0.00010921595,0.00019371121,0.00017607442,0.00009021877,0.000077612334,0.00026064945,0.00005288514,0.0000012100095],"category_scores_gemma":[0.00001602715,0.00010260196,0.00010140741,0.00037531296,0.000027551176,0.00013091289,0.000056059118,0.000048733105,0.0000068360955],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000026034952,0.00096490094,0.00022244999,0.00042486834,0.000056151937,0.0000022791662,0.0024144247,0.037868474,0.0017390567,0.94728243,0.00012674523,0.008872201],"study_design_scores_gemma":[0.00099346,0.00007991727,0.003946462,0.000028413397,0.000021558397,0.0000058299975,0.000019042513,0.8494511,0.0016534191,0.14359277,0.00008848859,0.000119503726],"about_ca_topic_score_codex":0.00006477145,"about_ca_topic_score_gemma":0.000029340154,"teacher_disagreement_score":0.8115827,"about_ca_system_score_codex":0.000019256155,"about_ca_system_score_gemma":0.00003694401,"threshold_uncertainty_score":0.41839865},"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,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_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","score_opus":0.016375134560647993,"score_gpt":0.24592599945827465,"score_spread":0.22955086489762666,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2167556014","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.052994348,0.00015944635,0.93931437,0.0015225617,0.0001840059,0.00015566497,0.0000013367326,0.00008106295,0.0055871983],"genre_scores_gemma":[0.806102,0.000047668775,0.19357483,0.00011180132,0.00001883959,0.0000046198215,8.780605e-7,0.00000721798,0.0001321786],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999034,0.00004050859,0.00030942148,0.00013123977,0.0003295032,0.00015534963],"domain_scores_gemma":[0.99901545,0.00032667367,0.0001902338,0.00031974452,0.0001078175,0.00004010122],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00018924163,0.00009877543,0.0001357279,0.000054699743,0.00020695283,0.0001478604,0.00047904465,0.000033520104,0.000019351577],"category_scores_gemma":[0.000013428134,0.000069242255,0.00009508203,0.00034513322,0.00007384001,0.00016696552,0.00010296586,0.000075279706,0.00013469432],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008040127,0.0013254404,0.0012740331,0.00054365734,0.00029874296,0.000016742213,0.037057497,0.010541963,0.0010238963,0.7703789,0.027656533,0.14987455],"study_design_scores_gemma":[0.00022524406,0.000024460356,0.00070673233,0.000044761804,0.000012160632,0.000027225175,0.00006026997,0.87673783,0.0012115845,0.120077044,0.00076112774,0.000111577574],"about_ca_topic_score_codex":0.0000029073517,"about_ca_topic_score_gemma":7.5059035e-7,"teacher_disagreement_score":0.86619586,"about_ca_system_score_codex":0.0000083805235,"about_ca_system_score_gemma":0.0000052132586,"threshold_uncertainty_score":0.28236172},"labels":[],"label_agreement":null},{"id":"W2285073523","doi":"10.1090/mcom/3221","title":"Every positive integer is a sum of three palindromes","year":2017,"lang":"en","type":"preprint","venue":"Mathematics of Computation","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Sheridan College","funders":"National Research Foundation","keywords":"Integer (computer science); Palindrome; Combinatorics; Mathematics; Computer science; Biology; Genetics; Programming language; CRISPR","score_opus":0.059115241507991,"score_gpt":0.3393724487026204,"score_spread":0.2802572071946294,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2285073523","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.74791396,0.00023145533,0.24376494,0.000104380204,0.0006839419,0.0008307277,0.00024909797,0.000056861893,0.0061646174],"genre_scores_gemma":[0.8906598,0.000021134287,0.109034196,0.000016007329,0.000065375694,0.000014191089,0.000033677967,0.000052058993,0.00010352959],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99779934,0.00006924444,0.001043384,0.00031270622,0.0005856741,0.00018966755],"domain_scores_gemma":[0.9949979,0.0010119796,0.002372911,0.0009768896,0.0005920008,0.00004828585],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0006760915,0.00036397428,0.0010740387,0.00025865767,0.00012619668,0.000049289472,0.00069555826,0.00039194987,0.000047281093],"category_scores_gemma":[0.00055509876,0.0003117951,0.00042417628,0.000060412774,0.00029114223,0.000080093276,0.00088106823,0.0004012185,0.0000029072396],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010714755,0.00088841276,0.00053516007,0.01742372,0.0019636725,0.000013441408,0.046615824,0.0008929387,0.0003191127,0.92100334,0.0027511474,0.0074860593],"study_design_scores_gemma":[0.00027521924,0.00006674021,0.0007750285,0.0018155486,0.00023294047,0.000008735912,0.0001905157,0.0118677365,0.0038659822,0.9806267,0.0000051320694,0.0002697269],"about_ca_topic_score_codex":0.000023005088,"about_ca_topic_score_gemma":0.0000068599334,"teacher_disagreement_score":0.14274584,"about_ca_system_score_codex":0.00003705376,"about_ca_system_score_gemma":0.00009628673,"threshold_uncertainty_score":0.9999334},"labels":[],"label_agreement":null},{"id":"W2309335899","doi":"10.1090/mcom/3129","title":"Sums of two 𝑆-units via Frey-Hellegouarch curves","year":2016,"lang":"en","type":"article","venue":"Mathematics of Computation","topic":"Algebraic Geometry and Number Theory","field":"Mathematics","cited_by":9,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"Agence Nationale de la Recherche","keywords":"Mathematics; Modularity (biology); Carry (investment); Logarithm; Set (abstract data type); Galois module; Arithmetic; Perfect power; Discrete mathematics; Mathematical analysis; Computer science","score_opus":0.04921791721197046,"score_gpt":0.3226330928430135,"score_spread":0.27341517563104306,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2309335899","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5011045,0.00009820061,0.49565148,0.0001257314,0.0000770045,0.00022537383,0.000012079043,0.000045391844,0.0026602806],"genre_scores_gemma":[0.9520191,0.000025560046,0.04747383,0.000018174182,0.00003206873,0.0000073545143,0.0000053888098,0.000027018767,0.00039149384],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99846566,0.000099958495,0.00070334075,0.0001441195,0.00041491416,0.00017199808],"domain_scores_gemma":[0.9964483,0.0022211391,0.00055403577,0.0003163839,0.00040970457,0.00005048447],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008637624,0.00015462362,0.00042653616,0.00015661088,0.000036746074,0.000004754272,0.00022739531,0.00005943242,0.0001954233],"category_scores_gemma":[0.00074146717,0.00011065102,0.00008557633,0.0003796122,0.00014351732,0.00012621183,0.00007437086,0.00006320202,0.000040253402],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006226612,0.0010269842,0.000628041,0.009738938,0.0003498671,0.000004721673,0.0058348086,0.000068914145,0.053705476,0.89924914,0.0046014567,0.024729379],"study_design_scores_gemma":[0.0006550957,0.000089318724,0.00006885092,0.0011568111,0.00006538806,0.000011872145,0.00015065738,0.0011292852,0.071797684,0.9247194,0.000015498945,0.0001401473],"about_ca_topic_score_codex":0.0000051827237,"about_ca_topic_score_gemma":0.0000019229049,"teacher_disagreement_score":0.45091465,"about_ca_system_score_codex":0.00001707532,"about_ca_system_score_gemma":0.000038531878,"threshold_uncertainty_score":0.45122176},"labels":[],"label_agreement":null},{"id":"W2336537202","doi":"10.1090/mcom/3103","title":"No two non-real conjugates of a Pisot number have the same imaginary part","year":2015,"lang":"en","type":"article","venue":"Mathematics of Computation","topic":"Mathematical Dynamics and Fractals","field":"Mathematics","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada; Lietuvos Mokslo Taryba","keywords":"Mathematics; Alpha (finance); Combinatorics; Conjugate; Polynomial; Mathematical analysis; Statistics","score_opus":0.04997486097839675,"score_gpt":0.34756085442720763,"score_spread":0.29758599344881087,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2336537202","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.58941835,0.000034575845,0.2274931,0.00037661334,0.00032063667,0.0012719095,0.00006844862,0.00010428759,0.18091209],"genre_scores_gemma":[0.8546434,0.000016075395,0.14412445,0.000035538276,0.00010857159,0.00003295906,0.000020792271,0.000053927306,0.0009643086],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99803036,0.00007404868,0.0009767165,0.00017271764,0.0005210663,0.00022511122],"domain_scores_gemma":[0.9964338,0.0016075416,0.00077100814,0.00043395147,0.00065182184,0.0001018699],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00093904446,0.00023425346,0.0006378602,0.00005885579,0.000048535774,0.00003904367,0.00027929817,0.00007294816,0.000081759455],"category_scores_gemma":[0.00063193706,0.00015967274,0.0001627009,0.0001395819,0.00023018906,0.00012298784,0.0000973117,0.00011151864,0.00010294952],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009432952,0.002613283,0.00096183305,0.00327976,0.0003406971,0.00000879869,0.016650192,0.0011885888,0.0015270312,0.96200126,0.009436123,0.0018980709],"study_design_scores_gemma":[0.0006409528,0.0001271639,0.000024954048,0.00019603521,0.000077422956,0.000014976948,0.0004989624,0.31546187,0.00056651526,0.682157,0.000097249744,0.00013691731],"about_ca_topic_score_codex":0.00007680464,"about_ca_topic_score_gemma":0.000016361046,"teacher_disagreement_score":0.3142733,"about_ca_system_score_codex":0.000041256968,"about_ca_system_score_gemma":0.000086359636,"threshold_uncertainty_score":0.6511265},"labels":[],"label_agreement":null},{"id":"W2339712517","doi":"10.1090/mcom/3111","title":"A role for generalized Fermat numbers","year":2015,"lang":"en","type":"article","venue":"Mathematics of Computation","topic":"Analytic Number Theory Research","field":"Mathematics","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Dalhousie University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Fermat's Last Theorem; Combinatorics; Order (exchange); Prime (order theory); Integer (computer science); Product (mathematics); Modulo; Prime power; Prime number; Factorial; Discrete mathematics; Mathematical analysis; Geometry","score_opus":0.11959854579983181,"score_gpt":0.3949761769772851,"score_spread":0.2753776311774533,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2339712517","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3777993,0.000028078826,0.61200947,0.0001495732,0.00006287931,0.0006842981,0.000011380185,0.00008905924,0.009165948],"genre_scores_gemma":[0.5493889,0.0000010286196,0.44946536,0.000019818986,0.000055569337,0.000048574606,0.000018067447,0.00004307869,0.00095960905],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99860436,0.00006755078,0.0005022998,0.0001436865,0.0004682051,0.00021388537],"domain_scores_gemma":[0.99806833,0.0008055086,0.00027540958,0.00024386508,0.00049034035,0.00011653898],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011481759,0.0001341982,0.00036170465,0.00010963943,0.00004180703,0.000030947285,0.00020558364,0.00006655654,0.000023698096],"category_scores_gemma":[0.00090544473,0.00012273107,0.000118005766,0.00017067585,0.000065118955,0.0001008919,0.000058097885,0.00006294441,0.000036278965],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013449542,0.00064363255,0.00007406376,0.0013649121,0.00019967803,0.0000017825407,0.010876859,0.0015283406,0.0017892697,0.963888,0.017447438,0.0020515514],"study_design_scores_gemma":[0.0010161044,0.00006122141,0.0000041798467,0.00004358344,0.00006110075,0.000008473126,0.0011773686,0.16441186,0.0019231989,0.8310393,0.00014644384,0.000107147716],"about_ca_topic_score_codex":0.00000945867,"about_ca_topic_score_gemma":0.000005055883,"teacher_disagreement_score":0.1715896,"about_ca_system_score_codex":0.00006740427,"about_ca_system_score_gemma":0.00008587333,"threshold_uncertainty_score":0.5004828},"labels":[],"label_agreement":null},{"id":"W2341492737","doi":"10.1090/mcom/3095","title":"Discrete analysis of domain decomposition approaches for mesh generation via the equidistribution principle","year":2015,"lang":"en","type":"article","venue":"Mathematics of Computation","topic":"Advanced Numerical Methods in Computational Mathematics","field":"Engineering","cited_by":9,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Memorial University of Newfoundland","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Domain decomposition methods; Decomposition; Applied mathematics; Domain (mathematical analysis); Mathematical analysis; Finite element method","score_opus":0.1075739333930421,"score_gpt":0.36563335737958125,"score_spread":0.25805942398653914,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2341492737","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11881591,0.000050101335,0.8803723,0.000036212008,0.000093886905,0.0004226279,0.000049479677,0.00005428758,0.00010518275],"genre_scores_gemma":[0.5195681,0.0000010651175,0.4801916,0.000002224277,0.00002433338,0.000033176995,0.00016675697,0.000011692726,0.0000010596857],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987543,0.000062153886,0.0006400001,0.00011343182,0.00031591815,0.00011416518],"domain_scores_gemma":[0.9983423,0.00085211324,0.0003229225,0.00018073607,0.00026113313,0.000040824678],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000752167,0.00013023928,0.0003533204,0.00014827297,0.000045246874,0.000016238579,0.00013060345,0.000054459873,0.0000015716917],"category_scores_gemma":[0.00023212098,0.000106096326,0.00013746141,0.0005828185,0.000059583646,0.00011296524,0.000027460123,0.00005195939,7.5155026e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000075339426,0.0000567059,0.000007796899,0.00019599343,0.000255491,4.5794785e-8,0.0009546551,0.95553094,0.0025217314,0.037394825,0.00002189078,0.0030523762],"study_design_scores_gemma":[0.00016980887,0.000048798975,0.000044925477,0.0000150054,0.00025978105,8.9660915e-7,0.00013515745,0.77238214,0.0060419133,0.22080885,0.000012125792,0.00008057001],"about_ca_topic_score_codex":7.317218e-7,"about_ca_topic_score_gemma":0.0000010300618,"teacher_disagreement_score":0.4007522,"about_ca_system_score_codex":0.00008570306,"about_ca_system_score_gemma":0.000014135386,"threshold_uncertainty_score":0.43264827},"labels":[],"label_agreement":null},{"id":"W2464139764","doi":"10.1090/mcom/3076","title":"Computation of invariants of finite abelian groups","year":2015,"lang":"en","type":"article","venue":"Mathematics of Computation","topic":"Polynomial and algebraic computation","field":"Computer Science","cited_by":16,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada; Agence Nationale de la Recherche; Nanyang Technological University; Division of Mathematical Sciences; National University of Singapore","keywords":"Mathematics; Generating set of a group; Abelian group; Invariant (physics); Homogeneous space; Computation; Polynomial; Integer (computer science); Discrete mathematics; Algebra over a field; Pure mathematics; Algorithm; Computer science; Mathematical analysis; Geometry","score_opus":0.04075089591998207,"score_gpt":0.26849546060062607,"score_spread":0.227744564680644,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2464139764","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.25142768,0.00003974784,0.7474944,0.000089280235,0.00017587202,0.00014976786,0.0000037242528,0.000037539183,0.00058197003],"genre_scores_gemma":[0.79065454,0.0000015089228,0.20928645,0.000013690019,0.000017389764,0.0000022052764,0.000009959087,0.000007175863,0.000007091956],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99832374,0.00007095731,0.00081562356,0.00017446563,0.0004854827,0.00012976072],"domain_scores_gemma":[0.99799454,0.0003327083,0.0008735363,0.0002121218,0.00051160523,0.00007547655],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005608382,0.0001283623,0.0003660739,0.00026423694,0.000023753853,0.000023366716,0.0003784692,0.000056823992,0.0000014922085],"category_scores_gemma":[0.00018884578,0.00012571123,0.00007634488,0.00056906167,0.00007091117,0.00035948475,0.00014144485,0.00005693558,0.000008932448],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005698848,0.0015597794,0.00057938724,0.001562862,0.00016096249,0.0000051695183,0.030667728,0.46767974,0.008926102,0.3558017,0.0007980223,0.13220155],"study_design_scores_gemma":[0.0006009859,0.00020007417,0.0010324713,0.00013471577,0.000012788995,0.0000040560994,0.00012385104,0.7453376,0.0071603176,0.24529038,0.0000043506343,0.00009838683],"about_ca_topic_score_codex":0.000030809286,"about_ca_topic_score_gemma":0.0000025544489,"teacher_disagreement_score":0.53922683,"about_ca_system_score_codex":0.000024490977,"about_ca_system_score_gemma":0.00012903142,"threshold_uncertainty_score":0.51263547},"labels":[],"label_agreement":null},{"id":"W2565661303","doi":"10.1090/mcom/3231","title":"On the evaluation of some sparse polynomials","year":2016,"lang":"en","type":"article","venue":"Mathematics of Computation","topic":"Mathematical functions and polynomials","field":"Mathematics","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"École Polytechnique, Université Paris-Saclay; Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Algebra over a field; Applied mathematics; Pure mathematics","score_opus":0.15262172821246173,"score_gpt":0.36556746836532916,"score_spread":0.21294574015286744,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2565661303","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8986354,0.000027814784,0.09344065,0.0009192824,0.0001889119,0.00082426454,0.00002404096,0.000038211543,0.005901443],"genre_scores_gemma":[0.98711276,0.0000046560526,0.012511623,0.0000323852,0.000056887533,0.000043754866,0.0000015848573,0.000023730918,0.00021264284],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99777997,0.00022496657,0.00087208574,0.0001429294,0.00083070644,0.00014931962],"domain_scores_gemma":[0.99173796,0.006644793,0.0007202066,0.00044296042,0.0004151812,0.000038882536],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0032395816,0.00015604873,0.0003979378,0.00013118748,0.00005855355,0.000012660588,0.00019453683,0.000074120384,0.00059609336],"category_scores_gemma":[0.0039216187,0.000079882906,0.00014267785,0.00015127151,0.000116471856,0.000102622376,0.000039418494,0.00005133636,0.000068105874],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000018673421,0.00038486213,0.0000049456053,0.00021623129,0.00006755824,9.334252e-8,0.0005988712,0.00013554154,0.007872743,0.97916,0.0045470907,0.006993357],"study_design_scores_gemma":[0.00055433053,0.00010715393,0.00004667453,0.00038013334,0.00014548209,0.0000019949805,0.00012317233,0.009126295,0.032379802,0.95701426,0.000022083115,0.000098596065],"about_ca_topic_score_codex":0.0000026089751,"about_ca_topic_score_gemma":0.000001262405,"teacher_disagreement_score":0.08847736,"about_ca_system_score_codex":0.00004890691,"about_ca_system_score_gemma":0.00007026782,"threshold_uncertainty_score":0.6526804},"labels":[],"label_agreement":null},{"id":"W2566607440","doi":"10.1090/mcom/3247","title":"An analog of the prime number theorem for finite fields via truncated polylogarithm expansions","year":2016,"lang":"en","type":"article","venue":"Mathematics of Computation","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Polylogarithm; Mathematics; Monic polynomial; Asymptotic expansion; Asymptotic analysis; Riemann zeta function; Bell polynomials; Function (biology); Prime (order theory); Generating function; Asymptotic formula; Analytic number theory; Applied mathematics; Integer (computer science); Pure mathematics; Mathematical analysis; Combinatorics; Polynomial; Prime zeta function; Arithmetic zeta function","score_opus":0.015230427623292483,"score_gpt":0.26658078482223646,"score_spread":0.251350357198944,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2566607440","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13081335,0.000004172518,0.86834925,0.00024771705,0.00009838801,0.00017798952,0.0000067034957,0.00003934849,0.00026308038],"genre_scores_gemma":[0.8925977,7.855017e-7,0.107324146,0.000033242875,0.000011896206,0.0000078894045,0.0000016473302,0.000005649807,0.000017077615],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99924135,0.00007037609,0.00028996082,0.00013133888,0.00016125568,0.00010569554],"domain_scores_gemma":[0.99834996,0.00078856805,0.00025386846,0.00041123558,0.00016847457,0.000027909971],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00038298304,0.000083303814,0.0001521916,0.000062446234,0.00007262277,0.000017168995,0.00050820614,0.000052054307,0.000009924715],"category_scores_gemma":[0.00008745701,0.000048263657,0.00011404026,0.00026798306,0.00008373047,0.00015698638,0.000067399385,0.000033399832,0.00000246839],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000018952154,0.00035267312,0.00026753655,0.00007893914,0.0000448735,2.0160648e-7,0.0034919817,0.00076209335,0.015651831,0.91079944,0.000077508485,0.068453945],"study_design_scores_gemma":[0.00029934297,0.00010977386,0.00077015965,0.0000823604,0.000015806567,0.0000027153699,0.000034658366,0.15966864,0.026666265,0.8122604,0.000012705111,0.00007716711],"about_ca_topic_score_codex":0.0000025302609,"about_ca_topic_score_gemma":0.0000020533876,"teacher_disagreement_score":0.7617843,"about_ca_system_score_codex":0.0000060038583,"about_ca_system_score_gemma":0.00002674675,"threshold_uncertainty_score":0.19681348},"labels":[],"label_agreement":null},{"id":"W2592326766","doi":"10.1090/s0025-5718-2011-02452-x","title":"An amortized-complexity method to compute the Riemann zeta function","year":2011,"lang":"en","type":"article","venue":"Mathematics of Computation","topic":"Analytic Number Theory Research","field":"Mathematics","cited_by":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"National Science Foundation","keywords":"Mathematics; Riemann zeta function; Riemann hypothesis; Simple (philosophy); Function (biology); Combinatorics; Interval (graph theory); Space (punctuation); Amortized analysis; Algorithm; Discrete mathematics; Pure mathematics; Data structure; Computer science","score_opus":0.23119505997900397,"score_gpt":0.42552386262857933,"score_spread":0.19432880264957536,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2592326766","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11308509,0.0000054113216,0.8784509,0.00010393028,0.000080840146,0.0006476113,0.000005949255,0.000120801385,0.0074995146],"genre_scores_gemma":[0.45741743,2.981824e-7,0.5423173,0.00005693919,0.000045436736,0.000017868426,0.000006427993,0.000030969466,0.00010734823],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99759156,0.00042670604,0.00074302376,0.0002844318,0.00066471455,0.00028954228],"domain_scores_gemma":[0.99729353,0.0010026948,0.0004134685,0.00069986045,0.00044773277,0.00014273055],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0030439585,0.00021304679,0.00044663428,0.00017027867,0.00017162257,0.000050302355,0.00055964536,0.000075187614,0.00021203596],"category_scores_gemma":[0.0002673632,0.0001569597,0.00013356289,0.00044815455,0.00014995474,0.00018655777,0.00014203711,0.00019056787,0.000117976284],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00011131112,0.000788871,0.00009228605,0.0003175356,0.00016914083,0.0000026420603,0.011987178,0.00049666705,0.0007528402,0.97733784,0.0010088338,0.0069348416],"study_design_scores_gemma":[0.00026104623,0.00023308162,0.0010141594,0.00004906541,0.00011496748,0.000012853678,0.0009583843,0.12905027,0.0014129754,0.8667032,0.00003753529,0.00015242769],"about_ca_topic_score_codex":0.000051623218,"about_ca_topic_score_gemma":0.000026395079,"teacher_disagreement_score":0.34433234,"about_ca_system_score_codex":0.00004372586,"about_ca_system_score_gemma":0.00004513169,"threshold_uncertainty_score":0.64006305},"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,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_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","score_opus":0.08729605179255123,"score_gpt":0.373097258113363,"score_spread":0.28580120632081174,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2594047390","genre_codex":"methods","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0024739013,0.00051685894,0.9226418,0.0029488124,0.008775034,0.009893534,0.0008104833,0.00020730808,0.05173224],"genre_scores_gemma":[0.1319737,0.000116500116,0.084396705,0.00015869057,0.0015308972,0.0012300734,0.0020924553,0.00064934016,0.77785164],"study_design_codex":"not_applicable","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99644333,0.00012744585,0.001290684,0.0005103,0.0011277744,0.0005004437],"domain_scores_gemma":[0.99407846,0.002325698,0.0015422394,0.0009434313,0.0009310003,0.00017917015],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.002173548,0.0005246459,0.0011046553,0.00032582914,0.00069445703,0.00034235275,0.0008683117,0.0004892955,0.00015552194],"category_scores_gemma":[0.0022186448,0.00041371497,0.00027309376,0.00020757908,0.0004735888,0.00016854868,0.00027684326,0.0007120537,0.00008450185],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000037417358,0.00033660204,0.00001072652,0.007002454,0.0007588778,0.0000058590695,0.0047438703,0.00039483444,0.00005185931,0.12080954,0.8652895,0.000558463],"study_design_scores_gemma":[0.0007613496,0.00022544776,0.0000967409,0.0014725225,0.0005087046,0.000048637397,0.00057720434,0.15832795,0.00004519683,0.833043,0.0044738716,0.00041938486],"about_ca_topic_score_codex":0.000032325894,"about_ca_topic_score_gemma":0.00010693914,"teacher_disagreement_score":0.86081564,"about_ca_system_score_codex":0.000145335,"about_ca_system_score_gemma":0.00053352705,"threshold_uncertainty_score":0.9998315},"labels":[],"label_agreement":null},{"id":"W2611888257","doi":"10.1090/mcom/3363","title":"Computing isomorphisms and embeddings of finite fields","year":2018,"lang":"en","type":"article","venue":"Mathematics of Computation","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Finite field; Isomorphism (crystallography); Embedding; Factorization; Mathematics; Field (mathematics); Polynomial; Algebra over a field; Code (set theory); Discrete mathematics; Combinatorics; Pure mathematics; Algorithm; Computer science; Programming language; Mathematical analysis","score_opus":0.014111342457953875,"score_gpt":0.2583754253024896,"score_spread":0.2442640828445357,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2611888257","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3179711,0.000015280564,0.68098706,0.00005058173,0.00005921033,0.00004486099,4.6603444e-7,0.000028474144,0.0008429981],"genre_scores_gemma":[0.7381548,0.0000012055175,0.26179558,0.000025289619,0.000015269401,3.4780285e-7,4.603422e-7,0.0000027627214,0.00000423882],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993777,0.000024211447,0.00026789506,0.00011226746,0.0001361226,0.00008176953],"domain_scores_gemma":[0.99905866,0.00038891673,0.000229939,0.00015535919,0.00014323779,0.000023857227],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00033034474,0.00006740199,0.00015510374,0.000114364455,0.000053116968,0.000025914083,0.00020883075,0.000034093653,0.000004422138],"category_scores_gemma":[0.000055671288,0.00006509098,0.000037791233,0.00024065583,0.000116414456,0.00011458999,0.0001226241,0.000039346116,0.0000025275303],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009814887,0.00016905932,0.0003375843,0.000379411,0.000042300533,0.000001029336,0.02143487,0.0013587917,0.0025645366,0.9176411,0.00017299571,0.05588852],"study_design_scores_gemma":[0.0001598035,0.0001959555,0.00034507486,0.000106327796,0.000007447226,0.000004896597,0.00009068252,0.64328796,0.0069691343,0.348748,0.000014397471,0.000070346105],"about_ca_topic_score_codex":0.0000022275112,"about_ca_topic_score_gemma":4.4258525e-7,"teacher_disagreement_score":0.64192915,"about_ca_system_score_codex":0.0000024704184,"about_ca_system_score_gemma":0.000009626631,"threshold_uncertainty_score":0.2654333},"labels":[],"label_agreement":null},{"id":"W2736594816","doi":"10.1090/mcom/3452","title":"Average liar count for degree-2 Frobenius pseudoprimes","year":2019,"lang":"en","type":"article","venue":"Mathematics of Computation","topic":"Analytic Number Theory Research","field":"Mathematics","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Lethbridge","funders":"Pacific Institute for the Mathematical Sciences","keywords":"Mathematics; Degree (music); Quadratic equation; Combinatorics; Symbol (formal); Discrete mathematics; Pure mathematics; Geometry","score_opus":0.07355867130509657,"score_gpt":0.356712985947532,"score_spread":0.2831543146424354,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2736594816","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4131696,0.000020280717,0.5784842,0.00006475198,0.00009146492,0.0008938863,0.00001627514,0.000063345484,0.007196249],"genre_scores_gemma":[0.7545648,0.0000024734031,0.2437157,0.000015959595,0.000038537262,0.000022564203,0.000013975135,0.000044327237,0.0015816169],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9983983,0.000048606445,0.00057966704,0.00021013248,0.00051005336,0.0002532537],"domain_scores_gemma":[0.9967427,0.0020764922,0.00035886499,0.00036892248,0.0003929741,0.00006002731],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010150411,0.00017198225,0.00045914692,0.00013519303,0.00005148092,0.000037809867,0.0002676799,0.00009139276,0.00019268034],"category_scores_gemma":[0.00044544245,0.00015634927,0.00015936865,0.00015656925,0.000054905704,0.0001132238,0.000071610615,0.0001051809,0.00017616447],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00011516824,0.0008238866,0.00039382864,0.0046952926,0.00031406086,0.0000027427923,0.004090463,0.0027065028,0.0036903033,0.972873,0.0050837444,0.0052110516],"study_design_scores_gemma":[0.0007563928,0.00010951309,0.00004538595,0.0001339611,0.000043535085,0.0000068793133,0.00029538528,0.18740778,0.002831713,0.80812645,0.00009349317,0.00014949487],"about_ca_topic_score_codex":0.0000053160984,"about_ca_topic_score_gemma":0.0000022175216,"teacher_disagreement_score":0.34139526,"about_ca_system_score_codex":0.00006329719,"about_ca_system_score_gemma":0.000071832896,"threshold_uncertainty_score":0.6375738},"labels":[],"label_agreement":null},{"id":"W2741560340","doi":"10.1090/mcom/3266","title":"𝐻¹-Superconvergence of a difference finite element method based on the 𝑃₁-𝑃₁-conforming element on non-uniform meshes for the 3D Poisson equation","year":2017,"lang":"en","type":"article","venue":"Mathematics of Computation","topic":"Advanced Numerical Methods in Computational Mathematics","field":"Engineering","cited_by":17,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"Program for New Century Excellent Talents in University; National Natural Science Foundation of China","keywords":"Algorithm; Computer science; Mathematics; Artificial intelligence","score_opus":0.07077261252831205,"score_gpt":0.3507200611860921,"score_spread":0.2799474486577801,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2741560340","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009031131,0.0000125798115,0.98873514,0.00035300723,0.00022139828,0.0010962393,0.000024233812,0.00004210564,0.0004841489],"genre_scores_gemma":[0.44499955,0.0000073266715,0.554778,0.00004307129,0.000025594822,0.000107734624,0.0000066052444,0.000023115655,0.0000090310605],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982441,0.000050798735,0.00076244405,0.00016556111,0.0005712693,0.0002058473],"domain_scores_gemma":[0.988901,0.009638415,0.0006218183,0.0005643816,0.00023969926,0.000034658602],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013507912,0.00023621554,0.00036111253,0.000078103905,0.00028529993,0.000054156524,0.0005229561,0.000056841476,0.000019235811],"category_scores_gemma":[0.0015184296,0.00015445774,0.0001259405,0.000107893815,0.00008024091,0.00011061398,0.000056693425,0.0001421719,0.0000046623136],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000028655728,0.00009583853,0.0000065169024,0.0005947058,0.000052901283,1.1655199e-7,0.0010758339,0.9294008,0.00047628692,0.026192805,0.000022730945,0.042052787],"study_design_scores_gemma":[0.00031675515,0.00019571629,0.00013450105,0.0003335033,0.000050908202,3.3724368e-7,0.00025311124,0.8584667,0.019657413,0.12043251,0.000023367757,0.00013517705],"about_ca_topic_score_codex":0.0000046058203,"about_ca_topic_score_gemma":0.000001274643,"teacher_disagreement_score":0.4359684,"about_ca_system_score_codex":0.000078395715,"about_ca_system_score_gemma":0.00002851149,"threshold_uncertainty_score":0.62986034},"labels":[],"label_agreement":null},{"id":"W2774833929","doi":"10.1090/mcom/3347","title":"A fast and stable test to check if a weakly diagonally dominant matrix is a nonsingular M-matrix","year":2017,"lang":"en","type":"article","venue":"Mathematics of Computation","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":22,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"University of Waterloo","keywords":"Mathematics; Diagonally dominant matrix; Invertible matrix; Matrix (chemical analysis); Combinatorics; Involutory matrix; Matrix splitting; Pure mathematics; Diagonal matrix; Square matrix; Symmetric matrix; Diagonal; Geometry; Physics","score_opus":0.012328509168133423,"score_gpt":0.28892491946286514,"score_spread":0.2765964102947317,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2774833929","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.16285834,0.00005785387,0.8351169,0.0009039466,0.00010511192,0.00033506763,0.000015312133,0.00004763596,0.00055979483],"genre_scores_gemma":[0.59542376,0.0000055497235,0.40403655,0.000038958002,0.00003536275,0.0000087901735,0.0000013089116,0.000012167582,0.00043756262],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986189,0.000029631587,0.00043550544,0.00031246385,0.00035823288,0.00024524194],"domain_scores_gemma":[0.99820065,0.00034174442,0.00045998124,0.0006707602,0.00019945842,0.00012740893],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006898607,0.00018848853,0.00035588717,0.0001442565,0.00033232506,0.0005336351,0.00074134616,0.00006042082,0.000009793403],"category_scores_gemma":[0.0003278946,0.00017307824,0.00007065234,0.00014492737,0.00007840369,0.00050712336,0.0004545002,0.000084685955,0.000052205833],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00011297681,0.0029599182,0.0013422173,0.0043889554,0.00032468568,0.00017285303,0.0951661,0.0108073745,0.08710345,0.62421197,0.0038806356,0.16952889],"study_design_scores_gemma":[0.0007014342,0.00025266947,0.0015642358,0.0003530908,0.000036454447,0.000062437255,0.00019490987,0.81841916,0.013745711,0.16392891,0.00037388297,0.0003670876],"about_ca_topic_score_codex":0.00001939688,"about_ca_topic_score_gemma":0.0000021973112,"teacher_disagreement_score":0.8076118,"about_ca_system_score_codex":0.000021922071,"about_ca_system_score_gemma":0.00006831247,"threshold_uncertainty_score":0.70579255},"labels":[],"label_agreement":null},{"id":"W2784655364","doi":"10.1090/mcom/3340","title":"Corrigendum to New bounds for $\\psi (x)$","year":2018,"lang":"en","type":"erratum","venue":"Mathematics of Computation","topic":"Analytic Number Theory Research","field":"Mathematics","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Lethbridge","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mistake; Mathematics; Discrete mathematics; Applied mathematics; Combinatorics; Law; Political science","score_opus":0.12414780583066089,"score_gpt":0.40059441187184996,"score_spread":0.2764466060411891,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2784655364","genre_codex":"methods","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00028471308,0.00006194522,0.94825774,0.0002614736,0.009255831,0.0018984438,0.00009948598,0.00013039418,0.03974999],"genre_scores_gemma":[0.00022164539,0.0000059743306,0.41827,0.00005838532,0.001774503,0.00006407583,0.00023139438,0.0001928987,0.57918113],"study_design_codex":"not_applicable","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99679023,0.00006939411,0.0011503729,0.0004596494,0.0010233219,0.0005070257],"domain_scores_gemma":[0.9961779,0.00089803425,0.0008883934,0.00074899726,0.0010170671,0.0002695996],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0012639384,0.00044680652,0.0011078966,0.00046807018,0.00012014299,0.00011388283,0.0007516371,0.00046913687,0.00029055733],"category_scores_gemma":[0.002218479,0.0004336761,0.00034131878,0.0004149628,0.00012478685,0.00008270789,0.00022226833,0.00035739984,0.0002619719],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000034553348,0.00018214513,7.384545e-7,0.0026328517,0.00018995188,0.0000012358544,0.0023054234,0.000009554012,0.000019768047,0.052838683,0.9402307,0.0015543381],"study_design_scores_gemma":[0.0004263722,0.00035576546,0.0000014784724,0.00084805704,0.00023418231,0.000007840264,0.00023964932,0.015915852,0.00017671719,0.8613077,0.12010616,0.0003802476],"about_ca_topic_score_codex":0.000022111877,"about_ca_topic_score_gemma":0.000037627287,"teacher_disagreement_score":0.8201246,"about_ca_system_score_codex":0.00018828097,"about_ca_system_score_gemma":0.000709318,"threshold_uncertainty_score":0.99981153},"labels":[],"label_agreement":null},{"id":"W2795263387","doi":"10.1090/s0025-5718-06-01789-3","title":"General order multivariate Padé approximants for pseudo-multivariate functions","year":2006,"lang":"en","type":"article","venue":"Mathematics of Computation","topic":"Mathematical functions and polynomials","field":"Mathematics","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"St. Francis Xavier University","funders":"Vlaamse regering; Natural Sciences and Engineering Research Council of Canada; Fonds Wetenschappelijk Onderzoek; National Natural Science Foundation of China","keywords":"Multivariate statistics; Algorithm; Mathematics; Statistics","score_opus":0.04984048141934707,"score_gpt":0.32816098384822023,"score_spread":0.2783205024288732,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2795263387","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12848763,0.000015200817,0.86537623,0.00013128365,0.00033475942,0.0011115922,0.000088399014,0.00016124689,0.004293665],"genre_scores_gemma":[0.21798047,9.488556e-7,0.77804744,0.00002002105,0.00026654973,0.00018223135,0.000097226606,0.00007041041,0.003334682],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99775755,0.00006851331,0.0011700192,0.00030566702,0.00034795853,0.00035026524],"domain_scores_gemma":[0.99665374,0.001754093,0.0006320343,0.00036906038,0.00051926705,0.00007180007],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0007069276,0.00030215716,0.00062199205,0.0001964834,0.00020543834,0.00006671084,0.00017575009,0.00015977578,0.00012893762],"category_scores_gemma":[0.0006779867,0.00026253366,0.00022266607,0.00033238681,0.000072453855,0.00015424637,0.00005607349,0.00011070594,0.000047717243],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000082678016,0.002502452,0.000044619585,0.0021289769,0.00022415187,0.0000012386934,0.0010741415,0.0062168706,0.014690404,0.95376724,0.016713982,0.002553223],"study_design_scores_gemma":[0.0011942438,0.0000914487,0.000113855,0.000098515266,0.00016040634,0.000007856217,0.00011405916,0.34387064,0.001977304,0.6516663,0.00044699083,0.000258388],"about_ca_topic_score_codex":0.00007302507,"about_ca_topic_score_gemma":0.000014102902,"teacher_disagreement_score":0.33765376,"about_ca_system_score_codex":0.000047827347,"about_ca_system_score_gemma":0.000057317386,"threshold_uncertainty_score":0.9999827},"labels":[],"label_agreement":null},{"id":"W2796018189","doi":"10.1090/mcom/3350","title":"The Lind-Lehmer constant for certain 𝑝-groups","year":2018,"lang":"en","type":"article","venue":"Mathematics of Computation","topic":"Finite Group Theory Research","field":"Mathematics","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Simon Fraser University; Simons Foundation","keywords":"Mathematics; Constant (computer programming); Measure (data warehouse); Congruence relation; Combinatorics; Group (periodic table); Order (exchange); Discrete mathematics","score_opus":0.09506229492641458,"score_gpt":0.39136426235381017,"score_spread":0.29630196742739556,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2796018189","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2142761,0.000045746932,0.775563,0.00043237707,0.00030797653,0.0013102532,0.000023991372,0.00009259453,0.007947958],"genre_scores_gemma":[0.83312804,0.0000044318863,0.16599615,0.000025863485,0.00019771405,0.00006826341,0.000008693443,0.000047836467,0.0005229975],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9984402,0.000095235184,0.0005981978,0.00016024672,0.0004107526,0.00029537032],"domain_scores_gemma":[0.99185807,0.0064212,0.00034102565,0.00035826786,0.00097016175,0.000051307332],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020027542,0.00014421962,0.0002685995,0.00009082671,0.00028743714,0.0000654329,0.00031905447,0.000075930555,0.000028262475],"category_scores_gemma":[0.002799579,0.000101315694,0.00010852511,0.00020684091,0.00041276822,0.00006852798,0.00007839641,0.00009830149,0.000043991455],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000084591906,0.00018147592,0.000013106517,0.00039831505,0.00007071003,4.2447954e-7,0.0030175953,0.000016669179,0.0010329684,0.98489857,0.005053043,0.0052325614],"study_design_scores_gemma":[0.0005008529,0.00025697268,0.000011669128,0.00008058833,0.000031026746,0.0000040629643,0.0010560113,0.07407996,0.004311721,0.918932,0.0006247695,0.00011034862],"about_ca_topic_score_codex":0.0000015263257,"about_ca_topic_score_gemma":0.000011427792,"teacher_disagreement_score":0.61885196,"about_ca_system_score_codex":0.000038005473,"about_ca_system_score_gemma":0.00006200721,"threshold_uncertainty_score":0.4131534},"labels":[],"label_agreement":null},{"id":"W2800393443","doi":"10.1090/mcom/3370","title":"Computing elliptic curves over ℚ","year":2018,"lang":"en","type":"article","venue":"Mathematics of Computation","topic":"Algebraic Geometry and Number Theory","field":"Mathematics","cited_by":10,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"Natural Sciences and Engineering Research Council of Canada; Pacific Institute for the Mathematical Sciences","keywords":"Mathematics; Conductor; Elliptic curve; Prime (order theory); Discrete mathematics; Applied mathematics; Algorithm; Algebra over a field; Pure mathematics; Combinatorics; Geometry","score_opus":0.0359492518484171,"score_gpt":0.33002380298980205,"score_spread":0.2940745511413849,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2800393443","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6280159,0.000080146674,0.36350662,0.00005100547,0.00014183014,0.00018072006,0.000001930229,0.000089519,0.007932353],"genre_scores_gemma":[0.9004434,0.000005872888,0.09914865,0.00008278235,0.00012272828,0.0000016890588,0.000004000085,0.000023274652,0.00016760147],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987797,0.000057381956,0.0005182653,0.0001466862,0.0003236337,0.00017431103],"domain_scores_gemma":[0.9981773,0.0009425966,0.00038653723,0.00023256332,0.0002170041,0.00004402096],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007393346,0.00013959841,0.0003063312,0.00010378606,0.00008419159,0.000015236845,0.00016925279,0.000057044886,0.00020704958],"category_scores_gemma":[0.00045850154,0.00012955023,0.00008100522,0.00028344302,0.00015033566,0.00009556507,0.00006934488,0.000080873324,0.00008757065],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000032119813,0.0010279298,0.00060577755,0.0070768953,0.00023875873,0.000004156311,0.009306098,0.00010884282,0.0017900196,0.959186,0.013098859,0.0075244997],"study_design_scores_gemma":[0.0003143553,0.00011399809,0.0005041563,0.00083770964,0.00006918321,0.000014826971,0.00025565558,0.031923167,0.0067253453,0.95901275,0.000050851304,0.00017800592],"about_ca_topic_score_codex":0.0000020008208,"about_ca_topic_score_gemma":7.032743e-7,"teacher_disagreement_score":0.2724275,"about_ca_system_score_codex":0.00001725861,"about_ca_system_score_gemma":0.000020800511,"threshold_uncertainty_score":0.5282905},"labels":[],"label_agreement":null},{"id":"W2948740048","doi":"10.1090/mcom/3463","title":"Euler’s function on products of primes in a fixed arithmetic progression","year":2019,"lang":"en","type":"article","venue":"Mathematics of Computation","topic":"Analytic Number Theory Research","field":"Mathematics","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Lethbridge","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Combinatorics; Riemann hypothesis; Product (mathematics); Class number; Arithmetic function; Discrete mathematics; Mathematical analysis; Quadratic equation; Geometry","score_opus":0.04849462916465301,"score_gpt":0.3577203135636014,"score_spread":0.3092256843989484,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2948740048","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9752019,0.000020671538,0.019500148,0.00009164033,0.00009065554,0.00095071644,0.0000019916035,0.000035202116,0.0041070613],"genre_scores_gemma":[0.9496942,0.0000015472805,0.04990068,0.0000040284176,0.000016091486,0.00001483432,0.00000677218,0.00002611048,0.00033569385],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9982423,0.000117371776,0.00063977053,0.0002065404,0.0006234207,0.00017056827],"domain_scores_gemma":[0.99785906,0.0010335877,0.0004607832,0.0003343209,0.0002832718,0.000028957124],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00111802,0.00013697706,0.00041479518,0.00031560054,0.000016228567,0.000011507965,0.00015159043,0.00007343162,0.00005410786],"category_scores_gemma":[0.00084712246,0.000115586605,0.00005918752,0.0004457616,0.00005947182,0.000090212794,0.000056096458,0.00013953558,0.0000531055],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0009776555,0.00821416,0.0076072128,0.020625759,0.00032547384,0.000007901173,0.011781641,0.0052104793,0.04379011,0.87133133,0.0011738879,0.028954364],"study_design_scores_gemma":[0.0015074013,0.0008717526,0.0028258273,0.0017443299,0.000060248796,0.000005185009,0.0006786656,0.08830227,0.03930863,0.86445594,0.000017915516,0.00022180777],"about_ca_topic_score_codex":0.000003387679,"about_ca_topic_score_gemma":0.0000013469567,"teacher_disagreement_score":0.08309179,"about_ca_system_score_codex":0.000050084236,"about_ca_system_score_gemma":0.00006923074,"threshold_uncertainty_score":0.4713485},"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,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_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","score_opus":0.037656100488382985,"score_gpt":0.31986354648086013,"score_spread":0.28220744599247716,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2963347434","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008607685,0.00002706494,0.9902259,0.00021348395,0.0002215075,0.00027443666,0.000002503995,0.00006989096,0.00035750537],"genre_scores_gemma":[0.24192892,3.980913e-7,0.75788146,0.00007081512,0.000052017545,0.000012010894,0.000019228597,0.000008769156,0.000026377911],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990896,0.00007907146,0.0003285048,0.00011423368,0.00023182624,0.00015673999],"domain_scores_gemma":[0.998697,0.00050784677,0.00026222088,0.00020461959,0.00028586778,0.000042433505],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00078497786,0.0000921368,0.0001577231,0.00012752024,0.00006897089,0.000078815436,0.00018995926,0.000053860884,0.0000035689623],"category_scores_gemma":[0.00029501304,0.000090010006,0.000059283284,0.00021666633,0.00002270575,0.00066446216,0.000027322776,0.000039367613,0.00000936085],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000141609,0.0027718192,0.00018134971,0.0032520944,0.000112156325,0.0000027495942,0.0258018,0.04366364,0.25484562,0.49651852,0.011435349,0.16127329],"study_design_scores_gemma":[0.0004698491,0.00006657373,0.00019071868,0.000037821606,0.000013512357,0.0000019111067,0.000022672604,0.90155524,0.057520352,0.039873637,0.00014346166,0.00010427788],"about_ca_topic_score_codex":0.0000014054564,"about_ca_topic_score_gemma":1.2966666e-7,"teacher_disagreement_score":0.85789156,"about_ca_system_score_codex":0.000025283542,"about_ca_system_score_gemma":0.000037109636,"threshold_uncertainty_score":0.36705017},"labels":[],"label_agreement":null},{"id":"W2964241805","doi":"10.1090/mcom/3155","title":"Half-space kinetic equations with general boundary conditions","year":2016,"lang":"en","type":"article","venue":"Mathematics of Computation","topic":"Gas Dynamics and Kinetic Theory","field":"Mathematics","cited_by":25,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"Natural Sciences and Engineering Research Council of Canada; Alfred P. Sloan Foundation; National Science Foundation","keywords":"Mathematics; Space (punctuation); Mathematical analysis; Boundary value problem; Boundary (topology); Work (physics); Physics","score_opus":0.021485454290642463,"score_gpt":0.28729029755748936,"score_spread":0.2658048432668469,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2964241805","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3505446,0.000010017752,0.64605373,0.0005234716,0.00004852872,0.00022688763,0.00001935618,0.00006180859,0.002511572],"genre_scores_gemma":[0.78999007,0.000002743721,0.20924105,0.000014196198,0.000030911626,0.000021376354,0.00001226185,0.000030498428,0.0006568758],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988889,0.000048544534,0.00041773566,0.0001596294,0.00030719835,0.00017795376],"domain_scores_gemma":[0.9979904,0.0011006268,0.00033421084,0.00027646538,0.00024281631,0.000055427387],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00025599546,0.00015767128,0.00026355425,0.00013544102,0.00008770055,0.00002980406,0.00013403661,0.00005583204,0.00007619201],"category_scores_gemma":[0.00023892289,0.00010452191,0.000065170105,0.00016092008,0.0001738558,0.00009425434,0.0000343439,0.000053870157,0.000024514053],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008695013,0.0002411305,0.00003654059,0.00014950277,0.000055270855,0.0000020808507,0.00060980057,0.0006080408,0.0051745833,0.99197066,0.00033052315,0.00081315293],"study_design_scores_gemma":[0.0007694115,0.0001511193,0.00031513258,0.00026336656,0.00008950822,0.000020042036,0.00011397732,0.033890687,0.0012508311,0.9628818,0.00007984975,0.0001742753],"about_ca_topic_score_codex":0.0000054615266,"about_ca_topic_score_gemma":0.000014807668,"teacher_disagreement_score":0.4394455,"about_ca_system_score_codex":0.000040129788,"about_ca_system_score_gemma":0.00006101065,"threshold_uncertainty_score":0.426228},"labels":[],"label_agreement":null},{"id":"W2974252555","doi":"10.1090/mcom/3567","title":"Unconditional convergence for discretizations of dynamical optimal transport","year":2020,"lang":"en","type":"article","venue":"Mathematics of Computation","topic":"Geometric Analysis and Curvature Flows","field":"Mathematics","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"Agence Nationale de la Recherche","keywords":"Convergence (economics); Applied mathematics; Mathematical optimization; Mathematics; Mathematical economics; Computer science; Statistical physics; Economics; Physics; Macroeconomics","score_opus":0.04754930740213794,"score_gpt":0.31086554453952897,"score_spread":0.26331623713739105,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2974252555","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.21211603,0.000008510955,0.78706336,0.00027238057,0.000023110939,0.00021230131,0.000114616836,0.000018115852,0.00017155732],"genre_scores_gemma":[0.71588165,0.0000011329489,0.28385323,0.0000137344,0.000019868316,0.000009620686,0.00019488721,0.000009981515,0.000015894911],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998882,0.0000128903375,0.00059277663,0.00012205153,0.00030248362,0.00008782036],"domain_scores_gemma":[0.9987278,0.000434302,0.00037416903,0.000086432774,0.00032486027,0.000052418978],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00016584276,0.00009667683,0.00034341466,0.00007978398,0.000031333246,0.0000054127763,0.000117909876,0.00005385194,0.00009277451],"category_scores_gemma":[0.00035471783,0.00008793003,0.0001738872,0.00042118985,0.000053910557,0.000075126954,0.000012109812,0.00004714322,0.000002162452],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005398331,0.0008292337,0.0008477449,0.0028212548,0.00035876324,8.9652036e-7,0.0049271914,0.066951,0.0016903752,0.91878057,0.0022300165,0.0005089785],"study_design_scores_gemma":[0.00051818934,0.00014906705,0.00062332954,0.000056921606,0.00025655693,0.000001269581,0.00060721213,0.80556077,0.001213617,0.1908398,0.00004230886,0.000130995],"about_ca_topic_score_codex":0.0000011104,"about_ca_topic_score_gemma":0.000001225208,"teacher_disagreement_score":0.73860973,"about_ca_system_score_codex":0.000008721384,"about_ca_system_score_gemma":0.000039879385,"threshold_uncertainty_score":0.35856822},"labels":[],"label_agreement":null},{"id":"W3004060250","doi":"10.1090/mcom/3523","title":"Generalized matrix spectral factorization and quasi-tight framelets with a minimum number of generators","year":2020,"lang":"en","type":"article","venue":"Mathematics of Computation","topic":"Mathematical Analysis and Transform Methods","field":"Mathematics","cited_by":11,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Factorization; Mathematics; Algorithm; Orthonormal basis; Matrix (chemical analysis); Algebra over a field; Pure mathematics; Physics; Quantum mechanics; Chemistry","score_opus":0.040490394891558125,"score_gpt":0.3429724594525047,"score_spread":0.30248206456094656,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3004060250","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.47648662,0.00001716128,0.522807,0.00015019743,0.000010332268,0.00019378301,0.000007614317,0.00002780149,0.0002994456],"genre_scores_gemma":[0.54602015,0.000007677955,0.4538897,0.000012915279,0.000024497136,0.0000048301004,0.0000075322823,0.000020648524,0.000012030247],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9982271,0.000091694754,0.00084352493,0.0002129946,0.0004644389,0.00016023101],"domain_scores_gemma":[0.99848944,0.0004963549,0.0005287952,0.0001581996,0.00021143495,0.00011576037],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00031989822,0.0002198242,0.0007494363,0.000071520044,0.00004186714,0.000028733435,0.00011252876,0.0000932295,0.000111445865],"category_scores_gemma":[0.00020162758,0.00016296442,0.00011808087,0.00035971354,0.00008687111,0.00011091259,0.000025251735,0.00009639408,0.0000037810614],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010623045,0.0009454945,0.0010724819,0.0062867776,0.00051409315,0.0000052728033,0.013289253,0.000550928,0.0116487425,0.9638323,0.00014433643,0.0016040566],"study_design_scores_gemma":[0.0013010271,0.00031344942,0.000104545186,0.00020016513,0.00040368328,0.000015250947,0.00037985304,0.23151383,0.041905884,0.72352946,0.00001647817,0.00031636504],"about_ca_topic_score_codex":0.000004929186,"about_ca_topic_score_gemma":0.000002107175,"teacher_disagreement_score":0.24030286,"about_ca_system_score_codex":0.000011375591,"about_ca_system_score_gemma":0.000031509324,"threshold_uncertainty_score":0.6645496},"labels":[],"label_agreement":null},{"id":"W3008597081","doi":"10.1090/s0025-5718-04-01666-7","title":"Solutions of the congruence 𝑎^{𝑝-1}≡1 (mod 𝑝^{𝑟})","year":2004,"lang":"lv","type":"article","venue":"Mathematics of Computation","topic":"Analytic Number Theory Research","field":"Mathematics","cited_by":25,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Dalhousie University","funders":"Killam Trusts","keywords":"Algorithm; Artificial intelligence; Computer science","score_opus":0.06264474387472051,"score_gpt":0.33791722603719854,"score_spread":0.275272482162478,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3008597081","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.44366118,0.00018929775,0.54693586,0.00093605695,0.00028205206,0.0010785345,0.00006866734,0.00004070526,0.0068076644],"genre_scores_gemma":[0.95296484,0.000013904447,0.046450477,0.000015805861,0.000039767303,0.000009787003,0.000004418207,0.000044748387,0.00045624355],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9967208,0.00018214743,0.0013119045,0.00024400742,0.0011315279,0.0004096368],"domain_scores_gemma":[0.99585116,0.0012259795,0.0012249347,0.0007975905,0.0008110337,0.00008930526],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014882123,0.00026510007,0.00065630063,0.00016337431,0.00020122067,0.000037099,0.0007718466,0.00016690935,0.00009089065],"category_scores_gemma":[0.0013600372,0.00020958949,0.0003412897,0.00073772087,0.00080984255,0.00014469218,0.0003715489,0.00031238995,0.0000812822],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000017914317,0.0013716526,0.00007315798,0.0028748515,0.00025752265,0.0000020095815,0.0089966385,0.015512465,0.0028872802,0.9671506,0.0002784988,0.00057736674],"study_design_scores_gemma":[0.00093934004,0.00010959405,0.00025356098,0.001387463,0.00027720895,0.00002295861,0.0018825082,0.03836057,0.010272534,0.9462957,0.000010292876,0.00018829417],"about_ca_topic_score_codex":0.00008103993,"about_ca_topic_score_gemma":0.00003121155,"teacher_disagreement_score":0.5093037,"about_ca_system_score_codex":0.00018009687,"about_ca_system_score_gemma":0.0004999066,"threshold_uncertainty_score":0.85468113},"labels":[],"label_agreement":null},{"id":"W3037248523","doi":"10.1090/mcom/3616","title":"Strengthening the Baillie-PSW primality test","year":2021,"lang":"en","type":"article","venue":"Mathematics of Computation","topic":"Analytic Number Theory Research","field":"Mathematics","cited_by":11,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Lethbridge","funders":"Natural Sciences and Engineering Research Council of Canada; University of Lethbridge","keywords":"Primality test; Fermat's Last Theorem; Prime (order theory); Test (biology); Mathematics; Arithmetic; Discrete mathematics; Computer science; Combinatorics","score_opus":0.07095565971968469,"score_gpt":0.36571318617683957,"score_spread":0.29475752645715486,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3037248523","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5754342,0.00007228427,0.40267956,0.00076119445,0.00007286489,0.00035729515,0.000014949784,0.00009682123,0.02051082],"genre_scores_gemma":[0.88615453,0.0000046341956,0.11281833,0.000025258094,0.000047405523,0.000008873177,0.00000935768,0.00002730052,0.0009043055],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99824935,0.00014786648,0.00061914127,0.00017711033,0.00059991487,0.00020663583],"domain_scores_gemma":[0.99344194,0.0052649095,0.00032482095,0.00045974672,0.00045955257,0.000049002934],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013805658,0.00013461673,0.00030234305,0.000049335427,0.000121170975,0.00005731156,0.0002590476,0.000055816752,0.00016980061],"category_scores_gemma":[0.003433157,0.00009899166,0.00011667922,0.00033498972,0.00013064989,0.000078156736,0.00015003567,0.00017872053,0.000042434083],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000014974199,0.0015302567,0.0011684967,0.0016966031,0.00026137705,0.0000207876,0.012455298,0.00078200176,0.0051078014,0.9652858,0.0033232076,0.008353415],"study_design_scores_gemma":[0.0002961859,0.000031376792,0.00025337297,0.00012828715,0.00007329137,0.00002996267,0.002245096,0.05798909,0.011084631,0.92762846,0.00011389821,0.00012632375],"about_ca_topic_score_codex":0.0000033434758,"about_ca_topic_score_gemma":0.000006542376,"teacher_disagreement_score":0.31072032,"about_ca_system_score_codex":0.00004143065,"about_ca_system_score_gemma":0.00011084512,"threshold_uncertainty_score":0.41100577},"labels":[],"label_agreement":null},{"id":"W3084153986","doi":"10.1090/mcom/3771","title":"Explicit Tamagawa numbers for certain algebraic tori over number fields","year":2022,"lang":"lv","type":"article","venue":"Mathematics of Computation","topic":"Algebraic Geometry and Number Theory","field":"Mathematics","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Algorithm; Artificial intelligence; Computer science","score_opus":0.027095785273676874,"score_gpt":0.30232822127533965,"score_spread":0.27523243600166275,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3084153986","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6377852,0.00013745604,0.3489752,0.000595719,0.0014620798,0.0019287524,0.00025337585,0.00014955897,0.00871263],"genre_scores_gemma":[0.94593644,0.000009856622,0.04870416,0.00024439947,0.00025992413,0.00027257035,0.0001617604,0.00014351249,0.0042673745],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.995996,0.00030246747,0.0015434687,0.0005240934,0.0010262664,0.0006076847],"domain_scores_gemma":[0.9941498,0.0033624277,0.0013484621,0.0006905978,0.00029445114,0.000154246],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0018441787,0.0005198645,0.0009981483,0.00023267076,0.00055301713,0.00008238286,0.00063617784,0.00025090805,0.0034651372],"category_scores_gemma":[0.00060557213,0.0005967763,0.0005373718,0.0007032554,0.00012843424,0.00023257539,0.00041902176,0.00048930035,0.00009448366],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00025227023,0.0024152,0.00018336061,0.0051129106,0.00065288576,0.000011518366,0.027227335,0.0047890334,0.00031768123,0.92311096,0.033271495,0.002655362],"study_design_scores_gemma":[0.0019543828,0.00039018985,0.000046396854,0.00018982783,0.00039819794,0.00005327308,0.008229687,0.052290704,0.0012557356,0.9321697,0.0023754027,0.000646514],"about_ca_topic_score_codex":0.000036606372,"about_ca_topic_score_gemma":0.0000065170807,"teacher_disagreement_score":0.30815125,"about_ca_system_score_codex":0.00023675016,"about_ca_system_score_gemma":0.00015874072,"threshold_uncertainty_score":0.9996484},"labels":[],"label_agreement":null},{"id":"W3129167431","doi":"10.1090/mcom/3665","title":"Counting zeros of Dedekind zeta functions","year":2021,"lang":"lv","type":"preprint","venue":"Mathematics of Computation","topic":"Analytic Number Theory Research","field":"Mathematics","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Lethbridge","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Dedekind cut; Mathematics; Combinatorics; Multiplicity (mathematics); Discriminant; Dirichlet distribution; Algebraic number field; Degree (music); Function (biology); Physics; Mathematical analysis","score_opus":0.07350741827486254,"score_gpt":0.351776083408562,"score_spread":0.2782686651336994,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3129167431","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.42417407,0.000121894096,0.56852555,0.00006924588,0.00031330474,0.00083208963,0.00008043031,0.0000463298,0.005837054],"genre_scores_gemma":[0.85067075,0.00004715454,0.14733534,0.000007980335,0.00011852427,0.00003121805,0.00021777516,0.00012932086,0.001441904],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9935848,0.0004065798,0.0029626759,0.0006535119,0.0018714137,0.0005209814],"domain_scores_gemma":[0.9888888,0.0036638794,0.0033446504,0.0012787604,0.0026724958,0.00015139514],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.003027962,0.00060671545,0.0019707074,0.0005054407,0.00017113204,0.00018015505,0.0007414816,0.0005566899,0.0009322549],"category_scores_gemma":[0.0021574479,0.0006565374,0.0007025731,0.00071635935,0.00043752242,0.00018803349,0.0010871565,0.0008955598,0.00010783016],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003377481,0.01849261,0.0024616877,0.20289478,0.012434751,0.000113641196,0.114639536,0.1524638,0.04299839,0.43031764,0.003581137,0.019264292],"study_design_scores_gemma":[0.0011056297,0.00016511281,0.00019840279,0.0053460184,0.0015664146,0.00005711872,0.015491316,0.45052254,0.012747627,0.5120176,0.000036372192,0.00074582046],"about_ca_topic_score_codex":0.00007995336,"about_ca_topic_score_gemma":0.000017847498,"teacher_disagreement_score":0.4264967,"about_ca_system_score_codex":0.00020065434,"about_ca_system_score_gemma":0.0007124368,"threshold_uncertainty_score":0.99998105},"labels":[],"label_agreement":null},{"id":"W3137264367","doi":"10.1090/mcom/3796","title":"Analysis of an exactly mass conserving space-time hybridized discontinuous Galerkin method for the time-dependent Navier–Stokes equations","year":2022,"lang":"en","type":"article","venue":"Mathematics of Computation","topic":"Advanced Numerical Methods in Computational Mathematics","field":"Engineering","cited_by":16,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Galerkin method; Discontinuous Galerkin method; Navier–Stokes equations; Mathematical analysis; Space (punctuation); Applied mathematics; Finite element method; Physics; Compressibility; Mechanics","score_opus":0.022782805644811322,"score_gpt":0.31915250959226116,"score_spread":0.2963697039474498,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3137264367","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01970506,0.00010464561,0.97880566,0.00008337092,0.00010602854,0.0007055379,0.00017513573,0.0001287616,0.00018577158],"genre_scores_gemma":[0.17531791,0.0000023276546,0.82432157,0.000013569473,0.000019314726,0.00013940367,0.00008258839,0.000049831706,0.00005345901],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99791515,0.00024628144,0.0008831554,0.00019615807,0.000568994,0.0001902408],"domain_scores_gemma":[0.98906255,0.009760617,0.00055771123,0.00035194622,0.00021918322,0.000048018075],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015721901,0.00020271238,0.0006863366,0.0003267089,0.00018155533,0.00003052848,0.00037966674,0.000034915596,0.00010384969],"category_scores_gemma":[0.0005970232,0.00018493322,0.00024618898,0.00084816595,0.00005610896,0.00012795615,0.000090153924,0.00014598784,0.0000035031414],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000014146055,0.00012500375,0.000002827381,0.000213727,0.0006591474,5.343952e-7,0.001040622,0.9750398,0.012945008,0.0024553037,0.000022455433,0.0074814726],"study_design_scores_gemma":[0.00030530035,0.00007872225,0.000024759436,0.000024736055,0.0008717088,0.0000036177612,0.00049162714,0.90551174,0.002785289,0.08971716,0.00001906205,0.0001662636],"about_ca_topic_score_codex":0.0000047902836,"about_ca_topic_score_gemma":9.2031485e-7,"teacher_disagreement_score":0.15561286,"about_ca_system_score_codex":0.00009361483,"about_ca_system_score_gemma":0.000031132313,"threshold_uncertainty_score":0.7541358},"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,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_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","score_opus":0.09665988299223457,"score_gpt":0.38052346599724207,"score_spread":0.28386358300500747,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3137959625","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.040883023,0.000101340775,0.95423776,0.0005311472,0.00013142575,0.00042106645,0.000008236734,0.00004559571,0.003640404],"genre_scores_gemma":[0.8790559,0.00000830706,0.117232546,0.000071712115,0.00013414839,0.000074591786,0.000025341822,0.000047548416,0.0033498972],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.998816,0.00005367392,0.0004165527,0.0001520295,0.00038884583,0.00017289534],"domain_scores_gemma":[0.99584347,0.0030215473,0.00020226414,0.00032383422,0.0005749801,0.00003391661],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001001239,0.00010964638,0.00023574273,0.000050594062,0.00013785467,0.000058360576,0.0001649339,0.000058503443,0.00017758258],"category_scores_gemma":[0.0010701352,0.0000809898,0.00014621655,0.00023398698,0.000079007834,0.00007897409,0.00006544839,0.0000948785,0.00002453917],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000047372214,0.00042619923,0.000044331126,0.0011584829,0.0003075898,0.0000016162412,0.0021761924,0.0006418025,0.0020360404,0.97757757,0.0088715535,0.0067112455],"study_design_scores_gemma":[0.0003867156,0.000043525095,0.000070124865,0.000055778204,0.00013687166,0.000010064309,0.0010457337,0.12372527,0.002823317,0.870945,0.0006738619,0.00008373555],"about_ca_topic_score_codex":0.0000017718103,"about_ca_topic_score_gemma":0.0000051982115,"teacher_disagreement_score":0.8381729,"about_ca_system_score_codex":0.00003590499,"about_ca_system_score_gemma":0.00008814856,"threshold_uncertainty_score":0.3302668},"labels":[],"label_agreement":null},{"id":"W3157206289","doi":"10.1090/mcom/3782","title":"Tropical tangents for complete intersection curves","year":2022,"lang":"en","type":"article","venue":"Mathematics of Computation","topic":"Polynomial and algebraic computation","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Algorithm; Annotation; Artificial intelligence; Type (biology); Computer science; Intersection (aeronautics); Mathematics; Biology","score_opus":0.033607072665031726,"score_gpt":0.2703136146455875,"score_spread":0.2367065419805558,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3157206289","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0657447,0.000059896476,0.93268645,0.00054686546,0.00038805802,0.0003383818,0.000011560709,0.00007592577,0.0001481676],"genre_scores_gemma":[0.91169095,0.0000017890803,0.08797666,0.0001699987,0.000031343585,0.00006666261,0.000026640464,0.0000071800514,0.00002879014],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990859,0.000048660742,0.00031910362,0.00016011672,0.00027362138,0.00011257283],"domain_scores_gemma":[0.99931943,0.00020475315,0.0002298153,0.00013277662,0.00008415164,0.000029093651],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00018753734,0.00007870818,0.00016096339,0.000104184306,0.00014320335,0.000025265497,0.0003201822,0.0000126590485,0.0000113539445],"category_scores_gemma":[0.00003718406,0.00008303931,0.00008273441,0.00021833998,0.000017905633,0.00014465461,0.00018336509,0.000059073824,0.000003284856],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009338555,0.0019447689,0.00027498323,0.0027119678,0.00021067167,0.0000048956704,0.010092919,0.078684084,0.009710345,0.7082818,0.02209527,0.1658949],"study_design_scores_gemma":[0.00042497928,0.00026800236,0.00069606834,0.00004686583,0.000011106133,0.000013326513,0.00006470552,0.8660503,0.0004687026,0.13138281,0.0004677256,0.00010540946],"about_ca_topic_score_codex":0.000003946887,"about_ca_topic_score_gemma":9.519079e-7,"teacher_disagreement_score":0.84594625,"about_ca_system_score_codex":0.00005515118,"about_ca_system_score_gemma":0.00003139072,"threshold_uncertainty_score":0.33862448},"labels":[],"label_agreement":null},{"id":"W3171813169","doi":"10.1090/mcom/3677","title":"Corrigendum to “On two classes of simultaneous Pell equations with no solutions”","year":2021,"lang":"en","type":"erratum","venue":"Mathematics of Computation","topic":"Advanced Differential Equations and Dynamical Systems","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"","keywords":"Mathematical proof; Correctness; Statement (logic); Mathematics; Calculus (dental); Applied mathematics; Algebra over a field; Algorithm; Pure mathematics; Law; Geometry","score_opus":0.06288343629073265,"score_gpt":0.33086064268729837,"score_spread":0.26797720639656575,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3171813169","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0008833749,0.0000606964,0.98218703,0.000050799827,0.0032994486,0.0009423456,0.00018727647,0.00007460501,0.012314439],"genre_scores_gemma":[0.22647014,0.000035502417,0.6778015,0.00005130087,0.0007844814,0.00015222316,0.0017546634,0.00028502717,0.09266515],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9970269,0.00011024448,0.0012552404,0.00037632187,0.0009330092,0.00029829022],"domain_scores_gemma":[0.9943979,0.0020077548,0.0013536845,0.00057236396,0.0015524027,0.00011591378],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00023943235,0.00040187791,0.0010634303,0.0003222805,0.000116718074,0.0000456014,0.0002607678,0.00024645322,0.000079403464],"category_scores_gemma":[0.0017807846,0.00034516834,0.00019931968,0.0005116984,0.000085056854,0.00006612471,0.00009772231,0.0003247159,0.00005990768],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013976858,0.0043896483,0.0000032325438,0.010387017,0.0007506646,0.000025808173,0.0032956826,0.20691125,0.0011690429,0.64169276,0.12620813,0.005027008],"study_design_scores_gemma":[0.000768424,0.0007767757,0.0000026225969,0.0038502908,0.0003999522,0.000008774617,0.00055223773,0.8477093,0.00020193055,0.14259885,0.002532286,0.00059857074],"about_ca_topic_score_codex":0.000029313267,"about_ca_topic_score_gemma":0.00012651415,"teacher_disagreement_score":0.64079803,"about_ca_system_score_codex":0.000132892,"about_ca_system_score_gemma":0.00026901538,"threshold_uncertainty_score":0.99990004},"labels":[],"label_agreement":null},{"id":"W3201983512","doi":"10.1090/mcom/3733","title":"The equilateral small octagon of maximal width","year":2022,"lang":"lv","type":"article","venue":"Mathematics of Computation","topic":"Point processes and geometric inequalities","field":"Mathematics","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal","funders":"Institut de Valorisation des Données","keywords":"Equilateral triangle; Polygon (computer graphics); Combinatorics; Mathematics; Geometry; Computer science","score_opus":0.05596908605898347,"score_gpt":0.2960105221713594,"score_spread":0.24004143611237594,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3201983512","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.85854423,0.0013489424,0.13393563,0.00050471345,0.0007179899,0.00079215394,0.00020926373,0.000052822663,0.0038942506],"genre_scores_gemma":[0.9644062,0.0000559169,0.034199197,0.00002580626,0.0000660198,0.000033483124,0.00003222567,0.00004863457,0.0011325292],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9966396,0.00020124287,0.0016337254,0.00021316414,0.0009347652,0.00037750864],"domain_scores_gemma":[0.9947193,0.0025285285,0.0018351848,0.00042122256,0.00044412623,0.000051588395],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021244595,0.00026815193,0.00064717873,0.000281376,0.00041995847,0.000074030664,0.0005928816,0.00007394476,0.00016113977],"category_scores_gemma":[0.0005938505,0.00022116858,0.00024948205,0.00078440475,0.00017308291,0.00009712921,0.0005233079,0.00028545104,0.00000984164],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002898349,0.002389871,0.00015408453,0.013910115,0.0006436778,0.000010555914,0.045030456,0.016475582,0.000776838,0.8955466,0.0018670283,0.022905342],"study_design_scores_gemma":[0.00079374743,0.000790858,0.000074840995,0.0002189195,0.00021972049,0.00003367308,0.007847311,0.11588866,0.0022337474,0.870991,0.0006197025,0.000287818],"about_ca_topic_score_codex":0.000048347272,"about_ca_topic_score_gemma":0.0000071235127,"teacher_disagreement_score":0.105861954,"about_ca_system_score_codex":0.0000892218,"about_ca_system_score_gemma":0.00016791187,"threshold_uncertainty_score":0.9018993},"labels":[],"label_agreement":null},{"id":"W3203315563","doi":"10.1090/mcom/3868","title":"Polynomial approximation of symmetric functions","year":2023,"lang":"lv","type":"article","venue":"Mathematics of Computation","topic":"Mathematical functions and polynomials","field":"Mathematics","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"Natural Sciences and Engineering Research Council of Canada; Agence Nationale de la Recherche; Engineering and Physical Sciences Research Council; Deutsche Forschungsgemeinschaft","keywords":"Algorithm; Artificial intelligence; Computer science","score_opus":0.054259958756863555,"score_gpt":0.31043293352641016,"score_spread":0.2561729747695466,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3203315563","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6336995,0.00022478923,0.33661756,0.00047326786,0.0019091652,0.0020951745,0.00042588037,0.00041155133,0.024143137],"genre_scores_gemma":[0.9312542,0.000066389286,0.064308204,0.00000951614,0.0002512268,0.000046720994,0.00018544697,0.000113493326,0.0037647833],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99542564,0.0001832256,0.002600279,0.00037191858,0.00095740444,0.00046155826],"domain_scores_gemma":[0.99271053,0.003893844,0.0019332365,0.0006748058,0.0006412271,0.00014635616],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00154138,0.00043187683,0.0012671569,0.0014965982,0.00017645021,0.00006396906,0.00033709753,0.00034487006,0.00036755006],"category_scores_gemma":[0.00208945,0.00042441473,0.00047890973,0.0031841272,0.00021933869,0.00023259864,0.00017975747,0.0002466231,0.0007418926],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00029586398,0.008797413,0.00023911266,0.061487466,0.0022197226,0.000014813257,0.03053639,0.015679648,0.020712964,0.5724385,0.23994869,0.04762946],"study_design_scores_gemma":[0.0021532844,0.00075280905,0.0004389945,0.0018485251,0.0012847309,0.000037372498,0.005348938,0.7334972,0.010087525,0.2428746,0.0008457473,0.0008302464],"about_ca_topic_score_codex":0.00003038004,"about_ca_topic_score_gemma":0.0000040980076,"teacher_disagreement_score":0.71781754,"about_ca_system_score_codex":0.00008630089,"about_ca_system_score_gemma":0.00017708886,"threshold_uncertainty_score":0.99982077},"labels":[],"label_agreement":null},{"id":"W3210852515","doi":"10.1090/mcom/3780","title":"Convergence to weak solutions of a space-time hybridized discontinuous Galerkin method for the incompressible Navier–Stokes equations","year":2022,"lang":"en","type":"article","venue":"Mathematics of Computation","topic":"Advanced Mathematical Modeling in Engineering","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Convergence (economics); Galerkin method; Discontinuous Galerkin method; Space (punctuation); Navier–Stokes equations; Mathematical analysis; Weak convergence; Compressibility; Applied mathematics; Zero (linguistics); Weak solution; Finite element method; Physics","score_opus":0.03211984169937692,"score_gpt":0.3049379885376304,"score_spread":0.27281814683825345,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3210852515","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0014737342,0.00008779204,0.9965475,0.0006124122,0.00017086242,0.0008522906,0.000027721222,0.00009188315,0.00013577855],"genre_scores_gemma":[0.28014147,9.4327714e-7,0.7195257,0.000014426554,0.00001068929,0.00022253295,0.0000037883503,0.000013826682,0.00006663696],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984863,0.00006954502,0.0005961995,0.0002092678,0.00042316507,0.00021556548],"domain_scores_gemma":[0.99604344,0.0029022929,0.00035366774,0.000437871,0.00021374818,0.000048981725],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009767904,0.00013359933,0.000330628,0.00014655452,0.00025726514,0.00002961798,0.0007420238,0.00001894001,0.000012433724],"category_scores_gemma":[0.000513282,0.000116412426,0.00011830639,0.00050431566,0.0000373788,0.00016847241,0.00046925625,0.00010066239,0.0000046324376],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000038291078,0.0001076923,2.920298e-7,0.000121724086,0.000024802404,1.1700036e-7,0.0014339337,0.7855331,0.008635285,0.20221624,0.00011830175,0.0018047094],"study_design_scores_gemma":[0.0002071946,0.000074510426,0.0000040547093,0.000057386173,0.000028196162,0.0000045998113,0.00016785129,0.8549772,0.0024101604,0.14190029,0.00006421101,0.00010434365],"about_ca_topic_score_codex":0.000006705312,"about_ca_topic_score_gemma":7.0315036e-7,"teacher_disagreement_score":0.27866775,"about_ca_system_score_codex":0.0000504303,"about_ca_system_score_gemma":0.000058646736,"threshold_uncertainty_score":0.4747161},"labels":[],"label_agreement":null},{"id":"W3211261172","doi":"10.1090/mcom/3777","title":"Improved computation of fundamental domains for arithmetic Fuchsian groups","year":2022,"lang":"en","type":"article","venue":"Mathematics of Computation","topic":"Algebraic Geometry and Number Theory","field":"Mathematics","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada; National Science Foundation","keywords":"Mathematics; Fuchsian group; Magma; Arithmetic; Computation; Domain (mathematical analysis); Group (periodic table); Algorithm; Algebra over a field; Pure mathematics; Mathematical analysis","score_opus":0.0281181357846104,"score_gpt":0.3001217853968148,"score_spread":0.27200364961220436,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3211261172","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5160486,0.000019955998,0.48279852,0.000042387932,0.00012814,0.0005606366,0.000044026056,0.00003664761,0.0003210848],"genre_scores_gemma":[0.8277901,5.368013e-7,0.17195724,0.00001643547,0.000024847332,0.000070624854,0.00005833078,0.000029885052,0.000052048472],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9983528,0.00010304013,0.0007842315,0.00018325009,0.00039493464,0.00018171972],"domain_scores_gemma":[0.9977216,0.0010890178,0.00081398303,0.00017872082,0.00015444183,0.000042215197],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010172649,0.00016043325,0.00042948715,0.0002196799,0.00017826626,0.000013663665,0.00019244103,0.000038783408,0.000054669385],"category_scores_gemma":[0.00018917001,0.00017193508,0.00017556768,0.0003245845,0.00008502659,0.00008681979,0.000117232776,0.000109457134,0.0000014697066],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00035280836,0.003911573,0.00014478312,0.0060827173,0.00049144845,0.0000032210683,0.018706294,0.009339178,0.0142827025,0.9373099,0.000817351,0.008558008],"study_design_scores_gemma":[0.0012453654,0.0004875834,0.00008114148,0.000047474732,0.00010630981,0.000021823158,0.0042761634,0.13807315,0.0034766733,0.85200804,0.000015478407,0.00016076963],"about_ca_topic_score_codex":0.0000039545157,"about_ca_topic_score_gemma":0.0000011869832,"teacher_disagreement_score":0.31174144,"about_ca_system_score_codex":0.00007602109,"about_ca_system_score_gemma":0.000041348165,"threshold_uncertainty_score":0.7011309},"labels":[],"label_agreement":null},{"id":"W4226102315","doi":"10.1090/mcom/3774","title":"Analysis of the Feshbach–Schur method for the Fourier spectral discretizations of Schrödinger operators","year":2022,"lang":"en","type":"article","venue":"Mathematics of Computation","topic":"Spectral Theory in Mathematical Physics","field":"Mathematics","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Discretization; Mathematics; Eigenvalues and eigenvectors; Fourier transform; Schur complement; Perturbation (astronomy); Applied mathematics; Fourier analysis; Perturbation theory (quantum mechanics); Mathematical analysis; Physics; Quantum mechanics","score_opus":0.040814369474919475,"score_gpt":0.3627439362342552,"score_spread":0.32192956675933576,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4226102315","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.19535683,0.000024856758,0.8025165,0.0002904081,0.000103028826,0.00090241415,0.00011775746,0.000022718194,0.000665445],"genre_scores_gemma":[0.7098858,0.0000011673874,0.2898837,0.000018826393,0.00002179419,0.000079333535,0.000008865771,0.000030960535,0.00006953955],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9976468,0.0002511976,0.0009972883,0.00017647115,0.000747511,0.00018071584],"domain_scores_gemma":[0.99240845,0.005571615,0.0010419377,0.00065053854,0.00029869133,0.00002877722],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018366383,0.00017824586,0.00066436763,0.00019497404,0.00027855104,0.000017800607,0.0006453109,0.00004077942,0.00016183093],"category_scores_gemma":[0.0011006817,0.000114082715,0.00058623793,0.0016702316,0.00017825137,0.00006874294,0.0002075006,0.00017044877,5.0772746e-7],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000017893555,0.00046653862,0.000094377014,0.00037270985,0.0011020445,6.904214e-8,0.0048499396,0.08541155,0.0018845177,0.90526265,0.0001915446,0.00034615945],"study_design_scores_gemma":[0.00018523623,0.000053742515,0.00020074983,0.000028063028,0.0016057508,0.0000010904191,0.0013196425,0.4055865,0.005692147,0.5852323,0.0000109500825,0.000083809646],"about_ca_topic_score_codex":0.0000073650485,"about_ca_topic_score_gemma":0.000005044451,"teacher_disagreement_score":0.514529,"about_ca_system_score_codex":0.000055762328,"about_ca_system_score_gemma":0.00006371124,"threshold_uncertainty_score":0.4652158},"labels":[],"label_agreement":null},{"id":"W4237366199","doi":"10.1090/s0025-5718-05-01766-7","title":"Aurifeuillian factorization","year":2005,"lang":"lv","type":"article","venue":"Mathematics of Computation","topic":"Algebraic Geometry and Number Theory","field":"Mathematics","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Montréal","funders":"Reed College","keywords":"Algorithm; Computer science; Annotation; Artificial intelligence","score_opus":0.026959036119847773,"score_gpt":0.2892758651919291,"score_spread":0.2623168290720813,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4237366199","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.32093194,0.00023821922,0.66678405,0.0004437799,0.00041201754,0.00055998046,0.000034827146,0.0001255841,0.010469588],"genre_scores_gemma":[0.8792021,0.000029374842,0.11889297,0.000041473886,0.00032888592,0.0000070521933,0.000047373105,0.00006556128,0.001385182],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9972231,0.0001365453,0.0013150016,0.0003002713,0.00067767233,0.00034743562],"domain_scores_gemma":[0.996926,0.0010151283,0.0011128115,0.0004475018,0.0003721106,0.0001264518],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00088311377,0.00036579414,0.0006548227,0.00028058875,0.00013654107,0.00006692679,0.0003140022,0.0002769159,0.0005602323],"category_scores_gemma":[0.00056206604,0.00037655488,0.00021573677,0.0005239404,0.00013400186,0.00034783143,0.00009755512,0.00022982659,0.00055688695],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006666529,0.0035432987,0.00025482886,0.0060484475,0.0005426613,0.0000045858387,0.035455838,0.008967212,0.0025053993,0.87894386,0.003810447,0.05985677],"study_design_scores_gemma":[0.0011375372,0.00020990257,0.00030876015,0.00073605566,0.00036011878,0.000022695851,0.001812785,0.10561082,0.018148674,0.8695809,0.0014746262,0.00059711584],"about_ca_topic_score_codex":0.0000045642673,"about_ca_topic_score_gemma":0.000002888685,"teacher_disagreement_score":0.55827016,"about_ca_system_score_codex":0.000111906775,"about_ca_system_score_gemma":0.00008613707,"threshold_uncertainty_score":0.99986863},"labels":[],"label_agreement":null},{"id":"W4250855192","doi":"10.1090/s0025-5718-01-01360-6","title":"On a problem of Byrnes concerning polynomials with restricted coefficients, II","year":2001,"lang":"en","type":"article","venue":"Mathematics of Computation","topic":"Mathematical functions and polynomials","field":"Mathematics","cited_by":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Root of unity; Order (exchange); Integer (computer science); Combinatorics; Cyclotomic polynomial; Polynomial; Prime (order theory); Zero (linguistics); Discrete mathematics; Mathematical analysis","score_opus":0.043688064522164914,"score_gpt":0.30277449023682435,"score_spread":0.25908642571465945,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4250855192","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7088288,0.000018921035,0.27838513,0.000078335375,0.00004341568,0.000595747,0.000013929992,0.00007533348,0.011960385],"genre_scores_gemma":[0.8416926,0.0000054454185,0.15759067,0.000015307842,0.000028142209,0.000023157001,0.000010486533,0.000035959692,0.00059817586],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99807113,0.00006677939,0.00096225314,0.0001956003,0.00049130665,0.00021293627],"domain_scores_gemma":[0.9965771,0.0018729147,0.0008750233,0.0003011095,0.00030697012,0.00006688712],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004249438,0.00021625841,0.0006280456,0.00022635768,0.00012448001,0.00002023437,0.00016871306,0.00009146594,0.00013925327],"category_scores_gemma":[0.00042933665,0.00016381411,0.0000944452,0.00046489158,0.00012164326,0.00007525384,0.00005226065,0.0001048192,0.000011463695],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00042985022,0.0038496377,0.000162992,0.002688496,0.00031071945,0.000007665215,0.0070727784,0.01128297,0.006381182,0.95736253,0.0047672074,0.005683974],"study_design_scores_gemma":[0.0037178614,0.003193071,0.00015141924,0.0029807072,0.0004077174,0.000079197416,0.001129648,0.059707258,0.018374305,0.90879595,0.0007530393,0.0007098126],"about_ca_topic_score_codex":0.000012593345,"about_ca_topic_score_gemma":0.0000032876474,"teacher_disagreement_score":0.13286385,"about_ca_system_score_codex":0.000032146076,"about_ca_system_score_gemma":0.00006227156,"threshold_uncertainty_score":0.6680146},"labels":[],"label_agreement":null},{"id":"W4251646816","doi":"10.1090/mcom/3062","title":"ℎ𝑝-dGFEM for second-order mixed elliptic problems in polyhedra","year":2015,"lang":"en","type":"article","venue":"Mathematics of Computation","topic":"Advanced Numerical Methods in Computational Mathematics","field":"Engineering","cited_by":14,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"European Research Council; Natural Sciences and Engineering Research Council of Canada; Schweizerischer Nationalfonds zur Förderung der Wissenschaftlichen Forschung; National Science Foundation","keywords":"Mathematics; Polyhedron; Degree of a polynomial; Discontinuous Galerkin method; Piecewise; Mathematical analysis; Finite element method; Applied mathematics; Polynomial; Geometry","score_opus":0.06469908124284317,"score_gpt":0.3173495057408121,"score_spread":0.25265042449796893,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4251646816","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06012029,0.00011040293,0.9377426,0.00002691646,0.00022627389,0.0005538605,0.0000062711733,0.00013828694,0.0010750956],"genre_scores_gemma":[0.30544806,0.00000153002,0.69438255,0.000007870498,0.000028114962,0.00005395245,0.000011846115,0.00004120621,0.000024886147],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987169,0.000030284851,0.00066149654,0.00013489019,0.0002584777,0.00019793345],"domain_scores_gemma":[0.9982861,0.0010443568,0.00016142316,0.0001455627,0.0002915746,0.00007094029],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00047638334,0.00017039859,0.00037840233,0.00017188565,0.000016215208,0.000018693338,0.00014237803,0.000073538635,0.000007959668],"category_scores_gemma":[0.0004752051,0.000176261,0.000046607227,0.00042174876,0.00003730454,0.00013750895,0.000026251819,0.00009797901,0.00001726944],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000037716686,0.000121851896,0.000024099973,0.0013519174,0.000023799455,4.22252e-7,0.0012509314,0.980197,0.00060934364,0.008342934,0.0001709994,0.0079029],"study_design_scores_gemma":[0.0003853223,0.000045058598,0.000023545925,0.000081659266,0.000007890673,0.000002716744,0.00013077472,0.57780474,0.0011461786,0.4201898,0.000071380724,0.00011091779],"about_ca_topic_score_codex":5.500079e-7,"about_ca_topic_score_gemma":0.000002432055,"teacher_disagreement_score":0.41184685,"about_ca_system_score_codex":0.00009643243,"about_ca_system_score_gemma":0.000034542652,"threshold_uncertainty_score":0.7187715},"labels":[],"label_agreement":null},{"id":"W4255704370","doi":"10.1090/s0025-5718-10-02338-0","title":"Advances in the theory of box integrals","year":2010,"lang":"en","type":"article","venue":"Mathematics of Computation","topic":"Mathematical functions and polynomials","field":"Mathematics","cited_by":19,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Dalhousie University","funders":"Lawrence Berkeley National Laboratory; Natural Sciences and Engineering Research Council of Canada; U.S. Department of Energy","keywords":"Mathematics; Compendium; Unit cube; Integer (computer science); Cube (algebra); Unit (ring theory); Set (abstract data type); Combinatorics; Pure mathematics; Algebra over a field; Discrete mathematics; Mathematics education; Computer science","score_opus":0.03315095472948747,"score_gpt":0.334638477669196,"score_spread":0.30148752293970854,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4255704370","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6884203,0.00008171162,0.27540624,0.00014924559,0.00022144616,0.0005367249,0.00000905831,0.000030224895,0.03514507],"genre_scores_gemma":[0.877843,0.000012338726,0.12200552,0.000017130034,0.000029904759,0.00001930091,0.0000024746416,0.000012425118,0.000057875055],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986666,0.00010541759,0.00073276914,0.00009483997,0.00028114137,0.000119227865],"domain_scores_gemma":[0.9949266,0.004221323,0.00041145325,0.00030479522,0.000115387775,0.000020486583],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019212483,0.00011701937,0.00034985482,0.00012574841,0.000030599665,0.000014042163,0.0002543228,0.00007028994,0.00012984413],"category_scores_gemma":[0.0014029342,0.00007321803,0.00009633782,0.00023830935,0.00012180861,0.000117202886,0.000027270104,0.00017882905,0.000008209822],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009532145,0.00038302006,0.00003987535,0.00061954546,0.000008533795,3.4136616e-7,0.003683534,0.000031038075,0.0014067676,0.9864527,0.00020383869,0.007161297],"study_design_scores_gemma":[0.00019501198,0.000053168995,0.000068635076,0.00012277513,0.000029209326,0.000007725936,0.0014013625,0.002343353,0.00401888,0.9915187,0.00016706227,0.000074114665],"about_ca_topic_score_codex":0.0000025097931,"about_ca_topic_score_gemma":0.000018876754,"teacher_disagreement_score":0.18942274,"about_ca_system_score_codex":0.0000051097827,"about_ca_system_score_gemma":0.00002271074,"threshold_uncertainty_score":0.29857445},"labels":[],"label_agreement":null},{"id":"W4295631274","doi":"10.1090/mcom/3773","title":"From the Birch and Swinnerton-Dyer conjecture to Nagao’s conjecture","year":2022,"lang":"en","type":"article","venue":"Mathematics of Computation","topic":"Algebraic Geometry and Number Theory","field":"Mathematics","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"Natural Sciences and Engineering Research Council of Canada; Simons Foundation","keywords":"Algorithm; Annotation; Conjecture; Type (biology); Artificial intelligence; Computer science; Mathematics; Database; Combinatorics; Biology","score_opus":0.023611034405315364,"score_gpt":0.28670174774571494,"score_spread":0.2630907133403996,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4295631274","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9261024,0.00014871832,0.070009276,0.0020773467,0.00020195605,0.00051780994,0.000065508335,0.000067094006,0.0008099068],"genre_scores_gemma":[0.97432303,0.0000014290137,0.024931924,0.00038155285,0.000091624795,0.000035322562,0.000022815835,0.00003098271,0.00018133952],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99864894,0.00016580617,0.00039393018,0.00020967137,0.0004166053,0.00016505612],"domain_scores_gemma":[0.99689865,0.0024315186,0.0002449378,0.000307693,0.000061207014,0.000055976834],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006964575,0.0001702171,0.0003178332,0.000084745065,0.00025509862,0.000035195542,0.00027433035,0.00005511516,0.00031548107],"category_scores_gemma":[0.00031199047,0.0001268298,0.0000694791,0.00033254272,0.00006594186,0.000046836147,0.0002681606,0.00023956152,0.000013131985],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00017320366,0.00090483326,0.0004483163,0.00081155327,0.0006864626,0.000022642356,0.1385534,0.008504818,0.0036998023,0.7945154,0.03988746,0.011792147],"study_design_scores_gemma":[0.0004334684,0.00012742153,0.00021039636,0.000042162435,0.00009104559,0.000033500706,0.004697223,0.0031074088,0.0013324312,0.98873895,0.0010136985,0.00017225937],"about_ca_topic_score_codex":0.000023990802,"about_ca_topic_score_gemma":0.000004097538,"teacher_disagreement_score":0.19422361,"about_ca_system_score_codex":0.000027029959,"about_ca_system_score_gemma":0.000031345255,"threshold_uncertainty_score":0.5171969},"labels":[],"label_agreement":null},{"id":"W4312122229","doi":"10.1090/mcom/3888","title":"Computing error bounds for asymptotic expansions of regular P-recursive sequences","year":2023,"lang":"en","type":"article","venue":"Mathematics of Computation","topic":"Polynomial and algebraic computation","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada; Agence Nationale de la Recherche","keywords":"Mathematics; Sequence (biology); Symbolic computation; Asymptotic expansion; Polynomial; Uniqueness; Computation; Asymptotic analysis; Gravitational singularity; Singularity; Applied mathematics; Algebra over a field; Algorithm; Pure mathematics; Mathematical analysis","score_opus":0.0347644148784825,"score_gpt":0.30408699170061,"score_spread":0.26932257682212746,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4312122229","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.33204436,0.00002028375,0.6669807,0.0002691269,0.00021848915,0.00025059358,0.0000055725177,0.00011383708,0.00009704737],"genre_scores_gemma":[0.75822896,0.0000016245986,0.24165633,0.000015133625,0.000030504601,0.000007940227,0.000019695552,0.000008961669,0.00003085897],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99861497,0.000041510837,0.0005886695,0.00022492162,0.0003224043,0.00020755033],"domain_scores_gemma":[0.99805534,0.0008689729,0.0005100995,0.00022062598,0.00029711207,0.00004785857],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00051564205,0.00012901169,0.00031226326,0.00026909073,0.00011527368,0.00004471628,0.0004176765,0.000051190527,0.0000012871794],"category_scores_gemma":[0.00017043452,0.0001248983,0.0001240199,0.0007350281,0.000079294194,0.0002299116,0.00013663848,0.00004730792,0.000009669713],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001554137,0.00034914457,0.00007621555,0.0014380316,0.00013635201,0.000004010262,0.02203233,0.24609998,0.014864342,0.6305961,0.0018616841,0.08252627],"study_design_scores_gemma":[0.00025771183,0.00011670714,0.00052755006,0.0001428626,0.00001308547,0.0000035936089,0.0002721921,0.6978017,0.005424482,0.29532713,0.000016053906,0.000096928794],"about_ca_topic_score_codex":0.000008412011,"about_ca_topic_score_gemma":0.0000016419102,"teacher_disagreement_score":0.45170173,"about_ca_system_score_codex":0.000024539473,"about_ca_system_score_gemma":0.00008980078,"threshold_uncertainty_score":0.5093205},"labels":[],"label_agreement":null},{"id":"W4361200815","doi":"10.1090/mcom/3849","title":"Sparse trace tests","year":2023,"lang":"en","type":"article","venue":"Mathematics of Computation","topic":"Polynomial and algebraic computation","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"National Science Foundation","keywords":"Mathematics; TRACE (psycholinguistics); Extension (predicate logic); Algebraic number; Set (abstract data type); Sparse approximation; Polynomial; Applied mathematics; Algebra over a field; Algorithm; Pure mathematics; Mathematical analysis; Computer science","score_opus":0.03140312312006853,"score_gpt":0.27760300026785845,"score_spread":0.2461998771477899,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4361200815","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.28870928,0.000014098282,0.70935124,0.00041052102,0.00017185917,0.000105009356,9.98137e-7,0.00030114967,0.000935838],"genre_scores_gemma":[0.88641375,0.0000025097731,0.113394484,0.000021928721,0.000029262343,0.0000051762026,0.000005354889,0.0000069996704,0.00012051876],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991186,0.000022889624,0.0002995852,0.00015464304,0.00025901693,0.00014524015],"domain_scores_gemma":[0.9992285,0.00029123566,0.0001678743,0.00018772538,0.00008207666,0.000042638712],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002789998,0.00008672266,0.00014909636,0.00018200783,0.00004971644,0.000051440584,0.00031394453,0.00003075212,0.0000031493153],"category_scores_gemma":[0.000068963906,0.00008348974,0.000051839637,0.00071632117,0.000022999753,0.00024110726,0.000108478904,0.000044772936,0.00020382061],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000005699845,0.00042701713,0.00015759734,0.00044898808,0.00005248404,0.000021742286,0.010946529,0.09376786,0.0102317585,0.4627515,0.0073685716,0.41382024],"study_design_scores_gemma":[0.00016703382,0.000038081285,0.0031331966,0.000032319764,0.00000356386,0.0000057651437,0.000034210723,0.78458977,0.0019780386,0.20983317,0.00009836522,0.00008646444],"about_ca_topic_score_codex":0.0000036367387,"about_ca_topic_score_gemma":0.0000011442133,"teacher_disagreement_score":0.69082195,"about_ca_system_score_codex":0.000013111269,"about_ca_system_score_gemma":0.00003522254,"threshold_uncertainty_score":0.34046125},"labels":[],"label_agreement":null},{"id":"W4390937016","doi":"10.1090/mcom/3943","title":"Few hamiltonian cycles in graphs with one or two vertex degrees","year":2024,"lang":"en","type":"article","venue":"Mathematics of Computation","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Montréal; Dawson College","funders":"KU Leuven; Fonds Wetenschappelijk Onderzoek; Natural Sciences and Engineering Research Council of Canada; Vlaamse regering; Japan Society for the Promotion of Science; Onderzoeksraad, KU Leuven; Vlaams Supercomputer Centrum","keywords":"Vertex (graph theory); Combinatorics; Hamiltonian (control theory); Hamiltonian path; Mathematics; Hamiltonian path problem; Graph; Mathematical optimization","score_opus":0.031301575136898664,"score_gpt":0.28079871192876094,"score_spread":0.24949713679186228,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4390937016","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.48743558,0.0003204122,0.510788,0.00032905268,0.00012343787,0.00018479988,0.0000012380557,0.00021607385,0.0006014129],"genre_scores_gemma":[0.70179063,0.000008129135,0.29813796,0.000019723826,0.0000013673116,0.000005641208,0.0000017942449,0.000008491326,0.00002627515],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989898,0.000028887624,0.00032226404,0.00021672413,0.0002992415,0.00014303756],"domain_scores_gemma":[0.99935067,0.00024107567,0.00008063581,0.00021112678,0.00007717231,0.000039295723],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003058639,0.0001115108,0.0001939409,0.00032833312,0.000035494726,0.00012570496,0.00023502811,0.00003077953,0.0000036410722],"category_scores_gemma":[0.00002053281,0.00008096999,0.000035895537,0.00077939214,0.00004973912,0.00023198048,0.0000562784,0.00008236179,0.000018363542],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000014583769,0.00037829977,0.0002026408,0.0008182101,0.00006242791,0.000041089075,0.0059090373,0.036267687,0.001660109,0.9148617,0.00017241125,0.03961185],"study_design_scores_gemma":[0.00028173393,0.000102016515,0.00042388504,0.0006915137,0.0000096223175,0.000015254815,0.000042317894,0.5963414,0.0006830192,0.4013063,0.0000059422105,0.00009699925],"about_ca_topic_score_codex":0.00003389254,"about_ca_topic_score_gemma":0.00007316958,"teacher_disagreement_score":0.56007373,"about_ca_system_score_codex":0.0000140262,"about_ca_system_score_gemma":0.00006473637,"threshold_uncertainty_score":0.33018604},"labels":[],"label_agreement":null},{"id":"W4391617410","doi":"10.1090/mcom/3950","title":"Energy diminishing implicit-explicit Runge–Kutta methods for gradient flows","year":2024,"lang":"en","type":"article","venue":"Mathematics of Computation","topic":"Numerical methods for differential equations","field":"Mathematics","cited_by":14,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Mathematics; Runge–Kutta methods; Discretization; Lipschitz continuity; Applied mathematics; Dissipation; Truncation error; Stability (learning theory); Convergence (economics); Simple (philosophy); Eigenvalues and eigenvectors; Nonlinear system; Mathematical optimization; Mathematical analysis; Numerical analysis; Computer science","score_opus":0.0997508456777239,"score_gpt":0.44942986911241994,"score_spread":0.34967902343469603,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4391617410","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.012981491,0.00018727379,0.9846821,0.00022212988,0.0005771872,0.0005377885,0.000026689599,0.00026554783,0.0005197862],"genre_scores_gemma":[0.096574694,0.000008821615,0.9028787,0.000022751952,0.00010961396,0.00017245591,0.00003327916,0.000082190294,0.00011746985],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9979626,0.00017411946,0.0009453927,0.00032973374,0.00029506028,0.00029311827],"domain_scores_gemma":[0.9926344,0.0064519937,0.00029587434,0.00032149616,0.00020239221,0.000093800954],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012171268,0.00025472598,0.0005662244,0.00026927926,0.00010655178,0.00012506213,0.00024892658,0.000115902854,0.000027034808],"category_scores_gemma":[0.0008520838,0.00022849736,0.0003158519,0.00041984147,0.00003517476,0.00017241905,0.00008780755,0.000120836565,0.000005942182],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00000772695,0.0002214553,7.0258477e-7,0.0013896918,0.00015191476,6.0613814e-7,0.002130742,0.00022408007,0.013504372,0.70150656,0.0002675799,0.2805946],"study_design_scores_gemma":[0.00012854689,0.00008386448,0.0000029315524,0.00017380103,0.00015023556,0.000004684592,0.00010694604,0.39497134,0.0067020385,0.59702784,0.00051123917,0.00013656174],"about_ca_topic_score_codex":0.000012837529,"about_ca_topic_score_gemma":0.0000048279257,"teacher_disagreement_score":0.39474726,"about_ca_system_score_codex":0.000081320824,"about_ca_system_score_gemma":0.000048888523,"threshold_uncertainty_score":0.93178517},"labels":[],"label_agreement":null},{"id":"W4396540525","doi":"10.1090/mcom/3975","title":"Uniform error estimate of an asymptotic preserving scheme for the Lévy-Fokker-Planck equation","year":2024,"lang":"en","type":"article","venue":"Mathematics of Computation","topic":"Gas Dynamics and Kinetic Theory","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"Natural Sciences and Engineering Research Council of Canada; National Science Foundation","keywords":"Mathematics; Fokker–Planck equation; Scheme (mathematics); Applied mathematics; Mathematical analysis; Partial differential equation","score_opus":0.06962847497596752,"score_gpt":0.3690500124450404,"score_spread":0.29942153746907285,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4396540525","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.30668676,0.00008544375,0.69170356,0.0001269574,0.00015907896,0.0005845307,0.000022245353,0.000071071,0.0005603507],"genre_scores_gemma":[0.68457675,0.0000022206787,0.31521195,0.000004601021,0.000036598896,0.000028507658,0.000027381762,0.000034111446,0.00007790481],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987067,0.000033829896,0.0006311265,0.00015707704,0.00030963757,0.0001616143],"domain_scores_gemma":[0.99681646,0.0022886705,0.00032218234,0.00031432693,0.00022488924,0.00003348317],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011220402,0.00015118835,0.00028041328,0.00012007807,0.00006830068,0.000059357928,0.00025525462,0.00007158201,0.000019751304],"category_scores_gemma":[0.00044691004,0.00011143282,0.00010720207,0.00018118296,0.00006144483,0.00015411252,0.000056098062,0.00008574458,0.0000040198815],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002358636,0.00023238326,0.000011791352,0.004940861,0.00013857774,8.2106584e-7,0.0037031374,0.02734332,0.0017416124,0.9565199,0.00015847253,0.0051855487],"study_design_scores_gemma":[0.00013968904,0.00007649231,0.000042087395,0.0002494335,0.00007839088,0.000003814232,0.00022469972,0.5310174,0.0005562402,0.46754226,0.000010127473,0.000059313596],"about_ca_topic_score_codex":0.0000073069828,"about_ca_topic_score_gemma":0.00000958594,"teacher_disagreement_score":0.50367415,"about_ca_system_score_codex":0.000029020503,"about_ca_system_score_gemma":0.00005090487,"threshold_uncertainty_score":0.45440987},"labels":[],"label_agreement":null},{"id":"W4401814194","doi":"10.1090/mcom/4011","title":"Expected decrease for derivative-free algorithms using random subspaces","year":2024,"lang":"en","type":"article","venue":"Mathematics of Computation","topic":"Machine Learning and Algorithms","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Okanagan University College; University of British Columbia, Okanagan Campus; University of British Columbia","funders":"Natural Sciences and Engineering Research Council of Canada; Agence Nationale de la Recherche","keywords":"Linear subspace; Mathematics; Leverage (statistics); Dimension (graph theory); Subspace topology; Algorithm; Mathematical optimization; Computation; Derivative (finance); Function (biology); Pure mathematics; Statistics; Mathematical analysis","score_opus":0.02951130113500457,"score_gpt":0.3173608825810777,"score_spread":0.28784958144607314,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4401814194","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.038709138,0.00029224955,0.95974654,0.00028743965,0.0002737047,0.00028215293,0.000006001511,0.00025808945,0.00014467338],"genre_scores_gemma":[0.22891104,0.0000024996682,0.7709188,0.000013792134,0.000069594345,0.000014323624,0.0000083183895,0.000015285194,0.00004635936],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998983,0.00004974305,0.00032266226,0.00023123625,0.00025778357,0.00015556738],"domain_scores_gemma":[0.99857515,0.0008104517,0.00014155907,0.00025238958,0.00015682813,0.00006359543],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00040659786,0.00013322079,0.00023367733,0.00018268074,0.00008778057,0.00019306681,0.00038305236,0.000040683994,0.000005272055],"category_scores_gemma":[0.00039029183,0.00011664951,0.00010069363,0.00037808294,0.000032219537,0.0002679359,0.000100999154,0.00007510802,0.000003640425],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008233461,0.0009671341,0.000084642415,0.0055228416,0.00063611096,0.000055014592,0.050699193,0.22090639,0.01385407,0.33550733,0.0034788405,0.36820608],"study_design_scores_gemma":[0.0006174417,0.0000562682,0.000017736313,0.00017647604,0.000019787427,0.000013977711,0.0000902846,0.8993457,0.002114257,0.09735585,0.00007535114,0.000116894334],"about_ca_topic_score_codex":0.000016061473,"about_ca_topic_score_gemma":8.7793074e-7,"teacher_disagreement_score":0.67843926,"about_ca_system_score_codex":0.000023599796,"about_ca_system_score_gemma":0.00008125398,"threshold_uncertainty_score":0.4756829},"labels":[],"label_agreement":null},{"id":"W4402314713","doi":"10.1090/mcom/4012","title":"On Darmon’s program for the generalized Fermat equation, II","year":2024,"lang":"en","type":"article","venue":"Mathematics of Computation","topic":"Algebraic Geometry and Number Theory","field":"Mathematics","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"Natural Sciences and Engineering Research Council of Canada; Université Clermont-Auvergne; Centre National de la Recherche Scientifique; Agence Nationale de la Recherche","keywords":"Algorithm; Mathematics; Computer science; Database","score_opus":0.06355925350607301,"score_gpt":0.3539160631506225,"score_spread":0.2903568096445495,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4402314713","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.20142037,0.00018184951,0.7942421,0.00081690605,0.00035662352,0.0013622063,0.000013555149,0.00028689115,0.0013195242],"genre_scores_gemma":[0.8704951,0.00000664559,0.12836084,0.000056590914,0.00010422501,0.00024427762,0.000028330693,0.000041886076,0.0006621379],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99885267,0.000044845463,0.00047262898,0.00016049325,0.00031252336,0.00015686845],"domain_scores_gemma":[0.99581516,0.0036058952,0.00016796128,0.0002392482,0.00014270641,0.000029047553],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009029724,0.00015264313,0.00022982282,0.00011151331,0.00018997127,0.000071215436,0.00018079467,0.0000656677,0.000051131672],"category_scores_gemma":[0.0005037879,0.00010233002,0.0001528426,0.00026208625,0.00005929223,0.000084607556,0.000043674023,0.000092776034,0.000023728599],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000022068043,0.0003019496,4.729618e-7,0.0009957902,0.00012291415,5.883435e-7,0.0030706122,0.0010284923,0.00011608137,0.9682776,0.0065954453,0.019468017],"study_design_scores_gemma":[0.00023832775,0.00015476531,0.000004375989,0.00014354473,0.000093646195,0.0000045201286,0.00016252261,0.26023826,0.0014782338,0.7367911,0.00060406874,0.00008667106],"about_ca_topic_score_codex":0.0000011415436,"about_ca_topic_score_gemma":4.9846085e-7,"teacher_disagreement_score":0.6690747,"about_ca_system_score_codex":0.00003100539,"about_ca_system_score_gemma":0.000033847515,"threshold_uncertainty_score":0.4172897},"labels":[],"label_agreement":null},{"id":"W4403128077","doi":"10.1090/mcom/4024","title":"On the computation of lattice sums without translational invariance","year":2024,"lang":"en","type":"article","venue":"Mathematics of Computation","topic":"Analytic Number Theory Research","field":"Mathematics","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"Horizon 2020; Deutsche Forschungsgemeinschaft; Natural Sciences and Engineering Research Council of Canada; Friedrich-Alexander-Universität Erlangen-Nürnberg; European Commission","keywords":"Computation; Lattice (music); Mathematics; Statistical physics; Computer science; Physics; Algorithm","score_opus":0.08754785660432815,"score_gpt":0.37904777672928514,"score_spread":0.29149992012495696,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4403128077","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.24187231,0.000051586347,0.75080657,0.0006825317,0.00007480322,0.00041093427,0.000012719893,0.00006151059,0.0060270275],"genre_scores_gemma":[0.94986725,0.000002362956,0.049842518,0.00001890195,0.00003060221,0.000011335391,0.000009194081,0.000030836025,0.00018700153],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9982038,0.0001495447,0.0006130637,0.00016865428,0.0007257727,0.00013916996],"domain_scores_gemma":[0.99411666,0.0051757954,0.00022779164,0.00019865793,0.00024906328,0.000032033287],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014595574,0.00013974686,0.0002889283,0.00015726006,0.000058597296,0.000044297845,0.00019862287,0.000060449136,0.000084398336],"category_scores_gemma":[0.0005079763,0.00009999963,0.00011168961,0.0004024315,0.00015572748,0.00011018563,0.00002777176,0.00017597711,0.000045976052],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002295062,0.0001774803,0.000024768307,0.0012332086,0.00011596972,0.0000014480524,0.003174007,0.005280571,0.00033545116,0.98775864,0.0005928665,0.0012826562],"study_design_scores_gemma":[0.00012571065,0.000040636172,0.000038569564,0.00039949434,0.000043403852,0.000004284078,0.00015991878,0.40201092,0.0008383614,0.5962759,0.000006667155,0.00005608569],"about_ca_topic_score_codex":0.000004608149,"about_ca_topic_score_gemma":0.0000029275893,"teacher_disagreement_score":0.70799494,"about_ca_system_score_codex":0.000027705168,"about_ca_system_score_gemma":0.00008998374,"threshold_uncertainty_score":0.40778664},"labels":[],"label_agreement":null},{"id":"W4408866254","doi":"10.1090/mcom/4096","title":"New results on periodic Golay pairs","year":2025,"lang":"en","type":"preprint","venue":"Mathematics of Computation","topic":"Wireless Communication Networks Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Binary Golay code; Mathematics; Statistics","score_opus":0.04911086535463299,"score_gpt":0.3356206022829018,"score_spread":0.2865097369282688,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4408866254","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0018359586,0.00016256387,0.97874975,0.0022488688,0.00036258114,0.0005638242,0.000017211973,0.00021439881,0.01584484],"genre_scores_gemma":[0.3308094,0.00008017338,0.66763467,0.00005871885,0.000064817694,0.000029948229,0.00007315459,0.000015814174,0.0012332762],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9973742,0.00022294401,0.0008865691,0.00046980966,0.00081628247,0.00023023218],"domain_scores_gemma":[0.99560267,0.0012448402,0.00067973067,0.0019889781,0.00038500782,0.00009880166],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0008936707,0.00025639945,0.0004667949,0.0004352113,0.000094557174,0.0002726705,0.0027161236,0.00023064332,0.0000057372067],"category_scores_gemma":[0.00030162622,0.0002581686,0.00015861852,0.00049760414,0.000051425257,0.000113555674,0.0023831797,0.00065494806,0.000042575834],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000033368295,0.00038083276,0.000008936877,0.0011682675,0.00011487193,0.0000034017623,0.0076769427,0.61707515,0.000027864502,0.1645646,0.028804597,0.18014118],"study_design_scores_gemma":[0.00038016101,0.00006734392,0.00015340949,0.0010861324,0.000009939961,0.0000011356371,0.000031246018,0.8931497,0.00035076478,0.104098976,0.00047683678,0.0001943936],"about_ca_topic_score_codex":0.00004904649,"about_ca_topic_score_gemma":0.000008368765,"teacher_disagreement_score":0.32897344,"about_ca_system_score_codex":0.00012255396,"about_ca_system_score_gemma":0.0006629603,"threshold_uncertainty_score":0.99998707},"labels":[],"label_agreement":null},{"id":"W4412598139","doi":"10.1090/mcom/4131","title":"On series expansions of zeros of the deformed exponential function","year":2025,"lang":"lv","type":"article","venue":"Mathematics of Computation","topic":"Mathematical functions and polynomials","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"York University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Series (stratigraphy); Exponential function; Mathematical analysis; Function (biology); Applied mathematics","score_opus":0.0221592400406348,"score_gpt":0.2849095660891219,"score_spread":0.2627503260484871,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4412598139","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.67094594,0.00010015888,0.3181878,0.00030494522,0.0013575683,0.0012267142,0.0000913034,0.000034457855,0.007751105],"genre_scores_gemma":[0.98002714,0.000019026245,0.017624915,0.000028691891,0.000038312435,0.000029728973,0.000012077129,0.00003230978,0.002187816],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9966947,0.0001809211,0.0020254112,0.00022409612,0.0006456958,0.00022921928],"domain_scores_gemma":[0.994718,0.0023329458,0.0016276292,0.00074841233,0.00052576535,0.000047210156],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007338207,0.00031634144,0.0009615547,0.00031154315,0.00016485181,0.000025182444,0.0003355244,0.00023889076,0.00023022231],"category_scores_gemma":[0.0013828004,0.00022878546,0.00046678685,0.0005733474,0.00032607868,0.0001279106,0.00016989817,0.00020663654,0.000017430071],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00024482564,0.002204752,0.000033423312,0.01026862,0.0004301823,2.0473672e-7,0.0041053095,0.002550456,0.019115617,0.9563316,0.0030714714,0.0016435436],"study_design_scores_gemma":[0.0009942935,0.0004811955,0.00030711904,0.0038000531,0.00082423055,0.0000030629708,0.0016608706,0.013991245,0.09643297,0.88123405,0.00007472376,0.00019616527],"about_ca_topic_score_codex":0.000017918497,"about_ca_topic_score_gemma":0.000008890798,"teacher_disagreement_score":0.3090812,"about_ca_system_score_codex":0.0000529845,"about_ca_system_score_gemma":0.00021127243,"threshold_uncertainty_score":0.93296},"labels":[],"label_agreement":null},{"id":"W4416225390","doi":"10.1090/mcom/4133","title":"Improved estimates for the argument and zero-counting function of the Riemann zeta-function","year":2025,"lang":"en","type":"article","venue":"Mathematics of Computation","topic":"Analytic Number Theory Research","field":"Mathematics","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Lethbridge","funders":"Natural Sciences and Engineering Research Council of Canada; National Science Council","keywords":"Upper and lower bounds; Riemann hypothesis; Function (biology); Work (physics); Log-log plot; BETA (programming language)","score_opus":0.033805510872197325,"score_gpt":0.3285501246155016,"score_spread":0.2947446137433043,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4416225390","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12260312,0.000099166005,0.87538224,0.00029186302,0.0001457336,0.00090505264,0.0000042560837,0.000023078996,0.0005454634],"genre_scores_gemma":[0.96602106,0.0000032148225,0.033442568,0.000025557858,0.000018699891,0.00005249963,0.0000030042831,0.000016105894,0.00041731296],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99889535,0.00004665403,0.0005187278,0.00013571343,0.00026887338,0.0001346792],"domain_scores_gemma":[0.99581796,0.003106414,0.0004379561,0.00027941162,0.00034361111,0.0000146679495],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013560044,0.00012057594,0.00026065414,0.000076492164,0.00018689939,0.00003788734,0.00016860444,0.000054381166,0.0000073377973],"category_scores_gemma":[0.0009970452,0.000072549374,0.000107207255,0.00022915141,0.0001431124,0.00007372044,0.000105471576,0.00009141359,7.8387944e-7],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00017124899,0.00032452415,0.00050781114,0.0041643945,0.00068081,5.4236377e-8,0.0016772804,0.0014364804,0.008497025,0.97028476,0.0012705402,0.010985045],"study_design_scores_gemma":[0.00033742524,0.00005138185,0.00045793236,0.0001496411,0.00034231416,6.984469e-7,0.000444238,0.30922952,0.003061562,0.68585914,0.000022038937,0.0000440704],"about_ca_topic_score_codex":0.000008440221,"about_ca_topic_score_gemma":0.000004879578,"teacher_disagreement_score":0.84341794,"about_ca_system_score_codex":0.000030846513,"about_ca_system_score_gemma":0.00004487919,"threshold_uncertainty_score":0.29584774},"labels":[],"label_agreement":null},{"id":"W4416925497","doi":"10.1090/mcom/4154","title":"Fourier optimization, the least quadratic non-residue, and the least prime in an arithmetic progression","year":2025,"lang":"en","type":"article","venue":"Mathematics of Computation","topic":"Analytic Number Theory Research","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Lethbridge","funders":"Austrian Science Fund; Simons Foundation; Pacific Institute for the Mathematical Sciences; National Science Foundation","keywords":"Prime (order theory); Quadratic equation; Dirichlet distribution; Modulo; Riemann hypothesis; Connection (principal bundle); Arithmetic progression; Real line; Fourier transform","score_opus":0.02757518909693638,"score_gpt":0.373720503915872,"score_spread":0.3461453148189356,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4416925497","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.16776715,0.00010414815,0.8259622,0.0018932658,0.0000479958,0.001590937,0.0000021108613,0.00003804909,0.0025941373],"genre_scores_gemma":[0.88040286,0.00000889199,0.11889867,0.000043224776,0.000023787581,0.00007546455,0.0000064856185,0.000026807464,0.00051379757],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.997986,0.0003923876,0.00069668645,0.00021129973,0.00049976376,0.00021385148],"domain_scores_gemma":[0.9968179,0.0020618516,0.00032510422,0.00046448715,0.0002892274,0.000041414874],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0024820925,0.00017816087,0.00039880158,0.00019682728,0.00018907388,0.0001284243,0.00035839604,0.00007813071,0.000021582662],"category_scores_gemma":[0.00092785794,0.000103269886,0.000059619386,0.00056661206,0.00047532414,0.00016145765,0.00015214903,0.0002248621,0.000004706491],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00041953375,0.0016945763,0.0020892413,0.00262834,0.00026752803,0.000007038411,0.026139759,0.064837575,0.00015192453,0.8839811,0.00076523935,0.017018134],"study_design_scores_gemma":[0.0009939319,0.000032149124,0.0002900881,0.0003003945,0.000059097816,0.0000043729524,0.0012200938,0.61236393,0.00014272016,0.38452223,0.0000020947712,0.000068869136],"about_ca_topic_score_codex":0.000015284555,"about_ca_topic_score_gemma":0.000038016835,"teacher_disagreement_score":0.7126357,"about_ca_system_score_codex":0.00004122824,"about_ca_system_score_gemma":0.00011072037,"threshold_uncertainty_score":0.42112237},"labels":[],"label_agreement":null},{"id":"W4417283779","doi":"10.1090/mcom/4166","title":"Cyclic sieving on permutations: An analysis of maps and statistics in the FindStat database","year":2025,"lang":"en","type":"article","venue":"Mathematics of Computation","topic":"Advanced Combinatorial Mathematics","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"Simons Foundation; National Science Foundation","keywords":"Permutation (music); Bijection; Conjecture; Statistic; Fixed point; Order statistic; Set (abstract data type); Generating function","score_opus":0.03593894161445069,"score_gpt":0.3758833961808689,"score_spread":0.3399444545664182,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4417283779","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4249423,0.000025042229,0.5739863,0.00005407333,0.000045416684,0.00038319733,0.00010049498,0.000019384805,0.00044382297],"genre_scores_gemma":[0.71850103,0.000010743107,0.28132743,0.000028091255,0.000005911584,0.000020449634,0.00007760976,0.000013709048,0.000015042369],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9981108,0.00017239606,0.00093346136,0.00020350763,0.000430392,0.00014947352],"domain_scores_gemma":[0.9934639,0.0052395877,0.00056828867,0.0004933651,0.00020699596,0.000027897466],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000960003,0.00017929309,0.0005729933,0.0006919432,0.00006488224,0.000033630364,0.0002623274,0.000060880397,0.000005677933],"category_scores_gemma":[0.0017673676,0.00014689521,0.00006455854,0.0011816428,0.000102416685,0.00014753503,0.000060401955,0.00014089697,8.428153e-7],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000015910264,0.00076852355,0.00022164646,0.0010360875,0.00017031064,0.0000024054714,0.0069055846,0.0069216206,0.00028541416,0.98229176,0.000079995654,0.0013007502],"study_design_scores_gemma":[0.00039537143,0.00008678341,0.00080944353,0.00026107146,0.0005491051,0.0000010599164,0.002772903,0.198311,0.0003599876,0.79635,0.0000033239614,0.000099951874],"about_ca_topic_score_codex":0.000011535374,"about_ca_topic_score_gemma":0.000046762198,"teacher_disagreement_score":0.29355872,"about_ca_system_score_codex":0.000043687327,"about_ca_system_score_gemma":0.000043426156,"threshold_uncertainty_score":0.59902126},"labels":[],"label_agreement":null}]}