{"meta":{"query_hash":"baf3b50b1d23","filters":{"venue":"LMS Journal of Computation and Mathematics"},"cohort_total":30,"direct_labels_cover":0,"predictions_cover":30,"exported":30,"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/baf3b50b1d23","api":"https://metacan.xera.ac/api/v1/cohort?venue=LMS+Journal+of+Computation+and+Mathematics"},"results":[{"id":"W1587426425","doi":"10.1112/s1461157015000182","title":"Mordell’s equation: a classical approach","year":2015,"lang":"en","type":"article","venue":"LMS Journal of Computation and Mathematics","topic":"Algebraic Geometry and Number Theory","field":"Mathematics","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 British Columbia","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Diophantine equation; Connection (principal bundle); Diophantine set; Conjunction (astronomy); Logarithm; Thue equation; Algebra over a field","score_opus":0.1280621855336829,"score_gpt":0.3320273904023942,"score_spread":0.2039652048687113,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1587426425","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1362556,0.00012931209,0.85518026,0.00029598828,0.00015826988,0.00009343597,6.5914315e-7,0.000022739061,0.007863754],"genre_scores_gemma":[0.5720169,0.000009228528,0.42732856,0.000074886586,0.0001598717,0.0000013523938,0.0000014185946,0.000015395759,0.00039242837],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987325,0.00008412174,0.00057619624,0.00007824552,0.00041185852,0.00011709032],"domain_scores_gemma":[0.99840206,0.0004854863,0.0005025743,0.0000922419,0.00033346808,0.00018419183],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001268583,0.00011730854,0.00031500575,0.00012464612,0.000047554793,0.000051061834,0.00010876718,0.00006964001,0.00001538782],"category_scores_gemma":[0.0006234827,0.00009077414,0.000071888106,0.00016439444,0.00006847641,0.00017503793,0.000035721467,0.00017825492,0.000009319802],"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.00008400252,0.0009603037,0.00007001028,0.00042015038,0.00016558118,0.000023899058,0.013793762,0.0013732963,0.000048403388,0.96246624,0.012970845,0.007623478],"study_design_scores_gemma":[0.0009789185,0.00015864172,0.000015108517,0.000056111607,0.0000747089,0.0006439501,0.0030620517,0.043242548,0.00007033151,0.95096034,0.00062468543,0.00011260031],"about_ca_topic_score_codex":2.044393e-7,"about_ca_topic_score_gemma":7.81084e-8,"teacher_disagreement_score":0.43576127,"about_ca_system_score_codex":0.000026011436,"about_ca_system_score_gemma":0.0000707036,"threshold_uncertainty_score":0.37016618},"labels":[],"label_agreement":null},{"id":"W1978338522","doi":"10.1112/s1461157012001131","title":"Minimal models for rational functions in a dynamical setting","year":2012,"lang":"en","type":"article","venue":"LMS Journal of Computation and Mathematics","topic":"Advanced Combinatorial Mathematics","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":"Queen's University; Simon Fraser University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Rational function; Minimal models; Elliptic rational functions; Rational number; Conjecture; Quadratic equation; Set (abstract data type); Dynamical systems theory","score_opus":0.05436313380885269,"score_gpt":0.3457396301932299,"score_spread":0.29137649638437724,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1978338522","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.110592395,0.00007896467,0.8880459,0.0001780272,0.00033975713,0.00027156068,0.0000053158237,0.000017846134,0.00047020803],"genre_scores_gemma":[0.48357671,0.0000029351359,0.5161681,0.00001983651,0.00014446335,0.000009303192,0.0000021149388,0.00001948206,0.000057042165],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9984863,0.000043681866,0.00088133465,0.00007627008,0.00028893232,0.0002235114],"domain_scores_gemma":[0.9973552,0.0015548177,0.00062701403,0.00007811977,0.0002700617,0.00011475811],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009616418,0.00014283678,0.0003631257,0.00015501885,0.00008727905,0.000043202213,0.00008455326,0.00007772848,0.0000067294213],"category_scores_gemma":[0.0008086164,0.00012575014,0.00009425931,0.0001291521,0.000037411854,0.0004861302,0.00003139124,0.0001687049,0.0000012378459],"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.000061024115,0.00095786643,0.00009073963,0.00063022424,0.00006789851,0.0000023171349,0.0069338195,0.0057129036,0.0002539958,0.9822752,0.0013308722,0.0016831459],"study_design_scores_gemma":[0.00096387014,0.00008189073,0.000021529242,0.0001292061,0.00005069608,0.0001376516,0.0011232062,0.21597552,0.00003677174,0.78132015,0.00005420122,0.00010532261],"about_ca_topic_score_codex":2.456304e-7,"about_ca_topic_score_gemma":0.0000012227657,"teacher_disagreement_score":0.37298432,"about_ca_system_score_codex":0.00007066989,"about_ca_system_score_gemma":0.000053966694,"threshold_uncertainty_score":0.5127942},"labels":[],"label_agreement":null},{"id":"W2000262354","doi":"10.1112/s146115700000053x","title":"Weak Convergence of the Euler Scheme for Stochastic Differential Delay Equations","year":2008,"lang":"en","type":"article","venue":"LMS Journal of Computation and Mathematics","topic":"Stochastic processes and financial applications","field":"Economics, Econometrics and Finance","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 British Columbia","funders":"Natural Sciences and Engineering Research Council of Canada; Engineering and Physical Sciences Research Council; Deutsche Forschungsgemeinschaft; National Science Foundation","keywords":"Mathematics; Stochastic differential equation; Convergence (economics); Backward Euler method; Malliavin calculus; Delay differential equation; Semi-implicit Euler method; Weak convergence; Stochastic partial differential equation; Ordinary differential equation; Euler method; Brownian motion; Euler's formula; Applied mathematics; Nonlinear system; Mathematical analysis; Differential equation; Euler equations; Computer science","score_opus":0.04977045678450229,"score_gpt":0.25264643582953816,"score_spread":0.20287597904503588,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2000262354","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06038074,0.0002412592,0.93867844,0.00020567335,0.00021635136,0.00014366837,0.000025991607,0.0000030328106,0.0001048117],"genre_scores_gemma":[0.9542677,0.000022431033,0.0455721,0.000022621874,0.000053700223,0.0000076622555,0.0000013569613,0.0000069144726,0.000045529403],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99922746,0.0000019011006,0.0005857585,0.00006478505,0.000047738024,0.00007236026],"domain_scores_gemma":[0.998726,0.00021759588,0.0007819426,0.00006944645,0.00017157328,0.00003340212],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001247402,0.00006203677,0.00021845277,0.00006635657,0.000119597215,0.000010400041,0.00011241239,0.0000331631,0.000012977158],"category_scores_gemma":[0.00027570865,0.000050568455,0.000084478284,0.00011955442,0.00007328021,0.00006600232,0.000021030499,0.00006033025,0.0000031134837],"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.000007677141,0.00011450215,0.00010087622,0.000066532826,0.000030514846,1.0358037e-7,0.0010000727,0.0014196981,0.000101493424,0.9967798,0.00012879213,0.00024992987],"study_design_scores_gemma":[0.0008013521,0.000098523,0.002096261,0.000060629653,0.000028743412,0.000060056795,0.00014158289,0.27841493,0.00007353498,0.71784884,0.00026150027,0.00011405784],"about_ca_topic_score_codex":0.0000020755376,"about_ca_topic_score_gemma":6.632169e-7,"teacher_disagreement_score":0.8938869,"about_ca_system_score_codex":0.0000110258125,"about_ca_system_score_gemma":0.000034293185,"threshold_uncertainty_score":0.20621216},"labels":[],"label_agreement":null},{"id":"W2004622860","doi":"10.1112/s1461157000000474","title":"Polynomials with Restricted Coefficients and Prescribed Noncyclotomic Factors","year":2003,"lang":"en","type":"article","venue":"LMS Journal of Computation and Mathematics","topic":"Advanced Combinatorial Mathematics","field":"Mathematics","cited_by":21,"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; Multiplicity (mathematics); Difference polynomials; Orthogonal polynomials; Unit circle; Discrete orthogonal polynomials; Combinatorics; Discrete mathematics; Mathematical analysis","score_opus":0.030575716906707878,"score_gpt":0.29810880500651743,"score_spread":0.2675330880998096,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2004622860","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7119294,0.00008655809,0.28706366,0.000024546138,0.00015325789,0.00025578603,0.0000020997268,0.000027138853,0.00045759184],"genre_scores_gemma":[0.761096,0.00003625827,0.23871988,0.000014402745,0.000023975714,0.0000019475522,6.4755665e-7,0.0000352527,0.00007166238],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99840367,0.00009436585,0.0007747629,0.00013126746,0.00040079682,0.00019515427],"domain_scores_gemma":[0.99724585,0.0011834702,0.0009527209,0.00014289226,0.00030731762,0.0001677249],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003740433,0.00022782385,0.00054731726,0.00018370192,0.00010566717,0.000082643375,0.00010559266,0.00008139471,0.000007968858],"category_scores_gemma":[0.0010765835,0.00016360192,0.000049836406,0.0002016922,0.00009588041,0.00019379148,0.000028836617,0.00019112165,9.617479e-7],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00022641798,0.0020454067,0.0012618714,0.0019292369,0.00057453645,0.0000858046,0.019997377,0.0012759267,0.004218495,0.9648402,0.0013223221,0.0022224523],"study_design_scores_gemma":[0.004334081,0.0007973995,0.00033084172,0.0006121166,0.00032597966,0.0008681114,0.0027361708,0.0042906506,0.0037593467,0.9810052,0.00047574102,0.00046434684],"about_ca_topic_score_codex":6.072552e-7,"about_ca_topic_score_gemma":6.392794e-7,"teacher_disagreement_score":0.04916662,"about_ca_system_score_codex":0.000039560677,"about_ca_system_score_gemma":0.00007400113,"threshold_uncertainty_score":0.66714925},"labels":[],"label_agreement":null},{"id":"W2026519842","doi":"10.1112/s1461157000001510","title":"On Conjugacy Classes of Congruence Subgroups of PSL(2, <b>R</b>)","year":2009,"lang":"en","type":"article","venue":"LMS Journal of Computation and Mathematics","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":"Concordia University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"PSL; Mathematics; Conjugacy class; Congruence (geometry); Congruence subgroup; Combinatorics; Characteristic subgroup; Group (periodic table); Normal subgroup; Geometry","score_opus":0.05390393949340531,"score_gpt":0.3667830312335449,"score_spread":0.31287909174013956,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2026519842","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.900569,0.00009613906,0.096317455,0.00019194931,0.000067036075,0.00016251624,0.000004807978,0.0000109009425,0.0025801812],"genre_scores_gemma":[0.9291801,0.000049631584,0.070630476,0.00005052056,0.000024460027,4.043918e-7,7.155025e-7,0.000012106128,0.00005160848],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9981751,0.000100982,0.0009581164,0.00008022152,0.00054672797,0.00013885974],"domain_scores_gemma":[0.9958,0.0022610235,0.0010905516,0.00014817045,0.00061298127,0.000087278975],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010516383,0.0001294355,0.00052555196,0.00025768182,0.000033685348,0.000023998655,0.00019059,0.000065288295,0.00004622216],"category_scores_gemma":[0.0011491269,0.00010255907,0.000102310216,0.00019442024,0.00014378397,0.00014252956,0.000022579923,0.00019954471,0.0000023355367],"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.00020679855,0.001023203,0.000080589976,0.0008477804,0.000090928945,0.000018798773,0.0037367165,0.00039784264,0.0074892724,0.97912854,0.0010966508,0.0058828755],"study_design_scores_gemma":[0.0011209283,0.0012995092,0.00046164793,0.00055396487,0.00005532239,0.00013633182,0.0007238238,0.004583908,0.007145517,0.9837944,0.000019980445,0.00010469691],"about_ca_topic_score_codex":5.9410326e-7,"about_ca_topic_score_gemma":3.9288977e-7,"teacher_disagreement_score":0.02861106,"about_ca_system_score_codex":0.000018798786,"about_ca_system_score_gemma":0.00006451416,"threshold_uncertainty_score":0.41822374},"labels":[],"label_agreement":null},{"id":"W2061425254","doi":"10.1112/s1461157000000681","title":"Computing Zeta Functions of Artin–schreier Curves over Finite Fields","year":2002,"lang":"en","type":"article","venue":"LMS Journal of Computation and Mathematics","topic":"Cryptography and Residue Arithmetic","field":"Computer Science","cited_by":30,"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":"Lorentz Center; National Natural Science Foundation of China; Engineering and Physical Sciences Research Council; Division of Mathematical Sciences; National University of Singapore; National Science Foundation","keywords":"Mathematics; Supersingular elliptic curve; Elliptic curve; Finite field; Affine transformation; Edwards curve; Hyperelliptic curve cryptography; Riemann zeta function; Jacobian matrix and determinant; Hyperelliptic curve; Polynomial; Schoof's algorithm; Pure mathematics; Applied mathematics; Mathematical analysis; Discrete mathematics; Quarter period","score_opus":0.02303519082560573,"score_gpt":0.2517827562746768,"score_spread":0.22874756544907104,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2061425254","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05457515,0.001170294,0.9424945,0.0006220164,0.00019713573,0.000051336992,7.094368e-7,0.000014382659,0.0008744834],"genre_scores_gemma":[0.8582369,0.00028151256,0.14122462,0.00014289338,0.00003967451,2.2554815e-7,3.1656768e-7,0.000004233491,0.00006961396],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990738,0.00003659746,0.00048359975,0.00007353719,0.00023713085,0.000095309304],"domain_scores_gemma":[0.9988069,0.00039483223,0.0004530084,0.00010574805,0.00017686335,0.00006267483],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00027806233,0.00007916011,0.00020704218,0.00016664116,0.0000744251,0.000050777067,0.00016346796,0.00003679547,0.00002832125],"category_scores_gemma":[0.00007238182,0.00006297065,0.00009810514,0.00027757493,0.000046289017,0.00021039789,0.000053000364,0.00013484972,0.0000029045475],"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.00004294412,0.0046827598,0.008761255,0.0063064387,0.00140988,0.00019927858,0.06170496,0.151109,0.0018154781,0.21017736,0.07969042,0.47410023],"study_design_scores_gemma":[0.0006912571,0.0002577212,0.0027957435,0.00070759957,0.00006383519,0.00026395117,0.00022344766,0.97104293,0.00019425098,0.02294934,0.00065345946,0.00015643639],"about_ca_topic_score_codex":8.2251967e-7,"about_ca_topic_score_gemma":4.786229e-7,"teacher_disagreement_score":0.81993395,"about_ca_system_score_codex":0.0000034146592,"about_ca_system_score_gemma":0.00001169534,"threshold_uncertainty_score":0.25678685},"labels":[],"label_agreement":null},{"id":"W2069293045","doi":"10.1112/s1461157014000060","title":"A classification of all 1-Salem graphs","year":2014,"lang":"en","type":"preprint","venue":"LMS Journal of Computation and Mathematics","topic":"Graph theory and applications","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Mathematics; Combinatorics; Cyclotomic polynomial; Cyclotomic field; Discrete mathematics; Graph; Polynomial","score_opus":0.07963013401251436,"score_gpt":0.35707462836893633,"score_spread":0.277444494356422,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2069293045","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.56683695,0.00014626303,0.43126795,0.00031021718,0.00017803903,0.000296505,0.0000126234845,0.000025973884,0.0009255033],"genre_scores_gemma":[0.79999566,0.00011587945,0.19972414,0.000033686563,0.000053966476,0.0000075390963,0.000009918619,0.000025193638,0.000033991684],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9979992,0.00012611755,0.0012727254,0.00014061491,0.00034638742,0.0001149453],"domain_scores_gemma":[0.9954443,0.0008836169,0.002775476,0.00026922204,0.00052993343,0.000097455035],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012022654,0.0002086797,0.0006443152,0.00029682255,0.000048374095,0.00004676989,0.0002567248,0.00019262165,0.000011929687],"category_scores_gemma":[0.0002671379,0.00017785946,0.00023602879,0.000115475494,0.00011937331,0.000060578517,0.000098355944,0.0003969649,0.0000021567234],"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.000016937212,0.00038099385,0.000036094774,0.0018284802,0.00021259846,0.0000013023384,0.0027735746,0.0005337662,0.0010041677,0.98922163,0.0013561297,0.0026343465],"study_design_scores_gemma":[0.0003709246,0.00007582497,0.0002093499,0.00053194107,0.00031256367,0.000073949355,0.00038152357,0.014814147,0.0002594897,0.9825259,0.00029542073,0.00014895895],"about_ca_topic_score_codex":6.2031256e-7,"about_ca_topic_score_gemma":8.330588e-7,"teacher_disagreement_score":0.23315875,"about_ca_system_score_codex":0.000016212043,"about_ca_system_score_gemma":0.00006125377,"threshold_uncertainty_score":0.7252898},"labels":[],"label_agreement":null},{"id":"W2073508539","doi":"10.1112/s146115701200112x","title":"Differential equations and expansions for quaternionic modular forms in the discriminant 6 case","year":2012,"lang":"en","type":"article","venue":"LMS Journal of Computation and Mathematics","topic":"Advanced Algebra and Geometry","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":"Concordia University","funders":"","keywords":"Mathematics; Modular form; Modular elliptic curve; Discriminant; Ring (chemistry); Algebra over a field; Modular design; Quaternion algebra; Pure mathematics; Taylor series; Quaternion; Eisenstein series; Modular curve; Differential (mechanical device); Elliptic rational functions; Elliptic curve; Quarter period; Mathematical analysis; Algebra representation; Division algebra; Computer science","score_opus":0.07266096401678705,"score_gpt":0.36574026235383555,"score_spread":0.2930792983370485,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2073508539","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.508324,0.00010754396,0.49126223,0.0001156901,0.00004996229,0.00012633805,0.0000022264055,0.0000027707565,0.000009205268],"genre_scores_gemma":[0.9529242,0.000029780243,0.04691071,0.00003584152,0.000063727945,0.000007862488,0.0000018605471,0.000010048981,0.000015968026],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99919343,0.000035459077,0.00042629984,0.000049997267,0.00014869172,0.00014613497],"domain_scores_gemma":[0.99844277,0.0010689447,0.00028278463,0.00007145606,0.000070261,0.0000637647],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00041858965,0.00009480732,0.00020365196,0.00011426016,0.00012186904,0.00003965717,0.00005381264,0.00003560828,0.0000040805694],"category_scores_gemma":[0.00028877615,0.00005479332,0.000053918495,0.00007983735,0.00003560951,0.00023697985,0.000021358885,0.00010283274,3.9024283e-7],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004179242,0.0013140029,0.00038502313,0.0009447652,0.0000978041,0.000059218684,0.0582685,0.0005931178,0.0006585599,0.922899,0.0002455598,0.014492655],"study_design_scores_gemma":[0.0012252491,0.00015710603,0.000546525,0.00014505982,0.00015859374,0.002752353,0.010982349,0.04343276,0.00010710145,0.9403054,0.000047146346,0.00014035341],"about_ca_topic_score_codex":6.85791e-7,"about_ca_topic_score_gemma":0.000007003298,"teacher_disagreement_score":0.44460016,"about_ca_system_score_codex":0.000011042473,"about_ca_system_score_gemma":0.000010686577,"threshold_uncertainty_score":0.22344066},"labels":[],"label_agreement":null},{"id":"W2080886024","doi":"10.1112/s1461157009000187","title":"The Mordell–Weil sieve: proving non-existence of rational points on curves","year":2010,"lang":"en","type":"article","venue":"LMS Journal of Computation and Mathematics","topic":"Cryptography and Residue Arithmetic","field":"Computer Science","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":"Sieve (category theory); Rational point; Algebra over a field; Genus; Rational number; Simple (philosophy)","score_opus":0.008561974885662713,"score_gpt":0.2542585128835853,"score_spread":0.2456965379979226,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2080886024","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.171459,0.00019487584,0.82537544,0.0018472394,0.00040993726,0.00011925155,6.7998343e-7,0.000009037641,0.00058451237],"genre_scores_gemma":[0.7587404,0.0001573175,0.24085914,0.0001582385,0.000051299205,9.98952e-7,2.899142e-7,0.0000043123355,0.00002799262],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99909586,0.000027355702,0.00038965428,0.00006741833,0.00033730167,0.00008241965],"domain_scores_gemma":[0.9985656,0.00051790784,0.00046366462,0.00011891444,0.00028314508,0.000050766765],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006340114,0.00007043234,0.00013660517,0.000081929866,0.00011194071,0.00008332545,0.0002870049,0.000026517782,0.0000019354754],"category_scores_gemma":[0.00013872478,0.000043450662,0.000062141065,0.00016441572,0.00009259119,0.0001797487,0.00004301908,0.00018263777,0.0000012020096],"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.000056542176,0.0008816512,0.00044287747,0.0009660524,0.0001687932,0.000026484606,0.007983275,0.0030909681,0.009862925,0.8721175,0.003066116,0.101336814],"study_design_scores_gemma":[0.001409183,0.0007639309,0.010838618,0.0012331016,0.000056210796,0.00066766154,0.0004986203,0.4391126,0.006706796,0.53757745,0.000821651,0.00031417733],"about_ca_topic_score_codex":6.853135e-7,"about_ca_topic_score_gemma":0.000001968754,"teacher_disagreement_score":0.5872814,"about_ca_system_score_codex":0.000003022244,"about_ca_system_score_gemma":0.0000665221,"threshold_uncertainty_score":0.17718665},"labels":[],"label_agreement":null},{"id":"W2091712624","doi":"10.1112/s1461157014000345","title":"Subexponential class group and unit group computation in large degree number fields","year":2014,"lang":"en","type":"article","venue":"LMS Journal of Computation and Mathematics","topic":"Algebraic Geometry and Number Theory","field":"Mathematics","cited_by":42,"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; Ideal class group; Degree (music); Algebraic number field; Group (periodic table); Class (philosophy); Infinity; Unit (ring theory); Smoothness; Computation; Ideal (ethics); Combinatorics; Discrete mathematics; Mathematical analysis; Algorithm","score_opus":0.035519275688113416,"score_gpt":0.3019933288956249,"score_spread":0.2664740532075115,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2091712624","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5313087,0.000028897366,0.46767882,0.00008709823,0.00011131222,0.00007353289,9.437225e-7,0.0000117647205,0.0006989459],"genre_scores_gemma":[0.914451,0.000027226963,0.0852473,0.00010940885,0.000095869145,0.0000013759073,0.0000045108004,0.000018029597,0.0000452575],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985307,0.00017832866,0.0007057677,0.00011836633,0.00028218015,0.00018466667],"domain_scores_gemma":[0.9981109,0.0010821456,0.000511916,0.00008017779,0.00010848437,0.000106382024],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015072282,0.00016114955,0.00039634647,0.0001751424,0.00008770875,0.000068598085,0.000090491994,0.00012287432,0.000040883424],"category_scores_gemma":[0.00025578195,0.0001412958,0.00006306565,0.00017686374,0.000059876176,0.00022652179,0.000054998767,0.0002737847,0.0000054154366],"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.00023759675,0.0014585567,0.0076879114,0.0015906959,0.00020084056,0.000049641836,0.011498402,0.00047862605,0.00033197683,0.9444931,0.0012005798,0.030772043],"study_design_scores_gemma":[0.0025764972,0.00024065113,0.0045554363,0.0002577455,0.00008041668,0.0004433955,0.0013192849,0.05225588,0.000039646995,0.9377391,0.0002780842,0.00021390447],"about_ca_topic_score_codex":0.000002131586,"about_ca_topic_score_gemma":0.000014818637,"teacher_disagreement_score":0.38314232,"about_ca_system_score_codex":0.0000151991035,"about_ca_system_score_gemma":0.000011709963,"threshold_uncertainty_score":0.57618755},"labels":[],"label_agreement":null},{"id":"W2095679220","doi":"10.1112/s1461157013000119","title":"Modular subgroups, <i>dessins d’enfants</i> and elliptic K3 surfaces","year":2013,"lang":"en","type":"article","venue":"LMS Journal of Computation and Mathematics","topic":"Algebraic Geometry and Number Theory","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":"Concordia University","funders":"Natural Sciences and Engineering Research Council of Canada; Nankai University; Science and Technology Facilities Council; National Science Foundation","keywords":"Mathematics; Conjugacy class; Pure mathematics; Torsion (gastropod); Genus; Modular design; Class (philosophy); Combinatorics; Botany","score_opus":0.02017158603956679,"score_gpt":0.2726007046031265,"score_spread":0.2524291185635597,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2095679220","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8839979,0.00050167035,0.114308216,0.00022687936,0.00012240608,0.00015080268,0.0000013187099,0.000021615026,0.0006691469],"genre_scores_gemma":[0.89840347,0.00013400357,0.101070136,0.00008546939,0.00005946599,0.0000016516924,8.416486e-7,0.000020586464,0.00022436607],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987557,0.00007318709,0.00061681634,0.00010400189,0.0002843777,0.00016589407],"domain_scores_gemma":[0.998281,0.00070735195,0.00054262666,0.000105934,0.00021606508,0.00014702984],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006714889,0.00016460204,0.0003957305,0.00012125691,0.00010588465,0.00013144332,0.00010522167,0.00007614864,0.000084726635],"category_scores_gemma":[0.00020042408,0.00012701565,0.0000623123,0.00013064827,0.00010636096,0.0003544308,0.000044194177,0.00017984265,0.000015051741],"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.00014709512,0.0029764648,0.004170709,0.006896577,0.0014600697,0.00013893409,0.05348684,0.0021363501,0.022916151,0.8194159,0.012063976,0.074190885],"study_design_scores_gemma":[0.00074132,0.00013422017,0.001153673,0.00021390626,0.000110430265,0.00046786506,0.002306559,0.018817374,0.00059484504,0.97507066,0.000192446,0.00019669432],"about_ca_topic_score_codex":0.0000017423594,"about_ca_topic_score_gemma":4.6659773e-7,"teacher_disagreement_score":0.15565471,"about_ca_system_score_codex":0.000011821911,"about_ca_system_score_gemma":0.00002099316,"threshold_uncertainty_score":0.51795477},"labels":[],"label_agreement":null},{"id":"W2096962143","doi":"10.1112/s1461157014000102","title":"Gelfand–Kirillov dimension of differential difference algebras","year":2014,"lang":"en","type":"article","venue":"LMS Journal of Computation and Mathematics","topic":"Polynomial and algebraic computation","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 Manitoba","funders":"","keywords":"Mathematics; Dimension (graph theory); Upper and lower bounds; Differential (mechanical device); Pure mathematics; Algebraic differential equation; Differential equation; Algebra over a field; Mathematical analysis; Ordinary differential equation; Differential algebraic equation","score_opus":0.011976862523112135,"score_gpt":0.23818823562155253,"score_spread":0.2262113730984404,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2096962143","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.43085527,0.000037153117,0.5686162,0.00015020021,0.0002044198,0.000034179666,2.5759454e-7,0.000011108703,0.000091161506],"genre_scores_gemma":[0.90339863,0.000017638871,0.0964292,0.00005896644,0.00006569619,3.398104e-7,6.993121e-7,0.0000051017023,0.000023745131],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99883723,0.000064092455,0.0005664496,0.00010521749,0.00031517545,0.00011185269],"domain_scores_gemma":[0.99866027,0.00029256832,0.0006372848,0.00011143829,0.00020266333,0.00009578266],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00027509397,0.00011359398,0.0003093016,0.00014642996,0.000057617814,0.00006919221,0.00023782245,0.000040609113,0.000004422132],"category_scores_gemma":[0.000077983525,0.00008607534,0.00007668665,0.00012911182,0.000048922557,0.00019861393,0.000099615885,0.00009579407,0.0000023129437],"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.000043689288,0.00064273423,0.0004337806,0.0004245015,0.00012463923,0.000008352115,0.007981477,0.0027429939,0.031079264,0.43121263,0.0005189276,0.524787],"study_design_scores_gemma":[0.0012491519,0.00049131,0.009051076,0.00022311666,0.000041150768,0.000172719,0.000062209954,0.72434896,0.0047656833,0.2592788,0.00012111334,0.00019470051],"about_ca_topic_score_codex":0.0000015566388,"about_ca_topic_score_gemma":4.7020256e-7,"teacher_disagreement_score":0.72160596,"about_ca_system_score_codex":0.000009783187,"about_ca_system_score_gemma":0.00003084351,"threshold_uncertainty_score":0.35100505},"labels":[],"label_agreement":null},{"id":"W2100013676","doi":"10.1112/s1461157014000357","title":"Tracking -adic precision","year":2014,"lang":"en","type":"article","venue":"LMS Journal of Computation and Mathematics","topic":"advanced mathematical theories","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 Calgary","funders":"Agence Nationale de la Recherche","keywords":"Ultrametric space; Computation; Mathematics; Sequence (biology); Tracking (education); Algorithm; Mathematical optimization; Pure mathematics","score_opus":0.04796235483469106,"score_gpt":0.3561276299762835,"score_spread":0.3081652751415924,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2100013676","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11859013,0.000072466995,0.87847465,0.0001323451,0.00014293163,0.00011002222,5.516965e-7,0.000035483386,0.0024414056],"genre_scores_gemma":[0.4540576,0.0000209459,0.54566664,0.000043843913,0.000095703115,0.0000010098706,2.774331e-7,0.000022506041,0.00009149957],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.998451,0.00008211624,0.0008227571,0.00009513072,0.0003957941,0.00015319772],"domain_scores_gemma":[0.99620473,0.0025010193,0.00074444915,0.00013234389,0.00029726428,0.00012015984],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012921821,0.00015350539,0.00045777223,0.0001331378,0.00008397509,0.000070018046,0.00013702887,0.00006467585,0.000026617956],"category_scores_gemma":[0.0026717712,0.000115287585,0.00009496697,0.00012147506,0.00008410765,0.0002629636,0.00004159003,0.00018424641,0.000007851551],"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.000023210025,0.00023236098,0.00001402918,0.00054924586,0.00004763274,0.000005479622,0.0033943006,0.00033517933,0.00070024864,0.9418013,0.0004996444,0.052397363],"study_design_scores_gemma":[0.0005516427,0.00016001325,0.000023181794,0.00035420756,0.00006238289,0.0002931022,0.00041649473,0.013464282,0.0008839485,0.983091,0.00057747186,0.00012227368],"about_ca_topic_score_codex":7.299012e-8,"about_ca_topic_score_gemma":2.3237516e-7,"teacher_disagreement_score":0.33546746,"about_ca_system_score_codex":0.000020816471,"about_ca_system_score_gemma":0.000018036913,"threshold_uncertainty_score":0.4701291},"labels":[],"label_agreement":null},{"id":"W2113016580","doi":"10.1112/s1461157014000400","title":"Computing symmetry groups of polyhedra","year":2014,"lang":"en","type":"article","venue":"LMS Journal of Computation and Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":39,"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 New Brunswick","funders":"Ministry of Education, India; Hausdorff Research Institute for Mathematics; Mathematisches Forschungsinstitut Oberwolfach; University of Cambridge; Alexander von Humboldt-Stiftung","keywords":"Polyhedron; Mathematics; Integer points in convex polyhedra; Symmetry group; Computation; Symmetry (geometry); Automorphism group; Homogeneous space; Linear programming; Polyhedral combinatorics; Group (periodic table); Integer programming; Combinatorics; Tetrahedral symmetry; Discrete mathematics; Automorphism; Algorithm; Regular polygon; Rotational symmetry; Geometry; Branch and price; Convex set","score_opus":0.018218650123161532,"score_gpt":0.30468759706289866,"score_spread":0.2864689469397371,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2113016580","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15266912,0.00009412313,0.8464343,0.00012925494,0.00010353401,0.000040579587,1.9126756e-7,0.000012652612,0.00051623647],"genre_scores_gemma":[0.62715554,0.000008669594,0.37276015,0.000036586298,0.000027089405,7.7183316e-8,1.0658129e-7,0.000004158466,0.000007638826],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988499,0.0000918517,0.00050565414,0.000080666454,0.00034790763,0.00012399351],"domain_scores_gemma":[0.99828196,0.00065895705,0.00056388194,0.00012940196,0.00027841298,0.00008738412],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010592127,0.00007952036,0.00025296473,0.00022990379,0.00005667187,0.00005610191,0.00033239002,0.000029632065,0.000001910806],"category_scores_gemma":[0.00019606871,0.00006469521,0.0000610869,0.00027156423,0.000069777416,0.00026517172,0.000112361544,0.0001395228,0.0000018011317],"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.000007604665,0.00011850162,0.00018915124,0.00019150638,0.000033881952,0.000004611278,0.0022936077,0.0027775704,0.0014231909,0.9002895,0.00006518604,0.092605695],"study_design_scores_gemma":[0.0004996715,0.00023574327,0.00047378734,0.00013826787,0.000008579921,0.00025435138,0.00018684956,0.43195316,0.0013307498,0.5647659,0.00006884064,0.00008412177],"about_ca_topic_score_codex":3.0750584e-7,"about_ca_topic_score_gemma":1.0514973e-7,"teacher_disagreement_score":0.4744864,"about_ca_system_score_codex":0.000009028795,"about_ca_system_score_gemma":0.000023458899,"threshold_uncertainty_score":0.2638194},"labels":[],"label_agreement":null},{"id":"W2116964543","doi":"10.1112/s1461157013000211","title":"Computing characters of groups with central subgroups","year":2013,"lang":"en","type":"article","venue":"LMS Journal of Computation and Mathematics","topic":"Finite Group 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":"Carleton University; Simon Fraser University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Conjugacy class; Character (mathematics); Lambda; Generalization; Computation; Combinatorics; Group (periodic table); Character table; Set (abstract data type); Algebra over a field; Pure mathematics; Algorithm; Computer science; Mathematical analysis; Geometry","score_opus":0.03579409194877574,"score_gpt":0.30116310792725576,"score_spread":0.26536901597848,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2116964543","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7488186,0.000027487204,0.25052717,0.000105351864,0.00006278015,0.00018657716,9.911956e-7,0.000012406019,0.00025866687],"genre_scores_gemma":[0.8166677,0.000012768459,0.18319134,0.00002590116,0.000053895263,8.741816e-7,0.000001111002,0.000021509952,0.000024909887],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99837905,0.0000895903,0.0007423916,0.00008622214,0.00047153558,0.00023121283],"domain_scores_gemma":[0.9973767,0.0010057547,0.0008752304,0.0001121923,0.0004888336,0.00014133175],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00069318817,0.00014300838,0.00044671947,0.00020343615,0.000056719313,0.0000686237,0.0001613274,0.000052029383,0.000039940434],"category_scores_gemma":[0.0002009007,0.000102355865,0.00007232286,0.00018616332,0.00012816384,0.0002639368,0.000045054712,0.00022705377,0.000004179401],"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.0005567031,0.0037221822,0.01615497,0.010396075,0.0016077503,0.00014756597,0.08455195,0.0022121277,0.016223906,0.79569167,0.0033896682,0.06534544],"study_design_scores_gemma":[0.0034910266,0.0012856688,0.01587086,0.0015062973,0.0001883286,0.0012899573,0.0075533306,0.082157135,0.002110184,0.8840702,0.00003082243,0.00044617924],"about_ca_topic_score_codex":0.0000020079226,"about_ca_topic_score_gemma":6.280052e-7,"teacher_disagreement_score":0.08837854,"about_ca_system_score_codex":0.000026078085,"about_ca_system_score_gemma":0.000044193202,"threshold_uncertainty_score":0.4173951},"labels":[],"label_agreement":null},{"id":"W2130884535","doi":"10.1112/s1461157014000436","title":"Squarefree values of trinomial discriminants","year":2015,"lang":"en","type":"article","venue":"LMS Journal of Computation and Mathematics","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 Lethbridge; University of British Columbia","funders":"","keywords":"Trinomial; Square-free integer; Discriminant; Generalization; Square (algebra); Set (abstract data type)","score_opus":0.16366798893769197,"score_gpt":0.40749308855497285,"score_spread":0.24382509961728088,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2130884535","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7259119,0.000093350536,0.27099204,0.00012543975,0.00012281742,0.00011269678,0.0000024789456,0.00000941091,0.0026298286],"genre_scores_gemma":[0.88197273,0.000015434682,0.117592886,0.000009238906,0.00007798134,5.3313227e-7,4.979413e-7,0.000015635576,0.0003150476],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99844265,0.000096774675,0.00073169626,0.000064716274,0.000538971,0.00012519056],"domain_scores_gemma":[0.99787074,0.0006382274,0.0006640135,0.000114530194,0.0005530869,0.0001594106],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015209967,0.00010302442,0.000417718,0.00015941741,0.000029850853,0.000029001763,0.0001603887,0.000047055124,0.000016158401],"category_scores_gemma":[0.0009302492,0.00007599499,0.00008632283,0.000114832874,0.000114791554,0.0001407128,0.00005692617,0.0001297507,0.000004364284],"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.0008838206,0.0033425859,0.0022512653,0.0037066995,0.00094745506,0.00020399987,0.07914463,0.0011263846,0.0014341358,0.8393482,0.032063026,0.035547793],"study_design_scores_gemma":[0.0015079372,0.0003274096,0.00010790822,0.00019755789,0.0001183262,0.00033429323,0.0047181514,0.00868093,0.0007666192,0.9830752,0.00007042228,0.00009526457],"about_ca_topic_score_codex":0.0000017110303,"about_ca_topic_score_gemma":8.27606e-7,"teacher_disagreement_score":0.15606081,"about_ca_system_score_codex":0.000030286603,"about_ca_system_score_gemma":0.00010848292,"threshold_uncertainty_score":0.30989859},"labels":[],"label_agreement":null},{"id":"W2131716547","doi":"10.1112/s1461157000000024","title":"Primitive Divisors on Twists of Fermat's Cubic","year":2009,"lang":"en","type":"article","venue":"LMS Journal of Computation and Mathematics","topic":"Algebraic Geometry and Number Theory","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 Toronto","funders":"Engineering and Physical Sciences Research Council; Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Divisibility rule; Divisor (algebraic geometry); Fermat number; Combinatorics; Fermat's Last Theorem; Twist; Exact sequence; Cube root; Pure mathematics; Cubic form; Sequence (biology); Cube (algebra); Geometry","score_opus":0.03310747367257049,"score_gpt":0.3204942464277385,"score_spread":0.287386772755168,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2131716547","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8945562,0.00007271543,0.101104796,0.00023096368,0.00009448977,0.00010710104,0.000001711828,0.000014758235,0.003817239],"genre_scores_gemma":[0.95810276,0.000027115262,0.04158145,0.00013090612,0.000046755522,3.2876645e-7,6.998975e-7,0.000009906351,0.00010005846],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987639,0.00006556321,0.0006542257,0.000070473114,0.0003312763,0.00011451348],"domain_scores_gemma":[0.99807394,0.00072849623,0.0008048634,0.00009604663,0.00021507771,0.00008159913],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005966992,0.00013034753,0.00039599923,0.00018275772,0.0000379413,0.000021872975,0.00010835474,0.000058168036,0.000026331494],"category_scores_gemma":[0.0003509982,0.000101937476,0.00010437285,0.00014645279,0.0000566806,0.0001214896,0.000015399959,0.00016301191,0.0000053044964],"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.00018296416,0.0017892396,0.000056512126,0.0007167226,0.00022311741,0.00004014464,0.019926675,0.00048491397,0.0017621991,0.9455741,0.002250879,0.026992524],"study_design_scores_gemma":[0.0008256883,0.0005970634,0.0010373117,0.0004088426,0.00008418147,0.00021867422,0.0010195341,0.0010354627,0.0040964303,0.9904805,0.00007158157,0.00012477278],"about_ca_topic_score_codex":1.1980381e-7,"about_ca_topic_score_gemma":6.343916e-8,"teacher_disagreement_score":0.06354656,"about_ca_system_score_codex":0.000016762833,"about_ca_system_score_gemma":0.000026097134,"threshold_uncertainty_score":0.41568896},"labels":[],"label_agreement":null},{"id":"W2131884894","doi":"10.1112/s1461157012001155","title":"Ternary quadratic forms and half-integral weight modular forms","year":2012,"lang":"en","type":"preprint","venue":"LMS Journal of Computation and Mathematics","topic":"Advanced Algebra and Geometry","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 British Columbia","funders":"","keywords":"Mathematics; Integer (computer science); Modular form; Ternary operation; Subspace topology; Basis (linear algebra); Combinatorics; Quadratic equation; Modular design; Linear subspace; Space (punctuation); Pure mathematics; Discrete mathematics; Mathematical analysis; Geometry; Computer science","score_opus":0.0325693674990986,"score_gpt":0.31984100238518826,"score_spread":0.28727163488608964,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2131884894","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.47827527,0.0012965533,0.519173,0.00019501128,0.00033486236,0.00024571913,0.000007973751,0.000029033892,0.00044259138],"genre_scores_gemma":[0.7066675,0.0004250041,0.29235175,0.000068634065,0.00025557107,0.0000057023194,0.000009647052,0.000056680416,0.00015949253],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9977193,0.00004717731,0.001233798,0.00019313915,0.00050650147,0.0003000921],"domain_scores_gemma":[0.9970763,0.00048917014,0.0016651147,0.00023481718,0.0002760737,0.00025856486],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0007032813,0.00040905492,0.00094486104,0.0003283474,0.00010991269,0.00013870225,0.00022020933,0.00027258522,0.000024236824],"category_scores_gemma":[0.00023609457,0.00028511515,0.00021389486,0.0001031409,0.00010497555,0.00040019274,0.00028326764,0.00077062275,0.0000043927566],"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.00018754318,0.0022033001,0.001182166,0.018972715,0.0019053167,0.00020802833,0.027421154,0.0027253327,0.00059030735,0.8645497,0.0018827497,0.07817166],"study_design_scores_gemma":[0.00073951256,0.0001212897,0.00017095254,0.0009906776,0.0002948181,0.00083296024,0.0008259026,0.02194644,0.00018942903,0.97337854,0.00017363069,0.00033586094],"about_ca_topic_score_codex":6.6156093e-7,"about_ca_topic_score_gemma":0.0000023421974,"teacher_disagreement_score":0.22839224,"about_ca_system_score_codex":0.000053762225,"about_ca_system_score_gemma":0.00006481226,"threshold_uncertainty_score":0.9999601},"labels":[],"label_agreement":null},{"id":"W2134357435","doi":"10.1112/s1461157008000041","title":"Fundamental domains for genus-zero and genus-one congruence subgroups","year":2010,"lang":"en","type":"article","venue":"LMS Journal of Computation and Mathematics","topic":"Finite Group Theory Research","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":"Concordia University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Congruence subgroup; Congruence (geometry); Partition (number theory); Combinatorics; Modular group; Group (periodic table); Genus; Zero (linguistics); Discrete mathematics; Finite group; Pure mathematics; Geometry","score_opus":0.05968769515826256,"score_gpt":0.3527785759190518,"score_spread":0.29309088076078926,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2134357435","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7366232,0.00007249475,0.26243782,0.0001787134,0.00015728695,0.0002825973,0.000010914201,0.000014677604,0.00022227906],"genre_scores_gemma":[0.6803695,0.000035365654,0.31931558,0.000049754446,0.000096305244,0.000005190447,0.0000020990137,0.000025165495,0.00010106192],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99863905,0.000049649392,0.00060570746,0.00012315335,0.00036471113,0.00021770588],"domain_scores_gemma":[0.99723166,0.0016407938,0.00048047467,0.00012642924,0.00033994415,0.00018072526],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013698483,0.00015113663,0.00036980398,0.00016463874,0.00015041546,0.0001385997,0.00015175475,0.000092542505,0.00003127277],"category_scores_gemma":[0.0006318012,0.0001302536,0.0000762453,0.00009591091,0.00020230915,0.00020543022,0.000064105836,0.0003148208,0.0000034787029],"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.0003047014,0.0011089917,0.00079425913,0.0024087084,0.00038050208,0.00004158213,0.012863069,0.000036949597,0.04781594,0.9064668,0.0023229686,0.025455544],"study_design_scores_gemma":[0.0022290768,0.00045528443,0.00036290436,0.00013962519,0.000112199916,0.00083432207,0.0008591684,0.010407473,0.0014369844,0.9820034,0.0009445354,0.00021502438],"about_ca_topic_score_codex":8.6383244e-7,"about_ca_topic_score_gemma":0.000006839199,"teacher_disagreement_score":0.07553662,"about_ca_system_score_codex":0.000020304882,"about_ca_system_score_gemma":0.000050707673,"threshold_uncertainty_score":0.5311588},"labels":[],"label_agreement":null},{"id":"W2142061932","doi":"10.1112/s1461157013000223","title":"Wieferich pairs and Barker sequences, II","year":2014,"lang":"en","type":"article","venue":"LMS Journal of Computation and Mathematics","topic":"Coding theory and cryptography","field":"Computer Science","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":"Simon Fraser University","funders":"Natural Sciences and Engineering Research Council of Canada; Mitacs; Simon Fraser University; Western Canada Research Grid; Compute Canada; Simons Foundation","keywords":"Circulant matrix; Sequence (biology); Prime (order theory); Hadamard transform; Computation; Matrix (chemical analysis); Hadamard matrix; Multiple","score_opus":0.011219062029175237,"score_gpt":0.23235483853112363,"score_spread":0.22113577650194838,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2142061932","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1648186,0.000111512054,0.83368635,0.00046804568,0.00010351103,0.000027082488,1.1983944e-7,0.000017199389,0.0007675959],"genre_scores_gemma":[0.7524374,0.000047757978,0.24727646,0.00018935109,0.000028842867,2.9467182e-7,9.979146e-8,0.0000028586626,0.000016933045],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993932,0.000055722816,0.0002481447,0.00007211613,0.00015304182,0.00007774948],"domain_scores_gemma":[0.99933875,0.00019881241,0.0002152053,0.00007403021,0.00009678224,0.000076416894],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007029302,0.00006977112,0.00014623714,0.00009880743,0.000116306,0.000101712045,0.00014484642,0.000024776371,0.0000034425052],"category_scores_gemma":[0.00005158534,0.00005398293,0.000034744415,0.00013243993,0.000049770017,0.00025209304,0.00006682905,0.00007910599,8.7263413e-7],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008386671,0.000101919795,0.00024338829,0.00010850329,0.000043445823,0.0000063946823,0.006328474,0.00049675634,0.00046439277,0.8586594,0.00073470036,0.13280427],"study_design_scores_gemma":[0.00047673733,0.00041411608,0.0008306442,0.000118783995,0.000021506421,0.00046468747,0.0001916926,0.18360373,0.00013473362,0.8108046,0.0028043662,0.00013441367],"about_ca_topic_score_codex":3.0634922e-7,"about_ca_topic_score_gemma":2.689359e-7,"teacher_disagreement_score":0.5876188,"about_ca_system_score_codex":0.000003611332,"about_ca_system_score_gemma":0.000013993206,"threshold_uncertainty_score":0.220136},"labels":[],"label_agreement":null},{"id":"W2166790954","doi":"10.1112/s1461157008000430","title":"A lower bound for Garsia’s entropy for certain Bernoulli convolutions","year":2010,"lang":"en","type":"article","venue":"LMS Journal of Computation and Mathematics","topic":"Statistical Mechanics and Entropy","field":"Physics and Astronomy","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; University of Cambridge","keywords":"Upper and lower bounds; Bernoulli's principle; Entropy (arrow of time); Convolution (computer science); Binary entropy function","score_opus":0.016416230858977848,"score_gpt":0.29387364590036386,"score_spread":0.277457415041386,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2166790954","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.057076566,0.000012463837,0.9416639,0.00037225173,0.0004551062,0.00020347575,0.00005381325,0.0000039243273,0.00015848917],"genre_scores_gemma":[0.70944506,0.0000019572446,0.29007336,0.000041618998,0.00028155473,0.000010154918,0.000011377348,0.000012016526,0.0001229285],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99942005,0.0000063033476,0.0003035056,0.000059825714,0.00008885231,0.000121490986],"domain_scores_gemma":[0.99900514,0.0003686274,0.00024122384,0.000044986064,0.00025204092,0.000087996836],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00016368013,0.00007819817,0.00017690705,0.00003977994,0.00009782712,0.00006703948,0.00005358614,0.000026375927,0.00006198589],"category_scores_gemma":[0.000054269796,0.00006445236,0.0000949435,0.000028139406,0.000027244876,0.000052807372,0.0000088110055,0.00009398599,0.0000016100623],"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.000024103083,0.00015399957,0.000027829912,0.000040544754,0.000056438334,3.130372e-7,0.00024170727,0.000074993746,0.0011526663,0.99093723,0.0024737658,0.004816394],"study_design_scores_gemma":[0.0012224452,0.00020971158,0.000029257857,0.00002639975,0.00008605748,0.00000960139,0.00026602866,0.25328094,0.00020130698,0.73673826,0.007844567,0.00008543077],"about_ca_topic_score_codex":0.0000015601205,"about_ca_topic_score_gemma":4.7818673e-7,"teacher_disagreement_score":0.6523685,"about_ca_system_score_codex":0.0000057967304,"about_ca_system_score_gemma":0.000039583898,"threshold_uncertainty_score":0.2628291},"labels":[],"label_agreement":null},{"id":"W2274950681","doi":"10.1112/s146115701200006x","title":"On the equations <i>a</i><sup>2</sup>−2<i>b</i><sup>6</sup>=<i>c</i><sup><i>p</i></sup> and <i>a</i><sup>2</sup>−2=<i>c</i><sup><i>p</i></sup>","year":2012,"lang":"en","type":"article","venue":"LMS Journal of Computation and Mathematics","topic":"Algebraic Geometry and Number Theory","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":"Simon Fraser University","funders":"Natural Sciences and Engineering Research Council of Canada; University of Cambridge","keywords":"Mathematics; Congruence (geometry); Combinatorics; Prime (order theory); Physics; Geometry","score_opus":0.03270121673546457,"score_gpt":0.28089756284309275,"score_spread":0.2481963461076282,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2274950681","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8337555,0.0035137963,0.14512199,0.004074232,0.00074863405,0.0034308531,0.00047836028,0.000698341,0.008178301],"genre_scores_gemma":[0.94894034,0.0012990019,0.038300075,0.0051944833,0.0025664573,0.00020243453,0.00021652182,0.0007055077,0.0025751898],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9829672,0.0021749258,0.005884882,0.0017311875,0.0040461225,0.003195677],"domain_scores_gemma":[0.9762473,0.013684552,0.0037556747,0.0023728285,0.0017709505,0.0021686663],"candidate_categories":["metaepi_narrow","sts","scholarly_communication","research_integrity","insufficient_payload"],"consensus_categories":["metaepi_narrow","research_integrity"],"category_scores_codex":[0.009029267,0.0028653704,0.0038242098,0.0016326283,0.0024161178,0.0013549124,0.002298581,0.001396318,0.0011104422],"category_scores_gemma":[0.0045639183,0.0023526533,0.0015348862,0.0024673657,0.0014331958,0.0028851058,0.0010442763,0.003805957,0.0006910942],"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.0016245614,0.010055513,0.0014066375,0.0050810096,0.004794671,0.00040734434,0.18521614,0.3558892,0.0004342518,0.3072679,0.1134346,0.014388153],"study_design_scores_gemma":[0.01117985,0.0019765946,0.000075204916,0.0032051024,0.0032035657,0.0041986504,0.0450312,0.4897782,0.0015514019,0.41209307,0.023419268,0.004287901],"about_ca_topic_score_codex":0.00003876028,"about_ca_topic_score_gemma":0.000005412948,"teacher_disagreement_score":0.14018494,"about_ca_system_score_codex":0.00048036597,"about_ca_system_score_gemma":0.0006831041,"threshold_uncertainty_score":0.9999001},"labels":[],"label_agreement":null},{"id":"W2290398384","doi":"10.1112/s146115701600036x","title":"Explicit isogenies in quadratic time in any characteristic","year":2016,"lang":"en","type":"article","venue":"LMS Journal of Computation and Mathematics","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":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computation; Base (topology); Class (philosophy); Prime (order theory); Quadratic equation; Elliptic curve; Finite field","score_opus":0.023783254321220068,"score_gpt":0.2872271787819445,"score_spread":0.2634439244607244,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2290398384","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.93271506,0.000071990864,0.06638798,0.00032575038,0.000067088506,0.00010488236,0.0000015581586,0.000010300314,0.0003153971],"genre_scores_gemma":[0.98111707,0.000041949377,0.018430078,0.000045784684,0.000043150725,0.0000022295728,3.723881e-7,0.000014862602,0.00030449562],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99870974,0.000087313536,0.0007749319,0.00008190351,0.00019509124,0.00015100917],"domain_scores_gemma":[0.9981242,0.0011941163,0.00045611145,0.00008487028,0.00007749394,0.000063218926],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009112259,0.00012253317,0.00039137094,0.00029622472,0.000022868328,0.000024844037,0.000098960816,0.00005897582,0.000097103],"category_scores_gemma":[0.00057295704,0.00008202039,0.00005042142,0.00017908675,0.00003957366,0.00021124272,0.000026725664,0.00010936314,0.000025463169],"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.00086814427,0.0058185216,0.014336567,0.0048858714,0.00055381196,0.00085800135,0.09899072,0.00021290587,0.07310167,0.7144358,0.0033508595,0.08258711],"study_design_scores_gemma":[0.0015015042,0.00014288184,0.0034660406,0.0009201217,0.00002945627,0.00030707632,0.0008086336,0.0018199818,0.0006770582,0.9901092,0.000046147823,0.00017186593],"about_ca_topic_score_codex":5.20591e-7,"about_ca_topic_score_gemma":0.0000019716922,"teacher_disagreement_score":0.27567342,"about_ca_system_score_codex":0.000036513746,"about_ca_system_score_gemma":0.00002986827,"threshold_uncertainty_score":0.33446947},"labels":[],"label_agreement":null},{"id":"W2297956301","doi":"10.1112/s1461157000001455","title":"The Brauer-Manin Obstruction and III[2]","year":2007,"lang":"en","type":"article","venue":"LMS Journal of Computation and Mathematics","topic":"Algebraic Geometry and Number Theory","field":"Mathematics","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; Simon Fraser University","funders":"Engineering and Physical Sciences Research Council; Natural Sciences and Engineering Research Council of Canada; Nuffield Foundation","keywords":"Mathematics; Brauer group; Computation; Quadratic equation; Quintic function; Pure mathematics; Magma; Locus (genetics); Genus; Combinatorics; Algebra over a field; Geometry; Algorithm","score_opus":0.021736082370225323,"score_gpt":0.29954418275849093,"score_spread":0.2778081003882656,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2297956301","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6621849,0.00030102537,0.33585984,0.00018451075,0.00021327428,0.000071679075,2.531049e-7,0.000012448703,0.0011720977],"genre_scores_gemma":[0.9347692,0.0001234478,0.06463265,0.000051583123,0.0001290756,3.6106974e-7,2.7340545e-7,0.0000123549735,0.00028106332],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990109,0.000036502548,0.0005410523,0.000058746125,0.00022636553,0.00012640806],"domain_scores_gemma":[0.9975976,0.0015852604,0.00051197817,0.00007133093,0.00015167793,0.000082148086],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018360277,0.00009491946,0.00018947122,0.00008481057,0.00020264326,0.00006728105,0.000073597505,0.000051425406,0.000008454959],"category_scores_gemma":[0.0003126443,0.000061780054,0.0000443338,0.00010955483,0.00010449412,0.00012676668,0.000029303397,0.00015902307,0.0000015467501],"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.00011418854,0.00014555304,0.000178778,0.00026313972,0.00016030665,0.00002294166,0.008671992,0.000029089346,0.00050135644,0.8932543,0.0014288223,0.09522958],"study_design_scores_gemma":[0.0006175734,0.00008973789,0.000620252,0.000073558396,0.00005775171,0.0010282863,0.0043449774,0.0008509147,0.00065319234,0.9907952,0.00078161026,0.00008697539],"about_ca_topic_score_codex":4.6282003e-7,"about_ca_topic_score_gemma":0.000001922175,"teacher_disagreement_score":0.27258432,"about_ca_system_score_codex":0.000013369828,"about_ca_system_score_gemma":0.000013727095,"threshold_uncertainty_score":0.25193176},"labels":[],"label_agreement":null},{"id":"W2331953275","doi":"10.1112/s1461157000000723","title":"Analysis of the GHS Weil Descent Attack on the ECDLP over Characteristic Two Finite Fields of Composite Degree","year":2002,"lang":"en","type":"article","venue":"LMS Journal of Computation and Mathematics","topic":"Cryptography and Residue Arithmetic","field":"Computer Science","cited_by":33,"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; Hessian form of an elliptic curve; Elliptic Curve Digital Signature Algorithm; Supersingular elliptic curve; Elliptic curve; Tripling-oriented Doche–Icart–Kohel curve; Schoof's algorithm; Elliptic curve point multiplication; Twists of curves; Degree (music); Modular elliptic curve; Discrete mathematics; Elliptic curve cryptography; Pure mathematics; Computer science; Public-key cryptography; Quarter period; Encryption; Physics; Computer security","score_opus":0.05634830878611276,"score_gpt":0.2802508666782338,"score_spread":0.22390255789212105,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2331953275","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.60591614,0.00010568706,0.39297897,0.00063600513,0.000102011676,0.00006480387,0.000002213455,0.0000036458873,0.00019054212],"genre_scores_gemma":[0.9884901,0.00006782997,0.011217084,0.00019165686,0.00001507962,4.0144468e-7,2.536142e-7,0.0000030603137,0.000014530758],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989538,0.000085261585,0.0004819719,0.00006937207,0.00032836382,0.00008118348],"domain_scores_gemma":[0.99821985,0.0006978202,0.0006855278,0.00020512822,0.00015434087,0.000037351765],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00030109024,0.00008523617,0.0002678327,0.00019284134,0.00007753781,0.00004897233,0.0003467752,0.000028631724,0.000020644367],"category_scores_gemma":[0.000049348993,0.000045276218,0.00021176864,0.00058686774,0.00007991298,0.00007555136,0.000062496954,0.00013783103,8.680702e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00015401731,0.0061479956,0.03366742,0.0014804283,0.008766942,0.00007789757,0.096894905,0.44724298,0.00561746,0.2199961,0.00393876,0.17601511],"study_design_scores_gemma":[0.0004507955,0.00014630219,0.049784645,0.00020944736,0.00037595918,0.00002833047,0.0000896778,0.9427454,0.0005776261,0.0054548634,0.000051592557,0.00008534866],"about_ca_topic_score_codex":0.0000020266332,"about_ca_topic_score_gemma":0.0000027972558,"teacher_disagreement_score":0.49550244,"about_ca_system_score_codex":0.000006306305,"about_ca_system_score_gemma":0.000010329565,"threshold_uncertainty_score":0.18463106},"labels":[],"label_agreement":null},{"id":"W2333925966","doi":"10.1112/s1461157000000929","title":"A Diophantine Equation Associated to <i>X</i><sub>0</sub>(5)","year":2005,"lang":"en","type":"article","venue":"LMS Journal of Computation and Mathematics","topic":"Algebraic Geometry and Number Theory","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":"Simon Fraser University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Diophantine equation; Mathematics; Thue equation; Fermat's Last Theorem; Diophantine set; Legendre's equation; Galois module; Fermat number; Diophantine geometry; Modular form; Pure mathematics; Algebra over a field; Discrete mathematics","score_opus":0.03204438462157647,"score_gpt":0.29329379150318236,"score_spread":0.26124940688160586,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2333925966","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6339865,0.00004970301,0.36487812,0.00049132557,0.00009378543,0.00010574076,0.0000015360007,0.000024118792,0.00036922577],"genre_scores_gemma":[0.9173499,0.000025072792,0.08208008,0.000283187,0.00016435806,0.0000017416287,0.0000019745632,0.000021121903,0.00007256681],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99855,0.00007634885,0.00073379336,0.00009306896,0.00038073913,0.00016607197],"domain_scores_gemma":[0.99808276,0.000685323,0.0006699715,0.000088198205,0.0003260779,0.00014764679],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012492638,0.000144487,0.0003566721,0.00021231448,0.00008496465,0.000055387525,0.00010539057,0.000073410556,0.000018086814],"category_scores_gemma":[0.0010554962,0.00012443053,0.00008950048,0.00028161754,0.000027935,0.0002144495,0.000037547255,0.00015832907,0.000028764049],"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.0005229127,0.0063739712,0.0004694029,0.0016842416,0.0015941411,0.000107093154,0.056366872,0.014065469,0.14344664,0.4399848,0.03301367,0.3023708],"study_design_scores_gemma":[0.0025422957,0.0004878397,0.0004991828,0.0006029831,0.00027686564,0.00044649473,0.0010549781,0.025052179,0.04566849,0.92221004,0.0007147717,0.0004439065],"about_ca_topic_score_codex":1.6327306e-7,"about_ca_topic_score_gemma":0.0000011687904,"teacher_disagreement_score":0.4822252,"about_ca_system_score_codex":0.00004171047,"about_ca_system_score_gemma":0.00003298192,"threshold_uncertainty_score":0.507413},"labels":[],"label_agreement":null},{"id":"W2509268339","doi":"10.1112/s1461157016000309","title":"Computing theta functions in quasi-linear time in genus two and above","year":2016,"lang":"en","type":"article","venue":"LMS Journal of Computation and Mathematics","topic":"Algebraic Geometry and Number Theory","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 Calgary","funders":"","keywords":"Unicode; Mathematics; Genus; Arithmetic; Combinatorics; Discrete mathematics; Computer science; Artificial intelligence; Biology; Zoology","score_opus":0.02550632695140469,"score_gpt":0.3081721082150824,"score_spread":0.2826657812636777,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2509268339","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8545381,0.000110012275,0.14416316,0.0003048445,0.00007482216,0.00009969847,0.0000018533875,0.000011180683,0.00069636747],"genre_scores_gemma":[0.9678333,0.00002704436,0.03168111,0.00003524889,0.00006498128,5.9404664e-7,4.1127512e-7,0.000014667253,0.00034268785],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988537,0.00009805111,0.0006421132,0.000093664414,0.0001713027,0.0001411596],"domain_scores_gemma":[0.99801207,0.0013649019,0.00039074398,0.0000756851,0.00008812487,0.00006850234],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011567927,0.000117482785,0.00033470514,0.00025023735,0.000043194275,0.000022866328,0.00006878019,0.000050931692,0.000035216526],"category_scores_gemma":[0.00034073627,0.000080087535,0.00004231492,0.0001756649,0.000063788364,0.00015500192,0.00004070687,0.00014553672,0.000011746524],"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.0007211288,0.0064706774,0.02558681,0.002761485,0.00076386787,0.0005011151,0.08021094,0.0033662072,0.009771505,0.52235645,0.0025999213,0.3448899],"study_design_scores_gemma":[0.0028710316,0.00017410428,0.0013632174,0.000697081,0.000044686094,0.0005675029,0.0013296863,0.029123483,0.00016253247,0.96339715,0.00008159643,0.00018793695],"about_ca_topic_score_codex":0.000001513278,"about_ca_topic_score_gemma":0.0000041700996,"teacher_disagreement_score":0.44104072,"about_ca_system_score_codex":0.000026663813,"about_ca_system_score_gemma":0.000026687398,"threshold_uncertainty_score":0.3265875},"labels":[],"label_agreement":null},{"id":"W2515270739","doi":"10.1112/s1461157016000358","title":"Fast heuristic algorithms for computing relations in the class group of a quadratic order, with applications to isogeny evaluation","year":2016,"lang":"en","type":"article","venue":"LMS Journal of Computation and Mathematics","topic":"Cryptography and Residue Arithmetic","field":"Computer Science","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; Ideal class group; Isogeny; Ideal (ethics); Prime (order theory); Quadratic equation; Heuristic; Group (periodic table); Elliptic curve; Prime ideal; Order (exchange); Class (philosophy); Bounded function; Computation; Endomorphism; Discrete mathematics; Algorithm; Algebraic number field; Pure mathematics; Mathematical optimization; Combinatorics; Computer science","score_opus":0.03062737945523717,"score_gpt":0.31242767587510234,"score_spread":0.28180029641986515,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2515270739","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0284449,0.000092698785,0.96942055,0.0013406095,0.000039510982,0.00059983897,0.000001982049,0.0000071483,0.000052748583],"genre_scores_gemma":[0.5510712,0.000006464572,0.44884077,0.00004037791,0.000018743487,0.000015563113,6.199329e-7,0.0000036589915,0.0000025979755],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99887156,0.00008773126,0.0004969212,0.00010242695,0.0003407805,0.0001005983],"domain_scores_gemma":[0.9979029,0.0010224975,0.00042031825,0.00013419193,0.00047582586,0.000044237306],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001118387,0.00008123456,0.0001743622,0.00023103117,0.00009592571,0.000055710057,0.00023808856,0.000027250138,0.0000010569951],"category_scores_gemma":[0.000112634894,0.00004393622,0.000043272317,0.0005779553,0.00004762401,0.00015604161,0.000024446223,0.00006141156,8.390064e-7],"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.000045263565,0.0010496146,0.00077987654,0.00037882803,0.00014605072,0.00000451963,0.027567375,0.052806552,0.0013601799,0.42407447,0.0003532278,0.49143404],"study_design_scores_gemma":[0.002205137,0.00074852945,0.004979537,0.00051091315,0.000112716014,0.00020440732,0.0014939483,0.81700087,0.00008167927,0.17226484,0.00022238695,0.00017504142],"about_ca_topic_score_codex":0.000001324739,"about_ca_topic_score_gemma":0.000010646305,"teacher_disagreement_score":0.7641943,"about_ca_system_score_codex":0.000017965205,"about_ca_system_score_gemma":0.00006754802,"threshold_uncertainty_score":0.1791667},"labels":[],"label_agreement":null},{"id":"W2766675614","doi":"10.1112/s1461157017000031","title":"The Schwarzian equation for completely replicable functions","year":2017,"lang":"en","type":"article","venue":"LMS Journal of Computation and Mathematics","topic":"Algebraic structures and combinatorial models","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":"Concordia University; University of Ottawa","funders":"","keywords":"Mathematics; Schwarzian derivative; Pure mathematics; Algebra over a field; Mathematical economics; Calculus (dental)","score_opus":0.12743808203680007,"score_gpt":0.3700556868078514,"score_spread":0.24261760477105132,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2766675614","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12854977,0.0000991328,0.8680802,0.001392808,0.00086207833,0.00028520863,0.0000026121768,0.000015396743,0.0007128084],"genre_scores_gemma":[0.9121511,0.00002867371,0.08716923,0.00003636023,0.00025561996,0.00000756249,0.0000010286096,0.00001743476,0.00033299738],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99909806,0.000021906122,0.00047307683,0.000073276795,0.00021648813,0.00011718216],"domain_scores_gemma":[0.9973778,0.0009044945,0.0010423033,0.00023564228,0.00037899977,0.000060729613],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00066765107,0.00009220674,0.00021286847,0.000035807472,0.0010535778,0.0003250028,0.00021555027,0.00004589475,0.0000040580644],"category_scores_gemma":[0.0010411788,0.00005968116,0.00009483021,0.000024605613,0.00008086439,0.00017429641,0.0000399994,0.00010221692,0.0000010867486],"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.00003369033,0.00004545931,0.000019042858,0.000079309924,0.0000700432,6.140287e-7,0.0006032856,0.00019262539,0.000041034196,0.9876518,0.002902666,0.008360397],"study_design_scores_gemma":[0.000691643,0.00012995742,0.00012655446,0.00005449588,0.00006641619,0.00004833324,0.00038044536,0.025967171,0.000056132852,0.9703218,0.0020882697,0.00006882097],"about_ca_topic_score_codex":0.0000015394105,"about_ca_topic_score_gemma":0.0000020914351,"teacher_disagreement_score":0.78360134,"about_ca_system_score_codex":0.000018246725,"about_ca_system_score_gemma":0.00004100506,"threshold_uncertainty_score":0.8103375},"labels":[],"label_agreement":null},{"id":"W2962994292","doi":"10.1112/s1461157000000553","title":"Decomposing Replicable Functions","year":2008,"lang":"en","type":"article","venue":"LMS Journal of Computation and Mathematics","topic":"Advanced Algebra and Logic","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":"Concordia University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Statistics","score_opus":0.02690946846744284,"score_gpt":0.2622441534399645,"score_spread":0.23533468497252163,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2962994292","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.085863575,0.0001875894,0.91264564,0.0002508984,0.00014474831,0.000030503446,1.1322902e-7,0.000024479514,0.0008524647],"genre_scores_gemma":[0.47719434,0.000044898785,0.5225129,0.00010981507,0.000033681423,3.1364073e-7,1.7392e-7,0.0000030347487,0.00010082828],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99940133,0.000016215788,0.000287977,0.00006805191,0.00014642226,0.000079996134],"domain_scores_gemma":[0.9993328,0.00012439286,0.00025624747,0.000088286084,0.0001321804,0.00006608368],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00014386793,0.000058517035,0.00013642032,0.00008168493,0.0001479328,0.000040083545,0.00012605314,0.000019788416,0.0000034625157],"category_scores_gemma":[0.000035635218,0.00004630626,0.00005097322,0.00013908537,0.000030218387,0.00035084077,0.000035843754,0.00008359231,0.00000620124],"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.00003855312,0.0014385673,0.00142374,0.0003073066,0.0002948123,0.000490671,0.025127165,0.10096491,0.007297387,0.62575424,0.013592778,0.22326986],"study_design_scores_gemma":[0.0014520511,0.0005272643,0.0020626534,0.0001586674,0.000042002437,0.013179661,0.00048084455,0.4590584,0.00112325,0.51572245,0.0058330996,0.00035967477],"about_ca_topic_score_codex":1.9850359e-7,"about_ca_topic_score_gemma":1.006987e-7,"teacher_disagreement_score":0.39133075,"about_ca_system_score_codex":0.000010524637,"about_ca_system_score_gemma":0.000030496658,"threshold_uncertainty_score":0.18883145},"labels":[],"label_agreement":null}]}