{"meta":{"page":1,"per_page":50,"max_per_page":100,"total":656,"total_is_capped":false,"direct_labels_cover":1,"predictions_cover":656,"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":"b7be761f8c55","filters":{"topic":"Polynomial and algebraic computation"}},"results":[{"id":"W1495088152","doi":"10.1090/s0894-0347-05-00477-7","title":"Enumerative tropical algebraic geometry in ℝ²","year":2005,"lang":"en","type":"article","venue":"Journal of the American Mathematical Society","topic":"Polynomial and algebraic computation","field":"Computer Science","cited_by":619,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Toronto","funders":"","keywords":"Tropical geometry; Mathematics; Holomorphic function; Geometry; Algebraic geometry; Algebraic number; Polygon (computer graphics); Newton polygon; Algebraic curve; Lattice (music); Combinatorics; Algorithm; Algebra over a field; Discrete mathematics; Pure mathematics; Mathematical analysis; Computer science; Physics","retraction":null,"screen_n_in":null,"score":{"opus":0.009065200825975759,"gpt":0.2514914564355286,"spread":0.2424262556095528,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000356575,0.0001076599,0.0003237451,0.00004117814,0.00006880116,0.00006772293,0.0008457095,0.00002656895,0.0000202564],"category_scores_gemma":[0.0001608489,0.00006362136,0.0003682326,0.0006616076,0.0001845793,0.0002940635,0.0002070616,0.0003571858,0.00002527419],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001373217,"about_ca_system_score_gemma":0.00008820443,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000003096328,"about_ca_topic_score_gemma":0.000001156739,"domain_scores_codex":[0.9986799,0.0001134139,0.0004728362,0.0001210824,0.0003951091,0.0002176023],"domain_scores_gemma":[0.9988374,0.0003340838,0.0004619823,0.0002144325,0.00005624352,0.00009587343],"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.00009468924,0.002622264,0.01152764,0.0001054639,0.0005175016,0.00004060995,0.02533791,0.004065116,0.006847689,0.3400196,0.0267385,0.582083],"study_design_scores_gemma":[0.002236377,0.000722485,0.2490567,0.0002734775,0.00006358294,0.0005871782,0.001049077,0.298692,0.004050918,0.4379079,0.004670104,0.0006901671],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.7032691,0.00005441045,0.283614,0.01269974,0.00009188719,0.00006031112,3.464241e-7,0.00001354452,0.0001967193],"genre_scores_gemma":[0.9050862,0.00001079059,0.09278825,0.001819213,0.0002233049,0.000001372017,3.215827e-8,0.000005131446,0.00006569237],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.5813928,"threshold_uncertainty_score":0.2594404,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2775085189","doi":"10.1007/978-3-032-00906-7","title":"Derivative-Free and Blackbox Optimization","year":2017,"lang":"en","type":"book","venue":"Springer series in operations research/Springer series in operations research and financial engineering","topic":"Polynomial and algebraic computation","field":"Computer Science","cited_by":499,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of British Columbia, Okanagan Campus; Kelowna General Hospital; University of British Columbia; Polytechnique Montréal","funders":"","keywords":"Computer science","retraction":null,"screen_n_in":null,"score":{"opus":0.03377317848854049,"gpt":0.3024417638487448,"spread":0.2686685853602043,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow","sts","scholarly_communication","research_integrity"],"consensus_categories":[],"category_scores_codex":[0.00310507,0.0005987808,0.0007252364,0.002716955,0.00199455,0.003105608,0.002129277,0.000565525,0.00003645918],"category_scores_gemma":[0.003993487,0.0006684707,0.00007157498,0.001199147,0.001153793,0.004385454,0.003937748,0.002784338,0.00001894602],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0007750641,"about_ca_system_score_gemma":0.002018774,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0006931054,"about_ca_topic_score_gemma":0.007749889,"domain_scores_codex":[0.9946867,0.0003199237,0.000949903,0.001427113,0.001218065,0.001398284],"domain_scores_gemma":[0.9964941,0.0003480243,0.00004897033,0.001753777,0.001001386,0.0003537368],"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.00009330282,0.0001445561,0.00009899138,0.0003771863,0.00003952947,0.0001882103,0.004469658,0.440411,0.0005109522,0.5441298,0.0007970393,0.008739782],"study_design_scores_gemma":[0.002222784,0.00118551,0.004808515,0.002134416,0.00001099238,0.0001200758,0.0003634675,0.8963231,0.001125383,0.01250675,0.07702357,0.002175455],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.1526435,0.02644528,0.6410935,0.03499284,0.008048819,0.02189832,0.0007400453,0.002080819,0.1120569],"genre_scores_gemma":[0.2125915,0.03303517,0.3772407,0.0001762668,0.003738045,0.004933781,0.0004924362,0.0006390472,0.367153],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.5316231,"threshold_uncertainty_score":0.9995766,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2090755539","doi":"10.1007/s11511-007-0021-0","title":"Limit shapes and the complex Burgers equation","year":2007,"lang":"en","type":"article","venue":"Acta Mathematica","topic":"Polynomial and algebraic computation","field":"Computer Science","cited_by":253,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":false,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada; David and Lucile Packard Foundation; Institut Henri Poincaré; Centre National de la Recherche Scientifique; Princeton University; National Science Foundation","keywords":"Mathematics; Holomorphic function; Mathematical analysis; Burgers' equation; Boundary (topology); Surface (topology); Limit (mathematics); Lipschitz continuity; Gravitational singularity; Inviscid flow; Partial differential equation; Geometry; Classical mechanics","retraction":null,"screen_n_in":null,"score":{"opus":0.03830614741225011,"gpt":0.256969483843696,"spread":0.2186633364314459,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005393287,0.00007252381,0.000113629,0.00003096237,0.0001072366,0.0001236343,0.0003002775,0.00001951263,0.00001466018],"category_scores_gemma":[0.0001427863,0.0000457334,0.00003259094,0.0001415771,0.0000744538,0.000211156,0.0001273834,0.00005172541,0.0000407891],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000008423985,"about_ca_system_score_gemma":0.000009819672,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000005048829,"about_ca_topic_score_gemma":0.000001405144,"domain_scores_codex":[0.9993556,0.00002725161,0.0001829556,0.0001396825,0.0001547151,0.0001397908],"domain_scores_gemma":[0.9989426,0.0007569198,0.00007991231,0.0001429546,0.00002061723,0.00005706669],"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.00001581402,0.00002538186,0.000009866374,0.00002270839,0.00001644312,0.00000243129,0.003648179,0.000004588144,0.001184432,0.9145865,0.001319318,0.07916427],"study_design_scores_gemma":[0.0007265218,0.00003427454,0.0045034,0.00002125318,0.00001299156,0.00002294106,0.0001057272,0.6593308,0.0005391071,0.3316639,0.002881197,0.0001578024],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.03432183,0.00003162094,0.9444526,0.01537118,0.0000587608,0.0001740466,2.921565e-7,0.00010695,0.005482651],"genre_scores_gemma":[0.9727671,0.000003850853,0.02626491,0.0008594135,0.00005231786,0.000003433601,6.874408e-7,0.000003627093,0.00004467355],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9384453,"threshold_uncertainty_score":0.1864954,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1485445902","doi":"10.1090/conm/465/09104","title":"Tropical curves, their Jacobians and theta functions","year":2008,"lang":"en","type":"other","venue":"Contemporary mathematics - American Mathematical Society","topic":"Polynomial and algebraic computation","field":"Computer Science","cited_by":252,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Toronto","funders":"Natural Sciences and Engineering Research Council of Canada; National Science Foundation","keywords":"Mathematics; Pure mathematics","retraction":null,"screen_n_in":null,"score":{"opus":0.02543554915255691,"gpt":0.2382859733299089,"spread":0.212850424177352,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0002215472,0.0006770538,0.001295647,0.0001058958,0.0002046979,0.0001449998,0.0009933243,0.0002349785,0.0002291643],"category_scores_gemma":[0.0001005747,0.0005236901,0.0005267338,0.0005298413,0.0009322647,0.0001952125,0.0005656078,0.0005121088,0.0002623162],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00006919028,"about_ca_system_score_gemma":0.0002558887,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00005249406,"about_ca_topic_score_gemma":0.000004710486,"domain_scores_codex":[0.9973037,0.00012014,0.0007458536,0.0007979513,0.0005367235,0.0004956569],"domain_scores_gemma":[0.997201,0.0005584274,0.0007118936,0.001114396,0.00005451885,0.0003597986],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","study_design_scores_codex":[0.000001595038,0.0004129964,0.00002028168,0.001130222,0.0002956272,0.0000133061,0.001668426,3.6228e-7,0.00001258356,0.02585974,0.967696,0.002888858],"study_design_scores_gemma":[0.00194545,0.0007484198,0.0002919132,0.006310285,0.0002713794,0.0006853418,0.001818286,0.090713,0.00004208782,0.1619741,0.7312646,0.003935153],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","genre_codex":"methods","genre_gemma":"other","genre_scores_codex":[0.00008982944,0.004256811,0.6171728,0.002297185,0.0001961678,0.0009203678,0.00008835141,0.001231969,0.3737465],"genre_scores_gemma":[0.0122594,0.006231839,0.2790735,0.00470236,0.001073337,0.0003923372,0.0001485808,0.001223657,0.694895],"genre_candidate":"other","genre_consensus":null,"teacher_disagreement_score":0.3380993,"threshold_uncertainty_score":0.9997215,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2897949163","doi":"10.1007/jhep02(2019)139","title":"Feynman integrals and intersection theory","year":2019,"lang":"en","type":"article","venue":"Journal of High Energy Physics","topic":"Polynomial and algebraic computation","field":"Computer Science","cited_by":169,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"Perimeter Institute; University of Waterloo","funders":"Institut Périmètre de physique théorique; Government of Canada; Innovation, Science and Economic Development Canada","keywords":"Pfaffian; Basis (linear algebra); Feynman diagram; Intersection (aeronautics); Feynman integral; Resummation; Order of integration (calculus); Logarithm; Gravitational singularity","retraction":null,"screen_n_in":null,"score":{"opus":0.006157845147717344,"gpt":0.2036365323705605,"spread":0.1974786872228432,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001486455,0.00006609708,0.0001283242,0.00005417565,0.00002659045,0.0000631094,0.0002058686,0.00002139287,0.000004436987],"category_scores_gemma":[0.000006141712,0.0000497811,0.00005526298,0.0001113136,0.00001620112,0.0005226062,0.00007276539,0.0000903215,0.000004663752],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002521799,"about_ca_system_score_gemma":0.00002986821,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001894439,"about_ca_topic_score_gemma":0.000001520614,"domain_scores_codex":[0.999495,0.00005129026,0.0001648014,0.00008674744,0.0001229253,0.00007920976],"domain_scores_gemma":[0.9995231,0.00007353309,0.0001924612,0.00009937678,0.00006752938,0.00004396779],"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.00001112512,0.00001834072,0.00003928469,0.000002196598,0.00001697554,0.000002239459,0.0001514499,0.0002190925,0.0003027831,0.8536845,0.0001253199,0.1454266],"study_design_scores_gemma":[0.0003150025,0.0002353577,0.001540944,0.00003302548,0.000006478233,0.00005429676,0.00002899798,0.003541138,0.006836593,0.9867127,0.0006158039,0.00007968303],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.5208517,0.00004815699,0.4779491,0.0001421591,0.0006609041,0.000008363705,1.250972e-7,0.000009478906,0.0003299894],"genre_scores_gemma":[0.9971645,0.00001468548,0.002127074,0.000213281,0.000258187,2.498889e-7,3.063184e-7,0.000003756317,0.0002179491],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.4763128,"threshold_uncertainty_score":0.2030014,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2954735736","doi":"10.1103/physrevlett.123.201602","title":"Vector Space of Feynman Integrals and Multivariate Intersection Numbers","year":2019,"lang":"en","type":"article","venue":"Physical Review Letters","topic":"Polynomial and algebraic computation","field":"Computer Science","cited_by":156,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"Perimeter Institute; University of Waterloo","funders":"Horizon 2020 Framework Programme; European Commission; Ontario Ministry of Economic Development and Innovation; Government of Canada; Mainz Institute for Theoretical Physics, Johannes Gutenberg University Mainz; Ministero dello Sviluppo Economico; Institut Périmètre de physique théorique; Innovation, Science and Economic Development Canada","keywords":"Feynman integral; Scalar (mathematics); Feynman diagram; Intersection (aeronautics); Path integral formulation; Volume integral; Slater integrals; Mathematics; Functional integration; Vector space; Order of integration (calculus); Pure mathematics; Algebra over a field; Mathematical physics; Applied mathematics; Integral equation; Mathematical analysis; Physics; Quantum mechanics; Quantum","retraction":null,"screen_n_in":null,"score":{"opus":0.01083601841252309,"gpt":0.2698192020306663,"spread":0.2589831836181432,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001078701,0.0001005447,0.0002495808,0.00002935495,0.00001700251,0.00002296152,0.0002013375,0.000005887572,0.000006453103],"category_scores_gemma":[0.00002700428,0.00007996088,0.00008828928,0.0001875948,0.00003000347,0.0002568337,0.0001126166,0.0000900873,0.00006480114],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0000234773,"about_ca_system_score_gemma":0.000009219793,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00008348214,"about_ca_topic_score_gemma":0.000001356648,"domain_scores_codex":[0.9993042,0.00006659343,0.0001507667,0.00023216,0.0001250982,0.0001212278],"domain_scores_gemma":[0.9995164,0.0001041607,0.0001104133,0.0001996983,0.00002015572,0.0000491175],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00003782515,0.0003552693,0.00164921,0.003873894,0.0001827654,0.000008570975,0.003936221,0.0002849073,0.3789116,0.3453036,0.006835876,0.2586202],"study_design_scores_gemma":[0.005564979,0.001800746,0.1549705,0.02352982,0.0003894714,0.00009813692,0.0001451183,0.6747409,0.07082448,0.03299962,0.03110949,0.003826794],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9834076,0.0004210833,0.009015265,0.006462781,0.0002484079,0.0002276304,7.187451e-7,0.00004169139,0.0001748793],"genre_scores_gemma":[0.9960139,0.000109551,0.001228653,0.002571456,0.00005041183,0.000005901338,0.000001130194,0.000004706559,0.00001431612],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.6744559,"threshold_uncertainty_score":0.326071,"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":"W2150489476","doi":"10.1145/1073884.1073901","title":"Lifting techniques for triangular decompositions","year":2005,"lang":"en","type":"article","venue":"","topic":"Polynomial and algebraic computation","field":"Computer Science","cited_by":110,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Western University","funders":"","keywords":"Computer science","retraction":null,"screen_n_in":null,"score":{"opus":0.01335517595313454,"gpt":0.2700733685058671,"spread":0.2567181925527325,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001174973,0.00004913718,0.00005731262,0.00005356262,0.000107921,0.00007999742,0.0002324944,0.00002034223,0.000009708478],"category_scores_gemma":[0.00001432714,0.00004367873,0.00004903922,0.0001065247,0.000006744448,0.0002921437,0.00005430332,0.00002486182,0.00002170462],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001880801,"about_ca_system_score_gemma":0.00002094778,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000004819091,"about_ca_topic_score_gemma":0.000005484234,"domain_scores_codex":[0.9995645,0.000009692059,0.0001164869,0.0001375155,0.00005258413,0.0001191764],"domain_scores_gemma":[0.999701,0.00007715668,0.00002791657,0.0001246655,0.00003181823,0.00003739365],"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.000001553445,0.00002792702,0.000004772533,0.000002018029,0.000003785559,2.647822e-7,0.00009932283,0.00004145809,0.002945781,0.1808211,0.003343745,0.8127083],"study_design_scores_gemma":[0.0005216018,0.0001360063,0.0002392596,0.00001762519,0.00000664147,0.00001805082,0.00001040844,0.5096975,0.1971308,0.04619179,0.2457357,0.000294579],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.002606258,0.00002549198,0.9865105,0.005671813,0.00006524485,0.0001546162,7.641918e-7,0.0004170121,0.004548305],"genre_scores_gemma":[0.334334,7.754409e-7,0.664243,0.0007908756,0.0002146497,0.00002774064,0.00000200228,0.000002706311,0.0003841927],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.8124138,"threshold_uncertainty_score":0.1781167,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2914949175","doi":"10.1007/jhep05(2019)153","title":"Decomposition of Feynman integrals on the maximal cut by intersection numbers","year":2019,"lang":"en","type":"article","venue":"Journal of High Energy Physics","topic":"Polynomial and algebraic computation","field":"Computer Science","cited_by":109,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"Perimeter Institute; University of Waterloo","funders":"Institut Périmètre de physique théorique; European Commission; Government of Canada; Innovation, Science and Economic Development Canada","keywords":"Feynman integral; Maximum cut; Feynman diagram; Hypergeometric distribution; Formalism (music); Gauss; Recurrence relation; Intersection (aeronautics); Hypergeometric function","retraction":null,"screen_n_in":null,"score":{"opus":0.006862694092006749,"gpt":0.2204633578798528,"spread":0.2136006637878461,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001379243,0.00008917608,0.0001603824,0.00004924623,0.00003945658,0.00004593591,0.0003828801,0.0000281795,0.00000920409],"category_scores_gemma":[0.000005332713,0.00005856245,0.0001229885,0.0001763858,0.00002332938,0.0003731771,0.00005139431,0.0001350981,0.000008070108],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00005945265,"about_ca_system_score_gemma":0.00003477916,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00009027875,"about_ca_topic_score_gemma":0.000003848883,"domain_scores_codex":[0.9992118,0.00007178696,0.0002695529,0.00009867868,0.000249735,0.0000984674],"domain_scores_gemma":[0.9991693,0.0001150887,0.0004218783,0.0001537318,0.0001044436,0.00003559168],"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.00005130009,0.0001211607,0.00004378831,0.000004147838,0.00004924482,0.000001657334,0.0002151066,0.002102833,0.004065697,0.9568725,0.003633983,0.03283861],"study_design_scores_gemma":[0.001011623,0.001606241,0.001350819,0.0002164782,0.00002841433,0.00006806042,0.0001074201,0.02126308,0.3448795,0.6276739,0.001526202,0.0002682246],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.7671152,0.00001263922,0.230876,0.0006665126,0.0007326285,0.00002164366,0.000001065724,0.000008672349,0.0005655567],"genre_scores_gemma":[0.9986728,0.000007481256,0.0007453622,0.0003073984,0.0001675585,6.628331e-7,0.000001934717,0.000005246832,0.00009149816],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.3408138,"threshold_uncertainty_score":0.2388107,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2069065624","doi":"10.1109/tsp.2004.837413","title":"&amp;lt;tex&amp;gt;$QR$&amp;lt;/tex&amp;gt;Factoring to Compute the GCD of Univariate Approximate Polynomials","year":2004,"lang":"en","type":"article","venue":"IEEE Transactions on Signal Processing","topic":"Polynomial and algebraic computation","field":"Computer Science","cited_by":109,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Western University","funders":"","keywords":"Greatest common divisor; Univariate; Sylvester matrix; Mathematics; Maple; Factoring; Combinatorics; Unit circle; Polynomial; Discrete mathematics; Polynomial matrix; Matrix polynomial; Statistics; Mathematical analysis; Multivariate statistics","retraction":null,"screen_n_in":null,"score":{"opus":0.03777352369009633,"gpt":0.2723385915055507,"spread":0.2345650678154543,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0007999919,0.0006071805,0.0006595125,0.0005325294,0.001111287,0.000650297,0.001513795,0.0002046204,0.00006577329],"category_scores_gemma":[0.00001989205,0.0005161727,0.0003239952,0.001786221,0.0001934171,0.00113164,0.00004523501,0.0006016319,0.0002374285],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0003063666,"about_ca_system_score_gemma":0.0005007736,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001720185,"about_ca_topic_score_gemma":0.0002146641,"domain_scores_codex":[0.9959314,0.0002006176,0.001043617,0.001018758,0.0009119791,0.0008935825],"domain_scores_gemma":[0.997589,0.0003473589,0.0004984012,0.0008742238,0.0003165099,0.0003745242],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"bench_or_experimental","study_design_scores_codex":[0.0001987732,0.0006206204,0.000007092366,0.0002091213,0.0001688695,0.000005832216,0.01015811,0.4731378,0.183639,0.001532106,0.0001474744,0.3301752],"study_design_scores_gemma":[0.01780043,0.002141245,0.002584837,0.008667989,0.00153845,0.0009579917,0.000462658,0.1853787,0.5760379,0.05091956,0.1419699,0.01154029],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.09373312,0.0002151872,0.9021416,0.001592769,0.0009238413,0.0005352229,0.00003019518,0.0004403362,0.0003877565],"genre_scores_gemma":[0.9292251,0.00001370335,0.06933723,0.0005239599,0.0002922492,0.0000457616,0.000009061168,0.00006113322,0.0004917677],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.835492,"threshold_uncertainty_score":0.999729,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2100552771","doi":"10.1016/s0196-8858(03)00078-2","title":"Homogeneous multivariate polynomials with the half-plane property","year":2003,"lang":"en","type":"article","venue":"Advances in Applied Mathematics","topic":"Polynomial and algebraic computation","field":"Computer Science","cited_by":98,"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":"Matroid; Homogeneous polynomial; Polynomial; Graphic matroid; Property (philosophy); Matroid partitioning; Matching (statistics); Class (philosophy); Set (abstract data type)","retraction":null,"screen_n_in":null,"score":{"opus":0.01027692145734738,"gpt":0.2299357953178658,"spread":0.2196588738605185,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000298113,0.0001700013,0.0002062964,0.0000505558,0.0001153945,0.00008335011,0.000544341,0.00003547716,0.000006763851],"category_scores_gemma":[0.00003416899,0.00008324475,0.00002285175,0.0003221996,0.00007091634,0.0001796991,0.00007364275,0.0001215195,0.00004555344],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003270388,"about_ca_system_score_gemma":0.00005627595,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000008675336,"about_ca_topic_score_gemma":0.00004581373,"domain_scores_codex":[0.9989643,0.0000291186,0.0002462586,0.0002742932,0.00021038,0.000275683],"domain_scores_gemma":[0.999037,0.0003211319,0.0001469402,0.0004307798,0.00001835553,0.0000458353],"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.00001539517,0.0002214329,0.00002840079,0.00008295198,0.00001445461,0.00002011794,0.002195858,0.003951342,0.001748909,0.8857329,0.000106138,0.1058821],"study_design_scores_gemma":[0.005664037,0.0004743685,0.0003353278,0.0003202311,0.0000664126,0.0006076593,0.001604378,0.09489312,0.07239399,0.6298667,0.1913676,0.002406172],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01442889,0.0004739586,0.9450783,0.0005584063,0.0001797684,0.0007233253,0.000001476807,0.0001576431,0.03839826],"genre_scores_gemma":[0.6929348,0.00002649545,0.3064786,0.0002001319,0.00002946182,0.00008076234,0.00000100354,0.00001301578,0.0002357091],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.6785059,"threshold_uncertainty_score":0.3394622,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2020661143","doi":"10.1016/s0012-365x(01)00297-7","title":"Galois theory for minors of finite functions","year":2002,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Polynomial and algebraic computation","field":"Computer Science","cited_by":95,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of British Columbia","funders":"","keywords":"Mathematics; Boolean function; Discrete mathematics; Complement (music); Generalization; Closure (psychology); Complete Boolean algebra; Bounded function; Combinatorics; Two-element Boolean algebra; Separable space; Algebra over a field; Pure mathematics","retraction":null,"screen_n_in":null,"score":{"opus":0.02510157427757449,"gpt":0.2345089131926011,"spread":0.2094073389150266,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001587738,0.00008104925,0.0001303664,0.000059948,0.000071772,0.00003414785,0.0002913219,0.00002745342,0.00005148855],"category_scores_gemma":[0.0001201431,0.00006701274,0.0000957622,0.0001603702,0.00003448391,0.0001354927,0.0000658318,0.00003377676,0.00004800815],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000008395039,"about_ca_system_score_gemma":0.000007802889,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000001374288,"about_ca_topic_score_gemma":8.900676e-7,"domain_scores_codex":[0.9993892,0.00001703084,0.0002205639,0.0001289071,0.000113086,0.0001312321],"domain_scores_gemma":[0.9990679,0.0004581787,0.0001126104,0.0002761757,0.00004602442,0.00003909327],"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.000004191493,0.000174789,0.00002321289,0.0001929489,0.00004842122,9.209409e-7,0.006330102,0.0004467676,0.0004552382,0.9214793,0.004599466,0.06624468],"study_design_scores_gemma":[0.0003104254,0.00009844486,0.00007571922,0.00004183226,0.0000238557,0.000004335117,0.0001795187,0.7158359,0.001547689,0.2793002,0.002421201,0.0001609477],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01126557,0.00006430797,0.9833069,0.0002380625,0.0002201704,0.0001539066,0.00001374834,0.00006345973,0.004673876],"genre_scores_gemma":[0.8748355,0.0000056187,0.1181622,0.00009951007,0.00007096281,0.00003479205,0.000006115697,0.00001226761,0.006773046],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8651447,"threshold_uncertainty_score":0.27327,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1536271794","doi":"10.1007/978-3-540-75187-8_7","title":"Comprehensive Triangular Decomposition","year":2007,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Polynomial and algebraic computation","field":"Computer Science","cited_by":94,"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":"Disjoint sets; Computer science; Polynomial; Parametric statistics; Discrete mathematics; Theoretical computer science; Algorithm; Mathematics","retraction":null,"screen_n_in":null,"score":{"opus":0.02234074093905147,"gpt":0.2754742945676292,"spread":0.2531335536285777,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0006333049,0.0005495462,0.0005633087,0.001209502,0.0002896004,0.0004994062,0.002480621,0.0003389207,0.00002375658],"category_scores_gemma":[0.00003129714,0.0005338005,0.0001928893,0.0007220198,0.0004820051,0.0006516187,0.001054857,0.0007275513,0.0001320891],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0004143816,"about_ca_system_score_gemma":0.0004165696,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00003355623,"about_ca_topic_score_gemma":0.00004492777,"domain_scores_codex":[0.9961372,0.00003794341,0.0006397,0.00146921,0.0009967193,0.0007192531],"domain_scores_gemma":[0.9975553,0.0005465974,0.0003162191,0.00105266,0.0002935278,0.0002357348],"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.00001032217,0.000025472,0.000006372141,0.00002649429,0.00001136815,0.0001513703,0.0003249145,0.01313586,0.000356214,0.02704241,0.0000244337,0.9588848],"study_design_scores_gemma":[0.0008362798,0.0003210786,0.0004571144,0.0004397305,0.00001417028,0.0002301347,1.697163e-7,0.5762887,0.00397337,0.4066432,0.009561318,0.001234745],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0003820026,0.0007007865,0.9917369,0.0005777614,0.002530009,0.0004094876,0.000003448892,0.0002550719,0.003404523],"genre_scores_gemma":[0.1834284,0.0000700024,0.809025,0.005113228,0.001784209,0.00001019966,0.00003064585,0.00007059926,0.0004676056],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.95765,"threshold_uncertainty_score":0.9997113,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2055828174","doi":"10.1007/s00208-011-0777-6","title":"Log-concavity of characteristic polynomials and the Bergman fan of matroids","year":2012,"lang":"en","type":"article","venue":"Mathematische Annalen","topic":"Polynomial and algebraic computation","field":"Computer Science","cited_by":94,"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; Matroid; Conjecture; Combinatorics; Polynomial; Pure mathematics; Discrete mathematics; Mathematical analysis","retraction":null,"screen_n_in":null,"score":{"opus":0.01455428508334683,"gpt":0.2393918853130487,"spread":0.2248376002297019,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000758565,0.0001030684,0.0002964095,0.00005121929,0.000052186,0.00002667278,0.0003809278,0.00003578201,0.00001675862],"category_scores_gemma":[0.00007681268,0.00006715491,0.00007130313,0.0001221134,0.0001649973,0.0003264356,0.0002401979,0.00006461411,0.00001424989],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000005072235,"about_ca_system_score_gemma":0.00001958865,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00005351374,"about_ca_topic_score_gemma":0.0000018305,"domain_scores_codex":[0.999103,0.00009974299,0.0003354069,0.0001206478,0.0001562397,0.0001849849],"domain_scores_gemma":[0.9990245,0.0002703308,0.0002866621,0.0003162962,0.00004106241,0.00006120701],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"observational","study_design_scores_codex":[0.0001057782,0.000389927,0.01043202,0.0005854333,0.0001975844,0.000001893807,0.0214635,0.000004178872,0.03404134,0.8088165,0.001800891,0.122161],"study_design_scores_gemma":[0.005826604,0.0004251651,0.6743163,0.0004855887,0.0002590815,0.0002498691,0.0003731432,0.02122751,0.1446797,0.1475324,0.003492932,0.001131735],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9378965,0.0006218831,0.05926777,0.0008475774,0.0001273529,0.0001882924,0.000008236438,0.00002934227,0.001012975],"genre_scores_gemma":[0.994993,0.00001667411,0.004676569,0.00008626907,0.00007650356,0.000008862837,0.000001301305,0.000005319846,0.000135524],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.6638843,"threshold_uncertainty_score":0.2738498,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1914286732","doi":"10.1007/978-3-7643-8310-7","title":"Tropical Algebraic Geometry","year":2007,"lang":"en","type":"book","venue":"Oberwolfach Seminars","topic":"Polynomial and algebraic computation","field":"Computer Science","cited_by":89,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Toronto","funders":"Natural Sciences and Engineering Research Council of Canada; Mathematisches Forschungsinstitut Oberwolfach; Ministry of Science and Technology, Israel; Tel Aviv University; Ministère des Affaires Etrangères; Agence Nationale de la Recherche","keywords":"Tropical geometry; Geometry; Mathematics; Algebraic geometry; Algebraic number; Algebra over a field; Pure mathematics; Mathematical analysis","retraction":null,"screen_n_in":null,"score":{"opus":0.01180488393103469,"gpt":0.2344596881979006,"spread":0.2226548042668659,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0003070843,0.0005568879,0.0005933286,0.0005931079,0.0001724483,0.0002348413,0.00183004,0.000625761,0.0001724284],"category_scores_gemma":[0.00005588309,0.0005554686,0.000352153,0.0004410648,0.0001428055,0.0003404658,0.0007243986,0.000853445,0.001228921],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0004017238,"about_ca_system_score_gemma":0.000487996,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000009745089,"about_ca_topic_score_gemma":0.000006661226,"domain_scores_codex":[0.9967431,0.00005058469,0.000641801,0.001008586,0.000817269,0.0007386319],"domain_scores_gemma":[0.9978636,0.0003417931,0.0003247568,0.00102466,0.00009721534,0.0003479948],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"not_applicable","study_design_scores_codex":[0.00001065853,0.00008120482,0.00006327948,0.00007720591,0.00007786452,0.0002868414,0.0002116347,0.00001509236,0.00003239136,0.178808,0.3970124,0.4233235],"study_design_scores_gemma":[0.0004246556,0.000223605,0.001323345,0.0002496738,0.00004400776,0.0001830896,0.000004546781,0.001808657,0.0002357172,0.08293974,0.9115289,0.001034076],"study_design_candidate":"not_applicable","study_design_consensus":null,"genre_codex":"other","genre_gemma":"other","genre_scores_codex":[0.00148787,0.003832274,0.2636581,0.0008306737,0.003282674,0.0005289484,0.00002699465,0.0009368157,0.7254156],"genre_scores_gemma":[0.002065538,0.0001143893,0.01601003,0.001323839,0.00122719,0.00001502938,0.0001217501,0.00007362852,0.9790486],"genre_candidate":"other","genre_consensus":"other","teacher_disagreement_score":0.5145165,"threshold_uncertainty_score":0.9996897,"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":"W3104562616","doi":"","title":"Prolongations of geometric overdetermined systems","year":2004,"lang":"en","type":"article","venue":"","topic":"Polynomial and algebraic computation","field":"Computer Science","cited_by":76,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":false,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"","funders":"Banff International Research Station for Mathematical Innovation and Discovery; Division of Mathematical Sciences; National University of Singapore; American Institute of Mathematics; National Science Foundation","keywords":"Overdetermined system; Mathematics; Dimension (graph theory); Partial differential equation; Class (philosophy); Mathematical analysis; Space (punctuation); Applied mathematics; Pure mathematics","retraction":null,"screen_n_in":null,"score":{"opus":0.01241250005305271,"gpt":0.2240949280176484,"spread":0.2116824279645957,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00007131904,0.00004102513,0.00007081556,0.0001571619,0.00002945945,0.00003073571,0.0002329823,0.00001693857,0.000001806828],"category_scores_gemma":[0.00002349525,0.00003363004,0.00002585281,0.0006321777,0.00001173013,0.0002049036,0.00005898154,0.00002258607,0.00001713695],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001957797,"about_ca_system_score_gemma":0.00005552842,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001538036,"about_ca_topic_score_gemma":0.000003929594,"domain_scores_codex":[0.999543,0.000008811313,0.0001406785,0.0001078342,0.0001163023,0.00008343306],"domain_scores_gemma":[0.9996775,0.00003456468,0.00005654268,0.0001572499,0.00004333055,0.00003080177],"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.000002308656,0.0001226425,0.0003169787,0.00003163073,0.00001464407,0.000004312779,0.0003159622,0.01912618,0.002269814,0.939096,0.0001752085,0.03852433],"study_design_scores_gemma":[0.005414722,0.001362688,0.1379995,0.0001773015,0.00003126566,0.0001762128,0.00008985667,0.6386524,0.07708693,0.1341663,0.003719448,0.001123361],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2027675,0.00004208793,0.7943226,0.0002153444,0.0002207957,0.00009194744,5.83249e-7,0.0000777442,0.002261387],"genre_scores_gemma":[0.9894222,8.974559e-7,0.01032216,0.00003194005,0.00002556914,0.000005490057,6.967113e-7,0.000001481738,0.0001895823],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.8049297,"threshold_uncertainty_score":0.1371393,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2146380740","doi":"10.1016/j.jco.2005.04.002","title":"The shifted number system for fast linear algebra on integer matrices","year":2005,"lang":"en","type":"article","venue":"Journal of Complexity","topic":"Polynomial and algebraic computation","field":"Computer Science","cited_by":76,"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":"Integer (computer science); Mathematics; Integer matrix; Matrix multiplication; Dimension (graph theory); Unimodular matrix; Discrete mathematics; Matrix (chemical analysis); Multiplication (music); Polynomial; Computation; Integer points in convex polyhedra; Algebra over a field; Combinatorics; Integer programming; Algorithm; Pure mathematics; Symmetric matrix; Branch and price; Eigenvalues and eigenvectors; Computer science; Nonnegative matrix","retraction":null,"screen_n_in":null,"score":{"opus":0.02981440093235344,"gpt":0.2839099586143147,"spread":0.2540955576819612,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000679403,0.0001139189,0.0002020679,0.00006158184,0.0002714001,0.0001984336,0.0008393648,0.00003511366,0.000007489946],"category_scores_gemma":[0.0000567549,0.00006916034,0.0001785376,0.0001908769,0.00005126463,0.0003626799,0.00008809284,0.000188378,0.00006153219],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001050699,"about_ca_system_score_gemma":0.00008206564,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000006049601,"about_ca_topic_score_gemma":0.00001001818,"domain_scores_codex":[0.9987738,0.00008410811,0.0004840432,0.0001251815,0.0003243946,0.0002085186],"domain_scores_gemma":[0.998553,0.0004465822,0.000456913,0.0002105595,0.0002353388,0.00009756946],"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.0002028824,0.0001451562,0.0001246744,0.00003629034,0.0000844903,0.000008735936,0.0005474394,0.0005324288,0.00006941015,0.8236914,0.007628533,0.1669286],"study_design_scores_gemma":[0.002953392,0.0008684896,0.01145696,0.0003458916,0.00005340999,0.0006289849,0.0002488953,0.6435671,0.004161631,0.1395139,0.1956542,0.0005471875],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.287492,0.0001674404,0.6977208,0.01122063,0.00145888,0.0002111615,0.000005529434,0.00007853303,0.001645049],"genre_scores_gemma":[0.9444093,0.000005957521,0.05401525,0.0002944663,0.001146967,0.000002932241,5.876032e-7,0.000007029344,0.0001174999],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.6841775,"threshold_uncertainty_score":0.2820277,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2164838307","doi":"10.1007/s00200-009-0117-1","title":"On the geometry of polar varieties","year":2010,"lang":"en","type":"article","venue":"Applicable Algebra in Engineering Communication and Computing","topic":"Polynomial and algebraic computation","field":"Computer Science","cited_by":74,"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":"Correctness; Singular point of an algebraic variety; Mathematics; Polar; Variety (cybernetics); Algebraic variety; Degree (music); Polar coordinate system; Singular point of a curve; Point (geometry); Algebraic geometry; Algebraic number; Algorithm; Algebra over a field; Pure mathematics; Geometry; Mathematical analysis","retraction":null,"screen_n_in":null,"score":{"opus":0.005583937670656649,"gpt":0.2005327999258704,"spread":0.1949488622552137,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005121168,0.0000967248,0.0001219239,0.0001142291,0.000108894,0.00007104798,0.0007853154,0.00004680529,0.000003804067],"category_scores_gemma":[0.00007833608,0.00008072154,0.00002518151,0.0004367559,0.00004549509,0.0001051439,0.0003905602,0.0003692651,0.00000357609],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000008464825,"about_ca_system_score_gemma":0.00001434095,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00006946213,"about_ca_topic_score_gemma":0.000004666909,"domain_scores_codex":[0.9993287,0.00003108371,0.0002239412,0.0001542549,0.0001128478,0.0001492065],"domain_scores_gemma":[0.9984058,0.0008250342,0.0000792034,0.0006288685,0.00002743996,0.00003371003],"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.000001151039,0.00002917013,0.000344664,0.00001282816,0.000005394615,1.706848e-7,0.0003341039,0.004003363,0.003981462,0.9707063,0.00002802539,0.02055331],"study_design_scores_gemma":[0.0002207043,0.00002847388,0.01584382,0.00004036966,0.00000194857,0.000007495618,0.00003624617,0.9414063,0.003871189,0.03757542,0.0007979582,0.0001700358],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.7270759,0.0001449909,0.2708267,0.001155076,0.00007789848,0.0001221567,3.678973e-7,0.00008939968,0.0005074602],"genre_scores_gemma":[0.9843411,0.00001352305,0.01544217,0.0001640694,0.00001649641,0.000008498508,0.000001571817,0.000006469302,0.000006083866],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.937403,"threshold_uncertainty_score":0.3291729,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2279788372","doi":"10.1145/2996450","title":"A Nearly Optimal Algorithm for Deciding Connectivity Queries in Smooth and Bounded Real Algebraic Sets","year":2017,"lang":"en","type":"article","venue":"Journal of the ACM","topic":"Polynomial and algebraic computation","field":"Computer Science","cited_by":74,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada; Institut Universitaire de France; Canada Research Chairs; Agence Nationale de la Recherche","keywords":"Bounded function; Intersection (aeronautics); Dimension (graph theory); Time complexity; Algorithm; Algebraic number; Set (abstract data type); Real algebraic geometry; Polynomial; Mathematics; Running time; Computer science; Discrete mathematics; Combinatorics","retraction":null,"screen_n_in":null,"score":{"opus":0.02475850701117695,"gpt":0.2885164726401233,"spread":0.2637579656289463,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006486907,0.00007720906,0.0001694516,0.00005610304,0.0003606009,0.0004772676,0.001616455,0.00003289864,5.593382e-7],"category_scores_gemma":[0.00086153,0.00005293725,0.00007885219,0.00005120873,0.00007231632,0.0008774882,0.0007472737,0.0001321308,3.50222e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004627977,"about_ca_system_score_gemma":0.0001209955,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001073348,"about_ca_topic_score_gemma":0.0000656771,"domain_scores_codex":[0.9993204,0.00005272519,0.0002091991,0.0001178992,0.0001477494,0.0001520638],"domain_scores_gemma":[0.9986756,0.0002636309,0.0004071039,0.000533851,0.00006558171,0.00005417565],"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.00008061954,0.00007694381,0.00648704,0.00001490273,0.00005203704,0.00003270654,0.002504783,0.0001012175,0.001567084,0.01031705,0.0007819749,0.9779837],"study_design_scores_gemma":[0.002228876,0.0003602656,0.5359316,0.0001375685,0.00001937463,0.0002500036,0.00006955702,0.1363377,0.003327599,0.3204225,0.0007005036,0.0002144535],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9059348,0.00006453147,0.08800521,0.005304867,0.0005600155,0.00008761662,0.000001474474,0.000006834914,0.0000346183],"genre_scores_gemma":[0.8792531,0.00001390898,0.1204891,0.00008302084,0.0001331986,0.000001742807,6.147899e-8,0.000004028878,0.00002179759],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.9777692,"threshold_uncertainty_score":0.4602303,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2129280636","doi":"10.1090/s0894-0347-08-00630-9","title":"Smale’s 17th problem: Average polynomial time to compute affine and projective solutions","year":2008,"lang":"en","type":"article","venue":"Journal of the American Mathematical Society","topic":"Polynomial and algebraic computation","field":"Computer Science","cited_by":72,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":false,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada; Fundación Española para la Ciencia y la Tecnología","keywords":"Algorithm; Annotation; Type (biology); Computer science; Mathematics; Artificial intelligence","retraction":null,"screen_n_in":null,"score":{"opus":0.01449186396169143,"gpt":0.226689905971716,"spread":0.2121980420100246,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004209429,0.0001367118,0.0003533367,0.00003867439,0.0003211702,0.00006634728,0.0006242679,0.00002441897,0.0000142002],"category_scores_gemma":[0.00007504159,0.00008624386,0.0002736513,0.0004980961,0.0002788668,0.0002170988,0.0004888865,0.0002396554,0.00004275634],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000102786,"about_ca_system_score_gemma":0.0001702949,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001262061,"about_ca_topic_score_gemma":5.350238e-7,"domain_scores_codex":[0.9987309,0.00009836847,0.0003829678,0.0001685528,0.0003523338,0.000266908],"domain_scores_gemma":[0.9988456,0.0002318069,0.000428702,0.0002092011,0.0001119771,0.0001726967],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"not_applicable","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0003693812,0.003913185,0.001950153,0.0002916177,0.001918657,0.0001316195,0.08622065,0.01179258,0.03572178,0.03278253,0.5770717,0.2478362],"study_design_scores_gemma":[0.004169657,0.003941017,0.09948686,0.0006186097,0.0002465999,0.007944093,0.000557445,0.7823291,0.002032444,0.08474097,0.0120994,0.001833817],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.4365972,0.00003214701,0.5487806,0.01337827,0.0001049993,0.0003071252,0.000003017589,0.00004786603,0.000748841],"genre_scores_gemma":[0.7118949,0.00001376331,0.2851069,0.001825922,0.0003409364,0.000005644688,1.762614e-7,0.00001349311,0.000798209],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.7705365,"threshold_uncertainty_score":0.3516923,"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":"W2129139293","doi":"10.1145/1277548.1277553","title":"Differential equations for algebraic functions","year":2007,"lang":"en","type":"preprint","venue":"","topic":"Polynomial and algebraic computation","field":"Computer Science","cited_by":68,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Western University","funders":"Agence Nationale de la Recherche","keywords":"Mathematics; Degree (music); Linear differential equation; Power series; Algebraic differential equation; Differential equation; Differential algebraic geometry; Homogeneous differential equation; Universal differential equation; Algebraic function; Polynomial; Applied mathematics; Univariate; Mathematical analysis; Quadratic function; Order (exchange); Algebraic equation; Differential algebraic equation; Series (stratigraphy); Function (biology); Quadratic equation; Algebraic number; Nonlinear system; Exact differential equation; Ordinary differential equation","retraction":null,"screen_n_in":null,"score":{"opus":0.03520197258470578,"gpt":0.2800741082266773,"spread":0.2448721356419716,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001436746,0.000224287,0.0002185513,0.0002625032,0.0002114585,0.0003247808,0.0008150889,0.0001961885,0.0001041701],"category_scores_gemma":[0.00006602942,0.0002097117,0.000256908,0.0001858426,0.00002922116,0.0001644619,0.0009647309,0.0002588001,0.00009878894],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00007071161,"about_ca_system_score_gemma":0.0002168959,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00005516225,"about_ca_topic_score_gemma":0.00004983439,"domain_scores_codex":[0.9984813,0.00002529987,0.0003562232,0.000593432,0.0002259994,0.0003177276],"domain_scores_gemma":[0.9986327,0.0003786914,0.0001469747,0.000579726,0.0001433888,0.0001184867],"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.00001238193,0.0002127488,0.00001656081,0.00008271189,0.0001228035,0.000001749567,0.0003427293,0.002775182,0.0003200219,0.727008,0.02017238,0.2489327],"study_design_scores_gemma":[0.0005001148,0.00007636997,0.0009629352,0.00003496902,0.00004566673,0.000002821828,0.00001151715,0.7777528,0.0007438866,0.2106932,0.00864157,0.0005341176],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.002449166,0.00005558985,0.9885301,0.001145003,0.004091383,0.0005583157,0.00002649915,0.0005024458,0.002641514],"genre_scores_gemma":[0.9085384,0.000004416893,0.07985016,0.0005133257,0.001230974,0.0002455768,0.0003002306,0.00002353465,0.009293362],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9086799,"threshold_uncertainty_score":0.8551793,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2099082421","doi":"10.1016/j.jcta.2013.05.002","title":"Rank of divisors on tropical curves","year":2013,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series A","topic":"Polynomial and algebraic computation","field":"Computer Science","cited_by":62,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"McGill University","funders":"","keywords":"Rank (graph theory); Mathematics; Divisor (algebraic geometry); Conjecture; Graph; Combinatorics; Equivalence (formal languages); Metric (unit); Discrete mathematics","retraction":null,"screen_n_in":null,"score":{"opus":0.007274060713505347,"gpt":0.2169289368542224,"spread":0.209654876140717,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003789368,0.0001039584,0.0002948816,0.00009694826,0.00004932306,0.00005712336,0.0006169303,0.00004146041,0.00007409728],"category_scores_gemma":[0.0002475242,0.00007632645,0.0001471489,0.0001877495,0.00007819152,0.0007451248,0.00009582139,0.0001690496,0.00001491525],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002458011,"about_ca_system_score_gemma":0.00007847053,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000004288454,"about_ca_topic_score_gemma":1.231474e-7,"domain_scores_codex":[0.9987337,0.0002198832,0.0004580626,0.00009443926,0.0003531144,0.0001407834],"domain_scores_gemma":[0.9987455,0.0003372616,0.0004053317,0.0001869592,0.0002311862,0.00009374136],"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.0001736779,0.0001439364,0.0000862141,0.00002471047,0.00003683952,0.000005846634,0.0002729875,0.00002319596,0.0005707046,0.9826571,0.003116342,0.01288849],"study_design_scores_gemma":[0.001067919,0.001541998,0.00656651,0.0001838091,0.00001098427,0.00003553171,0.00003226789,0.000120203,0.005616288,0.9827743,0.001938058,0.0001121668],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9514301,0.0005773082,0.03214227,0.004432162,0.008920292,0.0002101137,0.000001100333,0.00003924893,0.002247412],"genre_scores_gemma":[0.9984764,0.00006068588,0.0008135312,0.0002018436,0.0003437455,0.000001910158,1.597894e-7,0.000005114285,0.0000966404],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.04704628,"threshold_uncertainty_score":0.3112502,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2100899126","doi":"10.1016/j.tcs.2009.03.030","title":"Interpolation of polynomials given by straight-line programs","year":2009,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Polynomial and algebraic computation","field":"Computer Science","cited_by":59,"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; Canada Research Chairs","keywords":"Mathematics; Interpolation (computer graphics); Line (geometry); Combinatorics; Polynomial; Polynomial interpolation; Degree (music); Upper and lower bounds; Discrete mathematics; Linear interpolation; Geometry; Mathematical analysis; Computer science; Image (mathematics)","retraction":null,"screen_n_in":null,"score":{"opus":0.00979432748980266,"gpt":0.2506469350022867,"spread":0.240852607512484,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008112983,0.0001680312,0.0002374704,0.000161783,0.0001619366,0.0002516787,0.001763892,0.00004892093,0.00002335777],"category_scores_gemma":[0.00003836982,0.0001376481,0.00007528858,0.0009654445,0.001004206,0.0007500751,0.0003295614,0.0001239318,0.00001853224],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003834052,"about_ca_system_score_gemma":0.00009781797,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000004354625,"about_ca_topic_score_gemma":2.908565e-7,"domain_scores_codex":[0.9979964,0.00007580242,0.0004116717,0.0005406864,0.0005499321,0.0004254681],"domain_scores_gemma":[0.9989145,0.00009913705,0.0001438557,0.0004794351,0.0001525337,0.0002105005],"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.000007918184,0.0001053097,0.00001136039,0.00000268099,0.000002049683,0.000001169704,0.0002443941,0.00003821249,0.01370366,0.636622,0.0001140965,0.3491472],"study_design_scores_gemma":[0.0003476827,0.00116315,0.001274889,0.00005100667,0.000004737289,0.00001627361,0.000003507178,0.7396127,0.03702302,0.2201077,0.0001412621,0.0002540446],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.06953759,0.00003427054,0.9258408,0.002193528,0.0003238116,0.0001855435,0.000001850616,0.0001599268,0.001722691],"genre_scores_gemma":[0.9046885,0.000001648973,0.094842,0.0003484384,0.000100415,0.000001851638,0.000002966123,0.00000344346,0.00001077262],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8351508,"threshold_uncertainty_score":0.5613127,"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":"W3082171719","doi":"10.4171/aihpd/158","title":"Tropical Monte Carlo quadrature for Feynman integrals","year":2023,"lang":"en","type":"article","venue":"Annales de l’Institut Henri Poincaré D Combinatorics Physics and their Interactions","topic":"Polynomial and algebraic computation","field":"Computer Science","cited_by":56,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":false,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"","funders":"University of Waterloo; Nederlandse Organisatie voor Wetenschappelijk Onderzoek","keywords":"Feynman diagram; Feynman integral; Quadrature (astronomy); Simplex; Mathematics; Monte Carlo method; Parametric statistics; Kinematics; Numerical integration; Algebraic number; Applied mathematics; Order of integration (calculus); Scattering amplitude; Amplitude; Monte Carlo integration; Calculus (dental); Algebra over a field; Mathematical analysis; Pure mathematics; Geometry; Hybrid Monte Carlo; Physics; Mathematical physics; Classical mechanics; Quantum mechanics; Markov chain Monte Carlo","retraction":null,"screen_n_in":null,"score":{"opus":0.02277023473237695,"gpt":0.2695782950156292,"spread":0.2468080602832523,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001257352,0.0002508999,0.0002691167,0.0001473805,0.0005088691,0.0003316332,0.0004767324,0.00007762403,0.000001476566],"category_scores_gemma":[0.00005273768,0.0002175887,0.0002116545,0.0006516338,0.00007538639,0.0006893808,0.0002457102,0.0003299636,0.00002527159],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00008451814,"about_ca_system_score_gemma":0.0001238435,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00005073509,"about_ca_topic_score_gemma":0.00004015767,"domain_scores_codex":[0.998704,0.00005381217,0.0002618286,0.0004193445,0.000130964,0.0004300691],"domain_scores_gemma":[0.9988365,0.0003420237,0.0001117976,0.0003579174,0.0001754053,0.0001763939],"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.00001367192,0.0001322832,0.0003390553,0.00003120393,0.00007683613,0.000008532835,0.001616006,0.000376046,0.0002187623,0.9658228,0.006399489,0.02496537],"study_design_scores_gemma":[0.000650783,0.0001976108,0.002508159,0.00007838435,0.00001941177,0.00004208111,0.0002812412,0.2482555,0.001253495,0.6741564,0.07216062,0.0003963403],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.7577929,0.0004156066,0.232045,0.004429188,0.002578105,0.0004895173,0.00007240863,0.0006237337,0.001553539],"genre_scores_gemma":[0.9979045,0.0001013118,0.0005968467,0.0003582591,0.0002879162,0.00009656283,0.00002519575,0.00001847409,0.0006108923],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.2916664,"threshold_uncertainty_score":0.8873011,"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":"W2145758416","doi":"10.48550/arxiv.0904.3350","title":"Newton-Okounkov bodies, semigroups of integral points, graded algebras and intersection theory","year":2009,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Polynomial and algebraic computation","field":"Computer Science","cited_by":53,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Toronto","funders":"","keywords":"Mathematics; Semigroup; Pure mathematics; Intersection theory; Mixed volume; Polytope; Convex geometry; Regular polygon; Convex analysis; Mathematical analysis; Discrete mathematics; Convex optimization; Geometry","retraction":null,"screen_n_in":null,"score":{"opus":0.03335046347352386,"gpt":0.1772982498522702,"spread":0.1439477863787463,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0003643114,0.0003187699,0.0003898328,0.0003608763,0.0001072869,0.00009478081,0.000942937,0.0002359448,0.00001177882],"category_scores_gemma":[0.00004325245,0.0003415362,0.0001957475,0.000320995,0.0001713471,0.0004350171,0.001214544,0.0005138655,0.00001012257],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001655359,"about_ca_system_score_gemma":0.0001326449,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0002916625,"about_ca_topic_score_gemma":0.00008028698,"domain_scores_codex":[0.9982519,0.0002415161,0.0002804068,0.0008589387,0.00009350367,0.0002737729],"domain_scores_gemma":[0.998648,0.0001477038,0.0003447548,0.0006118648,0.0001083774,0.0001392518],"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.0001083511,0.0001194042,0.0007724421,0.00009087288,0.0001294575,0.00006645096,0.001404981,0.003171167,0.0002109609,0.9763612,0.0005019188,0.01706285],"study_design_scores_gemma":[0.0006221368,0.0001754277,0.005855398,0.0002138965,0.00007226669,0.00001918698,0.0002015957,0.1042905,0.0008772931,0.8870468,0.0001662317,0.0004592718],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.5744185,0.0001459672,0.4236923,0.0001813674,0.0005305405,0.0001734101,0.000005536574,0.0001616157,0.0006908152],"genre_scores_gemma":[0.9978172,0.0001370475,0.001247733,0.0001353974,0.00008208701,4.845614e-7,0.00001689716,0.00001090931,0.0005522467],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.4233987,"threshold_uncertainty_score":0.9999037,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1765206433","doi":"10.1090/jams/847","title":"Sums of squares and varieties of minimal degree","year":2015,"lang":"lv","type":"article","venue":"Journal of the American Mathematical Society","topic":"Polynomial and algebraic computation","field":"Computer Science","cited_by":51,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"Queen's University","funders":"Natural Sciences and Engineering Research Council of Canada; Alfred P. Sloan Foundation; National Science Foundation","keywords":"Algorithm; Artificial intelligence; Mathematics; Computer science","retraction":null,"screen_n_in":null,"score":{"opus":0.0404936369183584,"gpt":0.2710530456225148,"spread":0.2305594087041564,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001104143,0.0001558617,0.0007003208,0.00003162973,0.00005781294,0.0000520731,0.0007765221,0.00004587236,0.000007119831],"category_scores_gemma":[0.0004179904,0.0000944347,0.0004870952,0.0004019573,0.00125398,0.0001971692,0.0004518412,0.0002498023,0.000001877682],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004645815,"about_ca_system_score_gemma":0.0003152174,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00004054324,"about_ca_topic_score_gemma":6.34432e-7,"domain_scores_codex":[0.9979098,0.00017519,0.0008645408,0.0001251841,0.0007235768,0.0002017522],"domain_scores_gemma":[0.9965898,0.0006080333,0.001985591,0.0002684965,0.0003639369,0.0001841318],"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.001150265,0.003878919,0.01868502,0.003642144,0.003597044,0.00003204526,0.2393715,0.001391296,0.03573399,0.3419143,0.06361387,0.2869896],"study_design_scores_gemma":[0.002744967,0.00509686,0.07409343,0.001091056,0.0006834214,0.0005869112,0.01700501,0.1371741,0.01202902,0.7482454,0.0005821382,0.0006677221],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9130132,0.0005504954,0.08309513,0.002778157,0.0002265837,0.00008471536,0.000004279344,0.000004977303,0.0002425031],"genre_scores_gemma":[0.9580649,0.00004699305,0.0415142,0.0001616339,0.0001244807,4.239891e-7,5.483403e-8,0.000007706163,0.00007961416],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.4063311,"threshold_uncertainty_score":0.4620342,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2120802615","doi":"10.1007/s10958-005-0449-8","title":"Univariate Ore Polynomial Rings in Computer Algebra","year":2005,"lang":"en","type":"article","venue":"Journal of Mathematical Sciences","topic":"Polynomial and algebraic computation","field":"Computer Science","cited_by":51,"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":"Russian Foundation for Basic Research","keywords":"Polynomial ring; Mathematics; Ring (chemistry); Univariate; Algebra over a field; Polynomial; Differential (mechanical device); Basis (linear algebra); Iron ore; Pure mathematics; Multivariate statistics; Geometry; Engineering; Chemistry; Mathematical analysis; Statistics","retraction":null,"screen_n_in":null,"score":{"opus":0.01728235339272642,"gpt":0.2585407796555528,"spread":0.2412584262628264,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001443872,0.0001048195,0.000245746,0.0002344671,0.00008797262,0.0002212053,0.001063383,0.00004013656,0.00004695445],"category_scores_gemma":[0.00007970655,0.00007136208,0.00008861792,0.000544013,0.0001346601,0.001064308,0.0001847424,0.0001695602,0.00005503596],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00005976137,"about_ca_system_score_gemma":0.0001453137,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000006153635,"about_ca_topic_score_gemma":0.000005059701,"domain_scores_codex":[0.9984272,0.00006853598,0.0005759849,0.0001708545,0.0004875095,0.0002699648],"domain_scores_gemma":[0.9991469,0.000278784,0.0002754196,0.0001137859,0.00005327232,0.0001318873],"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.00002341926,0.0006009671,0.0005931525,0.00003468693,0.00002445339,0.00008599617,0.003623527,0.009334317,0.001208132,0.4828832,0.002352055,0.4992361],"study_design_scores_gemma":[0.001105699,0.000539619,0.00787206,0.0002374457,0.000009198127,0.000529896,0.00005160185,0.7690648,0.001660373,0.216251,0.002357934,0.0003204139],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.4613039,0.00005336252,0.5274461,0.009462548,0.0002882263,0.00005821343,1.833183e-7,0.00002280647,0.001364668],"genre_scores_gemma":[0.7927713,0.000003417643,0.2065159,0.0003096139,0.0003671372,4.419935e-7,2.917497e-8,0.000002367713,0.00002977974],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.7597305,"threshold_uncertainty_score":0.2910061,"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":"W1486653722","doi":"10.1090/s0002-9947-04-03687-6","title":"Resultants and discriminants of Chebyshev and related polynomials","year":2004,"lang":"en","type":"article","venue":"Transactions of the American Mathematical Society","topic":"Polynomial and algebraic computation","field":"Computer Science","cited_by":49,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"Dalhousie University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Algorithm; Semantics (computer science); Chebyshev polynomials; Annotation; Algebra over a field; Pure mathematics; Computer science; Artificial intelligence; Mathematical analysis; Programming language","retraction":null,"screen_n_in":null,"score":{"opus":0.01064461944058046,"gpt":0.2419512729268059,"spread":0.2313066534862255,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001621252,0.0000818886,0.0002336763,0.00001608198,0.00009555778,0.00001415712,0.0002375066,0.00002406027,0.000003759939],"category_scores_gemma":[0.00002741288,0.00005505144,0.0001123695,0.0003186003,0.0005844495,0.0001196777,0.00004128054,0.00008231324,0.000001009597],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001614062,"about_ca_system_score_gemma":0.00003624783,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00008833224,"about_ca_topic_score_gemma":0.000001498626,"domain_scores_codex":[0.9992945,0.00002909118,0.0002727602,0.000148752,0.0001395908,0.0001153243],"domain_scores_gemma":[0.9993698,0.0001363526,0.0001865777,0.0002306416,0.00002554624,0.0000510785],"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.0001350103,0.002218288,0.0007195561,0.001131877,0.0009732263,0.000003225783,0.07906557,0.002333076,0.1841743,0.2738901,0.000193071,0.4551626],"study_design_scores_gemma":[0.002822959,0.0006194001,0.08510333,0.0004957762,0.0002656502,0.0001534109,0.002477862,0.03643211,0.1110844,0.7599197,0.00002713283,0.0005982642],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.702161,0.00003500327,0.2958457,0.001668765,0.00002999532,0.00009798237,0.000005328439,0.00002223033,0.0001340635],"genre_scores_gemma":[0.9673277,0.0000403022,0.03253569,0.00004490183,0.000003694395,0.000002660299,9.99965e-8,0.00000416029,0.00004082919],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.4860296,"threshold_uncertainty_score":0.2244933,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1994077047","doi":"10.1016/j.tcs.2008.05.014","title":"Solving structured linear systems with large displacement rank","year":2008,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Polynomial and algebraic computation","field":"Computer Science","cited_by":49,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"Western University","funders":"CHIST-ERA; Agence Nationale de la Recherche; Natural Sciences and Engineering Research Council of Canada; Institut national de recherche en informatique et en automatique (INRIA); Microsoft Research","keywords":"Vandermonde matrix; Mathematics; Toeplitz matrix; Rank (graph theory); Logarithm; Interpolation (computer graphics); Exponent; Matrix (chemical analysis); Displacement (psychology); Multiplication (music); Cauchy distribution; Applied mathematics; Combinatorics; Pure mathematics; Mathematical analysis; Computer science; Motion (physics)","retraction":null,"screen_n_in":null,"score":{"opus":0.008182856888058834,"gpt":0.2243535310446579,"spread":0.2161706741565991,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000733735,0.0002162796,0.0002388754,0.000155877,0.0008433243,0.0002911742,0.001714106,0.00004016557,0.00001461455],"category_scores_gemma":[0.00002625408,0.0001507095,0.00004752971,0.0009869725,0.001274695,0.0007176551,0.0007730352,0.0001816803,0.0000488349],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00007566287,"about_ca_system_score_gemma":0.0002092128,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00000719204,"about_ca_topic_score_gemma":9.86464e-7,"domain_scores_codex":[0.9973079,0.00009060725,0.0002796133,0.0007249649,0.0008961845,0.0007007495],"domain_scores_gemma":[0.9986507,0.0001407079,0.00008735668,0.0006492019,0.0001686061,0.0003034725],"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.00001729882,0.00005084222,0.000159297,0.000009583747,0.000006566147,0.0000467909,0.0007986331,0.004486361,0.0002723789,0.9904371,0.00005927857,0.003655882],"study_design_scores_gemma":[0.000588821,0.0002627691,0.002148158,0.00003996445,0.000003867211,0.0002462323,0.000007027257,0.9881341,0.001097995,0.006977432,0.0002224693,0.0002711778],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1581722,0.00003796064,0.8397552,0.0003237194,0.0007008241,0.0001990927,0.000001577001,0.0002206029,0.0005888754],"genre_scores_gemma":[0.9167269,0.00000310338,0.08274209,0.0002751954,0.0002177248,0.000007239437,0.000001245513,0.000007862845,0.00001866121],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9836477,"threshold_uncertainty_score":0.6486254,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1992962227","doi":"10.1145/1113439.1113457","title":"On the complexity of the D5 principle","year":2005,"lang":"en","type":"article","venue":"ACM SIGSAM Bulletin","topic":"Polynomial and algebraic computation","field":"Computer Science","cited_by":48,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Western University","funders":"","keywords":"Mathematics; Factorization; Polynomial; Field (mathematics); Combinatorics; Algebraic number; Dimension (graph theory); Discrete mathematics; Arithmetic; Algorithm; Pure mathematics","retraction":null,"screen_n_in":null,"score":{"opus":0.03795610971846533,"gpt":0.2508061939533336,"spread":0.2128500842348683,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002633153,0.00008155114,0.00008436188,0.00001774514,0.0001583488,0.00003869158,0.001741104,0.00002378843,0.0002266694],"category_scores_gemma":[0.0003646817,0.00004340153,0.00007225723,0.0001597834,0.0001465446,0.00003139509,0.0006657102,0.0001209986,0.0002936979],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002167907,"about_ca_system_score_gemma":0.00003192833,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00003500584,"about_ca_topic_score_gemma":0.00001132039,"domain_scores_codex":[0.9991843,0.00009847816,0.0001629151,0.0001751734,0.0002282842,0.0001508915],"domain_scores_gemma":[0.9984989,0.000458042,0.0000996471,0.0008823317,0.00003214485,0.00002897903],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","study_design_scores_codex":[0.000007893563,0.0001007535,0.0001013057,0.000003976077,0.0000105508,5.599498e-7,0.0004468115,0.000661211,0.0005707064,0.9173936,0.04841564,0.03228705],"study_design_scores_gemma":[0.0005272918,0.0001256985,0.04427537,0.00005573689,0.000005767936,0.00001013756,0.00001928347,0.01808818,0.02418212,0.1454031,0.7670399,0.0002674543],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.6251169,0.00006711446,0.01491831,0.3512274,0.0004719941,0.0003684092,0.000005890525,0.0001219685,0.007702019],"genre_scores_gemma":[0.991514,0.000001416665,0.00448183,0.003416183,0.0001010701,0.00000685913,5.427389e-7,0.000003816884,0.0004742673],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.7719905,"threshold_uncertainty_score":0.377499,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1989618424","doi":"10.1145/1005285.1005321","title":"Maximal quotient rational reconstruction","year":2004,"lang":"en","type":"article","venue":"","topic":"Polynomial and algebraic computation","field":"Computer Science","cited_by":45,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Simon Fraser University","funders":"","keywords":"Modulo; Mathematics; Integer (computer science); Quotient; Rational number; Product (mathematics); Discrete mathematics; Image (mathematics); Combinatorics; Binary logarithm; Algorithm; Computer science; Artificial intelligence","retraction":null,"screen_n_in":null,"score":{"opus":0.01124719979138998,"gpt":0.2119374490788736,"spread":0.2006902492874836,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00004847007,0.00004305591,0.00003716912,0.00004205831,0.00006514981,0.00006209522,0.0001392785,0.00001591917,0.00003429498],"category_scores_gemma":[0.000005822304,0.00003762674,0.00002468762,0.0001194417,0.00001463561,0.0003827506,0.00004523083,0.00003203451,0.0001372289],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004153193,"about_ca_system_score_gemma":0.00007012397,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002672225,"about_ca_topic_score_gemma":0.000008214651,"domain_scores_codex":[0.9995661,0.000007309105,0.00009494107,0.000140675,0.0001037473,0.00008722803],"domain_scores_gemma":[0.9998102,0.000009330529,0.00002457858,0.00009156452,0.00002674547,0.00003759307],"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.000001672908,0.00002293565,0.00007408924,8.559357e-7,0.000002746828,0.000001488619,0.00009296784,0.001823275,0.0005647123,0.7892351,0.0001312275,0.2080489],"study_design_scores_gemma":[0.001622555,0.0002099595,0.02972048,0.00002131504,0.000003591306,0.0003953359,0.00003887297,0.0774437,0.02538432,0.8612621,0.003478848,0.0004189618],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1287201,0.000007128569,0.8625622,0.002199297,0.000547738,0.00003981895,2.141381e-7,0.000124568,0.005798856],"genre_scores_gemma":[0.8956684,7.233527e-7,0.1037728,0.0002905856,0.00008408721,0.000002748526,0.00000134547,0.000001344556,0.0001779748],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.7669482,"threshold_uncertainty_score":0.1763846,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2346605091","doi":"10.1007/jhep06(2016)094","title":"Elliptic scattering equations","year":2016,"lang":"en","type":"article","venue":"Journal of High Energy Physics","topic":"Polynomial and algebraic computation","field":"Computer Science","cited_by":44,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":false,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"","funders":"Universidade de São Paulo; Institut Périmètre de physique théorique; Zhejiang University; Conselho Nacional de Desenvolvimento Científico e Tecnológico; National Center for Theoretical Sciences","keywords":"Jacobian matrix and determinant; Mathematics; Genus; Elliptic curve; Loop (graph theory); Elliptic function; Variety (cybernetics); Pure mathematics; Order (exchange); Elliptic rational functions; Algebraic equation; Algebraic number; Jacobi elliptic functions; Algebraic curve; Quarter period; Applied mathematics; Algebra over a field; Mathematical analysis; Physics; Combinatorics; Nonlinear system","retraction":null,"screen_n_in":null,"score":{"opus":0.01422084148053227,"gpt":0.2192137693560283,"spread":0.2049929278754961,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00007681652,0.00006213893,0.0001051059,0.00004916254,0.00004816192,0.00004648874,0.0003504248,0.00001537474,0.000004605211],"category_scores_gemma":[0.00001367744,0.00003930843,0.00006976409,0.0001457877,0.00001955798,0.000607926,0.00006722481,0.00003650408,0.00001365119],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003718911,"about_ca_system_score_gemma":0.00006011894,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000008081835,"about_ca_topic_score_gemma":8.848709e-7,"domain_scores_codex":[0.9993958,0.00002484714,0.0002091205,0.00007802701,0.000182057,0.0001101376],"domain_scores_gemma":[0.999366,0.0001326047,0.0002128994,0.0001343771,0.00009465142,0.00005949832],"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.000001805954,0.0000250462,0.000009700928,9.442002e-7,0.00001326676,0.000004720475,0.00003459216,0.0007401511,0.004408305,0.7625299,0.0002113679,0.2320202],"study_design_scores_gemma":[0.0005150897,0.0001214022,0.0008293166,0.00006895109,0.00001053474,0.00003205663,0.00000211067,0.00519981,0.02971188,0.9611999,0.002171373,0.0001375286],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02476257,0.00003705746,0.9727435,0.001766211,0.0005518836,0.000006368951,3.742646e-7,0.00001644052,0.0001155576],"genre_scores_gemma":[0.9909918,0.00001542072,0.008066371,0.000163473,0.0006026678,5.455759e-7,1.442605e-7,0.000004237313,0.0001553134],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9662293,"threshold_uncertainty_score":0.1602951,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2963674359","doi":"10.1017/s1474748010000010","title":"Jet and prolongation spaces","year":2010,"lang":"en","type":"article","venue":"Journal of the Institute of Mathematics of Jussieu","topic":"Polynomial and algebraic computation","field":"Computer Science","cited_by":44,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo","funders":"","keywords":"Prolongation; Mathematics; Jet (fluid); Variety (cybernetics); Algebraic number; Pure mathematics; Differential (mechanical device); Algebra over a field; Mathematical analysis; Statistics; Physics","retraction":null,"screen_n_in":null,"score":{"opus":0.01131618703653951,"gpt":0.2346837702528618,"spread":0.2233675832163223,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004656878,0.00006013798,0.0001750933,0.00007104271,0.00003930328,0.00003166804,0.0005265745,0.00003310056,0.000001294123],"category_scores_gemma":[0.0002131043,0.00003405742,0.00007115288,0.0001185719,0.0001122359,0.0004190673,0.0001212683,0.0001389422,4.667797e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000004672966,"about_ca_system_score_gemma":0.00009523959,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000004427092,"about_ca_topic_score_gemma":0.000009405159,"domain_scores_codex":[0.999252,0.00001328896,0.0003796015,0.00004863991,0.0002495369,0.00005698798],"domain_scores_gemma":[0.9987417,0.00006921055,0.0008359545,0.0001890944,0.0001301261,0.00003385861],"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.00003387113,0.0008429389,0.002591204,0.0008766052,0.0001912332,0.00001066699,0.009642678,0.001458918,0.3159564,0.596744,0.001081325,0.07057018],"study_design_scores_gemma":[0.002025841,0.0005546021,0.02618451,0.001064758,0.0001535969,0.0009240772,0.0002162606,0.06457437,0.3194872,0.5813934,0.003065039,0.0003563481],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9636122,0.00003962976,0.03341613,0.001756625,0.0008443739,0.0000629462,6.092162e-7,0.000004111625,0.0002633741],"genre_scores_gemma":[0.8876203,0.000004883304,0.1122746,0.00001759599,0.00006030059,2.601823e-7,3.964207e-8,0.000002034701,0.00001994597],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.07885851,"threshold_uncertainty_score":0.1388821,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2026111379","doi":"10.1145/780506.780512","title":"A geometric-numeric algorithm for absolute factorization of multivariate polynomials","year":2002,"lang":"en","type":"article","venue":"","topic":"Polynomial and algebraic computation","field":"Computer Science","cited_by":44,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Wilfrid Laurier University; Western University","funders":"","keywords":"Mathematics; Interpolation (computer graphics); Algorithm; Factorization; Factorization of polynomials; Computation; Algebra over a field; Applied mathematics; Computer science; Polynomial; Pure mathematics; Mathematical analysis; Matrix polynomial; Artificial intelligence","retraction":null,"screen_n_in":null,"score":{"opus":0.02704636221809897,"gpt":0.2488634440236337,"spread":0.2218170818055347,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001335457,0.0001068394,0.0001790449,0.0002408865,0.00006819304,0.0000573902,0.0003549409,0.00004550971,0.00005556757],"category_scores_gemma":[0.00006584082,0.00009423427,0.00008551764,0.0007824178,0.00001552731,0.000387753,0.00008665199,0.00003332353,0.00002517567],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002687709,"about_ca_system_score_gemma":0.00001618915,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00008353964,"about_ca_topic_score_gemma":0.000001204786,"domain_scores_codex":[0.9990577,0.00002464974,0.0002951298,0.0002542222,0.0001585452,0.0002098018],"domain_scores_gemma":[0.9992644,0.0002005659,0.0001615888,0.0002083043,0.00009963538,0.00006548646],"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.000001341412,0.00006979776,0.00001047844,0.000006881302,0.00001657292,3.333965e-7,0.0001831203,0.0001127695,0.001778749,0.005247886,0.0008212367,0.9917508],"study_design_scores_gemma":[0.0006713602,0.00013441,0.002503769,0.000005953809,0.000006223731,0.000002413692,0.00000426,0.9825968,0.008342587,0.002546638,0.003022065,0.0001635038],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0009631001,0.00008678131,0.9972062,0.000298043,0.0005000785,0.0002433924,0.00001063127,0.0001160483,0.0005757596],"genre_scores_gemma":[0.6485353,0.000009836733,0.3496263,0.00009836917,0.0001128595,0.00001548897,0.000004053721,0.000007807833,0.001590039],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9915873,"threshold_uncertainty_score":0.3842762,"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":"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":"W2034438073","doi":"10.1016/s0012-365x(02)00442-9","title":"A criterion for the applicability of Zeilberger's algorithm to rational functions","year":2002,"lang":"en","type":"article","venue":"Discrete Mathematics","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":"University of Waterloo","funders":"Univerza v Ljubljani","keywords":"Mathematics; Combinatorics; Generating function; Algorithm","retraction":null,"screen_n_in":null,"score":{"opus":0.02481368113949652,"gpt":0.2568352382709909,"spread":0.2320215571314944,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001959495,0.00007724387,0.000112347,0.0000341583,0.0001310843,0.00005726792,0.0003268879,0.00002154403,0.0000335062],"category_scores_gemma":[0.00007815268,0.00005238328,0.00008415926,0.0002077419,0.0000309171,0.0001136281,0.00009699383,0.00003566859,0.000031028],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001470433,"about_ca_system_score_gemma":0.00001101517,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00000376114,"about_ca_topic_score_gemma":0.000001863898,"domain_scores_codex":[0.9993048,0.00001335423,0.0002412314,0.0001564175,0.0001644171,0.0001197884],"domain_scores_gemma":[0.9990726,0.0003936467,0.00007441311,0.000333049,0.00008116534,0.00004515847],"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.000007593658,0.0004584239,0.00002124599,0.0001740669,0.00008213847,4.714881e-7,0.01005975,0.00193548,0.00193783,0.3172728,0.01616629,0.6518839],"study_design_scores_gemma":[0.0001250675,0.00005679132,0.0001757388,0.00001106567,0.00001059517,0.000003039964,0.00008814895,0.9675554,0.0004740223,0.02674682,0.004671176,0.00008215445],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.002411922,0.00003149565,0.9937705,0.002726204,0.0001643217,0.0004190904,0.00002497897,0.00004229905,0.000409138],"genre_scores_gemma":[0.4083096,0.000003058259,0.5900429,0.0003226306,0.0001840811,0.0002802023,0.000008965978,0.00001143441,0.0008371017],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.9656199,"threshold_uncertainty_score":0.2136128,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2588207498","doi":"10.1007/s00222-018-0787-z","title":"On the nature of the generating series of walks in the quarter plane","year":2018,"lang":"en","type":"article","venue":"Inventiones mathematicae","topic":"Polynomial and algebraic computation","field":"Computer Science","cited_by":42,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":false,"ca_fund":false,"ca_venue":false,"about_ca":true},"ca_institutions":"","funders":"Agence Nationale de la Recherche","keywords":"Series (stratigraphy); Generating function; Algebraic number; Quarter (Canadian coin); Rational function; Plane (geometry); Nonlinear system","retraction":null,"screen_n_in":null,"score":{"opus":0.01567003671732522,"gpt":0.2368232796214876,"spread":0.2211532429041624,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004533335,0.0000612295,0.00008767851,0.00002814348,0.000098736,0.00003461137,0.0006381651,0.00003384689,0.00002362762],"category_scores_gemma":[0.00009545527,0.00002594711,0.00005758518,0.0002442545,0.0001142135,0.00009481738,0.00007885401,0.0001068105,0.000009322593],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000004995464,"about_ca_system_score_gemma":0.00001723741,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000006048416,"about_ca_topic_score_gemma":0.00002767854,"domain_scores_codex":[0.9992549,0.0001227605,0.0002323626,0.00008990722,0.0002190371,0.00008103903],"domain_scores_gemma":[0.9991551,0.0002658663,0.0001595698,0.0003718587,0.00004052275,0.000007103494],"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.00000289582,0.0000621687,0.00004297182,0.0000320235,0.000007676148,3.049969e-7,0.005056019,0.00001832787,0.001821555,0.9906605,0.00160968,0.0006859142],"study_design_scores_gemma":[0.0001918468,0.0001550682,0.004689438,0.0002936938,0.000008130986,0.00002292753,0.0006137414,0.03510177,0.0251836,0.9334192,0.0002235319,0.00009709315],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9777828,0.00002620318,0.01252193,0.006948108,0.0002681175,0.0002167175,0.00000204718,0.00001401875,0.002220085],"genre_scores_gemma":[0.9979177,4.451592e-7,0.001571251,0.0003635202,0.000055861,0.000009985379,3.277296e-7,0.000002245964,0.00007872562],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.0572413,"threshold_uncertainty_score":0.118588,"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":"W2118254039","doi":"10.1007/s10208-014-9212-1","title":"A Baby Step–Giant Step Roadmap Algorithm for General Algebraic Sets","year":2014,"lang":"en","type":"article","venue":"Foundations of Computational Mathematics","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":"Western University","funders":"Agence Nationale de la Recherche","keywords":"Bounded function; Combinatorics; Degree (music); Mathematics; Algebraic number; Domain (mathematical analysis); Polynomial; Field (mathematics); Discrete mathematics; Physics; Mathematical analysis; Pure mathematics","retraction":null,"screen_n_in":null,"score":{"opus":0.0186907334444419,"gpt":0.273940486897728,"spread":0.2552497534532862,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004861031,0.0002159987,0.0003327729,0.0002387221,0.0002503883,0.0001829637,0.0006774139,0.00006789687,0.00002245079],"category_scores_gemma":[0.0001317444,0.0002145084,0.0001694399,0.0003978977,0.00008373747,0.0004568336,0.0001639083,0.00008444193,0.00006405766],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00005634654,"about_ca_system_score_gemma":0.0002084804,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0000113201,"about_ca_topic_score_gemma":0.000004675674,"domain_scores_codex":[0.9981138,0.00006797009,0.0007080867,0.0003485748,0.0004866507,0.0002749614],"domain_scores_gemma":[0.9975847,0.001014742,0.0004153531,0.0003873906,0.0004854545,0.0001123517],"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.000002191914,0.0002297378,0.000004026666,0.00007274745,0.00005374114,3.485834e-7,0.0003633488,0.01311556,0.00007287522,0.7146649,0.001357072,0.2700635],"study_design_scores_gemma":[0.0004815488,0.00009499455,0.0004746739,0.00002777295,0.00001466884,0.00001238395,0.00001377048,0.6507913,0.00005340651,0.3460874,0.00179215,0.0001559885],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.00806873,0.00002099558,0.9895192,0.0007429568,0.0004066769,0.0004742352,0.00003863766,0.0001455417,0.0005829777],"genre_scores_gemma":[0.06465136,0.000001158526,0.9345382,0.0001956484,0.0001515519,0.00006498809,0.0001528799,0.00002030329,0.0002239489],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.6376757,"threshold_uncertainty_score":0.8747399,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2133262123","doi":"10.1023/a:1022307527408","title":"A Recursive Test for P-Matrices","year":2000,"lang":"en","type":"article","venue":"BIT Numerical Mathematics","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 Regina","funders":"","keywords":"MATLAB; Mathematics; Matrix (chemical analysis); Computer science; Schur decomposition; Algorithm; Combinatorics; Schur complement; Physics; Eigenvalues and eigenvectors; Programming language","retraction":null,"screen_n_in":null,"score":{"opus":0.01469804927708796,"gpt":0.2498188976586915,"spread":0.2351208483816035,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00009588797,0.0001061569,0.0001637763,0.00003808176,0.00008938053,0.00009954976,0.0004375518,0.00003670395,0.00007326027],"category_scores_gemma":[0.0001475387,0.00008728093,0.00007994039,0.0003153325,0.00001991489,0.0001748284,0.00004468157,0.00004849473,0.0003054047],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0000198217,"about_ca_system_score_gemma":0.00002951218,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000003809136,"about_ca_topic_score_gemma":2.226789e-7,"domain_scores_codex":[0.9991986,0.00001053889,0.0002248271,0.0002045958,0.0001479445,0.0002134969],"domain_scores_gemma":[0.9988886,0.0006800636,0.00007459478,0.0002342521,0.00004005804,0.00008245116],"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.000009040095,0.0007460282,0.0000311354,0.00012751,0.00002571661,0.000007745874,0.002088285,0.0002036653,0.0002077623,0.1645839,0.01266552,0.8193037],"study_design_scores_gemma":[0.0005124428,0.0003661806,0.000215766,0.00006015887,0.0000189885,0.00004137296,0.00003101903,0.5038253,0.0007501009,0.4427952,0.05101095,0.0003725176],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.007035382,0.00008878513,0.9874288,0.001527497,0.0001032011,0.0002641788,0.000006015081,0.0002008301,0.003345311],"genre_scores_gemma":[0.1692008,0.00002679859,0.8280097,0.0006467686,0.0002249767,0.00007698217,0.000004140809,0.00001854669,0.001791335],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.8189312,"threshold_uncertainty_score":0.3925462,"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}]}