{"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0461356,0.0010675741,0.124653414,0.0026984343,0.0011416844,0.00010133096,0.0007014632,0.0011335675,0.8223669],"genre_scores_gemma":[0.55106527,0.0012947612,0.042207304,0.0012372632,0.0007590324,0.0001803542,0.0013034584,0.0013240613,0.4006285],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99881303,0.00020929957,0.000063722306,0.00025522805,0.0003868071,0.0002719437],"domain_scores_gemma":[0.99945205,0.00011700878,0.00005346008,0.00009997512,0.00020943666,0.000068032525],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00064367364,0.00096448103,0.00060601503,0.00172863,0.0023949074,0.0040669786,0.0009166421,0.0008684348,0.034624305],"category_scores_gemma":[0.0019047582,0.00045458166,0.0013617662,0.001177002,0.0030764327,0.0046512405,0.0025578677,0.003053089,0.011345979],"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.0000189281,0.00000992288,0.000034704146,0.0000142146555,0.0000035696314,0.000044740198,0.00015044893,0.0002536695,0.00026666475,0.98816,0.0039403173,0.0071027954],"study_design_scores_gemma":[0.00001497379,0.0000120839495,0.00008569527,0.000013474874,0.0000054596276,0.000056358127,0.00013531245,0.0014279064,0.00087316154,0.95370436,0.043660276,0.000010936331],"about_ca_topic_score_codex":0.0032478587,"about_ca_topic_score_gemma":0.0031581977,"teacher_disagreement_score":0.034624305,"about_ca_system_score_codex":0.002685628,"about_ca_system_score_gemma":0.00082615175,"threshold_uncertainty_score":0.115829825},"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.017762588,0.000557045,0.32792023,0.009864098,0.003957102,0.00030676433,0.0021610085,0.002601822,0.63486934],"genre_scores_gemma":[0.31731337,0.0012815142,0.19814177,0.006978145,0.0026803974,0.00091466843,0.0056289383,0.008554468,0.45850667],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9973435,0.00037762398,0.0001952966,0.0007203444,0.00080329773,0.0005599673],"domain_scores_gemma":[0.99719125,0.0011608574,0.00013847782,0.00030011986,0.0010392774,0.00016992533],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018897301,0.001141084,0.0008215565,0.0010516349,0.0027164423,0.003693834,0.002248735,0.0023344285,0.09302111],"category_scores_gemma":[0.010512685,0.0008668759,0.0022538805,0.0009515718,0.0031608017,0.010138285,0.0046380647,0.00599683,0.030849166],"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.00005830476,0.00002901305,0.0003670548,0.0000978273,0.000018781137,0.00031655806,0.0003841115,0.0005057585,0.001169333,0.9376325,0.04628334,0.013137364],"study_design_scores_gemma":[0.000050257702,0.00002699561,0.0003779576,0.000093986564,0.00003491999,0.00042000794,0.00020880207,0.006794234,0.0028898206,0.86001354,0.12905101,0.00003849028],"about_ca_topic_score_codex":0.005347708,"about_ca_topic_score_gemma":0.005752837,"teacher_disagreement_score":0.09302111,"about_ca_system_score_codex":0.0015012723,"about_ca_system_score_gemma":0.0020127583,"threshold_uncertainty_score":0.3111866},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.02947743,0.0007366654,0.9296726,0.0011171214,0.00038893786,0.0009568458,0.0049405736,0.008808113,0.023901712],"genre_scores_gemma":[0.0642026,0.0002487,0.9111982,0.00031078205,0.000079419726,0.00059807225,0.009818202,0.0012779521,0.01226606],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99868864,0.00014572643,0.00016343172,0.0004564994,0.00036260294,0.00018303082],"domain_scores_gemma":[0.9987684,0.0004276321,0.00010560287,0.00027656043,0.0003279166,0.00009387105],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011179226,0.0018573357,0.0016247148,0.0022407444,0.0018512681,0.0029094256,0.0024082966,0.001526324,0.028366182],"category_scores_gemma":[0.0039525623,0.0010607904,0.0023045847,0.002112823,0.0008545654,0.004124364,0.0039757295,0.0017393263,0.012201418],"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.0009830298,0.0003369442,0.0016001599,0.0017798292,0.00021169105,0.0002983498,0.0008009063,0.020058077,0.02934893,0.10777527,0.0847272,0.7520796],"study_design_scores_gemma":[0.0006123023,0.0006029998,0.0015232844,0.00046332777,0.00033449024,0.0011414136,0.0010971148,0.18740393,0.04821202,0.6135314,0.14489783,0.00017980397],"about_ca_topic_score_codex":0.0024170014,"about_ca_topic_score_gemma":0.0049637733,"teacher_disagreement_score":0.028366182,"about_ca_system_score_codex":0.0018904182,"about_ca_system_score_gemma":0.0025641944,"threshold_uncertainty_score":0.09489435},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11085268,0.00087320263,0.66126275,0.001695786,0.0009549833,0.00015226318,0.0008143732,0.002465598,0.2209284],"genre_scores_gemma":[0.698864,0.0011354,0.17498223,0.0007792733,0.0013388338,0.00018297935,0.0013145434,0.0023790416,0.11902375],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987104,0.00022546068,0.0000689583,0.00040221945,0.00036854984,0.00022445407],"domain_scores_gemma":[0.9987544,0.00031381086,0.00009630221,0.0003557232,0.0003367202,0.00014303847],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011986359,0.0008460242,0.0007449591,0.0021249289,0.0020186084,0.003804843,0.0010553679,0.0006501839,0.013994945],"category_scores_gemma":[0.003290664,0.00045303215,0.00118208,0.0011205652,0.0033521103,0.0096330885,0.0035957634,0.002252055,0.0042473874],"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.00003350798,0.000019023497,0.00021006976,0.00003627851,0.000006683597,0.000080613376,0.00034739147,0.00036018356,0.0009738841,0.97118855,0.0040358054,0.02270809],"study_design_scores_gemma":[0.000011450632,0.000029125604,0.00025742225,0.000018350029,0.000009694836,0.00019033349,0.00013814056,0.002161233,0.0037198684,0.96412104,0.029324511,0.000018793933],"about_ca_topic_score_codex":0.0007445985,"about_ca_topic_score_gemma":0.0006405483,"teacher_disagreement_score":0.013994945,"about_ca_system_score_codex":0.0010256016,"about_ca_system_score_gemma":0.0009330724,"threshold_uncertainty_score":0.04681772},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.050994113,0.00022508348,0.9371359,0.00040105844,0.00018894426,0.00009971106,0.00011182616,0.0008809996,0.009962396],"genre_scores_gemma":[0.27954876,0.000329548,0.7120801,0.0001851826,0.00012280626,0.00009664386,0.00025235632,0.00025147366,0.0071330206],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993273,0.00018115644,0.00004964235,0.00013206777,0.00022734374,0.000082536964],"domain_scores_gemma":[0.99922526,0.00019993259,0.00006716668,0.00030368127,0.00014310644,0.000060837236],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010704506,0.00062436436,0.00056423544,0.0015766857,0.000962361,0.0015931823,0.0013245398,0.0005906806,0.005415148],"category_scores_gemma":[0.0034739096,0.00032843987,0.0006423931,0.0011884895,0.0018119747,0.004661557,0.002088663,0.0013301095,0.0017059726],"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.00013319979,0.000055085897,0.0015906248,0.00010286219,0.000022600007,0.00016038456,0.00033249924,0.018351357,0.005129835,0.8194527,0.0031450866,0.1515237],"study_design_scores_gemma":[0.000049238337,0.00010967458,0.0005082796,0.00003790368,0.0000133692565,0.00030688295,0.00017459386,0.15619339,0.013193141,0.8047938,0.024551708,0.00006803073],"about_ca_topic_score_codex":0.0006633619,"about_ca_topic_score_gemma":0.0011511758,"teacher_disagreement_score":0.005415148,"about_ca_system_score_codex":0.0006690332,"about_ca_system_score_gemma":0.00084387214,"threshold_uncertainty_score":0.01811546},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07628285,0.0003511123,0.89915586,0.0003537715,0.00038551626,0.00007286308,0.00021822879,0.00044818828,0.02273166],"genre_scores_gemma":[0.7095354,0.0007784353,0.24566494,0.00048739868,0.0004942447,0.000183769,0.00075726723,0.0005964459,0.041502066],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99963164,0.00009081883,0.000016111877,0.000081708225,0.000109559915,0.0000702415],"domain_scores_gemma":[0.99951315,0.00007532706,0.00006899392,0.00009267905,0.00014685866,0.00010289598],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000690921,0.0009504329,0.0007085395,0.0013394647,0.0007984511,0.0014988333,0.0010591958,0.0009303139,0.007041963],"category_scores_gemma":[0.0016151082,0.00042873106,0.0006433888,0.0005905967,0.0014109012,0.0015528699,0.0014907654,0.0014337464,0.0017782958],"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.000060488594,0.000017380291,0.00023327717,0.00004961763,0.000009795536,0.00011029684,0.00012686363,0.0072279684,0.0049722698,0.9671068,0.0025253724,0.017559819],"study_design_scores_gemma":[0.000046913985,0.00026458027,0.00077131053,0.00005945706,0.0000248936,0.0004981024,0.00032908586,0.25328127,0.0074749608,0.7057632,0.031389873,0.00009628734],"about_ca_topic_score_codex":0.0011880061,"about_ca_topic_score_gemma":0.0011371657,"teacher_disagreement_score":0.007041963,"about_ca_system_score_codex":0.0007105071,"about_ca_system_score_gemma":0.00041308804,"threshold_uncertainty_score":0.023557723},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.046797797,0.0016826645,0.9269461,0.0004777166,0.00043275478,0.00004469245,0.00024328,0.00020856124,0.023166431],"genre_scores_gemma":[0.50286275,0.006233695,0.44331688,0.00032168848,0.0006219877,0.00011815137,0.0008527563,0.00062046683,0.045051545],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991622,0.00025319876,0.000044263274,0.00015536322,0.00030330985,0.000081678896],"domain_scores_gemma":[0.9989189,0.0004102812,0.0001428894,0.00014172796,0.00029198208,0.00009418886],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010197209,0.0006660739,0.0006425949,0.0014645312,0.0004675281,0.001378159,0.0006344842,0.00073567097,0.005559713],"category_scores_gemma":[0.004032233,0.00041440185,0.0009751781,0.0016738487,0.0015031097,0.0015483747,0.0017733849,0.0019993684,0.0018563813],"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.00010658108,0.00003025845,0.0008831505,0.00033011142,0.00003944956,0.00028568663,0.00052389,0.06218507,0.011095179,0.8039151,0.0053017316,0.11530372],"study_design_scores_gemma":[0.000027797192,0.00015527704,0.001169876,0.00014715882,0.000031495103,0.0004997784,0.00036526442,0.44946593,0.005158219,0.4831445,0.05978247,0.00005228841],"about_ca_topic_score_codex":0.0013166931,"about_ca_topic_score_gemma":0.0009748775,"teacher_disagreement_score":0.005559713,"about_ca_system_score_codex":0.00071709225,"about_ca_system_score_gemma":0.00036779634,"threshold_uncertainty_score":0.018599093},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.83074534,0.00024575583,0.07534881,0.0006123717,0.000353017,0.00007139254,0.00036775938,0.00042324467,0.09183229],"genre_scores_gemma":[0.968839,0.00022297206,0.012821388,0.00016855085,0.00019767476,0.00006783494,0.00036097935,0.00025670903,0.017064895],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9997576,0.000017371189,0.000007518387,0.00003559208,0.00006441734,0.00011746254],"domain_scores_gemma":[0.9998336,0.000024366258,0.00005437415,0.000021078191,0.000022317512,0.00004425919],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00027465727,0.00061124796,0.00032075326,0.0014509452,0.0010672077,0.001405531,0.00077719084,0.00061329216,0.010535274],"category_scores_gemma":[0.0003935392,0.00018581127,0.0009486543,0.0005507904,0.0023410767,0.0014501612,0.0009572402,0.0011978465,0.0017381501],"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.00004473996,0.00006445836,0.00037863984,0.000022404965,0.000005510627,0.00008417288,0.00043166094,0.003122044,0.0078114844,0.9753729,0.0013332126,0.011328769],"study_design_scores_gemma":[0.000026472771,0.00010714359,0.0013218316,0.000023116843,0.000013188686,0.0001362974,0.0003617771,0.021106308,0.013104824,0.9538233,0.009903896,0.00007186862],"about_ca_topic_score_codex":0.00195257,"about_ca_topic_score_gemma":0.002374584,"teacher_disagreement_score":0.010535274,"about_ca_system_score_codex":0.0015281613,"about_ca_system_score_gemma":0.0009861238,"threshold_uncertainty_score":0.035243988},"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.23447037,0.00740953,0.19842875,0.0672446,0.008191639,0.00008718903,0.0025766676,0.0014276162,0.48016372],"genre_scores_gemma":[0.8857151,0.0028150636,0.028011858,0.007883954,0.004582447,0.00014897635,0.0013086598,0.00037204986,0.0691619],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9977718,0.0006142413,0.00011280772,0.0005492174,0.00054575776,0.00040630053],"domain_scores_gemma":[0.996326,0.0017547664,0.00018774519,0.0006860658,0.0007549949,0.0002903321],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020268317,0.0007866136,0.0010007165,0.0013902256,0.0026304927,0.0032268907,0.0009856697,0.0014887863,0.013168641],"category_scores_gemma":[0.00871054,0.00049218914,0.0013103781,0.0020726812,0.0054595,0.006734896,0.0044537317,0.004399584,0.00328509],"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.00008507476,0.000017845194,0.00041046157,0.000051810563,0.000009491385,0.000047298927,0.0002345994,0.0010681563,0.00028068904,0.9723371,0.01412661,0.011330798],"study_design_scores_gemma":[0.000017117216,0.000023694678,0.00026720297,0.000034919485,0.00000887689,0.000065545515,0.00009431561,0.0014631144,0.0003204464,0.9730647,0.024622954,0.000017081778],"about_ca_topic_score_codex":0.0022409896,"about_ca_topic_score_gemma":0.0010284749,"teacher_disagreement_score":0.013168641,"about_ca_system_score_codex":0.0019597476,"about_ca_system_score_gemma":0.0010975704,"threshold_uncertainty_score":0.044053495},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0048423395,0.0015507459,0.97603774,0.0008364869,0.00025354925,0.00003106659,0.000093839546,0.00045485533,0.015899397],"genre_scores_gemma":[0.27854818,0.0055478606,0.68504494,0.00051457307,0.0010733536,0.00049791014,0.00045813588,0.0028758065,0.025439229],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9974456,0.0011632211,0.00012835942,0.00016748987,0.0009704489,0.00012483665],"domain_scores_gemma":[0.99628663,0.0020548303,0.00029178453,0.0005400331,0.00068534556,0.00014126055],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0045259004,0.0014062593,0.00093868247,0.0022208095,0.00074515434,0.0027600639,0.0018710179,0.0011705924,0.0068844226],"category_scores_gemma":[0.018117106,0.00056092325,0.0013141818,0.0013115897,0.0021016232,0.005396673,0.002633751,0.0034559139,0.0030905998],"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.00003248852,0.000017006096,0.000172013,0.00016965072,0.000016219097,0.0000586073,0.00014068495,0.04509944,0.0016473294,0.92253613,0.0040102876,0.026100053],"study_design_scores_gemma":[0.000012881565,0.000021015316,0.00015357541,0.000057883546,0.0000086471355,0.000035391127,0.000040897026,0.54651904,0.0009780675,0.43837693,0.013773954,0.000021738522],"about_ca_topic_score_codex":0.0020131385,"about_ca_topic_score_gemma":0.0012012103,"teacher_disagreement_score":0.0068844226,"about_ca_system_score_codex":0.0016446876,"about_ca_system_score_gemma":0.0013346577,"threshold_uncertainty_score":0.023935556},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.17281611,0.0014934341,0.67034376,0.005895945,0.0008915508,0.00047805454,0.0021427288,0.0017169849,0.14422141],"genre_scores_gemma":[0.7869949,0.00066627556,0.17800961,0.0013368725,0.0008496735,0.000725166,0.0023387047,0.0011279464,0.02795097],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9925047,0.0019106875,0.00040614887,0.0020977715,0.0016364983,0.0014441648],"domain_scores_gemma":[0.9566793,0.03118307,0.0025840758,0.002074486,0.005714758,0.0017642668],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.008150615,0.0017940465,0.0019160787,0.0033315842,0.0028492417,0.0080367075,0.0027350713,0.002585701,0.024983386],"category_scores_gemma":[0.05483385,0.0011183955,0.0030586235,0.0018452178,0.0072514857,0.011653367,0.0062109972,0.007982808,0.004875279],"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.00027431565,0.00006154425,0.0011307307,0.0002593322,0.00002829741,0.00010022788,0.00018637965,0.008810799,0.0014475872,0.96798897,0.006196496,0.013515322],"study_design_scores_gemma":[0.000035834648,0.00008633708,0.0003798249,0.00007610304,0.000025214387,0.00011183403,0.000074793665,0.033428546,0.002203065,0.9598571,0.003676856,0.000044380053],"about_ca_topic_score_codex":0.0008997812,"about_ca_topic_score_gemma":0.0011900788,"teacher_disagreement_score":0.024983386,"about_ca_system_score_codex":0.0046335673,"about_ca_system_score_gemma":0.002587481,"threshold_uncertainty_score":0.08357769},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0041932417,0.00002762666,0.99486405,0.000039604212,0.000015428182,0.00001052512,0.000017610937,0.00010426332,0.00072774134],"genre_scores_gemma":[0.21219532,0.00015432676,0.7842576,0.000050440267,0.000031761592,0.00010467836,0.00016059079,0.00020377,0.0028415616],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99936754,0.00020974354,0.000024868177,0.00004963389,0.0003060389,0.00004217012],"domain_scores_gemma":[0.9991019,0.00045247102,0.00008350362,0.00017670318,0.00014211681,0.000043345288],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00087457814,0.00081132184,0.0008262533,0.001019818,0.0003982427,0.0011657926,0.0010208077,0.0012126855,0.0025668899],"category_scores_gemma":[0.005992298,0.00035836405,0.00053691806,0.0010258524,0.0012932627,0.0014334011,0.0016474662,0.0014776017,0.0012163491],"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.00013100488,0.000034219378,0.0007336356,0.00012499024,0.000024666764,0.00010150225,0.00014606222,0.55918247,0.008888063,0.34220967,0.0015371577,0.08688659],"study_design_scores_gemma":[0.000007713026,0.000023997278,0.00007428599,0.00001400713,0.0000031867764,0.000028234635,0.000026927986,0.88828194,0.0033018137,0.106025666,0.0022027863,0.000009396787],"about_ca_topic_score_codex":0.00088849885,"about_ca_topic_score_gemma":0.0012789993,"teacher_disagreement_score":0.0025668899,"about_ca_system_score_codex":0.00048923603,"about_ca_system_score_gemma":0.000400196,"threshold_uncertainty_score":0.008587122},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.081117466,0.000289878,0.9074046,0.00017131878,0.000089696034,0.000055072458,0.000103201004,0.00036198416,0.010406828],"genre_scores_gemma":[0.6957193,0.00027241584,0.2971693,0.00006601275,0.00002300263,0.00010016903,0.00023464092,0.000117323536,0.0062979357],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99957687,0.000051728537,0.000042942534,0.000058628295,0.00021387152,0.000056021352],"domain_scores_gemma":[0.9993687,0.00022809506,0.00006560622,0.0001622338,0.00011837275,0.00005690935],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00076351344,0.00035669238,0.00044999656,0.00040729519,0.00030832895,0.0010733559,0.0007262591,0.00060285465,0.0031689538],"category_scores_gemma":[0.003379656,0.00019897491,0.00045367866,0.00040106906,0.0008215413,0.0009171338,0.0015331351,0.00088200776,0.00064829946],"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.00092098024,0.000118264135,0.0021454538,0.00035295082,0.000034925153,0.00014329757,0.00040766204,0.39351016,0.047143526,0.31692427,0.004132194,0.23416632],"study_design_scores_gemma":[0.000034978148,0.00005854789,0.00024726146,0.000025337955,0.000009732052,0.00005100048,0.000030446978,0.9674058,0.009636033,0.019337907,0.0031480817,0.0000147471155],"about_ca_topic_score_codex":0.0016808393,"about_ca_topic_score_gemma":0.0015367505,"teacher_disagreement_score":0.0031689538,"about_ca_system_score_codex":0.0007764472,"about_ca_system_score_gemma":0.0007837942,"threshold_uncertainty_score":0.010601163},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.027359959,0.00029337415,0.965988,0.00012870092,0.000037793936,0.00003151718,0.000035751058,0.00029195155,0.005832993],"genre_scores_gemma":[0.7380543,0.0004321677,0.25157133,0.00011163804,0.000060277413,0.0001772578,0.00013503412,0.00038755522,0.009070554],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995447,0.0001974824,0.000020180601,0.000058459194,0.00012980877,0.00004945858],"domain_scores_gemma":[0.9990453,0.00048376134,0.00012701488,0.00012586551,0.00017272013,0.00004541233],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014851431,0.0008666658,0.0009633386,0.00041618213,0.0003090058,0.00095948216,0.00093198265,0.00086903904,0.0022661875],"category_scores_gemma":[0.0029940186,0.00044597403,0.00054263143,0.00031612752,0.0012292671,0.00100797,0.0017930467,0.0009991203,0.00047288803],"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.00009832379,0.000038888942,0.00034337823,0.00014521812,0.00002504765,0.000050806917,0.00007808778,0.92151904,0.003804519,0.042342708,0.00074975996,0.030804293],"study_design_scores_gemma":[0.00000996793,0.00003858015,0.00006872698,0.000010046252,0.000005432556,0.000008522697,0.000007444547,0.99185514,0.0011013802,0.006113984,0.0007757644,0.000005096697],"about_ca_topic_score_codex":0.0008429921,"about_ca_topic_score_gemma":0.0010590425,"teacher_disagreement_score":0.0022661875,"about_ca_system_score_codex":0.0005305462,"about_ca_system_score_gemma":0.0008309927,"threshold_uncertainty_score":0.007854283},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.024068208,0.0012833972,0.9065209,0.0024318043,0.0011563316,0.00009331558,0.00018892396,0.00058965763,0.06366748],"genre_scores_gemma":[0.47959107,0.002664139,0.40335816,0.0014040339,0.0028764773,0.00036654068,0.00055441237,0.001884897,0.107300214],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99732095,0.0008242827,0.00011201358,0.0003611557,0.0010833772,0.00029829066],"domain_scores_gemma":[0.996956,0.0014703647,0.00019838692,0.0005779881,0.00051783305,0.00027945466],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0036380047,0.0012522002,0.001754166,0.003045273,0.0024585158,0.00463858,0.0032820827,0.0016602309,0.013949282],"category_scores_gemma":[0.010941285,0.0006046696,0.0025262465,0.0028698877,0.0043489533,0.007999426,0.00530058,0.0053907745,0.003721551],"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.000014959901,0.000017087104,0.00009670687,0.000048599497,0.000011819267,0.00005005807,0.00008390956,0.0016714988,0.00028494323,0.9897002,0.0019839262,0.006036297],"study_design_scores_gemma":[0.000020052126,0.000018612409,0.000076435346,0.00002022187,0.000015219382,0.00006279502,0.000034038847,0.050688807,0.0005311603,0.941165,0.0073471726,0.000020484977],"about_ca_topic_score_codex":0.003232784,"about_ca_topic_score_gemma":0.0027800987,"teacher_disagreement_score":0.013949282,"about_ca_system_score_codex":0.0028974847,"about_ca_system_score_gemma":0.0022248917,"threshold_uncertainty_score":0.046664953},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.003805444,0.0025408647,0.8978495,0.004249136,0.0039023345,0.00015507085,0.0006880945,0.0031696584,0.08363984],"genre_scores_gemma":[0.14430937,0.0037692008,0.7227479,0.00442348,0.0071763406,0.00068557553,0.0013721682,0.009351755,0.10616417],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9817609,0.0061752046,0.0012476314,0.0033736732,0.0063273455,0.0011152775],"domain_scores_gemma":[0.9708472,0.013089865,0.00063730177,0.0078829285,0.0066887834,0.0008539857],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.013012509,0.002696566,0.0028270225,0.007650271,0.003034873,0.005984552,0.0061566727,0.0033156972,0.036565118],"category_scores_gemma":[0.058897197,0.0014503021,0.0069477656,0.0030408693,0.005655426,0.015048211,0.0102250585,0.011802989,0.023099473],"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.00023490889,0.000076673736,0.00077587576,0.0005664093,0.00014519056,0.00032374298,0.00062658684,0.005396056,0.002358752,0.82810146,0.042381182,0.1190132],"study_design_scores_gemma":[0.000044640794,0.00007652891,0.000564625,0.0002191734,0.00010261621,0.00038898777,0.0001040803,0.04670012,0.0043761777,0.8143417,0.13293464,0.00014673518],"about_ca_topic_score_codex":0.003404932,"about_ca_topic_score_gemma":0.0030733997,"teacher_disagreement_score":0.036565118,"about_ca_system_score_codex":0.0042071934,"about_ca_system_score_gemma":0.0028948078,"threshold_uncertainty_score":0.1223225},"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.019183375,0.020992162,0.16139331,0.026571661,0.01351956,0.000053030217,0.003654104,0.0019240346,0.7527088],"genre_scores_gemma":[0.39487165,0.02206723,0.0844386,0.013357256,0.013443191,0.00013552257,0.0047190124,0.0051198076,0.46184763],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99900705,0.00020234857,0.000048599843,0.0003047047,0.00034080463,0.0000964584],"domain_scores_gemma":[0.99854183,0.00056451914,0.0000861185,0.00031502853,0.00039417605,0.00009846501],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001263288,0.0016327259,0.0010668437,0.0024977752,0.0012196951,0.0028322618,0.00081897085,0.00079689466,0.07204523],"category_scores_gemma":[0.0040720752,0.0004664771,0.0013215875,0.002765257,0.002110268,0.009329983,0.0013785281,0.002888092,0.016708722],"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.00011447252,0.000024420442,0.00044764645,0.00034462952,0.000025130428,0.00013526934,0.00035796603,0.0011397573,0.0011539306,0.84572744,0.10536605,0.04516322],"study_design_scores_gemma":[0.000017159551,0.000039220995,0.00070412684,0.000118740594,0.00003042173,0.00018983145,0.00012336581,0.0013636604,0.0008967375,0.6918962,0.30458722,0.000033214445],"about_ca_topic_score_codex":0.0037086904,"about_ca_topic_score_gemma":0.0034578145,"teacher_disagreement_score":0.07204523,"about_ca_system_score_codex":0.0019338035,"about_ca_system_score_gemma":0.00052492926,"threshold_uncertainty_score":0.24101532},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.043344215,0.0051755616,0.84547496,0.003488718,0.0015361262,0.00006958407,0.0007059704,0.0020155732,0.098189406],"genre_scores_gemma":[0.7790099,0.003674528,0.1616793,0.0012204231,0.0014733218,0.000335085,0.0014203778,0.0023065398,0.048880585],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99223375,0.0011061551,0.00041934036,0.001134657,0.004240069,0.0008659666],"domain_scores_gemma":[0.9721868,0.017151976,0.0013041357,0.0041282303,0.0045645107,0.00066436006],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0066934563,0.0021945846,0.0014544112,0.0027943316,0.0013316415,0.004502727,0.0024033778,0.0014665386,0.013939302],"category_scores_gemma":[0.041288935,0.0006229791,0.001288542,0.002065411,0.0045832936,0.006924685,0.0056567425,0.004534956,0.0049198135],"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.0009980913,0.00006972948,0.00222209,0.00051646616,0.00010496936,0.00042200266,0.00046612887,0.10617497,0.0046585845,0.79242224,0.014136566,0.07780816],"study_design_scores_gemma":[0.00004009782,0.00008289965,0.00065408286,0.00029305054,0.00004943625,0.00023867142,0.00010272553,0.45709231,0.008017148,0.5197058,0.013660179,0.00006362541],"about_ca_topic_score_codex":0.0027775867,"about_ca_topic_score_gemma":0.0019806875,"teacher_disagreement_score":0.013939302,"about_ca_system_score_codex":0.0032077543,"about_ca_system_score_gemma":0.0021247477,"threshold_uncertainty_score":0.046631575},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.17752361,0.0026734497,0.7750409,0.0024289975,0.0004268953,0.000047340982,0.00053540786,0.0020391378,0.039284278],"genre_scores_gemma":[0.7309896,0.0010203538,0.2423562,0.0007801568,0.00048968085,0.0000720574,0.0007827126,0.0008536908,0.022655642],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987357,0.00022627847,0.00006719544,0.00044638535,0.00033957523,0.00018487485],"domain_scores_gemma":[0.9975298,0.0015340132,0.00021727604,0.00032127675,0.00024940728,0.00014835532],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018114055,0.0008087068,0.0009811303,0.0010174313,0.0010865643,0.002496964,0.0014244622,0.000874349,0.005952863],"category_scores_gemma":[0.00784736,0.00042697543,0.0010598277,0.0012257688,0.0019107024,0.005520119,0.0018894261,0.0024977291,0.0015291993],"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.0005034463,0.00005951878,0.0009888585,0.00034173465,0.000028598932,0.00017710136,0.00048727545,0.010289217,0.008460095,0.89103824,0.0056705684,0.08195543],"study_design_scores_gemma":[0.000054200318,0.00023958494,0.0007265136,0.0000674436,0.000062284365,0.00053573435,0.00023865225,0.087243624,0.0135693215,0.8717637,0.025444528,0.00005448764],"about_ca_topic_score_codex":0.0013528971,"about_ca_topic_score_gemma":0.0011646698,"teacher_disagreement_score":0.005952863,"about_ca_system_score_codex":0.0017038049,"about_ca_system_score_gemma":0.0005587174,"threshold_uncertainty_score":0.019914329},"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.02804562,0.0021228488,0.33749452,0.003121152,0.0033891287,0.00016557107,0.0017308753,0.0033671877,0.62056315],"genre_scores_gemma":[0.48783058,0.0026891197,0.228547,0.0026209508,0.0016084771,0.0002655861,0.002394756,0.0035751115,0.27046838],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99877745,0.0002703267,0.000058675454,0.00028190634,0.00038111562,0.00023047967],"domain_scores_gemma":[0.9988549,0.0003619398,0.0000950185,0.00028576038,0.00028434457,0.00011805852],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012022331,0.0010051692,0.0006345746,0.0015860784,0.0019043384,0.0031049305,0.00081820716,0.000784448,0.03493504],"category_scores_gemma":[0.0037998196,0.00047938447,0.0013010268,0.001448494,0.002441917,0.003902928,0.0034125014,0.0027126484,0.014225916],"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.000053574007,0.000022603486,0.00018421204,0.00009693204,0.00000549369,0.00016087669,0.00037911956,0.00060875237,0.001743121,0.9552888,0.014952858,0.026503563],"study_design_scores_gemma":[0.00003399408,0.00005990732,0.00031927193,0.00007529599,0.000017950219,0.00047816517,0.00015737723,0.0030077996,0.0065387855,0.6366189,0.35265425,0.00003830527],"about_ca_topic_score_codex":0.0015209978,"about_ca_topic_score_gemma":0.002391814,"teacher_disagreement_score":0.03493504,"about_ca_system_score_codex":0.0021999886,"about_ca_system_score_gemma":0.0008985247,"threshold_uncertainty_score":0.11686933},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.33877024,0.0002547189,0.64391553,0.00041251263,0.00013804415,0.00010743828,0.000102981416,0.0004228222,0.015875677],"genre_scores_gemma":[0.9291566,0.00013718271,0.06852288,0.000089824134,0.00004290273,0.00008845491,0.00008818739,0.000055087665,0.0018189319],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99865085,0.00034977743,0.00012291908,0.00021771615,0.00044064946,0.00021809082],"domain_scores_gemma":[0.9981729,0.00092982274,0.00019964433,0.00051446934,0.000110701745,0.00007251487],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012960914,0.00046998498,0.0005121451,0.00032071903,0.0006613853,0.001290061,0.000607134,0.0007698511,0.0023125978],"category_scores_gemma":[0.004467031,0.0004895563,0.0007639745,0.00027551857,0.0020516464,0.0016492577,0.0017215409,0.0011690464,0.000408606],"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.00029993313,0.000064027605,0.00093637715,0.00020749216,0.00003991185,0.0005514234,0.00032143868,0.047061477,0.06047709,0.8489338,0.0008623555,0.04024468],"study_design_scores_gemma":[0.00027793008,0.0005863905,0.0006304674,0.000047973193,0.000045914938,0.0007288352,0.00009871079,0.230363,0.19772802,0.5584511,0.010954285,0.00008740039],"about_ca_topic_score_codex":0.00023418314,"about_ca_topic_score_gemma":0.00018763311,"teacher_disagreement_score":0.0023125978,"about_ca_system_score_codex":0.0005964945,"about_ca_system_score_gemma":0.00058853586,"threshold_uncertainty_score":0.0077364445},"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":"other","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3569184,0.0012377499,0.23149793,0.004212594,0.0007376479,0.00007556879,0.0011493802,0.0013328104,0.402838],"genre_scores_gemma":[0.92732143,0.0005096314,0.01598641,0.0007382984,0.0005464096,0.000116503645,0.00071017107,0.00044872484,0.053622477],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.998931,0.0001932502,0.0000432997,0.00025873055,0.00036353795,0.00021010327],"domain_scores_gemma":[0.9984914,0.00046021794,0.00013506004,0.00023828569,0.00033605398,0.00033900572],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010494376,0.00076876377,0.00085962604,0.0027246238,0.0024980428,0.0036161954,0.0010981681,0.0012878274,0.01944352],"category_scores_gemma":[0.0031035112,0.00040549858,0.0011061629,0.0007560577,0.0026562926,0.0046374593,0.0027212352,0.0022356363,0.002983206],"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.000016644224,0.000013098884,0.00015253694,0.000027638405,0.000006678385,0.000077652636,0.00010622808,0.00044088298,0.0005590296,0.9948894,0.0015288567,0.0021813565],"study_design_scores_gemma":[0.000009544517,0.000011725633,0.00023947717,0.000016565877,0.000004354182,0.00015763742,0.00009178807,0.007915362,0.0006654609,0.9873962,0.0034781059,0.000013695196],"about_ca_topic_score_codex":0.0012604106,"about_ca_topic_score_gemma":0.0010205961,"teacher_disagreement_score":0.01944352,"about_ca_system_score_codex":0.0021156329,"about_ca_system_score_gemma":0.0008426235,"threshold_uncertainty_score":0.065045},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.015545485,0.00084986986,0.93094474,0.0008491902,0.00028740626,0.00010965034,0.0014286126,0.0012235034,0.04876152],"genre_scores_gemma":[0.554929,0.0023591383,0.39718327,0.0006981718,0.00093775813,0.0009709504,0.0039493144,0.0034062734,0.03556614],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9941538,0.0010468693,0.00034885877,0.0013479843,0.0022519324,0.0008504691],"domain_scores_gemma":[0.97829115,0.012763427,0.0009733239,0.0045160307,0.0025631357,0.00089296733],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0049923663,0.0022584144,0.0018176854,0.007685698,0.0022278395,0.007649228,0.0044193203,0.0020819372,0.03182616],"category_scores_gemma":[0.049321376,0.0011765312,0.003323633,0.0041690287,0.0050846254,0.01655761,0.008093619,0.0066924645,0.006189088],"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.00013065296,0.000031402975,0.0007998474,0.00030849923,0.0000577251,0.0000807068,0.00029937865,0.049176686,0.0016312413,0.9043235,0.0064922012,0.036668155],"study_design_scores_gemma":[0.0000130752915,0.000033649132,0.00038979083,0.00014236549,0.000028820627,0.00010657438,0.00008980241,0.20138732,0.0039183013,0.7776705,0.01616069,0.000059074257],"about_ca_topic_score_codex":0.0039857593,"about_ca_topic_score_gemma":0.0028053937,"teacher_disagreement_score":0.03182616,"about_ca_system_score_codex":0.0058021303,"about_ca_system_score_gemma":0.0023540726,"threshold_uncertainty_score":0.106469154},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09457189,0.0015202927,0.89544255,0.00059449876,0.00012317514,0.00007903554,0.000071418945,0.00006164806,0.0075353812],"genre_scores_gemma":[0.7547314,0.001730458,0.22636439,0.00028181425,0.00024392617,0.0002271284,0.00017230574,0.00011408052,0.016134525],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99962044,0.00011214835,0.000018046136,0.000058009486,0.00015816477,0.00003328772],"domain_scores_gemma":[0.99932027,0.00024054266,0.00013532049,0.000047872327,0.00018906842,0.00006688687],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00089574326,0.0007810876,0.00072541344,0.0010390655,0.0005288084,0.0012692406,0.00082995294,0.0014681792,0.0011310828],"category_scores_gemma":[0.0028404563,0.00040765744,0.0004853119,0.00047524326,0.0015432546,0.001701009,0.001379291,0.0010619082,0.00021847566],"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.00012164297,0.00007827606,0.001995561,0.0004390251,0.000087008375,0.00068796444,0.00045884334,0.34570685,0.031184228,0.59181815,0.0015088043,0.025913639],"study_design_scores_gemma":[0.0000073287238,0.000039451796,0.00025981333,0.000022906841,0.0000065918366,0.00012812442,0.000055137007,0.9580121,0.0019934187,0.037164576,0.002296876,0.000013595871],"about_ca_topic_score_codex":0.0019715023,"about_ca_topic_score_gemma":0.0012091824,"teacher_disagreement_score":0.0019715023,"about_ca_system_score_codex":0.00041186303,"about_ca_system_score_gemma":0.00064458343,"threshold_uncertainty_score":0.0047371984},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.621,0.002805113,0.33152056,0.0009968985,0.00015222313,0.00007290169,0.0002496013,0.00034045143,0.042862255],"genre_scores_gemma":[0.9635069,0.0013235135,0.02953489,0.00018047962,0.00043378398,0.00007220517,0.0002387082,0.000108955355,0.004600451],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9982829,0.00046971292,0.000078404846,0.00031828484,0.00062469,0.00022606073],"domain_scores_gemma":[0.98555946,0.008865674,0.0019664716,0.00090876094,0.0012406177,0.0014588846],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001610993,0.00085472135,0.00077921647,0.0033940857,0.0014163468,0.0021008113,0.00096214423,0.0013509227,0.0059749917],"category_scores_gemma":[0.014372341,0.0003997878,0.00048837217,0.0015571929,0.003847612,0.006574011,0.0028209733,0.0025471249,0.0007467947],"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.00010478454,0.00004520226,0.0011740077,0.000120687844,0.000007640644,0.00024698913,0.0005787556,0.0035364754,0.007279662,0.9722787,0.0006068589,0.014020145],"study_design_scores_gemma":[0.000019209805,0.0001298557,0.0019664657,0.000056911234,0.0000092432665,0.0004587415,0.00027404542,0.032843094,0.0027552738,0.95880646,0.0026436101,0.00003707946],"about_ca_topic_score_codex":0.0003224771,"about_ca_topic_score_gemma":0.00021235317,"teacher_disagreement_score":0.0059749917,"about_ca_system_score_codex":0.0006180321,"about_ca_system_score_gemma":0.0003108407,"threshold_uncertainty_score":0.019988298},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.056426316,0.0010423913,0.89726216,0.0013361765,0.0003995532,0.00006207611,0.00013057962,0.00027997393,0.043060824],"genre_scores_gemma":[0.8863163,0.001004905,0.09644526,0.0009574433,0.00053466717,0.0001418059,0.00013288214,0.00014210984,0.014324671],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992619,0.0001309315,0.00003985424,0.00014832507,0.00033698976,0.000081944214],"domain_scores_gemma":[0.99854726,0.0005758793,0.00014715112,0.00020204051,0.000385904,0.00014178362],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013204721,0.00064604287,0.00041694078,0.0012482259,0.000892724,0.0013143246,0.0006561777,0.00091018534,0.005311024],"category_scores_gemma":[0.004291972,0.0002555777,0.000712446,0.0005793273,0.0023933107,0.0041865394,0.0019645193,0.0019783182,0.00085606094],"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.000008594162,0.000010556794,0.00017077675,0.000031849922,0.0000069788066,0.00007850028,0.0000978199,0.0025005732,0.0033776867,0.9826293,0.0008669803,0.010220479],"study_design_scores_gemma":[0.000007833947,0.000050341438,0.00030171094,0.000019870637,0.000005667675,0.00035485474,0.000055424985,0.048457988,0.003311399,0.94021064,0.007207689,0.00001655206],"about_ca_topic_score_codex":0.0002690009,"about_ca_topic_score_gemma":0.00011789288,"teacher_disagreement_score":0.005311024,"about_ca_system_score_codex":0.00040874816,"about_ca_system_score_gemma":0.00044593497,"threshold_uncertainty_score":0.017767131},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6313591,0.0015539615,0.08742402,0.0038944224,0.0008739946,0.0000992714,0.00038162447,0.0008585569,0.27355507],"genre_scores_gemma":[0.9592962,0.0005152005,0.0071802475,0.0004440184,0.0007345683,0.0000749121,0.00023666825,0.00021982558,0.031298317],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9979176,0.00047262048,0.000114360955,0.00048663164,0.00047625913,0.0005326524],"domain_scores_gemma":[0.9969998,0.0013003333,0.00038420828,0.00021432155,0.0005912584,0.0005100047],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014424477,0.0010717241,0.0006658752,0.0037771137,0.002506753,0.004603839,0.0012344739,0.0010902394,0.02206829],"category_scores_gemma":[0.0070109954,0.000626575,0.0009362502,0.0015462597,0.0065318374,0.006669731,0.0040344545,0.0041222335,0.004307659],"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.000052678577,0.000037049515,0.0006540892,0.000058635644,0.0000104322935,0.00027127744,0.0004413292,0.00032423597,0.0012884227,0.98873013,0.0015269706,0.0066047],"study_design_scores_gemma":[0.000025167103,0.000050105544,0.00056970184,0.00003257263,0.000010136111,0.0002454853,0.0002687988,0.0022214067,0.001842619,0.9915792,0.0031236506,0.00003122163],"about_ca_topic_score_codex":0.0010092778,"about_ca_topic_score_gemma":0.0007636764,"teacher_disagreement_score":0.02206829,"about_ca_system_score_codex":0.00213071,"about_ca_system_score_gemma":0.0008069636,"threshold_uncertainty_score":0.07382578},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3257354,0.000988253,0.65239984,0.0005053906,0.00017911529,0.0000491098,0.00028151498,0.00021503141,0.019646272],"genre_scores_gemma":[0.8906508,0.00092246186,0.09112488,0.0003610596,0.0004098689,0.000085540785,0.00051792915,0.00013939888,0.015788145],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9997116,0.00003918736,0.000012530756,0.00006594985,0.00011229867,0.000058511298],"domain_scores_gemma":[0.999054,0.000176596,0.0002522368,0.000119540295,0.00022961095,0.0001680376],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00045902954,0.00051521976,0.00033717035,0.0014334694,0.00041261755,0.0011655837,0.00049435557,0.0008062492,0.0033865066],"category_scores_gemma":[0.0017300699,0.00027982626,0.00030757033,0.00052735297,0.0010981691,0.0016265397,0.0010212905,0.001159539,0.0008329989],"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.00013227752,0.00004075579,0.0007566549,0.00009465329,0.000017397377,0.00035663656,0.00028903584,0.010271486,0.060807995,0.8883481,0.001431423,0.037453584],"study_design_scores_gemma":[0.000043122665,0.0002512989,0.0026762201,0.00005851392,0.000024726736,0.00094012904,0.00026589932,0.25901446,0.018808696,0.7020627,0.015783014,0.0000711248],"about_ca_topic_score_codex":0.0002276401,"about_ca_topic_score_gemma":0.0001681933,"teacher_disagreement_score":0.0033865066,"about_ca_system_score_codex":0.0003273199,"about_ca_system_score_gemma":0.00021542727,"threshold_uncertainty_score":0.011328936},"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.26259005,0.00353188,0.25686663,0.0060071023,0.0011198688,0.0000828609,0.0010249256,0.00086169224,0.46791512],"genre_scores_gemma":[0.88019675,0.0020973291,0.064039394,0.0009088956,0.0010022706,0.00013547846,0.0008385229,0.00060727535,0.05017405],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993374,0.0001244863,0.000035853103,0.000109176326,0.00027926627,0.00011384688],"domain_scores_gemma":[0.998558,0.00074215326,0.00014729719,0.00013979773,0.0002440095,0.0001687856],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011321299,0.0008233284,0.0006639982,0.002616623,0.0016483386,0.0033786334,0.0010602146,0.00077148696,0.019432787],"category_scores_gemma":[0.006223365,0.0003739061,0.0010317527,0.0020328911,0.0027511457,0.006039387,0.0020456167,0.0022736941,0.003952322],"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.000030019719,0.0000087026665,0.00017751349,0.000038269754,0.0000038314183,0.000058216727,0.00021058829,0.00076328707,0.00030337845,0.9876837,0.0028299969,0.007892526],"study_design_scores_gemma":[0.000008327937,0.000010314903,0.00030662084,0.00002989528,0.000004940774,0.00006949064,0.00010621543,0.0050326497,0.000497812,0.9880816,0.0058415597,0.000010586688],"about_ca_topic_score_codex":0.0017624561,"about_ca_topic_score_gemma":0.0016279225,"teacher_disagreement_score":0.019432787,"about_ca_system_score_codex":0.002091153,"about_ca_system_score_gemma":0.0007533212,"threshold_uncertainty_score":0.06500912},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008212271,0.0022099244,0.9629669,0.00054283335,0.00017659804,0.000033235407,0.00011076219,0.00040853492,0.02533898],"genre_scores_gemma":[0.4075728,0.0053046164,0.55890393,0.000704661,0.00063852046,0.00022415908,0.0005534293,0.0003333288,0.025764465],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99898905,0.00030498297,0.000030746658,0.00013855335,0.00039171998,0.00014499218],"domain_scores_gemma":[0.9995468,0.0001908579,0.000041290874,0.00013198143,0.000065304404,0.000023665089],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009583073,0.0009651566,0.0012783691,0.0014533721,0.0006751624,0.0018174059,0.0012292812,0.001068032,0.0071183075],"category_scores_gemma":[0.0040998454,0.00037796874,0.000858604,0.0026226093,0.0019911248,0.0025539135,0.0019149722,0.0029758231,0.0024476722],"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.00002709406,0.000023630575,0.00007743579,0.00006613846,0.000014770764,0.00005419962,0.000037252164,0.053371202,0.0007613652,0.9020389,0.0024386237,0.041089382],"study_design_scores_gemma":[0.00001112332,0.000021956625,0.00010146505,0.00003403129,0.000007157974,0.00012683905,0.000020305493,0.20534323,0.0009551073,0.78436637,0.008991873,0.000020487365],"about_ca_topic_score_codex":0.0012432341,"about_ca_topic_score_gemma":0.0010826797,"teacher_disagreement_score":0.0071183075,"about_ca_system_score_codex":0.0007130648,"about_ca_system_score_gemma":0.00059847796,"threshold_uncertainty_score":0.023813128},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.055640575,0.002798999,0.6975409,0.0025525945,0.0038571414,0.00032833792,0.0035743932,0.009828949,0.22387816],"genre_scores_gemma":[0.32579792,0.002223885,0.5400082,0.0012633541,0.0013139064,0.00043080348,0.00572317,0.0062899417,0.1169489],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.997829,0.0002857624,0.0001813052,0.0007363621,0.0007034868,0.00026406307],"domain_scores_gemma":[0.99770373,0.00088330667,0.00016709983,0.0005461167,0.000562472,0.00013728684],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014512133,0.0016164584,0.0011913797,0.0022683223,0.0015474256,0.0042737704,0.0013019113,0.00086730515,0.036642883],"category_scores_gemma":[0.009848354,0.00065809034,0.0013797784,0.0021655334,0.0021472364,0.007246057,0.0028252997,0.0029188222,0.023278965],"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.00064991385,0.000058403006,0.0011419165,0.00041739843,0.00003582017,0.0004042579,0.0008301165,0.0018837535,0.0066558127,0.70555604,0.058955226,0.22341149],"study_design_scores_gemma":[0.00008823077,0.00017669807,0.0011335622,0.00024680782,0.00006134978,0.0008830052,0.00033088072,0.0127858,0.020466141,0.65869963,0.30504936,0.000078565055],"about_ca_topic_score_codex":0.0014213517,"about_ca_topic_score_gemma":0.001399661,"teacher_disagreement_score":0.036642883,"about_ca_system_score_codex":0.0017825102,"about_ca_system_score_gemma":0.0012646267,"threshold_uncertainty_score":0.122582614},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.77428347,0.0007125217,0.07475576,0.0011538807,0.00029950487,0.000051071787,0.00031138203,0.00083041977,0.14760198],"genre_scores_gemma":[0.9770642,0.00030081198,0.008256209,0.00016272656,0.000062000625,0.000022856748,0.00022276155,0.00019706672,0.0137115065],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9996126,0.00004827848,0.000016678043,0.000073973686,0.0001244535,0.00012400365],"domain_scores_gemma":[0.99967456,0.00008454612,0.000036509264,0.000051742078,0.00007121209,0.000081380764],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00030308144,0.00066754315,0.00046779844,0.0015018085,0.0017720187,0.002406919,0.0004545611,0.00077230594,0.007102405],"category_scores_gemma":[0.0010491527,0.00035402417,0.00073203095,0.0007737952,0.0021755758,0.0025226418,0.0021497419,0.0018998545,0.0013819344],"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.00006365824,0.000016115537,0.0011095657,0.000052090247,0.000009521188,0.00047031956,0.00073121535,0.0009338354,0.003935452,0.98246944,0.0013268086,0.008881908],"study_design_scores_gemma":[0.000034907498,0.00006576121,0.0040170737,0.00005968351,0.000044575896,0.0023599176,0.0013646261,0.01323641,0.01432504,0.93282014,0.031584162,0.000087831715],"about_ca_topic_score_codex":0.0015473976,"about_ca_topic_score_gemma":0.0008931813,"teacher_disagreement_score":0.007102405,"about_ca_system_score_codex":0.0011036289,"about_ca_system_score_gemma":0.00036884556,"threshold_uncertainty_score":0.023759902},"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.19056423,0.0020515567,0.39258257,0.0085999165,0.0013155555,0.000107133776,0.00048799638,0.0011795281,0.40311155],"genre_scores_gemma":[0.9406532,0.00039161762,0.02357054,0.000441331,0.0003222408,0.000076174074,0.000097319105,0.00028976696,0.034157693],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995964,0.00011196655,0.000012133581,0.00007527466,0.0001028348,0.00010139973],"domain_scores_gemma":[0.9984659,0.0009505328,0.00008339518,0.00022335465,0.00016902179,0.00010783003],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000786744,0.0003963265,0.00040715758,0.0009892762,0.0010878744,0.0018985883,0.0005930001,0.0008029894,0.0125630675],"category_scores_gemma":[0.0073951837,0.0002121862,0.0004737457,0.0006094821,0.0018220796,0.0022183827,0.0010125181,0.0015999173,0.0017429598],"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.00005007343,0.0000067022816,0.00018219567,0.000015670947,0.0000030806261,0.0000934,0.00007302698,0.0014752434,0.00036055487,0.98722166,0.0033724017,0.0071459482],"study_design_scores_gemma":[0.000034596356,0.000024504081,0.00025199662,0.000018059494,0.000007341647,0.00020873349,0.00004195812,0.020388784,0.0014885159,0.9615547,0.015962206,0.00001855561],"about_ca_topic_score_codex":0.0013984812,"about_ca_topic_score_gemma":0.00076785043,"teacher_disagreement_score":0.0125630675,"about_ca_system_score_codex":0.0014713599,"about_ca_system_score_gemma":0.00065324904,"threshold_uncertainty_score":0.042027712},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.021221297,0.0005103611,0.96485615,0.00068061735,0.00020209239,0.00016872623,0.00007997778,0.0009839626,0.011296878],"genre_scores_gemma":[0.47828063,0.0011103573,0.493236,0.00079546944,0.00047637537,0.0009275095,0.0003418444,0.0009594749,0.023872279],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99620914,0.0020391543,0.00012619974,0.0004574084,0.0007888207,0.00037922602],"domain_scores_gemma":[0.99193704,0.005251719,0.0003351355,0.0014687899,0.00075255206,0.00025481716],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0035954027,0.0008276086,0.001139902,0.0017834803,0.0013752773,0.0021419944,0.0013947563,0.0016918475,0.008791092],"category_scores_gemma":[0.020378832,0.0004562415,0.0011563451,0.0015113911,0.0024254809,0.004051389,0.0025643336,0.0024890844,0.0036431092],"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.0002377925,0.000084496365,0.0007258101,0.00010475385,0.000033646607,0.00015851382,0.00026999155,0.045131512,0.0026199343,0.89193046,0.005113598,0.05358944],"study_design_scores_gemma":[0.00009651704,0.00009926535,0.00016345222,0.000047592217,0.000015559555,0.00013051533,0.00005224869,0.492129,0.0031934176,0.49579257,0.008229475,0.00005042931],"about_ca_topic_score_codex":0.0016729349,"about_ca_topic_score_gemma":0.0013226791,"teacher_disagreement_score":0.008791092,"about_ca_system_score_codex":0.001113103,"about_ca_system_score_gemma":0.0014315471,"threshold_uncertainty_score":0.02940911},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.645987,0.0016496129,0.24550083,0.0034363477,0.0004994583,0.00008129254,0.0006567331,0.0006287477,0.10155999],"genre_scores_gemma":[0.94185233,0.00075918605,0.033792187,0.00024309328,0.00031877446,0.000061760984,0.00045401842,0.00026276655,0.022255924],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99854976,0.00038202974,0.00006139074,0.00028699555,0.00035737685,0.0003624467],"domain_scores_gemma":[0.99515224,0.002800534,0.0006269726,0.00036035953,0.00038381736,0.0006761093],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016742153,0.0010694539,0.0009694061,0.0021925045,0.0021988584,0.0031499653,0.0016508083,0.0010619977,0.009470162],"category_scores_gemma":[0.011273501,0.00054194394,0.001144704,0.0016925113,0.0047156066,0.005748682,0.003064496,0.0027008976,0.0018643172],"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.00008576666,0.000023080172,0.00048549083,0.000106921914,0.000011151852,0.00012401835,0.00024476676,0.0042330446,0.0009298778,0.9859453,0.00143384,0.006376753],"study_design_scores_gemma":[0.000027614504,0.000032012893,0.00029033812,0.00003065931,0.000014185964,0.0001695502,0.00018614095,0.01760785,0.0015998168,0.9770383,0.0029719523,0.00003141138],"about_ca_topic_score_codex":0.0020086465,"about_ca_topic_score_gemma":0.0026212004,"teacher_disagreement_score":0.009470162,"about_ca_system_score_codex":0.0024491234,"about_ca_system_score_gemma":0.0011592512,"threshold_uncertainty_score":0.031680882},"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.084359296,0.008118249,0.3863299,0.011494224,0.012945272,0.00017424776,0.0009380699,0.003308277,0.49233243],"genre_scores_gemma":[0.5242145,0.005060244,0.22933722,0.0051280307,0.0067131864,0.000247758,0.0012733729,0.0031636902,0.224862],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99761957,0.00034115277,0.00014831775,0.00065932545,0.0008651789,0.0003664684],"domain_scores_gemma":[0.99805546,0.0006063018,0.00017647535,0.00047245275,0.00041014692,0.00027928915],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015743026,0.0015224078,0.0008229633,0.002002586,0.0022268952,0.0039436272,0.0010921531,0.0018320009,0.0243439],"category_scores_gemma":[0.00702738,0.00079065934,0.001961219,0.0014460696,0.005551862,0.009198642,0.003167293,0.004209659,0.009815863],"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.000095927746,0.000012880102,0.00025008776,0.00007672075,0.000009267859,0.00017080433,0.0003944682,0.00024958194,0.0018303845,0.9590709,0.01130815,0.026530787],"study_design_scores_gemma":[0.000035306304,0.00006954688,0.00022185154,0.000075859905,0.000020415762,0.0006595325,0.00018054835,0.0016525529,0.005861505,0.7509041,0.24021813,0.00010065555],"about_ca_topic_score_codex":0.00062066095,"about_ca_topic_score_gemma":0.0007494918,"teacher_disagreement_score":0.0243439,"about_ca_system_score_codex":0.0019809618,"about_ca_system_score_gemma":0.001145228,"threshold_uncertainty_score":0.08143848},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.022735294,0.00077770086,0.9345696,0.000638994,0.00023078834,0.00014452547,0.0003803816,0.0037223452,0.03680037],"genre_scores_gemma":[0.28075242,0.0011276951,0.67330086,0.00027217524,0.00038180363,0.0004177981,0.0017243386,0.0031627188,0.038860295],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9981298,0.00040458998,0.00015714992,0.00038728805,0.00067077525,0.00025049414],"domain_scores_gemma":[0.99646395,0.0018862748,0.00014565469,0.00079353846,0.00055494596,0.00015562991],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0026762253,0.0017100249,0.0015642114,0.0038861502,0.0014015511,0.0053617395,0.002829559,0.0016210389,0.030655226],"category_scores_gemma":[0.013809462,0.0008051367,0.002119376,0.0027625193,0.0019163669,0.008012324,0.0061691673,0.003966522,0.012400726],"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.00020051347,0.0001354977,0.0011181707,0.00031078357,0.00007993602,0.00014195338,0.0006519809,0.019590847,0.0016450266,0.6846505,0.016324896,0.27514997],"study_design_scores_gemma":[0.000058257163,0.000044868833,0.00019613888,0.000064640946,0.00003562174,0.00012187218,0.00014463822,0.09454149,0.0023359526,0.8917059,0.010715833,0.000034875964],"about_ca_topic_score_codex":0.0017647763,"about_ca_topic_score_gemma":0.003115075,"teacher_disagreement_score":0.030655226,"about_ca_system_score_codex":0.0021212152,"about_ca_system_score_gemma":0.0013602109,"threshold_uncertainty_score":0.102552},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08315648,0.00060834835,0.8978396,0.00154643,0.0001576987,0.00023128823,0.00025212584,0.0020128035,0.014195158],"genre_scores_gemma":[0.5884463,0.0007640465,0.39763027,0.0006216496,0.00036123992,0.0005269802,0.0010068002,0.0010344462,0.009608228],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9940154,0.0010469013,0.00033546958,0.00093410217,0.002570705,0.0010975346],"domain_scores_gemma":[0.979602,0.01397655,0.0007434299,0.004104678,0.0011733677,0.00040004266],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0037234223,0.0015159856,0.0017307188,0.0013523722,0.0016479447,0.0050691934,0.003867945,0.0016611749,0.0100403335],"category_scores_gemma":[0.016043955,0.0006455812,0.0024455262,0.0017643571,0.0043064915,0.016186226,0.003956065,0.005271176,0.0020602765],"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.0032966235,0.00029827235,0.0035912357,0.00076608895,0.00023846081,0.00037270502,0.0006639368,0.19515568,0.03860526,0.5913899,0.007518997,0.15810277],"study_design_scores_gemma":[0.00016787366,0.0001840376,0.00060838467,0.000060851085,0.00011425455,0.00017783405,0.00009149268,0.6207934,0.02591597,0.34670442,0.0051023737,0.00007908675],"about_ca_topic_score_codex":0.002414175,"about_ca_topic_score_gemma":0.003214699,"teacher_disagreement_score":0.0100403335,"about_ca_system_score_codex":0.0032996235,"about_ca_system_score_gemma":0.0034102108,"threshold_uncertainty_score":0.03358829},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.14040205,0.0004911784,0.8538342,0.0002001458,0.00007664514,0.00009417854,0.000042413456,0.00017130286,0.0046878746],"genre_scores_gemma":[0.7030393,0.00048751326,0.29271796,0.00006542292,0.000079286256,0.00021393636,0.000111940535,0.0001006406,0.0031839754],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99966395,0.00010769267,0.000016891412,0.000036063375,0.00015014918,0.000025176148],"domain_scores_gemma":[0.9985594,0.00066100294,0.0001719849,0.00015293735,0.00031627764,0.000138416],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014527943,0.00068546296,0.000555047,0.000744579,0.0005343721,0.0006868885,0.000727999,0.0006162311,0.00085768814],"category_scores_gemma":[0.003965237,0.00023481634,0.0005191428,0.0004324198,0.001311004,0.00073943095,0.0010763801,0.00085502845,0.00015483334],"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.00028506818,0.00014794475,0.0028103658,0.0002258049,0.00009328819,0.00022947065,0.0002635928,0.68526995,0.02810424,0.20899646,0.0012400127,0.072333865],"study_design_scores_gemma":[0.000012607591,0.000028833452,0.00016826563,0.0000060707794,0.0000035149856,0.000024614577,0.0000063044663,0.986068,0.0014378631,0.011858916,0.00037985513,0.000005067569],"about_ca_topic_score_codex":0.00087868096,"about_ca_topic_score_gemma":0.00061992934,"teacher_disagreement_score":0.0014527943,"about_ca_system_score_codex":0.00042926948,"about_ca_system_score_gemma":0.00062042824,"threshold_uncertainty_score":0.007683158},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4755397,0.0019432902,0.12930009,0.0020055221,0.00056096126,0.00007604299,0.0009259353,0.0007010304,0.38894743],"genre_scores_gemma":[0.94463104,0.00087284995,0.01723669,0.00031402256,0.00041366907,0.00005013979,0.00064928294,0.00021790992,0.035614386],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99941516,0.000075602286,0.000028693144,0.00010221703,0.00021778078,0.00016050553],"domain_scores_gemma":[0.99908864,0.0003478011,0.000121350815,0.00011418645,0.00024587926,0.000082213504],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006540128,0.00044601256,0.00037532282,0.0016115843,0.0016371803,0.0020464766,0.00058994716,0.00047742293,0.012417065],"category_scores_gemma":[0.0029472653,0.0002153252,0.0005948376,0.0018112133,0.002426322,0.003656982,0.0013370309,0.0014429525,0.0021218958],"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.000049378974,0.0000088599445,0.0003460309,0.00006731134,0.0000039810325,0.00009740127,0.0002650319,0.0011956627,0.0005926932,0.9817908,0.0020659314,0.0135169355],"study_design_scores_gemma":[0.000026781783,0.000044678403,0.0012193993,0.000048890633,0.000012069355,0.0003570976,0.00029210016,0.0067234305,0.0022994163,0.9587891,0.030150224,0.0000367935],"about_ca_topic_score_codex":0.0037611842,"about_ca_topic_score_gemma":0.0021243233,"teacher_disagreement_score":0.012417065,"about_ca_system_score_codex":0.002025074,"about_ca_system_score_gemma":0.0009373727,"threshold_uncertainty_score":0.04153925},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.21374516,0.0032627329,0.3795214,0.02110984,0.0015469716,0.00027025823,0.0035887924,0.0018065358,0.37514833],"genre_scores_gemma":[0.7474426,0.0024278902,0.109706715,0.003482241,0.00087140256,0.00036523913,0.0041996054,0.0009153801,0.1305889],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99831665,0.00038130488,0.00011614163,0.0003904543,0.00041071695,0.00038482487],"domain_scores_gemma":[0.99618655,0.0022995076,0.0002466789,0.00046599904,0.0004603816,0.00034088892],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0023037659,0.000925395,0.001647613,0.0018836125,0.003098013,0.006716175,0.001962232,0.0031748416,0.033528388],"category_scores_gemma":[0.015541496,0.00058218185,0.0014192389,0.0023593924,0.0032479404,0.012434461,0.0048156586,0.004574772,0.005890867],"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.00014401216,0.000031247215,0.0003653363,0.00012580612,0.000012917289,0.00010025357,0.00017690113,0.0029909872,0.00018705199,0.96785676,0.012721156,0.015287503],"study_design_scores_gemma":[0.000038359547,0.000013141616,0.000112617854,0.000035321053,0.000010374342,0.00006670803,0.00011436471,0.012593204,0.0002615788,0.9791636,0.007576472,0.0000142638655],"about_ca_topic_score_codex":0.00381409,"about_ca_topic_score_gemma":0.004586976,"teacher_disagreement_score":0.033528388,"about_ca_system_score_codex":0.0033474425,"about_ca_system_score_gemma":0.0028808468,"threshold_uncertainty_score":0.1121636},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.006777307,0.0001151668,0.99040097,0.00014034222,0.00003773458,0.000044169785,0.000075935284,0.00048271156,0.001925622],"genre_scores_gemma":[0.08138299,0.00033370458,0.9108529,0.000101112906,0.000119524324,0.00022869503,0.00064502185,0.0002116306,0.006124432],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989662,0.00021930072,0.00011663246,0.00023364351,0.0003326881,0.00013149809],"domain_scores_gemma":[0.99820375,0.0009791878,0.00014872069,0.00028223117,0.0003313997,0.000054689113],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015061665,0.0010021825,0.00082328886,0.0009796689,0.0005182521,0.0026448194,0.0013114824,0.0011330039,0.0068145893],"category_scores_gemma":[0.005936256,0.0004268548,0.0012724312,0.0014478624,0.0008044208,0.0042204387,0.00214875,0.001861683,0.0032479572],"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.00026611824,0.00013367682,0.00086297665,0.00035302833,0.000058739803,0.00027685988,0.0004402033,0.06819792,0.007810299,0.41841227,0.0074914075,0.4956966],"study_design_scores_gemma":[0.00009523645,0.000121582496,0.0002547679,0.00009941783,0.000031736297,0.00032601907,0.00022472962,0.6096366,0.010002925,0.3627501,0.016419062,0.00003777515],"about_ca_topic_score_codex":0.0013673004,"about_ca_topic_score_gemma":0.0022447438,"teacher_disagreement_score":0.0068145893,"about_ca_system_score_codex":0.00095429015,"about_ca_system_score_gemma":0.0011940525,"threshold_uncertainty_score":0.022797108},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.023528833,0.000566866,0.83060247,0.00054665015,0.0006983698,0.0003047898,0.010628242,0.053887594,0.079236224],"genre_scores_gemma":[0.23422976,0.0010670158,0.62624097,0.0006777703,0.00034596905,0.0006005946,0.021746544,0.03774645,0.077344954],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99875987,0.00017459142,0.00014201114,0.00021603947,0.00050122343,0.00020627177],"domain_scores_gemma":[0.99822456,0.0005485225,0.00009617423,0.0005363176,0.0005328005,0.00006171279],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011306814,0.0013347988,0.0010012815,0.0025142843,0.0013480963,0.0034694492,0.0017147616,0.0007335627,0.07073755],"category_scores_gemma":[0.0061929347,0.0007273019,0.0017626028,0.003624727,0.0010944621,0.005085108,0.002955932,0.001880039,0.027751602],"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.000606963,0.00012235659,0.0016658128,0.0012266696,0.000049992468,0.0004585273,0.0009675377,0.010118476,0.010074578,0.32137913,0.15059973,0.5027303],"study_design_scores_gemma":[0.00019107647,0.00013725038,0.0007754709,0.00030332452,0.000070563976,0.0005392168,0.00060359796,0.049215008,0.041423462,0.32811463,0.57844484,0.00018154064],"about_ca_topic_score_codex":0.005319179,"about_ca_topic_score_gemma":0.0055632307,"teacher_disagreement_score":0.07073755,"about_ca_system_score_codex":0.0015305454,"about_ca_system_score_gemma":0.0015169862,"threshold_uncertainty_score":0.23664063},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008398625,0.00011705594,0.9761327,0.0006238002,0.00007974669,0.00007940125,0.00016120492,0.0005043252,0.01390325],"genre_scores_gemma":[0.10087226,0.00016180798,0.88655525,0.00031406656,0.00011246207,0.0003022955,0.00039372378,0.00054593687,0.0107422285],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993333,0.00014312494,0.000035539535,0.00012696332,0.00023352841,0.00012750825],"domain_scores_gemma":[0.9977702,0.0016293733,0.00009369919,0.00014304885,0.00028663615,0.00007707757],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014208711,0.0011795757,0.0011512389,0.0010578039,0.0015942696,0.0019736832,0.0026751794,0.0016739747,0.024631513],"category_scores_gemma":[0.0062883766,0.000715971,0.0015634736,0.0012926427,0.001537401,0.0022623623,0.0025339636,0.002439306,0.0031037559],"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.000251966,0.00025783054,0.0014429463,0.0004692341,0.00008498498,0.00030016078,0.0004060687,0.5409105,0.0027780395,0.2689015,0.018422857,0.16577393],"study_design_scores_gemma":[0.0000465895,0.000029559293,0.00008440171,0.000024070368,0.00001781519,0.000044645334,0.00009261894,0.9160219,0.00089063635,0.07752614,0.0052066073,0.000015011569],"about_ca_topic_score_codex":0.011310511,"about_ca_topic_score_gemma":0.016209576,"teacher_disagreement_score":0.024631513,"about_ca_system_score_codex":0.0009849403,"about_ca_system_score_gemma":0.0028883999,"threshold_uncertainty_score":0.08240056},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12743409,0.0015935967,0.8297943,0.0020816992,0.00035974832,0.00005067769,0.0005261894,0.0005025279,0.03765722],"genre_scores_gemma":[0.7917359,0.0012971958,0.16954935,0.0006280868,0.00050031935,0.00016190455,0.0008786801,0.0005521982,0.034696307],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990609,0.00034918368,0.000029295037,0.00016313317,0.000217455,0.00018002534],"domain_scores_gemma":[0.9972976,0.0018694744,0.00018390977,0.00023145594,0.00026833336,0.00014919639],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002317125,0.0011924243,0.0009926808,0.00088693073,0.0006375396,0.0018547694,0.0011196944,0.0010821847,0.0075251926],"category_scores_gemma":[0.00814408,0.00033268228,0.00051024917,0.000889782,0.0014998683,0.002086425,0.0013375285,0.0023241816,0.0012279904],"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.00039609126,0.000094361705,0.00087782455,0.00034486386,0.00006211783,0.00013124837,0.00012938346,0.13671869,0.0038436037,0.78683835,0.0104219,0.060141556],"study_design_scores_gemma":[0.00004060625,0.00011748385,0.0003849202,0.000052640225,0.000021686697,0.00010939468,0.00006028387,0.6299803,0.0032504525,0.36076623,0.005184179,0.000031720563],"about_ca_topic_score_codex":0.0016638555,"about_ca_topic_score_gemma":0.0017351543,"teacher_disagreement_score":0.0075251926,"about_ca_system_score_codex":0.0014654226,"about_ca_system_score_gemma":0.0011517368,"threshold_uncertainty_score":0.02517432},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.16913587,0.0016554764,0.46438885,0.0037097079,0.00079563784,0.00022563979,0.0029390047,0.0021717348,0.35497805],"genre_scores_gemma":[0.75519526,0.0007710156,0.13330667,0.0010626785,0.0005895429,0.00037292088,0.0035351599,0.0013661567,0.10380048],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99847716,0.00023713702,0.00015520208,0.00053736754,0.00040278974,0.00019029797],"domain_scores_gemma":[0.9980799,0.0007415256,0.00015808226,0.00032808146,0.0005511849,0.00014110823],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000982694,0.0006374473,0.00066419435,0.0011147785,0.0022599201,0.003561353,0.0014558675,0.0008602812,0.016603686],"category_scores_gemma":[0.0052502,0.00088873896,0.0015059228,0.0012032876,0.002142496,0.006163104,0.002553096,0.0020892771,0.003820353],"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.000120630764,0.00003788275,0.0006571212,0.00016033326,0.000032116168,0.00025230963,0.0007655647,0.00068129745,0.0024434046,0.96734804,0.005783293,0.021717949],"study_design_scores_gemma":[0.000033610562,0.000046736106,0.00062522525,0.000056189645,0.000051129744,0.0004254768,0.0003517209,0.0030294934,0.0040951627,0.9480346,0.043215144,0.000035390472],"about_ca_topic_score_codex":0.0021996074,"about_ca_topic_score_gemma":0.0027480638,"teacher_disagreement_score":0.016603686,"about_ca_system_score_codex":0.0011829078,"about_ca_system_score_gemma":0.00079029513,"threshold_uncertainty_score":0.055544853},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07826538,0.000808244,0.91085345,0.00024699135,0.00020256169,0.00007144503,0.000070200396,0.00020646783,0.009275198],"genre_scores_gemma":[0.6291491,0.0013165538,0.35425436,0.00015056788,0.0001868234,0.00025632227,0.00026093968,0.00013637303,0.014288952],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99980253,0.000045753077,0.00001519437,0.000023664012,0.000092888455,0.000020120593],"domain_scores_gemma":[0.99963653,0.00009288286,0.00007788829,0.000070409704,0.00006719252,0.00005500074],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004638678,0.00052526954,0.00047174445,0.00038667687,0.00039196256,0.00065133156,0.0006720607,0.00035246648,0.001061086],"category_scores_gemma":[0.0016627184,0.0001897165,0.00040694574,0.00033219802,0.0009194258,0.0012323292,0.0017037393,0.0009618409,0.00018706433],"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.00011910262,0.000042429216,0.0010048685,0.00025268525,0.000025699155,0.00011105439,0.00029276646,0.083982185,0.02952372,0.8169825,0.0016393355,0.06602359],"study_design_scores_gemma":[0.000021530761,0.000055805496,0.00034345244,0.000026922899,0.000008638795,0.00007251547,0.000020749774,0.90093225,0.0063061444,0.08147355,0.010720124,0.000018247842],"about_ca_topic_score_codex":0.000560575,"about_ca_topic_score_gemma":0.0005932197,"teacher_disagreement_score":0.001061086,"about_ca_system_score_codex":0.0003479545,"about_ca_system_score_gemma":0.0006864239,"threshold_uncertainty_score":0.003549695},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0062043546,0.00019115058,0.99069047,0.000113586444,0.000046197514,0.000022688146,0.000037847727,0.00011131408,0.0025824802],"genre_scores_gemma":[0.23728448,0.00046228836,0.74711895,0.00030834382,0.00011546557,0.00033026087,0.00030130488,0.0003725016,0.0137064345],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994185,0.00021936109,0.000018149021,0.000096224176,0.00021033555,0.000037505324],"domain_scores_gemma":[0.9994332,0.00026645776,0.00005413196,0.000070587375,0.00011798208,0.000057654506],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00093093683,0.0009448617,0.0007170851,0.00080605975,0.00034020565,0.00091087585,0.0010702382,0.0016975631,0.0027982926],"category_scores_gemma":[0.0017958115,0.00041719983,0.0009462179,0.00047373172,0.0014695444,0.0009917213,0.0020158237,0.0012870168,0.000992981],"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.00011425482,0.00008507296,0.0014591445,0.00030109516,0.0000931113,0.000257394,0.0002800054,0.6759789,0.02816383,0.17359835,0.0032825838,0.11638629],"study_design_scores_gemma":[0.000009559557,0.000025199242,0.000080678576,0.000012253778,0.0000056333165,0.000043417942,0.000014515352,0.9807209,0.001841922,0.014106414,0.0031289894,0.000010499039],"about_ca_topic_score_codex":0.0018018829,"about_ca_topic_score_gemma":0.0014148619,"teacher_disagreement_score":0.0027982926,"about_ca_system_score_codex":0.0007661606,"about_ca_system_score_gemma":0.00078816037,"threshold_uncertainty_score":0.0093612075},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.022452116,0.0000668593,0.9730348,0.000035498953,0.000022024991,0.00002588623,0.000026099386,0.00019470947,0.004142014],"genre_scores_gemma":[0.4655515,0.000301556,0.5184006,0.00006170889,0.00003133637,0.00009295991,0.00020165995,0.00016636567,0.015192271],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99937147,0.000087757246,0.000045587123,0.00007549005,0.00036447222,0.000055229695],"domain_scores_gemma":[0.9991284,0.00025430793,0.000100179976,0.00029207926,0.0001843787,0.000040739396],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010295749,0.0003241746,0.000454492,0.00053123187,0.0003139102,0.0011475688,0.0009499798,0.000591394,0.0033463768],"category_scores_gemma":[0.0031631584,0.00025453395,0.00059875863,0.0005881652,0.0009659529,0.0011908408,0.0014951676,0.0010290571,0.0007468057],"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.000110064124,0.00005954673,0.0010558605,0.00008731501,0.000017774157,0.000076290824,0.00029571154,0.19334242,0.022839215,0.6319885,0.0011047261,0.1490226],"study_design_scores_gemma":[0.000018603767,0.00007616815,0.000299305,0.000015531507,0.00001353223,0.000111864836,0.00003876038,0.9136641,0.016857468,0.05368136,0.015204305,0.000019003757],"about_ca_topic_score_codex":0.00097614893,"about_ca_topic_score_gemma":0.0015764431,"teacher_disagreement_score":0.0033463768,"about_ca_system_score_codex":0.0006116206,"about_ca_system_score_gemma":0.0006161204,"threshold_uncertainty_score":0.011194766},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04156297,0.00044888866,0.86529976,0.00095147965,0.0005213557,0.00009714028,0.0010303275,0.0046171895,0.08547091],"genre_scores_gemma":[0.6060017,0.0010792967,0.21019427,0.0016042627,0.0007484994,0.0002912941,0.0035493807,0.006350079,0.17018119],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9980878,0.00020212635,0.00008335788,0.0004286489,0.00081051415,0.0003874674],"domain_scores_gemma":[0.9964038,0.00097610976,0.00027393305,0.00075151725,0.0013873429,0.0002073343],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012647393,0.001118809,0.0009177033,0.0015901665,0.0014929716,0.003391193,0.0010757303,0.0009176767,0.027413597],"category_scores_gemma":[0.008777188,0.0005181333,0.0011824578,0.001348323,0.0020803984,0.002727009,0.0023332671,0.002068089,0.02282193],"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.00033081093,0.000106020336,0.0010330037,0.00021973181,0.00006656727,0.00041509868,0.0004524615,0.009050654,0.014961741,0.82616234,0.054421198,0.092780374],"study_design_scores_gemma":[0.00007561651,0.0001210697,0.0011640089,0.000086719476,0.000042429318,0.00063413545,0.00020785096,0.11214335,0.025518518,0.80844647,0.05144699,0.00011284646],"about_ca_topic_score_codex":0.0056191306,"about_ca_topic_score_gemma":0.0069620023,"teacher_disagreement_score":0.027413597,"about_ca_system_score_codex":0.0011422156,"about_ca_system_score_gemma":0.0016258971,"threshold_uncertainty_score":0.09170765},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.28890264,0.00062743947,0.53590673,0.001350364,0.00034088656,0.00028489812,0.00037888353,0.0014721967,0.17073588],"genre_scores_gemma":[0.8043658,0.00043773494,0.15261908,0.00023382771,0.0001352731,0.00014285398,0.00042301643,0.0005057808,0.041136555],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995277,0.00009568953,0.0000191979,0.000064283115,0.00018791825,0.00010526572],"domain_scores_gemma":[0.9995515,0.00012872455,0.00005139168,0.0000923225,0.00008550186,0.00009059193],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008996376,0.00065638445,0.00045436635,0.0016554112,0.0012035433,0.0015069449,0.00092912023,0.0006336754,0.010769073],"category_scores_gemma":[0.0013827948,0.00038139426,0.00079314155,0.00080486364,0.0020569565,0.002289051,0.0022530614,0.002068784,0.0019421246],"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.000048113587,0.000047246427,0.0003819233,0.000116825344,0.0000073120855,0.00023724722,0.0005812818,0.0019388407,0.007897787,0.9614239,0.0018760804,0.025443405],"study_design_scores_gemma":[0.00013016058,0.00018305395,0.0012976489,0.0001058528,0.000033775428,0.0013472269,0.00082908315,0.023714293,0.046319872,0.86828536,0.05763027,0.00012332361],"about_ca_topic_score_codex":0.00048307463,"about_ca_topic_score_gemma":0.0006381816,"teacher_disagreement_score":0.010769073,"about_ca_system_score_codex":0.0012538286,"about_ca_system_score_gemma":0.00045356882,"threshold_uncertainty_score":0.03602612},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.002688526,0.021520223,0.6661278,0.003022598,0.0042431736,0.00040083207,0.0068033175,0.011672222,0.28352126],"genre_scores_gemma":[0.08028163,0.023330877,0.6312187,0.008224489,0.003877051,0.0021637212,0.015809665,0.018983638,0.21611033],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99778676,0.0003986665,0.00024948127,0.00042513618,0.0009170497,0.00022292895],"domain_scores_gemma":[0.9990532,0.00028227363,0.000060619437,0.00022219266,0.0003345172,0.000047213976],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014014703,0.002891835,0.0014559812,0.0037345847,0.0023295882,0.0040447856,0.0025206555,0.0016069892,0.08632122],"category_scores_gemma":[0.0054839044,0.0012530247,0.002309796,0.0056117657,0.0016787618,0.0061561596,0.0027205055,0.004333007,0.10276023],"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.0001192956,0.00006942317,0.00016526642,0.00070300145,0.000038505877,0.00032630077,0.00029729947,0.0018822188,0.0036400873,0.6369852,0.16734767,0.18842578],"study_design_scores_gemma":[0.000020981637,0.00005038165,0.00014419059,0.00012130803,0.000009721163,0.0006567814,0.000057960897,0.002181482,0.0023801571,0.2859841,0.70831484,0.000078084],"about_ca_topic_score_codex":0.0024078041,"about_ca_topic_score_gemma":0.0022283238,"teacher_disagreement_score":0.08632122,"about_ca_system_score_codex":0.0017476518,"about_ca_system_score_gemma":0.0013704892,"threshold_uncertainty_score":0.28877324},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.043472566,0.0032500965,0.8890268,0.0030290924,0.00086799974,0.00006306174,0.00024712077,0.0006353505,0.059407856],"genre_scores_gemma":[0.7423954,0.006089957,0.20343821,0.0023722586,0.0036160967,0.0003712515,0.00075998076,0.0015262443,0.039430585],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99801,0.0005432918,0.00008980773,0.00037725968,0.00067545107,0.00030422563],"domain_scores_gemma":[0.9890191,0.007911015,0.0004912375,0.0008919848,0.0011044947,0.0005821394],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004954479,0.002261723,0.0011924863,0.0045194235,0.0015203701,0.0035128084,0.0027015372,0.0016884907,0.013744861],"category_scores_gemma":[0.020730106,0.00076475897,0.001033368,0.0017355119,0.00516652,0.01238235,0.0053279884,0.010706993,0.0025509452],"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.000038909344,0.000031855885,0.00033744323,0.00009196741,0.0000099810495,0.000059932063,0.00014740242,0.0036200406,0.0017966259,0.9820956,0.0021414002,0.00962885],"study_design_scores_gemma":[0.000013367959,0.000032071952,0.0004657536,0.00008218739,0.0000271494,0.00019542573,0.0000617015,0.056397334,0.0041402136,0.92899185,0.0095449295,0.00004788401],"about_ca_topic_score_codex":0.00077071023,"about_ca_topic_score_gemma":0.0007072173,"teacher_disagreement_score":0.013744861,"about_ca_system_score_codex":0.0023042655,"about_ca_system_score_gemma":0.000926624,"threshold_uncertainty_score":0.04598117},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.75530916,0.0010988435,0.1689146,0.004342269,0.00012546446,0.00021172986,0.0005283329,0.0002486986,0.069220856],"genre_scores_gemma":[0.8446387,0.00037600021,0.14946875,0.00021940478,0.000067816596,0.00019554335,0.00045006062,0.00006984905,0.0045138258],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990181,0.00041465042,0.000041382653,0.00011226498,0.00028374785,0.00012988807],"domain_scores_gemma":[0.99163836,0.007024134,0.00031952854,0.0004849186,0.00033601274,0.00019712374],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017409273,0.00041532092,0.0007128497,0.0012674134,0.0018467797,0.0013540889,0.001365385,0.0014935234,0.0064627146],"category_scores_gemma":[0.013249067,0.00030211557,0.0008623128,0.001412867,0.0025697506,0.0032317918,0.0015797203,0.0017689242,0.00033919443],"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.0006166155,0.00030207378,0.003180442,0.00048945454,0.000077691424,0.0004345237,0.0009914197,0.1720052,0.002446106,0.7732378,0.0071377717,0.03908091],"study_design_scores_gemma":[0.00014222934,0.00014623052,0.00065256946,0.000042065574,0.000037419322,0.00022782004,0.00059802673,0.46269122,0.003204519,0.5249565,0.007270613,0.00003083594],"about_ca_topic_score_codex":0.0012365727,"about_ca_topic_score_gemma":0.0020492754,"teacher_disagreement_score":0.0064627146,"about_ca_system_score_codex":0.0008596211,"about_ca_system_score_gemma":0.00077391864,"threshold_uncertainty_score":0.021619976},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5760915,0.002395961,0.25658062,0.0085471,0.0013658548,0.00009294474,0.0008818457,0.00137242,0.1526717],"genre_scores_gemma":[0.941833,0.0006240792,0.02183815,0.00076913123,0.0016851071,0.000105567226,0.00046330216,0.00033225786,0.032349415],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9978587,0.00056470087,0.000057208057,0.00042567396,0.0007114456,0.00038220556],"domain_scores_gemma":[0.99037945,0.005643797,0.0007258319,0.000765696,0.0011988945,0.0012862482],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020103613,0.00077542465,0.0010191872,0.0031857677,0.0019233209,0.0031974078,0.0014057263,0.0011546969,0.014775041],"category_scores_gemma":[0.023024831,0.0011255619,0.0010092907,0.0017654123,0.004735016,0.0062519712,0.0035457988,0.004158287,0.0022625744],"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.00012500428,0.00003746765,0.0013444048,0.000080566024,0.000011016823,0.0002301776,0.00036239365,0.0019252006,0.0009503614,0.97782034,0.005222075,0.011891011],"study_design_scores_gemma":[0.000044026747,0.000044249296,0.0011705338,0.000028324435,0.000011594874,0.0004944387,0.00011948597,0.018866686,0.00089505326,0.973254,0.005037614,0.00003396123],"about_ca_topic_score_codex":0.0014226313,"about_ca_topic_score_gemma":0.0013043123,"teacher_disagreement_score":0.014775041,"about_ca_system_score_codex":0.0023206628,"about_ca_system_score_gemma":0.0009573395,"threshold_uncertainty_score":0.04942745},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0065162913,0.00006505825,0.9927072,0.0000434179,0.000014354235,0.000012138466,0.000009088449,0.00014650272,0.0004860151],"genre_scores_gemma":[0.27795723,0.0001917888,0.7183253,0.000087946435,0.000030499281,0.00015831717,0.000052892134,0.00010444295,0.00309155],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99974984,0.00007514569,0.000012699922,0.000027359878,0.00012115859,0.000013725998],"domain_scores_gemma":[0.9994843,0.00030757987,0.000046507637,0.00007403738,0.00006425685,0.000023307426],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00050642324,0.0003924499,0.00040552023,0.0003116457,0.0003267867,0.00035612987,0.0011315407,0.00081559597,0.0014610437],"category_scores_gemma":[0.0013363404,0.00022622073,0.0002659355,0.00024552768,0.0005855815,0.0006259606,0.0010330239,0.0007250859,0.00033616158],"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.0001677972,0.00014742115,0.0011950334,0.00027161275,0.000035930392,0.00023912548,0.00021495775,0.48997453,0.17711163,0.0409887,0.0011751158,0.28847817],"study_design_scores_gemma":[0.000011258832,0.00003648519,0.00013437682,0.000008797528,0.0000048355937,0.0000755034,0.0000062442205,0.98527145,0.0075808344,0.004944921,0.001914425,0.000010849995],"about_ca_topic_score_codex":0.00033479396,"about_ca_topic_score_gemma":0.00043588792,"teacher_disagreement_score":0.0014610437,"about_ca_system_score_codex":0.00019756047,"about_ca_system_score_gemma":0.0003057556,"threshold_uncertainty_score":0.0048876405},"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":"editorial","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00076363445,0.011873823,0.003158588,0.17367646,0.7640512,0.00006312201,0.0003842379,0.0007444627,0.045284484],"genre_scores_gemma":[0.03907506,0.016827866,0.0031010397,0.089558154,0.60999656,0.00021266696,0.00085091376,0.001412082,0.23896565],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99639016,0.000962334,0.00022928149,0.00095814443,0.0011567903,0.00030331963],"domain_scores_gemma":[0.9917657,0.002745152,0.00036394986,0.0005982612,0.0039717793,0.00055530434],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002946793,0.0020908765,0.0024540923,0.0033319185,0.0030554729,0.0030202,0.0034336904,0.0032274246,0.03654304],"category_scores_gemma":[0.017228045,0.00077869603,0.0017082236,0.0015034361,0.0030340655,0.0028075967,0.0019792344,0.00553322,0.024783025],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","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.000034233544,0.000018914901,0.000119983415,0.00013395002,0.00002378799,0.00021961631,0.00005048204,0.000096358555,0.0000854588,0.008304219,0.98587507,0.005037825],"study_design_scores_gemma":[0.000034088767,0.000042245178,0.0012019357,0.00014934855,0.000052788248,0.00043387967,0.00005511297,0.0010270162,0.0004515681,0.017546827,0.97894853,0.000056751058],"about_ca_topic_score_codex":0.010642149,"about_ca_topic_score_gemma":0.00765854,"teacher_disagreement_score":0.03654304,"about_ca_system_score_codex":0.006963344,"about_ca_system_score_gemma":0.0018005987,"threshold_uncertainty_score":0.12224865},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.004975072,0.0002622664,0.992968,0.00008232715,0.00004938957,0.000021337699,0.00002164761,0.00018391415,0.0014360013],"genre_scores_gemma":[0.23181474,0.00067200506,0.75557846,0.0001940194,0.00008318911,0.00022965131,0.00015854368,0.0002706514,0.010998827],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997073,0.00009250206,0.00000984737,0.00004105271,0.00013004425,0.000019224106],"domain_scores_gemma":[0.99979085,0.00008627566,0.00002061914,0.000030560714,0.00004752759,0.00002421377],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00053896103,0.00047971983,0.00062965025,0.00065804017,0.0003867436,0.00083905447,0.0010919751,0.0008716995,0.0024620795],"category_scores_gemma":[0.000667097,0.00020696464,0.00053155347,0.000338768,0.0009018007,0.0007829749,0.0009978603,0.00089003716,0.000819125],"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.00015047818,0.00011877156,0.002275867,0.0006257053,0.00005599798,0.0004495061,0.0005238978,0.49529877,0.05244137,0.12918478,0.0039001526,0.31497464],"study_design_scores_gemma":[0.000015168361,0.00004070339,0.00016676472,0.000029883275,0.000009204499,0.000078707024,0.000030941625,0.97868824,0.0036677814,0.00780241,0.009452322,0.000017869663],"about_ca_topic_score_codex":0.0014430556,"about_ca_topic_score_gemma":0.001298107,"teacher_disagreement_score":0.0024620795,"about_ca_system_score_codex":0.00053214055,"about_ca_system_score_gemma":0.000669066,"threshold_uncertainty_score":0.008236527},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.31257322,0.00029516785,0.65991014,0.00033019678,0.00019996434,0.00012497109,0.002619439,0.0056334827,0.018313445],"genre_scores_gemma":[0.63816965,0.00018460325,0.34857342,0.00006159644,0.000059268536,0.00011758607,0.0038013326,0.0008896713,0.008142926],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9996934,0.000024040663,0.000019533312,0.00007146271,0.00013682336,0.000054765555],"domain_scores_gemma":[0.99935776,0.0001767491,0.000061872706,0.00012766749,0.00021116689,0.00006482195],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003872108,0.00058851956,0.00076162914,0.0036970186,0.0005147284,0.002630957,0.001052732,0.00070632884,0.008306378],"category_scores_gemma":[0.0026651733,0.00033837988,0.0009031795,0.0011679188,0.00070685544,0.0020247232,0.001511296,0.0007078406,0.003265375],"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.0013491231,0.00018876925,0.02517569,0.0009962007,0.00019267226,0.0009843314,0.00097045425,0.08275378,0.055201083,0.2902289,0.019106662,0.5228523],"study_design_scores_gemma":[0.00012534129,0.0001761865,0.0060286927,0.00012671214,0.00007606576,0.0008189054,0.00045453594,0.6090661,0.036430657,0.32249796,0.024090033,0.00010875849],"about_ca_topic_score_codex":0.0009283469,"about_ca_topic_score_gemma":0.0011215877,"teacher_disagreement_score":0.008306378,"about_ca_system_score_codex":0.0010685947,"about_ca_system_score_gemma":0.0005670916,"threshold_uncertainty_score":0.027787626},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.050751664,0.000654046,0.9110639,0.0014867503,0.00014609969,0.000092075315,0.00028227866,0.0004501891,0.03507304],"genre_scores_gemma":[0.87075984,0.0014361789,0.092459105,0.0007857612,0.0010410325,0.0005584793,0.00046380475,0.0007529867,0.03174275],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99773717,0.000946163,0.000073314404,0.0003808534,0.00056118314,0.00030141493],"domain_scores_gemma":[0.9886452,0.007767619,0.00071597676,0.0013520698,0.0010750015,0.00044414733],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0033979586,0.00095501007,0.0009056174,0.0024028942,0.001089675,0.0021025855,0.0015587044,0.0010182778,0.0118232],"category_scores_gemma":[0.020254675,0.0005239747,0.0010526167,0.001350185,0.003683152,0.0054708775,0.0030636818,0.0031407168,0.0025735425],"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.000087351844,0.000021841584,0.00063195446,0.000058046535,0.000015391335,0.0001231114,0.00018271086,0.0068566585,0.002397857,0.97617143,0.0022166506,0.011236954],"study_design_scores_gemma":[0.00006635728,0.000089589805,0.00047873755,0.00005165309,0.000025786218,0.0003972761,0.00006275862,0.15716772,0.006052895,0.8277301,0.007839018,0.000038056027],"about_ca_topic_score_codex":0.000514761,"about_ca_topic_score_gemma":0.00025839807,"teacher_disagreement_score":0.0118232,"about_ca_system_score_codex":0.0017484009,"about_ca_system_score_gemma":0.00097110315,"threshold_uncertainty_score":0.03955257},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.022372376,0.0034152996,0.6600186,0.0062512183,0.0030750479,0.000069946924,0.0005737696,0.0012863486,0.30293745],"genre_scores_gemma":[0.59433794,0.003885834,0.20908222,0.004517191,0.0029999835,0.00035073858,0.00064131024,0.0029922,0.18119267],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99797255,0.00042262813,0.00010167631,0.00054819346,0.00064516516,0.0003096878],"domain_scores_gemma":[0.9983584,0.0006768698,0.00009446669,0.00037162658,0.00036580118,0.0001326871],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0027110828,0.0013866065,0.0012218986,0.002870308,0.0023891588,0.003805528,0.0027526438,0.0017369617,0.020648813],"category_scores_gemma":[0.007461971,0.000718358,0.002414662,0.0020752787,0.0045706807,0.009744806,0.005480717,0.0056602308,0.005641066],"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.00000889624,0.000005388073,0.000053495674,0.000032166707,0.0000068926,0.0000394379,0.00009400412,0.0004180705,0.00024091967,0.9902698,0.0028822473,0.0059486735],"study_design_scores_gemma":[0.000007647307,0.000008787796,0.00008161205,0.000021046157,0.000012676096,0.00008183339,0.000031545096,0.0034700704,0.00053487613,0.9792084,0.016526274,0.000015200786],"about_ca_topic_score_codex":0.0036024868,"about_ca_topic_score_gemma":0.0028217956,"teacher_disagreement_score":0.020648813,"about_ca_system_score_codex":0.0034001507,"about_ca_system_score_gemma":0.001258465,"threshold_uncertainty_score":0.069077134},"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":"editorial","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0002034259,0.004620184,0.0019906093,0.107482865,0.85545564,0.00002934689,0.00055545516,0.00032488926,0.029337587],"genre_scores_gemma":[0.014055876,0.01159508,0.0051804767,0.127995,0.3693978,0.00022133422,0.0014608603,0.0013959794,0.4686976],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9967019,0.0007971599,0.00033094213,0.0006100294,0.0013228636,0.00023709201],"domain_scores_gemma":[0.9910199,0.0022260135,0.00034024354,0.00081029243,0.0052415016,0.00036208378],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0027035268,0.0020674327,0.001969521,0.0039657475,0.004093836,0.004622887,0.0034430842,0.0047175563,0.044642847],"category_scores_gemma":[0.022327758,0.0008574966,0.0017689419,0.0022520414,0.0032780296,0.004396198,0.002105575,0.007945982,0.027138855],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","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.000014485122,0.0000048490215,0.000022119932,0.000060695926,0.000006822095,0.000041675023,0.000014948364,0.000044852473,0.000025044188,0.007681829,0.98838633,0.003696275],"study_design_scores_gemma":[0.00001645302,0.00001403377,0.0004027399,0.00012904612,0.000033323417,0.00015172902,0.000046020137,0.00039359528,0.00023042593,0.015418662,0.98313576,0.00002813745],"about_ca_topic_score_codex":0.013508261,"about_ca_topic_score_gemma":0.017773371,"teacher_disagreement_score":0.044642847,"about_ca_system_score_codex":0.006547473,"about_ca_system_score_gemma":0.0032813016,"threshold_uncertainty_score":0.14934516},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.55498624,0.028907211,0.080277115,0.13442995,0.0041563506,0.00010879404,0.000860372,0.00035537884,0.19591859],"genre_scores_gemma":[0.9455865,0.005506081,0.012999842,0.003837339,0.0023655966,0.00008523894,0.00047767657,0.00010984988,0.029031925],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988876,0.00034120842,0.00004194816,0.00036647115,0.00019017477,0.00017267294],"domain_scores_gemma":[0.9946852,0.004057183,0.00037542562,0.00034519282,0.00028354698,0.00025344323],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001487123,0.0005430624,0.0010821837,0.0011888767,0.0024002735,0.0026611444,0.00089956686,0.0015857031,0.0045778826],"category_scores_gemma":[0.013598976,0.00046856562,0.00065015844,0.0012717067,0.0042773513,0.00635374,0.0021816066,0.0043583307,0.0015189925],"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.00060666417,0.000056709734,0.0041175084,0.00016940381,0.00005261315,0.00010659779,0.0005621165,0.0047403574,0.0018504232,0.9283911,0.030322496,0.029024106],"study_design_scores_gemma":[0.0001015199,0.00023632305,0.0039620944,0.00013895273,0.00006685572,0.00045979052,0.00043796975,0.018489128,0.002514884,0.91386795,0.059657604,0.00006687396],"about_ca_topic_score_codex":0.0017582948,"about_ca_topic_score_gemma":0.0007427637,"teacher_disagreement_score":0.0045778826,"about_ca_system_score_codex":0.0031483115,"about_ca_system_score_gemma":0.0010193003,"threshold_uncertainty_score":0.022842765},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.42587987,0.0005618567,0.5209339,0.0010945181,0.00024801528,0.00017238567,0.0010007053,0.006633731,0.043475058],"genre_scores_gemma":[0.94315434,0.0002196855,0.04730497,0.00015259576,0.00016040105,0.00005669618,0.0010060143,0.0005820756,0.007363142],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9963128,0.0007368953,0.00026782943,0.0009776605,0.0011237458,0.00058102957],"domain_scores_gemma":[0.9899928,0.006328833,0.0006024593,0.001650884,0.0009959751,0.00042906188],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0030362746,0.0008383108,0.0010342031,0.002302569,0.0011694568,0.0025885762,0.0015628507,0.0006317893,0.01255324],"category_scores_gemma":[0.012663376,0.00044314007,0.001448783,0.0015530052,0.0041403393,0.008053298,0.00409866,0.0024055156,0.0019096624],"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.0012590752,0.000311525,0.014347129,0.00072104024,0.000097973345,0.001551264,0.002184735,0.016075542,0.019186346,0.691408,0.0061774706,0.24667996],"study_design_scores_gemma":[0.00006508909,0.00023066712,0.0019833425,0.00012877332,0.00007948845,0.0006257112,0.0007739183,0.041479804,0.04908766,0.8925536,0.012912085,0.00007981699],"about_ca_topic_score_codex":0.0011278823,"about_ca_topic_score_gemma":0.0010178146,"teacher_disagreement_score":0.01255324,"about_ca_system_score_codex":0.0011767807,"about_ca_system_score_gemma":0.0008306678,"threshold_uncertainty_score":0.04199481},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2040564,0.0020606928,0.4098627,0.0028902525,0.0057774656,0.00015004123,0.00052607554,0.0030409484,0.37163544],"genre_scores_gemma":[0.7584669,0.0010438211,0.07379849,0.0017322414,0.0011802426,0.0003218733,0.0004615492,0.0050147446,0.15798017],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9971533,0.0007086715,0.0001791375,0.00043332326,0.0010330933,0.00049252156],"domain_scores_gemma":[0.99672,0.0011289754,0.00023953931,0.0005191972,0.000983958,0.00040831228],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0025720336,0.000956977,0.0011500716,0.0029845678,0.002596123,0.006110563,0.0017667683,0.0019152618,0.028450007],"category_scores_gemma":[0.01578628,0.00065397384,0.0015075448,0.0015799113,0.003866306,0.008162971,0.0034903716,0.0026181042,0.0064922143],"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.00011510352,0.000031440468,0.0003150273,0.00008065787,0.000013590094,0.00024653593,0.0002153639,0.0010828646,0.0030011535,0.9679712,0.006357021,0.020570057],"study_design_scores_gemma":[0.000030043471,0.00005015492,0.00040402226,0.000050327646,0.000020289499,0.00033369064,0.00011288345,0.010106285,0.0073573324,0.95844537,0.023025395,0.00006407538],"about_ca_topic_score_codex":0.000880334,"about_ca_topic_score_gemma":0.0012076522,"teacher_disagreement_score":0.028450007,"about_ca_system_score_codex":0.0023669808,"about_ca_system_score_gemma":0.0012081647,"threshold_uncertainty_score":0.09517479},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04947808,0.0016382303,0.76605284,0.0023981945,0.0012194699,0.00018796012,0.0035707105,0.0048901895,0.17056426],"genre_scores_gemma":[0.53624064,0.0020700707,0.33514848,0.0010931819,0.0011857643,0.00037965633,0.009072685,0.0026748904,0.11213463],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9979831,0.00040880748,0.0001471582,0.0005180979,0.00064058887,0.00030211118],"domain_scores_gemma":[0.9979138,0.0006693241,0.00015472314,0.00056760584,0.0005413749,0.00015310632],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011985478,0.0013768367,0.0009692619,0.003125933,0.0017545167,0.006840492,0.0014971502,0.001421864,0.04564975],"category_scores_gemma":[0.0074728145,0.00060611643,0.0016611392,0.0025102454,0.0017941761,0.007345013,0.004420296,0.0024275999,0.017838692],"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.00007595151,0.00004920536,0.00045082832,0.0001942657,0.000028442753,0.00013932274,0.00059013866,0.0027452083,0.0016624756,0.89604723,0.02238101,0.0756359],"study_design_scores_gemma":[0.000016759817,0.000032851734,0.0001747276,0.00006693572,0.000014792151,0.0001418611,0.0003105925,0.017315688,0.0022772495,0.9340909,0.04553144,0.000026240215],"about_ca_topic_score_codex":0.0014252837,"about_ca_topic_score_gemma":0.0021231954,"teacher_disagreement_score":0.04564975,"about_ca_system_score_codex":0.0017470787,"about_ca_system_score_gemma":0.0008384922,"threshold_uncertainty_score":0.1527136},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.23866864,0.00067842664,0.7448301,0.0005648565,0.0002477728,0.000185694,0.00012905887,0.0014662677,0.013229095],"genre_scores_gemma":[0.72538286,0.0004100336,0.2680147,0.00025506408,0.00021782254,0.00009218931,0.00022022272,0.00021157434,0.0051956237],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9996093,0.000058121255,0.000038547114,0.00007185325,0.00017016058,0.00005207591],"domain_scores_gemma":[0.9992378,0.00025868023,0.00010756989,0.00023379085,0.00011994877,0.00004220222],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00043370549,0.00040901598,0.00041560887,0.0007533004,0.0004942441,0.00087362947,0.0006090518,0.000507796,0.0037791403],"category_scores_gemma":[0.0026920815,0.0001554643,0.00049140345,0.00076687755,0.0009636906,0.002355661,0.0012590663,0.0009719515,0.000692515],"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.00047078077,0.00013519016,0.0015577507,0.0002547072,0.00004059195,0.0004796412,0.0005739932,0.021525713,0.08074823,0.4949564,0.0042317733,0.39502525],"study_design_scores_gemma":[0.000149283,0.0008962184,0.000986343,0.00010866609,0.00008748245,0.0015186201,0.0002832013,0.23165062,0.13158903,0.5970373,0.035585225,0.0001080837],"about_ca_topic_score_codex":0.00020698951,"about_ca_topic_score_gemma":0.0003422791,"teacher_disagreement_score":0.0037791403,"about_ca_system_score_codex":0.00044664243,"about_ca_system_score_gemma":0.0002985297,"threshold_uncertainty_score":0.012642503},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8619494,0.0014286115,0.07360175,0.0013067056,0.00018923654,0.000019765648,0.00019935163,0.00037689795,0.060928285],"genre_scores_gemma":[0.98620474,0.00030217745,0.009894632,0.00009182939,0.00008563702,0.000019277199,0.000098919336,0.000054676813,0.0032482257],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990283,0.00023163593,0.000050364186,0.0002908756,0.00021535115,0.00018344227],"domain_scores_gemma":[0.9950223,0.0030374054,0.0004746559,0.0004775202,0.00036025373,0.00062790007],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013869355,0.00047293492,0.0008393575,0.0021900232,0.0018659481,0.0027270152,0.0012058888,0.0014282559,0.0038901728],"category_scores_gemma":[0.008686318,0.00039637863,0.000429365,0.0011893553,0.0034780176,0.005473836,0.0017252341,0.0015729668,0.0004486127],"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.00021819433,0.000030794006,0.0016226489,0.00011931755,0.000007792443,0.00013099035,0.00035960082,0.0034486456,0.0044758446,0.97831446,0.0009313314,0.010340412],"study_design_scores_gemma":[0.000019321244,0.000040946707,0.0011397052,0.000038887796,0.000016435017,0.00029430081,0.00010999724,0.008955558,0.0029723032,0.983739,0.00265014,0.000023312426],"about_ca_topic_score_codex":0.0005913219,"about_ca_topic_score_gemma":0.00063035486,"teacher_disagreement_score":0.0038901728,"about_ca_system_score_codex":0.00095385115,"about_ca_system_score_gemma":0.00032660514,"threshold_uncertainty_score":0.013013959},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0016917741,0.00007821964,0.9922436,0.00013780902,0.00007386839,0.000035887766,0.00007594571,0.0017870204,0.003875855],"genre_scores_gemma":[0.053566433,0.0002750022,0.9339249,0.00025818724,0.00019235452,0.00032193848,0.00046575043,0.0027446053,0.00825092],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99871886,0.00031176774,0.000073831456,0.00019620855,0.0005951931,0.0001042019],"domain_scores_gemma":[0.9976307,0.0010996864,0.00012557117,0.0004454998,0.00060398574,0.00009447655],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0029064629,0.001450856,0.0009977291,0.0019185526,0.0008534555,0.0022405356,0.0020221062,0.0009668298,0.01882135],"category_scores_gemma":[0.009458699,0.0005999443,0.0014534628,0.0012050327,0.0016502363,0.0040911073,0.003081866,0.0034873197,0.010551584],"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.00016909435,0.00011981417,0.00071013655,0.0006068515,0.000094525174,0.00015315233,0.0004537784,0.046418473,0.015994482,0.55860037,0.027653644,0.34902567],"study_design_scores_gemma":[0.00012820594,0.00013632816,0.00033960454,0.00011657764,0.000046926136,0.00017360794,0.00011848666,0.44664624,0.010571203,0.49821788,0.04341246,0.00009255028],"about_ca_topic_score_codex":0.0019626447,"about_ca_topic_score_gemma":0.0026301388,"teacher_disagreement_score":0.01882135,"about_ca_system_score_codex":0.0010409539,"about_ca_system_score_gemma":0.0018378305,"threshold_uncertainty_score":0.062963724},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.029965578,0.003571806,0.94179714,0.00088338146,0.000109921515,0.00009166873,0.0000477898,0.00013841498,0.02339423],"genre_scores_gemma":[0.788498,0.004329331,0.19328178,0.0006509328,0.00039765643,0.00045509802,0.00014462158,0.00040566138,0.011836817],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9968176,0.0012545658,0.000118592725,0.00024745314,0.0013674964,0.00019429713],"domain_scores_gemma":[0.98496777,0.010407399,0.00096258963,0.0009266456,0.0024218105,0.00031373033],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0063899285,0.00070486026,0.0006203575,0.0009459354,0.00070262526,0.0010501232,0.0010844149,0.0009002738,0.0024839998],"category_scores_gemma":[0.018067049,0.00034045076,0.0008902933,0.00044052376,0.0028805672,0.00275709,0.0021356298,0.0028238343,0.0005058103],"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.00016868045,0.00011234172,0.0015936835,0.0007134476,0.000053566084,0.00054778164,0.0007235837,0.12002104,0.030598126,0.7602184,0.0019531497,0.08329621],"study_design_scores_gemma":[0.000018336417,0.00014052578,0.0006608766,0.00015438964,0.000020776535,0.00031147257,0.000074393065,0.7797406,0.009475993,0.20293683,0.006428836,0.000037082606],"about_ca_topic_score_codex":0.0011903136,"about_ca_topic_score_gemma":0.000648763,"teacher_disagreement_score":0.0063899285,"about_ca_system_score_codex":0.0006036297,"about_ca_system_score_gemma":0.0008913577,"threshold_uncertainty_score":0.03379357},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09407865,0.0004626085,0.89988166,0.00040254692,0.00011948057,0.00006808467,0.000062286264,0.000084052095,0.00484051],"genre_scores_gemma":[0.8987942,0.00039424215,0.09302139,0.00012693898,0.000055594002,0.00022561096,0.000093263545,0.00005548262,0.0072332784],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9997435,0.00009354132,0.000012893882,0.000038922113,0.00008158391,0.000029534185],"domain_scores_gemma":[0.99946254,0.0002526717,0.00010017917,0.000043305146,0.000086634864,0.000054690543],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008534555,0.0007290891,0.0006666359,0.0006260417,0.00027107244,0.0010955386,0.00080804934,0.0014263382,0.0013315412],"category_scores_gemma":[0.002440606,0.00030398607,0.000633044,0.00021304697,0.0016397756,0.0007899386,0.0013766519,0.0012295909,0.00016558329],"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.00016195838,0.000085337524,0.0011843238,0.00019403025,0.00003819807,0.00020618946,0.00023184164,0.75551033,0.026410228,0.20517318,0.0003920526,0.010412402],"study_design_scores_gemma":[0.000012304267,0.000019533447,0.000047784324,0.0000065220593,0.0000023489379,0.000007724608,0.0000066473026,0.9959253,0.00066527794,0.0030190905,0.0002829901,0.0000045745182],"about_ca_topic_score_codex":0.0039218324,"about_ca_topic_score_gemma":0.0016506237,"teacher_disagreement_score":0.0039218324,"about_ca_system_score_codex":0.0008888181,"about_ca_system_score_gemma":0.0007373393,"threshold_uncertainty_score":0.007798016},"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.27052402,0.0047356375,0.19994777,0.007593411,0.0018742182,0.00011417387,0.00094696175,0.0013677516,0.51289594],"genre_scores_gemma":[0.8762427,0.0013862319,0.052383997,0.00094988645,0.0009309464,0.00018871379,0.0009919938,0.0006349914,0.066290535],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987832,0.00039006388,0.00008075704,0.00019074428,0.00033391404,0.00022139304],"domain_scores_gemma":[0.99731785,0.0015448636,0.00025281476,0.00024424907,0.00034554498,0.00029483507],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015703929,0.00085254473,0.0008377215,0.0018209076,0.001766427,0.003326003,0.0012069978,0.0011944069,0.020977614],"category_scores_gemma":[0.009052864,0.00039877094,0.0009145435,0.0016331846,0.00290856,0.006570303,0.0028780648,0.0032785514,0.003916265],"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.000073689844,0.000014647382,0.00009245546,0.000050122024,0.0000048555917,0.00008304641,0.00020219684,0.0007184382,0.00025071434,0.98576725,0.0034028818,0.009339671],"study_design_scores_gemma":[0.000019568595,0.000018450668,0.00009705407,0.000026109272,0.000006772853,0.000060425566,0.00010883367,0.0022814996,0.00038673874,0.989939,0.007044585,0.00001107615],"about_ca_topic_score_codex":0.0009064871,"about_ca_topic_score_gemma":0.00094104285,"teacher_disagreement_score":0.020977614,"about_ca_system_score_codex":0.0018960446,"about_ca_system_score_gemma":0.0009398933,"threshold_uncertainty_score":0.07017714},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0012123139,0.000029843302,0.99694425,0.000034968238,0.000022657236,0.000057487672,0.000040242285,0.0006613167,0.0009968651],"genre_scores_gemma":[0.019803451,0.000064970955,0.97757953,0.00004743916,0.000018751683,0.00018257335,0.0002638382,0.00014178095,0.0018976569],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99948585,0.000049451613,0.000051226732,0.0001264359,0.00020886312,0.00007810914],"domain_scores_gemma":[0.99956316,0.00012095936,0.0000324337,0.00007395564,0.00018301944,0.000026427222],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006202414,0.0009607226,0.00081396237,0.0010612145,0.00065322756,0.0011871628,0.0012446761,0.001302893,0.012331906],"category_scores_gemma":[0.0019882624,0.0005709458,0.000853253,0.00063123833,0.00053315767,0.0009279295,0.0018710971,0.0016841504,0.0068466174],"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.00022647339,0.00012023002,0.0005641935,0.00027680752,0.00006202921,0.00029904896,0.00029764767,0.047784165,0.061958224,0.05418431,0.0123924995,0.82183444],"study_design_scores_gemma":[0.0001851997,0.0001832471,0.00055409287,0.00006771304,0.000066886634,0.0007400277,0.00021075708,0.82967085,0.057257146,0.061600693,0.04937692,0.00008648018],"about_ca_topic_score_codex":0.0011422978,"about_ca_topic_score_gemma":0.0014577807,"teacher_disagreement_score":0.012331906,"about_ca_system_score_codex":0.00049668056,"about_ca_system_score_gemma":0.0013726138,"threshold_uncertainty_score":0.04125434},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.019454964,0.0017366023,0.96275485,0.0006136888,0.00035062182,0.00014673844,0.00039665712,0.0033199075,0.011225951],"genre_scores_gemma":[0.19576313,0.0021587603,0.7817287,0.00045393573,0.000699508,0.00045712767,0.002423988,0.0017812873,0.014533579],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9956672,0.00072948734,0.00039197263,0.0010155841,0.0017179933,0.00047774974],"domain_scores_gemma":[0.9932278,0.0027682653,0.00041877961,0.0020607314,0.0012944627,0.00023000217],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0034914464,0.002568861,0.0016147123,0.004493881,0.0014986906,0.0049519786,0.002720816,0.0017592099,0.011656279],"category_scores_gemma":[0.015179165,0.00094300497,0.0025851831,0.0043350053,0.0024329058,0.013927314,0.005513641,0.0045975023,0.0058715004],"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.00045618054,0.00021476392,0.0024159558,0.0006244788,0.000121340585,0.00010579295,0.0006055023,0.025526108,0.006903836,0.45749483,0.016019309,0.4895119],"study_design_scores_gemma":[0.00014856143,0.00019559624,0.0007211986,0.00015420375,0.000060463124,0.00027008168,0.00025134222,0.08683928,0.010670957,0.8713038,0.02928819,0.00009643311],"about_ca_topic_score_codex":0.001480814,"about_ca_topic_score_gemma":0.0014900529,"teacher_disagreement_score":0.011656279,"about_ca_system_score_codex":0.002743893,"about_ca_system_score_gemma":0.0020019,"threshold_uncertainty_score":0.038994133},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.40583095,0.00023157925,0.5557951,0.00035249427,0.000096673226,0.00014738405,0.000539039,0.001960198,0.03504665],"genre_scores_gemma":[0.7299734,0.00016158384,0.25156665,0.00009950697,0.00005500566,0.00013160899,0.001202678,0.0007793669,0.016030224],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99954176,0.000050284892,0.000025199373,0.000075570766,0.0002175752,0.00008969177],"domain_scores_gemma":[0.9995035,0.00017000227,0.00002766393,0.00010165279,0.0001292584,0.000067924135],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00037459936,0.00043991552,0.0007451817,0.0011018972,0.000759663,0.0013791708,0.0006112366,0.0005012354,0.0050435164],"category_scores_gemma":[0.0016790753,0.00022906074,0.0006002282,0.00066449004,0.0006997029,0.001370343,0.001762467,0.00085744425,0.0016804785],"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.00047829654,0.00016877997,0.004678165,0.00034235735,0.000044701257,0.00070533535,0.0011586406,0.02288884,0.045174573,0.6115121,0.0076575335,0.30519065],"study_design_scores_gemma":[0.00011878252,0.00022402946,0.0031312134,0.000089133755,0.000030389898,0.0008418392,0.00036799614,0.2578618,0.06438327,0.62708956,0.0457711,0.00009091326],"about_ca_topic_score_codex":0.0008555538,"about_ca_topic_score_gemma":0.0010459417,"teacher_disagreement_score":0.0050435164,"about_ca_system_score_codex":0.0007136681,"about_ca_system_score_gemma":0.00041048662,"threshold_uncertainty_score":0.016872227},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.43565843,0.0010224829,0.23383676,0.0020131203,0.0008462343,0.00014172292,0.0012037319,0.0011386867,0.32413888],"genre_scores_gemma":[0.8923085,0.000669757,0.040342994,0.00030580175,0.0002610592,0.000078324854,0.0006061415,0.0003215134,0.065105945],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99958044,0.000075295495,0.000014883172,0.00007721601,0.00013171566,0.00012044172],"domain_scores_gemma":[0.999273,0.00022558575,0.00013480453,0.000048135076,0.00021813222,0.00010034823],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00057643565,0.00059484126,0.00031332477,0.0014024476,0.00092287763,0.0013383714,0.00044918136,0.00036539193,0.01371383],"category_scores_gemma":[0.0027699934,0.00021969892,0.00056856615,0.00096293655,0.0011607363,0.0015234845,0.0008684199,0.0012538292,0.0035510461],"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.00007812851,0.000027357402,0.0006748198,0.00007808158,0.000008856587,0.00023998605,0.00043712484,0.0021819775,0.0021763372,0.9693745,0.0060421913,0.018680582],"study_design_scores_gemma":[0.00005587942,0.00012254991,0.0026413915,0.00007363004,0.000023518676,0.00059256883,0.00050858,0.024667881,0.0082663465,0.8945694,0.06840917,0.000069067704],"about_ca_topic_score_codex":0.0028737425,"about_ca_topic_score_gemma":0.003433237,"teacher_disagreement_score":0.01371383,"about_ca_system_score_codex":0.001528259,"about_ca_system_score_gemma":0.000628438,"threshold_uncertainty_score":0.045877337},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07127927,0.00037940074,0.9026431,0.00027550943,0.00014297345,0.000048570146,0.0001247622,0.00033154752,0.024774874],"genre_scores_gemma":[0.6446385,0.0006797491,0.33513093,0.00026947577,0.00011158647,0.00016658285,0.00039134116,0.00074108917,0.017870732],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99937445,0.0001415984,0.00003313926,0.000093111244,0.00028841753,0.00006936553],"domain_scores_gemma":[0.99869776,0.000399709,0.0001248047,0.00021145532,0.00047228634,0.00009394958],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009233882,0.00054871535,0.00054225756,0.0011498355,0.00089939026,0.0024261454,0.0007475416,0.0009098801,0.0061986567],"category_scores_gemma":[0.004722666,0.0003266101,0.00050588505,0.0009272074,0.0021449723,0.002785777,0.0016606901,0.001646102,0.0031229372],"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.00009983033,0.00002057963,0.0006112923,0.00008499666,0.000009892811,0.00009097477,0.00028260465,0.013402302,0.0039508054,0.93830425,0.0022481608,0.040894393],"study_design_scores_gemma":[0.000021080135,0.000051308158,0.00040659288,0.000067510104,0.00001081086,0.00029669708,0.00022801985,0.14880462,0.007959184,0.8215961,0.02051287,0.000045177112],"about_ca_topic_score_codex":0.0012192061,"about_ca_topic_score_gemma":0.0009404845,"teacher_disagreement_score":0.0061986567,"about_ca_system_score_codex":0.00056379975,"about_ca_system_score_gemma":0.0005471621,"threshold_uncertainty_score":0.020736516},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.45073566,0.0028483726,0.21392715,0.0038951002,0.0015291665,0.00010637187,0.00095524656,0.0015555776,0.32444742],"genre_scores_gemma":[0.90197164,0.001272518,0.027544536,0.0005971412,0.0010805603,0.000101523336,0.000443939,0.000630493,0.066357605],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989736,0.00020238254,0.000038694325,0.0001707404,0.00036933197,0.00024526266],"domain_scores_gemma":[0.9985386,0.0005107136,0.00017997481,0.00021811873,0.00027239395,0.00028026395],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014568147,0.00065129367,0.0006907758,0.0031978986,0.0019360773,0.0031198214,0.0010795298,0.0008131507,0.012893996],"category_scores_gemma":[0.005046659,0.00046033112,0.0010881652,0.0019305851,0.0027600664,0.0037409659,0.0019785103,0.0021754568,0.0028649794],"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.000027687607,0.000013190482,0.00022052192,0.000034468892,0.000004703238,0.00007093254,0.00019736658,0.00085391063,0.00034478263,0.98893076,0.002495546,0.006806064],"study_design_scores_gemma":[0.0000166506,0.000017679666,0.00050860463,0.000025512601,0.000008850161,0.00026921518,0.00013532626,0.011892143,0.0008050191,0.9769597,0.00933307,0.000028179129],"about_ca_topic_score_codex":0.0010947055,"about_ca_topic_score_gemma":0.0011752464,"teacher_disagreement_score":0.012893996,"about_ca_system_score_codex":0.0022196157,"about_ca_system_score_gemma":0.0011238144,"threshold_uncertainty_score":0.04313475},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2563856,0.0022500954,0.6489664,0.0088851,0.00068021356,0.00037802587,0.006153252,0.026524976,0.049776293],"genre_scores_gemma":[0.7539713,0.0010334366,0.21148069,0.00095995364,0.0006899275,0.0002131019,0.0075076213,0.0027469855,0.02139704],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99660957,0.00037912765,0.00022749178,0.00092397706,0.0012578365,0.00060208625],"domain_scores_gemma":[0.9924091,0.004167018,0.00046779984,0.0017563862,0.0007828803,0.00041681126],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019839166,0.0017545453,0.0019214848,0.001448494,0.0014820519,0.007330658,0.0028904811,0.0014801973,0.022970071],"category_scores_gemma":[0.016239114,0.00073430274,0.002407079,0.0023316203,0.0018478718,0.01275353,0.0050995112,0.003989005,0.009000111],"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.0027788472,0.0007724381,0.011076813,0.0026465002,0.00043390592,0.0014224373,0.0017499607,0.122966364,0.026032832,0.32860747,0.100524016,0.40098837],"study_design_scores_gemma":[0.00039091497,0.00012939685,0.0011963114,0.00008712283,0.00013559146,0.0004799494,0.00041461736,0.27688807,0.015416273,0.69087124,0.013905991,0.000084511295],"about_ca_topic_score_codex":0.004148918,"about_ca_topic_score_gemma":0.0066552428,"teacher_disagreement_score":0.022970071,"about_ca_system_score_codex":0.004040537,"about_ca_system_score_gemma":0.0032979758,"threshold_uncertainty_score":0.07684255},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.41098398,0.0062536662,0.21447988,0.008121968,0.0017581495,0.00024299524,0.0022441817,0.0021238024,0.35379145],"genre_scores_gemma":[0.7751668,0.0016383062,0.14375052,0.001373017,0.0005030501,0.00017982886,0.0033765906,0.00087510847,0.07313669],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994332,0.00009019348,0.000036603768,0.0001602449,0.00016840079,0.000111433794],"domain_scores_gemma":[0.9979772,0.001241437,0.0001394865,0.00021073666,0.00030757012,0.00012369786],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010544308,0.0007437018,0.0011247703,0.002688319,0.0024154452,0.0026871483,0.0007584236,0.0014284396,0.030349191],"category_scores_gemma":[0.009700951,0.00057210773,0.0010788984,0.0025600255,0.0013599033,0.004210245,0.0016803617,0.0018412295,0.006707649],"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.00040623284,0.000085904365,0.0017755472,0.00033806346,0.000032289525,0.0014552579,0.0007365027,0.0018854801,0.004234481,0.88256025,0.028051373,0.078438565],"study_design_scores_gemma":[0.000093437644,0.0000936297,0.0006729535,0.0001347891,0.00004004189,0.0012266852,0.00059556705,0.010181758,0.0065885456,0.9022634,0.07806449,0.00004461248],"about_ca_topic_score_codex":0.0010428216,"about_ca_topic_score_gemma":0.0016972648,"teacher_disagreement_score":0.030349191,"about_ca_system_score_codex":0.0015108378,"about_ca_system_score_gemma":0.0011183961,"threshold_uncertainty_score":0.10152817},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.043606758,0.0008794931,0.88975054,0.0011038472,0.00037981838,0.0002862666,0.0018252167,0.01837542,0.043792713],"genre_scores_gemma":[0.24977058,0.00055237545,0.71516323,0.00034378626,0.00016197312,0.00035944325,0.004489494,0.0040471684,0.025111921],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9976598,0.0005089765,0.0001740399,0.00043404146,0.00077328086,0.00044984318],"domain_scores_gemma":[0.9971866,0.0011476489,0.00014292075,0.00091317226,0.0004400376,0.00016955822],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019151835,0.0016763812,0.0011654223,0.0017094883,0.0013325746,0.0029307979,0.0023499373,0.0013936218,0.027347906],"category_scores_gemma":[0.0058577973,0.00089088856,0.0018159896,0.0024061883,0.0013243078,0.005226119,0.0068995147,0.0027140456,0.015652617],"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.0009867498,0.00021481073,0.0024575884,0.0012487968,0.00008130064,0.0005951637,0.0011343099,0.014682809,0.026545318,0.43281993,0.05142281,0.46781036],"study_design_scores_gemma":[0.0004050989,0.00028200756,0.0013266181,0.0003861095,0.00012486853,0.0012461479,0.0010048287,0.1171292,0.09805382,0.5943648,0.1855009,0.00017550959],"about_ca_topic_score_codex":0.0010419055,"about_ca_topic_score_gemma":0.001208868,"teacher_disagreement_score":0.027347906,"about_ca_system_score_codex":0.0016596437,"about_ca_system_score_gemma":0.0014274755,"threshold_uncertainty_score":0.091487825},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.25473365,0.00025671886,0.729393,0.00033554342,0.00014935841,0.00008613524,0.00042196372,0.0022278284,0.012395788],"genre_scores_gemma":[0.7867309,0.00019136701,0.20505567,0.000083571606,0.000116292336,0.0000904875,0.0007042897,0.0005390555,0.006488372],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.999084,0.00017479972,0.00006617687,0.00021164083,0.00030688223,0.00015646039],"domain_scores_gemma":[0.9987973,0.00048011166,0.000103952305,0.0002578828,0.0002498154,0.00011090778],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010342377,0.00070116436,0.000625005,0.0021737104,0.0010281355,0.0028707066,0.0013026058,0.000644863,0.0086927675],"category_scores_gemma":[0.0047629443,0.00040961802,0.0007338736,0.0016304099,0.0015867074,0.0050643478,0.0022737905,0.0010752461,0.0015677157],"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.00022080819,0.000115151706,0.0024270874,0.00025822181,0.000056891808,0.00018409721,0.00069258985,0.03128249,0.011277876,0.8537607,0.0043617906,0.09536228],"study_design_scores_gemma":[0.000037387228,0.0000616383,0.0004225716,0.000022368067,0.000020001695,0.000073389085,0.00016994616,0.15526389,0.012025168,0.82750314,0.0043664104,0.00003409084],"about_ca_topic_score_codex":0.00091396563,"about_ca_topic_score_gemma":0.0014670318,"teacher_disagreement_score":0.0086927675,"about_ca_system_score_codex":0.0010749394,"about_ca_system_score_gemma":0.00079044956,"threshold_uncertainty_score":0.029080212},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.016744476,0.00018097181,0.97912025,0.00010153293,0.00004543484,0.000021766617,0.00005471266,0.00008221642,0.003648631],"genre_scores_gemma":[0.5085809,0.00078001653,0.4807182,0.000120347606,0.00012674637,0.00012086727,0.00022592914,0.00013300106,0.0091939755],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9996419,0.00007129429,0.000024053208,0.00005022532,0.00017072415,0.0000417193],"domain_scores_gemma":[0.99942833,0.00019959579,0.00009449842,0.000122036305,0.000121288045,0.00003425896],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011614386,0.00045298855,0.0005411387,0.0007153609,0.00032326818,0.00076335744,0.0006379106,0.0007068848,0.0028238639],"category_scores_gemma":[0.0024997639,0.0002123558,0.00063494005,0.0008167412,0.00082848757,0.0012193588,0.0009482242,0.0014540781,0.00038603874],"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.00007568813,0.000039907136,0.0009634934,0.00007571491,0.000017553171,0.00019806392,0.00015218243,0.07918837,0.01818371,0.83610165,0.0012975767,0.063706145],"study_design_scores_gemma":[0.000014442865,0.0001279132,0.0006351483,0.00002640426,0.00001753082,0.00036224257,0.00005304143,0.83690727,0.016527386,0.1268994,0.01839145,0.00003777247],"about_ca_topic_score_codex":0.0006136696,"about_ca_topic_score_gemma":0.00058501755,"teacher_disagreement_score":0.0028238639,"about_ca_system_score_codex":0.00044072853,"about_ca_system_score_gemma":0.00040309594,"threshold_uncertainty_score":0.00944674},"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13014077,0.0032384195,0.25003922,0.0024916716,0.0020184936,0.00011107788,0.0015363455,0.0012917705,0.6091323],"genre_scores_gemma":[0.74686086,0.0018346369,0.103513405,0.0010692743,0.0008369402,0.00021224971,0.0022066468,0.0011039692,0.14236204],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987708,0.00029867643,0.000073997006,0.00024047896,0.00040854217,0.00020760299],"domain_scores_gemma":[0.9991592,0.00032495984,0.0000934068,0.000109347326,0.00024075083,0.00007240227],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008182864,0.00077652454,0.0005996139,0.0023276783,0.0023220663,0.0035010055,0.0008213084,0.00080234505,0.023442863],"category_scores_gemma":[0.0050127073,0.0003722212,0.000931469,0.0023258,0.0026981286,0.004400445,0.0024253074,0.0017760247,0.00573045],"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.0000668086,0.000015098375,0.0004718232,0.000086486114,0.000006713103,0.00025737943,0.0004918245,0.0010907057,0.00069830305,0.9669347,0.009002341,0.020877771],"study_design_scores_gemma":[0.000028285234,0.000050262803,0.001280776,0.00012271159,0.000020772477,0.00055803853,0.00054009375,0.0067528784,0.0027278867,0.73750407,0.2503728,0.00004139469],"about_ca_topic_score_codex":0.004437391,"about_ca_topic_score_gemma":0.004851569,"teacher_disagreement_score":0.023442863,"about_ca_system_score_codex":0.002375331,"about_ca_system_score_gemma":0.0006279477,"threshold_uncertainty_score":0.078424215},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07266891,0.00029523377,0.89859635,0.0005625578,0.0003580409,0.00008095348,0.00053310196,0.004620978,0.022283854],"genre_scores_gemma":[0.58789265,0.00047432265,0.3868037,0.0002215875,0.00039013222,0.00021713196,0.0012052486,0.0025442194,0.020251011],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989992,0.00017914985,0.000050119605,0.0001524771,0.00044351435,0.00017552084],"domain_scores_gemma":[0.9976902,0.0010134395,0.00018126855,0.00045562914,0.00048333948,0.00017615424],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014380505,0.0011147674,0.0010403096,0.002861254,0.0010324848,0.0025294602,0.0018546918,0.00078665256,0.01816077],"category_scores_gemma":[0.012445239,0.0005493692,0.0014717592,0.0014159556,0.0013958405,0.0039845007,0.0024570674,0.0021690838,0.007704497],"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.00053032493,0.00014197733,0.004694068,0.0005166634,0.00009681274,0.00044832684,0.0005530346,0.089307345,0.017707529,0.608239,0.01942866,0.25833625],"study_design_scores_gemma":[0.00007609678,0.0000725252,0.0012513938,0.0000842861,0.000034587218,0.00017761347,0.0001104367,0.5577128,0.016869808,0.40950122,0.014022795,0.00008645407],"about_ca_topic_score_codex":0.0028004714,"about_ca_topic_score_gemma":0.0040586283,"teacher_disagreement_score":0.01816077,"about_ca_system_score_codex":0.0015971054,"about_ca_system_score_gemma":0.0015937164,"threshold_uncertainty_score":0.060753822},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.013793045,0.0010811524,0.95289856,0.00042969402,0.00051815726,0.0001117032,0.00015416114,0.0013046488,0.029708866],"genre_scores_gemma":[0.2509769,0.0020836475,0.7195783,0.00034472917,0.0004785552,0.00027631628,0.00042204725,0.0007444428,0.02509503],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989573,0.00018843643,0.00009224343,0.00021849421,0.00042954652,0.000113937465],"domain_scores_gemma":[0.99930763,0.0001529911,0.000060127797,0.00026050262,0.00016560007,0.000053083848],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00083981233,0.0008981468,0.0006411074,0.0014375055,0.0010108058,0.002864428,0.0010309878,0.000933252,0.0084095495],"category_scores_gemma":[0.0033376256,0.00044633623,0.0006029015,0.0019135253,0.0015691125,0.0037083554,0.0025054335,0.002327521,0.0061000884],"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.00016296297,0.000030211833,0.00031686848,0.00016813405,0.000009959461,0.00026638023,0.00020814917,0.006129957,0.013599871,0.8469387,0.0058640046,0.12630482],"study_design_scores_gemma":[0.00008174356,0.0002018834,0.0003075086,0.00016971324,0.000028425373,0.0016145076,0.0001121812,0.09015799,0.04337376,0.6495623,0.21427418,0.00011578792],"about_ca_topic_score_codex":0.0004451482,"about_ca_topic_score_gemma":0.00036084297,"teacher_disagreement_score":0.0084095495,"about_ca_system_score_codex":0.0008812236,"about_ca_system_score_gemma":0.0008614254,"threshold_uncertainty_score":0.028132796},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010303064,0.00063230644,0.946139,0.00062335323,0.0014177912,0.00006368246,0.00013735892,0.0027861486,0.037897307],"genre_scores_gemma":[0.12429582,0.0009372205,0.8351493,0.00046240605,0.0007571531,0.00014067299,0.00036997598,0.002294786,0.035592664],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99854666,0.00021165714,0.00008306544,0.00033925072,0.0007124278,0.00010689581],"domain_scores_gemma":[0.9985184,0.0005526711,0.00009445165,0.00043004422,0.00033064914,0.00007386975],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013109053,0.0011383308,0.0007012873,0.0014349027,0.00081446284,0.0032070165,0.0011370021,0.0005950834,0.018453397],"category_scores_gemma":[0.006479994,0.00051462784,0.0010368273,0.0014302315,0.0017040855,0.0060260375,0.002750366,0.0022901674,0.010626165],"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.00034197263,0.000051842504,0.0003710775,0.00025411867,0.000037906113,0.0003609246,0.0004522592,0.0055504064,0.031230971,0.6547036,0.025101475,0.28154352],"study_design_scores_gemma":[0.000088852656,0.00016321057,0.00035726884,0.000089773566,0.00004297215,0.00074923434,0.00013900212,0.082222834,0.08643981,0.5949469,0.2346721,0.00008797391],"about_ca_topic_score_codex":0.0005845407,"about_ca_topic_score_gemma":0.0011362236,"teacher_disagreement_score":0.018453397,"about_ca_system_score_codex":0.00079523155,"about_ca_system_score_gemma":0.0006239777,"threshold_uncertainty_score":0.06173271},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.25850907,0.00048722135,0.71707326,0.00060001505,0.00009499676,0.00016648775,0.00070925953,0.0036325117,0.018727185],"genre_scores_gemma":[0.774015,0.00039862577,0.21373338,0.0000822432,0.00019637904,0.00017681,0.0016170818,0.000794532,0.008985985],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9979487,0.00030739093,0.00012196631,0.00048613938,0.0008222467,0.0003136011],"domain_scores_gemma":[0.99523807,0.0023850428,0.00036455705,0.0010045007,0.0006670432,0.00034075862],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001738098,0.00106277,0.0012406737,0.004093146,0.0009875322,0.00344259,0.0016848905,0.0007880361,0.006832421],"category_scores_gemma":[0.013795553,0.00039277348,0.0010119317,0.0024555472,0.0022420804,0.006258187,0.0030243895,0.0017171205,0.0019491257],"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.00051446963,0.00009725728,0.011581532,0.00036731586,0.00008458349,0.00042924492,0.0007751908,0.069258705,0.007271415,0.7069178,0.0071539083,0.19554849],"study_design_scores_gemma":[0.000055369284,0.00008206793,0.001859128,0.000051888786,0.00003137379,0.00029052712,0.00012191232,0.3481417,0.013917067,0.6298924,0.0054920483,0.00006448697],"about_ca_topic_score_codex":0.002580688,"about_ca_topic_score_gemma":0.0018241233,"teacher_disagreement_score":0.006832421,"about_ca_system_score_codex":0.0021652768,"about_ca_system_score_gemma":0.0011263175,"threshold_uncertainty_score":0.022856712},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.024098897,0.00052970985,0.86922646,0.0006954351,0.00058498123,0.0002816191,0.002328726,0.009934676,0.09231955],"genre_scores_gemma":[0.20132294,0.000734828,0.7431112,0.0005001164,0.00027926205,0.00042990808,0.0053757345,0.0045348657,0.04371113],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988403,0.00013702038,0.00006720416,0.00022835762,0.00053319725,0.00019399876],"domain_scores_gemma":[0.9985038,0.00046574057,0.00008197198,0.00042308524,0.00045400593,0.000071359966],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00082324096,0.0011803736,0.0007493589,0.0031050046,0.0012488621,0.0025323804,0.0014074068,0.00076889613,0.06630375],"category_scores_gemma":[0.0065634097,0.0004389497,0.0016230814,0.0022222002,0.0008705018,0.0029329013,0.0027222396,0.00183038,0.023604326],"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.00021368016,0.00010292058,0.0017291496,0.0005897421,0.000058342663,0.00028579007,0.00045816743,0.012230555,0.009205897,0.30700433,0.0646924,0.603429],"study_design_scores_gemma":[0.00015041292,0.00015388503,0.0019578573,0.00022084043,0.00007532766,0.00072742876,0.0005040977,0.11830571,0.051834244,0.624224,0.2017035,0.00014264486],"about_ca_topic_score_codex":0.003048732,"about_ca_topic_score_gemma":0.0056443596,"teacher_disagreement_score":0.06630375,"about_ca_system_score_codex":0.0015352081,"about_ca_system_score_gemma":0.0014156079,"threshold_uncertainty_score":0.2218082},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.40607563,0.0037361516,0.18028615,0.032584872,0.001443473,0.00039739336,0.0012284548,0.0010219556,0.3732259],"genre_scores_gemma":[0.94519943,0.0013574889,0.023069188,0.0014012496,0.0007855873,0.00026506142,0.0006978277,0.0001827411,0.027041469],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99494815,0.001473198,0.00022244763,0.0008165247,0.0013506312,0.0011890713],"domain_scores_gemma":[0.99348676,0.004020669,0.0004213846,0.0011688835,0.00045755284,0.00044477065],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003696971,0.001290877,0.0018570068,0.0014454804,0.0037735684,0.004116068,0.002530092,0.0028390463,0.01279921],"category_scores_gemma":[0.014280485,0.0006324331,0.001579597,0.00194939,0.004822121,0.013057935,0.00969281,0.006973167,0.003071622],"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.0003428925,0.00006939244,0.00043390837,0.00009305894,0.000030712963,0.00019415579,0.0004026116,0.003831577,0.0006304013,0.9719552,0.009909323,0.01210669],"study_design_scores_gemma":[0.00009737003,0.000027904089,0.00011897055,0.000022174658,0.000014751798,0.00006973351,0.00008617364,0.019426424,0.0008793329,0.9741687,0.005068393,0.00002016897],"about_ca_topic_score_codex":0.001631291,"about_ca_topic_score_gemma":0.00062251167,"teacher_disagreement_score":0.01279921,"about_ca_system_score_codex":0.0029042417,"about_ca_system_score_gemma":0.0029745686,"threshold_uncertainty_score":0.042817593},"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":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.012304626,0.0033648426,0.16071981,0.056534644,0.33526465,0.00045282897,0.016239405,0.062489357,0.35262984],"genre_scores_gemma":[0.15526047,0.0038109575,0.07411565,0.012094986,0.02823517,0.0006093893,0.03292041,0.029220294,0.66373265],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9961733,0.0006319037,0.0002995083,0.00089201354,0.001609668,0.00039361554],"domain_scores_gemma":[0.9918194,0.001991182,0.00027075358,0.0018235963,0.003749655,0.00034535356],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019168467,0.0022184344,0.0019232688,0.0022188493,0.0018491283,0.0033626405,0.0025032084,0.0019740588,0.261823],"category_scores_gemma":[0.0172271,0.0011148794,0.0024535088,0.0019676997,0.001918117,0.00421998,0.0025331937,0.0030185075,0.108961105],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","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.00020590855,0.00004289181,0.00029418856,0.0002079826,0.00005338104,0.00026325285,0.00008809611,0.0007316778,0.0010977506,0.018796606,0.94369066,0.034527548],"study_design_scores_gemma":[0.00014037747,0.00017582245,0.0020780843,0.0001578046,0.00010204705,0.0007165983,0.00018808567,0.009527183,0.012153839,0.05027888,0.92436063,0.000120559904],"about_ca_topic_score_codex":0.006210735,"about_ca_topic_score_gemma":0.0066316416,"teacher_disagreement_score":0.261823,"about_ca_system_score_codex":0.004017501,"about_ca_system_score_gemma":0.0016059895,"threshold_uncertainty_score":0.8758852},"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03907812,0.010530679,0.41308653,0.0093139745,0.0020285922,0.00013921894,0.002636275,0.0021953103,0.5209914],"genre_scores_gemma":[0.6640134,0.010723011,0.15723364,0.003642511,0.003546524,0.0008687916,0.0055624326,0.0023444225,0.15206523],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99541736,0.0007620048,0.00027302495,0.0010178523,0.0016999837,0.00082981464],"domain_scores_gemma":[0.98971087,0.0064500542,0.0005842794,0.0010753453,0.001634379,0.00054509414],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0038141806,0.0021281464,0.001421732,0.00640892,0.0029644321,0.00953933,0.0024756594,0.0018118583,0.04191367],"category_scores_gemma":[0.021140086,0.0008684638,0.0024777786,0.0042528277,0.003578408,0.013940685,0.0058769863,0.0075391266,0.014710059],"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.000101743724,0.000023842398,0.0005223329,0.00019107865,0.000023455705,0.00006314062,0.00017799334,0.0013934829,0.00043933233,0.95894665,0.011659976,0.026456973],"study_design_scores_gemma":[0.000016026122,0.000024645826,0.00039449855,0.00010469507,0.000036636266,0.000092465896,0.000082897976,0.0055066296,0.0010355724,0.9613897,0.031294197,0.000022026403],"about_ca_topic_score_codex":0.0021503987,"about_ca_topic_score_gemma":0.0028114268,"teacher_disagreement_score":0.04191367,"about_ca_system_score_codex":0.0045873574,"about_ca_system_score_gemma":0.0015403873,"threshold_uncertainty_score":0.14021516},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.55824804,0.0007171936,0.27380988,0.0013880382,0.0004243989,0.0001532418,0.0008750249,0.0015799875,0.1628042],"genre_scores_gemma":[0.9343169,0.0003322479,0.036094517,0.00020063126,0.00018502101,0.000072613395,0.0006822136,0.00041717954,0.027698696],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987909,0.00028022917,0.00007392726,0.00019792888,0.00035158504,0.00030540736],"domain_scores_gemma":[0.99911326,0.00031964786,0.00009210671,0.00021860587,0.00011634432,0.00013998368],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009351296,0.00071470067,0.0006368145,0.0018776603,0.0012842409,0.0033571576,0.0007939848,0.0007547037,0.01035005],"category_scores_gemma":[0.0026363416,0.00052456936,0.0014438776,0.0013163891,0.0021920977,0.0038007568,0.003929324,0.0017083382,0.0023677354],"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.000037558286,0.000022421924,0.00027562282,0.00003681531,0.000007365343,0.000088568275,0.00073042116,0.0013985146,0.0010787371,0.9836901,0.0014627766,0.011171122],"study_design_scores_gemma":[0.000025181784,0.000031933705,0.00027755665,0.000025560024,0.000013098919,0.00008569644,0.00038538163,0.004874322,0.0019574391,0.9810083,0.011294091,0.00002143155],"about_ca_topic_score_codex":0.001303271,"about_ca_topic_score_gemma":0.0016457409,"teacher_disagreement_score":0.01035005,"about_ca_system_score_codex":0.0019311889,"about_ca_system_score_gemma":0.000622953,"threshold_uncertainty_score":0.03462434},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5948325,0.00060572993,0.30477607,0.000813953,0.0003379747,0.00011669088,0.0009684491,0.0025886325,0.094959944],"genre_scores_gemma":[0.89662457,0.00023279278,0.067837164,0.00011354256,0.00014407873,0.00006857397,0.0010642695,0.0008295054,0.03308547],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993362,0.000094078256,0.00003935594,0.0001328567,0.00023635667,0.00016121338],"domain_scores_gemma":[0.9988907,0.0005710729,0.000113450216,0.00011754304,0.00018465293,0.00012257328],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010610542,0.0006555148,0.0006507709,0.0015981254,0.0010661163,0.003739356,0.0014001263,0.00071568077,0.020301502],"category_scores_gemma":[0.0040266714,0.00044674656,0.0011489673,0.0010623529,0.0019113299,0.005892138,0.0019355686,0.0014645383,0.0029500492],"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.00031044654,0.00005392221,0.0026806076,0.0002315825,0.000027933955,0.00020455704,0.0006605979,0.00890326,0.0025948938,0.9436842,0.005669834,0.034978177],"study_design_scores_gemma":[0.0000789769,0.000102832746,0.0014061998,0.00008196196,0.000034073957,0.00016156722,0.00045751082,0.066672444,0.011751592,0.8975325,0.021664627,0.000055787277],"about_ca_topic_score_codex":0.0027536128,"about_ca_topic_score_gemma":0.0031429704,"teacher_disagreement_score":0.020301502,"about_ca_system_score_codex":0.003115768,"about_ca_system_score_gemma":0.0005649565,"threshold_uncertainty_score":0.06791526},"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.041788764,0.028427878,0.10113159,0.090075344,0.007970827,0.00007321476,0.0010668692,0.001776235,0.7276892],"genre_scores_gemma":[0.5345034,0.022030365,0.12505151,0.018350735,0.009000132,0.0002449961,0.0019293238,0.0026598503,0.28622967],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9986922,0.0004390341,0.00006732601,0.00034201043,0.0002967496,0.00016259389],"domain_scores_gemma":[0.99704957,0.0015603625,0.0001597315,0.00047695026,0.00053039036,0.00022299295],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0025671793,0.00089963415,0.0013807946,0.002093421,0.003102856,0.0055916877,0.0011180366,0.002620525,0.051826555],"category_scores_gemma":[0.0131056085,0.000633289,0.0010220527,0.0017784516,0.004012471,0.012593579,0.003222596,0.0059574647,0.011554746],"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.000024782692,0.000008008925,0.00005028894,0.000054596356,0.0000029227797,0.000037466707,0.0001166007,0.00013322671,0.00010979569,0.9728382,0.0158513,0.010772784],"study_design_scores_gemma":[0.000009478112,0.000007379006,0.000034992896,0.000041043866,0.0000023003163,0.00005586636,0.000062751824,0.00067897147,0.00018585924,0.9531626,0.045751974,0.0000066953917],"about_ca_topic_score_codex":0.0013017023,"about_ca_topic_score_gemma":0.0019713626,"teacher_disagreement_score":0.051826555,"about_ca_system_score_codex":0.0035960553,"about_ca_system_score_gemma":0.0015822651,"threshold_uncertainty_score":0.1733771},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.017458899,0.00010054144,0.97130805,0.00014274986,0.000082637845,0.00006319962,0.00016868026,0.0030801657,0.007594961],"genre_scores_gemma":[0.22960696,0.0001961597,0.7563858,0.0001409295,0.00007949429,0.00024064034,0.00053422054,0.0017573232,0.011058409],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.999516,0.000080296886,0.0000311609,0.00011840658,0.0001665527,0.00008745512],"domain_scores_gemma":[0.9991959,0.0001794336,0.000058083864,0.00032934188,0.00017585784,0.00006137378],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007604829,0.0006117608,0.0010044139,0.0015415254,0.00093552173,0.0013115067,0.0015995633,0.00051404396,0.011803822],"category_scores_gemma":[0.0025874795,0.0004196367,0.001012767,0.0013700697,0.0009610348,0.0029370107,0.001554392,0.001046021,0.002906829],"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.00060848513,0.00015837287,0.0022159822,0.00032623252,0.00009440071,0.00031216696,0.0005211267,0.15378273,0.020218903,0.3495663,0.01566058,0.45653477],"study_design_scores_gemma":[0.00016532974,0.000057762372,0.0004742451,0.000033086104,0.00003159378,0.00008800306,0.00009096765,0.7068238,0.0103610605,0.26510188,0.016712954,0.000059292146],"about_ca_topic_score_codex":0.005795308,"about_ca_topic_score_gemma":0.009553916,"teacher_disagreement_score":0.011803822,"about_ca_system_score_codex":0.0011190418,"about_ca_system_score_gemma":0.0015278726,"threshold_uncertainty_score":0.03948778},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.030479444,0.009527764,0.78124136,0.007033039,0.0032715762,0.00015330497,0.000558439,0.002998932,0.16473618],"genre_scores_gemma":[0.5705795,0.009562354,0.29991218,0.0035245295,0.005989629,0.001152751,0.0016461124,0.00806607,0.09956682],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9969573,0.0011173743,0.0001511833,0.00055223954,0.0008714879,0.00035039216],"domain_scores_gemma":[0.9885053,0.006718034,0.00039875717,0.0014457263,0.002218251,0.00071399054],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.006625098,0.0032081753,0.0022850425,0.0075074467,0.002386695,0.004769934,0.0039470936,0.00269711,0.031547654],"category_scores_gemma":[0.02883893,0.0006976699,0.0028476964,0.0022555604,0.0037056946,0.010179128,0.006209658,0.009147316,0.011596985],"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.00034705727,0.00013287048,0.0011114823,0.00080999907,0.0000939502,0.0005976749,0.0005999135,0.009617619,0.0067397584,0.90106916,0.02357204,0.055308457],"study_design_scores_gemma":[0.000058177546,0.000115304196,0.0011453653,0.00062197115,0.00020462918,0.00051799085,0.00021915414,0.16461845,0.009372373,0.77030414,0.052675363,0.00014705064],"about_ca_topic_score_codex":0.0020097462,"about_ca_topic_score_gemma":0.0018130954,"teacher_disagreement_score":0.031547654,"about_ca_system_score_codex":0.0034341165,"about_ca_system_score_gemma":0.0015710202,"threshold_uncertainty_score":0.105537474},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.053946413,0.00036244304,0.86283946,0.00090649567,0.00021254012,0.000096791686,0.00031256062,0.0012911652,0.08003205],"genre_scores_gemma":[0.7004074,0.0006630118,0.2624012,0.00037462846,0.00028038048,0.00016868235,0.0004439736,0.00071498513,0.03454572],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992042,0.0001961555,0.000040899766,0.00016552705,0.00022582615,0.00016736757],"domain_scores_gemma":[0.9991905,0.0001998635,0.0000649435,0.000337886,0.00012150552,0.00008533741],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001060941,0.00050353113,0.000411981,0.0012301838,0.0009850721,0.002680616,0.001021766,0.00062255526,0.012609325],"category_scores_gemma":[0.002479094,0.000273854,0.0006408194,0.00104223,0.003188246,0.009323119,0.0032561633,0.0021440694,0.002212222],"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.000015624664,0.0000052504643,0.00010470439,0.0000334468,0.0000025282595,0.000035962283,0.00020962807,0.00060500717,0.00060530764,0.98783714,0.0009010103,0.00964439],"study_design_scores_gemma":[0.000020613043,0.00005443964,0.00021653964,0.000039807852,0.000015996175,0.00017176577,0.00031556367,0.007857605,0.0037501624,0.9360493,0.051481996,0.000026227359],"about_ca_topic_score_codex":0.00063220435,"about_ca_topic_score_gemma":0.00071737013,"teacher_disagreement_score":0.012609325,"about_ca_system_score_codex":0.00088719354,"about_ca_system_score_gemma":0.000771222,"threshold_uncertainty_score":0.042182446},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0048467037,0.0006414445,0.9857026,0.00024931645,0.000079223806,0.00004740678,0.00005001665,0.00008616952,0.008297166],"genre_scores_gemma":[0.28463462,0.0026047912,0.6748916,0.00048285682,0.00023144778,0.0006150098,0.00035171592,0.0005996547,0.035588328],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99917454,0.00040502314,0.000038075934,0.00006637667,0.00026701446,0.0000488652],"domain_scores_gemma":[0.9981034,0.00095321087,0.00013470712,0.00018319032,0.0005360127,0.00008948594],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0027721028,0.0011048065,0.00075828226,0.001074534,0.0006370006,0.001081555,0.0013687446,0.0014642419,0.0046985704],"category_scores_gemma":[0.005658398,0.00034763615,0.0012264958,0.0009039509,0.0015214477,0.0013689043,0.0018143472,0.002599548,0.0017243762],"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.00013571733,0.00007154762,0.0010312515,0.00051987974,0.00007124904,0.00013873981,0.00032535772,0.20613842,0.010075413,0.7172122,0.0053581377,0.058921993],"study_design_scores_gemma":[0.0000072600387,0.000025175892,0.0000937645,0.000027406104,0.000008508747,0.000038849164,0.000024799976,0.9621372,0.0012828554,0.033092033,0.0032473195,0.0000148205945],"about_ca_topic_score_codex":0.0038010548,"about_ca_topic_score_gemma":0.0037331406,"teacher_disagreement_score":0.0046985704,"about_ca_system_score_codex":0.0012935152,"about_ca_system_score_gemma":0.0014591105,"threshold_uncertainty_score":0.015718281},"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":"commentary","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0009217906,0.014338125,0.010389121,0.54181504,0.2728409,0.00007957589,0.0016285449,0.0018193576,0.15616757],"genre_scores_gemma":[0.02461337,0.014556354,0.008499219,0.3299721,0.14088306,0.00031367605,0.0018954385,0.0036237612,0.47564316],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99629503,0.001226706,0.00029963092,0.00056696887,0.0012973055,0.00031429212],"domain_scores_gemma":[0.9880604,0.005042215,0.00050279003,0.00078222214,0.004927909,0.00068443315],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004294163,0.0017914217,0.0011791773,0.002825078,0.003488069,0.004838496,0.0028186939,0.005568615,0.10368608],"category_scores_gemma":[0.03207294,0.0005664569,0.0018018367,0.0032566832,0.0034702306,0.009904954,0.002941466,0.008542029,0.05748585],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","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.000026814902,0.0000050386925,0.00005626831,0.00007688986,0.00000332782,0.00008767173,0.0001471229,0.0000544142,0.00007067919,0.025076078,0.9689398,0.005455866],"study_design_scores_gemma":[0.0000048750726,0.0000060316056,0.00008437573,0.00009591032,0.0000018283336,0.000070579285,0.00010456499,0.000066764645,0.00006854846,0.007569959,0.99191636,0.000010203054],"about_ca_topic_score_codex":0.008801578,"about_ca_topic_score_gemma":0.0072605642,"teacher_disagreement_score":0.10368608,"about_ca_system_score_codex":0.004955177,"about_ca_system_score_gemma":0.0017813,"threshold_uncertainty_score":0.34686446},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.62223625,0.0012298647,0.34343144,0.0029717048,0.00011712736,0.00030016733,0.00034966873,0.0019322117,0.027431458],"genre_scores_gemma":[0.9156591,0.00075766613,0.07438552,0.00013331822,0.00020176654,0.0000940719,0.0006023085,0.00014641149,0.008019809],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99930096,0.00016033619,0.000028933475,0.000111774294,0.00025076172,0.00014718526],"domain_scores_gemma":[0.9978078,0.001268039,0.00017995805,0.00030665015,0.00018656456,0.00025101105],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001243776,0.00048873265,0.00082305504,0.0015604144,0.001323122,0.0024728077,0.0009975187,0.00055322004,0.0049317125],"category_scores_gemma":[0.005132789,0.0004847398,0.000749714,0.0010720622,0.0030190614,0.0051070717,0.0029999884,0.0018100645,0.001097308],"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.00048152942,0.00018598478,0.003443842,0.0004372287,0.00003081287,0.0003927021,0.0011975893,0.025872646,0.008456051,0.8743017,0.00513648,0.08006349],"study_design_scores_gemma":[0.000097325275,0.000084805346,0.0008533224,0.000035148478,0.000023057222,0.00021680727,0.0003342149,0.10892124,0.0123951165,0.8703532,0.0066558835,0.000029841878],"about_ca_topic_score_codex":0.000898899,"about_ca_topic_score_gemma":0.0012029043,"teacher_disagreement_score":0.0049317125,"about_ca_system_score_codex":0.001577079,"about_ca_system_score_gemma":0.0007194644,"threshold_uncertainty_score":0.016498268},"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.25953576,0.0012211779,0.27938563,0.0020564238,0.0015453221,0.00027086362,0.0013896637,0.0026814083,0.45191374],"genre_scores_gemma":[0.8109307,0.0013800684,0.058821652,0.00056021754,0.0008830951,0.0001922753,0.0016899253,0.002643986,0.12289807],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.999008,0.00012617893,0.000042478525,0.00013838141,0.00046607706,0.00021888156],"domain_scores_gemma":[0.99921155,0.00017432256,0.00012862482,0.00016776944,0.00022095801,0.00009670032],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011163721,0.001701708,0.0008951989,0.0037589672,0.0012116537,0.0044766665,0.0013244004,0.001201877,0.038510658],"category_scores_gemma":[0.0035629051,0.00042247228,0.0011465352,0.0015829245,0.0018636422,0.004411114,0.0025557056,0.0026543834,0.012614379],"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.000041340987,0.00004380831,0.00050038827,0.00008304466,0.000012186344,0.00018658285,0.00027665772,0.002941628,0.0010076676,0.96485496,0.0051594377,0.024892336],"study_design_scores_gemma":[0.000034447618,0.000050931645,0.0013743672,0.00008681291,0.000025691623,0.00036117926,0.0003122844,0.025209768,0.005190774,0.92571706,0.04156612,0.00007054717],"about_ca_topic_score_codex":0.0014797061,"about_ca_topic_score_gemma":0.0017188862,"teacher_disagreement_score":0.038510658,"about_ca_system_score_codex":0.0020620741,"about_ca_system_score_gemma":0.0010715429,"threshold_uncertainty_score":0.12883097},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.49397534,0.0015593062,0.255076,0.0024037713,0.00037662804,0.000090439964,0.00042734892,0.0034853283,0.2426058],"genre_scores_gemma":[0.93574286,0.00037233983,0.046323795,0.00019668168,0.00017365527,0.00004348936,0.00025685492,0.0003427366,0.016547695],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.999721,0.00007986669,0.000009425347,0.000046100948,0.00008679134,0.000056852907],"domain_scores_gemma":[0.9997466,0.00009501603,0.000024320727,0.000048154998,0.000037716272,0.000048254664],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00033192136,0.00050938246,0.0003260293,0.0017867754,0.0010178708,0.0019839825,0.00045567128,0.0007220206,0.00913549],"category_scores_gemma":[0.0010250928,0.00023189682,0.0003391582,0.0007902097,0.0019200268,0.003621321,0.0025499722,0.0011670508,0.0012298761],"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.0001333288,0.000023202814,0.00094259746,0.00007504933,0.000009239322,0.00047588046,0.0034526787,0.0025616628,0.009615626,0.95350903,0.004104295,0.02509735],"study_design_scores_gemma":[0.000028269093,0.000062303516,0.0016121828,0.0000459237,0.000012697021,0.00067629735,0.0015805729,0.013685785,0.005636935,0.8836221,0.09300592,0.000031089625],"about_ca_topic_score_codex":0.00052394794,"about_ca_topic_score_gemma":0.00064375676,"teacher_disagreement_score":0.00913549,"about_ca_system_score_codex":0.0005224192,"about_ca_system_score_gemma":0.00019974398,"threshold_uncertainty_score":0.030561268},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.043640055,0.0024709695,0.94567615,0.00061874767,0.00013479982,0.00002911469,0.000048235863,0.000112868925,0.0072690276],"genre_scores_gemma":[0.61873245,0.0065234466,0.36847946,0.00020356503,0.00031685483,0.00014776096,0.00015987271,0.00013222464,0.0053043594],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.999658,0.00014517039,0.000020615867,0.000026734515,0.00011135569,0.00003818099],"domain_scores_gemma":[0.9990902,0.00043170628,0.00009945146,0.00011129785,0.00019358227,0.00007376916],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016268186,0.00062148523,0.000667283,0.0016076847,0.00042259248,0.00097098853,0.00042467768,0.00077205134,0.0012167715],"category_scores_gemma":[0.0036666302,0.0002879858,0.0005798079,0.0013702603,0.0014748934,0.0011516957,0.0014732365,0.0015571653,0.00039483845],"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.000043236847,0.000057710826,0.0005124702,0.00016408737,0.000020749421,0.00010317385,0.00025979048,0.083104186,0.011695501,0.8603138,0.00091770367,0.042807564],"study_design_scores_gemma":[0.000013644134,0.00006547279,0.00027595245,0.0000533463,0.000008514586,0.00009457313,0.000116872594,0.63051957,0.004068933,0.3590145,0.005742246,0.000026255575],"about_ca_topic_score_codex":0.00042725558,"about_ca_topic_score_gemma":0.00035490008,"teacher_disagreement_score":0.0016268186,"about_ca_system_score_codex":0.00030880465,"about_ca_system_score_gemma":0.00048151086,"threshold_uncertainty_score":0.008603573},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.036707412,0.0008363604,0.9474175,0.0005886074,0.00012529617,0.00007463461,0.00028751345,0.002047295,0.011915328],"genre_scores_gemma":[0.42052478,0.0010535589,0.5683435,0.0003951799,0.0002624009,0.00032749586,0.0011038196,0.0018229585,0.006166334],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99487287,0.0016582666,0.00023091456,0.0009944629,0.0014466018,0.00079676614],"domain_scores_gemma":[0.97010744,0.019832706,0.001616443,0.0056540007,0.0018928959,0.00089650333],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0071136276,0.0015807818,0.0018719077,0.0046577267,0.0017638627,0.0048745614,0.004254466,0.0016930246,0.012845316],"category_scores_gemma":[0.05356318,0.0011598107,0.001290603,0.0036862814,0.003824856,0.012793252,0.0034401712,0.005262075,0.0037779321],"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.0011940178,0.00026492972,0.0053605977,0.00051644945,0.00006468897,0.0001748112,0.0008997261,0.19120675,0.0065534883,0.59329516,0.015269175,0.18520021],"study_design_scores_gemma":[0.00009871133,0.000090652095,0.0012312998,0.00018976784,0.000041346717,0.00013594664,0.00018756538,0.52982813,0.010724034,0.4435405,0.013824453,0.00010757916],"about_ca_topic_score_codex":0.0027859544,"about_ca_topic_score_gemma":0.0043242485,"teacher_disagreement_score":0.012845316,"about_ca_system_score_codex":0.0042038425,"about_ca_system_score_gemma":0.0018684842,"threshold_uncertainty_score":0.04297185},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.25396052,0.0015324409,0.6149784,0.002162793,0.00050760055,0.00020412308,0.0021639124,0.0023514654,0.122138776],"genre_scores_gemma":[0.714721,0.0010633159,0.23039338,0.0005617695,0.000388572,0.00025479431,0.0034560524,0.0010896769,0.048071373],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99903154,0.00017253452,0.00006629468,0.0002615477,0.000250048,0.00021793669],"domain_scores_gemma":[0.9983877,0.00091786456,0.00009388558,0.00019408698,0.00027691413,0.00012947933],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017097612,0.0010736069,0.0011316523,0.0015824512,0.0016980505,0.0036468047,0.0013192552,0.0008047635,0.015066485],"category_scores_gemma":[0.0055403244,0.00046406063,0.0017666128,0.0016708712,0.0027136172,0.009086708,0.0029947532,0.0020419261,0.0028134275],"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.00021789617,0.000035978403,0.00094201777,0.00025872578,0.00002837221,0.0001419979,0.0004724212,0.0057319044,0.0010846189,0.95113766,0.006468154,0.033480298],"study_design_scores_gemma":[0.0000347566,0.00003663488,0.00035473626,0.00006910711,0.000027846463,0.000115743125,0.0001545599,0.01257033,0.0014875942,0.97344095,0.011684085,0.000023612485],"about_ca_topic_score_codex":0.002773097,"about_ca_topic_score_gemma":0.0043541864,"teacher_disagreement_score":0.015066485,"about_ca_system_score_codex":0.0027564897,"about_ca_system_score_gemma":0.0010159105,"threshold_uncertainty_score":0.050402403},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.62506825,0.0030713035,0.3212476,0.002604623,0.00024276401,0.00008984335,0.0006143251,0.00107498,0.045986284],"genre_scores_gemma":[0.97801846,0.001718832,0.010810067,0.00021072576,0.00036958948,0.00014700173,0.00059421244,0.0003656552,0.00776555],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99897337,0.0003665638,0.00003192584,0.00018364206,0.00024997216,0.00019462005],"domain_scores_gemma":[0.9878813,0.007836041,0.0012914459,0.00078469474,0.0013125883,0.000893998],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0031612194,0.0007942815,0.0008673647,0.0036960104,0.00093765854,0.002221229,0.0017812686,0.00097466813,0.009359467],"category_scores_gemma":[0.026500618,0.0005359928,0.00091678393,0.0014103216,0.004133505,0.00359502,0.0016552252,0.002594484,0.0012544565],"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.00021289097,0.00006853189,0.004196354,0.0003196253,0.000060513445,0.00035912113,0.0005422218,0.023834862,0.005147515,0.9479932,0.0034709347,0.013794269],"study_design_scores_gemma":[0.00006979427,0.000118687596,0.00926508,0.00031851736,0.00007051207,0.0008794081,0.00070450705,0.3320157,0.005834503,0.646089,0.0044656387,0.00016864036],"about_ca_topic_score_codex":0.002158001,"about_ca_topic_score_gemma":0.0010797915,"teacher_disagreement_score":0.009359467,"about_ca_system_score_codex":0.0020289768,"about_ca_system_score_gemma":0.0009149375,"threshold_uncertainty_score":0.03131056},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008536661,0.00039384136,0.97284126,0.0008441802,0.00019414273,0.00006617871,0.00015335737,0.00090134423,0.016069027],"genre_scores_gemma":[0.23440991,0.0007828944,0.7151266,0.00061600446,0.0003790409,0.00039661067,0.0010990073,0.0014686651,0.04572128],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99911934,0.00027874397,0.000059248374,0.00018601053,0.00024248225,0.00011420945],"domain_scores_gemma":[0.9975376,0.0014502095,0.00012704314,0.0003138518,0.00043146976,0.00013987294],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011983127,0.0010354088,0.000691272,0.00084257167,0.0009405952,0.0017808235,0.0017123553,0.0013740133,0.021138733],"category_scores_gemma":[0.008528688,0.00054734934,0.0009735609,0.0010658081,0.0009841889,0.003264042,0.0037660273,0.00239187,0.0062510944],"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.00018453972,0.00017322763,0.0014267477,0.0004459497,0.00008874652,0.00020105779,0.00054338045,0.17122509,0.002422773,0.5832943,0.036690906,0.20330335],"study_design_scores_gemma":[0.00004363947,0.000027388118,0.00014157647,0.00002803456,0.000008657512,0.000060082664,0.00010238336,0.5022758,0.00082077464,0.48717418,0.009300921,0.000016536653],"about_ca_topic_score_codex":0.002361309,"about_ca_topic_score_gemma":0.0036848756,"teacher_disagreement_score":0.021138733,"about_ca_system_score_codex":0.0009595453,"about_ca_system_score_gemma":0.0008458549,"threshold_uncertainty_score":0.07071608},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06464407,0.00015698894,0.9317518,0.00012485682,0.00003873694,0.00004877671,0.000024995283,0.00007347216,0.0031363775],"genre_scores_gemma":[0.3865793,0.00037116333,0.6020599,0.00009715515,0.000034383003,0.00017377303,0.00011811761,0.000111179106,0.010455094],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99974424,0.00005823347,0.000017533583,0.000047129004,0.00011481815,0.000018146107],"domain_scores_gemma":[0.999491,0.00017290894,0.00006426292,0.000076137534,0.00010509475,0.000090614354],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011116762,0.00033639156,0.0005375105,0.000519265,0.0004135788,0.0006762188,0.0007762582,0.0007448739,0.00095313665],"category_scores_gemma":[0.0026784842,0.0002389469,0.00055254553,0.0002206129,0.0012551796,0.001504723,0.0020881293,0.0014030494,0.00021402056],"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.0000739345,0.000056361525,0.00077922456,0.00011087923,0.000014507658,0.00019983077,0.000438442,0.09971021,0.037166137,0.81490153,0.0007470902,0.045801852],"study_design_scores_gemma":[0.000044869506,0.00024912262,0.00027385433,0.00006129514,0.000011817613,0.00030416352,0.00009304922,0.78926045,0.015673375,0.18115532,0.012833814,0.000038908947],"about_ca_topic_score_codex":0.00044325268,"about_ca_topic_score_gemma":0.000412102,"teacher_disagreement_score":0.0011116762,"about_ca_system_score_codex":0.0006955738,"about_ca_system_score_gemma":0.00060593593,"threshold_uncertainty_score":0.0058791637},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0012393766,0.0003526111,0.9900681,0.00015950408,0.00020069296,0.000019714567,0.0001189966,0.0005723861,0.0072686146],"genre_scores_gemma":[0.11353972,0.0020183886,0.83428127,0.00043180143,0.000661766,0.0003022778,0.0010062344,0.0024473518,0.0453111],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988726,0.00037348585,0.00006340705,0.00012007681,0.00045649943,0.00011394216],"domain_scores_gemma":[0.9978346,0.0011455911,0.00012518954,0.00041859626,0.00041550395,0.00006054059],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0024753024,0.0014212406,0.000773797,0.0013410815,0.00047903162,0.0028678458,0.0016927393,0.0012719817,0.019989392],"category_scores_gemma":[0.0115671465,0.0005071882,0.0014413862,0.001441599,0.0010724452,0.0035422712,0.0014388738,0.0036181835,0.012897784],"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.00015471819,0.00008019129,0.0004785081,0.00037942705,0.000053305488,0.00027037563,0.00026089465,0.076118916,0.0042242818,0.73194265,0.025346924,0.1606898],"study_design_scores_gemma":[0.000011574651,0.000031123873,0.0003515214,0.0001161031,0.000021919775,0.00032517393,0.0000674304,0.7368276,0.005226858,0.21868221,0.038290918,0.000047436522],"about_ca_topic_score_codex":0.0013247409,"about_ca_topic_score_gemma":0.0017536083,"teacher_disagreement_score":0.019989392,"about_ca_system_score_codex":0.00080657884,"about_ca_system_score_gemma":0.00083384465,"threshold_uncertainty_score":0.066871226},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0044506867,0.0006384082,0.9811081,0.0004987098,0.00017882382,0.000047069854,0.000041433006,0.00024499002,0.012791746],"genre_scores_gemma":[0.21121176,0.0020567025,0.76582557,0.00054738857,0.00054357725,0.000633699,0.00032887238,0.0008627163,0.017989805],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99890757,0.00036231527,0.00007086165,0.00008712059,0.0004980016,0.00007415127],"domain_scores_gemma":[0.99837935,0.00081840117,0.00012696943,0.00026449858,0.0003423934,0.00006828747],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012494839,0.0008759838,0.0008713416,0.00074248057,0.00089480786,0.0014625905,0.0009571489,0.0012378838,0.0064904825],"category_scores_gemma":[0.005470063,0.00043720397,0.0006188496,0.0009284627,0.001600229,0.0022352685,0.0018762123,0.0023703768,0.0025050272],"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.00008806961,0.00004427856,0.00017318093,0.00016949784,0.00002142771,0.00017824821,0.00016378828,0.07137133,0.0141389845,0.86301655,0.005390222,0.045244344],"study_design_scores_gemma":[0.000065053064,0.00004404385,0.00011281097,0.00007332858,0.000018781882,0.00017247976,0.000054447723,0.54747593,0.011854088,0.40641966,0.033684447,0.000024957266],"about_ca_topic_score_codex":0.00052952615,"about_ca_topic_score_gemma":0.00041353345,"teacher_disagreement_score":0.0064904825,"about_ca_system_score_codex":0.00052709767,"about_ca_system_score_gemma":0.00079991587,"threshold_uncertainty_score":0.02171278},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.032492515,0.00045283226,0.92619985,0.0004697289,0.00037006848,0.00011573632,0.0008568541,0.010962999,0.028079301],"genre_scores_gemma":[0.1913068,0.00050063105,0.7678475,0.0002178342,0.000256931,0.00015282034,0.0022638033,0.004583054,0.03287057],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.998384,0.00020088285,0.00015994163,0.00047365465,0.0005422016,0.0002392827],"domain_scores_gemma":[0.9977958,0.0008506592,0.00013497508,0.00063523476,0.00045940507,0.00012393348],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015622386,0.0014536275,0.0011659057,0.0024177732,0.0014910117,0.004899841,0.002033013,0.00093931856,0.030242376],"category_scores_gemma":[0.0065773595,0.0007066029,0.0018831331,0.0020079154,0.0017893423,0.009099288,0.0046046674,0.0027838198,0.0133530935],"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.00032896356,0.00010101284,0.0018974893,0.00058872387,0.00005736622,0.00046661583,0.0013021735,0.0060354816,0.0117171835,0.4992818,0.020882592,0.45734063],"study_design_scores_gemma":[0.000092056194,0.00009727227,0.0006263529,0.00017708473,0.000071146635,0.00049496384,0.00062274525,0.033993382,0.027828762,0.83757246,0.09832597,0.00009784147],"about_ca_topic_score_codex":0.0023486016,"about_ca_topic_score_gemma":0.0038164023,"teacher_disagreement_score":0.030242376,"about_ca_system_score_codex":0.0016749725,"about_ca_system_score_gemma":0.0011611201,"threshold_uncertainty_score":0.10117084},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0075467234,0.006142304,0.8339043,0.0031861034,0.0022370405,0.00014578554,0.0012656691,0.0021950104,0.14337698],"genre_scores_gemma":[0.25086004,0.014818687,0.57542413,0.0037791075,0.008902895,0.0017715343,0.003975941,0.007856673,0.13261104],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.992853,0.0014934457,0.00050564366,0.0018270338,0.0026026417,0.00071827497],"domain_scores_gemma":[0.9823461,0.010203586,0.00085537595,0.0034728898,0.002371216,0.0007507965],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00866166,0.0056326017,0.002365317,0.011682599,0.0027732605,0.007534287,0.0050275815,0.002001839,0.02902474],"category_scores_gemma":[0.033974424,0.001862548,0.0047580963,0.008247178,0.0055379868,0.024730444,0.009471356,0.0136729935,0.016336894],"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.00017548539,0.00005985355,0.0005543645,0.0004737184,0.00008226035,0.00015337655,0.00050466624,0.0053353454,0.0024257142,0.88295084,0.02686913,0.080415286],"study_design_scores_gemma":[0.00002361722,0.000046599558,0.00039053778,0.00018075798,0.00009849607,0.0001716269,0.00009650175,0.02059616,0.0025933348,0.92613524,0.04960415,0.000062917716],"about_ca_topic_score_codex":0.003180389,"about_ca_topic_score_gemma":0.0060703573,"teacher_disagreement_score":0.02902474,"about_ca_system_score_codex":0.00578712,"about_ca_system_score_gemma":0.0021374798,"threshold_uncertainty_score":0.09709746},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13005064,0.0015190282,0.8316183,0.00088026066,0.00041834795,0.00034586244,0.0017345855,0.009011183,0.024421833],"genre_scores_gemma":[0.47434908,0.00081693387,0.5069129,0.00041752282,0.00032042427,0.00020411031,0.0033122317,0.0019750549,0.011691763],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9969547,0.00045800113,0.00031200753,0.0011445667,0.00081406353,0.00031662246],"domain_scores_gemma":[0.9945834,0.0027661046,0.0005494017,0.001183762,0.0007194822,0.00019789064],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001535578,0.0018286384,0.0017655569,0.0033119207,0.0010764407,0.0022118737,0.0011700239,0.0011528641,0.018405063],"category_scores_gemma":[0.015180577,0.0009950171,0.0018198271,0.002123928,0.001754151,0.0068172263,0.002372992,0.0013668915,0.0073177405],"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.0018571027,0.0002620632,0.015829995,0.0015477968,0.0002812814,0.0023593812,0.0010640392,0.015684294,0.062131085,0.14742315,0.033417452,0.7181424],"study_design_scores_gemma":[0.00037611977,0.0008679996,0.0044034333,0.0004031991,0.00034844026,0.0043412857,0.001125339,0.15678793,0.16070653,0.55706125,0.11329082,0.0002876424],"about_ca_topic_score_codex":0.00112031,"about_ca_topic_score_gemma":0.0012616989,"teacher_disagreement_score":0.018405063,"about_ca_system_score_codex":0.00065617263,"about_ca_system_score_gemma":0.0010615168,"threshold_uncertainty_score":0.061571002},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.02084624,0.0002157122,0.90499437,0.00035235385,0.00046714774,0.00022873272,0.0034956282,0.049276706,0.020123126],"genre_scores_gemma":[0.15943304,0.00019923966,0.78095,0.00030470573,0.00022556774,0.0005008689,0.011733451,0.01587644,0.030776683],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99821883,0.0002731057,0.00017164511,0.0003801471,0.00065328664,0.00030304314],"domain_scores_gemma":[0.99691606,0.00089163164,0.00017831536,0.0008867637,0.0010324393,0.000094799885],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016306737,0.0016310542,0.0010765038,0.0033505668,0.0012220285,0.0035712149,0.0030104078,0.00077608624,0.05869533],"category_scores_gemma":[0.0070177144,0.00069199246,0.0016478498,0.0030866868,0.001056413,0.00444504,0.0031759872,0.0019758644,0.020469123],"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.00052548235,0.00015254522,0.0017490297,0.00060578616,0.000057571087,0.00023793199,0.00065477716,0.008042679,0.00916447,0.17465767,0.09956209,0.70458996],"study_design_scores_gemma":[0.00026108112,0.00023409279,0.0014259767,0.00025671104,0.00010251588,0.00042292944,0.0007071997,0.17573646,0.08062653,0.44701946,0.29299453,0.00021244012],"about_ca_topic_score_codex":0.0032942742,"about_ca_topic_score_gemma":0.0032585878,"teacher_disagreement_score":0.05869533,"about_ca_system_score_codex":0.0018031338,"about_ca_system_score_gemma":0.0018049517,"threshold_uncertainty_score":0.19635546},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.87308174,0.0009607988,0.110373385,0.0008280159,0.000061564904,0.000026665755,0.00019116105,0.0004672487,0.014009329],"genre_scores_gemma":[0.99057055,0.00017627327,0.008543425,0.00002031684,0.000023356502,0.000017159295,0.00008394043,0.0000460053,0.00051884056],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99966323,0.00013854534,0.00001579321,0.00003240062,0.00009509305,0.000054909757],"domain_scores_gemma":[0.9938168,0.004650237,0.00045981584,0.00056083075,0.00030395592,0.00020837974],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014340552,0.00040154342,0.00069999165,0.0018601278,0.0005962754,0.0011675879,0.0008100291,0.00055710983,0.002573109],"category_scores_gemma":[0.014560394,0.0002285119,0.00031519402,0.0012883812,0.0015792932,0.0019641398,0.00092248636,0.0010805777,0.00022293993],"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.00027626194,0.000071539755,0.004683844,0.00016764687,0.000038413174,0.00033123718,0.00030610865,0.61303824,0.0027410944,0.3644189,0.0019862475,0.011940436],"study_design_scores_gemma":[0.00000964382,0.000017462018,0.00052535144,0.000018036315,0.0000058181613,0.000043582106,0.00003890134,0.9336079,0.0008926781,0.06446664,0.00036079375,0.000013213822],"about_ca_topic_score_codex":0.0010630428,"about_ca_topic_score_gemma":0.0007947293,"teacher_disagreement_score":0.002573109,"about_ca_system_score_codex":0.00082707725,"about_ca_system_score_gemma":0.00034510464,"threshold_uncertainty_score":0.008607864},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00645607,0.0003765525,0.955105,0.0006850386,0.00036352954,0.00010878261,0.00096590584,0.0040880563,0.03185114],"genre_scores_gemma":[0.15025882,0.00060245336,0.79036796,0.0005175732,0.0003343991,0.00030948236,0.003427986,0.0023034513,0.051877875],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989973,0.0001473468,0.00007515805,0.00025715437,0.000385775,0.00013730094],"domain_scores_gemma":[0.99892896,0.00039007244,0.000038084298,0.00025540378,0.0003207602,0.000066676526],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011142349,0.0011288363,0.0008795903,0.0016492939,0.0010110562,0.0032142438,0.0016703408,0.0008743048,0.037635956],"category_scores_gemma":[0.004633719,0.0005674347,0.0013392505,0.0017575611,0.0010364708,0.0035513854,0.0030230237,0.0030213427,0.017711693],"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.00023648236,0.00012257222,0.00043703202,0.00034415594,0.000053738404,0.00010673438,0.0002827129,0.011268615,0.00452945,0.5440558,0.063021906,0.37554073],"study_design_scores_gemma":[0.0001201649,0.0000944312,0.00030791885,0.00007837959,0.000040958665,0.00020180411,0.00014255627,0.111509,0.0067828363,0.80463,0.07603683,0.000055182387],"about_ca_topic_score_codex":0.002250001,"about_ca_topic_score_gemma":0.0033789144,"teacher_disagreement_score":0.037635956,"about_ca_system_score_codex":0.0016423246,"about_ca_system_score_gemma":0.0017615252,"threshold_uncertainty_score":0.1259048},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.018130604,0.00027961333,0.95350665,0.00033761922,0.00036050013,0.00004082114,0.00022386994,0.0025092028,0.024611134],"genre_scores_gemma":[0.22791672,0.00054086663,0.7289324,0.00037577187,0.00020024992,0.00016409096,0.00087586354,0.004268783,0.036725156],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99906224,0.00021105814,0.00006262503,0.00012407315,0.0003875713,0.00015245823],"domain_scores_gemma":[0.99841285,0.0006447107,0.00009317934,0.00026469774,0.0004474462,0.00013715259],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002147601,0.0013112125,0.0013308486,0.0030177215,0.0010994058,0.0029293448,0.0024034441,0.0010903775,0.028446019],"category_scores_gemma":[0.008609538,0.00063120585,0.0014038634,0.0013257691,0.0015271046,0.0041011227,0.0029607264,0.0024369403,0.01244813],"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.0003092023,0.00010719275,0.0017877185,0.00036186216,0.00010279273,0.000693582,0.00055271346,0.064968616,0.0081200125,0.65558255,0.02442024,0.24299352],"study_design_scores_gemma":[0.00005735247,0.000063861946,0.0004296446,0.00010087506,0.000030605755,0.00020964124,0.0002001696,0.4246515,0.0093998425,0.5382293,0.026555948,0.00007127577],"about_ca_topic_score_codex":0.003185026,"about_ca_topic_score_gemma":0.0047077825,"teacher_disagreement_score":0.028446019,"about_ca_system_score_codex":0.0018683323,"about_ca_system_score_gemma":0.0016509796,"threshold_uncertainty_score":0.09516144},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.081381954,0.0067142304,0.73821723,0.011151722,0.0011882742,0.000096015465,0.0007404193,0.0011038005,0.15940638],"genre_scores_gemma":[0.8618985,0.0041020717,0.09095508,0.0023348804,0.0031716872,0.00026138188,0.001001533,0.0012538023,0.035021055],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9940764,0.001555323,0.00025165037,0.0013383641,0.0020066753,0.0007714585],"domain_scores_gemma":[0.96611995,0.024652911,0.0014123038,0.003427347,0.0030087195,0.0013787572],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.008074284,0.0021602313,0.0015233663,0.0039599636,0.0026343137,0.0044307206,0.004209671,0.001886155,0.021500114],"category_scores_gemma":[0.043451693,0.0008357649,0.0021374545,0.0022925069,0.0087162405,0.027243666,0.008191334,0.010772883,0.0037393633],"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.0000612843,0.000031074676,0.00036415432,0.00014132951,0.000013440387,0.00006228395,0.00015287791,0.0027989382,0.0005194858,0.9867568,0.0022068243,0.0068915333],"study_design_scores_gemma":[0.000009379124,0.000024199913,0.00031819972,0.00005656444,0.000020551623,0.00006881965,0.000040744482,0.015239345,0.0008215759,0.97981924,0.00355547,0.00002589731],"about_ca_topic_score_codex":0.0009596774,"about_ca_topic_score_gemma":0.0010127116,"teacher_disagreement_score":0.021500114,"about_ca_system_score_codex":0.0037254517,"about_ca_system_score_gemma":0.0016407314,"threshold_uncertainty_score":0.071925044},"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13545653,0.0033381742,0.15130945,0.05994169,0.006418846,0.00018841079,0.0026361311,0.0016949254,0.63901585],"genre_scores_gemma":[0.84467965,0.0018819454,0.050977156,0.01480569,0.0026537254,0.00034739228,0.0027043575,0.0005331456,0.081416935],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99663603,0.00055485556,0.00013758204,0.000946562,0.00085654197,0.0008684601],"domain_scores_gemma":[0.9905088,0.0046095825,0.00048010482,0.0014994324,0.0021426277,0.0007594562],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0030287087,0.0013689923,0.0012576453,0.0016997926,0.003732112,0.0030585728,0.0024788561,0.0023950452,0.024298007],"category_scores_gemma":[0.015260011,0.00082009577,0.0025446864,0.0017729974,0.005495484,0.007533239,0.006443961,0.006250668,0.0038907586],"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.00012950381,0.00007678784,0.0015986242,0.00015098743,0.00003065659,0.00021908725,0.00030633283,0.0021102012,0.0008966345,0.95263386,0.031741787,0.010105626],"study_design_scores_gemma":[0.00007105841,0.00005515973,0.0009947727,0.000071789895,0.000031421005,0.00027935268,0.0001748588,0.0126575595,0.0011401437,0.94316673,0.04131747,0.000039528848],"about_ca_topic_score_codex":0.007347043,"about_ca_topic_score_gemma":0.006892199,"teacher_disagreement_score":0.024298007,"about_ca_system_score_codex":0.0041695675,"about_ca_system_score_gemma":0.0027643603,"threshold_uncertainty_score":0.08128494},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6361504,0.0011363904,0.18932113,0.00700723,0.00089594396,0.00012798683,0.0030589325,0.008321704,0.15398028],"genre_scores_gemma":[0.96113086,0.00019475867,0.023051359,0.00045135274,0.00016326012,0.000083568135,0.001917883,0.0005262422,0.012480689],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99766636,0.00058562495,0.00014167772,0.00060263445,0.00065063447,0.0003531065],"domain_scores_gemma":[0.9912856,0.0058594765,0.000441145,0.0014139747,0.00080755656,0.0001921809],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002249319,0.00081336306,0.0009864833,0.00076313445,0.0013470895,0.0026493866,0.0011899418,0.0010205455,0.016983382],"category_scores_gemma":[0.015397837,0.0004062531,0.001252514,0.00075632945,0.0025749907,0.004380417,0.0024627224,0.0018965898,0.0026302214],"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.0021245778,0.00018913008,0.00742057,0.000749109,0.00017062672,0.0005876209,0.0010268883,0.065876946,0.012039531,0.79756063,0.04142483,0.07082952],"study_design_scores_gemma":[0.00030029923,0.00017535288,0.0017983416,0.0001201468,0.00007874056,0.00018219039,0.0002246265,0.15905531,0.017565299,0.80123013,0.01918509,0.00008451561],"about_ca_topic_score_codex":0.0038091973,"about_ca_topic_score_gemma":0.004077077,"teacher_disagreement_score":0.016983382,"about_ca_system_score_codex":0.0020361478,"about_ca_system_score_gemma":0.0025809153,"threshold_uncertainty_score":0.056815088},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.044933777,0.00041285527,0.9456434,0.0003277749,0.00015556205,0.00007612318,0.00003779661,0.0011819217,0.007230836],"genre_scores_gemma":[0.36630374,0.00048017714,0.6269546,0.00019297106,0.00031856322,0.000091450514,0.00011730715,0.0005037363,0.005037361],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99858,0.00033741046,0.00006521691,0.00023724785,0.0006511117,0.00012894317],"domain_scores_gemma":[0.99788564,0.0007641781,0.00013401649,0.0008576675,0.00023942205,0.000118980155],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014668545,0.0006464257,0.0009932366,0.0011381502,0.0007568175,0.0019254393,0.001295008,0.000483755,0.0044867974],"category_scores_gemma":[0.0068294355,0.00028174464,0.0006027188,0.0010383496,0.0018364664,0.0030254996,0.0034343419,0.0022997952,0.0012895807],"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.00043697882,0.00009389096,0.0018485441,0.00022755974,0.000041434,0.0004284446,0.00032832008,0.028930342,0.022927782,0.58828473,0.0048218593,0.3516301],"study_design_scores_gemma":[0.00012548422,0.00038007903,0.0012872485,0.00007335677,0.00005185261,0.0010886856,0.000116893796,0.35014918,0.041799348,0.56960535,0.035195224,0.00012726319],"about_ca_topic_score_codex":0.00020851078,"about_ca_topic_score_gemma":0.00030720924,"teacher_disagreement_score":0.0044867974,"about_ca_system_score_codex":0.0006567183,"about_ca_system_score_gemma":0.00070080056,"threshold_uncertainty_score":0.01500982},"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.036752786,0.0017869752,0.14685532,0.0073179975,0.006338861,0.00006056295,0.0010738295,0.0031073443,0.7967064],"genre_scores_gemma":[0.59480983,0.0018435793,0.07785203,0.003132201,0.0029974987,0.00012216534,0.0013137294,0.0022627863,0.31566623],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9984205,0.00024247839,0.00008825375,0.0004257812,0.00056511327,0.00025795176],"domain_scores_gemma":[0.99835616,0.00048574037,0.00014858333,0.0003452897,0.0004617996,0.00020244558],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015585048,0.001036215,0.0007305295,0.0018070894,0.002500928,0.004016959,0.0007312357,0.00097145623,0.044766128],"category_scores_gemma":[0.004007586,0.000512676,0.0014227912,0.0011690218,0.0041624396,0.004822462,0.0024991885,0.0033809445,0.018813182],"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.0001787663,0.00002098757,0.00031603564,0.00010420159,0.000020322055,0.0002258187,0.00033516702,0.00038715973,0.0016765889,0.9389228,0.028472051,0.029339992],"study_design_scores_gemma":[0.000034547196,0.00010542608,0.0009463956,0.000050531722,0.000022516919,0.00060257304,0.00012798059,0.00092256203,0.0045138663,0.60640967,0.38619238,0.00007147363],"about_ca_topic_score_codex":0.0011001062,"about_ca_topic_score_gemma":0.0012311783,"teacher_disagreement_score":0.044766128,"about_ca_system_score_codex":0.00213116,"about_ca_system_score_gemma":0.0013470409,"threshold_uncertainty_score":0.14975762},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.14599688,0.0012396763,0.5610059,0.0026530256,0.0028290614,0.00029162737,0.0025065746,0.005763332,0.27771404],"genre_scores_gemma":[0.6692166,0.0009788318,0.23093626,0.0020479497,0.0006017735,0.00047723384,0.0022800104,0.0024136486,0.09104766],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993286,0.00006123646,0.000051972493,0.0002485857,0.0001612163,0.00014846899],"domain_scores_gemma":[0.9992218,0.00031593558,0.000086513115,0.00011308851,0.00020318016,0.000059515023],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005352974,0.0011851845,0.00063473615,0.0006398591,0.0011695191,0.0022157023,0.0010810008,0.0008338113,0.024869785],"category_scores_gemma":[0.0018598187,0.00056302024,0.001642765,0.00062614493,0.0016461344,0.0029324775,0.0014511324,0.002004761,0.008489721],"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.0010117711,0.00018885291,0.0011892501,0.0007969087,0.00008189517,0.0025418063,0.0010038223,0.002125483,0.07456787,0.79910326,0.03364005,0.083749086],"study_design_scores_gemma":[0.00026505179,0.00047818874,0.0018119843,0.00030500218,0.0002118505,0.0035852322,0.00081832084,0.016863896,0.10507713,0.61860603,0.25177318,0.00020418581],"about_ca_topic_score_codex":0.0009988538,"about_ca_topic_score_gemma":0.0015483061,"teacher_disagreement_score":0.024869785,"about_ca_system_score_codex":0.00095968606,"about_ca_system_score_gemma":0.0007618487,"threshold_uncertainty_score":0.08319765},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.14928253,0.001184605,0.7555081,0.0005656351,0.00043489854,0.00023780833,0.00025191213,0.00095899485,0.09157537],"genre_scores_gemma":[0.6979613,0.0010541588,0.23819883,0.00024378947,0.00043912602,0.0002144756,0.0003824187,0.00096886227,0.060537037],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9984463,0.00033904944,0.00011083476,0.00035196685,0.0005484383,0.00020348845],"domain_scores_gemma":[0.9991732,0.00033774166,0.000076309414,0.00018057227,0.00013392541,0.00009821056],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012691377,0.0010805767,0.0011080328,0.0028102014,0.0018557999,0.003626853,0.0013071034,0.00073021586,0.013537867],"category_scores_gemma":[0.0049738963,0.0006111268,0.001496642,0.0013597173,0.0030465384,0.007614595,0.004154989,0.0021135542,0.0035166612],"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.00006723134,0.00002213184,0.00039252677,0.00010519132,0.000022985267,0.00013602749,0.0004965149,0.0019028779,0.0017379543,0.9550181,0.001633371,0.038465127],"study_design_scores_gemma":[0.00002135777,0.00004937515,0.00017884618,0.000050082916,0.000030377809,0.00022627819,0.00019484608,0.010594392,0.005542545,0.96596676,0.017108014,0.00003707541],"about_ca_topic_score_codex":0.0005388195,"about_ca_topic_score_gemma":0.00058173697,"teacher_disagreement_score":0.013537867,"about_ca_system_score_codex":0.0011368337,"about_ca_system_score_gemma":0.0006252781,"threshold_uncertainty_score":0.045288622},"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.089963436,0.00083113054,0.27322662,0.0027167671,0.008556196,0.00015168787,0.00079312857,0.002639532,0.6211216],"genre_scores_gemma":[0.7325617,0.00082232215,0.07561493,0.0015911058,0.0011426593,0.00032374807,0.0012846126,0.0034099163,0.183249],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9984566,0.00018698575,0.00010376701,0.0005313795,0.0003695154,0.00035168565],"domain_scores_gemma":[0.99843043,0.00045420774,0.00020355081,0.00035384158,0.00036274124,0.00019520408],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010725136,0.0015908357,0.00078234245,0.0013032914,0.0029062985,0.0054209367,0.0011279823,0.001467055,0.06570811],"category_scores_gemma":[0.005341429,0.00056324864,0.0009399156,0.0010331003,0.005528995,0.006281985,0.0037235124,0.0027515604,0.030621644],"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.00030565372,0.000048816757,0.00060012116,0.00013772347,0.000018127794,0.0007923021,0.00064183236,0.00036149236,0.0045613013,0.93878794,0.023350554,0.030394152],"study_design_scores_gemma":[0.00009268743,0.0001488882,0.0010561172,0.00012811217,0.00004745655,0.002411592,0.00076491025,0.0030915516,0.01976955,0.7392733,0.233108,0.00010788372],"about_ca_topic_score_codex":0.00052349566,"about_ca_topic_score_gemma":0.0003950152,"teacher_disagreement_score":0.06570811,"about_ca_system_score_codex":0.0011272363,"about_ca_system_score_gemma":0.0007410496,"threshold_uncertainty_score":0.2198155},"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.033222932,0.006174064,0.4566776,0.009690194,0.0067370506,0.00008082302,0.00062184734,0.0022387444,0.4845566],"genre_scores_gemma":[0.58952755,0.0037628296,0.22221562,0.0061152494,0.004825891,0.00023328318,0.00063084683,0.002245647,0.17044315],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9981925,0.00059567025,0.000104645376,0.00050079374,0.00035853093,0.00024788972],"domain_scores_gemma":[0.9984529,0.0005770789,0.00011959012,0.00035812374,0.0003151832,0.00017703896],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00224752,0.0012129366,0.0007031906,0.0019092581,0.0024966635,0.004438432,0.0014809939,0.0016258191,0.01842722],"category_scores_gemma":[0.004913207,0.0006054614,0.0014480388,0.0013626784,0.007448136,0.009769758,0.0028828788,0.0034710437,0.008555782],"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.000014466384,0.000003061504,0.00003527238,0.000020252093,0.000002093834,0.00003533682,0.00016439552,0.00010349367,0.00023782658,0.9920529,0.0023530275,0.004977885],"study_design_scores_gemma":[0.000013326246,0.00002520092,0.00009645706,0.00003938444,0.000008648214,0.00020496499,0.00012327624,0.0013115858,0.0008060942,0.86763906,0.12970653,0.000025340481],"about_ca_topic_score_codex":0.0012508454,"about_ca_topic_score_gemma":0.0011213372,"teacher_disagreement_score":0.01842722,"about_ca_system_score_codex":0.0019722616,"about_ca_system_score_gemma":0.00082826026,"threshold_uncertainty_score":0.06164521},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.002204167,0.00037267825,0.99205184,0.00016606641,0.000046004283,0.000019684338,0.000016087966,0.000047801223,0.005075617],"genre_scores_gemma":[0.20411322,0.0025152583,0.77205545,0.00038393497,0.00024751568,0.00040723835,0.00022670359,0.000491762,0.019558944],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992299,0.00028238283,0.000029450764,0.00009417039,0.00031983524,0.000044292494],"domain_scores_gemma":[0.99914885,0.00041842987,0.0000730537,0.000113554015,0.00020282228,0.000043353775],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015057075,0.00096786756,0.00048812997,0.0010576048,0.00044207816,0.0013374456,0.0011206772,0.0008335889,0.0039871316],"category_scores_gemma":[0.0029520756,0.0005126799,0.0012062283,0.0006169666,0.0016163366,0.001324519,0.0019525208,0.0023248263,0.0011585756],"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.00004032141,0.000028692131,0.0002883658,0.00022773507,0.000032966294,0.000072643285,0.0001716492,0.14746605,0.010309221,0.79634976,0.0025034465,0.04250918],"study_design_scores_gemma":[0.0000084488765,0.000024096054,0.00011675266,0.000034667886,0.000007379516,0.000060237526,0.000019421383,0.85878855,0.0025317026,0.12896885,0.00942807,0.000011783642],"about_ca_topic_score_codex":0.0010431658,"about_ca_topic_score_gemma":0.0006817858,"teacher_disagreement_score":0.0039871316,"about_ca_system_score_codex":0.0010350607,"about_ca_system_score_gemma":0.00064742914,"threshold_uncertainty_score":0.013338268},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.70884514,0.00011755199,0.27349702,0.00030020383,0.000054235432,0.00010790139,0.00023670995,0.0010503465,0.015790846],"genre_scores_gemma":[0.9344806,0.000047570316,0.06194318,0.00003836614,0.00003551975,0.0000524558,0.0005016833,0.00015756226,0.002742994],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994962,0.00008328236,0.000026479058,0.00009009583,0.00016616925,0.00013769782],"domain_scores_gemma":[0.999196,0.00042660595,0.00010530176,0.0001263032,0.000089354464,0.000056431738],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006322824,0.0005013635,0.0006919971,0.0012420329,0.0006753931,0.0013477915,0.0012217073,0.00044492842,0.003701899],"category_scores_gemma":[0.0025102622,0.00024428684,0.0008293778,0.0008628034,0.0015283048,0.0020724197,0.0011796413,0.00081292965,0.0005516604],"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.00024625368,0.00020937703,0.0036846264,0.00018126692,0.000047525868,0.00034237947,0.00047831217,0.072683394,0.016011821,0.8271785,0.0023817455,0.07655488],"study_design_scores_gemma":[0.00003995514,0.00009464098,0.0004838532,0.000015302025,0.0000284538,0.00007976375,0.00009599448,0.2396553,0.023998192,0.7324751,0.0030073097,0.000026141968],"about_ca_topic_score_codex":0.00069324824,"about_ca_topic_score_gemma":0.0008794235,"teacher_disagreement_score":0.003701899,"about_ca_system_score_codex":0.0013249575,"about_ca_system_score_gemma":0.0007832992,"threshold_uncertainty_score":0.012384057},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0090441145,0.00056861306,0.9613979,0.00061467814,0.00021981484,0.00013923185,0.0005035116,0.0072314213,0.020280708],"genre_scores_gemma":[0.16864102,0.00092510413,0.79660386,0.00077685725,0.00038068747,0.00038546446,0.0021245691,0.0039500766,0.026212372],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99687445,0.0005693606,0.00018660136,0.0004951539,0.0012552153,0.0006191513],"domain_scores_gemma":[0.9962213,0.0020201674,0.0001670015,0.0006599944,0.00079126545,0.00014026076],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0025216462,0.0025108866,0.0015218057,0.0021842604,0.0016234153,0.0033664461,0.0019484774,0.0013646894,0.02853903],"category_scores_gemma":[0.011234493,0.0008270181,0.00199381,0.0027315072,0.002120879,0.005890538,0.0051450534,0.0033772895,0.012578095],"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.0007889166,0.00019414972,0.0014042655,0.00081964396,0.00009766838,0.0004554648,0.0008280392,0.025355307,0.010044413,0.39440465,0.04964121,0.51596636],"study_design_scores_gemma":[0.00021826968,0.00018473552,0.00059283496,0.00022092956,0.00011910257,0.00054583116,0.00031895956,0.1859483,0.019005558,0.73450285,0.058231056,0.00011156399],"about_ca_topic_score_codex":0.0043584383,"about_ca_topic_score_gemma":0.005007758,"teacher_disagreement_score":0.02853903,"about_ca_system_score_codex":0.0020892504,"about_ca_system_score_gemma":0.0015633323,"threshold_uncertainty_score":0.095472574},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.028286258,0.0010233775,0.9325307,0.0004354112,0.0004154206,0.000049021637,0.00010021552,0.0005373599,0.036622286],"genre_scores_gemma":[0.66829073,0.0032066281,0.29946896,0.0007154244,0.0009789115,0.00021234059,0.00030988918,0.0005135299,0.026303578],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99946016,0.00012378873,0.000026554979,0.000057635938,0.00027496569,0.00005682935],"domain_scores_gemma":[0.9984328,0.00085476204,0.000112534086,0.00027885495,0.0002655303,0.000055494667],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010140114,0.00085821346,0.000607774,0.0020139557,0.00059621,0.0014798004,0.0010423543,0.0007120859,0.0058269827],"category_scores_gemma":[0.008351244,0.00021886158,0.00055496686,0.0012487657,0.0017658964,0.0033250407,0.0010523234,0.0025901957,0.002331381],"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.000052216503,0.000030674022,0.00037856688,0.00014503572,0.000008315458,0.00017596217,0.00014466372,0.028745778,0.0053362995,0.91095614,0.0029163228,0.051110003],"study_design_scores_gemma":[0.000008376186,0.000048188984,0.00023246968,0.00007306533,0.000009470766,0.0004226921,0.000052669908,0.25814736,0.0043717623,0.7281201,0.008490422,0.000023378398],"about_ca_topic_score_codex":0.00062141975,"about_ca_topic_score_gemma":0.000692321,"teacher_disagreement_score":0.0058269827,"about_ca_system_score_codex":0.0010265367,"about_ca_system_score_gemma":0.00054308,"threshold_uncertainty_score":0.019493163},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.004158634,0.00023936295,0.9742354,0.00040817764,0.00032880282,0.00012171775,0.0006003878,0.008292921,0.011614672],"genre_scores_gemma":[0.09167112,0.0003304832,0.86571133,0.00043751838,0.0004207838,0.00058051466,0.0024984155,0.006407311,0.031942464],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99825996,0.00024343145,0.00011845112,0.00028129417,0.00087075535,0.0002262326],"domain_scores_gemma":[0.99662447,0.0011698342,0.00010871227,0.001066135,0.0008373842,0.00019346118],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015824965,0.0021869878,0.0012488877,0.002607088,0.0015416265,0.0032914367,0.0033224532,0.0010741036,0.05035944],"category_scores_gemma":[0.007813981,0.0006905592,0.002382591,0.0019588552,0.0012711617,0.004516271,0.004594609,0.0035094619,0.022518791],"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.00052148907,0.0002178944,0.0014268756,0.0006330013,0.00018131851,0.00042035812,0.00036720306,0.044416226,0.011772527,0.28037503,0.104962125,0.55470586],"study_design_scores_gemma":[0.00020059926,0.00009248639,0.0005640152,0.00008790339,0.00008813237,0.00027148597,0.000119924734,0.49377668,0.010909894,0.42276484,0.07103549,0.00008851478],"about_ca_topic_score_codex":0.005789554,"about_ca_topic_score_gemma":0.010175597,"teacher_disagreement_score":0.05035944,"about_ca_system_score_codex":0.0026043963,"about_ca_system_score_gemma":0.0025555051,"threshold_uncertainty_score":0.16846913},"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":"editorial","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00067216787,0.004128549,0.014040864,0.15538467,0.74823743,0.00006611507,0.002905229,0.0013911042,0.07317386],"genre_scores_gemma":[0.036918335,0.008343918,0.018823558,0.07799209,0.16555673,0.00035080762,0.0047737984,0.0063520446,0.6808888],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9959884,0.00066120515,0.00034300616,0.0006918924,0.0020119592,0.00030339055],"domain_scores_gemma":[0.9858423,0.0033165268,0.0004727369,0.0014363924,0.008399664,0.00053240726],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003604805,0.0013337606,0.0014534779,0.0027016837,0.0026496071,0.0038114279,0.0025513638,0.0028831805,0.12382076],"category_scores_gemma":[0.037226267,0.0005495784,0.0017238123,0.0017977118,0.0027466095,0.005088938,0.0026799608,0.0069495947,0.06441551],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","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.000015555379,0.0000069072676,0.000049239585,0.000080387894,0.000008237845,0.000050430877,0.000026959126,0.00007271776,0.00005250617,0.022067659,0.9713765,0.006192967],"study_design_scores_gemma":[0.000019115025,0.000017578777,0.0005822569,0.00019003177,0.00003178549,0.00023783212,0.00006758354,0.0009536512,0.00060255657,0.047514774,0.9497328,0.000050001545],"about_ca_topic_score_codex":0.009464268,"about_ca_topic_score_gemma":0.010658513,"teacher_disagreement_score":0.12382076,"about_ca_system_score_codex":0.005872377,"about_ca_system_score_gemma":0.0027696483,"threshold_uncertainty_score":0.4142217},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.34038463,0.0020126202,0.58092546,0.002472382,0.00052483083,0.00014438637,0.0038133366,0.0066600568,0.06306227],"genre_scores_gemma":[0.8276234,0.0009996298,0.14206031,0.00030840392,0.00033819897,0.00012251231,0.006153422,0.0011720621,0.021222008],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99666995,0.0007998693,0.00031847777,0.00087804394,0.0007868034,0.0005467936],"domain_scores_gemma":[0.99504787,0.0026440143,0.00036106855,0.0009840582,0.00066581066,0.00029717232],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002173887,0.0009877594,0.00081323914,0.0028948204,0.0013970461,0.0051633352,0.0012656256,0.0011258804,0.0140377395],"category_scores_gemma":[0.010843763,0.00089079264,0.0015674946,0.0028210606,0.0028171623,0.01369018,0.0047602053,0.002402269,0.0035337396],"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.00030662314,0.00015089044,0.004439178,0.00036967546,0.000065067776,0.000378249,0.0021963036,0.006210955,0.0027411273,0.85771537,0.010464867,0.11496172],"study_design_scores_gemma":[0.000027434782,0.000050548337,0.0007889404,0.000071740214,0.000029258368,0.00016320097,0.00075651647,0.009313617,0.0029038184,0.9731636,0.012702592,0.000028684743],"about_ca_topic_score_codex":0.0023110216,"about_ca_topic_score_gemma":0.0029004235,"teacher_disagreement_score":0.0140377395,"about_ca_system_score_codex":0.0023395868,"about_ca_system_score_gemma":0.00093794527,"threshold_uncertainty_score":0.04696089},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7679469,0.0018541383,0.1547889,0.0035961308,0.0004381013,0.00015704437,0.0009731018,0.0014582543,0.06878745],"genre_scores_gemma":[0.98192835,0.00030177663,0.0118891755,0.00023476715,0.0003077841,0.000100637546,0.0004883011,0.00022095491,0.004528288],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9945425,0.0013060805,0.0002735877,0.0012176279,0.0015745793,0.0010855342],"domain_scores_gemma":[0.959173,0.030025844,0.0021280453,0.004038201,0.0020387175,0.0025961618],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0050647636,0.0011778387,0.002127864,0.003886994,0.0030941484,0.0046371007,0.0031184799,0.0017923147,0.018801507],"category_scores_gemma":[0.038957626,0.0005006629,0.0013408962,0.0014257474,0.0057903863,0.012163007,0.0038833935,0.0036061842,0.0023756032],"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.0017182879,0.00019814802,0.016251436,0.0005271964,0.000089357294,0.0008238911,0.00064815016,0.019698352,0.007089656,0.9061105,0.007154234,0.03969086],"study_design_scores_gemma":[0.00008380911,0.00021702777,0.002426434,0.00006763007,0.00004387208,0.0006286055,0.00016242388,0.07674645,0.009302108,0.9070296,0.0031931621,0.00009892969],"about_ca_topic_score_codex":0.00047481057,"about_ca_topic_score_gemma":0.0005170366,"teacher_disagreement_score":0.018801507,"about_ca_system_score_codex":0.002089144,"about_ca_system_score_gemma":0.0011665523,"threshold_uncertainty_score":0.062897325},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01176045,0.0000861362,0.9844544,0.00008251319,0.00009895918,0.00004426125,0.000029290073,0.00018802952,0.0032559275],"genre_scores_gemma":[0.22412656,0.0002959557,0.76441336,0.0001815257,0.00008365785,0.00027955472,0.0002936881,0.00041430487,0.009911445],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995297,0.00010928329,0.000029540402,0.000054216962,0.00025572805,0.000021539112],"domain_scores_gemma":[0.9992054,0.00033803063,0.000042313048,0.00013138713,0.00025206167,0.000030823023],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00081198855,0.0003727871,0.0005661751,0.00041527796,0.00034246006,0.0005262307,0.0011912227,0.0008679359,0.0025894444],"category_scores_gemma":[0.0024786296,0.0002763823,0.0007438751,0.00034220386,0.00066051516,0.0006460764,0.0010626722,0.0010776,0.0009172199],"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.00023377985,0.00019114905,0.002684871,0.00042822256,0.00008025235,0.00034939445,0.0005441444,0.50611347,0.048503157,0.1502499,0.003756914,0.2868647],"study_design_scores_gemma":[0.000008695782,0.000025293342,0.00012442748,0.000012416602,0.000004803403,0.000044360942,0.0000112387415,0.9878176,0.0037510092,0.0045743324,0.0036159246,0.0000099410145],"about_ca_topic_score_codex":0.0021569992,"about_ca_topic_score_gemma":0.0017718417,"teacher_disagreement_score":0.0025894444,"about_ca_system_score_codex":0.00034835775,"about_ca_system_score_gemma":0.0005985384,"threshold_uncertainty_score":0.008662522},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.19556193,0.0003303356,0.78530884,0.0014595042,0.00035355476,0.00040407458,0.0018859159,0.004648795,0.010047068],"genre_scores_gemma":[0.7725552,0.000105639476,0.21874489,0.00072804803,0.00028018287,0.0003088576,0.00267994,0.00048647338,0.0041107894],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.996292,0.0006125324,0.0002709956,0.00087880064,0.0014510081,0.0004946666],"domain_scores_gemma":[0.9734613,0.0145161515,0.001995974,0.0032431085,0.0054418445,0.0013415947],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019590904,0.0012365244,0.0011194092,0.0018267445,0.0012278038,0.0015830782,0.001658485,0.0013908758,0.008478738],"category_scores_gemma":[0.023040162,0.00053057424,0.0012433408,0.0009810723,0.0020436018,0.003790485,0.0030467962,0.0018084111,0.0036492157],"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.0058447802,0.0010377812,0.08195599,0.0009198379,0.00048674346,0.0025025678,0.00085041416,0.04983835,0.19336969,0.17067908,0.040628634,0.45188624],"study_design_scores_gemma":[0.00045566095,0.0022752509,0.0077531347,0.00010808425,0.00011927198,0.001709418,0.0005516312,0.61548334,0.121628575,0.23834485,0.011301521,0.00026930726],"about_ca_topic_score_codex":0.0013900753,"about_ca_topic_score_gemma":0.0020445483,"teacher_disagreement_score":0.008478738,"about_ca_system_score_codex":0.000694157,"about_ca_system_score_gemma":0.0024684386,"threshold_uncertainty_score":0.028364182},"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":"editorial","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0007054109,0.0035760405,0.021772545,0.16347803,0.76536345,0.000039866038,0.0018124859,0.002271165,0.040981006],"genre_scores_gemma":[0.06185752,0.01055545,0.05404408,0.17368151,0.2619685,0.00058541883,0.004572065,0.013818116,0.41891745],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.98933244,0.0015628122,0.0009827259,0.0017051039,0.005590506,0.00082634966],"domain_scores_gemma":[0.96743226,0.009983769,0.0011387721,0.0042520985,0.016131397,0.0010618021],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0053865397,0.002545765,0.002001901,0.004001492,0.004402894,0.00507152,0.0036466157,0.0043610963,0.07101237],"category_scores_gemma":[0.073578425,0.00100786,0.0019616438,0.0023194023,0.004071454,0.009415662,0.0036767337,0.014764161,0.052847154],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","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.000041264084,0.000013432321,0.00007919218,0.00007116221,0.000013813448,0.000106039384,0.000029448911,0.00014453105,0.00009119616,0.021467993,0.9692472,0.008694732],"study_design_scores_gemma":[0.000029757433,0.0000311719,0.00056062813,0.00021723498,0.000048846767,0.0004189507,0.000053196894,0.0020051894,0.0010987013,0.06500006,0.9304598,0.00007648819],"about_ca_topic_score_codex":0.007011121,"about_ca_topic_score_gemma":0.007578127,"teacher_disagreement_score":0.07101237,"about_ca_system_score_codex":0.006838196,"about_ca_system_score_gemma":0.003048626,"threshold_uncertainty_score":0.2375601},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009942784,0.0001827656,0.98403317,0.000112439055,0.00006299541,0.000015815527,0.0000505722,0.00038678746,0.0052126604],"genre_scores_gemma":[0.39765015,0.0010800513,0.5748884,0.00029409587,0.00026218416,0.00016720577,0.00039151908,0.0012391934,0.024027161],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993728,0.00013325075,0.000036012116,0.00008840063,0.00029198691,0.000077611076],"domain_scores_gemma":[0.9989447,0.0005498939,0.000069642985,0.00017794156,0.00020718796,0.000050575596],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014889089,0.00093483477,0.00073714677,0.0011065876,0.00043825922,0.0017719369,0.0011159393,0.00079622027,0.0052910373],"category_scores_gemma":[0.0060724146,0.0003442639,0.0014004263,0.00075554784,0.0011675828,0.002465111,0.001293012,0.0028064838,0.002084707],"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.00018375601,0.000070471215,0.0013693506,0.00020614876,0.000048531205,0.0003084877,0.00029588,0.10855485,0.00912255,0.7905179,0.0038247183,0.08549731],"study_design_scores_gemma":[0.00001139813,0.000028110253,0.00031087172,0.000042354317,0.000021757642,0.0002650717,0.00005007301,0.81636363,0.006499189,0.16608782,0.010289274,0.000030437854],"about_ca_topic_score_codex":0.001007415,"about_ca_topic_score_gemma":0.0011938751,"teacher_disagreement_score":0.0052910373,"about_ca_system_score_codex":0.0008347136,"about_ca_system_score_gemma":0.00058571185,"threshold_uncertainty_score":0.017700315},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6645105,0.00051322574,0.24633445,0.0016896547,0.00012869676,0.00011305502,0.00049621094,0.0006422687,0.0855719],"genre_scores_gemma":[0.94539297,0.00021328175,0.04493769,0.00026578802,0.00021822154,0.00015742435,0.00038422304,0.00018392628,0.008246428],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9978383,0.00042130033,0.00016210234,0.00052488304,0.00066118356,0.00039222836],"domain_scores_gemma":[0.9954471,0.0024070172,0.00055393367,0.00039126773,0.000581465,0.00061917404],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021240583,0.0006694162,0.00094679964,0.002830677,0.0028205265,0.004524498,0.0013760253,0.0010936585,0.008098774],"category_scores_gemma":[0.007872389,0.00047623907,0.0013115179,0.001380168,0.004213501,0.00637082,0.0026945227,0.0025245177,0.0011839935],"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.00003811543,0.000024129507,0.00079153944,0.000028765111,0.000010478286,0.000056645025,0.00032961392,0.0006510759,0.0014566589,0.9926318,0.00052163465,0.0034595416],"study_design_scores_gemma":[0.000018361898,0.000028546909,0.0005637559,0.000011210583,0.00001065181,0.000071562434,0.0001930377,0.0075750393,0.0033931022,0.9862883,0.0018176513,0.000028658638],"about_ca_topic_score_codex":0.0011910843,"about_ca_topic_score_gemma":0.001491065,"teacher_disagreement_score":0.008098774,"about_ca_system_score_codex":0.003130266,"about_ca_system_score_gemma":0.0009908831,"threshold_uncertainty_score":0.027093112},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10290287,0.0006436946,0.8541259,0.00095787353,0.00022418563,0.00021070355,0.0014429548,0.0032139092,0.036277823],"genre_scores_gemma":[0.3524017,0.00068776566,0.6110221,0.00021850863,0.00020652657,0.00016046234,0.004359818,0.0010014033,0.029941667],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99885285,0.00010429005,0.00008459272,0.00030105462,0.00045932195,0.00019793642],"domain_scores_gemma":[0.9988066,0.00043467572,0.00012046663,0.00019660302,0.00036518986,0.000076489174],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008941052,0.0012540963,0.0010334423,0.0016774725,0.0012568616,0.0029209435,0.0012050695,0.0010344889,0.01637632],"category_scores_gemma":[0.0049249236,0.00051728106,0.0014020322,0.0016900791,0.0011148279,0.004814875,0.0029291639,0.0019134679,0.007341461],"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.0004664555,0.00014904107,0.0042732335,0.00063908,0.00009340238,0.00060468406,0.0013207803,0.042710688,0.016692685,0.53034556,0.022884868,0.37981954],"study_design_scores_gemma":[0.00007225525,0.00015818766,0.0013006466,0.00012496738,0.000044401073,0.00047331728,0.000702506,0.13229585,0.022471445,0.7708643,0.0714121,0.00008003788],"about_ca_topic_score_codex":0.0018705861,"about_ca_topic_score_gemma":0.0016009131,"teacher_disagreement_score":0.01637632,"about_ca_system_score_codex":0.0014128105,"about_ca_system_score_gemma":0.00080504,"threshold_uncertainty_score":0.05478424},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.49756137,0.0062359083,0.23148891,0.0053059543,0.0011008439,0.000047903144,0.00043626587,0.0006045733,0.2572182],"genre_scores_gemma":[0.94225574,0.002265491,0.018394426,0.0003120082,0.00060894835,0.00005720527,0.00024358458,0.00026982807,0.035592794],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.999343,0.00019387125,0.000033017302,0.00015900732,0.00013472915,0.00013640858],"domain_scores_gemma":[0.9966658,0.0021470762,0.000362716,0.0002357615,0.00028547502,0.00030315883],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020335498,0.001385916,0.0010490062,0.003088087,0.0017113554,0.0030368618,0.0010990336,0.00078051066,0.011446346],"category_scores_gemma":[0.008520293,0.00044907525,0.0011042319,0.0020049138,0.0039777146,0.007235414,0.0022974997,0.002339537,0.0019413392],"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.00004345778,0.000009158777,0.00043868838,0.000056467816,0.000007500941,0.00014745389,0.00021965726,0.0014273598,0.0003573772,0.99108666,0.0012263625,0.0049799043],"study_design_scores_gemma":[0.000011523737,0.000025702062,0.00038269616,0.000037571437,0.000015838159,0.00015430666,0.00011261284,0.0053805676,0.00081540225,0.98817235,0.0048772194,0.000014233932],"about_ca_topic_score_codex":0.001281806,"about_ca_topic_score_gemma":0.0009361954,"teacher_disagreement_score":0.011446346,"about_ca_system_score_codex":0.0021392035,"about_ca_system_score_gemma":0.00070694473,"threshold_uncertainty_score":0.03829187},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0021591776,0.00025354256,0.9956169,0.00011622213,0.000036826194,0.000013687647,0.000027211741,0.00008660386,0.0016899235],"genre_scores_gemma":[0.13350026,0.0024365108,0.84446967,0.00031186282,0.00024804106,0.00023042904,0.0005674723,0.00033734788,0.017898357],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995301,0.00009923702,0.000022144188,0.000081016144,0.00022586058,0.00004165727],"domain_scores_gemma":[0.99968433,0.00009786838,0.000043745244,0.000039360304,0.000112094356,0.00002258462],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009931183,0.0008665621,0.0008900032,0.00077526574,0.00029130033,0.0008790381,0.00093619624,0.0009601521,0.0026986175],"category_scores_gemma":[0.0017657974,0.00031690637,0.0008295335,0.00080173585,0.0008104209,0.0009820617,0.001303428,0.0011385742,0.0011680791],"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.00022822543,0.00008139498,0.00033430458,0.00047820518,0.00009051941,0.00016479114,0.00019768074,0.30501047,0.03868438,0.32550782,0.0122621,0.31696],"study_design_scores_gemma":[0.000009701108,0.000053758366,0.00011678353,0.000025571302,0.000017248238,0.00007596778,0.00002194337,0.9498538,0.004908283,0.037195284,0.007708602,0.000013071247],"about_ca_topic_score_codex":0.0019184063,"about_ca_topic_score_gemma":0.001561773,"teacher_disagreement_score":0.0026986175,"about_ca_system_score_codex":0.0007474116,"about_ca_system_score_gemma":0.0009533878,"threshold_uncertainty_score":0.009027839},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.27912527,0.0013223906,0.68355876,0.0011682594,0.00028896655,0.00010838437,0.0005237211,0.00037118973,0.03353306],"genre_scores_gemma":[0.8723846,0.0011110413,0.08288447,0.0006626572,0.00019857696,0.00031242255,0.000781262,0.00022546033,0.041439526],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9996896,0.00008470816,0.00002215408,0.000045001812,0.00010877854,0.000049785966],"domain_scores_gemma":[0.9993437,0.00020334334,0.00011930045,0.000092386974,0.00016584944,0.00007553382],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00059475424,0.0006831637,0.0006757984,0.0005685837,0.00037926016,0.0012930194,0.0013635708,0.0016565457,0.0037521024],"category_scores_gemma":[0.0017425092,0.0003085957,0.00079710846,0.00043220032,0.0015089831,0.002525284,0.0017715017,0.0015918488,0.00076648593],"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.00016921615,0.000107245985,0.0014080248,0.00034517955,0.0000645425,0.0007969666,0.0004612337,0.26767358,0.048606377,0.6617425,0.0023361351,0.016288929],"study_design_scores_gemma":[0.000043381984,0.000044553333,0.00046431087,0.000022362481,0.000012449408,0.0002014192,0.00010817404,0.9107962,0.0060319304,0.07965589,0.0025813603,0.000037941023],"about_ca_topic_score_codex":0.0019243868,"about_ca_topic_score_gemma":0.00078140624,"teacher_disagreement_score":0.0037521024,"about_ca_system_score_codex":0.00047766147,"about_ca_system_score_gemma":0.00061621115,"threshold_uncertainty_score":0.012552083},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.034893252,0.0008567639,0.9499051,0.0008903058,0.00012900423,0.000051048322,0.00012295754,0.00023081996,0.012920684],"genre_scores_gemma":[0.81246686,0.0009788548,0.17475551,0.0004026613,0.0001322716,0.00023012457,0.00037009048,0.0003430565,0.010320503],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990361,0.00039957926,0.000056691046,0.00011277694,0.00030970314,0.00008523858],"domain_scores_gemma":[0.9971065,0.0016935351,0.00021514154,0.000302177,0.0005034296,0.00017931232],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002449269,0.0005929298,0.00064274063,0.0011417565,0.0006879098,0.001400567,0.0008244377,0.0011130329,0.0027138893],"category_scores_gemma":[0.011699117,0.00029527844,0.0008554254,0.00039472553,0.002739412,0.0017228615,0.0028067466,0.0020141236,0.00037859115],"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.000032682103,0.000015629656,0.0004960772,0.00007044559,0.00001272944,0.00004152419,0.00011326308,0.13052979,0.0019348664,0.86016756,0.0007735861,0.005811831],"study_design_scores_gemma":[0.000005842277,0.00001429802,0.00012791892,0.000021134852,0.000002632138,0.00001714763,0.000022739634,0.8502561,0.00045761498,0.14751834,0.0015485057,0.00000770469],"about_ca_topic_score_codex":0.0036708799,"about_ca_topic_score_gemma":0.0029113656,"teacher_disagreement_score":0.0036708799,"about_ca_system_score_codex":0.0021604933,"about_ca_system_score_gemma":0.0008292455,"threshold_uncertainty_score":0.015675545},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0054927655,0.00018151944,0.9895007,0.00018129057,0.00016115632,0.000020458754,0.00012843809,0.0002591264,0.004074462],"genre_scores_gemma":[0.17111745,0.0010025766,0.7986362,0.00041512822,0.00054228946,0.00017077976,0.0012478492,0.00081656803,0.026051125],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992849,0.00022092683,0.00003913953,0.00018983828,0.00018494774,0.000080121914],"domain_scores_gemma":[0.99869186,0.0004353416,0.00011688243,0.00036270317,0.0002785971,0.00011463757],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016560357,0.0011695425,0.0008044549,0.0012284109,0.00051301287,0.0017428178,0.000985272,0.0012965538,0.010248805],"category_scores_gemma":[0.0046694623,0.0005591521,0.0008760147,0.001219859,0.0012521811,0.0028456468,0.0015188616,0.002053992,0.0043861084],"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.00019648517,0.000037710764,0.00015461116,0.00013976642,0.000021198612,0.00014920217,0.00018485695,0.027886678,0.012027266,0.8661933,0.009662221,0.08334674],"study_design_scores_gemma":[0.000031798245,0.00009385843,0.00022435474,0.000051808838,0.00001974959,0.00019232288,0.00008676331,0.54311365,0.005073334,0.43333408,0.017737469,0.000040815507],"about_ca_topic_score_codex":0.0015745928,"about_ca_topic_score_gemma":0.0019133048,"teacher_disagreement_score":0.010248805,"about_ca_system_score_codex":0.0006760941,"about_ca_system_score_gemma":0.000718141,"threshold_uncertainty_score":0.034285665},"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0190637,0.00069952535,0.12457967,0.0032605757,0.003747019,0.00022111998,0.002994449,0.00260461,0.84282935],"genre_scores_gemma":[0.4383698,0.0021201482,0.14232907,0.003739533,0.003080163,0.00074858166,0.016882693,0.012834991,0.37989506],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99708396,0.00038226537,0.0002525702,0.00062535965,0.0009378964,0.00071787834],"domain_scores_gemma":[0.99828523,0.00041056698,0.00015057203,0.00030986377,0.0006683072,0.00017541548],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014572324,0.0013352527,0.00089381816,0.0014542553,0.003622763,0.005091995,0.0011565782,0.0014242016,0.12620479],"category_scores_gemma":[0.0062690675,0.00078763446,0.002150542,0.0014176052,0.0025820227,0.006756561,0.0042704563,0.004268901,0.048469756],"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.00009196374,0.00004823367,0.00029506013,0.0001702943,0.000019234889,0.00021492221,0.0005476746,0.0003696811,0.001321762,0.8956798,0.07609845,0.025143012],"study_design_scores_gemma":[0.00007943393,0.000026565274,0.00038371154,0.00012557018,0.000022475306,0.00042356178,0.0005690921,0.0013708078,0.0052674953,0.7856229,0.20605925,0.00004902611],"about_ca_topic_score_codex":0.0022514209,"about_ca_topic_score_gemma":0.0030523632,"teacher_disagreement_score":0.12620479,"about_ca_system_score_codex":0.002206349,"about_ca_system_score_gemma":0.0021053024,"threshold_uncertainty_score":0.4221971},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08676424,0.00080092164,0.8372838,0.004633061,0.0015985706,0.00043157148,0.0010304232,0.0026327737,0.064824656],"genre_scores_gemma":[0.70603734,0.00070337555,0.2722209,0.0024298192,0.00148468,0.0006000343,0.001991403,0.0015759214,0.012956643],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.98202574,0.0063905953,0.0011310086,0.003653133,0.005244607,0.0015549657],"domain_scores_gemma":[0.95369565,0.028627213,0.0023560617,0.0067927344,0.007074035,0.0014543397],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0143829705,0.0017217408,0.0025929038,0.0040968484,0.0021825596,0.004387181,0.0030793517,0.0029494308,0.01671695],"category_scores_gemma":[0.08333908,0.0012452934,0.0028662703,0.0022586444,0.007912672,0.014017368,0.009809738,0.008066874,0.0065019773],"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.0010727941,0.00015254786,0.0038214442,0.00036980343,0.00009542478,0.00046704398,0.00029394907,0.01078423,0.007584846,0.87337536,0.010456816,0.09152578],"study_design_scores_gemma":[0.00017789393,0.00047906482,0.001220453,0.00009654739,0.00006570824,0.0006333686,0.0001136162,0.061423108,0.02174273,0.8929874,0.020896073,0.00016410707],"about_ca_topic_score_codex":0.0004662477,"about_ca_topic_score_gemma":0.00032101487,"teacher_disagreement_score":0.01671695,"about_ca_system_score_codex":0.0018247153,"about_ca_system_score_gemma":0.0029254772,"threshold_uncertainty_score":0.07606536},"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.34081334,0.0013736344,0.26847956,0.002467201,0.0014501769,0.00012741996,0.0014819084,0.0034461252,0.38036063],"genre_scores_gemma":[0.8959143,0.000507942,0.037835363,0.0002866061,0.0003603125,0.00009538757,0.00076281716,0.0007935282,0.06344358],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.999171,0.00014423311,0.000070503615,0.00018126756,0.00022917295,0.00020383472],"domain_scores_gemma":[0.9991405,0.00034334644,0.00011299802,0.00016796963,0.00012918473,0.000105848354],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00087459607,0.0006910224,0.0005002202,0.001343115,0.0015936914,0.003764879,0.00078054186,0.00091557234,0.02681964],"category_scores_gemma":[0.0033399947,0.00050098466,0.00081861933,0.0010093676,0.0020407331,0.0061341403,0.0025134103,0.0022062673,0.005155933],"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.00006437095,0.000014014519,0.0002562587,0.00007588768,0.0000039841816,0.00023481267,0.00051435875,0.0006940163,0.0006992931,0.9863811,0.0033528411,0.007709134],"study_design_scores_gemma":[0.000038945476,0.000037486232,0.0007161537,0.00006424674,0.00002562563,0.00043946193,0.0004933503,0.006257207,0.0031285572,0.945829,0.042921316,0.00004872462],"about_ca_topic_score_codex":0.0007014454,"about_ca_topic_score_gemma":0.0012546262,"teacher_disagreement_score":0.02681964,"about_ca_system_score_codex":0.0016765473,"about_ca_system_score_gemma":0.0004822734,"threshold_uncertainty_score":0.08972067},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5690462,0.002527288,0.23280492,0.002816437,0.0009082345,0.00009413513,0.0011968904,0.0012874572,0.1893185],"genre_scores_gemma":[0.92575973,0.0010366498,0.016570807,0.00030849472,0.000597638,0.000104056264,0.00089036097,0.0005034177,0.054228965],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99906546,0.00020596369,0.000060678023,0.00021485964,0.00028242634,0.00017077175],"domain_scores_gemma":[0.9970855,0.0012875468,0.00027423652,0.0003192213,0.0005965978,0.00043691046],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015294659,0.0011251963,0.0008889193,0.004641683,0.0015143869,0.0039766207,0.0013110265,0.000872592,0.016263036],"category_scores_gemma":[0.009082338,0.00045277659,0.0007153115,0.0020007894,0.0023090644,0.0062790867,0.0025459854,0.0019110544,0.0041538565],"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.00016150351,0.000030619718,0.001254592,0.00015598646,0.000013951774,0.00020055531,0.00032565574,0.0015928792,0.0014447015,0.969765,0.0052798465,0.019774733],"study_design_scores_gemma":[0.000026400727,0.000038675505,0.00093599467,0.00007479096,0.000018617191,0.00034422433,0.00019537807,0.012251806,0.002849043,0.9731224,0.010102262,0.000040493025],"about_ca_topic_score_codex":0.00074321893,"about_ca_topic_score_gemma":0.00065494876,"teacher_disagreement_score":0.016263036,"about_ca_system_score_codex":0.0020692525,"about_ca_system_score_gemma":0.0006208772,"threshold_uncertainty_score":0.054405272},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.054372896,0.00014317277,0.9401598,0.00021007977,0.00007427281,0.000048058097,0.00003457974,0.00010340769,0.0048536984],"genre_scores_gemma":[0.7109961,0.00023635807,0.27864987,0.00020794572,0.00009052615,0.0002917831,0.00011700428,0.00016268637,0.009247684],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99965954,0.00011161507,0.000011002352,0.00004422478,0.00014270286,0.00003097813],"domain_scores_gemma":[0.9994417,0.00024694882,0.00007381362,0.00004135344,0.00013086927,0.00006533167],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00081244943,0.00060597836,0.0006696156,0.00044113013,0.00046282058,0.0009516857,0.001024259,0.0016254568,0.0015992472],"category_scores_gemma":[0.001624489,0.00039049887,0.0005830998,0.00025563568,0.0015023284,0.0006889672,0.0014817796,0.0009024703,0.00030321642],"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.00007052549,0.00005797027,0.0007908276,0.00008078474,0.000043250602,0.00016524829,0.00011533759,0.9066967,0.022496581,0.057516623,0.00035644646,0.011609661],"study_design_scores_gemma":[0.0000033931717,0.000017854116,0.000045288787,0.0000026410326,0.0000020198622,0.000011988666,0.00000455447,0.99721426,0.00044140004,0.0019141416,0.00033855985,0.000003932741],"about_ca_topic_score_codex":0.0020919482,"about_ca_topic_score_gemma":0.0010866299,"teacher_disagreement_score":0.0020919482,"about_ca_system_score_codex":0.000629383,"about_ca_system_score_gemma":0.00097467,"threshold_uncertainty_score":0.0053500533},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.02815741,0.008967658,0.78769606,0.0058224527,0.001748164,0.00011484136,0.0006812511,0.0014764322,0.16533574],"genre_scores_gemma":[0.639002,0.010664214,0.26139846,0.0054563507,0.004631445,0.0009692712,0.0019879658,0.0039229714,0.071967356],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99496764,0.0013272344,0.00022576857,0.0010300947,0.0016020316,0.0008472965],"domain_scores_gemma":[0.9754621,0.018043965,0.00083002826,0.0025124047,0.0022790735,0.0008725004],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.010200515,0.00381463,0.0017278953,0.005747055,0.0023280627,0.0061639915,0.0033684706,0.0028320274,0.027671603],"category_scores_gemma":[0.044947583,0.0011415603,0.002537669,0.0030451412,0.0051930007,0.016457768,0.007024849,0.015800245,0.011573124],"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.00014929865,0.000062457766,0.0006044854,0.00027299326,0.000039817736,0.00010642577,0.0002776829,0.006555542,0.0016597174,0.9498948,0.009847887,0.030528951],"study_design_scores_gemma":[0.000021888305,0.000057284633,0.0005665098,0.00018785667,0.000068298184,0.00019692449,0.000085167,0.051014107,0.0033114874,0.9266074,0.017821997,0.00006109146],"about_ca_topic_score_codex":0.0020054318,"about_ca_topic_score_gemma":0.0025025522,"teacher_disagreement_score":0.027671603,"about_ca_system_score_codex":0.00505589,"about_ca_system_score_gemma":0.0015794841,"threshold_uncertainty_score":0.09257072},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.39034387,0.0010128592,0.28989607,0.0024480429,0.0007049202,0.00022341587,0.0015142853,0.0013520961,0.31250444],"genre_scores_gemma":[0.911842,0.0009210989,0.03034036,0.00029797008,0.00032528862,0.00014994497,0.0010612091,0.0007338341,0.054328308],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.998667,0.00021268896,0.000076308876,0.00027315068,0.0004342017,0.00033662634],"domain_scores_gemma":[0.9983125,0.0002957955,0.00022193583,0.00014167298,0.00067473797,0.00035338703],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009297118,0.0006242385,0.0005010725,0.0027226147,0.00223713,0.0034801334,0.0007884676,0.00060378504,0.018958045],"category_scores_gemma":[0.0032657785,0.00033870825,0.0009978438,0.0019598773,0.0027983403,0.006052207,0.003245999,0.0021303114,0.0029950507],"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.000020448957,0.0000105487725,0.00023610426,0.000023592902,0.000005415857,0.00009324404,0.00041697657,0.0006776526,0.0006006195,0.99157214,0.0012514953,0.0050917533],"study_design_scores_gemma":[0.00003114559,0.00009071982,0.0012205747,0.000053109226,0.000021669617,0.00032590298,0.0016068316,0.009208367,0.0030550552,0.93721074,0.04712261,0.00005329208],"about_ca_topic_score_codex":0.0047744317,"about_ca_topic_score_gemma":0.0023751582,"teacher_disagreement_score":0.018958045,"about_ca_system_score_codex":0.002323829,"about_ca_system_score_gemma":0.0009704715,"threshold_uncertainty_score":0.06342095},"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":"editorial","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000982284,0.0048890207,0.013540239,0.11221197,0.82758355,0.00007323261,0.00082459557,0.0006581394,0.039236933],"genre_scores_gemma":[0.057771105,0.015541475,0.023254758,0.1640854,0.29283452,0.00048824053,0.0026715172,0.0024436335,0.4409093],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99712914,0.000701526,0.00027841088,0.00053001806,0.0011187162,0.0002423214],"domain_scores_gemma":[0.99350727,0.0020317442,0.00029640793,0.00063712616,0.0032303755,0.0002970956],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021825233,0.0015637275,0.0012513824,0.0020307803,0.0025210597,0.002055657,0.0032682228,0.0030632303,0.048115134],"category_scores_gemma":[0.020373184,0.000589083,0.0016747031,0.0015047932,0.0024184117,0.003202372,0.001979728,0.005167873,0.018233895],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","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.00003306405,0.000012311485,0.00008381156,0.00016474815,0.000018928165,0.00024677604,0.000060992643,0.00015858778,0.00014749054,0.01728537,0.9732378,0.0085502025],"study_design_scores_gemma":[0.000036004603,0.000032700602,0.0008630683,0.00018146473,0.00007651875,0.0005010519,0.0000759474,0.0017784087,0.00081272493,0.040316373,0.95526314,0.000062611776],"about_ca_topic_score_codex":0.009603336,"about_ca_topic_score_gemma":0.011021635,"teacher_disagreement_score":0.048115134,"about_ca_system_score_codex":0.003455792,"about_ca_system_score_gemma":0.0017996468,"threshold_uncertainty_score":0.16096115},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.024091367,0.0018301358,0.5947112,0.0012301464,0.0018457407,0.0003773041,0.0056251744,0.0069754315,0.3633135],"genre_scores_gemma":[0.39928874,0.0031419576,0.39606228,0.0012636022,0.00063654146,0.00077589374,0.013167049,0.0080744345,0.17758946],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99901974,0.00010727507,0.00008822633,0.0003035007,0.00035933385,0.000121885],"domain_scores_gemma":[0.9988556,0.00021422142,0.00011927073,0.00026597333,0.00037114706,0.00017372533],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00028582598,0.000791725,0.0008617956,0.00095074036,0.0009843197,0.0034081568,0.0011259097,0.000728579,0.039478596],"category_scores_gemma":[0.003853456,0.00063851103,0.00081440236,0.0015311665,0.0017788411,0.0025691397,0.0022170015,0.0011169907,0.021144157],"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.0006586951,0.00008040525,0.0010604848,0.00084617455,0.000036852947,0.00087064545,0.0008872952,0.007524651,0.021017928,0.49139035,0.14507873,0.3305478],"study_design_scores_gemma":[0.0000648635,0.000103376464,0.00078440213,0.00017357529,0.000026513897,0.0010508375,0.00052455656,0.013121476,0.012199604,0.1398155,0.8320503,0.00008499275],"about_ca_topic_score_codex":0.0032435253,"about_ca_topic_score_gemma":0.002805319,"teacher_disagreement_score":0.039478596,"about_ca_system_score_codex":0.00064413296,"about_ca_system_score_gemma":0.0010005573,"threshold_uncertainty_score":0.13206905},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06553864,0.0013965471,0.9064098,0.0009595668,0.00028242238,0.000045545115,0.00038147753,0.0006385945,0.024347462],"genre_scores_gemma":[0.789775,0.0023770083,0.1738454,0.0005545135,0.0006335289,0.00012868576,0.0011862145,0.000913723,0.030585917],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9980422,0.00048807223,0.00007406831,0.00030752592,0.00073670986,0.00035132785],"domain_scores_gemma":[0.99371606,0.003597942,0.00050774106,0.0009483089,0.000911915,0.0003181295],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0022982473,0.001400371,0.001388485,0.0024250317,0.0007678695,0.0026622657,0.0020982,0.001247691,0.0074994853],"category_scores_gemma":[0.016668573,0.00043987416,0.0017542213,0.0025179486,0.0017680445,0.0045935563,0.002533966,0.0034700988,0.0027404036],"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.00030356352,0.00012413823,0.0021001748,0.00038711526,0.0000857562,0.00028277547,0.00028328237,0.10155041,0.0029158192,0.80583256,0.010386912,0.07574752],"study_design_scores_gemma":[0.00001942624,0.000057912195,0.00052435795,0.000050550563,0.00003065117,0.00017589815,0.00007709761,0.6148048,0.0019511872,0.37600544,0.0062781526,0.00002447428],"about_ca_topic_score_codex":0.0039790105,"about_ca_topic_score_gemma":0.0028829898,"teacher_disagreement_score":0.0074994853,"about_ca_system_score_codex":0.0025980733,"about_ca_system_score_gemma":0.0010943407,"threshold_uncertainty_score":0.02508831},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08819928,0.00023958822,0.9071743,0.00042014467,0.00011388239,0.000061400795,0.000027927887,0.00008680836,0.0036767155],"genre_scores_gemma":[0.75245166,0.00053682004,0.23638766,0.00028897056,0.00010669992,0.0005184983,0.00010768857,0.00015443868,0.009447574],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993001,0.0003183516,0.000028571778,0.000067145644,0.00022778484,0.000058013466],"domain_scores_gemma":[0.99775296,0.0012043066,0.00024100309,0.00009976024,0.0004921571,0.00020980448],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002546477,0.0012664528,0.0007969813,0.0011695041,0.0006695358,0.001264124,0.0010714567,0.0017547674,0.0017169613],"category_scores_gemma":[0.006133088,0.0004649508,0.000903146,0.00044395824,0.0026222777,0.0010230177,0.0034970285,0.001624708,0.00026367087],"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.00023159197,0.000150534,0.001994475,0.0003183497,0.00011610843,0.0002450974,0.000490322,0.76380116,0.042169265,0.16653113,0.00054128526,0.023410691],"study_design_scores_gemma":[0.00000829298,0.0000459519,0.0000922361,0.000011212133,0.0000055866685,0.000019023235,0.000016804266,0.99017406,0.0017790999,0.007403771,0.00043607014,0.0000079591655],"about_ca_topic_score_codex":0.0017698525,"about_ca_topic_score_gemma":0.00076953706,"teacher_disagreement_score":0.002546477,"about_ca_system_score_codex":0.00087095523,"about_ca_system_score_gemma":0.0009478412,"threshold_uncertainty_score":0.013467193},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13398144,0.0003536907,0.83392286,0.0004936399,0.00019864425,0.00009915466,0.00035487406,0.005058532,0.025537085],"genre_scores_gemma":[0.45694378,0.00015220472,0.5347982,0.00012216388,0.00009874988,0.0000798998,0.00056605355,0.0005769703,0.006661973],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991146,0.0001662031,0.00004887802,0.00016047654,0.00034336554,0.00016648913],"domain_scores_gemma":[0.9988617,0.00039105403,0.000041926553,0.0003757278,0.00026548127,0.00006416571],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011741968,0.00067942706,0.0008348878,0.0017309783,0.0008431997,0.0018990493,0.0014510493,0.0008662624,0.009081892],"category_scores_gemma":[0.0050299237,0.00037292394,0.0008204655,0.001343968,0.001262286,0.004565223,0.0028669897,0.0021277152,0.0018751044],"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.00044010903,0.0001862847,0.0024057215,0.00023637003,0.000061106206,0.00018883085,0.000886881,0.04383203,0.0298813,0.5177893,0.010167652,0.3939245],"study_design_scores_gemma":[0.00018810485,0.00022722615,0.0012598311,0.000056003486,0.00003690677,0.00031741572,0.00021929471,0.39578363,0.060281992,0.49619898,0.045330677,0.0000999336],"about_ca_topic_score_codex":0.0018611008,"about_ca_topic_score_gemma":0.002320526,"teacher_disagreement_score":0.009081892,"about_ca_system_score_codex":0.0013007586,"about_ca_system_score_gemma":0.0015829689,"threshold_uncertainty_score":0.030381978},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.023822851,0.0003767978,0.9646435,0.0005362936,0.00012602178,0.00006651295,0.00003210344,0.00008642769,0.010309591],"genre_scores_gemma":[0.5837917,0.000762429,0.3980945,0.0003170321,0.0002489007,0.00038123067,0.00012536324,0.00027777156,0.016001143],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993498,0.00029909334,0.000021161788,0.000036799374,0.0002560424,0.000037142785],"domain_scores_gemma":[0.99890614,0.00059154915,0.00008218719,0.00010238101,0.00024594407,0.00007183249],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017956576,0.0006839904,0.0005125883,0.00090172247,0.00078024407,0.00082012825,0.0010192911,0.0012361406,0.0032710214],"category_scores_gemma":[0.0040631816,0.0002347906,0.00068854634,0.0003441115,0.0019360892,0.0016035319,0.0011568012,0.0014186092,0.0004677463],"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.000033585122,0.000043870732,0.00024595653,0.00009706996,0.000018386707,0.000074213,0.00013456322,0.096828625,0.005609745,0.88723993,0.0008554847,0.008818536],"study_design_scores_gemma":[0.00000793072,0.000014273512,0.00007530452,0.000016492226,0.0000032921566,0.000028536148,0.000021066175,0.9111423,0.0008527282,0.08661973,0.0012081722,0.000010280178],"about_ca_topic_score_codex":0.0016915591,"about_ca_topic_score_gemma":0.0012621514,"teacher_disagreement_score":0.0032710214,"about_ca_system_score_codex":0.0008847235,"about_ca_system_score_gemma":0.0010515262,"threshold_uncertainty_score":0.010942638},"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0074737705,0.002166292,0.3946578,0.0030535427,0.0027621496,0.00015816728,0.0014406042,0.0059662433,0.5823214],"genre_scores_gemma":[0.19080515,0.0020930264,0.33472064,0.0019619984,0.0016469767,0.00038311275,0.0036325918,0.0072632586,0.4574932],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99697864,0.0007336918,0.00015123961,0.00087071816,0.00083441037,0.00043125756],"domain_scores_gemma":[0.9978399,0.0004173381,0.00010022287,0.0006786811,0.00078824774,0.00017544595],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021172161,0.0017247736,0.0013393111,0.0028414747,0.0036181784,0.0055096606,0.0018862627,0.0014091702,0.113233104],"category_scores_gemma":[0.008249179,0.0007784349,0.002091371,0.0021356214,0.0031867449,0.007276112,0.0046600197,0.0034694737,0.047296207],"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.000098206,0.00002677025,0.00020075795,0.00013677869,0.000012187336,0.000117335934,0.0004983647,0.0006015021,0.0009111169,0.89319247,0.044367425,0.05983712],"study_design_scores_gemma":[0.000035079775,0.000034244615,0.00018516825,0.00013104512,0.000018912067,0.00022317475,0.00025456835,0.008076991,0.0027879174,0.5715065,0.41670313,0.00004318892],"about_ca_topic_score_codex":0.008413893,"about_ca_topic_score_gemma":0.011830082,"teacher_disagreement_score":0.113233104,"about_ca_system_score_codex":0.0036920495,"about_ca_system_score_gemma":0.0024848059,"threshold_uncertainty_score":0.37880248},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.038602784,0.012438787,0.4478694,0.115965486,0.01392728,0.00021321308,0.0010974426,0.0013462135,0.36853948],"genre_scores_gemma":[0.4250465,0.010641769,0.25024667,0.021318112,0.019021474,0.0007214015,0.0016495141,0.004153557,0.2672011],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9940035,0.0023609244,0.00033237218,0.0013739405,0.0012174795,0.0007117421],"domain_scores_gemma":[0.98548985,0.010247291,0.0006326483,0.0015644821,0.001543281,0.0005224501],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.008136768,0.0014667818,0.0023182782,0.002465384,0.00636519,0.005407931,0.0034340657,0.004404314,0.01751036],"category_scores_gemma":[0.04139609,0.0011159717,0.0031384812,0.0027602096,0.011137222,0.023167804,0.0069022137,0.012220593,0.0051482935],"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.000058725753,0.000013175665,0.00010922025,0.000090367335,0.000008732367,0.00006802802,0.00036811375,0.0003416642,0.00016902866,0.97436553,0.017752104,0.006655252],"study_design_scores_gemma":[0.000019273119,0.000016923426,0.00011855783,0.000054910393,0.000013371276,0.00009910186,0.00019497264,0.0018282975,0.0002955375,0.9592495,0.038086873,0.000022709479],"about_ca_topic_score_codex":0.005322566,"about_ca_topic_score_gemma":0.002702857,"teacher_disagreement_score":0.01751036,"about_ca_system_score_codex":0.004436142,"about_ca_system_score_gemma":0.0020534992,"threshold_uncertainty_score":0.058577955},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.02462853,0.0008238085,0.9588541,0.0009918333,0.00019362418,0.00007495202,0.00015329997,0.00037507794,0.013904792],"genre_scores_gemma":[0.54352015,0.0015842563,0.4196967,0.00064675877,0.00022959567,0.0004868926,0.00070786604,0.0010761836,0.03205164],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99867296,0.0004509092,0.000057801717,0.00013238595,0.0005519889,0.00013386282],"domain_scores_gemma":[0.99006885,0.0061807637,0.000749361,0.0008069719,0.0016782208,0.0005158442],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004539539,0.0018810638,0.0010388681,0.0011944479,0.00082375534,0.0019023282,0.0015800612,0.0017679712,0.004850077],"category_scores_gemma":[0.0154720135,0.00060755457,0.0014099348,0.00062289595,0.002838987,0.001879622,0.004227946,0.003688736,0.0013815094],"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.00056347385,0.00015436077,0.0039698645,0.00097422337,0.0001534534,0.00040331922,0.0005712131,0.60703844,0.010755775,0.31733048,0.0066567603,0.051428717],"study_design_scores_gemma":[0.000008258461,0.000019880308,0.00010239309,0.000035366942,0.000009443419,0.000042002128,0.000029229379,0.97971606,0.0018406578,0.016547045,0.0016410393,0.000008641786],"about_ca_topic_score_codex":0.004105948,"about_ca_topic_score_gemma":0.0035536233,"teacher_disagreement_score":0.004850077,"about_ca_system_score_codex":0.0015438764,"about_ca_system_score_gemma":0.0014315092,"threshold_uncertainty_score":0.024007618},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.019640012,0.020325584,0.68045336,0.006966881,0.0027708807,0.000039347073,0.0006185764,0.0011599935,0.26802534],"genre_scores_gemma":[0.55638033,0.03053262,0.22526787,0.003204394,0.008561222,0.00030185923,0.0014085323,0.003049106,0.17129411],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985618,0.00046459775,0.000066745335,0.0001879882,0.0005790118,0.00013984228],"domain_scores_gemma":[0.9978678,0.0009831127,0.00013006631,0.0003879652,0.00048646866,0.00014453763],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0026816896,0.0012674816,0.0015984351,0.0023956457,0.0012785413,0.0036094876,0.001924189,0.0015136249,0.015359254],"category_scores_gemma":[0.0072668428,0.00065506017,0.0021403274,0.0021824401,0.0031914571,0.0071316347,0.0022891818,0.004218888,0.0061424277],"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.000006666999,0.00000776371,0.000058443737,0.00004882999,0.0000058738674,0.000017408642,0.000043509055,0.0013988485,0.000094154224,0.98842514,0.0040691537,0.0058241207],"study_design_scores_gemma":[0.0000029826479,0.0000051581956,0.00006954041,0.000023246184,0.000003245802,0.000022565315,0.000013307748,0.012950382,0.00010607298,0.97667783,0.010118417,0.0000072244584],"about_ca_topic_score_codex":0.002789162,"about_ca_topic_score_gemma":0.001485897,"teacher_disagreement_score":0.015359254,"about_ca_system_score_codex":0.002376112,"about_ca_system_score_gemma":0.0015293821,"threshold_uncertainty_score":0.051381826},"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.22542673,0.0042147925,0.042980347,0.030750865,0.003058427,0.0000685781,0.00072854577,0.0008543245,0.69191754],"genre_scores_gemma":[0.91413516,0.0023609917,0.009855199,0.003510859,0.002276986,0.0000867396,0.0011012538,0.0002865328,0.066386305],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99919444,0.00013664362,0.000031554406,0.00018158776,0.00024707403,0.00020870227],"domain_scores_gemma":[0.99835265,0.0006303245,0.00012622765,0.0003218989,0.0003179791,0.00025081975],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010693866,0.0006897923,0.0010378936,0.0017470457,0.0025706284,0.003151114,0.0012191486,0.0019945977,0.02487575],"category_scores_gemma":[0.006122848,0.0003474998,0.0009203601,0.0016194144,0.003971964,0.008041217,0.00406055,0.004172536,0.003734205],"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.00008212055,0.00002562452,0.00060468307,0.0000938928,0.0000094019,0.00013525979,0.0003058373,0.00084297784,0.00037914186,0.97270536,0.013869056,0.010946665],"study_design_scores_gemma":[0.000019566522,0.000008494751,0.00043558958,0.00002113016,0.000006173312,0.000060639322,0.00010239158,0.001609212,0.00018186097,0.98906773,0.008478892,0.0000082766155],"about_ca_topic_score_codex":0.0053601046,"about_ca_topic_score_gemma":0.0029717544,"teacher_disagreement_score":0.02487575,"about_ca_system_score_codex":0.002214799,"about_ca_system_score_gemma":0.0014447531,"threshold_uncertainty_score":0.08321768},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05713406,0.000115969226,0.9382202,0.00013351873,0.00003550559,0.000046666184,0.000034130317,0.00086988206,0.003410008],"genre_scores_gemma":[0.48466173,0.00021525516,0.5106208,0.00011396818,0.000066825756,0.00017118998,0.0002482587,0.0006541429,0.003247884],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.997338,0.0007308362,0.00018581776,0.00028503215,0.0012580921,0.00020218031],"domain_scores_gemma":[0.98273796,0.012790832,0.0010426891,0.0013494956,0.0017223192,0.00035674727],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0055480334,0.0009224755,0.0007682926,0.0031035244,0.0007903987,0.0018064901,0.0015581346,0.0010137206,0.0025757316],"category_scores_gemma":[0.0537215,0.0004768146,0.0007157421,0.0011471699,0.0029271075,0.0031885053,0.0030508908,0.0023417438,0.0009504981],"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.00028042422,0.0001100895,0.005718364,0.00026081668,0.000058267036,0.0002782157,0.000894195,0.32645053,0.012310301,0.51561373,0.0016001782,0.13642488],"study_design_scores_gemma":[0.000011076165,0.00004583707,0.0003200337,0.000042244083,0.0000072212683,0.000052180654,0.000060384165,0.82572156,0.007137394,0.1655658,0.0010180286,0.000018232517],"about_ca_topic_score_codex":0.0014128011,"about_ca_topic_score_gemma":0.0021481775,"teacher_disagreement_score":0.0055480334,"about_ca_system_score_codex":0.001718622,"about_ca_system_score_gemma":0.0012666453,"threshold_uncertainty_score":0.029341161},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.34569585,0.00012871591,0.61747867,0.00064966135,0.00012082197,0.00022575574,0.0006552181,0.001621688,0.03342373],"genre_scores_gemma":[0.9595079,0.000064415355,0.035692547,0.00012375033,0.00007998689,0.000116489944,0.00047844343,0.00022208349,0.0037144576],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9971154,0.0004980463,0.00010361952,0.00042100134,0.0015170039,0.0003450257],"domain_scores_gemma":[0.98430264,0.008468418,0.0020686144,0.0020324807,0.00231869,0.000809021],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020794591,0.0008621801,0.00084364536,0.0021022102,0.000822861,0.0018146217,0.0016579601,0.00091264246,0.01146357],"category_scores_gemma":[0.03966218,0.00034808405,0.0005000879,0.0013423625,0.0028774901,0.0052033616,0.004017501,0.0014840856,0.0012406365],"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.0007279114,0.00025414614,0.016576579,0.00022749465,0.00006997762,0.00051543646,0.0005764379,0.123176895,0.024333987,0.7207438,0.00419619,0.10860115],"study_design_scores_gemma":[0.00006113308,0.00031611774,0.001707014,0.000040657873,0.000019723868,0.000295453,0.00020523774,0.51237273,0.022981586,0.45865783,0.0032929815,0.00004946715],"about_ca_topic_score_codex":0.00095985574,"about_ca_topic_score_gemma":0.00080264214,"teacher_disagreement_score":0.01146357,"about_ca_system_score_codex":0.00077254814,"about_ca_system_score_gemma":0.0011943494,"threshold_uncertainty_score":0.03834951},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.83205074,0.0018539566,0.13787071,0.002541388,0.00010324114,0.000103033984,0.0012399344,0.0005316548,0.023705408],"genre_scores_gemma":[0.95760345,0.00069597695,0.034134176,0.00043021663,0.000087302426,0.00009830383,0.00084932655,0.0001238224,0.005977432],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9993131,0.00015925842,0.000036726575,0.00027811664,0.000099980185,0.0001129013],"domain_scores_gemma":[0.9943046,0.0037030613,0.0006498263,0.0006326241,0.0002900643,0.00041988323],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005322638,0.00047679123,0.00068990176,0.0012640583,0.001360766,0.0017809472,0.0013011501,0.00089843996,0.005359817],"category_scores_gemma":[0.0066801263,0.0007706621,0.00072028115,0.0012421777,0.0018463227,0.0029921732,0.0012723306,0.0012846928,0.0006243545],"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.00074696157,0.0002211624,0.014182661,0.0014499172,0.00024826126,0.0013280241,0.0020779683,0.062296916,0.02773205,0.79595554,0.013317306,0.08044325],"study_design_scores_gemma":[0.00010595574,0.00011406225,0.002558172,0.00012038232,0.00012618065,0.0008092125,0.0006203072,0.08197093,0.008296512,0.8952765,0.009957263,0.000044580647],"about_ca_topic_score_codex":0.0013230212,"about_ca_topic_score_gemma":0.0023825807,"teacher_disagreement_score":0.005359817,"about_ca_system_score_codex":0.0010326997,"about_ca_system_score_gemma":0.0006142228,"threshold_uncertainty_score":0.017930388},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.028056119,0.0009798548,0.96691716,0.00011545186,0.00005570145,0.000047210222,0.000021598982,0.00016112371,0.0036457411],"genre_scores_gemma":[0.60292614,0.0010449025,0.38709727,0.00009529614,0.000052246716,0.00025114647,0.00008823241,0.0001808972,0.008263861],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9997894,0.00008055519,0.000013169576,0.000025987434,0.000070686525,0.000020244419],"domain_scores_gemma":[0.99961555,0.00016048367,0.000060726143,0.00006487009,0.00007461156,0.000023679086],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006784726,0.0005662612,0.0005686426,0.00032870896,0.00035575643,0.0005134441,0.0007590305,0.0006628983,0.00090621033],"category_scores_gemma":[0.0018879072,0.00021785287,0.00057404896,0.00025879996,0.0010866175,0.00063176523,0.0010565303,0.0010484044,0.00030278225],"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.00008963479,0.000059477476,0.0011324099,0.00041376505,0.00004893328,0.00017229511,0.00040611866,0.6846581,0.029336926,0.2205003,0.0008086618,0.062373266],"study_design_scores_gemma":[0.000007084149,0.000024499364,0.00010992248,0.000013814685,0.000005275172,0.000035686913,0.000009983641,0.9854715,0.0031063722,0.009123381,0.0020847798,0.000007848434],"about_ca_topic_score_codex":0.001218386,"about_ca_topic_score_gemma":0.0012503279,"teacher_disagreement_score":0.001218386,"about_ca_system_score_codex":0.00044176052,"about_ca_system_score_gemma":0.00065580104,"threshold_uncertainty_score":0.0035881996},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03476868,0.00085377926,0.94889086,0.0017684054,0.00034038036,0.0001586237,0.00016385481,0.00033656642,0.012718825],"genre_scores_gemma":[0.72069305,0.0017823199,0.235392,0.0011269572,0.0005994024,0.0009510239,0.00060275756,0.0007432479,0.038109187],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99769586,0.00082394877,0.00015769129,0.00039236786,0.00067298266,0.00025713237],"domain_scores_gemma":[0.98440766,0.008484861,0.0012854867,0.0016686535,0.0029509927,0.0012024192],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.009088274,0.0021332186,0.0016596034,0.00200703,0.0015570845,0.0026934443,0.0033152637,0.0034695726,0.006389341],"category_scores_gemma":[0.03398188,0.0006150213,0.002279967,0.0006574863,0.004840517,0.0053315097,0.009287995,0.0054125343,0.0010566693],"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.00030251412,0.00007317833,0.002421945,0.00036613515,0.0000903456,0.00021792995,0.0004671113,0.13953081,0.0087004425,0.8312114,0.0024139988,0.0142041845],"study_design_scores_gemma":[0.000019626881,0.000084245075,0.00026603192,0.000057297384,0.00002423654,0.000045237437,0.00004174003,0.89806646,0.0019698588,0.09782012,0.0015625466,0.00004261925],"about_ca_topic_score_codex":0.0035111015,"about_ca_topic_score_gemma":0.0014252628,"teacher_disagreement_score":0.009088274,"about_ca_system_score_codex":0.003272838,"about_ca_system_score_gemma":0.0026662888,"threshold_uncertainty_score":0.048063993},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07125575,0.0016831215,0.91842806,0.0011181013,0.00008518268,0.00011391943,0.00017085437,0.0006551542,0.0064898073],"genre_scores_gemma":[0.7874347,0.0012548212,0.20369369,0.00059010804,0.00014255632,0.00046017178,0.0005911941,0.0007286056,0.0051041213],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9949333,0.0021342793,0.00022107389,0.00060672074,0.0015976921,0.0005068652],"domain_scores_gemma":[0.9484633,0.042164866,0.001672034,0.003748432,0.0031181483,0.00083320966],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.008159072,0.0012431317,0.0012736116,0.0011561672,0.0007947614,0.0023009453,0.0020474838,0.0015736433,0.0035827085],"category_scores_gemma":[0.061387487,0.0005108699,0.0010676195,0.00093312125,0.0027144833,0.00463426,0.0021579629,0.0027831409,0.0008920507],"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.000743978,0.00022044065,0.0035251204,0.00049294665,0.00013229107,0.00011572586,0.00018063639,0.8093181,0.006313924,0.13615747,0.002971073,0.03982826],"study_design_scores_gemma":[0.000017837881,0.000145851,0.0004716415,0.00003663253,0.000017294264,0.000056500307,0.000021598398,0.96669924,0.0020665932,0.02993857,0.00051367073,0.000014596726],"about_ca_topic_score_codex":0.0009191993,"about_ca_topic_score_gemma":0.0009992094,"teacher_disagreement_score":0.008159072,"about_ca_system_score_codex":0.0024217167,"about_ca_system_score_gemma":0.0020828666,"threshold_uncertainty_score":0.04314983},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008362072,0.00058391615,0.88080436,0.0015597969,0.0006055388,0.00016985848,0.0008480727,0.0065033077,0.10056305],"genre_scores_gemma":[0.1526413,0.0018003099,0.7165269,0.0018669128,0.00044581798,0.0006589903,0.0030433969,0.008193547,0.114822775],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99902844,0.0002192345,0.00007086996,0.00019052927,0.00037310406,0.00011779301],"domain_scores_gemma":[0.99929607,0.0003588953,0.000029529721,0.0001306826,0.00015653181,0.000028217875],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015065474,0.00065869646,0.0005965747,0.0012277676,0.00080667995,0.0020953394,0.0011566762,0.00074944395,0.031226475],"category_scores_gemma":[0.0040829885,0.00041304354,0.0010385207,0.0012802583,0.0013720134,0.0032688333,0.0026979386,0.0026482947,0.010670159],"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.000121069614,0.000060609298,0.00042484788,0.0002312183,0.00002160916,0.00015543008,0.00061382254,0.0022795107,0.0031423965,0.810927,0.03100508,0.15101737],"study_design_scores_gemma":[0.00012152204,0.000060391838,0.00065581023,0.0001839822,0.000031697804,0.00027087537,0.00018986333,0.022654744,0.009941645,0.6437845,0.32203546,0.0000693907],"about_ca_topic_score_codex":0.0020186037,"about_ca_topic_score_gemma":0.0022135042,"teacher_disagreement_score":0.031226475,"about_ca_system_score_codex":0.0012842965,"about_ca_system_score_gemma":0.0013761098,"threshold_uncertainty_score":0.10446298},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03200165,0.0002739395,0.9563934,0.0002096635,0.00013749725,0.000044705113,0.000109364664,0.001441576,0.0093882205],"genre_scores_gemma":[0.27929386,0.00036702084,0.70936495,0.00022021409,0.00014278898,0.00026807914,0.0005180058,0.001608076,0.008216944],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991099,0.0001895413,0.000063707455,0.000094962765,0.0004618568,0.00007999741],"domain_scores_gemma":[0.99802905,0.0010993808,0.00011309504,0.0003431973,0.00030348613,0.00011174323],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011197675,0.0008506192,0.0009935242,0.0011893298,0.0010896531,0.0015283339,0.0016333092,0.0007488692,0.0044449097],"category_scores_gemma":[0.0052145203,0.00042951913,0.0008070036,0.0010859024,0.0017708594,0.0035993678,0.0023659552,0.0016515952,0.0020087012],"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.00034773405,0.00014398716,0.0014267637,0.00044027643,0.000093553346,0.00042127783,0.0004065063,0.29319146,0.02029459,0.463684,0.0065691997,0.21298072],"study_design_scores_gemma":[0.0000295803,0.000030123387,0.00015087327,0.000021436656,0.000009159862,0.00006823726,0.000032082666,0.82643366,0.0052527655,0.16331112,0.0046363096,0.000024656034],"about_ca_topic_score_codex":0.001830089,"about_ca_topic_score_gemma":0.002298357,"teacher_disagreement_score":0.0044449097,"about_ca_system_score_codex":0.0007385112,"about_ca_system_score_gemma":0.0011393722,"threshold_uncertainty_score":0.01486969},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04759185,0.005128995,0.8528434,0.0020912683,0.0008225781,0.0003623559,0.002245862,0.0027997154,0.08611402],"genre_scores_gemma":[0.22963323,0.003201452,0.7270705,0.0019972615,0.0013233639,0.00080727565,0.0062511372,0.0035249174,0.02619087],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9929751,0.0016712693,0.00056590495,0.0015884978,0.0025123798,0.0006868481],"domain_scores_gemma":[0.9803595,0.013046494,0.000985011,0.0028824408,0.0022113977,0.0005151514],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0040184245,0.0024719636,0.0026042117,0.008149023,0.0037347388,0.0046709757,0.0039218045,0.0023820458,0.04210918],"category_scores_gemma":[0.038186844,0.0014854909,0.0033239173,0.006786701,0.0033932277,0.014069731,0.0056490772,0.0046198843,0.010223003],"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.0007486111,0.00033078817,0.0039772373,0.002200042,0.00023149603,0.0005704034,0.0012205355,0.049874082,0.0041744784,0.6027061,0.05130036,0.28266594],"study_design_scores_gemma":[0.00011306884,0.00018863802,0.0008809098,0.0003847111,0.00014381896,0.00067256123,0.0004926026,0.11995087,0.0034714893,0.8182721,0.055292677,0.00013651678],"about_ca_topic_score_codex":0.0030881502,"about_ca_topic_score_gemma":0.004113694,"teacher_disagreement_score":0.04210918,"about_ca_system_score_codex":0.0017670459,"about_ca_system_score_gemma":0.002615287,"threshold_uncertainty_score":0.14086926},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.16870944,0.002683768,0.54781413,0.0026409458,0.0018545914,0.000096053984,0.0005118184,0.0012319206,0.27445728],"genre_scores_gemma":[0.82969177,0.0024380912,0.06175195,0.0008537693,0.0010422004,0.00017492507,0.0005351221,0.0016292213,0.101882935],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993716,0.00020640933,0.00003055967,0.0001088206,0.00018870813,0.00009382121],"domain_scores_gemma":[0.9985954,0.0006537039,0.00013724244,0.00014205683,0.00032504328,0.00014655893],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014490003,0.0013175907,0.0007194411,0.0025382591,0.0009769868,0.0020633482,0.0010738759,0.00082366937,0.017637694],"category_scores_gemma":[0.007835419,0.0004077499,0.0010313557,0.001265713,0.0021018211,0.0029784404,0.0015062426,0.002451093,0.0046103005],"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.000069466354,0.000018761613,0.00027370313,0.00008521242,0.000010558269,0.00020715831,0.00024850396,0.0035926357,0.0017536948,0.9738529,0.0047606537,0.01512683],"study_design_scores_gemma":[0.000024198967,0.00005038671,0.00064128893,0.0001018323,0.000019705767,0.0003458155,0.00020380694,0.07664008,0.0023297023,0.90542006,0.014176184,0.000046928235],"about_ca_topic_score_codex":0.0021121758,"about_ca_topic_score_gemma":0.0017124605,"teacher_disagreement_score":0.017637694,"about_ca_system_score_codex":0.0016333845,"about_ca_system_score_gemma":0.0005774827,"threshold_uncertainty_score":0.05900401},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.034901887,0.017241256,0.7889511,0.007398782,0.0061578657,0.00015551085,0.0008227615,0.0017219287,0.14264892],"genre_scores_gemma":[0.5509871,0.030199058,0.27059087,0.004207743,0.015542652,0.000869273,0.0027060593,0.005601682,0.11929558],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9967141,0.0011871355,0.0001913664,0.00046477412,0.0010710086,0.00037150542],"domain_scores_gemma":[0.98540974,0.008032082,0.0006625093,0.001917453,0.0030417922,0.00093641266],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.008677438,0.004135036,0.0024251507,0.011415126,0.0018799424,0.004017669,0.005405144,0.0020533928,0.018011864],"category_scores_gemma":[0.038394988,0.00086466095,0.0032919121,0.0037976457,0.003573238,0.015762256,0.0065736873,0.01075241,0.008469568],"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.00015714983,0.000092431124,0.0012651011,0.0006777303,0.00008102885,0.0002589103,0.0004783377,0.00575368,0.0025437416,0.9155576,0.020982556,0.052151784],"study_design_scores_gemma":[0.00003128669,0.000071243405,0.0017714617,0.0003358955,0.0001866142,0.0004117945,0.00020581488,0.076864175,0.0031403697,0.8755505,0.041292522,0.00013837434],"about_ca_topic_score_codex":0.0018704268,"about_ca_topic_score_gemma":0.0017350825,"teacher_disagreement_score":0.018011864,"about_ca_system_score_codex":0.0032167793,"about_ca_system_score_gemma":0.0017325999,"threshold_uncertainty_score":0.060255706},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.050830718,0.002844552,0.9041737,0.003687167,0.00033291292,0.00003451049,0.0001825359,0.00030610905,0.037607804],"genre_scores_gemma":[0.7209746,0.003708966,0.24983546,0.0012363526,0.0019858826,0.00019538288,0.0004907346,0.0007686596,0.020803915],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9975217,0.000968712,0.000088750334,0.0005213625,0.0006527818,0.00024661337],"domain_scores_gemma":[0.984053,0.0122334985,0.0009481561,0.001363819,0.0008628319,0.00053870224],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.006063393,0.0016852836,0.0015815987,0.0034991347,0.0012036671,0.002513244,0.0018125249,0.0013341682,0.007684018],"category_scores_gemma":[0.03978802,0.0004234177,0.0012298252,0.0016564904,0.0065120207,0.009890473,0.003624078,0.0049267192,0.0013966204],"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.000076833385,0.00002455419,0.00066509476,0.00012183774,0.000016734988,0.000076935736,0.00009568864,0.017035132,0.00093292084,0.9579376,0.0021268758,0.020889698],"study_design_scores_gemma":[0.0000071307386,0.000028068698,0.0002832544,0.000046120305,0.000011267655,0.000062350446,0.000023984287,0.05364934,0.0009706127,0.9430552,0.0018443187,0.000018291024],"about_ca_topic_score_codex":0.00083385064,"about_ca_topic_score_gemma":0.00075775495,"teacher_disagreement_score":0.007684018,"about_ca_system_score_codex":0.0016277566,"about_ca_system_score_gemma":0.0011031427,"threshold_uncertainty_score":0.032066643},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15917316,0.0012942498,0.66498154,0.0013178146,0.00019375062,0.0002931535,0.04540067,0.053078312,0.07426733],"genre_scores_gemma":[0.5727578,0.0017131672,0.31513757,0.0005829889,0.00027393806,0.0006602288,0.081227645,0.011657177,0.015989473],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99541855,0.000839325,0.00041599793,0.0006671556,0.0024331557,0.00022574898],"domain_scores_gemma":[0.9791474,0.011920546,0.0012058134,0.005076555,0.002252509,0.00039709412],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0031729557,0.000580804,0.0009712198,0.007028109,0.0011121051,0.0049550384,0.002121829,0.0006813328,0.01203239],"category_scores_gemma":[0.02972473,0.00062108965,0.0010515853,0.010703625,0.0011923113,0.008391401,0.002389734,0.001322773,0.0044651637],"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.0005825847,0.00017262624,0.01926793,0.00064068317,0.00012302733,0.0011143117,0.0014252829,0.026072636,0.0033720103,0.6448039,0.066101834,0.2363232],"study_design_scores_gemma":[0.000101987935,0.00015869159,0.0064275647,0.0001498398,0.000101825826,0.0015977892,0.0006794779,0.15895097,0.01632887,0.605201,0.21016423,0.0001377664],"about_ca_topic_score_codex":0.0039234627,"about_ca_topic_score_gemma":0.0038991894,"teacher_disagreement_score":0.01203239,"about_ca_system_score_codex":0.001718563,"about_ca_system_score_gemma":0.0025966973,"threshold_uncertainty_score":0.040252328},"labels":[],"label_agreement":null}]}