{"meta":{"page":1,"per_page":50,"max_per_page":100,"total":118,"total_is_capped":false,"direct_labels_cover":0,"predictions_cover":118,"direct_label_status":"direct model label, unvalidated","prediction_status":"machine_predicted_unvalidated (Codex and Gemma teacher distillation)","score_status":"score_only:v0-immature-baseline (scores rank; they never assert a category)","snapshot":{"source":"OpenAlex, pinned release, all 482 partitions","release":"2026-06-24","frame_built":"2026-07-12"},"query_hash":"86f574330bbb","filters":{"venue":"Journal of Symbolic Computation"}},"results":[{"id":"W2102022978","doi":"10.1016/j.jsc.2003.08.007","title":"From the zonotope construction to the Minkowski addition of convex polytopes","year":2004,"lang":"en","type":"article","venue":"Journal of Symbolic Computation","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":163,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":false,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Polytope; Mathematics; Parallelizable manifold; Hyperplane; Minkowski addition; Bounded function; Combinatorics; Generalization; Time complexity; Polynomial; Regular polygon; Discrete mathematics; Algorithm; Mathematical optimization","retraction":null,"screen_n_in":null,"score":{"opus":0.01052282682822787,"gpt":0.2417820425937021,"spread":0.2312592157654742,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005012451,0.00009855616,0.000174487,0.0001447237,0.000161211,0.000117788,0.0004636812,0.00003855961,0.00001648425],"category_scores_gemma":[0.0001196595,0.00006205236,0.0001016312,0.0006222078,0.00005103624,0.0004270564,0.00006783862,0.0001409569,0.00001723042],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00006395901,"about_ca_system_score_gemma":0.0002055081,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00008506827,"about_ca_topic_score_gemma":0.00001745159,"domain_scores_codex":[0.9986458,0.0001175465,0.000531134,0.0001344837,0.0004652905,0.0001057845],"domain_scores_gemma":[0.9983857,0.0003357052,0.0005299406,0.0001714448,0.0005166485,0.00006059813],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00006981457,0.0001413232,0.0001975325,0.0000100152,0.0001269069,0.000006863781,0.008986178,0.6326296,0.006721882,0.06186029,0.008738778,0.2805108],"study_design_scores_gemma":[0.006382829,0.00212446,0.208436,0.0007587942,0.000273269,0.001396627,0.004447607,0.1485104,0.05632034,0.531154,0.03924824,0.0009473123],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2571355,0.0001424213,0.7327576,0.008820618,0.000903911,0.0001445287,0.000009837122,0.00001103329,0.00007449502],"genre_scores_gemma":[0.9425408,0.00001548408,0.05596454,0.0006774763,0.0007744072,0.000003356468,0.0000132926,0.000004458792,0.000006136213],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.6854053,"threshold_uncertainty_score":0.2530422,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1994728957","doi":"10.1016/s0747-7171(02)00139-6","title":"On lattice reduction for polynomial matrices","year":2003,"lang":"en","type":"article","venue":"Journal of Symbolic Computation","topic":"Polynomial and algebraic computation","field":"Computer Science","cited_by":119,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo","funders":"Eidgenössische Technische Hochschule Zürich","keywords":"Mathematics; Computation; Lattice reduction; Hermite polynomials; Lattice (music); Matrix polynomial; Polynomial; Reduction (mathematics); Canonical form; Combinatorics; Discrete mathematics; Algebra over a field; Pure mathematics; Algorithm; Mathematical analysis; Geometry","retraction":null,"screen_n_in":null,"score":{"opus":0.01561379415303387,"gpt":0.2677597174106794,"spread":0.2521459232576456,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005489551,0.0001161224,0.0001988057,0.000312993,0.0001254492,0.0001371557,0.0002477491,0.00004961625,0.000003758019],"category_scores_gemma":[0.000139177,0.0001038791,0.0001355086,0.0003365627,0.00001694314,0.0005464867,0.00001691596,0.0001208851,0.00001154417],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00008578497,"about_ca_system_score_gemma":0.000148589,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000003523773,"about_ca_topic_score_gemma":2.516812e-7,"domain_scores_codex":[0.9988191,0.00009524467,0.0004710727,0.0001658677,0.000277689,0.000171076],"domain_scores_gemma":[0.998721,0.0002974207,0.0005259936,0.0001026045,0.0002630776,0.00008992892],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.000245591,0.0005222048,0.0000625184,0.00006949987,0.0001321594,0.00001418936,0.002178126,0.06171871,0.00409359,0.4849654,0.01871238,0.4272856],"study_design_scores_gemma":[0.009090384,0.00461057,0.007561024,0.0003387171,0.0001683496,0.00201927,0.0003404949,0.2693307,0.01850436,0.664398,0.02251107,0.001127042],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.294791,0.00009686656,0.7021819,0.0005866133,0.001546753,0.0001389075,7.540557e-7,0.00003177672,0.0006254101],"genre_scores_gemma":[0.9477965,0.000007386288,0.0516113,0.0001244765,0.0003951621,0.000003017311,0.000001183473,0.000008167423,0.00005280524],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.6530055,"threshold_uncertainty_score":0.4236068,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2126318803","doi":"10.1016/s0747-7171(03)00088-9","title":"Early termination in sparse interpolation algorithms","year":2003,"lang":"en","type":"article","venue":"Journal of Symbolic Computation","topic":"Advanced Combinatorial Mathematics","field":"Mathematics","cited_by":117,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada; National Science Foundation","keywords":"Interpolation (computer graphics); Algorithm; Mathematics; Univariate; Heuristics; Probabilistic logic; Probabilistic analysis of algorithms; Polynomial interpolation; Polynomial; Computer science; Multivariate statistics; Linear interpolation; Mathematical optimization; Artificial intelligence; Statistics","retraction":null,"screen_n_in":null,"score":{"opus":0.03869791639401308,"gpt":0.3381397188642772,"spread":0.2994418024702641,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007530345,0.0001157736,0.0002832665,0.0003515086,0.00003044077,0.00003509807,0.00009850188,0.00006909289,0.00001222466],"category_scores_gemma":[0.0009506206,0.0001104788,0.00007132192,0.0003096074,0.00001846829,0.0004031346,0.00001265448,0.0002098691,0.000006357554],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001521736,"about_ca_system_score_gemma":0.00005884648,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00000220119,"about_ca_topic_score_gemma":0.000001762722,"domain_scores_codex":[0.9985067,0.000138104,0.0007890773,0.00009049944,0.0003398004,0.0001358278],"domain_scores_gemma":[0.9984128,0.0003954847,0.0007574073,0.00009271943,0.0002892715,0.00005230658],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.000157219,0.002005876,0.007281507,0.0004052027,0.0001439499,0.0001638163,0.02603252,0.004543033,0.007088942,0.8557853,0.0007595088,0.09563319],"study_design_scores_gemma":[0.001199826,0.0001724112,0.005478042,0.00019708,0.00002493664,0.0001204199,0.0003341297,0.01210835,0.0006346038,0.9795305,0.00007373364,0.000126005],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.7150477,0.00002573282,0.283238,0.00004354459,0.0006008698,0.0001439492,3.398431e-7,0.00001497942,0.0008849207],"genre_scores_gemma":[0.9046366,0.000005118335,0.09519948,0.00001017107,0.00009662394,0.000002368202,5.418303e-7,0.00001786047,0.00003125899],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.1895889,"threshold_uncertainty_score":0.4505195,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2170368342","doi":"10.1006/jsco.1999.1002","title":"Factoring Polynomials Over Finite Fields: A Survey","year":2001,"lang":"en","type":"article","venue":"Journal of Symbolic Computation","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":100,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Toronto","funders":"","keywords":"Factoring; Mathematics; Univariate; Finite field; Factorization; Factorization of polynomials; Algebra over a field; Pure mathematics; Discrete mathematics; Algorithm; Polynomial; Multivariate statistics; Statistics; Mathematical analysis","retraction":null,"screen_n_in":null,"score":{"opus":0.03254854062645635,"gpt":0.284985279481469,"spread":0.2524367388550126,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008974298,0.00009285214,0.0001905087,0.0002775706,0.00007945159,0.0001505182,0.0003851005,0.00004684941,0.00002056294],"category_scores_gemma":[0.000127645,0.00008313749,0.0001229046,0.0004895453,0.00001576228,0.0005172591,0.0000625046,0.0001605129,0.000007454195],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002546428,"about_ca_system_score_gemma":0.00005128413,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002996033,"about_ca_topic_score_gemma":0.000007249462,"domain_scores_codex":[0.9989381,0.0001616574,0.0003847209,0.000114188,0.0002499986,0.0001512864],"domain_scores_gemma":[0.9987169,0.0005627297,0.0003309278,0.0001346816,0.0001716444,0.00008313393],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"observational","study_design_scores_codex":[0.0004204933,0.0005643861,0.2203335,0.00004677978,0.0003819453,0.0002740958,0.01591017,0.05252951,0.002320527,0.02473681,0.003963084,0.6785187],"study_design_scores_gemma":[0.001299261,0.0004884074,0.9129025,0.0001278855,0.00002256283,0.0002668805,0.0000664273,0.04372567,0.0004257425,0.03650248,0.00382093,0.0003512395],"study_design_candidate":"observational","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.4784621,0.00007592254,0.5205238,0.0001658818,0.0004929788,0.00002577078,5.04096e-7,0.00001924399,0.0002337765],"genre_scores_gemma":[0.9965791,0.00003469626,0.002946603,0.0001978078,0.0002137155,4.437835e-7,7.747017e-7,0.000004822174,0.00002208618],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.692569,"threshold_uncertainty_score":0.3390248,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1969341770","doi":"10.1006/jsco.1999.0309","title":"Algorithms for Exponentiation in Finite Fields","year":2000,"lang":"en","type":"article","venue":"Journal of Symbolic Computation","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":89,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Toronto","funders":"","keywords":"Exponentiation; Mathematics; Normal basis; Finite field; Modular exponentiation; Multiplication (music); Division (mathematics); Basis (linear algebra); Polynomial; Polynomial basis; Combinatorics; Element (criminal law); Prime (order theory); Discrete mathematics; Arithmetic; Mathematical analysis; Geometry; Computer science","retraction":null,"screen_n_in":null,"score":{"opus":0.01953647114672561,"gpt":0.2727223051112659,"spread":0.2531858339645403,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004748263,0.00005803244,0.0001193369,0.0002429182,0.00004454766,0.00006489635,0.0002170077,0.00003770028,0.00001861755],"category_scores_gemma":[0.00002474991,0.00005536953,0.00009389047,0.0003193643,0.00000885288,0.0004118713,0.00001124353,0.00008877408,0.000003875929],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001788497,"about_ca_system_score_gemma":0.00002843869,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000002742545,"about_ca_topic_score_gemma":0.000001638489,"domain_scores_codex":[0.9992911,0.0000528645,0.0003241223,0.00008785182,0.0001412138,0.0001028895],"domain_scores_gemma":[0.9994408,0.0002083023,0.0001505898,0.00007318987,0.00009242625,0.00003463936],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0000507271,0.00009838067,0.0003214021,0.0000112822,0.00001542382,0.000006741729,0.00230114,0.04473567,0.00009256605,0.008317469,0.0002710097,0.9437782],"study_design_scores_gemma":[0.001738778,0.0005172685,0.02225335,0.00009911087,0.00001351322,0.00006029259,0.00007092069,0.7321569,0.0003856062,0.2401823,0.002342522,0.0001794472],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.232654,0.00006584694,0.7663129,0.0004529505,0.0002218766,0.00006305123,3.701731e-7,0.00001250025,0.0002164428],"genre_scores_gemma":[0.9650514,0.00002336474,0.03462863,0.0001393515,0.000126151,0.000002791222,0.00000118784,0.000003135843,0.00002396794],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9435987,"threshold_uncertainty_score":0.2257904,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2053029682","doi":"10.1016/j.jsc.2011.12.023","title":"Algorithms for computing triangular decomposition of polynomial systems","year":2011,"lang":"en","type":"article","venue":"Journal of Symbolic Computation","topic":"Polynomial and algebraic computation","field":"Computer Science","cited_by":87,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Western University","funders":"","keywords":"Decomposition; Mathematics; Key (lock); Polynomial; Algorithm; Algebra over a field; Theoretical computer science; Computer science; Pure mathematics","retraction":null,"screen_n_in":null,"score":{"opus":0.03919643090636567,"gpt":0.2941856011297759,"spread":0.2549891702234102,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008052037,0.0001465356,0.000421632,0.0003880654,0.00009690859,0.00007402319,0.0004524991,0.00007082384,0.000001785177],"category_scores_gemma":[0.00004775037,0.0001361905,0.0002218545,0.0003282801,0.00003406153,0.0005407515,0.00006789419,0.0001125672,0.000002249455],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00007167733,"about_ca_system_score_gemma":0.0001686813,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00005530153,"about_ca_topic_score_gemma":6.947022e-7,"domain_scores_codex":[0.9981551,0.0001150082,0.001024826,0.0001800183,0.0003193544,0.0002056667],"domain_scores_gemma":[0.9976875,0.0002405181,0.001271689,0.0001313943,0.0005615783,0.0001073023],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0005236245,0.0009093516,0.0006567088,0.0003434093,0.0004587987,0.00004123055,0.02033043,0.05269599,0.01209702,0.02666225,0.00232471,0.8829565],"study_design_scores_gemma":[0.002964344,0.001107654,0.01117104,0.0002209595,0.00006971563,0.0003359243,0.000257618,0.9698001,0.006699424,0.006887114,0.000216344,0.0002697956],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2537214,0.0002128976,0.7442309,0.00006690303,0.001445781,0.0002109937,0.000002581127,0.00002770199,0.00008086641],"genre_scores_gemma":[0.8615516,0.000004557075,0.137942,0.00002987245,0.0004500864,0.000001998802,0.000003667142,0.000009783441,0.000006444523],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9171041,"threshold_uncertainty_score":0.5553689,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2127412655","doi":"10.1006/jsco.2000.0370","title":"Challenges of Symbolic Computation: My Favorite Open Problems","year":2000,"lang":"en","type":"article","venue":"Journal of Symbolic Computation","topic":"Polynomial and algebraic computation","field":"Computer Science","cited_by":82,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":false,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"","funders":"Simon Fraser University","keywords":"Symbolic computation; Symbolic-numeric computation; The Symbolic; Computation; Computer science; Mathematics; Theoretical computer science; Algebra over a field; Programming language; Pure mathematics","retraction":null,"screen_n_in":null,"score":{"opus":0.03688501806389176,"gpt":0.2866758961192889,"spread":0.2497908780553971,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009326838,0.0002535134,0.0006422877,0.0003943551,0.0001474208,0.0002864862,0.001349797,0.00009658444,0.00003436634],"category_scores_gemma":[0.00003381088,0.0002336323,0.0001956447,0.0006950693,0.00007171118,0.001565867,0.0002237237,0.0002660695,0.00004063191],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00008597877,"about_ca_system_score_gemma":0.0002798644,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00005644484,"about_ca_topic_score_gemma":0.00001026655,"domain_scores_codex":[0.9971526,0.0002391605,0.001268545,0.0003573113,0.0006733674,0.0003090656],"domain_scores_gemma":[0.9977237,0.000255504,0.001031731,0.0002505045,0.0005444615,0.0001941148],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00003995291,0.0002856294,0.00009305352,0.00007911667,0.00009074996,0.00001627286,0.004972098,0.06996448,0.0003363924,0.01160705,0.0005284035,0.9119868],"study_design_scores_gemma":[0.007209776,0.002456991,0.1159515,0.001340147,0.000137144,0.001453053,0.000550266,0.626574,0.001383209,0.2348926,0.006845386,0.001205922],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.5109756,0.00270626,0.4669331,0.00562607,0.001206727,0.0007393938,0.000004876553,0.0001187617,0.01168927],"genre_scores_gemma":[0.9778448,0.0003489852,0.02115449,0.00016753,0.0003540044,0.000005466681,0.000004968827,0.00001844964,0.0001013022],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.9107808,"threshold_uncertainty_score":0.9527251,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1995653528","doi":"10.1016/s0747-7171(03)00097-x","title":"High-order lifting and integrality certification","year":2003,"lang":"en","type":"article","venue":"Journal of Symbolic Computation","topic":"Polynomial and algebraic computation","field":"Computer Science","cited_by":81,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo","funders":"","keywords":"Mathematics; Invertible matrix; Univariate; Dimension (graph theory); Matrix (chemical analysis); Polynomial matrix; Field (mathematics); Matrix multiplication; Ring (chemistry); Correctness; Polynomial; Order (exchange); Multiplication (music); Algebra over a field; Discrete mathematics; Combinatorics; Pure mathematics; Matrix polynomial; Algorithm; Mathematical analysis","retraction":null,"screen_n_in":null,"score":{"opus":0.01770843685776512,"gpt":0.2537189566302896,"spread":0.2360105197725245,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006251978,0.000096081,0.0001772445,0.0001737873,0.00009860042,0.0001542017,0.0001704942,0.00003910429,0.000003559432],"category_scores_gemma":[0.0001890774,0.00008324393,0.00004472601,0.000383377,0.00002636596,0.000596247,0.0000338568,0.0001434943,0.000005164721],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004509306,"about_ca_system_score_gemma":0.00009822209,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002316635,"about_ca_topic_score_gemma":0.000002063601,"domain_scores_codex":[0.998886,0.0001414923,0.0004720929,0.0001476484,0.0002266351,0.0001260909],"domain_scores_gemma":[0.9989071,0.0001439687,0.0004355443,0.00009576709,0.0003290981,0.00008848],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00001345443,0.0001504085,0.001751862,0.00003374286,0.00005431337,0.00001099126,0.003180247,0.009268234,0.0043272,0.2243722,0.0004391264,0.7563982],"study_design_scores_gemma":[0.002862057,0.0005795146,0.1852885,0.0002153432,0.00006767639,0.000934391,0.0004508251,0.3502712,0.01063881,0.4444776,0.00350222,0.0007117952],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.416647,0.0001140352,0.5818633,0.0007945247,0.0003930932,0.00004183929,1.675505e-7,0.00001996869,0.0001260497],"genre_scores_gemma":[0.9252802,0.00001409554,0.07446305,0.0001242821,0.00009671412,7.909288e-7,9.327444e-7,0.000004522867,0.00001537351],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.7556864,"threshold_uncertainty_score":0.3394589,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1970573500","doi":"10.1016/j.jsc.2005.07.002","title":"Toric ideals and graph theory to analyze Hopf bifurcations in mass action systems","year":2005,"lang":"en","type":"article","venue":"Journal of Symbolic Computation","topic":"Protein Structure and Dynamics","field":"Biochemistry, Genetics and Molecular Biology","cited_by":80,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Western University","funders":"Deutsche Forschungsgemeinschaft","keywords":"Mathematics; Monomial; Toric variety; Algebraic geometry; Jacobian matrix and determinant; Hopf bifurcation; Polynomial; Convex geometry; Pure mathematics; Regular polygon; Bifurcation; Applied mathematics; Mathematical analysis; Convex set; Geometry; Convex optimization; Nonlinear system","retraction":null,"screen_n_in":null,"score":{"opus":0.007298646032066711,"gpt":0.2755874443450062,"spread":0.2682887983129395,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002988359,0.00006673382,0.0001196781,0.0001955918,0.00003171371,0.00002752275,0.0000557811,0.00006289781,0.000001054053],"category_scores_gemma":[0.00004174777,0.00006022328,0.00003581176,0.0001644282,0.00001166422,0.00001134218,0.0000137435,0.00006901711,8.979964e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003224736,"about_ca_system_score_gemma":0.00003775738,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001061908,"about_ca_topic_score_gemma":0.00002203583,"domain_scores_codex":[0.9993941,0.00006800117,0.0002676491,0.00009088077,0.0000965603,0.00008276979],"domain_scores_gemma":[0.9995814,0.00001707329,0.0001654275,0.00006238253,0.0001158419,0.00005789898],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"bench_or_experimental","study_design_gemma":"observational","study_design_scores_codex":[0.0002907015,0.00008826172,0.009156562,0.00006688386,0.0001568363,0.000006814641,0.0008503207,0.3099352,0.5120943,0.003508078,0.0007745849,0.1630715],"study_design_scores_gemma":[0.007796504,0.003221052,0.7611591,0.0006082856,0.0004339336,0.00177357,0.0042883,0.06611809,0.04618118,0.07261064,0.0339118,0.001897619],"study_design_candidate":"observational","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.7774625,0.0008110133,0.221206,0.0002049354,0.0001435711,0.00009002178,0.000001883865,0.00000231656,0.0000777712],"genre_scores_gemma":[0.995895,0.0001549322,0.003439677,0.00009117494,0.000366436,0.000002998409,0.000007710126,0.000006219028,0.00003587512],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.7520025,"threshold_uncertainty_score":0.2455834,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1977375620","doi":"10.1016/j.jsc.2008.11.003","title":"Symbolic–numeric sparse interpolation of multivariate polynomials","year":2008,"lang":"en","type":"article","venue":"Journal of Symbolic Computation","topic":"Numerical Methods and Algorithms","field":"Computer Science","cited_by":75,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo","funders":"Universiteit Antwerpen; Natural Sciences and Engineering Research Council of Canada; Mitacs; Fonds Wetenschappelijk Onderzoek; Institut national de recherche en informatique et en automatique (INRIA)","keywords":"Mathematics; Interpolation (computer graphics); Polynomial; Applied mathematics; Floating point; Eigenvalues and eigenvectors; Polynomial interpolation; Algorithm; Algebra over a field; Pure mathematics; Linear interpolation; Mathematical analysis; Computer science; Image (mathematics)","retraction":null,"screen_n_in":null,"score":{"opus":0.03533795481161242,"gpt":0.3080761204314586,"spread":0.2727381656198462,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005756961,0.0001391081,0.0004742088,0.0003244484,0.00008048991,0.00003599863,0.0004248791,0.00005650755,0.000008482907],"category_scores_gemma":[0.0001362577,0.0001171569,0.0001787524,0.0005915618,0.00006058099,0.000584463,0.0000899682,0.0001821733,0.000007570322],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004311244,"about_ca_system_score_gemma":0.0001216041,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00005685407,"about_ca_topic_score_gemma":2.88468e-7,"domain_scores_codex":[0.9980959,0.0002370254,0.0009110966,0.0001642101,0.0004094142,0.0001823491],"domain_scores_gemma":[0.9979708,0.0002789522,0.001107828,0.000166639,0.0003496648,0.0001261805],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00009694182,0.0006030783,0.004105881,0.00005350606,0.0001882302,0.0001045983,0.007996305,0.01094643,0.05622213,0.00791622,0.0005078954,0.9112588],"study_design_scores_gemma":[0.002027082,0.0009227308,0.1843617,0.0002117672,0.00004972271,0.00126422,0.00011726,0.7808497,0.008659959,0.02033964,0.0007756506,0.0004205619],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.240143,0.0001287959,0.7585486,0.0002487239,0.0006555408,0.00007287024,7.840679e-7,0.00001988285,0.0001818957],"genre_scores_gemma":[0.6713027,0.0000316036,0.3283914,0.00006644784,0.0001806727,7.42419e-7,4.985514e-7,0.000007003498,0.00001887699],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9108382,"threshold_uncertainty_score":0.4777521,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2129089669","doi":"10.1016/j.jsc.2011.09.003","title":"Genus 2 point counting over prime fields","year":2011,"lang":"en","type":"article","venue":"Journal of Symbolic Computation","topic":"Cryptography and Residue Arithmetic","field":"Computer Science","cited_by":71,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Western University","funders":"","keywords":"Mathematics; Genus; Prime (order theory); Jacobian matrix and determinant; Twists of curves; Computation; Prime number; Twist; Discrete mathematics; Combinatorics; Elliptic curve; Algorithm; Schoof's algorithm; Pure mathematics; Applied mathematics; Geometry","retraction":null,"screen_n_in":null,"score":{"opus":0.01778078805688415,"gpt":0.2393396749367503,"spread":0.2215588868798661,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003809896,0.00008045394,0.0001499644,0.0002350267,0.00007188778,0.00007032941,0.0003304101,0.00004966879,0.00002027826],"category_scores_gemma":[0.0000250254,0.00006683704,0.0001220956,0.0003042084,0.00002397716,0.0004675102,0.00006261183,0.0001721384,0.000007989123],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002069641,"about_ca_system_score_gemma":0.00006304046,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002993975,"about_ca_topic_score_gemma":0.000002467131,"domain_scores_codex":[0.9990719,0.00004775445,0.0003652172,0.0001045239,0.0002701214,0.0001404909],"domain_scores_gemma":[0.9992057,0.0000642017,0.000349858,0.000120453,0.0001900587,0.00006973411],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"observational","study_design_scores_codex":[0.0001285026,0.001115195,0.02142642,0.0001304797,0.0005303305,0.0006531927,0.05623443,0.006410369,0.003245598,0.08983021,0.004521675,0.8157736],"study_design_scores_gemma":[0.00228369,0.0009841616,0.7006918,0.0002650312,0.00009307531,0.00152685,0.0003221034,0.1728571,0.005959429,0.1127681,0.001650288,0.0005984002],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3011017,0.0001611436,0.6969822,0.0001636508,0.0004709559,0.00003934849,1.348596e-7,0.00002050744,0.001060349],"genre_scores_gemma":[0.9480934,0.00001610438,0.05157604,0.0001642206,0.0001376593,4.365957e-7,1.858518e-7,0.000004418871,0.000007601037],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.8151752,"threshold_uncertainty_score":0.2725535,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2021258994","doi":"10.1016/j.jsc.2005.10.002","title":"Fraction-free row reduction of matrices of Ore polynomials","year":2005,"lang":"en","type":"article","venue":"Journal of Symbolic Computation","topic":"Polynomial and algebraic computation","field":"Computer Science","cited_by":70,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo; University of Lethbridge","funders":"","keywords":"Mathematics; Skew; Computation; Reduction (mathematics); Fraction (chemistry); Rank (graph theory); Matrix (chemical analysis); Skew-symmetric matrix; Combinatorics; Discrete mathematics; Pure mathematics; Symmetric matrix; Square matrix; Algorithm; Geometry","retraction":null,"screen_n_in":null,"score":{"opus":0.01198716090260493,"gpt":0.2584773294114341,"spread":0.2464901685088292,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005362314,0.0001196858,0.0003686301,0.000492179,0.00005553882,0.00004412082,0.0005296364,0.00006516653,0.00001190098],"category_scores_gemma":[0.00009457866,0.0001093683,0.0001662448,0.0005565193,0.00004425436,0.001099592,0.0000897253,0.0001424243,0.00000483467],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00008632772,"about_ca_system_score_gemma":0.0001846242,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00004165225,"about_ca_topic_score_gemma":0.000002224644,"domain_scores_codex":[0.9981264,0.00009193105,0.001018605,0.0001437391,0.0004832366,0.0001360419],"domain_scores_gemma":[0.9973067,0.0001569484,0.001742247,0.0002002269,0.0005167587,0.00007710436],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000115338,0.0004174334,0.0005566428,0.00009593462,0.0001355505,0.000004081068,0.002402954,0.08901059,0.03836044,0.006428304,0.004391038,0.8580817],"study_design_scores_gemma":[0.007766566,0.002443351,0.151326,0.000933149,0.0003044712,0.001650523,0.0009653319,0.4896093,0.2205803,0.1192498,0.004119605,0.001051606],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.6542154,0.0004105363,0.3432521,0.001301683,0.000502354,0.00008034536,0.000001940709,0.00002009418,0.0002155993],"genre_scores_gemma":[0.9484121,0.00005346501,0.05086512,0.00003174279,0.0006074813,7.649385e-7,0.000001461228,0.000006841347,0.00002104932],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.8570301,"threshold_uncertainty_score":0.445991,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2038133488","doi":"10.1016/j.jsc.2007.11.005","title":"Approximate factorization of multivariate polynomials using singular value decomposition","year":2007,"lang":"en","type":"article","venue":"Journal of Symbolic Computation","topic":"Numerical Methods and Algorithms","field":"Computer Science","cited_by":69,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo","funders":"National Science Foundation","keywords":"Mathematics; Singular value decomposition; Factorization; Multivariate statistics; Generalization; Applied mathematics; Set (abstract data type); Decomposition; Algorithm; Mathematical analysis; Statistics; Computer science","retraction":null,"screen_n_in":null,"score":{"opus":0.02778806671875694,"gpt":0.3559300464458081,"spread":0.3281419797270511,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001404317,0.0001081737,0.0003083966,0.0003184286,0.0000736314,0.00006473708,0.0002338651,0.0000579769,0.000001355903],"category_scores_gemma":[0.00009330185,0.00009553659,0.0001107238,0.0005083942,0.00002515088,0.0005279593,0.00005049877,0.0001019095,4.521111e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00009064927,"about_ca_system_score_gemma":0.00006497361,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00003241434,"about_ca_topic_score_gemma":1.490103e-7,"domain_scores_codex":[0.9983611,0.0001597242,0.0008049896,0.0001328249,0.0003712908,0.0001700627],"domain_scores_gemma":[0.9981298,0.0002347664,0.001059005,0.0001023556,0.0003802816,0.00009381756],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00005898784,0.000299717,0.0006495848,0.00004850347,0.00008290382,0.00002586626,0.001874546,0.08903696,0.3942165,0.01497492,0.000006293909,0.4987252],"study_design_scores_gemma":[0.0007733144,0.0002441099,0.02274507,0.000132351,0.00003422453,0.0001290657,0.00003508294,0.8986726,0.05015837,0.02687477,0.00003259283,0.0001684147],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2010409,0.00005319586,0.7981157,0.00004806049,0.0006208334,0.00007309741,5.708873e-7,0.00001479297,0.0000327727],"genre_scores_gemma":[0.5193532,0.000002382887,0.4804986,0.00001888235,0.0001206351,7.535394e-8,7.229624e-7,0.000004759914,8.130036e-7],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8096357,"threshold_uncertainty_score":0.3895869,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2150928761","doi":"10.1016/j.jsc.2011.12.014","title":"Triangular decomposition of semi-algebraic systems","year":2011,"lang":"en","type":"article","venue":"Journal of Symbolic Computation","topic":"Polynomial and algebraic computation","field":"Computer Science","cited_by":57,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Western University","funders":"","keywords":"Decomposition; Mathematics; Algebraic number; Polynomial; Exponential function; Algebra over a field; Triangular matrix; Discrete mathematics; Algorithm; Pure mathematics; Mathematical analysis","retraction":null,"screen_n_in":null,"score":{"opus":0.02228769174550693,"gpt":0.2552590522068215,"spread":0.2329713604613146,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006079148,0.0001293911,0.0003531172,0.0004099406,0.00005764191,0.0000600049,0.0004595962,0.00006276365,0.000007223943],"category_scores_gemma":[0.00003745234,0.0001157609,0.0001610337,0.0004590323,0.00003319416,0.0007044655,0.00006615654,0.0001339545,0.000009711403],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00006017271,"about_ca_system_score_gemma":0.0001303585,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00005071031,"about_ca_topic_score_gemma":9.421267e-7,"domain_scores_codex":[0.9982417,0.0001543962,0.0008898423,0.0001504646,0.0004018321,0.0001617534],"domain_scores_gemma":[0.99813,0.0001202726,0.001055375,0.0001536681,0.0004314358,0.0001092101],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0004626907,0.001740716,0.003216732,0.0004928218,0.0006982958,0.0002378205,0.03270923,0.06762118,0.0403987,0.2225581,0.002994591,0.6268691],"study_design_scores_gemma":[0.005632897,0.002772544,0.1168696,0.0009055319,0.0001771726,0.002041297,0.000621229,0.7208378,0.02735645,0.1213665,0.0005642938,0.0008547029],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3998603,0.0003155341,0.5984588,0.00006670953,0.0008208058,0.00009788141,7.250333e-7,0.00002543242,0.00035385],"genre_scores_gemma":[0.9836685,0.00001439597,0.01605337,0.00003920131,0.0001998245,0.000001626079,0.000001970241,0.000008082934,0.00001300432],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.6532166,"threshold_uncertainty_score":0.4720593,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2141336296","doi":"10.1016/j.jsc.2006.02.001","title":"Normal forms for general polynomial matrices","year":2006,"lang":"en","type":"article","venue":"Journal of Symbolic Computation","topic":"Polynomial and algebraic computation","field":"Computer Science","cited_by":54,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo","funders":"","keywords":"Mathematics; Matrix polynomial; Polynomial matrix; Matrix (chemical analysis); Computation; Hermite polynomials; Polynomial; Algebra over a field; Pure mathematics; Discrete mathematics; Mathematical analysis; Algorithm","retraction":null,"screen_n_in":null,"score":{"opus":0.00823453275827883,"gpt":0.2427618850814545,"spread":0.2345273523231757,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003443812,0.0001275683,0.0002304472,0.0002943764,0.0001278289,0.0001979119,0.0003896689,0.00005176197,0.000002572202],"category_scores_gemma":[0.00001659639,0.000108047,0.0001858253,0.0002877727,0.00001991044,0.0009000746,0.00005794697,0.0000968637,0.000006170816],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00007214507,"about_ca_system_score_gemma":0.000140693,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00004356142,"about_ca_topic_score_gemma":0.000004718558,"domain_scores_codex":[0.9986709,0.00003103412,0.0006250764,0.0001478043,0.0002933581,0.0002318748],"domain_scores_gemma":[0.998861,0.0001320208,0.0005843709,0.00008734908,0.0002605912,0.00007471743],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0002310455,0.0004753151,0.001687707,0.00009219979,0.0001134336,0.0000358616,0.0008833878,0.1203159,0.007889332,0.1580258,0.03406359,0.6761864],"study_design_scores_gemma":[0.004341712,0.0009883968,0.07465571,0.00006705306,0.0000600053,0.0005956263,0.00003602673,0.7592385,0.004752984,0.1424357,0.01228189,0.0005463607],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.4086049,0.0001072045,0.5897468,0.0004911907,0.0005540074,0.00009553596,0.0000016548,0.0000289025,0.0003697882],"genre_scores_gemma":[0.9165027,0.000003804409,0.08179879,0.000118268,0.001464313,0.000003293715,0.000006308324,0.000008503993,0.00009403583],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.67564,"threshold_uncertainty_score":0.4406031,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1949239131","doi":"10.1016/j.jsc.2015.11.008","title":"Quantifier elimination by cylindrical algebraic decomposition based on regular chains","year":2015,"lang":"en","type":"article","venue":"Journal of Symbolic Computation","topic":"Cancer Treatment and Pharmacology","field":"Medicine","cited_by":54,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Western University","funders":"National Natural Science Foundation of China","keywords":"Quantifier elimination; Mathematics; Maple; Algebraic number; Decomposition; Tree (set theory); Algebra over a field; Quantifier (linguistics); Algorithm; Discrete mathematics; Combinatorics; Pure mathematics; Computer science; Mathematical analysis; Artificial intelligence","retraction":null,"screen_n_in":null,"score":{"opus":0.0341643223409559,"gpt":0.3701513871499987,"spread":0.3359870648090428,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003098859,0.00009885137,0.000233231,0.0002483987,0.0000369352,0.00001626983,0.0000386072,0.00007071532,0.00003165505],"category_scores_gemma":[0.00004056587,0.00008375417,0.00009600916,0.000175545,0.00002423769,0.00008828763,0.000005030664,0.000157772,0.0000164556],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002840848,"about_ca_system_score_gemma":0.0001703109,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000006568188,"about_ca_topic_score_gemma":9.214281e-7,"domain_scores_codex":[0.998977,0.00008953016,0.0003389592,0.0001030932,0.0003813274,0.0001100659],"domain_scores_gemma":[0.9990577,0.00009106468,0.0002700154,0.00005790381,0.0003503274,0.0001730061],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.01786125,0.01284751,0.01532235,0.000293839,0.001042529,0.000804635,0.006423521,0.07636541,0.1095394,0.003034906,0.3707628,0.3857019],"study_design_scores_gemma":[0.03875921,0.01821223,0.1281442,0.0005632039,0.00134726,0.001137082,0.0004106656,0.76218,0.03333377,0.002794324,0.01257105,0.0005469849],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9503353,0.0002233808,0.0382979,0.009486201,0.000613987,0.0002059175,0.000003483733,0.00002061285,0.0008132385],"genre_scores_gemma":[0.9972821,0.00001390038,0.001192404,0.000892517,0.0003921564,0.00000317186,0.00008059756,0.00001224323,0.0001309501],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.6858146,"threshold_uncertainty_score":0.3415396,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2052784918","doi":"10.1016/j.jsc.2010.08.010","title":"High-precision numerical integration: Progress and challenges","year":2010,"lang":"en","type":"article","venue":"Journal of Symbolic Computation","topic":"Numerical Methods and Algorithms","field":"Computer Science","cited_by":52,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Dalhousie University","funders":"Lawrence Berkeley National Laboratory","keywords":"Realm; Field (mathematics); Mathematics; Relation (database); Numerical integration; Integer (computer science); Computer science; Programming language; Data mining; Pure mathematics; Mathematical analysis","retraction":null,"screen_n_in":null,"score":{"opus":0.02511251533703866,"gpt":0.3043765023234904,"spread":0.2792639869864517,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005818615,0.00009379549,0.0002189127,0.0001298997,0.00006486347,0.0001369761,0.0002700129,0.00005513301,0.000004142503],"category_scores_gemma":[0.0001051603,0.00006771559,0.00005101712,0.0002035419,0.00004526713,0.0004700767,0.00007877683,0.0003014482,0.000003208879],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001079063,"about_ca_system_score_gemma":0.00003373979,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000002634058,"about_ca_topic_score_gemma":4.12169e-7,"domain_scores_codex":[0.9989802,0.00009895761,0.0003486542,0.0001496876,0.0003094763,0.0001130666],"domain_scores_gemma":[0.998996,0.0002161249,0.0002958168,0.0001124466,0.0002553074,0.0001243239],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000005659767,0.00005152784,0.00004629798,0.000005321399,0.000007245719,0.000009382822,0.0003863168,0.00003626934,0.0005732533,0.01925799,0.00003026921,0.9795905],"study_design_scores_gemma":[0.00204257,0.00195843,0.1634451,0.000210394,0.00004141723,0.001901914,0.0002643041,0.4959918,0.003879369,0.3220931,0.007577416,0.0005941779],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.07222649,0.0007762958,0.9194981,0.006136496,0.001229664,0.00005673805,2.032614e-7,0.00002458618,0.00005143764],"genre_scores_gemma":[0.5043555,0.0001295232,0.4952069,0.00003746525,0.0002635839,9.250837e-7,1.61281e-7,0.000003409111,0.000002501127],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9789963,"threshold_uncertainty_score":0.2761362,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1985924702","doi":"10.1016/j.jsc.2013.03.004","title":"On the complexity of the generalized MinRank problem","year":2013,"lang":"en","type":"article","venue":"Journal of Symbolic Computation","topic":"Polynomial and algebraic computation","field":"Computer Science","cited_by":50,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Western University","funders":"Institut Universitaire de France; Agence Nationale de la Recherche","keywords":"Mathematics; Rank (graph theory); Bounded function; Computational complexity theory; Polynomial; Matrix (chemical analysis); Ideal (ethics); Variety (cybernetics); Discrete mathematics; Representation (politics); Algebraic number; Algebra over a field; Combinatorics; Algorithm; Pure mathematics","retraction":null,"screen_n_in":null,"score":{"opus":0.03037903373116636,"gpt":0.2429758271014958,"spread":0.2125967933703294,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004102688,0.0001040771,0.0001973205,0.00009114642,0.0001371105,0.0001054729,0.0007709799,0.00003010888,0.00002280854],"category_scores_gemma":[0.00005813143,0.0000532591,0.0001623643,0.0003854126,0.0001317153,0.0002904693,0.0001162145,0.0001753669,0.00001652636],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003862498,"about_ca_system_score_gemma":0.00009972056,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00006374175,"about_ca_topic_score_gemma":0.000002967516,"domain_scores_codex":[0.9985676,0.0002178915,0.0005281632,0.0001065004,0.0004448037,0.0001350465],"domain_scores_gemma":[0.9984328,0.0002702275,0.0007111525,0.0002012599,0.0003340994,0.00005047831],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00003428792,0.0003421118,0.0003731811,0.00004131619,0.0001305631,0.000002727587,0.00449102,0.04050757,0.009175975,0.7666699,0.01826059,0.1599708],"study_design_scores_gemma":[0.0007391523,0.000202729,0.06841884,0.0001043933,0.00001549451,0.00006598722,0.00004465551,0.2350729,0.00284083,0.6921653,0.0002094197,0.0001202953],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.7919084,0.00004684626,0.1917768,0.0149485,0.0004932842,0.0002713638,6.656947e-7,0.00001474045,0.0005393491],"genre_scores_gemma":[0.9896519,0.000002856498,0.009543744,0.0006412314,0.0001152661,0.000003657365,3.673686e-7,0.000004686955,0.00003624659],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.1977435,"threshold_uncertainty_score":0.2171843,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2069447786","doi":"10.1016/j.jsc.2015.03.002","title":"Ancilla-free synthesis of large reversible functions using binary decision diagrams","year":2015,"lang":"en","type":"article","venue":"Journal of Symbolic Computation","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":49,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of New Brunswick","funders":"","keywords":"Binary decision diagram; Mathematics; Binary number; Exponential function; Function (biology); Boolean function; Algorithm; Theoretical computer science; Discrete mathematics; Computer science; Arithmetic","retraction":null,"screen_n_in":null,"score":{"opus":0.02452229376098022,"gpt":0.2777579480126667,"spread":0.2532356542516865,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001074878,0.0001272518,0.0003192821,0.0004068875,0.0001196918,0.00006817338,0.0005959174,0.00006071164,0.000002372601],"category_scores_gemma":[0.0004513258,0.000107028,0.000156404,0.0007373324,0.00002972132,0.0003826634,0.0002634278,0.0001911801,0.000004259078],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00009041403,"about_ca_system_score_gemma":0.000255117,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001703789,"about_ca_topic_score_gemma":0.000002259403,"domain_scores_codex":[0.9983202,0.0001236795,0.0005732781,0.0001674116,0.0006091296,0.0002063395],"domain_scores_gemma":[0.9979191,0.0003860492,0.000620983,0.0002887445,0.0006178406,0.0001673204],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00006889483,0.0003219932,0.002117548,0.00004314797,0.0000910815,0.00007044795,0.002413364,0.7261953,0.001358789,0.0008512735,0.005458418,0.2610098],"study_design_scores_gemma":[0.0008030425,0.000298083,0.005896478,0.0002677259,0.00003410883,0.0003359554,0.0001807316,0.981699,0.000447404,0.009470105,0.0004291034,0.0001381967],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.4692227,0.000209138,0.5296212,0.0002063938,0.0006320766,0.00003845409,0.00000243333,0.00001836089,0.00004928634],"genre_scores_gemma":[0.8152104,0.000008542929,0.1845099,0.00003937173,0.0002164593,3.421495e-7,5.83148e-7,0.000008145551,0.000006263949],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.3459877,"threshold_uncertainty_score":0.4364475,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2113737071","doi":"10.1016/j.jsc.2010.08.014","title":"Sparse polynomial division using a heap","year":2010,"lang":"en","type":"article","venue":"Journal of Symbolic Computation","topic":"Polynomial and algebraic computation","field":"Computer Science","cited_by":43,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Simon Fraser University","funders":"","keywords":"Heap (data structure); Mathematics; Maple; Multiplication (music); Polynomial; Division (mathematics); Discrete mathematics; Algebra over a field; Arithmetic; Combinatorics; Algorithm; Pure mathematics","retraction":null,"screen_n_in":null,"score":{"opus":0.01838944544608744,"gpt":0.2752023028350068,"spread":0.2568128573889193,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005235607,0.0001384988,0.0002495077,0.0003445836,0.000139698,0.0002071658,0.0004756513,0.00007264173,0.000009447673],"category_scores_gemma":[0.00007278803,0.0001225858,0.0001433964,0.0003914647,0.00003757773,0.0008833705,0.000130524,0.0003583176,0.00001507481],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004976,"about_ca_system_score_gemma":0.0002327801,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0000299148,"about_ca_topic_score_gemma":0.000005184831,"domain_scores_codex":[0.9985465,0.00006791501,0.0005839236,0.0001778951,0.000411685,0.0002120303],"domain_scores_gemma":[0.9987164,0.0001280453,0.0005660254,0.0001599599,0.0002647746,0.0001648055],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00005542994,0.0003367007,0.00202855,0.00002473345,0.00006845852,0.00007992882,0.002698833,0.0363419,0.1605852,0.007094346,0.0017608,0.7889251],"study_design_scores_gemma":[0.001356418,0.0002692117,0.04273853,0.00006837377,0.00002379081,0.0008026509,0.00003359344,0.9370119,0.003798684,0.01226407,0.001336905,0.0002958615],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.5532261,0.00002598672,0.4445142,0.0003957184,0.001676406,0.00004776698,3.578184e-7,0.00002537298,0.00008809919],"genre_scores_gemma":[0.9323375,0.000002292889,0.06682325,0.0001340699,0.0006816214,3.927914e-7,8.720567e-7,0.000008668497,0.00001129704],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.90067,"threshold_uncertainty_score":0.4998905,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2091909596","doi":"10.1016/j.jsc.2010.08.016","title":"The modpn library: Bringing fast polynomial arithmetic into Maple","year":2010,"lang":"en","type":"article","venue":"Journal of Symbolic Computation","topic":"Polynomial and algebraic computation","field":"Computer Science","cited_by":43,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Western University","funders":"","keywords":"Mathematics; Maple; Arithmetic; Polynomial; Algebra over a field; Pure mathematics; Botany","retraction":null,"screen_n_in":null,"score":{"opus":0.004614438534023594,"gpt":0.2208467436048269,"spread":0.2162323050708033,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004825607,0.0001413534,0.0001995199,0.0002325386,0.0003635894,0.0006787822,0.0008493257,0.00005725052,0.000006607061],"category_scores_gemma":[0.00007395373,0.000104416,0.0001372645,0.0004320559,0.00006732361,0.001146847,0.0002150299,0.0004425383,0.00002023179],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002955343,"about_ca_system_score_gemma":0.0002282025,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002399239,"about_ca_topic_score_gemma":0.00001003657,"domain_scores_codex":[0.9985572,0.00007651762,0.0005631523,0.0001734936,0.0003837202,0.0002459189],"domain_scores_gemma":[0.9986888,0.0003313624,0.000493974,0.0002007946,0.0001362859,0.0001487881],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00003173848,0.00007606184,0.0005303634,0.0000123735,0.00005924069,0.00002344653,0.002354663,0.004976442,0.006147496,0.01533109,0.004269067,0.966188],"study_design_scores_gemma":[0.001207409,0.0002493839,0.03224809,0.00006258507,0.00002944133,0.0005957472,0.0001432555,0.8809308,0.002919468,0.0659555,0.01530896,0.0003493587],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.5674108,0.0001262323,0.4239327,0.005197717,0.002571483,0.00009107451,4.409168e-7,0.00007201613,0.0005975449],"genre_scores_gemma":[0.9656706,0.00001413524,0.03305209,0.0001834667,0.000955386,0.000001585386,0.000001222677,0.00001269549,0.0001088073],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.9658387,"threshold_uncertainty_score":0.6545513,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2067539682","doi":"10.1016/j.jsc.2011.09.006","title":"Triangular <mml:math xmlns:mml=\"http://www.w3.org/1998/Math/MathML\" altimg=\"si1.gif\" display=\"inline\" overflow=\"scroll\"><mml:mi>x</mml:mi></mml:math>-basis decompositions and derandomization of linear algebra algorithms over <mml:math xmlns:mml=\"http://www.w3.org/1998/Math/MathML\" altimg=\"si2.gif\" display=\"inline\" overflow=\"scroll\"><mml:mstyle mathvariant=\"sans-serif\"><mml:mi>K</mml:mi></mml:mstyle><mml:mrow><mml:mo>[</mml:mo><mml:mi>x</mml:mi><mml:mo>]</mml:mo></mml:mrow></mml:math>","year":2011,"lang":"lv","type":"article","venue":"Journal of Symbolic Computation","topic":"Polynomial and algebraic computation","field":"Computer Science","cited_by":42,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo","funders":"","keywords":"Mathematics; Invertible matrix; Degree (music); Basis (linear algebra); Factorization; Polynomial; Prime (order theory); Discrete mathematics; Algorithm; Finite field; Linearization; Linear system; Combinatorics; Pure mathematics; Mathematical analysis; Geometry; Nonlinear system","retraction":null,"screen_n_in":null,"score":{"opus":0.01625062571401865,"gpt":0.2422754805109378,"spread":0.2260248547969192,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow","sts","scholarly_communication","research_integrity","insufficient_payload"],"consensus_categories":["metaepi_narrow","research_integrity","insufficient_payload"],"category_scores_codex":[0.003793648,0.001661953,0.001081185,0.00126172,0.002861266,0.002513412,0.002904068,0.002719057,0.003902915],"category_scores_gemma":[0.001576751,0.002581222,0.002964879,0.002174974,0.001684765,0.00391468,0.002323275,0.002563317,0.001113153],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00007584286,"about_ca_system_score_gemma":0.002604523,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002126091,"about_ca_topic_score_gemma":0.0005621093,"domain_scores_codex":[0.9852237,0.0009205938,0.004490413,0.002582205,0.003975775,0.002807368],"domain_scores_gemma":[0.9870728,0.002550938,0.005836201,0.002136035,0.0006981498,0.001705861],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.003729499,0.001255341,0.00002608693,0.001367385,0.002787421,0.001414121,0.005835537,0.02043319,0.003453271,0.93825,0.01137619,0.01007197],"study_design_scores_gemma":[0.007004858,0.002820833,0.0004391531,0.002183665,0.00246775,0.003398367,0.001331758,0.8362557,0.1387685,0.002346484,0.001009208,0.001973694],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9443234,0.001795862,0.04016437,0.0009740086,0.004348319,0.0001921253,0.0005079276,0.0003658551,0.007328153],"genre_scores_gemma":[0.9711466,0.001693832,0.01881488,0.001825304,0.003846119,0.0005829233,0.001199472,0.0007971805,0.00009363017],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.9359035,"threshold_uncertainty_score":0.9997378,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1991713476","doi":"10.1016/j.jsc.2013.04.004","title":"Rank-profile revealing Gaussian elimination and the CUP matrix decomposition","year":2013,"lang":"en","type":"article","venue":"Journal of Symbolic Computation","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":41,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo","funders":"","keywords":"Gaussian elimination; Mathematics; Matrix (chemical analysis); Block matrix; Rank (graph theory); Algorithm; Matrix decomposition; Gaussian; Inverse; Computation; Transformation (genetics); Matrix multiplication; Transformation matrix; Block (permutation group theory); Algebra over a field; Combinatorics; Pure mathematics; Geometry","retraction":null,"screen_n_in":null,"score":{"opus":0.006337541460843982,"gpt":0.2679057101270298,"spread":0.2615681686661858,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001036098,0.00009199101,0.0001848775,0.0001573895,0.0001803201,0.0003177527,0.0002659244,0.00003796407,0.00001651265],"category_scores_gemma":[0.00004769646,0.00006022201,0.00007305199,0.0002264133,0.00005166048,0.0009708257,0.00005783961,0.00015562,0.0000191993],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002837088,"about_ca_system_score_gemma":0.00003019504,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001381417,"about_ca_topic_score_gemma":2.288203e-7,"domain_scores_codex":[0.9988288,0.0002401633,0.0004346409,0.0001105877,0.0002641689,0.000121611],"domain_scores_gemma":[0.9988294,0.000286207,0.0004564273,0.0001072502,0.000255174,0.00006556815],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0001065253,0.00009944732,0.0001119106,0.00008411652,0.00008149964,0.00001534559,0.006508714,0.005641271,0.00259133,0.3808855,0.001587953,0.6022863],"study_design_scores_gemma":[0.00246913,0.0001398472,0.01418647,0.000120494,0.00003624312,0.0005793549,0.0002367191,0.7975472,0.0009303605,0.1834688,0.000124278,0.0001611535],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2212242,0.0003248141,0.7713694,0.006043769,0.0003685231,0.0002124013,3.090944e-7,0.00002427995,0.0004323577],"genre_scores_gemma":[0.953478,0.00004646808,0.04603628,0.0001492422,0.0002284004,0.000004620212,0.000001235481,0.000005091253,0.00005063236],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.7919059,"threshold_uncertainty_score":0.3064097,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2162009465","doi":"10.1016/s0747-7171(03)00090-7","title":"Factoring systems of linear PDEs with finite-dimensional solution spaces","year":2003,"lang":"en","type":"article","venue":"Journal of Symbolic Computation","topic":"Polynomial and algebraic computation","field":"Computer Science","cited_by":40,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo","funders":"","keywords":"Mathematics; Dimension (graph theory); Finite set; Partial differential equation; Rational function; Space (punctuation); Linear system; Function (biology); Finite difference; Mathematical analysis; Applied mathematics; Pure mathematics","retraction":null,"screen_n_in":null,"score":{"opus":0.01902480920046189,"gpt":0.2428876335570685,"spread":0.2238628243566066,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004321556,0.0001193798,0.0002677545,0.0002648199,0.00009015974,0.00007473467,0.0001909156,0.0000422923,0.000002163722],"category_scores_gemma":[0.00007654562,0.00009247439,0.00007238241,0.0003730249,0.00003288518,0.0005520225,0.00002950326,0.0001295481,0.000003497747],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00005580979,"about_ca_system_score_gemma":0.0001991052,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00003116383,"about_ca_topic_score_gemma":0.000001364202,"domain_scores_codex":[0.998611,0.0001124257,0.0005148362,0.0001351557,0.0004738156,0.0001527327],"domain_scores_gemma":[0.9983767,0.0002719705,0.0007309918,0.00009696411,0.0004393736,0.00008400529],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00006124783,0.000208743,0.002772588,0.00009443499,0.0001241677,0.00002608107,0.002896731,0.9518083,0.008041468,0.02042103,0.0001151106,0.01343014],"study_design_scores_gemma":[0.001599341,0.0009193957,0.01363648,0.0004405955,0.00004223172,0.0004520945,0.0001856452,0.972802,0.005898257,0.003166063,0.0005607427,0.0002971228],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.4140593,0.0001984044,0.5850149,0.0001097116,0.000480609,0.00005693664,5.418951e-7,0.00001536991,0.00006416905],"genre_scores_gemma":[0.9688421,0.000005202378,0.03097646,0.00002052326,0.0001290083,8.319338e-7,0.000001109671,0.00000646236,0.00001834016],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.5547827,"threshold_uncertainty_score":0.3770996,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1968315351","doi":"10.1006/jsco.2001.0456","title":"Commutative Algebra in the Mizar System","year":2001,"lang":"en","type":"article","venue":"Journal of Symbolic Computation","topic":"Polynomial and algebraic computation","field":"Computer Science","cited_by":39,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Alberta","funders":"","keywords":"Generalization; Mathematics; Algebra over a field; Formal power series; Power series; Commutative property; Algebraic number; Basis (linear algebra); Discrete mathematics; Pure mathematics; Geometry","retraction":null,"screen_n_in":null,"score":{"opus":0.01556430286456721,"gpt":0.2565066795700707,"spread":0.2409423767055035,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009972849,0.0001173166,0.000232537,0.0002944911,0.0001033589,0.000171295,0.0007547817,0.0000387478,0.000001961627],"category_scores_gemma":[0.00004012846,0.00008134198,0.00009922743,0.0007947786,0.00003006586,0.0006020733,0.00006288532,0.0002412489,0.00001788718],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001113921,"about_ca_system_score_gemma":0.00009846913,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00004292494,"about_ca_topic_score_gemma":0.000007947647,"domain_scores_codex":[0.9983257,0.0003350437,0.000595991,0.0001269172,0.0004331462,0.0001832096],"domain_scores_gemma":[0.9987435,0.0003977594,0.0004662207,0.00014972,0.0001858305,0.00005690715],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0001434998,0.0006937239,0.00375512,0.00009856371,0.0001389913,0.001140076,0.07044483,0.09509101,0.0005372268,0.1889195,0.004285599,0.6347519],"study_design_scores_gemma":[0.002858407,0.0006099672,0.1532905,0.0003535259,0.00003551144,0.004757464,0.004808592,0.7777073,0.0001524125,0.05314739,0.001883898,0.0003949836],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.4693558,0.0001982043,0.5270564,0.002045436,0.0003910876,0.0001092605,2.954305e-7,0.00002646167,0.0008170664],"genre_scores_gemma":[0.9936966,0.00001553972,0.005714235,0.0003454099,0.0002116982,0.000002611224,0.000001172497,0.000005163117,0.000007554205],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.6826164,"threshold_uncertainty_score":0.331703,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2000760108","doi":"10.1016/j.jsc.2011.12.009","title":"Efficient algorithms for order basis computation","year":2011,"lang":"en","type":"article","venue":"Journal of Symbolic Computation","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":35,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo","funders":"","keywords":"Mathematics; Basis (linear algebra); Order (exchange); Degree (music); Computation; Algorithm; Matrix (chemical analysis); Row; Field (mathematics); Exponent; Matrix multiplication; Normal basis; Row and column spaces; Combinatorics; Discrete mathematics; Computer science; Pure mathematics; Geometry; Galois theory","retraction":null,"screen_n_in":null,"score":{"opus":0.04028607635485304,"gpt":0.2782715342282155,"spread":0.2379854578733624,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007737046,0.0001181691,0.0002092834,0.0003758604,0.0001317997,0.00007666201,0.0003602827,0.00004710852,0.000007378446],"category_scores_gemma":[0.00005304448,0.0001056467,0.0001728524,0.0006050514,0.00003347585,0.0002008281,0.00004863898,0.000107863,0.000006055114],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003381978,"about_ca_system_score_gemma":0.0000761643,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000003997842,"about_ca_topic_score_gemma":4.558307e-7,"domain_scores_codex":[0.9988165,0.00008610889,0.0004753822,0.000164307,0.0002803295,0.0001773883],"domain_scores_gemma":[0.998447,0.0001942845,0.0004609257,0.0001103831,0.0006948595,0.00009252498],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0001600936,0.0006946112,0.0003829032,0.00005867708,0.0001699976,0.00001932459,0.01252235,0.08564477,0.0004851657,0.08035469,0.000951783,0.8185557],"study_design_scores_gemma":[0.001311558,0.0006723223,0.0088296,0.00006268983,0.00004446555,0.0001336197,0.0001962613,0.8973155,0.0007455114,0.09023398,0.0002459445,0.000208546],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1181038,0.00007041769,0.8803029,0.000167823,0.000768618,0.0001385962,0.000001110666,0.00004381157,0.0004029104],"genre_scores_gemma":[0.7078949,0.000002630841,0.2918818,0.00009266323,0.000112039,0.000003151029,0.000001032794,0.000006898528,0.000004944547],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8183471,"threshold_uncertainty_score":0.4308149,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2080563392","doi":"10.1006/jsco.2001.0508","title":"The Riccati Equation in Mathematical Finance","year":2002,"lang":"en","type":"article","venue":"Journal of Symbolic Computation","topic":"Stochastic processes and financial applications","field":"Economics, Econometrics and Finance","cited_by":35,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo","funders":"","keywords":"Class (philosophy); Mathematics; Riccati equation; Computation; Mathematical finance; Linkage (software); Differential equation; Ordinary differential equation; Differential (mechanical device); Algebra over a field; Finance; Applied mathematics; Computer science; Pure mathematics; Algorithm; Mathematical analysis; Artificial intelligence","retraction":null,"screen_n_in":null,"score":{"opus":0.04762609303254539,"gpt":0.2392678023261504,"spread":0.191641709293605,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004125367,0.00005751416,0.0001713829,0.0001187104,0.0000893671,0.00004493552,0.0001426003,0.00003541921,0.00001466374],"category_scores_gemma":[0.0002267932,0.00004933576,0.0000519576,0.0003214294,0.00002986882,0.0001329384,0.00001274366,0.0001161074,0.0001577856],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00006056502,"about_ca_system_score_gemma":0.00001019478,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000006945176,"about_ca_topic_score_gemma":0.000002349025,"domain_scores_codex":[0.9990447,0.00000423469,0.0007068038,0.00008266829,0.00004911367,0.0001124561],"domain_scores_gemma":[0.9990762,0.0001656074,0.0005863572,0.00007714525,0.00007264967,0.0000220724],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.000004010634,0.00008816955,0.0004197271,0.000007634639,0.000005847533,0.000001075312,0.0007191773,0.001757407,0.000003463534,0.9644318,0.0002345107,0.03232721],"study_design_scores_gemma":[0.0002753363,0.00004150403,0.01944149,0.00002127633,0.000002226788,0.00001739971,0.00004604812,0.151573,0.000003553361,0.8258809,0.002636651,0.00006057776],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.03579567,0.00221042,0.9551957,0.002253682,0.0001570781,0.0001022686,0.000002555427,0.000004941343,0.00427769],"genre_scores_gemma":[0.9958209,0.0002256686,0.003715751,0.00006455235,0.00009877641,0.000009415048,5.703012e-7,0.0000062643,0.00005807555],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9600253,"threshold_uncertainty_score":0.2028068,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2079533520","doi":"10.1016/j.jsc.2003.07.004","title":"Certified dense linear system solving","year":2003,"lang":"en","type":"article","venue":"Journal of Symbolic Computation","topic":"Polynomial and algebraic computation","field":"Computer Science","cited_by":33,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo","funders":"","keywords":"Mathematics; Diophantine equation; Ring (chemistry); Ideal (ethics); Certificate; Domain (mathematical analysis); System of linear equations; Ring of integers; Linear system; Discrete mathematics; Integral domain; Field (mathematics); Algebra over a field; Algebraic number field; Algorithm; Pure mathematics; Mathematical analysis","retraction":null,"screen_n_in":null,"score":{"opus":0.01910865744391746,"gpt":0.247866008538078,"spread":0.2287573510941605,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006499715,0.0001239521,0.0002465408,0.0002558156,0.0001248517,0.000134287,0.0003148265,0.00005008127,0.000003332539],"category_scores_gemma":[0.0001037282,0.0001096445,0.000126046,0.0003987099,0.00001751646,0.0005436548,0.00004173544,0.0001646255,0.00002978241],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001205462,"about_ca_system_score_gemma":0.0001847751,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000006328711,"about_ca_topic_score_gemma":7.980245e-7,"domain_scores_codex":[0.9984913,0.000167914,0.000616322,0.0001588456,0.0003690335,0.0001966143],"domain_scores_gemma":[0.9987076,0.000168293,0.0005302372,0.000135228,0.0003293061,0.0001293454],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00008654217,0.0004620863,0.001177311,0.0002841483,0.0002884053,0.0004299162,0.009444751,0.2227793,0.01381825,0.3470782,0.003497653,0.4006534],"study_design_scores_gemma":[0.001788128,0.0003417229,0.007272997,0.0002877727,0.00004556681,0.002164927,0.000381779,0.9648959,0.005159974,0.0151722,0.002075511,0.0004135177],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2676811,0.0001493782,0.7298938,0.0002276529,0.001098112,0.00006350917,2.012999e-7,0.00005764997,0.0008286082],"genre_scores_gemma":[0.9597533,0.000004377804,0.03988504,0.00008733183,0.0002288476,9.090129e-7,5.028677e-7,0.000008165362,0.00003155855],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.7421166,"threshold_uncertainty_score":0.4471171,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2094689345","doi":"10.1016/j.jsc.2015.03.007","title":"Algorithms to compute the topological Euler characteristic, Chern–Schwartz–MacPherson class and Segre class of projective varieties","year":2015,"lang":"en","type":"article","venue":"Journal of Symbolic Computation","topic":"Polynomial and algebraic computation","field":"Computer Science","cited_by":32,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"Western University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Hypersurface; Projective space; Chern class; Class (philosophy); Euler's formula; Euler characteristic; Characteristic class; Algorithm; Pure mathematics; Variety (cybernetics); Projective test; Mathematical analysis; Artificial intelligence; Computer science","retraction":null,"screen_n_in":null,"score":{"opus":0.03570938565556282,"gpt":0.2803582581094652,"spread":0.2446488724539024,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008430334,0.0001767997,0.0003874853,0.0001757638,0.0001068966,0.00016685,0.0004567189,0.00008018456,0.000002373164],"category_scores_gemma":[0.0001567296,0.0001201801,0.0000895355,0.000428339,0.0001085096,0.0004294219,0.0002373559,0.0002695557,0.00000595234],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00009264563,"about_ca_system_score_gemma":0.0002286385,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00004626835,"about_ca_topic_score_gemma":0.000004112755,"domain_scores_codex":[0.9982094,0.0002322798,0.0005973243,0.0002273737,0.000521304,0.0002123576],"domain_scores_gemma":[0.9980564,0.0003339261,0.0005936847,0.0001450486,0.0006705369,0.0002003863],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0004349715,0.0005770723,0.002401066,0.00009273273,0.0003584829,0.00008741811,0.06822309,0.02428544,0.002471795,0.039131,0.005009704,0.8569272],"study_design_scores_gemma":[0.002342729,0.002648032,0.1562815,0.0001556101,0.00008036393,0.0007480693,0.001950652,0.7932158,0.001162019,0.0368122,0.004102014,0.0005009504],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.4376559,0.0001070586,0.5576546,0.003366721,0.0008463619,0.0001800773,0.000002247963,0.00002630917,0.0001606974],"genre_scores_gemma":[0.9778137,0.000008496922,0.02131382,0.000347468,0.0004719871,0.000003680092,0.000001698255,0.000008285107,0.00003092158],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.8564263,"threshold_uncertainty_score":0.4900802,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2052338752","doi":"10.1016/j.jsc.2008.04.019","title":"Fast arithmetic for triangular sets: From theory to practice","year":2008,"lang":"en","type":"article","venue":"Journal of Symbolic Computation","topic":"Polynomial and algebraic computation","field":"Computer Science","cited_by":32,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Western University","funders":"","keywords":"Mathematics; Quicksort; Modular arithmetic; Arithmetic; Euclidean algorithm; Division (mathematics); Multiplication (music); Axiom; Univariate; Dimension (graph theory); Euclidean geometry; Algebra over a field; Discrete mathematics; sort; Cryptography; Algorithm; Sorting algorithm; Pure mathematics; Combinatorics","retraction":null,"screen_n_in":null,"score":{"opus":0.01841519542273096,"gpt":0.2825801867988816,"spread":0.2641649913761507,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007551954,0.0001303381,0.000277595,0.0002730543,0.0001574804,0.0001050195,0.0004351945,0.00004823755,0.00000413111],"category_scores_gemma":[0.0005713591,0.0001171162,0.0001460199,0.00039093,0.00002373059,0.0008153442,0.0000730497,0.0001342398,0.00002309975],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00008216538,"about_ca_system_score_gemma":0.000205786,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001750534,"about_ca_topic_score_gemma":9.964156e-7,"domain_scores_codex":[0.9984829,0.0001818279,0.0005665894,0.0002036069,0.0003793077,0.0001857635],"domain_scores_gemma":[0.9974474,0.001216552,0.0005145445,0.0001480942,0.0005086508,0.0001648008],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000299531,0.0002545154,0.00003790766,0.00001157005,0.0001411308,0.00008007885,0.009819806,0.02690546,0.001200569,0.009712437,0.004861261,0.9466757],"study_design_scores_gemma":[0.008816617,0.002801041,0.02455063,0.0002917623,0.0002506604,0.002482363,0.001082759,0.486334,0.003844456,0.4224063,0.04607443,0.001064995],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.09482001,0.0002098571,0.9004629,0.003080412,0.001067258,0.0002153592,0.000004449503,0.00003675287,0.0001030434],"genre_scores_gemma":[0.5604175,0.00001254222,0.4377432,0.001233398,0.0005196041,0.000005786126,0.000004662328,0.00001110523,0.00005214741],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9456108,"threshold_uncertainty_score":0.4775859,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2152724910","doi":"10.1016/j.jsc.2010.06.021","title":"On the De Boer–Pellikaan method for computing minimum distance","year":2010,"lang":"en","type":"article","venue":"Journal of Symbolic Computation","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":31,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Western University","funders":"","keywords":"Mathematics; Connection (principal bundle); Ideal (ethics); Code (set theory); Projective test; Minimum distance; Discrete mathematics; Algebra over a field; Arithmetic; Pure mathematics; Combinatorics; Geometry; Law; Computer science; Programming language","retraction":null,"screen_n_in":null,"score":{"opus":0.01318206969507329,"gpt":0.2990532433500757,"spread":0.2858711736550024,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002108347,0.0001033996,0.000166206,0.0001388944,0.0002275763,0.0001681415,0.0006343459,0.00004517448,0.000004385831],"category_scores_gemma":[0.0002007303,0.00007281495,0.0001793355,0.0003059669,0.00003697823,0.0001651962,0.00004442277,0.0003258294,0.000002561744],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002061355,"about_ca_system_score_gemma":0.00006188465,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000001388623,"about_ca_topic_score_gemma":0.000002659174,"domain_scores_codex":[0.9989519,0.0001554714,0.0003384329,0.0001366261,0.0002245879,0.0001930526],"domain_scores_gemma":[0.9971783,0.001943137,0.0004094824,0.0001836882,0.0002099439,0.00007542814],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00005167789,0.0000880208,0.0001245698,0.0000136887,0.00003705621,0.000004410465,0.002489174,0.007255419,0.004029102,0.814887,0.001089312,0.1699305],"study_design_scores_gemma":[0.0003525237,0.0002155555,0.001707968,0.00004066925,0.00001420699,0.00009537649,0.0000826227,0.5935428,0.00105254,0.4014671,0.001327776,0.0001009111],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1544068,0.00002491814,0.8425112,0.001956746,0.0006866947,0.0001013004,5.825163e-7,0.00002373098,0.0002879483],"genre_scores_gemma":[0.7757107,0.000001420383,0.2235655,0.0004645289,0.000242843,0.000001374353,2.907596e-7,0.000006093473,0.000007278765],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.6213039,"threshold_uncertainty_score":0.2969308,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1941702124","doi":"10.1016/j.jsc.2015.11.005","title":"Faster sparse multivariate polynomial interpolation of straight-line programs","year":2015,"lang":"en","type":"article","venue":"Journal of Symbolic Computation","topic":"Polynomial and algebraic computation","field":"Computer Science","cited_by":31,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo","funders":"National Science Foundation of Sri Lanka; Natural Sciences and Engineering Research Council of Canada; National Science Foundation","keywords":"Mathematics; Interpolation (computer graphics); Polynomial; Function (biology); Polynomial interpolation; Field (mathematics); Representation (politics); Multivariate statistics; Finite field; Applied mathematics; Degree (music); Line (geometry); Birkhoff interpolation; Algorithm; Mathematical optimization; Discrete mathematics; Algebra over a field; Linear interpolation; Pure mathematics; Mathematical analysis; Geometry; Computer science; Statistics; Artificial intelligence","retraction":null,"screen_n_in":null,"score":{"opus":0.046147414931284,"gpt":0.2875589054670081,"spread":0.2414114905357241,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006279638,0.0001492694,0.0003270324,0.0003312666,0.00003611338,0.0001094361,0.0004038182,0.00006502824,0.000004957592],"category_scores_gemma":[0.00007038454,0.0001269433,0.0001331447,0.0003996944,0.00004168789,0.0009026727,0.0001095251,0.0001683999,0.000009697589],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00007350859,"about_ca_system_score_gemma":0.000256037,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00004081614,"about_ca_topic_score_gemma":0.000005523237,"domain_scores_codex":[0.9981576,0.000127814,0.0008821534,0.0001683009,0.0004817819,0.000182408],"domain_scores_gemma":[0.9979759,0.00008117231,0.001008352,0.0001369744,0.0006153668,0.0001821711],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0002810272,0.0006593216,0.001282128,0.0000453674,0.0001420526,0.00002908621,0.01112443,0.03009872,0.009363861,0.00434792,0.001244119,0.941382],"study_design_scores_gemma":[0.00349677,0.001480543,0.01653438,0.0001986941,0.00004344104,0.0002328171,0.0002444052,0.9639815,0.00242348,0.01050153,0.0005791533,0.0002832576],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3887144,0.00005328961,0.6095178,0.0004013455,0.0008901237,0.0001138395,9.140113e-7,0.00002662748,0.0002816803],"genre_scores_gemma":[0.9459107,0.000001766739,0.05357723,0.00004794126,0.000410226,0.000001216677,0.000005317754,0.000008713913,0.00003689023],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9410987,"threshold_uncertainty_score":0.5176598,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2023200896","doi":"10.1006/jsco.2001.0493","title":"Factoring Polynomials Over Local Fields","year":2001,"lang":"en","type":"article","venue":"Journal of Symbolic Computation","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":29,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Concordia University","funders":"","keywords":"Mathematics; Factoring; Divisor (algebraic geometry); Prime factor; Irreducible polynomial; Basis (linear algebra); Prime (order theory); Factorization of polynomials; Polynomial; Greatest common divisor; Discrete mathematics; Combinatorics; Algebra over a field; Pure mathematics; Matrix polynomial; Mathematical analysis","retraction":null,"screen_n_in":null,"score":{"opus":0.01535870478672349,"gpt":0.266425918010283,"spread":0.2510672132235596,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003639246,0.00008107452,0.0001590722,0.0002270767,0.00007140453,0.0001053966,0.000334969,0.00004624152,0.00002105037],"category_scores_gemma":[0.00002088251,0.00007168444,0.0001276099,0.0003352456,0.00002226363,0.0004920725,0.00005520006,0.0001531271,0.000006779364],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003261105,"about_ca_system_score_gemma":0.0000418771,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000007390172,"about_ca_topic_score_gemma":0.000001081459,"domain_scores_codex":[0.9991388,0.00005877562,0.0003277074,0.00009792591,0.0002390724,0.0001376967],"domain_scores_gemma":[0.999321,0.0001355039,0.0002442798,0.0001111222,0.0001070201,0.00008109245],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"observational","study_design_scores_codex":[0.00007567707,0.0001455708,0.005942963,0.00001399911,0.00008815379,0.0001143507,0.004362948,0.01815801,0.001318626,0.03772902,0.001009432,0.9310412],"study_design_scores_gemma":[0.005305768,0.002241018,0.3427258,0.0005083045,0.0001192836,0.003011057,0.00076017,0.258529,0.005791423,0.3393726,0.04030277,0.00133277],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3721622,0.00007645747,0.6264761,0.0003344578,0.0004876057,0.00002032854,9.686021e-8,0.00002029971,0.000422433],"genre_scores_gemma":[0.995354,0.00002168533,0.00409814,0.0002201954,0.0002804675,3.563382e-7,1.909487e-7,0.00000402054,0.00002092655],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9297085,"threshold_uncertainty_score":0.2923207,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2088713140","doi":"10.1016/j.jsc.2012.05.008","title":"On the complexity of computing with zero-dimensional triangular sets","year":2012,"lang":"en","type":"article","venue":"Journal of Symbolic Computation","topic":"Polynomial and algebraic computation","field":"Computer Science","cited_by":29,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Western University","funders":"Agence Nationale de la Recherche","keywords":"Mathematics; Modular design; Degree (music); Dimension (graph theory); Inverse; Zero (linguistics); Las vegas; Field (mathematics); Algebraic number; Computation; Finite field; Set (abstract data type); Discrete mathematics; Algorithm; Combinatorics; Pure mathematics; Computer science","retraction":null,"screen_n_in":null,"score":{"opus":0.03761755709077252,"gpt":0.2682194969239669,"spread":0.2306019398331944,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000991598,0.0001395651,0.0002894087,0.0001834976,0.0001442574,0.00005268009,0.0003939047,0.00003596513,0.000007459572],"category_scores_gemma":[0.0000691842,0.00008526184,0.0001128804,0.0004118767,0.0001303868,0.0004053037,0.00008930827,0.0002139476,0.000008278716],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00005208956,"about_ca_system_score_gemma":0.0001084545,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001054267,"about_ca_topic_score_gemma":5.977621e-7,"domain_scores_codex":[0.9982944,0.0002043579,0.0005492032,0.0001164613,0.000609589,0.0002259835],"domain_scores_gemma":[0.9980109,0.0005876872,0.0008303512,0.0001584461,0.0002985088,0.0001140914],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0003692749,0.001244871,0.00212666,0.00007462643,0.0003915663,0.00002841106,0.01228858,0.1762193,0.003158739,0.6202857,0.004634327,0.1791778],"study_design_scores_gemma":[0.00355246,0.001552655,0.208925,0.0005072457,0.00008488681,0.000896884,0.0002033094,0.6154872,0.0059358,0.1621951,0.0001565467,0.0005029395],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.6033478,0.00006372345,0.3949239,0.001111055,0.0003259214,0.00008745116,7.848908e-7,0.00001470429,0.0001245871],"genre_scores_gemma":[0.9765868,8.691401e-7,0.02290961,0.0003224266,0.000166058,4.973762e-7,0.000001668291,0.000007298899,0.000004784595],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.4580907,"threshold_uncertainty_score":0.3476877,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2159212455","doi":"10.1016/j.jsc.2009.09.004","title":"Computing differential characteristic sets by change of ordering","year":2009,"lang":"en","type":"article","venue":"Journal of Symbolic Computation","topic":"Polynomial and algebraic computation","field":"Computer Science","cited_by":26,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Western University","funders":"","keywords":"Mathematics; Prime (order theory); Ideal (ethics); Set (abstract data type); Differential (mechanical device); Ranking (information retrieval); Prime ideal; Software; Algorithm; Discrete mathematics; Algebra over a field; Combinatorics; Pure mathematics; Computer science; Programming language; Artificial intelligence","retraction":null,"screen_n_in":null,"score":{"opus":0.01833505952676392,"gpt":0.2645680777233865,"spread":0.2462330181966225,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002302997,0.0001372336,0.0003373111,0.0002301704,0.00007222802,0.00008895458,0.0003828701,0.00004595422,0.000003420518],"category_scores_gemma":[0.00003123891,0.0001269881,0.0001101047,0.0003167444,0.00001978173,0.0005428861,0.00004870538,0.0001542145,0.000002361407],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0000442102,"about_ca_system_score_gemma":0.00005090365,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001015067,"about_ca_topic_score_gemma":3.027681e-7,"domain_scores_codex":[0.9985552,0.00007021384,0.00067572,0.0001504782,0.000358159,0.0001901946],"domain_scores_gemma":[0.9986305,0.00009597625,0.000850804,0.0001028845,0.0002237824,0.00009607062],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0000213883,0.0001795043,0.0002163148,0.00002679273,0.00002771527,0.00001078063,0.002485592,0.0006968837,0.01721721,0.001220459,0.0002812881,0.9776161],"study_design_scores_gemma":[0.001597098,0.0009074832,0.4075631,0.0003175061,0.00003770574,0.0001939453,0.00004846892,0.5766801,0.003481498,0.00868301,0.000140937,0.0003491189],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.5290903,0.00009403274,0.4697827,0.0004881507,0.0004205893,0.0000603187,0.000001127181,0.00002179335,0.00004099297],"genre_scores_gemma":[0.9930903,0.0000136126,0.006412782,0.0001673825,0.0003025999,3.606112e-7,0.000005113058,0.000004596284,0.000003223921],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.977267,"threshold_uncertainty_score":0.5178423,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2473648675","doi":"10.1016/j.jsc.2016.07.004","title":"On the arithmetic complexity of Strassen-like matrix multiplications","year":2016,"lang":"en","type":"article","venue":"Journal of Symbolic Computation","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":26,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo","funders":"","keywords":"Strassen algorithm; Mathematics; Matrix multiplication; Arithmetic; Dimension (graph theory); Multiplication (music); Matrix (chemical analysis); Combinatorics; Discrete mathematics","retraction":null,"screen_n_in":null,"score":{"opus":0.02303596275619531,"gpt":0.2515946496593419,"spread":0.2285586869031466,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003536899,0.00007227629,0.000153289,0.0001151997,0.00004120145,0.00001189732,0.0001280786,0.00003039629,0.00002100444],"category_scores_gemma":[0.00004004415,0.00004049507,0.0000865598,0.0001432639,0.00006481545,0.00007142455,0.000006240924,0.00008794626,0.00001383258],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002971613,"about_ca_system_score_gemma":0.00001267911,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000002290394,"about_ca_topic_score_gemma":0.000001501709,"domain_scores_codex":[0.9992451,0.00007440407,0.0003807179,0.00004537584,0.0001731042,0.00008126427],"domain_scores_gemma":[0.9991189,0.0004245452,0.0001903296,0.0001050847,0.0001241165,0.00003705812],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0001225752,0.0003956531,0.001776231,0.000244209,0.0005856917,0.000009230612,0.002811303,0.1723874,0.1976008,0.5680021,0.005349363,0.0507155],"study_design_scores_gemma":[0.003892463,0.0007227904,0.1974546,0.001595403,0.0002049652,0.0004256174,0.001186813,0.1379562,0.02309039,0.6313129,0.001522225,0.0006356847],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.8861207,0.00008414781,0.1125314,0.0004036819,0.0003156156,0.00009989955,0.000007361853,0.000023474,0.0004137368],"genre_scores_gemma":[0.9994198,0.00001357774,0.000458423,0.00001221129,0.00006664261,0.000002044765,5.607286e-7,0.00000931787,0.00001743339],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.1956784,"threshold_uncertainty_score":0.1651341,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2064146303","doi":"10.1006/jsco.2002.0558","title":"Computing Modular Invariants of p-groups","year":2002,"lang":"en","type":"article","venue":"Journal of Symbolic Computation","topic":"Geometric and Algebraic Topology","field":"Mathematics","cited_by":25,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"Royal Military College of Canada","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Modular design; Algebra over a field; Pure mathematics; Programming language; Computer science","retraction":null,"screen_n_in":null,"score":{"opus":0.06246193144298696,"gpt":0.3037447393709523,"spread":0.2412828079279654,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004534197,0.00008426859,0.0003481869,0.000355267,0.00003983795,0.00001115737,0.000133679,0.00005943903,0.0001091856],"category_scores_gemma":[0.0004068695,0.00007368947,0.0001027824,0.000396277,0.00003901986,0.00009887802,0.00003225632,0.0001538487,0.000009190912],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002704543,"about_ca_system_score_gemma":0.00001666144,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000004234592,"about_ca_topic_score_gemma":3.819798e-7,"domain_scores_codex":[0.9987547,0.00007762245,0.0006865163,0.00007254013,0.0002777119,0.0001309242],"domain_scores_gemma":[0.9983746,0.0004059541,0.0008395163,0.00007865278,0.0002451268,0.00005618963],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0001229449,0.003573136,0.01780674,0.0009849195,0.001266278,0.000316162,0.02962125,0.03304052,0.007277437,0.3831975,0.02706928,0.4957239],"study_design_scores_gemma":[0.004213629,0.0009883193,0.06465962,0.0003682683,0.0002404228,0.001462408,0.001925655,0.2282471,0.001161489,0.6959792,0.0003384908,0.0004153142],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.8252532,0.0001886573,0.1731168,0.0002265899,0.000257471,0.00005262527,6.490554e-7,0.000009551145,0.000894333],"genre_scores_gemma":[0.9822174,0.00001662006,0.0174867,0.0000330499,0.0001936314,1.293649e-7,4.049328e-7,0.000009765821,0.00004228675],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.4953085,"threshold_uncertainty_score":0.3004969,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2010426631","doi":"10.1016/s0747-7171(02)00104-9","title":"A database of categories","year":2003,"lang":"en","type":"article","venue":"Journal of Symbolic Computation","topic":"Logic, programming, and type systems","field":"Computer Science","cited_by":25,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Mount Allison University; University of Waterloo","funders":"","keywords":"Functor; Mathematics; Computation; Set (abstract data type); Functor category; Programming language; Algebra over a field; Theoretical computer science; Database; Computer science; Pure mathematics; Algorithm","retraction":null,"screen_n_in":null,"score":{"opus":0.02543372123129081,"gpt":0.2721982775063541,"spread":0.2467645562750633,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005896064,0.00006701633,0.000187339,0.0001426396,0.00003897838,0.00005465816,0.0002442415,0.00002712132,0.000004075569],"category_scores_gemma":[0.00008394225,0.00005279775,0.00006678639,0.0002838672,0.00002641453,0.0003859322,0.00002751054,0.00008288032,0.000006092139],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002159195,"about_ca_system_score_gemma":0.0001292498,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001971348,"about_ca_topic_score_gemma":0.000002119092,"domain_scores_codex":[0.9990238,0.00009870242,0.0004119457,0.00008387733,0.0002764415,0.0001052458],"domain_scores_gemma":[0.9989388,0.00006835073,0.0004919347,0.0001292612,0.0003135133,0.0000581665],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.000009099842,0.0001712708,0.002592667,0.00008834494,0.00005934996,0.00004030259,0.004005747,0.001229954,0.001401945,0.9503473,0.0008880186,0.03916602],"study_design_scores_gemma":[0.006178142,0.002738829,0.02375207,0.0001737248,0.0001716488,0.004385576,0.002640701,0.05287419,0.03502779,0.8213844,0.04953909,0.001133893],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.03490109,0.0004754655,0.9622609,0.00007779415,0.0006762157,0.00006002841,2.103831e-7,0.00001387483,0.001534448],"genre_scores_gemma":[0.9843814,0.00001503553,0.0154717,0.00002520229,0.00007028874,6.332684e-7,7.415014e-7,0.000003424669,0.00003162831],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9494802,"threshold_uncertainty_score":0.215303,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2115204962","doi":"10.1016/j.jsc.2007.10.013","title":"Solving polynomial systems via symbolic-numeric reduction to geometric involutive form","year":2008,"lang":"en","type":"article","venue":"Journal of Symbolic Computation","topic":"Numerical Methods and Algorithms","field":"Computer Science","cited_by":25,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Western University","funders":"National Science Foundation","keywords":"Mathematics; Reduction (mathematics); Polynomial; Algebra over a field; Symbolic computation; Applied mathematics; Partial differential equation; Pure mathematics; Mathematical analysis; Geometry","retraction":null,"screen_n_in":null,"score":{"opus":0.02541430265687869,"gpt":0.2776046259435531,"spread":0.2521903232866744,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000738538,0.0002028144,0.0005242404,0.001105159,0.0002737743,0.000178952,0.0005420709,0.00007862508,0.000002619078],"category_scores_gemma":[0.0001403641,0.0001796245,0.000176822,0.002561539,0.00004221344,0.001174042,0.000137849,0.0002989791,0.0000297738],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0003033348,"about_ca_system_score_gemma":0.0001869054,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001450499,"about_ca_topic_score_gemma":2.914777e-7,"domain_scores_codex":[0.9975989,0.0001963204,0.0008694197,0.0002861211,0.0006796285,0.0003695551],"domain_scores_gemma":[0.9980246,0.0001960519,0.0007441947,0.0001983371,0.0005168854,0.0003199675],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0000639167,0.0002966872,0.0005982714,0.00004475472,0.0001359466,0.0001097633,0.006247193,0.03770155,0.007743105,0.0006048185,0.002920797,0.9435332],"study_design_scores_gemma":[0.002721372,0.003301112,0.1187305,0.0003770113,0.0001034324,0.01523157,0.001106186,0.8434122,0.003743579,0.006257996,0.003638085,0.001376969],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2293707,0.0003525489,0.7671174,0.0003255874,0.002491149,0.0001733374,6.364293e-7,0.00004737555,0.0001211934],"genre_scores_gemma":[0.810269,0.00004418839,0.1885153,0.00008796631,0.001017369,0.000004784175,6.751465e-7,0.00001474438,0.00004597038],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9421563,"threshold_uncertainty_score":0.7324874,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2078168416","doi":"10.1006/jsco.2002.0554","title":"Computing Rational Forms of Integer Matrices","year":2002,"lang":"en","type":"article","venue":"Journal of Symbolic Computation","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":24,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Integer (computer science); Las vegas; Integer matrix; Matrix (chemical analysis); Combinatorics; Transformation (genetics); Discrete mathematics; Algebra over a field; Pure mathematics; Symmetric matrix; Nonnegative matrix; Computer science; Eigenvalues and eigenvectors","retraction":null,"screen_n_in":null,"score":{"opus":0.01025179214575504,"gpt":0.2123527566134181,"spread":0.2021009644676631,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002594681,0.00006710092,0.0001756421,0.0001926451,0.0000272258,0.00001770948,0.00007711197,0.00003343794,0.00003753078],"category_scores_gemma":[0.00001360014,0.00005679239,0.00008409645,0.0001835713,0.00001497385,0.0001821847,0.000006232923,0.0001032695,0.000008469849],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002221615,"about_ca_system_score_gemma":0.000004906236,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":6.021233e-7,"about_ca_topic_score_gemma":2.241044e-7,"domain_scores_codex":[0.9991993,0.00002633488,0.0004800706,0.00003540409,0.0001812137,0.00007765223],"domain_scores_gemma":[0.9994903,0.00008845339,0.0002240084,0.00003574165,0.0001274907,0.00003399267],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00001897096,0.00009127212,0.002021896,0.000276381,0.0001987018,0.00001019604,0.005224134,0.9111633,0.005817017,0.01217188,0.002308919,0.06069737],"study_design_scores_gemma":[0.0007404726,0.0001314479,0.007579332,0.0002647796,0.00003616705,0.0002952657,0.0005824753,0.9767398,0.001776661,0.01126746,0.0004287701,0.0001573261],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.885042,0.0007086206,0.1115282,0.00002267121,0.0003705324,0.0000429392,0.000001102085,0.00002231364,0.002261573],"genre_scores_gemma":[0.9990341,0.00002551259,0.0007521532,0.000008273995,0.0001607044,2.440422e-7,0.000001088807,0.000008305487,0.00000962567],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.1139921,"threshold_uncertainty_score":0.2315927,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2096301867","doi":"10.1016/s0747-7171(03)00021-x","title":"A matching pursuit technique for computing the simplest normal forms of vector fields","year":2003,"lang":"en","type":"article","venue":"Journal of Symbolic Computation","topic":"Numerical methods for differential equations","field":"Mathematics","cited_by":23,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"Western University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Matching pursuit; Matching (statistics); Algebraic number; Computation; Simple (philosophy); Vector field; Singularity; Symbolic computation; Algebra over a field; Applied mathematics; Algorithm; Mathematical analysis; Pure mathematics","retraction":null,"screen_n_in":null,"score":{"opus":0.05768186154231249,"gpt":0.3778721621319647,"spread":0.3201903005896522,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001417194,0.000102834,0.0003111539,0.0001162372,0.0001243811,0.00003454709,0.0001824224,0.00006379427,0.0000106736],"category_scores_gemma":[0.0008544304,0.00006935028,0.0001997108,0.000201917,0.00003256918,0.0001143288,0.00002459788,0.0002105176,4.410732e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004264139,"about_ca_system_score_gemma":0.00007159093,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000006677107,"about_ca_topic_score_gemma":0.000004426608,"domain_scores_codex":[0.998594,0.0001559909,0.0007398744,0.00007181073,0.0002830949,0.0001552593],"domain_scores_gemma":[0.9966533,0.002005361,0.0008872143,0.00009932398,0.0003082331,0.0000465399],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0001836816,0.0008558664,0.0005719837,0.0009668877,0.0005018901,0.000005532191,0.01345791,0.0146636,0.05468126,0.7486471,0.0004474761,0.1650168],"study_design_scores_gemma":[0.0005045504,0.0002617452,0.0008548394,0.000121703,0.00009535533,0.0000893602,0.0005047857,0.00280204,0.01012191,0.984443,0.000104724,0.00009600756],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2405156,0.0000149147,0.7586725,0.000190816,0.0001645116,0.0003163184,0.000002420845,0.000009245979,0.0001136518],"genre_scores_gemma":[0.6966421,0.000001348818,0.3032293,0.00002693133,0.00007553358,0.000005675703,9.049446e-7,0.00001225284,0.000005945021],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.4561265,"threshold_uncertainty_score":0.2828023,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2072653231","doi":"10.1016/j.jsc.2003.08.010","title":"Telescoping in the context of symbolic summation in Maple","year":2004,"lang":"en","type":"article","venue":"Journal of Symbolic Computation","topic":"Polynomial and algebraic computation","field":"Computer Science","cited_by":22,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo; McMaster University","funders":"","keywords":"Maple; Telescoping series; Mathematics; Context (archaeology); Symbolic computation; Algebra over a field; Pure mathematics; Mathematical analysis","retraction":null,"screen_n_in":null,"score":{"opus":0.01468669866679896,"gpt":0.2572742615947869,"spread":0.242587562927988,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008638013,0.0001018482,0.0002621316,0.0004825486,0.00003799882,0.00007075956,0.0004770342,0.0000441379,0.000001098444],"category_scores_gemma":[0.00006716903,0.00007970756,0.00007757433,0.0007835699,0.00002984858,0.0005934447,0.0000462248,0.0002030807,0.000003941977],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001280983,"about_ca_system_score_gemma":0.0001944368,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001805379,"about_ca_topic_score_gemma":0.0001029665,"domain_scores_codex":[0.9983994,0.0001418941,0.0007985992,0.0001224704,0.0003767115,0.0001609672],"domain_scores_gemma":[0.998975,0.0001994017,0.0005323035,0.0001183645,0.0001406334,0.00003432047],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"observational","study_design_scores_codex":[0.00007372431,0.0006883341,0.005926576,0.0001393036,0.00004402648,0.00008972848,0.06671057,0.2427407,0.004425788,0.1039087,0.0001395489,0.5751131],"study_design_scores_gemma":[0.008094141,0.0007993762,0.5917804,0.001581973,0.00002757984,0.0005185333,0.004113388,0.1598703,0.006148266,0.2263326,0.0002347421,0.0004987553],"study_design_candidate":"observational","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.788112,0.0001643037,0.2095804,0.001654295,0.0002340933,0.000139001,3.913079e-7,0.000008352637,0.0001071281],"genre_scores_gemma":[0.995409,0.00002081805,0.004241595,0.000222373,0.00009642599,0.000002275061,0.000001565667,0.000004420879,0.000001507768],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.5858538,"threshold_uncertainty_score":0.325038,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1976312168","doi":"10.1006/jsco.1999.0308","title":"Efficient Decomposition of Associative Algebras over Finite Fields","year":2000,"lang":"en","type":"article","venue":"Journal of Symbolic Computation","topic":"Advanced Topics in Algebra","field":"Mathematics","cited_by":21,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Western University; University of Calgary","funders":"","keywords":"Mathematics; Central simple algebra; Associative property; Simple (philosophy); Finite field; Associative algebra; Isomorphism (crystallography); Polynomial; Commutative property; Division algebra; Set (abstract data type); Algebra representation; Basis (linear algebra); Algebra over a field; Field (mathematics); Pure mathematics; Discrete mathematics; Computer science","retraction":null,"screen_n_in":null,"score":{"opus":0.02079291340912201,"gpt":0.342340366931968,"spread":0.321547453522846,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003149464,0.00009461477,0.0002813964,0.0001250159,0.00004508206,0.00001306279,0.0001012497,0.00007503516,0.0002220722],"category_scores_gemma":[0.0002096208,0.00008730117,0.0001262125,0.0001724974,0.00002857476,0.00007627967,0.000014478,0.0001982668,0.000007255793],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00009963338,"about_ca_system_score_gemma":0.00004061267,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000002416616,"about_ca_topic_score_gemma":0.000001356174,"domain_scores_codex":[0.9987358,0.00008485347,0.0006189296,0.00007860478,0.0003690469,0.0001127962],"domain_scores_gemma":[0.9981554,0.0007725651,0.000692467,0.00008035268,0.0002540104,0.0000451646],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0005984351,0.00263739,0.003576835,0.0004100623,0.0009591918,0.00008996562,0.02958987,0.4049955,0.002782699,0.1926462,0.003946769,0.3577671],"study_design_scores_gemma":[0.001541466,0.0003502452,0.01982356,0.0002735371,0.0001120351,0.00004898908,0.0001667606,0.05999932,0.001963211,0.9154154,0.0001184705,0.00018701],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.848031,0.00004669019,0.1503218,0.0001339539,0.0001581371,0.00008135012,0.000002882163,0.00001093978,0.001213285],"genre_scores_gemma":[0.9704674,0.00001371204,0.02919649,0.00006692973,0.0001607644,8.481056e-7,0.0000017438,0.00001142797,0.00008069898],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.7227692,"threshold_uncertainty_score":0.3560038,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W151084626","doi":"10.1016/j.jsc.2015.11.020","title":"Reducing complexes in multidimensional persistent homology theory","year":2016,"lang":"en","type":"article","venue":"Journal of Symbolic Computation","topic":"Topological and Geometric Data Analysis","field":"Computer Science","cited_by":21,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"Université de Sherbrooke; Bishop's University","funders":"Natural Sciences and Engineering Research Council of Canada; Gruppo Nazionale per le Strutture Algebriche, Geometriche e le loro Applicazioni; Istituto Nazionale di Alta Matematica \"Francesco Severi\"","keywords":"Mathematics; Persistent homology; Homology (biology); Algebra over a field; Pure mathematics; Combinatorics; Discrete mathematics; Algorithm","retraction":null,"screen_n_in":null,"score":{"opus":0.02001049779912141,"gpt":0.2652907886841481,"spread":0.2452802908850267,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008237395,0.00007860667,0.0002399373,0.0005886906,0.00004734876,0.00002408257,0.0003339162,0.00003984783,0.00003806635],"category_scores_gemma":[0.0002310032,0.00004559961,0.000145791,0.0006056569,0.00005932826,0.000345471,0.000117397,0.00009496113,0.00001811739],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00007169887,"about_ca_system_score_gemma":0.00005567817,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001998526,"about_ca_topic_score_gemma":0.000001818731,"domain_scores_codex":[0.9987776,0.000201432,0.0004485477,0.0001570892,0.0002570864,0.0001581946],"domain_scores_gemma":[0.9987553,0.0005970779,0.0002946221,0.000115882,0.0001642519,0.00007282027],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"observational","study_design_scores_codex":[0.00009142553,0.000532057,0.005729152,0.00001162889,0.0002051798,0.0002117057,0.001561734,0.01745985,0.009656413,0.1379075,0.001572609,0.8250607],"study_design_scores_gemma":[0.00548377,0.001751475,0.6687589,0.0004065499,0.0001255612,0.002164435,0.000656023,0.08311403,0.001333193,0.2326763,0.002810938,0.0007188467],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.4806163,0.0002578884,0.5167513,0.002066276,0.0001918266,0.00002580406,0.00000125349,0.000009664624,0.00007958536],"genre_scores_gemma":[0.9777695,0.00003153686,0.02195239,0.0001214307,0.00006759846,5.622177e-7,8.115555e-7,0.000002243718,0.00005394149],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.8243419,"threshold_uncertainty_score":0.1859498,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1992772797","doi":"10.1016/j.jsc.2006.03.004","title":"Simplicial cycles and the computation of simplicial trees","year":2006,"lang":"en","type":"article","venue":"Journal of Symbolic Computation","topic":"Commutative Algebra and Its Applications","field":"Mathematics","cited_by":19,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Dalhousie University","funders":"","keywords":"Simplicial homology; Simplicial complex; Mathematics; Abstract simplicial complex; Simplicial approximation theorem; Simplicial manifold; h-vector; Combinatorics; Simplicial set; Tree (set theory); Betti number; Discrete mathematics; Pure mathematics; Homotopy","retraction":null,"screen_n_in":null,"score":{"opus":0.0236624495714388,"gpt":0.3210769085585581,"spread":0.2974144589871193,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005120295,0.0001124836,0.0003515847,0.0001473644,0.0001366463,0.00004103102,0.0001237867,0.00004407679,0.00000473506],"category_scores_gemma":[0.0001264769,0.00007803895,0.0001166702,0.0002259305,0.0001883183,0.000130572,0.00003809237,0.0001357528,0.000001135513],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002657604,"about_ca_system_score_gemma":0.00004728071,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00007523633,"about_ca_topic_score_gemma":0.00005452762,"domain_scores_codex":[0.9986203,0.0001431188,0.0007654973,0.00008488385,0.000282181,0.0001039717],"domain_scores_gemma":[0.9974962,0.001127628,0.0008987011,0.0000804129,0.000365223,0.0000318536],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0004845164,0.0005573519,0.004218307,0.0001242556,0.000231477,0.000003678994,0.006613138,0.01134054,0.004512086,0.8614379,0.004703864,0.1057729],"study_design_scores_gemma":[0.001964369,0.00009906214,0.117065,0.00004798335,0.0001303636,0.00006122403,0.0004273003,0.01264398,0.0004385347,0.866949,0.00008035553,0.00009281487],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.8576516,0.0002068669,0.1402104,0.0010838,0.00006129572,0.000205637,0.000004194259,0.00001243391,0.0005638201],"genre_scores_gemma":[0.9955897,0.00001569001,0.004012055,0.00004203125,0.0003123496,0.000003671454,0.000003476348,0.00001271176,0.000008351599],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.1379381,"threshold_uncertainty_score":0.3182336,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2017958871","doi":"10.1016/j.jsc.2008.05.007","title":"Dynamic balancing of planar mechanisms using toric geometry","year":2009,"lang":"en","type":"article","venue":"Journal of Symbolic Computation","topic":"Polynomial and algebraic computation","field":"Computer Science","cited_by":17,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Université Laval","funders":"","keywords":"Mathematics; Planar; Base (topology); Kinematics; Polynomial; Factorization; Toric variety; Laurent polynomial; Algebraic number; Geometry; Pure mathematics; Computer science; Mathematical analysis; Algorithm","retraction":null,"screen_n_in":null,"score":{"opus":0.01028872064767116,"gpt":0.2546143466665517,"spread":0.2443256260188806,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004165759,0.0001153748,0.0002944045,0.0004783223,0.00006646571,0.0000589215,0.0003578565,0.00004947611,0.000002169241],"category_scores_gemma":[0.00003665089,0.0001066544,0.0001159777,0.0006466141,0.00001160162,0.0005444214,0.00003046833,0.0001368557,0.000002094899],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000125832,"about_ca_system_score_gemma":0.0001338826,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0000107612,"about_ca_topic_score_gemma":6.497722e-7,"domain_scores_codex":[0.9986025,0.0000574392,0.0006218474,0.0001353217,0.0004134482,0.0001694193],"domain_scores_gemma":[0.9987317,0.00009061109,0.0007513485,0.0001108804,0.0002303981,0.00008511695],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00006016781,0.0003416152,0.0002193264,0.00006396779,0.0001054011,0.00007797183,0.002725295,0.1541804,0.1442245,0.05314342,0.0001900901,0.6446678],"study_design_scores_gemma":[0.0006538258,0.0004679622,0.02611588,0.000133702,0.0000259948,0.000358707,0.00005934658,0.8255695,0.00220072,0.1442323,0.00001582518,0.000166225],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3954254,0.0001137565,0.6037305,0.0001931635,0.0004470303,0.00003803513,4.378786e-7,0.00001595051,0.00003571887],"genre_scores_gemma":[0.8544229,0.000007151842,0.145377,0.000101574,0.00008149591,1.022777e-7,9.758213e-7,0.00000417073,0.000004624153],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.6713892,"threshold_uncertainty_score":0.4349239,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2095236488","doi":"10.1006/jsco.2001.0510","title":"Identities for the Associator in Alternative Algebras","year":2002,"lang":"en","type":"article","venue":"Journal of Symbolic Computation","topic":"Advanced Topics in Algebra","field":"Mathematics","cited_by":17,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Saskatchewan","funders":"Iowa State University","keywords":"Mathematics; Subalgebra; Ternary operation; Algebra over a field; Cellular algebra; Basis (linear algebra); Pure mathematics; Quaternion algebra; Degree (music); Product (mathematics); Identity (music); Algebra representation; Universal enveloping algebra; Filtered algebra; Clifford algebra; Symmetric algebra; Division algebra; Computer science; Geometry","retraction":null,"screen_n_in":null,"score":{"opus":0.07562860651438333,"gpt":0.3546564342942524,"spread":0.279027827779869,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004347035,0.00007320238,0.0001873947,0.0001149858,0.00006115269,0.00003676438,0.0001614433,0.00003373205,0.00003065031],"category_scores_gemma":[0.0007503083,0.00005382339,0.00009249451,0.0001157358,0.00002829419,0.0001991244,0.00002010751,0.0001632139,0.000004160488],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001293059,"about_ca_system_score_gemma":0.00001348677,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000001893676,"about_ca_topic_score_gemma":0.00000677666,"domain_scores_codex":[0.9990799,0.0000475534,0.0004413124,0.00005975058,0.0002569355,0.0001145913],"domain_scores_gemma":[0.9976254,0.001548868,0.0005295459,0.00006374824,0.0002093056,0.00002315709],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0000590429,0.0005068411,0.002835034,0.0001563876,0.0004641757,0.00004220023,0.0258534,0.005960669,0.0002382181,0.8823466,0.02071853,0.06081892],"study_design_scores_gemma":[0.0007333714,0.00006009084,0.002343426,0.00005186657,0.0000304977,0.00002957151,0.0004872899,0.01344451,0.0001419546,0.982301,0.0003133962,0.00006300155],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.7142956,0.0005147277,0.2820968,0.001333058,0.0008714289,0.00028964,0.000003438571,0.00001350344,0.0005818182],"genre_scores_gemma":[0.9825908,0.00007392959,0.01641956,0.0001011119,0.000472136,0.000007082161,3.167604e-7,0.00001444544,0.0003206333],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.2682952,"threshold_uncertainty_score":0.2194854,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2015697919","doi":"10.1016/j.jsc.2011.12.016","title":"On simultaneous row and column reduction of higher-order linear differential systems","year":2011,"lang":"en","type":"article","venue":"Journal of Symbolic Computation","topic":"Numerical methods for differential equations","field":"Mathematics","cited_by":17,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo","funders":"","keywords":"Mathematics; Column (typography); Order (exchange); Reduction (mathematics); Computation; Linear system; Differential (mechanical device); Block (permutation group theory); Applied mathematics; Work (physics); Algorithm; Combinatorics; Mathematical analysis; Geometry; Connection (principal bundle)","retraction":null,"screen_n_in":null,"score":{"opus":0.07027741118408987,"gpt":0.3445580831731101,"spread":0.2742806719890202,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002427041,0.000122693,0.0003950276,0.0001923436,0.00005574992,0.00001910998,0.00008483847,0.00008174875,0.0000454091],"category_scores_gemma":[0.0004724686,0.0001041539,0.00008260864,0.0001926149,0.00006194977,0.00009564291,0.00002078315,0.0001842187,0.000002394057],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004480119,"about_ca_system_score_gemma":0.00003200258,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00003475766,"about_ca_topic_score_gemma":8.838016e-7,"domain_scores_codex":[0.9985111,0.0002088546,0.0007110097,0.0001093056,0.0003453782,0.0001143875],"domain_scores_gemma":[0.9978527,0.0006240367,0.000867159,0.00009702429,0.0004731971,0.00008586801],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.004181692,0.009991804,0.001149176,0.002954236,0.002810953,0.0001252037,0.03164884,0.04479999,0.1015849,0.3023324,0.001551129,0.4968697],"study_design_scores_gemma":[0.003813808,0.003658636,0.008631268,0.0008528979,0.0008543858,0.0003963323,0.0008300978,0.139594,0.005100847,0.8355909,0.0001136005,0.0005632062],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.6387227,0.00003567053,0.3601097,0.00003020438,0.0008105887,0.0001452498,0.000002904606,0.00001431011,0.000128694],"genre_scores_gemma":[0.9348425,0.00001055452,0.06480268,0.000004655285,0.0002242482,0.000002097824,0.000001711257,0.00001938479,0.00009218697],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.5332585,"threshold_uncertainty_score":0.4247271,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2040516344","doi":"10.1016/s0747-7171(03)00071-3","title":"Efficient decomposition of separable algebras","year":2003,"lang":"en","type":"article","venue":"Journal of Symbolic Computation","topic":"Polynomial and algebraic computation","field":"Computer Science","cited_by":16,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo; University of Calgary","funders":"","keywords":"Mathematics; Algebra over a field; Factorization of polynomials; Separable space; Polynomial; Generator (circuit theory); Simple (philosophy); Computation; Factorization; Pure mathematics; Matrix polynomial; Algorithm; Power (physics)","retraction":null,"screen_n_in":null,"score":{"opus":0.009798005884001877,"gpt":0.2656074410536992,"spread":0.2558094351696973,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000588547,0.0001093852,0.0002595099,0.0003052652,0.00006986249,0.00005573518,0.0002671907,0.00004239125,0.000008964839],"category_scores_gemma":[0.00006061095,0.00009934609,0.000134673,0.0004951016,0.00002825004,0.0002178268,0.00003346136,0.000115219,0.00001020367],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00006444023,"about_ca_system_score_gemma":0.0001674954,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000005950738,"about_ca_topic_score_gemma":4.684562e-7,"domain_scores_codex":[0.998517,0.0001433922,0.0006544402,0.0001359521,0.0003903254,0.0001589207],"domain_scores_gemma":[0.9985868,0.0001579396,0.0006875352,0.000120474,0.0003532082,0.00009398886],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00004385615,0.0006067848,0.0006553762,0.00006367256,0.0001059795,0.00002727834,0.002658598,0.7372093,0.02310689,0.1415927,0.0008388917,0.09309074],"study_design_scores_gemma":[0.002336819,0.0007190859,0.02852018,0.000213423,0.00005571211,0.0007724552,0.000116162,0.8434196,0.02908586,0.09370326,0.0006776543,0.0003797685],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.4848801,0.0001446069,0.5138308,0.0001145896,0.0004036059,0.00005071819,2.983847e-7,0.00001362737,0.0005616383],"genre_scores_gemma":[0.9573709,0.000005951747,0.04247682,0.00006257019,0.00006415824,7.68722e-7,8.164975e-7,0.000005609701,0.00001237511],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.4724909,"threshold_uncertainty_score":0.4051216,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2911871489","doi":"10.1016/j.jsc.2012.05.010","title":"Generating subfields","year":2012,"lang":"en","type":"article","venue":"Journal of Symbolic Computation","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":15,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo","funders":"Deutsche Forschungsgemeinschaft; National Science Foundation","keywords":"Mathematics; Extension (predicate logic); Factorization; Lattice (music); Set (abstract data type); Unique factorization domain; Implementation; Lattice reduction; Algebra over a field; Degree (music); Discrete mathematics; Combinatorics; Algorithm; Pure mathematics; Computer science","retraction":null,"screen_n_in":null,"score":{"opus":0.01679441896971712,"gpt":0.2626005843204643,"spread":0.2458061653507472,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006865197,0.00005901975,0.0001074234,0.0001594204,0.00007693587,0.00007267253,0.000237997,0.00003018682,0.000007327517],"category_scores_gemma":[0.0000305946,0.00005084401,0.00008808521,0.0002653104,0.00001136316,0.0006880828,0.00004277714,0.0001213781,0.000007331068],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001445927,"about_ca_system_score_gemma":0.00002474729,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":9.711833e-7,"about_ca_topic_score_gemma":1.406271e-7,"domain_scores_codex":[0.9992772,0.00007768927,0.0002610704,0.00005202376,0.0001888409,0.0001431459],"domain_scores_gemma":[0.9993851,0.00009762919,0.0002312752,0.00008341338,0.000115699,0.00008689653],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00001938623,0.0002593335,0.0141897,0.00002355525,0.00008580375,0.000009818832,0.0106195,0.01075681,0.008499434,0.258159,0.002478313,0.6948994],"study_design_scores_gemma":[0.003931229,0.001839749,0.1662225,0.0003864114,0.000167076,0.003812251,0.00140542,0.5356501,0.01598231,0.2524687,0.01654813,0.001586087],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3946599,0.0002315422,0.6038312,0.0002021373,0.0006035636,0.00001551856,4.635472e-8,0.00001632981,0.0004397821],"genre_scores_gemma":[0.9456117,0.000006486068,0.05364577,0.0002107777,0.0005143209,3.636349e-7,1.762022e-7,0.000003008781,0.000007441579],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.6933132,"threshold_uncertainty_score":0.2073359,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null}]}