{"meta":{"query_hash":"b7be761f8c55","filters":{"topic":"Polynomial and algebraic computation"},"cohort_total":656,"direct_labels_cover":1,"predictions_cover":656,"exported":656,"export_cap":100000,"truncated":false,"label_status":"direct model label, unvalidated","prediction_status":"machine_predicted_unvalidated (Codex and Gemma teacher distillation)","score_status":"score_only:v0-immature-baseline","snapshot":{"source":"OpenAlex, pinned release, all 482 partitions","release":"2026-06-24","frame_built":"2026-07-12"},"permalink":"https://metacan.xera.ac/q/b7be761f8c55","api":"https://metacan.xera.ac/api/v1/cohort?topic=Polynomial+and+algebraic+computation"},"results":[{"id":"W10666019","doi":"10.1007/bfb0084632","title":"Minimal generation of basic semi-algebraic sets over an arbitrary ordered field","year":2006,"lang":"en","type":"book-chapter","venue":"Lecture notes in mathematics","topic":"Polynomial and algebraic computation","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Saskatchewan","funders":"","keywords":"Algebraic number; Field (mathematics); Mathematics; Algebra over a field; Computer science; Pure mathematics; Mathematical analysis","score_opus":0.021370454188070584,"score_gpt":0.24485381348881918,"score_spread":0.22348335930074859,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W10666019","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.025241995,0.0005415452,0.9497973,0.00038537008,0.0005037655,0.0004786329,0.000022845516,0.00014092006,0.022887625],"genre_scores_gemma":[0.5803052,0.00006573792,0.40871412,0.0019363937,0.0017283565,0.000025736404,0.00038761838,0.00018690241,0.00664991],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99824834,0.000029598965,0.0006558171,0.0004535875,0.00037859933,0.000234065],"domain_scores_gemma":[0.9983719,0.00047259746,0.00040900637,0.00062339864,0.000066612665,0.00005646203],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00017168408,0.0003667936,0.0004973652,0.00025692978,0.000048199967,0.00008367108,0.0005774973,0.0004377612,0.00009219694],"category_scores_gemma":[0.00008570361,0.0003435459,0.00013901194,0.000115875075,0.00004294965,0.00021370356,0.00014243153,0.00039917408,0.000012644887],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000040518786,0.00062356866,0.00012235426,0.0017936912,0.00021760285,0.00017151127,0.006624092,0.014634821,0.006512614,0.6778653,0.0050157984,0.2863781],"study_design_scores_gemma":[0.00027861286,0.0001765866,0.000051948333,0.00025648426,0.000027472663,0.00002106545,7.8563943e-7,0.29258862,0.004664953,0.7010487,0.00044981323,0.0004349504],"about_ca_topic_score_codex":0.00002817453,"about_ca_topic_score_gemma":0.00015643056,"teacher_disagreement_score":0.55506325,"about_ca_system_score_codex":0.000053591128,"about_ca_system_score_gemma":0.00014145402,"threshold_uncertainty_score":0.99990165},"labels":[],"label_agreement":null},{"id":"W109992319","doi":"10.1080/00029890.2005.11920226","title":"Continuous Ranking of Zeros of Cylinder Functions","year":2005,"lang":"en","type":"article","venue":"American Mathematical Monthly","topic":"Polynomial and algebraic computation","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"York University","funders":"","keywords":"Ranking (information retrieval); Cylinder; Mathematics; Computer science; Geometry; Artificial intelligence","score_opus":0.009465533531038328,"score_gpt":0.2337753574619588,"score_spread":0.22430982393092047,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W109992319","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.19197214,0.00003715741,0.787472,0.00076689327,0.000053762258,0.00012321872,0.0000039722654,0.00007401583,0.019496847],"genre_scores_gemma":[0.9225236,5.9266205e-7,0.077195145,0.00012214408,0.000041094536,0.000006361773,7.823084e-7,0.000005620022,0.00010461874],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990209,0.000035163364,0.00039102352,0.00016716069,0.0002219585,0.00016381433],"domain_scores_gemma":[0.9990603,0.00027210137,0.000245212,0.00029091674,0.00006848431,0.00006300057],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00014520557,0.00009256734,0.0003158565,0.000072413815,0.000032121727,0.000015995565,0.000320537,0.000019809922,0.000028463282],"category_scores_gemma":[0.000083291314,0.00007839516,0.00009769759,0.00032097506,0.0001922296,0.00015230897,0.00007353862,0.00006586251,0.00004106729],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000027909993,0.0007792075,0.00041546434,0.00008449764,0.00010373507,0.0000033748672,0.0032436745,0.002574258,0.008283417,0.5907976,0.0006160476,0.39307082],"study_design_scores_gemma":[0.0017244287,0.001065201,0.0137319155,0.00025597954,0.00009726356,0.000026365617,0.0008261535,0.54597,0.028403398,0.4050665,0.0020828985,0.00074986456],"about_ca_topic_score_codex":0.000037423593,"about_ca_topic_score_gemma":0.0000025642,"teacher_disagreement_score":0.7305515,"about_ca_system_score_codex":0.000014533768,"about_ca_system_score_gemma":0.000033283846,"threshold_uncertainty_score":0.3196862},"labels":[],"label_agreement":null},{"id":"W1126727304","doi":"10.1090/spmj/1359","title":"Tropical noetherity and Gröbner bases","year":2015,"lang":"en","type":"article","venue":"St Petersburg Mathematical Journal","topic":"Polynomial and algebraic computation","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Mathematics; Gröbner basis; Basis (linear algebra); Ideal (ethics); Algebra over a field; Pure mathematics; Discrete mathematics; Combinatorics; Polynomial; Mathematical analysis; Geometry; Law","score_opus":0.03276060357873099,"score_gpt":0.2613118432941369,"score_spread":0.22855123971540592,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1126727304","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.17029057,0.000072895265,0.8241852,0.0032032891,0.00027823806,0.000052868538,9.3790993e-7,0.00006615509,0.0018498643],"genre_scores_gemma":[0.8902166,0.0000072263524,0.10870726,0.0005024696,0.00039219376,0.0000029653024,3.5962483e-7,0.000009187311,0.00016177376],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989017,0.00009430414,0.0002627703,0.00017195594,0.0003334906,0.00023577012],"domain_scores_gemma":[0.9991041,0.000152828,0.000076875156,0.0001628725,0.00007136385,0.0004320008],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00034630028,0.00011560617,0.00018518271,0.000059470065,0.000100842546,0.00032734877,0.0003290912,0.000040023504,0.000046974757],"category_scores_gemma":[0.00019342794,0.000082887214,0.000063201194,0.00009871806,0.000082045,0.00042738777,0.00018010417,0.00021403155,0.000051277984],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000091058355,0.0006683674,0.0017140111,0.00010207958,0.00012456771,0.00064537494,0.0055499347,0.000067525405,0.00096117664,0.73640877,0.023090193,0.23057692],"study_design_scores_gemma":[0.0011559683,0.00033498084,0.0028912453,0.00007997663,0.000018530538,0.0029383074,0.00018199669,0.05948945,0.00023248492,0.9276059,0.0047554784,0.00031565627],"about_ca_topic_score_codex":0.0000012492326,"about_ca_topic_score_gemma":3.9334006e-7,"teacher_disagreement_score":0.719926,"about_ca_system_score_codex":0.000035838755,"about_ca_system_score_gemma":0.000079315054,"threshold_uncertainty_score":0.33800426},"labels":[],"label_agreement":null},{"id":"W1128846365","doi":"10.1515/math-2015-0028","title":"A signature-based algorithm for computingGröbner-Shirshov bases in skew solvablepolynomial rings","year":2015,"lang":"en","type":"article","venue":"Open Mathematics","topic":"Polynomial and algebraic computation","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Manitoba","funders":"Natural Sciences and Engineering Research Council of Canada; University of Manitoba","keywords":"Polynomial ring; Mathematics; Noncommutative geometry; Skew; Signature (topology); Polynomial; Matrix polynomial; Algebra over a field; Discrete mathematics; Pure mathematics; Computer science","score_opus":0.05302295231552825,"score_gpt":0.2992289198966046,"score_spread":0.24620596758107635,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1128846365","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00406059,0.000067978304,0.99149317,0.00077467837,0.0004042825,0.0008669888,0.000008381706,0.00010071158,0.0022232323],"genre_scores_gemma":[0.047596417,6.886594e-7,0.9511976,0.0005895876,0.00014116256,0.00007960298,0.000013177564,0.000021357906,0.000360409],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99844116,0.000051663177,0.00045048018,0.00039904824,0.0002727795,0.00038485826],"domain_scores_gemma":[0.9986269,0.00045046123,0.00021657816,0.0004185706,0.0001149766,0.00017250414],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009893699,0.00020955794,0.00036945124,0.00013472982,0.00010266853,0.0005915937,0.0015775936,0.00008655486,0.0000065242502],"category_scores_gemma":[0.00014720729,0.00019232719,0.00007655468,0.00038464039,0.000034957175,0.0004947679,0.0005648466,0.00013957421,0.00003567678],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000047220612,0.0014194694,0.00008492074,0.00021764054,0.00004688833,0.00005324404,0.0050481698,0.0038064113,0.00022981787,0.0880677,0.02104119,0.87993735],"study_design_scores_gemma":[0.0017259781,0.00013975604,0.0000280036,0.00011299706,0.000007346503,0.000008183295,0.000050818126,0.9417693,0.0013002898,0.05079304,0.003796041,0.0002682198],"about_ca_topic_score_codex":0.000114511895,"about_ca_topic_score_gemma":0.000034555458,"teacher_disagreement_score":0.9379629,"about_ca_system_score_codex":0.00010381785,"about_ca_system_score_gemma":0.00039320032,"threshold_uncertainty_score":0.7842875},"labels":[],"label_agreement":null},{"id":"W117318515","doi":"10.1007/978-0-387-77247-9_27","title":"A Military Application of Viability: Winning Cones, Differential Inclusions, and Lanchester Type Models for Combat","year":2008,"lang":"en","type":"book-chapter","venue":"Springer optimization and its applications","topic":"Polynomial and algebraic computation","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Royal Military College of Canada","funders":"","keywords":"Operations research; Mathematical economics; Differential inclusion; Computer science; Set (abstract data type); Differential (mechanical device); Type (biology); Variety (cybernetics); Mathematics; Mathematical optimization; Artificial intelligence; Engineering","score_opus":0.0184521256818352,"score_gpt":0.22887324496273398,"score_spread":0.2104211192808988,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W117318515","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0003455193,0.002117544,0.9943513,0.0003667848,0.000058812006,0.0013134719,0.000041908792,0.0000894979,0.0013151041],"genre_scores_gemma":[0.57921314,0.012487688,0.38788387,0.00083006214,0.0006388756,0.0012846359,0.0013819969,0.00019056247,0.016089177],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99881476,0.000012042891,0.00039526768,0.0005038952,0.00014631226,0.00012772894],"domain_scores_gemma":[0.9989691,0.00012215239,0.00021168317,0.0003455502,0.00026171666,0.00008979494],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000084373896,0.00021319283,0.0002957062,0.00014200865,0.00024511194,0.00002832622,0.00022834257,0.00016935919,0.0000063876687],"category_scores_gemma":[0.000010264377,0.00021924726,0.00005335531,0.00008232619,0.00008188994,0.00023140952,0.00029443577,0.00010858874,0.0000019291485],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004409509,0.0001471407,0.00003370118,0.0004795064,0.00011206098,3.3645938e-7,0.0010551449,0.058186322,0.0007055197,0.8542806,0.00045579908,0.084499806],"study_design_scores_gemma":[0.00035393148,0.000045314042,0.00007670273,0.00004041067,0.00003945975,0.0000054273814,0.0000034480772,0.96795374,0.000053047246,0.0142569095,0.016919088,0.00025250576],"about_ca_topic_score_codex":0.000008412311,"about_ca_topic_score_gemma":0.0000026222067,"teacher_disagreement_score":0.90976745,"about_ca_system_score_codex":0.000029028586,"about_ca_system_score_gemma":0.000058714937,"threshold_uncertainty_score":0.89406437},"labels":[],"label_agreement":null},{"id":"W1202646857","doi":"10.1515/spma-2015-0007","title":"Completely positive matrices over Boolean algebras and their CP-rank","year":2015,"lang":"en","type":"article","venue":"Special Matrices","topic":"Polynomial and algebraic computation","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Guelph","funders":"","keywords":"Mathematics; Rank (graph theory); Boolean algebras canonically defined; Stone's representation theorem for Boolean algebras; Boolean algebra; Combinatorics; Two-element Boolean algebra; Algebra over a field; Pure mathematics; Discrete mathematics; Algebra representation","score_opus":0.018544019809179087,"score_gpt":0.2380240143071797,"score_spread":0.21947999449800062,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1202646857","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9173351,0.0029182502,0.044019446,0.002388212,0.0022878896,0.00040861772,0.00004252631,0.00040141112,0.03019855],"genre_scores_gemma":[0.99199194,0.000063539715,0.0040309117,0.00050553936,0.003192657,0.000008129154,0.0000074181994,0.000014143842,0.00018571567],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99868083,0.00007676925,0.00024889674,0.0004097467,0.00027754254,0.0003062295],"domain_scores_gemma":[0.9991501,0.0001736684,0.00015212942,0.00022213833,0.00008412786,0.00021782462],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00022562654,0.00020969516,0.00024068201,0.0001850588,0.0001610739,0.0004315651,0.0005598957,0.000060669194,0.000038228576],"category_scores_gemma":[0.000030615993,0.00016876541,0.00006473161,0.00048898126,0.000075324846,0.00080281304,0.00036692363,0.00011716424,0.00012822873],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00016648117,0.00022698598,0.0038844694,0.000059644583,0.00013068954,0.00009478931,0.012450196,0.00009004066,0.0007163146,0.34532395,0.05751674,0.57933974],"study_design_scores_gemma":[0.0052625365,0.0015013843,0.23622912,0.00017048857,0.00008865635,0.00027442328,0.0014547798,0.037143253,0.0050545526,0.48187482,0.22831768,0.0026283031],"about_ca_topic_score_codex":0.00022676463,"about_ca_topic_score_gemma":0.000051845698,"teacher_disagreement_score":0.5767114,"about_ca_system_score_codex":0.00005068536,"about_ca_system_score_gemma":0.00008269354,"threshold_uncertainty_score":0.68820536},"labels":[],"label_agreement":null},{"id":"W1482222746","doi":"10.1007/978-3-662-43799-5_17","title":"An Incremental Algorithm for Computing Cylindrical Algebraic Decompositions","year":2014,"lang":"en","type":"book-chapter","venue":"","topic":"Polynomial and algebraic computation","field":"Computer Science","cited_by":33,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"","keywords":"Tree (set theory); Maple; Algorithm; Algebraic number; Refining (metallurgy); Polynomial; Mathematics; Constraint (computer-aided design); Computer science; Algebra over a field; Pure mathematics; Geometry; Combinatorics; Mathematical analysis","score_opus":0.016040451625841803,"score_gpt":0.2609907047869749,"score_spread":0.24495025316113309,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1482222746","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00002785697,0.00004887919,0.92830086,0.0003204708,0.00069623854,0.00043995515,0.000025728337,0.00044153508,0.06969846],"genre_scores_gemma":[0.015772097,0.0000059239055,0.9350706,0.0020584024,0.0018658063,0.000021544152,0.0004885756,0.000081644954,0.044635437],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9979367,0.00003145539,0.0005177034,0.00080545724,0.00032751853,0.0003811527],"domain_scores_gemma":[0.9985567,0.00027093277,0.00023770805,0.0005518528,0.00012821835,0.00025460625],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00027174503,0.0003950879,0.00042686844,0.00022615882,0.0003562567,0.00030643085,0.0010550385,0.00024672906,0.000075965145],"category_scores_gemma":[0.000005526652,0.00038978932,0.00025972776,0.000050297753,0.000063861946,0.0002463292,0.00032792156,0.00025598714,0.00015695803],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000013834583,0.00002297389,3.3664531e-7,0.0000066008906,0.000027435737,0.0000026632945,0.000035131532,0.000034588298,0.00002898858,0.47577113,0.00093528774,0.52313346],"study_design_scores_gemma":[0.00053709914,0.00039301827,0.000025636746,0.00005687353,0.000031916254,0.000046745987,0.000002320988,0.8655251,0.00015129651,0.10109783,0.031523522,0.000608623],"about_ca_topic_score_codex":0.00001679612,"about_ca_topic_score_gemma":0.000011295548,"teacher_disagreement_score":0.86549056,"about_ca_system_score_codex":0.000113743394,"about_ca_system_score_gemma":0.00010965045,"threshold_uncertainty_score":0.9998554},"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,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"Natural Sciences and Engineering Research Council of Canada; National Science Foundation","keywords":"Mathematics; Pure mathematics","score_opus":0.025435549152556906,"score_gpt":0.23828597332990892,"score_spread":0.212850424177352,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1485445902","genre_codex":"methods","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00008982944,0.004256811,0.61717284,0.0022971854,0.00019616778,0.0009203678,0.00008835141,0.0012319692,0.37374648],"genre_scores_gemma":[0.0122593995,0.006231839,0.27907354,0.0047023604,0.0010733369,0.00039233724,0.00014858076,0.0012236567,0.69489497],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99730366,0.000120139994,0.0007458536,0.0007979513,0.00053672347,0.00049565686],"domain_scores_gemma":[0.99720097,0.0005584274,0.0007118936,0.001114396,0.000054518852,0.00035979864],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00022154723,0.00067705376,0.0012956467,0.000105895815,0.00020469788,0.00014499978,0.0009933243,0.00023497854,0.00022916435],"category_scores_gemma":[0.0001005747,0.00052369013,0.00052673375,0.00052984135,0.0009322647,0.0001952125,0.0005656078,0.00051210885,0.0002623162],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000015950378,0.0004129964,0.000020281677,0.0011302225,0.00029562722,0.000013306102,0.0016684259,3.6227996e-7,0.000012583557,0.025859736,0.967696,0.0028888576],"study_design_scores_gemma":[0.0019454504,0.0007484198,0.00029191322,0.0063102846,0.0002713794,0.0006853418,0.0018182858,0.090713,0.000042087817,0.16197407,0.7312646,0.0039351527],"about_ca_topic_score_codex":0.000052494062,"about_ca_topic_score_gemma":0.0000047104863,"teacher_disagreement_score":0.33809927,"about_ca_system_score_codex":0.00006919028,"about_ca_system_score_gemma":0.00025588868,"threshold_uncertainty_score":0.99972147},"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,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Dalhousie University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Algorithm; Semantics (computer science); Chebyshev polynomials; Annotation; Algebra over a field; Pure mathematics; Computer science; Artificial intelligence; Mathematical analysis; Programming language","score_opus":0.010644619440580459,"score_gpt":0.24195127292680593,"score_spread":0.23130665348622548,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1486653722","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.70216095,0.000035003268,0.29584566,0.0016687647,0.000029995317,0.00009798237,0.000005328439,0.000022230332,0.00013406352],"genre_scores_gemma":[0.96732765,0.000040302202,0.032535695,0.000044901833,0.0000036943945,0.000002660299,9.99965e-8,0.0000041602902,0.00004082919],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99929446,0.000029091178,0.00027276017,0.00014875199,0.0001395908,0.00011532431],"domain_scores_gemma":[0.9993698,0.00013635262,0.00018657772,0.00023064156,0.000025546238,0.000051078496],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00016212516,0.000081888604,0.00023367634,0.000016081984,0.00009555778,0.000014157123,0.00023750657,0.000024060266,0.0000037599386],"category_scores_gemma":[0.00002741288,0.00005505144,0.0001123695,0.00031860027,0.0005844495,0.00011967773,0.000041280542,0.00008231324,0.000001009597],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013501033,0.0022182884,0.00071955606,0.0011318771,0.0009732263,0.0000032257833,0.07906557,0.002333076,0.18417433,0.2738901,0.00019307097,0.45516264],"study_design_scores_gemma":[0.0028229586,0.0006194001,0.08510333,0.0004957762,0.00026565025,0.0001534109,0.0024778624,0.036432113,0.11108441,0.7599197,0.000027132826,0.0005982642],"about_ca_topic_score_codex":0.000088332235,"about_ca_topic_score_gemma":0.0000014986263,"teacher_disagreement_score":0.48602957,"about_ca_system_score_codex":0.000016140624,"about_ca_system_score_gemma":0.000036247835,"threshold_uncertainty_score":0.22449327},"labels":[],"label_agreement":null},{"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.009065200825975759,"score_gpt":0.25149145643552856,"score_spread":0.2424262556095528,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1495088152","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7032691,0.00005441045,0.28361395,0.012699742,0.00009188719,0.00006031112,3.4642414e-7,0.000013544524,0.00019671928],"genre_scores_gemma":[0.9050862,0.000010790588,0.09278825,0.0018192126,0.00022330486,0.0000013720173,3.2158272e-8,0.0000051314464,0.000065692366],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99867994,0.00011341388,0.00047283617,0.00012108242,0.00039510912,0.00021760234],"domain_scores_gemma":[0.9988374,0.00033408377,0.0004619823,0.00021443245,0.00005624352,0.00009587343],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00035657495,0.00010765994,0.0003237451,0.000041178137,0.00006880116,0.000067722925,0.0008457095,0.000026568952,0.000020256404],"category_scores_gemma":[0.00016084891,0.00006362136,0.00036823264,0.0006616076,0.00018457927,0.00029406353,0.00020706157,0.00035718575,0.000025274194],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009468924,0.0026222644,0.011527635,0.000105463936,0.0005175016,0.000040609946,0.025337908,0.0040651164,0.0068476894,0.3400196,0.026738498,0.582083],"study_design_scores_gemma":[0.0022363774,0.00072248495,0.24905673,0.00027347755,0.00006358294,0.0005871782,0.0010490774,0.298692,0.004050918,0.43790793,0.004670104,0.0006901671],"about_ca_topic_score_codex":0.0000030963276,"about_ca_topic_score_gemma":0.000001156739,"teacher_disagreement_score":0.5813928,"about_ca_system_score_codex":0.00013732168,"about_ca_system_score_gemma":0.00008820443,"threshold_uncertainty_score":0.2594404},"labels":[],"label_agreement":null},{"id":"W1505888816","doi":"10.17323/1609-4514-2012-12-1-55-76","title":"Tropical Varieties with Polynomial Weights and Corner Loci of Piecewise Polynomials","year":2012,"lang":"en","type":"preprint","venue":"Moscow Mathematical Journal","topic":"Polynomial and algebraic computation","field":"Computer Science","cited_by":12,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"University of Toronto; Russian Foundation for Basic Research","keywords":"Mathematics; Polytope; Tropical geometry; Subvariety; Toric variety; Combinatorics; Product (mathematics); Intersection (aeronautics); Polynomial; Manifold (fluid mechanics); Piecewise; Pure mathematics; Variety (cybernetics); Geometry","score_opus":0.017286336693649356,"score_gpt":0.23863395645281987,"score_spread":0.22134761975917053,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1505888816","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.32295337,0.0006767812,0.6734698,0.0012953025,0.00055362843,0.00025864667,0.0000071272866,0.00006697424,0.0007184183],"genre_scores_gemma":[0.89533985,0.000047353893,0.103445455,0.00011929986,0.0008135765,0.000012994059,0.000002974753,0.00003028834,0.00018822364],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99720144,0.00020052564,0.0009289919,0.00044166725,0.00068812165,0.0005392244],"domain_scores_gemma":[0.99777436,0.00033136996,0.0007055864,0.0005355512,0.00016188636,0.0004912387],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00048233857,0.00044437175,0.00093396695,0.0002024843,0.00017747255,0.00044872897,0.0009535015,0.0003111935,0.00009221774],"category_scores_gemma":[0.00008726999,0.00030261354,0.00019710365,0.00013607896,0.0003472678,0.00040802237,0.001133316,0.0010123273,0.00002335626],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0010599373,0.003701539,0.005650533,0.0034102688,0.0021412813,0.00041183407,0.019400168,0.00056573935,0.0035198578,0.7506507,0.014762946,0.19472522],"study_design_scores_gemma":[0.0045264643,0.0011746729,0.027552782,0.0017840455,0.00067596254,0.004447474,0.0001642455,0.06419782,0.0065787854,0.8848936,0.0016180127,0.0023861188],"about_ca_topic_score_codex":0.000010106232,"about_ca_topic_score_gemma":0.0000013952371,"teacher_disagreement_score":0.57238644,"about_ca_system_score_codex":0.0000789877,"about_ca_system_score_gemma":0.00036178483,"threshold_uncertainty_score":0.9999426},"labels":[],"label_agreement":null},{"id":"W1517477680","doi":"10.1007/978-3-642-14518-6_16","title":"On the Complexity of the Montes Ideal Factorization Algorithm","year":2010,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Polynomial and algebraic computation","field":"Computer Science","cited_by":14,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Ideal (ethics); Factorization; Computer science; Algorithm; Mathematics; Philosophy; Epistemology","score_opus":0.024312501079422538,"score_gpt":0.23374817975395595,"score_spread":0.20943567867453342,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1517477680","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0004150968,0.000052223673,0.992293,0.003139631,0.0026749223,0.0003736117,0.0000099866365,0.00006063701,0.0009808682],"genre_scores_gemma":[0.8440522,0.000007749325,0.15327749,0.0019431666,0.0005225706,0.000007112535,0.000004220163,0.000023766916,0.0001617494],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99749374,0.000056834873,0.0004144337,0.00074037065,0.00095456844,0.00034003763],"domain_scores_gemma":[0.9973578,0.00076785486,0.00039259446,0.0012163304,0.00019633234,0.0000690966],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005821219,0.00033765385,0.00031064943,0.00022872059,0.00040229908,0.00025722405,0.0037415328,0.00019920924,0.000017321721],"category_scores_gemma":[0.00014310842,0.000191988,0.00015072679,0.00052411185,0.0016667439,0.0002386897,0.0011458028,0.0009164209,0.0000120379955],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000025961451,0.000027167589,0.000017485427,0.000010675207,0.000008140017,0.0000029287112,0.00066435203,0.005359988,0.0006091116,0.3903509,0.000021804424,0.6029248],"study_design_scores_gemma":[0.00008419024,0.00006334115,0.0007375658,0.000115270035,0.000003124119,0.000008194211,7.840647e-8,0.34181523,0.0061322055,0.6506014,0.00024393042,0.00019548915],"about_ca_topic_score_codex":0.000070185655,"about_ca_topic_score_gemma":0.00011613224,"teacher_disagreement_score":0.84363705,"about_ca_system_score_codex":0.00010911189,"about_ca_system_score_gemma":0.0003451312,"threshold_uncertainty_score":0.7829043},"labels":[],"label_agreement":null},{"id":"W1520341603","doi":"10.4169/amer.math.monthly.121.07.563","title":"A Bit of Tropical Geometry","year":2014,"lang":"en","type":"preprint","venue":"American Mathematical Monthly","topic":"Polynomial and algebraic computation","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Tropical geometry; Section (typography); Geometry; Subject (documents); Plane (geometry); Computer science; Algebra over a field; Mathematics education; Geography; Mathematics; Combinatorics; Pure mathematics; Library science","score_opus":0.01183552900740508,"score_gpt":0.24887526707561328,"score_spread":0.2370397380682082,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1520341603","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.120872416,0.000057940284,0.86636686,0.001186754,0.00022489573,0.00022255261,0.000009908624,0.00019072522,0.010867941],"genre_scores_gemma":[0.85082704,0.0000029506584,0.1486591,0.00026566337,0.00012733266,0.000028025615,0.0000041737253,0.000015842681,0.00006985083],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9979283,0.00011778722,0.0006265415,0.00054404547,0.00046279756,0.00032053568],"domain_scores_gemma":[0.9977404,0.0005118859,0.0005088888,0.00097468356,0.0000793535,0.00018482385],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001792465,0.0002759168,0.0008430454,0.00019503814,0.00003412469,0.00008683842,0.0013456851,0.000107813976,0.000026622874],"category_scores_gemma":[0.000272375,0.00023291905,0.00027137285,0.00037017872,0.00033437542,0.0000698647,0.0014590466,0.00038687699,0.00011006476],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000021186706,0.00060001196,0.00033197016,0.00074428396,0.00017964895,0.000020477231,0.00087119784,0.0020070856,0.00015463232,0.86320704,0.0016963625,0.13016607],"study_design_scores_gemma":[0.00015983667,0.00022232583,0.004979793,0.00017693984,0.00002920541,0.000004622363,0.0000148891095,0.28423706,0.00028150526,0.7091265,0.00042904902,0.00033830138],"about_ca_topic_score_codex":0.0000727165,"about_ca_topic_score_gemma":0.0000016677839,"teacher_disagreement_score":0.72995466,"about_ca_system_score_codex":0.000041602103,"about_ca_system_score_gemma":0.00010645499,"threshold_uncertainty_score":0.94981635},"labels":[],"label_agreement":null},{"id":"W1522034305","doi":"10.1007/bfb0023835","title":"On the computation of the Hilbert series","year":2005,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Polynomial and algebraic computation","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Royal Ottawa Mental Health Centre","funders":"","keywords":"Monomial; Hilbert–Poincaré series; Monomial basis; Mathematics; Polynomial ring; Ideal (ethics); Polynomial; Principal ideal; Series (stratigraphy); Degree (music); Combinatorics; Homogeneous polynomial; Hilbert series and Hilbert polynomial; Monomial ideal; Discrete mathematics; Hilbert R-tree; Computation; Pure mathematics; Matrix polynomial; Hilbert space; Mathematical analysis; Algorithm; Reproducing kernel Hilbert space; Rigged Hilbert space; Physics","score_opus":0.012370016204102083,"score_gpt":0.22191374476905942,"score_spread":0.20954372856495734,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1522034305","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00081391155,0.00014304847,0.98401326,0.009189279,0.0016699958,0.0003726524,0.0000027247302,0.00006344792,0.0037316522],"genre_scores_gemma":[0.9563432,0.000014866919,0.03887897,0.0036022034,0.00049088686,0.0000073970155,0.0000016493555,0.000023188866,0.00063767924],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99751705,0.000060479,0.0004462188,0.0007300274,0.000906343,0.0003398632],"domain_scores_gemma":[0.997706,0.00072776125,0.00037339682,0.00097591284,0.0001593603,0.00005757332],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005906608,0.00034016915,0.00030794844,0.00026027852,0.00032674178,0.00024363094,0.0030940368,0.00014383493,0.000011751961],"category_scores_gemma":[0.0001037749,0.000195492,0.00015566612,0.0005754286,0.00078715006,0.00036111256,0.001036126,0.00055736315,0.000024744648],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000005992836,0.000022295011,0.000008655942,0.000014312686,0.000008607079,0.0000033235867,0.00073395466,0.12253978,0.0000830577,0.2873206,0.000097466305,0.58916193],"study_design_scores_gemma":[0.00015290569,0.0001413235,0.00048578408,0.00040085992,0.00000609604,0.000035340574,1.6960354e-7,0.41201198,0.0027596734,0.5826055,0.0010671671,0.00033320003],"about_ca_topic_score_codex":0.00001735906,"about_ca_topic_score_gemma":0.00007187443,"teacher_disagreement_score":0.9555293,"about_ca_system_score_codex":0.00016737785,"about_ca_system_score_gemma":0.0003818941,"threshold_uncertainty_score":0.7971932},"labels":[],"label_agreement":null},{"id":"W1523564138","doi":"10.1007/bfb0032851","title":"GCDHEU: Heuristic polynomial GCD algorithm based on integer GCD computation","year":2005,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Polynomial and algebraic computation","field":"Computer Science","cited_by":18,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Integer (computer science); Computation; Heuristic; Polynomial; Algorithm; Mathematics; Computer science; Mathematical optimization; Programming language","score_opus":0.01166784627210494,"score_gpt":0.23893931219380202,"score_spread":0.22727146592169709,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1523564138","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00005675006,0.00020210448,0.98965484,0.001868116,0.0037473398,0.000552227,0.000019668953,0.00039077122,0.0035081955],"genre_scores_gemma":[0.26794216,0.000022485126,0.72112894,0.006975167,0.0031189288,0.00002300615,0.00006279356,0.00010420132,0.0006223003],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9942026,0.000092321716,0.0009200628,0.0022492576,0.0015579874,0.0009777723],"domain_scores_gemma":[0.99629927,0.0012703337,0.000503832,0.0012091784,0.00036677354,0.00035062843],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0008660239,0.00092069333,0.000789363,0.0015911344,0.00041562374,0.0008845611,0.0029775,0.0004441324,0.00004399336],"category_scores_gemma":[0.00016286156,0.0008763193,0.00024552536,0.0010202137,0.00063657237,0.00069134857,0.0008782159,0.001214029,0.0002698866],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000012458453,0.0000619506,0.0000045388174,0.000024355513,0.000007881644,0.00006310191,0.00020664741,0.22453311,0.000016077569,0.0012461679,0.00018160616,0.7736421],"study_design_scores_gemma":[0.0006760986,0.00039969734,0.000116471485,0.00045206427,0.000012340112,0.000047057296,1.0594259e-7,0.9687042,0.00036957537,0.02539713,0.0028833745,0.0009418754],"about_ca_topic_score_codex":0.000047370377,"about_ca_topic_score_gemma":0.000059839862,"teacher_disagreement_score":0.77270025,"about_ca_system_score_codex":0.00083079666,"about_ca_system_score_gemma":0.0014057462,"threshold_uncertainty_score":0.9993687},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"","keywords":"Disjoint sets; Computer science; Polynomial; Parametric statistics; Discrete mathematics; Theoretical computer science; Algorithm; Mathematics","score_opus":0.022340740939051473,"score_gpt":0.2754742945676292,"score_spread":0.2531335536285777,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1536271794","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0003820026,0.00070078654,0.9917369,0.00057776144,0.0025300095,0.00040948763,0.000003448892,0.00025507194,0.0034045235],"genre_scores_gemma":[0.18342844,0.000070002396,0.80902505,0.005113228,0.0017842087,0.0000101996575,0.000030645846,0.00007059926,0.0004676056],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9961372,0.000037943413,0.00063970004,0.0014692103,0.0009967193,0.0007192531],"domain_scores_gemma":[0.99755526,0.0005465974,0.0003162191,0.0010526604,0.00029352782,0.00023573478],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0006333049,0.0005495462,0.0005633087,0.0012095018,0.0002896004,0.00049940625,0.0024806208,0.00033892068,0.000023756578],"category_scores_gemma":[0.000031297135,0.00053380046,0.00019288926,0.00072201976,0.00048200513,0.0006516187,0.0010548574,0.00072755135,0.00013208913],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001032217,0.000025471998,0.0000063721413,0.000026494288,0.0000113681535,0.00015137032,0.0003249145,0.013135859,0.00035621398,0.027042406,0.000024433699,0.9588848],"study_design_scores_gemma":[0.00083627977,0.0003210786,0.0004571144,0.00043973047,0.0000141702785,0.00023013471,1.6971632e-7,0.5762887,0.00397337,0.4066432,0.009561318,0.0012347454],"about_ca_topic_score_codex":0.000033556225,"about_ca_topic_score_gemma":0.00004492777,"teacher_disagreement_score":0.95765,"about_ca_system_score_codex":0.00041438156,"about_ca_system_score_gemma":0.00041656964,"threshold_uncertainty_score":0.99971133},"labels":[],"label_agreement":null},{"id":"W1539820931","doi":"10.1016/j.jsc.2016.12.004","title":"Numerical algorithms for detecting embedded components","year":2017,"lang":"en","type":"preprint","venue":"Journal of Symbolic Computation","topic":"Polynomial and algebraic computation","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"National Science Foundation","keywords":"Algorithm; Computer science","score_opus":0.052945971012643804,"score_gpt":0.3257271769855561,"score_spread":0.2727812059729123,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1539820931","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08175502,0.00024689446,0.9117697,0.0009151698,0.0047824685,0.00035528673,0.0000054693983,0.00007026044,0.000099743476],"genre_scores_gemma":[0.8380583,0.000013087119,0.16043743,0.00008370404,0.0013385142,0.000010973487,0.000014082767,0.000021669717,0.000022257387],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99748933,0.00012773067,0.0010550834,0.00041727276,0.00058638543,0.00032422034],"domain_scores_gemma":[0.9955142,0.00038289675,0.002763311,0.00040200094,0.0007452723,0.00019230961],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0008757894,0.00031362684,0.0007248766,0.00039481104,0.00033637838,0.0007188509,0.0015320072,0.00021040768,0.0000016106933],"category_scores_gemma":[0.00026265482,0.00029863993,0.0004710489,0.00011801322,0.00003939963,0.00052299147,0.0005633907,0.00064772874,0.000006873765],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006570421,0.00019139852,0.00007800854,0.00021190061,0.00023804308,0.000038651815,0.0022699414,0.11724144,0.0006132169,0.00078085664,0.00091677206,0.8773541],"study_design_scores_gemma":[0.0010716283,0.00021550684,0.004579302,0.0003581634,0.000052064122,0.00016968383,0.000018265851,0.9211845,0.00057097187,0.071105726,0.0003472278,0.0003270014],"about_ca_topic_score_codex":0.000033845645,"about_ca_topic_score_gemma":8.639008e-7,"teacher_disagreement_score":0.87702703,"about_ca_system_score_codex":0.00018116392,"about_ca_system_score_gemma":0.0004005972,"threshold_uncertainty_score":0.9999466},"labels":[],"label_agreement":null},{"id":"W1543993108","doi":"10.1007/978-3-540-87827-8_2","title":"Unconstrained Parametric Minimization of a Polynomial: Approximate and Exact","year":2008,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Polynomial and algebraic computation","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"","keywords":"Monic polynomial; Quartic function; Algebraic expression; Mathematics; Degree (music); Polynomial; Algebraic number; Simple (philosophy); Parametric statistics; Matrix polynomial; Upper and lower bounds; Applied mathematics; Discrete mathematics; Pure mathematics; Mathematical analysis","score_opus":0.015018283156053209,"score_gpt":0.22590070869242884,"score_spread":0.21088242553637562,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1543993108","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0020989482,0.0005729485,0.9950216,0.00027555367,0.0006862111,0.00032422107,0.000005255756,0.00009908586,0.0009161827],"genre_scores_gemma":[0.6551287,0.00015458526,0.34410146,0.00030185535,0.00019484223,0.000004632652,0.000006561388,0.000022505576,0.00008485342],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99733806,0.000032886106,0.00058197055,0.0010388577,0.00060151855,0.00040669492],"domain_scores_gemma":[0.9981392,0.0005006093,0.00042119462,0.0006371233,0.00015537118,0.00014649252],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00037582958,0.000390461,0.0005433205,0.0012421381,0.00014895812,0.00018265651,0.0012478653,0.00022483848,0.000006252611],"category_scores_gemma":[0.000114031405,0.0003626968,0.00009409438,0.0009436428,0.00083885423,0.000476773,0.000697188,0.00033726453,0.000004215228],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008677173,0.00003004005,0.00007680551,0.00005299909,0.000011521125,0.000030313957,0.00078433123,0.014981184,0.00010200827,0.002494507,0.0000410335,0.9813866],"study_design_scores_gemma":[0.00058100297,0.00022932672,0.0007304613,0.00027399565,0.000010661187,0.00019933106,2.2500477e-7,0.97066575,0.0018420744,0.024425307,0.00041022117,0.0006316483],"about_ca_topic_score_codex":0.000028463242,"about_ca_topic_score_gemma":0.000011017602,"teacher_disagreement_score":0.9807549,"about_ca_system_score_codex":0.000120998804,"about_ca_system_score_gemma":0.00052496506,"threshold_uncertainty_score":0.9998825},"labels":[],"label_agreement":null},{"id":"W1546171790","doi":"10.1016/j.jnt.2015.06.005","title":"On symmetries of elliptic nets and valuations of net polynomials","year":2015,"lang":"en","type":"preprint","venue":"Journal of Number Theory","topic":"Polynomial and algebraic computation","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Lethbridge","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Net (polyhedron); Divisibility rule; Abelian group; Schoof's algorithm; Homogeneous space; Generalization; Division polynomials; Symmetry (geometry); Elliptic rational functions; Pure mathematics; Context (archaeology); Elliptic curve; Algebra over a field; Discrete mathematics; Quarter period; Mathematical analysis","score_opus":0.027949214156435732,"score_gpt":0.28978149714325163,"score_spread":0.2618322829868159,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1546171790","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8514894,0.002103098,0.13783601,0.0011607036,0.0024679804,0.0002661223,0.000083924635,0.000022445634,0.0045702774],"genre_scores_gemma":[0.9921144,0.0000676467,0.0073143905,0.00013444632,0.00019351486,0.0000015399831,0.0000034605475,0.000009535216,0.00016106718],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.998072,0.00036468336,0.0008043051,0.00017111542,0.00046068302,0.00012718518],"domain_scores_gemma":[0.9962669,0.0011550892,0.0015425402,0.00032480454,0.0005944842,0.00011619021],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020220436,0.00016350305,0.00054202817,0.00027872532,0.000030009847,0.000057025725,0.00063897663,0.00012010799,0.00006109459],"category_scores_gemma":[0.000710642,0.00013384472,0.00016509401,0.00018371198,0.00010171009,0.00018847495,0.0004418595,0.00033203288,0.000006598091],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00049825833,0.00069532567,0.0005565178,0.00038687178,0.00082659395,0.00003372254,0.0072876443,0.0160129,0.00090855826,0.7536909,0.04654003,0.17256266],"study_design_scores_gemma":[0.00061675557,0.000299409,0.0027622613,0.0005406473,0.000092803646,0.00008878378,0.00006873911,0.0040704827,0.0015009023,0.9892626,0.00051475695,0.00018186387],"about_ca_topic_score_codex":0.00001263031,"about_ca_topic_score_gemma":8.8395745e-7,"teacher_disagreement_score":0.23557167,"about_ca_system_score_codex":0.000051259005,"about_ca_system_score_gemma":0.0005078881,"threshold_uncertainty_score":0.5458029},"labels":[],"label_agreement":null},{"id":"W1549442051","doi":"10.1007/11870814_18","title":"On Decomposition of Tame Polynomials and Rational Functions","year":2006,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Polynomial and algebraic computation","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Polynomial; Rational function; Decomposition; Computer science; Order (exchange); Algebra over a field; Relation (database); Mathematics; Pure mathematics; Mathematical analysis","score_opus":0.009834493856995828,"score_gpt":0.23549988852708403,"score_spread":0.2256653946700882,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1549442051","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0026718373,0.0001581454,0.9924959,0.0006840553,0.0009716663,0.00022269897,0.000011976737,0.00006561988,0.0027180968],"genre_scores_gemma":[0.8932813,0.000010350788,0.104921795,0.00079241465,0.00046900965,0.0000070065917,0.000026256099,0.000019199522,0.00047266833],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99786264,0.000027007218,0.0004594603,0.00082951586,0.0005446693,0.00027668718],"domain_scores_gemma":[0.99847573,0.00055539253,0.00027940827,0.00046518148,0.00013558814,0.00008872346],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00035329882,0.00029916796,0.0003494168,0.0007157687,0.00019046829,0.00020922595,0.0007431376,0.0001652352,0.000011277367],"category_scores_gemma":[0.00003318923,0.00028217072,0.00008340396,0.00031039934,0.00040545678,0.000382118,0.00038269444,0.00029982737,0.00001603071],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000022307355,0.00008377473,0.000039534127,0.00004073377,0.000016245467,0.000017880946,0.0002350603,0.1441602,0.001899144,0.12822483,0.0004399201,0.7248204],"study_design_scores_gemma":[0.000525421,0.00044801325,0.001950429,0.00036310902,0.000012263769,0.00006310517,6.956691e-8,0.5447821,0.0039989785,0.4467579,0.00049651874,0.00060206256],"about_ca_topic_score_codex":0.00003734053,"about_ca_topic_score_gemma":0.000028482009,"teacher_disagreement_score":0.89060944,"about_ca_system_score_codex":0.00014292872,"about_ca_system_score_gemma":0.00034761653,"threshold_uncertainty_score":0.99996305},"labels":[],"label_agreement":null},{"id":"W1561786221","doi":"10.1007/s11856-016-1318-5","title":"Moment problem in infinitely many variables","year":2016,"lang":"en","type":"article","venue":"Israel Journal of Mathematics","topic":"Polynomial and algebraic computation","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Saskatchewan","funders":"","keywords":"Moment problem; Extension (predicate logic); Moment (physics); Context (archaeology); Polynomial; Set (abstract data type); Algebra over a field","score_opus":0.018215371855617536,"score_gpt":0.2390645719570882,"score_spread":0.22084920010147066,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1561786221","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12785831,0.00006897483,0.8690274,0.001900706,0.00016219042,0.00006440313,5.8908756e-7,0.0000156573,0.0009017718],"genre_scores_gemma":[0.58867186,0.00004334239,0.41075936,0.00015731195,0.0001095608,0.0000023390805,5.6868828e-8,0.000008225908,0.0002479382],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99889034,0.000033640932,0.00055696315,0.00008352809,0.00027549706,0.00016005244],"domain_scores_gemma":[0.9990678,0.00024502093,0.0003755239,0.0001561813,0.00008851489,0.00006698254],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006543497,0.00008690182,0.00019308712,0.00018673956,0.000021111859,0.00005928657,0.0005125253,0.000032265252,0.000007982539],"category_scores_gemma":[0.000058059908,0.00005162075,0.000056635647,0.00019153809,0.000018375484,0.00032753288,0.00010492311,0.00007761719,0.000025731963],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001034327,0.0005611024,0.00079977146,0.00010029922,0.000046888763,0.00010467199,0.002700674,0.00032368817,0.007626942,0.7482172,0.0008723833,0.238636],"study_design_scores_gemma":[0.0024079129,0.00040988944,0.0024463406,0.0013807253,0.000018334134,0.0005704223,0.00019774062,0.017867625,0.0057605593,0.9630916,0.005495775,0.00035307484],"about_ca_topic_score_codex":0.0000032757016,"about_ca_topic_score_gemma":0.0000018596396,"teacher_disagreement_score":0.46081355,"about_ca_system_score_codex":0.000061245024,"about_ca_system_score_gemma":0.00008751536,"threshold_uncertainty_score":0.21050331},"labels":[],"label_agreement":null},{"id":"W1568095739","doi":"10.1007/11832225_2","title":"Efficient Implementation of Polynomial Arithmetic in a Multiple-Level Programming Environment","year":2006,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Polynomial and algebraic computation","field":"Computer Science","cited_by":13,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"","keywords":"Computer science; Programming language; Polynomial; Lisp; Axiom; Implementation; Theoretical computer science; Arithmetic; Mathematics","score_opus":0.018652021940444356,"score_gpt":0.24290524641353445,"score_spread":0.2242532244730901,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1568095739","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0105786435,0.0001648627,0.9875343,0.00024172015,0.00062035787,0.0006843283,0.000010317009,0.000051728246,0.00011374787],"genre_scores_gemma":[0.7260492,0.0000039362067,0.27363563,0.00008953824,0.00014944367,0.000016080698,0.000009181561,0.000016857308,0.000030156905],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99646956,0.000040423573,0.00084933545,0.0011542755,0.0008798865,0.0006065252],"domain_scores_gemma":[0.99845284,0.00031606734,0.00043124516,0.0006400315,0.00006103283,0.00009879292],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0007000291,0.00041999805,0.00048314972,0.0010489915,0.00011474315,0.0001772195,0.0014171124,0.00017404204,0.000009171788],"category_scores_gemma":[0.000023602835,0.00041330972,0.00012594974,0.00048743267,0.00040138362,0.00017548318,0.00087091135,0.00040420878,0.000010970953],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000044166945,0.000057236797,0.0002878104,0.000024955714,0.000004029241,0.000019356197,0.0005813988,0.2708669,0.00024116148,0.0005427902,0.0000039571228,0.727366],"study_design_scores_gemma":[0.0010027379,0.00022192446,0.0063977563,0.00023518449,0.0000079858155,0.000021564749,9.4349997e-7,0.98119193,0.003579238,0.0064264964,0.00032786705,0.00058636785],"about_ca_topic_score_codex":0.000495159,"about_ca_topic_score_gemma":0.00036092315,"teacher_disagreement_score":0.72677964,"about_ca_system_score_codex":0.0005319257,"about_ca_system_score_gemma":0.00040622547,"threshold_uncertainty_score":0.99983186},"labels":[],"label_agreement":null},{"id":"W1571049549","doi":"10.1007/s00229-015-0773-3","title":"Secondary fans and tropical Severi varieties","year":2015,"lang":"en","type":"article","venue":"manuscripta mathematica","topic":"Polynomial and algebraic computation","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"","keywords":"Counterexample; Codimension; Variety (cybernetics); Number theory; Algebraic geometry; Complete intersection; Simple (philosophy)","score_opus":0.03356695574640024,"score_gpt":0.22884955849364813,"score_spread":0.1952826027472479,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1571049549","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08413572,0.00022203401,0.88026536,0.004953245,0.0006901452,0.00017451962,0.0000021974859,0.0003194969,0.029237285],"genre_scores_gemma":[0.8581166,0.000005664604,0.1368308,0.00091203104,0.00012977918,0.000019233328,0.00000193143,0.000013046242,0.003970859],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991349,0.000039569433,0.00019014657,0.00023780641,0.0002046936,0.00019288901],"domain_scores_gemma":[0.99941564,0.000044471846,0.00004643275,0.00029259038,0.000036030335,0.00016486263],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00014275924,0.00011739303,0.00016742766,0.00005410338,0.00006699273,0.00021903813,0.00034714243,0.000041518226,0.000024650582],"category_scores_gemma":[0.000047705173,0.00009839916,0.000032245145,0.0001077996,0.00006286411,0.00040038515,0.00029772412,0.00009904612,0.00010776313],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000073469164,0.00008584993,0.000115678034,0.000078557576,0.00002183265,0.000024498804,0.005500631,0.000003551023,0.00009104347,0.9233512,0.0350677,0.035652068],"study_design_scores_gemma":[0.00077059673,0.0001934418,0.006411028,0.000028721957,0.000014871887,0.00018108713,0.00032086443,0.08276473,0.00038513113,0.867015,0.04154799,0.0003665363],"about_ca_topic_score_codex":0.000009562716,"about_ca_topic_score_gemma":0.0000023375183,"teacher_disagreement_score":0.7739809,"about_ca_system_score_codex":0.000021015063,"about_ca_system_score_gemma":0.0000623524,"threshold_uncertainty_score":0.40126014},"labels":[],"label_agreement":null},{"id":"W1583600449","doi":"10.1088/1742-6596/284/1/012031","title":"On the surfaces associated with ℂ<i>P</i><sup><i>N</i>−1</sup>models","year":2011,"lang":"en","type":"article","venue":"Journal of Physics Conference Series","topic":"Polynomial and algebraic computation","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Montréal; Université du Québec à Trois-Rivières","funders":"","keywords":"Holomorphic function; Linear span; Immersion (mathematics); Quadratic equation; Subspace topology; Orthogonal polynomials; Linear system; Quadratic differential","score_opus":0.041857376705244496,"score_gpt":0.21120258471901449,"score_spread":0.16934520801376998,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1583600449","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.59245616,0.000027784465,0.40152454,0.0013612533,0.00017125538,0.0000946096,0.0000035026612,0.000044830766,0.0043160785],"genre_scores_gemma":[0.99760246,0.000012684037,0.0019322571,0.00026955837,0.00006535597,0.0000017210731,5.3170703e-7,0.000006801606,0.0001086556],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989299,0.00010970837,0.00025465115,0.00013447134,0.00037940798,0.00019186681],"domain_scores_gemma":[0.9986851,0.00021404796,0.0004112334,0.00021819872,0.00040369516,0.00006770868],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00030693872,0.00014815059,0.00021543934,0.00003542853,0.00014250418,0.00017100568,0.00077227235,0.000032300264,0.000016138214],"category_scores_gemma":[0.00004599206,0.000083603,0.00007642432,0.00025475747,0.00011776122,0.0014218381,0.00008063493,0.00024436702,0.000007861201],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000066922854,0.0001444244,0.00008389824,0.0000036344993,0.0000991677,0.000017376115,0.008375213,0.0057791807,0.00019932125,0.9618291,0.00045310557,0.02294864],"study_design_scores_gemma":[0.00046407,0.0011830758,0.001468945,0.00019624832,0.000027324657,0.000032037715,0.00050308375,0.043949727,0.03434394,0.9174934,0.00007528054,0.0002628622],"about_ca_topic_score_codex":0.000012446771,"about_ca_topic_score_gemma":0.0000061897495,"teacher_disagreement_score":0.40514627,"about_ca_system_score_codex":0.000023755094,"about_ca_system_score_gemma":0.00024876898,"threshold_uncertainty_score":0.34092316},"labels":[],"label_agreement":null},{"id":"W1606016218","doi":"10.1007/978-3-540-72586-2_38","title":"Efficient Computations of Irredundant Triangular Decompositions with the RegularChains Library","year":2007,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Polynomial and algebraic computation","field":"Computer Science","cited_by":13,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"","keywords":"Computer science; Maple; Computation; Parallel computing; Algorithm; Theoretical computer science; Computational science","score_opus":0.013314481299846938,"score_gpt":0.23673112374223088,"score_spread":0.22341664244238393,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1606016218","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0012099105,0.00042158933,0.99175906,0.0032987741,0.00059925596,0.0005806812,0.000013220565,0.0001599316,0.001957602],"genre_scores_gemma":[0.46720123,0.000010997738,0.5307865,0.0012842772,0.00037573624,0.000011026382,0.000019593152,0.000046317036,0.00026433062],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99673307,0.000068619585,0.00060373556,0.0010007374,0.0010344461,0.0005594131],"domain_scores_gemma":[0.9969995,0.0010720608,0.0004350211,0.0011211649,0.00019937738,0.00017285832],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00078535936,0.0004431013,0.0004869723,0.00097433204,0.00044914757,0.00034934882,0.0027079314,0.00016494168,0.00001331095],"category_scores_gemma":[0.000023631466,0.0003051677,0.00017100968,0.0012896792,0.0013331564,0.00028276234,0.0009929121,0.0006094033,0.0000122823185],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000020806752,0.0000790538,0.000009839432,0.000034507793,0.000029040617,0.000070170936,0.0014727352,0.582121,0.00011383785,0.111575946,0.000038091664,0.30443496],"study_design_scores_gemma":[0.00045830774,0.00027765427,0.0003439121,0.00041074335,0.000020030142,0.00012311748,9.232301e-7,0.9340848,0.0013310647,0.06163714,0.0008347262,0.00047760477],"about_ca_topic_score_codex":0.000016200092,"about_ca_topic_score_gemma":0.00004113043,"teacher_disagreement_score":0.46599132,"about_ca_system_score_codex":0.00013286024,"about_ca_system_score_gemma":0.000847789,"threshold_uncertainty_score":0.99994004},"labels":[],"label_agreement":null},{"id":"W1669046351","doi":"10.1093/imrn/rnv269","title":"Faithful Realizability of Tropical Curves","year":2015,"lang":"en","type":"article","venue":"International Mathematics Research Notices","topic":"Polynomial and algebraic computation","field":"Computer Science","cited_by":26,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"American Mathematical Society","keywords":"Realizability; Library science; Mathematics; Art history; History; Algorithm; Computer science","score_opus":0.16779192995494382,"score_gpt":0.41509973400152694,"score_spread":0.24730780404658312,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1669046351","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.49611002,0.00044500537,0.44621906,0.016008846,0.0009627713,0.00045968633,0.000016537877,0.00015552893,0.039622538],"genre_scores_gemma":[0.9603878,0.00001838468,0.039211746,0.000052757965,0.000085459214,0.000011699881,0.0000031663515,0.0000043420746,0.00022462785],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99788713,0.00013337925,0.00032286602,0.00019884821,0.0012790877,0.00017865765],"domain_scores_gemma":[0.9979747,0.0006752803,0.00010509593,0.00031374153,0.0008085122,0.00012269571],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001262843,0.00006829706,0.00013723088,0.00016321926,0.00003372436,0.0000963812,0.0012677811,0.00003073194,0.000024570078],"category_scores_gemma":[0.0017977937,0.000055618733,0.0000463575,0.0002692508,0.00012781878,0.00038806428,0.00046307905,0.00013129509,0.000063176805],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002455818,0.0008646997,0.0023413626,0.00044066441,0.00007473105,0.000014606374,0.0033678298,0.0003882307,0.0005407998,0.9705125,0.00862672,0.012803281],"study_design_scores_gemma":[0.0006092741,0.00026659458,0.010419837,0.00046200614,0.0000056844924,0.000014963667,0.00025560474,0.43109882,0.00571541,0.5468833,0.0040675476,0.00020095856],"about_ca_topic_score_codex":0.00011458934,"about_ca_topic_score_gemma":0.000017025735,"teacher_disagreement_score":0.4642778,"about_ca_system_score_codex":0.000081373175,"about_ca_system_score_gemma":0.00016134095,"threshold_uncertainty_score":0.23558739},"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,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"Natural Sciences and Engineering Research Council of Canada; Alfred P. Sloan Foundation; National Science Foundation","keywords":"Algorithm; Artificial intelligence; Mathematics; Computer science","score_opus":0.040493636918358396,"score_gpt":0.2710530456225148,"score_spread":0.23055940870415642,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1765206433","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.91301316,0.0005504954,0.083095126,0.0027781571,0.00022658367,0.000084715364,0.0000042793445,0.000004977303,0.00024250305],"genre_scores_gemma":[0.9580649,0.00004699305,0.041514203,0.00016163386,0.00012448068,4.2398912e-7,5.4834032e-8,0.000007706163,0.00007961416],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9979098,0.00017519,0.0008645408,0.00012518409,0.0007235768,0.00020175218],"domain_scores_gemma":[0.99658984,0.0006080333,0.0019855914,0.00026849654,0.00036393694,0.00018413179],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011041425,0.00015586168,0.00070032076,0.000031629726,0.000057812944,0.0000520731,0.0007765221,0.000045872363,0.000007119831],"category_scores_gemma":[0.00041799038,0.000094434705,0.00048709524,0.00040195728,0.0012539801,0.00019716915,0.00045184125,0.00024980225,0.0000018776819],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0011502645,0.0038789187,0.018685022,0.0036421437,0.003597044,0.00003204526,0.23937152,0.0013912964,0.035733994,0.34191433,0.06361387,0.28698957],"study_design_scores_gemma":[0.0027449674,0.00509686,0.07409343,0.0010910556,0.00068342144,0.00058691116,0.017005011,0.13717407,0.012029024,0.7482454,0.0005821382,0.0006677221],"about_ca_topic_score_codex":0.000040543244,"about_ca_topic_score_gemma":6.34432e-7,"teacher_disagreement_score":0.40633106,"about_ca_system_score_codex":0.000046458146,"about_ca_system_score_gemma":0.00031521745,"threshold_uncertainty_score":0.4620342},"labels":[],"label_agreement":null},{"id":"W1773256999","doi":"10.1016/j.aim.2015.10.013","title":"Effective uniform bounding in partial differential fields","year":2015,"lang":"en","type":"preprint","venue":"Advances in Mathematics","topic":"Polynomial and algebraic computation","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"National Science Foundation","keywords":"Bounding overwatch; Mathematics; Upper and lower bounds; Partial differential equation; Ordinary differential equation; Applied mathematics; Polynomial; Mathematical analysis; Degree (music); Differential equation; Numerical partial differential equations; Computer science; Physics","score_opus":0.016675442922622404,"score_gpt":0.294560848878676,"score_spread":0.2778854059560536,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1773256999","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.16906607,0.0005015818,0.82473487,0.00012734463,0.0026477498,0.00050432974,0.000002997914,0.000086111126,0.0023289481],"genre_scores_gemma":[0.96950644,0.00009437511,0.029961035,0.000028855906,0.00024164595,0.00010318617,0.000007604834,0.00001152056,0.00004536411],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985588,0.00006683012,0.00044374698,0.0003772102,0.00026209062,0.00029131092],"domain_scores_gemma":[0.9989729,0.00030247596,0.00022379887,0.0004046725,0.000036692414,0.000059453625],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00037034423,0.00022266516,0.0003953244,0.00019835767,0.000030263789,0.00013650808,0.00076412037,0.00016550357,0.000005571758],"category_scores_gemma":[0.00015097513,0.00020584237,0.000063696294,0.0002216448,0.00003739563,0.00040559587,0.0010242756,0.0005066532,0.000013894807],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000042542088,0.0010127742,0.0012754542,0.00259641,0.000049752012,0.000150292,0.02769745,0.12478929,0.000030504187,0.4115799,0.0001722564,0.43060336],"study_design_scores_gemma":[0.00028670664,0.000025231197,0.00029625942,0.0004206348,0.0000038040946,0.0000029928462,0.000035777244,0.4267741,0.00012883164,0.57166255,0.00016711686,0.00019596049],"about_ca_topic_score_codex":0.00002431522,"about_ca_topic_score_gemma":0.000137544,"teacher_disagreement_score":0.8004404,"about_ca_system_score_codex":0.00020095936,"about_ca_system_score_gemma":0.00010083294,"threshold_uncertainty_score":0.8394008},"labels":[],"label_agreement":null},{"id":"W1777899759","doi":"10.1007/978-3-642-04103-7_12","title":"On Computing the Hermite Form of a Matrix of Differential Polynomials","year":2009,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Polynomial and algebraic computation","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Hermite polynomials; Computer science; Differential (mechanical device); Matrix (chemical analysis); Algebra over a field; Mathematics; Pure mathematics; Physics","score_opus":0.011567707040216866,"score_gpt":0.2484608247179025,"score_spread":0.23689311767768564,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1777899759","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008527477,0.00019870485,0.987857,0.00056390575,0.0011610482,0.00038849073,0.0000060080415,0.00006171505,0.0012356902],"genre_scores_gemma":[0.9588589,0.000012082811,0.04013805,0.00045969823,0.00035574767,0.00000132668,0.00000264261,0.000017392349,0.00015417638],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9967935,0.000050055274,0.0008573409,0.00085980893,0.0009593866,0.00047990013],"domain_scores_gemma":[0.9968675,0.0010193443,0.00077863765,0.0010635373,0.00017805788,0.00009291667],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00067493756,0.00043826632,0.0007027523,0.00062699453,0.00018277542,0.00017031036,0.0031441564,0.0002045578,0.000010509724],"category_scores_gemma":[0.00007351419,0.00031222255,0.0002500158,0.00053289975,0.00058578403,0.00024041279,0.0009241286,0.0005315898,0.000007679109],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000017288263,0.000046769717,0.000007895073,0.000038323607,0.000014055986,0.000008238317,0.0009443116,0.01844434,0.00071481,0.057838343,0.000014924383,0.9219107],"study_design_scores_gemma":[0.00054804,0.00061751093,0.0009442026,0.0008214028,0.000017725457,0.000036504076,2.381499e-7,0.6260976,0.010532262,0.35970622,0.00013390096,0.00054435676],"about_ca_topic_score_codex":0.000031405914,"about_ca_topic_score_gemma":0.000020239708,"teacher_disagreement_score":0.9503314,"about_ca_system_score_codex":0.00013052147,"about_ca_system_score_gemma":0.0003554944,"threshold_uncertainty_score":0.999933},"labels":[],"label_agreement":null},{"id":"W1797874232","doi":"10.1007/978-3-319-08434-3_5","title":"Problem Formulation for Truth-Table Invariant Cylindrical Algebraic Decomposition by Incremental Triangular Decomposition","year":2014,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Polynomial and algebraic computation","field":"Computer Science","cited_by":25,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"Engineering and Physical Sciences Research Council; Chongqing Science and Technology Commission; National Natural Science Foundation of China","keywords":"CAD; Computer science; Heuristics; Invariant (physics); Decomposition; Algebraic number; Algorithm; Theoretical computer science; Algebra over a field; Mathematical optimization; Mathematics; Engineering drawing; Pure mathematics","score_opus":0.011175625921022963,"score_gpt":0.2518775313712258,"score_spread":0.24070190545020284,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1797874232","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00082618673,0.00019922398,0.99455124,0.0009025597,0.0013872887,0.0013344514,0.00002585458,0.00022208646,0.0005511179],"genre_scores_gemma":[0.51448506,0.00001193851,0.48293978,0.0012302928,0.00078886724,0.00007488635,0.00030801288,0.000053753196,0.0001074183],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99555767,0.00008037042,0.000949637,0.001704757,0.0009085997,0.00079898105],"domain_scores_gemma":[0.99731636,0.0008526512,0.0005717358,0.0007506889,0.0002599337,0.00024865425],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0012978249,0.0006302285,0.0006705818,0.0007373083,0.00054434745,0.0008176847,0.0017932873,0.00041853887,0.000015235504],"category_scores_gemma":[0.00007149543,0.00061934197,0.00021901529,0.0005511949,0.0001659725,0.0010131488,0.0006415162,0.0004944437,0.000029256014],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000086637185,0.000122038975,0.00001680806,0.00011663553,0.00003585152,0.000012748303,0.00039323507,0.021483159,0.0065056775,0.17495316,0.0002968332,0.79597723],"study_design_scores_gemma":[0.0011905325,0.0005029169,0.00004851267,0.00025066157,0.000021889848,0.00005275499,9.830303e-8,0.7201289,0.0082512265,0.26771185,0.0011700051,0.0006706789],"about_ca_topic_score_codex":0.000038372815,"about_ca_topic_score_gemma":0.000047288675,"teacher_disagreement_score":0.79530656,"about_ca_system_score_codex":0.00069888163,"about_ca_system_score_gemma":0.0003887994,"threshold_uncertainty_score":0.9996258},"labels":[],"label_agreement":null},{"id":"W1843400138","doi":"10.1007/978-3-540-72586-2_35","title":"On the Virtues of Generic Programming for Symbolic Computation","year":2007,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Polynomial and algebraic computation","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"","keywords":"Univariate; Polynomial; Axiom; Code (set theory); Computation; Factorization; Computer science; Symbolic computation; Mathematics; Discrete mathematics; Algorithm; Programming language","score_opus":0.030276800820531462,"score_gpt":0.26897273839723057,"score_spread":0.2386959375766991,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1843400138","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0007898387,0.0001901512,0.99571216,0.0006655801,0.0011541259,0.00077526143,0.000003450812,0.000097180564,0.00061224744],"genre_scores_gemma":[0.46393076,0.000011404899,0.533653,0.0016958687,0.00053801195,0.0000279554,0.000009202432,0.000035647787,0.000098167526],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99733406,0.000029380179,0.000546449,0.0008817227,0.00073200563,0.0004763948],"domain_scores_gemma":[0.99693584,0.0016863586,0.0004164605,0.0006147913,0.00026011735,0.000086409236],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0011415117,0.00036635323,0.00040008812,0.00064221735,0.0002560384,0.00025843017,0.0018938878,0.00017408228,0.0000027009964],"category_scores_gemma":[0.00011798531,0.0002683669,0.000166006,0.0006195104,0.00047729525,0.00023060973,0.00044980657,0.00035466804,0.000008307778],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000007463144,0.000022984053,0.0000025658796,0.000028922253,0.000008207154,0.0000035169817,0.00038983198,0.038933706,0.0000874885,0.117557,0.000013577336,0.84294474],"study_design_scores_gemma":[0.00019174599,0.00033392626,0.000069021415,0.00023892395,0.000006749232,0.000011619206,2.0541123e-7,0.6164479,0.0020807642,0.37973738,0.0005673319,0.0003143973],"about_ca_topic_score_codex":0.000013750054,"about_ca_topic_score_gemma":0.000023975013,"teacher_disagreement_score":0.8426303,"about_ca_system_score_codex":0.000157062,"about_ca_system_score_gemma":0.00030226554,"threshold_uncertainty_score":0.9999769},"labels":[],"label_agreement":null},{"id":"W1851343703","doi":"10.1007/978-3-642-32973-9_20","title":"Sparse Polynomial Powering Using Heaps","year":2012,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Polynomial and algebraic computation","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Heap (data structure); Computer science; Monomial; Benchmark (surveying); sort; Polynomial; Maple; Chebyshev polynomials; Magma; Parallel computing; Algorithm; Algebra over a field; Theoretical computer science; Mathematics; Discrete mathematics; Pure mathematics","score_opus":0.025814581225942112,"score_gpt":0.251266098434845,"score_spread":0.22545151720890289,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1851343703","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0014334273,0.0009775661,0.9905463,0.0003581505,0.004554638,0.00028442754,0.0000034233021,0.00021113193,0.0016309639],"genre_scores_gemma":[0.5714449,0.000030009178,0.42468154,0.0011944361,0.0023817578,0.000003780612,0.0000045196625,0.00005614385,0.00020290758],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9962104,0.000033848803,0.0005849407,0.0013217429,0.0008507392,0.0009983083],"domain_scores_gemma":[0.99789333,0.00025014277,0.0003185334,0.0010991788,0.00012232049,0.00031648393],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00074976066,0.00058993214,0.0005570011,0.00087421987,0.000331726,0.0005764886,0.0026333274,0.00030474988,0.000032035023],"category_scores_gemma":[0.000043325832,0.0005761252,0.00017458003,0.00056055706,0.00044952723,0.001134933,0.0018564957,0.00074392423,0.00008790305],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000066612142,0.000030480018,0.00004850428,0.00002628485,0.000011886636,0.000055858687,0.00072819786,0.036660794,0.00114745,0.0073684636,0.000023545983,0.9538919],"study_design_scores_gemma":[0.0004209132,0.00012541389,0.00026394337,0.00043973653,0.000016368616,0.00027755805,1.4525621e-7,0.94183606,0.003264134,0.047755495,0.0043025054,0.0012977445],"about_ca_topic_score_codex":0.00007535842,"about_ca_topic_score_gemma":0.000036052083,"teacher_disagreement_score":0.9525941,"about_ca_system_score_codex":0.0005247148,"about_ca_system_score_gemma":0.0006463452,"threshold_uncertainty_score":0.999669},"labels":[],"label_agreement":null},{"id":"W1856503308","doi":"10.3968/j.pam.1925252820120102.001","title":"A Fast Convergent Error Bound for Gaussian Interpolation","year":2011,"lang":"en","type":"article","venue":"Progress in applied mathematics","topic":"Polynomial and algebraic computation","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Combinatorics; Interpolation (computer graphics); Upper and lower bounds; Gaussian; Dimension (graph theory); Mathematics; Function (biology); Exponential function; Constant (computer programming); Gaussian function; Norm (philosophy); Physics; Mathematical analysis; Computer science","score_opus":0.04008978947774683,"score_gpt":0.2778137458189997,"score_spread":0.23772395634125287,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1856503308","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.014888376,0.000050207098,0.9789964,0.00014702321,0.00025839754,0.0007125615,0.0000018357177,0.00013821822,0.004806975],"genre_scores_gemma":[0.5569794,8.4105244e-7,0.44271538,0.000044353437,0.000025732392,0.00020144947,0.0000024625406,0.000008168382,0.000022199512],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990914,0.000006828464,0.00031431264,0.00023045634,0.0001294496,0.00022754492],"domain_scores_gemma":[0.9994748,0.00004825761,0.00015008342,0.00024800797,0.000023583492,0.00005525769],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00021802628,0.00012382171,0.00016142847,0.000100078636,0.00005407049,0.00007118974,0.000338619,0.00004907248,0.000016202333],"category_scores_gemma":[0.000009064282,0.00011129334,0.000040894854,0.00017296047,0.000050506507,0.00011448511,0.00013521523,0.00006466693,0.000023184279],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000166572,0.0003213073,0.00013507133,0.000162943,0.000014003409,0.0000023800162,0.010618332,0.0000028136108,0.00009454355,0.84651196,0.00014113079,0.14197886],"study_design_scores_gemma":[0.00069824967,0.00007689289,0.0005538829,0.0000687845,0.00000921794,0.000007498887,0.00026872288,0.60107243,0.0027462174,0.39388826,0.00035382612,0.000255975],"about_ca_topic_score_codex":0.0000015337979,"about_ca_topic_score_gemma":0.0000053914355,"teacher_disagreement_score":0.6010696,"about_ca_system_score_codex":0.00003265071,"about_ca_system_score_gemma":0.00003303312,"threshold_uncertainty_score":0.45384106},"labels":[],"label_agreement":null},{"id":"W1858019123","doi":"10.48550/arxiv.1311.5549","title":"On q-algebraic equations and their power series solutions","year":2013,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Polynomial and algebraic computation","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Canadian Nautical Research Society","funders":"","keywords":"Radius of convergence; Mathematics; Power series; Algebraic equation; Convergence (economics); Algebraic number; Series (stratigraphy); Formal power series; Algebraic solution; Order (exchange); RADIUS; Applied mathematics; Mathematical analysis; Nonlinear system; Differential equation; Differential algebraic equation; Computer science; Physics","score_opus":0.05277623593330901,"score_gpt":0.17129106344744302,"score_spread":0.118514827514134,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1858019123","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.31734473,0.000061799314,0.6788605,0.00078879204,0.0005194366,0.00022197612,0.000015499743,0.00023932829,0.0019479459],"genre_scores_gemma":[0.99786794,0.00004081421,0.0004946498,0.00017359554,0.000042092473,0.0000021609792,0.000013274323,0.00001015243,0.0013553418],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986754,0.00009616673,0.00014503089,0.0007357151,0.000054445223,0.0002932123],"domain_scores_gemma":[0.9987261,0.00022363565,0.00014115236,0.00066517096,0.00009633091,0.00014757946],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00011585953,0.0002591483,0.00021141703,0.00023193657,0.00032754478,0.000213389,0.0007501025,0.00016153505,0.000045277586],"category_scores_gemma":[0.00004378936,0.00025490543,0.00011406943,0.0003211993,0.00012883969,0.00054868293,0.0014933205,0.0003446256,0.00016468152],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000004824421,0.000046468635,0.000023175511,0.000010404827,0.000036890073,0.000009461726,0.0004152174,0.023626126,0.000028395942,0.97393334,0.00050060655,0.0013650695],"study_design_scores_gemma":[0.00018412863,0.00007326854,0.0010514413,0.00004379663,0.0000122045185,0.0000034730494,0.000056838366,0.33711237,0.000044632307,0.66084397,0.00027404615,0.00029984434],"about_ca_topic_score_codex":0.00009147689,"about_ca_topic_score_gemma":0.000030632666,"teacher_disagreement_score":0.68052316,"about_ca_system_score_codex":0.000092730574,"about_ca_system_score_gemma":0.00014329885,"threshold_uncertainty_score":0.99999034},"labels":[],"label_agreement":null},{"id":"W18702672","doi":"10.1111/j.1365-313x.2008.03650.x","title":"with parts constrained by the leading summand.","year":2005,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Polynomial and algebraic computation","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics","score_opus":0.009043726008296997,"score_gpt":0.21922760091536053,"score_spread":0.21018387490706353,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W18702672","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9418595,0.00035808684,0.028417472,0.0141944075,0.0013309979,0.0003121739,0.000002503662,0.00036545927,0.01315943],"genre_scores_gemma":[0.99788445,0.0000034721204,0.0008751815,0.00056590524,0.000018045983,0.000009495554,0.0000022239117,0.0000056046247,0.0006356436],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99921626,0.000041607964,0.00012528288,0.0002116114,0.00018169038,0.00022352938],"domain_scores_gemma":[0.9994526,0.0001191608,0.00006046774,0.00026773164,0.000033598728,0.00006643901],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001669352,0.0001037888,0.000101044556,0.000024152552,0.00018471519,0.00014792867,0.00047643017,0.000026217345,0.000007396398],"category_scores_gemma":[0.000011410176,0.00006751725,0.00002751411,0.00020916227,0.00007498596,0.000320568,0.00008198138,0.00010282715,0.00009772093],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000005346468,0.000052251296,0.00039566905,0.0000018696152,0.000016814642,0.000004315948,0.00048583405,0.00009649901,0.00023009822,0.90236473,0.025943683,0.07040291],"study_design_scores_gemma":[0.005801138,0.0007175312,0.0038838019,0.00010090286,0.000040595034,0.00019415648,0.00011879,0.10436464,0.024077795,0.53853685,0.32088524,0.0012785466],"about_ca_topic_score_codex":0.000010405013,"about_ca_topic_score_gemma":0.000008213315,"teacher_disagreement_score":0.36382782,"about_ca_system_score_codex":0.000030193214,"about_ca_system_score_gemma":0.00004887368,"threshold_uncertainty_score":0.27532735},"labels":[],"label_agreement":null},{"id":"W1875131895","doi":"10.1016/j.jsc.2011.08.010","title":"When does <mml:math xmlns:mml=\"http://www.w3.org/1998/Math/MathML\" altimg=\"si1.gif\" display=\"inline\" overflow=\"scroll\"><mml:mrow><mml:mo>〈</mml:mo><mml:mi>T</mml:mi><mml:mo>〉</mml:mo></mml:mrow></mml:math> equal <mml:math xmlns:mml=\"http://www.w3.org/1998/Math/MathML\" altimg=\"si2.gif\" display=\"inline\" overflow=\"scroll\"><mml:mstyle mathvariant=\"normal\"><mml:mi>sat</mml:mi></mml:mstyle><mml:mrow><mml:mo>(</mml:mo><mml:mi>T</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":10,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"","keywords":"Ideal (ethics); Mathematics; Algorithm; Gröbner basis; Univariate; Discrete mathematics; Multivariate statistics; Statistics; Law","score_opus":0.018675859307230633,"score_gpt":0.24020042370704187,"score_spread":0.22152456439981122,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1875131895","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.91877264,0.002604091,0.014673071,0.0017092533,0.009399849,0.00024287346,0.00089464337,0.000884256,0.050819345],"genre_scores_gemma":[0.96890706,0.0022328724,0.011313818,0.0038227658,0.008136224,0.0014287907,0.0019214192,0.0018559542,0.000381126],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.97274625,0.0015440637,0.0069816196,0.0048828158,0.0076622358,0.0061830007],"domain_scores_gemma":[0.9781124,0.0042178063,0.008978988,0.0040756045,0.0010746795,0.0035405266],"candidate_categories":["metaepi_narrow","sts","scholarly_communication","open_science","research_integrity","insufficient_payload"],"consensus_categories":["metaepi_narrow","sts","research_integrity","insufficient_payload"],"category_scores_codex":[0.0066477046,0.0031042409,0.001543635,0.002101039,0.004863644,0.005674715,0.006932596,0.005430877,0.022965519],"category_scores_gemma":[0.0032913946,0.0050004288,0.0054971115,0.0033986655,0.0035574546,0.0067543113,0.0059986226,0.0055905613,0.0054815975],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.004248302,0.0016514704,0.000042346182,0.0023830135,0.0043282458,0.0035918178,0.008416789,0.013308658,0.004582979,0.88013464,0.06571488,0.011596863],"study_design_scores_gemma":[0.0059762965,0.005085438,0.00042645904,0.0037339055,0.003797125,0.0071174563,0.0032820564,0.6532532,0.30426395,0.0045488765,0.004179708,0.0043355487],"about_ca_topic_score_codex":0.0047289194,"about_ca_topic_score_gemma":0.0017462292,"teacher_disagreement_score":0.87558573,"about_ca_system_score_codex":0.00014139805,"about_ca_system_score_gemma":0.005172685,"threshold_uncertainty_score":0.99915427},"labels":[],"label_agreement":null},{"id":"W1876112628","doi":"10.1007/978-3-642-15205-4_21","title":"Formal Theories for Linear Algebra","year":2010,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Polynomial and algebraic computation","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Computer science; Algebra over a field; Linear algebra; Theoretical computer science; Programming language; Mathematics; Pure mathematics","score_opus":0.011148139607841716,"score_gpt":0.23994299268770977,"score_spread":0.22879485307986805,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1876112628","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00018325502,0.0001581584,0.9925212,0.0011051457,0.003739069,0.0005343402,0.000010306826,0.00022121314,0.001527311],"genre_scores_gemma":[0.119283184,0.000014733978,0.87601894,0.002056899,0.0019500798,0.000029309287,0.000015356503,0.000045356082,0.00058614876],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99682736,0.000015318972,0.0004969692,0.0012381397,0.00062751264,0.0007947197],"domain_scores_gemma":[0.99758935,0.0006937249,0.00026565054,0.0010088057,0.00026151683,0.0001809592],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00091984787,0.00049248774,0.0004691249,0.0005643429,0.00046311773,0.00049877184,0.0030605157,0.00038225573,0.000015800477],"category_scores_gemma":[0.00012804243,0.00042865073,0.00019911294,0.0003527805,0.000670855,0.0010513935,0.0012432709,0.0007945334,0.000038865805],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008471675,0.000014137018,0.0000038650837,0.000028340915,0.0000067083797,0.00000935516,0.00045767945,0.0023607493,0.0002793332,0.3095599,0.000008656826,0.6872628],"study_design_scores_gemma":[0.00026717194,0.00016925375,0.000027980286,0.00009123051,0.000005394335,0.00003437055,5.989062e-8,0.31680873,0.004502771,0.67259705,0.005023376,0.00047260337],"about_ca_topic_score_codex":0.000010058989,"about_ca_topic_score_gemma":0.00006760228,"teacher_disagreement_score":0.68679017,"about_ca_system_score_codex":0.00011384252,"about_ca_system_score_gemma":0.00061184913,"threshold_uncertainty_score":0.99981654},"labels":[],"label_agreement":null},{"id":"W1882497348","doi":"10.1007/978-3-211-99314-9_3","title":"Towards Geometric Completion of Differential Systems by Points","year":2009,"lang":"en","type":"book-chapter","venue":"Texts & monographs in symbolic computation/Texts and monographs in symbolic computation","topic":"Polynomial and algebraic computation","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"","keywords":"Mathematics; Algebra over a field; Jet (fluid); Tangent; Pure mathematics; Geometry","score_opus":0.01424482477280634,"score_gpt":0.24591047000915262,"score_spread":0.23166564523634628,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1882497348","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.25414482,0.02331587,0.6859184,0.00083465275,0.0034363777,0.0061036996,0.0005334042,0.0011282763,0.024584519],"genre_scores_gemma":[0.99055827,0.0019725796,0.004970247,0.00017368032,0.00022893713,0.00010397888,0.0010184083,0.00012955371,0.0008443515],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9915905,0.00040289588,0.003261214,0.002097956,0.001516718,0.0011306899],"domain_scores_gemma":[0.99572074,0.0006121644,0.0018854982,0.0008124515,0.0005234022,0.00044573666],"candidate_categories":["metaepi_narrow"],"consensus_categories":["metaepi_narrow"],"category_scores_codex":[0.0010410539,0.0014789987,0.0024381853,0.007198536,0.00031307348,0.0005974802,0.0012933458,0.0008733607,0.000024085522],"category_scores_gemma":[0.000049157734,0.0016315135,0.000606184,0.00283518,0.00046706625,0.0008608029,0.0005693987,0.0011059447,0.000018445397],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010809157,0.0006779671,0.0011246614,0.00041055636,0.000247996,0.000042593107,0.002694862,0.012521163,0.00006512705,0.06997661,0.0024452242,0.90968513],"study_design_scores_gemma":[0.0080013275,0.0014018593,0.11680105,0.0028036512,0.00027932585,0.00017991803,0.00017702945,0.4670271,0.00007113621,0.391978,0.0071179247,0.0041616904],"about_ca_topic_score_codex":0.0005160668,"about_ca_topic_score_gemma":0.000078677826,"teacher_disagreement_score":0.9055235,"about_ca_system_score_codex":0.00027999943,"about_ca_system_score_gemma":0.00026416825,"threshold_uncertainty_score":0.9997959},"labels":[],"label_agreement":null},{"id":"W189395912","doi":"","title":"Using Thresholds to Compute Chromatic Polynomials.","year":2001,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Polynomial and algebraic computation","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Chromatic scale; Combinatorics","score_opus":0.028152259977880595,"score_gpt":0.27192839575572664,"score_spread":0.24377613577784604,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W189395912","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8972011,0.00007538998,0.09658065,0.0010931045,0.0030338732,0.00022820542,7.0570053e-7,0.00029333108,0.0014936146],"genre_scores_gemma":[0.9801784,0.000003309789,0.018790001,0.00084487314,0.000046538964,0.000007276945,0.0000016206168,0.000015121797,0.00011286027],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9984623,0.00006444351,0.0003170261,0.0004266533,0.0003020965,0.0004274874],"domain_scores_gemma":[0.9989536,0.00008858373,0.0000953849,0.0005515126,0.000068328,0.00024261221],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00024393458,0.00019785555,0.0002521993,0.00017982477,0.00021345753,0.00024342442,0.0009299564,0.00006353909,0.000016876811],"category_scores_gemma":[0.000029446968,0.00020068134,0.00008024246,0.00083842955,0.000028098595,0.00048231697,0.000452859,0.00011074984,0.00024595537],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001592341,0.00022173063,0.002629816,0.000016456546,0.000043854605,0.00009688552,0.0009922396,0.0021905752,0.0053583025,0.9458482,0.005174704,0.03741129],"study_design_scores_gemma":[0.0016859687,0.0003246841,0.01663943,0.000111856694,0.000020392403,0.00023789468,0.000020934838,0.3248501,0.00291414,0.645617,0.0066941394,0.00088343094],"about_ca_topic_score_codex":0.000102562626,"about_ca_topic_score_gemma":0.000005451291,"teacher_disagreement_score":0.32265955,"about_ca_system_score_codex":0.00012404022,"about_ca_system_score_gemma":0.00010230795,"threshold_uncertainty_score":0.8183547},"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,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"Natural Sciences and Engineering Research Council of Canada; 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","score_opus":0.011804883931034692,"score_gpt":0.2344596881979006,"score_spread":0.22265480426686593,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1914286732","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0014878704,0.0038322743,0.26365814,0.0008306737,0.0032826744,0.0005289484,0.00002699465,0.0009368157,0.72541565],"genre_scores_gemma":[0.0020655382,0.000114389266,0.016010027,0.0013238392,0.0012271897,0.000015029384,0.0001217501,0.00007362852,0.9790486],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99674314,0.000050584695,0.000641801,0.0010085863,0.00081726897,0.00073863193],"domain_scores_gemma":[0.9978636,0.00034179311,0.00032475675,0.0010246601,0.000097215336,0.00034799476],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0003070843,0.0005568879,0.00059332856,0.0005931079,0.00017244827,0.00023484127,0.0018300401,0.000625761,0.00017242835],"category_scores_gemma":[0.00005588309,0.0005554686,0.00035215297,0.00044106477,0.00014280548,0.0003404658,0.00072439865,0.000853445,0.001228921],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010658534,0.00008120482,0.00006327948,0.000077205914,0.00007786452,0.00028684136,0.00021163469,0.000015092364,0.000032391363,0.17880796,0.39701238,0.42332348],"study_design_scores_gemma":[0.00042465562,0.00022360499,0.0013233447,0.00024967382,0.000044007764,0.00018308964,0.0000045467814,0.0018086573,0.00023571722,0.082939744,0.9115289,0.001034076],"about_ca_topic_score_codex":0.000009745089,"about_ca_topic_score_gemma":0.000006661226,"teacher_disagreement_score":0.5145165,"about_ca_system_score_codex":0.00040172384,"about_ca_system_score_gemma":0.000487996,"threshold_uncertainty_score":0.9996897},"labels":[],"label_agreement":null},{"id":"W1941702124","doi":"10.1016/j.jsc.2015.11.005","title":"Faster sparse multivariate polynomial interpolation of straight-line programs","year":2015,"lang":"en","type":"article","venue":"Journal of Symbolic Computation","topic":"Polynomial and algebraic computation","field":"Computer Science","cited_by":31,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"National Science Foundation of Sri Lanka; Natural Sciences and Engineering Research Council of Canada; National Science Foundation","keywords":"Mathematics; Interpolation (computer graphics); Polynomial; Function (biology); Polynomial interpolation; Field (mathematics); Representation (politics); Multivariate statistics; Finite field; Applied mathematics; Degree (music); Line (geometry); Birkhoff interpolation; Algorithm; Mathematical optimization; Discrete mathematics; Algebra over a field; Linear interpolation; Pure mathematics; Mathematical analysis; Geometry; Computer science; Statistics; Artificial intelligence","score_opus":0.046147414931284,"score_gpt":0.28755890546700813,"score_spread":0.24141149053572414,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1941702124","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3887144,0.000053289612,0.60951775,0.00040134555,0.00089012366,0.00011383945,9.1401125e-7,0.000026627478,0.00028168026],"genre_scores_gemma":[0.9459107,0.0000017667389,0.053577233,0.00004794126,0.00041022603,0.0000012166772,0.0000053177537,0.000008713913,0.000036890226],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99815756,0.00012781397,0.0008821534,0.0001683009,0.0004817819,0.00018240802],"domain_scores_gemma":[0.99797595,0.000081172315,0.0010083523,0.00013697438,0.0006153668,0.00018217109],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006279638,0.00014926944,0.00032703235,0.0003312666,0.000036113383,0.00010943606,0.00040381815,0.00006502824,0.000004957592],"category_scores_gemma":[0.000070384536,0.00012694331,0.00013314473,0.00039969437,0.000041687887,0.0009026727,0.00010952507,0.00016839989,0.000009697589],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00028102717,0.00065932155,0.0012821283,0.000045367397,0.00014205264,0.000029086206,0.011124435,0.03009872,0.009363861,0.0043479204,0.0012441188,0.941382],"study_design_scores_gemma":[0.0034967698,0.0014805429,0.016534379,0.00019869415,0.000043441043,0.00023281714,0.00024440524,0.9639815,0.0024234804,0.010501533,0.0005791533,0.0002832576],"about_ca_topic_score_codex":0.000040816136,"about_ca_topic_score_gemma":0.000005523237,"teacher_disagreement_score":0.9410987,"about_ca_system_score_codex":0.000073508585,"about_ca_system_score_gemma":0.00025603696,"threshold_uncertainty_score":0.5176598},"labels":[],"label_agreement":null},{"id":"W1952011408","doi":"","title":"Highly Parallel, High-Precision Numerical Integration","year":2005,"lang":"en","type":"article","venue":"University of North Texas Digital Library (University of North Texas)","topic":"Polynomial and algebraic computation","field":"Computer Science","cited_by":30,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Dalhousie University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Numerical integration; Scheme (mathematics); Double-precision floating-point format; Computer science; Conjecture; Gravitational singularity; Singularity; Numerical analysis; Applied mathematics; Algorithm; Mathematics; Computation; Mathematical analysis; Discrete mathematics","score_opus":0.008369964369834197,"score_gpt":0.16980121331843973,"score_spread":0.16143124894860553,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1952011408","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7824176,0.000028531671,0.21351968,0.0012827727,0.00010310906,0.0001738657,0.00015744062,0.00024254384,0.0020744947],"genre_scores_gemma":[0.96871716,0.00004962005,0.027851894,0.000074273994,0.00005243596,1.28605535e-8,0.00026522749,0.000011047007,0.002978354],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.9983918,0.000067674344,0.00024053224,0.000547434,0.0004389587,0.00031356688],"domain_scores_gemma":[0.99864525,0.0001471253,0.0003597653,0.0004910396,0.0001103952,0.00024640193],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.000048263424,0.00025001488,0.0003996004,0.00037696975,0.00022817958,0.00008730038,0.0017743299,0.00009269533,0.00014965517],"category_scores_gemma":[0.000013934261,0.00030864132,0.0002476362,0.0009169903,0.00023412702,0.0070317993,0.0010311602,0.00021467882,0.00031296266],"study_design_candidate":"observational","study_design_consensus":"observational","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00024288085,0.0004369347,0.6112096,0.000025538387,0.00007958781,0.000077717516,0.00016935458,0.0032606788,7.354432e-7,0.005858613,0.0062767006,0.3723617],"study_design_scores_gemma":[0.00090476655,0.00024300485,0.9539612,0.00003663564,0.00002433702,0.0000064374753,0.000016058777,0.014060051,0.000028282126,0.0005504981,0.029837433,0.00033132193],"about_ca_topic_score_codex":0.00021848055,"about_ca_topic_score_gemma":0.0002708584,"teacher_disagreement_score":0.37203038,"about_ca_system_score_codex":0.00006628989,"about_ca_system_score_gemma":0.0001725404,"threshold_uncertainty_score":0.9999366},"labels":[],"label_agreement":null},{"id":"W1953187029","doi":"10.1017/jsl.2015.35","title":"DIFFERENTIAL-ALGEBRAIC JET SPACES PRESERVE INTERNALITY TO THE CONSTANTS","year":2015,"lang":"en","type":"preprint","venue":"Journal of Symbolic Logic","topic":"Polynomial and algebraic computation","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Agence Nationale de la Recherche","keywords":"Jet (fluid); Differential (mechanical device); Mathematics; Variety (cybernetics); Counterexample; Algebraic number; Pure mathematics; Tangent; Space (punctuation); Differential algebraic geometry; Tangent space; Abstraction; Algebra over a field; Field (mathematics); Differential geometry; Constant (computer programming); Algebraic variety; Real algebraic geometry; Mathematical analysis; Geometry; Discrete mathematics; Differential equation; Computer science; Physics; Differential algebraic equation; Ordinary differential equation","score_opus":0.04827301547641893,"score_gpt":0.2961488694067869,"score_spread":0.24787585393036798,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1953187029","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7316429,0.0009727805,0.24392833,0.016323373,0.0056887357,0.00038136815,0.000019417168,0.000060745428,0.0009823517],"genre_scores_gemma":[0.995376,0.000055695138,0.0024085953,0.00076041353,0.0012130195,0.000007050406,0.000002289705,0.000011710077,0.00016520693],"study_design_codex":"not_applicable","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9971498,0.00038605824,0.0008751242,0.00038730656,0.00084064656,0.0003610175],"domain_scores_gemma":[0.9968385,0.00019646426,0.0011555433,0.00075076893,0.0007017283,0.00035700685],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011358146,0.00033966778,0.0006956874,0.0002485073,0.00009659907,0.00073755905,0.0036379048,0.00016908276,0.000040582505],"category_scores_gemma":[0.00039277915,0.00019236564,0.00030057784,0.00033560093,0.00008387267,0.00028065068,0.00298977,0.00095533626,0.00005304878],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0009383596,0.0025698112,0.016737228,0.0009638874,0.0037455633,0.0014133602,0.05178633,0.036219135,0.0028222436,0.24603537,0.3789254,0.2578433],"study_design_scores_gemma":[0.0019328156,0.0010990785,0.04785426,0.0013099172,0.00023333576,0.0008854927,0.00032811708,0.026075454,0.0015943763,0.9050057,0.012378663,0.0013027703],"about_ca_topic_score_codex":0.00011993973,"about_ca_topic_score_gemma":0.000037273214,"teacher_disagreement_score":0.65897036,"about_ca_system_score_codex":0.0001739195,"about_ca_system_score_gemma":0.0006776571,"threshold_uncertainty_score":0.78444433},"labels":[],"label_agreement":null},{"id":"W1959874024","doi":"10.24908/pceea.v0i0.4880","title":"THE USE OF MAXIMA IN TEACHING ANALOG AND DIGITAL SIGNAL PROCESSING","year":2013,"lang":"en","type":"article","venue":"Proceedings of the Canadian Engineering Education Association (CEEA)","topic":"Polynomial and algebraic computation","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"Concordia University; École de Technologie Supérieure; Université du Québec à Montréal","funders":"","keywords":"Maxima; Computer science; Maxima and minima; Domain (mathematical analysis); Signal processing; SIGNAL (programming language); Software; Digital signal processing; Theoretical computer science; Mathematics; Computer hardware; Programming language; Mathematical analysis","score_opus":0.007641233426483956,"score_gpt":0.1845186493364617,"score_spread":0.17687741590997774,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1959874024","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.98885566,0.00010349937,0.0015072466,0.008169161,0.00031051022,0.00033022548,0.0000036932495,0.000039086284,0.0006808948],"genre_scores_gemma":[0.9978414,0.0000020585562,0.0017097574,0.00007669404,0.00003591902,0.000015255176,8.258245e-7,0.0000056649537,0.00031241975],"study_design_codex":"design_other","study_design_gemma":"observational","domain_scores_codex":[0.99932635,0.0000049306955,0.00021208085,0.000115748466,0.00016825864,0.00017260492],"domain_scores_gemma":[0.999313,0.00009801951,0.00023680678,0.000051703846,0.0002230668,0.000077419856],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00024519442,0.00007231382,0.000083469335,0.00015371927,0.00014123457,0.0004835732,0.00027706075,0.00004414232,0.0000010786982],"category_scores_gemma":[0.0004730034,0.000057153928,0.000026779411,0.00030154255,0.000015792995,0.0010203935,0.000045209104,0.000135142,7.970714e-7],"study_design_candidate":"observational","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00000196865,0.000084069194,0.2132173,0.00017362807,0.000047056667,7.350003e-8,0.005362056,0.002192869,0.0026896447,0.052305218,0.009926508,0.7139996],"study_design_scores_gemma":[0.00016042126,0.00001906785,0.6384852,0.00018887276,0.00000812637,0.0000040162217,0.00018108192,0.34727377,0.0004468004,0.0039221584,0.009099881,0.0002106521],"about_ca_topic_score_codex":0.0053944145,"about_ca_topic_score_gemma":0.0010758977,"teacher_disagreement_score":0.7137889,"about_ca_system_score_codex":0.0003964602,"about_ca_system_score_gemma":0.00029617135,"threshold_uncertainty_score":0.8154777},"labels":[],"label_agreement":null},{"id":"W196245569","doi":"10.1007/978-3-642-32973-9_17","title":"On Fulton’s Algorithm for Computing Intersection Multiplicities","year":2012,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Polynomial and algebraic computation","field":"Computer Science","cited_by":12,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"","keywords":"Intersection (aeronautics); Constructive; Bivariate analysis; Point (geometry); Algorithm; Field (mathematics); Computer science; Plane (geometry); Discrete mathematics; Mathematics; Combinatorics; Algebra over a field; Pure mathematics; Geometry","score_opus":0.01688801256639084,"score_gpt":0.24732127400229634,"score_spread":0.2304332614359055,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W196245569","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00022223475,0.00022567576,0.9927355,0.00029552143,0.0048682215,0.00060051505,0.000009813022,0.00026853287,0.0007740066],"genre_scores_gemma":[0.28087237,0.000011557885,0.71507174,0.0016207963,0.0020385585,0.000019940864,0.000016993838,0.00005202802,0.0002960142],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9967369,0.000029368552,0.0005372101,0.0012691161,0.00064746547,0.0007799627],"domain_scores_gemma":[0.9974541,0.0010814253,0.00033670457,0.0007327266,0.00021278474,0.00018225829],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0007700024,0.0005485039,0.00049712515,0.00086067105,0.00039592257,0.00046261086,0.0017979494,0.00027726515,0.000008620139],"category_scores_gemma":[0.000070072434,0.0005135448,0.00020612332,0.0003376412,0.00032694996,0.00060244213,0.00080226595,0.00059621566,0.000045086013],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000054680195,0.00002799735,0.000002577254,0.000022215476,0.000009888743,0.000004566675,0.00095012365,0.013947843,0.00004880619,0.0235234,0.000028468336,0.96142864],"study_design_scores_gemma":[0.00037277222,0.00027007586,0.000048569003,0.00030347295,0.000006769371,0.000032690717,3.8896732e-7,0.86045396,0.0011859656,0.13603677,0.00074576726,0.00054282654],"about_ca_topic_score_codex":0.000026358286,"about_ca_topic_score_gemma":0.00002733062,"teacher_disagreement_score":0.9608858,"about_ca_system_score_codex":0.000534902,"about_ca_system_score_gemma":0.00023393404,"threshold_uncertainty_score":0.9997316},"labels":[],"label_agreement":null},{"id":"W1965803816","doi":"10.1088/0264-9381/19/3/306","title":"An online interactive geometric database including exact solutions of Einstein's field equations","year":2002,"lang":"en","type":"article","venue":"Classical and Quantum Gravity","topic":"Polynomial and algebraic computation","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"","keywords":"Calculator; Modular design; Field (mathematics); Basis (linear algebra); Interface (matter); User interface; Symbolic computation; Database design; Java applet","score_opus":0.08891785241129584,"score_gpt":0.3037408412734556,"score_spread":0.21482298886215972,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1965803816","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.39113042,0.000105006315,0.60601807,0.0023244694,0.00018067649,0.00006726389,0.000032645516,0.00005376907,0.000087671804],"genre_scores_gemma":[0.9969016,0.000020299365,0.0027685745,0.00015425411,0.00008384267,0.0000035384403,0.000020789304,0.0000034401985,0.000043692104],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990291,0.00008603379,0.0002291187,0.00029217915,0.00016362814,0.00019996439],"domain_scores_gemma":[0.99871916,0.0006878005,0.00010397804,0.000279603,0.000062632054,0.00014681899],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001488074,0.000105428735,0.00017073184,0.00019802514,0.00021230981,0.000058176218,0.00028978958,0.000047935846,0.00002045901],"category_scores_gemma":[0.00030503562,0.000091363174,0.000052541647,0.0006113873,0.000065730106,0.0006743668,0.0002702123,0.00018811385,0.000008316297],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002240538,0.0020747401,0.000538047,0.00004001414,0.000038456314,0.000015874723,0.0008531282,0.000087346,0.0122362375,0.29832166,0.0014915649,0.6842805],"study_design_scores_gemma":[0.00031784704,0.00040225583,0.0067391777,0.000034050223,0.00001376553,0.0000071668437,0.000039115326,0.97528815,0.0011106349,0.015335327,0.0005443593,0.00016812042],"about_ca_topic_score_codex":0.0001178794,"about_ca_topic_score_gemma":0.000056863257,"teacher_disagreement_score":0.97520083,"about_ca_system_score_codex":0.00003329127,"about_ca_system_score_gemma":0.000021483385,"threshold_uncertainty_score":0.3725682},"labels":[],"label_agreement":null},{"id":"W1966409095","doi":"10.1007/s11704-008-0005-z","title":"Fraction-free matrix factors: new forms for LU and QR factors","year":2008,"lang":"en","type":"article","venue":"Frontiers of Computer Science in China","topic":"Polynomial and algebraic computation","field":"Computer Science","cited_by":20,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"","keywords":"Fraction (chemistry); Gaussian elimination; Factoring; Factorization; Computer science; Matrix (chemical analysis); Computation; QR decomposition; Integer matrix; LU decomposition; Algorithm; Mathematics; Gaussian; Matrix decomposition; Symmetric matrix","score_opus":0.01301193988760843,"score_gpt":0.24299779409560116,"score_spread":0.22998585420799272,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1966409095","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.47932497,0.00009312855,0.5192733,0.00024610182,0.0008479089,0.00014496224,0.0000025127113,0.000041423897,0.000025682491],"genre_scores_gemma":[0.7493418,0.000015590422,0.25045002,0.000038663067,0.000088092645,0.0000027517035,0.0000020046439,0.000005684962,0.000055374938],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.9982424,0.000017892877,0.00035581368,0.00054254255,0.00043080215,0.00041054862],"domain_scores_gemma":[0.9989338,0.000111018315,0.00019310789,0.00048791672,0.00006684256,0.00020732186],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00028877857,0.0001959569,0.00031155976,0.0004759568,0.00028756834,0.00014098866,0.0016350861,0.00005985512,0.0000010753363],"category_scores_gemma":[0.00008032943,0.00016104823,0.00008637381,0.0008049063,0.0003052837,0.0021023082,0.0004792236,0.00012103779,6.634811e-7],"study_design_candidate":"observational","study_design_consensus":"observational","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008953297,0.000510779,0.55514854,0.00010508457,0.000059700804,0.000019991778,0.02539778,0.0073599457,0.0013392796,0.025278226,0.08647701,0.29821414],"study_design_scores_gemma":[0.0009989943,0.00032585612,0.5828029,0.000028584866,0.0000040810874,0.000017460517,0.00007788346,0.35805732,0.003267829,0.053029157,0.0010284141,0.00036151896],"about_ca_topic_score_codex":0.00019489975,"about_ca_topic_score_gemma":0.0000095268415,"teacher_disagreement_score":0.35069737,"about_ca_system_score_codex":0.00008874106,"about_ca_system_score_gemma":0.00034095207,"threshold_uncertainty_score":0.6567356},"labels":[],"label_agreement":null},{"id":"W1968110934","doi":"10.1007/s11336-011-9226-4","title":"Picture of all Solutions of Successive 2-Block Maxbet Problems","year":2011,"lang":"en","type":"article","venue":"Psychometrika","topic":"Polynomial and algebraic computation","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Moncton","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Generalization; Eigenvalues and eigenvectors; Block (permutation group theory); Set (abstract data type); Covariance; Applied mathematics; Polynomial; Principal component analysis; Mathematical optimization; Algebra over a field; Combinatorics; Pure mathematics; Statistics; Mathematical analysis; Computer science","score_opus":0.0619760186064149,"score_gpt":0.2566667768860644,"score_spread":0.1946907582796495,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1968110934","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2867626,0.0014447807,0.6918784,0.0006715867,0.0015956748,0.00050622766,0.000030922783,0.00018226766,0.016927566],"genre_scores_gemma":[0.98814815,0.000015204767,0.011625737,0.00006578394,0.000033337878,0.0000068025106,0.0000022316992,0.0000049694877,0.00009779916],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"observational","domain_scores_codex":[0.9990153,0.000033588796,0.00030872674,0.00022540124,0.00020943562,0.00020758818],"domain_scores_gemma":[0.9991134,0.00010868937,0.00023984618,0.000358124,0.00010948678,0.00007044441],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00017694755,0.00009796268,0.00018291503,0.00039581239,0.000035157103,0.000012985313,0.00067172677,0.00005419214,0.000037447335],"category_scores_gemma":[0.000068088455,0.00008471499,0.00008533869,0.0012767806,0.000057330693,0.00018554916,0.00012794272,0.00008203081,0.000015466469],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00014189014,0.004057548,0.026357137,0.00062262843,0.0007481639,0.000014800768,0.04042865,0.0007378419,0.034197032,0.49425018,0.015872864,0.38257125],"study_design_scores_gemma":[0.0068638455,0.003335582,0.5259545,0.0005540606,0.00018475752,0.000081956794,0.00040389417,0.032276127,0.10982355,0.2921585,0.026214255,0.002148996],"about_ca_topic_score_codex":0.00008183899,"about_ca_topic_score_gemma":0.000008627964,"teacher_disagreement_score":0.70138556,"about_ca_system_score_codex":0.000012198273,"about_ca_system_score_gemma":0.0000374147,"threshold_uncertainty_score":0.3454577},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.015564302864567206,"score_gpt":0.25650667957007073,"score_spread":0.24094237670550353,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1968315351","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.46935582,0.00019820427,0.5270564,0.0020454363,0.00039108755,0.00010926047,2.9543054e-7,0.000026461674,0.0008170664],"genre_scores_gemma":[0.99369663,0.000015539725,0.0057142354,0.00034540988,0.00021169819,0.0000026112236,0.0000011724969,0.0000051631173,0.0000075542052],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983257,0.0003350437,0.00059599103,0.00012691725,0.00043314623,0.0001832096],"domain_scores_gemma":[0.99874353,0.0003977594,0.0004662207,0.00014972,0.00018583047,0.000056907153],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009972849,0.00011731657,0.00023253696,0.00029449112,0.00010335893,0.00017129503,0.0007547817,0.000038747803,0.0000019616266],"category_scores_gemma":[0.000040128463,0.000081341976,0.00009922743,0.00079477864,0.000030065861,0.0006020733,0.000062885316,0.00024124888,0.000017887181],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00014349983,0.0006937239,0.00375512,0.00009856371,0.00013899128,0.0011400757,0.07044483,0.09509101,0.00053722685,0.18891948,0.0042855986,0.63475186],"study_design_scores_gemma":[0.0028584069,0.0006099672,0.15329048,0.00035352586,0.00003551144,0.004757464,0.0048085917,0.77770734,0.00015241247,0.053147387,0.001883898,0.00039498357],"about_ca_topic_score_codex":0.000042924945,"about_ca_topic_score_gemma":0.000007947647,"teacher_disagreement_score":0.68261635,"about_ca_system_score_codex":0.0001113921,"about_ca_system_score_gemma":0.00009846913,"threshold_uncertainty_score":0.33170298},"labels":[],"label_agreement":null},{"id":"W1970815075","doi":"10.1145/1073884.1073903","title":"Algorithms for the non-monic case of the sparse modular GCD algorithm","year":2005,"lang":"en","type":"article","venue":"","topic":"Polynomial and algebraic computation","field":"Computer Science","cited_by":28,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Computer science; Modular design; Algorithm; Algorithm design; Theoretical computer science; Programming language","score_opus":0.01762626213556659,"score_gpt":0.2539991642299192,"score_spread":0.2363729020943526,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1970815075","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.016561015,0.00012486117,0.97797894,0.0042183446,0.00045807095,0.00035248554,0.0000053307567,0.000042089152,0.00025886644],"genre_scores_gemma":[0.8282171,0.000005966097,0.16981392,0.00062155444,0.00029528304,0.000030177873,5.6570053e-7,0.0000066965413,0.0010087563],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99922246,0.000025012198,0.00020191814,0.00020862879,0.00014186098,0.00020010487],"domain_scores_gemma":[0.9990927,0.00020305337,0.00008492927,0.00051248766,0.00006555137,0.000041264513],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00026216081,0.000098535194,0.00010395805,0.000027740622,0.00020809959,0.000058217815,0.0007515465,0.00003191182,0.000009435438],"category_scores_gemma":[0.000017066479,0.000050614035,0.00012729104,0.00024030214,0.00005516467,0.00020319001,0.00023980644,0.000071724906,0.000013288909],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000011090863,0.00003784047,0.00000354085,0.0000029320063,0.00001622178,0.0000057781504,0.00032327292,0.0035778093,0.00013242666,0.0062408554,0.0009812223,0.98867697],"study_design_scores_gemma":[0.0002898753,0.000034553133,0.00030893387,0.000004799074,0.000009663227,0.00016057612,0.000029642471,0.9851929,0.0056211567,0.0029293695,0.0053379396,0.00008059892],"about_ca_topic_score_codex":0.00020284232,"about_ca_topic_score_gemma":0.000062742976,"teacher_disagreement_score":0.9885964,"about_ca_system_score_codex":0.000024103016,"about_ca_system_score_gemma":0.000066874054,"threshold_uncertainty_score":0.20639804},"labels":[],"label_agreement":null},{"id":"W1971160839","doi":"10.1145/2465506.2465947","title":"Computing column bases of polynomial matrices","year":2013,"lang":"en","type":"article","venue":"","topic":"Polynomial and algebraic computation","field":"Computer Science","cited_by":16,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Column (typography); Matrix (chemical analysis); Mathematics; Basis (linear algebra); Matrix multiplication; Polynomial matrix; Degree (music); Univariate; Integer matrix; Polynomial; Combinatorics; Matrix polynomial; Discrete mathematics; Symmetric matrix; Algorithm; Nonnegative matrix; Mathematical analysis; Statistics; Geometry","score_opus":0.009104269012221718,"score_gpt":0.219333257819703,"score_spread":0.21022898880748128,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1971160839","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5907681,0.000045739653,0.4016588,0.00075180613,0.00031582196,0.00013784922,5.9837373e-7,0.00015934465,0.006161908],"genre_scores_gemma":[0.9471847,0.0000011135312,0.052190408,0.0002500374,0.00008424698,0.000002029967,6.9398163e-7,0.000002867764,0.00028394343],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992829,0.000026612437,0.00021933088,0.0001724816,0.00013651406,0.00016218543],"domain_scores_gemma":[0.99945533,0.00014675046,0.000097240045,0.00017858483,0.000062804014,0.00005930546],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00008658111,0.00007242685,0.000120507386,0.00007748227,0.00005746158,0.0001028931,0.00043163443,0.00002373207,0.000113019014],"category_scores_gemma":[0.000015824595,0.00006256918,0.000047101148,0.00025467773,0.000027511696,0.00041576196,0.00021466005,0.0000386107,0.00013835264],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000056695944,0.00021771411,0.0074224873,0.000055378885,0.000038745085,0.000004119172,0.0009245175,0.00082571193,0.009322715,0.05860166,0.07154317,0.8510381],"study_design_scores_gemma":[0.0008989551,0.00026950502,0.11155409,0.00005045545,0.0000090260855,0.000024019288,0.00013101833,0.8494961,0.02665357,0.0058790194,0.0045273434,0.000506858],"about_ca_topic_score_codex":0.001273894,"about_ca_topic_score_gemma":0.000009587664,"teacher_disagreement_score":0.8505313,"about_ca_system_score_codex":0.0000111293275,"about_ca_system_score_gemma":0.000043114233,"threshold_uncertainty_score":0.25514972},"labels":[],"label_agreement":null},{"id":"W1974405827","doi":"10.1063/1.1286511","title":"Generating-function method for tensor products","year":2000,"lang":"en","type":"article","venue":"Journal of Mathematical Physics","topic":"Polynomial and algebraic computation","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University; Université Laval","funders":"","keywords":"Affine transformation; Diophantine equation; Tensor product; Tensor (intrinsic definition); Algebra over a field; Character (mathematics); Exposition (narrative); Set (abstract data type)","score_opus":0.024357049469245922,"score_gpt":0.2784930217623106,"score_spread":0.25413597229306467,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1974405827","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.014815509,0.000024101637,0.98331183,0.0012113794,0.00017419022,0.000100808866,5.0633025e-7,0.000020798669,0.00034085664],"genre_scores_gemma":[0.041795976,0.0000020633374,0.9561602,0.0004135059,0.0011923733,0.0000039588826,4.367904e-7,0.000008241543,0.00042325375],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99917436,0.000040989617,0.0003360825,0.000110667424,0.00021261137,0.00012528535],"domain_scores_gemma":[0.9992147,0.00021580588,0.00018014811,0.0001405768,0.00018991866,0.00005885812],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00043205483,0.00008037038,0.00019236468,0.000023146635,0.00006307185,0.000077475815,0.00024302032,0.000024365345,0.000019978652],"category_scores_gemma":[0.00010695358,0.000058096495,0.0001066226,0.00014989082,0.000012250215,0.00035357918,0.00001901204,0.000092157374,0.00002817847],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000031785632,0.0002570236,7.971067e-7,0.00007394086,0.00004138975,0.0000024019591,0.00035481527,0.005922054,0.0065845577,0.14949445,0.0037414362,0.8334953],"study_design_scores_gemma":[0.00030256686,0.00023163817,0.000022589438,0.000027972585,0.000018216842,0.000045990815,0.0000040329646,0.42389297,0.0039608814,0.5694184,0.0019973458,0.000077426244],"about_ca_topic_score_codex":2.307081e-7,"about_ca_topic_score_gemma":2.6120087e-8,"teacher_disagreement_score":0.8334179,"about_ca_system_score_codex":0.000018019526,"about_ca_system_score_gemma":0.000057134246,"threshold_uncertainty_score":0.23691064},"labels":[],"label_agreement":null},{"id":"W1976667787","doi":"10.1145/2582112.2582150","title":"Polynomials vanishing on grids","year":2014,"lang":"en","type":"article","venue":"","topic":"Polynomial and algebraic computation","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Bivariate analysis; Univariate; Mathematics; Constant (computer programming); Combinatorics; Polynomial; Degree (music); Discrete mathematics; Mathematical analysis; Physics; Multivariate statistics; Statistics; Computer science","score_opus":0.010742263296587253,"score_gpt":0.22317396659385727,"score_spread":0.21243170329727,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1976667787","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05682423,0.0000052553814,0.86806107,0.0027830552,0.00070364744,0.00004985795,1.8598328e-7,0.00030764376,0.071265064],"genre_scores_gemma":[0.98221636,5.3564804e-7,0.013998307,0.0026572174,0.00025418898,0.0000022420622,5.8183076e-7,0.000003710544,0.0008668851],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993207,0.000043026757,0.00011930004,0.00021942277,0.00013537826,0.00016216144],"domain_scores_gemma":[0.99948233,0.00014306573,0.000034339377,0.0002570401,0.000014700322,0.00006854191],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00022981405,0.00007477448,0.000084383,0.00005170022,0.00008306362,0.00016615375,0.00043865223,0.00002522699,0.00002438554],"category_scores_gemma":[0.000046007877,0.00006037373,0.000037659524,0.00012098695,0.00001002881,0.00027225426,0.00011061531,0.000056561552,0.0003780404],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000018543329,0.000021357264,0.000049361395,0.0000015837435,0.0000029666387,8.0536785e-7,0.000095023475,0.00019871257,0.001034538,0.65470695,0.0052710203,0.3386158],"study_design_scores_gemma":[0.0013210351,0.00074531575,0.020945307,0.000046714715,0.0000065380486,0.000022253498,0.0000173402,0.57993454,0.05410647,0.20199528,0.13996886,0.00089033274],"about_ca_topic_score_codex":0.000030102798,"about_ca_topic_score_gemma":0.000003958852,"teacher_disagreement_score":0.9253921,"about_ca_system_score_codex":0.000016377828,"about_ca_system_score_gemma":0.000016779066,"threshold_uncertainty_score":0.48590705},"labels":[],"label_agreement":null},{"id":"W1977906522","doi":"10.1007/s11786-012-0136-3","title":"On Solving Parametric Polynomial Systems","year":2012,"lang":"en","type":"article","venue":"Mathematics in Computer Science","topic":"Polynomial and algebraic computation","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"","keywords":"Parametric statistics; Discriminant; Mathematics; Polynomial; Computation; Projection (relational algebra); Matrix polynomial; Pure mathematics; Algebra over a field; Alternating polynomial; Discrete mathematics; Applied mathematics; Mathematical analysis; Algorithm; Computer science; Artificial intelligence; Statistics","score_opus":0.024804728485505474,"score_gpt":0.2610001570369275,"score_spread":0.23619542855142206,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1977906522","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.20278029,0.00007324693,0.7933838,0.00009156491,0.0025076992,0.00022674388,3.3621995e-7,0.00012404633,0.0008122757],"genre_scores_gemma":[0.8217986,0.0000015647738,0.17779823,0.00013941801,0.00022200904,0.000016187465,1.8046686e-7,0.0000062795752,0.000017530836],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9977651,0.00004532059,0.00040101432,0.0004140846,0.000667526,0.00070691266],"domain_scores_gemma":[0.99839944,0.0005370045,0.00014811115,0.0006532749,0.000054413547,0.00020775282],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017432356,0.00017921929,0.00023023813,0.0007155613,0.0002004067,0.0005528466,0.0016792114,0.000045715315,0.0000024325384],"category_scores_gemma":[0.00013748603,0.00015528568,0.000047225425,0.0022137633,0.00013222553,0.0011827056,0.00062707555,0.00017354249,0.00015649901],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000036456156,0.0009569081,0.0009668017,0.000108873995,0.000009110806,0.000015300853,0.006343778,0.037337888,0.0005244139,0.8018208,0.0010550366,0.1508574],"study_design_scores_gemma":[0.00018843803,0.000064452026,0.0019046876,0.00008317604,0.000001278966,0.000037207617,0.000009770709,0.9910692,0.00047542938,0.005843735,0.000105853826,0.0002167919],"about_ca_topic_score_codex":0.000015952186,"about_ca_topic_score_gemma":7.0884767e-7,"teacher_disagreement_score":0.9537313,"about_ca_system_score_codex":0.00019964686,"about_ca_system_score_gemma":0.00012312578,"threshold_uncertainty_score":0.63323665},"labels":[],"label_agreement":null},{"id":"W1978562199","doi":"10.1016/j.tcs.2007.10.003","title":"Change of order for regular chains in positive dimension","year":2007,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Polynomial and algebraic computation","field":"Computer Science","cited_by":29,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"","keywords":"Dimension (graph theory); Mathematics; Modular design; Subroutine; Algebraic number; Variable (mathematics); Order (exchange); Zero (linguistics); Chain (unit); Computation; Symbolic computation; Algebra over a field; Applied mathematics; Pure mathematics; Algorithm; Computer science; Mathematical analysis","score_opus":0.013504122682615272,"score_gpt":0.26307325647754887,"score_spread":0.2495691337949336,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1978562199","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.17785215,0.000020135267,0.8203125,0.00095334527,0.00034373882,0.00028065703,0.0000010698029,0.000041144394,0.00019524294],"genre_scores_gemma":[0.83444506,9.663679e-7,0.16505088,0.00039647723,0.00009382085,0.000005376335,8.002249e-7,0.0000037569382,0.0000028675609],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983925,0.000037228016,0.0002864597,0.00045654608,0.0003677875,0.00045945495],"domain_scores_gemma":[0.99889517,0.00034349295,0.00007497279,0.00033302014,0.00022287799,0.00013046886],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019653374,0.000116022115,0.00017779852,0.00028965026,0.00012022338,0.000054633703,0.00092931127,0.00004188433,0.0000022384017],"category_scores_gemma":[0.00007359554,0.00009808916,0.00004510945,0.0013699812,0.0008601127,0.00044679426,0.00047149236,0.0000802069,0.0000038219855],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000018346122,0.00005635376,0.000049638726,0.0000060828747,0.0000011351558,0.000004124294,0.0010840284,0.00004628198,0.0020202887,0.8965161,0.0000038602075,0.10019377],"study_design_scores_gemma":[0.0005283034,0.0004422773,0.017262401,0.000077223056,0.0000024011294,0.000010155946,0.000010124237,0.7601482,0.03523023,0.18605354,0.00002986879,0.00020523787],"about_ca_topic_score_codex":0.000011714896,"about_ca_topic_score_gemma":0.000004216891,"teacher_disagreement_score":0.7601019,"about_ca_system_score_codex":0.000055957804,"about_ca_system_score_gemma":0.00006596444,"threshold_uncertainty_score":0.39999595},"labels":[],"label_agreement":null},{"id":"W1978778998","doi":"10.1007/s10208-009-9054-4","title":"A Note on the Finite Variance of the Averaging Function for Polynomial System Solving","year":2009,"lang":"en","type":"article","venue":"Foundations of Computational Mathematics","topic":"Polynomial and algebraic computation","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Mathematics; Polynomial; Homotopy analysis method; Function (biology); Variance (accounting); Homotopy; Applied mathematics; Variance function; Matrix polynomial; Mathematical analysis; Pure mathematics; Statistics; Regression analysis","score_opus":0.020101261640877468,"score_gpt":0.2506759855069396,"score_spread":0.23057472386606212,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1978778998","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.012893799,0.000007651164,0.982491,0.0029792287,0.00041550558,0.0004111372,0.0000114203085,0.00004762776,0.0007426365],"genre_scores_gemma":[0.89483964,2.293332e-7,0.10479759,0.00021259052,0.00008131767,0.000015605578,0.000006400768,0.0000051829365,0.00004143175],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988605,0.000051245133,0.00046695166,0.00015754644,0.00033894414,0.00012483439],"domain_scores_gemma":[0.9969566,0.0019546181,0.0004720547,0.00032823812,0.0002665177,0.000021995224],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00039086316,0.00011059782,0.0001615507,0.00008857323,0.0003338444,0.00008211965,0.00056090305,0.00003188693,0.0000031070274],"category_scores_gemma":[0.00026005306,0.00007413679,0.00013229977,0.00037468417,0.000052090658,0.00020057459,0.000062334286,0.00007780544,0.0000070216006],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008738959,0.000082469065,0.000003378538,0.00005052016,0.000017294642,5.236768e-8,0.00071653555,0.17563973,0.00018314592,0.8172238,0.0002586842,0.0058156536],"study_design_scores_gemma":[0.00022316209,0.000080780854,0.0014085845,0.00014301384,0.000016090533,0.000003245604,0.000037788654,0.7769306,0.000330861,0.22061218,0.000146218,0.00006753233],"about_ca_topic_score_codex":0.0000031346472,"about_ca_topic_score_gemma":8.946893e-7,"teacher_disagreement_score":0.88194585,"about_ca_system_score_codex":0.000055831573,"about_ca_system_score_gemma":0.00016454987,"threshold_uncertainty_score":0.30232105},"labels":[],"label_agreement":null},{"id":"W1980283844","doi":"10.1016/s0196-8858(02)00529-8","title":"A direct algorithm to construct the minimal Z-pairs for rational functions","year":2003,"lang":"en","type":"article","venue":"Advances in Applied Mathematics","topic":"Polynomial and algebraic computation","field":"Computer Science","cited_by":15,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Construct (python library); Mathematics; Maple; Algorithm; Rational function; Discrete mathematics; Algebra over a field; Computer science; Pure mathematics","score_opus":0.011469852445144015,"score_gpt":0.2527011517575469,"score_spread":0.24123129931240292,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1980283844","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0005973414,0.000093349394,0.9812584,0.00027010147,0.00030030622,0.0004948617,0.0000068658983,0.000057918125,0.016920848],"genre_scores_gemma":[0.12422693,0.000004198009,0.8750547,0.00023170294,0.000051702635,0.00030036946,0.0000025266547,0.0000069522516,0.000120933386],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992053,0.000012462054,0.00023755767,0.00021011793,0.00014801986,0.0001865555],"domain_scores_gemma":[0.99899715,0.0006440773,0.000073946765,0.00021466712,0.000027496972,0.000042687512],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00027119668,0.00010365494,0.0001331707,0.000060675065,0.00013542047,0.000058964797,0.00028024756,0.000023241326,0.000006197509],"category_scores_gemma":[0.000104221544,0.00007752402,0.000037765847,0.00032996165,0.000044245247,0.00014083167,0.00004651329,0.0000533665,0.000025752506],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000002590276,0.000052866304,0.000006545235,0.000017470773,0.000004530794,3.4238056e-7,0.0005656685,0.0015016211,0.000115484945,0.8689011,0.00034512233,0.1284867],"study_design_scores_gemma":[0.0008758685,0.000095123316,0.00006730902,0.000033594068,0.000012560056,0.000026408148,0.00073311967,0.12891209,0.0036499088,0.7790708,0.08614548,0.0003777367],"about_ca_topic_score_codex":4.3849636e-7,"about_ca_topic_score_gemma":0.000008784126,"teacher_disagreement_score":0.12810896,"about_ca_system_score_codex":0.00003266413,"about_ca_system_score_gemma":0.00006260835,"threshold_uncertainty_score":0.31613377},"labels":[],"label_agreement":null},{"id":"W1982363352","doi":"10.1090/s0025-5718-05-01790-4","title":"Gröbner bases and generalized Padé approximation","year":2005,"lang":"en","type":"article","venue":"Mathematics of Computation","topic":"Polynomial and algebraic computation","field":"Computer Science","cited_by":14,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"Office of Naval Research; Multidisciplinary University Research Initiative; Mitacs; National Security Agency; National Science Foundation","keywords":"Mathematics; Basis (linear algebra); Multivariate statistics; Applied mathematics; Degree (music); Standard basis; Algebra over a field; Pure mathematics; Geometry; Statistics","score_opus":0.01683051534729296,"score_gpt":0.24697828104676153,"score_spread":0.23014776569946857,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1982363352","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.25773752,0.000059808182,0.740854,0.00060411595,0.00005236324,0.00011581413,8.1392113e-7,0.000076266835,0.00049929734],"genre_scores_gemma":[0.579053,0.0000041371395,0.42079332,0.00006905457,0.000037455702,0.0000044881513,0.0000045216784,0.000004182541,0.000029880595],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991542,0.000034539305,0.00033342713,0.00016355365,0.00020632613,0.0001079725],"domain_scores_gemma":[0.99937236,0.00015179526,0.00020539094,0.00014159874,0.000085329964,0.00004354755],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00022685433,0.00009928637,0.00016442008,0.000113103524,0.00005669779,0.000072891096,0.00016106023,0.000032906166,0.0000048727175],"category_scores_gemma":[0.000038321534,0.00009076607,0.000035928184,0.00017126414,0.000030118856,0.00043839472,0.0000831328,0.000038053895,0.000012519602],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000006081978,0.00025955384,0.000048863392,0.00020495965,0.00002764528,8.9893126e-7,0.004244853,0.021500148,0.005128248,0.42524973,0.00063482317,0.5426942],"study_design_scores_gemma":[0.00033294075,0.000032161213,0.00044731778,0.000026833248,0.000006800123,0.00000920525,0.00001824998,0.90192056,0.005162761,0.09177683,0.0001675122,0.00009882423],"about_ca_topic_score_codex":0.000005656715,"about_ca_topic_score_gemma":0.000001843123,"teacher_disagreement_score":0.8804204,"about_ca_system_score_codex":0.000017052409,"about_ca_system_score_gemma":0.000022096423,"threshold_uncertainty_score":0.3701333},"labels":[],"label_agreement":null},{"id":"W1983959695","doi":"10.1016/j.crma.2007.04.009","title":"Positive polynomials on fibre products","year":2007,"lang":"fr","type":"article","venue":"Comptes Rendus Mathématique","topic":"Polynomial and algebraic computation","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Saskatchewan","funders":"Natural Sciences and Engineering Research Council of Canada; National Science Foundation","keywords":"Mathematics; Iterated function; Combinatorics; Invariant (physics); Pure mathematics; Mathematical analysis","score_opus":0.02511189633209031,"score_gpt":0.26721524854681505,"score_spread":0.24210335221472473,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1983959695","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3538923,0.020782143,0.41990826,0.11702289,0.018427523,0.0024390335,0.00019424688,0.0011832023,0.0661504],"genre_scores_gemma":[0.94035816,0.0002112382,0.031126712,0.004675951,0.0030373863,0.00002202712,0.000061904466,0.00008243425,0.020424215],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99633485,0.000308851,0.0008430859,0.0009734273,0.00050877826,0.0010310212],"domain_scores_gemma":[0.99704885,0.0009694499,0.00043468905,0.00087296957,0.00030308825,0.00037096677],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0011974038,0.000546431,0.0005685962,0.00030406853,0.00033636985,0.0004584473,0.000977036,0.0003228614,0.00029036516],"category_scores_gemma":[0.0002800766,0.000561166,0.00017886335,0.00088118593,0.00023186694,0.00073359994,0.0004435246,0.00063304347,0.0027477795],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00011689797,0.0007255588,0.00007732952,0.0002527517,0.00012168165,0.00038972535,0.0040285373,0.00044715457,0.0060204687,0.41393816,0.15481369,0.41906807],"study_design_scores_gemma":[0.003418093,0.0034491871,0.09581992,0.004525466,0.00016224208,0.001459176,0.00027303316,0.05538935,0.39578986,0.07301641,0.36248836,0.004208888],"about_ca_topic_score_codex":0.00027854345,"about_ca_topic_score_gemma":0.000025998936,"teacher_disagreement_score":0.58646584,"about_ca_system_score_codex":0.00030429586,"about_ca_system_score_gemma":0.0003708193,"threshold_uncertainty_score":0.999684},"labels":[],"label_agreement":null},{"id":"W1984950894","doi":"10.1145/1073884.1073927","title":"Computing the rank and a small nullspace basis of a polynomial matrix","year":2005,"lang":"en","type":"preprint","venue":"","topic":"Polynomial and algebraic computation","field":"Computer Science","cited_by":38,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Mathematics; Rank (graph theory); Matrix (chemical analysis); Combinatorics; Matrix multiplication; Degree (music); Dimension (graph theory); Polynomial; Polynomial matrix; Matrix polynomial; Discrete mathematics; Mathematical analysis","score_opus":0.01597257748076527,"score_gpt":0.25204316922439773,"score_spread":0.23607059174363246,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1984950894","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2964625,0.00090883626,0.69071376,0.008874986,0.0007269026,0.00043402365,0.00000741215,0.00018519395,0.0016863436],"genre_scores_gemma":[0.89465016,0.000040496903,0.104035616,0.00034029185,0.00043614776,0.0000055896176,0.000003190583,0.000011204585,0.000477295],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984909,0.000118761156,0.00040510035,0.00051624264,0.00020889637,0.00026009695],"domain_scores_gemma":[0.9986071,0.00034232248,0.00031172484,0.0005899733,0.00006690676,0.000081953025],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004750158,0.00024517532,0.0003571656,0.00012127238,0.00011951153,0.00023444794,0.0011045584,0.00014089668,0.00001112581],"category_scores_gemma":[0.0000346158,0.00017303364,0.00014760025,0.00017467636,0.000092998795,0.00008048688,0.002797392,0.00036289252,0.0000090138465],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000044032255,0.00013997592,0.0004891652,0.00024892035,0.00018007446,0.000008858285,0.007155349,0.011587266,0.00052562624,0.026885824,0.0057298564,0.94700503],"study_design_scores_gemma":[0.0008532891,0.00007050629,0.009030608,0.0001803689,0.000051217816,0.0000479487,0.00009510836,0.9800553,0.00221227,0.003963149,0.0028950176,0.0005452608],"about_ca_topic_score_codex":0.00065282895,"about_ca_topic_score_gemma":0.00010885975,"teacher_disagreement_score":0.968468,"about_ca_system_score_codex":0.000035646684,"about_ca_system_score_gemma":0.00018557564,"threshold_uncertainty_score":0.7056107},"labels":[],"label_agreement":null},{"id":"W1985407367","doi":"10.1016/j.jsc.2007.12.002","title":"A bound for the Rosenfeld–Gröbner algorithm","year":2008,"lang":"en","type":"article","venue":"Journal of Symbolic Computation","topic":"Polynomial and algebraic computation","field":"Computer Science","cited_by":13,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"Natural Sciences and Engineering Research Council of Canada; Russian Foundation for Basic Research; National Science Foundation","keywords":"Mathematics; Ideal (ethics); Gröbner basis; Decomposition; Differential (mechanical device); Upper and lower bounds; Algebraic number; Polynomial; Set (abstract data type); Discrete mathematics; Combinatorics; Algorithm; Algebra over a field; Pure mathematics; Mathematical analysis; Computer science","score_opus":0.024194627056162567,"score_gpt":0.2645510586430663,"score_spread":0.2403564315869037,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1985407367","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0525317,0.00038555256,0.943141,0.002517743,0.0011671408,0.00014986841,0.0000011657654,0.000028702892,0.00007715929],"genre_scores_gemma":[0.91830724,0.00004859867,0.08017325,0.0004506704,0.0008890328,0.000005464034,0.0000014561758,0.000008492149,0.00011580009],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989071,0.00004495299,0.00043101396,0.00012656962,0.0003176247,0.00017275105],"domain_scores_gemma":[0.9986151,0.00046877397,0.0003870643,0.00012371343,0.00033138331,0.00007394944],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00039822733,0.00010408967,0.0001834247,0.00013312942,0.00031732602,0.00011453017,0.0004536906,0.000036312565,0.0000024470303],"category_scores_gemma":[0.000052047395,0.00006996605,0.00016702544,0.000288546,0.000051535433,0.00047280922,0.00005847108,0.00013042973,0.000007467885],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000020165266,0.00009795697,0.000070353715,0.000008812148,0.00007773216,0.00002359,0.0028300688,0.012841628,0.00032123004,0.005157795,0.008615344,0.9699353],"study_design_scores_gemma":[0.0011580578,0.0002973309,0.015846943,0.000024703622,0.00002554501,0.0010955572,0.000055227323,0.9418423,0.00043502354,0.029720686,0.0093370825,0.00016151863],"about_ca_topic_score_codex":0.0000124665285,"about_ca_topic_score_gemma":0.000001108436,"teacher_disagreement_score":0.9697738,"about_ca_system_score_codex":0.00004755865,"about_ca_system_score_gemma":0.0002000686,"threshold_uncertainty_score":0.28531328},"labels":[],"label_agreement":null},{"id":"W1985765221","doi":"10.1016/j.cam.2011.03.033","title":"On the finite sum representations and transcendence properties of the Lauricella functions <mml:math xmlns:mml=\"http://www.w3.org/1998/Math/MathML\" altimg=\"si1.gif\" display=\"inline\" overflow=\"scroll\"><mml:msub><mml:mrow><mml:mi>F</mml:mi></mml:mrow><mml:mrow><mml:mi>D</mml:mi></mml:mrow></mml:msub></mml:math>","year":2011,"lang":"lv","type":"article","venue":"Journal of Computational and Applied Mathematics","topic":"Polynomial and algebraic computation","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"St. Francis Xavier University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Transcendental number; Rational function; Logarithm; Algebraic number; Function (biology); Combinatorics; Conjecture; Transcendental function; Discrete mathematics; Pure mathematics; Mathematical analysis","score_opus":0.0271533939686795,"score_gpt":0.22981889379099846,"score_spread":0.20266549982231896,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1985765221","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8351907,0.00048952835,0.02362778,0.0012863271,0.0010810638,0.00004236297,0.000068687434,0.000044008484,0.13816951],"genre_scores_gemma":[0.9913238,0.00023577063,0.0067920825,0.00066808733,0.0005818732,0.00012238293,0.000046453868,0.00010347796,0.00012603245],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.996247,0.00014353564,0.0011381453,0.00051770214,0.0013568224,0.0005967762],"domain_scores_gemma":[0.9958096,0.0016059441,0.0014914076,0.0006234783,0.00015320424,0.0003163336],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0009949437,0.00032169293,0.00018018742,0.00020403034,0.00097897,0.0006240924,0.00095908204,0.00040126411,0.025782797],"category_scores_gemma":[0.0004009006,0.00041793555,0.0005669015,0.00054212287,0.00080911664,0.0005864728,0.00056290434,0.00069790264,0.00015006089],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00045010773,0.00034083592,0.000006095343,0.00066546584,0.00060488906,0.00008757446,0.0064654243,0.017549813,0.001288296,0.9304126,0.04007998,0.0020489153],"study_design_scores_gemma":[0.0012519156,0.0008303575,0.00034155976,0.0011485816,0.0007075346,0.00089367403,0.0022002966,0.39104366,0.5936822,0.0070225913,0.00027471877,0.000602907],"about_ca_topic_score_codex":0.00014791013,"about_ca_topic_score_gemma":0.000120462944,"teacher_disagreement_score":0.92339003,"about_ca_system_score_codex":0.000005583616,"about_ca_system_score_gemma":0.0007362151,"threshold_uncertainty_score":0.99982727},"labels":[],"label_agreement":null},{"id":"W1985813832","doi":"10.1007/s00037-013-0063-y","title":"Modular Composition Modulo Triangular Sets and Applications","year":2013,"lang":"en","type":"article","venue":"Computational Complexity","topic":"Polynomial and algebraic computation","field":"Computer Science","cited_by":20,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"Agence Nationale de la Recherche","keywords":"Modulo; Modular design; Elliptic curve; Mathematics; Modular arithmetic; Discrete mathematics; Exponential function; Computer science; Algorithm; Cryptography; Pure mathematics","score_opus":0.027523732170211975,"score_gpt":0.25565941027182837,"score_spread":0.2281356781016164,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1985813832","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15145385,0.00012581678,0.8450317,0.0018848042,0.00011057628,0.0005555817,0.000010723632,0.0002526667,0.00057433476],"genre_scores_gemma":[0.8757231,0.0000018864862,0.12329686,0.0006110606,0.000103105354,0.00012032432,0.00010765164,0.000008714011,0.000027305843],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985634,0.000100488855,0.00031248506,0.00047358344,0.00030949604,0.0002405134],"domain_scores_gemma":[0.99901664,0.00017373214,0.00011824453,0.00029347363,0.00021960684,0.00017829868],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00014600705,0.0001791446,0.0001977038,0.00013596898,0.00037091473,0.00031476855,0.00043569942,0.00005202789,0.000046025347],"category_scores_gemma":[0.000010651449,0.00018521985,0.0000643792,0.00034578494,0.00014352097,0.00071866956,0.00026571113,0.0001249929,0.0002278857],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000006239687,0.00019529206,0.0003054788,0.000036208057,0.00004327039,0.0000031304965,0.00024351936,0.031346045,0.0012424139,0.8325468,0.0011351486,0.13289648],"study_design_scores_gemma":[0.0002942855,0.00002290849,0.0620741,0.0000056176905,0.0000031867303,0.00002258929,0.0000039362144,0.50012535,0.00004856061,0.4369423,0.0003194675,0.0001376665],"about_ca_topic_score_codex":0.000070412185,"about_ca_topic_score_gemma":0.0000019515285,"teacher_disagreement_score":0.7242693,"about_ca_system_score_codex":0.00005245577,"about_ca_system_score_gemma":0.000052720126,"threshold_uncertainty_score":0.75530463},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.030379033731166363,"score_gpt":0.24297582710149582,"score_spread":0.21259679337032944,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1985924702","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.79190844,0.00004684626,0.19177678,0.014948502,0.0004932842,0.00027136377,6.656947e-7,0.00001474045,0.0005393491],"genre_scores_gemma":[0.9896519,0.000002856498,0.009543744,0.0006412314,0.00011526611,0.0000036573654,3.6736856e-7,0.000004686955,0.000036246594],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985676,0.00021789146,0.0005281632,0.00010650045,0.00044480374,0.00013504647],"domain_scores_gemma":[0.99843276,0.00027022752,0.0007111525,0.0002012599,0.00033409937,0.000050478306],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004102688,0.00010407709,0.00019732052,0.000091146416,0.00013711047,0.00010547293,0.0007709799,0.000030108884,0.000022808543],"category_scores_gemma":[0.000058131427,0.000053259097,0.00016236435,0.00038541263,0.00013171528,0.00029046932,0.00011621454,0.00017536689,0.000016526355],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003428792,0.00034211183,0.0003731811,0.000041316194,0.00013056309,0.0000027275873,0.00449102,0.040507574,0.009175975,0.76666987,0.018260594,0.15997079],"study_design_scores_gemma":[0.0007391523,0.00020272903,0.06841884,0.000104393344,0.000015494514,0.000065987224,0.000044655506,0.23507291,0.0028408295,0.6921653,0.00020941971,0.00012029527],"about_ca_topic_score_codex":0.00006374175,"about_ca_topic_score_gemma":0.000002967516,"teacher_disagreement_score":0.19774348,"about_ca_system_score_codex":0.000038624985,"about_ca_system_score_gemma":0.00009972056,"threshold_uncertainty_score":0.21718429},"labels":[],"label_agreement":null},{"id":"W1987241097","doi":"10.1007/s00153-004-0249-8","title":"Weak theories of linear algebra","year":2004,"lang":"en","type":"article","venue":"Archive for Mathematical Logic","topic":"Polynomial and algebraic computation","field":"Computer Science","cited_by":34,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"","keywords":"Mathematics; Algebra over a field; Linear algebra; Pure mathematics","score_opus":0.018516870105116955,"score_gpt":0.2600622216944414,"score_spread":0.24154535158932441,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1987241097","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.012381733,0.000019124485,0.9804195,0.0010053691,0.00006763933,0.0002042859,0.0000079248475,0.00007687383,0.0058175456],"genre_scores_gemma":[0.59635735,0.000001318666,0.40338704,0.00012813546,0.000042906995,0.00001923752,0.0000035885316,0.000004627093,0.0000557914],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99926746,0.00001953968,0.00023237507,0.00017658195,0.0001246578,0.00017937017],"domain_scores_gemma":[0.99914676,0.00046844635,0.00007372035,0.00022031576,0.000032604963,0.000058172227],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00016191714,0.000091733025,0.00017765911,0.00004774768,0.00006986206,0.000019793402,0.00041397984,0.000023662147,0.0000109807725],"category_scores_gemma":[0.00018121481,0.000066025495,0.00010715368,0.00010735006,0.00010950862,0.00011327757,0.00014203905,0.00005107448,0.000056919154],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000063859525,0.00008623341,0.0000013873695,0.00004617312,0.00000877312,7.368857e-7,0.0005393645,0.00016761772,0.00083483616,0.99444807,0.000024852874,0.0038355757],"study_design_scores_gemma":[0.0003045809,0.00020340737,0.000086201784,0.00003055204,0.000005163363,0.000007896758,0.000019314162,0.012051154,0.004691528,0.9823829,0.00013750445,0.000079808655],"about_ca_topic_score_codex":0.000002317694,"about_ca_topic_score_gemma":8.975789e-7,"teacher_disagreement_score":0.5839756,"about_ca_system_score_codex":0.0000088297475,"about_ca_system_score_gemma":0.000040442395,"threshold_uncertainty_score":0.26924416},"labels":[],"label_agreement":null},{"id":"W1987306902","doi":"10.1007/s00026-005-0255-5","title":"Bounding the Roots of Ideal and Open Set Polynomials","year":2005,"lang":"en","type":"article","venue":"Annals of Combinatorics","topic":"Polynomial and algebraic computation","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of New Brunswick; Fields Institute for Research in Mathematical Sciences; University of Waterloo; University of Toronto; Dalhousie University","funders":"","keywords":"Mathematics; Ideal (ethics); Combinatorics; Cardinality (data modeling); Transitive relation; Moduli; Preorder; Discrete mathematics; Polynomial; Mathematical analysis","score_opus":0.06116245509014671,"score_gpt":0.3312704087362235,"score_spread":0.27010795364607676,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1987306902","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9730148,0.0011862844,0.009172791,0.012945114,0.0004072008,0.00025075636,0.0000052857663,0.000029683286,0.002988093],"genre_scores_gemma":[0.9987776,0.00007459197,0.00056664983,0.00042842122,0.00004058009,0.0000030489944,8.350722e-7,0.000004128948,0.00010409905],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99912244,0.00006859084,0.00029492695,0.000156665,0.00019387995,0.00016351679],"domain_scores_gemma":[0.9990972,0.00022005285,0.00022595395,0.00028719148,0.000111132475,0.000058437767],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006856913,0.00008510364,0.00020526593,0.00006165746,0.00010238393,0.00012155636,0.0010385313,0.00003439677,0.000003025619],"category_scores_gemma":[0.00006556401,0.00006485608,0.000041937492,0.00029198427,0.00006323514,0.0004973857,0.00063741946,0.00006699846,0.0000030927645],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000012484985,0.000088169014,0.00090079784,0.00001982099,0.000028233464,0.0000010473972,0.0009627305,0.000084270534,0.0007206272,0.9161661,0.0074690976,0.07354657],"study_design_scores_gemma":[0.0014344554,0.00053591584,0.067130886,0.00010906581,0.00001920671,0.00002331024,0.00010884922,0.020573448,0.07445455,0.78718656,0.04798352,0.0004402019],"about_ca_topic_score_codex":0.000107209766,"about_ca_topic_score_gemma":0.000007311212,"teacher_disagreement_score":0.12897956,"about_ca_system_score_codex":0.0000078512,"about_ca_system_score_gemma":0.00007590165,"threshold_uncertainty_score":0.2644754},"labels":[],"label_agreement":null},{"id":"W1987607498","doi":"10.1007/s11227-008-0205-1","title":"Parallel methods for absolute irreducibility testing","year":2008,"lang":"en","type":"article","venue":"The Journal of Supercomputing","topic":"Polynomial and algebraic computation","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"St. Francis Xavier University","funders":"","keywords":"Irreducibility; Polytope; Computer science; Degree (music); Univariate; Heuristic; Range (aeronautics); Bivariate analysis; Mathematics; Applied mathematics; Multivariate statistics; Algorithm; Discrete mathematics; Mathematical optimization; Statistics; Pure mathematics","score_opus":0.09384136408495593,"score_gpt":0.3400073885871322,"score_spread":0.24616602450217628,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1987607498","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.24650826,0.00032619017,0.7515886,0.0008801671,0.0004826807,0.00008914826,2.187984e-7,0.000032610365,0.00009213335],"genre_scores_gemma":[0.4335267,0.00000499808,0.56601286,0.00012959512,0.00030568038,4.6838846e-7,1.1361351e-7,0.0000047676067,0.000014847545],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99857014,0.00027650135,0.0005611681,0.0001513149,0.00017385087,0.0002669943],"domain_scores_gemma":[0.99665636,0.00240784,0.00028571548,0.00027290272,0.0002934583,0.00008371955],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003755914,0.00011473216,0.00023197819,0.00007469719,0.00046063296,0.000048335834,0.00094268995,0.000031379393,0.0000013422801],"category_scores_gemma":[0.00065867894,0.00007518628,0.00013560502,0.00031309618,0.00006842688,0.00043029813,0.00020038166,0.00021648177,0.0000025213567],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000489398,0.00011612116,0.0007876838,0.000031500393,0.00007378629,0.000013949539,0.0077940226,0.029036483,0.011628317,0.0021739968,0.0012855256,0.9470097],"study_design_scores_gemma":[0.0008107537,0.00030974956,0.019954901,0.00007098758,0.000027903572,0.0022337306,0.00011946341,0.9452588,0.0017729976,0.028307954,0.0009104641,0.00022228925],"about_ca_topic_score_codex":0.000027127147,"about_ca_topic_score_gemma":5.196669e-7,"teacher_disagreement_score":0.94678736,"about_ca_system_score_codex":0.000042384698,"about_ca_system_score_gemma":0.0001598937,"threshold_uncertainty_score":0.35428628},"labels":[],"label_agreement":null},{"id":"W1987771956","doi":"10.1080/00029890.2005.11920220","title":"Continued Fractions of Tails of Hypergeometric Series","year":2005,"lang":"en","type":"article","venue":"American Mathematical Monthly","topic":"Polynomial and algebraic computation","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University; Dalhousie University","funders":"","keywords":"Library science; Mathematics; Classics; History; Computer science","score_opus":0.009596693967788558,"score_gpt":0.23942561729751405,"score_spread":0.2298289233297255,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1987771956","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.543583,0.00010453381,0.42439944,0.002191182,0.000083060055,0.00018404679,0.000010435918,0.000121009594,0.029323304],"genre_scores_gemma":[0.8805144,0.0000033802153,0.11922054,0.000062127074,0.000030781735,0.0000069672,7.146261e-7,0.0000047731264,0.00015631873],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990501,0.0000336967,0.00038457828,0.00015387598,0.00022065209,0.00015714574],"domain_scores_gemma":[0.9989595,0.00031803153,0.00027487313,0.000293182,0.00008333526,0.00007107309],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00012535734,0.000090813286,0.00032280906,0.0001683865,0.000030175994,0.000016572047,0.00034244242,0.000019402605,0.000038746715],"category_scores_gemma":[0.00022761476,0.000077788995,0.00008844758,0.00093382463,0.00020792565,0.00029665363,0.0000901491,0.00006145934,0.000040220322],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000031482385,0.0010228698,0.00071088807,0.00011078745,0.00011377749,0.0000039983142,0.0024511705,0.0011462118,0.00857016,0.67483276,0.0010975936,0.3099083],"study_design_scores_gemma":[0.0017059236,0.002256817,0.06453088,0.0002572796,0.00013217125,0.00005776446,0.001380737,0.24373406,0.09986816,0.5721639,0.012692197,0.0012201506],"about_ca_topic_score_codex":0.00004548731,"about_ca_topic_score_gemma":0.000004359163,"teacher_disagreement_score":0.3369314,"about_ca_system_score_codex":0.000015459935,"about_ca_system_score_gemma":0.000034143057,"threshold_uncertainty_score":0.3172143},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.011247199791389976,"score_gpt":0.2119374490788736,"score_spread":0.20069024928748364,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1989618424","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12872015,0.0000071285685,0.86256224,0.0021992968,0.000547738,0.00003981895,2.1413807e-7,0.00012456803,0.005798856],"genre_scores_gemma":[0.8956684,7.233527e-7,0.103772804,0.00029058562,0.00008408721,0.000002748526,0.0000013454702,0.0000013445564,0.00017797484],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995661,0.000007309105,0.00009494107,0.00014067498,0.00010374727,0.00008722803],"domain_scores_gemma":[0.99981016,0.000009330529,0.000024578585,0.00009156452,0.00002674547,0.00003759307],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00004847007,0.00004305591,0.000037169124,0.00004205831,0.00006514981,0.00006209522,0.00013927852,0.00001591917,0.000034294975],"category_scores_gemma":[0.0000058223036,0.00003762674,0.000024687622,0.00011944168,0.000014635606,0.0003827506,0.00004523083,0.000032034506,0.00013722891],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000016729075,0.000022935648,0.00007408924,8.559357e-7,0.0000027468284,0.0000014886191,0.000092967835,0.0018232755,0.0005647123,0.7892351,0.00013122751,0.20804892],"study_design_scores_gemma":[0.0016225553,0.00020995954,0.02972048,0.00002131504,0.0000035913056,0.00039533593,0.000038872968,0.0774437,0.025384316,0.8612621,0.0034788484,0.00041896183],"about_ca_topic_score_codex":0.000026722246,"about_ca_topic_score_gemma":0.000008214651,"teacher_disagreement_score":0.7669482,"about_ca_system_score_codex":0.00004153193,"about_ca_system_score_gemma":0.00007012397,"threshold_uncertainty_score":0.17638457},"labels":[],"label_agreement":null},{"id":"W1990568802","doi":"10.1007/s00200-012-0179-3","title":"Multi-point evaluation in higher dimensions","year":2012,"lang":"en","type":"article","venue":"Applicable Algebra in Engineering Communication and Computing","topic":"Polynomial and algebraic computation","field":"Computer Science","cited_by":30,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"Agence Nationale de la Recherche","keywords":"Monomial; Tensor product; Interpolation (computer graphics); Multiplication (music); Mathematics; Point (geometry); Product (mathematics); Series (stratigraphy); Combinatorics; Univariate; Discrete mathematics; Algebra over a field; Pure mathematics; Computer science; Geometry; Multivariate statistics","score_opus":0.029544496877219873,"score_gpt":0.2622690116094465,"score_spread":0.2327245147322266,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1990568802","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5621213,0.002709478,0.43301314,0.00082791015,0.00021998989,0.0004502663,2.745204e-7,0.00021574255,0.0004419389],"genre_scores_gemma":[0.9334677,0.00003515082,0.06626526,0.00013279817,0.000030984873,0.000044164277,0.0000060339025,0.00000962579,0.0000082918905],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989493,0.00009418124,0.00031716056,0.00018429343,0.00013775505,0.00031732247],"domain_scores_gemma":[0.9991093,0.00023710229,0.000068862726,0.00047112815,0.000030383517,0.00008320062],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010844448,0.00013121552,0.00015501976,0.00019480767,0.00008333611,0.00006610925,0.00039925196,0.000057900674,0.000005976768],"category_scores_gemma":[0.000037433467,0.00014356236,0.000022418511,0.00054780894,0.000016636892,0.00045540908,0.00046052164,0.00022744546,0.000011307555],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008585695,0.00090254226,0.035118867,0.00011052059,0.000035640594,0.0000020312748,0.010574087,0.20809418,0.012902628,0.35826993,0.0001203154,0.3738607],"study_design_scores_gemma":[0.0005128917,0.0000061862193,0.09557949,0.00005880452,0.0000025871507,0.0000044005287,0.00004139198,0.9021831,0.00022894861,0.0008667592,0.00035284448,0.00016256726],"about_ca_topic_score_codex":0.000090622845,"about_ca_topic_score_gemma":0.000008920408,"teacher_disagreement_score":0.69408894,"about_ca_system_score_codex":0.00009715721,"about_ca_system_score_gemma":0.000017654405,"threshold_uncertainty_score":0.5854303},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.03795610971846533,"score_gpt":0.25080619395333364,"score_spread":0.21285008423486831,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1992962227","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6251169,0.00006711446,0.014918306,0.35122743,0.00047199408,0.00036840918,0.000005890525,0.00012196851,0.0077020186],"genre_scores_gemma":[0.991514,0.000001416665,0.00448183,0.0034161827,0.000101070094,0.0000068591303,5.427389e-7,0.000003816884,0.00047426726],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99918425,0.00009847816,0.00016291512,0.00017517338,0.00022828419,0.00015089152],"domain_scores_gemma":[0.99849886,0.00045804196,0.0000996471,0.0008823317,0.000032144846,0.000028979033],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00026331533,0.00008155114,0.000084361876,0.00001774514,0.00015834883,0.00003869158,0.001741104,0.000023788432,0.00022666938],"category_scores_gemma":[0.0003646817,0.000043401527,0.00007225723,0.0001597834,0.00014654461,0.00003139509,0.0006657102,0.00012099863,0.0002936979],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000007893563,0.00010075345,0.00010130572,0.000003976077,0.000010550797,5.599498e-7,0.00044681146,0.00066121103,0.0005707064,0.91739357,0.048415642,0.03228705],"study_design_scores_gemma":[0.00052729185,0.00012569854,0.044275366,0.000055736888,0.000005767936,0.000010137558,0.000019283472,0.018088177,0.024182118,0.14540307,0.7670399,0.00026745434],"about_ca_topic_score_codex":0.000035005844,"about_ca_topic_score_gemma":0.0000113203905,"teacher_disagreement_score":0.7719905,"about_ca_system_score_codex":0.000021679074,"about_ca_system_score_gemma":0.000031928328,"threshold_uncertainty_score":0.37749904},"labels":[],"label_agreement":null},{"id":"W1993473229","doi":"10.1016/j.jsc.2014.09.012","title":"Relaxed Hensel lifting of triangular sets","year":2014,"lang":"en","type":"article","venue":"Journal of Symbolic Computation","topic":"Polynomial and algebraic computation","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Agence Nationale de la Recherche","keywords":"Set (abstract data type); Point (geometry); Algorithm; Mathematics; Implementation; Computer science; Geometry; Programming language","score_opus":0.011571822478849265,"score_gpt":0.24724955102981688,"score_spread":0.2356777285509676,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1993473229","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.43336993,0.00007698921,0.56527674,0.00050438225,0.00043767845,0.000043087184,2.4158982e-7,0.000019760735,0.00027118062],"genre_scores_gemma":[0.94286853,0.0000053497565,0.056760952,0.0001169905,0.00022872242,4.3469655e-7,0.0000010245951,0.000006590251,0.000011395126],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984287,0.00016711661,0.0007353325,0.00013449391,0.00038565512,0.00014871376],"domain_scores_gemma":[0.99819756,0.0003140971,0.0009230004,0.00013725244,0.00033483206,0.00009326314],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009412157,0.00010538337,0.00030966295,0.00027584194,0.000063423,0.00006106207,0.00037463673,0.00004871805,0.0000028029212],"category_scores_gemma":[0.00021462725,0.000093736286,0.00014162576,0.00039408458,0.000026002319,0.0004293226,0.00007055833,0.00014567218,0.000007342821],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004812119,0.00016664265,0.0006278153,0.00006106403,0.000079423015,0.000013755011,0.004100319,0.023153702,0.008594422,0.030539088,0.00086015195,0.9317555],"study_design_scores_gemma":[0.0029150313,0.0008002864,0.04716867,0.00026140583,0.00004644308,0.00032622472,0.00009188079,0.8147143,0.0055051423,0.12694997,0.00091059174,0.00031003114],"about_ca_topic_score_codex":0.0000094476545,"about_ca_topic_score_gemma":6.75909e-7,"teacher_disagreement_score":0.9314455,"about_ca_system_score_codex":0.00003508083,"about_ca_system_score_gemma":0.00009695698,"threshold_uncertainty_score":0.38224545},"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,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_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)","score_opus":0.008182856888058834,"score_gpt":0.2243535310446579,"score_spread":0.21617067415659907,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1994077047","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15817219,0.00003796064,0.8397552,0.00032371943,0.0007008241,0.00019909267,0.000001577001,0.0002206029,0.0005888754],"genre_scores_gemma":[0.9167269,0.0000031033799,0.082742095,0.00027519537,0.00021772482,0.0000072394373,0.0000012455132,0.0000078628445,0.000018661212],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9973079,0.00009060725,0.0002796133,0.0007249649,0.00089618453,0.00070074946],"domain_scores_gemma":[0.99865067,0.00014070785,0.00008735668,0.00064920186,0.00016860614,0.0003034725],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00073373504,0.00021627959,0.00023887541,0.00015587702,0.0008433243,0.00029117422,0.0017141058,0.00004016557,0.000014614555],"category_scores_gemma":[0.000026254082,0.00015070953,0.00004752971,0.0009869725,0.0012746948,0.0007176551,0.00077303516,0.00018168034,0.000048834903],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000017298817,0.000050842224,0.00015929698,0.000009583747,0.0000065661475,0.000046790898,0.0007986331,0.004486361,0.00027237888,0.9904371,0.000059278565,0.0036558819],"study_design_scores_gemma":[0.00058882096,0.0002627691,0.0021481584,0.000039964452,0.0000038672106,0.00024623235,0.0000070272567,0.9881341,0.0010979951,0.0069774324,0.00022246933,0.0002711778],"about_ca_topic_score_codex":0.00000719204,"about_ca_topic_score_gemma":9.86464e-7,"teacher_disagreement_score":0.9836477,"about_ca_system_score_codex":0.00007566287,"about_ca_system_score_gemma":0.00020921283,"threshold_uncertainty_score":0.6486254},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.015613794153033869,"score_gpt":0.26775971741067944,"score_spread":0.25214592325764557,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1994728957","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.29479095,0.00009686656,0.70218194,0.00058661326,0.0015467528,0.00013890748,7.5405575e-7,0.00003177672,0.0006254101],"genre_scores_gemma":[0.9477965,0.0000073862875,0.051611304,0.00012447652,0.00039516215,0.0000030173114,0.0000011834734,0.000008167423,0.00005280524],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99881905,0.00009524467,0.00047107268,0.00016586766,0.00027768905,0.00017107603],"domain_scores_gemma":[0.998721,0.00029742066,0.00052599364,0.00010260453,0.00026307759,0.00008992892],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005489551,0.00011612241,0.00019880566,0.00031299298,0.00012544917,0.00013715567,0.00024774906,0.00004961625,0.000003758019],"category_scores_gemma":[0.00013917698,0.000103879116,0.00013550857,0.00033656266,0.000016943135,0.0005464867,0.000016915956,0.000120885124,0.000011544173],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00024559096,0.0005222048,0.000062518404,0.00006949987,0.00013215945,0.000014189356,0.0021781258,0.061718713,0.00409359,0.48496538,0.018712383,0.42728564],"study_design_scores_gemma":[0.009090384,0.0046105697,0.007561024,0.00033871707,0.00016834961,0.00201927,0.0003404949,0.26933074,0.018504359,0.66439795,0.022511069,0.0011270418],"about_ca_topic_score_codex":0.0000035237726,"about_ca_topic_score_gemma":2.516812e-7,"teacher_disagreement_score":0.65300554,"about_ca_system_score_codex":0.00008578497,"about_ca_system_score_gemma":0.000148589,"threshold_uncertainty_score":0.42360675},"labels":[],"label_agreement":null},{"id":"W1995144890","doi":"10.4153/cmb-2002-017-8","title":"The Discriminant of a Dihedral Quintic Field Defined by a Trinomial <i>X</i><sup>5</sup> + <i>aX</i> + <i>b</i>","year":2002,"lang":"en","type":"article","venue":"Canadian Mathematical Bulletin","topic":"Polynomial and algebraic computation","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"Carleton University; Okanagan University College","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Trinomial; Mathematics; Discriminant; Quintic function; Galois group; Dihedral group; Combinatorics; Field (mathematics); Group (periodic table); Pure mathematics; Physics","score_opus":0.00987163521763301,"score_gpt":0.19027827661619318,"score_spread":0.18040664139856016,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1995144890","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.33792776,0.0024100558,0.27278686,0.3032561,0.001032133,0.0019656892,0.000106698004,0.0004321406,0.08008258],"genre_scores_gemma":[0.99273515,0.000024621515,0.0024854762,0.002442875,0.000089584624,0.000035965684,0.0000027089166,0.000016105347,0.0021675224],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9982455,0.000086256274,0.00048568504,0.00031870443,0.00026974347,0.0005941242],"domain_scores_gemma":[0.99795055,0.0009118904,0.00010504898,0.0005341883,0.0000480729,0.0004502357],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0002858103,0.00020059267,0.0002853779,0.00007126338,0.0002709455,0.00018127145,0.000985788,0.000088008426,0.0007529036],"category_scores_gemma":[0.00039478028,0.0001440703,0.00014685147,0.00024050067,0.00013648144,0.00007280721,0.0001294337,0.00019192524,0.0014604849],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000015345091,0.00020607065,0.000023431478,0.00008321606,0.000042648004,0.00004635043,0.0018310582,0.000045005934,0.00025022787,0.2533046,0.6781498,0.06600226],"study_design_scores_gemma":[0.0017961706,0.0005964918,0.00007499497,0.0002205647,0.000055921635,0.00016880172,0.00024624434,0.1828311,0.0027433098,0.07779626,0.73246807,0.0010020605],"about_ca_topic_score_codex":0.0011975314,"about_ca_topic_score_gemma":0.00028369878,"teacher_disagreement_score":0.6548074,"about_ca_system_score_codex":0.00007096552,"about_ca_system_score_gemma":0.00009396939,"threshold_uncertainty_score":0.999317},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.017708436857765117,"score_gpt":0.25371895663028965,"score_spread":0.23601051977252452,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1995653528","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.41664696,0.00011403518,0.58186334,0.00079452473,0.00039309319,0.000041839292,1.6755047e-7,0.000019968693,0.0001260497],"genre_scores_gemma":[0.9252802,0.000014095538,0.074463055,0.00012428215,0.00009671412,7.9092877e-7,9.327444e-7,0.0000045228667,0.000015373515],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99888605,0.00014149229,0.00047209288,0.00014764836,0.00022663506,0.00012609089],"domain_scores_gemma":[0.99890715,0.00014396875,0.00043554427,0.000095767085,0.00032909808,0.000088479996],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006251978,0.000096081,0.00017724451,0.00017378728,0.00009860042,0.00015420171,0.00017049424,0.00003910429,0.0000035594321],"category_scores_gemma":[0.0001890774,0.000083243925,0.000044726014,0.00038337702,0.000026365964,0.00059624703,0.000033856802,0.00014349427,0.0000051647207],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001345443,0.00015040854,0.0017518622,0.000033742857,0.00005431337,0.000010991264,0.0031802466,0.009268234,0.0043272004,0.22437224,0.00043912642,0.7563982],"study_design_scores_gemma":[0.0028620572,0.0005795146,0.1852885,0.0002153432,0.00006767639,0.000934391,0.00045082511,0.35027122,0.0106388135,0.44447765,0.0035022197,0.0007117952],"about_ca_topic_score_codex":0.00002316635,"about_ca_topic_score_gemma":0.0000020636007,"teacher_disagreement_score":0.7556864,"about_ca_system_score_codex":0.000045093057,"about_ca_system_score_gemma":0.00009822209,"threshold_uncertainty_score":0.33945888},"labels":[],"label_agreement":null},{"id":"W1996442824","doi":"10.1016/j.laa.2011.02.033","title":"Basic solutions of systems with two max-linear inequalities","year":2011,"lang":"en","type":"article","venue":"Linear Algebra and its Applications","topic":"Polynomial and algebraic computation","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal","funders":"Engineering and Physical Sciences Research Council","keywords":"Mathematics; Inequality; Linear inequality; Linear system; Applied mathematics; Algebra over a field; Pure mathematics; Calculus (dental); Mathematical analysis","score_opus":0.04133115752100932,"score_gpt":0.24649964741956207,"score_spread":0.20516848989855274,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1996442824","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08216693,0.0007158705,0.9133343,0.0002547775,0.00008266114,0.0004807918,0.000029530496,0.00016968901,0.0027654131],"genre_scores_gemma":[0.98665285,0.000028637625,0.0126787685,0.00006781275,0.000115881514,0.00013442722,0.000011427001,0.000009292618,0.0003009231],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99909943,0.000035503566,0.0002697759,0.00026435714,0.0001396811,0.00019125543],"domain_scores_gemma":[0.99924785,0.000071917464,0.00012864718,0.0003247526,0.00013298492,0.00009384926],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00013887297,0.0001176697,0.00016412677,0.00009456789,0.00017509072,0.000028831026,0.00031059037,0.00003547097,0.0000103020875],"category_scores_gemma":[0.0000082737,0.00009648883,0.000030965537,0.0003669091,0.000068917005,0.00027201232,0.0001237172,0.000077787394,0.000036822712],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000005068405,0.000083466315,0.00011680664,0.00004028575,0.00002264271,5.355213e-7,0.00088599615,0.000089890535,0.00037716283,0.9938681,0.00004688794,0.004463126],"study_design_scores_gemma":[0.0030722893,0.0009020977,0.009888276,0.00023797419,0.00017620217,0.00017181424,0.0011105555,0.86484367,0.015376374,0.07957957,0.023109501,0.001531661],"about_ca_topic_score_codex":0.00014947158,"about_ca_topic_score_gemma":0.0000131810675,"teacher_disagreement_score":0.9142886,"about_ca_system_score_codex":0.000009097809,"about_ca_system_score_gemma":0.0000663422,"threshold_uncertainty_score":0.39347002},"labels":[],"label_agreement":null},{"id":"W1997380739","doi":"10.1145/1504347.1504368","title":"On the representation of constructible sets","year":2009,"lang":"en","type":"article","venue":"ACM communications in computer algebra","topic":"Polynomial and algebraic computation","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"","keywords":"Representation (politics); Computer science; Mathematics; Political science","score_opus":0.043850947264163165,"score_gpt":0.3126611112219152,"score_spread":0.26881016395775204,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1997380739","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.44636953,0.0002274049,0.49252468,0.05555523,0.0004403648,0.00058535323,0.0000035528406,0.00023526266,0.0040586223],"genre_scores_gemma":[0.86012006,0.000034216046,0.13846308,0.0013343226,0.000020305759,0.000010740024,0.000006576071,0.00000353652,0.000007150813],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986967,0.00028258312,0.00039690014,0.00024913807,0.00020586264,0.00016884353],"domain_scores_gemma":[0.9945406,0.0015483969,0.00017415425,0.0036196292,0.00008171368,0.000035558623],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003225207,0.00011773645,0.00017265361,0.00019057584,0.00016153973,0.00008758845,0.0040793912,0.000043226417,0.0000075224757],"category_scores_gemma":[0.00014414698,0.00009492956,0.000067979345,0.00096428825,0.000127427,0.00030952418,0.0008884551,0.00022418216,0.000024821842],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000037744207,0.00012941047,0.00028612633,0.0000016442777,0.000008503849,9.1311205e-7,0.00065022794,0.0005128534,0.00014218768,0.7047634,0.001156452,0.2923445],"study_design_scores_gemma":[0.00040687172,0.0001515057,0.031560257,0.00006288859,0.0000038860844,0.000016052409,0.000021379432,0.23927408,0.0013046095,0.72677904,0.0002592475,0.00016016245],"about_ca_topic_score_codex":0.00003553362,"about_ca_topic_score_gemma":0.0000113438555,"teacher_disagreement_score":0.41375053,"about_ca_system_score_codex":0.00003662209,"about_ca_system_score_gemma":0.00005713725,"threshold_uncertainty_score":0.75805914},"labels":[],"label_agreement":null},{"id":"W1998039813","doi":"10.1007/s00220-012-1592-y","title":"Jack Superpolynomials with Negative Fractional Parameter: Clustering Properties and Super-Virasoro Ideals","year":2012,"lang":"en","type":"article","venue":"Communications in Mathematical Physics","topic":"Polynomial and algebraic computation","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université Laval","funders":"","keywords":"Conjecture; Invariant (physics); Ideal (ethics); Linear subspace; Eigenfunction; Linear span; Symmetric function; Symmetric polynomial; Space (punctuation); Orthogonal polynomials","score_opus":0.0833692117707384,"score_gpt":0.2913953568846495,"score_spread":0.2080261451139111,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1998039813","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.29785132,0.00041062172,0.6971375,0.0017882936,0.000060305818,0.0004085696,0.000003091537,0.000115602896,0.0022246898],"genre_scores_gemma":[0.8679029,0.000034102697,0.13174203,0.00015141825,0.000049845345,0.00008008434,0.0000027537137,0.000010248955,0.000026635089],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989284,0.00015947728,0.0002999981,0.00017733024,0.00017451656,0.00026027695],"domain_scores_gemma":[0.9978467,0.0010347652,0.00008052701,0.00089192536,0.000052567702,0.000093465635],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00032098006,0.00014993848,0.00023102382,0.00005275698,0.00019199638,0.00013459551,0.00072612613,0.000043597192,0.000006108963],"category_scores_gemma":[0.00015652057,0.000118046824,0.000032823926,0.00026763623,0.00025882397,0.0011213161,0.0006763707,0.00021978692,0.00004144078],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003584782,0.0014821059,0.004891748,0.00018820346,0.0000959104,0.0000011484972,0.02113741,0.0007853999,0.0022257871,0.88194525,0.00016841512,0.087042786],"study_design_scores_gemma":[0.0008961223,0.000115241,0.010085547,0.00036204085,0.00002992696,0.000050651866,0.0007315111,0.6019256,0.0025240802,0.38224554,0.0004033086,0.0006304245],"about_ca_topic_score_codex":0.000021782493,"about_ca_topic_score_gemma":0.0000098039745,"teacher_disagreement_score":0.6011402,"about_ca_system_score_codex":0.00005534943,"about_ca_system_score_gemma":0.000041980755,"threshold_uncertainty_score":0.481381},"labels":[],"label_agreement":null},{"id":"W2002276560","doi":"10.1145/2442829.2442864","title":"Algorithms for the universal decomposition algebra","year":2012,"lang":"en","type":"preprint","venue":"","topic":"Polynomial and algebraic computation","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"","keywords":"Isomorphism (crystallography); Quotient; Mathematics; Ideal (ethics); Polynomial; Field (mathematics); Representation (politics); Decomposition; Degree (music); Algebra over a field; Combinatorics; Discrete mathematics; Pure mathematics","score_opus":0.027012218407953096,"score_gpt":0.28132276394805383,"score_spread":0.25431054554010074,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2002276560","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0010500557,0.00032603057,0.9896539,0.0042759166,0.002910446,0.0005148821,0.000009618597,0.00024640153,0.0010127429],"genre_scores_gemma":[0.71933323,0.000042292326,0.2764042,0.0010885997,0.001747006,0.00013826028,0.000080476486,0.000023539093,0.0011424088],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989752,0.00003978619,0.00018458287,0.000356573,0.00017153629,0.00027233103],"domain_scores_gemma":[0.998867,0.00033582863,0.0001260219,0.00051161705,0.00007993535,0.00007964317],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002691952,0.0001809077,0.00015146323,0.00006449556,0.00020197418,0.0002530883,0.0011808368,0.00012513313,0.000021054933],"category_scores_gemma":[0.000008792507,0.00012496709,0.00017144688,0.00009635102,0.000032978518,0.00025775275,0.0011298945,0.0002124095,0.00004235759],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000101621945,0.000075159085,0.000016663085,0.000038791983,0.000106741805,0.0000013729739,0.0006543322,0.002243257,0.00008223616,0.37450758,0.008564243,0.6136995],"study_design_scores_gemma":[0.000332434,0.000035302946,0.0015336327,0.000025745803,0.000048170918,0.000009886092,0.00002031488,0.9003087,0.0009283262,0.08328682,0.013118202,0.0003524516],"about_ca_topic_score_codex":0.00010639161,"about_ca_topic_score_gemma":0.00000859245,"teacher_disagreement_score":0.89806545,"about_ca_system_score_codex":0.00007460879,"about_ca_system_score_gemma":0.00011754387,"threshold_uncertainty_score":0.509601},"labels":[],"label_agreement":null},{"id":"W2002451809","doi":"10.1145/1145768.1145801","title":"Fast rational function reconstruction","year":2006,"lang":"en","type":"article","venue":"","topic":"Polynomial and algebraic computation","field":"Computer Science","cited_by":15,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Degree (music); Combinatorics; Mathematics; Rational function; Polynomial; Euclidean algorithm; Prime (order theory); Euclidean geometry; Sequence (biology); Function (biology); Discrete mathematics; Modulo; Finite field; Mathematical analysis; Geometry; Physics","score_opus":0.006880899042255647,"score_gpt":0.1879825222538185,"score_spread":0.18110162321156287,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2002451809","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03746413,0.0000094726265,0.9355608,0.0006500227,0.0006632491,0.000034696346,2.3165394e-7,0.00017644027,0.025440944],"genre_scores_gemma":[0.9714269,3.0343608e-7,0.026094621,0.00015938056,0.00029476377,0.000003657379,0.000006006663,0.0000016838881,0.0020126682],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995774,0.000012581693,0.00010292812,0.00013792203,0.00009281871,0.000076317454],"domain_scores_gemma":[0.99981976,0.000016536575,0.000030776086,0.000082942366,0.000032655294,0.000017307733],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00005147448,0.000042983203,0.00003489713,0.00004895528,0.0000774854,0.00007997374,0.0000891573,0.000018978311,0.00006457832],"category_scores_gemma":[0.0000023904547,0.000038470702,0.00002304783,0.00014436957,0.000011141175,0.00046326252,0.000025248592,0.000028100487,0.00012326971],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000022149386,0.000015563652,0.00039803222,8.346292e-7,0.0000019613335,3.571808e-7,0.000008333066,0.0008408761,0.0017919531,0.5921772,0.003146805,0.40161583],"study_design_scores_gemma":[0.00053413445,0.00008627567,0.12507363,0.000006479611,0.000004442307,0.00009133007,0.000012465983,0.43571222,0.005473353,0.4234634,0.009276191,0.00026606186],"about_ca_topic_score_codex":0.000054858774,"about_ca_topic_score_gemma":0.000022905908,"teacher_disagreement_score":0.93396276,"about_ca_system_score_codex":0.000018137618,"about_ca_system_score_gemma":0.000025327789,"threshold_uncertainty_score":0.1584424},"labels":[],"label_agreement":null},{"id":"W2003274056","doi":"10.1145/1940475.1940521","title":"Sparse polynomial multiplication and division in Maple 14","year":2011,"lang":"en","type":"article","venue":"ACM communications in computer algebra","topic":"Polynomial and algebraic computation","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Maple; Division (mathematics); Multiplication (music); Speedup; Polynomial; Computer science; Mathematics; Parallel computing; Arithmetic; Combinatorics; Botany","score_opus":0.056069229062558394,"score_gpt":0.27938956956586103,"score_spread":0.22332034050330263,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2003274056","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.58193254,0.00055227755,0.41219893,0.0032746645,0.00037723363,0.0005353783,0.0000030288563,0.00024771603,0.0008782194],"genre_scores_gemma":[0.7164981,0.00009514835,0.2830367,0.00026817172,0.000027952285,0.00004325408,0.00001130165,0.000008971934,0.00001040558],"study_design_codex":"design_other","study_design_gemma":"observational","domain_scores_codex":[0.99831396,0.00024354008,0.00051381846,0.00047840964,0.00015145022,0.0002988349],"domain_scores_gemma":[0.9964474,0.00041377003,0.0001361223,0.0028558762,0.000054864195,0.000091953945],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00048633097,0.00018804311,0.00022445158,0.00041667683,0.00015054675,0.00011207098,0.0032641017,0.00009563468,0.0000068574363],"category_scores_gemma":[0.00007165804,0.00020104565,0.000044160286,0.00070732005,0.00012954739,0.000732326,0.0037212614,0.00030792685,0.000044762455],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001756862,0.00068583764,0.047032587,0.00001593353,0.000015333553,0.000008547297,0.00901979,0.00011778384,0.000277699,0.04856262,0.00059143285,0.8936549],"study_design_scores_gemma":[0.0011070383,0.00008423087,0.5748917,0.00007365669,0.0000034221848,0.000015967893,0.000023554823,0.3836091,0.0002351381,0.038418002,0.0011967315,0.00034146698],"about_ca_topic_score_codex":0.0005431832,"about_ca_topic_score_gemma":0.00046840977,"teacher_disagreement_score":0.8933134,"about_ca_system_score_codex":0.00008095764,"about_ca_system_score_gemma":0.00005496277,"threshold_uncertainty_score":0.8198404},"labels":[],"label_agreement":null},{"id":"W2004004688","doi":"10.1007/s00037-002-0171-6","title":"Homogenization and the polynomial calculus","year":2002,"lang":"en","type":"article","venue":"Computational Complexity","topic":"Polynomial and algebraic computation","field":"Computer Science","cited_by":19,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"Natural Sciences and Engineering Research Council of Canada; National Science Foundation","keywords":"Mathematics; Homogenization (climate); Polynomial; Degree (music); Combinatorics; Discrete mathematics; Calculus (dental); Mathematical analysis","score_opus":0.0360283342793621,"score_gpt":0.2313772949803246,"score_spread":0.19534896070096253,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2004004688","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06032298,0.0004314275,0.9245144,0.010723416,0.00036224435,0.00024429007,0.0000055480145,0.00020090923,0.0031947787],"genre_scores_gemma":[0.9824585,0.0000054926154,0.01612183,0.0010904567,0.00015669003,0.000010465214,0.00001084172,0.000005879123,0.00013988458],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988419,0.00015247028,0.000242135,0.0003017505,0.00027470777,0.00018706098],"domain_scores_gemma":[0.9991857,0.00032656707,0.00009592587,0.00021092538,0.00009728461,0.000083623425],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002344952,0.00013014495,0.00015674347,0.000068574605,0.00043837578,0.00023680498,0.0004475733,0.000032424836,0.000050906507],"category_scores_gemma":[0.00005727928,0.00009732632,0.00006318719,0.00033335114,0.0003624228,0.00031732937,0.00027231983,0.0001123021,0.00008612416],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000019925123,0.000056327004,0.00019323872,0.000006771236,0.000025072679,0.000003634742,0.0009682483,0.008587355,0.000007278928,0.918649,0.0052001122,0.06628301],"study_design_scores_gemma":[0.0011634928,0.000019171304,0.009783586,0.0000032749779,0.0000048152983,0.000038346134,0.000004791716,0.8682162,0.000008379957,0.119083494,0.0015566609,0.00011779378],"about_ca_topic_score_codex":0.00005207037,"about_ca_topic_score_gemma":0.000007212096,"teacher_disagreement_score":0.9221355,"about_ca_system_score_codex":0.000031552492,"about_ca_system_score_gemma":0.000022032276,"threshold_uncertainty_score":0.39688522},"labels":[],"label_agreement":null},{"id":"W2004084023","doi":"10.1088/1742-6596/341/1/012031","title":"Determinant Computation on the GPU using the Condensation Method","year":2012,"lang":"en","type":"article","venue":"Journal of Physics Conference Series","topic":"Polynomial and algebraic computation","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"","keywords":"Computation; Computer science; Modular design; Parallel computing; Code (set theory); Condensation; Floating point; Computational science; Point (geometry); Double-precision floating-point format; Matrix (chemical analysis); Algorithm; Mathematics; Programming language; Chemistry; Physics","score_opus":0.07047110623344989,"score_gpt":0.31406471192711893,"score_spread":0.24359360569366906,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2004084023","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.16321668,0.00002434722,0.83414227,0.001873571,0.0005601419,0.000062229534,5.2432665e-7,0.000008921333,0.00011129924],"genre_scores_gemma":[0.9791502,0.0000043431005,0.02013123,0.00028130633,0.00041100514,0.0000010669871,3.0207022e-7,0.000003949789,0.000016648895],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99899924,0.00022940911,0.00025371235,0.00007239608,0.00028872237,0.000156546],"domain_scores_gemma":[0.9987552,0.00035617486,0.00045855125,0.00014265496,0.00024310531,0.000044275508],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00067066797,0.00009756343,0.00013269068,0.000031086325,0.00022916617,0.00020088525,0.00039498924,0.000022566237,0.000003898399],"category_scores_gemma":[0.000046386227,0.00005057808,0.000074964075,0.00017472067,0.00006178414,0.0011090242,0.000070575465,0.0001777134,0.000005016877],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000019708525,0.000053692325,0.00010673968,0.0000060562065,0.000030832154,0.0000017627647,0.0055812113,0.0031676542,0.012253705,0.60327125,0.000106985666,0.3754004],"study_design_scores_gemma":[0.0004487243,0.00044466142,0.009111308,0.00015107961,0.00006594254,0.00031704296,0.0014318,0.2999689,0.3190591,0.3678381,0.0008189285,0.00034440798],"about_ca_topic_score_codex":0.0000066160464,"about_ca_topic_score_gemma":0.0000010381444,"teacher_disagreement_score":0.81593347,"about_ca_system_score_codex":0.000033721222,"about_ca_system_score_gemma":0.00012162703,"threshold_uncertainty_score":0.20625143},"labels":[],"label_agreement":null},{"id":"W2004139989","doi":"10.1007/s10958-009-9689-3","title":"On the generalized Ritt problem as a computational problem","year":2009,"lang":"en","type":"article","venue":"Journal of Mathematical Sciences","topic":"Polynomial and algebraic computation","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"","keywords":"Equivalence (formal languages); Modulo; Ideal (ethics); Prime (order theory); Canonical form; Differential (mechanical device); Set (abstract data type); Differential algebra","score_opus":0.02449634494117714,"score_gpt":0.2786652523013949,"score_spread":0.25416890736021774,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2004139989","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.27822977,0.00007772294,0.61101454,0.08708255,0.00016319875,0.00027246092,4.207274e-7,0.000050603576,0.023108765],"genre_scores_gemma":[0.80583835,0.0000024991216,0.19137889,0.002593549,0.00009102428,0.0000018069937,7.114448e-8,0.0000018900124,0.00009194094],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9982358,0.0001064122,0.00045551235,0.000130368,0.00086515833,0.00020672027],"domain_scores_gemma":[0.9986699,0.00068349147,0.0003222638,0.000104515595,0.00011431919,0.00010546149],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015902515,0.00010170661,0.0001817024,0.00009882859,0.00026132484,0.0003381685,0.001055373,0.000026218826,0.00006769941],"category_scores_gemma":[0.00018163932,0.000050318296,0.00010865273,0.00046866154,0.00013103931,0.00041180413,0.000056014538,0.00014903497,0.00007137432],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000005261685,0.00012579016,0.0000020691484,0.0000034708426,0.000005630094,0.0000057372654,0.00045244265,0.0040676617,0.00014417342,0.98069906,0.001987077,0.012501608],"study_design_scores_gemma":[0.00018917222,0.00058175245,0.0001537026,0.00007269839,0.0000038007563,0.00017857619,0.000024087258,0.060216054,0.00021080076,0.93808764,0.0002111235,0.000070569164],"about_ca_topic_score_codex":0.0000012087825,"about_ca_topic_score_gemma":1.7152077e-7,"teacher_disagreement_score":0.5276086,"about_ca_system_score_codex":0.000026820971,"about_ca_system_score_gemma":0.00018041188,"threshold_uncertainty_score":0.32609665},"labels":[],"label_agreement":null},{"id":"W2004807161","doi":"10.1016/j.jalgebra.2009.01.021","title":"Approximation for Frobenius algebraic equations in Witt vectors","year":2009,"lang":"en","type":"article","venue":"Journal of Algebra","topic":"Polynomial and algebraic computation","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec à Montréal","funders":"","keywords":"Mathematics; Discrete valuation; Lemma (botany); Witt vector; Valuation (finance); Algebraic number; Pure mathematics; Algebraic equation; Algebra over a field; Discrete mathematics; Mathematical analysis; Field (mathematics); Nonlinear system","score_opus":0.015494261772697361,"score_gpt":0.2540524364673581,"score_spread":0.23855817469466073,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2004807161","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2193774,0.00015524664,0.7761741,0.0035439916,0.0004160291,0.00015725211,7.489098e-7,0.000026671198,0.00014855113],"genre_scores_gemma":[0.95563406,0.000006069922,0.043666445,0.00041288277,0.00024085662,0.0000032878954,0.0000020872417,0.0000050211283,0.00002928206],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99876994,0.000047888167,0.0005649199,0.0001515145,0.0002570666,0.0002086868],"domain_scores_gemma":[0.99898076,0.00022716497,0.0003927166,0.00015649405,0.0001540563,0.00008879424],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00051604764,0.00011192784,0.00021919704,0.0003633879,0.000067773966,0.000118559714,0.00047681367,0.000054481483,0.000005896036],"category_scores_gemma":[0.0002090076,0.000098695586,0.00013205894,0.0004671009,0.000014039883,0.000941113,0.0000264389,0.00014814033,0.000006686507],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008735742,0.00045372703,0.0002689053,0.000023141592,0.000041075884,0.000022323138,0.0026815678,0.0044496073,0.007726294,0.53142935,0.0022850528,0.4505316],"study_design_scores_gemma":[0.0028359345,0.001189749,0.03562847,0.00012835105,0.000025690715,0.00008955848,0.00006635632,0.2011538,0.0060755285,0.7513844,0.0010509307,0.00037121796],"about_ca_topic_score_codex":0.000003976514,"about_ca_topic_score_gemma":0.000005040034,"teacher_disagreement_score":0.73625666,"about_ca_system_score_codex":0.00008782948,"about_ca_system_score_gemma":0.00014972524,"threshold_uncertainty_score":0.40246892},"labels":[],"label_agreement":null},{"id":"W2008160486","doi":"10.1145/2110170.2110174","title":"Computing the real solutions of polynomial systems with the RegularChains library in Maple","year":2012,"lang":"en","type":"article","venue":"ACM communications in computer algebra","topic":"Polynomial and algebraic computation","field":"Computer Science","cited_by":13,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"Western University","funders":"","keywords":"Citation; China; Maple; Library science; Computer science; History; Archaeology; Botany; Biology","score_opus":0.035293267495734894,"score_gpt":0.2624975572434372,"score_spread":0.22720428974770232,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2008160486","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.38900506,0.00307477,0.5654485,0.03882701,0.0008170061,0.0012186164,0.000011116806,0.00030539295,0.001292489],"genre_scores_gemma":[0.94101393,0.00007447995,0.058313485,0.0003073201,0.00019241637,0.000043451615,0.000015045295,0.000015771951,0.000024109315],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9975963,0.00082851923,0.0005515283,0.0002508062,0.0002627216,0.0005101131],"domain_scores_gemma":[0.9942057,0.0018073228,0.00025780647,0.0036093357,0.00004844544,0.00007140415],"candidate_categories":["open_science"],"consensus_categories":[],"category_scores_codex":[0.0011219124,0.00018920444,0.00025931394,0.0002362643,0.00042916805,0.00017322142,0.0060129766,0.000066506436,0.0000018049535],"category_scores_gemma":[0.000027437673,0.00012189575,0.00006935661,0.0013455685,0.00038122426,0.00083581504,0.004629662,0.00046392233,0.000008793212],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000038822564,0.0010381958,0.044922926,0.000060280203,0.00012321185,0.0000050049953,0.03676382,0.017834032,0.000116493895,0.75449103,0.008751751,0.13585445],"study_design_scores_gemma":[0.0008849404,0.00010283032,0.20601861,0.00019932564,0.000014714754,0.00005637389,0.00056526373,0.78349483,0.000051846484,0.0032434487,0.0049988218,0.00036899836],"about_ca_topic_score_codex":0.0006373295,"about_ca_topic_score_gemma":0.00021785336,"teacher_disagreement_score":0.7656608,"about_ca_system_score_codex":0.000070251706,"about_ca_system_score_gemma":0.00018155876,"threshold_uncertainty_score":0.999365},"labels":[],"label_agreement":null},{"id":"W2008472025","doi":"10.1016/j.laa.2006.04.010","title":"Moving zeros among matrices","year":2006,"lang":"en","type":"article","venue":"Linear Algebra and its Applications","topic":"Polynomial and algebraic computation","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Guelph","funders":"","keywords":"Mathematics; Tridiagonal matrix; Unitary matrix; Unitary state; Extension (predicate logic); Similarity (geometry); Matrix (chemical analysis); Matrix similarity; Zero (linguistics); Sequence (biology); Algebra over a field; Algebraically closed field; Pure mathematics; Mathematical analysis; Eigenvalues and eigenvectors; Computer science","score_opus":0.007037484286326731,"score_gpt":0.2205351190019375,"score_spread":0.21349763471561078,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2008472025","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.34020463,0.0007894659,0.65537614,0.0008328366,0.00006031527,0.0003054829,0.0000050097738,0.00028852175,0.002137588],"genre_scores_gemma":[0.98939455,0.000029193308,0.009446828,0.00013126481,0.00028756182,0.000078555975,0.000011448883,0.0000068728536,0.0006137234],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992755,0.0000128343745,0.00017590275,0.00027139284,0.000105706116,0.00015866474],"domain_scores_gemma":[0.9995674,0.00006497716,0.00006873227,0.00019546458,0.000041322604,0.00006208623],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00006724523,0.00009225004,0.0000870123,0.00006947444,0.00022013551,0.00012488574,0.0002790035,0.000039606846,0.00000717],"category_scores_gemma":[0.0000052948535,0.00008592259,0.000030329606,0.00033752836,0.000025762181,0.0003486853,0.0001253148,0.00006782687,0.00008008618],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000010987698,0.00008192389,0.0012256065,0.00002227452,0.000008660362,0.0000012941742,0.00012318377,0.00028481163,0.003311069,0.9308833,0.00091655424,0.06314024],"study_design_scores_gemma":[0.00066151907,0.00006233215,0.08363972,0.000029839377,0.000030173927,0.000026059906,0.000031443753,0.6955623,0.013445442,0.1445336,0.0612577,0.00071988936],"about_ca_topic_score_codex":0.000062069936,"about_ca_topic_score_gemma":0.0000062908057,"teacher_disagreement_score":0.7863497,"about_ca_system_score_codex":0.000008966871,"about_ca_system_score_gemma":0.000019581257,"threshold_uncertainty_score":0.35038218},"labels":[],"label_agreement":null},{"id":"W2008573631","doi":"10.1145/860854.860873","title":"An elementary algorithm for the automatic derivation and proof of tensor product identities via computer algebra","year":2003,"lang":"en","type":"article","venue":"","topic":"Polynomial and algebraic computation","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Mathematics; Tensor product; Algebra over a field; Symbolic computation; Simple (philosophy); Pure mathematics; Mathematical analysis","score_opus":0.010758659388524387,"score_gpt":0.23580273606809862,"score_spread":0.22504407667957424,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2008573631","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08094536,0.000081555416,0.9177214,0.0004304914,0.00022116382,0.00051338726,0.0000015952169,0.000063167405,0.000021909065],"genre_scores_gemma":[0.5389071,0.0000018793527,0.460592,0.00030574284,0.00008371815,0.000038348237,0.000004680659,0.0000053781746,0.00006113362],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999204,0.000051104667,0.00023266287,0.00022845481,0.00014341783,0.00014040181],"domain_scores_gemma":[0.9994305,0.000116411145,0.00009447885,0.00024171405,0.00008407932,0.000032865162],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00029918813,0.00009325476,0.00010888999,0.000056118635,0.00013016559,0.00010348688,0.00024892882,0.000015193531,0.000010812133],"category_scores_gemma":[0.000010963221,0.00006290118,0.000030243771,0.00013478058,0.0000485649,0.00054376834,0.00004967424,0.000030702206,8.768087e-7],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[8.4874983e-7,0.00005436697,0.00012137169,0.000028066048,0.000022631017,2.5347782e-7,0.00040530192,0.000106391744,0.0004178296,0.011993882,0.00042237746,0.98642665],"study_design_scores_gemma":[0.0003099531,0.00017614408,0.0043297773,0.00000788129,0.000011426181,0.000015486456,0.00003464045,0.9472765,0.025568157,0.021997826,0.00017174473,0.00010050433],"about_ca_topic_score_codex":0.000024330056,"about_ca_topic_score_gemma":0.0000061399996,"teacher_disagreement_score":0.98632616,"about_ca_system_score_codex":0.000011377824,"about_ca_system_score_gemma":0.000033430293,"threshold_uncertainty_score":0.25650358},"labels":[],"label_agreement":null},{"id":"W2009348801","doi":"10.1155/2015/242515","title":"Tan’s Epsilon-Determinant and Ranks of Matrices over Semirings","year":2015,"lang":"en","type":"article","venue":"International Scholarly Research Notices","topic":"Polynomial and algebraic computation","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Guelph","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Bijection; Rank (graph theory); Mathematics; Combinatorics","score_opus":0.08555180201056461,"score_gpt":0.375831473606898,"score_spread":0.2902796715963334,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2009348801","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.98761374,0.0006080691,0.0045344806,0.0020875165,0.00045577058,0.00012326255,0.000006056457,0.00004029956,0.0045307996],"genre_scores_gemma":[0.99135655,0.00003527434,0.00794808,0.000059530466,0.000111773996,0.000008671982,0.0000019871957,0.000005309263,0.00047279632],"study_design_codex":"design_other","study_design_gemma":"observational","domain_scores_codex":[0.9978448,0.00013811211,0.0002467744,0.00030522473,0.0012306855,0.00023440679],"domain_scores_gemma":[0.99836683,0.00040533117,0.00010969257,0.00020056572,0.0007400634,0.00017752154],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019324688,0.0000873026,0.00011965283,0.00035612076,0.000087243134,0.0010049534,0.001160006,0.000052761363,0.000020021196],"category_scores_gemma":[0.0007374851,0.00007410033,0.000033950695,0.00034661166,0.000115499235,0.0036242234,0.0007508882,0.00030501612,0.00003620222],"study_design_candidate":"observational","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0004966033,0.0007301883,0.1451602,0.00019570554,0.00031603337,0.00028128727,0.011591655,0.000642235,0.02885058,0.30147803,0.011068056,0.49918944],"study_design_scores_gemma":[0.004687652,0.0012881218,0.40091935,0.0005267112,0.000021735656,0.00011378708,0.0005705793,0.33795375,0.018758446,0.1726901,0.061544087,0.000925684],"about_ca_topic_score_codex":0.00044234365,"about_ca_topic_score_gemma":0.000024410745,"teacher_disagreement_score":0.49826375,"about_ca_system_score_codex":0.000074015945,"about_ca_system_score_gemma":0.00013762085,"threshold_uncertainty_score":0.9690789},"labels":[],"label_agreement":null},{"id":"W2009808233","doi":"10.3318/pria.2005.105.2.103","title":"Bloch's Theorem for Algebroid Multifunctions II","year":2005,"lang":"en","type":"article","venue":"Mathematical Proceedings of the Royal Irish Academy","topic":"Polynomial and algebraic computation","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université Laval","funders":"","keywords":"Mathematics; Pure mathematics","score_opus":0.018349263284750058,"score_gpt":0.25524209710230505,"score_spread":0.236892833817555,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2009808233","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.37430474,0.00009242474,0.28544575,0.26742792,0.00036209603,0.0021815407,0.000012562194,0.00077147,0.069401495],"genre_scores_gemma":[0.9332785,5.136977e-7,0.06008084,0.0040595704,0.0004500052,0.00006451133,2.2773244e-7,0.00001582317,0.002049985],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986165,0.0000072649077,0.00042077916,0.00030812548,0.0003187103,0.00032858708],"domain_scores_gemma":[0.99919194,0.0002780156,0.00021333576,0.00011859935,0.00011130609,0.0000868252],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00042725806,0.00016522675,0.00023326329,0.00005698034,0.00033089233,0.000084963234,0.001260519,0.0001424735,0.000023207109],"category_scores_gemma":[0.00044946192,0.000113001086,0.00021026318,0.00025002,0.00013007372,0.00031192834,0.0005512369,0.00029837957,0.000033679138],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000123500895,0.00017896334,0.000016027341,0.000104623345,0.000032751526,4.4060226e-8,0.0006105572,0.00017665213,0.0016358055,0.8742535,0.11384558,0.009133134],"study_design_scores_gemma":[0.0005826799,0.000106524225,0.000293801,0.0000887758,0.00004389482,0.000011400688,0.00003606476,0.3261583,0.030137924,0.61463434,0.027643124,0.0002631892],"about_ca_topic_score_codex":9.726517e-7,"about_ca_topic_score_gemma":6.035407e-8,"teacher_disagreement_score":0.5589738,"about_ca_system_score_codex":0.00003669545,"about_ca_system_score_gemma":0.000028943728,"threshold_uncertainty_score":0.46080506},"labels":[],"label_agreement":null},{"id":"W2009930250","doi":"10.1023/b:rama.0000012427.39580.ab","title":"Congruences for Quadratic Units of Norm −1","year":2003,"lang":"en","type":"article","venue":"The Ramanujan Journal","topic":"Polynomial and algebraic computation","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Modulo; Congruence relation; Norm (philosophy); Mathematics; Class number; Quadratic equation; Combinatorics; Ring of integers; Element (criminal law); Quadratic residue; Discrete mathematics; Algebraic number field; Geometry; Law","score_opus":0.026212835723396617,"score_gpt":0.24726258913489516,"score_spread":0.22104975341149855,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2009930250","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.38479355,0.00021324304,0.61142576,0.0015806345,0.0007466784,0.00012244747,9.199496e-7,0.000016627542,0.0011001081],"genre_scores_gemma":[0.9924808,0.000006161571,0.00708368,0.00013162079,0.00008459753,0.0000023137598,1.9434891e-7,0.000002725652,0.0002078667],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993219,0.00009455854,0.00021443241,0.000074556374,0.0001423001,0.0001522516],"domain_scores_gemma":[0.999272,0.00023076101,0.00016787759,0.00014223685,0.00013166737,0.00005548697],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006454426,0.00006202985,0.00009987833,0.00004458181,0.00020473587,0.00010773264,0.0005202292,0.000015719019,0.000011072355],"category_scores_gemma":[0.00013647547,0.000037565773,0.000048157184,0.00022219298,0.000050871888,0.00021156904,0.000023711593,0.00009346741,0.00000554466],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000025402102,0.000080707665,0.0005588311,0.000029140358,0.00008490759,0.000008759968,0.0053417752,0.0018838885,0.0017097753,0.84678787,0.00481009,0.13867886],"study_design_scores_gemma":[0.002285378,0.00090190774,0.004606196,0.0001276671,0.00005320939,0.0010559476,0.00088353665,0.05805823,0.03807626,0.8658842,0.027613727,0.0004537834],"about_ca_topic_score_codex":0.0000042063216,"about_ca_topic_score_gemma":0.0000053496424,"teacher_disagreement_score":0.6076873,"about_ca_system_score_codex":0.00001216485,"about_ca_system_score_gemma":0.00016621944,"threshold_uncertainty_score":0.15746835},"labels":[],"label_agreement":null},{"id":"W2011207950","doi":"10.1145/2768577.2768641","title":"Rational invariants of finite abelian groups","year":2015,"lang":"en","type":"article","venue":"ACM communications in computer algebra","topic":"Polynomial and algebraic computation","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Abelian group; Mathematics; Pure mathematics; Algebra over a field","score_opus":0.06751433941925224,"score_gpt":0.2975233244416609,"score_spread":0.23000898502240869,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2011207950","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03822117,0.00037730133,0.95106894,0.00832503,0.0005551332,0.00025195855,0.000006283502,0.00015896812,0.0010352444],"genre_scores_gemma":[0.6587225,0.000025061854,0.3405995,0.00052703236,0.00005669977,0.000018932275,0.000028765284,0.0000067523474,0.000014742375],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983156,0.00027939142,0.0005746663,0.00030310138,0.00030018832,0.00022706638],"domain_scores_gemma":[0.9955599,0.00081883586,0.00020121307,0.0030493857,0.00021400418,0.00015666762],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006503105,0.00015420275,0.00023573097,0.00032918528,0.00009989412,0.00010552727,0.0049660206,0.00007095541,0.000007357611],"category_scores_gemma":[0.00030527808,0.00016147786,0.00006274141,0.0009904258,0.00013429833,0.0007374302,0.00319233,0.0002257571,0.00006755073],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000016978562,0.0007498703,0.006087879,0.000019841858,0.000056754077,0.00000834856,0.005734719,0.0062146136,0.00016382488,0.7444321,0.004902307,0.23161276],"study_design_scores_gemma":[0.0011383598,0.00012506891,0.019866858,0.00006476612,0.0000054115435,0.00001742226,0.000026187918,0.6953042,0.00018105046,0.28023478,0.002753944,0.00028191588],"about_ca_topic_score_codex":0.000103892984,"about_ca_topic_score_gemma":0.00007917979,"teacher_disagreement_score":0.6890896,"about_ca_system_score_codex":0.00007522444,"about_ca_system_score_gemma":0.0003222062,"threshold_uncertainty_score":0.9228184},"labels":[],"label_agreement":null},{"id":"W2012117787","doi":"10.1145/1940475.1940479","title":"A fast recursive algorithm for computing cyclotomic polynomials","year":2011,"lang":"en","type":"article","venue":"ACM communications in computer algebra","topic":"Polynomial and algebraic computation","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Computer science; Algorithm; Algebra over a field; Parallel computing; Mathematics; Pure mathematics","score_opus":0.05293683255233263,"score_gpt":0.2971493538939185,"score_spread":0.2442125213415859,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2012117787","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0121926535,0.00033479655,0.9834195,0.0014292208,0.000773313,0.00081265316,0.000013578359,0.0003794491,0.0006448448],"genre_scores_gemma":[0.23644875,0.00004241148,0.76236945,0.0008025622,0.00016544081,0.0000948564,0.0000316365,0.000024236906,0.000020647856],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9975046,0.0002883588,0.0007831882,0.00066198054,0.00019155712,0.0005703436],"domain_scores_gemma":[0.9944156,0.0011403818,0.00031578736,0.0037998934,0.00018380868,0.0001445617],"candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":[],"category_scores_codex":[0.0006927043,0.0003135079,0.0004179927,0.00043032103,0.00040388267,0.00019034666,0.0071967402,0.00012975693,0.000007753885],"category_scores_gemma":[0.00008902544,0.0003416045,0.0001821819,0.00078906363,0.00017627422,0.00067060825,0.0038638243,0.00033638874,0.000063889536],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000006884551,0.00028289921,0.00027050526,0.000009147278,0.000042049815,0.0000038110932,0.0041382173,0.00006370685,0.00004298411,0.055584252,0.0008523714,0.9387032],"study_design_scores_gemma":[0.0013749279,0.00020937312,0.009379307,0.00011108538,0.000016152238,0.000048744278,0.000060606195,0.85256696,0.00056624383,0.13301012,0.002059087,0.00059740816],"about_ca_topic_score_codex":0.00019967694,"about_ca_topic_score_gemma":0.00005607837,"teacher_disagreement_score":0.93810576,"about_ca_system_score_codex":0.00015004678,"about_ca_system_score_gemma":0.0001599409,"threshold_uncertainty_score":0.9999036},"labels":[],"label_agreement":null},{"id":"W2012425886","doi":"10.1017/s0308210500003139","title":"On the use of Hadamard expansions in hyperasymptotic evaluation: differential equations of hypergeometric type","year":2004,"lang":"en","type":"article","venue":"Proceedings of the Royal Society of Edinburgh Section A Mathematics","topic":"Polynomial and algebraic computation","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Lethbridge","funders":"Natural Sciences and Engineering Research Council of Canada; Abertay University","keywords":"Hadamard transform; Hypergeometric distribution; Mathematics; Frobenius solution to the hypergeometric equation; Confluent hypergeometric function; Differential equation; Linear differential equation; Hypergeometric function; Appell series; Applied mathematics; Method of matched asymptotic expansions; Differential (mechanical device); Type (biology); Basic hypergeometric series; Mathematical analysis; Generalized hypergeometric function; Hypergeometric function of a matrix argument; Pure mathematics; Physics","score_opus":0.05347619372444248,"score_gpt":0.253626395713174,"score_spread":0.20015020198873154,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2012425886","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9497079,0.000023041439,0.048801724,0.00057114684,0.00037307592,0.0003780971,0.0000024482579,0.000015787713,0.00012675932],"genre_scores_gemma":[0.9910412,0.000008808659,0.00876963,0.000030297411,0.000044425382,0.000012525529,5.99221e-7,0.000006092611,0.000086438195],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984257,0.000011779498,0.0005659672,0.00015721626,0.0007122012,0.00012711453],"domain_scores_gemma":[0.9979992,0.0005220312,0.0006285869,0.00017918958,0.0006439306,0.000027064158],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005445694,0.000118647884,0.00025907316,0.00012637732,0.00009264389,0.000024632616,0.00045809554,0.00007470607,0.00003951682],"category_scores_gemma":[0.0009921443,0.00007719697,0.00022544421,0.0014578678,0.0001169013,0.00017636745,0.00016824539,0.00014646773,3.1463756e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013386595,0.0073974347,0.004029052,0.0015067855,0.0008019512,1.35866e-7,0.07148278,0.45467415,0.17594266,0.25655094,0.017812213,0.009668036],"study_design_scores_gemma":[0.00093308504,0.00030454673,0.0048702983,0.0005665464,0.00010179908,0.0000018784926,0.0008052136,0.90810025,0.036269773,0.047865815,0.000018835755,0.00016196643],"about_ca_topic_score_codex":0.00006704835,"about_ca_topic_score_gemma":0.0000019699744,"teacher_disagreement_score":0.4534261,"about_ca_system_score_codex":0.00008231963,"about_ca_system_score_gemma":0.000110291425,"threshold_uncertainty_score":0.3148001},"labels":[],"label_agreement":null},{"id":"W2014664484","doi":"10.1090/s0025-5718-2014-02817-2","title":"Computation of the topological type of a real Riemann surface","year":2014,"lang":"en","type":"article","venue":"Mathematics of Computation","topic":"Polynomial and algebraic computation","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Center for Diagnosis and Research on Alzheimer's Disease","funders":"Agence Nationale de la Recherche","keywords":"Computation; Type (biology); Surface (topology); Riemann surface; Topology (electrical circuits); Mathematics; Riemann hypothesis; Computer science; Pure mathematics; Geometry; Geology; Algorithm; Combinatorics; Paleontology","score_opus":0.02789749109193495,"score_gpt":0.27876166687241455,"score_spread":0.2508641757804796,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2014664484","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.49611872,0.000009661504,0.5028229,0.00012126437,0.00013998066,0.00009876034,7.44924e-7,0.000021210984,0.00066675834],"genre_scores_gemma":[0.8977432,0.0000021274816,0.1022019,0.000015035358,0.000016036818,6.797659e-7,0.0000022487147,0.000004709761,0.000014057126],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99874043,0.000117303076,0.0005524323,0.00014435929,0.00034167108,0.000103779515],"domain_scores_gemma":[0.9984077,0.0004021678,0.0006396371,0.00022840327,0.00029512396,0.000026937685],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00043807345,0.00009856889,0.0002764641,0.00005401585,0.000043420743,0.000014796671,0.00041664363,0.000052539228,0.0000019615784],"category_scores_gemma":[0.00013457997,0.000072145674,0.00008570747,0.00042207472,0.000110941735,0.0001180507,0.00016232234,0.000059679147,0.0000033044198],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000025583495,0.0005673899,0.0009993584,0.00069489254,0.000056136723,3.573155e-7,0.005822177,0.28146735,0.017509492,0.6613797,0.00022592366,0.031251676],"study_design_scores_gemma":[0.000246301,0.00016911907,0.007994873,0.00009094392,0.000011851321,0.000002925818,0.000036562797,0.78194094,0.009709483,0.19971925,0.0000059051454,0.0000718261],"about_ca_topic_score_codex":0.000030250645,"about_ca_topic_score_gemma":0.000002735648,"teacher_disagreement_score":0.5004736,"about_ca_system_score_codex":0.000014053403,"about_ca_system_score_gemma":0.000049502676,"threshold_uncertainty_score":0.29420152},"labels":[],"label_agreement":null},{"id":"W2014988898","doi":"10.1215/00294527-2009-013","title":"George Boole's Deductive System","year":2009,"lang":"en","type":"article","venue":"Notre Dame Journal of Formal Logic","topic":"Polynomial and algebraic computation","field":"Computer Science","cited_by":12,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Universitatea din București; University of Waterloo; University of South Carolina","keywords":"Rotation formalisms in three dimensions; George (robot); Computer science; Principal (computer security); Algebra over a field; Mathematics; Programming language; Artificial intelligence; Pure mathematics","score_opus":0.010943128461618984,"score_gpt":0.2307062826099928,"score_spread":0.2197631541483738,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2014988898","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.33772188,0.0004952197,0.64676315,0.0032394386,0.0014666703,0.00011590416,0.0000025626086,0.0001066357,0.010088553],"genre_scores_gemma":[0.98635644,0.0000062320964,0.012745799,0.00046786462,0.00035475372,3.493216e-7,4.7960685e-7,0.0000025144227,0.00006558472],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99876773,0.000048351958,0.00041071794,0.00011929054,0.0003817056,0.00027217166],"domain_scores_gemma":[0.99904466,0.000040257193,0.0003997781,0.00015161808,0.00023557649,0.00012809786],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00047191436,0.00011790271,0.00022108648,0.00013172218,0.00010677887,0.0001040212,0.0006164691,0.000050705963,0.000006487114],"category_scores_gemma":[0.000036764723,0.00008567877,0.00014229288,0.00021845273,0.00001864526,0.0014067639,0.00006615515,0.00020848884,0.00003506155],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013100615,0.00026241926,0.00013222688,0.000032660813,0.00006443865,0.00042687362,0.0014596821,0.0026772164,0.0034038245,0.46445403,0.004439863,0.5225158],"study_design_scores_gemma":[0.012347895,0.01892372,0.2570206,0.0015269333,0.00033392358,0.026071617,0.002219664,0.2629508,0.033466198,0.33624464,0.045376383,0.0035176333],"about_ca_topic_score_codex":0.0000036916188,"about_ca_topic_score_gemma":5.2139615e-7,"teacher_disagreement_score":0.64863455,"about_ca_system_score_codex":0.0001268898,"about_ca_system_score_gemma":0.000111475965,"threshold_uncertainty_score":0.34938785},"labels":[],"label_agreement":null},{"id":"W2016996764","doi":"10.1016/j.jalgebra.2012.03.043","title":"Geometric axioms for differentially closed fields with several commuting derivations","year":2012,"lang":"en","type":"article","venue":"Journal of Algebra","topic":"Polynomial and algebraic computation","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Mathematics; Axiom; Zero (linguistics); Pure mathematics; Field (mathematics); Order (exchange); Algebra over a field; Geometry","score_opus":0.017666959422402147,"score_gpt":0.24321494087475753,"score_spread":0.22554798145235538,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2016996764","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4157645,0.00007585443,0.58290553,0.00075482024,0.00036711595,0.000055990844,5.509425e-7,0.000014280232,0.00006131001],"genre_scores_gemma":[0.9511663,0.0000036407755,0.047987774,0.00031111066,0.00047647147,0.0000022662075,0.0000013719355,0.0000065689906,0.000044543685],"study_design_codex":"design_other","study_design_gemma":"observational","domain_scores_codex":[0.99905384,0.000036421967,0.00032935932,0.00007995839,0.00023915138,0.00026124655],"domain_scores_gemma":[0.9989337,0.00028226912,0.00034562638,0.00014406933,0.0001651037,0.00012924439],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00033021896,0.00009851856,0.00017876342,0.00026403306,0.00014558507,0.000116134885,0.0004357345,0.000043288852,0.000010286618],"category_scores_gemma":[0.00008083841,0.00007213273,0.00010320793,0.00045617577,0.000018391846,0.0007977629,0.000076049335,0.00015549634,0.000003119797],"study_design_candidate":"observational","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00038135878,0.0016159747,0.018867182,0.00016280981,0.0008256323,0.000029652732,0.01116058,0.0035589535,0.0039348444,0.21572049,0.009271328,0.7344712],"study_design_scores_gemma":[0.012772461,0.004848177,0.77947044,0.00042218415,0.00033748808,0.0016139654,0.00046111783,0.11253004,0.022934308,0.053201437,0.009588107,0.0018202951],"about_ca_topic_score_codex":0.000005565878,"about_ca_topic_score_gemma":0.00000260848,"teacher_disagreement_score":0.76060325,"about_ca_system_score_codex":0.000035243032,"about_ca_system_score_gemma":0.000081948354,"threshold_uncertainty_score":0.2941487},"labels":[],"label_agreement":null},{"id":"W2017357907","doi":"10.5539/mas.v2n5p96","title":"A New Way to Determine the Multinomial Divisibility in the Rational Coefficient Field","year":2008,"lang":"en","type":"article","venue":"Modern Applied Science","topic":"Polynomial and algebraic computation","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Divisibility rule; Multinomial distribution; Quotient; Mathematics; Applied mathematics; Statistics; Pure mathematics","score_opus":0.02671547055429853,"score_gpt":0.24969643040685754,"score_spread":0.222980959852559,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2017357907","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3361605,0.0000050548333,0.6597352,0.0028729208,0.0001228473,0.00026132382,3.410176e-7,0.000025180834,0.0008166032],"genre_scores_gemma":[0.98705107,3.4845442e-7,0.010059233,0.0027231837,0.00008643264,0.000028051527,3.0851146e-7,0.0000019762092,0.000049380207],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983801,0.00003268176,0.00020113599,0.00046671156,0.00061354786,0.0003057868],"domain_scores_gemma":[0.9989876,0.00031429125,0.000044078246,0.00052741455,0.00003250896,0.000094072144],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00089049625,0.00010042203,0.000087510234,0.00007880422,0.00054754404,0.00017720398,0.0020027042,0.000020536549,0.0000053938734],"category_scores_gemma":[0.000094867355,0.000057888825,0.000030088433,0.0008985024,0.00014922193,0.00018787353,0.00040473274,0.0001303696,0.00003704205],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000054725555,0.00022287403,0.00077953195,0.000003980855,0.0000025072438,0.000015377018,0.045043994,0.034850102,0.07620556,0.04207673,0.0023122828,0.79843235],"study_design_scores_gemma":[0.00028072402,0.000046755493,0.054459613,0.0000030273968,7.6530546e-7,0.000017130793,0.000026529406,0.9327509,0.0055031152,0.0064287046,0.0003573015,0.00012543866],"about_ca_topic_score_codex":0.000114006485,"about_ca_topic_score_gemma":0.00009293878,"teacher_disagreement_score":0.8979008,"about_ca_system_score_codex":0.000056154102,"about_ca_system_score_gemma":0.00025466766,"threshold_uncertainty_score":0.42113215},"labels":[],"label_agreement":null},{"id":"W2017906382","doi":"10.1142/9789812778857_0012","title":"TWO FAMILIES OF ALGORITHMS FOR SYMBOLIC POLYNOMIALS","year":2007,"lang":"en","type":"article","venue":"","topic":"Polynomial and algebraic computation","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Factorization; Exponent; Mathematics; Interpolation (computer graphics); Algorithm; Integer (computer science); Factorization of polynomials; Algebraic number; Symbolic computation; Algebra over a field; Difference polynomials; Discrete mathematics; Combinatorics; Polynomial; Computer science; Orthogonal polynomials; Pure mathematics","score_opus":0.02194072303124294,"score_gpt":0.2918920347528548,"score_spread":0.26995131172161185,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2017906382","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08655749,0.00005495182,0.90747666,0.000243702,0.0003692523,0.00014891132,0.0000021176538,0.00009059426,0.0050563137],"genre_scores_gemma":[0.836659,0.000002734367,0.162509,0.00024013399,0.00014825331,0.0000045046995,0.0000014795271,0.000004065441,0.0004308004],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9992268,0.000009454365,0.00025579883,0.00018034787,0.00011484708,0.00021273966],"domain_scores_gemma":[0.99937797,0.00023394999,0.000074688025,0.000191728,0.00006353727,0.00005810134],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00039536366,0.000077311815,0.00014193068,0.00011773316,0.00004724356,0.000027662738,0.00036370935,0.000025078249,0.0000054946627],"category_scores_gemma":[0.0000263995,0.00006548235,0.00007199728,0.00020801087,0.000029763156,0.00018264155,0.000090039015,0.000026092015,0.0000095999],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000011514285,0.00005181229,0.00017418725,0.000013128017,0.000015810941,0.0000010457212,0.00050592545,0.00006091729,0.01025334,0.29117605,0.00075999676,0.6969763],"study_design_scores_gemma":[0.0036211947,0.0005664769,0.026374552,0.00004129825,0.000022409233,0.000026483376,0.00036580735,0.16942751,0.68307567,0.1008354,0.01486275,0.0007804551],"about_ca_topic_score_codex":0.00014357087,"about_ca_topic_score_gemma":0.00002889504,"teacher_disagreement_score":0.75010157,"about_ca_system_score_codex":0.00001401997,"about_ca_system_score_gemma":0.000042189586,"threshold_uncertainty_score":0.2670293},"labels":[],"label_agreement":null},{"id":"W2017958871","doi":"10.1016/j.jsc.2008.05.007","title":"Dynamic balancing of planar mechanisms using toric geometry","year":2009,"lang":"en","type":"article","venue":"Journal of Symbolic Computation","topic":"Polynomial and algebraic computation","field":"Computer Science","cited_by":17,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université Laval","funders":"","keywords":"Mathematics; Planar; Base (topology); Kinematics; Polynomial; Factorization; Toric variety; Laurent polynomial; Algebraic number; Geometry; Pure mathematics; Computer science; Mathematical analysis; Algorithm","score_opus":0.010288720647671163,"score_gpt":0.25461434666655175,"score_spread":0.24432562601888058,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2017958871","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3954254,0.00011375652,0.6037305,0.00019316349,0.0004470303,0.000038035134,4.3787855e-7,0.00001595051,0.000035718873],"genre_scores_gemma":[0.85442287,0.0000071518416,0.14537701,0.00010157405,0.00008149591,1.02277696e-7,9.758213e-7,0.0000041707303,0.0000046241526],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986025,0.0000574392,0.0006218474,0.00013532174,0.0004134482,0.00016941932],"domain_scores_gemma":[0.9987317,0.00009061109,0.0007513485,0.000110880355,0.00023039809,0.00008511695],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004165759,0.000115374765,0.0002944045,0.00047832233,0.000066465705,0.0000589215,0.00035785654,0.000049476108,0.0000021692408],"category_scores_gemma":[0.00003665089,0.000106654355,0.000115977695,0.00064661406,0.00001160162,0.00054442143,0.00003046833,0.00013685568,0.0000020948987],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006016781,0.00034161523,0.00021932638,0.00006396779,0.00010540111,0.00007797183,0.002725295,0.1541804,0.14422452,0.05314342,0.00019009013,0.6446678],"study_design_scores_gemma":[0.00065382576,0.00046796218,0.026115878,0.00013370198,0.000025994805,0.00035870698,0.000059346577,0.8255695,0.00220072,0.14423229,0.000015825182,0.00016622504],"about_ca_topic_score_codex":0.000010761201,"about_ca_topic_score_gemma":6.4977223e-7,"teacher_disagreement_score":0.67138916,"about_ca_system_score_codex":0.000125832,"about_ca_system_score_gemma":0.00013388261,"threshold_uncertainty_score":0.43492386},"labels":[],"label_agreement":null},{"id":"W2019037662","doi":"10.48550/arxiv.0706.0083","title":"Enumeration of curves via floor diagrams","year":2007,"lang":"en","type":"preprint","venue":"ArXiv.org","topic":"Polynomial and algebraic computation","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Enumeration; Diagram; Computer science; Mathematics; Combinatorics; Statistics","score_opus":0.03391533123754047,"score_gpt":0.26915111391803126,"score_spread":0.23523578268049078,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2019037662","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.52690023,0.00084726297,0.46996793,0.000586632,0.0011385762,0.00018379057,0.0000029298783,0.00010995587,0.00026272345],"genre_scores_gemma":[0.99438286,0.00015045801,0.0044205454,0.00048931624,0.000320813,0.000016895126,0.000046599416,0.000011185406,0.00016133586],"study_design_codex":"design_other","study_design_gemma":"observational","domain_scores_codex":[0.9984835,0.00006807089,0.0004460874,0.00048178853,0.000288957,0.0002315942],"domain_scores_gemma":[0.99877536,0.00007688353,0.0003192639,0.00061066716,0.00013485223,0.000082998646],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00037485184,0.00020743947,0.00029176002,0.0001267385,0.00005929333,0.00004800127,0.00080438826,0.0001560095,0.00001933473],"category_scores_gemma":[0.000060668895,0.00020097492,0.00014255411,0.00023833578,0.000047587102,0.00022293745,0.0007861061,0.000308464,0.000113817645],"study_design_candidate":"observational","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003315827,0.00063488504,0.1206646,0.001692237,0.00025799463,0.000053768992,0.0026670564,0.0031307763,0.011139912,0.005724913,0.0037385519,0.85026217],"study_design_scores_gemma":[0.0006170126,0.00019165562,0.8427916,0.0011240983,0.0000673675,0.000015542717,0.000010477175,0.076122485,0.05617484,0.019894788,0.0019251886,0.0010649515],"about_ca_topic_score_codex":0.00022625767,"about_ca_topic_score_gemma":0.000028361255,"teacher_disagreement_score":0.8491972,"about_ca_system_score_codex":0.0000419875,"about_ca_system_score_gemma":0.00012308462,"threshold_uncertainty_score":0.8195519},"labels":[],"label_agreement":null},{"id":"W2020188194","doi":"10.5802/afst.1408","title":"Toric and tropical compactifications of hyperplane complements","year":2014,"lang":"en","type":"article","venue":"Annales de la faculté des sciences de Toulouse Mathématiques","topic":"Polynomial and algebraic computation","field":"Computer Science","cited_by":16,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Compactification (mathematics); Hyperplane; Tropical geometry; Pure mathematics; Mathematics; Theoretical physics; Geometry; Physics","score_opus":0.04949759856911462,"score_gpt":0.33695039090057555,"score_spread":0.2874527923314609,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2020188194","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.72786367,0.000094274554,0.27003843,0.00031909288,0.000022710276,0.000055041135,0.0000044699864,0.00009297258,0.0015093429],"genre_scores_gemma":[0.8783822,0.00004254584,0.121341385,0.0001731055,0.000025211857,0.0000058971236,0.0000019844395,0.0000036068216,0.000024056848],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"observational","domain_scores_codex":[0.99879676,0.00026722133,0.00023478975,0.00023849834,0.00020518816,0.0002575391],"domain_scores_gemma":[0.9991249,0.00042160752,0.00011491974,0.00016551686,0.000058933463,0.00011413244],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000584484,0.000111964815,0.00016911677,0.00010322477,0.00030342696,0.00023833463,0.00054715143,0.000043986725,0.000008089866],"category_scores_gemma":[0.00011608541,0.00009260552,0.00003828154,0.00028124853,0.00073537027,0.00037639833,0.00012849338,0.000077533536,0.000006198117],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000012923896,0.00031479847,0.064812995,0.00017334326,0.000041279392,0.0000063751445,0.02111722,0.0008077403,0.0113852555,0.81854045,0.0026508472,0.08013678],"study_design_scores_gemma":[0.0003441525,0.00042956002,0.52831745,0.00008305201,0.000014012592,0.00016667282,0.00024000223,0.26899168,0.004687477,0.1928576,0.0035645235,0.00030379026],"about_ca_topic_score_codex":0.00012284945,"about_ca_topic_score_gemma":0.00003054641,"teacher_disagreement_score":0.62568283,"about_ca_system_score_codex":0.000041009924,"about_ca_system_score_gemma":0.000070552705,"threshold_uncertainty_score":0.37763438},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Mathematics; 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","score_opus":0.02510157427757449,"score_gpt":0.23450891319260106,"score_spread":0.20940733891502658,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2020661143","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011265572,0.00006430797,0.9833069,0.00023806254,0.00022017038,0.00015390664,0.000013748343,0.00006345973,0.0046738763],"genre_scores_gemma":[0.8748355,0.0000056187,0.11816219,0.00009951007,0.00007096281,0.00003479205,0.0000061156966,0.000012267614,0.006773046],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993892,0.000017030843,0.00022056392,0.00012890706,0.00011308604,0.0001312321],"domain_scores_gemma":[0.9990679,0.00045817866,0.00011261035,0.00027617574,0.000046024423,0.000039093266],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00015877378,0.00008104925,0.00013036636,0.000059948,0.000071771996,0.00003414785,0.00029132192,0.000027453423,0.000051488547],"category_scores_gemma":[0.00012014314,0.00006701274,0.0000957622,0.0001603702,0.000034483906,0.00013549271,0.0000658318,0.00003377676,0.000048008154],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000041914927,0.00017478899,0.000023212891,0.00019294886,0.000048421218,9.209409e-7,0.006330102,0.0004467676,0.00045523825,0.9214793,0.0045994665,0.06624468],"study_design_scores_gemma":[0.0003104254,0.00009844486,0.000075719225,0.000041832256,0.000023855697,0.0000043351174,0.00017951874,0.71583587,0.0015476886,0.27930015,0.0024212005,0.00016094769],"about_ca_topic_score_codex":0.0000013742882,"about_ca_topic_score_gemma":8.9006755e-7,"teacher_disagreement_score":0.8651447,"about_ca_system_score_codex":0.000008395039,"about_ca_system_score_gemma":0.000007802889,"threshold_uncertainty_score":0.27327004},"labels":[],"label_agreement":null},{"id":"W2021153515","doi":"10.1145/1993886.1993903","title":"Computing with semi-algebraic sets represented by triangular decomposition","year":2011,"lang":"en","type":"article","venue":"","topic":"Polynomial and algebraic computation","field":"Computer Science","cited_by":22,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"","keywords":"Decomposition; Algebraic number; Continuation; Computer science; Theoretical computer science; Algebra over a field; Algorithm; Mathematics; Pure mathematics","score_opus":0.015244140313373815,"score_gpt":0.24191984083122284,"score_spread":0.22667570051784902,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2021153515","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.28603977,0.000042955166,0.707365,0.0002769154,0.00012767909,0.00014197988,9.98318e-7,0.00036248658,0.005642242],"genre_scores_gemma":[0.9491214,0.0000013005039,0.05010871,0.00044102798,0.000035961064,0.0000040020154,0.000014260001,0.000009618924,0.0002637015],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99873847,0.00007967945,0.00023803768,0.00043955632,0.00022093698,0.0002833042],"domain_scores_gemma":[0.99925816,0.00006486927,0.00011152173,0.00037765503,0.000062535284,0.00012525966],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00018512881,0.00015400826,0.00016025756,0.00008944287,0.00014624429,0.000101216065,0.0004884767,0.000047323396,0.0000528878],"category_scores_gemma":[0.000010194725,0.0001229151,0.000050004986,0.0003975083,0.000036024772,0.00047036787,0.0001744953,0.00009988816,0.00006693722],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003937648,0.0015882218,0.010355441,0.00008818557,0.00044235747,0.00034896235,0.013088077,0.0007029741,0.03263378,0.17405343,0.05072579,0.71557903],"study_design_scores_gemma":[0.005084606,0.0011349394,0.031972088,0.00016062251,0.00005086524,0.00043036562,0.00019771658,0.7808557,0.14620727,0.029510764,0.002804917,0.0015901546],"about_ca_topic_score_codex":0.00023917483,"about_ca_topic_score_gemma":0.0000130592225,"teacher_disagreement_score":0.78015274,"about_ca_system_score_codex":0.000029616273,"about_ca_system_score_gemma":0.000039057057,"threshold_uncertainty_score":0.5012332},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.011987160902604925,"score_gpt":0.25847732941143414,"score_spread":0.2464901685088292,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2021258994","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6542154,0.00041053628,0.34325206,0.0013016831,0.000502354,0.00008034536,0.0000019407091,0.000020094183,0.00021559934],"genre_scores_gemma":[0.94841206,0.000053465006,0.050865125,0.000031742788,0.0006074813,7.6493853e-7,0.0000014612278,0.0000068413474,0.000021049318],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99812645,0.00009193105,0.0010186047,0.00014373913,0.00048323657,0.00013604185],"domain_scores_gemma":[0.9973067,0.00015694837,0.0017422475,0.00020022689,0.0005167587,0.000077104356],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00053623144,0.00011968581,0.0003686301,0.000492179,0.000055538818,0.000044120818,0.0005296364,0.00006516653,0.00001190098],"category_scores_gemma":[0.00009457866,0.00010936831,0.00016624483,0.0005565193,0.000044254357,0.0010995923,0.0000897253,0.00014242427,0.0000048346697],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00011533798,0.00041743336,0.00055664283,0.00009593462,0.00013555046,0.0000040810683,0.0024029536,0.08901059,0.038360443,0.006428304,0.004391038,0.8580817],"study_design_scores_gemma":[0.0077665662,0.0024433513,0.15132603,0.00093314896,0.00030447118,0.0016505226,0.00096533186,0.48960927,0.22058028,0.11924981,0.004119605,0.0010516057],"about_ca_topic_score_codex":0.00004165225,"about_ca_topic_score_gemma":0.0000022246443,"teacher_disagreement_score":0.8570301,"about_ca_system_score_codex":0.000086327724,"about_ca_system_score_gemma":0.00018462418,"threshold_uncertainty_score":0.445991},"labels":[],"label_agreement":null},{"id":"W2021877860","doi":"10.1515/advgeom.2011.019","title":"Fewnomial bounds for completely mixed polynomial systems","year":2011,"lang":"en","type":"article","venue":"Advances in Geometry","topic":"Polynomial and algebraic computation","field":"Computer Science","cited_by":12,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"École Polytechnique Fédérale de Lausanne; University of Calgary","keywords":"Mathematics; Monomial; Polynomial; Upper and lower bounds; Combinatorics; Discrete mathematics; Pure mathematics; Mathematical analysis","score_opus":0.028338489936019604,"score_gpt":0.2579464234838262,"score_spread":0.22960793354780656,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2021877860","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.19459167,0.0036151446,0.7883285,0.00012971713,0.0077563757,0.00059285905,0.000021224687,0.00023907168,0.004725409],"genre_scores_gemma":[0.9715714,0.000041766423,0.027736694,0.0001093524,0.00033434745,0.00007058253,0.0000071275367,0.000011821657,0.00011692926],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9985431,0.000046238296,0.0003813716,0.0004353587,0.00017138069,0.00042256474],"domain_scores_gemma":[0.99915797,0.00022126449,0.00014657361,0.00033253472,0.000050357452,0.00009130961],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00030745112,0.0001697639,0.0002665749,0.00031688655,0.00011695159,0.00010046492,0.00081325404,0.000068636735,0.0000081154985],"category_scores_gemma":[0.00005656879,0.0001663623,0.00008314161,0.0005949154,0.00006782009,0.0010456962,0.00017844456,0.00011091141,0.000031173833],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00040561066,0.0005827825,0.009655765,0.0002976057,0.00006834593,0.000047546022,0.0024393755,0.002916325,0.00095196627,0.29318386,0.0057346188,0.6837162],"study_design_scores_gemma":[0.010822998,0.002282051,0.07847965,0.00032171744,0.000043294804,0.00016241356,0.00072887226,0.29684752,0.008006714,0.08559596,0.5135808,0.0031279926],"about_ca_topic_score_codex":0.00009790373,"about_ca_topic_score_gemma":0.000052426913,"teacher_disagreement_score":0.7769797,"about_ca_system_score_codex":0.00007933666,"about_ca_system_score_gemma":0.00007048403,"threshold_uncertainty_score":0.67840576},"labels":[],"label_agreement":null},{"id":"W2022344882","doi":"10.1145/1358190.1358203","title":"A maple library for high performance sparse polynomial arithmetic","year":2007,"lang":"en","type":"article","venue":"ACM communications in computer algebra","topic":"Polynomial and algebraic computation","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Maple; Inefficiency; Implementation; Computer science; Arithmetic; Polynomial; Mathematics; Programming language; Botany; Biology","score_opus":0.029339437587312223,"score_gpt":0.2697053565679183,"score_spread":0.24036591898060605,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2022344882","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.24974927,0.0002691207,0.74121624,0.0066486304,0.0007336712,0.0005347519,0.0000088992865,0.00043911708,0.00040027764],"genre_scores_gemma":[0.5548533,0.000047739693,0.44393995,0.0008143291,0.0001794464,0.000044635162,0.000044380522,0.000016947703,0.000059273854],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99803954,0.000105512416,0.00064621854,0.00047871252,0.0001986878,0.00053132616],"domain_scores_gemma":[0.9948707,0.0013084422,0.00017423693,0.0034512978,0.000066010914,0.0001292769],"candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":[],"category_scores_codex":[0.00068320154,0.00023759008,0.00027922718,0.00043940963,0.00032741585,0.00025957977,0.0058726138,0.00010973355,0.000008901586],"category_scores_gemma":[0.00005608914,0.00025299905,0.00009146632,0.0009270238,0.00013534323,0.001202919,0.0033576617,0.00031442379,0.00005664985],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000042373664,0.00040815296,0.0032001215,0.000035339242,0.00003401454,0.0000059764106,0.000941136,0.00037399132,0.00011277132,0.09748052,0.006305319,0.8910603],"study_design_scores_gemma":[0.0028412456,0.00045664186,0.14930736,0.0001564012,0.00001964663,0.00006504193,0.000024511082,0.73199844,0.002892659,0.07472668,0.03653145,0.0009798999],"about_ca_topic_score_codex":0.000047934285,"about_ca_topic_score_gemma":0.0000406459,"teacher_disagreement_score":0.8900804,"about_ca_system_score_codex":0.0000797863,"about_ca_system_score_gemma":0.00014480148,"threshold_uncertainty_score":0.99999225},"labels":[],"label_agreement":null},{"id":"W2022598246","doi":"10.1016/j.jsc.2013.04.003","title":"Ideal-specific elimination orders form a star-shaped region","year":2013,"lang":"en","type":"article","venue":"Journal of Symbolic Computation","topic":"Polynomial and algebraic computation","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Google (Canada)","funders":"","keywords":"Mathematics; Ideal (ethics); Star (game theory); Combinatorics; Regular polygon; Polynomial; Discrete mathematics; Mathematical analysis; Geometry","score_opus":0.017350610929681792,"score_gpt":0.2385419214357196,"score_spread":0.2211913105060378,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2022598246","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.36782616,0.00011085594,0.62823707,0.0029065898,0.0005461893,0.00016979007,2.0801961e-7,0.000048850303,0.00015428028],"genre_scores_gemma":[0.97653955,0.000046936384,0.02279524,0.00024432698,0.00031968378,0.0000060247226,0.000004256921,0.000011420811,0.000032569656],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981956,0.00009064941,0.00074808346,0.0002107963,0.0005061472,0.00024871354],"domain_scores_gemma":[0.99804884,0.00016876604,0.0007778318,0.00016063718,0.0006966696,0.00014726768],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00034101782,0.00016495035,0.00026670957,0.00043762822,0.00013570992,0.0003142903,0.00046163308,0.00006831635,0.000018323039],"category_scores_gemma":[0.000046873083,0.0001469352,0.00013770437,0.00057943625,0.000032618238,0.0018605479,0.000081953374,0.00019975677,0.00007102037],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000026597134,0.00019165842,0.00006912935,0.000020406735,0.000036223493,0.000019579536,0.002656738,0.0016337117,0.0026350452,0.018592576,0.0071177203,0.9670006],"study_design_scores_gemma":[0.002970178,0.00085833983,0.05033854,0.00011658127,0.000019287869,0.00046116146,0.00025762967,0.81266004,0.00041008607,0.12849106,0.0030409386,0.00037617536],"about_ca_topic_score_codex":0.000045322515,"about_ca_topic_score_gemma":0.0000027209871,"teacher_disagreement_score":0.96662444,"about_ca_system_score_codex":0.00014967525,"about_ca_system_score_gemma":0.00012115732,"threshold_uncertainty_score":0.5991844},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.02704636221809897,"score_gpt":0.2488634440236337,"score_spread":0.22181708180553472,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2026111379","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00096310006,0.00008678131,0.99720615,0.00029804304,0.00050007855,0.00024339244,0.000010631267,0.0001160483,0.00057575956],"genre_scores_gemma":[0.64853525,0.000009836733,0.34962627,0.00009836917,0.00011285953,0.000015488966,0.0000040537207,0.000007807833,0.001590039],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99905765,0.000024649737,0.00029512984,0.00025422222,0.0001585452,0.00020980183],"domain_scores_gemma":[0.9992644,0.00020056588,0.0001615888,0.00020830428,0.00009963538,0.000065486456],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00013354569,0.00010683943,0.00017904495,0.00024088651,0.00006819304,0.0000573902,0.00035494086,0.00004550971,0.000055567565],"category_scores_gemma":[0.00006584082,0.000094234274,0.00008551764,0.0007824178,0.000015527308,0.00038775304,0.00008665199,0.000033323526,0.000025175674],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000013414118,0.00006979776,0.000010478441,0.0000068813024,0.000016572916,3.3339654e-7,0.00018312027,0.00011276946,0.0017787487,0.0052478863,0.0008212367,0.99175084],"study_design_scores_gemma":[0.0006713602,0.00013440997,0.0025037692,0.000005953809,0.000006223731,0.0000024136918,0.00000426,0.9825968,0.008342587,0.002546638,0.0030220652,0.00016350378],"about_ca_topic_score_codex":0.00008353964,"about_ca_topic_score_gemma":0.0000012047863,"teacher_disagreement_score":0.99158734,"about_ca_system_score_codex":0.000026877085,"about_ca_system_score_gemma":0.00001618915,"threshold_uncertainty_score":0.3842762},"labels":[],"label_agreement":null},{"id":"W2027646475","doi":"10.1016/j.aim.2012.08.009","title":"Nash resolution for binomial varieties as Euclidean division. A priori termination bound, polynomial complexity in essential dimension 2","year":2012,"lang":"en","type":"article","venue":"Advances in Mathematics","topic":"Polynomial and algebraic computation","field":"Computer Science","cited_by":25,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Combinatorics; Euclidean geometry; Dimension (graph theory); Discrete mathematics; Upper and lower bounds; Affine space; Affine transformation; Pure mathematics","score_opus":0.022870839400931844,"score_gpt":0.3053135035405641,"score_spread":0.28244266413963226,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2027646475","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.56203276,0.00044046022,0.43465522,0.00026637127,0.0013474064,0.0005884309,0.0000045093234,0.00008800703,0.00057682156],"genre_scores_gemma":[0.90362066,0.000030957108,0.09594835,0.000051547246,0.00021393788,0.00004371583,0.000013383181,0.000012233464,0.00006523961],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99833,0.00008003281,0.0005551921,0.00029665275,0.00029561968,0.0004424772],"domain_scores_gemma":[0.99892896,0.00040357554,0.00025276575,0.0002844364,0.00005462262,0.00007564961],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00075131917,0.00018817141,0.000278282,0.00023353445,0.00015689938,0.00010995846,0.00039419153,0.00008902804,0.000006275801],"category_scores_gemma":[0.00025116507,0.00018224059,0.000070039896,0.00034078563,0.00010267455,0.0018068458,0.0002476364,0.00013945987,0.000021325986],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00018863702,0.0019806954,0.005505856,0.0005905847,0.000020590282,0.000010119833,0.021767799,0.0029624454,0.0052772886,0.76944304,0.00045334068,0.1917996],"study_design_scores_gemma":[0.0023489948,0.00022972525,0.015528989,0.00022810392,0.000014222323,0.000024495364,0.00033555695,0.44265115,0.0033268917,0.5312067,0.0034897616,0.0006153811],"about_ca_topic_score_codex":0.00003616734,"about_ca_topic_score_gemma":0.000090259746,"teacher_disagreement_score":0.4396887,"about_ca_system_score_codex":0.00017391394,"about_ca_system_score_gemma":0.000064994965,"threshold_uncertainty_score":0.74315554},"labels":[],"label_agreement":null},{"id":"W2027966173","doi":"10.1016/j.jsc.2008.07.002","title":"Algebraic transformation of differential characteristic decompositions from one ranking to another","year":2008,"lang":"en","type":"article","venue":"Journal of Symbolic Computation","topic":"Polynomial and algebraic computation","field":"Computer Science","cited_by":15,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"Natural Sciences and Engineering Research Council of Canada; Russian Foundation for Basic Research; National Science Foundation","keywords":"Mathematics; Ideal (ethics); Canonical form; Ranking (information retrieval); Bounded function; Set (abstract data type); Order (exchange); Differential (mechanical device); Algebraic number; Discrete mathematics; Algebra over a field; Pure mathematics; Mathematical analysis; Computer science; Artificial intelligence","score_opus":0.020177325805018277,"score_gpt":0.24066292839953735,"score_spread":0.22048560259451908,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2027966173","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4929652,0.00002064457,0.50616246,0.00044800315,0.00027124054,0.000074752905,0.0000035860428,0.000016730115,0.000037401376],"genre_scores_gemma":[0.9774132,0.000012365738,0.022142261,0.00016775362,0.00023644381,0.000002124408,0.000012486323,0.000008655035,0.000004725296],"study_design_codex":"design_other","study_design_gemma":"observational","domain_scores_codex":[0.99841374,0.000090401336,0.00077540014,0.00014264871,0.0004265247,0.00015125719],"domain_scores_gemma":[0.9988426,0.00015467714,0.00052879547,0.000116820076,0.000261584,0.000095511736],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00014726789,0.00012694867,0.00033397943,0.00038236316,0.00012256055,0.000054469405,0.00033671057,0.000046581008,0.000023374087],"category_scores_gemma":[0.000022061091,0.00012341207,0.00013964149,0.00038191664,0.00002813905,0.00064608373,0.000041229538,0.00012529369,0.000014687033],"study_design_candidate":"observational","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003521588,0.0012243404,0.0010506086,0.00008503255,0.00040938845,0.000044112017,0.04923401,0.021325694,0.33155292,0.010091361,0.0004239049,0.58420646],"study_design_scores_gemma":[0.003965574,0.00095398223,0.646037,0.0005460456,0.00012922422,0.00036908122,0.000091939226,0.28255662,0.036785625,0.027769014,0.0001973102,0.0005985914],"about_ca_topic_score_codex":0.000037587117,"about_ca_topic_score_gemma":0.0000024564383,"teacher_disagreement_score":0.6449864,"about_ca_system_score_codex":0.000059024806,"about_ca_system_score_gemma":0.000099123856,"threshold_uncertainty_score":0.5032598},"labels":[],"label_agreement":null},{"id":"W2028125708","doi":"10.1016/j.jalgebra.2009.08.012","title":"Irreducibility criteria for skew polynomials","year":2009,"lang":"en","type":"article","venue":"Journal of Algebra","topic":"Polynomial and algebraic computation","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Manitoba; University of Calgary","funders":"","keywords":"Mathematics; Irreducibility; Skew; Commutative property; Polynomial ring; Mathematical proof; Class (philosophy); Pure mathematics; Differential (mechanical device); Polynomial; Differential operator; Discrete mathematics; Algebra over a field; Mathematical analysis; Computer science","score_opus":0.025274106949058676,"score_gpt":0.3051902382399392,"score_spread":0.2799161312908805,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2028125708","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.45469758,0.00036790266,0.5274768,0.015242911,0.0016619425,0.00016718495,0.00000281722,0.000045617136,0.00033729474],"genre_scores_gemma":[0.93100435,0.0000057021175,0.06708526,0.0010685339,0.00073725794,9.825105e-7,5.8873064e-7,0.0000041658805,0.000093161565],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99876386,0.000057172187,0.0005538915,0.00019280639,0.00021022877,0.00022202797],"domain_scores_gemma":[0.9988519,0.00015055192,0.00037557096,0.0002678536,0.00020755114,0.00014657844],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008482342,0.00011450969,0.00027022557,0.00013315606,0.000082403174,0.00017425115,0.0006733615,0.000048568127,0.000017198852],"category_scores_gemma":[0.00019112822,0.00009373361,0.00021769738,0.00018261182,0.000020958258,0.0007501201,0.000043036587,0.00010856876,0.000007768685],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001844755,0.00042699117,0.000085369815,0.000026335954,0.000062834995,0.000027956306,0.0011271352,0.00005830506,0.034479633,0.10408613,0.055305343,0.8041295],"study_design_scores_gemma":[0.0024066258,0.0023093645,0.04398607,0.000099208155,0.00004293638,0.00040574564,0.000027218253,0.008561652,0.030203454,0.88904876,0.022445044,0.0004638948],"about_ca_topic_score_codex":0.0000022003132,"about_ca_topic_score_gemma":4.4586807e-7,"teacher_disagreement_score":0.8036656,"about_ca_system_score_codex":0.000053024738,"about_ca_system_score_gemma":0.0001748512,"threshold_uncertainty_score":0.38223454},"labels":[],"label_agreement":null},{"id":"W2028135642","doi":"10.1145/1148109.1148149","title":"An implementation report for parallel triangular decompositions","year":2006,"lang":"en","type":"article","venue":"","topic":"Polynomial and algebraic computation","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"","keywords":"Polynomial; Computer science; Context (archaeology); Set (abstract data type); Algebraic number; Algebraic geometry; Computation; Theoretical computer science; Set operations; Dimension (graph theory); Algebra over a field; Algorithm; Mathematics; Pure mathematics; Programming language","score_opus":0.013360315048594147,"score_gpt":0.3111718086021763,"score_spread":0.29781149355358216,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2028135642","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.037079982,0.000008668202,0.96024376,0.0012673632,0.00015936836,0.00024246248,0.0000027649342,0.00016958531,0.000826037],"genre_scores_gemma":[0.6449334,2.0529585e-7,0.3541291,0.00018867354,0.00016719289,0.00005496331,0.00023727889,0.0000036831946,0.0002854571],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.999326,0.000018142233,0.00021824254,0.00021291953,0.00008821789,0.00013646495],"domain_scores_gemma":[0.99960065,0.000033095293,0.00006733701,0.0002092525,0.00005062706,0.00003901685],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00015207818,0.00005954882,0.00006475652,0.000053152213,0.0001313261,0.00012082849,0.00018860392,0.000017800163,0.000019840698],"category_scores_gemma":[0.0000026082598,0.00005544503,0.00004886109,0.00010972529,0.0000069508296,0.0004490669,0.000020838594,0.000016298396,0.0000077131435],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000101922205,0.00018021943,0.0005304084,0.000004997091,0.000012411482,0.000023596433,0.00011765156,0.0022675504,0.012589372,0.88362145,0.009992988,0.09064918],"study_design_scores_gemma":[0.0030432218,0.00043833492,0.05093928,0.0000049343216,0.000023520655,0.0002093146,0.00007708935,0.39384001,0.017108865,0.5011948,0.03258021,0.0005404361],"about_ca_topic_score_codex":0.00026395076,"about_ca_topic_score_gemma":0.00014086984,"teacher_disagreement_score":0.6078535,"about_ca_system_score_codex":0.000021308106,"about_ca_system_score_gemma":0.000041237803,"threshold_uncertainty_score":0.22609827},"labels":[],"label_agreement":null},{"id":"W2028993663","doi":"10.1145/1390768.1390796","title":"The complete root classification of a parametric polynomial on an interval","year":2008,"lang":"en","type":"article","venue":"","topic":"Polynomial and algebraic computation","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"","keywords":"Quantifier elimination; Root (linguistics); Parametric statistics; Interval (graph theory); Polynomial; Computation; Mathematics; Algorithm; Discrete mathematics; Computer science; Combinatorics; Statistics; Mathematical analysis","score_opus":0.051089126996550153,"score_gpt":0.268065276542719,"score_spread":0.21697614954616884,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2028993663","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8467001,0.000018807266,0.14882788,0.0012506251,0.00033016287,0.00010544149,0.0000011890431,0.000085364176,0.0026804407],"genre_scores_gemma":[0.9974063,0.0000030869448,0.002198336,0.000114616654,0.00007241319,0.0000050468225,0.0000021126862,0.000003287897,0.00019478578],"study_design_codex":"design_other","study_design_gemma":"observational","domain_scores_codex":[0.9991298,0.000083930194,0.0002308376,0.00020417488,0.00020578016,0.00014548824],"domain_scores_gemma":[0.99915564,0.00024612754,0.000106840715,0.00038192855,0.00005103812,0.000058422473],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00018332686,0.000077305376,0.00009845138,0.00010198842,0.00023070455,0.000050220722,0.00065076415,0.000025800493,0.0000046549253],"category_scores_gemma":[0.000042496977,0.000050422204,0.000054451826,0.00041488023,0.00008288833,0.00021428688,0.000082437575,0.00007422889,0.000041614734],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00011421087,0.00042647892,0.0022510656,0.0000059989957,0.000032182586,0.000005910819,0.0010247685,0.00053034205,0.0056521324,0.33183256,0.0069947606,0.6511296],"study_design_scores_gemma":[0.0004943253,0.0006755033,0.5257083,0.000007295286,0.0000030058177,0.00002707261,0.000030277513,0.46212393,0.0021032088,0.0028362223,0.005816118,0.00017474989],"about_ca_topic_score_codex":0.00006690258,"about_ca_topic_score_gemma":0.000033915225,"teacher_disagreement_score":0.65095484,"about_ca_system_score_codex":0.000026497164,"about_ca_system_score_gemma":0.00005299642,"threshold_uncertainty_score":0.20561579},"labels":[],"label_agreement":null},{"id":"W2029184018","doi":"10.1016/j.jsc.2002.04.001","title":"Foreword to the special issue on Applications of computer algebra","year":2005,"lang":"en","type":"article","venue":"Journal of Symbolic Computation","topic":"Polynomial and algebraic computation","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Wilfrid Laurier University","funders":"","keywords":"Mathematics; Algebra over a field; Symbolic computation; Mathematics education; Pure mathematics; Mathematical analysis","score_opus":0.00947932950131616,"score_gpt":0.25557740186108635,"score_spread":0.2460980723597702,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2029184018","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.046963017,0.00003683464,0.93964326,0.0116361,0.00075562525,0.00027696058,0.0000028449308,0.000024024424,0.00066135544],"genre_scores_gemma":[0.9130077,0.0000065085756,0.06955607,0.0016811258,0.01563387,0.000007970593,0.0000019623933,0.0000100115385,0.00009479876],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984616,0.00007515006,0.0006504181,0.00017148303,0.00047108615,0.00017024635],"domain_scores_gemma":[0.99862164,0.00022895566,0.0005063985,0.00022059312,0.0003082615,0.00011415226],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00042357505,0.00012929982,0.000242319,0.00030329806,0.00011497186,0.000075184755,0.0007423682,0.0000405859,0.00002058286],"category_scores_gemma":[0.000020095395,0.00009382421,0.00013636518,0.0006200821,0.000030391195,0.00031798118,0.000117180985,0.0001747342,0.00011835758],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001838469,0.00010758797,0.000017604745,0.0000056721856,0.000021668497,0.0000011551579,0.0015261717,0.063531846,0.000049283142,0.013960025,0.018894123,0.9018665],"study_design_scores_gemma":[0.001628516,0.0014256756,0.028454972,0.00016774485,0.00004855298,0.00020423098,0.00011096846,0.5427668,0.0027896261,0.023390792,0.39856339,0.0004487135],"about_ca_topic_score_codex":0.0000054245534,"about_ca_topic_score_gemma":0.0000070511564,"teacher_disagreement_score":0.9014178,"about_ca_system_score_codex":0.000070761234,"about_ca_system_score_gemma":0.00009437892,"threshold_uncertainty_score":0.38260403},"labels":[],"label_agreement":null},{"id":"W2031855337","doi":"10.1090/s0025-5718-07-01935-7","title":"A fast, rigorous technique for computing the regulator of a real quadratic field","year":2007,"lang":"en","type":"article","venue":"Mathematics of Computation","topic":"Polynomial and algebraic computation","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Correctness; Mathematics; Regulator; Computation; Quadratic equation; Field (mathematics); Linear-quadratic regulator; Algorithm; Applied mathematics; Discrete mathematics; Mathematical optimization; Optimal control; Pure mathematics; Geometry","score_opus":0.014460199964147312,"score_gpt":0.27954016659564385,"score_spread":0.2650799666314965,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2031855337","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12906998,0.000012736103,0.869544,0.00021741053,0.000108038555,0.00056398724,0.0000012022386,0.000052369272,0.0004302712],"genre_scores_gemma":[0.6297257,4.8964546e-7,0.37018916,0.000026882302,0.00003380503,0.0000066001835,0.000001677911,0.000005476059,0.000010229228],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99875945,0.000031277392,0.0006338894,0.00015602811,0.00024969087,0.00016968521],"domain_scores_gemma":[0.99738246,0.0015935139,0.00053316395,0.00025278825,0.00020553466,0.000032520216],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011019888,0.00011043974,0.00023824535,0.00011564861,0.00008846293,0.000031139894,0.00042385727,0.00004963805,6.772017e-7],"category_scores_gemma":[0.00011708932,0.000084912965,0.00009950087,0.00030284305,0.000046005243,0.00011887997,0.000101074766,0.00006441568,9.970821e-7],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000054703432,0.0005060183,0.00007385909,0.0011501276,0.0000918666,0.000002603113,0.015870884,0.011988678,0.03634926,0.62108815,0.0005806707,0.3122432],"study_design_scores_gemma":[0.00032947975,0.000279577,0.0007640942,0.00014279915,0.00001678331,0.000015707836,0.00015685846,0.6952583,0.09036453,0.21253431,0.00001233088,0.00012519895],"about_ca_topic_score_codex":0.000027542768,"about_ca_topic_score_gemma":0.0000077778295,"teacher_disagreement_score":0.6832697,"about_ca_system_score_codex":0.000021434254,"about_ca_system_score_gemma":0.000053007738,"threshold_uncertainty_score":0.34626502},"labels":[],"label_agreement":null},{"id":"W2033362684","doi":"10.1142/s1793042111004198","title":"SIMULTANEOUS ARITHMETIC PROGRESSIONS ON ALGEBRAIC CURVES","year":2011,"lang":"en","type":"article","venue":"International Journal of Number Theory","topic":"Polynomial and algebraic computation","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Algebraic curve; Upper and lower bounds; Elliptic curve; Algebraic number; Arithmetic progression; Jacobian curve; Simple (philosophy); Stable curve","score_opus":0.018973637355927418,"score_gpt":0.27637134343375663,"score_spread":0.2573977060778292,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2033362684","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.21114302,0.0012357546,0.69621116,0.008442818,0.013643882,0.0004338371,0.00006087866,0.00032346576,0.06850517],"genre_scores_gemma":[0.9872346,0.00004304973,0.010484764,0.0015565521,0.00029019616,0.0000027067213,0.0000023773412,0.000008016058,0.00037775424],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987306,0.00013081872,0.00035753963,0.00013762062,0.00050897716,0.0001344518],"domain_scores_gemma":[0.99845505,0.0006010254,0.0003374041,0.00015212485,0.00035206391,0.000102344246],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004029328,0.00010799324,0.00013338406,0.00013484324,0.000042977306,0.0000590087,0.0012297622,0.000033081837,0.00078779773],"category_scores_gemma":[0.00039749342,0.00008225767,0.00012784814,0.00011772173,0.000054986474,0.00037104494,0.00013380982,0.00019621402,0.0001797605],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00025530235,0.00086812745,0.0004407966,0.000014366933,0.00033194592,0.001226741,0.0019833378,0.00012815563,0.000151712,0.47416028,0.009478499,0.51096076],"study_design_scores_gemma":[0.0014399252,0.00061268767,0.0054272846,0.0017056357,0.0000430503,0.0031820291,0.00009338742,0.0062134094,0.003654796,0.96189946,0.0152345495,0.00049375807],"about_ca_topic_score_codex":0.0000028699515,"about_ca_topic_score_gemma":5.928943e-7,"teacher_disagreement_score":0.7760916,"about_ca_system_score_codex":0.000047729318,"about_ca_system_score_gemma":0.000091934126,"threshold_uncertainty_score":0.8625833},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Univerza v Ljubljani","keywords":"Mathematics; Combinatorics; Generating function; Algorithm","score_opus":0.02481368113949652,"score_gpt":0.2568352382709909,"score_spread":0.2320215571314944,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2034438073","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0024119224,0.00003149565,0.99377054,0.0027262045,0.00016432165,0.00041909044,0.000024978966,0.000042299052,0.00040913804],"genre_scores_gemma":[0.4083096,0.0000030582592,0.59004295,0.00032263057,0.00018408106,0.00028020228,0.000008965978,0.000011434406,0.00083710166],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993048,0.000013354231,0.0002412314,0.00015641746,0.0001644171,0.00011978845],"domain_scores_gemma":[0.99907255,0.00039364665,0.00007441311,0.00033304896,0.000081165344,0.000045158475],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00019594945,0.000077243865,0.00011234699,0.000034158304,0.00013108429,0.000057267924,0.00032688788,0.00002154403,0.000033506203],"category_scores_gemma":[0.000078152676,0.00005238328,0.00008415926,0.00020774188,0.0000309171,0.0001136281,0.00009699383,0.000035668585,0.000031028],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000075936578,0.0004584239,0.000021245985,0.00017406692,0.000082138475,4.7148805e-7,0.0100597525,0.00193548,0.0019378304,0.31727284,0.016166292,0.6518839],"study_design_scores_gemma":[0.00012506751,0.00005679132,0.00017573881,0.00001106567,0.000010595174,0.0000030399644,0.000088148954,0.9675554,0.00047402232,0.026746824,0.0046711764,0.00008215445],"about_ca_topic_score_codex":0.0000037611396,"about_ca_topic_score_gemma":0.0000018638981,"teacher_disagreement_score":0.9656199,"about_ca_system_score_codex":0.0000147043265,"about_ca_system_score_gemma":0.000011015165,"threshold_uncertainty_score":0.21361281},"labels":[],"label_agreement":null},{"id":"W2037471193","doi":"10.1145/2465506.2465955","title":"Computing the invariant structure of integer matrices","year":2013,"lang":"en","type":"article","venue":"","topic":"Polynomial and algebraic computation","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Invariant (physics); Integer (computer science); Computer science; Mathematics; Discrete mathematics; Programming language","score_opus":0.007696722465116022,"score_gpt":0.21025029782903265,"score_spread":0.20255357536391663,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2037471193","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3851591,0.000044998047,0.6106708,0.002146326,0.000221365,0.00011018761,3.4561208e-7,0.000057711244,0.0015891744],"genre_scores_gemma":[0.98242223,7.1907687e-7,0.017031355,0.0004184452,0.00005078244,4.5953018e-7,3.5103412e-7,0.0000016902139,0.00007395348],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995023,0.000029821786,0.00014557078,0.00011236719,0.0001083757,0.00010153674],"domain_scores_gemma":[0.999536,0.00012400118,0.00007459129,0.00018958359,0.00005156332,0.000024273959],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000063332904,0.000054985514,0.00007037661,0.00003316836,0.00005745106,0.00009991056,0.0005558294,0.000018686003,0.000090984424],"category_scores_gemma":[0.000013803916,0.000028893699,0.000026844718,0.00021572846,0.000025128526,0.00023692615,0.00023278153,0.00006061881,0.000034301018],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000014767688,0.000032041717,0.00080498494,0.000022774251,0.000031731302,0.0000012266839,0.0028261365,0.0016148591,0.02043116,0.620583,0.008716218,0.34493437],"study_design_scores_gemma":[0.00019191031,0.000046298854,0.034085575,0.00001907962,0.000004104978,0.000019529543,0.00013130602,0.86019325,0.014725221,0.08990052,0.0005242814,0.00015894494],"about_ca_topic_score_codex":0.00037398603,"about_ca_topic_score_gemma":0.000009282726,"teacher_disagreement_score":0.8585784,"about_ca_system_score_codex":0.0000056796575,"about_ca_system_score_gemma":0.000023214085,"threshold_uncertainty_score":0.11782508},"labels":[],"label_agreement":null},{"id":"W2038007116","doi":"10.1016/j.laa.2008.12.026","title":"A closed formula for the product in simple integral extensions","year":2009,"lang":"en","type":"article","venue":"Linear Algebra and its Applications","topic":"Polynomial and algebraic computation","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Regina","funders":"","keywords":"Mathematics; Simple (philosophy); BETA (programming language); Product (mathematics); Algebraic number; Alpha (finance); Matrix (chemical analysis); Polynomial; Combinatorics; Pure mathematics; Algebra over a field; Discrete mathematics; Mathematical analysis; Geometry","score_opus":0.01757062081658955,"score_gpt":0.27496980036420643,"score_spread":0.2573991795476169,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2038007116","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07206098,0.00084619335,0.90646434,0.01862421,0.00006591624,0.0015921572,0.00001086225,0.00013228701,0.00020308245],"genre_scores_gemma":[0.989841,0.00003952625,0.008639894,0.0009426903,0.00016922133,0.00022066844,0.000012880348,0.0000042695174,0.00012989058],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992908,0.000011995198,0.00017865325,0.00026912574,0.000072501396,0.0001768969],"domain_scores_gemma":[0.9993837,0.00018213358,0.000044997614,0.00027798387,0.000060241247,0.00005098507],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00013279625,0.000088646964,0.00009559321,0.000057749676,0.00022759713,0.000062033374,0.00031710957,0.00002580683,0.000001978783],"category_scores_gemma":[0.000046080808,0.00006101641,0.00004008489,0.0003553686,0.00001773827,0.00017534789,0.00005583034,0.00008827199,0.000010234221],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000005546924,0.000078849924,0.00002167383,0.0000048968864,0.0000045582256,2.2577538e-7,0.00031118887,0.00009049925,0.001539327,0.5620196,0.00062006415,0.43530354],"study_design_scores_gemma":[0.000704298,0.00012876888,0.025399951,0.000012196199,0.00001497633,0.000010460056,0.000047572426,0.65992594,0.0026923118,0.23583639,0.074976325,0.00025084426],"about_ca_topic_score_codex":0.0000106663865,"about_ca_topic_score_gemma":0.000016464104,"teacher_disagreement_score":0.91778,"about_ca_system_score_codex":0.000010180183,"about_ca_system_score_gemma":0.000038198843,"threshold_uncertainty_score":0.2488177},"labels":[],"label_agreement":null},{"id":"W2038770474","doi":"10.1145/1277548.1277575","title":"A sparse modular GCD algorithm for polynomials over algebraic function fields","year":2007,"lang":"en","type":"article","venue":"","topic":"Polynomial and algebraic computation","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Algorithm; Greatest common divisor; Algebraic number; Field (mathematics); Las vegas; Modular design; Function (biology); Mathematics; Computer science; Algebraic function; Modular arithmetic; Divisor (algebraic geometry); Sparse matrix; Discrete mathematics; Pure mathematics; Physics; Cryptography","score_opus":0.014420296001024718,"score_gpt":0.24804026753021427,"score_spread":0.23361997152918956,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2038770474","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.035739403,0.00007206212,0.96041876,0.0005310427,0.0013134603,0.0003038584,0.000002602887,0.00026515583,0.0013536559],"genre_scores_gemma":[0.8209652,0.0000032528192,0.17322925,0.0026626613,0.0007795206,0.000024274541,0.000011423534,0.000015044626,0.002309376],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986346,0.00002074225,0.00031483802,0.00041387673,0.00020822848,0.0004077086],"domain_scores_gemma":[0.9991731,0.00019658067,0.00008988736,0.00033640553,0.000066783185,0.00013726616],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005495371,0.00016047248,0.00017207775,0.00015252773,0.00014317255,0.00013002103,0.00038273612,0.00011151598,0.00006230787],"category_scores_gemma":[0.00002706255,0.00014506784,0.0001345908,0.0002813371,0.000022216804,0.0005009672,0.0001258161,0.00008679084,0.00005801228],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000016738884,0.000057464644,0.00003055656,0.0000054699467,0.000024275729,0.000004194887,0.000109703244,0.000094133975,0.0012078664,0.040437564,0.005131806,0.9528802],"study_design_scores_gemma":[0.0019165016,0.0005363745,0.012808805,0.000016622058,0.00002722245,0.000022710718,0.00003124976,0.84935474,0.0148859965,0.08323409,0.036546078,0.00061958923],"about_ca_topic_score_codex":0.00009861802,"about_ca_topic_score_gemma":0.00004248312,"teacher_disagreement_score":0.9522606,"about_ca_system_score_codex":0.000045875873,"about_ca_system_score_gemma":0.000054915567,"threshold_uncertainty_score":0.5915695},"labels":[],"label_agreement":null},{"id":"W2039345231","doi":"10.1016/j.jfa.2009.09.023","title":"Intersections of Schubert varieties and eigenvalue inequalities in an arbitrary finite factor","year":2009,"lang":"en","type":"article","venue":"Journal of Functional Analysis","topic":"Polynomial and algebraic computation","field":"Computer Science","cited_by":27,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"","keywords":"Mathematics; Ultraproduct; Eigenvalues and eigenvectors; Embedding; Pure mathematics; Factor (programming language); Inequality; Algebra over a field; Mathematical analysis","score_opus":0.02761572254709462,"score_gpt":0.2504690780764174,"score_spread":0.22285335552932276,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2039345231","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.69198865,0.00011598827,0.3071951,0.0004987884,0.000115242685,0.0000133107005,0.0000028346544,0.000006348525,0.00006375237],"genre_scores_gemma":[0.9959404,0.000020285732,0.0037038592,0.00018577954,0.000095279654,3.5810007e-7,0.0000028116956,0.0000014590789,0.00004975524],"study_design_codex":"simulation_or_modeling","study_design_gemma":"observational","domain_scores_codex":[0.9989917,0.00008271779,0.00046567523,0.00011503596,0.0002577109,0.000087161454],"domain_scores_gemma":[0.9992323,0.00015586523,0.00026879186,0.00009626822,0.00017919726,0.00006761398],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00025058593,0.00007929373,0.00025319197,0.00085135363,0.000048821086,0.000059997954,0.00015816725,0.000033604694,0.000031870615],"category_scores_gemma":[0.00005065873,0.00006526811,0.00016253066,0.0008432495,0.000031647036,0.00081782823,0.000026176313,0.00014000073,5.956836e-7],"study_design_candidate":"observational","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0008941773,0.0024149988,0.25587836,0.000076683296,0.004148837,0.0001016582,0.021334846,0.2889544,0.018460905,0.2423347,0.00047196896,0.16492847],"study_design_scores_gemma":[0.00035318057,0.00053771643,0.8232499,0.000016518525,0.00013424385,0.00002793742,0.00028364186,0.1251838,0.00043142788,0.04960241,0.00005610409,0.00012312864],"about_ca_topic_score_codex":0.00005188692,"about_ca_topic_score_gemma":0.000048041493,"teacher_disagreement_score":0.56737155,"about_ca_system_score_codex":0.000029434952,"about_ca_system_score_gemma":0.00007923737,"threshold_uncertainty_score":0.26615563},"labels":[],"label_agreement":null},{"id":"W2040416064","doi":"10.1145/1394042.1394090","title":"Automatic variable order selection for polynomial system solving (abstract only)","year":2008,"lang":"en","type":"article","venue":"ACM communications in computer algebra","topic":"Polynomial and algebraic computation","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University; University of Waterloo","funders":"","keywords":"Solver; Weighting; Variable (mathematics); Dependency (UML); Polynomial; Computer science; Computation; Variable elimination; Graph; System of polynomial equations; Applied mathematics; Decomposition; Basis (linear algebra); Mathematical optimization; Mathematics; Algebra over a field; Theoretical computer science; Algorithm; Pure mathematics; Artificial intelligence; Inference","score_opus":0.03329260327179587,"score_gpt":0.27392579266457423,"score_spread":0.24063318939277836,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2040416064","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0914432,0.0001750996,0.90434074,0.0014580358,0.00072574714,0.0006407242,0.000004724257,0.0007571013,0.00045462494],"genre_scores_gemma":[0.51445955,0.000014248844,0.48503593,0.00018950149,0.00014314939,0.00009109261,0.000020933758,0.000015616548,0.000029986773],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9978828,0.00017195762,0.000727908,0.0005093623,0.00023528816,0.00047272822],"domain_scores_gemma":[0.99570554,0.0012154884,0.00025832813,0.002479068,0.00023547556,0.000106118765],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00056264276,0.00026013568,0.0003516099,0.00037709385,0.00079402025,0.00021263346,0.0039875642,0.00013124313,0.0000096017075],"category_scores_gemma":[0.00014149207,0.00028215672,0.000104478764,0.0012584878,0.00009960942,0.0009104431,0.0015652236,0.00032678386,0.00004938915],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000040136958,0.0015040449,0.007736146,0.00040211238,0.00026382034,0.000015107584,0.00563495,0.008824261,0.001411546,0.3093933,0.01658979,0.6481848],"study_design_scores_gemma":[0.0008241216,0.00008243834,0.011648437,0.00011791725,0.000009944942,0.0001899975,0.000016300066,0.98108625,0.000071606955,0.003217681,0.002407068,0.00032821065],"about_ca_topic_score_codex":0.00029408155,"about_ca_topic_score_gemma":0.00010017633,"teacher_disagreement_score":0.972262,"about_ca_system_score_codex":0.00031445513,"about_ca_system_score_gemma":0.0005145346,"threshold_uncertainty_score":0.99996305},"labels":[],"label_agreement":null},{"id":"W2040516344","doi":"10.1016/s0747-7171(03)00071-3","title":"Efficient decomposition of separable algebras","year":2003,"lang":"en","type":"article","venue":"Journal of Symbolic Computation","topic":"Polynomial and algebraic computation","field":"Computer Science","cited_by":16,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo; University of Calgary","funders":"","keywords":"Mathematics; Algebra over a field; Factorization of polynomials; Separable space; Polynomial; Generator (circuit theory); Simple (philosophy); Computation; Factorization; Pure mathematics; Matrix polynomial; Algorithm; Power (physics)","score_opus":0.009798005884001877,"score_gpt":0.2656074410536992,"score_spread":0.25580943516969734,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2040516344","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.48488006,0.00014460694,0.51383084,0.000114589566,0.00040360587,0.000050718194,2.9838472e-7,0.00001362737,0.00056163827],"genre_scores_gemma":[0.95737094,0.0000059517474,0.042476818,0.00006257019,0.00006415824,7.68722e-7,8.164975e-7,0.0000056097015,0.000012375113],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998517,0.0001433922,0.0006544402,0.00013595214,0.00039032535,0.0001589207],"domain_scores_gemma":[0.99858683,0.00015793959,0.0006875352,0.000120474026,0.00035320816,0.00009398886],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00058854703,0.00010938518,0.00025950986,0.00030526522,0.000069862486,0.00005573518,0.00026719074,0.00004239125,0.000008964839],"category_scores_gemma":[0.00006061095,0.00009934609,0.00013467303,0.00049510156,0.000028250037,0.00021782676,0.00003346136,0.00011521895,0.000010203668],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004385615,0.0006067848,0.00065537624,0.00006367256,0.00010597954,0.000027278342,0.0026585977,0.73720926,0.023106886,0.14159265,0.0008388917,0.09309074],"study_design_scores_gemma":[0.002336819,0.0007190859,0.028520184,0.00021342303,0.000055712106,0.0007724552,0.00011616204,0.8434196,0.029085856,0.09370326,0.0006776543,0.00037976852],"about_ca_topic_score_codex":0.0000059507383,"about_ca_topic_score_gemma":4.6845616e-7,"teacher_disagreement_score":0.47249088,"about_ca_system_score_codex":0.00006444023,"about_ca_system_score_gemma":0.00016749543,"threshold_uncertainty_score":0.40512162},"labels":[],"label_agreement":null},{"id":"W2041753316","doi":"10.1145/1145768.1145809","title":"Rational simplification modulo a polynomial ideal","year":2006,"lang":"en","type":"article","venue":"","topic":"Polynomial and algebraic computation","field":"Computer Science","cited_by":18,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Modulo; Ideal (ethics); Monomial; Maple; Mathematics; Expression (computer science); Gröbner basis; Monomial basis; Polynomial; Polynomial ring; Discrete mathematics; Order (exchange); Algebra over a field; Algorithm; Pure mathematics; Computer science","score_opus":0.00917349486277068,"score_gpt":0.2207842904409234,"score_spread":0.2116107955781527,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2041753316","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07092753,0.000018566885,0.91344166,0.0028117641,0.00026928555,0.00008297557,0.000001273207,0.00022940966,0.012217548],"genre_scores_gemma":[0.9734116,3.4384863e-7,0.024720598,0.00032216788,0.00037146895,0.0000086471255,0.000017388465,0.0000032409907,0.0011445117],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992487,0.000020918795,0.00018175591,0.00023124786,0.00016920001,0.00014818486],"domain_scores_gemma":[0.99964535,0.000043297252,0.000050545274,0.00017993644,0.00004217758,0.00003866446],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00009311899,0.00007441236,0.00006399458,0.00006666109,0.00010173666,0.00013596796,0.0002841993,0.000029824834,0.00003100338],"category_scores_gemma":[0.000007244474,0.000068022135,0.000039171457,0.00019048736,0.000016750226,0.0003994995,0.00006620478,0.000041287174,0.0001584207],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000067818237,0.00008945234,0.0004571008,0.0000026078492,0.000005201266,0.0000023147109,0.000060127975,0.0028195418,0.01480808,0.85782474,0.047782246,0.07614178],"study_design_scores_gemma":[0.00072068407,0.00005602441,0.09958532,0.0000036516142,0.0000035879366,0.000023919058,0.0000058536075,0.7545733,0.013234054,0.110110894,0.02133472,0.0003480098],"about_ca_topic_score_codex":0.00024361382,"about_ca_topic_score_gemma":0.000032795695,"teacher_disagreement_score":0.9024841,"about_ca_system_score_codex":0.000033045813,"about_ca_system_score_gemma":0.00006585053,"threshold_uncertainty_score":0.27738622},"labels":[],"label_agreement":null},{"id":"W2043428776","doi":"10.1016/j.jcss.2010.08.010","title":"The set of realizations of a max-plus linear sequence is semi-polyhedral","year":2010,"lang":"en","type":"article","venue":"Journal of Computer and System Sciences","topic":"Polynomial and algebraic computation","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Mathematics; Sequence (biology); Commutative property; Idempotence; Realization (probability); Minimal realization; Set (abstract data type); Combinatorics; Finite set; Dimension (graph theory); Discrete mathematics; Linear system; Computer science; Mathematical analysis","score_opus":0.027516310816995872,"score_gpt":0.28420510693619794,"score_spread":0.2566887961192021,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2043428776","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.56316847,0.00023578914,0.4334615,0.0012332624,0.0015482479,0.00007881429,0.0000045578,0.000013406374,0.0002559635],"genre_scores_gemma":[0.98270726,0.000019502657,0.016974336,0.000044744666,0.00023109419,4.3678205e-7,1.1391639e-7,0.0000018051973,0.00002073363],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99860716,0.000083208506,0.0005925341,0.00013514537,0.00043987928,0.00014206012],"domain_scores_gemma":[0.9985504,0.00025758598,0.00065289007,0.00017472154,0.0002813737,0.000083019535],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012634346,0.00008214239,0.0002326312,0.00012955363,0.00023610536,0.00013460903,0.0009401198,0.00003523149,9.488174e-7],"category_scores_gemma":[0.000020895153,0.0000478145,0.00008026606,0.00045371617,0.00030759495,0.00042890885,0.00015106275,0.00011722523,6.0844604e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007292042,0.00013762517,0.010310756,0.0005591808,0.00020457048,0.000059842856,0.035607927,0.012455286,0.02644249,0.63552696,0.005352762,0.27326965],"study_design_scores_gemma":[0.00032428262,0.00039493662,0.0031165099,0.00019524251,0.000011391777,0.00069755677,0.00025881323,0.9884436,0.002654349,0.0027908476,0.0010025064,0.00010997851],"about_ca_topic_score_codex":0.000041394946,"about_ca_topic_score_gemma":0.000008480287,"teacher_disagreement_score":0.97598827,"about_ca_system_score_codex":0.000010831962,"about_ca_system_score_gemma":0.00027878338,"threshold_uncertainty_score":0.19498187},"labels":[],"label_agreement":null},{"id":"W2043439285","doi":"10.1080/10586458.2004.10504524","title":"The Waring Loci of Ternary Quartics","year":2004,"lang":"en","type":"article","venue":"Experimental Mathematics","topic":"Polynomial and algebraic computation","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"University of Michigan","keywords":"Mathematics; Ternary operation; Combinatorics; Computer science; Programming language","score_opus":0.013703163256038079,"score_gpt":0.255768804731234,"score_spread":0.2420656414751959,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2043439285","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5804717,0.0003835725,0.41679928,0.00041059128,0.00024644824,0.00011386589,3.621268e-7,0.00007641628,0.0014977404],"genre_scores_gemma":[0.9321274,0.0000031207958,0.06774488,0.000034243552,0.000030480298,0.000005665948,2.7019544e-7,0.0000046954715,0.00004921836],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9993792,0.000008509759,0.00021532217,0.000094349256,0.00017429076,0.00012830825],"domain_scores_gemma":[0.99954355,0.000060512106,0.00009128471,0.00025536938,0.000014858175,0.000034412038],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0000951476,0.000071026894,0.00008332447,0.000018070814,0.00011081316,0.000056266043,0.00043146525,0.000016853692,0.0000021559515],"category_scores_gemma":[0.000011960497,0.000049312464,0.00004464243,0.00009346809,0.000052688327,0.00013498895,0.00018237019,0.000041525855,0.000025938245],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000032567004,0.00038752376,0.000019573574,0.00002280248,0.00002169753,0.000006125217,0.014380298,0.00063040905,0.056201167,0.92132616,0.00011878273,0.006882222],"study_design_scores_gemma":[0.00045708718,0.00015480467,0.00011078435,0.000043837557,0.0000031037673,0.0000281148,0.0011050464,0.04042338,0.79688,0.16042906,0.00021699994,0.00014775647],"about_ca_topic_score_codex":0.000011247071,"about_ca_topic_score_gemma":8.6188066e-7,"teacher_disagreement_score":0.7608971,"about_ca_system_score_codex":0.00003999454,"about_ca_system_score_gemma":0.00002507377,"threshold_uncertainty_score":0.2010904},"labels":[],"label_agreement":null},{"id":"W2043679401","doi":"10.1145/2429135.2429157","title":"On the complexity of computing certain resultants","year":2013,"lang":"en","type":"article","venue":"ACM communications in computer algebra","topic":"Polynomial and algebraic computation","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"","keywords":"Computer science; Mathematics; Algebra over a field; Pure mathematics","score_opus":0.07873152433325852,"score_gpt":0.3010978102388472,"score_spread":0.22236628590558866,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2043679401","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.48292676,0.0001326701,0.46524522,0.04811154,0.00039756054,0.00087451993,0.000005307638,0.00025159967,0.0020548522],"genre_scores_gemma":[0.8293745,0.000014366276,0.16923527,0.0012848024,0.000036333116,0.000026010955,0.000008521522,0.000009100267,0.000011104005],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9978264,0.00054448564,0.0006579157,0.00035625932,0.0002902095,0.00032475026],"domain_scores_gemma":[0.99182373,0.0030552857,0.00027080358,0.0046015372,0.00018022499,0.000068442874],"candidate_categories":["open_science"],"consensus_categories":[],"category_scores_codex":[0.00064932613,0.00019769583,0.00027184456,0.00021351043,0.00031513014,0.00017731347,0.00753443,0.00006287485,0.000024844067],"category_scores_gemma":[0.0002715159,0.00015373332,0.00008985645,0.0010135677,0.000505599,0.000366638,0.0038232226,0.00040308296,0.00013889483],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000003135821,0.00026344237,0.00043585815,0.000008487319,0.00002326624,9.1120944e-7,0.0018583693,0.00075313513,0.00014934453,0.86807215,0.0029389984,0.12549293],"study_design_scores_gemma":[0.00031502912,0.0000669956,0.04426405,0.000081368584,0.0000021352778,0.0000050415274,0.000029636387,0.5841047,0.00019760783,0.37060508,0.0001625837,0.0001657773],"about_ca_topic_score_codex":0.00044028694,"about_ca_topic_score_gemma":0.00005783638,"teacher_disagreement_score":0.58335155,"about_ca_system_score_codex":0.00006610396,"about_ca_system_score_gemma":0.000070958384,"threshold_uncertainty_score":0.9978353},"labels":[],"label_agreement":null},{"id":"W2043879721","doi":"10.1145/2733693.2733709","title":"Fraction-Free Factoring Revisited","year":2015,"lang":"en","type":"article","venue":"ACM communications in computer algebra","topic":"Polynomial and algebraic computation","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"","keywords":"Fraction (chemistry); Univariate; Gaussian elimination; Mathematics; Factoring; Matrix (chemical analysis); Gaussian; Algorithm; Computer science; Applied mathematics; Algebra over a field; Pure mathematics; Statistics; Multivariate statistics","score_opus":0.07127638644566496,"score_gpt":0.3133354543455222,"score_spread":0.2420590678998572,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2043879721","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.029971102,0.00074892124,0.95456296,0.011393071,0.00060238986,0.0002751862,0.000003225601,0.0005587348,0.0018843795],"genre_scores_gemma":[0.5618718,0.00005350605,0.4370445,0.0007912941,0.00014926842,0.00002844992,0.000020457623,0.000012157614,0.000028520477],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99826646,0.0002423732,0.00047752328,0.0004020235,0.00030682146,0.00030481193],"domain_scores_gemma":[0.99256307,0.0006116526,0.0001553317,0.0063216104,0.0001749481,0.00017338035],"candidate_categories":["open_science"],"consensus_categories":[],"category_scores_codex":[0.00056316133,0.00019035388,0.0002442595,0.00032098885,0.00017504818,0.00028309907,0.008044798,0.0000812023,0.0000054704833],"category_scores_gemma":[0.00033659488,0.00020109072,0.00007123693,0.0010558956,0.00007205888,0.0010970958,0.005992223,0.00038077938,0.0001428235],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000014479953,0.0005915189,0.012340584,0.000023431998,0.0000720768,0.000020513377,0.0050392738,0.0014422458,0.00012335242,0.27011093,0.019663528,0.6905581],"study_design_scores_gemma":[0.001909685,0.00013865864,0.03501666,0.0001362858,0.000010878841,0.00005284574,0.00005379731,0.5532196,0.0001828366,0.33975783,0.06880954,0.0007113578],"about_ca_topic_score_codex":0.00014053972,"about_ca_topic_score_gemma":0.000025755191,"teacher_disagreement_score":0.6898467,"about_ca_system_score_codex":0.00021136798,"about_ca_system_score_gemma":0.00014208684,"threshold_uncertainty_score":0.99732214},"labels":[],"label_agreement":null},{"id":"W2044659244","doi":"10.1017/s1474748012000692","title":"Extensions of differential representations of<b>SL</b><sub>2</sub>and tori","year":2012,"lang":"en","type":"article","venue":"Journal of the Institute of Mathematics of Jussieu","topic":"Polynomial and algebraic computation","field":"Computer Science","cited_by":13,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"","keywords":"Mathematics; Differential algebraic geometry; Differential (mechanical device); Pure mathematics; Torus; Algebraic differential equation; Representation theory; Algebraic number; Algebra over a field; Representation (politics); Discrete mathematics; Differential equation; Differential algebraic equation; Mathematical analysis; Ordinary differential equation","score_opus":0.01979554554997945,"score_gpt":0.2548390062033552,"score_spread":0.23504346065337575,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2044659244","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.90750676,0.00017176924,0.09070271,0.0003274476,0.0010432617,0.000082732586,0.0000042839506,0.0000036022006,0.00015743794],"genre_scores_gemma":[0.96744865,0.0000369787,0.03239176,0.000008520788,0.00009766481,5.234991e-7,2.0765044e-7,0.000004456435,0.000011256051],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99849755,0.000040633488,0.0008610601,0.000066059496,0.00042318655,0.000111501155],"domain_scores_gemma":[0.9976133,0.00019235564,0.0015285162,0.0003371132,0.0002550642,0.000073615345],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00038897252,0.00009373188,0.00037744924,0.00013285804,0.000050261093,0.000010981228,0.0005571396,0.00004237367,0.000002016477],"category_scores_gemma":[0.00029470716,0.000060525934,0.00020264352,0.00020950215,0.00017122374,0.00047871016,0.00025814748,0.00011008652,4.5704263e-7],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003600333,0.0015218495,0.0011004717,0.0007026484,0.00029576197,0.0000027381263,0.0069231153,0.0016533445,0.79685235,0.17467868,0.00074460125,0.01548844],"study_design_scores_gemma":[0.0012833016,0.0002380239,0.031954974,0.001236769,0.0002942893,0.00022406148,0.00027952687,0.00832696,0.900549,0.055297285,0.00011378939,0.00020200653],"about_ca_topic_score_codex":0.0000089416535,"about_ca_topic_score_gemma":0.0000023724187,"teacher_disagreement_score":0.119381405,"about_ca_system_score_codex":0.000012665196,"about_ca_system_score_gemma":0.00010628189,"threshold_uncertainty_score":0.24681759},"labels":[],"label_agreement":null},{"id":"W2046580591","doi":"10.1145/2608628.2608675","title":"Solving higher order linear differential equations having elliptic function coefficients","year":2014,"lang":"en","type":"article","venue":"","topic":"Polynomial and algebraic computation","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Mathematics; Ansatz; Linear differential equation; Order (exchange); Ode; Function (biology); Gravitational singularity; Differential operator; Ordinary differential equation; Differential equation; Mathematical analysis; Operator (biology); Polynomial; Applied mathematics; Mathematical physics","score_opus":0.016274239871088753,"score_gpt":0.23226159477309377,"score_spread":0.21598735490200502,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2046580591","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.030669056,0.000010396694,0.96488583,0.00034358507,0.0016094885,0.00007527809,2.3665086e-7,0.00027084516,0.0021353113],"genre_scores_gemma":[0.98565054,4.1706738e-7,0.0108637735,0.00031615255,0.00031410664,0.000005501356,0.000006606513,0.0000072683124,0.0028356183],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99902445,0.00005210937,0.0001892696,0.00028965567,0.00022191778,0.00022258917],"domain_scores_gemma":[0.99939245,0.00014061666,0.000060311217,0.0002481303,0.00008525752,0.00007322271],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001192729,0.000107602325,0.000098222954,0.00008831627,0.0002189889,0.00016752236,0.00028750405,0.000041869844,0.00017585522],"category_scores_gemma":[0.000049869235,0.000092546165,0.00004363385,0.00030997852,0.000020496136,0.00031544,0.0001584753,0.0000817981,0.00030747725],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000012171099,0.00030299596,0.00046456684,0.00002111944,0.000039321945,0.0000011468869,0.0004496525,0.020826869,0.010461387,0.6612669,0.0014811705,0.3046727],"study_design_scores_gemma":[0.0002793986,0.000056658217,0.0052253874,0.000009410317,0.000008665323,6.210093e-7,0.0000028554523,0.98866504,0.00033995585,0.0023235476,0.0029486131,0.00013981905],"about_ca_topic_score_codex":0.000030847237,"about_ca_topic_score_gemma":0.000007064667,"teacher_disagreement_score":0.9678382,"about_ca_system_score_codex":0.000024915698,"about_ca_system_score_gemma":0.000025188416,"threshold_uncertainty_score":0.39521006},"labels":[],"label_agreement":null},{"id":"W2046611384","doi":"10.1090/s1056-3911-06-00458-9","title":"A conjecture on rational approximations to rational points","year":2006,"lang":"en","type":"article","venue":"Journal of Algebraic Geometry","topic":"Polynomial and algebraic computation","field":"Computer Science","cited_by":14,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Annotation; Algorithm; Conjecture; Computer science; Type (biology); Artificial intelligence; Mathematics; Discrete mathematics; Biology","score_opus":0.008448374319770564,"score_gpt":0.2284975480746558,"score_spread":0.22004917375488525,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2046611384","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.39839277,0.00005997727,0.5853577,0.014379766,0.0007252475,0.00012184583,0.000005190543,0.000034559525,0.000922921],"genre_scores_gemma":[0.9498568,9.4238925e-7,0.04726372,0.0018028897,0.0008247573,0.0000038642283,0.00000866194,0.000007873199,0.0002304629],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99826926,0.00006499642,0.0005637265,0.00020377511,0.0006857292,0.00021251707],"domain_scores_gemma":[0.99878556,0.00027186988,0.00034377258,0.00019189996,0.00026225392,0.00014463588],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00044876462,0.00014835017,0.00021282675,0.0007045686,0.00014515879,0.00019476424,0.000533629,0.000062360145,0.000088132125],"category_scores_gemma":[0.00017961003,0.00012438842,0.00014565111,0.0009236254,0.000024641018,0.0005295619,0.00007891165,0.00022756122,0.000121928395],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006374374,0.00051188166,0.0007579886,0.000016266973,0.000078747566,0.000050875406,0.00034164605,0.027898153,0.0030443987,0.8925379,0.05135704,0.023341345],"study_design_scores_gemma":[0.0038671482,0.0018179463,0.2738244,0.00019329945,0.00004546565,0.0011719532,0.000053079737,0.025255157,0.011640544,0.6573713,0.023797955,0.00096176873],"about_ca_topic_score_codex":0.000006883199,"about_ca_topic_score_gemma":0.000004213772,"teacher_disagreement_score":0.5514641,"about_ca_system_score_codex":0.000092231145,"about_ca_system_score_gemma":0.00024195624,"threshold_uncertainty_score":0.50724125},"labels":[],"label_agreement":null},{"id":"W2049605943","doi":"10.1145/2733693.2733720","title":"The Design of Maple's Sum-of-Products and POLY Data Structures for Representing Mathematical Objects","year":2015,"lang":"en","type":"article","venue":"ACM communications in computer algebra","topic":"Polynomial and algebraic computation","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Maple; Computer science; Object (grammar); Kernel (algebra); Algebra over a field; Mathematics; Pure mathematics; Artificial intelligence","score_opus":0.15658605195261344,"score_gpt":0.345271712053709,"score_spread":0.18868566010109555,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2049605943","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0126149235,0.002210477,0.980067,0.0043156585,0.00019531389,0.00048881344,0.000007803431,0.000047880287,0.00005211752],"genre_scores_gemma":[0.45414087,0.00004353655,0.5457087,0.000036571313,0.00003490327,0.0000125422375,0.000011863499,0.000005642368,0.0000053854237],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984422,0.00029430617,0.0005288441,0.00033517386,0.00019983336,0.00019969334],"domain_scores_gemma":[0.99066734,0.0033221603,0.0002584533,0.0054924516,0.00020310438,0.0000564583],"candidate_categories":["open_science"],"consensus_categories":[],"category_scores_codex":[0.0015090922,0.000121125464,0.00023098389,0.00010767001,0.00016205697,0.00012066469,0.006292272,0.00004418877,2.8677684e-7],"category_scores_gemma":[0.001207121,0.00009504698,0.000026106267,0.00041409812,0.00025146359,0.00040213016,0.006408913,0.0001311299,9.638701e-7],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003911919,0.000214479,0.0007422422,0.00011317526,0.0000908102,0.0000011719313,0.00534865,0.0007665619,0.0004127648,0.5232978,0.0033603497,0.4656129],"study_design_scores_gemma":[0.00042781356,0.00006706201,0.0016276223,0.00004689906,0.000009628058,0.00001424922,0.00006236741,0.5864033,0.00075899047,0.41005048,0.00041799946,0.000113549984],"about_ca_topic_score_codex":0.0000397861,"about_ca_topic_score_gemma":0.000013365299,"teacher_disagreement_score":0.5856368,"about_ca_system_score_codex":0.00001691578,"about_ca_system_score_gemma":0.00016856175,"threshold_uncertainty_score":0.9990842},"labels":[],"label_agreement":null},{"id":"W2049626594","doi":"10.1145/2016567.2016590","title":"Inverting matrices modulo regular chains","year":2011,"lang":"en","type":"article","venue":"ACM communications in computer algebra","topic":"Polynomial and algebraic computation","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"","keywords":"Modulo; Mathematics; Arithmetic; Computer science; Algebra over a field; Combinatorics; Pure mathematics","score_opus":0.06077053493012863,"score_gpt":0.2744791578736379,"score_spread":0.21370862294350929,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2049626594","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11798065,0.00074200594,0.8748828,0.0034757913,0.0004590776,0.00029021857,0.000001598546,0.0005224377,0.0016454064],"genre_scores_gemma":[0.5577342,0.00008815873,0.44149095,0.0005675773,0.000056035897,0.000028906336,0.0000066377793,0.000010589354,0.000016989321],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981248,0.00026577755,0.0005581643,0.0004557985,0.0002155649,0.00037990676],"domain_scores_gemma":[0.99476266,0.00033947336,0.0001988592,0.0044991532,0.000092667375,0.0001071897],"candidate_categories":["open_science"],"consensus_categories":[],"category_scores_codex":[0.0005270952,0.0002113911,0.0002361355,0.0003855765,0.0002761342,0.00014868758,0.0073774443,0.00008757073,0.000012334884],"category_scores_gemma":[0.00007408846,0.00022088179,0.00009192976,0.001094467,0.00012419102,0.0008744455,0.0048970236,0.00031970793,0.00010592196],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000054357747,0.00038670521,0.005311216,0.00001880031,0.00003843772,0.000013352738,0.008448456,0.0001603957,0.00011492248,0.4742425,0.0008189624,0.5104408],"study_design_scores_gemma":[0.00054476014,0.000086190325,0.0372622,0.000095111805,0.000008299937,0.000033778175,0.000038989667,0.74575645,0.00048324562,0.21344914,0.0017758845,0.00046596996],"about_ca_topic_score_codex":0.00030223146,"about_ca_topic_score_gemma":0.00011590968,"teacher_disagreement_score":0.74559605,"about_ca_system_score_codex":0.000082190796,"about_ca_system_score_gemma":0.00007958526,"threshold_uncertainty_score":0.9979931},"labels":[],"label_agreement":null},{"id":"W2050816636","doi":"10.1145/2733693.2733723","title":"Basic Polynomial Algebra Subprograms","year":2015,"lang":"en","type":"article","venue":"ACM communications in computer algebra","topic":"Polynomial and algebraic computation","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"","keywords":"Multiplication (music); Computer science; Polynomial; Univariate; Prime (order theory); Division (mathematics); Integer (computer science); Algebra over a field; Isolation (microbiology); Variety (cybernetics); Arithmetic; Mathematics; Theoretical computer science; Programming language; Multivariate statistics; Pure mathematics; Combinatorics","score_opus":0.0583955977594663,"score_gpt":0.30028140686234356,"score_spread":0.24188580910287727,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2050816636","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.21410163,0.0018261959,0.7478818,0.027828962,0.00253817,0.0009649318,0.0000073412266,0.0014916053,0.0033593178],"genre_scores_gemma":[0.680644,0.000041356627,0.31776813,0.0011311152,0.00023100754,0.00007302506,0.000038959344,0.000022270851,0.000050153183],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9971352,0.00044100426,0.0007249008,0.0006655702,0.00043235143,0.00060093973],"domain_scores_gemma":[0.99289423,0.00058163767,0.00020534293,0.0057873754,0.00019618272,0.0003352415],"candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":[],"category_scores_codex":[0.00090962707,0.00033251705,0.00038218303,0.00042886627,0.00023949203,0.00047850353,0.009109363,0.0001438562,0.000008121861],"category_scores_gemma":[0.00016304196,0.00034683483,0.00013980026,0.0015039465,0.00022833198,0.0011281171,0.006018427,0.0005191863,0.00033716875],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000018804507,0.0006761415,0.005030958,0.000011187113,0.00005129159,0.000022766111,0.0032899904,0.00046844097,0.00005299223,0.09506675,0.015486426,0.8798243],"study_design_scores_gemma":[0.0043306733,0.0005357398,0.028466526,0.00014066961,0.000026631766,0.0001883216,0.00011525442,0.6983447,0.00035940812,0.18023886,0.085686535,0.0015666868],"about_ca_topic_score_codex":0.00030142965,"about_ca_topic_score_gemma":0.00018646722,"teacher_disagreement_score":0.8782576,"about_ca_system_score_codex":0.00023745319,"about_ca_system_score_gemma":0.00035003075,"threshold_uncertainty_score":0.9998984},"labels":[],"label_agreement":null},{"id":"W2052338752","doi":"10.1016/j.jsc.2008.04.019","title":"Fast arithmetic for triangular sets: From theory to practice","year":2008,"lang":"en","type":"article","venue":"Journal of Symbolic Computation","topic":"Polynomial and algebraic computation","field":"Computer Science","cited_by":32,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"","keywords":"Mathematics; Quicksort; Modular arithmetic; Arithmetic; Euclidean algorithm; Division (mathematics); Multiplication (music); Axiom; Univariate; Dimension (graph theory); Euclidean geometry; Algebra over a field; Discrete mathematics; sort; Cryptography; Algorithm; Sorting algorithm; Pure mathematics; Combinatorics","score_opus":0.018415195422730957,"score_gpt":0.28258018679888164,"score_spread":0.2641649913761507,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2052338752","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09482001,0.00020985713,0.90046287,0.0030804118,0.0010672576,0.00021535916,0.0000044495027,0.000036752874,0.00010304338],"genre_scores_gemma":[0.56041753,0.000012542217,0.43774322,0.0012333981,0.00051960413,0.000005786126,0.000004662328,0.00001110523,0.000052147414],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984829,0.00018182787,0.00056658936,0.00020360686,0.00037930766,0.00018576352],"domain_scores_gemma":[0.9974474,0.0012165516,0.00051454455,0.00014809416,0.0005086508,0.00016480083],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007551954,0.00013033809,0.00027759504,0.00027305435,0.00015748043,0.00010501951,0.00043519447,0.000048237554,0.00000413111],"category_scores_gemma":[0.0005713591,0.000117116164,0.00014601991,0.00039092996,0.000023730587,0.00081534416,0.000073049705,0.00013423976,0.000023099754],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000299531,0.00025451544,0.000037907663,0.000011570046,0.00014113083,0.000080078855,0.009819806,0.026905462,0.0012005694,0.009712437,0.004861261,0.9466757],"study_design_scores_gemma":[0.008816617,0.0028010407,0.024550628,0.00029176226,0.00025066044,0.0024823626,0.0010827594,0.486334,0.003844456,0.4224063,0.04607443,0.0010649948],"about_ca_topic_score_codex":0.000017505341,"about_ca_topic_score_gemma":9.964156e-7,"teacher_disagreement_score":0.94561076,"about_ca_system_score_codex":0.00008216538,"about_ca_system_score_gemma":0.000205786,"threshold_uncertainty_score":0.47758585},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.039196430906365674,"score_gpt":0.2941856011297759,"score_spread":0.2549891702234102,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2053029682","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.25372142,0.00021289765,0.74423087,0.00006690303,0.0014457812,0.00021099366,0.0000025811266,0.000027701986,0.00008086641],"genre_scores_gemma":[0.86155164,0.000004557075,0.13794197,0.000029872454,0.0004500864,0.0000019988015,0.0000036671418,0.000009783441,0.0000064445226],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981551,0.00011500824,0.0010248256,0.00018001834,0.00031935438,0.00020566673],"domain_scores_gemma":[0.9976875,0.0002405181,0.0012716888,0.00013139429,0.0005615783,0.000107302294],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008052037,0.00014653557,0.00042163202,0.00038806544,0.00009690859,0.00007402319,0.0004524991,0.00007082384,0.0000017851769],"category_scores_gemma":[0.00004775037,0.00013619053,0.00022185454,0.00032828006,0.000034061526,0.0005407515,0.000067894194,0.0001125672,0.0000022494553],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005236245,0.00090935157,0.00065670884,0.00034340934,0.0004587987,0.000041230545,0.020330425,0.052695993,0.0120970225,0.026662247,0.0023247101,0.8829565],"study_design_scores_gemma":[0.002964344,0.0011076537,0.011171042,0.0002209595,0.00006971563,0.0003359243,0.00025761803,0.96980006,0.0066994242,0.006887114,0.00021634402,0.00026979556],"about_ca_topic_score_codex":0.00005530153,"about_ca_topic_score_gemma":6.947022e-7,"teacher_disagreement_score":0.91710407,"about_ca_system_score_codex":0.00007167733,"about_ca_system_score_gemma":0.00016868129,"threshold_uncertainty_score":0.5553689},"labels":[],"label_agreement":null},{"id":"W2054005723","doi":"10.1007/s11704-008-0006-y","title":"On the verification of polynomial system solvers","year":2008,"lang":"en","type":"article","venue":"Frontiers of Computer Science in China","topic":"Polynomial and algebraic computation","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"","keywords":"Computer science; Polynomial; Set (abstract data type); Decomposition; Theoretical computer science; Algorithm; Algebra over a field; Programming language; Mathematics; Pure mathematics","score_opus":0.009973027558295416,"score_gpt":0.20448732481797352,"score_spread":0.19451429725967812,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2054005723","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5134715,0.000025057087,0.48438072,0.00038016323,0.0013054841,0.0001097482,8.266041e-7,0.000027352771,0.00029913025],"genre_scores_gemma":[0.9596172,0.0000038565177,0.040259514,0.000052285846,0.000050654387,0.0000037191946,3.8215626e-7,0.0000030435974,0.000009361999],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99847686,0.00006454634,0.00035339542,0.00034549122,0.00052302604,0.00023666442],"domain_scores_gemma":[0.9989951,0.00008593075,0.00024001925,0.0005492966,0.00007216558,0.00005745739],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006671049,0.00011159165,0.000204845,0.0003370326,0.00018268828,0.000033924603,0.0018529528,0.00003197632,6.9912954e-7],"category_scores_gemma":[0.00003263155,0.00008266588,0.00006809221,0.0011132595,0.0005405343,0.00050604576,0.00021345113,0.0001079459,0.0000036905337],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002548983,0.0011035989,0.026533613,0.00015646801,0.000068250134,0.000060032726,0.045813236,0.100734115,0.009748457,0.46386528,0.08147646,0.2701856],"study_design_scores_gemma":[0.00037056016,0.00020750327,0.122964196,0.000060184735,0.000001924249,0.000017119055,0.000055473985,0.8644342,0.010197949,0.0014456478,0.00009252724,0.0001527444],"about_ca_topic_score_codex":0.000076200995,"about_ca_topic_score_gemma":0.0000011501598,"teacher_disagreement_score":0.76370007,"about_ca_system_score_codex":0.000103279555,"about_ca_system_score_gemma":0.0002688079,"threshold_uncertainty_score":0.3443278},"labels":[],"label_agreement":null},{"id":"W2054421353","doi":"10.1145/1113439.1113455","title":"The package CRACK for solving large overdetermined systems","year":2005,"lang":"en","type":"article","venue":"ACM SIGSAM Bulletin","topic":"Polynomial and algebraic computation","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Brock University","funders":"","keywords":"Overdetermined system; Symbolic computation; Listing (finance); Computation; Algebraic expression; Polynomial; Software; Computer science; Equation solving; Graphical user interface; Algebraic number; Interface (matter); System of linear equations; Mathematics; Differential equation; Algebra over a field; Algorithm; Applied mathematics; Mathematical analysis; Pure mathematics; Programming language","score_opus":0.013585116497779957,"score_gpt":0.24380394494032903,"score_spread":0.23021882844254907,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2054421353","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03937193,0.0018788942,0.88750803,0.064920455,0.0026049786,0.0011854398,0.000029604014,0.000602517,0.0018981517],"genre_scores_gemma":[0.98353946,0.000020992367,0.01141919,0.0010657316,0.0008621567,0.00009075032,0.000006367066,0.000015507514,0.0029798164],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.998765,0.000044330936,0.00026712712,0.00030798916,0.00018714975,0.00042841077],"domain_scores_gemma":[0.9978108,0.0012116097,0.00012335266,0.00071297697,0.00006611246,0.00007514389],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005457395,0.0001340862,0.00013409594,0.000032429256,0.00046981047,0.00041733377,0.0012391125,0.000049258317,0.000021005913],"category_scores_gemma":[0.0005572062,0.00009760371,0.0000903025,0.00010045633,0.000022726445,0.00012784443,0.00041594735,0.00008794964,0.00032573158],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000049205595,0.00016348832,0.00011605294,0.00005903563,0.00005918155,0.000012191941,0.0012205772,0.00072112563,0.0027746363,0.1234095,0.5340257,0.33738926],"study_design_scores_gemma":[0.0005208765,0.00005893552,0.0003503614,0.000022310614,0.000003524905,0.0000094989955,0.000024512567,0.08411919,0.00075311784,0.0013289042,0.91263914,0.000169611],"about_ca_topic_score_codex":0.000015898733,"about_ca_topic_score_gemma":0.00001270625,"teacher_disagreement_score":0.94416755,"about_ca_system_score_codex":0.000042184995,"about_ca_system_score_gemma":0.00003815798,"threshold_uncertainty_score":0.41867292},"labels":[],"label_agreement":null},{"id":"W2055447830","doi":"10.1016/j.aim.2009.12.013","title":"Jeu de taquin and a monodromy problem for Wronskians of polynomials","year":2010,"lang":"en","type":"article","venue":"Advances in Mathematics","topic":"Polynomial and algebraic computation","field":"Computer Science","cited_by":18,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Mathematics; Monodromy; Algebra over a field; Pure mathematics","score_opus":0.00802945432159119,"score_gpt":0.266570661003118,"score_spread":0.2585412066815268,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2055447830","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2467577,0.00024816257,0.7512839,0.00027723535,0.00012217325,0.00031379072,0.000003828495,0.00003499414,0.0009582488],"genre_scores_gemma":[0.41348386,0.000028122577,0.5863529,0.000024790139,0.000022323231,0.000029226212,4.0383466e-7,0.0000045653765,0.000053790463],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993749,0.000010709115,0.00024784796,0.00014008273,0.00006830398,0.00015812149],"domain_scores_gemma":[0.99931204,0.00032753558,0.00012653213,0.00017378404,0.000023377315,0.000036712983],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003010192,0.000076488825,0.0001610007,0.000063283886,0.000029304534,0.000026063135,0.00027074773,0.00003656257,0.0000020007526],"category_scores_gemma":[0.00009018283,0.000068660906,0.000026131003,0.000111895846,0.00005136006,0.00032071222,0.00007333149,0.00006751234,0.0000010963172],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008166104,0.00021597622,0.0008352595,0.00056095305,0.000009264171,0.0000019941522,0.0051282537,0.00045997504,0.019620575,0.6919763,0.00007145968,0.2811118],"study_design_scores_gemma":[0.00045469298,0.00007062499,0.0004762305,0.00007399191,0.0000049961204,0.000017524866,0.000066654335,0.10727606,0.0089288,0.88044316,0.0020459925,0.00014128882],"about_ca_topic_score_codex":0.000005294195,"about_ca_topic_score_gemma":0.000041131785,"teacher_disagreement_score":0.2809705,"about_ca_system_score_codex":0.000009107096,"about_ca_system_score_gemma":0.000038399718,"threshold_uncertainty_score":0.27999103},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Mathematics; Matroid; Conjecture; Combinatorics; Polynomial; Pure mathematics; Discrete mathematics; Mathematical analysis","score_opus":0.014554285083346828,"score_gpt":0.2393918853130487,"score_spread":0.22483760022970187,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2055828174","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.93789655,0.0006218831,0.059267767,0.00084757735,0.00012735288,0.00018829235,0.000008236438,0.000029342265,0.0010129754],"genre_scores_gemma":[0.994993,0.000016674114,0.004676569,0.00008626907,0.00007650356,0.000008862837,0.0000013013046,0.000005319846,0.00013552404],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"observational","domain_scores_codex":[0.99910295,0.00009974299,0.0003354069,0.00012064776,0.00015623968,0.00018498488],"domain_scores_gemma":[0.99902445,0.0002703308,0.00028666214,0.00031629615,0.000041062412,0.00006120701],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00075856503,0.000103068385,0.00029640947,0.000051219286,0.000052186002,0.000026672784,0.00038092776,0.000035782006,0.000016758622],"category_scores_gemma":[0.000076812685,0.000067154906,0.00007130313,0.00012211339,0.00016499731,0.0003264356,0.0002401979,0.00006461411,0.000014249888],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010577819,0.000389927,0.01043202,0.00058543327,0.00019758445,0.000001893807,0.021463497,0.0000041788717,0.034041338,0.8088165,0.0018008914,0.12216096],"study_design_scores_gemma":[0.0058266036,0.00042516505,0.6743163,0.0004855887,0.00025908145,0.00024986907,0.00037314318,0.021227509,0.14467971,0.14753236,0.003492932,0.0011317349],"about_ca_topic_score_codex":0.000053513737,"about_ca_topic_score_gemma":0.0000018305001,"teacher_disagreement_score":0.6638843,"about_ca_system_score_codex":0.0000050722347,"about_ca_system_score_gemma":0.000019588651,"threshold_uncertainty_score":0.27384976},"labels":[],"label_agreement":null},{"id":"W2057660502","doi":"10.4153/cjm-2014-014-4","title":"Obstructions to Approximating Tropical Curves in Surfaces Via Intersection Theory","year":2014,"lang":"en","type":"article","venue":"Canadian Journal of Mathematics","topic":"Polynomial and algebraic computation","field":"Computer Science","cited_by":19,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"Agence Nationale de la Recherche","keywords":"Mathematics; Conjugacy class; Combinatorics; Dual polyhedron; Group (periodic table); Reductive group; Fixed point; Tilde; Intersection (aeronautics); Automorphism; Rank (graph theory); Field (mathematics); Discrete mathematics; Pure mathematics; Group theory; Mathematical analysis; Physics","score_opus":0.011543914789071947,"score_gpt":0.21630214018621766,"score_spread":0.20475822539714572,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2057660502","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3437256,0.000043519205,0.654887,0.0007461671,0.0003226376,0.000041779735,2.9806435e-7,0.000006117139,0.00022687242],"genre_scores_gemma":[0.912923,0.0000011513044,0.08678123,0.00020028984,0.00006960666,0.0000010051206,1.3245676e-7,0.0000040610694,0.00001955032],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99924177,0.00007342876,0.0003592722,0.00007327596,0.000103351274,0.00014889534],"domain_scores_gemma":[0.99926996,0.00016592549,0.00015575204,0.00011328197,0.00006587705,0.00022920346],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005047089,0.00006430604,0.00015300921,0.00024022577,0.000058804857,0.00006736032,0.0003192739,0.00002470819,0.000009326555],"category_scores_gemma":[0.00041727495,0.000056349843,0.000042080716,0.0002417603,0.000020665924,0.00021190071,0.000018702951,0.00012637435,0.0000091422025],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008553513,0.00015673475,0.0066179,0.0005731568,0.000078870115,0.0000620586,0.030235445,0.013585114,0.0012949369,0.6106591,0.0025002891,0.3342278],"study_design_scores_gemma":[0.00059891015,0.0003757377,0.03351331,0.0016850214,0.000024869207,0.00082886964,0.0011144424,0.3825007,0.0009867176,0.57680255,0.001139217,0.0004296063],"about_ca_topic_score_codex":0.00022102353,"about_ca_topic_score_gemma":0.00471765,"teacher_disagreement_score":0.5691974,"about_ca_system_score_codex":0.000106154395,"about_ca_system_score_gemma":0.00015098881,"threshold_uncertainty_score":0.26325595},"labels":[],"label_agreement":null},{"id":"W2058085761","doi":"10.1088/1742-6596/341/1/012022","title":"Solving Bivariate Polynomial Systems on a GPU","year":2012,"lang":"en","type":"article","venue":"Journal of Physics Conference Series","topic":"Polynomial and algebraic computation","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"","keywords":"CUDA; Bivariate analysis; Fast Fourier transform; Polynomial; Parallel computing; Computer science; Grid; Variable (mathematics); Mathematics; Algorithm; Geometry; Mathematical analysis","score_opus":0.02762452799584502,"score_gpt":0.24341446505880862,"score_spread":0.2157899370629636,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2058085761","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.17156635,0.00022537862,0.81976837,0.0009895508,0.004941794,0.000097831726,0.000002938284,0.0000502161,0.0023575441],"genre_scores_gemma":[0.9954757,0.00001457212,0.002733268,0.00008154008,0.0015491535,0.0000013898552,4.37116e-7,0.0000063440066,0.00013757244],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99889106,0.000077406745,0.00034174795,0.000103978666,0.00030779446,0.00027804592],"domain_scores_gemma":[0.998956,0.00008482721,0.00043790383,0.00018050113,0.00019529823,0.0001454697],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00030598376,0.00013604254,0.00024703392,0.00007604615,0.00010688629,0.00029879264,0.00049118197,0.000037673613,0.0000058751707],"category_scores_gemma":[0.000033525677,0.000109024164,0.000095128395,0.00017272563,0.000038725044,0.0021322449,0.000103456085,0.00019759416,0.00003277065],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006633767,0.00018316697,0.00032902393,0.000029236084,0.0000724104,0.000011103752,0.003957475,0.00073080003,0.011632722,0.8119823,0.0015471625,0.16945831],"study_design_scores_gemma":[0.0073070778,0.0071784225,0.052462798,0.002636876,0.00028178573,0.0019602391,0.0033392406,0.081119776,0.6072995,0.17373468,0.058440056,0.0042395457],"about_ca_topic_score_codex":0.000015277326,"about_ca_topic_score_gemma":5.26638e-7,"teacher_disagreement_score":0.82390934,"about_ca_system_score_codex":0.00004504491,"about_ca_system_score_gemma":0.00021201417,"threshold_uncertainty_score":0.44458765},"labels":[],"label_agreement":null},{"id":"W2058461100","doi":"10.4171/owr/2011/20","title":"Real Enumerative Questions in Complex and Tropical Geometry","year":2011,"lang":"en","type":"article","venue":"Oberwolfach Reports","topic":"Polynomial and algebraic computation","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Tropical geometry; Symplectic geometry; Algebraic geometry; Geometry; Complex geometry; Geometry and topology; Enumeration; Mathematics; Topology (electrical circuits); Algebra over a field; Computer science; Pure mathematics; Discrete mathematics; Combinatorics","score_opus":0.03460919506874159,"score_gpt":0.25600156221560866,"score_spread":0.22139236714686705,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2058461100","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.93733484,0.00004921754,0.050600696,0.00023589045,0.00020746833,0.00012703154,7.989927e-7,0.0001079174,0.011336123],"genre_scores_gemma":[0.9795271,0.000010267162,0.020197732,0.000068678855,0.000035994584,0.000010726952,0.0000034765658,0.0000041162384,0.00014189351],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.9989901,0.00005504941,0.0003014894,0.00033667847,0.00013099669,0.00018565687],"domain_scores_gemma":[0.9994862,0.00003518651,0.000100855636,0.0002496411,0.000031946503,0.00009617745],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001364566,0.0000980839,0.00014399982,0.000121878,0.000073045514,0.000049335624,0.0001158614,0.00004582284,0.000037216578],"category_scores_gemma":[0.000042638636,0.0000906581,0.000028066699,0.0002618162,0.000052273565,0.00028896861,0.000140468,0.00010952528,0.0000076486995],"study_design_candidate":"observational","study_design_consensus":"observational","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000021275982,0.0005505136,0.47370276,0.000027850943,0.000042105275,0.0027535802,0.00817564,0.00004213906,0.0027383952,0.21415348,0.0014536175,0.29633865],"study_design_scores_gemma":[0.00011427901,0.000055319386,0.97677743,0.000008552419,0.0000025139377,0.000296932,0.00001399195,0.003696239,0.00033993484,0.017921923,0.00065039354,0.00012248779],"about_ca_topic_score_codex":0.00072327646,"about_ca_topic_score_gemma":0.00010608726,"teacher_disagreement_score":0.50307465,"about_ca_system_score_codex":0.000032614626,"about_ca_system_score_gemma":0.00005003376,"threshold_uncertainty_score":0.369693},"labels":[],"label_agreement":null},{"id":"W2058673186","doi":"10.4171/pm/1926","title":"Tropical Severi varieties","year":2013,"lang":"en","type":"article","venue":"Portugaliae Mathematica","topic":"Polynomial and algebraic computation","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"","keywords":"Variety (cybernetics); Intersection (aeronautics); Independence (probability theory); Construct (python library); Tropical geometry; Enumeration","score_opus":0.013733706134881856,"score_gpt":0.22029677394791286,"score_spread":0.206563067813031,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2058673186","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04102346,0.000035931535,0.92853755,0.004898615,0.00030329,0.00024850847,6.2804065e-7,0.00040253773,0.024549458],"genre_scores_gemma":[0.9173745,0.000003216172,0.07940939,0.0005544616,0.00009348046,0.000056711277,0.0000014585247,0.000009670847,0.00249709],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99899995,0.00002701112,0.0002645649,0.00022556343,0.0002408616,0.00024205468],"domain_scores_gemma":[0.99927914,0.000086286316,0.00007659749,0.00038359777,0.00005315532,0.00012122786],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00007707104,0.00012147687,0.00016687973,0.000050560735,0.0000737408,0.0002051524,0.0004949794,0.000041545456,0.00054745015],"category_scores_gemma":[0.000043143795,0.00009693399,0.0000666859,0.00015678297,0.00003893401,0.00045255746,0.00017859267,0.0000761574,0.0017738809],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[9.1270914e-7,0.00010692454,0.0002216351,0.000042204385,0.00001947353,0.000008381589,0.00086322316,0.0000056148,0.00034019837,0.9454401,0.022290288,0.030661052],"study_design_scores_gemma":[0.00022550601,0.000064069514,0.022937592,0.000023049472,0.000008060562,0.0000655179,0.000040551426,0.07574079,0.00090770033,0.89421046,0.0054624197,0.00031426092],"about_ca_topic_score_codex":0.000019839677,"about_ca_topic_score_gemma":5.6723076e-7,"teacher_disagreement_score":0.87635106,"about_ca_system_score_codex":0.000017197754,"about_ca_system_score_gemma":0.00003813943,"threshold_uncertainty_score":0.99900335},"labels":[],"label_agreement":null},{"id":"W2058898308","doi":"10.1145/1358190.1358195","title":"Fast algorithms, modular methods, parallel approaches and software engineering for solving polynomial systems symbolically","year":2007,"lang":"en","type":"article","venue":"ACM communications in computer algebra","topic":"Polynomial and algebraic computation","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"","keywords":"Computer science; Modular design; Theoretical computer science; Task (project management); Software; Decomposition; Symbolic computation; Polynomial; Symbolic execution; Symbolic-numeric computation; Algorithm; Parallel computing; Mathematics; Programming language; Computation","score_opus":0.05350815632308686,"score_gpt":0.30470801981036955,"score_spread":0.2511998634872827,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2058898308","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0123843225,0.0021440354,0.98309344,0.0008913146,0.00051149575,0.0006138143,0.000005291403,0.00033929365,0.000016996812],"genre_scores_gemma":[0.1889423,0.00005193788,0.8105061,0.00013369304,0.00020693212,0.00010146423,0.00002483823,0.000024583584,0.000008151937],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9978804,0.0001424261,0.0006905825,0.0005703899,0.00018018414,0.00053602096],"domain_scores_gemma":[0.99468344,0.0025307306,0.00017008769,0.002354745,0.000094555566,0.00016643817],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0017012851,0.00028644633,0.0003962107,0.0003701931,0.00030387205,0.00037666285,0.0033128406,0.00014613605,4.0095446e-7],"category_scores_gemma":[0.00021821709,0.00030731756,0.0000979704,0.0005070775,0.00009613059,0.00055474794,0.0027581353,0.00034020675,0.0000033444078],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000014119842,0.00021485763,0.0006947261,0.00010577402,0.00009607372,0.0000047475196,0.0022392403,0.020321397,0.00030591062,0.09176668,0.00029042558,0.88394606],"study_design_scores_gemma":[0.0006265494,0.000058737132,0.0084455935,0.000075849704,0.0000108823715,0.00004334645,0.000045386776,0.98514104,0.00007997553,0.0030663395,0.0020398682,0.00036643562],"about_ca_topic_score_codex":0.00008161764,"about_ca_topic_score_gemma":0.000018283561,"teacher_disagreement_score":0.9648196,"about_ca_system_score_codex":0.00010734213,"about_ca_system_score_gemma":0.00008003384,"threshold_uncertainty_score":0.9999379},"labels":[],"label_agreement":null},{"id":"W2059790146","doi":"10.1016/j.jalgebra.2012.11.033","title":"Computing the Hermite form of a matrix of Ore polynomials","year":2012,"lang":"en","type":"preprint","venue":"Journal of Algebra","topic":"Polynomial and algebraic computation","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Mathematics; Hermite polynomials; Degree (music); Unimodular matrix; Automorphism; Combinatorics; Polynomial; Monic polynomial; Field (mathematics); Matrix (chemical analysis); Discrete mathematics; Pure mathematics; Mathematical analysis; Physics","score_opus":0.019244928641892763,"score_gpt":0.27819067823069016,"score_spread":0.2589457495887974,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2059790146","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8660402,0.0029860537,0.12624682,0.0014933429,0.002627894,0.00024528633,0.000009464487,0.000022662525,0.00032825192],"genre_scores_gemma":[0.9811305,0.00005785162,0.017758425,0.00009510994,0.0008928539,8.316897e-7,0.0000013518116,0.000015085901,0.000047994927],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99712294,0.00017245275,0.0015558539,0.00019895918,0.0006418015,0.00030797345],"domain_scores_gemma":[0.99462116,0.0004482306,0.003799947,0.00057158165,0.0004289837,0.00013012254],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016813765,0.00025685958,0.00081037974,0.00028314747,0.00007341856,0.00009400103,0.002120153,0.00018048815,0.000015813514],"category_scores_gemma":[0.00011125848,0.00017019286,0.0005708066,0.00029399947,0.00010909325,0.000359213,0.0014455917,0.00069314596,0.0000046012633],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00034994283,0.0011888354,0.005358072,0.002057271,0.002123407,0.00008180329,0.037245527,0.012019703,0.016085373,0.12670894,0.009293682,0.78748745],"study_design_scores_gemma":[0.0075917165,0.0022552535,0.19126081,0.008592545,0.00149835,0.0029246958,0.0011198185,0.14568219,0.11656988,0.5119639,0.0072314674,0.003309343],"about_ca_topic_score_codex":0.000047048205,"about_ca_topic_score_gemma":0.0000027825306,"teacher_disagreement_score":0.7841781,"about_ca_system_score_codex":0.00007329463,"about_ca_system_score_gemma":0.00050543156,"threshold_uncertainty_score":0.6940263},"labels":[],"label_agreement":null},{"id":"W2059851496","doi":"10.1090/s0002-9939-08-09538-5","title":"SAGBI bases for rings of invariant Laurent polynomials","year":2008,"lang":"en","type":"article","venue":"Proceedings of the American Mathematical Society","topic":"Polynomial and algebraic computation","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Laurent polynomial; Automorphism; Laurent series; Invariant (physics); Polynomial ring; Ring (chemistry); Combinatorics; Pure mathematics; Order (exchange); Basis (linear algebra); Automorphism group; Polynomial; Algebra over a field; Discrete mathematics; Mathematical analysis; Geometry; Mathematical physics","score_opus":0.020231227462368145,"score_gpt":0.24322069141448008,"score_spread":0.22298946395211194,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2059851496","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.909942,0.000023600192,0.08629735,0.002649597,0.00005135114,0.00036057548,0.0000063969046,0.00006159757,0.00060754176],"genre_scores_gemma":[0.86540145,0.000012021396,0.13399585,0.0004144464,0.00005150426,0.000024875353,2.0145129e-7,0.00000853151,0.00009109647],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99888235,0.0000059776535,0.0003899988,0.00021461179,0.0002900754,0.00021697927],"domain_scores_gemma":[0.99876153,0.000285896,0.00058020244,0.00014508548,0.00016211369,0.00006516151],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00031290168,0.00012460617,0.0003839255,0.000020949798,0.00012544628,0.000021296295,0.0008268608,0.000025125782,0.0000040943532],"category_scores_gemma":[0.000255883,0.00008309894,0.00036805068,0.00039033015,0.00044075737,0.00017473973,0.00033510153,0.000072196664,0.0000021034214],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009897691,0.0012967602,0.005967796,0.0015270386,0.00039042355,4.307103e-7,0.017653892,0.00004905348,0.19004354,0.7096549,0.05707996,0.016237212],"study_design_scores_gemma":[0.0018258822,0.0010241013,0.028813152,0.00053476234,0.00015315304,0.00009897086,0.0013904802,0.12671162,0.38827482,0.44850242,0.0017412473,0.00092938537],"about_ca_topic_score_codex":0.000030127629,"about_ca_topic_score_gemma":1.6842681e-7,"teacher_disagreement_score":0.2611525,"about_ca_system_score_codex":0.000030486763,"about_ca_system_score_gemma":0.00005854025,"threshold_uncertainty_score":0.33886763},"labels":[],"label_agreement":null},{"id":"W2059887287","doi":"10.1145/2442829.2442881","title":"Computing minimal nullspace bases","year":2012,"lang":"en","type":"article","venue":"","topic":"Polynomial and algebraic computation","field":"Computer Science","cited_by":34,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Basis (linear algebra); Mathematics; Matrix (chemical analysis); Field (mathematics); Degree (music); Univariate; Matrix multiplication; Exponent; Computation; Combinatorics; Discrete mathematics; Algorithm; Pure mathematics; Geometry; Statistics","score_opus":0.01794246356940486,"score_gpt":0.24885342952981704,"score_spread":0.2309109659604122,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2059887287","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.17768276,0.000094516436,0.807818,0.0010008443,0.00054134894,0.000041234613,2.2523153e-7,0.00024065243,0.012580451],"genre_scores_gemma":[0.9207605,4.918205e-7,0.0778238,0.00066670525,0.00025344774,6.3266015e-7,6.705765e-7,0.0000026888704,0.00049103756],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99933267,0.000025096913,0.000097514,0.00012670332,0.00011078978,0.00030721637],"domain_scores_gemma":[0.9995882,0.00010303234,0.00003264635,0.00015269009,0.000016857231,0.00010656838],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00017396115,0.00006785306,0.00006769572,0.000039428898,0.00008789319,0.0000645787,0.00025690527,0.000018103965,0.00003523245],"category_scores_gemma":[0.000018161034,0.00005704803,0.000033002132,0.00015882088,0.000013063345,0.0004696478,0.00021918159,0.00004194904,0.00024287026],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000003750189,0.00018985732,0.010041734,0.000011216172,0.000014556826,0.000003874674,0.0017876432,0.0001286248,0.0018583107,0.5132594,0.024736132,0.4479649],"study_design_scores_gemma":[0.0010305302,0.00018746298,0.2076633,0.00004093902,0.000012914025,0.0001406555,0.00022461233,0.65340304,0.030131917,0.004802516,0.101307586,0.0010545388],"about_ca_topic_score_codex":0.000024767043,"about_ca_topic_score_gemma":0.0000013449632,"teacher_disagreement_score":0.74307775,"about_ca_system_score_codex":0.000013115428,"about_ca_system_score_gemma":0.000018769833,"threshold_uncertainty_score":0.3121687},"labels":[],"label_agreement":null},{"id":"W2061723124","doi":"10.1145/1145768.1145783","title":"On computing polynomial GCDs in alternate bases","year":2006,"lang":"en","type":"article","venue":"","topic":"Polynomial and algebraic computation","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo; University of Lethbridge","funders":"","keywords":"Computer science; Polynomial; Theoretical computer science; Algebra over a field; Mathematics; Pure mathematics","score_opus":0.00845734273471392,"score_gpt":0.22839304176966552,"score_spread":0.2199356990349516,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2061723124","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8044874,0.000014304487,0.17429107,0.0008450602,0.00043700243,0.000067710556,4.875344e-7,0.00017151001,0.019685425],"genre_scores_gemma":[0.99335116,3.4611597e-7,0.0053038523,0.0007085124,0.00018915458,0.0000012033486,0.000001883788,0.0000042463503,0.00043963877],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99911267,0.000035001416,0.00020525565,0.00027008334,0.00014495025,0.0002320494],"domain_scores_gemma":[0.99959224,0.00014048863,0.000046616224,0.00017271675,0.0000123655955,0.000035592653],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00012998062,0.00009869067,0.00010368465,0.00014270772,0.000053551987,0.00010850618,0.00036156992,0.000025020025,0.000015446316],"category_scores_gemma":[0.000010481105,0.000087575005,0.000037800066,0.00023709371,0.000014491463,0.00019113005,0.00012963687,0.00007894576,0.00009314343],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000032272033,0.0004037353,0.006677735,0.000010500282,0.000007776982,0.00011995404,0.00032929872,0.029331272,0.0023339756,0.60979134,0.017183518,0.33377862],"study_design_scores_gemma":[0.0009766512,0.00010919031,0.04961832,0.000033390676,0.0000010759004,0.000015378631,0.0000042703487,0.91279054,0.00605898,0.02880455,0.0012944831,0.00029315718],"about_ca_topic_score_codex":0.0012509861,"about_ca_topic_score_gemma":0.0001317633,"teacher_disagreement_score":0.88345927,"about_ca_system_score_codex":0.000042798616,"about_ca_system_score_gemma":0.00002882599,"threshold_uncertainty_score":0.3571205},"labels":[],"label_agreement":null},{"id":"W2063927368","doi":"10.1016/j.aim.2012.03.017","title":"Lifting tropical curves in space and linear systems on graphs","year":2012,"lang":"en","type":"preprint","venue":"Advances in Mathematics","topic":"Polynomial and algebraic computation","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Mathematics; Subvariety; Algebraic curve; Generalization; Euclidean space; Torus; Algebraic number; Graph; Space (punctuation); Algebraic properties; Euclidean geometry; Pure mathematics; Discrete mathematics; Combinatorics; Mathematical analysis; Computer science; Geometry","score_opus":0.020148665658774163,"score_gpt":0.28599312849600134,"score_spread":0.2658444628372272,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2063927368","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.28818417,0.06447384,0.6352929,0.001311309,0.0035469674,0.0014951518,0.000009768214,0.00029970016,0.0053862026],"genre_scores_gemma":[0.89552724,0.003908061,0.10017814,0.00009197847,0.00016103649,0.000059944006,0.0000035884193,0.000017776441,0.000052246487],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99869734,0.00007564307,0.0004248433,0.00032948624,0.00022439013,0.0002482956],"domain_scores_gemma":[0.99891096,0.00042177583,0.0002324739,0.00035616025,0.000020745716,0.000057886813],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00031027358,0.00019877173,0.00037892073,0.00016744564,0.000026584135,0.0000658002,0.00044155747,0.000103399514,8.910568e-7],"category_scores_gemma":[0.0001449846,0.00017513245,0.0000379686,0.00019802633,0.000038219205,0.00027891254,0.000530014,0.00041776308,0.000007739902],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000060175958,0.00038125183,0.0064887474,0.006457413,0.000014148493,0.000026555388,0.0043641385,0.021782028,0.000011971583,0.93133765,0.000044277465,0.029085796],"study_design_scores_gemma":[0.00034267854,0.0000486142,0.004565096,0.007913903,0.000009070601,0.000017126362,0.000097748314,0.57535064,0.00004724439,0.4104889,0.0006274775,0.00049148395],"about_ca_topic_score_codex":0.000015688433,"about_ca_topic_score_gemma":0.000013543278,"teacher_disagreement_score":0.6073431,"about_ca_system_score_codex":0.000050802133,"about_ca_system_score_gemma":0.000029162104,"threshold_uncertainty_score":0.7141694},"labels":[],"label_agreement":null},{"id":"W2064756116","doi":"10.1016/j.jsc.2006.12.004","title":"On approximate triangular decompositions in dimension zero","year":2007,"lang":"en","type":"article","venue":"Journal of Symbolic Computation","topic":"Polynomial and algebraic computation","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"National Science Foundation","keywords":"Mathematics; Zero (linguistics); Dimension (graph theory); Generalization; Polynomial; Homotopy; System of polynomial equations; Algebra over a field; Applied mathematics; Discrete mathematics; Pure mathematics; Mathematical analysis","score_opus":0.011061004748159575,"score_gpt":0.268565815014977,"score_spread":0.25750481026681743,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2064756116","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.41930062,0.000044981287,0.5794201,0.000492954,0.00040750604,0.00007275217,2.2420251e-7,0.000020755002,0.00024011554],"genre_scores_gemma":[0.9700316,0.0000046498335,0.02951229,0.0003192935,0.0001123551,7.630842e-7,0.0000021551775,0.000006899305,0.000009960371],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984755,0.00008106861,0.0006835724,0.00016523081,0.00037363448,0.0002209928],"domain_scores_gemma":[0.99886173,0.00034784884,0.00040911112,0.00012042364,0.00014934,0.00011155235],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010578911,0.00012121011,0.00023457254,0.00066438474,0.000078092526,0.00008014345,0.000284005,0.000053964464,0.0000027294273],"category_scores_gemma":[0.000057236553,0.00010870312,0.000103587234,0.0006061669,0.000018720657,0.00044532653,0.00005302754,0.00021069277,0.000013236673],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003784412,0.0011503627,0.00068387185,0.000038623708,0.00006788259,0.00047112277,0.0051768376,0.17344728,0.014595212,0.14339036,0.0020899088,0.6585101],"study_design_scores_gemma":[0.005554946,0.0012581252,0.10019589,0.00042978185,0.000027033493,0.00065136026,0.0001143326,0.49799255,0.0074965805,0.38541433,0.00033600733,0.00052905135],"about_ca_topic_score_codex":0.000009949192,"about_ca_topic_score_gemma":0.0000050875205,"teacher_disagreement_score":0.65798104,"about_ca_system_score_codex":0.00013365281,"about_ca_system_score_gemma":0.00006997487,"threshold_uncertainty_score":0.44327846},"labels":[],"label_agreement":null},{"id":"W2065441330","doi":"10.1145/2608628.2608640","title":"Unimodular completion of polynomial matrices","year":2014,"lang":"en","type":"article","venue":"","topic":"Polynomial and algebraic computation","field":"Computer Science","cited_by":17,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Unimodular matrix; Combinatorics; Mathematics; Matrix completion; Matrix (chemical analysis); Exponent; Univariate; Field (mathematics); Matrix multiplication; Multiplication (music); Column (typography); Discrete mathematics; Statistics; Pure mathematics; Physics; Connection (principal bundle); Geometry","score_opus":0.008616705406821471,"score_gpt":0.21338562864234453,"score_spread":0.20476892323552306,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2065441330","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.16827591,0.000013295379,0.825973,0.00052786607,0.00019992574,0.000037378217,3.2914593e-7,0.00008459144,0.004887711],"genre_scores_gemma":[0.9670272,9.890211e-7,0.032650396,0.00013483378,0.000079521546,9.170376e-7,0.0000013695924,0.000002069337,0.000102724334],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99944806,0.000039217914,0.00014800932,0.00013809121,0.00012770458,0.00009890233],"domain_scores_gemma":[0.9996103,0.0000605755,0.00006758631,0.00018964487,0.000034933182,0.000036954876],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00015893987,0.000054167693,0.000098171644,0.00007275172,0.000036224592,0.000030632265,0.00033798203,0.000020769257,0.000017061748],"category_scores_gemma":[0.000013477597,0.000046209454,0.000036670564,0.00018352972,0.000020626669,0.00018974382,0.000100730525,0.000027953407,0.00003811737],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000007843896,0.000078426136,0.001039981,0.00002112842,0.00001162546,5.956074e-7,0.00023075222,0.0006827842,0.009812498,0.74178493,0.00398066,0.2423488],"study_design_scores_gemma":[0.0009176684,0.0003246742,0.061251495,0.000022042612,0.000008332094,0.000011474824,0.00001531075,0.8425727,0.027742116,0.023781788,0.04301426,0.00033815877],"about_ca_topic_score_codex":0.00013565105,"about_ca_topic_score_gemma":0.0000055060686,"teacher_disagreement_score":0.8418899,"about_ca_system_score_codex":0.000008292778,"about_ca_system_score_gemma":0.000015087542,"threshold_uncertainty_score":0.18843669},"labels":[],"label_agreement":null},{"id":"W2065726567","doi":"10.1145/1182553.1182557","title":"Construction of rankings on partial derivatives","year":2006,"lang":"en","type":"article","venue":"ACM communications in computer algebra","topic":"Polynomial and algebraic computation","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"","keywords":"Ranking (information retrieval); Mathematics; Differential (mechanical device); Order (exchange); Term (time); Relation (database); Partial derivative; Indeterminate; Algebra over a field; Pure mathematics; Computer science; Information retrieval; Mathematical analysis; Economics; Data mining; Physics","score_opus":0.02364437554622768,"score_gpt":0.2705984342591211,"score_spread":0.24695405871289344,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2065726567","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.29275662,0.00012939918,0.70138484,0.0039876634,0.00032649146,0.00020227743,0.0000024326284,0.00015961121,0.0010506494],"genre_scores_gemma":[0.6785453,0.000016031729,0.32118005,0.0001571717,0.000062891886,0.000015681324,0.000011777153,0.0000054966636,0.000005617836],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985964,0.00020564938,0.0005055286,0.00029107026,0.00020056881,0.00020081784],"domain_scores_gemma":[0.99687356,0.00057619513,0.00021467998,0.0022186474,0.00008566931,0.000031267857],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00025721782,0.00014608835,0.00021519003,0.00027893507,0.00013916328,0.00007643034,0.0027179748,0.000059297035,0.000005263094],"category_scores_gemma":[0.00004283646,0.00015075585,0.000071964205,0.0007061066,0.00022521491,0.000380385,0.0012141991,0.00019454217,0.000018981844],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008858811,0.0002700722,0.003635122,0.0000080262835,0.000013023302,0.0000010968986,0.00047399427,0.001157118,0.0004105871,0.8016008,0.0003361685,0.1920851],"study_design_scores_gemma":[0.0015240271,0.00022703044,0.09980329,0.00016579768,0.000009226196,0.000027899578,0.000020947964,0.3310859,0.007862087,0.5553423,0.0034592631,0.0004721816],"about_ca_topic_score_codex":0.00016074906,"about_ca_topic_score_gemma":0.00003119982,"teacher_disagreement_score":0.38578865,"about_ca_system_score_codex":0.000050239534,"about_ca_system_score_gemma":0.000059952807,"threshold_uncertainty_score":0.6147645},"labels":[],"label_agreement":null},{"id":"W2067400984","doi":"10.1145/1394042.1394099","title":"On the functional decomposition of multivariate laurent polynomials (abstract only)","year":2008,"lang":"en","type":"article","venue":"ACM communications in computer algebra","topic":"Polynomial and algebraic computation","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"","keywords":"Univariate; Mathematics; Monomial; Laurent polynomial; Degree (music); Polynomial; Multivariate statistics; Decomposition; Discrete mathematics; Combinatorics; Algebra over a field; Pure mathematics; Statistics; Mathematical analysis","score_opus":0.05435184648983851,"score_gpt":0.29881568433017414,"score_spread":0.24446383784033562,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2067400984","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6329697,0.00019068833,0.35237104,0.012630758,0.0005644554,0.00040918885,0.0000068727354,0.00015636407,0.00070096296],"genre_scores_gemma":[0.9274972,0.000058728343,0.07140274,0.0008643175,0.00007988146,0.000035073852,0.000029172388,0.000010396615,0.000022490296],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"observational","domain_scores_codex":[0.99820083,0.00029757564,0.00060611207,0.00033802108,0.00031405804,0.0002434104],"domain_scores_gemma":[0.99410784,0.0024724663,0.00027152096,0.0029682438,0.000117497424,0.00006241354],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004708591,0.00019570361,0.00024236976,0.00025085325,0.00040594104,0.000063180276,0.0035553158,0.00007433933,0.000026907981],"category_scores_gemma":[0.00011191454,0.00015836961,0.00012814147,0.00059902004,0.00020608796,0.0003662107,0.0015370888,0.00035731957,0.000063583655],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005177328,0.0015228507,0.002425632,0.000014639218,0.000103437436,0.000009962796,0.0022793117,0.0070202374,0.0017004292,0.8658622,0.007337397,0.11167214],"study_design_scores_gemma":[0.0015140848,0.00024682097,0.6130844,0.0001797709,0.000012650343,0.00011544385,0.000015872985,0.27637136,0.0018439693,0.10429522,0.0017983954,0.00052204874],"about_ca_topic_score_codex":0.00015190316,"about_ca_topic_score_gemma":0.000059645183,"teacher_disagreement_score":0.761567,"about_ca_system_score_codex":0.00009154815,"about_ca_system_score_gemma":0.00017242711,"threshold_uncertainty_score":0.660672},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.01625062571401865,"score_gpt":0.24227548051093784,"score_spread":0.2260248547969192,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2067539682","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.94432336,0.0017958625,0.040164374,0.00097400864,0.004348319,0.00019212531,0.0005079276,0.0003658551,0.0073281527],"genre_scores_gemma":[0.97114664,0.0016938319,0.018814877,0.0018253035,0.0038461194,0.0005829233,0.0011994715,0.00079718046,0.00009363017],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.98522365,0.0009205938,0.004490413,0.0025822045,0.0039757746,0.0028073678],"domain_scores_gemma":[0.9870728,0.002550938,0.005836201,0.0021360347,0.0006981498,0.0017058614],"candidate_categories":["metaepi_narrow","sts","scholarly_communication","research_integrity","insufficient_payload"],"consensus_categories":["metaepi_narrow","research_integrity","insufficient_payload"],"category_scores_codex":[0.0037936482,0.0016619533,0.001081185,0.0012617201,0.0028612658,0.0025134124,0.0029040684,0.0027190568,0.0039029147],"category_scores_gemma":[0.0015767507,0.0025812222,0.002964879,0.0021749744,0.001684765,0.0039146803,0.0023232747,0.0025633173,0.0011131526],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.003729499,0.0012553412,0.000026086927,0.0013673854,0.002787421,0.0014141207,0.005835537,0.02043319,0.0034532715,0.93825,0.011376192,0.0100719705],"study_design_scores_gemma":[0.0070048585,0.0028208331,0.00043915308,0.002183665,0.0024677503,0.0033983667,0.0013317582,0.8362557,0.13876848,0.0023464842,0.0010092082,0.0019736942],"about_ca_topic_score_codex":0.002126091,"about_ca_topic_score_gemma":0.00056210934,"teacher_disagreement_score":0.9359035,"about_ca_system_score_codex":0.00007584286,"about_ca_system_score_gemma":0.0026045227,"threshold_uncertainty_score":0.9997378},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.03777352369009633,"score_gpt":0.2723385915055507,"score_spread":0.23456506781545433,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2069065624","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.093733124,0.00021518723,0.9021416,0.001592769,0.0009238413,0.0005352229,0.00003019518,0.0004403362,0.0003877565],"genre_scores_gemma":[0.92922515,0.000013703352,0.069337234,0.00052395987,0.0002922492,0.0000457616,0.000009061168,0.00006113322,0.0004917677],"study_design_codex":"simulation_or_modeling","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99593145,0.0002006176,0.0010436167,0.0010187584,0.0009119791,0.00089358253],"domain_scores_gemma":[0.997589,0.0003473589,0.0004984012,0.00087422377,0.00031650992,0.00037452416],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00079999195,0.0006071805,0.0006595125,0.0005325294,0.0011112868,0.00065029704,0.0015137955,0.00020462037,0.00006577329],"category_scores_gemma":[0.000019892052,0.0005161727,0.00032399516,0.0017862214,0.0001934171,0.00113164,0.000045235014,0.0006016319,0.0002374285],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00019877317,0.00062062044,0.0000070923656,0.00020912134,0.00016886955,0.0000058322157,0.010158114,0.47313783,0.18363903,0.0015321057,0.00014747442,0.33017516],"study_design_scores_gemma":[0.01780043,0.0021412447,0.0025848374,0.008667989,0.0015384505,0.0009579917,0.00046265803,0.18537875,0.57603794,0.050919563,0.14196986,0.011540291],"about_ca_topic_score_codex":0.00017201851,"about_ca_topic_score_gemma":0.00021466406,"teacher_disagreement_score":0.835492,"about_ca_system_score_codex":0.00030636662,"about_ca_system_score_gemma":0.0005007736,"threshold_uncertainty_score":0.999729},"labels":[],"label_agreement":null},{"id":"W2071935638","doi":"10.1063/1.1765214","title":"Invariant and group theoretical integrations over the U(n) group","year":2004,"lang":"en","type":"article","venue":"Journal of Mathematical Physics","topic":"Polynomial and algebraic computation","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Invariant (physics); Monomial; Group (periodic table); Strengths and weaknesses; Group theory; Algebra over a field","score_opus":0.010888640305736443,"score_gpt":0.2349244739023249,"score_spread":0.22403583359658846,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2071935638","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07700712,0.000031768443,0.91896915,0.0033625267,0.000103729384,0.00005674876,3.888417e-7,0.000012187298,0.00045638674],"genre_scores_gemma":[0.9587514,0.0000069596326,0.040565524,0.00043747074,0.00022942318,0.0000013297212,1.849102e-7,0.000004461174,0.0000032476723],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99918634,0.00004894779,0.0002972416,0.00008572632,0.0002651303,0.00011660512],"domain_scores_gemma":[0.9992074,0.00035505966,0.00014872309,0.00015525019,0.00005013171,0.00008343364],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004078967,0.00008615649,0.00015754787,0.000023759672,0.000092959956,0.00015641017,0.0003636603,0.00002744053,0.000009554256],"category_scores_gemma":[0.00010757723,0.000045890953,0.000085714724,0.00015056343,0.00016790091,0.00039298288,0.00011860426,0.0002203304,0.000010907226],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000032402838,0.00012691214,0.0000023273947,0.000007163139,0.000014147731,0.0000059515687,0.00065113674,0.000051817977,0.00027405226,0.9910019,0.00006927192,0.0077920947],"study_design_scores_gemma":[0.00032290406,0.00012526808,0.000520257,0.000053451735,0.000015274332,0.00011530648,0.000037343965,0.014682983,0.00013550218,0.98388106,0.000051099094,0.00005952554],"about_ca_topic_score_codex":0.0000011788634,"about_ca_topic_score_gemma":5.094545e-7,"teacher_disagreement_score":0.88174427,"about_ca_system_score_codex":0.000027039163,"about_ca_system_score_gemma":0.00003950945,"threshold_uncertainty_score":0.18713787},"labels":[],"label_agreement":null},{"id":"W2072051683","doi":"10.1145/780506.780527","title":"Simplification of definite sums of rational functions by creative symmetrizing method","year":2002,"lang":"en","type":"article","venue":"","topic":"Polynomial and algebraic computation","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Rational function; Function (biology); Mathematics; Rational number; Degree (music); Positive-definite matrix; Telescoping series; Combinatorics; Algebra over a field; Pure mathematics; Mathematical analysis; Physics; Biology","score_opus":0.0308842466916736,"score_gpt":0.2612400035320671,"score_spread":0.2303557568403935,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2072051683","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.007822857,0.00009436987,0.9807144,0.0004757639,0.0000767875,0.00007030568,0.000010120856,0.000038002912,0.010697404],"genre_scores_gemma":[0.8844687,0.000006798997,0.11444407,0.000074817806,0.000017136057,0.0000058296573,0.000012752684,0.0000026817802,0.0009672582],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99925524,0.00006318234,0.0002627423,0.00016537576,0.00017005976,0.00008341898],"domain_scores_gemma":[0.9991684,0.00035084446,0.00015662628,0.00015975375,0.00013078848,0.000033575678],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00018096772,0.000061427956,0.00011304174,0.00013110074,0.000053030133,0.000018390161,0.00018260797,0.000027280314,0.00009948272],"category_scores_gemma":[0.000075662734,0.00005540792,0.000049031554,0.0005770612,0.00002575459,0.0002772117,0.000045271827,0.000039317558,0.000020987687],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000007469148,0.00024461275,0.0005739866,0.000020955991,0.00006105261,2.2081683e-7,0.0010388975,0.0011768753,0.07956407,0.5528391,0.014749038,0.34972373],"study_design_scores_gemma":[0.00060279056,0.00021128308,0.006930021,0.000019128121,0.000021031137,0.0000055391088,0.00011881441,0.8207456,0.15258059,0.015511149,0.003032322,0.00022175064],"about_ca_topic_score_codex":0.00007588311,"about_ca_topic_score_gemma":0.0000024582325,"teacher_disagreement_score":0.8766458,"about_ca_system_score_codex":0.000015913456,"about_ca_system_score_gemma":0.000017361695,"threshold_uncertainty_score":0.22594695},"labels":[],"label_agreement":null},{"id":"W2072653231","doi":"10.1016/j.jsc.2003.08.010","title":"Telescoping in the context of symbolic summation in Maple","year":2004,"lang":"en","type":"article","venue":"Journal of Symbolic Computation","topic":"Polynomial and algebraic computation","field":"Computer Science","cited_by":22,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo; McMaster University","funders":"","keywords":"Maple; Telescoping series; Mathematics; Context (archaeology); Symbolic computation; Algebra over a field; Pure mathematics; Mathematical analysis","score_opus":0.014686698666798963,"score_gpt":0.25727426159478695,"score_spread":0.24258756292798797,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2072653231","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.78811204,0.00016430368,0.20958036,0.0016542948,0.00023409327,0.000139001,3.913079e-7,0.0000083526365,0.000107128144],"genre_scores_gemma":[0.995409,0.000020818054,0.004241595,0.00022237298,0.00009642599,0.000002275061,0.0000015656673,0.000004420879,0.0000015077677],"study_design_codex":"design_other","study_design_gemma":"observational","domain_scores_codex":[0.9983994,0.00014189408,0.00079859915,0.00012247036,0.00037671148,0.00016096722],"domain_scores_gemma":[0.998975,0.00019940172,0.0005323035,0.0001183645,0.00014063336,0.00003432047],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00086380134,0.000101848214,0.00026213162,0.00048254855,0.000037998816,0.00007075956,0.0004770342,0.000044137898,0.0000010984444],"category_scores_gemma":[0.00006716903,0.00007970756,0.00007757433,0.00078356994,0.000029848585,0.0005934447,0.000046224795,0.0002030807,0.000003941977],"study_design_candidate":"observational","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007372431,0.0006883341,0.005926576,0.00013930362,0.00004402648,0.000089728484,0.06671057,0.24274066,0.0044257883,0.10390867,0.0001395489,0.57511306],"study_design_scores_gemma":[0.008094141,0.0007993762,0.59178036,0.0015819733,0.000027579843,0.00051853334,0.004113388,0.1598703,0.006148266,0.22633258,0.00023474213,0.00049875525],"about_ca_topic_score_codex":0.00018053791,"about_ca_topic_score_gemma":0.00010296651,"teacher_disagreement_score":0.5858538,"about_ca_system_score_codex":0.00012809834,"about_ca_system_score_gemma":0.00019443683,"threshold_uncertainty_score":0.325038},"labels":[],"label_agreement":null},{"id":"W2074289133","doi":"10.1515/forum-2012-0061","title":"On hypersurfaces containing projective varieties","year":2013,"lang":"en","type":"preprint","venue":"Forum Mathematicum","topic":"Polynomial and algebraic computation","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"National Research Foundation of Korea","keywords":"Variety (cybernetics); Codimension; Mathematics; Projective variety; Lemma (botany); Pure mathematics; Generalization; Fano plane; Degree (music); Twisted cubic; Projective space; Quadratic equation; Projective test; Mathematical analysis; Complex projective space; Geometry; Physics","score_opus":0.02061202527224026,"score_gpt":0.24973378530762172,"score_spread":0.22912176003538146,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2074289133","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.18243134,0.00017942235,0.7829811,0.0031538964,0.0023955274,0.0014914585,0.000010823871,0.00089896034,0.026457489],"genre_scores_gemma":[0.9536542,0.000003827183,0.044215746,0.0004120434,0.00009429866,0.00021822371,0.00001270745,0.000026691296,0.0013622124],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.998244,0.00006825473,0.0003611926,0.0005662803,0.00037356935,0.00038670516],"domain_scores_gemma":[0.9984487,0.00036420787,0.00035039286,0.0006553351,0.00010307372,0.00007823307],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0002525058,0.00033440383,0.00042533595,0.00015017792,0.00015909459,0.00057157443,0.0010177869,0.00017725292,0.000031128755],"category_scores_gemma":[0.00012975153,0.0002724053,0.00014681128,0.00012013037,0.000048991762,0.0002778366,0.0013967821,0.00042509855,0.0003283318],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010085138,0.00012871735,0.000010862549,0.00026342267,0.00010306306,0.000006731874,0.008209748,0.0015238493,0.00004491166,0.9682733,0.0052531874,0.016172156],"study_design_scores_gemma":[0.00016127962,0.00017124823,0.000041134077,0.00029065312,0.000011071166,0.0000068093113,0.0003303397,0.20392199,0.00046216726,0.7939916,0.00027693174,0.00033475863],"about_ca_topic_score_codex":0.00007054604,"about_ca_topic_score_gemma":0.0000030666872,"teacher_disagreement_score":0.7712229,"about_ca_system_score_codex":0.00009410313,"about_ca_system_score_gemma":0.00015790045,"threshold_uncertainty_score":0.9999728},"labels":[],"label_agreement":null},{"id":"W2074896719","doi":"10.1145/2465506.2465954","title":"Finding points on real solution components and applications to differential polynomial systems","year":2013,"lang":"en","type":"article","venue":"","topic":"Polynomial and algebraic computation","field":"Computer Science","cited_by":26,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"","keywords":"Witness; Construct (python library); Homotopy; Differential (mechanical device); Mathematics; Polynomial; Computer science; Mathematical optimization; Algebra over a field; Applied mathematics; Algorithm; Pure mathematics; Mathematical analysis; Programming language; Engineering","score_opus":0.022638559796044393,"score_gpt":0.24473000649061158,"score_spread":0.22209144669456718,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2074896719","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4757116,0.0000041053554,0.52096736,0.0009090608,0.00032802706,0.00045104252,0.0000016151431,0.00012617117,0.0015010042],"genre_scores_gemma":[0.996894,0.000001960063,0.0022375025,0.00016421083,0.00022617418,0.00010983827,0.000006313148,0.000004945054,0.00035505302],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99911606,0.000035729703,0.00017718988,0.0003053008,0.00015878015,0.00020696355],"domain_scores_gemma":[0.9994999,0.000059611473,0.000048721824,0.00020507044,0.00003085152,0.00015581101],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000057992067,0.00010445477,0.00011134982,0.000117343785,0.00017817332,0.00028746307,0.00025861696,0.00003751614,0.000013115841],"category_scores_gemma":[0.000004531452,0.00009090564,0.000023730025,0.0001377101,0.000015323885,0.00025215725,0.00019403345,0.000056746772,0.00038484953],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000042915242,0.00046495057,0.0017518612,0.00006142495,0.000068268164,0.0000026936373,0.0011535669,0.00064220245,0.14072761,0.38311422,0.023833582,0.4481367],"study_design_scores_gemma":[0.0013103789,0.00033635713,0.29629847,0.00007340028,0.000011614351,0.000022770764,0.00004626028,0.6916326,0.002695145,0.0030321274,0.0038476302,0.00069324486],"about_ca_topic_score_codex":0.0008794325,"about_ca_topic_score_gemma":0.000006567962,"teacher_disagreement_score":0.6909904,"about_ca_system_score_codex":0.000048813992,"about_ca_system_score_gemma":0.000014760626,"threshold_uncertainty_score":0.49465907},"labels":[],"label_agreement":null},{"id":"W2076473088","doi":"10.1090/s0025-5718-2011-02490-7","title":"The infrastructure of a global field of arbitrary unit rank","year":2011,"lang":"en","type":"article","venue":"Mathematics of Computation","topic":"Polynomial and algebraic computation","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"Carl von Ossietzky Universität Oldenburg; Schweizerischer Nationalfonds zur Förderung der Wissenschaftlichen Forschung; University of Calgary; National Science Foundation","keywords":"Field (mathematics); Rank (graph theory); Class (philosophy); Unit (ring theory); Interpretation (philosophy); Function (biology)","score_opus":0.016393943351044136,"score_gpt":0.2519302619105993,"score_spread":0.23553631855955517,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2076473088","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3221918,0.00004143071,0.67555493,0.00006876081,0.000103770944,0.00009015196,0.0000020231341,0.000017144674,0.0019300135],"genre_scores_gemma":[0.84520155,0.0000028898519,0.15476055,0.000017558403,0.000008858812,0.0000012833214,8.44826e-7,0.0000022957563,0.000004172085],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99915314,0.000032849202,0.00043068355,0.0000862766,0.00021003152,0.00008704651],"domain_scores_gemma":[0.9989022,0.00029626547,0.00042473304,0.00020543968,0.0001479373,0.000023423216],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00018778392,0.000076055796,0.0001707955,0.00003358951,0.00003612874,0.000011374804,0.00044041942,0.00003862209,0.000004025334],"category_scores_gemma":[0.00006353822,0.000055605105,0.00006496452,0.0002917557,0.00006166119,0.00012701846,0.00010448781,0.000047395657,0.0000013257032],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003105283,0.00017467325,0.0007938829,0.00027584383,0.00006531244,9.98442e-7,0.0054843393,0.0018015944,0.0006526244,0.86911845,0.0002570591,0.12134414],"study_design_scores_gemma":[0.00025826012,0.00016470742,0.011438482,0.00006728162,0.0000124385115,0.0000061156416,0.000102549544,0.17566219,0.012838408,0.7993688,0.000011695189,0.00006907092],"about_ca_topic_score_codex":0.000024640927,"about_ca_topic_score_gemma":0.00000368418,"teacher_disagreement_score":0.5230098,"about_ca_system_score_codex":0.0000071672553,"about_ca_system_score_gemma":0.000065366155,"threshold_uncertainty_score":0.22675104},"labels":[],"label_agreement":null},{"id":"W2076790523","doi":"10.1112/s0010437x11005446","title":"Tropical geometry and the motivic nearby fiber","year":2011,"lang":"en","type":"article","venue":"Compositio Mathematica","topic":"Polynomial and algebraic computation","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia; University of Waterloo","funders":"Division of Mathematical Sciences","keywords":"Subvariety; Tropical geometry; Invariant (physics); Compactification (mathematics); Euler characteristic; Toric variety; Torus; Algebraic variety","score_opus":0.01730368542292819,"score_gpt":0.21674011292623357,"score_spread":0.19943642750330537,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2076790523","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.26847246,0.00021418375,0.6950221,0.0022907972,0.00016303267,0.00032572992,0.000001162425,0.00022171976,0.033288807],"genre_scores_gemma":[0.94941485,0.000002841825,0.049858667,0.00035385825,0.000046002042,0.000015320755,4.672301e-7,0.0000057065026,0.00030228338],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992826,0.000067565554,0.00017534896,0.00018075333,0.00013581902,0.00015793864],"domain_scores_gemma":[0.9993,0.00025090828,0.00005566566,0.00030549182,0.00002334453,0.000064576176],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00013564616,0.000097300996,0.0001581438,0.00004484558,0.00013969037,0.00010757342,0.00040995487,0.000028114227,0.000088914305],"category_scores_gemma":[0.000022460288,0.000060837177,0.00005271795,0.00015827987,0.00016382131,0.00017080281,0.0002415208,0.000089304405,0.00022435257],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000018419983,0.00009796005,0.000049563278,0.00003014331,0.00002770578,0.000007764423,0.002878575,0.0000018729764,0.00007088382,0.97460455,0.0004828204,0.021729767],"study_design_scores_gemma":[0.0019225811,0.00013186457,0.02344798,0.000077056065,0.000041476043,0.00026493272,0.000041147476,0.13953018,0.0016343499,0.8315787,0.0009869786,0.0003427882],"about_ca_topic_score_codex":0.0000058563555,"about_ca_topic_score_gemma":2.9522977e-7,"teacher_disagreement_score":0.68094236,"about_ca_system_score_codex":0.00000894077,"about_ca_system_score_gemma":0.000013091634,"threshold_uncertainty_score":0.28836733},"labels":[],"label_agreement":null},{"id":"W2077259161","doi":"10.1016/j.laa.2011.02.034","title":"The Whitney embedding theorem for tropical torsion modules","year":2011,"lang":"en","type":"article","venue":"Linear Algebra and its Applications","topic":"Polynomial and algebraic computation","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal; Group for Research in Decision Analysis","funders":"","keywords":"Mathematics; Torsion (gastropod); Embedding; Corollary; Combinatorics; Pure mathematics; Discrete mathematics","score_opus":0.021783661842081473,"score_gpt":0.2583537375604931,"score_spread":0.23657007571841165,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2077259161","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03708148,0.000333151,0.96013,0.0010082285,0.0001066741,0.00045310985,0.000004857554,0.00011683568,0.0007656761],"genre_scores_gemma":[0.96282405,0.000067912835,0.036252387,0.00017487202,0.00022782353,0.00023985539,0.000004664311,0.000007735343,0.0002006769],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993465,0.000019510344,0.00015545022,0.00023473165,0.00007674914,0.00016705124],"domain_scores_gemma":[0.9994228,0.00015367419,0.000054084067,0.00023448597,0.000059670532,0.00007531095],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00009749161,0.00008370971,0.00007497334,0.000026402518,0.00051047734,0.0000746129,0.00037226474,0.000037823746,0.0000054211077],"category_scores_gemma":[0.000025861324,0.000056483685,0.000043213415,0.00013138616,0.00004029134,0.00016559483,0.00011708317,0.000058374186,0.000021642662],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000044997632,0.000021450578,0.000021849926,0.0000040167615,0.000005605655,5.7743247e-8,0.0002634409,0.0000038889784,0.00022246044,0.9351382,0.00016203214,0.06415245],"study_design_scores_gemma":[0.00035749926,0.00010613886,0.004692171,0.0000102358335,0.000015304808,0.00000774698,0.000067521905,0.50393933,0.0062962654,0.43923345,0.045051984,0.00022233119],"about_ca_topic_score_codex":0.0000028715058,"about_ca_topic_score_gemma":0.0000026569928,"teacher_disagreement_score":0.92574257,"about_ca_system_score_codex":0.000007806646,"about_ca_system_score_gemma":0.000018175566,"threshold_uncertainty_score":0.39262307},"labels":[],"label_agreement":null},{"id":"W2079007848","doi":"10.1016/j.jsc.2006.05.003","title":"Gröbner fan and universal characteristic sets of prime differential ideals","year":2006,"lang":"en","type":"article","venue":"Journal of Symbolic Computation","topic":"Polynomial and algebraic computation","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"Università di Pisa; Russian Foundation for Basic Research","keywords":"Mathematics; Prime (order theory); Differential (mechanical device); Combinatorics; Pure mathematics; Discrete mathematics; Algebra over a field","score_opus":0.006545562213871806,"score_gpt":0.22256338713067086,"score_spread":0.21601782491679905,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2079007848","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.596946,0.000052687446,0.40243024,0.00020423062,0.00025077056,0.000040718813,0.0000013061388,0.000011534452,0.00006250293],"genre_scores_gemma":[0.9945538,0.000008403054,0.005190618,0.000023575953,0.00019439722,2.764508e-7,0.0000038167345,0.0000051567504,0.000019950048],"study_design_codex":"design_other","study_design_gemma":"observational","domain_scores_codex":[0.99890476,0.00007368968,0.0005010127,0.00012549973,0.0002685696,0.00012645977],"domain_scores_gemma":[0.9989428,0.000111072164,0.0006186088,0.00007650864,0.00018603209,0.0000649983],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001704072,0.000104263825,0.00025874458,0.00023410056,0.000052943098,0.0000737411,0.0002030356,0.000039798368,0.0000043935056],"category_scores_gemma":[0.000016010388,0.00009216523,0.00007160397,0.00018810814,0.000041334868,0.0004090285,0.000076741766,0.00009856003,0.0000018870948],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00017342846,0.0006209602,0.0059779314,0.000151529,0.0001817807,0.00010432799,0.0033726764,0.0051008635,0.120980285,0.048240423,0.0011804049,0.8139154],"study_design_scores_gemma":[0.0015778195,0.00035604698,0.803993,0.000116051335,0.000048118585,0.0002653432,0.000031037864,0.1561558,0.004006332,0.03308706,0.00013703427,0.00022636255],"about_ca_topic_score_codex":0.000048128655,"about_ca_topic_score_gemma":0.0000021988892,"teacher_disagreement_score":0.81368905,"about_ca_system_score_codex":0.000035525412,"about_ca_system_score_gemma":0.000079658945,"threshold_uncertainty_score":0.3758389},"labels":[],"label_agreement":null},{"id":"W2079533520","doi":"10.1016/j.jsc.2003.07.004","title":"Certified dense linear system solving","year":2003,"lang":"en","type":"article","venue":"Journal of Symbolic Computation","topic":"Polynomial and algebraic computation","field":"Computer Science","cited_by":33,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Mathematics; Diophantine equation; Ring (chemistry); Ideal (ethics); Certificate; Domain (mathematical analysis); System of linear equations; Ring of integers; Linear system; Discrete mathematics; Integral domain; Field (mathematics); Algebra over a field; Algebraic number field; Algorithm; Pure mathematics; Mathematical analysis","score_opus":0.019108657443917463,"score_gpt":0.24786600853807797,"score_spread":0.2287573510941605,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2079533520","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.26768106,0.00014937817,0.7298938,0.00022765285,0.0010981124,0.00006350917,2.0129987e-7,0.000057649966,0.00082860823],"genre_scores_gemma":[0.9597533,0.000004377804,0.03988504,0.000087331835,0.00022884764,9.090129e-7,5.028677e-7,0.000008165362,0.00003155855],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984913,0.00016791404,0.000616322,0.0001588456,0.0003690335,0.00019661427],"domain_scores_gemma":[0.9987076,0.00016829305,0.00053023716,0.00013522804,0.00032930615,0.00012934537],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00064997154,0.00012395212,0.00024654085,0.00025581563,0.00012485171,0.00013428702,0.00031482647,0.000050081268,0.0000033325387],"category_scores_gemma":[0.000103728205,0.00010964446,0.00012604597,0.00039870988,0.000017516464,0.00054365484,0.000041735442,0.00016462548,0.000029782414],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008654217,0.00046208626,0.0011773107,0.0002841483,0.0002884053,0.00042991622,0.009444751,0.22277927,0.013818245,0.34707823,0.0034976534,0.40065342],"study_design_scores_gemma":[0.0017881282,0.0003417229,0.0072729974,0.00028777265,0.00004556681,0.0021649273,0.00038177898,0.9648959,0.0051599736,0.015172203,0.0020755106,0.0004135177],"about_ca_topic_score_codex":0.0000063287107,"about_ca_topic_score_gemma":7.9802453e-7,"teacher_disagreement_score":0.74211663,"about_ca_system_score_codex":0.00012054625,"about_ca_system_score_gemma":0.00018477511,"threshold_uncertainty_score":0.44711715},"labels":[],"label_agreement":null},{"id":"W2080199983","doi":"10.1016/j.disc.2008.02.005","title":"A criterion for the half-plane property","year":2008,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Polynomial and algebraic computation","field":"Computer Science","cited_by":37,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Mathematics; Matroid; Property (philosophy); Homogeneous; Plane (geometry); Polynomial; Combinatorics; Pure mathematics; Discrete mathematics; Mathematical analysis; Geometry","score_opus":0.03454349146865929,"score_gpt":0.25355978755827313,"score_spread":0.21901629608961384,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2080199983","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008826504,0.000071446106,0.9862446,0.003170509,0.00020529673,0.00035280522,0.0000033624603,0.000110800414,0.0010146643],"genre_scores_gemma":[0.826785,0.00002507416,0.16936968,0.0005336578,0.00020847759,0.00010890722,0.000008449119,0.00001660816,0.0029440855],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99936646,0.000012493546,0.00016857625,0.00014496084,0.00014647467,0.00016100473],"domain_scores_gemma":[0.99933666,0.00020527715,0.0000652125,0.0003165703,0.000039657603,0.000036609796],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001414738,0.00009071428,0.00010685067,0.000022757502,0.00026074544,0.00007775753,0.00047798376,0.00002324959,0.0000065432123],"category_scores_gemma":[0.00005469053,0.00004300915,0.00006334386,0.000103217106,0.000044699496,0.0001598938,0.00010038105,0.000047328926,0.000034645465],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000045525707,0.00048591866,0.000100583406,0.0006247868,0.00017663158,0.000052014842,0.04764957,0.0005468047,0.0051677707,0.690624,0.049707875,0.2048185],"study_design_scores_gemma":[0.000408028,0.000117179785,0.00037147535,0.00004393505,0.000015479307,0.00016518596,0.00009879072,0.93168414,0.0016828089,0.03777875,0.027397677,0.00023654499],"about_ca_topic_score_codex":0.000013261219,"about_ca_topic_score_gemma":0.0000027157607,"teacher_disagreement_score":0.9311373,"about_ca_system_score_codex":0.000011333156,"about_ca_system_score_gemma":0.00003216977,"threshold_uncertainty_score":0.20054695},"labels":[],"label_agreement":null},{"id":"W2082371560","doi":"10.1016/j.crma.2008.05.011","title":"Élimination des quantificateurs dans les équations aux différences linéaires sur les vecteurs de Witt","year":2008,"lang":"fr","type":"article","venue":"Comptes Rendus Mathématique","topic":"Polynomial and algebraic computation","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec à Montréal","funders":"","keywords":"Mathematics; Witt vector; Algebraically closed field; Humanities; Pure mathematics; Combinatorics; Algebra over a field; Philosophy","score_opus":0.11511185440676938,"score_gpt":0.2847054784834903,"score_spread":0.16959362407672093,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2082371560","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.58698326,0.0071281916,0.3995871,0.0042909984,0.0007876424,0.00022399967,0.000026458687,0.0002947226,0.0006776046],"genre_scores_gemma":[0.9743151,0.0025497065,0.019455278,0.000095323194,0.00030954395,0.00006297088,0.00005604279,0.000039555092,0.0031164875],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99663365,0.0006516186,0.00077692774,0.00072620343,0.00047436455,0.0007372646],"domain_scores_gemma":[0.9973314,0.0009096447,0.00044930994,0.0005642585,0.00046725405,0.00027814702],"candidate_categories":["metaepi_narrow","sts"],"consensus_categories":[],"category_scores_codex":[0.0005215515,0.00047761603,0.0004628394,0.00027202757,0.0015207648,0.0004143115,0.0010779197,0.00030376983,0.00015123875],"category_scores_gemma":[0.0005191095,0.00049330347,0.00021421799,0.0008062117,0.001090516,0.0010726892,0.00027327903,0.00049377885,0.00020672515],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000034894434,0.0014503782,0.03773326,0.000614819,0.00016691971,0.00021299768,0.06378648,0.012066901,0.014650832,0.29034048,0.0155857615,0.5633563],"study_design_scores_gemma":[0.00052316627,0.000284601,0.41630757,0.00070235896,0.000071614,0.0005064458,0.0008585733,0.53358614,0.011343488,0.027969208,0.006966772,0.0008800388],"about_ca_topic_score_codex":0.0041721724,"about_ca_topic_score_gemma":0.0015930783,"teacher_disagreement_score":0.5624762,"about_ca_system_score_codex":0.00023715742,"about_ca_system_score_gemma":0.0007724198,"threshold_uncertainty_score":0.9997791},"labels":[],"label_agreement":null},{"id":"W2083936638","doi":"10.1088/1742-6596/341/1/012026","title":"Cache Complexity and Multicore Implementation for Univariate Real Root Isolation","year":2012,"lang":"en","type":"article","venue":"Journal of Physics Conference Series","topic":"Polynomial and algebraic computation","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"","keywords":"Computer science; Speedup; Benchmark (surveying); Parallel computing; Multi-core processor; Univariate; Cache; Software; Kernel (algebra); CPU cache; Isolation (microbiology); Root (linguistics); Algorithm; Theoretical computer science; Operating system; Mathematics; Multivariate statistics; Machine learning; Discrete mathematics","score_opus":0.061288939541736934,"score_gpt":0.31157298064240413,"score_spread":0.2502840411006672,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2083936638","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3024107,0.000017106466,0.69665956,0.00052656373,0.00024351472,0.00007582625,0.000004459468,0.000010611059,0.000051689552],"genre_scores_gemma":[0.96592134,0.000011379575,0.033716038,0.000024556939,0.00030371777,0.0000019242282,0.000005606425,0.0000035039438,0.000011922781],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993708,0.000042007436,0.00023769135,0.00007567673,0.0001230967,0.00015070132],"domain_scores_gemma":[0.9992279,0.00006551908,0.00032264652,0.00007559984,0.00023271324,0.000075626005],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00023197923,0.00008155061,0.00013935177,0.00003449028,0.00010820585,0.00011276568,0.00014966357,0.000021354475,0.0000035364178],"category_scores_gemma":[0.000013013505,0.00007083278,0.000041436273,0.00007990395,0.0000423913,0.0019415842,0.000056496996,0.000066655855,7.237496e-7],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003474733,0.00004319694,0.003799095,0.000018608705,0.000025349196,3.0718004e-7,0.0041091107,0.000030210032,0.007585307,0.7053941,0.00006640223,0.2788936],"study_design_scores_gemma":[0.0021716268,0.0008241714,0.36481068,0.000057217083,0.000072570445,0.00005939509,0.001352001,0.037517514,0.07230079,0.51953185,0.0008835826,0.00041863215],"about_ca_topic_score_codex":0.000039322786,"about_ca_topic_score_gemma":0.00003103525,"teacher_disagreement_score":0.6635107,"about_ca_system_score_codex":0.000027306141,"about_ca_system_score_gemma":0.000090408415,"threshold_uncertainty_score":0.28884768},"labels":[],"label_agreement":null},{"id":"W2085665095","doi":"10.1016/j.jsc.2007.08.003","title":"Universal characteristic decomposition of radical differential ideals","year":2007,"lang":"en","type":"article","venue":"Journal of Symbolic Computation","topic":"Polynomial and algebraic computation","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"","keywords":"Mathematics; Ideal (ethics); Ranking (information retrieval); Intersection (aeronautics); Set (abstract data type); Combinatorics; Differential (mechanical device); Finite set; Polynomial; Discrete mathematics; Algebra over a field; Pure mathematics; Mathematical analysis","score_opus":0.008893168748411744,"score_gpt":0.2677494275058659,"score_spread":0.25885625875745416,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2085665095","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.48283696,0.000025978981,0.5164014,0.00015531687,0.00046446972,0.00003741255,6.118632e-7,0.000013010779,0.000064819666],"genre_scores_gemma":[0.98614013,0.00000869191,0.013456945,0.000048123165,0.00032960885,1.6843386e-7,0.0000042446777,0.0000055209,0.000006573706],"study_design_codex":"design_other","study_design_gemma":"observational","domain_scores_codex":[0.9984821,0.00007477831,0.00073633157,0.0001258206,0.0004061549,0.00017478013],"domain_scores_gemma":[0.9984968,0.00024050447,0.0007767836,0.00009144921,0.00026610456,0.00012837978],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00050377403,0.00010839019,0.00028050214,0.00038067563,0.00006069253,0.000051581275,0.00033299078,0.00005644265,0.00000958874],"category_scores_gemma":[0.000036234993,0.000100035475,0.00013378297,0.0003172986,0.00004886583,0.00046090514,0.000066656256,0.0001507028,0.0000048077595],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00038286054,0.0006558976,0.0012904094,0.0000885791,0.00017934889,0.00016413163,0.003302387,0.0035473614,0.13472782,0.042799223,0.0005802923,0.81228167],"study_design_scores_gemma":[0.0040029404,0.0013133796,0.7134027,0.00032652295,0.00010870092,0.00093113346,0.000117549156,0.22168523,0.023621636,0.033548046,0.00045536153,0.0004867978],"about_ca_topic_score_codex":0.000010910157,"about_ca_topic_score_gemma":0.0000012818566,"teacher_disagreement_score":0.8117949,"about_ca_system_score_codex":0.00008343538,"about_ca_system_score_gemma":0.00010472396,"threshold_uncertainty_score":0.40793282},"labels":[],"label_agreement":null},{"id":"W2088713140","doi":"10.1016/j.jsc.2012.05.008","title":"On the complexity of computing with zero-dimensional triangular sets","year":2012,"lang":"en","type":"article","venue":"Journal of Symbolic Computation","topic":"Polynomial and algebraic computation","field":"Computer Science","cited_by":29,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"Agence Nationale de la Recherche","keywords":"Mathematics; Modular design; Degree (music); Dimension (graph theory); Inverse; Zero (linguistics); Las vegas; Field (mathematics); Algebraic number; Computation; Finite field; Set (abstract data type); Discrete mathematics; Algorithm; Combinatorics; Pure mathematics; Computer science","score_opus":0.037617557090772524,"score_gpt":0.2682194969239669,"score_spread":0.23060193983319438,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2088713140","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.60334784,0.00006372345,0.39492393,0.001111055,0.00032592143,0.00008745116,7.848908e-7,0.000014704287,0.00012458712],"genre_scores_gemma":[0.9765868,8.6914014e-7,0.022909608,0.0003224266,0.00016605799,4.9737616e-7,0.0000016682911,0.0000072988987,0.0000047845947],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982944,0.00020435786,0.0005492032,0.00011646133,0.00060958904,0.00022598353],"domain_scores_gemma":[0.99801093,0.00058768725,0.0008303512,0.00015844608,0.00029850876,0.000114091425],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000991598,0.00013956512,0.00028940872,0.00018349761,0.00014425744,0.00005268009,0.0003939047,0.00003596513,0.0000074595723],"category_scores_gemma":[0.0000691842,0.00008526184,0.00011288042,0.00041187668,0.00013038676,0.00040530367,0.00008930827,0.00021394758,0.0000082787155],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00036927487,0.0012448707,0.00212666,0.00007462643,0.00039156628,0.000028411063,0.012288575,0.17621933,0.0031587393,0.62028575,0.0046343273,0.17917784],"study_design_scores_gemma":[0.00355246,0.0015526547,0.20892502,0.00050724566,0.00008488681,0.00089688395,0.00020330938,0.61548716,0.0059358003,0.16219509,0.00015654668,0.0005029395],"about_ca_topic_score_codex":0.000010542668,"about_ca_topic_score_gemma":5.977621e-7,"teacher_disagreement_score":0.4580907,"about_ca_system_score_codex":0.000052089556,"about_ca_system_score_gemma":0.000108454515,"threshold_uncertainty_score":0.34768766},"labels":[],"label_agreement":null},{"id":"W2090381030","doi":"10.1145/2790282.2790293","title":"A compact parallel implementation of F4","year":2015,"lang":"en","type":"article","venue":"","topic":"Polynomial and algebraic computation","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Speedup; Computer science; Parallel computing; Linear algebra; Sparse matrix; Computational science; Mathematics","score_opus":0.04055556766780652,"score_gpt":0.31143402766259565,"score_spread":0.2708784599947891,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2090381030","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.18113935,0.000019587356,0.8119564,0.0012555849,0.000147891,0.00007123685,6.1801967e-7,0.00006994289,0.0053393845],"genre_scores_gemma":[0.9798818,4.2852767e-7,0.019867053,0.00012732299,0.000019957664,8.3393735e-7,0.0000017012597,0.000001184247,0.000099701145],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995795,0.000018216146,0.00011894236,0.00008446812,0.00012108987,0.000077781406],"domain_scores_gemma":[0.9997236,0.000016885004,0.00004783864,0.00011025134,0.000043284082,0.000058142763],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001105608,0.000037278278,0.00006049212,0.00003648299,0.000012331637,0.000022150714,0.00018699082,0.0000086491855,0.000017224564],"category_scores_gemma":[0.0000041425196,0.000030514104,0.000020468633,0.00012213465,0.000008674952,0.00022735665,0.00004379448,0.000015817937,0.000028472869],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000013141136,0.000103951905,0.009886455,0.000010421043,0.000029392992,0.0000034832108,0.0042715548,0.0017864527,0.0013467784,0.61795163,0.037851486,0.32674524],"study_design_scores_gemma":[0.0066980887,0.0011885224,0.28473648,0.000022097845,0.000017690902,0.00003999457,0.0019306405,0.3822671,0.04658242,0.25862083,0.01713415,0.0007620115],"about_ca_topic_score_codex":0.000379824,"about_ca_topic_score_gemma":0.00003126826,"teacher_disagreement_score":0.7987425,"about_ca_system_score_codex":0.000014085451,"about_ca_system_score_gemma":0.00006907484,"threshold_uncertainty_score":0.12443291},"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,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada; 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","score_opus":0.038306147412250115,"score_gpt":0.256969483843696,"score_spread":0.2186633364314459,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2090755539","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.034321833,0.000031620944,0.94445264,0.01537118,0.000058760805,0.00017404657,2.9215653e-7,0.00010694997,0.005482651],"genre_scores_gemma":[0.97276706,0.000003850853,0.026264913,0.0008594135,0.00005231786,0.000003433601,6.8744083e-7,0.0000036270928,0.00004467355],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993556,0.000027251608,0.0001829556,0.00013968248,0.00015471508,0.00013979076],"domain_scores_gemma":[0.99894255,0.00075691985,0.00007991231,0.0001429546,0.000020617226,0.000057066693],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00053932867,0.000072523806,0.00011362902,0.00003096237,0.000107236614,0.00012363425,0.00030027755,0.00001951263,0.000014660176],"category_scores_gemma":[0.00014278635,0.000045733403,0.000032590942,0.0001415771,0.0000744538,0.00021115602,0.00012738336,0.00005172541,0.000040789102],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000015814023,0.000025381856,0.000009866374,0.000022708387,0.000016443124,0.0000024312897,0.003648179,0.0000045881443,0.001184432,0.91458654,0.0013193176,0.07916427],"study_design_scores_gemma":[0.0007265218,0.000034274544,0.0045033996,0.000021253178,0.000012991556,0.000022941063,0.000105727195,0.65933084,0.0005391071,0.33166394,0.002881197,0.0001578024],"about_ca_topic_score_codex":0.000005048829,"about_ca_topic_score_gemma":0.0000014051438,"teacher_disagreement_score":0.93844527,"about_ca_system_score_codex":0.0000084239855,"about_ca_system_score_gemma":0.000009819672,"threshold_uncertainty_score":0.18649541},"labels":[],"label_agreement":null},{"id":"W2091109628","doi":"10.1016/j.laa.2004.08.012","title":"Special issue on Positivity in Linear Algebra","year":2004,"lang":"en","type":"article","venue":"Linear Algebra and its Applications","topic":"Polynomial and algebraic computation","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Regina","funders":"","keywords":"Mathematics; Algebra over a field; Linear algebra; Pure mathematics; Geometry","score_opus":0.010635983376218846,"score_gpt":0.2514662611496081,"score_spread":0.24083027777338922,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2091109628","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5124671,0.00044163526,0.42865366,0.026253441,0.0016850497,0.0025065306,0.000062446205,0.00075791666,0.02717227],"genre_scores_gemma":[0.973801,0.0000908788,0.013402136,0.002060351,0.009711684,0.00017575863,0.000037352143,0.000025479,0.0006953326],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9987523,0.000032132597,0.00026653582,0.00049114734,0.00018769984,0.00027019656],"domain_scores_gemma":[0.9993195,0.00009449486,0.00007213779,0.00032698046,0.00004761395,0.0001392856],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00013635347,0.00017275751,0.00017958225,0.00015332826,0.000189376,0.00007827064,0.00038114632,0.00008498165,0.000029189532],"category_scores_gemma":[0.00002357825,0.00016816323,0.000049541668,0.00057997415,0.000040148814,0.00031742099,0.00015385674,0.00020737326,0.0005222353],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000016337699,0.00046235375,0.00008016111,0.000020172438,0.000014033656,0.000010252525,0.00081191753,0.0010439901,0.0009562538,0.8228248,0.0008459667,0.17291379],"study_design_scores_gemma":[0.0056117782,0.0008740921,0.04159356,0.00019445854,0.000042296557,0.00009820009,0.00010217237,0.090394706,0.033876214,0.2756697,0.5495381,0.0020047661],"about_ca_topic_score_codex":0.00004010489,"about_ca_topic_score_gemma":0.000035045075,"teacher_disagreement_score":0.5486921,"about_ca_system_score_codex":0.000050048122,"about_ca_system_score_gemma":0.00007689653,"threshold_uncertainty_score":0.6857497},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"","keywords":"Mathematics; Maple; Arithmetic; Polynomial; Algebra over a field; Pure mathematics; Botany","score_opus":0.004614438534023594,"score_gpt":0.2208467436048269,"score_spread":0.2162323050708033,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2091909596","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.56741077,0.00012623226,0.42393273,0.005197717,0.0025714831,0.00009107451,4.4091675e-7,0.000072016126,0.00059754495],"genre_scores_gemma":[0.9656706,0.000014135238,0.033052087,0.00018346673,0.000955386,0.000001585386,0.0000012226767,0.000012695489,0.000108807326],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985572,0.00007651762,0.00056315225,0.00017349358,0.00038372018,0.00024591893],"domain_scores_gemma":[0.9986888,0.00033136236,0.00049397396,0.0002007946,0.00013628595,0.00014878814],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004825607,0.00014135338,0.00019951994,0.00023253863,0.00036358938,0.00067878223,0.00084932573,0.000057250523,0.000006607061],"category_scores_gemma":[0.00007395373,0.00010441597,0.00013726446,0.00043205588,0.00006732361,0.0011468475,0.0002150299,0.00044253826,0.000020231793],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003173848,0.00007606184,0.0005303634,0.000012373497,0.000059240694,0.000023446526,0.0023546629,0.004976442,0.006147496,0.015331087,0.004269067,0.966188],"study_design_scores_gemma":[0.0012074088,0.0002493839,0.032248095,0.00006258507,0.000029441335,0.0005957472,0.00014325549,0.8809308,0.0029194679,0.065955505,0.0153089585,0.00034935868],"about_ca_topic_score_codex":0.000023992387,"about_ca_topic_score_gemma":0.000010036565,"teacher_disagreement_score":0.9658387,"about_ca_system_score_codex":0.000029553432,"about_ca_system_score_gemma":0.00022820252,"threshold_uncertainty_score":0.65455127},"labels":[],"label_agreement":null},{"id":"W2092173841","doi":"10.4153/cmb-2012-041-2","title":"Diophantine Approximation for CertainAlgebraic Formal Power Series in PositiveCharacteristic","year":2012,"lang":"en","type":"article","venue":"Canadian Mathematical Bulletin","topic":"Polynomial and algebraic computation","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Formal power series; Power series; Irrational number; Diophantine equation; Series (stratigraphy); Algebraic number; Degree (music); Algebraic equation; Field (mathematics); Type (biology); Finite field; Diophantine approximation; Pure mathematics; Algebra over a field; Discrete mathematics; Mathematical analysis; Nonlinear system; Geometry","score_opus":0.009027208211404483,"score_gpt":0.21387721969388976,"score_spread":0.20485001148248527,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2092173841","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.33391812,0.00007506848,0.6501481,0.010513688,0.0002951143,0.00070456555,0.00001671471,0.00009105275,0.0042375675],"genre_scores_gemma":[0.9824342,7.210734e-7,0.016433539,0.0005811166,0.00008177555,0.00008382689,0.00001454602,0.000011063281,0.00035917183],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99875206,0.000036328813,0.0002782912,0.00017846354,0.00011246026,0.0006423965],"domain_scores_gemma":[0.9992195,0.0001487233,0.000060389204,0.0001787072,0.00004435242,0.0003483725],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00042436452,0.00013555131,0.00018506031,0.00017559323,0.000110312096,0.00009874979,0.00027135081,0.00006487684,0.00034141686],"category_scores_gemma":[0.00021923115,0.00012822392,0.00005557113,0.00017982881,0.000032381475,0.000426526,0.000051492072,0.00008433602,0.00075215613],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000013967519,0.00007449373,0.000108120366,0.000081172075,0.0000078568,0.000007824097,0.0012895878,0.000003202147,0.00025714503,0.99016637,0.00095807883,0.007032203],"study_design_scores_gemma":[0.004284174,0.000936297,0.10166015,0.0007256168,0.000054673004,0.0007677486,0.0007322949,0.06663683,0.006988998,0.6512773,0.16277698,0.0031589246],"about_ca_topic_score_codex":0.00013059762,"about_ca_topic_score_gemma":0.00011295695,"teacher_disagreement_score":0.6485161,"about_ca_system_score_codex":0.000120141136,"about_ca_system_score_gemma":0.00009363774,"threshold_uncertainty_score":0.96676964},"labels":[],"label_agreement":null},{"id":"W2094069363","doi":"10.1145/1277548.1277564","title":"Jeffery-hamel flow with maple","year":2007,"lang":"en","type":"article","venue":"","topic":"Polynomial and algebraic computation","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"","keywords":"Maple; Computer science; Vertex (graph theory); Flow (mathematics); Aside; Calculus (dental); Mathematics; Theoretical computer science; Geometry; Graph","score_opus":0.007143792558515609,"score_gpt":0.20920395276913434,"score_spread":0.20206016021061873,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2094069363","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05310318,0.000012366737,0.93015563,0.0006219272,0.0001560733,0.000049639955,1.5740227e-7,0.0001843044,0.015716726],"genre_scores_gemma":[0.82874626,4.0706072e-7,0.16908431,0.0006213014,0.000078069905,0.0000011665155,8.95558e-7,0.0000031875147,0.0014644215],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994027,0.00000715238,0.00009001343,0.00017197034,0.00014004597,0.00018810996],"domain_scores_gemma":[0.9996343,0.000057094887,0.0000216925,0.0001886452,0.000025417326,0.00007282013],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00016908917,0.000064203705,0.00006058167,0.0000507495,0.000053003558,0.00006562072,0.00026864113,0.000018429682,0.000027931186],"category_scores_gemma":[0.0000046967743,0.000044561475,0.000019072819,0.00022183059,0.00001550373,0.00021361739,0.000073389034,0.000045146335,0.00012166489],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002041467,0.00006714757,0.0009418289,0.0000060099687,0.000013844077,0.000048758775,0.00051842927,0.00044473686,0.0007599264,0.12267787,0.0039885105,0.87051255],"study_design_scores_gemma":[0.00242311,0.00081762485,0.11254587,0.000046214824,0.000011212614,0.00021310756,0.00010553193,0.7392178,0.05065096,0.039619792,0.05323881,0.0011099586],"about_ca_topic_score_codex":0.000030967007,"about_ca_topic_score_gemma":0.00005304729,"teacher_disagreement_score":0.8694026,"about_ca_system_score_codex":0.000014543942,"about_ca_system_score_gemma":0.000025911933,"threshold_uncertainty_score":0.18171641},"labels":[],"label_agreement":null},{"id":"W2094689345","doi":"10.1016/j.jsc.2015.03.007","title":"Algorithms to compute the topological Euler characteristic, Chern–Schwartz–MacPherson class and Segre class of projective varieties","year":2015,"lang":"en","type":"article","venue":"Journal of Symbolic Computation","topic":"Polynomial and algebraic computation","field":"Computer Science","cited_by":32,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Hypersurface; Projective space; Chern class; Class (philosophy); Euler's formula; Euler characteristic; Characteristic class; Algorithm; Pure mathematics; Variety (cybernetics); Projective test; Mathematical analysis; Artificial intelligence; Computer science","score_opus":0.035709385655562816,"score_gpt":0.28035825810946524,"score_spread":0.24464887245390243,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2094689345","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.43765593,0.00010705857,0.5576546,0.0033667206,0.0008463619,0.00018007733,0.000002247963,0.000026309166,0.00016069737],"genre_scores_gemma":[0.97781366,0.0000084969215,0.021313824,0.000347468,0.0004719871,0.0000036800923,0.0000016982549,0.0000082851075,0.00003092158],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99820936,0.00023227982,0.00059732434,0.00022737375,0.00052130397,0.00021235761],"domain_scores_gemma":[0.9980564,0.0003339261,0.00059368473,0.00014504859,0.00067053695,0.00020038629],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008430334,0.00017679967,0.0003874853,0.0001757638,0.00010689663,0.00016685005,0.00045671893,0.00008018456,0.0000023731639],"category_scores_gemma":[0.00015672963,0.00012018009,0.0000895355,0.00042833903,0.0001085096,0.0004294219,0.00023735591,0.00026955575,0.0000059523404],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0004349715,0.00057707226,0.0024010658,0.00009273273,0.00035848294,0.00008741811,0.06822309,0.02428544,0.0024717946,0.039130997,0.005009704,0.8569272],"study_design_scores_gemma":[0.0023427287,0.002648032,0.15628152,0.00015561013,0.00008036393,0.0007480693,0.0019506523,0.7932158,0.0011620194,0.0368122,0.0041020135,0.0005009504],"about_ca_topic_score_codex":0.000046268353,"about_ca_topic_score_gemma":0.000004112755,"teacher_disagreement_score":0.8564263,"about_ca_system_score_codex":0.000092645634,"about_ca_system_score_gemma":0.00022863847,"threshold_uncertainty_score":0.4900802},"labels":[],"label_agreement":null},{"id":"W2096396916","doi":"10.1016/j.jalgebra.2006.06.015","title":"Building counterexamples to generalizations for rational functions of Ritt's decomposition theorem","year":2006,"lang":"en","type":"article","venue":"Journal of Algebra","topic":"Polynomial and algebraic computation","field":"Computer Science","cited_by":21,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Mathematics; Counterexample; Rational function; Polynomial; Univariate; Decomposition; Group (periodic table); Field (mathematics); Function (biology); Decomposition theorem; Discrete mathematics; Pure mathematics; Mathematical analysis","score_opus":0.013055542724190638,"score_gpt":0.26769905425585727,"score_spread":0.25464351153166664,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2096396916","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.22687879,0.000054542492,0.77103215,0.0014520859,0.00039218488,0.00008723175,0.000009242967,0.0000127590965,0.00008102494],"genre_scores_gemma":[0.80230474,0.0000013124769,0.19706166,0.00015968479,0.00041744392,0.0000040561235,0.000007144339,0.0000050304125,0.000038904953],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990615,0.000034188495,0.00046533052,0.00010739708,0.00021462559,0.00011690454],"domain_scores_gemma":[0.9989529,0.00015331809,0.00031670657,0.000101789905,0.00041920925,0.000056030414],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00027577623,0.00007707721,0.00014669016,0.00023094029,0.0001234012,0.00008848569,0.00027361387,0.000027942375,0.000010874503],"category_scores_gemma":[0.000039989496,0.00006868731,0.00011896205,0.0002746482,0.00001943289,0.00045064586,0.000039074774,0.0000474219,0.0000022707527],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003110733,0.000121278455,0.00023128833,0.000010937284,0.000032551256,0.0000012475617,0.00013870107,0.032490477,0.040499937,0.9084853,0.008718507,0.00923866],"study_design_scores_gemma":[0.002043296,0.0008838479,0.037042312,0.00017715228,0.00008649033,0.00024606168,0.000054073116,0.10898316,0.04797967,0.7857288,0.01634931,0.0004258389],"about_ca_topic_score_codex":0.000016685937,"about_ca_topic_score_gemma":0.0000130740855,"teacher_disagreement_score":0.575426,"about_ca_system_score_codex":0.000050638373,"about_ca_system_score_gemma":0.00011871132,"threshold_uncertainty_score":0.2800987},"labels":[],"label_agreement":null},{"id":"W2096476413","doi":"10.1142/9789812778857_0008","title":"THE VECTOR RATIONAL FUNCTION RECONSTRUCTION PROBLEM","year":2007,"lang":"en","type":"article","venue":"","topic":"Polynomial and algebraic computation","field":"Computer Science","cited_by":20,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Modulo; Rational function; Degree (music); Constant (computer programming); Polynomial; Mathematics; Computation; Algebraic number; Function (biology); Discrete mathematics; Iterative reconstruction; Combinatorics; Algorithm; Pure mathematics; Computer science; Mathematical analysis; Physics; Artificial intelligence","score_opus":0.009208976147456568,"score_gpt":0.2112316470193031,"score_spread":0.20202267087184655,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2096476413","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011188263,0.000023135188,0.97422165,0.0017079093,0.001021437,0.000077985824,8.246697e-8,0.00013127943,0.011628234],"genre_scores_gemma":[0.9623813,0.0000024412611,0.035504784,0.0002522629,0.0003127275,0.0000051845327,0.0000014099894,0.0000024570904,0.0015374514],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994772,0.00001552172,0.00013485704,0.00012494334,0.00012406359,0.00012343524],"domain_scores_gemma":[0.99964494,0.00011977014,0.000043969198,0.00010774061,0.000050981726,0.000032591106],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003855235,0.00004383086,0.000029070636,0.000029757028,0.0002636078,0.000121567726,0.00015190367,0.000019802184,0.00001418354],"category_scores_gemma":[0.000011700685,0.000028266595,0.000023861097,0.00017711817,0.000021937658,0.0003243002,0.000035128545,0.000047734935,0.000064005566],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000005451093,0.0000033832664,0.00005904869,4.4673274e-7,0.000002995319,1.7468923e-7,0.00002427146,0.000022279928,0.0006119139,0.38142908,0.00064954243,0.61719143],"study_design_scores_gemma":[0.0008114036,0.00028958695,0.16009349,0.000015073868,0.000008536623,0.00016583192,0.00010529216,0.11294773,0.011582782,0.62331355,0.09024483,0.00042189483],"about_ca_topic_score_codex":0.000010931182,"about_ca_topic_score_gemma":0.000054088454,"teacher_disagreement_score":0.95119303,"about_ca_system_score_codex":0.000027566846,"about_ca_system_score_gemma":0.00003761912,"threshold_uncertainty_score":0.20274848},"labels":[],"label_agreement":null},{"id":"W2096962143","doi":"10.1112/s1461157014000102","title":"Gelfand–Kirillov dimension of differential difference algebras","year":2014,"lang":"en","type":"article","venue":"LMS Journal of Computation and Mathematics","topic":"Polynomial and algebraic computation","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Manitoba","funders":"","keywords":"Mathematics; Dimension (graph theory); Upper and lower bounds; Differential (mechanical device); Pure mathematics; Algebraic differential equation; Differential equation; Algebra over a field; Mathematical analysis; Ordinary differential equation; Differential algebraic equation","score_opus":0.011976862523112135,"score_gpt":0.23818823562155253,"score_spread":0.2262113730984404,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2096962143","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.43085527,0.000037153117,0.5686162,0.00015020021,0.0002044198,0.000034179666,2.5759454e-7,0.000011108703,0.000091161506],"genre_scores_gemma":[0.90339863,0.000017638871,0.0964292,0.00005896644,0.00006569619,3.398104e-7,6.993121e-7,0.0000051017023,0.000023745131],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99883723,0.000064092455,0.0005664496,0.00010521749,0.00031517545,0.00011185269],"domain_scores_gemma":[0.99866027,0.00029256832,0.0006372848,0.00011143829,0.00020266333,0.00009578266],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00027509397,0.00011359398,0.0003093016,0.00014642996,0.000057617814,0.00006919221,0.00023782245,0.000040609113,0.000004422132],"category_scores_gemma":[0.000077983525,0.00008607534,0.00007668665,0.00012911182,0.000048922557,0.00019861393,0.000099615885,0.00009579407,0.0000023129437],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000043689288,0.00064273423,0.0004337806,0.0004245015,0.00012463923,0.000008352115,0.007981477,0.0027429939,0.031079264,0.43121263,0.0005189276,0.524787],"study_design_scores_gemma":[0.0012491519,0.00049131,0.009051076,0.00022311666,0.000041150768,0.000172719,0.000062209954,0.72434896,0.0047656833,0.2592788,0.00012111334,0.00019470051],"about_ca_topic_score_codex":0.0000015566388,"about_ca_topic_score_gemma":4.7020256e-7,"teacher_disagreement_score":0.72160596,"about_ca_system_score_codex":0.000009783187,"about_ca_system_score_gemma":0.00003084351,"threshold_uncertainty_score":0.35100505},"labels":[],"label_agreement":null},{"id":"W2097120215","doi":"10.1109/iccsa.2008.71","title":"Functional Decomposition of Symbolic Polynomials","year":2008,"lang":"en","type":"article","venue":"","topic":"Polynomial and algebraic computation","field":"Computer Science","cited_by":13,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"","keywords":"Polynomial; Combinatorics; Computer science; Algorithm; Mathematics","score_opus":0.021336685678768414,"score_gpt":0.24020364092624483,"score_spread":0.2188669552474764,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2097120215","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4418113,0.000029227924,0.5530348,0.00043381233,0.00024087826,0.000040564373,5.6625714e-7,0.00008136365,0.004327468],"genre_scores_gemma":[0.9864825,0.0000045058664,0.012771763,0.00021554308,0.000081739694,0.0000026294067,0.0000029297653,0.0000021660624,0.0004362363],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"observational","domain_scores_codex":[0.9994296,0.000021245809,0.00016954605,0.00013988471,0.00014059711,0.000099147284],"domain_scores_gemma":[0.99965763,0.00005341487,0.000056237415,0.00014430728,0.000044486605,0.00004392454],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000062331485,0.00005659681,0.00009350202,0.0000803894,0.00007646007,0.000010822554,0.0001828059,0.00002310394,0.00006111575],"category_scores_gemma":[0.000006761052,0.00005029154,0.000050870127,0.00017941087,0.000031300522,0.00025498925,0.00006717678,0.000029907436,0.000077228106],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005005525,0.00047979457,0.0051581534,0.00002386411,0.000073654934,0.000022346247,0.0012888507,0.0021518394,0.13613434,0.69208217,0.038239047,0.12429587],"study_design_scores_gemma":[0.0015027884,0.0002786037,0.6222634,0.000023312214,0.000009600925,0.00044403423,0.000015750657,0.07531809,0.2681533,0.029112045,0.0023835069,0.00049556576],"about_ca_topic_score_codex":0.000039602255,"about_ca_topic_score_gemma":0.0000015470788,"teacher_disagreement_score":0.6629701,"about_ca_system_score_codex":0.00001403367,"about_ca_system_score_gemma":0.000058876965,"threshold_uncertainty_score":0.20508294},"labels":[],"label_agreement":null},{"id":"W2097184013","doi":"10.1016/j.laa.2011.10.018","title":"Roots multiplicity and square-free factorization of polynomials using companion matrices","year":2011,"lang":"en","type":"preprint","venue":"Linear Algebra and its Applications","topic":"Polynomial and algebraic computation","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Regina","funders":"","keywords":"Monic polynomial; Multiplicity (mathematics); Mathematics; Factorization; Combinatorics; Algebraic number; Product (mathematics); Square (algebra); Polynomial; Algebraic closure; Square root; Discrete mathematics; Mathematical analysis; Geometry; Algorithm","score_opus":0.03458205706417181,"score_gpt":0.2718994623680091,"score_spread":0.2373174053038373,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2097184013","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3106636,0.0012939124,0.68674785,0.00012932399,0.0001530589,0.00071673107,0.000083830295,0.000112440444,0.00009925259],"genre_scores_gemma":[0.97312945,0.00030153693,0.026150798,0.000037640923,0.00022546855,0.00005952318,0.00005602235,0.00001713802,0.000022448528],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99842995,0.0000623396,0.0005060937,0.0006187375,0.00018861618,0.00019426565],"domain_scores_gemma":[0.99844533,0.000130453,0.0004991762,0.00062067475,0.00017121862,0.00013317332],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00016607795,0.00026054974,0.00038369995,0.0002191619,0.0001934135,0.0001125775,0.00066239986,0.00021762431,0.000005432481],"category_scores_gemma":[0.000036834706,0.0002575959,0.00006915588,0.00029179358,0.00006118119,0.00027654786,0.0014329404,0.00019263901,0.0000037902578],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006257064,0.0011065745,0.00969605,0.0027177497,0.0004078558,0.0000026822238,0.006767952,0.005175067,0.04982689,0.75089663,0.0004013876,0.17293856],"study_design_scores_gemma":[0.001141592,0.00011170019,0.056620967,0.00028634613,0.00018042194,0.000020653164,0.000055263103,0.75387514,0.017027998,0.16832511,0.0012497044,0.0011050889],"about_ca_topic_score_codex":0.00031253463,"about_ca_topic_score_gemma":0.000015131766,"teacher_disagreement_score":0.7487001,"about_ca_system_score_codex":0.000027000237,"about_ca_system_score_gemma":0.00009575432,"threshold_uncertainty_score":0.9999876},"labels":[],"label_agreement":null},{"id":"W2098088075","doi":"10.1109/sice.2008.4655236","title":"On the Hankel singular values for a parametric system","year":2008,"lang":"en","type":"article","venue":"","topic":"Polynomial and algebraic computation","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Cybernet Systems Corporation (Canada)","funders":"","keywords":"Sigma; Polynomial; Combinatorics; Mathematics; Algorithm; Discrete mathematics; Mathematical analysis; Physics","score_opus":0.0290543937245372,"score_gpt":0.2308421254666538,"score_spread":0.20178773174211662,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2098088075","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15664205,0.00003457444,0.83942026,0.0010258293,0.0002806168,0.00020162803,3.863688e-7,0.00018010466,0.0022145403],"genre_scores_gemma":[0.9850956,7.749229e-7,0.013653893,0.000515428,0.000064028034,0.000022132172,3.2273442e-7,0.0000031624902,0.000644664],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994101,0.00003169665,0.00010515643,0.0001723517,0.00014371697,0.00013701117],"domain_scores_gemma":[0.9991019,0.000553679,0.000037217123,0.00023884932,0.000036469824,0.000031912696],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00017162196,0.00006528709,0.00007501306,0.00006918709,0.00025255277,0.000061307815,0.00037751257,0.000019313928,0.0000023869197],"category_scores_gemma":[0.00008067793,0.00003764758,0.000060067458,0.00033306188,0.000021578478,0.00008883428,0.000051278672,0.000033611712,0.00005730707],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000004424683,0.000032643024,0.00001574326,0.000009246069,0.000009796563,0.0000042460715,0.00025831105,0.00049408566,0.00003924813,0.9755056,0.0080211945,0.015605467],"study_design_scores_gemma":[0.00024720485,0.00015493833,0.000782777,0.000017699147,0.0000031219918,0.000033724104,0.000025509233,0.96654195,0.0018450316,0.028919129,0.0013075797,0.00012136133],"about_ca_topic_score_codex":0.000018514342,"about_ca_topic_score_gemma":3.7293418e-7,"teacher_disagreement_score":0.9660478,"about_ca_system_score_codex":0.000028077438,"about_ca_system_score_gemma":0.00003275045,"threshold_uncertainty_score":0.19424573},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.0072740607135053465,"score_gpt":0.21692893685422238,"score_spread":0.20965487614071704,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2099082421","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9514301,0.00057730824,0.032142274,0.0044321623,0.008920292,0.00021011369,0.000001100333,0.000039248935,0.0022474118],"genre_scores_gemma":[0.9984764,0.000060685885,0.0008135312,0.00020184358,0.00034374546,0.0000019101583,1.5978941e-7,0.0000051142847,0.0000966404],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987337,0.00021988321,0.00045806257,0.00009443926,0.00035311442,0.00014078338],"domain_scores_gemma":[0.9987455,0.0003372616,0.0004053317,0.00018695921,0.0002311862,0.000093741364],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00037893685,0.0001039584,0.0002948816,0.000096948264,0.00004932306,0.00005712336,0.0006169303,0.00004146041,0.000074097276],"category_scores_gemma":[0.00024752418,0.00007632645,0.00014714892,0.00018774945,0.00007819152,0.00074512477,0.00009582139,0.00016904957,0.000014915246],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001736779,0.00014393638,0.000086214095,0.000024710465,0.000036839523,0.000005846634,0.00027298747,0.00002319596,0.00057070464,0.9826571,0.0031163422,0.0128884865],"study_design_scores_gemma":[0.0010679188,0.0015419982,0.00656651,0.00018380907,0.000010984268,0.000035531706,0.000032267893,0.00012020298,0.005616288,0.98277426,0.0019380584,0.00011216684],"about_ca_topic_score_codex":0.000004288454,"about_ca_topic_score_gemma":1.2314739e-7,"teacher_disagreement_score":0.04704628,"about_ca_system_score_codex":0.000024580107,"about_ca_system_score_gemma":0.000078470526,"threshold_uncertainty_score":0.3112502},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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)","score_opus":0.01027692145734738,"score_gpt":0.22993579531786584,"score_spread":0.21965887386051847,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2100552771","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.014428891,0.00047395861,0.94507825,0.00055840635,0.00017976835,0.0007233253,0.0000014768071,0.00015764311,0.038398262],"genre_scores_gemma":[0.6929348,0.000026495447,0.30647862,0.0002001319,0.000029461822,0.000080762344,0.0000010035396,0.000013015781,0.00023570913],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99896425,0.000029118597,0.0002462586,0.00027429318,0.00021037998,0.000275683],"domain_scores_gemma":[0.99903697,0.00032113187,0.00014694025,0.00043077976,0.000018355533,0.000045835302],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00029811304,0.00017000134,0.00020629643,0.000050555802,0.00011539447,0.00008335011,0.00054434105,0.00003547716,0.000006763851],"category_scores_gemma":[0.000034168992,0.00008324475,0.000022851753,0.00032219957,0.000070916336,0.00017969911,0.000073642754,0.00012151954,0.00004555344],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000015395171,0.00022143291,0.00002840079,0.000082951985,0.000014454606,0.000020117941,0.0021958577,0.003951342,0.001748909,0.8857329,0.00010613795,0.105882086],"study_design_scores_gemma":[0.005664037,0.00047436854,0.00033532784,0.00032023108,0.0000664126,0.0006076593,0.0016043778,0.09489312,0.07239399,0.6298667,0.19136758,0.0024061722],"about_ca_topic_score_codex":0.000008675336,"about_ca_topic_score_gemma":0.000045813733,"teacher_disagreement_score":0.6785059,"about_ca_system_score_codex":0.00003270388,"about_ca_system_score_gemma":0.000056275952,"threshold_uncertainty_score":0.33946222},"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,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_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)","score_opus":0.00979432748980266,"score_gpt":0.2506469350022867,"score_spread":0.24085260751248402,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2100899126","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.069537595,0.000034270535,0.9258408,0.0021935278,0.0003238116,0.0001855435,0.0000018506164,0.00015992679,0.0017226913],"genre_scores_gemma":[0.9046885,0.0000016489729,0.094842,0.00034843842,0.00010041499,0.0000018516383,0.0000029661228,0.0000034434604,0.0000107726155],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99799645,0.00007580242,0.0004116717,0.0005406864,0.0005499321,0.00042546805],"domain_scores_gemma":[0.99891454,0.000099137054,0.00014385565,0.0004794351,0.00015253368,0.00021050054],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008112983,0.00016803117,0.00023747045,0.00016178301,0.00016193662,0.00025167875,0.001763892,0.00004892093,0.000023357772],"category_scores_gemma":[0.000038369817,0.0001376481,0.00007528858,0.00096544455,0.0010042064,0.0007500751,0.00032956144,0.00012393176,0.00001853224],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000007918184,0.00010530974,0.000011360392,0.0000026809903,0.0000020496832,0.0000011697036,0.00024439412,0.00003821249,0.013703662,0.63662195,0.000114096474,0.34914717],"study_design_scores_gemma":[0.00034768274,0.0011631501,0.001274889,0.000051006675,0.0000047372887,0.00001627361,0.000003507178,0.7396127,0.037023015,0.22010772,0.0001412621,0.00025404457],"about_ca_topic_score_codex":0.0000043546247,"about_ca_topic_score_gemma":2.908565e-7,"teacher_disagreement_score":0.83515084,"about_ca_system_score_codex":0.000038340517,"about_ca_system_score_gemma":0.00009781797,"threshold_uncertainty_score":0.5613127},"labels":[],"label_agreement":null},{"id":"W2102023641","doi":"10.1109/sfcs.1991.185394","title":"Lower bounds for polynomial evaluation and interpolation problems","year":2002,"lang":"en","type":"article","venue":"","topic":"Polynomial and algebraic computation","field":"Computer Science","cited_by":21,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Omega; Interpolation (computer graphics); Polynomial; Combinatorics; Algebraic number; Set (abstract data type); Mathematics; Constant (computer programming); Upper and lower bounds; Binary logarithm; Polynomial interpolation; Discrete mathematics; Linear interpolation; Computer science; Mathematical analysis; Artificial intelligence; Physics; Image (mathematics)","score_opus":0.03171822493798025,"score_gpt":0.26053902606208734,"score_spread":0.22882080112410708,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2102023641","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07023178,0.00015979804,0.9211903,0.0022976345,0.00066064653,0.0005119631,9.565431e-7,0.00012271926,0.0048241806],"genre_scores_gemma":[0.983671,0.0000031367026,0.015269204,0.00023108888,0.00012432915,0.000039969986,0.0000027974402,0.0000038166154,0.0006546353],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99935985,0.000022780954,0.0001400295,0.00021652259,0.00013602087,0.00012482198],"domain_scores_gemma":[0.99966127,0.000057442707,0.000047376037,0.00011937068,0.0000713041,0.000043268712],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00025271002,0.000069162845,0.00006484496,0.000064994245,0.00009501139,0.00017562586,0.00012873071,0.000031306565,0.000063791296],"category_scores_gemma":[0.000032811633,0.00006094287,0.000028175562,0.000102168604,0.000017073786,0.0004980526,0.00005553173,0.0000292326,0.000017497328],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009283764,0.00007554266,0.00016657307,0.000013498268,0.000013122909,1.9887634e-7,0.0011285724,0.00015417114,0.0020638863,0.019250844,0.014271979,0.9628523],"study_design_scores_gemma":[0.0005093463,0.00012061297,0.0009007486,0.000006168691,0.000004987424,0.000003857377,0.0000046557343,0.98540556,0.00015061785,0.007543169,0.005260072,0.00009022626],"about_ca_topic_score_codex":0.000014691275,"about_ca_topic_score_gemma":0.000014107001,"teacher_disagreement_score":0.98525137,"about_ca_system_score_codex":0.000026879467,"about_ca_system_score_gemma":0.000014171447,"threshold_uncertainty_score":0.24851783},"labels":[],"label_agreement":null},{"id":"W2105849952","doi":"10.1145/2429135.2429173","title":"POLY","year":2013,"lang":"en","type":"article","venue":"ACM communications in computer algebra","topic":"Polynomial and algebraic computation","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Maple; Speedup; Computer science; Kernel (algebra); Scalability; Parallel computing; Overhead (engineering); Data structure; Theoretical computer science; Mathematics; Operating system; Combinatorics; Botany","score_opus":0.029636398076779175,"score_gpt":0.2762222967101013,"score_spread":0.24658589863332211,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2105849952","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.039388664,0.0013502713,0.92614514,0.02916915,0.00053339737,0.0004345183,0.0000011061838,0.0005348274,0.002442933],"genre_scores_gemma":[0.58650225,0.00003995543,0.41195688,0.0013079691,0.000058039263,0.00007246914,0.0000076191573,0.000007888557,0.00004695494],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99854076,0.00018604078,0.00041397187,0.00035234584,0.00017852648,0.00032836988],"domain_scores_gemma":[0.99471605,0.0005362803,0.0000990391,0.0044502937,0.00009514367,0.000103177794],"candidate_categories":["open_science","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00022455146,0.00016725113,0.0001855701,0.00026432026,0.0001851233,0.0003368203,0.0069175926,0.00006559588,0.000036782058],"category_scores_gemma":[0.00005229381,0.00016871307,0.000069458016,0.00079897424,0.00009902514,0.0010620457,0.004257863,0.0002786222,0.0007949892],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[5.4586934e-7,0.0001451356,0.0012740245,0.0000037445513,0.000011298004,0.0000016345117,0.0006351054,0.00003050629,0.00007558783,0.12068001,0.0033746762,0.87376773],"study_design_scores_gemma":[0.000574148,0.00006926517,0.09676222,0.00004508025,0.0000032199384,0.000030060712,0.000015123988,0.60225743,0.0001622343,0.29197645,0.0076796827,0.0004250919],"about_ca_topic_score_codex":0.00034939102,"about_ca_topic_score_gemma":0.0000455385,"teacher_disagreement_score":0.87334263,"about_ca_system_score_codex":0.00006891531,"about_ca_system_score_gemma":0.00007097958,"threshold_uncertainty_score":0.999983},"labels":[],"label_agreement":null},{"id":"W2107482418","doi":"10.1016/j.jco.2014.09.004","title":"A deterministic algorithm for inverting a polynomial matrix","year":2014,"lang":"en","type":"article","venue":"Journal of Complexity","topic":"Polynomial and algebraic computation","field":"Computer Science","cited_by":16,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Mathematics; Exponent; Matrix multiplication; Inverse; Univariate; Matrix (chemical analysis); Polynomial matrix; Invariant (physics); Combinatorics; Upper and lower bounds; Field (mathematics); Polynomial; Discrete mathematics; Algorithm; Matrix polynomial; Pure mathematics; Mathematical analysis; Statistics; Geometry","score_opus":0.03252501886350941,"score_gpt":0.2923396275986458,"score_spread":0.2598146087351364,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2107482418","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.051106498,0.0000297324,0.9469866,0.0007933901,0.00078681484,0.00007743492,0.0000021804813,0.000027602402,0.00018971629],"genre_scores_gemma":[0.47122315,6.596701e-7,0.5277023,0.000278149,0.00076062593,0.0000015562136,5.1173186e-7,0.0000054500774,0.000027649341],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99888194,0.00007814205,0.0004856537,0.0001299629,0.00021431949,0.00020998926],"domain_scores_gemma":[0.99875957,0.00030905582,0.0004716895,0.0001559398,0.00017326696,0.0001304908],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006551783,0.000102696715,0.00025806142,0.00012149235,0.00012856489,0.00013206447,0.0006041975,0.0000338496,0.000004495345],"category_scores_gemma":[0.00018362404,0.00008783982,0.00017218673,0.00013267201,0.00004746042,0.00031840993,0.00010955521,0.000120191406,0.0000067305396],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000026351048,0.0000635662,0.00005457995,0.00001757563,0.000023095705,0.0000062221284,0.00024455358,0.00003997945,0.0003756215,0.030793939,0.0016530438,0.96670145],"study_design_scores_gemma":[0.0009803602,0.000417869,0.002042851,0.000029039253,0.000012827021,0.00017977844,0.0000060687566,0.84233576,0.0004995154,0.1453803,0.007987075,0.00012855367],"about_ca_topic_score_codex":0.000007600839,"about_ca_topic_score_gemma":0.000003074833,"teacher_disagreement_score":0.96657294,"about_ca_system_score_codex":0.000044474367,"about_ca_system_score_gemma":0.00011172028,"threshold_uncertainty_score":0.3582004},"labels":[],"label_agreement":null},{"id":"W2107523825","doi":"10.1007/s11853-008-0015-2","title":"Elimination theory and Newton polytopes","year":2008,"lang":"en","type":"article","venue":"Functional Analysis and Other Mathematics","topic":"Polynomial and algebraic computation","field":"Computer Science","cited_by":37,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Polytope; Mathematics; Mathematical economics; Calculus (dental); Computer science; Combinatorics","score_opus":0.01790574541157733,"score_gpt":0.21873506434218942,"score_spread":0.2008293189306121,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2107523825","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.23280787,0.00013213478,0.7659482,0.00039746898,0.000033607488,0.000031287764,0.0000014169547,0.00003758677,0.0006104228],"genre_scores_gemma":[0.98301995,0.00002245546,0.014204247,0.00044303946,0.000074807336,0.0000047599533,0.0000031111604,0.000005223971,0.0022223904],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994239,0.00003284177,0.00014350715,0.00016855834,0.00015082378,0.00008032939],"domain_scores_gemma":[0.9995651,0.00017238435,0.000069451045,0.00011455216,0.000032334392,0.00004618051],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00022931625,0.000079230595,0.00013440434,0.00016066435,0.00015951147,0.000050762832,0.00007329569,0.000025795205,0.000052701795],"category_scores_gemma":[0.000024668361,0.000060761446,0.000054392218,0.0003462741,0.000047509886,0.00014745686,0.000054558077,0.00003403869,0.000010515584],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008141809,0.000091171816,0.00471416,0.000015999545,0.00030667827,0.0000022657448,0.0018303408,0.00018780056,0.00029630438,0.9776794,0.00036639298,0.014501358],"study_design_scores_gemma":[0.0004960922,0.00009031756,0.2894134,0.00001805988,0.0003898922,0.000119178934,0.00018141088,0.3596717,0.0006348216,0.3452154,0.003371067,0.00039864253],"about_ca_topic_score_codex":0.000014422057,"about_ca_topic_score_gemma":0.000008943584,"teacher_disagreement_score":0.751744,"about_ca_system_score_codex":0.0000072214566,"about_ca_system_score_gemma":0.000012455202,"threshold_uncertainty_score":0.24777798},"labels":[],"label_agreement":null},{"id":"W2108965631","doi":"10.1145/1145768.1145824","title":"Application of numerical algebraic geometry and numerical linear algebra to PDE","year":2006,"lang":"en","type":"article","venue":"","topic":"Polynomial and algebraic computation","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"","keywords":"Numerical linear algebra; Mathematics; Linear algebra; Symbolic computation; Numerical analysis; Nonlinear system; Algebra over a field; Linear system; Polynomial; Algebraic number; Algebraic geometry; Matrix (chemical analysis); Ideal (ethics); Applied mathematics; Pure mathematics; Mathematical analysis; Geometry","score_opus":0.006188495417173789,"score_gpt":0.22872242245554006,"score_spread":0.22253392703836627,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2108965631","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.113047704,0.000046675894,0.8843322,0.0014950351,0.00006965457,0.00014705428,0.0000012364096,0.00012793562,0.00073251355],"genre_scores_gemma":[0.9129704,7.4793036e-7,0.08626561,0.000484979,0.00011624697,0.000013447169,0.00000463063,0.0000067179476,0.00013722778],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99885815,0.000028826345,0.00029616887,0.00037598299,0.00022657715,0.000214301],"domain_scores_gemma":[0.999357,0.000106229716,0.00007701747,0.00028369538,0.00005331166,0.00012276092],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00012315187,0.00012212596,0.0001900867,0.00014773176,0.000056660203,0.0000419406,0.0003483224,0.000049548253,0.0000136668195],"category_scores_gemma":[0.000023326797,0.000108453474,0.00004618389,0.0007944961,0.000030084484,0.00019894852,0.00023464361,0.00006995561,0.00008402737],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000016850308,0.0003278953,0.008061549,0.000031191943,0.000019945677,0.0000034175987,0.00019854322,0.002057868,0.010651224,0.545781,0.0029807952,0.4298697],"study_design_scores_gemma":[0.00055924646,0.00028638355,0.1586111,0.000011346614,0.000010945822,0.000031590105,0.000011975324,0.7770818,0.015788868,0.03840807,0.00873714,0.00046154496],"about_ca_topic_score_codex":0.00037976695,"about_ca_topic_score_gemma":0.00000282144,"teacher_disagreement_score":0.7999227,"about_ca_system_score_codex":0.000020192017,"about_ca_system_score_gemma":0.00002913179,"threshold_uncertainty_score":0.44226044},"labels":[],"label_agreement":null},{"id":"W2111878548","doi":"10.1016/j.jsc.2014.02.003","title":"On the length of integers in telescopers for proper hypergeometric terms","year":2014,"lang":"en","type":"article","venue":"Journal of Symbolic Computation","topic":"Polynomial and algebraic computation","field":"Computer Science","cited_by":12,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Capilano University; Simon Fraser University","funders":"","keywords":"Mathematics; Telescoping series; Bivariate analysis; Integer (computer science); Quintic function; Hypergeometric distribution; Combinatorics; Order (exchange); Hypergeometric identity; Upper and lower bounds; Degree (music); Term (time); Binomial (polynomial); Hypergeometric function; Discrete mathematics; Confluent hypergeometric function; Pure mathematics; Hypergeometric function of a matrix argument; Statistics; Mathematical analysis","score_opus":0.01440523090187036,"score_gpt":0.23948412278618766,"score_spread":0.22507889188431732,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2111878548","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.54811156,0.000021940963,0.45007375,0.0011108884,0.0002973606,0.00013734831,3.3275427e-7,0.0000067241563,0.00024013502],"genre_scores_gemma":[0.9940834,0.000004615389,0.005562038,0.00022520666,0.00010158369,0.0000038731832,4.99254e-7,0.000005816077,0.000012976361],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988733,0.00010295009,0.0004961499,0.00012033167,0.00027196173,0.00013529265],"domain_scores_gemma":[0.99849564,0.00076000876,0.00041560282,0.000112859365,0.00017365135,0.00004224587],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00095806096,0.00009274623,0.00022243212,0.0005206113,0.00004618143,0.000049764232,0.00042683235,0.00003194781,0.000002094438],"category_scores_gemma":[0.00037794554,0.00005710566,0.0001033607,0.00067391834,0.000031462216,0.00024104046,0.000039562983,0.00013929469,0.0000030291576],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000855578,0.00022913117,0.0005507959,0.000044547847,0.00004053178,0.0000019040276,0.0020629598,0.08219246,0.0019595094,0.059599694,0.0009677699,0.8522651],"study_design_scores_gemma":[0.002062483,0.0015591198,0.032708187,0.00029164096,0.000018340352,0.000046209196,0.00015247542,0.8906964,0.0038150346,0.06763152,0.0007860753,0.00023250771],"about_ca_topic_score_codex":0.00001019285,"about_ca_topic_score_gemma":0.0000019857468,"teacher_disagreement_score":0.8520326,"about_ca_system_score_codex":0.000055020486,"about_ca_system_score_gemma":0.000068903835,"threshold_uncertainty_score":0.23287012},"labels":[],"label_agreement":null},{"id":"W2112151791","doi":"10.1016/j.jsc.2012.05.013","title":"Computing with semi-algebraic sets: Relaxation techniques and effective boundaries","year":2012,"lang":"en","type":"article","venue":"Journal of Symbolic Computation","topic":"Polynomial and algebraic computation","field":"Computer Science","cited_by":12,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"","keywords":"Mathematics; Algebraic number; Parametric statistics; Relaxation (psychology); Chen; Decomposition; Boundary (topology); Polynomial; Characterization (materials science); Algebraic properties; Real algebraic geometry; Algebra over a field; Discrete mathematics; Pure mathematics; Mathematical analysis","score_opus":0.006640947570208393,"score_gpt":0.24592998221887238,"score_spread":0.239289034648664,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2112151791","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.51069343,0.00035601197,0.48797113,0.00034315218,0.00026915324,0.00014211044,3.3718473e-7,0.00006585382,0.00015881215],"genre_scores_gemma":[0.95338565,0.000011519638,0.046105064,0.00010376025,0.00037274204,0.0000025259596,0.000002060636,0.000010610608,0.000006045273],"study_design_codex":"design_other","study_design_gemma":"observational","domain_scores_codex":[0.99867415,0.00014667919,0.00042990877,0.0001568066,0.00034761862,0.00024480786],"domain_scores_gemma":[0.99853146,0.00028302564,0.0006822628,0.000097729295,0.0002634994,0.0001420201],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007346123,0.00016418347,0.00026935767,0.0002869462,0.00027275019,0.0003414175,0.00018917197,0.00006023969,0.00000111979],"category_scores_gemma":[0.0000513895,0.00013038558,0.00005282607,0.00040025418,0.00010303852,0.0015993487,0.000097336604,0.00022153609,0.0000031202069],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000059553295,0.00011795455,0.0065839114,0.00005672541,0.000086265274,0.000016636544,0.009907041,0.0008105604,0.0005879338,0.017043212,0.0003042777,0.9644259],"study_design_scores_gemma":[0.005870409,0.004359988,0.64249414,0.0015768403,0.00027583275,0.011465762,0.0010884652,0.22641616,0.018871618,0.07574323,0.010010513,0.0018270557],"about_ca_topic_score_codex":0.000013555125,"about_ca_topic_score_gemma":0.0000013610891,"teacher_disagreement_score":0.96259886,"about_ca_system_score_codex":0.00010277284,"about_ca_system_score_gemma":0.00011681363,"threshold_uncertainty_score":0.531697},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.018389445446087435,"score_gpt":0.2752023028350068,"score_spread":0.25681285738891935,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2113737071","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5532261,0.000025986725,0.4445142,0.00039571838,0.0016764059,0.00004776698,3.5781844e-7,0.000025372978,0.00008809919],"genre_scores_gemma":[0.9323375,0.0000022928891,0.06682325,0.00013406988,0.00068162143,3.9279143e-7,8.7205666e-7,0.000008668497,0.000011297036],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99854654,0.00006791501,0.0005839236,0.00017789511,0.00041168503,0.00021203031],"domain_scores_gemma":[0.9987164,0.00012804533,0.0005660254,0.00015995993,0.0002647746,0.00016480549],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00052356074,0.00013849884,0.00024950766,0.0003445836,0.000139698,0.00020716581,0.00047565126,0.00007264173,0.000009447673],"category_scores_gemma":[0.00007278803,0.00012258584,0.00014339639,0.00039146474,0.000037577727,0.00088337046,0.00013052397,0.00035831757,0.000015074813],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005542994,0.00033670067,0.0020285498,0.000024733454,0.00006845852,0.00007992882,0.002698833,0.0363419,0.16058521,0.0070943465,0.0017608001,0.7889251],"study_design_scores_gemma":[0.0013564184,0.00026921168,0.042738535,0.00006837377,0.000023790808,0.0008026509,0.00003359344,0.9370119,0.003798684,0.012264069,0.0013369047,0.0002958615],"about_ca_topic_score_codex":0.000029914798,"about_ca_topic_score_gemma":0.0000051848315,"teacher_disagreement_score":0.90067,"about_ca_system_score_codex":0.000049760005,"about_ca_system_score_gemma":0.00023278013,"threshold_uncertainty_score":0.49989054},"labels":[],"label_agreement":null},{"id":"W2115902466","doi":"10.1007/s00453-011-9537-y","title":"Interval Partitions and Polynomial Factorization","year":2011,"lang":"en","type":"article","venue":"Algorithmica","topic":"Polynomial and algebraic computation","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo; Carleton University","funders":"","keywords":"Factorization; Combinatorics; Mathematics; Theory of computation; Interval (graph theory); Polynomial; Discrete mathematics; Computer science; Algorithm","score_opus":0.025045562598744006,"score_gpt":0.21955492468266774,"score_spread":0.19450936208392372,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2115902466","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.052720863,0.000031000305,0.9436882,0.00035870448,0.00055493315,0.000073673946,0.0000033579795,0.0001643366,0.002404928],"genre_scores_gemma":[0.9695982,0.000003349169,0.030037126,0.00013825312,0.000119129945,0.0000063080806,0.0000037062516,0.000004062428,0.00008991207],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994527,0.00002357847,0.00012083682,0.00019438092,0.00007275885,0.0001357493],"domain_scores_gemma":[0.9996977,0.000022828048,0.000038426468,0.00014074238,0.000025189647,0.00007514513],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000052296313,0.00007234301,0.00007187736,0.000055592438,0.00008475412,0.000056078556,0.00019595594,0.000030749907,0.000026836558],"category_scores_gemma":[0.000011581315,0.00006841573,0.000025083255,0.00012596943,0.00003364233,0.0003866979,0.00012739882,0.000053541833,0.00004368731],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010993778,0.00014419723,0.00089928525,0.000008109879,0.000036294474,0.000014220253,0.00472144,0.000004108282,0.0013158758,0.0761096,0.0030591052,0.91367674],"study_design_scores_gemma":[0.0030673048,0.0012378348,0.2758385,0.00009094181,0.000071914634,0.000253645,0.00023960973,0.3246036,0.075980805,0.28013703,0.036507286,0.0019715577],"about_ca_topic_score_codex":0.00006411875,"about_ca_topic_score_gemma":0.000004598578,"teacher_disagreement_score":0.91687727,"about_ca_system_score_codex":0.000012980429,"about_ca_system_score_gemma":0.000022724389,"threshold_uncertainty_score":0.27899125},"labels":[],"label_agreement":null},{"id":"W2115982610","doi":"10.1145/1993886.1993913","title":"Computing hermite forms of polynomial matrices","year":2011,"lang":"en","type":"article","venue":"","topic":"Polynomial and algebraic computation","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Hermite polynomials; Invertible matrix; Degree (music); Mathematics; Dimension (graph theory); Matrix (chemical analysis); Polynomial matrix; Polynomial; Field (mathematics); Las vegas; Degree of a polynomial; Combinatorics; Matrix polynomial; Discrete mathematics; Algorithm; Pure mathematics; Mathematical analysis; Physics","score_opus":0.02136985856734581,"score_gpt":0.22895129660913904,"score_spread":0.20758143804179324,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2115982610","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4750405,0.000034191522,0.49512693,0.00005485637,0.00025061946,0.00006070131,4.1138648e-7,0.00013610414,0.029295692],"genre_scores_gemma":[0.9397688,0.0000012447687,0.059956424,0.00009672579,0.000045486104,5.4521126e-7,4.047247e-7,0.000003094853,0.0001272736],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99932355,0.000014697723,0.0002197701,0.00016571132,0.00011389653,0.00016235208],"domain_scores_gemma":[0.99957985,0.00003881495,0.00010867327,0.00018859409,0.00003264149,0.000051413423],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00012523083,0.000075173004,0.00011415149,0.00008540468,0.000046499503,0.000025840609,0.00048675752,0.000027301436,0.000031634576],"category_scores_gemma":[0.0000058921,0.000058690912,0.00005619852,0.00023706343,0.000024649791,0.00035304567,0.00021891564,0.000041953805,0.00003599027],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000022813016,0.0001923739,0.0065475875,0.000038262348,0.00003775737,0.000010467138,0.0049347626,0.00006166982,0.0018493226,0.3096728,0.0014441297,0.67518806],"study_design_scores_gemma":[0.0027594755,0.0009987849,0.3445801,0.00012324692,0.000033040942,0.0001203122,0.00040450963,0.38301015,0.21090908,0.052113306,0.0035208198,0.0014271563],"about_ca_topic_score_codex":0.0001661341,"about_ca_topic_score_gemma":0.00000773777,"teacher_disagreement_score":0.6737609,"about_ca_system_score_codex":0.000009101548,"about_ca_system_score_gemma":0.00003267804,"threshold_uncertainty_score":0.2393346},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"Agence Nationale de la Recherche","keywords":"Bounded function; Combinatorics; Degree (music); Mathematics; Algebraic number; Domain (mathematical analysis); Polynomial; Field (mathematics); Discrete mathematics; Physics; Mathematical analysis; Pure mathematics","score_opus":0.018690733444441898,"score_gpt":0.27394048689772804,"score_spread":0.25524975345328615,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2118254039","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00806873,0.000020995576,0.98951924,0.00074295676,0.0004066769,0.0004742352,0.000038637663,0.00014554174,0.0005829777],"genre_scores_gemma":[0.064651355,0.0000011585264,0.9345382,0.00019564845,0.00015155187,0.00006498809,0.00015287993,0.000020303287,0.00022394891],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99811375,0.00006797009,0.0007080867,0.0003485748,0.0004866507,0.00027496144],"domain_scores_gemma":[0.9975847,0.001014742,0.0004153531,0.00038739064,0.00048545454,0.000112351714],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004861031,0.0002159987,0.00033277294,0.0002387221,0.00025038832,0.00018296373,0.00067741395,0.00006789687,0.000022450788],"category_scores_gemma":[0.00013174441,0.0002145084,0.00016943994,0.0003978977,0.00008373747,0.00045683363,0.0001639083,0.00008444193,0.00006405766],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000021919143,0.00022973777,0.000004026666,0.000072747454,0.000053741136,3.485834e-7,0.00036334875,0.013115555,0.00007287522,0.7146649,0.0013570724,0.2700635],"study_design_scores_gemma":[0.0004815488,0.00009499455,0.00047467387,0.000027772947,0.000014668839,0.000012383951,0.000013770483,0.6507913,0.00005340651,0.34608737,0.0017921501,0.00015598854],"about_ca_topic_score_codex":0.000011320098,"about_ca_topic_score_gemma":0.0000046756736,"teacher_disagreement_score":0.6376757,"about_ca_system_score_codex":0.000056346536,"about_ca_system_score_gemma":0.0002084804,"threshold_uncertainty_score":0.8747399},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.017282353392726425,"score_gpt":0.25854077965555283,"score_spread":0.2412584262628264,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2120802615","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4613039,0.000053362524,0.5274461,0.009462548,0.00028822632,0.000058213427,1.8331828e-7,0.000022806475,0.0013646679],"genre_scores_gemma":[0.7927713,0.0000034176435,0.20651592,0.00030961385,0.0003671372,4.419935e-7,2.917497e-8,0.0000023677135,0.000029779741],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99842715,0.00006853598,0.0005759849,0.00017085452,0.0004875095,0.0002699648],"domain_scores_gemma":[0.9991469,0.00027878396,0.00027541962,0.00011378592,0.00005327232,0.00013188731],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014438721,0.00010481954,0.00024574602,0.00023446708,0.00008797262,0.00022120531,0.0010633832,0.000040136558,0.000046954447],"category_scores_gemma":[0.00007970655,0.00007136208,0.00008861792,0.000544013,0.00013466006,0.001064308,0.00018474243,0.0001695602,0.00005503596],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000023419265,0.0006009671,0.0005931525,0.000034686927,0.000024453391,0.000085996166,0.003623527,0.009334317,0.0012081321,0.48288316,0.0023520554,0.49923614],"study_design_scores_gemma":[0.0011056991,0.00053961895,0.00787206,0.00023744568,0.000009198127,0.000529896,0.000051601848,0.7690648,0.0016603731,0.216251,0.0023579344,0.00032041388],"about_ca_topic_score_codex":0.0000061536352,"about_ca_topic_score_gemma":0.000005059701,"teacher_disagreement_score":0.75973046,"about_ca_system_score_codex":0.000059761365,"about_ca_system_score_gemma":0.00014531365,"threshold_uncertainty_score":0.29100615},"labels":[],"label_agreement":null},{"id":"W2125046550","doi":"10.1007/11856290_12","title":"An Algorithm for Computing the Complete Root Classification of a Parametric Polynomial","year":2006,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Polynomial and algebraic computation","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"","keywords":"Computer science; Root (linguistics); Parametric statistics; Algorithm; Polynomial; Mathematics","score_opus":0.025102144402294066,"score_gpt":0.2632862951510971,"score_spread":0.238184150748803,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2125046550","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0007248433,0.00021034731,0.9957781,0.000552206,0.0014536732,0.0007896455,0.000027707909,0.00012026278,0.0003432573],"genre_scores_gemma":[0.55214864,0.0000025067168,0.44658256,0.00028580957,0.0008658731,0.000011074776,0.00003170602,0.000028216004,0.000043647287],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.996399,0.00006953734,0.0008412303,0.001286501,0.00080563425,0.0005981337],"domain_scores_gemma":[0.996257,0.0013100645,0.0007233672,0.0012313791,0.00035801635,0.000120180644],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0012301361,0.00046120948,0.0005754247,0.0008809489,0.00047021097,0.00047299537,0.003575514,0.00023905188,0.000002249981],"category_scores_gemma":[0.00006143207,0.00036601844,0.00020721956,0.0010170103,0.00070106337,0.00046705804,0.0005522306,0.0004815542,0.0000057818647],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000004549403,0.000043519794,0.000023676672,0.000019756566,0.000008704553,0.000002626312,0.00020144659,0.047931354,0.00027508475,0.006874492,0.00006315183,0.94455165],"study_design_scores_gemma":[0.00035623705,0.0002764213,0.002023204,0.000101111444,0.000012285317,0.000021426995,2.1881678e-7,0.95565987,0.0004910987,0.039831012,0.00082329294,0.0004038108],"about_ca_topic_score_codex":0.00010901021,"about_ca_topic_score_gemma":0.00008038379,"teacher_disagreement_score":0.9441478,"about_ca_system_score_codex":0.00023901086,"about_ca_system_score_gemma":0.0005011061,"threshold_uncertainty_score":0.9998792},"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,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_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","score_opus":0.03688501806389176,"score_gpt":0.2866758961192889,"score_spread":0.24979087805539713,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2127412655","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5109756,0.0027062604,0.46693307,0.0056260703,0.0012067265,0.0007393938,0.0000048765532,0.00011876171,0.011689275],"genre_scores_gemma":[0.9778448,0.00034898522,0.02115449,0.00016752999,0.00035400444,0.000005466681,0.0000049688274,0.000018449638,0.00010130218],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99715257,0.00023916052,0.0012685447,0.0003573113,0.0006733674,0.00030906557],"domain_scores_gemma":[0.9977237,0.00025550395,0.001031731,0.0002505045,0.0005444615,0.0001941148],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009326838,0.00025351343,0.00064228766,0.00039435513,0.00014742081,0.0002864862,0.0013497974,0.000096584445,0.00003436634],"category_scores_gemma":[0.000033810884,0.00023363234,0.00019564471,0.00069506926,0.000071711176,0.0015658666,0.00022372368,0.00026606952,0.000040631912],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000039952905,0.0002856294,0.00009305352,0.00007911667,0.00009074996,0.000016272865,0.0049720984,0.06996448,0.00033639238,0.011607051,0.0005284035,0.91198677],"study_design_scores_gemma":[0.0072097755,0.0024569905,0.11595151,0.0013401468,0.00013714397,0.0014530531,0.000550266,0.62657404,0.0013832093,0.23489259,0.0068453862,0.0012059218],"about_ca_topic_score_codex":0.00005644484,"about_ca_topic_score_gemma":0.000010266547,"teacher_disagreement_score":0.91078085,"about_ca_system_score_codex":0.00008597877,"about_ca_system_score_gemma":0.00027986438,"threshold_uncertainty_score":0.95272505},"labels":[],"label_agreement":null},{"id":"W2128486174","doi":"10.1145/1993886.1993904","title":"Algorithms for computing triangular decompositions of polynomial systems","year":2011,"lang":"en","type":"article","venue":"","topic":"Polynomial and algebraic computation","field":"Computer Science","cited_by":33,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"","keywords":"Modulo; Polynomial; Computer science; Key (lock); Computation; Algorithm; Feature (linguistics); Maple; Theoretical computer science; Mathematics; Discrete mathematics","score_opus":0.04753445832422861,"score_gpt":0.2682049483949384,"score_spread":0.2206704900707098,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2128486174","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.021230396,0.00007165831,0.97555345,0.000066842666,0.00084624276,0.00028604874,0.0000056357153,0.00012566632,0.0018140511],"genre_scores_gemma":[0.73969954,5.231852e-7,0.26001832,0.00004167894,0.0001257919,0.000008488535,0.0000034009254,0.000004836744,0.00009745315],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999143,0.00003396509,0.0003191309,0.00021319863,0.000102265934,0.00018845189],"domain_scores_gemma":[0.9993766,0.00012312637,0.00012824665,0.00021619601,0.00008806754,0.000067745794],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00022089157,0.00009052877,0.00017854907,0.000102973645,0.00009802806,0.000042728963,0.00042503956,0.000038941525,0.0000067131373],"category_scores_gemma":[0.000013118642,0.00008145178,0.00009946119,0.00017843241,0.000025881529,0.00020375795,0.000103001265,0.000035659366,0.000008157873],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000908416,0.00065890385,0.0002971668,0.0001522576,0.00020800362,0.0000102739195,0.007503815,0.0015528129,0.008280586,0.66876346,0.0075687775,0.30491313],"study_design_scores_gemma":[0.001199323,0.00028061142,0.0016130359,0.000033210843,0.000016123347,0.000024676114,0.00010795727,0.9763509,0.016199756,0.0030685693,0.000870643,0.00023521627],"about_ca_topic_score_codex":0.00020906812,"about_ca_topic_score_gemma":0.00000237519,"teacher_disagreement_score":0.9747981,"about_ca_system_score_codex":0.000018130288,"about_ca_system_score_gemma":0.00005902894,"threshold_uncertainty_score":0.3321507},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"Agence Nationale de la Recherche","keywords":"Mathematics; 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","score_opus":0.03520197258470578,"score_gpt":0.28007410822667733,"score_spread":0.24487213564197155,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2129139293","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.002449166,0.00005558985,0.9885301,0.0011450034,0.004091383,0.00055831566,0.00002649915,0.0005024458,0.0026415144],"genre_scores_gemma":[0.9085384,0.0000044168933,0.07985016,0.00051332574,0.001230974,0.00024557678,0.00030023063,0.000023534654,0.009293362],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99848133,0.000025299865,0.00035622317,0.000593432,0.00022599936,0.0003177276],"domain_scores_gemma":[0.9986327,0.00037869136,0.00014697466,0.00057972595,0.00014338875,0.0001184867],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00014367464,0.00022428703,0.00021855129,0.00026250316,0.00021145852,0.00032478085,0.00081508886,0.0001961885,0.00010417014],"category_scores_gemma":[0.000066029424,0.00020971165,0.000256908,0.00018584261,0.000029221163,0.00016446188,0.0009647309,0.00025880008,0.00009878894],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000012381934,0.00021274877,0.000016560807,0.00008271189,0.00012280348,0.0000017495668,0.00034272927,0.0027751825,0.00032002188,0.72700804,0.020172382,0.24893269],"study_design_scores_gemma":[0.00050011475,0.00007636997,0.00096293516,0.000034969024,0.000045666726,0.0000028218278,0.000011517153,0.7777528,0.00074388663,0.21069324,0.00864157,0.0005341176],"about_ca_topic_score_codex":0.00005516225,"about_ca_topic_score_gemma":0.000049834387,"teacher_disagreement_score":0.9086799,"about_ca_system_score_codex":0.00007071161,"about_ca_system_score_gemma":0.0002168959,"threshold_uncertainty_score":0.8551793},"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,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada; Fundación Española para la Ciencia y la Tecnología","keywords":"Algorithm; Annotation; Type (biology); Computer science; Mathematics; Artificial intelligence","score_opus":0.01449186396169143,"score_gpt":0.226689905971716,"score_spread":0.21219804201002457,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2129280636","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.43659717,0.000032147007,0.54878056,0.013378272,0.00010499933,0.00030712518,0.0000030175893,0.000047866033,0.00074884103],"genre_scores_gemma":[0.7118949,0.000013763312,0.2851069,0.0018259222,0.0003409364,0.000005644688,1.7626138e-7,0.000013493106,0.000798209],"study_design_codex":"not_applicable","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987309,0.00009836847,0.00038296785,0.00016855284,0.00035233382,0.00026690803],"domain_scores_gemma":[0.99884564,0.00023180692,0.00042870204,0.00020920113,0.00011197711,0.00017269667],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00042094293,0.00013671182,0.00035333674,0.000038674392,0.00032117017,0.00006634728,0.00062426785,0.000024418972,0.000014200203],"category_scores_gemma":[0.000075041586,0.00008624386,0.00027365133,0.0004980961,0.0002788668,0.00021709877,0.0004888865,0.00023965538,0.00004275634],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003693812,0.003913185,0.0019501528,0.0002916177,0.0019186571,0.00013161947,0.08622065,0.011792579,0.03572178,0.03278253,0.57707167,0.24783619],"study_design_scores_gemma":[0.004169657,0.003941017,0.09948686,0.0006186097,0.0002465999,0.007944093,0.000557445,0.7823291,0.0020324443,0.084740974,0.012099403,0.0018338166],"about_ca_topic_score_codex":0.000012620613,"about_ca_topic_score_gemma":5.350238e-7,"teacher_disagreement_score":0.7705365,"about_ca_system_score_codex":0.00010278605,"about_ca_system_score_gemma":0.00017029486,"threshold_uncertainty_score":0.35169226},"labels":[],"label_agreement":null},{"id":"W2129388296","doi":"10.1145/1113439.1113456","title":"The RegularChains library in MAPLE","year":2005,"lang":"en","type":"article","venue":"ACM SIGSAM Bulletin","topic":"Polynomial and algebraic computation","field":"Computer Science","cited_by":39,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"","keywords":"Modulo; Arithmetic; Combinatorics; Mathematics","score_opus":0.008912965288456313,"score_gpt":0.21046265761100508,"score_spread":0.20154969232254877,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2129388296","genre_codex":"commentary","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1627506,0.0018086999,0.026797118,0.79386514,0.00068036636,0.0004257747,0.0000034347595,0.0006347229,0.013034161],"genre_scores_gemma":[0.9541111,0.00008311844,0.036083903,0.0036705208,0.00039756956,0.000025655301,0.0000042720026,0.000012900692,0.005610973],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99910194,0.00007778548,0.00018113766,0.0002301928,0.00014664161,0.00026232997],"domain_scores_gemma":[0.99884516,0.00044346903,0.000043305707,0.00060380914,0.000008779552,0.000055460583],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00022665583,0.00008509202,0.00007578813,0.000052137086,0.00013424699,0.00016475575,0.0014094957,0.00003272067,0.00008930586],"category_scores_gemma":[0.00013965661,0.0000626288,0.000039493632,0.00022774847,0.000039712835,0.00016669474,0.00068503956,0.00012382097,0.00049299194],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000011503069,0.000054385255,0.0003480582,0.0000028741522,0.0000051863904,0.000014757453,0.0006066029,0.00032191773,0.00015504923,0.08989849,0.16142334,0.7471579],"study_design_scores_gemma":[0.00023018244,0.000023920109,0.0058149677,0.000010329002,4.2564164e-7,0.0000063868874,0.000013793511,0.006997231,0.0008710826,0.015061552,0.9708635,0.0001066163],"about_ca_topic_score_codex":0.000020983758,"about_ca_topic_score_gemma":0.000020806736,"teacher_disagreement_score":0.8094402,"about_ca_system_score_codex":0.000018939287,"about_ca_system_score_gemma":0.000043229862,"threshold_uncertainty_score":0.6336579},"labels":[],"label_agreement":null},{"id":"W2130034949","doi":"10.1145/581316.581317","title":"Geometric completion of differential systems using numeric-symbolic continuation","year":2002,"lang":"en","type":"article","venue":"ACM SIGSAM Bulletin","topic":"Polynomial and algebraic computation","field":"Computer Science","cited_by":14,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"","keywords":"Mathematics; Linear subspace; Nonlinear system; Differential (mechanical device); Differential equation; Applied mathematics; Continuation; Pendulum; Algebra over a field; Algorithm; Computer science; Pure mathematics; Mathematical analysis","score_opus":0.03943660503461059,"score_gpt":0.2349297902303391,"score_spread":0.1954931851957285,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2130034949","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.50460684,0.00033719031,0.4933495,0.0005451623,0.00058930164,0.00018690866,0.000003991787,0.00009965069,0.00028145587],"genre_scores_gemma":[0.9942006,0.000015649848,0.005374395,0.00006135554,0.0001832587,0.000007788026,0.000008298358,0.000009407013,0.00013925723],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998589,0.00012523776,0.00039672942,0.00030035104,0.00034954937,0.00023913762],"domain_scores_gemma":[0.9987926,0.00027097244,0.00028377518,0.00046520322,0.00012013284,0.0000672983],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00017294046,0.00014100639,0.000264607,0.00028855554,0.00010448222,0.00011236308,0.000661681,0.00006632097,0.0002425931],"category_scores_gemma":[0.00025330915,0.00013830303,0.0000781401,0.0006901983,0.000035192486,0.00011788928,0.00024571558,0.00009614939,0.00016600145],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000079535945,0.002076159,0.008536689,0.00047681585,0.0003571728,0.000044944067,0.005156432,0.026252234,0.11704927,0.057716157,0.05893857,0.723316],"study_design_scores_gemma":[0.0013955389,0.00021701165,0.02649396,0.00011615396,0.000030200526,0.000049582603,0.00004670308,0.94430536,0.003057871,0.0006215607,0.023133542,0.00053249823],"about_ca_topic_score_codex":0.0002697222,"about_ca_topic_score_gemma":6.834533e-7,"teacher_disagreement_score":0.91805315,"about_ca_system_score_codex":0.000046085657,"about_ca_system_score_gemma":0.000011227502,"threshold_uncertainty_score":0.56398344},"labels":[],"label_agreement":null},{"id":"W2130184139","doi":"10.1016/j.aim.2011.03.002","title":"Zariski closures of reductive linear differential algebraic groups","year":2011,"lang":"en","type":"article","venue":"Advances in Mathematics","topic":"Polynomial and algebraic computation","field":"Computer Science","cited_by":26,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"","keywords":"Mathematics; Differential algebraic geometry; Differential (mechanical device); Differential Galois theory; Pure mathematics; Dimension (graph theory); Algebra over a field; Galois group; Algebraic number; Factoring; Algebraic group; Linear algebraic group; Galois cohomology; Differential algebraic equation; Differential equation; Mathematical analysis; Ordinary differential equation","score_opus":0.018644452599596288,"score_gpt":0.25897025731191486,"score_spread":0.24032580471231857,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2130184139","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3246026,0.00039095752,0.6709503,0.00002401497,0.00042314146,0.00013672578,0.0000018101408,0.000059945596,0.0034104786],"genre_scores_gemma":[0.8379774,0.00007495676,0.1618375,0.000010960435,0.000046552075,0.0000077953355,9.556687e-7,0.00000643809,0.000037420872],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990475,0.000032689117,0.0003615354,0.00020332017,0.00018202588,0.00017292179],"domain_scores_gemma":[0.9992992,0.00011986532,0.00020451697,0.00029671454,0.00004352815,0.000036145895],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00012589812,0.00011732529,0.00022153155,0.00010565096,0.000029760333,0.00001098646,0.00053198345,0.00004062251,0.000025242316],"category_scores_gemma":[0.000064458836,0.00010047936,0.000054866214,0.0002680989,0.000084379295,0.00052839704,0.0001623647,0.000097575146,0.000013511702],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001738597,0.0006784175,0.00064238353,0.00017451755,0.00002294315,0.000009464124,0.016637122,0.00020116844,0.00073957274,0.901919,0.000024080027,0.07893395],"study_design_scores_gemma":[0.00036385455,0.00011427393,0.00361718,0.00009433635,0.0000083265,0.000009276822,0.00019539302,0.036706775,0.011697339,0.9469271,0.0000784346,0.00018776298],"about_ca_topic_score_codex":0.000009342767,"about_ca_topic_score_gemma":0.000008692966,"teacher_disagreement_score":0.5133748,"about_ca_system_score_codex":0.00001601008,"about_ca_system_score_gemma":0.000023060174,"threshold_uncertainty_score":0.40974295},"labels":[],"label_agreement":null},{"id":"W2130711073","doi":"10.1145/1277548.1277554","title":"Solving toeplitz- and vandermonde-like linear systems with large displacement rank","year":2007,"lang":"en","type":"preprint","venue":"","topic":"Polynomial and algebraic computation","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"","keywords":"Vandermonde matrix; Toeplitz matrix; Rank (graph theory); Displacement (psychology); Mathematics; Computer science; Linear system; Combinatorics; Pure mathematics; Mathematical analysis; Physics","score_opus":0.014460241510250469,"score_gpt":0.24826615001979496,"score_spread":0.2338059085095445,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2130711073","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.031830072,0.00087995554,0.96296316,0.0003103276,0.0011704833,0.000516781,0.0000058905725,0.00027772193,0.0020456305],"genre_scores_gemma":[0.9743076,0.00004651068,0.02276222,0.00039038228,0.00030934915,0.000036521036,0.000020277814,0.000021595975,0.0021055534],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9979302,0.000054966295,0.00036873948,0.00078875176,0.00041768557,0.00043964133],"domain_scores_gemma":[0.9988318,0.00011433788,0.00018931342,0.0005986126,0.00008953143,0.0001763973],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005849038,0.0003195943,0.0003587063,0.000152781,0.00016125574,0.00045185356,0.0005569811,0.00015754343,0.000009048501],"category_scores_gemma":[0.000007399905,0.0002400859,0.000059329373,0.00014684664,0.000032982603,0.0002119377,0.0015748995,0.00035039557,0.000015680473],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00063217804,0.0018158472,0.014187557,0.00593939,0.0019262711,0.0008759562,0.016255412,0.096608736,0.0006297469,0.64075494,0.024237167,0.19613682],"study_design_scores_gemma":[0.0012185554,0.00013457074,0.0020615247,0.00035488367,0.000032976466,0.000050922485,0.00009573445,0.98653394,0.00012948329,0.0016512813,0.0070443028,0.0006917963],"about_ca_topic_score_codex":0.00022419398,"about_ca_topic_score_gemma":0.000064077576,"teacher_disagreement_score":0.9424775,"about_ca_system_score_codex":0.000076688804,"about_ca_system_score_gemma":0.00013981054,"threshold_uncertainty_score":0.9790418},"labels":[],"label_agreement":null},{"id":"W2131834026","doi":"10.2178/jsl/1190150048","title":"Open questions in the theory of spaces of orderings","year":2002,"lang":"en","type":"article","venue":"Journal of Symbolic Logic","topic":"Polynomial and algebraic computation","field":"Computer Science","cited_by":14,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Saskatchewan","funders":"","keywords":"Mathematics; Ideal (ethics); Bounded function; Isotropy; Combinatorics; Space (punctuation); Finite set; Subspace topology; Linear subspace; Chain (unit); Discrete mathematics; Pure mathematics; Mathematical analysis; Computer science; Physics","score_opus":0.03957285186282869,"score_gpt":0.2706639565630444,"score_spread":0.23109110470021574,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2131834026","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9355301,0.001052982,0.0490473,0.006659975,0.0002496099,0.00014565875,7.926705e-7,0.0000067578817,0.0073067946],"genre_scores_gemma":[0.9964226,0.00006181878,0.0032215724,0.00020131584,0.00003948355,8.166662e-7,3.57002e-8,0.0000014566688,0.00005092576],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99923724,0.00013483787,0.00032630653,0.00005891371,0.00016203063,0.000080656544],"domain_scores_gemma":[0.99921626,0.00019729625,0.00035388744,0.00013751192,0.000072757,0.000022318667],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008248591,0.000049268496,0.00017141756,0.00011252543,0.000024948351,0.00004918756,0.0012163921,0.000020988398,0.000024141973],"category_scores_gemma":[0.00009562501,0.00002870447,0.000051115443,0.00032381545,0.00004716663,0.00031832053,0.00014376771,0.00010353899,0.0000026465],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000018918205,0.0004758951,0.0016957232,0.000027550992,0.00003390513,0.00003007968,0.013138422,0.0014396664,0.0023369933,0.8811863,0.0010083766,0.098608136],"study_design_scores_gemma":[0.0013062797,0.0008777859,0.11003746,0.00027811396,0.000026026264,0.00041821922,0.0010615994,0.009664818,0.0016984631,0.8726615,0.0017748001,0.00019497782],"about_ca_topic_score_codex":0.000034779147,"about_ca_topic_score_gemma":0.000004714648,"teacher_disagreement_score":0.10834174,"about_ca_system_score_codex":0.000010404379,"about_ca_system_score_gemma":0.0000324561,"threshold_uncertainty_score":0.22603796},"labels":[],"label_agreement":null},{"id":"W2131858910","doi":"10.1007/s10474-011-0126-y","title":"The t-metric Mahler measures of surds and rational numbers","year":2011,"lang":"en","type":"article","venue":"Acta Mathematica Academiae Scientiarum Hungaricae","topic":"Polynomial and algebraic computation","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University; University of British Columbia","funders":"","keywords":"Mathematics; Infimum and supremum; Combinatorics; Measure (data warehouse); Counterexample; Square-free integer; Conjecture; Rational number; Discrete mathematics; Natural number","score_opus":0.03865364247890828,"score_gpt":0.2470793915013453,"score_spread":0.20842574902243702,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2131858910","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4624822,0.0012720133,0.4880964,0.0142542515,0.0019715044,0.0011411799,0.000012095271,0.0004358815,0.030334473],"genre_scores_gemma":[0.975566,0.0000348432,0.023024099,0.00011883268,0.00003517388,0.000014237753,9.0676883e-7,0.000008807238,0.0011970451],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9979989,0.0001065438,0.00047707366,0.0003774501,0.0006818794,0.00035814155],"domain_scores_gemma":[0.9985552,0.0004451955,0.00028581862,0.00044251842,0.00012782536,0.0001434352],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016005919,0.00016065626,0.00021125935,0.00020360576,0.00039665762,0.00015024489,0.0012340846,0.000106426036,0.000028359464],"category_scores_gemma":[0.0004693112,0.000108562796,0.00008363675,0.0010707155,0.00024317314,0.00062316586,0.00047732022,0.00025375118,0.000029506435],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002313616,0.00030335016,0.0018429331,0.0001064003,0.00017653209,0.0000040091877,0.008321766,0.000007838463,0.012143798,0.85253674,0.018531235,0.10600226],"study_design_scores_gemma":[0.0015955423,0.0003033204,0.12278335,0.00018117664,0.00015600598,0.00018195224,0.0004686146,0.09374144,0.04323272,0.7195343,0.016516533,0.0013050782],"about_ca_topic_score_codex":0.000021922137,"about_ca_topic_score_gemma":0.0000064802407,"teacher_disagreement_score":0.5130838,"about_ca_system_score_codex":0.00003833297,"about_ca_system_score_gemma":0.00010205028,"threshold_uncertainty_score":0.44270623},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.014698049277087961,"score_gpt":0.24981889765869147,"score_spread":0.23512084838160352,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2133262123","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0070353816,0.00008878513,0.9874288,0.0015274972,0.000103201106,0.00026417876,0.000006015081,0.0002008301,0.0033453107],"genre_scores_gemma":[0.16920081,0.000026798587,0.82800967,0.0006467686,0.00022497665,0.00007698217,0.0000041408093,0.000018546694,0.001791335],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991986,0.00001053889,0.00022482715,0.00020459581,0.00014794449,0.0002134969],"domain_scores_gemma":[0.99888855,0.00068006356,0.00007459478,0.00023425213,0.00004005804,0.00008245116],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00009588797,0.00010615687,0.00016377635,0.00003808176,0.000089380526,0.00009954976,0.00043755182,0.000036703947,0.00007326027],"category_scores_gemma":[0.00014753867,0.000087280925,0.00007994039,0.0003153325,0.000019914889,0.00017482841,0.00004468157,0.000048494734,0.0003054047],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009040095,0.0007460282,0.000031135398,0.00012751,0.00002571661,0.000007745874,0.0020882853,0.00020366526,0.00020776229,0.16458389,0.012665519,0.8193037],"study_design_scores_gemma":[0.0005124428,0.0003661806,0.00021576598,0.00006015887,0.000018988498,0.000041372958,0.00003101903,0.5038253,0.00075010094,0.44279516,0.05101095,0.00037251756],"about_ca_topic_score_codex":0.000003809136,"about_ca_topic_score_gemma":2.2267893e-7,"teacher_disagreement_score":0.81893116,"about_ca_system_score_codex":0.000019821702,"about_ca_system_score_gemma":0.00002951218,"threshold_uncertainty_score":0.39254618},"labels":[],"label_agreement":null},{"id":"W2133662569","doi":"10.1145/1278177.1278189","title":"Component-level parallelization of triangular decompositions","year":2007,"lang":"en","type":"article","venue":"","topic":"Polynomial and algebraic computation","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"","keywords":"Parallel computing; Computer science; Component (thermodynamics); Parallelism (grammar); Computation; Set (abstract data type); Task (project management); Polynomial; Algorithm; Mathematics; Programming language","score_opus":0.025423016146531207,"score_gpt":0.2653656902843916,"score_spread":0.2399426741378604,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2133662569","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07584288,0.000027249656,0.92030245,0.00036074585,0.00016629134,0.000074219926,0.0000011253994,0.00007929513,0.0031457513],"genre_scores_gemma":[0.8713502,0.0000016559769,0.12831356,0.00014268445,0.000033208387,9.782642e-7,0.000007964156,0.0000022417612,0.00014749145],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993512,0.000018966828,0.00023411687,0.00013140844,0.0001378269,0.00012645358],"domain_scores_gemma":[0.9995631,0.0000834555,0.000070417474,0.0001695452,0.000059393613,0.00005407539],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00023282846,0.000056830642,0.000087769375,0.000106432046,0.00005452678,0.000022307511,0.00025520168,0.000025900088,0.000021288772],"category_scores_gemma":[0.000010622764,0.000051960054,0.000045775876,0.00027365691,0.000018453635,0.0002000683,0.000066115754,0.000029492523,0.000021486096],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000016788123,0.00019566958,0.00047604466,0.000010024243,0.000021711601,0.000006628932,0.00042338416,0.0009228046,0.03240541,0.8210643,0.0009909368,0.14346631],"study_design_scores_gemma":[0.0032153185,0.00031396994,0.2993529,0.000057201778,0.000024087494,0.000060104056,0.000089039786,0.34895962,0.2526837,0.088561445,0.0059898254,0.0006927387],"about_ca_topic_score_codex":0.000042952226,"about_ca_topic_score_gemma":0.000018991008,"teacher_disagreement_score":0.7955073,"about_ca_system_score_codex":0.000015525273,"about_ca_system_score_gemma":0.000022605574,"threshold_uncertainty_score":0.21188696},"labels":[],"label_agreement":null},{"id":"W2133703313","doi":"10.1109/cdc.2010.5717513","title":"Geometric control of patterned linear systems","year":2010,"lang":"en","type":"article","venue":"","topic":"Polynomial and algebraic computation","field":"Computer Science","cited_by":14,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Transformation (genetics); Class (philosophy); Computer science; Linear map; Linear system; State space; Interpretation (philosophy); Base (topology); State (computer science); Property (philosophy); Control system; Theoretical computer science; Algorithm; Mathematics; Artificial intelligence; Pure mathematics; Engineering","score_opus":0.008491806131906721,"score_gpt":0.2184347604286571,"score_spread":0.20994295429675036,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2133703313","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.24072409,0.00002043576,0.75729316,0.00018510997,0.0007573127,0.000067502835,0.000001297759,0.00006148823,0.0008895852],"genre_scores_gemma":[0.9959486,4.919394e-7,0.003597677,0.00010364706,0.00010227882,0.0000030522567,5.662387e-7,0.0000021414487,0.0002415549],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999459,0.000015926267,0.00016158051,0.00012670989,0.00013219252,0.00010453616],"domain_scores_gemma":[0.99950165,0.0001070439,0.00006701185,0.0002156901,0.00006061512,0.000048016285],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00015829809,0.000050799543,0.00010530132,0.00013486091,0.000020404532,0.000034339093,0.00035371285,0.000030212697,0.000018483286],"category_scores_gemma":[0.000032387896,0.000039179013,0.000033595963,0.00035103204,0.000014109561,0.00013759063,0.00005159793,0.000067637324,0.000050282255],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001537787,0.000280947,0.014774284,0.000084989515,0.0000717702,0.000013044529,0.0002990561,0.0013146504,0.081882305,0.54139405,0.002038635,0.35783088],"study_design_scores_gemma":[0.000981625,0.00011243839,0.022115847,0.000007804366,0.000005143246,0.000016007625,0.000006117437,0.9611816,0.011016691,0.0013202153,0.0030650685,0.0001714373],"about_ca_topic_score_codex":0.00016985572,"about_ca_topic_score_gemma":0.0000055713917,"teacher_disagreement_score":0.95986694,"about_ca_system_score_codex":0.0000033290628,"about_ca_system_score_gemma":0.00002411542,"threshold_uncertainty_score":0.15976737},"labels":[],"label_agreement":null},{"id":"W2135607994","doi":"10.1142/9789812778857_0004","title":"MODULAR COMPUTATION FOR MATRICES OF ORE POLYNOMIALS","year":2007,"lang":"en","type":"article","venue":"","topic":"Polynomial and algebraic computation","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo; University of Lethbridge","funders":"","keywords":"Modular design; Computation; Algebra over a field; Computer science; Mathematics; Theoretical computer science; Pure mathematics; Algorithm; Programming language","score_opus":0.01676771290078239,"score_gpt":0.27352308988894974,"score_spread":0.25675537698816736,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2135607994","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15785772,0.000060516253,0.8404497,0.00025772798,0.00022958557,0.00016339225,0.0000015570974,0.00007997105,0.00089984434],"genre_scores_gemma":[0.82421577,0.0000013251448,0.17548871,0.000108300825,0.00007541416,0.000002444515,0.0000034681962,0.0000034731459,0.00010107536],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99923325,0.000011347156,0.00027943353,0.0001780681,0.00013167808,0.00016624485],"domain_scores_gemma":[0.9993817,0.00022694378,0.00012598521,0.00012246089,0.00009357385,0.000049311268],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00042676774,0.000071754985,0.0001250535,0.00012832959,0.000050211296,0.00003453263,0.0002737939,0.000034948043,0.0000038736266],"category_scores_gemma":[0.000024303541,0.000062716936,0.000063453575,0.00025403718,0.000017915727,0.0002517799,0.00006234867,0.00002300126,0.0000068386807],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004193026,0.000117736665,0.00034276856,0.00006737208,0.00003115318,0.0000023552946,0.00059636537,0.0036557338,0.029281829,0.23406008,0.0017833046,0.7300194],"study_design_scores_gemma":[0.0014989605,0.00038479967,0.028990824,0.0000298376,0.000016554994,0.000012573833,0.000080997015,0.72816265,0.14620052,0.09129649,0.0029223922,0.00040341355],"about_ca_topic_score_codex":0.000041202147,"about_ca_topic_score_gemma":0.000008261587,"teacher_disagreement_score":0.729616,"about_ca_system_score_codex":0.0000170417,"about_ca_system_score_gemma":0.000033076143,"threshold_uncertainty_score":0.25575224},"labels":[],"label_agreement":null},{"id":"W2136692263","doi":"10.1016/j.jsc.2008.04.020","title":"Implicit Riquier Bases for PDAE and their semi-discretizations","year":2008,"lang":"en","type":"article","venue":"Journal of Symbolic Computation","topic":"Polynomial and algebraic computation","field":"Computer Science","cited_by":12,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto; Western University","funders":"Natural Sciences and Engineering Research Council of Canada; National Science Foundation","keywords":"Mathematics; Algebra over a field; Pure mathematics; Calculus (dental)","score_opus":0.016961552615715466,"score_gpt":0.24801522430343043,"score_spread":0.23105367168771496,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2136692263","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3230179,0.00016855187,0.67526484,0.0011178614,0.00022009216,0.00010084542,0.0000030243002,0.00002517073,0.00008170382],"genre_scores_gemma":[0.9778298,0.000045705696,0.0214622,0.0003223383,0.00028376933,0.0000039781717,0.000004558355,0.000008112042,0.000039511968],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990881,0.000044638655,0.00041303015,0.0001517728,0.00014941084,0.00015306153],"domain_scores_gemma":[0.9988466,0.00031607735,0.00033432065,0.000091803435,0.00030493157,0.00010629375],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00021494903,0.00011840464,0.00021927102,0.00021164297,0.00022451169,0.0000769708,0.00021881834,0.000039305178,0.0000023260227],"category_scores_gemma":[0.00006723236,0.00009436513,0.00009938707,0.00026563273,0.00004393058,0.0005553708,0.000061858926,0.00008728585,0.000001740993],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00014843907,0.00053509785,0.0039088344,0.00013875404,0.0003098857,0.000042704247,0.022416577,0.057973567,0.015530023,0.0626159,0.02061484,0.8157654],"study_design_scores_gemma":[0.0021788864,0.0006753108,0.060851965,0.00011256924,0.00003053534,0.001848012,0.0002087852,0.844176,0.0029726424,0.08020641,0.006326439,0.00041243274],"about_ca_topic_score_codex":0.000006702423,"about_ca_topic_score_gemma":0.0000015157019,"teacher_disagreement_score":0.8153529,"about_ca_system_score_codex":0.000033207052,"about_ca_system_score_gemma":0.00012785786,"threshold_uncertainty_score":0.38480982},"labels":[],"label_agreement":null},{"id":"W2137045172","doi":"10.1145/1576702.1576736","title":"Computations modulo regular chains","year":2009,"lang":"en","type":"article","venue":"","topic":"Polynomial and algebraic computation","field":"Computer Science","cited_by":33,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"","keywords":"Modulo; Polynomial; Computation; Modular arithmetic; Arithmetic; Modular design; Mathematics; Modulo operation; Code (set theory); Computer science; Discrete mathematics; Algebra over a field; Algorithm; Pure mathematics; Programming language","score_opus":0.011102250569243528,"score_gpt":0.230920149291846,"score_spread":0.2198178987226025,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2137045172","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.02212338,0.000028469305,0.9563375,0.01651295,0.00016941973,0.00006236083,2.988209e-7,0.00035418384,0.0044114464],"genre_scores_gemma":[0.9404336,0.000002100184,0.05687627,0.0018622224,0.000077893856,0.000001350074,0.0000023062562,0.0000018257903,0.0007424318],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993206,0.000019328447,0.000121565536,0.00020218754,0.00018159802,0.00015470959],"domain_scores_gemma":[0.9996126,0.000023140266,0.000029838795,0.00023152345,0.00003228928,0.00007056719],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00009449643,0.000070887356,0.000071985,0.000073194504,0.00010212916,0.00013024175,0.00045397156,0.000026057563,0.000010719994],"category_scores_gemma":[0.0000069974694,0.00006311192,0.00004074275,0.0002920775,0.000011006125,0.0003009113,0.000058187758,0.000048757087,0.00009242184],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[4.0032697e-7,0.000033008495,0.000006706599,6.177207e-7,0.00000215631,0.0000029214873,0.0001926305,0.0024458228,0.00022972265,0.7958707,0.0020146505,0.19920065],"study_design_scores_gemma":[0.00018898697,0.000063574276,0.008498625,0.000004362384,0.0000012929114,0.000010390576,0.000008050431,0.8530859,0.00069826795,0.13461722,0.0027020257,0.00012129397],"about_ca_topic_score_codex":0.000016896458,"about_ca_topic_score_gemma":0.000003162381,"teacher_disagreement_score":0.9183102,"about_ca_system_score_codex":0.000016766728,"about_ca_system_score_gemma":0.000028719094,"threshold_uncertainty_score":0.25736293},"labels":[],"label_agreement":null},{"id":"W2139624057","doi":"10.1007/s00222-011-0337-4","title":"On vanishing coefficients of algebraic power series over fields of positive characteristic","year":2011,"lang":"en","type":"article","venue":"Inventiones mathematicae","topic":"Polynomial and algebraic computation","field":"Computer Science","cited_by":17,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Power series; Generalization; Diophantine equation; Rational function; Algebraic number; Field (mathematics); Zero (linguistics); Series (stratigraphy); Algebraic function; Diophantine approximation","score_opus":0.019387392097371326,"score_gpt":0.23185406066221176,"score_spread":0.21246666856484042,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2139624057","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.73529667,0.000010099047,0.26074803,0.00006094684,0.0002500866,0.0001293108,0.000006147472,0.00005423807,0.003444475],"genre_scores_gemma":[0.9933151,9.3449466e-7,0.006471768,0.000062310406,0.000008814407,0.0000052636356,0.000002476952,0.0000058673977,0.0001274569],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990977,0.000040438314,0.00035997608,0.00016332787,0.00021665673,0.00012192018],"domain_scores_gemma":[0.9992393,0.00010963178,0.00027230775,0.00026168558,0.000078534256,0.000038496677],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00016297429,0.00009971688,0.00020057044,0.00009734974,0.000042048887,0.000021287158,0.00032593706,0.00004247246,0.00015649095],"category_scores_gemma":[0.00008394832,0.00008765398,0.00009239264,0.00018414568,0.000062379724,0.0003055491,0.00011511788,0.000056301025,0.000029916228],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000250113,0.00048425441,0.00008969271,0.00012102258,0.000041410178,0.0000045923066,0.00655483,0.000006670529,0.0014016574,0.9893573,0.00012462819,0.0017889657],"study_design_scores_gemma":[0.0005438703,0.00075719523,0.044407375,0.0007037498,0.000031468848,0.000021990987,0.00012683542,0.009501882,0.043927494,0.8996724,0.000015616484,0.00029013478],"about_ca_topic_score_codex":0.000011694783,"about_ca_topic_score_gemma":0.0000013181434,"teacher_disagreement_score":0.25801843,"about_ca_system_score_codex":0.000010472012,"about_ca_system_score_gemma":0.000021023701,"threshold_uncertainty_score":0.35744256},"labels":[],"label_agreement":null},{"id":"W2140712161","doi":"10.1016/j.jalgebra.2015.10.009","title":"On bounds for the effective differential Nullstellensatz","year":2015,"lang":"en","type":"article","venue":"Journal of Algebra","topic":"Polynomial and algebraic computation","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"National Science Foundation","keywords":"Mathematics; Differential (mechanical device); Algebraic number; Differential algebra; Pure mathematics; Mathematical analysis","score_opus":0.01789135546021098,"score_gpt":0.25490956790748753,"score_spread":0.23701821244727656,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2140712161","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.31283844,0.00020339078,0.68089586,0.0030289374,0.0025761642,0.00018770424,8.5014875e-7,0.000017741131,0.00025091006],"genre_scores_gemma":[0.9971326,0.0000040493037,0.0017019785,0.00037628206,0.0006731429,0.000004813449,2.3723358e-7,0.0000057721236,0.00010110652],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991394,0.000062574814,0.00023567992,0.00010520788,0.00030667317,0.00015044524],"domain_scores_gemma":[0.9984999,0.0007975609,0.00023591187,0.00016443584,0.00019066913,0.00011156629],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00042876022,0.00009323249,0.00015465639,0.00008054415,0.00010164922,0.00015822977,0.0005760453,0.00003255329,0.0000047506983],"category_scores_gemma":[0.00018472825,0.00005308091,0.00015256491,0.00012372927,0.00003162175,0.00024417753,0.00006995517,0.00014817908,0.000014977299],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00063372444,0.0003548596,0.00007552916,0.000018049006,0.0002925679,0.0000301126,0.0038359428,0.001749942,0.0008552047,0.296864,0.067634255,0.6276558],"study_design_scores_gemma":[0.009232915,0.008289141,0.014102802,0.00016723851,0.00015343589,0.0004649601,0.00022910874,0.15581709,0.011977728,0.7622581,0.036690764,0.0006166903],"about_ca_topic_score_codex":0.0000030352637,"about_ca_topic_score_gemma":0.0000010621126,"teacher_disagreement_score":0.6842942,"about_ca_system_score_codex":0.000059037982,"about_ca_system_score_gemma":0.000109893015,"threshold_uncertainty_score":0.21645766},"labels":[],"label_agreement":null},{"id":"W2140984997","doi":"10.1155/s0161171203202118","title":"Complexity of terms, composition, and hypersubstitution","year":2003,"lang":"en","type":"article","venue":"International Journal of Mathematics and Mathematical Sciences","topic":"Polynomial and algebraic computation","field":"Computer Science","cited_by":20,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Lethbridge","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Corollary; Normalization (sociology); Composition (language); Term (time); Computational complexity theory; Variety (cybernetics); Variable (mathematics); Discrete mathematics; Combinatorics; Algorithm; Statistics; Mathematical analysis","score_opus":0.04219248095249311,"score_gpt":0.29075163717523606,"score_spread":0.24855915622274294,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2140984997","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4084499,0.0001097472,0.58787984,0.0009571309,0.0001816455,0.000045593548,0.0000012045263,0.000006682175,0.0023682634],"genre_scores_gemma":[0.7645548,0.000027363096,0.23535743,0.000036453093,0.000017965676,3.6797732e-7,9.149507e-8,0.0000011039815,0.000004407706],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99901277,0.00002474325,0.00039384526,0.00008812843,0.00040253642,0.00007797384],"domain_scores_gemma":[0.99921364,0.00021295062,0.00030477915,0.00005414238,0.00015038598,0.00006408503],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007181246,0.00006572922,0.00016719519,0.00010679519,0.00006532244,0.000113514325,0.00033518506,0.000020116675,0.000012380887],"category_scores_gemma":[0.00015769892,0.00004554059,0.000038057642,0.00009462038,0.00041765065,0.00034635162,0.00007016643,0.000049501406,0.000001309341],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000012492422,0.000110150126,0.00006387259,0.000023759108,0.000016017837,0.0000029737691,0.00046075298,0.000012531203,0.0018488663,0.99477965,0.000015517704,0.0026646543],"study_design_scores_gemma":[0.00028660244,0.000095707655,0.00038615527,0.0001369049,0.000009931581,0.0006523381,0.0001365016,0.018773984,0.0037750257,0.9755877,0.000088204295,0.00007093208],"about_ca_topic_score_codex":0.000001446458,"about_ca_topic_score_gemma":3.57419e-7,"teacher_disagreement_score":0.3561049,"about_ca_system_score_codex":0.00001094268,"about_ca_system_score_gemma":0.00004003077,"threshold_uncertainty_score":0.18570913},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.00823453275827883,"score_gpt":0.24276188508145452,"score_spread":0.2345273523231757,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2141336296","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.40860495,0.00010720448,0.5897468,0.0004911907,0.0005540074,0.00009553596,0.0000016548005,0.000028902503,0.00036978823],"genre_scores_gemma":[0.91650265,0.0000038044086,0.08179879,0.000118267984,0.0014643135,0.0000032937148,0.000006308324,0.000008503993,0.00009403583],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986709,0.000031034124,0.00062507635,0.00014780433,0.0002933581,0.00023187476],"domain_scores_gemma":[0.99886096,0.00013202082,0.0005843709,0.00008734908,0.00026059125,0.000074717434],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00034438117,0.00012756833,0.00023044719,0.00029437637,0.0001278289,0.00019791194,0.0003896689,0.000051761966,0.0000025722015],"category_scores_gemma":[0.000016596394,0.00010804705,0.00018582531,0.00028777274,0.000019910442,0.0009000746,0.000057946967,0.0000968637,0.000006170816],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00023104546,0.00047531514,0.0016877073,0.000092199785,0.00011343362,0.000035861598,0.0008833878,0.12031595,0.007889332,0.15802576,0.03406359,0.67618644],"study_design_scores_gemma":[0.004341712,0.0009883968,0.07465571,0.000067053064,0.000060005295,0.0005956263,0.000036026733,0.75923854,0.004752984,0.14243567,0.012281895,0.0005463607],"about_ca_topic_score_codex":0.000043561417,"about_ca_topic_score_gemma":0.000004718558,"teacher_disagreement_score":0.67564005,"about_ca_system_score_codex":0.00007214507,"about_ca_system_score_gemma":0.00014069297,"threshold_uncertainty_score":0.44060308},"labels":[],"label_agreement":null},{"id":"W2145025251","doi":"10.1016/j.jsc.2009.05.003","title":"Automatic computation of the complete root classification for a parametric polynomial","year":2009,"lang":"en","type":"article","venue":"Journal of Symbolic Computation","topic":"Polynomial and algebraic computation","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"","keywords":"Mathematics; Discriminant; Sign (mathematics); Root (linguistics); Computation; Positive definiteness; Polynomial; Parametric statistics; Sequence (biology); Characteristic polynomial; Class (philosophy); Linear discriminant analysis; Algorithm; Combinatorics; Discrete mathematics; Artificial intelligence; Positive-definite matrix; Mathematical analysis; Statistics; Computer science; Eigenvalues and eigenvectors","score_opus":0.03063142354722671,"score_gpt":0.2820513312423598,"score_spread":0.2514199076951331,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2145025251","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.41148475,0.000077455494,0.5852971,0.0021742159,0.000603452,0.00028053203,0.0000022971906,0.000028948978,0.000051278745],"genre_scores_gemma":[0.96963286,0.000002577221,0.02993112,0.00017933552,0.00023226363,0.0000034137786,0.000004068846,0.0000076120737,0.0000067300334],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9978182,0.00016568376,0.0010778586,0.0002009811,0.0005270348,0.00021024806],"domain_scores_gemma":[0.99706125,0.00041264785,0.0016663714,0.00019545294,0.00057835574,0.00008592609],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006626151,0.00016617267,0.000383981,0.00045189157,0.00018461482,0.00012401797,0.0006704315,0.000071274015,0.0000013490754],"category_scores_gemma":[0.00020441398,0.00012714344,0.00028846503,0.0010988121,0.0000505607,0.0005254106,0.00005099273,0.00016410158,0.0000027729216],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006151484,0.00034474992,0.0004619414,0.00006824826,0.000067023175,0.0000015207115,0.0013464853,0.048166305,0.0065303785,0.011684174,0.0021217966,0.9291459],"study_design_scores_gemma":[0.0010301898,0.00040188842,0.22310512,0.000087934815,0.000034278208,0.00006024426,0.000028672146,0.75070155,0.00047903362,0.02384214,0.00011314506,0.00011581619],"about_ca_topic_score_codex":0.0000073455108,"about_ca_topic_score_gemma":0.0000019040164,"teacher_disagreement_score":0.92903006,"about_ca_system_score_codex":0.00012863064,"about_ca_system_score_gemma":0.00025045805,"threshold_uncertainty_score":0.51847595},"labels":[],"label_agreement":null},{"id":"W2145256573","doi":"10.1145/1390768.1390806","title":"Power series composition and change of basis","year":2008,"lang":"en","type":"article","venue":"","topic":"Polynomial and algebraic computation","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"","keywords":"Composition (language); Series (stratigraphy); Power series; Power (physics); Class (philosophy); Basis (linear algebra)","score_opus":0.020873644618917636,"score_gpt":0.21786461626915965,"score_spread":0.196990971650242,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2145256573","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.90838385,0.00007119078,0.087480895,0.0014330598,0.000097925644,0.000052779327,7.581583e-7,0.000057376164,0.0024221812],"genre_scores_gemma":[0.98911583,0.000014479849,0.010560943,0.00019747717,0.000015379153,0.0000019340596,5.6233205e-7,0.0000010306552,0.00009236587],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"observational","domain_scores_codex":[0.999738,0.000009513267,0.00006247679,0.00008006022,0.00005857206,0.000051427636],"domain_scores_gemma":[0.9998523,0.000013385347,0.000021875863,0.00007005137,0.000019599853,0.000022767672],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000025220057,0.000032949854,0.0000523779,0.00003188382,0.000042687745,0.000008616136,0.0000722845,0.000011502904,0.000012505269],"category_scores_gemma":[0.0000013226553,0.000027847118,0.000012117561,0.00008162919,0.000031297193,0.00035624724,0.000059779017,0.000013802227,0.0000044146072],"study_design_candidate":"observational","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000060516457,0.00038353255,0.018805161,0.00007527763,0.000055996363,0.000057585192,0.032966103,0.000023230074,0.0424098,0.67819536,0.005193032,0.2217744],"study_design_scores_gemma":[0.00074713945,0.00047620662,0.8822807,0.000034930308,0.0000046447813,0.0002953298,0.000064611384,0.015063136,0.08816064,0.0101123415,0.0023868752,0.00037345113],"about_ca_topic_score_codex":0.000031478932,"about_ca_topic_score_gemma":0.0000018799384,"teacher_disagreement_score":0.8634755,"about_ca_system_score_codex":0.000003022603,"about_ca_system_score_gemma":0.0000062217814,"threshold_uncertainty_score":0.11355725},"labels":[],"label_agreement":null},{"id":"W2145563891","doi":"10.4230/lipics.stacs.2010.2443","title":"The Tropical Double Description Method","year":2010,"lang":"en","type":"preprint","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Polynomial and algebraic computation","field":"Computer Science","cited_by":24,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Ministère des Transports","funders":"","keywords":"Polyhedron; Hypergraph; Extreme point; Representation (politics); Point (geometry); Component (thermodynamics); Mathematics; Algorithm; Linear inequality; Connected component; Computer science; Mathematical optimization; Combinatorics; Inequality; Geometry","score_opus":0.025458243914129684,"score_gpt":0.28781296830220876,"score_spread":0.26235472438807905,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2145563891","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.035194594,0.00007706859,0.95144266,0.0019486065,0.0073279915,0.0015343192,0.0001144581,0.00039700893,0.001963314],"genre_scores_gemma":[0.4514927,0.00012906159,0.54110867,0.0020335587,0.0019026948,0.0009124053,0.000749939,0.000111073394,0.0015599382],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9963771,0.000092393755,0.0014329796,0.0005204094,0.00068779057,0.00088931713],"domain_scores_gemma":[0.9965404,0.00035750144,0.00085380394,0.001596406,0.00038245568,0.00026942062],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0010094679,0.00058572757,0.00057671836,0.00022247083,0.0008518804,0.0024275866,0.0031921056,0.00068313885,0.0000098110495],"category_scores_gemma":[0.000097028955,0.00042681675,0.00052701344,0.0002432256,0.00014986216,0.0012278013,0.0026868952,0.0019037065,0.00013435994],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00051368005,0.000590877,0.0010069215,0.0012605833,0.00064543565,0.000010536738,0.015771467,0.0026920468,0.00029019834,0.4444676,0.02267693,0.5100737],"study_design_scores_gemma":[0.0030483631,0.00018259855,0.0017360485,0.00017273691,0.00007074143,0.00007770856,0.00018248246,0.7175778,0.0013743415,0.054964982,0.21962768,0.0009844997],"about_ca_topic_score_codex":0.00005545664,"about_ca_topic_score_gemma":0.00008063674,"teacher_disagreement_score":0.7148858,"about_ca_system_score_codex":0.00018220133,"about_ca_system_score_gemma":0.000304776,"threshold_uncertainty_score":0.9998184},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.033350463473523856,"score_gpt":0.1772982498522702,"score_spread":0.14394778637874633,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2145758416","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5744185,0.00014596722,0.42369226,0.00018136743,0.00053054054,0.00017341005,0.000005536574,0.00016161572,0.0006908152],"genre_scores_gemma":[0.9978172,0.00013704748,0.0012477334,0.0001353974,0.00008208701,4.8456144e-7,0.000016897162,0.00001090931,0.0005522467],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99825186,0.00024151611,0.0002804068,0.0008589387,0.000093503666,0.00027377286],"domain_scores_gemma":[0.99864805,0.0001477038,0.0003447548,0.0006118648,0.00010837744,0.00013925185],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00036431145,0.00031876995,0.00038983283,0.00036087626,0.000107286854,0.00009478081,0.00094293704,0.00023594483,0.000011778816],"category_scores_gemma":[0.000043252447,0.0003415362,0.00019574746,0.00032099496,0.00017134708,0.00043501714,0.0012145443,0.0005138655,0.000010122572],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000108351065,0.00011940422,0.0007724421,0.00009087288,0.00012945755,0.00006645096,0.0014049808,0.003171167,0.00021096093,0.97636116,0.00050191884,0.017062854],"study_design_scores_gemma":[0.0006221368,0.00017542772,0.005855398,0.00021389654,0.00007226669,0.000019186979,0.00020159566,0.104290485,0.0008772931,0.8870468,0.00016623166,0.00045927183],"about_ca_topic_score_codex":0.0002916625,"about_ca_topic_score_gemma":0.000080286976,"teacher_disagreement_score":0.42339873,"about_ca_system_score_codex":0.00016553585,"about_ca_system_score_gemma":0.00013264487,"threshold_uncertainty_score":0.9999037},"labels":[],"label_agreement":null},{"id":"W2146055106","doi":"10.1145/1993886.1993931","title":"Normalization of row reduced matrices","year":2011,"lang":"en","type":"article","venue":"","topic":"Polynomial and algebraic computation","field":"Computer Science","cited_by":19,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Normalization (sociology); Dimension (graph theory); Matrix (chemical analysis); Matrix multiplication; Mathematics; Integer matrix; Degree (music); Finite field; Polynomial matrix; Algorithm; Combinatorics; Discrete mathematics; Symmetric matrix; Matrix polynomial; Polynomial; Eigenvalues and eigenvectors; Nonnegative matrix; Mathematical analysis; Physics","score_opus":0.02302589232198286,"score_gpt":0.21961748583409413,"score_spread":0.19659159351211128,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2146055106","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.20459703,0.000024361128,0.76814324,0.000070632545,0.00016626321,0.00003752581,1.5665957e-7,0.0000814725,0.026879309],"genre_scores_gemma":[0.9600257,0.000002846908,0.03972072,0.000048403417,0.000015001067,9.80303e-7,4.9004575e-7,0.0000012486312,0.00018455937],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9996657,0.000011462748,0.00010686834,0.00008460612,0.00007011824,0.00006127519],"domain_scores_gemma":[0.99976814,0.000010122071,0.00005209592,0.000113366346,0.0000344642,0.00002178559],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000056671957,0.000032703978,0.000045260982,0.000051494564,0.000018172796,0.000011030451,0.00022902802,0.000013638344,0.000045172666],"category_scores_gemma":[0.0000058625915,0.000026957136,0.000018152668,0.00020625321,0.000008511759,0.00029532204,0.000059304413,0.000012681054,0.0000211481],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008876532,0.000114126415,0.0015930019,0.00002101527,0.000012980527,0.0000026756927,0.0033637285,0.00007215822,0.01014293,0.7886555,0.0009209627,0.19509204],"study_design_scores_gemma":[0.0006358123,0.00028823866,0.10296258,0.000029077004,0.000011572496,0.000022872786,0.00006596858,0.18580452,0.62592053,0.08292795,0.0009419588,0.00038890867],"about_ca_topic_score_codex":0.000075763885,"about_ca_topic_score_gemma":0.000003205364,"teacher_disagreement_score":0.75542873,"about_ca_system_score_codex":0.0000037078037,"about_ca_system_score_gemma":0.00001768303,"threshold_uncertainty_score":0.10992801},"labels":[],"label_agreement":null},{"id":"W2146061292","doi":"10.1145/1993886.1993900","title":"Vector rational number reconstruction","year":2011,"lang":"en","type":"article","venue":"","topic":"Polynomial and algebraic computation","field":"Computer Science","cited_by":13,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science","score_opus":0.023971988640468168,"score_gpt":0.22144169874307415,"score_spread":0.19746971010260597,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2146061292","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06373351,0.0000026430134,0.83205503,0.000261933,0.00076692394,0.00003809138,2.21347e-7,0.00016668474,0.10297497],"genre_scores_gemma":[0.86141163,4.5023916e-7,0.1376195,0.00015821877,0.00007310835,0.0000029045696,6.0360895e-7,0.0000013939498,0.0007322073],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9996553,0.000012515765,0.00007932757,0.0001175316,0.00006456065,0.00007074291],"domain_scores_gemma":[0.99981195,0.000013050789,0.00002318498,0.000093219904,0.000026546093,0.00003205344],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0000460935,0.00003729271,0.00003372423,0.000018731338,0.00004314601,0.000027576896,0.00013895897,0.000016100754,0.0006468863],"category_scores_gemma":[0.0000056543704,0.000031996016,0.000020652484,0.00009468869,0.000012609621,0.00038699596,0.000037217516,0.000026353944,0.0005096326],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000022202466,0.000015042018,0.0011639453,8.775891e-7,0.000004633299,0.0000011792661,0.0002911376,0.0000019242182,0.00035466618,0.74499047,0.001104919,0.252069],"study_design_scores_gemma":[0.00071797153,0.000091935624,0.25901636,0.000013195698,0.0000056104186,0.00039104818,0.000038672606,0.08587077,0.03379288,0.61501926,0.004533638,0.00050863303],"about_ca_topic_score_codex":0.000032778073,"about_ca_topic_score_gemma":0.0000052504174,"teacher_disagreement_score":0.7976781,"about_ca_system_score_codex":0.0000103440625,"about_ca_system_score_gemma":0.0000282592,"threshold_uncertainty_score":0.70829517},"labels":[],"label_agreement":null},{"id":"W2146331214","doi":"10.1145/1040034.1040036","title":"Not seeing the roots for the branches","year":2004,"lang":"en","type":"article","venue":"ACM SIGSAM Bulletin","topic":"Polynomial and algebraic computation","field":"Computer Science","cited_by":16,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"","keywords":"Focus (optics); Mathematics; Algebra over a field; Contrast (vision); Polynomial; Calculus (dental); Applied mathematics; Pure mathematics; Computer science; Mathematical analysis; Artificial intelligence","score_opus":0.021451212606261098,"score_gpt":0.24035333223874253,"score_spread":0.21890211963248143,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2146331214","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.02494289,0.00048509322,0.70198846,0.27093646,0.0006634254,0.0004390417,0.0000028098548,0.00016359297,0.00037823312],"genre_scores_gemma":[0.98336816,0.000009746376,0.010628863,0.005271554,0.00034485877,0.000058098034,0.0000012812862,0.0000079094625,0.00030952474],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9992099,0.00002874527,0.00014337598,0.00022857879,0.00015882886,0.0002305757],"domain_scores_gemma":[0.9979907,0.0012616283,0.00006246798,0.0006147024,0.00003667117,0.000033802633],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003658967,0.00009988279,0.000081090395,0.00001923137,0.00041475907,0.00018156481,0.0015208931,0.000029991323,0.000020213387],"category_scores_gemma":[0.00039133467,0.00005484461,0.000084497326,0.00013547463,0.000048658792,0.00006246902,0.00034162612,0.00010065002,0.0001301023],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003972817,0.00008324372,0.0000549999,0.000020264712,0.00006604537,0.0000073142196,0.0032442966,0.010259184,0.0027365065,0.15418915,0.04956865,0.7797306],"study_design_scores_gemma":[0.0010948832,0.00010671113,0.008798985,0.000036465088,0.000014031134,0.00002416317,0.00007641406,0.008614157,0.010602237,0.06138168,0.9089646,0.00028572392],"about_ca_topic_score_codex":0.00008796229,"about_ca_topic_score_gemma":0.0000134706115,"teacher_disagreement_score":0.9584253,"about_ca_system_score_codex":0.000023633356,"about_ca_system_score_gemma":0.000048628408,"threshold_uncertainty_score":0.31900334},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.02981440093235344,"score_gpt":0.2839099586143147,"score_spread":0.25409555768196124,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2146380740","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.28749198,0.00016744042,0.69772077,0.011220631,0.0014588796,0.00021116155,0.000005529434,0.00007853303,0.0016450491],"genre_scores_gemma":[0.9444093,0.000005957521,0.05401525,0.00029446627,0.0011469669,0.0000029322407,5.876032e-7,0.0000070293445,0.00011749993],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99877375,0.000084108106,0.0004840432,0.00012518145,0.00032439464,0.00020851857],"domain_scores_gemma":[0.99855304,0.0004465822,0.00045691303,0.00021055946,0.0002353388,0.000097569464],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00067940296,0.000113918904,0.0002020679,0.00006158184,0.00027140012,0.00019843358,0.0008393648,0.000035113655,0.0000074899463],"category_scores_gemma":[0.000056754896,0.00006916034,0.00017853758,0.00019087689,0.00005126463,0.00036267986,0.00008809284,0.00018837796,0.00006153219],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00020288238,0.0001451562,0.00012467436,0.00003629034,0.0000844903,0.000008735936,0.0005474394,0.0005324288,0.000069410155,0.82369137,0.007628533,0.16692856],"study_design_scores_gemma":[0.0029533918,0.00086848956,0.011456958,0.0003458916,0.000053409985,0.0006289849,0.00024889535,0.6435671,0.0041616308,0.13951388,0.19565418,0.0005471875],"about_ca_topic_score_codex":0.000006049601,"about_ca_topic_score_gemma":0.000010018184,"teacher_disagreement_score":0.6841775,"about_ca_system_score_codex":0.00010506986,"about_ca_system_score_gemma":0.00008206564,"threshold_uncertainty_score":0.2820277},"labels":[],"label_agreement":null},{"id":"W2149259754","doi":"10.1145/1277548.1277585","title":"Fast arithmetic for triangular sets","year":2007,"lang":"en","type":"article","venue":"","topic":"Polynomial and algebraic computation","field":"Computer Science","cited_by":34,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"","keywords":"Arithmetic; Computer science; Saturation arithmetic; Mathematics; Arbitrary-precision arithmetic","score_opus":0.01581031748346397,"score_gpt":0.26517250374690193,"score_spread":0.24936218626343795,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2149259754","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.013827861,0.000025591426,0.9811836,0.000814954,0.0003436545,0.00013575815,5.678744e-7,0.00012860705,0.003539437],"genre_scores_gemma":[0.7388771,4.3407317e-7,0.25881398,0.000736832,0.00012182115,0.0000056331573,0.00000221625,0.0000040958444,0.0014378469],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994366,0.000006621881,0.00012390096,0.00016172872,0.00008769576,0.00018343395],"domain_scores_gemma":[0.99961525,0.00012046053,0.00002679227,0.00014430594,0.000031458112,0.00006171991],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00032275982,0.000054457963,0.00006612065,0.00006264175,0.00005679531,0.000058823487,0.0002543005,0.000023376508,0.000008310267],"category_scores_gemma":[0.000024220257,0.000045611883,0.00004745633,0.00015848695,0.000009491169,0.00014516525,0.00005265329,0.000025748595,0.000035275978],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000064540354,0.000027940574,0.000021873055,0.000004365491,0.000005606664,0.0000037793131,0.0001582279,0.000032104977,0.0006080236,0.15514639,0.001555079,0.8424302],"study_design_scores_gemma":[0.0036674254,0.00050043594,0.0150275165,0.000020926904,0.000015730357,0.000057320583,0.00008754231,0.6083775,0.058935188,0.25028306,0.06228482,0.0007424975],"about_ca_topic_score_codex":0.000010292278,"about_ca_topic_score_gemma":0.000010542342,"teacher_disagreement_score":0.8416877,"about_ca_system_score_codex":0.000014513327,"about_ca_system_score_gemma":0.000021964881,"threshold_uncertainty_score":0.18599986},"labels":[],"label_agreement":null},{"id":"W2149364930","doi":"10.1007/978-3-319-02297-0_3","title":"Computing the Limit Points of the Quasi-component of a Regular Chain in Dimension One","year":2013,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Polynomial and algebraic computation","field":"Computer Science","cited_by":14,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"","keywords":"Dimension (graph theory); Component (thermodynamics); Chain (unit); Limit (mathematics); Ideal (ethics); Computer science; Set (abstract data type); Series (stratigraphy); Mathematics; Algorithm; Discrete mathematics; Combinatorics; Mathematical analysis; Physics","score_opus":0.014756817602010001,"score_gpt":0.21473131819295138,"score_spread":0.19997450059094138,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2149364930","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.022351988,0.00032443032,0.972023,0.0031067596,0.0011332879,0.0006768075,0.0000021393128,0.000036419035,0.00034516363],"genre_scores_gemma":[0.9350934,0.000016352693,0.06406018,0.0006086668,0.00014465788,0.0000036240876,0.0000013373028,0.000017190767,0.00005460486],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99654394,0.00014537075,0.0008839168,0.0008731373,0.001083164,0.0004704701],"domain_scores_gemma":[0.9967253,0.0008416931,0.0007445943,0.0014060031,0.00021010955,0.00007230563],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014376198,0.00037528062,0.000608526,0.00046456527,0.00017862662,0.00011916687,0.0036184974,0.00018632218,0.0000066886905],"category_scores_gemma":[0.0001107169,0.00024055611,0.00018519715,0.00085872674,0.00084507995,0.00025229843,0.002396972,0.0006638179,0.000008788566],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000011554325,0.00017240435,0.00015132735,0.00010416874,0.000021232707,0.000008875743,0.0040540705,0.06110185,0.0030416406,0.066095084,0.000023070805,0.8652147],"study_design_scores_gemma":[0.00037030556,0.00016645604,0.006014496,0.001422217,0.000008214189,0.00002167913,8.1335406e-7,0.8464605,0.008109863,0.13696328,0.00011171418,0.00035041632],"about_ca_topic_score_codex":0.00020466695,"about_ca_topic_score_gemma":0.00009565534,"teacher_disagreement_score":0.91274136,"about_ca_system_score_codex":0.00017522895,"about_ca_system_score_gemma":0.00029491994,"threshold_uncertainty_score":0.98095936},"labels":[],"label_agreement":null},{"id":"W2149799385","doi":"10.1145/1277548.1277599","title":"Symbolic-numeric computation of implicit riquier bases for PDE","year":2007,"lang":"en","type":"article","venue":"","topic":"Polynomial and algebraic computation","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"Natural Sciences and Engineering Research Council of Canada; National Science Foundation","keywords":"Sequence (biology); Computation; Symbolic computation; Polynomial; Partial differential equation; Algebra over a field; Mathematics; Differential equation; Computer science; Applied mathematics; Pure mathematics; Algorithm; Mathematical analysis","score_opus":0.014178209676085128,"score_gpt":0.27716055623627933,"score_spread":0.2629823465601942,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2149799385","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.14948861,0.0000238813,0.8481419,0.0002903491,0.00020142931,0.00015610724,0.0000014833139,0.00009038236,0.0016058291],"genre_scores_gemma":[0.9228968,8.196108e-7,0.07641854,0.00042486968,0.000075708056,0.0000047063672,0.000003917538,0.0000047430835,0.00016988377],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999195,0.00001248711,0.00026636038,0.00019855243,0.00012608661,0.00020154104],"domain_scores_gemma":[0.9993785,0.00023133718,0.00010305725,0.00013901938,0.00008707982,0.000061021154],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002694459,0.000082404804,0.00013950346,0.000112244874,0.0000561721,0.000030589017,0.0002446088,0.000029496792,0.0000055164396],"category_scores_gemma":[0.000022378415,0.000072927956,0.000069683236,0.00029881735,0.00002081165,0.00021699959,0.00006828013,0.000028380866,0.000009848421],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000028038916,0.000107941625,0.00050973473,0.0000389503,0.000021554239,0.0000015718426,0.00045360456,0.0012330685,0.0111171175,0.16285077,0.001832746,0.8218049],"study_design_scores_gemma":[0.0016909287,0.00064410816,0.09160435,0.000048607013,0.000021854366,0.000033117954,0.00009750093,0.6696697,0.1236871,0.105898514,0.006007123,0.0005971],"about_ca_topic_score_codex":0.00007264622,"about_ca_topic_score_gemma":0.000014313298,"teacher_disagreement_score":0.8212078,"about_ca_system_score_codex":0.00001938791,"about_ca_system_score_gemma":0.000035307727,"threshold_uncertainty_score":0.29739156},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"","keywords":"Computer science","score_opus":0.013355175953134542,"score_gpt":0.2700733685058671,"score_spread":0.25671819255273254,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2150489476","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0026062585,0.000025491976,0.9865105,0.005671813,0.00006524485,0.00015461618,7.641918e-7,0.00041701205,0.004548305],"genre_scores_gemma":[0.334334,7.7544087e-7,0.66424304,0.0007908756,0.00021464973,0.000027740643,0.0000020022799,0.000002706311,0.0003841927],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995645,0.000009692059,0.00011648688,0.00013751548,0.00005258413,0.000119176395],"domain_scores_gemma":[0.999701,0.000077156685,0.000027916569,0.00012466554,0.000031818232,0.000037393645],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000117497264,0.00004913718,0.000057312616,0.000053562624,0.00010792097,0.000079997415,0.00023249438,0.000020342226,0.000009708478],"category_scores_gemma":[0.000014327142,0.000043678727,0.00004903922,0.00010652471,0.0000067444485,0.00029214373,0.000054303317,0.00002486182,0.000021704616],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000015534449,0.000027927015,0.0000047725334,0.0000020180294,0.0000037855589,2.647822e-7,0.00009932283,0.000041458094,0.0029457815,0.18082106,0.0033437454,0.8127083],"study_design_scores_gemma":[0.00052160176,0.00013600627,0.00023925956,0.000017625185,0.0000066414696,0.00001805082,0.000010408439,0.5096975,0.19713081,0.046191793,0.24573572,0.000294579],"about_ca_topic_score_codex":0.000004819091,"about_ca_topic_score_gemma":0.000005484234,"teacher_disagreement_score":0.81241375,"about_ca_system_score_codex":0.000018808012,"about_ca_system_score_gemma":0.00002094778,"threshold_uncertainty_score":0.17811668},"labels":[],"label_agreement":null},{"id":"W2150896986","doi":"10.1145/569746.569748","title":"Computing the minimal telescoper for sums of hypergeometric terms","year":2001,"lang":"en","type":"article","venue":"ACM SIGSAM Bulletin","topic":"Polynomial and algebraic computation","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Russian Academy of Sciences","keywords":"Maple; Hypergeometric distribution; Mathematics; Term (time); Construct (python library); Combinatorics; Hypergeometric function; Discrete mathematics; Pure mathematics; Computer science; Physics; Botany; Programming language","score_opus":0.022071780781998677,"score_gpt":0.2499013217956987,"score_spread":0.22782954101370004,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2150896986","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.71930546,0.00033412463,0.26550683,0.012576719,0.00059800455,0.00042640953,0.0000047515236,0.0001238443,0.0011238765],"genre_scores_gemma":[0.96938217,0.00001289152,0.029370295,0.00067155453,0.00021893991,0.000011252207,0.000003573861,0.000009310053,0.00032002563],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99888164,0.000046175028,0.00029717217,0.00028646225,0.00019827383,0.00029027197],"domain_scores_gemma":[0.99805725,0.0011412733,0.00013879863,0.00053472613,0.000075733384,0.0000522026],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00041783112,0.00012286194,0.000175974,0.00012557764,0.00015860869,0.00007385412,0.0013439595,0.000042778967,0.000051519226],"category_scores_gemma":[0.00056018843,0.00008552655,0.00010671276,0.00058664556,0.000054631568,0.00006118563,0.00044902295,0.00008487336,0.000067445355],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000051893287,0.00014910192,0.003665447,0.000036947888,0.000047868496,0.000010017869,0.00082992914,0.0005754091,0.004854086,0.007858183,0.043312497,0.93860865],"study_design_scores_gemma":[0.002353831,0.00073311996,0.05717191,0.00010744771,0.00002939418,0.0001229767,0.00014712759,0.055079103,0.013230242,0.0067164693,0.86355764,0.0007507182],"about_ca_topic_score_codex":0.000054120937,"about_ca_topic_score_gemma":0.000002064227,"teacher_disagreement_score":0.9378579,"about_ca_system_score_codex":0.000016968717,"about_ca_system_score_gemma":0.00003215841,"threshold_uncertainty_score":0.34876716},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.02228769174550693,"score_gpt":0.2552590522068215,"score_spread":0.23297136046131456,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2150928761","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.39986026,0.0003155341,0.59845877,0.00006670953,0.00082080584,0.000097881406,7.250333e-7,0.000025432419,0.00035385002],"genre_scores_gemma":[0.9836685,0.000014395974,0.016053371,0.000039201306,0.00019982454,0.0000016260786,0.000001970241,0.000008082934,0.0000130043245],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982417,0.0001543962,0.00088984234,0.00015046459,0.00040183213,0.00016175344],"domain_scores_gemma":[0.99813,0.0001202726,0.001055375,0.00015366811,0.00043143582,0.0001092101],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00060791476,0.00012939106,0.00035311715,0.0004099406,0.00005764191,0.000060004895,0.0004595962,0.000062763655,0.000007223943],"category_scores_gemma":[0.000037452344,0.00011576091,0.00016103369,0.00045903228,0.000033194163,0.0007044655,0.000066156535,0.00013395451,0.000009711403],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0004626907,0.0017407156,0.0032167323,0.0004928218,0.0006982958,0.0002378205,0.032709226,0.06762118,0.040398702,0.22255814,0.0029945914,0.6268691],"study_design_scores_gemma":[0.0056328974,0.0027725436,0.11686962,0.00090553187,0.00017717264,0.002041297,0.000621229,0.72083783,0.027356446,0.121366456,0.0005642938,0.0008547029],"about_ca_topic_score_codex":0.00005071031,"about_ca_topic_score_gemma":9.421267e-7,"teacher_disagreement_score":0.6532166,"about_ca_system_score_codex":0.00006017271,"about_ca_system_score_gemma":0.00013035849,"threshold_uncertainty_score":0.47205928},"labels":[],"label_agreement":null},{"id":"W2151758200","doi":"10.1145/504331.504334","title":"Homotopies and polynomial system solving I","year":2001,"lang":"en","type":"article","venue":"ACM SIGSAM Bulletin","topic":"Polynomial and algebraic computation","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"","keywords":"Maple; Polynomial; Terminology; Computer science; Algebra over a field; System of polynomial equations; Matrix polynomial; Mathematics; Calculus (dental); Applied mathematics; Pure mathematics; Mathematical analysis","score_opus":0.011355514260965987,"score_gpt":0.21171585223880213,"score_spread":0.20036033797783614,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2151758200","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.85368,0.0012139627,0.110314615,0.023883626,0.0013911115,0.00033614965,0.000003028736,0.0009605304,0.008216989],"genre_scores_gemma":[0.98520136,0.000026303804,0.013487517,0.00037756332,0.00030934424,0.0000104959045,0.0000014540303,0.000007764683,0.000578195],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9990492,0.00004590134,0.0001822798,0.0003229116,0.0001421503,0.00025757015],"domain_scores_gemma":[0.99917775,0.00021344605,0.00006385084,0.00042177833,0.000028486176,0.00009467061],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00017900432,0.00012378824,0.00014296065,0.000071428214,0.00018209424,0.00021161686,0.00061304064,0.000048174265,0.000035446923],"category_scores_gemma":[0.00011576554,0.00011556865,0.00003915006,0.00013802349,0.00003702008,0.000120382996,0.0005323658,0.00008729156,0.00019909542],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000054928383,0.00012731522,0.0057154926,0.00012068587,0.00006864741,0.00033335268,0.0027763725,0.00010846688,0.0042525046,0.058238555,0.09409558,0.8341081],"study_design_scores_gemma":[0.0019198791,0.00029507736,0.035239197,0.00022743097,0.00001815639,0.0009016683,0.00037974425,0.027378604,0.0020995936,0.00254804,0.92795724,0.0010353544],"about_ca_topic_score_codex":0.00013387842,"about_ca_topic_score_gemma":0.00000504298,"teacher_disagreement_score":0.83386165,"about_ca_system_score_codex":0.000032738342,"about_ca_system_score_gemma":0.000024818966,"threshold_uncertainty_score":0.47127527},"labels":[],"label_agreement":null},{"id":"W2153131327","doi":"10.1016/j.jsc.2011.08.015","title":"Homotopy techniques for multiplication modulo triangular sets","year":2011,"lang":"en","type":"article","venue":"Journal of Symbolic Computation","topic":"Polynomial and algebraic computation","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"","keywords":"Mathematics; Modulo; Multiplication (music); Homotopy; Algebraic number; Algebra over a field; Interpolation (computer graphics); Discrete mathematics; Arithmetic; Combinatorics; Pure mathematics; Mathematical analysis","score_opus":0.03262150932117265,"score_gpt":0.2785053708529415,"score_spread":0.2458838615317689,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2153131327","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08316745,0.000079718026,0.91523194,0.00047486695,0.00044210805,0.00031073377,0.0000015720307,0.00008480626,0.00020679334],"genre_scores_gemma":[0.70722455,0.000008082882,0.29242104,0.00012813702,0.00018134608,0.000012286954,0.0000028305733,0.000007901806,0.000013844705],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99880934,0.000060456536,0.00056325016,0.00017646252,0.00022738958,0.0001630865],"domain_scores_gemma":[0.9985766,0.0001271868,0.0006049531,0.00015734855,0.00044192074,0.000091988855],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005351836,0.00012141934,0.00022790211,0.00029558298,0.00009272281,0.000071789575,0.00044013862,0.00006331,0.00000302187],"category_scores_gemma":[0.000078956815,0.00010932493,0.00015726783,0.0002788384,0.00002200775,0.00067787187,0.000052533236,0.00010107283,0.000005124706],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006216388,0.00018675567,0.00009316918,0.00002531592,0.0000413557,0.000005527305,0.0029513345,0.0003032515,0.0036935352,0.011884818,0.0010966623,0.9796561],"study_design_scores_gemma":[0.0028325613,0.0014235685,0.030455988,0.00016491582,0.00006880606,0.00033240812,0.00011140155,0.5829543,0.06402305,0.3141704,0.0029287294,0.0005338971],"about_ca_topic_score_codex":0.00001422428,"about_ca_topic_score_gemma":0.0000011751362,"teacher_disagreement_score":0.9791222,"about_ca_system_score_codex":0.00006229766,"about_ca_system_score_gemma":0.00009425836,"threshold_uncertainty_score":0.44581413},"labels":[],"label_agreement":null},{"id":"W2158079656","doi":"10.1016/j.jsc.2007.03.001","title":"Output-sensitive modular algorithms for polynomial matrix normal forms","year":2007,"lang":"en","type":"article","venue":"Journal of Symbolic Computation","topic":"Polynomial and algebraic computation","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo; University of Lethbridge","funders":"","keywords":"Mathematics; Unimodular matrix; Polynomial matrix; Algorithm; Matrix multiplication; Polynomial; Normalization (sociology); Modular arithmetic; Matrix (chemical analysis); Homomorphism; Integer matrix; Matrix polynomial; Algebra over a field; Discrete mathematics; Combinatorics; Pure mathematics; Symmetric matrix; Eigenvalues and eigenvectors","score_opus":0.016271988497507783,"score_gpt":0.2861105198451552,"score_spread":0.2698385313476474,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2158079656","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2879018,0.000068057685,0.71005255,0.0005196436,0.0010954296,0.0001793054,0.0000028820934,0.000039717856,0.00014060354],"genre_scores_gemma":[0.8863814,0.000004463946,0.112286635,0.00018696566,0.0010494118,0.0000016329684,0.0000059235317,0.000013419602,0.00007014849],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9980428,0.000040039395,0.0008477659,0.00022483131,0.00045616066,0.00038840453],"domain_scores_gemma":[0.99806964,0.00032584317,0.00071395125,0.00013038416,0.0005629024,0.00019726703],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012569707,0.00018737275,0.00034152326,0.00045761763,0.00017031912,0.0001582912,0.00040598054,0.00009109358,0.0000012468576],"category_scores_gemma":[0.00007092831,0.00016598371,0.00026032288,0.00037840358,0.00003667657,0.0009659925,0.0000933692,0.00019300413,0.000009760951],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00025844906,0.0002032229,0.0001424553,0.000036378213,0.00013303461,0.000080908896,0.0030410758,0.027286302,0.00409618,0.008181809,0.001636274,0.9549039],"study_design_scores_gemma":[0.0044464553,0.0011770127,0.04118558,0.00009692534,0.000068521826,0.0010390878,0.0003150105,0.91509175,0.011815372,0.020776685,0.0033984252,0.0005891574],"about_ca_topic_score_codex":0.0000146639795,"about_ca_topic_score_gemma":0.000003809365,"teacher_disagreement_score":0.95431477,"about_ca_system_score_codex":0.00014864336,"about_ca_system_score_gemma":0.00017587596,"threshold_uncertainty_score":0.67686194},"labels":[],"label_agreement":null},{"id":"W2158950080","doi":"10.1145/1940475.1940484","title":"Complexity and performance results for non FFT-based univariate polynomial multiplication","year":2011,"lang":"en","type":"article","venue":"ACM communications in computer algebra","topic":"Polynomial and algebraic computation","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"","keywords":"Univariate; Computer science; Multiplication (music); Fast Fourier transform; Parallel computing; Arithmetic; Polynomial; Theoretical computer science; Algorithm; Mathematics; Multivariate statistics","score_opus":0.08529995648316663,"score_gpt":0.29066177376049873,"score_spread":0.2053618172773321,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2158950080","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1792306,0.00006032416,0.8149919,0.003884377,0.00028496666,0.0007541502,0.000019115862,0.00023386505,0.00054071733],"genre_scores_gemma":[0.5512199,0.000021245458,0.4483342,0.0002512144,0.000040142302,0.00007090593,0.00004642663,0.00000842789,0.000007603623],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99827176,0.00015336131,0.0005829402,0.00052937074,0.00013408026,0.00032848513],"domain_scores_gemma":[0.99573386,0.00068428164,0.00023930648,0.0031004706,0.00013777637,0.00010432545],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005266052,0.00021915547,0.0002483373,0.00027784615,0.0003733554,0.0001216869,0.0033767256,0.00009645586,0.0000013904582],"category_scores_gemma":[0.00007787801,0.00023323826,0.000065594104,0.0005014149,0.00022223218,0.0006018409,0.0016743429,0.00022511122,0.000014094951],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005121881,0.0012969424,0.007966738,0.00012081015,0.00007388199,0.0000032479406,0.008783891,0.00036779922,0.000639927,0.09029707,0.0019876075,0.8879499],"study_design_scores_gemma":[0.0018447774,0.00020361863,0.14116031,0.0000501578,0.0000070965025,0.000006353301,0.000006607852,0.8457997,0.00040646485,0.009401619,0.0008549299,0.00025837656],"about_ca_topic_score_codex":0.00022873825,"about_ca_topic_score_gemma":0.00011467453,"teacher_disagreement_score":0.8876915,"about_ca_system_score_codex":0.00008291807,"about_ca_system_score_gemma":0.00011734168,"threshold_uncertainty_score":0.951118},"labels":[],"label_agreement":null},{"id":"W2159212455","doi":"10.1016/j.jsc.2009.09.004","title":"Computing differential characteristic sets by change of ordering","year":2009,"lang":"en","type":"article","venue":"Journal of Symbolic Computation","topic":"Polynomial and algebraic computation","field":"Computer Science","cited_by":26,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"","keywords":"Mathematics; Prime (order theory); Ideal (ethics); Set (abstract data type); Differential (mechanical device); Ranking (information retrieval); Prime ideal; Software; Algorithm; Discrete mathematics; Algebra over a field; Combinatorics; Pure mathematics; Computer science; Programming language; Artificial intelligence","score_opus":0.018335059526763925,"score_gpt":0.2645680777233865,"score_spread":0.24623301819662255,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2159212455","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5290903,0.00009403274,0.4697827,0.0004881507,0.00042058926,0.000060318704,0.0000011271809,0.00002179335,0.000040992974],"genre_scores_gemma":[0.99309033,0.000013612602,0.006412782,0.00016738253,0.00030259992,3.6061124e-7,0.000005113058,0.0000045962843,0.0000032239207],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99855524,0.00007021384,0.00067572,0.00015047817,0.00035815904,0.00019019461],"domain_scores_gemma":[0.99863046,0.00009597625,0.00085080403,0.00010288448,0.00022378241,0.00009607062],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00023029973,0.00013723363,0.0003373111,0.00023017036,0.000072228024,0.00008895458,0.00038287012,0.000045954224,0.0000034205177],"category_scores_gemma":[0.00003123891,0.00012698806,0.00011010472,0.00031674438,0.000019781726,0.0005428861,0.000048705377,0.00015421447,0.0000023614068],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000021388305,0.00017950434,0.00021631477,0.00002679273,0.000027715274,0.00001078063,0.002485592,0.00069688365,0.017217206,0.0012204592,0.00028128808,0.9776161],"study_design_scores_gemma":[0.0015970981,0.0009074832,0.40756315,0.00031750606,0.000037705744,0.00019394532,0.000048468923,0.57668006,0.0034814982,0.00868301,0.00014093697,0.00034911893],"about_ca_topic_score_codex":0.000010150675,"about_ca_topic_score_gemma":3.0276806e-7,"teacher_disagreement_score":0.97726697,"about_ca_system_score_codex":0.0000442102,"about_ca_system_score_gemma":0.00005090365,"threshold_uncertainty_score":0.5178423},"labels":[],"label_agreement":null},{"id":"W2159979920","doi":"10.1007/978-3-319-10515-4_13","title":"On the Parallelization of Subproduct Tree Techniques Targeting Many-Core Architectures","year":2014,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Polynomial and algebraic computation","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"","keywords":"Parallel computing; Computer science; Fast Fourier transform; Univariate; Multi-core processor; Tree (set theory); Interpolation (computer graphics); Algorithm; Theoretical computer science; Mathematics; Multivariate statistics; Artificial intelligence; Machine learning","score_opus":0.015527440102147053,"score_gpt":0.23534509221781305,"score_spread":0.219817652115666,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2159979920","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0013033699,0.00017922526,0.9935431,0.0017766939,0.00067416026,0.00043217468,0.0000018049025,0.00016666728,0.0019228372],"genre_scores_gemma":[0.8201481,0.000017168853,0.17684636,0.0020871542,0.0006951635,0.000013131049,0.0000069550556,0.000031410687,0.00015451995],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9970965,0.000061131075,0.00053860655,0.001067401,0.00082012214,0.00041625934],"domain_scores_gemma":[0.99730694,0.00091172056,0.00044901948,0.0010781054,0.0001813577,0.00007284793],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.001122932,0.00041816666,0.00042262822,0.00057661085,0.00023785768,0.00020261099,0.0027561178,0.00017545691,0.000010197347],"category_scores_gemma":[0.0002809696,0.0002830353,0.00013433392,0.0004924296,0.00054183305,0.00011243778,0.000727653,0.0005745732,0.000010440351],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000007442473,0.0000145458735,0.000012313356,0.000032858476,0.0000067350584,0.00000554558,0.00048232416,0.029607413,0.0006582445,0.1977502,0.000116288524,0.7713061],"study_design_scores_gemma":[0.000098190365,0.00025454923,0.00015260582,0.00038188172,0.000005454683,0.000014839407,1.00852525e-7,0.37526804,0.017673915,0.6048805,0.000858472,0.0004114359],"about_ca_topic_score_codex":0.000020188088,"about_ca_topic_score_gemma":0.000025737176,"teacher_disagreement_score":0.8188448,"about_ca_system_score_codex":0.00010107497,"about_ca_system_score_gemma":0.00020310527,"threshold_uncertainty_score":0.99996215},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.019024809200461894,"score_gpt":0.2428876335570685,"score_spread":0.2238628243566066,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2162009465","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4140593,0.00019840436,0.58501494,0.000109711626,0.00048060901,0.000056936642,5.4189513e-7,0.000015369911,0.00006416905],"genre_scores_gemma":[0.9688421,0.0000052023784,0.030976458,0.000020523265,0.00012900833,8.319338e-7,0.0000011096708,0.0000064623605,0.000018340163],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99861103,0.00011242571,0.00051483617,0.00013515573,0.00047381563,0.00015273274],"domain_scores_gemma":[0.99837667,0.0002719705,0.00073099183,0.00009696411,0.00043937357,0.00008400529],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004321556,0.00011937976,0.00026775445,0.0002648199,0.00009015974,0.00007473467,0.0001909156,0.000042292297,0.0000021637225],"category_scores_gemma":[0.00007654562,0.00009247439,0.000072382405,0.0003730249,0.00003288518,0.00055202254,0.000029503255,0.00012954809,0.0000034977465],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000061247825,0.00020874302,0.002772588,0.00009443499,0.0001241677,0.000026081072,0.0028967315,0.9518083,0.0080414675,0.02042103,0.00011511055,0.013430144],"study_design_scores_gemma":[0.0015993406,0.0009193957,0.013636478,0.00044059553,0.000042231717,0.0004520945,0.00018564519,0.97280204,0.005898257,0.0031660635,0.0005607427,0.00029712284],"about_ca_topic_score_codex":0.000031163832,"about_ca_topic_score_gemma":0.0000013642017,"teacher_disagreement_score":0.55478275,"about_ca_system_score_codex":0.00005580979,"about_ca_system_score_gemma":0.00019910515,"threshold_uncertainty_score":0.37709963},"labels":[],"label_agreement":null},{"id":"W2163657101","doi":"10.1142/s1793042106000474","title":"A GENERALIZATION OF A THEOREM OF BUMBY ON QUARTIC DIOPHANTINE EQUATIONS","year":2006,"lang":"en","type":"article","venue":"International Journal of Number Theory","topic":"Polynomial and algebraic computation","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa; University of British Columbia","funders":"","keywords":"Diophantine equation; Mathematics; Integer (computer science); Quartic function; Generalization; Quartic surface; Diophantine set; Legendre's equation; Thue equation; Discrete mathematics; Pure mathematics; Combinatorics; Mathematical analysis","score_opus":0.008623245802747722,"score_gpt":0.25760032814902345,"score_spread":0.24897708234627572,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2163657101","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.29180533,0.000040796767,0.70480394,0.00051006064,0.0006025,0.00003753074,0.000014680066,0.000010142929,0.0021749875],"genre_scores_gemma":[0.9947057,0.0000042998117,0.0047626826,0.00009274701,0.0002713842,0.0000010811699,0.000007346064,0.000005074409,0.00014970644],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99867487,0.00012380825,0.0005632959,0.000087304834,0.00047200426,0.000078719495],"domain_scores_gemma":[0.99822915,0.0004167456,0.0006802112,0.00011607204,0.0005302564,0.000027581],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00046659505,0.000074683514,0.0001483003,0.00018087185,0.000020233441,0.00002881264,0.00056008395,0.000026799838,0.00014212808],"category_scores_gemma":[0.00015973175,0.000061982966,0.00012428705,0.0001780934,0.000056382498,0.00028072068,0.000053095217,0.00006572496,0.000010602609],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000854195,0.00025139586,0.0003785798,0.0000045949373,0.00006487659,0.000008959983,0.00028455825,0.005220196,0.0077400017,0.9707598,0.00053348613,0.014668151],"study_design_scores_gemma":[0.001336882,0.00022647306,0.009021672,0.00023341127,0.000026932228,0.000119632554,0.000040929866,0.03180333,0.041329764,0.91504216,0.0006619078,0.0001569063],"about_ca_topic_score_codex":0.000020347867,"about_ca_topic_score_gemma":0.0000025004654,"teacher_disagreement_score":0.70290035,"about_ca_system_score_codex":0.000034049037,"about_ca_system_score_gemma":0.00007702794,"threshold_uncertainty_score":0.2527592},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.005583937670656649,"score_gpt":0.20053279992587036,"score_spread":0.1949488622552137,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2164838307","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.72707593,0.00014499095,0.2708267,0.0011550764,0.000077898476,0.00012215672,3.6789726e-7,0.00008939968,0.00050746015],"genre_scores_gemma":[0.9843411,0.000013523047,0.015442175,0.00016406944,0.000016496415,0.000008498508,0.0000015718168,0.0000064693018,0.0000060838656],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993287,0.000031083713,0.0002239412,0.00015425493,0.00011284784,0.00014920649],"domain_scores_gemma":[0.99840575,0.0008250342,0.000079203404,0.00062886847,0.000027439963,0.00003371003],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00051211676,0.0000967248,0.000121923906,0.00011422908,0.00010889399,0.00007104798,0.00078531535,0.00004680529,0.000003804067],"category_scores_gemma":[0.00007833608,0.00008072154,0.000025181505,0.0004367559,0.000045495093,0.000105143925,0.00039056025,0.0003692651,0.0000035760895],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000011510392,0.000029170127,0.00034466403,0.000012828164,0.000005394615,1.7068479e-7,0.00033410394,0.0040033627,0.0039814617,0.97070634,0.00002802539,0.020553313],"study_design_scores_gemma":[0.00022070433,0.000028473884,0.015843824,0.000040369658,0.00000194857,0.000007495618,0.00003624617,0.9414063,0.003871189,0.03757542,0.00079795823,0.00017003577],"about_ca_topic_score_codex":0.00006946213,"about_ca_topic_score_gemma":0.000004666909,"teacher_disagreement_score":0.93740296,"about_ca_system_score_codex":0.000008464825,"about_ca_system_score_gemma":0.000014340947,"threshold_uncertainty_score":0.32917288},"labels":[],"label_agreement":null},{"id":"W2165225265","doi":"10.1016/j.jsc.2005.05.009","title":"Computation of unirational fields","year":2006,"lang":"en","type":"article","venue":"Journal of Symbolic Computation","topic":"Polynomial and algebraic computation","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Mathematics; Factoring; Algebraic number; Algebra over a field; Field (mathematics); Computation; Extension (predicate logic); Field extension; Zero (linguistics); Pure mathematics; Algorithm; Computer science; Mathematical analysis","score_opus":0.010409715088580497,"score_gpt":0.24192445726325396,"score_spread":0.23151474217467347,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2165225265","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.31838852,0.0001069196,0.67989975,0.0006126612,0.00041744622,0.000051704254,7.265545e-7,0.00001951993,0.0005027846],"genre_scores_gemma":[0.9640507,0.0000035831258,0.035511177,0.00007546,0.00032274838,6.798646e-7,0.0000061066385,0.000005202741,0.000024323042],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984346,0.00008125792,0.00078110764,0.00012659437,0.00044990436,0.00012651693],"domain_scores_gemma":[0.99837816,0.00015765105,0.0008114932,0.000082085826,0.0005204335,0.000050149843],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00034893362,0.000107010026,0.00023862532,0.00032040518,0.00006383219,0.00006866575,0.00028527583,0.00005654945,0.0000040262967],"category_scores_gemma":[0.000028768902,0.00009971902,0.00012346319,0.00044385288,0.000034557455,0.0005806799,0.000051282343,0.00012206692,0.000004972622],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004450994,0.0003913952,0.0015504293,0.000060118888,0.00006339565,0.000021578504,0.0010374528,0.63898325,0.004872535,0.108167015,0.0044111153,0.24039723],"study_design_scores_gemma":[0.0014255494,0.0004218572,0.102678254,0.00010516873,0.000026136824,0.00020614525,0.000038785078,0.67671496,0.0037324445,0.2141056,0.00031688294,0.00022817828],"about_ca_topic_score_codex":0.0000443918,"about_ca_topic_score_gemma":0.0000057415555,"teacher_disagreement_score":0.6456622,"about_ca_system_score_codex":0.000048491023,"about_ca_system_score_gemma":0.00017404226,"threshold_uncertainty_score":0.40664235},"labels":[],"label_agreement":null},{"id":"W2165632705","doi":"10.1016/j.laa.2009.08.002","title":"Fast conversion algorithms for orthogonal polynomials","year":2009,"lang":"en","type":"article","venue":"Linear Algebra and its Applications","topic":"Polynomial and algebraic computation","field":"Computer Science","cited_by":18,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"","keywords":"Mathematics; Monomial; Basis (linear algebra); Converse; Orthogonal polynomials; Algorithm; Orthogonal basis; Monomial basis; Algebra over a field; Combinatorics; Pure mathematics; Geometry","score_opus":0.017659767078442863,"score_gpt":0.2679961511991415,"score_spread":0.25033638412069864,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2165632705","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.019484749,0.00030864318,0.97353494,0.005424422,0.00009959861,0.0005942037,0.000027014908,0.00016091164,0.00036548986],"genre_scores_gemma":[0.9526945,0.00006515412,0.043893773,0.0018480795,0.0005910711,0.0001412358,0.00006128719,0.0000098878545,0.0006950534],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991398,0.0000134137845,0.00020138267,0.0003421055,0.00010555839,0.00019773492],"domain_scores_gemma":[0.9994395,0.00008012339,0.00007538485,0.00019969225,0.00008093506,0.00012435933],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000106580716,0.00011654788,0.00013152437,0.00007015531,0.00025479007,0.00007998502,0.0002926344,0.00005676043,0.0000064643664],"category_scores_gemma":[0.0000129659265,0.00010903333,0.000057081004,0.0002203208,0.00002015526,0.00026821837,0.00006137282,0.00006250643,0.000043494954],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008264067,0.000091654685,0.000010378406,0.000012330699,0.00001105806,4.0568978e-7,0.00015853539,0.00003479577,0.0046350784,0.4823516,0.00090356113,0.51178235],"study_design_scores_gemma":[0.0016998182,0.0004400548,0.005626513,0.000022674003,0.000037553982,0.000035995483,0.000036703535,0.72867,0.016789187,0.08306216,0.1629005,0.0006788269],"about_ca_topic_score_codex":0.0000022503725,"about_ca_topic_score_gemma":4.9017916e-7,"teacher_disagreement_score":0.9332097,"about_ca_system_score_codex":0.0000121943585,"about_ca_system_score_gemma":0.0000472127,"threshold_uncertainty_score":0.44462502},"labels":[],"label_agreement":null},{"id":"W2168645231","doi":"10.1145/1823931.1823933","title":"A package for solving parametric polynomial systems","year":2010,"lang":"en","type":"article","venue":"ACM communications in computer algebra","topic":"Polynomial and algebraic computation","field":"Computer Science","cited_by":32,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"","keywords":"Discriminant; Polynomial; Parametric statistics; Generalization; Univariate; Variety (cybernetics); Complement (music); Algebraic variety; Mathematics; Algebra over a field; Applied mathematics; Discrete mathematics; Pure mathematics; Algebraic number; Computer science; Mathematical analysis; Artificial intelligence; Multivariate statistics","score_opus":0.03375460156274802,"score_gpt":0.2942596164167215,"score_spread":0.2605050148539735,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2168645231","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.112919725,0.00036581923,0.8790401,0.003668397,0.0023925253,0.0010075044,0.000009432734,0.00036635742,0.00023012514],"genre_scores_gemma":[0.65808594,0.00002101773,0.3410997,0.0002514675,0.00023960578,0.000241825,0.000021609509,0.000015396223,0.000023413448],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981059,0.00012138528,0.00060429645,0.0005055843,0.00020407676,0.00045876802],"domain_scores_gemma":[0.99256736,0.0021846902,0.00020992973,0.004765857,0.00014250047,0.00012965869],"candidate_categories":["open_science"],"consensus_categories":[],"category_scores_codex":[0.00075625017,0.00023210177,0.00031268795,0.0005453118,0.00036290052,0.00055215025,0.0069044475,0.00014310691,0.0000032082544],"category_scores_gemma":[0.00032419444,0.00024204544,0.00013093413,0.0011441595,0.00012328857,0.0006733901,0.0028068104,0.0005418111,0.00004824878],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000017974644,0.0006856802,0.0028806932,0.00006654415,0.0000780174,0.000006942785,0.0018394953,0.0007898987,0.0035224466,0.38116312,0.010283538,0.59866565],"study_design_scores_gemma":[0.0010905117,0.00010695361,0.008274079,0.000048045942,0.000010196749,0.000045971236,0.000016942515,0.9503776,0.00033347614,0.019064886,0.02015391,0.00047741787],"about_ca_topic_score_codex":0.00015319919,"about_ca_topic_score_gemma":0.00012892096,"teacher_disagreement_score":0.9495877,"about_ca_system_score_codex":0.000069450165,"about_ca_system_score_gemma":0.00017380217,"threshold_uncertainty_score":0.9984687},"labels":[],"label_agreement":null},{"id":"W2168788073","doi":"10.1145/1837210.1837227","title":"Parallel sparse polynomial division using heaps","year":2010,"lang":"en","type":"article","venue":"","topic":"Polynomial and algebraic computation","field":"Computer Science","cited_by":17,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"Natural Sciences and Engineering Research Council of Canada; Mitacs","keywords":"Speedup; Division (mathematics); Computer science; Parallel computing; Quotient; Polynomial; Multi-core processor; Parallelism (grammar); Theoretical computer science; Algorithm; Mathematics; Arithmetic; Combinatorics","score_opus":0.021118979101162387,"score_gpt":0.2573325775597533,"score_spread":0.2362135984585909,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2168788073","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.47390893,0.000006356019,0.5225902,0.0005742135,0.0010856735,0.0000555803,3.213876e-7,0.00013762071,0.0016410823],"genre_scores_gemma":[0.85490644,4.9406964e-7,0.14429516,0.00032026606,0.0002132973,0.0000012961933,9.573123e-7,0.000004607747,0.00025747187],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991496,0.000020426467,0.00016293666,0.00027412278,0.00016185253,0.00023103482],"domain_scores_gemma":[0.99944323,0.00004471713,0.00004841745,0.00032017715,0.000027570613,0.00011585899],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001466653,0.000102363076,0.00010075696,0.00007262183,0.00013774654,0.00015919466,0.00047311853,0.000053474378,0.000060799117],"category_scores_gemma":[0.000018722101,0.000085748754,0.000055077056,0.00017642263,0.000029877401,0.00045917148,0.00026548628,0.00015076183,0.000121863195],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000023153982,0.00027917387,0.0030652347,0.000010856413,0.000024590754,0.00003399705,0.0007551764,0.0031216163,0.22150797,0.19295435,0.009456133,0.5687677],"study_design_scores_gemma":[0.0006371282,0.000059059665,0.015174984,0.000007381043,0.0000035799649,0.000040199557,0.0000066681378,0.9595921,0.006527679,0.008120776,0.009491864,0.0003385574],"about_ca_topic_score_codex":0.00018497824,"about_ca_topic_score_gemma":0.00004730984,"teacher_disagreement_score":0.9564705,"about_ca_system_score_codex":0.000012454839,"about_ca_system_score_gemma":0.00006638681,"threshold_uncertainty_score":0.34967327},"labels":[],"label_agreement":null},{"id":"W2168997143","doi":"10.1145/1504347.1504374","title":"The modpn library","year":2009,"lang":"en","type":"article","venue":"ACM communications in computer algebra","topic":"Polynomial and algebraic computation","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"Western University","funders":"","keywords":"Citation; Library science; Media studies; Computer science; History; Sociology","score_opus":0.024823367506232718,"score_gpt":0.2725117109034723,"score_spread":0.2476883433972396,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2168997143","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0237098,0.0029755177,0.76857907,0.1952626,0.0008339593,0.00053447025,0.0000021866567,0.0010721107,0.0070303064],"genre_scores_gemma":[0.7153145,0.00037964832,0.28093797,0.0031205707,0.00010934941,0.000020388567,0.000010073228,0.000008027042,0.00009948337],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99856544,0.00023962016,0.00039806106,0.00029926642,0.0001800756,0.00031753397],"domain_scores_gemma":[0.99407035,0.00097393803,0.00010281652,0.0047417628,0.000034815752,0.000076286175],"candidate_categories":["open_science"],"consensus_categories":[],"category_scores_codex":[0.00030284515,0.00015417379,0.0001456723,0.0001412834,0.0005195509,0.0005484061,0.0093596475,0.000054931315,0.0000033654644],"category_scores_gemma":[0.00004690069,0.00012307358,0.00007547715,0.00085584907,0.000108849774,0.0010153691,0.0028094794,0.00032196566,0.00007927219],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000020283755,0.00007859241,0.00016845683,7.492275e-7,0.0000053250833,0.000001983579,0.0003129506,0.00013257898,0.000013954838,0.36225304,0.0038655205,0.6331648],"study_design_scores_gemma":[0.00032325913,0.00008055076,0.035632856,0.000027471697,0.0000023431087,0.000017807635,0.0000072979146,0.39752853,0.0000855409,0.5278791,0.03818583,0.00022937136],"about_ca_topic_score_codex":0.000011022546,"about_ca_topic_score_gemma":0.000013046181,"teacher_disagreement_score":0.6916047,"about_ca_system_score_codex":0.000034174616,"about_ca_system_score_gemma":0.00009316283,"threshold_uncertainty_score":0.9960002},"labels":[],"label_agreement":null},{"id":"W2170152077","doi":"10.48550/arxiv.0806.4196","title":"Jet and prolongation spaces","year":2008,"lang":"en","type":"preprint","venue":"ArXiv.org","topic":"Polynomial and algebraic computation","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Prolongation; Mathematics; Variety (cybernetics); Jet (fluid); Algebraic number; Pure mathematics; Differential (mechanical device); Algebra over a field; Mathematical analysis; Physics; Medicine; Statistics; Cardiology; Mechanics","score_opus":0.0341686913077236,"score_gpt":0.24857681095860393,"score_spread":0.21440811965088033,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2170152077","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.95816076,0.00033375068,0.03767406,0.0022497962,0.00070066575,0.00020102358,0.0000019750728,0.00019594078,0.00048203632],"genre_scores_gemma":[0.9952246,0.00016470936,0.0038973512,0.00022741374,0.00025371774,0.000022623659,0.000012701007,0.000008048912,0.00018883875],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.9989255,0.000052123614,0.00018449409,0.00050219917,0.0001578643,0.00017778567],"domain_scores_gemma":[0.9992945,0.00005297916,0.0001546258,0.0003722917,0.0000509131,0.000074699405],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00011738588,0.00017759425,0.00018497072,0.0000879475,0.000115445895,0.00012897761,0.00043070165,0.00012877773,0.0000027693716],"category_scores_gemma":[0.00003580275,0.00016083471,0.00005086005,0.000110602705,0.000055086362,0.00023120963,0.00092870864,0.00026706475,0.000059275273],"study_design_candidate":"observational","study_design_consensus":"observational","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002467618,0.00019193802,0.7905922,0.00028234496,0.00013458575,0.00011051857,0.007679396,0.0016048237,0.0014096748,0.008435642,0.0051967124,0.18433748],"study_design_scores_gemma":[0.00033200282,0.00008078413,0.9331831,0.00010268837,0.000014353303,0.000043043314,0.000011726627,0.04657616,0.0022333756,0.013182896,0.0037408115,0.00049905566],"about_ca_topic_score_codex":0.00008736037,"about_ca_topic_score_gemma":0.000011463443,"teacher_disagreement_score":0.18383843,"about_ca_system_score_codex":0.000027424689,"about_ca_system_score_gemma":0.0001014424,"threshold_uncertainty_score":0.6558649},"labels":[],"label_agreement":null},{"id":"W2171421030","doi":"10.1109/iccsa.2008.68","title":"High-Performance Symbolic Computation in a Hybrid Compiled-Interpreted Programming Environment","year":2008,"lang":"en","type":"article","venue":"","topic":"Polynomial and algebraic computation","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"","keywords":"Bottleneck; Computer science; Implementation; Maple; Parallel computing; Profiling (computer programming); Computation; Decomposition; Programming language; Theoretical computer science; Embedded system","score_opus":0.010323194113559895,"score_gpt":0.2026008416508053,"score_spread":0.1922776475372454,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2171421030","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.57874036,0.00001688933,0.42047003,0.00015275762,0.0001257841,0.0001403597,3.2456032e-7,0.0001437668,0.00020974237],"genre_scores_gemma":[0.9491109,0.000015320029,0.05053537,0.00018412535,0.000038056925,0.000024587876,0.000009204098,0.000006765456,0.000075673335],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99877965,0.000047781443,0.00031113307,0.0003455415,0.00022780511,0.00028806477],"domain_scores_gemma":[0.99959004,0.000052298838,0.00007740352,0.00019292445,0.00001517958,0.00007214671],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00011883556,0.00014224165,0.00017508486,0.00015574646,0.0001128537,0.000051607134,0.00035162704,0.000025653486,0.000012564216],"category_scores_gemma":[0.0000049690266,0.00013393397,0.000035110774,0.0002414425,0.000048912112,0.0004457257,0.00017261604,0.000113217226,0.000140021],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000032375883,0.00042893924,0.01233994,0.000033600125,0.000024343235,0.00011259764,0.0021466315,0.08323193,0.0007342924,0.005466451,0.0004406768,0.8950082],"study_design_scores_gemma":[0.00061972026,0.00011994964,0.07876954,0.00002776467,0.0000015864275,0.000082466875,0.0000071127347,0.9166526,0.0026796623,0.0004898754,0.00033000397,0.00021971232],"about_ca_topic_score_codex":0.00009114673,"about_ca_topic_score_gemma":0.0000031921554,"teacher_disagreement_score":0.8947885,"about_ca_system_score_codex":0.000093282106,"about_ca_system_score_gemma":0.00003736014,"threshold_uncertainty_score":0.5461669},"labels":[],"label_agreement":null},{"id":"W2172062065","doi":"10.1145/1837210.1837228","title":"A high-performance algorithm for calculating cyclotomic polynomials","year":2010,"lang":"en","type":"article","venue":"","topic":"Polynomial and algebraic computation","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Monic polynomial; Quotient; Algorithm; Mathematics; Polynomial; Properties of polynomial roots; Series (stratigraphy); Reciprocal polynomial; Combinatorics; Discrete mathematics; Computer science; Matrix polynomial","score_opus":0.008912543063187242,"score_gpt":0.2344785463901778,"score_spread":0.22556600332699056,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2172062065","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.44005558,0.000003103007,0.5581988,0.00029430594,0.0008590909,0.00015022242,0.0000017532974,0.00016455147,0.0002726243],"genre_scores_gemma":[0.6132032,4.6412222e-7,0.3859456,0.0002670483,0.00028291432,0.000025275429,0.0000024348299,0.000005699799,0.00026731135],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990947,0.000010183851,0.00022001208,0.0002880845,0.0001132707,0.00027371585],"domain_scores_gemma":[0.999399,0.00012277652,0.00007475895,0.0002727553,0.00004881731,0.00008186729],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000224219,0.00011386139,0.0001368759,0.000070517155,0.00016649201,0.00012900251,0.00046622122,0.000056263354,0.000016741553],"category_scores_gemma":[0.000023977496,0.00009762143,0.000053337317,0.00015133219,0.000023678991,0.00042451423,0.00012621158,0.000106712054,0.0000489637],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000001650833,0.000017804472,0.000055359913,0.0000044307913,0.0000060422954,5.5063543e-7,0.000057139026,0.00011275666,0.017719109,0.024401905,0.00034654827,0.9572767],"study_design_scores_gemma":[0.0004683631,0.000054301145,0.003341662,0.000004678322,0.0000028022014,0.000012852529,0.000002116286,0.9460651,0.045073472,0.0032947755,0.0014985683,0.0001812801],"about_ca_topic_score_codex":0.00009296428,"about_ca_topic_score_gemma":0.000013942838,"teacher_disagreement_score":0.95709544,"about_ca_system_score_codex":0.000014595354,"about_ca_system_score_gemma":0.000064363034,"threshold_uncertainty_score":0.39808863},"labels":[],"label_agreement":null},{"id":"W2172068962","doi":"","title":"Primary decomposition of zero-dimensional ideals: Putting Monico's algorithm into practice","year":2006,"lang":"en","type":"article","venue":"","topic":"Polynomial and algebraic computation","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"","keywords":"Ideal (ethics); Computation; Algorithm; Mathematics; Zero (linguistics); Factorization; Modulo; Decomposition; Polynomial; Computer science; Algebra over a field; Discrete mathematics; Pure mathematics","score_opus":0.0055255362518107625,"score_gpt":0.2513312266931997,"score_spread":0.24580569044138892,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2172068962","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.027418235,0.00017832323,0.96583116,0.0023024348,0.0002341742,0.00010314151,8.6133156e-7,0.00014352833,0.0037881653],"genre_scores_gemma":[0.3292332,0.0000015055597,0.67006254,0.00050368067,0.00008103403,0.0000035053897,0.000011732653,0.0000045609477,0.00009822355],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99879795,0.00007714758,0.0003509502,0.00027902552,0.00031940558,0.0001755387],"domain_scores_gemma":[0.99903023,0.00036003636,0.00020521623,0.00020313384,0.00015421216,0.000047169447],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00035742857,0.000106103995,0.00014472252,0.00009543939,0.00010624171,0.00007086251,0.00028266193,0.000043363572,0.000007122849],"category_scores_gemma":[0.000027522674,0.00009823492,0.00005887575,0.00027073082,0.000028531087,0.000903838,0.00022134141,0.00007989711,0.000026550295],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000105642575,0.00029654067,0.00006501883,0.000021913807,0.00002141765,0.000017481741,0.00014364533,0.0038358497,0.021358753,0.07348324,0.004062819,0.89668274],"study_design_scores_gemma":[0.000916837,0.00021413741,0.010819991,0.00006481083,0.000023369992,0.00015045376,0.000013670375,0.74766374,0.03841223,0.19820498,0.0031424686,0.00037329047],"about_ca_topic_score_codex":0.0006311837,"about_ca_topic_score_gemma":0.0000047265416,"teacher_disagreement_score":0.89630944,"about_ca_system_score_codex":0.000068436864,"about_ca_system_score_gemma":0.000096682175,"threshold_uncertainty_score":0.4005904},"labels":[],"label_agreement":null},{"id":"W2183450085","doi":"","title":"Calculating cyclotomic polynomials of very large height","year":2008,"lang":"en","type":"article","venue":"","topic":"Polynomial and algebraic computation","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Cyclotomic polynomial; Mathematics; Polynomial; Order (exchange); Combinatorics; Series (stratigraphy); Discrete mathematics; Mathematical analysis","score_opus":0.015732238642487118,"score_gpt":0.23161380505347204,"score_spread":0.2158815664109849,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2183450085","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7234246,0.000060354432,0.2710034,0.00018263147,0.00021415888,0.000066129156,0.0000013184323,0.00010932318,0.0049380944],"genre_scores_gemma":[0.98588115,0.00000505241,0.0133767845,0.00027736806,0.00007805786,0.0000022524882,0.000001378594,0.000004359426,0.0003736162],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99915403,0.000032722466,0.00025455476,0.00019881147,0.00015434939,0.00020550955],"domain_scores_gemma":[0.9994938,0.00008534267,0.000089857975,0.00023908995,0.000032802527,0.00005913754],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00013149428,0.000084960186,0.0001569684,0.00007615653,0.0001065659,0.000015887164,0.0003427624,0.000034203793,0.000032515723],"category_scores_gemma":[0.000022620703,0.00007301122,0.00007382186,0.00021194201,0.000027562734,0.00028180116,0.00018293402,0.00004925849,0.000049631446],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005730091,0.0009001072,0.0381982,0.0000983487,0.00017610747,0.00018699108,0.007110985,0.0021658007,0.11621068,0.6892063,0.018762926,0.12692626],"study_design_scores_gemma":[0.0030153785,0.00025749227,0.21070111,0.00007078167,0.000014525895,0.00028344168,0.000053722764,0.57024014,0.19400786,0.011445202,0.008906028,0.0010043369],"about_ca_topic_score_codex":0.00009019054,"about_ca_topic_score_gemma":0.0000062760196,"teacher_disagreement_score":0.6777611,"about_ca_system_score_codex":0.000018684874,"about_ca_system_score_gemma":0.00007518616,"threshold_uncertainty_score":0.29773113},"labels":[],"label_agreement":null},{"id":"W2185042433","doi":"10.1007/978-3-319-24021-3_4","title":"A Standard Basis Free Algorithm for Computing the Tangent Cones of a Space Curve","year":2015,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Polynomial and algebraic computation","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"","keywords":"Tangent; Basis (linear algebra); Tangent cone; Cone (formal languages); Tangent space; Irrational number; Series (stratigraphy); Space (punctuation); Computer science; Tangent vector; Mathematics; Algorithm; Mathematical analysis; Geometry","score_opus":0.025054740826858744,"score_gpt":0.26272386589726127,"score_spread":0.23766912507040253,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2185042433","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000069326146,0.0011710364,0.9930518,0.0022383307,0.0020064674,0.0007847356,0.00006449499,0.00010136242,0.00051243807],"genre_scores_gemma":[0.039334804,0.000022007504,0.95886445,0.0006600596,0.00087816006,0.000014811606,0.000008540481,0.000038948685,0.00017819818],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9964697,0.00005707051,0.0006340974,0.0010900402,0.0011603917,0.00058872154],"domain_scores_gemma":[0.99604225,0.0011989711,0.0005546227,0.001322398,0.0007176278,0.0001641305],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0018721232,0.0004678157,0.0006682083,0.0004347867,0.0002850898,0.00033954167,0.003937031,0.00019514366,0.000005305369],"category_scores_gemma":[0.00021976409,0.00034643157,0.00021227381,0.00057613227,0.00074117107,0.00032016417,0.001947278,0.00043396835,0.000004765763],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009169432,0.000016703147,0.0000066287107,0.000033608478,0.00002123813,0.000008742185,0.0012266175,0.012367093,0.000024023755,0.02269621,0.00031077737,0.9632792],"study_design_scores_gemma":[0.00054355455,0.00031573724,0.000027943743,0.00026843374,0.000014592561,0.000028831524,8.05602e-7,0.75618565,0.0010517067,0.23734221,0.0038337747,0.0003867818],"about_ca_topic_score_codex":0.00005774179,"about_ca_topic_score_gemma":0.00008454041,"teacher_disagreement_score":0.9628924,"about_ca_system_score_codex":0.0003030495,"about_ca_system_score_gemma":0.0009654242,"threshold_uncertainty_score":0.9998988},"labels":[],"label_agreement":null},{"id":"W2185706625","doi":"","title":"Algorithms for noncommutative differential operators","year":2004,"lang":"en","type":"article","venue":"","topic":"Polynomial and algebraic computation","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"","keywords":"Mathematics; Polynomial ring; Noncommutative geometry; Ring (chemistry); Differential operator; Differential algebra; Polynomial; Noncommutative ring; Field (mathematics); Algebra over a field; Discrete mathematics; Pure mathematics; Mathematical analysis","score_opus":0.018923793604190418,"score_gpt":0.2702667147717861,"score_spread":0.25134292116759566,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2185706625","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.047131024,0.000008673912,0.95013964,0.0012888915,0.00042384712,0.0001488647,0.0000021153685,0.00013430914,0.0007226543],"genre_scores_gemma":[0.83975166,6.8359645e-7,0.15961677,0.00032004373,0.00010550387,0.00002284344,0.000003864985,0.000003959941,0.00017464644],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994416,0.000010598024,0.000112587775,0.0001892272,0.00008987202,0.00015607782],"domain_scores_gemma":[0.9996869,0.000047024074,0.000025471612,0.00013695846,0.00004382034,0.000059829537],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00004710054,0.00007905772,0.00008647889,0.000041984844,0.0001105319,0.0001078431,0.0003509486,0.000023335975,0.0000103127295],"category_scores_gemma":[0.000009955603,0.000062447674,0.00005371139,0.0001245924,0.000018382754,0.00027442744,0.000104858365,0.00003857839,0.00003130435],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008618589,0.0001448236,0.000015387264,0.000006725349,0.000028587354,0.0000037266882,0.0018574815,0.0014216667,0.0017211894,0.71204543,0.000502808,0.28224355],"study_design_scores_gemma":[0.0069050724,0.0009287356,0.0037957295,0.00003445203,0.000016989083,0.000026656933,0.00016055605,0.43200377,0.1241055,0.4265287,0.0045887367,0.00090511545],"about_ca_topic_score_codex":0.000042581567,"about_ca_topic_score_gemma":0.000009058781,"teacher_disagreement_score":0.79262066,"about_ca_system_score_codex":0.000035524678,"about_ca_system_score_gemma":0.00006424592,"threshold_uncertainty_score":0.25465423},"labels":[],"label_agreement":null},{"id":"W2198515109","doi":"10.1007/978-3-319-24021-3_9","title":"Simplification of Cylindrical Algebraic Formulas","year":2015,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Polynomial and algebraic computation","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"","keywords":"Heuristic; Algebraic number; Transformation (genetics); Computer science; Set (abstract data type); Algebra over a field; Decomposition; Algorithm; Mathematics; Artificial intelligence; Pure mathematics; Mathematical analysis; Programming language","score_opus":0.02759925014916455,"score_gpt":0.2626467179261751,"score_spread":0.23504746777701055,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2198515109","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00038099283,0.00038098733,0.9936176,0.000667699,0.0011519868,0.00029776603,0.000004142355,0.00011814184,0.0033806849],"genre_scores_gemma":[0.77003723,0.000017531138,0.22866261,0.00047776135,0.00048479676,0.000006783567,0.000012830452,0.00002936167,0.0002711062],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9966784,0.000029345618,0.00067245186,0.0010839386,0.0010681353,0.0004676968],"domain_scores_gemma":[0.99751914,0.00035376908,0.00042583284,0.0010892865,0.00040327522,0.00020871458],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0008236651,0.000387993,0.00051774323,0.00074888766,0.00010910024,0.00018519525,0.0026496013,0.00027497084,0.000010849758],"category_scores_gemma":[0.00012714301,0.00035278342,0.00013302681,0.0006743546,0.00045919136,0.0005866592,0.0010193172,0.00047489884,0.00005264823],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000060159687,0.000032986136,0.000016337075,0.000027975504,0.000007628198,0.000012450406,0.00047238395,0.017411292,0.00022119659,0.1076576,0.000051176874,0.874083],"study_design_scores_gemma":[0.00024916552,0.00017570952,0.00018274998,0.00013102734,0.000006075422,0.000032182623,7.295516e-8,0.47612572,0.0015090355,0.5199157,0.0012934207,0.0003791349],"about_ca_topic_score_codex":0.000019182316,"about_ca_topic_score_gemma":0.000022622364,"teacher_disagreement_score":0.87370384,"about_ca_system_score_codex":0.00029446598,"about_ca_system_score_gemma":0.0008429397,"threshold_uncertainty_score":0.9998924},"labels":[],"label_agreement":null},{"id":"W2200988010","doi":"10.1007/978-3-642-40104-6_20","title":"The Art of Shaving Logs","year":2013,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Polynomial and algebraic computation","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Affine transformation; Point (geometry); Set (abstract data type); Selection (genetic algorithm); Theoretical computer science; Matrix (chemical analysis); Table (database); Degeneracy (biology); Algorithm; Matrix multiplication; Multiplication (music); Time complexity; Combinatorics; Mathematics; Artificial intelligence; Data mining; Programming language","score_opus":0.012593554849907365,"score_gpt":0.22457541660283803,"score_spread":0.21198186175293066,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2200988010","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00011824509,0.0004330332,0.99033666,0.001411678,0.0015931802,0.00025877496,0.0000011179203,0.00007445439,0.0057728533],"genre_scores_gemma":[0.44541496,0.00016440482,0.5458183,0.002174493,0.0012554158,0.000025212903,0.000006031405,0.000063476786,0.0050776913],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99747425,0.00002678323,0.0005042984,0.00079487934,0.0007289953,0.00047080443],"domain_scores_gemma":[0.99754333,0.00077564945,0.0003478646,0.0010238817,0.0002063483,0.000102932994],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00069738063,0.0003136054,0.00033835767,0.00031541096,0.00028127432,0.00046330332,0.0033485987,0.00015418058,0.000017438777],"category_scores_gemma":[0.000084025014,0.00021988577,0.00011979664,0.00039021103,0.0007174741,0.0004528903,0.0013293942,0.0004665978,0.00013520895],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000013213833,0.000008158297,0.000007795108,0.000011765067,0.000005512822,0.000006429976,0.00022827277,0.004966579,0.00016389469,0.059867706,0.00015095761,0.9345816],"study_design_scores_gemma":[0.00013406212,0.000109496184,0.00028154018,0.00023456251,0.000004167719,0.000029883171,9.20369e-8,0.54057646,0.0012538866,0.45039967,0.00660199,0.00037419598],"about_ca_topic_score_codex":0.000023263541,"about_ca_topic_score_gemma":0.000044627126,"teacher_disagreement_score":0.93420744,"about_ca_system_score_codex":0.00012246182,"about_ca_system_score_gemma":0.00038322475,"threshold_uncertainty_score":0.8966682},"labels":[],"label_agreement":null},{"id":"W2215141910","doi":"10.1016/j.jco.2015.11.009","title":"A softly optimal Monte Carlo algorithm for solving bivariate polynomial systems over the integers","year":2015,"lang":"en","type":"article","venue":"Journal of Complexity","topic":"Polynomial and algebraic computation","field":"Computer Science","cited_by":16,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Bivariate analysis; Monte Carlo method; Algorithm; Polynomial; Degree (music); Modular design; Discrete mathematics; Computer science; Statistics","score_opus":0.05792931936759485,"score_gpt":0.2832520914927291,"score_spread":0.22532277212513427,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2215141910","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13424294,0.00037297187,0.8607022,0.001388765,0.0029679684,0.00019745064,0.000008965524,0.000031051626,0.00008765613],"genre_scores_gemma":[0.8558863,0.0000033832835,0.14214823,0.00026438935,0.0015817352,0.000006351767,6.769518e-7,0.000012632921,0.000096337695],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998405,0.00011175159,0.00057097635,0.00017250142,0.00044093325,0.00029884942],"domain_scores_gemma":[0.99833673,0.00026591838,0.0005926081,0.00024525338,0.00034537053,0.0002141124],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013457325,0.00015837901,0.0003304094,0.00012137693,0.00017844891,0.0004103971,0.0010237737,0.000050547995,0.0000022087054],"category_scores_gemma":[0.00011653638,0.00010508891,0.00021962437,0.00020277244,0.000087492444,0.0006800877,0.00021189783,0.000250457,0.00000458041],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0009888578,0.0008632544,0.0006491263,0.00013482959,0.0013062048,0.0002236978,0.023287594,0.08221752,0.0008379294,0.17262292,0.19373955,0.5231285],"study_design_scores_gemma":[0.0013191642,0.00034504308,0.0013450319,0.000043885077,0.00002370329,0.00022443154,0.00015807003,0.9823604,0.000073848925,0.0063522346,0.0075965393,0.00015759739],"about_ca_topic_score_codex":0.0002791438,"about_ca_topic_score_gemma":0.000008978288,"teacher_disagreement_score":0.9001429,"about_ca_system_score_codex":0.00016251343,"about_ca_system_score_gemma":0.00043149656,"threshold_uncertainty_score":0.42854014},"labels":[],"label_agreement":null},{"id":"W2217669842","doi":"10.1090/conm/589/11747","title":"Tropical realization spaces for polyhedral complexes","year":2013,"lang":"en","type":"other","venue":"Contemporary mathematics - American Mathematical Society","topic":"Polynomial and algebraic computation","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Mathematics; Moduli space; Functor; Realization (probability); Pure mathematics; Variety (cybernetics); Torus; Toric variety; Algebraic variety; Algebraic number; Space (punctuation); Geometry; Mathematical analysis; Computer science","score_opus":0.029900805983476577,"score_gpt":0.27409188416597385,"score_spread":0.24419107818249727,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2217669842","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00007475806,0.00030402522,0.8933064,0.0010801875,0.0002032876,0.001530351,0.000061686376,0.0010288575,0.102410495],"genre_scores_gemma":[0.0043166475,0.00006094592,0.7853378,0.0009458071,0.00079254224,0.0005126461,0.00015122221,0.00060161576,0.20728076],"study_design_codex":"not_applicable","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99712014,0.00008812867,0.0008701047,0.0007691598,0.0005757819,0.00057668943],"domain_scores_gemma":[0.99683875,0.0006992501,0.0010971586,0.0009646981,0.00009724247,0.00030293077],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00023747016,0.00065135857,0.001316816,0.00012829919,0.00016148767,0.00044634307,0.0012645299,0.0002762749,0.00027099077],"category_scores_gemma":[0.00015713795,0.00054231536,0.00065635645,0.0004518957,0.0005557719,0.00026638442,0.00038008764,0.00025671808,0.00030111114],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000020662392,0.00024252478,0.000007656994,0.0007042482,0.00015901019,0.0000012899296,0.00085697323,0.0000012817743,0.00003933425,0.4242093,0.5719862,0.0017901395],"study_design_scores_gemma":[0.0014203402,0.0005180978,0.000052793002,0.001069534,0.00012910696,0.000029030887,0.0009192205,0.37065896,0.000110562694,0.39809263,0.22504818,0.0019515409],"about_ca_topic_score_codex":0.00008562975,"about_ca_topic_score_gemma":0.00000290057,"teacher_disagreement_score":0.37065768,"about_ca_system_score_codex":0.00008722525,"about_ca_system_score_gemma":0.00020991407,"threshold_uncertainty_score":0.9997028},"labels":[],"label_agreement":null},{"id":"W2233088777","doi":"10.1016/j.jsc.2015.11.011","title":"Factoring linear partial differential operators in n variables","year":2015,"lang":"en","type":"article","venue":"Journal of Symbolic Computation","topic":"Polynomial and algebraic computation","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"German Academic Exchange Service London; Natural Sciences and Engineering Research Council of Canada; Deutscher Akademischer Austauschdienst","keywords":"Mathematics; Factoring; Partial derivative; Pure mathematics; Algebra over a field; Mathematical analysis","score_opus":0.031092829860326993,"score_gpt":0.2753606856662993,"score_spread":0.2442678558059723,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2233088777","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5075563,0.000037104077,0.49105737,0.00025540928,0.0009799675,0.000038280494,2.4980542e-7,0.00001686334,0.00005844296],"genre_scores_gemma":[0.98932856,0.000003906866,0.010038147,0.000052318668,0.0005591318,0.0000010026597,0.0000013348846,0.000006051072,0.000009555945],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99865013,0.00009976943,0.0005514756,0.0001423361,0.00037514465,0.00018112754],"domain_scores_gemma":[0.99917656,0.00008129906,0.00028195145,0.00008812477,0.00021020982,0.00016186123],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00040265743,0.00011219103,0.000238614,0.00028519402,0.00003869677,0.00012835144,0.00033901725,0.000048290334,0.0000033298052],"category_scores_gemma":[0.00008415695,0.00009746932,0.00006372777,0.00038222407,0.000015302308,0.00074109854,0.00009827882,0.00017955924,0.000009052615],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00019745511,0.00081328116,0.012111789,0.000048250386,0.00012804104,0.00021624782,0.02798211,0.54689634,0.0064050667,0.030713087,0.0010531405,0.3734352],"study_design_scores_gemma":[0.002268891,0.0003114678,0.021891905,0.00008856806,0.000012201181,0.000111215835,0.00012595113,0.96409494,0.0022765712,0.007795413,0.0007893928,0.00023349453],"about_ca_topic_score_codex":0.000040257335,"about_ca_topic_score_gemma":0.0000026085404,"teacher_disagreement_score":0.48177224,"about_ca_system_score_codex":0.000112265196,"about_ca_system_score_gemma":0.00024587297,"threshold_uncertainty_score":0.39746833},"labels":[],"label_agreement":null},{"id":"W2234351191","doi":"10.1007/s11075-015-0095-2","title":"Software for the Gale transform of fewnomial systems and a Descartes rule for fewnomials","year":2016,"lang":"en","type":"article","venue":"Numerical Algorithms","topic":"Polynomial and algebraic computation","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto; Fields Institute for Research in Mathematical Sciences","funders":"National Key Research and Development Program of China; Directorate for Mathematical and Physical Sciences; Defense Advanced Research Projects Agency; National Natural Science Foundation of China; National Science Foundation","keywords":"Theory of computation; Software; Mathematics; Rule-based system; Computer science; Algorithm; Artificial intelligence; Programming language","score_opus":0.01946746877301521,"score_gpt":0.2497056394969522,"score_spread":0.23023817072393699,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2234351191","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.003640739,0.00043007353,0.9920244,0.0024619603,0.00054127275,0.00074236275,0.000070522,0.00007109237,0.000017531898],"genre_scores_gemma":[0.85925734,0.000037904745,0.13914493,0.00013668754,0.00058341376,0.00048503382,0.000003845881,0.000021387497,0.00032943915],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99899745,0.000025165475,0.00029107617,0.000285392,0.00013891027,0.00026198803],"domain_scores_gemma":[0.9979896,0.0015113105,0.00010500321,0.00019489776,0.00011692342,0.000082286075],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00027283435,0.00012816626,0.0002546085,0.00003602106,0.00015532463,0.0000740399,0.00038297306,0.000054876084,0.0000023459727],"category_scores_gemma":[0.00012525059,0.000068694935,0.00011094026,0.00013468586,0.00008275701,0.00022100829,0.00005430579,0.00003253888,0.000002697533],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004174935,0.000036103615,0.000048775382,0.00004196654,0.000033529333,2.6759008e-7,0.00018107735,0.00004003898,0.0010820354,0.004686266,0.0008327087,0.9929755],"study_design_scores_gemma":[0.009097582,0.00223167,0.0064325794,0.00025676057,0.00015172786,0.0000766263,0.0001488755,0.80985844,0.027464869,0.06581843,0.07734007,0.0011223506],"about_ca_topic_score_codex":0.000049670474,"about_ca_topic_score_gemma":0.0000014984961,"teacher_disagreement_score":0.9918531,"about_ca_system_score_codex":0.000027655567,"about_ca_system_score_gemma":0.000074225696,"threshold_uncertainty_score":0.28012982},"labels":[],"label_agreement":null},{"id":"W2248535156","doi":"10.1090/fic/054/05","title":"Apéry limits of differential equations of order 4 and 5","year":2008,"lang":"en","type":"other","venue":"","topic":"Polynomial and algebraic computation","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"","keywords":"Order (exchange); Mathematics; Differential (mechanical device); Applied mathematics; Differential equation; Mathematical analysis; Physics; Economics; Thermodynamics","score_opus":0.019468516870951014,"score_gpt":0.23664595107122366,"score_spread":0.21717743420027263,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2248535156","genre_codex":"methods","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00032903862,0.0002504551,0.83645743,0.000051440624,0.0002038293,0.000083248684,0.000005522482,0.0000580532,0.162561],"genre_scores_gemma":[0.21890317,0.0002677752,0.044778075,0.000075045,0.00025098494,0.0000069976677,0.000019856974,0.00008843439,0.73560965],"study_design_codex":"not_applicable","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99951214,0.000015209474,0.00014376077,0.00014438672,0.000118543845,0.00006597812],"domain_scores_gemma":[0.999592,0.000052298918,0.0001355152,0.00016540774,0.000028322544,0.000026443366],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0000149294565,0.000081685976,0.00016852202,0.00014143201,0.000012382718,0.0000072151975,0.00019361502,0.00006591089,0.00017941081],"category_scores_gemma":[0.0000132174,0.00006749963,0.000029237503,0.00013620524,0.000048708538,0.000034678844,0.00008971637,0.000035870282,0.000006104922],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000007432754,0.00039876925,0.00015703788,0.0003024502,0.0002245705,0.0000043270625,0.001008881,0.0000409694,0.0018708886,0.33905163,0.36280647,0.29412657],"study_design_scores_gemma":[0.008903803,0.0017099743,0.023833446,0.0020795735,0.0003216815,0.00008807953,0.00007981378,0.511187,0.021846648,0.029868381,0.39557818,0.00450338],"about_ca_topic_score_codex":0.0001722011,"about_ca_topic_score_gemma":0.00004223516,"teacher_disagreement_score":0.7916793,"about_ca_system_score_codex":0.000002508481,"about_ca_system_score_gemma":0.00004866524,"threshold_uncertainty_score":0.27525553},"labels":[],"label_agreement":null},{"id":"W2261870129","doi":"10.1063/1.4976741","title":"<i>N</i>≥ 𝟐 symmetric superpolynomials","year":2017,"lang":"he","type":"article","venue":"Journal of Mathematical Physics","topic":"Polynomial and algebraic computation","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université Laval","funders":"Fondo Nacional de Desarrollo Científico y Tecnológico; Natural Sciences and Engineering Research Council of Canada","keywords":"Homogeneous function; Multiplicative function; Monomial; Homogeneous; Symmetric function; Formalism (music); Scalar multiplication","score_opus":0.03864290235680624,"score_gpt":0.2892136230278221,"score_spread":0.2505707206710159,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2261870129","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15990575,0.0009861247,0.80801356,0.0074676736,0.004418405,0.00030183015,0.000010796549,0.00003605279,0.018859807],"genre_scores_gemma":[0.9781922,0.000088912035,0.018011251,0.0002289237,0.002984492,9.3633963e-7,2.5106644e-7,0.00002368337,0.0004693584],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.997141,0.0001207266,0.0011681215,0.00025088285,0.00088457926,0.000434698],"domain_scores_gemma":[0.9954827,0.00068241503,0.0020656153,0.0009967068,0.00040798928,0.00036459556],"candidate_categories":["scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.00119146,0.0002963087,0.00085877936,0.00012756292,0.00054029364,0.001358998,0.0025533172,0.00012832237,0.00007870281],"category_scores_gemma":[0.0011294475,0.0002338709,0.00054755074,0.00022148894,0.00025021334,0.0015436861,0.000607379,0.00052210473,0.0005380035],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005425369,0.0012307236,0.00016465048,0.0003943194,0.00029781944,0.00019226331,0.0013589206,0.0001368349,0.0012323166,0.6004277,0.010773232,0.38373697],"study_design_scores_gemma":[0.0016499468,0.000586532,0.0031917326,0.000834524,0.00022218426,0.0002284959,0.000042598356,0.06284709,0.004693422,0.9231322,0.0020398821,0.0005313803],"about_ca_topic_score_codex":0.0000063671655,"about_ca_topic_score_gemma":2.8220526e-7,"teacher_disagreement_score":0.8182864,"about_ca_system_score_codex":0.00009447546,"about_ca_system_score_gemma":0.00035601633,"threshold_uncertainty_score":0.99967766},"labels":[],"label_agreement":null},{"id":"W2269514674","doi":"10.1145/2815111.2815129","title":"Doing algebraic geometry with the RegularChains library","year":2015,"lang":"en","type":"article","venue":"ACM communications in computer algebra","topic":"Polynomial and algebraic computation","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"","keywords":"Algebraic geometry; Algebra over a field; Computer science; Mathematics; Algebraic number; Geometry; Pure mathematics; Mathematical analysis","score_opus":0.03209267997214615,"score_gpt":0.2642245279890959,"score_spread":0.23213184801694975,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2269514674","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.065784246,0.0012049697,0.8597647,0.06964823,0.0003245908,0.00045842293,0.0000027301137,0.00062218506,0.0021899461],"genre_scores_gemma":[0.5601005,0.0000411814,0.4372723,0.0022762353,0.00012359048,0.00005309366,0.000021067412,0.000021542412,0.00009051451],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9978411,0.00046939528,0.00039809948,0.0004677121,0.0003969191,0.00042677103],"domain_scores_gemma":[0.99307156,0.0009964815,0.00016816008,0.005489426,0.00009310681,0.00018125474],"candidate_categories":["open_science"],"consensus_categories":[],"category_scores_codex":[0.00066892855,0.00024950906,0.00024898935,0.00036508005,0.00033421733,0.0004807111,0.00917684,0.00007580771,0.000005509671],"category_scores_gemma":[0.000049554495,0.0001809689,0.00007176688,0.0020554052,0.00030062854,0.0014020754,0.006369158,0.00051501254,0.00007484381],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000022642196,0.00032725133,0.0030966273,0.000014597159,0.000076562195,0.000028652577,0.006413561,0.0026826789,0.000023470438,0.41804412,0.017130833,0.552139],"study_design_scores_gemma":[0.0032481945,0.0005738951,0.030048952,0.00026167897,0.000031467196,0.000322457,0.00037692068,0.5431953,0.00031741473,0.20591563,0.21432126,0.0013868482],"about_ca_topic_score_codex":0.000053821634,"about_ca_topic_score_gemma":0.00007224083,"teacher_disagreement_score":0.55075216,"about_ca_system_score_codex":0.000077106786,"about_ca_system_score_gemma":0.00031308905,"threshold_uncertainty_score":0.996184},"labels":[],"label_agreement":null},{"id":"W2271922649","doi":"10.1090/tran/7316","title":"Algebraic approximations to linear combinations of powers: An extension of results by Mahler and Corvaja–Zannier","year":2017,"lang":"en","type":"preprint","venue":"Transactions of the American Mathematical Society","topic":"Polynomial and algebraic computation","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia; Pacific Institute for the Mathematical Sciences; University of Calgary; Simon Fraser University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Combinatorics; Algebraic number; Integer (computer science); Mathematics; Field (mathematics); Linear subspace; Physics; Mathematical analysis; Geometry; Pure mathematics","score_opus":0.02184865550549959,"score_gpt":0.2874792214933486,"score_spread":0.265630565987849,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2271922649","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15888718,0.00003049679,0.8362773,0.0038369054,0.00010856198,0.00046996537,0.00021074571,0.00004234074,0.00013652329],"genre_scores_gemma":[0.8585421,0.000034509987,0.14108662,0.00008734556,0.00001181088,0.00002460251,0.000010954985,0.000013917706,0.00018816005],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981667,0.00011167457,0.0007007007,0.00041955526,0.0004195424,0.00018183445],"domain_scores_gemma":[0.9969133,0.00031373007,0.0009883564,0.00138375,0.00027303107,0.00012781715],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004469354,0.00021322284,0.0006071472,0.000065365784,0.00021538531,0.000044567118,0.0011668369,0.00009909483,0.000006144552],"category_scores_gemma":[0.00012666042,0.00016758595,0.00037156345,0.0003173742,0.0005797341,0.00019385213,0.00028065813,0.0003096095,0.00000208106],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00062815077,0.029842276,0.00016808392,0.0070981374,0.0039691892,0.0000027168057,0.15829927,0.076544076,0.10413472,0.14043787,0.024044765,0.45483077],"study_design_scores_gemma":[0.001913619,0.00093617185,0.0040792665,0.0011502731,0.00042154305,0.00001580739,0.0011132951,0.7313925,0.01619929,0.24168003,0.00024319052,0.000855036],"about_ca_topic_score_codex":0.00025595492,"about_ca_topic_score_gemma":0.0000049205155,"teacher_disagreement_score":0.6996549,"about_ca_system_score_codex":0.000050657316,"about_ca_system_score_gemma":0.0001241849,"threshold_uncertainty_score":0.6833957},"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,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada; 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","score_opus":0.024758507011176947,"score_gpt":0.28851647264012326,"score_spread":0.2637579656289463,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2279788372","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9059348,0.00006453147,0.088005215,0.005304867,0.0005600155,0.00008761662,0.0000014744741,0.000006834914,0.000034618297],"genre_scores_gemma":[0.8792531,0.00001390898,0.12048914,0.00008302084,0.00013319864,0.0000017428074,6.147899e-8,0.000004028878,0.000021797592],"study_design_codex":"design_other","study_design_gemma":"observational","domain_scores_codex":[0.9993204,0.000052725194,0.0002091991,0.000117899246,0.00014774944,0.00015206379],"domain_scores_gemma":[0.99867564,0.0002636309,0.00040710391,0.000533851,0.00006558171,0.00005417565],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00064869074,0.00007720906,0.00016945157,0.000056103036,0.00036060088,0.0004772676,0.0016164548,0.00003289864,5.5933816e-7],"category_scores_gemma":[0.00086153,0.000052937252,0.000078852194,0.000051208728,0.00007231632,0.00087748823,0.00074727373,0.0001321308,3.5022197e-7],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008061954,0.00007694381,0.00648704,0.000014902729,0.00005203704,0.00003270654,0.0025047828,0.00010121753,0.0015670841,0.010317053,0.00078197493,0.97798365],"study_design_scores_gemma":[0.0022288763,0.0003602656,0.53593165,0.00013756852,0.000019374635,0.00025000356,0.00006955702,0.13633767,0.0033275986,0.32042247,0.00070050365,0.00021445347],"about_ca_topic_score_codex":0.000107334796,"about_ca_topic_score_gemma":0.0000656771,"teacher_disagreement_score":0.9777692,"about_ca_system_score_codex":0.00004627977,"about_ca_system_score_gemma":0.00012099551,"threshold_uncertainty_score":0.46023026},"labels":[],"label_agreement":null},{"id":"W2288410826","doi":"10.1109/cdc.2015.7402117","title":"Epsilon controllability of nonlinear systems on polytopes","year":2015,"lang":"en","type":"article","venue":"","topic":"Polynomial and algebraic computation","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Polytope; Controllability; Nonlinear system; Mathematics; Cover (algebra); Constructive; Affine transformation; Polytope model; Linearization; State (computer science); Combinatorics; Applied mathematics; Computer science; Algorithm; Pure mathematics; Engineering","score_opus":0.028649869226314073,"score_gpt":0.2534635021657821,"score_spread":0.22481363293946804,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2288410826","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6228765,0.00015784006,0.35319448,0.0018256954,0.0013937098,0.00031350667,0.0000046898817,0.00022784856,0.020005746],"genre_scores_gemma":[0.9920435,4.083046e-7,0.007421685,0.00012567251,0.00005394679,0.0000026503606,7.879652e-7,0.0000020510752,0.00034930385],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99927956,0.000054039603,0.00019190146,0.00016762002,0.00020051932,0.00010633429],"domain_scores_gemma":[0.99937934,0.000092094546,0.00006537432,0.00027207914,0.00010357161,0.000087542605],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000303159,0.00006448759,0.00014569743,0.000042626696,0.000017602079,0.00004046251,0.00029870128,0.00002515148,0.000002476554],"category_scores_gemma":[0.00006725519,0.00004726029,0.000032874166,0.00014352884,0.000022289829,0.0001421679,0.00007052492,0.000035849192,0.000050041206],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00020196661,0.0007939483,0.0037439135,0.00007222857,0.000064347085,0.000011286913,0.0014762374,0.018868877,0.0032912567,0.8558173,0.0074426383,0.108215965],"study_design_scores_gemma":[0.0013344546,0.00061711663,0.0027851951,0.000023369079,0.000003915983,0.0000060784673,0.00006346558,0.9780245,0.00648304,0.0058300863,0.00464908,0.00017971767],"about_ca_topic_score_codex":0.0002590636,"about_ca_topic_score_gemma":0.000006061585,"teacher_disagreement_score":0.9591556,"about_ca_system_score_codex":0.000024974084,"about_ca_system_score_gemma":0.00007749967,"threshold_uncertainty_score":0.19272187},"labels":[],"label_agreement":null},{"id":"W2290038473","doi":"10.4230/lipics.rta.2015.241","title":"Constructing Orthogonal Designs in Powers of Two: Gröbner Bases Meet Equational Unification","year":2015,"lang":"en","type":"article","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Polynomial and algebraic computation","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Wilfrid Laurier University","funders":"","keywords":"Rewriting; Unification; Gröbner basis; Computation; Computer science; Coding theory; Algebra over a field; Theoretical computer science; Mathematics; Algorithm; Pure mathematics; Programming language","score_opus":0.05325202344418297,"score_gpt":0.28994845724449386,"score_spread":0.23669643380031088,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2290038473","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.31619042,0.000015920563,0.6796852,0.00033882674,0.0005748768,0.0004334546,0.00010232516,0.00007462065,0.002584372],"genre_scores_gemma":[0.9217374,0.000001458176,0.077645436,0.0002568795,0.00006559336,0.000030624833,0.00022107293,0.000011070101,0.000030501242],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99780095,0.000067823865,0.0010339709,0.00021244149,0.00050323794,0.00038156152],"domain_scores_gemma":[0.99832076,0.00028750752,0.00052664254,0.0003377661,0.00036490007,0.00016245148],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009477418,0.0002130209,0.0002938077,0.00034878324,0.00008989743,0.00014483153,0.00063361315,0.00008683031,0.000009653607],"category_scores_gemma":[0.00022479641,0.00020313237,0.000107046224,0.00048357263,0.000112392474,0.0016264635,0.00020433939,0.0001517631,0.000020213341],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012662387,0.0003433233,0.03442413,0.00018642853,0.000082341954,0.0000044300327,0.010385876,0.0069042286,0.0002945265,0.8898193,0.0012203129,0.05620843],"study_design_scores_gemma":[0.0065356484,0.00031954874,0.0035205197,0.00020399594,0.000023979786,0.00008099076,0.0025362605,0.9398116,0.0035553833,0.040685996,0.0020493094,0.000676809],"about_ca_topic_score_codex":0.000040222803,"about_ca_topic_score_gemma":0.000057660523,"teacher_disagreement_score":0.93290734,"about_ca_system_score_codex":0.00017192372,"about_ca_system_score_gemma":0.00033698586,"threshold_uncertainty_score":0.82834977},"labels":[],"label_agreement":null},{"id":"W2291865306","doi":"10.4153/cmb-2016-070-8","title":"On the Dimension of the Locus of Determinantal Hypersurfaces","year":2016,"lang":"en","type":"article","venue":"Canadian Mathematical Bulletin","topic":"Polynomial and algebraic computation","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Mathematics; Locus (genetics); Tuple; Conjugacy class; Dimension (graph theory); Combinatorics; Polynomial; Pure mathematics; Degree (music); Discrete mathematics; Mathematical analysis","score_opus":0.00900913142113527,"score_gpt":0.1883932070936024,"score_spread":0.17938407567246714,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2291865306","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9672541,0.000016491898,0.005623938,0.023969777,0.00010488621,0.00013725852,0.000005146642,0.000009253602,0.0028791456],"genre_scores_gemma":[0.9989449,8.047441e-7,0.00039822079,0.00031882914,0.000008741736,0.000002570993,4.2112102e-8,0.0000033143222,0.00032258706],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993707,0.00005358257,0.00016629069,0.00010875395,0.00015477838,0.00014587333],"domain_scores_gemma":[0.9988832,0.0006002547,0.00007171748,0.0003325843,0.000028615674,0.000083664025],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001858213,0.00006533226,0.000103088554,0.000029480456,0.000062902975,0.000011088529,0.0005274452,0.000027803093,0.0003890642],"category_scores_gemma":[0.00025223327,0.000026141845,0.000058180198,0.00009599215,0.00013369553,0.000017637658,0.00007423413,0.000039885694,0.00040026833],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000055873325,0.000042651067,0.000062535524,0.0000256578,0.00001213654,0.0000051134775,0.00044748606,0.000010623357,0.0071396665,0.95462453,0.007709627,0.029914374],"study_design_scores_gemma":[0.0010923534,0.00046431285,0.0057617454,0.0016243114,0.000028765355,0.00007510867,0.00014469691,0.006931669,0.19545442,0.7680687,0.019739205,0.0006147774],"about_ca_topic_score_codex":0.00021334933,"about_ca_topic_score_gemma":0.00012721568,"teacher_disagreement_score":0.18831475,"about_ca_system_score_codex":0.000029012042,"about_ca_system_score_gemma":0.00008733256,"threshold_uncertainty_score":0.5144773},"labels":[],"label_agreement":null},{"id":"W2292446657","doi":"10.1017/9781108874328.009","title":"Modules over Principal Ideal Domains","year":2021,"lang":"en","type":"book-chapter","venue":"Cambridge University Press eBooks","topic":"Polynomial and algebraic computation","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Ideal (ethics); Abelian group; Algebra over a field; Galois theory; Sylow theorems; Principal (computer security); Mathematics; Group (periodic table); Abstract algebra; Computer science; Pure mathematics; Finite group","score_opus":0.017124850436384353,"score_gpt":0.19994577234396085,"score_spread":0.1828209219075765,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2292446657","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00077781104,0.00014315617,0.059762713,0.000034962686,0.00055526494,0.00019961766,0.00006646789,0.00025472988,0.9382053],"genre_scores_gemma":[0.0034315567,0.000035559493,0.0019654587,0.00013222499,0.00024232731,4.7242995e-7,0.00003642018,0.000024753645,0.9941312],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99834037,0.00004206528,0.00019991824,0.00073172967,0.00036944883,0.0003164688],"domain_scores_gemma":[0.99865645,0.000072366594,0.00020307984,0.0007369879,0.00012272758,0.00020837047],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.000079873775,0.00034926913,0.00036493342,0.00016409224,0.0002112561,0.00015613435,0.0010899279,0.00026381292,0.0000060097555],"category_scores_gemma":[0.0000060170537,0.00041663955,0.00026586675,0.00001575553,0.00012385983,0.00021589962,0.0014212886,0.00038166862,0.000016663538],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001166047,0.000008383531,8.548245e-7,0.000027819067,0.00007825101,0.0005722787,0.000043928078,0.000018119343,0.0000422627,0.9821814,0.008921564,0.008093519],"study_design_scores_gemma":[0.0005556282,0.000036959147,0.00015535986,0.000116103634,0.000056454206,0.00003475672,0.000004366699,0.0035141602,0.00025598475,0.00024980283,0.994473,0.00054745167],"about_ca_topic_score_codex":0.00012919132,"about_ca_topic_score_gemma":0.000006570437,"teacher_disagreement_score":0.9855514,"about_ca_system_score_codex":0.00021018494,"about_ca_system_score_gemma":0.00020521574,"threshold_uncertainty_score":0.9998285},"labels":[],"label_agreement":null},{"id":"W2318096510","doi":"10.4153/cjm-2000-027-1","title":"Small Solutions of <i>ϕ</i><sub>1</sub><i>x</i><sub>1</sub><sup>2</sup> + . . . + <i>ϕ</i><sub>n</sub><i>x</i><sub>n</sub><sup>2</sup> = 0","year":2000,"lang":"en","type":"article","venue":"Canadian Journal of Mathematics","topic":"Polynomial and algebraic computation","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"Natural Sciences and Engineering Research Council of Canada; China Scholarship Council","keywords":"Mathematics; Zero (linguistics); Constant (computer programming); Combinatorics; Discrete mathematics","score_opus":0.01972788869720951,"score_gpt":0.2005476423032512,"score_spread":0.1808197536060417,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2318096510","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9423288,0.0018429033,0.04851385,0.0026375917,0.0013220056,0.0012910664,0.0004029196,0.00032861956,0.001332264],"genre_scores_gemma":[0.9853072,0.001121256,0.009008975,0.0022696636,0.0016915092,0.00008273047,0.00008935024,0.00035963627,0.00006963605],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9861261,0.0008230372,0.005002996,0.0018264735,0.0023923314,0.0038290634],"domain_scores_gemma":[0.98723084,0.0014508694,0.0028060528,0.0027001859,0.0016315081,0.0041805273],"candidate_categories":["metaepi_narrow","sts","scholarly_communication","research_integrity","insufficient_payload"],"consensus_categories":["metaepi_narrow"],"category_scores_codex":[0.0033864055,0.0020468703,0.002864169,0.002226279,0.0016823441,0.0011553196,0.0047655846,0.0010532788,0.000092060676],"category_scores_gemma":[0.0009262432,0.0021590837,0.0018273658,0.0034270368,0.0011162644,0.0024126137,0.00058047747,0.0025446082,0.0009159199],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":true,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00025760927,0.002570821,0.00042702732,0.0018298229,0.0020442693,0.00235622,0.022410039,0.09219479,0.47209957,0.011659091,0.07873047,0.31342027],"study_design_scores_gemma":[0.007036739,0.00175246,0.00093280285,0.0034066706,0.0012193163,0.005860372,0.0017329698,0.14024596,0.78327477,0.038920816,0.010557826,0.0050592897],"about_ca_topic_score_codex":0.0004201967,"about_ca_topic_score_gemma":0.0034697196,"teacher_disagreement_score":0.3111752,"about_ca_system_score_codex":0.0013423398,"about_ca_system_score_gemma":0.005948128,"threshold_uncertainty_score":0.99988157},"labels":[],"label_agreement":null},{"id":"W2320185674","doi":"10.4213/rm9649","title":"Алгебры с делением, имеющие одинаковые максимальные подполя","year":2015,"lang":"ru","type":"article","venue":"Успехи математических наук","topic":"Polynomial and algebraic computation","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"Natural Sciences and Engineering Research Council of Canada; Canada Research Chairs; United States - Israel Binational Science Foundation; Alexander von Humboldt-Stiftung; National Science Foundation","keywords":"Division (mathematics); Mathematics; Arithmetic","score_opus":0.04113723070017766,"score_gpt":0.25911432544169677,"score_spread":0.2179770947415191,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2320185674","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.37483713,0.017316554,0.35824534,0.03971027,0.047627073,0.003889332,0.00028267587,0.0041721663,0.15391946],"genre_scores_gemma":[0.9703411,0.00011384418,0.007857687,0.0030736728,0.0036092987,0.00006882828,0.00009459414,0.0001426409,0.014698374],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99162847,0.0006170792,0.0015553547,0.002139018,0.0019474792,0.0021126007],"domain_scores_gemma":[0.9939241,0.00039206535,0.0007393708,0.0023382402,0.0007481145,0.0018581577],"candidate_categories":["metaepi_narrow","scholarly_communication","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0016230536,0.001199063,0.001183594,0.00062106416,0.0006156437,0.0013695016,0.0033519743,0.0005953277,0.000386241],"category_scores_gemma":[0.0005001596,0.0012208383,0.0005492834,0.002097746,0.0004600605,0.0020053566,0.0019756993,0.0011405016,0.011345233],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00033025767,0.0017833257,0.0022478502,0.00028735338,0.00049545645,0.0010695894,0.013649772,0.0035042136,0.0015248437,0.09547035,0.28706238,0.5925746],"study_design_scores_gemma":[0.010141531,0.0027096786,0.015137803,0.00089999766,0.0004149723,0.0009744113,0.0014004239,0.27405357,0.0073318076,0.10410585,0.5768485,0.0059814216],"about_ca_topic_score_codex":0.00073591166,"about_ca_topic_score_gemma":0.0002209815,"teacher_disagreement_score":0.5955039,"about_ca_system_score_codex":0.00063483225,"about_ca_system_score_gemma":0.0019055698,"threshold_uncertainty_score":0.99966717},"labels":[],"label_agreement":null},{"id":"W2321598507","doi":"10.1515/integ.2011.112","title":"On Computation of Exact van der Waerden Numbers","year":2012,"lang":"en","type":"article","venue":"Integers","topic":"Polynomial and algebraic computation","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Van der Waerden's theorem; Mathematics; Computation; Combinatorics; Algorithm","score_opus":0.01433909079427994,"score_gpt":0.2614945942512471,"score_spread":0.24715550345696716,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2321598507","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.42266288,0.00004696994,0.5616884,0.00040358424,0.00084391533,0.00008519112,8.362878e-7,0.00009548168,0.01417269],"genre_scores_gemma":[0.9954333,7.1451495e-7,0.004137134,0.0002645936,0.00006860448,0.0000024637293,0.0000017896926,0.000005053857,0.00008637427],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992925,0.000042062682,0.00016302046,0.00013295634,0.00018027755,0.00018917437],"domain_scores_gemma":[0.9995227,0.00012477722,0.0000882984,0.00014534968,0.000038392653,0.000080511505],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00015284623,0.0000844152,0.00010227885,0.00008358501,0.00003563677,0.000025228794,0.00024422046,0.00003325462,0.000023145258],"category_scores_gemma":[0.000035570698,0.000074478754,0.000056060766,0.00017869074,0.000029788605,0.0003453096,0.00005451915,0.00007618126,0.00016190845],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000052717358,0.00045866857,0.0025081853,0.000046792135,0.000115904215,0.0000061228284,0.010062097,0.010266959,0.004482473,0.29379848,0.016413374,0.6617882],"study_design_scores_gemma":[0.004124258,0.0013925392,0.08980732,0.0005869824,0.00009196734,0.00011140396,0.0008432172,0.47722265,0.14672686,0.26540697,0.011351404,0.0023344243],"about_ca_topic_score_codex":0.00005739407,"about_ca_topic_score_gemma":0.0000021567178,"teacher_disagreement_score":0.6594538,"about_ca_system_score_codex":0.000044344568,"about_ca_system_score_gemma":0.000025281452,"threshold_uncertainty_score":0.30371553},"labels":[],"label_agreement":null},{"id":"W2325585455","doi":"10.4153/cjm-2004-033-0","title":"Fat Points in ℙ<sup>1</sup>× ℙ<sup>1</sup>and Their Hilbert Functions","year":2004,"lang":"en","type":"article","venue":"Canadian Journal of Mathematics","topic":"Polynomial and algebraic computation","field":"Computer Science","cited_by":20,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Lakehead University","funders":"","keywords":"Mathematics; Function (biology); Resolution (logic); Hilbert series and Hilbert polynomial; Hilbert space; Combinatorics; Constant (computer programming); Point (geometry); Mathematical analysis; Pure mathematics; Geometry","score_opus":0.015010961293248033,"score_gpt":0.20583201002401316,"score_spread":0.19082104873076514,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2325585455","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.83000964,0.00036660512,0.16323522,0.005224046,0.00022763672,0.00014931895,0.000010869652,0.00002128829,0.00075540855],"genre_scores_gemma":[0.9818878,0.000014224766,0.017225413,0.0004779881,0.00019782713,0.0000024833078,0.0000016314066,0.000017114036,0.00017548841],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985723,0.000050016144,0.0005906592,0.00018971627,0.00019287699,0.00040445785],"domain_scores_gemma":[0.9985816,0.00017914364,0.00021987146,0.00028534266,0.00012502691,0.00060901546],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00044924606,0.00020232215,0.00033222226,0.0004917048,0.00017410622,0.00022257016,0.00058515056,0.00008793317,0.000030210838],"category_scores_gemma":[0.00019402697,0.00016749556,0.000111909765,0.00042548386,0.00008551762,0.00051707646,0.000055969696,0.0003237382,0.000048376052],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003188643,0.00090190524,0.0038990504,0.0005012527,0.00049435935,0.0014663069,0.27131948,0.31770685,0.00022995242,0.23333551,0.01565791,0.15445553],"study_design_scores_gemma":[0.0046563544,0.0006268887,0.0026581807,0.0014985256,0.00007010198,0.004182739,0.009260516,0.40893638,0.00057052536,0.5518212,0.014502687,0.0012159218],"about_ca_topic_score_codex":0.0009161341,"about_ca_topic_score_gemma":0.0027661175,"teacher_disagreement_score":0.31848568,"about_ca_system_score_codex":0.0002745867,"about_ca_system_score_gemma":0.00083266594,"threshold_uncertainty_score":0.683027},"labels":[],"label_agreement":null},{"id":"W2328432106","doi":"10.1137/09s010460","title":"Finding the Maximum Modulus of a Polynomial on the Polydisk Using a Generalization of Steckin's Lemma","year":2009,"lang":"en","type":"article","venue":"SIAM Undergraduate Research Online","topic":"Polynomial and algebraic computation","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Generalization; Lemma (botany); Mathematics; Modulus; Polynomial; Mathematical analysis; Geometry","score_opus":0.10080764245254277,"score_gpt":0.3646487698582933,"score_spread":0.26384112740575055,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2328432106","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7695357,0.00017604821,0.15334849,0.07574518,0.00024080678,0.0005744931,0.000023457429,0.00005397948,0.00030179764],"genre_scores_gemma":[0.995485,0.0000480174,0.003936965,0.00019829322,0.00019703554,0.0000034422596,0.0000089776695,0.000009771207,0.00011246299],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9973269,0.00056404405,0.00040870285,0.0003160555,0.00093628804,0.0004479943],"domain_scores_gemma":[0.9984131,0.00043956033,0.00020342074,0.00062980683,0.00024030854,0.00007382054],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012928201,0.00014793617,0.00020509919,0.0002991212,0.0003526633,0.00010309733,0.0011148266,0.000055428554,0.0000035586404],"category_scores_gemma":[0.00022514461,0.00008845233,0.000110801426,0.0013800673,0.00020170189,0.0002035759,0.00026577833,0.00033118168,0.00000345163],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000250296,0.0010775549,0.00015615899,0.00006312341,0.00011961609,0.000019689105,0.0018321265,0.033162992,0.105553105,0.46740177,0.0027848862,0.3875787],"study_design_scores_gemma":[0.0008090175,0.0008001503,0.0045699123,0.00017088093,0.000011717198,0.000016678601,0.00016833153,0.8187763,0.021728437,0.1521141,0.0006116004,0.00022287745],"about_ca_topic_score_codex":0.0002917001,"about_ca_topic_score_gemma":0.000047985428,"teacher_disagreement_score":0.7856133,"about_ca_system_score_codex":0.00010267195,"about_ca_system_score_gemma":0.00028864256,"threshold_uncertainty_score":0.36069813},"labels":[],"label_agreement":null},{"id":"W2329925992","doi":"10.2316/journal.212.2012.1.212-1019","title":"FOUR-PARTY PASSWORD-BASED AUTHENTICATED KEY EXCHANGE PROTOCOL","year":2012,"lang":"en","type":"article","venue":"Communications and Computer Security","topic":"Polynomial and algebraic computation","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Password; Authenticated Key Exchange; Computer science; Key (lock); Computer security; Key exchange; Protocol (science); Oakley protocol; Computer network; Public-key cryptography; Medicine; Encryption","score_opus":0.04203045556516408,"score_gpt":0.2861671955628404,"score_spread":0.24413673999767635,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2329925992","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010267347,0.00038310984,0.970637,0.0049418965,0.00034645628,0.011215694,0.000007714522,0.0005443472,0.0016563842],"genre_scores_gemma":[0.9230165,0.000010604823,0.068758704,0.00072569,0.00015730338,0.007280036,0.000015669428,0.000010427838,0.000025101295],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986726,0.00026658675,0.00028336115,0.00025971982,0.00016436902,0.0003533752],"domain_scores_gemma":[0.9977487,0.00018616632,0.00013267838,0.0016170186,0.00009501585,0.00022044883],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004145317,0.00017760428,0.00017910963,0.00010586006,0.00041182712,0.00022487594,0.0014470482,0.000069406095,0.000016013235],"category_scores_gemma":[0.000008695176,0.00016356968,0.00006808088,0.0003638072,0.00012810908,0.0005814943,0.0013675584,0.000212799,0.00004293675],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000021781641,0.0017303339,0.0059662256,0.00017328582,0.00007024783,0.0000028752836,0.008600296,0.000012054855,0.000086171065,0.3528003,0.007618448,0.62291795],"study_design_scores_gemma":[0.0008051035,0.00010242995,0.012502231,0.000040746134,0.000011092476,0.000016257169,0.000007939976,0.77276796,0.00015052513,0.010323968,0.20294163,0.00033011418],"about_ca_topic_score_codex":0.000033033943,"about_ca_topic_score_gemma":0.0000146949915,"teacher_disagreement_score":0.9127491,"about_ca_system_score_codex":0.000032984903,"about_ca_system_score_gemma":0.000054011944,"threshold_uncertainty_score":0.6670178},"labels":[],"label_agreement":null},{"id":"W2333505527","doi":"10.2139/ssrn.2756934","title":"Negative Dependence in Matrix Arrangement Problems","year":2016,"lang":"en","type":"article","venue":"SSRN Electronic Journal","topic":"Polynomial and algebraic computation","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Matrix (chemical analysis); Mathematics; Materials science; Composite material","score_opus":0.00817853981571289,"score_gpt":0.2345973378910427,"score_spread":0.2264187980753298,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2333505527","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15273216,0.0005191672,0.8413141,0.0047254446,0.00023240094,0.00012375052,3.3415262e-7,0.000043229426,0.00030940754],"genre_scores_gemma":[0.9973621,0.0005332231,0.0010937746,0.000059850143,0.0001100918,0.000007203401,9.30756e-8,0.00000537556,0.0008283172],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99793017,0.000078436875,0.00023378889,0.0002164463,0.00024070477,0.0013004402],"domain_scores_gemma":[0.9995644,0.00007429354,0.00011790022,0.00013992115,0.000042369917,0.00006113383],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009897797,0.0001034248,0.000106915875,0.00013422414,0.00008147585,0.00007133747,0.0005899345,0.000030087393,0.00000982388],"category_scores_gemma":[0.000037403162,0.00006743355,0.00004948063,0.00025499277,0.00002123319,0.00061521406,0.00009236631,0.00044266766,0.00007054964],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000149781445,0.00006016567,0.001196753,0.0000028616078,0.000029960453,0.00000934508,0.00045680103,0.00016529685,0.003273303,0.5088096,0.00003371589,0.4859472],"study_design_scores_gemma":[0.0009841389,0.00021972512,0.0022807955,0.000057805402,0.0000026004673,0.00019209668,0.00007295586,0.0017018765,0.00097460486,0.9928798,0.00047334802,0.00016022554],"about_ca_topic_score_codex":0.000053223317,"about_ca_topic_score_gemma":0.0008994014,"teacher_disagreement_score":0.8446299,"about_ca_system_score_codex":0.0007256891,"about_ca_system_score_gemma":0.00091466843,"threshold_uncertainty_score":0.27498603},"labels":[],"label_agreement":null},{"id":"W2337057492","doi":"","title":"Interpolation Sets For Compact Abelian Groups","year":2014,"lang":"en","type":"dissertation","venue":"UWSpace (University of Waterloo)","topic":"Polynomial and algebraic computation","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"University of Waterloo","keywords":"Abelian group; Interpolation (computer graphics); Mathematics; Pure mathematics; Algebra over a field; Computer science; Artificial intelligence","score_opus":0.011210307143772833,"score_gpt":0.21821989527256724,"score_spread":0.20700958812879441,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2337057492","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.94438154,0.000049401322,0.051474124,0.0015162597,0.0012781393,0.0004774682,0.000030243411,0.00017806768,0.0006147751],"genre_scores_gemma":[0.85320854,0.000017382217,0.01973342,0.000063707535,0.00012676044,7.7233045e-7,0.0011052907,0.000029712533,0.1257144],"study_design_codex":"qualitative","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99896824,0.00004923477,0.00014519821,0.00039655573,0.00020469066,0.00023605078],"domain_scores_gemma":[0.9990019,0.000079453486,0.00034208005,0.00031892612,0.00016280651,0.00009478624],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001565626,0.0002066807,0.0003420672,0.00029627618,0.00019263307,0.00005869893,0.0007706198,0.00018593068,0.000023401813],"category_scores_gemma":[0.00001203281,0.00023925616,0.00020497554,0.00018225284,0.000031907275,0.00041811637,0.00005964913,0.00013135998,0.00004427587],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.001071596,0.0005180714,0.0008256934,0.0024633997,0.0007109171,0.0000316761,0.45889902,0.0008062446,0.019424016,0.070901655,0.063929275,0.38041845],"study_design_scores_gemma":[0.0073113446,0.0022451603,0.070990086,0.001789662,0.0005184459,0.00001574872,0.05169445,0.7890329,0.0077809975,0.049211036,0.016055452,0.0033547499],"about_ca_topic_score_codex":0.005874869,"about_ca_topic_score_gemma":0.010819196,"teacher_disagreement_score":0.7882266,"about_ca_system_score_codex":0.00005615834,"about_ca_system_score_gemma":0.000074084644,"threshold_uncertainty_score":0.9756583},"labels":[],"label_agreement":null},{"id":"W2342906401","doi":"10.1080/00927872.2015.1057828","title":"On Linear Dependence Over Complete Differential Algebraic Varieties","year":2015,"lang":"en","type":"article","venue":"Communications in Algebra","topic":"Polynomial and algebraic computation","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"University of Waterloo; American Mathematical Society","keywords":"Mathematics; Variety (cybernetics); Completeness (order theory); Differential (mechanical device); Algebraic number; Projective space; Differential algebraic geometry; Projective variety; Linear differential equation; Differential algebra; Pure mathematics; Algebra over a field; Projective test; Differential equation; Algebraic variety; Differential algebraic equation; Mathematical analysis; Statistics; Physics","score_opus":0.06526809990563727,"score_gpt":0.30323951762615053,"score_spread":0.23797141772051328,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2342906401","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.35009965,0.00083002646,0.6263189,0.0086649405,0.0012589301,0.0005904315,0.0000145656395,0.0006465333,0.011576023],"genre_scores_gemma":[0.97955334,0.00003756096,0.019429032,0.00068347505,0.00005534251,0.000045866705,0.000030470394,0.00001363274,0.00015126928],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9982523,0.0002916498,0.00039651955,0.0003728787,0.00037765497,0.00030905378],"domain_scores_gemma":[0.99673545,0.00049737416,0.00012754128,0.0023773124,0.00010075425,0.00016156033],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00035015773,0.00019802147,0.0002235439,0.00025721636,0.0002003028,0.00017009831,0.0033934584,0.0000862428,0.00002843508],"category_scores_gemma":[0.00020592051,0.00019566785,0.000070059905,0.0006360406,0.00018064638,0.0004896146,0.0015255942,0.00040461344,0.00028372102],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000014513976,0.00025462173,0.0005505043,0.000004548884,0.000013241049,0.000003898576,0.0010884595,0.0003179543,0.00012576093,0.98003566,0.0013733085,0.016217552],"study_design_scores_gemma":[0.0015848248,0.00020864035,0.02225726,0.00006957993,0.000009612812,0.000017347156,0.0000649135,0.42026716,0.00027550518,0.54680526,0.007896925,0.00054299465],"about_ca_topic_score_codex":0.00012454027,"about_ca_topic_score_gemma":0.00012294417,"teacher_disagreement_score":0.62945366,"about_ca_system_score_codex":0.00012917696,"about_ca_system_score_gemma":0.00016294974,"threshold_uncertainty_score":0.7979103},"labels":[],"label_agreement":null},{"id":"W2343589186","doi":"10.1145/2850449.2850459","title":"Using sparse interpolation to solve multivariate diophantine equations","year":2015,"lang":"en","type":"article","venue":"ACM communications in computer algebra","topic":"Polynomial and algebraic computation","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Multivariate statistics; Diophantine equation; Mathematics; Interpolation (computer graphics); Combinatorics; Prime (order theory); Ideal (ethics); Polynomial interpolation; Polynomial; Multivariate analysis; Discrete mathematics; Applied mathematics; Computer science; Statistics; Linear interpolation; Mathematical analysis; Artificial intelligence","score_opus":0.15579689585547074,"score_gpt":0.3596140019620466,"score_spread":0.20381710610657588,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2343589186","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.036144607,0.0001190992,0.95671946,0.005442436,0.0006654974,0.00039023548,0.0000034982752,0.00024935964,0.0002658213],"genre_scores_gemma":[0.4900901,0.0000033107897,0.5092603,0.0005041735,0.00008425202,0.000023187293,0.000016407163,0.000010256632,0.000007980474],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99807006,0.00022389217,0.00060921756,0.00045791516,0.00028333216,0.00035559837],"domain_scores_gemma":[0.9954708,0.0005884549,0.00017703249,0.0032820394,0.00024797494,0.00023366247],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00071576604,0.00021976841,0.000257546,0.0005323008,0.0002154905,0.00028772102,0.004169575,0.00007684582,0.0000042989027],"category_scores_gemma":[0.00038054856,0.00023814444,0.000071908806,0.0014141849,0.000066497065,0.0009692154,0.0046464764,0.00026399142,0.00015033376],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000044122025,0.0011690415,0.0026668117,0.000019603927,0.00010458067,0.000017297556,0.021494122,0.06415705,0.0038835965,0.52712584,0.0022271886,0.37709075],"study_design_scores_gemma":[0.0006283016,0.00006732794,0.003000447,0.00006783327,0.0000069438497,0.000012063575,0.000032463497,0.95687145,0.00011060426,0.037929792,0.0009974944,0.0002752832],"about_ca_topic_score_codex":0.00047096517,"about_ca_topic_score_gemma":0.00017199927,"teacher_disagreement_score":0.8927144,"about_ca_system_score_codex":0.00019480732,"about_ca_system_score_gemma":0.00021165841,"threshold_uncertainty_score":0.9711248},"labels":[],"label_agreement":null},{"id":"W2343882989","doi":"10.1017/fms.2016.7","title":"MODULI SPACES OF RATIONAL WEIGHTED STABLE CURVES AND TROPICAL GEOMETRY","year":2016,"lang":"en","type":"preprint","venue":"Forum of Mathematics Sigma","topic":"Polynomial and algebraic computation","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"Deutsche Forschungsgemeinschaft; National Science Foundation","keywords":"Moduli space; Tropical geometry; Moduli of algebraic curves; Mathematics; Pure mathematics; Matroid; Space (punctuation); Geometric invariant theory; Modular equation; Algebraic geometry; Geometry; Mathematical analysis; Combinatorics; Computer science","score_opus":0.014566568630535216,"score_gpt":0.2381575198226848,"score_spread":0.22359095119214958,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2343882989","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.17260355,0.0009796034,0.82261443,0.0026831285,0.0002591959,0.0002582513,0.00005668323,0.00004457715,0.00050057605],"genre_scores_gemma":[0.85476416,0.00018222455,0.14455722,0.000058428453,0.000072249655,0.000016767228,0.000013684666,0.00001363564,0.00032163665],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985859,0.000035694367,0.0005095882,0.00028675038,0.00039894125,0.00018311941],"domain_scores_gemma":[0.9985109,0.00033510276,0.0005239136,0.00042771272,0.0001379186,0.000064443375],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001901556,0.00017659857,0.00045950204,0.00015578313,0.00003675921,0.000044463734,0.0005490723,0.00011635721,0.000028395065],"category_scores_gemma":[0.00009869272,0.00013256223,0.000097959586,0.00012042687,0.000100944955,0.0001672346,0.0009894732,0.00012215499,0.0000034469413],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000015975631,0.0006232399,0.0016197007,0.0066072494,0.00024670563,0.0000036009567,0.0010197763,0.00023183895,0.0026052215,0.9640794,0.006926686,0.016020603],"study_design_scores_gemma":[0.00039913622,0.00011513974,0.0016214495,0.0018203367,0.000029163715,0.000007808917,0.000037713668,0.1326821,0.011904193,0.8508933,0.00021478061,0.0002748581],"about_ca_topic_score_codex":0.000009584267,"about_ca_topic_score_gemma":0.0000027268525,"teacher_disagreement_score":0.6821606,"about_ca_system_score_codex":0.000018263401,"about_ca_system_score_gemma":0.00012949776,"threshold_uncertainty_score":0.54057306},"labels":[],"label_agreement":null},{"id":"W2345030160","doi":"10.1145/2930964.2930968","title":"Workshop on symbolic combinatorics and algorithmic differential algebra","year":2016,"lang":"en","type":"article","venue":"ACM communications in computer algebra","topic":"Polynomial and algebraic computation","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"Western University","funders":"","keywords":"Symbolic computation; Algebra over a field; Differential (mechanical device); Focus (optics); Differential algebra; Computer science; Mathematics; Pure mathematics; Physics","score_opus":0.028185824010308513,"score_gpt":0.2770596913392333,"score_spread":0.2488738673289248,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2345030160","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.223823,0.00050035043,0.75114065,0.022181943,0.0010115278,0.000446873,0.0000066481152,0.00046364928,0.00042533752],"genre_scores_gemma":[0.94863904,0.0005823726,0.04979399,0.0006596951,0.00013773788,0.00006350443,0.0000092374685,0.000023115243,0.000091326736],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99777275,0.00031953704,0.000520833,0.0006342424,0.0003005638,0.0004520746],"domain_scores_gemma":[0.9939071,0.0018193474,0.00015843437,0.0038627137,0.00008350118,0.00016892653],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00029281667,0.00030951275,0.0003376163,0.0004087721,0.0002983772,0.00025733793,0.0045940652,0.00013272675,0.000011176367],"category_scores_gemma":[0.000115597395,0.00024796146,0.00008516054,0.00072249066,0.00022629315,0.0005846066,0.0042293305,0.00034304455,0.00009686539],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000006204623,0.000268151,0.0006628061,0.000006935392,0.00002508532,0.0000050419853,0.00051202177,0.000009226901,0.00017313969,0.35509664,0.0006171684,0.6426176],"study_design_scores_gemma":[0.0043191123,0.00034614775,0.11096624,0.000676802,0.000022927437,0.00007898616,0.000024882756,0.19543068,0.0005277283,0.67987555,0.0064041377,0.001326816],"about_ca_topic_score_codex":0.000025499881,"about_ca_topic_score_gemma":0.000022335567,"teacher_disagreement_score":0.724816,"about_ca_system_score_codex":0.00013406176,"about_ca_system_score_gemma":0.000072037656,"threshold_uncertainty_score":0.99999726},"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,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_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","score_opus":0.014220841480532266,"score_gpt":0.21921376935602835,"score_spread":0.20499292787549608,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2346605091","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.024762567,0.000037057456,0.9727435,0.0017662115,0.0005518836,0.0000063689513,3.7426463e-7,0.000016440523,0.00011555763],"genre_scores_gemma":[0.99099183,0.00001542072,0.008066371,0.000163473,0.0006026678,5.4557586e-7,1.4426047e-7,0.0000042373126,0.00015531336],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993958,0.000024847137,0.00020912054,0.00007802701,0.00018205705,0.00011013764],"domain_scores_gemma":[0.999366,0.00013260466,0.00021289938,0.00013437711,0.00009465142,0.00005949832],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00007681652,0.000062138926,0.00010510588,0.00004916254,0.000048161917,0.000046488738,0.00035042485,0.000015374739,0.000004605211],"category_scores_gemma":[0.000013677444,0.00003930843,0.000069764086,0.00014578768,0.000019557976,0.000607926,0.00006722481,0.00003650408,0.0000136511935],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000018059541,0.0000250462,0.000009700928,9.4420017e-7,0.000013266758,0.000004720475,0.00003459216,0.0007401511,0.004408305,0.76252985,0.0002113679,0.23202023],"study_design_scores_gemma":[0.0005150897,0.00012140225,0.0008293166,0.000068951085,0.000010534743,0.00003205663,0.0000021106698,0.0051998096,0.029711876,0.96119994,0.0021713732,0.00013752858],"about_ca_topic_score_codex":0.000008081835,"about_ca_topic_score_gemma":8.8487093e-7,"teacher_disagreement_score":0.96622926,"about_ca_system_score_codex":0.00003718911,"about_ca_system_score_gemma":0.000060118942,"threshold_uncertainty_score":0.16029511},"labels":[],"label_agreement":null},{"id":"W2349004255","doi":"10.1016/j.jmaa.2016.05.020","title":"A short proof of duality relations for hypergeometric functions","year":2016,"lang":"en","type":"article","venue":"Journal of Mathematical Analysis and Applications","topic":"Polynomial and algebraic computation","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"York University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Dual polyhedron; Mathematics; Hypergeometric identity; Duality (order theory); Hypergeometric function; Simple (philosophy); Identity (music); Pure mathematics; Algebra over a field; Basic hypergeometric series; Generalized hypergeometric function; Algebraic number; Hypergeometric distribution; Dual (grammatical number); Hypergeometric function of a matrix argument; Mathematical analysis; Linguistics","score_opus":0.020612857736094573,"score_gpt":0.27086620395782957,"score_spread":0.250253346221735,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2349004255","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.026737947,0.00006774872,0.9710827,0.0017806581,0.000011451532,0.00013547267,0.0000108569875,0.0000075086923,0.00016566047],"genre_scores_gemma":[0.9563425,0.00000799845,0.04329874,0.000012487771,0.00005068465,0.000035123045,9.791145e-7,0.0000023046844,0.00024916843],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990556,0.00002186761,0.00055474316,0.00011407279,0.00017215083,0.00008154677],"domain_scores_gemma":[0.9985366,0.0006488678,0.0002634118,0.00018402773,0.00028256027,0.00008452925],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00046782615,0.000059823982,0.0002635989,0.0003919191,0.000084331165,0.000024660249,0.00019199357,0.000029007973,0.000018557244],"category_scores_gemma":[0.00014275683,0.000034894572,0.00023640587,0.0013163021,0.0000462984,0.00018718353,0.00004075409,0.000037192305,0.0000027213935],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009930354,0.00071080413,0.0020753287,0.00005891234,0.0009023104,2.983759e-7,0.00012956283,0.0002605715,0.0029259943,0.55592775,0.000510132,0.43648842],"study_design_scores_gemma":[0.00082322094,0.0002994429,0.036456432,0.00007658355,0.002275483,0.00004861654,0.00007736973,0.047083914,0.0040275687,0.90210974,0.0064145764,0.00030706188],"about_ca_topic_score_codex":6.513566e-7,"about_ca_topic_score_gemma":0.0000011161518,"teacher_disagreement_score":0.9296046,"about_ca_system_score_codex":0.000016103948,"about_ca_system_score_gemma":0.00003304165,"threshold_uncertainty_score":0.14229594},"labels":[],"label_agreement":null},{"id":"W238211858","doi":"10.1007/978-3-642-32973-9_19","title":"Inversion Modulo Zero-Dimensional Regular Chains","year":2012,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Polynomial and algebraic computation","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"","keywords":"Modulo; Computer science; Inversion (geology); Algorithm; Geometry; Geology; Discrete mathematics; Mathematics; Paleontology","score_opus":0.014039046651705982,"score_gpt":0.21737255985863618,"score_spread":0.2033335132069302,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W238211858","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0007660348,0.0008037058,0.99264663,0.0013492426,0.0029463258,0.0002938545,0.000003766541,0.00021532674,0.0009751009],"genre_scores_gemma":[0.60127395,0.000047230213,0.39168674,0.003941676,0.0015522232,0.000009096666,0.000023033343,0.00006050634,0.0014055489],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9960577,0.000041806597,0.0004887366,0.0013962922,0.0012043266,0.000811157],"domain_scores_gemma":[0.9977438,0.00027483903,0.00028573757,0.0011838278,0.00018770008,0.00032410014],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0007707509,0.0005476084,0.0004775814,0.00083275867,0.00034252353,0.00030771914,0.0025365902,0.00034158272,0.00002981831],"category_scores_gemma":[0.000046393474,0.0005018873,0.00017230918,0.0005638517,0.00051027455,0.0009368729,0.0019949805,0.0006965405,0.00017068117],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000005964792,0.000038016373,0.000021156646,0.000024402863,0.0000108172535,0.000043649667,0.000501293,0.033182554,0.00053281535,0.054822613,0.0001547395,0.910662],"study_design_scores_gemma":[0.00029490484,0.00011343753,0.00017314697,0.0002607697,0.000008174422,0.00006930884,4.45125e-8,0.7503235,0.0019893367,0.24322286,0.002840512,0.00070399494],"about_ca_topic_score_codex":0.000026463827,"about_ca_topic_score_gemma":0.000016763326,"teacher_disagreement_score":0.909958,"about_ca_system_score_codex":0.00038737842,"about_ca_system_score_gemma":0.00046743144,"threshold_uncertainty_score":0.9997433},"labels":[],"label_agreement":null},{"id":"W2394790471","doi":"","title":"An upper bound for total domination subdivision numbers.","year":2011,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Polynomial and algebraic computation","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Subdivision; Mathematics; Upper and lower bounds; Combinatorics; Geography; Mathematical analysis; Archaeology","score_opus":0.015582494609897855,"score_gpt":0.24706683429415507,"score_spread":0.23148433968425722,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2394790471","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.93270427,0.000022353384,0.062484924,0.000111918635,0.0028371403,0.00024474348,0.0000018447325,0.00017165422,0.0014211626],"genre_scores_gemma":[0.9916001,0.0000011006617,0.008121228,0.00009263055,0.000021892633,0.000025594096,0.00001051591,0.000010090368,0.00011683109],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990345,0.000044584755,0.00018453722,0.00033079876,0.00017115871,0.00023437075],"domain_scores_gemma":[0.9993012,0.00006722422,0.0000824287,0.00033926422,0.00010450511,0.00010535596],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002604223,0.000118829936,0.000120469886,0.00007618798,0.0001759028,0.0001282576,0.00045698232,0.00006306327,0.000017676544],"category_scores_gemma":[0.000028722485,0.00011670167,0.000066833,0.00018490026,0.000028202654,0.00096319086,0.000087488275,0.00006294163,0.000047315123],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000017257964,0.00016343448,0.0004958086,0.000005412815,0.0000071987074,0.0000018981398,0.0013455686,0.0000021583667,0.0005664407,0.9667932,0.00063064374,0.029971024],"study_design_scores_gemma":[0.0010598039,0.00038990017,0.029079163,0.000010070545,0.0000072596404,0.000008802618,0.00002801477,0.04193891,0.007481914,0.9193513,0.00040914078,0.00023572317],"about_ca_topic_score_codex":0.00006730513,"about_ca_topic_score_gemma":0.0000035899602,"teacher_disagreement_score":0.05889586,"about_ca_system_score_codex":0.000046447254,"about_ca_system_score_gemma":0.000048531314,"threshold_uncertainty_score":0.47589558},"labels":[],"label_agreement":null},{"id":"W2398488167","doi":"10.1007/978-3-319-56932-1","title":"Applications of Computer Algebra","year":2017,"lang":"en","type":"book","venue":"Springer proceedings in mathematics & statistics","topic":"Polynomial and algebraic computation","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Wilfrid Laurier University","funders":"","keywords":"Algebra over a field; Computer science; Coding (social sciences); Range (aeronautics); Symbolic computation; Theoretical computer science; Mathematics; Pure mathematics; Engineering","score_opus":0.014207440814405012,"score_gpt":0.2536325272504481,"score_spread":0.2394250864360431,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2398488167","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000028596654,0.00011054798,0.9081762,0.000052413867,0.00026204946,0.000655717,0.00006868265,0.000104081155,0.09054171],"genre_scores_gemma":[0.00040622478,0.000083044135,0.93190205,0.00003861359,0.0003478979,0.00008589054,0.000026289454,0.000058210328,0.06705177],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9976431,0.0000054815196,0.0009043651,0.0005522118,0.00054651086,0.00034829482],"domain_scores_gemma":[0.99736506,0.00023856835,0.0013049039,0.0006108477,0.00037758972,0.000103041006],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00043691255,0.00038653213,0.000701555,0.00037289882,0.0001233838,0.00029968185,0.0020181872,0.00023727231,0.000012528214],"category_scores_gemma":[0.000086232816,0.00040297682,0.00009496016,0.00011137562,0.00017745487,0.0002665386,0.00079926755,0.00044654333,0.00007778567],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000001159536,0.00010141944,0.0000134766,0.0012535094,0.00003317121,0.0000070196365,0.0010679029,0.0000060304724,0.000010442477,0.9124812,0.009160448,0.0758642],"study_design_scores_gemma":[0.00025238167,0.000058490656,0.000107354674,0.0006410234,0.000037720878,0.0000119313145,0.000007929035,0.04649564,0.00006693976,0.9090845,0.042774234,0.00046183146],"about_ca_topic_score_codex":0.000006885459,"about_ca_topic_score_gemma":0.000006063907,"teacher_disagreement_score":0.07540237,"about_ca_system_score_codex":0.00015818866,"about_ca_system_score_gemma":0.0003650017,"threshold_uncertainty_score":0.9998422},"labels":[],"label_agreement":null},{"id":"W2398997308","doi":"10.55016/ojs/cdm.v8i2.62172","title":"The Erdős-Ko-Rado basis for a Leonard system","year":2014,"lang":"en","type":"article","venue":"Contributions to Discrete Mathematics","topic":"Polynomial and algebraic computation","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Basis (linear algebra); Generalization; Mathematics; Eigenvalues and eigenvectors; Combinatorics; Mathematical proof; Vector space; Discrete mathematics; Space (punctuation); Pure mathematics; Computer science","score_opus":0.009733530655127777,"score_gpt":0.2591611842764233,"score_spread":0.24942765362129554,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2398997308","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0016630718,0.000052616957,0.9878479,0.008123973,0.00050780654,0.00065055874,0.00007432796,0.00024709888,0.00083260157],"genre_scores_gemma":[0.9160942,0.0000021966302,0.08253724,0.0002362411,0.00032979657,0.000329859,0.000010171638,0.0000148159115,0.0004454857],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99871707,0.0000656403,0.0003677834,0.00025121667,0.00021299299,0.0003853179],"domain_scores_gemma":[0.9975897,0.0011970026,0.0001314557,0.0006305985,0.00029790096,0.00015331493],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00081881846,0.00015024566,0.00021978446,0.00005826952,0.0007532156,0.0003739749,0.0008185376,0.000048239574,0.0000012672588],"category_scores_gemma":[0.0012975298,0.0001026831,0.00014418615,0.00030898093,0.000041526077,0.000145099,0.00021317,0.00006888628,0.00011683464],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000003436251,0.000017169676,0.0000021193296,0.00003796097,0.00001964952,2.481229e-7,0.00035959523,0.00012458363,0.00008581998,0.97961545,0.0031246645,0.016609313],"study_design_scores_gemma":[0.0004705205,0.00013092165,0.0001248242,0.00014250808,0.000038361966,0.000013899189,0.00018496154,0.8520462,0.00079220615,0.08212738,0.06364869,0.0002795554],"about_ca_topic_score_codex":0.0000044305834,"about_ca_topic_score_gemma":0.000007804234,"teacher_disagreement_score":0.9144311,"about_ca_system_score_codex":0.00013782625,"about_ca_system_score_gemma":0.000069905516,"threshold_uncertainty_score":0.57932013},"labels":[],"label_agreement":null},{"id":"W2400697196","doi":"","title":"Equivalence of SDVFA of order (s, t) with DFA, VDFA, NFA and e-NFA.","year":2014,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Polynomial and algebraic computation","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Equivalence (formal languages); Pure mathematics","score_opus":0.006513538967334668,"score_gpt":0.21038322569490495,"score_spread":0.20386968672757028,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2400697196","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9707167,0.00011437149,0.02701842,0.00025965142,0.00044566797,0.00009743578,0.0000010288246,0.00004157168,0.001305132],"genre_scores_gemma":[0.99432653,0.000009335412,0.0055210763,0.000050789233,0.000006183367,0.0000030208857,8.250148e-7,0.000005798972,0.000076419325],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99910617,0.000052295225,0.0002117035,0.00023925345,0.00022767417,0.00016291821],"domain_scores_gemma":[0.99914944,0.0001508572,0.00015892711,0.00033371514,0.00013937899,0.00006768756],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002243602,0.000106298656,0.00020729423,0.000066238645,0.00004309638,0.000024796327,0.00039723108,0.000037237085,0.000006179308],"category_scores_gemma":[0.000050466268,0.00008857484,0.000023493822,0.00034652697,0.00010971713,0.00024270095,0.00019071862,0.00006747641,0.0000050069175],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000015114042,0.000081756334,0.0028612416,0.000053603766,0.000017516793,0.0000014152781,0.0005395902,0.00006813508,0.0016224261,0.97003716,0.00026487725,0.024437154],"study_design_scores_gemma":[0.0030830617,0.0015463005,0.042466003,0.00024147506,0.000031670148,0.000024652103,0.000046886402,0.058853928,0.029408509,0.86239797,0.0013826187,0.0005169361],"about_ca_topic_score_codex":0.00009001636,"about_ca_topic_score_gemma":0.0000038198523,"teacher_disagreement_score":0.10763921,"about_ca_system_score_codex":0.000009281071,"about_ca_system_score_gemma":0.000059210724,"threshold_uncertainty_score":0.3611977},"labels":[],"label_agreement":null},{"id":"W2402805981","doi":"","title":"On the Rank Polynomial and Whitney Numbers of Order Ideals of a Garland.","year":2010,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Polynomial and algebraic computation","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Rank (graph theory); Order (exchange); Polynomial; Pure mathematics; Combinatorics; Mathematical analysis","score_opus":0.006687131847941576,"score_gpt":0.22097082518114647,"score_spread":0.2142836933332049,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2402805981","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9949349,0.000018361097,0.0004126155,0.0013942352,0.0013511948,0.00012306318,0.0000018935376,0.000024061042,0.0017396568],"genre_scores_gemma":[0.9992342,0.0000035382855,0.0005470963,0.0001436917,0.000010129315,0.000004122336,6.0703286e-7,0.0000048585102,0.000051777337],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99923617,0.00005211517,0.00021333115,0.00017548776,0.00018631086,0.00013656824],"domain_scores_gemma":[0.9989884,0.00040367202,0.00014098511,0.00033296013,0.00008012788,0.000053863783],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00030865645,0.00009359487,0.00016509349,0.00005198316,0.00006218288,0.000032237087,0.00042398405,0.00005055347,0.000017005133],"category_scores_gemma":[0.00014651877,0.00006597033,0.00004074208,0.00024614338,0.00010536893,0.00011180635,0.00013705128,0.0001473184,0.000006028903],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000020556048,0.000062408515,0.00086363545,0.000008302652,0.000016370073,9.642536e-7,0.0005845427,0.0000059232784,0.005956414,0.9849657,0.0027259593,0.004789213],"study_design_scores_gemma":[0.0022651004,0.00034302007,0.022914605,0.000046821773,0.000015793716,0.0000131936995,0.00003801464,0.0073948354,0.024206895,0.9415014,0.0009947389,0.00026563014],"about_ca_topic_score_codex":0.00013294714,"about_ca_topic_score_gemma":0.000017229671,"teacher_disagreement_score":0.04346436,"about_ca_system_score_codex":0.0000052551827,"about_ca_system_score_gemma":0.00006658067,"threshold_uncertainty_score":0.2690192},"labels":[],"label_agreement":null},{"id":"W2402945515","doi":"10.1016/j.jsc.2017.08.001","title":"Bit complexity for multi-homogeneous polynomial system solving—Application to polynomial minimization","year":2017,"lang":"en","type":"preprint","venue":"Journal of Symbolic Computation","topic":"Polynomial and algebraic computation","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada; Institut Universitaire de France","keywords":"Homogeneous polynomial; Polynomial; Mathematics; Time complexity; TRACE (psycholinguistics); Matrix polynomial; Set (abstract data type); Rank (graph theory); Jacobian matrix and determinant; Minification; Quadratic equation; Algebraic number; Linear system; Algorithm; Discrete mathematics; Mathematical optimization; Computer science; Applied mathematics; Combinatorics","score_opus":0.05342822384063003,"score_gpt":0.3164096717980784,"score_spread":0.2629814479574484,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2402945515","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.078808635,0.00020984765,0.91244423,0.0013939925,0.005357466,0.0014709765,0.000066014494,0.00017343418,0.00007541043],"genre_scores_gemma":[0.7662167,0.000009824281,0.23111074,0.0001175798,0.002315089,0.00006391157,0.000078590914,0.000044857356,0.000042689033],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99600405,0.00020057682,0.0017550137,0.00081778097,0.0007180483,0.0005045258],"domain_scores_gemma":[0.9936403,0.00023937167,0.0035710135,0.0007743281,0.0013677756,0.00040718543],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0010104766,0.00054483453,0.0010756451,0.0008576801,0.00059380836,0.0010235432,0.0021901682,0.00039123782,0.0000015619527],"category_scores_gemma":[0.00024545242,0.0005635417,0.00056026736,0.00025508442,0.00008407753,0.00057699607,0.0009715893,0.00051791477,0.000023261744],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0006356091,0.0006842292,0.00032406364,0.0010895153,0.0005149819,0.000045040226,0.0055809207,0.43777698,0.0036678289,0.0043361736,0.014129323,0.5312153],"study_design_scores_gemma":[0.0019845185,0.0003453204,0.0070492835,0.00048316745,0.00012483979,0.00019425405,0.000059028134,0.98498875,0.00084898155,0.0016607259,0.0016386451,0.00062245986],"about_ca_topic_score_codex":0.00021669682,"about_ca_topic_score_gemma":0.00005005564,"teacher_disagreement_score":0.6874081,"about_ca_system_score_codex":0.0007768478,"about_ca_system_score_gemma":0.0009802134,"threshold_uncertainty_score":0.9996816},"labels":[],"label_agreement":null},{"id":"W2404171678","doi":"","title":"Small Complete Caps In Galois Spaces.","year":2012,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Polynomial and algebraic computation","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Pure mathematics","score_opus":0.025626231001825296,"score_gpt":0.2279426662588811,"score_spread":0.2023164352570558,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2404171678","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.98920476,0.0002780279,0.0034371307,0.0007393604,0.0031658516,0.00013160228,0.0000010175792,0.00013627103,0.0029059884],"genre_scores_gemma":[0.9972621,0.000004318408,0.0023339996,0.00024971244,0.000024897987,0.000010013596,0.0000029070072,0.0000076733695,0.000104360064],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.998929,0.00007228401,0.00019449534,0.00022139074,0.00015918702,0.0004236065],"domain_scores_gemma":[0.9993349,0.00009817255,0.00006646614,0.00032520265,0.000029008028,0.00014629994],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003088579,0.0001267169,0.00015968496,0.00011431782,0.000065787855,0.00008599784,0.0005299945,0.000049553695,0.000011131172],"category_scores_gemma":[0.00003054675,0.00012687706,0.00004541051,0.00041699936,0.000026761274,0.00045325683,0.00023976607,0.0001393107,0.00021892943],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000026725925,0.00013265142,0.02061575,0.000007210969,0.000006005265,0.0000065717263,0.0010663371,0.000017411228,0.00040773954,0.9678675,0.001052249,0.008817883],"study_design_scores_gemma":[0.0020561956,0.00011280126,0.34402627,0.00004879593,0.0000072369958,0.000029175822,0.00005931568,0.015651133,0.0018366087,0.61834586,0.017165884,0.00066075864],"about_ca_topic_score_codex":0.00023602233,"about_ca_topic_score_gemma":0.000026703181,"teacher_disagreement_score":0.3495217,"about_ca_system_score_codex":0.00007730389,"about_ca_system_score_gemma":0.00003859255,"threshold_uncertainty_score":0.51738966},"labels":[],"label_agreement":null},{"id":"W2404238687","doi":"","title":"A Property of the Roots of r-D Rook Polynomials.","year":2010,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Polynomial and algebraic computation","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Property (philosophy); Combinatorics; Pure mathematics","score_opus":0.008091183198022657,"score_gpt":0.21466628317159012,"score_spread":0.20657509997356746,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2404238687","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9939067,0.000020042757,0.00028280492,0.00072925666,0.0025542544,0.00015235295,0.000001079617,0.000034050507,0.0023194903],"genre_scores_gemma":[0.9987836,4.5320735e-7,0.0008062836,0.000046752742,0.000010048044,0.0000045980737,2.649238e-7,0.0000048615307,0.0003431763],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.999187,0.000046945956,0.0002449302,0.00016803519,0.00021371839,0.00013935415],"domain_scores_gemma":[0.9990795,0.000056471705,0.0001801679,0.0005457839,0.0000933,0.000044746095],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00020634604,0.00008553443,0.00015326246,0.000041311865,0.000058853122,0.000021478207,0.0009817333,0.000051392053,0.000008890564],"category_scores_gemma":[0.00008048784,0.000048389436,0.00008519289,0.00030628766,0.00009024329,0.00017221035,0.00032709452,0.00014677513,0.000007689163],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000058156284,0.000121102494,0.002039848,0.000014793066,0.000011865557,5.885496e-7,0.00024051018,0.0000068992667,0.15696724,0.8239262,0.0007793571,0.01588576],"study_design_scores_gemma":[0.0009695324,0.00013961707,0.09523421,0.0000513471,0.000010248431,0.000008463539,0.000007414528,0.005801232,0.31781474,0.5772092,0.0025437209,0.00021030748],"about_ca_topic_score_codex":0.00011580904,"about_ca_topic_score_gemma":0.000018185625,"teacher_disagreement_score":0.24671705,"about_ca_system_score_codex":0.0000095231335,"about_ca_system_score_gemma":0.0001402991,"threshold_uncertainty_score":0.1973264},"labels":[],"label_agreement":null},{"id":"W2406652678","doi":"10.48550/arxiv.0804.1679","title":"Computation of unirational fields","year":2008,"lang":"en","type":"article","venue":"ArXiv.org","topic":"Polynomial and algebraic computation","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Mathematics; Algebra over a field; Factoring; Field (mathematics); Algebraic number; Computation; Gröbner basis; Number theory; Extension (predicate logic); Pure mathematics; Algorithm; Computer science","score_opus":0.04360123435365497,"score_gpt":0.24866621385453863,"score_spread":0.20506497950088365,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2406652678","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6426695,0.000025060248,0.35606647,0.00045953563,0.00016039754,0.000030940377,3.8106901e-7,0.000040883613,0.0005468553],"genre_scores_gemma":[0.99472034,0.0000043863906,0.0047940603,0.00026292648,0.00007421397,0.000002058684,0.0000044821245,0.0000025145166,0.00013500391],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.9994216,0.000025345616,0.0001709458,0.00014600893,0.00014200414,0.000094069794],"domain_scores_gemma":[0.9996419,0.000054120264,0.000074752716,0.0001235969,0.000070173824,0.000035484838],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000060457554,0.0000585694,0.00008252791,0.00005412276,0.00008415047,0.0000081345415,0.00021038596,0.000032194104,0.000008777906],"category_scores_gemma":[0.000019471987,0.000056416586,0.000038221053,0.0002099905,0.000037922426,0.00025057542,0.000068782094,0.000053567936,0.0000504485],"study_design_candidate":"observational","study_design_consensus":"observational","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000032595133,0.0004866556,0.76720244,0.000055503326,0.00008305484,0.00006345031,0.0055268365,0.023598641,0.011535644,0.09402224,0.008379477,0.08901346],"study_design_scores_gemma":[0.00036488936,0.00009946475,0.9094762,0.000012138946,0.0000026494545,0.00002659033,0.000007745156,0.07718348,0.007712559,0.004504711,0.000475558,0.00013400789],"about_ca_topic_score_codex":0.000028516895,"about_ca_topic_score_gemma":0.0000037021205,"teacher_disagreement_score":0.35205087,"about_ca_system_score_codex":0.00001136862,"about_ca_system_score_gemma":0.000069431924,"threshold_uncertainty_score":0.23006016},"labels":[],"label_agreement":null},{"id":"W2412965380","doi":"10.1007/s00029-017-0379-6","title":"Tropicalization of theta characteristics, double covers, and Prym varieties","year":2018,"lang":"en","type":"article","venue":"Selecta Mathematica","topic":"Polynomial and algebraic computation","field":"Computer Science","cited_by":15,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Algebraic number; Algebraic curve; Algebraic geometry; Tropical geometry; Global field","score_opus":0.011112284079546418,"score_gpt":0.22806324506563824,"score_spread":0.21695096098609182,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2412965380","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.18474247,0.00003041577,0.8106584,0.00048504287,0.00015586305,0.00016713493,0.0000018874205,0.00009476353,0.0036640614],"genre_scores_gemma":[0.9893888,0.0000068836885,0.01026245,0.000053723663,0.00006674448,0.0000033857293,0.0000020868742,0.000004772186,0.00021112358],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99938273,0.000021113441,0.00019367857,0.00015411533,0.00012903474,0.00011933826],"domain_scores_gemma":[0.9995109,0.00006184229,0.000106857144,0.00019005573,0.00009306698,0.00003730517],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00010189089,0.00007209034,0.00014436741,0.000044792097,0.00006660014,0.00007166148,0.00020575164,0.000030886924,0.000023544813],"category_scores_gemma":[0.000042948963,0.00006203638,0.00001967442,0.00016605032,0.00008912443,0.00018930408,0.00009980179,0.000033530217,0.000020945048],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000020542915,0.00007344415,0.00020240262,0.00008097038,0.00002219683,5.4355604e-7,0.0028145597,5.5271397e-7,0.0031131469,0.98358047,0.0004605165,0.009630657],"study_design_scores_gemma":[0.001565437,0.0009036419,0.013748126,0.00015129872,0.00005418624,0.000048845417,0.00005768456,0.23724815,0.059810698,0.6823214,0.0035493954,0.0005411008],"about_ca_topic_score_codex":0.0000072775597,"about_ca_topic_score_gemma":0.0000016986946,"teacher_disagreement_score":0.8046464,"about_ca_system_score_codex":0.000008617635,"about_ca_system_score_gemma":0.000037898946,"threshold_uncertainty_score":0.252977},"labels":[],"label_agreement":null},{"id":"W2464139764","doi":"10.1090/mcom/3076","title":"Computation of invariants of finite abelian groups","year":2015,"lang":"en","type":"article","venue":"Mathematics of Computation","topic":"Polynomial and algebraic computation","field":"Computer Science","cited_by":16,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada; Agence Nationale de la Recherche; Nanyang Technological University; Division of Mathematical Sciences; National University of Singapore","keywords":"Mathematics; Generating set of a group; Abelian group; Invariant (physics); Homogeneous space; Computation; Polynomial; Integer (computer science); Discrete mathematics; Algebra over a field; Pure mathematics; Algorithm; Computer science; Mathematical analysis; Geometry","score_opus":0.04075089591998207,"score_gpt":0.26849546060062607,"score_spread":0.227744564680644,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2464139764","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.25142768,0.00003974784,0.7474944,0.000089280235,0.00017587202,0.00014976786,0.0000037242528,0.000037539183,0.00058197003],"genre_scores_gemma":[0.79065454,0.0000015089228,0.20928645,0.000013690019,0.000017389764,0.0000022052764,0.000009959087,0.000007175863,0.000007091956],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99832374,0.00007095731,0.00081562356,0.00017446563,0.0004854827,0.00012976072],"domain_scores_gemma":[0.99799454,0.0003327083,0.0008735363,0.0002121218,0.00051160523,0.00007547655],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005608382,0.0001283623,0.0003660739,0.00026423694,0.000023753853,0.000023366716,0.0003784692,0.000056823992,0.0000014922085],"category_scores_gemma":[0.00018884578,0.00012571123,0.00007634488,0.00056906167,0.00007091117,0.00035948475,0.00014144485,0.00005693558,0.000008932448],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005698848,0.0015597794,0.00057938724,0.001562862,0.00016096249,0.0000051695183,0.030667728,0.46767974,0.008926102,0.3558017,0.0007980223,0.13220155],"study_design_scores_gemma":[0.0006009859,0.00020007417,0.0010324713,0.00013471577,0.000012788995,0.0000040560994,0.00012385104,0.7453376,0.0071603176,0.24529038,0.0000043506343,0.00009838683],"about_ca_topic_score_codex":0.000030809286,"about_ca_topic_score_gemma":0.0000025544489,"teacher_disagreement_score":0.53922683,"about_ca_system_score_codex":0.000024490977,"about_ca_system_score_gemma":0.00012903142,"threshold_uncertainty_score":0.51263547},"labels":[],"label_agreement":null},{"id":"W2474389612","doi":"10.1007/978-1-4939-3264-1_8","title":"Hypercomplex Numbers: From Algebra to Algebras","year":2015,"lang":"en","type":"book-chapter","venue":"Compact textbooks in mathematics","topic":"Polynomial and algebraic computation","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"York University","funders":"","keywords":"Hypercomplex number; Algebra over a field; Mathematics; Pure mathematics; Arithmetic; Quaternion; Geometry","score_opus":0.06569430292647442,"score_gpt":0.28397015668597936,"score_spread":0.21827585375950492,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2474389612","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0018426625,0.0007017106,0.12779535,0.00086285523,0.0011313796,0.0010870309,0.000090900445,0.0006573933,0.8658307],"genre_scores_gemma":[0.079846196,0.00005202164,0.3404335,0.00303408,0.0021863284,0.00005849945,0.0002711237,0.0005709827,0.57354724],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9965619,0.00004499979,0.0010451312,0.0008876385,0.00088283414,0.00057753624],"domain_scores_gemma":[0.9967886,0.00051337027,0.00041806046,0.0016004904,0.00017089989,0.00050858373],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00045075078,0.00076012965,0.0011446726,0.00049925514,0.00010142857,0.00036004456,0.0023351149,0.00035867505,0.00038701916],"category_scores_gemma":[0.00010764628,0.00074940856,0.00024599457,0.00014188413,0.00009683645,0.00030947066,0.0007743962,0.0006342043,0.003657723],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008811436,0.00011331482,0.000010451813,0.000070878545,0.000092003866,0.00009041272,0.004009981,0.0001999936,0.000053300926,0.92837197,0.043466963,0.023511924],"study_design_scores_gemma":[0.00044021686,0.00008852364,0.000074494375,0.0006657587,0.0000307926,0.000027746399,0.000032818112,0.011147128,0.000046595957,0.91269517,0.073871054,0.0008796975],"about_ca_topic_score_codex":0.00011277874,"about_ca_topic_score_gemma":0.000108883716,"teacher_disagreement_score":0.29228345,"about_ca_system_score_codex":0.000427793,"about_ca_system_score_gemma":0.0003220126,"threshold_uncertainty_score":0.9994957},"labels":[],"label_agreement":null},{"id":"W2479807547","doi":"10.1145/2930889.2930938","title":"Computing Limits of Real Multivariate Rational Functions","year":2016,"lang":"en","type":"article","venue":"","topic":"Polynomial and algebraic computation","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"","keywords":"Multivariate statistics; Limit (mathematics); Zero (linguistics); Function (biology); Mathematics; Rational function; Algorithm; Point (geometry); Computer science; Mathematical optimization; Applied mathematics; Statistics; Pure mathematics; Mathematical analysis","score_opus":0.026448952151115753,"score_gpt":0.259029164672361,"score_spread":0.23258021252124522,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2479807547","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.080700465,0.000002926582,0.91184,0.0012391541,0.00029886267,0.00004058843,0.0000015341711,0.00009912578,0.0057773],"genre_scores_gemma":[0.9698409,0.0000010992175,0.02891887,0.0000583147,0.000081891034,9.707735e-7,9.847535e-7,0.0000020114535,0.0010949796],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994292,0.000027210943,0.00016766017,0.00015419656,0.0001185716,0.00010312906],"domain_scores_gemma":[0.9994729,0.00021491593,0.00006715502,0.00013441994,0.000071601135,0.000038991147],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00010931643,0.00005186152,0.000069011614,0.000052785526,0.00006160166,0.000018726701,0.00019145319,0.000019481582,0.000030465431],"category_scores_gemma":[0.000029042596,0.00003281871,0.000035076577,0.00014146848,0.00002197261,0.0002545182,0.00008117856,0.000020225718,0.000063931686],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000063388716,0.000065023574,0.0011362748,0.0000033618014,0.000016905893,9.492384e-7,0.00022005534,0.0002828282,0.054896157,0.48948827,0.0012956085,0.45258823],"study_design_scores_gemma":[0.002640137,0.0002890604,0.41206765,0.00010357955,0.000011797289,0.000022964989,0.00003279382,0.49543127,0.046877034,0.039003298,0.0029933578,0.0005270528],"about_ca_topic_score_codex":0.00006104034,"about_ca_topic_score_gemma":0.0000090084595,"teacher_disagreement_score":0.8891404,"about_ca_system_score_codex":0.000015166207,"about_ca_system_score_gemma":0.0000558063,"threshold_uncertainty_score":0.1338308},"labels":[],"label_agreement":null},{"id":"W2483455543","doi":"10.1090/coll/057/19","title":"Equidistribution of quadratic roots","year":2010,"lang":"en","type":"book-chapter","venue":"Colloquium Publications - American Mathematical Society/Colloquium Publications","topic":"Polynomial and algebraic computation","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Mathematics; Quadratic equation; Pure mathematics; Geometry","score_opus":0.019274896554520735,"score_gpt":0.2640885835741868,"score_spread":0.24481368701966605,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2483455543","genre_codex":"methods","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0002977998,0.00020110005,0.6924108,0.025790153,0.00052598346,0.0022377698,0.000540658,0.0015063898,0.27648932],"genre_scores_gemma":[0.09578649,0.00032598726,0.34444642,0.0018377367,0.0013344112,0.0033693388,0.003168235,0.00049649936,0.54923487],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9930192,0.000119272656,0.0024321475,0.0017450097,0.0015889041,0.0010954252],"domain_scores_gemma":[0.98895234,0.0012520605,0.0028039378,0.0038389615,0.0023071012,0.0008455772],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0011776829,0.0010456304,0.0016210233,0.0008241203,0.0010051869,0.0010222661,0.0041691023,0.00081300165,0.0010092568],"category_scores_gemma":[0.0010374691,0.001084747,0.0013892251,0.002886796,0.0020274865,0.0014898395,0.0012645659,0.0014394379,0.0006374477],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000043888904,0.0004851918,0.000014619071,0.00014061459,0.00028038226,4.669008e-7,0.00044348562,0.0000132084815,0.0015588804,0.96101,0.03137034,0.004678458],"study_design_scores_gemma":[0.00083073386,0.0003927528,0.0008927504,0.00020545532,0.0004450835,0.00007582316,0.00014977193,0.019476626,0.00074794417,0.47379893,0.5009147,0.0020694658],"about_ca_topic_score_codex":0.00004293643,"about_ca_topic_score_gemma":0.000039436225,"teacher_disagreement_score":0.48721105,"about_ca_system_score_codex":0.0006780579,"about_ca_system_score_gemma":0.0022272742,"threshold_uncertainty_score":0.999904},"labels":[],"label_agreement":null},{"id":"W2490176968","doi":"10.1017/cbo9780511791260.006","title":"Algebraic Extensions of a Field","year":2003,"lang":"en","type":"book-chapter","venue":"Cambridge University Press eBooks","topic":"Polynomial and algebraic computation","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Field (mathematics); Algebraic number; Mathematics; Pure mathematics; Mathematical analysis","score_opus":0.017699824072576538,"score_gpt":0.1927949811205714,"score_spread":0.17509515704799486,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2490176968","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00011035182,0.00011765905,0.061449338,0.000087588356,0.00036186213,0.000190623,0.000023905748,0.000107758984,0.9375509],"genre_scores_gemma":[0.0027297942,0.000033785993,0.0016414383,0.00033168241,0.000046781726,2.8010916e-7,0.000006572715,0.000015533307,0.99519414],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9989021,0.000032580883,0.0002015914,0.00043876364,0.00022403388,0.00020092232],"domain_scores_gemma":[0.99871033,0.00013990643,0.0002411999,0.0006367989,0.00014213666,0.00012961857],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.000069437294,0.00024249317,0.00033541108,0.00019165309,0.00010752726,0.00002969956,0.0008123159,0.00022403144,0.0000036206152],"category_scores_gemma":[0.00001464981,0.00027857878,0.0002189728,0.000016261703,0.00008994368,0.000119014716,0.0004797942,0.00026971553,0.000009809886],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009443358,0.000007764252,2.560279e-7,0.000025568577,0.000044207733,0.00008270365,0.00003115866,0.000003111744,0.000072638984,0.95515025,0.03708213,0.0074907523],"study_design_scores_gemma":[0.00044619487,0.00012518477,0.000013483805,0.00016548476,0.00007597919,0.00003118955,0.0000049331015,0.0007956458,0.0020801413,0.0006901417,0.9951263,0.00044534385],"about_ca_topic_score_codex":0.000059915663,"about_ca_topic_score_gemma":9.877689e-7,"teacher_disagreement_score":0.9580442,"about_ca_system_score_codex":0.00005438042,"about_ca_system_score_gemma":0.00011844343,"threshold_uncertainty_score":0.9999666},"labels":[],"label_agreement":null},{"id":"W2492002234","doi":"10.48550/arxiv.1607.04176","title":"Fast, deterministic computation of the Hermite normal form and determinant of a polynomial matrix","year":2016,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Polynomial and algebraic computation","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Invertible matrix; Mathematics; Hermite polynomials; Combinatorics; Omega; Exponent; Matrix (chemical analysis); Diagonal matrix; Bounded function; Logarithm; Diagonal; Discrete mathematics; Pure mathematics; Mathematical analysis; Physics","score_opus":0.0275619289746774,"score_gpt":0.19150634652991172,"score_spread":0.1639444175552343,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2492002234","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.65891343,0.000024675572,0.3402005,0.000043128483,0.00037723884,0.00018124144,0.000019939263,0.000026469783,0.00021335839],"genre_scores_gemma":[0.9989449,0.000023064587,0.00075333583,0.000015099169,0.000052334333,5.2205155e-7,0.0000016759025,0.000008312042,0.00020079293],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988124,0.0000933745,0.00031179414,0.0004755264,0.000098009616,0.00020892613],"domain_scores_gemma":[0.99861765,0.00013426924,0.0005917372,0.0004731057,0.000106026586,0.00007721405],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00014318795,0.00020754086,0.00031919085,0.000238211,0.000093397146,0.000034212324,0.0009123509,0.00013889853,0.0000021043625],"category_scores_gemma":[0.000016403244,0.00016295226,0.00017720126,0.00032534922,0.00021241273,0.00024001198,0.0017967458,0.00016613082,0.0000028735642],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0012490646,0.0011552961,0.067924984,0.0043745,0.0009513095,0.000600362,0.010158297,0.19288138,0.013240483,0.18181288,0.0010720753,0.52457935],"study_design_scores_gemma":[0.0012437165,0.00017813433,0.044677693,0.0005008164,0.0001123403,0.00003264136,0.00003814705,0.9141217,0.0031444356,0.035465118,0.00003833067,0.0004469346],"about_ca_topic_score_codex":0.00007701402,"about_ca_topic_score_gemma":0.000022781202,"teacher_disagreement_score":0.72124034,"about_ca_system_score_codex":0.000050349605,"about_ca_system_score_gemma":0.00018295027,"threshold_uncertainty_score":0.66450006},"labels":[],"label_agreement":null},{"id":"W2504258127","doi":"10.1145/2930889.2930903","title":"A Fast Parallel Sparse Polynomial GCD Algorithm","year":2016,"lang":"en","type":"article","venue":"","topic":"Polynomial and algebraic computation","field":"Computer Science","cited_by":18,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Modulo; Maple; Kronecker delta; Prime (order theory); Computer science; Mathematics; Algorithm; Parallel computing; Parallel algorithm; Sparse matrix; Interpolation (computer graphics); Discrete mathematics; Combinatorics","score_opus":0.012763222105719677,"score_gpt":0.22301135649773765,"score_spread":0.21024813439201798,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2504258127","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.005588736,0.000020887162,0.9837402,0.0046430454,0.00059429865,0.00008114869,0.000002402384,0.00028641237,0.005042845],"genre_scores_gemma":[0.6111292,0.0000127745925,0.37326995,0.0013232912,0.0006943135,0.000019494819,0.00000153382,0.000013474464,0.01353598],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990046,0.00003076968,0.00017660763,0.00032747016,0.00017218776,0.00028835455],"domain_scores_gemma":[0.99939764,0.00007631694,0.00004940783,0.00031535476,0.000030969,0.00013033338],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00010599698,0.00011862715,0.00011600479,0.00007085507,0.00007429314,0.00009010315,0.0005562085,0.000040337374,0.00010330106],"category_scores_gemma":[0.000012933445,0.00007231641,0.00006622658,0.00015750114,0.00003814208,0.00049611233,0.00023846414,0.000040432125,0.0008290519],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000031136485,0.000028094239,0.00004607765,6.7493664e-7,0.000006709634,0.000007927804,0.00006992888,0.0000076197657,0.00089648453,0.01460717,0.009052147,0.975274],"study_design_scores_gemma":[0.01068304,0.0009567613,0.036512278,0.00014603423,0.000028559813,0.0003349621,0.000069605005,0.55227023,0.02521871,0.08639208,0.28447986,0.0029078682],"about_ca_topic_score_codex":0.000055625067,"about_ca_topic_score_gemma":0.000010659857,"teacher_disagreement_score":0.97236615,"about_ca_system_score_codex":0.00003443285,"about_ca_system_score_gemma":0.00006709653,"threshold_uncertainty_score":0.9999489},"labels":[],"label_agreement":null},{"id":"W2504875771","doi":"10.1142/9789814719261_0019","title":"An introduction to hyperelliptic curve arithmetic","year":2016,"lang":"en","type":"book-chapter","venue":"WORLD SCIENTIFIC eBooks","topic":"Polynomial and algebraic computation","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Arithmetic; Hyperelliptic curve cryptography; Hyperelliptic curve; Mathematics; Computer science; Algebra over a field; Pure mathematics; Operating system; Elliptic curve cryptography","score_opus":0.01698080466692564,"score_gpt":0.22994316150179422,"score_spread":0.21296235683486858,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2504875771","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00033205943,0.000087561435,0.1587591,0.004460148,0.014723961,0.00075723603,0.00002662863,0.0006591956,0.8201941],"genre_scores_gemma":[0.010481629,1.9994326e-7,0.006271384,0.0002640766,0.0020519365,0.000016961885,0.0000148075205,0.000038963793,0.98086005],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.996804,0.00004769141,0.000454845,0.0015656538,0.00067043764,0.00045735674],"domain_scores_gemma":[0.9974594,0.00006679038,0.000208165,0.0016722443,0.00021465366,0.00037874287],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00070824655,0.00038085188,0.00034996928,0.0010672829,0.00041808866,0.0009587495,0.001445937,0.00011271155,0.00016120281],"category_scores_gemma":[0.0000122822985,0.00032496837,0.00015060956,0.00014766277,0.00023481851,0.000289395,0.00034519637,0.00027031847,0.0020139928],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000005162337,0.000013886668,7.070188e-7,0.000010536971,0.000014773079,0.000009964973,0.00023491346,0.000020161493,0.0018083968,0.77876997,0.023515316,0.1955962],"study_design_scores_gemma":[0.0001250864,0.000077024335,0.000012128835,0.00008197496,0.000016273985,0.000014335204,0.0000010766034,0.001067514,0.0008157278,0.13277183,0.8645398,0.00047723658],"about_ca_topic_score_codex":0.0000021624808,"about_ca_topic_score_gemma":0.0002761843,"teacher_disagreement_score":0.84102446,"about_ca_system_score_codex":0.00016933313,"about_ca_system_score_gemma":0.00020434285,"threshold_uncertainty_score":0.99992025},"labels":[],"label_agreement":null},{"id":"W2512531676","doi":"10.1007/978-3-319-45641-6_25","title":"Using Sparse Interpolation in Hensel Lifting","year":2016,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Polynomial and algebraic computation","field":"Computer Science","cited_by":12,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Multivariate statistics; Univariate; Polynomial; Factorization; Diophantine equation; Interpolation (computer graphics); Polynomial interpolation; Lift (data mining); Applied mathematics; Maple; Mathematics; Quaternion; Computer science; Algebra over a field; Image (mathematics); Algorithm; Discrete mathematics; Pure mathematics; Linear interpolation; Artificial intelligence; Statistics; Mathematical analysis; Geometry; Data mining","score_opus":0.03212336987551904,"score_gpt":0.2630906321011544,"score_spread":0.23096726222563538,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2512531676","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0013027074,0.00018052809,0.9928144,0.00051401387,0.0023369456,0.00025188073,0.0000018880119,0.00011330344,0.0024843079],"genre_scores_gemma":[0.54625326,0.000012211949,0.45194623,0.000781934,0.0008432323,0.0000032089822,0.000001706395,0.000029938108,0.00012826851],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99692404,0.00004375859,0.00060765404,0.0012227936,0.0006016508,0.00060007797],"domain_scores_gemma":[0.9983257,0.00040447045,0.00031899445,0.0007080742,0.00011912351,0.00012365422],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0007784192,0.0004099604,0.00041783974,0.0011594053,0.00015371997,0.00037401597,0.0017498911,0.00023102427,0.000012685106],"category_scores_gemma":[0.00009137317,0.00035418768,0.00009598596,0.000584205,0.00029067878,0.0009174619,0.0011031273,0.0005068275,0.0000394351],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000069060993,0.000020104488,0.00022920732,0.000023469322,0.00000516508,0.00007511971,0.0010641284,0.016949056,0.0010631228,0.037806235,0.0000043949385,0.9427531],"study_design_scores_gemma":[0.00023570492,0.000046308916,0.00021152111,0.00075347617,0.0000022609197,0.000043227396,9.5397596e-8,0.7497101,0.00030107025,0.24812311,0.00016181718,0.0004113075],"about_ca_topic_score_codex":0.000043240732,"about_ca_topic_score_gemma":0.00011190895,"teacher_disagreement_score":0.9423418,"about_ca_system_score_codex":0.00045714917,"about_ca_system_score_gemma":0.0004787446,"threshold_uncertainty_score":0.999891},"labels":[],"label_agreement":null},{"id":"W2515908536","doi":"10.1007/978-3-319-45641-6_22","title":"Computing Characteristic Polynomials of Matrices of Structured Polynomials","year":2016,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Polynomial and algebraic computation","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Computer science; Orthogonal polynomials; Algebra over a field; Classical orthogonal polynomials; Wilson polynomials; Discrete orthogonal polynomials; Mathematics; Pure mathematics","score_opus":0.012579991983386184,"score_gpt":0.24216713230135717,"score_spread":0.22958714031797098,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2515908536","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.006905376,0.00064525695,0.9881265,0.00041175148,0.0023672334,0.00044002125,0.00004470763,0.0001027272,0.000956389],"genre_scores_gemma":[0.89251816,0.000044733133,0.106334046,0.00021842093,0.0006971131,0.000002109138,0.0000048877614,0.000035716348,0.00014481104],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9954076,0.00007509907,0.0014982027,0.0013287315,0.0010059662,0.0006844087],"domain_scores_gemma":[0.99535155,0.0011505018,0.0017078451,0.001245579,0.0003594281,0.0001850962],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0010269615,0.0006270643,0.0012816653,0.0013382983,0.00015087095,0.00018278431,0.0035248413,0.00035058567,0.000033933684],"category_scores_gemma":[0.00017030448,0.0005109226,0.00026741944,0.0006519546,0.00089333265,0.0005651012,0.001565248,0.00040055058,0.00001597238],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000026166914,0.000034026274,0.00010453497,0.00018297843,0.00003832375,0.000021012607,0.00074459676,0.002488352,0.016307747,0.021537837,0.000015660882,0.9584988],"study_design_scores_gemma":[0.0029966598,0.0011510788,0.008220662,0.0063943374,0.00011877729,0.00026917682,0.0000010956827,0.29852074,0.18147339,0.49585983,0.0011553741,0.0038388716],"about_ca_topic_score_codex":0.00003919498,"about_ca_topic_score_gemma":0.000020324236,"teacher_disagreement_score":0.9546599,"about_ca_system_score_codex":0.0002148976,"about_ca_system_score_gemma":0.0008250847,"threshold_uncertainty_score":0.9997342},"labels":[],"label_agreement":null},{"id":"W2522892562","doi":"","title":"The dot-depth and the polynomial hierarchy correspond on the delta levels","year":2004,"lang":"en","type":"article","venue":"National University of Singapore","topic":"Polynomial and algebraic computation","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Hierarchy; Formalism (music); Complexity class; Analytical hierarchy; Polynomial; Polynomial hierarchy; Time complexity; Mathematics; Class (philosophy); Computer science; Regular language; Discrete mathematics; Computational complexity theory; Combinatorics; Algebra over a field; Pure mathematics; Theoretical computer science; Algorithm; Artificial intelligence; Analytic hierarchy process; Mathematical analysis","score_opus":0.02054882703152479,"score_gpt":0.21550638482934095,"score_spread":0.19495755779781615,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2522892562","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.82785285,0.00017406199,0.03996124,0.11894356,0.00044324432,0.00039435911,0.00003117066,0.00006195186,0.012137594],"genre_scores_gemma":[0.99854517,0.000009226158,0.000592345,0.00049853086,0.00005082902,1.6007179e-7,0.0000017384151,0.0000018120792,0.00030020272],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99926585,0.0000790632,0.00007776968,0.00013320688,0.0003442745,0.00009982084],"domain_scores_gemma":[0.998796,0.0008408578,0.000090965485,0.00013081353,0.00011245885,0.000028893435],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005029887,0.000063584295,0.00006437584,0.000045777,0.00079754106,0.000068640504,0.0005850234,0.000027161172,0.000004450263],"category_scores_gemma":[0.00010060204,0.000035470548,0.00004837305,0.00018633038,0.00042512783,0.00015505342,0.00017273446,0.00012349505,0.000006248689],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00015481927,0.000024224757,0.000036820387,0.0000013726698,0.000023349487,0.0000033294525,0.0018340456,0.00086739135,0.000077832876,0.96457046,0.0022067872,0.030199558],"study_design_scores_gemma":[0.012639905,0.0004032565,0.15899538,0.00014045021,0.00004894656,0.000096841715,0.0023254969,0.073932864,0.0020292376,0.6486942,0.10005445,0.000638958],"about_ca_topic_score_codex":0.00015669507,"about_ca_topic_score_gemma":0.00009438432,"teacher_disagreement_score":0.31587625,"about_ca_system_score_codex":0.000066738285,"about_ca_system_score_gemma":0.0002162271,"threshold_uncertainty_score":0.6134122},"labels":[],"label_agreement":null},{"id":"W2525265242","doi":"10.46298/dmtcs.6371","title":"Some results on counting roots of polynomials and the Sylvester resultant.","year":2020,"lang":"en","type":"article","venue":"Discrete Mathematics & Theoretical Computer Science","topic":"Polynomial and algebraic computation","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Mathematics; Sylvester matrix; Diophantine equation; Polynomial; Modulo; Ring (chemistry); Computation; Reciprocal polynomial; Matrix polynomial; Combinatorics; Discrete mathematics; Algebra over a field; Pure mathematics; Polynomial matrix; Mathematical analysis; Algorithm","score_opus":0.015241295437855285,"score_gpt":0.24798357154008427,"score_spread":0.23274227610222897,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2525265242","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08215239,0.00007655278,0.8929062,0.021736877,0.00034140237,0.00046330778,0.0000123966765,0.00013724699,0.00217365],"genre_scores_gemma":[0.9365892,0.000008670849,0.0613201,0.0018401928,0.00022233858,0.00000493934,8.511474e-7,0.00000921585,0.0000045069096],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99722815,0.0001439562,0.0007091336,0.0006639903,0.00083649263,0.0004182637],"domain_scores_gemma":[0.9971247,0.0015326106,0.00031205337,0.00065936515,0.00013171323,0.00023958588],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.0023080383,0.00023209491,0.0004171646,0.00009403413,0.0003402058,0.00053315575,0.0019157615,0.000048105714,0.000002574356],"category_scores_gemma":[0.00081835623,0.00013928906,0.000095177296,0.0007320064,0.0029980075,0.00055841403,0.0012269992,0.0002122962,0.000019772131],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000077572746,0.000025726871,0.0000016596913,0.00003342943,0.000007916174,0.0000031025352,0.0032509884,0.00016327442,0.00084446295,0.99145204,0.00006107969,0.00407876],"study_design_scores_gemma":[0.0010321495,0.00019541846,0.00012980329,0.000096442745,0.000010028595,0.000009610721,0.00003443089,0.7312463,0.0030583276,0.26398763,0.000032318654,0.0001675466],"about_ca_topic_score_codex":0.0000031188326,"about_ca_topic_score_gemma":1.8307063e-7,"teacher_disagreement_score":0.8544368,"about_ca_system_score_codex":0.00001732655,"about_ca_system_score_gemma":0.00008693389,"threshold_uncertainty_score":0.99971527},"labels":[],"label_agreement":null},{"id":"W2548940749","doi":"10.1145/3015306.3015311","title":"Computing limits with the regularchains and powerseries libraries","year":2016,"lang":"en","type":"article","venue":"ACM communications in computer algebra","topic":"Polynomial and algebraic computation","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"","keywords":"Symbolic computation; Computation; Rational function; Algebra over a field; Algebraic number; Maple; Computer science; Mathematics; Theoretical computer science; Pure mathematics; Algorithm","score_opus":0.025835854624451985,"score_gpt":0.25356021832426767,"score_spread":0.2277243636998157,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2548940749","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1274631,0.0006467342,0.77641034,0.09456702,0.00012285198,0.00024533406,0.0000018405183,0.00025305984,0.00028973466],"genre_scores_gemma":[0.7692199,0.00009838504,0.2296386,0.0009197496,0.000052613173,0.000014953061,0.0000022744796,0.000010676079,0.00004286622],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99858993,0.00027599803,0.0002761451,0.00036903436,0.00018711392,0.00030178012],"domain_scores_gemma":[0.9949561,0.0018451096,0.00012534486,0.002930677,0.000069872876,0.00007294074],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003739569,0.00018736853,0.00018828669,0.00015067292,0.0004589262,0.00033429175,0.00398071,0.000048433925,0.0000022351762],"category_scores_gemma":[0.000058527006,0.000106082174,0.00003526641,0.0005725538,0.00060002465,0.0009072428,0.0035882795,0.00019079374,0.000011513748],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009061701,0.00005705466,0.0025962316,0.0000062308454,0.000027984011,0.0000044023577,0.0033453603,0.000038106835,0.000115154624,0.45927498,0.000751882,0.53377354],"study_design_scores_gemma":[0.004372392,0.00087662204,0.3129239,0.0009984334,0.00003820525,0.00041493023,0.0004920277,0.23637536,0.0013529874,0.39189038,0.04838458,0.0018801495],"about_ca_topic_score_codex":0.000025209894,"about_ca_topic_score_gemma":0.00010579129,"teacher_disagreement_score":0.6417568,"about_ca_system_score_codex":0.00003414074,"about_ca_system_score_gemma":0.00009197425,"threshold_uncertainty_score":0.73972166},"labels":[],"label_agreement":null},{"id":"W2549194755","doi":"10.1016/j.jsc.2018.04.011","title":"An equivalence theorem for regular differential chains","year":2018,"lang":"en","type":"article","venue":"Journal of Symbolic Computation","topic":"Polynomial and algebraic computation","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"","keywords":"Mathematics; Equivalence (formal languages); Pure mathematics; Computation; Differential (mechanical device); Discrete mathematics; Algebra over a field; Algorithm","score_opus":0.017836125736268877,"score_gpt":0.28815487130501716,"score_spread":0.2703187455687483,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2549194755","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.36414498,0.000022733706,0.6344147,0.00038249456,0.0008486906,0.00009028651,0.0000010414215,0.000032221793,0.00006286836],"genre_scores_gemma":[0.96083456,0.0000038108699,0.03743115,0.00014070448,0.0015512349,0.0000022679458,0.0000027412666,0.000008880037,0.00002462588],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987321,0.00008855478,0.0004555819,0.00019684967,0.0003153818,0.00021155557],"domain_scores_gemma":[0.9985774,0.00012539072,0.00045668115,0.00017728601,0.0005303394,0.00013286203],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004501677,0.00012288759,0.00021418146,0.00021081087,0.00016845412,0.00017975869,0.0006147779,0.000048612157,0.0000068445056],"category_scores_gemma":[0.00004907904,0.000104165105,0.00012189029,0.00024398815,0.00007340274,0.00075945986,0.000060292892,0.00008954284,0.000006455247],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001330643,0.00028317558,0.000109168985,0.000032241333,0.00006484335,0.000009588222,0.0045805117,0.0023399105,0.02560946,0.19543178,0.0007090895,0.7706972],"study_design_scores_gemma":[0.0011406128,0.001582379,0.008573019,0.00006510309,0.000023598817,0.00016693868,0.000058328427,0.83879435,0.0062412946,0.14284766,0.0003033133,0.00020341131],"about_ca_topic_score_codex":0.000003281399,"about_ca_topic_score_gemma":0.0000012643076,"teacher_disagreement_score":0.83645445,"about_ca_system_score_codex":0.00004851628,"about_ca_system_score_gemma":0.000116133684,"threshold_uncertainty_score":0.42477298},"labels":[],"label_agreement":null},{"id":"W2564591273","doi":"10.1016/j.tcs.2017.03.035","title":"Computing real witness points of positive dimensional polynomial systems","year":2017,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Polynomial and algebraic computation","field":"Computer Science","cited_by":17,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"","keywords":"Witness; Mathematics; Component (thermodynamics); Polynomial; Connected component; Perturbation (astronomy); Path (computing); Mathematical optimization; Algorithm; Computer science; Applied mathematics; Mathematical analysis; Discrete mathematics","score_opus":0.010384160367676391,"score_gpt":0.2589777510609282,"score_spread":0.2485935906932518,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2564591273","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.39435837,0.000010912369,0.6013252,0.00058534316,0.0015870208,0.00014287172,0.0000033064357,0.00008203684,0.0019049043],"genre_scores_gemma":[0.96379036,0.0000011084933,0.035779953,0.000100497244,0.00031038505,0.0000015777131,0.0000011304069,0.00000760441,0.0000073751257],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99725217,0.00012751143,0.0004465651,0.0007513857,0.0008546743,0.00056769693],"domain_scores_gemma":[0.99762136,0.00033080595,0.0003679564,0.0010581649,0.00033630853,0.00028538183],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.0014842968,0.00021841793,0.00036034625,0.00017385346,0.0012534093,0.0008173472,0.003692739,0.00006198706,0.000004892215],"category_scores_gemma":[0.00011374566,0.00018372288,0.00009292808,0.00031352296,0.0040002586,0.0010478299,0.0025708468,0.00017874518,0.00002799577],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000019875997,0.000061675055,0.00019302014,0.000010483347,0.000008172467,0.000015667925,0.0003569083,0.00086506293,0.0017383595,0.97395265,0.00003277703,0.022745356],"study_design_scores_gemma":[0.00047306027,0.00021441444,0.030310988,0.00012971403,0.000006179642,0.00006446597,0.0000047529834,0.93270326,0.006635806,0.029185345,0.0000053495373,0.0002666446],"about_ca_topic_score_codex":0.0001278294,"about_ca_topic_score_gemma":9.812136e-7,"teacher_disagreement_score":0.9447673,"about_ca_system_score_codex":0.000074525364,"about_ca_system_score_gemma":0.0002878408,"threshold_uncertainty_score":0.9987103},"labels":[],"label_agreement":null},{"id":"W25803197","doi":"10.1090/crmp/035/11","title":"Comparing the depths of rings of invariants","year":2004,"lang":"en","type":"book-chapter","venue":"CRM proceedings & lecture notes","topic":"Polynomial and algebraic computation","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"","keywords":"Geology","score_opus":0.022274620974553003,"score_gpt":0.22067550798542152,"score_spread":0.1984008870108685,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W25803197","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.026410619,0.0026472094,0.23402095,0.002560424,0.0010070171,0.0010385151,0.00001113042,0.00036267834,0.73194146],"genre_scores_gemma":[0.99850446,0.000026495454,0.0009490795,0.00016253362,0.00020879823,0.0000042294187,0.0000025337238,0.000025920843,0.00011595619],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99845004,0.0000034006116,0.0004835232,0.0004273255,0.00039959713,0.00023614125],"domain_scores_gemma":[0.99856806,0.0001515136,0.00069699186,0.00022923028,0.0002932349,0.000060943676],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00020553757,0.00032361652,0.00051638356,0.00017535477,0.00010798706,0.00009564939,0.0011775356,0.00022650091,0.000020089734],"category_scores_gemma":[0.00011798683,0.00023611159,0.00017747737,0.00014046027,0.00015163107,0.00021258084,0.00040374935,0.0004231836,0.000009548612],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001064395,0.000014220375,0.00018392276,0.00017079653,0.000058812428,0.0000013405519,0.0016094493,0.00019607141,0.0016484578,0.978397,0.000017104183,0.017692188],"study_design_scores_gemma":[0.00028219086,0.00010595051,0.0010695545,0.00074947916,0.00005138184,0.000021403153,0.0000044522767,0.001919568,0.021785986,0.9729203,0.00079254375,0.0002971777],"about_ca_topic_score_codex":0.000059344282,"about_ca_topic_score_gemma":0.000010079452,"teacher_disagreement_score":0.9720938,"about_ca_system_score_codex":0.000057939444,"about_ca_system_score_gemma":0.0001719246,"threshold_uncertainty_score":0.96283513},"labels":[],"label_agreement":null},{"id":"W2588168239","doi":"","title":"Quantum algorithm for identifying hidden polynomial function graphs","year":2008,"lang":"en","type":"article","venue":"Centrum Wiskunde & Informatica (CWI), the national research institute for mathematics and computer science in the Netherlands","topic":"Polynomial and algebraic computation","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Army Research Office; Natural Sciences and Engineering Research Council of Canada; Mitacs; Nederlandse Organisatie voor Wetenschappelijk Onderzoek; Canadian Institute for Advanced Research; National Science Foundation","keywords":"Mathematics; Coset; Combinatorics; Polynomial; Discrete mathematics; Degree (music); Constant (computer programming); Generalization; Quantum algorithm; Finite field; Quantum; Computer science","score_opus":0.10009813056998827,"score_gpt":0.34409640812482284,"score_spread":0.24399827755483455,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2588168239","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.039725963,0.000058422418,0.9550645,0.0023875085,0.00095328665,0.0013062287,0.000022558861,0.000052804,0.00042876412],"genre_scores_gemma":[0.8188058,0.00008470351,0.17902893,0.0009650316,0.00063589495,0.00037686562,0.00002608539,0.000016419584,0.000060288905],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9959445,0.00007945771,0.0006488893,0.00038257736,0.002151678,0.0007929164],"domain_scores_gemma":[0.9968734,0.0015378089,0.00021488723,0.0003991096,0.0008302909,0.00014453633],"candidate_categories":["sts","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.008326809,0.00021913345,0.00024040962,0.0005607158,0.0023829911,0.0010555949,0.0024438866,0.00007818883,0.0000019845318],"category_scores_gemma":[0.00046079748,0.00013555959,0.00012568869,0.0014445483,0.0010731164,0.0020144496,0.0005352621,0.0003530737,0.000010264664],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000046766836,0.00026252496,0.000028119077,0.00014888035,0.000044192137,0.0000028706188,0.016468229,0.0011443987,0.00007381751,0.7290456,0.008488293,0.24424627],"study_design_scores_gemma":[0.0006768574,0.00019698545,0.0004934231,0.000050439085,0.0000049881874,0.00008751235,0.00019628028,0.7695312,0.00005053297,0.22414239,0.004421866,0.0001475303],"about_ca_topic_score_codex":0.000027693488,"about_ca_topic_score_gemma":0.000015290827,"teacher_disagreement_score":0.7790798,"about_ca_system_score_codex":0.00019473158,"about_ca_system_score_gemma":0.00075209717,"threshold_uncertainty_score":0.9999814},"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,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.015670036717325222,"score_gpt":0.23682327962148758,"score_spread":0.22115324290416236,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2588207498","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9777828,0.000026203175,0.012521927,0.006948108,0.00026811752,0.00021671753,0.00000204718,0.000014018751,0.0022200847],"genre_scores_gemma":[0.99791765,4.451592e-7,0.0015712506,0.0003635202,0.000055861,0.000009985379,3.2772957e-7,0.000002245964,0.00007872562],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992549,0.00012276054,0.00023236258,0.00008990722,0.0002190371,0.000081039034],"domain_scores_gemma":[0.9991551,0.00026586634,0.00015956981,0.00037185868,0.000040522747,0.000007103494],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004533335,0.0000612295,0.000087678505,0.000028143482,0.000098736,0.000034611374,0.0006381651,0.000033846885,0.000023627621],"category_scores_gemma":[0.00009545527,0.000025947114,0.000057585185,0.0002442545,0.00011421346,0.000094817384,0.000078854006,0.00010681046,0.000009322593],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000028958198,0.0000621687,0.000042971824,0.000032023498,0.000007676148,3.0499692e-7,0.005056019,0.000018327873,0.0018215547,0.9906605,0.0016096802,0.0006859142],"study_design_scores_gemma":[0.00019184678,0.00015506824,0.0046894383,0.00029369383,0.000008130986,0.000022927528,0.0006137414,0.03510177,0.025183596,0.93341917,0.00022353185,0.00009709315],"about_ca_topic_score_codex":0.000006048416,"about_ca_topic_score_gemma":0.000027678538,"teacher_disagreement_score":0.057241302,"about_ca_system_score_codex":0.000004995464,"about_ca_system_score_gemma":0.000017237408,"threshold_uncertainty_score":0.118588015},"labels":[],"label_agreement":null},{"id":"W2592118566","doi":"10.3929/ethz-a-006654232","title":"On lattice reduction for polynomial matrices","year":2000,"lang":"en","type":"article","venue":"Repository for Publications and Research Data (ETH Zurich)","topic":"Polynomial and algebraic computation","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Unimodular matrix; Mathematics; Lattice reduction; Diophantine equation; Matrix polynomial; Square-free polynomial; Monic polynomial; Computation; Lattice (music); Reduction (mathematics); Polynomial; Factorization; Discrete mathematics; Matrix similarity; Combinatorics; Orthogonal transformation; Algorithm; Mathematical analysis","score_opus":0.09094474155144434,"score_gpt":0.37225244698015847,"score_spread":0.28130770542871414,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2592118566","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.31002915,0.00329988,0.5512987,0.08632816,0.0030663228,0.009605652,0.0014935959,0.0015143565,0.033364233],"genre_scores_gemma":[0.8672082,0.0003351453,0.09146973,0.00020550896,0.002549005,0.0010974685,0.0012772225,0.000052482286,0.035805263],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9982744,0.00012763003,0.00025023182,0.00068154646,0.00031183902,0.0003543851],"domain_scores_gemma":[0.9975409,0.00083211757,0.00006759142,0.0011034965,0.00029531273,0.00016060125],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013377913,0.00010021487,0.000110434485,0.00029805905,0.0011497454,0.0008391732,0.0012626029,0.00007284998,0.000009410426],"category_scores_gemma":[0.00024021963,0.00008697252,0.00003899661,0.0006192861,0.00009958749,0.0014126182,0.0002539153,0.00015385624,0.000015616213],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013818168,0.00039272598,0.000027060089,0.00008741505,0.000058304802,8.3350557e-7,0.0002785896,0.0000645363,0.0014586913,0.18644029,0.4528604,0.35819298],"study_design_scores_gemma":[0.00071789604,0.00044674633,0.0015569625,0.000025075298,0.000015351025,0.00006072308,0.00003139052,0.07004986,0.0010669914,0.01066228,0.9151383,0.00022842688],"about_ca_topic_score_codex":0.00010298012,"about_ca_topic_score_gemma":0.000003167178,"teacher_disagreement_score":0.55717903,"about_ca_system_score_codex":0.00005207138,"about_ca_system_score_gemma":0.00017697056,"threshold_uncertainty_score":0.88430285},"labels":[],"label_agreement":null},{"id":"W2592477357","doi":"10.1145/3055282.3055286","title":"Real limit points of quasi-componenets of regular chains","year":2017,"lang":"en","type":"article","venue":"ACM communications in computer algebra","topic":"Polynomial and algebraic computation","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"","keywords":"Limit (mathematics); Mathematics; Computer science; Mathematical analysis","score_opus":0.046737191950376594,"score_gpt":0.3067473367608639,"score_spread":0.26001014481048734,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2592477357","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6589032,0.00025383808,0.32889268,0.009471514,0.00049939315,0.0003649501,0.000009528289,0.00012868084,0.0014762279],"genre_scores_gemma":[0.71876585,0.00020040656,0.28087884,0.000068864094,0.000039382674,0.000011466264,0.0000097593165,0.000009342245,0.0000161063],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99811375,0.00025083913,0.0007338019,0.0003590933,0.00028050365,0.00026201035],"domain_scores_gemma":[0.9895899,0.000562027,0.0006902202,0.008901926,0.00017786487,0.00007803881],"candidate_categories":["open_science"],"consensus_categories":[],"category_scores_codex":[0.00064768794,0.00018606216,0.00041494254,0.00028231888,0.00030263723,0.00011427862,0.010856612,0.00009405114,0.0000041377543],"category_scores_gemma":[0.00015366227,0.00019714196,0.00013076763,0.00027853716,0.0003832043,0.0006201102,0.005944319,0.00022773446,0.0000121522135],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000020158928,0.0009915251,0.009773423,0.000059074977,0.0000802456,0.0000062506033,0.002804425,0.00022758872,0.0018791333,0.54695046,0.00043337623,0.43677437],"study_design_scores_gemma":[0.0015635326,0.00027896042,0.40466082,0.00032215938,0.000016575576,0.000018565806,0.000021537222,0.45688334,0.0039534853,0.13100073,0.0008339692,0.0004463192],"about_ca_topic_score_codex":0.0005758708,"about_ca_topic_score_gemma":0.00015110803,"teacher_disagreement_score":0.45665577,"about_ca_system_score_codex":0.00004935711,"about_ca_system_score_gemma":0.000105775296,"threshold_uncertainty_score":0.99449515},"labels":[],"label_agreement":null},{"id":"W2593950578","doi":"10.71781/11071","title":"Galois lattice dynamics","year":2003,"lang":"en","type":"dissertation","venue":"Open MIND","topic":"Polynomial and algebraic computation","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Lattice (music); Lattice QCD; Mathematics; Physics; Condensed matter physics; Particle physics; Quantum chromodynamics","score_opus":0.020131832280593055,"score_gpt":0.28964737771274207,"score_spread":0.269515545432149,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2593950578","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.20526524,0.0002449346,0.034749966,0.00048238208,0.004600372,0.00086114305,0.000027603935,0.000015807598,0.7537525],"genre_scores_gemma":[0.08377335,0.000039969265,0.25025186,0.00040948793,0.0002826995,0.00006730685,0.00219242,0.00007611492,0.66290677],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9988221,0.000048953672,0.00024070771,0.0004854981,0.00019828069,0.00020448025],"domain_scores_gemma":[0.99920344,0.000051023213,0.00018891452,0.00040302987,0.000073613584,0.000079984566],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00018844876,0.00018651641,0.00021731491,0.00008562531,0.00011329629,0.0007178082,0.0015518384,0.00014698219,0.0003897306],"category_scores_gemma":[0.000029291436,0.00018889179,0.00006197165,0.00026718123,0.00000873465,0.00046689354,0.00014581885,0.00018641414,0.0010743301],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008907107,0.000049491133,0.000010175624,0.000012205802,0.000024189938,0.000016973805,0.0007974855,0.000018490065,0.00004248643,0.0069012567,0.0011691916,0.99094915],"study_design_scores_gemma":[0.0033064443,0.0005391786,0.006848767,0.0009162435,0.00029580898,0.00012459124,0.0016709272,0.29033172,0.016786592,0.051067274,0.623173,0.0049394723],"about_ca_topic_score_codex":0.000075252596,"about_ca_topic_score_gemma":0.00074155076,"teacher_disagreement_score":0.98600966,"about_ca_system_score_codex":0.00008448408,"about_ca_system_score_gemma":0.0002904624,"threshold_uncertainty_score":0.99970347},"labels":[],"label_agreement":null},{"id":"W2606972987","doi":"","title":"Your NSF Mathematical Sciences Institutes","year":2007,"lang":"en","type":"article","venue":"Iowa State University Digital Repository (Iowa State University)","topic":"Polynomial and algebraic computation","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"Mitacs; Banff International Research Station for Mathematical Innovation and Discovery; Natural Sciences and Engineering Research Council of Canada; American Institute of Mathematics; Division of Mathematical Sciences; National Science Foundation","keywords":"Engineering ethics; Computer science; Management science; Engineering","score_opus":0.0141337017557958,"score_gpt":0.19947244419319984,"score_spread":0.18533874243740406,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2606972987","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.48438936,0.000014719242,0.41262966,0.00014028691,0.00039097865,0.00018316209,0.000025867306,0.0004296696,0.10179627],"genre_scores_gemma":[0.9533452,0.000019215688,0.0050848275,0.000077720535,0.000052295753,5.2301953e-8,0.000007333576,0.000013609477,0.041399766],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9975474,0.00006922406,0.00029489512,0.0007842047,0.0005800606,0.0007242048],"domain_scores_gemma":[0.9984356,0.00026002034,0.00023476605,0.00041559257,0.00020006865,0.00045390986],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00020554413,0.00032219678,0.00029827264,0.0008530778,0.0009421301,0.00055799726,0.0016531458,0.000086342334,0.000006341349],"category_scores_gemma":[0.000039634375,0.00036094774,0.00019383316,0.0015907151,0.00062735734,0.004268747,0.00088033447,0.00024119379,0.00011800066],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0011978536,0.0022672724,0.020805776,0.0003211652,0.0007758467,0.030828355,0.01601743,0.00958273,0.0072239568,0.629387,0.004313023,0.27727956],"study_design_scores_gemma":[0.012856058,0.003657363,0.050569188,0.0008572051,0.0003425215,0.0016349939,0.0189527,0.04650902,0.040785298,0.097109325,0.7179395,0.00878683],"about_ca_topic_score_codex":0.00010633116,"about_ca_topic_score_gemma":0.000045166616,"teacher_disagreement_score":0.7136265,"about_ca_system_score_codex":0.00046479033,"about_ca_system_score_gemma":0.0004120969,"threshold_uncertainty_score":0.99988425},"labels":[],"label_agreement":null},{"id":"W2608826509","doi":"10.1090/crmp/029/23","title":"Transcendental solutions of the sine-Gordon equation","year":2001,"lang":"en","type":"book-chapter","venue":"CRM proceedings & lecture notes","topic":"Polynomial and algebraic computation","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Dalhousie University","funders":"","keywords":"Sine; Transcendental number; Transcendental equation; Transcendental function; Mathematics; Mathematical analysis; Differential equation; Geometry","score_opus":0.027633570399741344,"score_gpt":0.2184655256827728,"score_spread":0.19083195528303146,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2608826509","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00089835207,0.00092675275,0.6154308,0.0052814544,0.0010473909,0.0005752565,0.00001587759,0.00025471096,0.37556943],"genre_scores_gemma":[0.9981283,0.00003131384,0.00028367722,0.00026806112,0.00045129034,0.0000072464036,0.000010196037,0.000026755728,0.00079316803],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9984959,0.000005013663,0.00035133187,0.00043746256,0.00044189245,0.00026840408],"domain_scores_gemma":[0.99907845,0.0000790061,0.00036238198,0.00019685407,0.0002239048,0.000059415994],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001381278,0.00030540672,0.00027772028,0.00014748241,0.00024118774,0.00011717947,0.0008098501,0.0002801695,0.000035509227],"category_scores_gemma":[0.00006704605,0.00022998326,0.00025961516,0.00017633165,0.000104206636,0.00025922008,0.00016656406,0.00040289183,0.000017391214],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000006944781,0.000021453421,0.000024128638,0.00005275765,0.00003318691,7.740377e-7,0.0008013536,0.00012798715,0.0026354447,0.9351228,0.00008759417,0.061085563],"study_design_scores_gemma":[0.00024323339,0.00009642513,0.00028816098,0.00027670694,0.00007464055,0.000044117987,0.0000045288966,0.007838762,0.0056259884,0.9759765,0.0091534285,0.0003774655],"about_ca_topic_score_codex":0.000020181313,"about_ca_topic_score_gemma":0.000016120219,"teacher_disagreement_score":0.99722993,"about_ca_system_score_codex":0.00009110002,"about_ca_system_score_gemma":0.00013070433,"threshold_uncertainty_score":0.9378445},"labels":[],"label_agreement":null},{"id":"W2609948870","doi":"10.1090/amsip/050/04","title":"Functional integration and abelian link invariants","year":2011,"lang":"en","type":"book-chapter","venue":"AMS/IP studies in advanced mathematics","topic":"Polynomial and algebraic computation","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"","keywords":"Link (geometry); Abelian group; Pure mathematics; Computer science; Mathematics; Algebra over a field; Computer network","score_opus":0.0766523144191552,"score_gpt":0.2849648102388952,"score_spread":0.20831249581973998,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2609948870","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00024907905,0.0053867237,0.8534465,0.0008701867,0.0024738447,0.00077712856,0.000013443441,0.00027613,0.13650697],"genre_scores_gemma":[0.029215839,0.014500357,0.64554894,0.0012483612,0.0010792201,0.00020688392,0.00006119652,0.00018861574,0.30795062],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985325,0.000012905148,0.0005390081,0.0004595635,0.00024201564,0.00021402388],"domain_scores_gemma":[0.998781,0.00028890584,0.0003456132,0.0003844754,0.000142512,0.000057440036],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00021093054,0.0003460865,0.0004998247,0.00021049609,0.00011396349,0.000039619546,0.0003097402,0.00014602033,0.000017254511],"category_scores_gemma":[0.00013864339,0.00030310042,0.00006356415,0.000080293365,0.0001684806,0.0003413686,0.00048553795,0.00030580908,0.000070097],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000051671086,0.000024617742,0.0000012549121,0.00013896126,0.00006452386,0.0000142400295,0.0028226946,0.000026832024,0.000024488403,0.8000637,0.0004087853,0.19640471],"study_design_scores_gemma":[0.00037556415,0.00009638267,0.00006696822,0.0008880747,0.000024844894,0.000027390799,0.000109428605,0.0035817747,0.000082306186,0.9913471,0.0030165713,0.0003836331],"about_ca_topic_score_codex":0.0000030493422,"about_ca_topic_score_gemma":0.00004512931,"teacher_disagreement_score":0.20789757,"about_ca_system_score_codex":0.00010732628,"about_ca_system_score_gemma":0.000050107235,"threshold_uncertainty_score":0.9999421},"labels":[],"label_agreement":null},{"id":"W2610070750","doi":"10.1090/amsip/038/06","title":"Arithmetic of algebraic curves and the affine algebra 𝐴₁⁽¹⁾","year":2006,"lang":"en","type":"book-chapter","venue":"AMS/IP studies in advanced mathematics","topic":"Polynomial and algebraic computation","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta; Queen's University","funders":"","keywords":"Mathematics; Algebra over a field; Affine transformation; Affine arithmetic; Arithmetic; Dimension of an algebraic variety; Algebraic number; Pure mathematics; Mathematical analysis","score_opus":0.02548645051810753,"score_gpt":0.27432835404944483,"score_spread":0.2488419035313373,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2610070750","genre_codex":"other","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0027365484,0.29874703,0.29852635,0.009023597,0.0030803124,0.0056046234,0.00007784769,0.0006870928,0.38151658],"genre_scores_gemma":[0.0981903,0.12269993,0.44880292,0.0035510627,0.0010298084,0.00057714817,0.00006923763,0.00044827955,0.3246313],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99784803,0.000037398633,0.0009346809,0.00046883442,0.00042288468,0.0002881724],"domain_scores_gemma":[0.9968648,0.0015483347,0.00069958845,0.0006910453,0.00015661925,0.00003960757],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0005051047,0.0004473843,0.0011236507,0.00018286907,0.00010550166,0.000029247347,0.00071905076,0.00010767782,0.000008801867],"category_scores_gemma":[0.00027899336,0.00031297436,0.00015412005,0.00015663766,0.0008407959,0.00018019033,0.0008786678,0.0003159163,0.00001010404],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010329036,0.000057183144,0.0000015233375,0.001538904,0.00015293964,0.0000157612,0.0015932434,0.00017894876,0.000009577914,0.96762383,0.0019679219,0.026849866],"study_design_scores_gemma":[0.0013358684,0.00008853869,0.000032492342,0.003200904,0.000097442346,0.000035326,0.00014230543,0.005784854,0.000063265965,0.98678327,0.0019912792,0.0004444545],"about_ca_topic_score_codex":0.0000078749235,"about_ca_topic_score_gemma":0.000032017575,"teacher_disagreement_score":0.1760471,"about_ca_system_score_codex":0.00006724395,"about_ca_system_score_gemma":0.00004718754,"threshold_uncertainty_score":0.9999322},"labels":[],"label_agreement":null},{"id":"W26138048","doi":"10.1007/978-1-4614-8453-0_4","title":"Solving Ax=b","year":2013,"lang":"en","type":"book-chapter","venue":"","topic":"Polynomial and algebraic computation","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"","keywords":"Computer science","score_opus":0.016375417065383868,"score_gpt":0.20626314928675019,"score_spread":0.18988773222136632,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W26138048","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000003925462,0.00010972241,0.23629868,0.0004409895,0.00044810612,0.000080607344,4.6276477e-7,0.00021761179,0.7623999],"genre_scores_gemma":[0.0014270867,0.000015508458,0.01970965,0.0006173897,0.00026342104,0.000003160845,0.0000036422207,0.000013892234,0.9779462],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991616,0.0000037862808,0.00017854637,0.00032300828,0.00017616281,0.00015687547],"domain_scores_gemma":[0.9993813,0.00004786084,0.00008876932,0.00035767985,0.00004682886,0.00007753273],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.000049981933,0.00017310436,0.00016121965,0.000087339395,0.000056412642,0.0001822698,0.00059418014,0.00011632716,0.0012333681],"category_scores_gemma":[0.000003927687,0.00014766458,0.00009013417,0.000016750395,0.000019895948,0.00025879344,0.00033888553,0.00014645734,0.0048042773],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[1.11790015e-7,0.0000014629676,1.2174618e-7,0.0000034770167,0.0000072522644,0.000003322809,0.000021323107,0.000002488481,0.000008561871,0.8021938,0.018853685,0.17890435],"study_design_scores_gemma":[0.00008310064,0.000029561765,0.000022228727,0.000047442674,0.000004919962,0.000012081887,4.6574254e-7,0.01897948,0.000051466905,0.49751404,0.4829027,0.0003524924],"about_ca_topic_score_codex":0.000021760885,"about_ca_topic_score_gemma":0.000004012371,"teacher_disagreement_score":0.464049,"about_ca_system_score_codex":0.000029804973,"about_ca_system_score_gemma":0.00005728483,"threshold_uncertainty_score":0.9996796},"labels":[],"label_agreement":null},{"id":"W2614749082","doi":"10.1145/3096730.3096736","title":"An upper bound for the order of a differential algebraic variety","year":2017,"lang":"en","type":"article","venue":"ACM communications in computer algebra","topic":"Polynomial and algebraic computation","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"","keywords":"Upper and lower bounds; Variety (cybernetics); Mathematics; Differential algebraic geometry; Differential (mechanical device); Context (archaeology); Algebraic number; Order (exchange); Algebraic variety; Pure mathematics; Algebra over a field; Differential equation; Differential algebraic equation; Mathematical analysis; Ordinary differential equation; Physics","score_opus":0.041479160193682495,"score_gpt":0.3243343731031736,"score_spread":0.2828552129094911,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2614749082","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09336288,0.00020453102,0.8960063,0.009083004,0.0006390078,0.00051136065,0.000008868281,0.00008713844,0.000096911135],"genre_scores_gemma":[0.77250004,0.000054365126,0.22686356,0.00031131794,0.00012686386,0.000096156924,0.000017823306,0.000012952006,0.000016921516],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984075,0.0001741253,0.0004941601,0.00039841965,0.00021499126,0.00031082338],"domain_scores_gemma":[0.9887866,0.0012497763,0.00035362676,0.009312479,0.00022448105,0.000073062554],"candidate_categories":["open_science"],"consensus_categories":[],"category_scores_codex":[0.00051994174,0.00019939302,0.00027487258,0.00012557567,0.0011977094,0.00067494664,0.013733257,0.00008829255,0.000010006174],"category_scores_gemma":[0.00019119511,0.0001592651,0.00013255827,0.00024214185,0.00041135508,0.0009216916,0.0037489112,0.00025449082,0.000008054061],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000022303508,0.00061445584,0.003406803,0.000024698775,0.000104946674,8.1277165e-7,0.0026164306,0.00035925387,0.0004396342,0.46287718,0.0007759766,0.5287575],"study_design_scores_gemma":[0.0009293599,0.00013151103,0.12048646,0.000037774844,0.000020854352,0.000006981896,0.000016575352,0.7527605,0.00023004106,0.12290016,0.0022326743,0.0002470636],"about_ca_topic_score_codex":0.0002727175,"about_ca_topic_score_gemma":0.00023225688,"teacher_disagreement_score":0.7524013,"about_ca_system_score_codex":0.000038346818,"about_ca_system_score_gemma":0.00014953954,"threshold_uncertainty_score":0.9916029},"labels":[],"label_agreement":null},{"id":"W2615108617","doi":"10.2140/involve.2017.10.881","title":"Integer solutions to x2+ y2= z2−k for a fixedinteger value k","year":2017,"lang":"en","type":"article","venue":"Involve a Journal of Mathematics","topic":"Polynomial and algebraic computation","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Integer (computer science); Mathematics; Radical of an integer; Value (mathematics); Integer points in convex polyhedra; Combinatorics; Discrete mathematics; Integer programming; Prime factor; Branch and price; Mathematical optimization; Computer science; Statistics; Prime (order theory)","score_opus":0.06341878435296348,"score_gpt":0.30713121344331645,"score_spread":0.24371242909035296,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2615108617","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.027517527,0.00009410753,0.96545905,0.0054497183,0.0009000867,0.00016661541,0.000003338789,0.00001932232,0.00039025143],"genre_scores_gemma":[0.5717603,0.0000096657595,0.42685565,0.00054407225,0.00048056187,0.000010463606,3.4333385e-7,0.000013153504,0.00032579552],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988547,0.000018019437,0.00048744376,0.00012513295,0.00027213266,0.00024257926],"domain_scores_gemma":[0.99805224,0.00033180355,0.00061413855,0.00046065508,0.00037539602,0.00016576094],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00082489045,0.000120229386,0.00026129227,0.00014228701,0.0003331593,0.00037918537,0.0013847705,0.000046977937,0.000006484307],"category_scores_gemma":[0.0010635467,0.00009337622,0.00020517547,0.000073672156,0.000044255405,0.00058542535,0.0003015385,0.00013948369,0.000034471446],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004667041,0.0008888793,0.000091991606,0.00023187879,0.00030740365,0.000052162937,0.017692158,0.0032456468,0.006314258,0.83285177,0.07009544,0.06818171],"study_design_scores_gemma":[0.0011164838,0.0007400143,0.0004967475,0.0006890935,0.00007145868,0.00027547008,0.00034774028,0.27060857,0.004217569,0.707777,0.013281539,0.00037830524],"about_ca_topic_score_codex":0.000008137182,"about_ca_topic_score_gemma":0.0000072203375,"teacher_disagreement_score":0.54424274,"about_ca_system_score_codex":0.000056076427,"about_ca_system_score_gemma":0.00015174133,"threshold_uncertainty_score":0.38077718},"labels":[],"label_agreement":null},{"id":"W2625741854","doi":"","title":"Law of inertia for the factorization of cubic polynomials - the real case","year":2017,"lang":"en","type":"article","venue":"Utilitas Mathematica","topic":"Polynomial and algebraic computation","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Discriminant; Monic polynomial; Factorization; Prime factor; Integer (computer science); Class (philosophy); Polynomial; Cubic function; Combinatorics; Prime (order theory); Unique factorization domain; Square (algebra); Difference polynomials; Orthogonal polynomials; Mathematical analysis; Algorithm","score_opus":0.040004265954640725,"score_gpt":0.2999675448691068,"score_spread":0.2599632789144661,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2625741854","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11457159,0.0001228518,0.8764275,0.0031681997,0.00045275968,0.0008688003,0.000036942092,0.00004626655,0.0043051103],"genre_scores_gemma":[0.9952121,0.0000041395297,0.0045983517,0.00003970361,0.00005176375,0.000022379236,0.0000010049374,0.0000051529573,0.00006542781],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992319,0.000037679383,0.0003289348,0.00013319755,0.00014280491,0.00012553218],"domain_scores_gemma":[0.99759865,0.0009875153,0.00036971047,0.0009312159,0.00008700438,0.000025891537],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00050133554,0.00008526848,0.00017352274,0.000020134688,0.0003868664,0.00008176384,0.0008928609,0.000031113956,0.000008583222],"category_scores_gemma":[0.0002919014,0.000044893583,0.00009420778,0.000053037384,0.00020630557,0.00021641172,0.00020027808,0.00003907325,0.0000033363726],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009321726,0.00005401784,0.000020911657,0.00009062998,0.000037339807,0.0000018507554,0.002588476,0.000018620223,0.0016074787,0.98133796,0.0003496692,0.013883704],"study_design_scores_gemma":[0.0009979827,0.00027595522,0.0035714915,0.00014643882,0.00014615977,0.00010750459,0.00049360417,0.295988,0.047706727,0.6482742,0.0019946725,0.0002973202],"about_ca_topic_score_codex":0.000381508,"about_ca_topic_score_gemma":0.00004626765,"teacher_disagreement_score":0.8806405,"about_ca_system_score_codex":0.000009241147,"about_ca_system_score_gemma":0.000040047296,"threshold_uncertainty_score":0.29755026},"labels":[],"label_agreement":null},{"id":"W2647257074","doi":"10.4213/im8307","title":"Многогранники Ньютона и неприводимые компоненты полных пересечений","year":2016,"lang":"ru","type":"article","venue":"Известия Российской академии наук Серия математическая","topic":"Polynomial and algebraic computation","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"Agence Nationale de la Recherche","keywords":"Polytope; Combinatorics; Mathematics","score_opus":0.0149388218901068,"score_gpt":0.22966190842640088,"score_spread":0.21472308653629407,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2647257074","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.25677377,0.010390231,0.53221315,0.07428331,0.03378207,0.0052198395,0.0009446339,0.005636281,0.0807567],"genre_scores_gemma":[0.9507002,0.0010501359,0.0062590246,0.0036966938,0.0047042915,0.00020526399,0.00006642092,0.00035177972,0.03296619],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.98417157,0.0009146223,0.0030971349,0.004340376,0.0030558552,0.0044204397],"domain_scores_gemma":[0.9892086,0.001473579,0.0016923969,0.0044903853,0.00097586826,0.0021592176],"candidate_categories":["metaepi_narrow","sts","scholarly_communication","open_science","research_integrity","insufficient_payload"],"consensus_categories":["metaepi_narrow","insufficient_payload"],"category_scores_codex":[0.0020687426,0.0025159363,0.0022611027,0.0013675035,0.0014991238,0.0016238482,0.0060569975,0.0013146818,0.0026130318],"category_scores_gemma":[0.0008539238,0.0020232263,0.0014417191,0.0030290638,0.0011885209,0.003962744,0.0031591847,0.0013932112,0.015196438],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00033434012,0.0012339961,0.0024870336,0.0002720866,0.00057572575,0.000529982,0.0023710576,0.00017362951,0.011360111,0.08170145,0.05459732,0.8443633],"study_design_scores_gemma":[0.02071365,0.0042632436,0.07662144,0.0049125375,0.0010002609,0.0013559894,0.0006897347,0.038862508,0.042961173,0.09371073,0.7014029,0.013505839],"about_ca_topic_score_codex":0.0005638796,"about_ca_topic_score_gemma":0.0003017784,"teacher_disagreement_score":0.83085746,"about_ca_system_score_codex":0.0012271176,"about_ca_system_score_gemma":0.0021483111,"threshold_uncertainty_score":0.9999818},"labels":[],"label_agreement":null},{"id":"W2680289735","doi":"10.1093/imrn/rnx254","title":"Rational Complexity-One $\\boldsymbol{T}$-Varieties Are Well-Poised","year":2017,"lang":"en","type":"article","venue":"International Mathematics Research Notices","topic":"Polynomial and algebraic computation","field":"Computer Science","cited_by":12,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"National Science Foundation","keywords":"Affine transformation; Embedding; Rank (graph theory); Affine variety; Prime (order theory); Ideal (ethics); Torus; Ring (chemistry)","score_opus":0.20436441163507874,"score_gpt":0.4043869824783439,"score_spread":0.2000225708432652,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2680289735","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1970849,0.00012892744,0.561198,0.07317718,0.0037433952,0.0009308684,0.000050738574,0.00042048466,0.16326551],"genre_scores_gemma":[0.9432865,0.000013628447,0.053093076,0.0001196237,0.00046592497,0.00003628418,0.000012576923,0.000013132216,0.0029592623],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9969618,0.00010588661,0.00038573923,0.00040148044,0.0017687363,0.00037636427],"domain_scores_gemma":[0.9971032,0.00074720493,0.00037837712,0.00082189,0.0008073713,0.00014193001],"candidate_categories":["scholarly_communication","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0013358532,0.00015517909,0.00021416583,0.00028838863,0.0010443586,0.0025814306,0.0036535715,0.000069223395,0.00029770617],"category_scores_gemma":[0.0011446959,0.00014552809,0.00008645729,0.00011794466,0.0004468278,0.0014089007,0.0012791036,0.00033015606,0.0008295635],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000014611493,0.00037781487,0.0005883227,0.0000660644,0.00009026076,0.000019667965,0.00091981,0.00017058014,0.0006414144,0.9912057,0.0028451518,0.0030606152],"study_design_scores_gemma":[0.0004986657,0.00004893391,0.018712997,0.00013156423,0.0000046351397,0.000008294868,0.00015928659,0.37764192,0.001898944,0.5961237,0.0045530624,0.00021801541],"about_ca_topic_score_codex":0.0000976969,"about_ca_topic_score_gemma":0.00006771632,"teacher_disagreement_score":0.7462016,"about_ca_system_score_codex":0.00009956988,"about_ca_system_score_gemma":0.00014092606,"threshold_uncertainty_score":0.9999484},"labels":[],"label_agreement":null},{"id":"W2734852884","doi":"","title":"Law of inertia for the factorization of cubic polynomials - the imaginary case","year":2017,"lang":"en","type":"article","venue":"Utilitas Mathematica","topic":"Polynomial and algebraic computation","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Discriminant; Factorization; Integer (computer science); Polynomial; Combinatorics; Prime (order theory); Field (mathematics); Prime factor; The Imaginary; Square (algebra); Galois group; Cubic function; Discrete mathematics; Pure mathematics; Mathematical analysis; Algorithm","score_opus":0.034183816002079245,"score_gpt":0.29601214528267045,"score_spread":0.2618283292805912,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2734852884","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04162834,0.00028232174,0.9492031,0.0046554734,0.00041644962,0.00076819124,0.000034301447,0.00004033058,0.002971491],"genre_scores_gemma":[0.993563,0.0000024702358,0.0062263026,0.00006793665,0.000047572878,0.00002413434,0.0000012401819,0.0000056063973,0.00006175395],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992347,0.00003820695,0.00031809305,0.00013976831,0.00013966342,0.00012957766],"domain_scores_gemma":[0.99762565,0.0009248059,0.0003546044,0.0009743029,0.00009473788,0.000025883837],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004777965,0.00009116692,0.00017430211,0.000022693692,0.00039729112,0.000088158566,0.0009622534,0.000025910083,0.000009071294],"category_scores_gemma":[0.0002485106,0.000048575224,0.00009799809,0.000056301695,0.00025917857,0.00028742,0.00024278589,0.000043758966,0.000004083072],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000012797665,0.00008858524,0.000025467978,0.00016648675,0.000049624814,0.0000042859447,0.0025948412,0.000022382466,0.0025276549,0.9739655,0.0007330915,0.019809237],"study_design_scores_gemma":[0.00070176984,0.00019302283,0.0015428197,0.00013557494,0.0001069538,0.00018251466,0.0002649608,0.25830775,0.033679895,0.70276994,0.0018911854,0.00022361983],"about_ca_topic_score_codex":0.00016927726,"about_ca_topic_score_gemma":0.00001324415,"teacher_disagreement_score":0.95193464,"about_ca_system_score_codex":0.000008863108,"about_ca_system_score_gemma":0.000040272716,"threshold_uncertainty_score":0.30556825},"labels":[],"label_agreement":null},{"id":"W2737458612","doi":"10.1145/3087604.3087658","title":"On the Extended Hensel Construction and its Application to the Computation of Limit Points","year":2017,"lang":"en","type":"article","venue":"","topic":"Polynomial and algebraic computation","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"","keywords":"Univariate; Bivariate analysis; Computation; Polynomial; Mathematics; Limit (mathematics); Symbolic computation; Algebra over a field; Space (punctuation); Software; Multivariate statistics; Applied mathematics; Discrete mathematics; Pure mathematics; Algorithm; Computer science; Mathematical analysis; Statistics","score_opus":0.018134693270382106,"score_gpt":0.25373875850468997,"score_spread":0.23560406523430785,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2737458612","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.31925684,0.000009979826,0.66009676,0.018835118,0.00016259441,0.00028920677,8.2267877e-7,0.000031052045,0.0013176174],"genre_scores_gemma":[0.99461436,0.0000024521428,0.00467187,0.0006246932,0.00003698089,0.000013932928,5.357342e-7,0.0000022155205,0.000032965774],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994411,0.00003988082,0.00012423517,0.0001752971,0.00014098981,0.00007848492],"domain_scores_gemma":[0.9992855,0.00013710943,0.00014101641,0.00033339506,0.00007152593,0.000031430187],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00023759204,0.00006152332,0.00006403777,0.000030353527,0.0003906506,0.00013283645,0.00042313754,0.000019238441,0.0000023681976],"category_scores_gemma":[0.00008311025,0.000034237095,0.000019678664,0.00006803974,0.000046148798,0.00017576448,0.00014647932,0.000047465055,0.000031646778],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000006844512,0.000013209286,0.000024350094,0.000002715521,0.0000048435236,9.801637e-8,0.00027415666,0.00019274697,0.0009803709,0.723646,0.00020295693,0.27465174],"study_design_scores_gemma":[0.0004097051,0.0001778648,0.06748339,0.00003339837,0.000008660116,0.000019472052,0.000093029994,0.621078,0.0142256655,0.29580197,0.00050009525,0.00016876787],"about_ca_topic_score_codex":0.000022836051,"about_ca_topic_score_gemma":0.00001097506,"teacher_disagreement_score":0.6753575,"about_ca_system_score_codex":0.000009101881,"about_ca_system_score_gemma":0.000016111173,"threshold_uncertainty_score":0.3004608},"labels":[],"label_agreement":null},{"id":"W2743075180","doi":"10.1145/3115936.3115948","title":"An Algorithm For Spliting Polynomial Systems Based On F4","year":2017,"lang":"en","type":"article","venue":"","topic":"Polynomial and algebraic computation","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Univariate; Zero (linguistics); Algorithm; Polynomial; Computer science; Decomposition; Variable (mathematics); Mathematics; Position (finance); Discrete mathematics; Multivariate statistics; Machine learning","score_opus":0.02229085277035455,"score_gpt":0.2814199183555777,"score_spread":0.2591290655852232,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2743075180","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0075644627,0.000004798781,0.9868162,0.0006159278,0.0012355243,0.00022786694,0.0000064560945,0.00016737549,0.003361361],"genre_scores_gemma":[0.8938698,1.13308964e-7,0.1047677,0.00030616196,0.00064832775,0.000025055395,0.000004671956,0.0000071783315,0.00037094168],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991255,0.00002520156,0.00015166192,0.00032320607,0.000143524,0.0002309134],"domain_scores_gemma":[0.99894774,0.00010279041,0.00012383136,0.0006739801,0.000046922407,0.00010473287],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00027645752,0.00010228203,0.00011906712,0.000055614822,0.00054042746,0.00091532606,0.00090863614,0.0000398215,0.00000341429],"category_scores_gemma":[0.000030896164,0.00008751411,0.00005589544,0.000028715804,0.000022087188,0.0005122553,0.00006716436,0.000046746653,0.000022200848],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000007764764,0.00006622009,0.000062494866,0.000010066732,0.0000052597015,0.0000038181583,0.000052740426,0.0014758412,0.00033513407,0.024539499,0.0012709068,0.97217023],"study_design_scores_gemma":[0.0005171463,0.00018166144,0.0012029302,0.000015844198,0.0000019017916,0.0000018141658,0.000007848874,0.9947552,0.0010179525,0.0003579959,0.0018073132,0.00013239535],"about_ca_topic_score_codex":0.00021844816,"about_ca_topic_score_gemma":0.0000049575183,"teacher_disagreement_score":0.99327934,"about_ca_system_score_codex":0.000029707824,"about_ca_system_score_gemma":0.00007641354,"threshold_uncertainty_score":0.88265103},"labels":[],"label_agreement":null},{"id":"W2744961039","doi":"10.1007/s10915-017-0522-8","title":"Computing the Level Set Convex Hull","year":2017,"lang":"en","type":"article","venue":"Journal of Scientific Computing","topic":"Polynomial and algebraic computation","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Mathematics; Convex hull; Hull; Convex set; Set (abstract data type); Regular polygon; Convex polytope; Geometry; Convex optimization; Computer science; Geology","score_opus":0.06893348938150312,"score_gpt":0.30259625140170304,"score_spread":0.23366276202019992,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2744961039","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.53632915,0.000095766736,0.45357037,0.0030222966,0.006284278,0.00007608369,0.0000012485802,0.000027996895,0.0005928007],"genre_scores_gemma":[0.9823772,0.0000011527496,0.01635416,0.00018511964,0.0007864816,1.0499564e-7,5.540385e-7,0.000007129859,0.00028811314],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9978189,0.00011480644,0.00066248403,0.00032339102,0.0006977067,0.00038272154],"domain_scores_gemma":[0.99670535,0.00030570585,0.0015400442,0.0008460215,0.00045815084,0.00014471213],"candidate_categories":["sts","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0038903197,0.00015553791,0.00026519244,0.00017530097,0.003036171,0.003517224,0.003677669,0.000041519415,0.0000055746727],"category_scores_gemma":[0.0003865076,0.000107016036,0.00019724968,0.00026142324,0.00034280005,0.0006765776,0.0012106855,0.00036582284,0.000028905946],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000017102127,0.0001173746,0.0049096644,0.000034062854,0.00010575867,0.000110354384,0.007576395,0.007422945,0.004787836,0.018910348,0.022008019,0.93400013],"study_design_scores_gemma":[0.0010889419,0.00013206988,0.10528569,0.00028580285,0.000024522129,0.0007158681,0.000283232,0.8659119,0.002379545,0.008116203,0.015395024,0.00038121647],"about_ca_topic_score_codex":0.000018576891,"about_ca_topic_score_gemma":0.000006471546,"teacher_disagreement_score":0.9336189,"about_ca_system_score_codex":0.000050962888,"about_ca_system_score_gemma":0.0002698811,"threshold_uncertainty_score":0.99826175},"labels":[],"label_agreement":null},{"id":"W2753526410","doi":"10.5281/zenodo.1101101","title":"stan-dev/math: 2.17.1","year":2017,"lang":"en","type":"article","venue":"Zenodo (CERN European Organization for Nuclear Research)","topic":"Polynomial and algebraic computation","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"York University","funders":"","keywords":"Code refactoring; Programming language; Computer science; Compiler; Algebraic number; Theoretical computer science; Mathematics; Software","score_opus":0.03985299891832288,"score_gpt":0.25503672569356395,"score_spread":0.21518372677524106,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2753526410","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05592095,0.000092749404,0.49632612,0.007621006,0.0007105264,0.0005344413,0.000071505114,0.0027692132,0.4359535],"genre_scores_gemma":[0.99447227,0.000021319285,0.0023892673,0.00022469003,0.000213925,2.0051893e-8,0.000103353595,0.00039406092,0.00218112],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9987508,0.00010574014,0.00016762382,0.00037795492,0.00029799464,0.00029989574],"domain_scores_gemma":[0.9985079,0.000017342483,0.0001384572,0.00092712225,0.00025609988,0.00015306329],"candidate_categories":["sts","scholarly_communication","insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.00045595563,0.00010628643,0.00010350811,0.00010595897,0.004240287,0.0030166248,0.0029280551,0.000037945752,0.00091761426],"category_scores_gemma":[0.00034896578,0.00010668077,0.000044978187,0.00015798707,0.00011777688,0.0008100496,0.0024644714,0.00015385219,0.006074812],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000014887424,0.000089037065,0.0000033463818,0.000018064386,0.000022056352,0.000024592055,0.0010049569,0.000050726012,0.002504363,0.1697905,0.13445431,0.69202316],"study_design_scores_gemma":[0.00035083076,0.00011225686,0.0022069616,0.000016529773,0.0000032806838,0.000056351706,0.000024985702,0.012844813,0.0004683875,0.0034525502,0.98030096,0.0001620654],"about_ca_topic_score_codex":0.000016780748,"about_ca_topic_score_gemma":3.198919e-7,"teacher_disagreement_score":0.9385513,"about_ca_system_score_codex":0.00006888511,"about_ca_system_score_gemma":0.0000051321854,"threshold_uncertainty_score":0.9999957},"labels":[],"label_agreement":null},{"id":"W2754485517","doi":"10.2168/lmcs-8(1:25)2012","title":"Formal Theories for Linear Algebra","year":2012,"lang":"en","type":"article","venue":"Logical Methods in Computer Science","topic":"Polynomial and algebraic computation","field":"Computer Science","cited_by":30,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto; University of New Brunswick","funders":"","keywords":"Algebra over a field; Mathematics; Linear algebra; Universal algebra; Discrete mathematics; Pure mathematics","score_opus":0.06168111032428622,"score_gpt":0.3851971348274723,"score_spread":0.32351602450318606,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2754485517","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.012274584,0.000106824285,0.98402804,0.00049635064,0.0023357687,0.0002524569,7.503693e-7,0.00015663175,0.00034861063],"genre_scores_gemma":[0.29847685,0.000001793992,0.70037067,0.0007414981,0.00037139392,0.000025322915,3.6232103e-7,0.000003436111,0.000008661926],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9976522,0.00021852805,0.00035047784,0.00052352296,0.00031307514,0.0009422481],"domain_scores_gemma":[0.9980022,0.0011428036,0.00009228804,0.00042908097,0.00009045623,0.00024321124],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0053932974,0.00017267591,0.00024117017,0.00020847561,0.00029962516,0.00020287909,0.0017257356,0.00006810208,0.000005494835],"category_scores_gemma":[0.00034587967,0.0001298828,0.00008836619,0.0012379232,0.00035627728,0.0022814148,0.0010774961,0.00016406918,0.0000142633435],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000004279718,0.00005491893,0.00024777532,0.000005174398,0.0000011548261,6.3835154e-7,0.00041618655,0.0003268169,0.0005811406,0.4515234,0.000010751435,0.5468278],"study_design_scores_gemma":[0.00029261678,0.0001774758,0.011020802,0.000013269228,0.0000017833898,0.000021819751,0.000005399177,0.6929476,0.0073553575,0.28660074,0.0013142296,0.00024887253],"about_ca_topic_score_codex":0.0000044113513,"about_ca_topic_score_gemma":5.181128e-7,"teacher_disagreement_score":0.6926208,"about_ca_system_score_codex":0.00006476824,"about_ca_system_score_gemma":0.000088074914,"threshold_uncertainty_score":0.5296467},"labels":[],"label_agreement":null},{"id":"W2766061637","doi":"10.1016/j.jalgebra.2018.12.032","title":"Evaluation and interpolation over multivariate skew polynomial rings","year":2019,"lang":"en","type":"preprint","venue":"Journal of Algebra","topic":"Polynomial and algebraic computation","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"Danmarks Frie Forskningsfond","keywords":"Skew; Mathematics; Univariate; Vandermonde matrix; Interpolation (computer graphics); Polynomial; Multivariate statistics; Lagrange polynomial; Iterated function; Polynomial interpolation; Algebra over a field; Discrete mathematics; Applied mathematics; Pure mathematics; Mathematical analysis; Computer science; Statistics; Linear interpolation; Artificial intelligence","score_opus":0.02079589200936991,"score_gpt":0.2888945639297931,"score_spread":0.2680986719204232,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2766061637","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6926406,0.00085286284,0.3003737,0.0010267444,0.004362653,0.00033420094,0.0000033221768,0.00003274897,0.00037313835],"genre_scores_gemma":[0.98315305,0.000041982566,0.015799068,0.00017395083,0.0007587035,0.0000030646252,0.000004010943,0.000014555966,0.000051600684],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9976097,0.000246289,0.00074338814,0.00035224194,0.00085080694,0.00019759822],"domain_scores_gemma":[0.99753416,0.00016008297,0.0013415042,0.00033027073,0.00050858554,0.00012537195],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018993305,0.00024381709,0.00041839734,0.0003924678,0.00006059764,0.00041151576,0.00066652946,0.00020727236,0.00003312847],"category_scores_gemma":[0.00021815993,0.00021559765,0.00019073281,0.00012890004,0.000030557712,0.0008018707,0.0008983095,0.000652766,0.000015004107],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002799418,0.0003428052,0.0033254146,0.00030966956,0.0009769162,0.00004389842,0.008909207,0.009873788,0.0099388035,0.010472828,0.008958604,0.94656813],"study_design_scores_gemma":[0.0019824605,0.00026500132,0.0973268,0.0005147315,0.00019095329,0.00011441814,0.00001679987,0.8395452,0.0005314779,0.0582821,0.0008087704,0.00042131904],"about_ca_topic_score_codex":0.00006648399,"about_ca_topic_score_gemma":0.0000044680532,"teacher_disagreement_score":0.9461468,"about_ca_system_score_codex":0.00020194595,"about_ca_system_score_gemma":0.00061401963,"threshold_uncertainty_score":0.87918174},"labels":[],"label_agreement":null},{"id":"W2767728188","doi":"10.1145/3338637.3338642","title":"Computing the integer points of a polyhedron","year":2019,"lang":"en","type":"article","venue":"ACM communications in computer algebra","topic":"Polynomial and algebraic computation","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"","keywords":"Polyhedron; Integer (computer science); Integer programming; Omega; Computer science; Discrete mathematics; Combinatorics; Quantifier elimination; Constructive; Loop (graph theory); Mathematics; Algorithm; Theoretical computer science; Programming language","score_opus":0.02432456423391149,"score_gpt":0.28343462349146314,"score_spread":0.25911005925755165,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2767728188","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.39325178,0.0005115158,0.5885888,0.014861393,0.00073008245,0.0005320664,0.000001992338,0.00017899962,0.0013433961],"genre_scores_gemma":[0.84324664,0.000024708776,0.15582035,0.00081696146,0.000042808264,0.000007781437,0.0000062851923,0.00000969512,0.000024749792],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99820775,0.00034566846,0.00058132404,0.00033679916,0.00024574818,0.00028269688],"domain_scores_gemma":[0.99346566,0.0014241524,0.00024650505,0.004712138,0.00010431475,0.000047243604],"candidate_categories":["open_science"],"consensus_categories":[],"category_scores_codex":[0.0007343996,0.00017186692,0.00026962903,0.00022239565,0.00013886894,0.000112220456,0.007523688,0.00006268313,0.000013505232],"category_scores_gemma":[0.00006744188,0.00013781841,0.00010780766,0.00092233927,0.00014726528,0.00039763455,0.005306479,0.00037576855,0.00013136647],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000011176103,0.00041623355,0.016736852,0.00004055545,0.00006991619,0.000002349604,0.0068816068,0.0020308627,0.0004892982,0.4745312,0.0010564642,0.49773347],"study_design_scores_gemma":[0.0007152919,0.000109813336,0.056066427,0.00016115753,0.00000625425,0.0000269258,0.000061144005,0.88107365,0.0003543807,0.058914844,0.0022213086,0.00028878992],"about_ca_topic_score_codex":0.00013717983,"about_ca_topic_score_gemma":0.00003650592,"teacher_disagreement_score":0.8790428,"about_ca_system_score_codex":0.00006102263,"about_ca_system_score_gemma":0.00009781031,"threshold_uncertainty_score":0.99784607},"labels":[],"label_agreement":null},{"id":"W2767997490","doi":"10.1016/j.laa.2017.11.002","title":"Bounds on polynomial roots using intercyclic companion matrices","year":2017,"lang":"en","type":"article","venue":"Linear Algebra and its Applications","topic":"Polynomial and algebraic computation","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Redeemer University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Companion matrix; Polynomial; Matrix polynomial; Algebra over a field; Pure mathematics; Polynomial matrix; Mathematical analysis","score_opus":0.028085377517695912,"score_gpt":0.2960348862209381,"score_spread":0.2679495087032422,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2767997490","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7993962,0.00029267624,0.19522168,0.0022488465,0.00033758383,0.00040310834,0.00001191478,0.00017512549,0.0019128565],"genre_scores_gemma":[0.9946967,0.000035526376,0.0043509183,0.00024408428,0.00045760593,0.000029341623,0.0000070105984,0.000009776567,0.00016904702],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990565,0.000021896767,0.00020541916,0.0003765017,0.00013802804,0.00020166054],"domain_scores_gemma":[0.9990344,0.000064560874,0.00018326071,0.00055366434,0.000045613786,0.00011849322],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00010041069,0.00014046884,0.00014714754,0.000096312164,0.0009919031,0.00050810026,0.00073570985,0.00005915251,0.0000069148696],"category_scores_gemma":[0.00002086949,0.0001301349,0.000048787024,0.00011051544,0.000055133492,0.00051239616,0.0003133801,0.00012072865,0.00011006865],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000033061962,0.0004331967,0.0014581863,0.00007048409,0.00007888113,0.0000057783286,0.00076948624,0.00034109215,0.019723024,0.5572222,0.0016809418,0.41818365],"study_design_scores_gemma":[0.0012474093,0.00019315921,0.056677606,0.000094731346,0.000044218737,0.00005212925,0.000033939275,0.8542084,0.00832003,0.016647268,0.061697274,0.0007838404],"about_ca_topic_score_codex":0.000056248726,"about_ca_topic_score_gemma":0.000008294968,"teacher_disagreement_score":0.8538673,"about_ca_system_score_codex":0.000026079606,"about_ca_system_score_gemma":0.00003930403,"threshold_uncertainty_score":0.7629017},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.03377317848854049,"score_gpt":0.3024417638487448,"score_spread":0.2686685853602043,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2775085189","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15264349,0.02644528,0.6410935,0.034992844,0.008048819,0.021898316,0.0007400453,0.002080819,0.11205688],"genre_scores_gemma":[0.21259151,0.03303517,0.37724072,0.00017626678,0.0037380448,0.004933781,0.0004924362,0.0006390472,0.36715302],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9946867,0.00031992374,0.00094990304,0.0014271128,0.0012180652,0.001398284],"domain_scores_gemma":[0.9964941,0.0003480243,0.000048970327,0.0017537773,0.001001386,0.00035373677],"candidate_categories":["metaepi_narrow","sts","scholarly_communication","research_integrity"],"consensus_categories":[],"category_scores_codex":[0.0031050695,0.00059878075,0.00072523643,0.002716955,0.0019945495,0.0031056076,0.0021292765,0.00056552497,0.000036459183],"category_scores_gemma":[0.0039934865,0.0006684707,0.00007157498,0.0011991471,0.0011537932,0.004385454,0.0039377483,0.0027843376,0.00001894602],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009330282,0.00014455612,0.000098991375,0.00037718628,0.00003952947,0.0001882103,0.004469658,0.440411,0.0005109522,0.5441298,0.0007970393,0.008739782],"study_design_scores_gemma":[0.0022227839,0.0011855097,0.0048085153,0.0021344165,0.000010992379,0.00012007585,0.00036346746,0.8963231,0.001125383,0.012506749,0.077023566,0.0021754552],"about_ca_topic_score_codex":0.0006931054,"about_ca_topic_score_gemma":0.007749889,"teacher_disagreement_score":0.53162307,"about_ca_system_score_codex":0.0007750641,"about_ca_system_score_gemma":0.0020187742,"threshold_uncertainty_score":0.9995766},"labels":[],"label_agreement":null},{"id":"W2777059928","doi":"10.1007/978-3-319-72453-9_13","title":"Jordan Canonical Form with Parameters from Frobenius Form with Parameters","year":2017,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Polynomial and algebraic computation","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"","keywords":"Canonical form; Symbolic computation; Algebra over a field; Generality; Matrix (chemical analysis); Computer science; Computation; Square matrix; Theoretical computer science; Algorithm; Mathematics; Pure mathematics; Symmetric matrix","score_opus":0.016118364746580384,"score_gpt":0.22829912144853787,"score_spread":0.2121807567019575,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2777059928","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.013471624,0.0001395045,0.98163855,0.00092424825,0.0011910277,0.00060389267,0.000018062501,0.00020109654,0.0018119864],"genre_scores_gemma":[0.4363861,0.000015253469,0.5619373,0.0010743524,0.00026508555,0.000021148146,0.000019794277,0.000052512274,0.00022848987],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9947346,0.000031898,0.0005837549,0.0022214407,0.0013669712,0.0010613693],"domain_scores_gemma":[0.99569947,0.00071266876,0.00065936655,0.0023068425,0.00020867988,0.0004129911],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.00045368393,0.00088090263,0.0008992135,0.00054608035,0.0006015279,0.0015923257,0.0048168967,0.00034106176,0.00000995725],"category_scores_gemma":[0.00005721291,0.00063865853,0.00017528103,0.00030052,0.0013706883,0.0013808415,0.0011967183,0.0010545494,0.000032986576],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000103305116,0.000054219494,0.00021174124,0.000030037985,0.00008883712,0.00037634475,0.0015297917,0.025684033,0.000036675847,0.0064823157,0.00003822192,0.96536446],"study_design_scores_gemma":[0.0022658552,0.0019659034,0.0014501592,0.0016717953,0.00008534543,0.0003276394,0.0000011459506,0.5716281,0.0032682442,0.41282803,0.0017444147,0.0027633435],"about_ca_topic_score_codex":0.00097282825,"about_ca_topic_score_gemma":0.0034320713,"teacher_disagreement_score":0.9626011,"about_ca_system_score_codex":0.00059348164,"about_ca_system_score_gemma":0.0014803272,"threshold_uncertainty_score":0.9996065},"labels":[],"label_agreement":null},{"id":"W2781905375","doi":"10.1145/3177795.3177798","title":"The polyhedra library in m <scp>aple</scp>","year":2018,"lang":"en","type":"article","venue":"ACM communications in computer algebra","topic":"Polynomial and algebraic computation","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"","keywords":"Polyhedron; Integer (computer science); Integer programming; Combinatorics; Computer science; Presburger arithmetic; Loop (graph theory); Parametric statistics; Integer points in convex polyhedra; Discrete mathematics; Mathematics; Theoretical computer science; Algorithm; Branch and price; Programming language; Statistics","score_opus":0.02492440184752486,"score_gpt":0.27319472175174525,"score_spread":0.24827031990422038,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2781905375","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4030072,0.004879629,0.49266517,0.078721225,0.0033425328,0.0014112506,0.000010920614,0.0015642974,0.014397764],"genre_scores_gemma":[0.8331858,0.00033518978,0.16393335,0.0019676026,0.0002946895,0.00006490454,0.000014812964,0.000021852133,0.00018178347],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9977728,0.0004421375,0.0005951837,0.00044361336,0.00023476663,0.00051147805],"domain_scores_gemma":[0.9915616,0.003292528,0.00015831857,0.00482193,0.00006487188,0.000100770674],"candidate_categories":["open_science"],"consensus_categories":[],"category_scores_codex":[0.00055084337,0.00021626215,0.00021518998,0.00031542266,0.0005283168,0.000567287,0.010074425,0.00009234118,0.0000045646148],"category_scores_gemma":[0.00022646197,0.00018432098,0.00007613081,0.0017093638,0.00039979315,0.0011292453,0.006774821,0.0004521647,0.00018378551],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000046025766,0.0003420665,0.0076751877,0.000008264333,0.000031533134,0.0000146284365,0.0058793165,0.00012944931,0.000060360726,0.3689843,0.022027059,0.5948432],"study_design_scores_gemma":[0.0009432796,0.00018379767,0.0993317,0.000113939655,0.000004700298,0.00004619255,0.000117069,0.46589515,0.00045581989,0.28408974,0.14856209,0.00025653152],"about_ca_topic_score_codex":0.00010131101,"about_ca_topic_score_gemma":0.00041545983,"teacher_disagreement_score":0.5945867,"about_ca_system_score_codex":0.00006848965,"about_ca_system_score_gemma":0.00019630362,"threshold_uncertainty_score":0.9952815},"labels":[{"model":"gemma","categories":[],"domain":null,"study_design":"not_applicable","genre":"methods","about_ca_system":false,"about_ca_topic":false,"confidence":"high"},{"model":"gpt","categories":[],"domain":null,"study_design":"not_applicable","genre":"software","about_ca_system":false,"about_ca_topic":false,"confidence":"high"}],"label_agreement":"agree"},{"id":"W2782078086","doi":"10.1145/3177795.3177799","title":"<b>CUMODP</b>","year":2018,"lang":"en","type":"article","venue":"ACM communications in computer algebra","topic":"Polynomial and algebraic computation","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"","keywords":"CUDA; Computer science; Modular design; Solver; Graphics; Floating point; Integer (computer science); Modular arithmetic; Polynomial; Parallel computing; Software; Double-precision floating-point format; Computational science; Mathematics; Computer graphics (images); Programming language","score_opus":0.03904536777839753,"score_gpt":0.3033831524561591,"score_spread":0.2643377846777616,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2782078086","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.037048895,0.00029192585,0.9463821,0.011441883,0.0007589476,0.00022657927,0.0000014404891,0.00047649772,0.0033717114],"genre_scores_gemma":[0.6027355,0.000033582295,0.3958142,0.0011568784,0.0001889608,0.000021502925,0.000006471283,0.000008524512,0.000034360546],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99843824,0.00020382144,0.00041034864,0.0004142115,0.00019576344,0.00033762894],"domain_scores_gemma":[0.9941854,0.00045801248,0.00010552236,0.0050250157,0.00013435225,0.00009171596],"candidate_categories":["open_science"],"consensus_categories":[],"category_scores_codex":[0.0003916426,0.0001713471,0.00018970382,0.00028764675,0.00028942004,0.00021524975,0.0075050127,0.00006984236,0.000018579512],"category_scores_gemma":[0.000072348295,0.00017773909,0.000066829416,0.0010336192,0.00025245512,0.0006629162,0.004964471,0.00024880902,0.00046730283],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000037388643,0.00021867892,0.001403188,0.0000048130355,0.00001697739,0.000003878575,0.0017786754,0.00004138125,0.00014574356,0.30291718,0.0038566482,0.6896091],"study_design_scores_gemma":[0.00076030055,0.00020040403,0.033287708,0.00006643478,0.000005193712,0.0000409307,0.000012490084,0.6596662,0.0005413337,0.27206004,0.032864343,0.00049462455],"about_ca_topic_score_codex":0.000071928036,"about_ca_topic_score_gemma":0.00011289102,"teacher_disagreement_score":0.6891145,"about_ca_system_score_codex":0.00007719807,"about_ca_system_score_gemma":0.0000950649,"threshold_uncertainty_score":0.99786484},"labels":[],"label_agreement":null},{"id":"W2782552566","doi":"10.1109/synasc.2017.00017","title":"Resolving Zero Divisors Using Hensel Lifting","year":2017,"lang":"en","type":"preprint","venue":"","topic":"Polynomial and algebraic computation","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Modulo; Univariate; Zero (linguistics); Rational number; Mathematics; Modular design; Maple; Algebraic number; Set (abstract data type); Algebra over a field; Discrete mathematics; Algorithm; Computer science; Pure mathematics; Programming language; Multivariate statistics","score_opus":0.056313852142447884,"score_gpt":0.2951368784466205,"score_spread":0.23882302630417263,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2782552566","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13557683,0.00019364299,0.85538626,0.00062804983,0.0020478915,0.00015064848,0.0000015764834,0.0003573522,0.005657768],"genre_scores_gemma":[0.78276634,0.000009066215,0.21615648,0.00018858233,0.00033539522,0.000002623459,0.000003710413,0.000015566344,0.00052224216],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99819684,0.00006529752,0.00033719876,0.00072986656,0.00030191938,0.0003689072],"domain_scores_gemma":[0.99809086,0.00010527358,0.00040964203,0.0011929988,0.00008567809,0.000115566596],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.00040992856,0.0002648345,0.00030472595,0.00014782647,0.0004968734,0.0012576001,0.001977159,0.00017475935,0.0000083224895],"category_scores_gemma":[0.00014190759,0.00025189295,0.0001562784,0.00007037869,0.000042971333,0.00039350646,0.0050294027,0.00045062092,0.000036221318],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000015568135,0.0002020065,0.0019171574,0.0005410859,0.00027793887,0.0002579695,0.00932283,0.054337498,0.004137835,0.15233183,0.006777313,0.76988095],"study_design_scores_gemma":[0.00013469397,0.000011900451,0.0012889524,0.00028494772,0.00001122499,0.00001290112,0.000007528032,0.88040257,0.0004155885,0.11636334,0.0006092137,0.0004571259],"about_ca_topic_score_codex":0.00065014395,"about_ca_topic_score_gemma":0.000010850766,"teacher_disagreement_score":0.82606506,"about_ca_system_score_codex":0.00008233303,"about_ca_system_score_gemma":0.0002451691,"threshold_uncertainty_score":0.9999933},"labels":[],"label_agreement":null},{"id":"W2788877415","doi":"10.1016/j.jsc.2020.09.008","title":"Solving determinantal systems using homotopy techniques","year":2020,"lang":"en","type":"preprint","venue":"Journal of Symbolic Computation","topic":"Polynomial and algebraic computation","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada; Agence Nationale de la Recherche; National Science Foundation","keywords":"Mathematics; Combinatorics; Polynomial; Homotopy; Algebraic number; Field (mathematics); Closure (psychology); Matching (statistics); Discrete mathematics; Pure mathematics; Mathematical analysis","score_opus":0.037194602030137164,"score_gpt":0.29541361783777026,"score_spread":0.25821901580763307,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2788877415","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.18834774,0.00051338633,0.8076811,0.00037000398,0.0025937771,0.00026661876,0.0000032515295,0.00012682774,0.00009732865],"genre_scores_gemma":[0.8706477,0.000033854154,0.12785137,0.00008213089,0.0013494081,0.0000036363365,0.0000043450427,0.000022134527,0.000005403744],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9973746,0.00019234595,0.001178273,0.00038076716,0.00061623665,0.0002577708],"domain_scores_gemma":[0.9970479,0.00013514838,0.0019338399,0.00023721249,0.00045949206,0.0001864283],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0005327798,0.00031526032,0.0006992046,0.00048514994,0.00013123127,0.0006939216,0.0010322505,0.0002079322,0.0000011470852],"category_scores_gemma":[0.000065436805,0.00030183917,0.00030692527,0.00032173132,0.00003671504,0.0006040466,0.00089186337,0.00074344187,0.0000048627835],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000084867,0.0003593564,0.0005526012,0.0014866241,0.0004813882,0.00095873856,0.008956628,0.18420897,0.026219415,0.008701301,0.0018190375,0.7661711],"study_design_scores_gemma":[0.00025809795,0.00018287369,0.00094131083,0.00091037847,0.00005919882,0.0008342309,0.000042385123,0.97482336,0.0017092556,0.019689007,0.00019558548,0.00035434964],"about_ca_topic_score_codex":0.000067751906,"about_ca_topic_score_gemma":7.8649197e-7,"teacher_disagreement_score":0.79061437,"about_ca_system_score_codex":0.00027500477,"about_ca_system_score_gemma":0.0005929086,"threshold_uncertainty_score":0.9999434},"labels":[],"label_agreement":null},{"id":"W2790192008","doi":"","title":"The characteristic polynomial of a graph operation and its applications.","year":2018,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Polynomial and algebraic computation","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Graph; Polynomial; Discrete mathematics; Mathematical analysis","score_opus":0.008158187389801013,"score_gpt":0.22947226256763553,"score_spread":0.22131407517783452,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2790192008","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9826546,0.00029559704,0.013796351,0.0010896072,0.0012490123,0.00032852808,0.0000021694916,0.000068818204,0.00051534554],"genre_scores_gemma":[0.99956113,0.000021102036,0.0002500083,0.000064760985,0.000032705466,0.000028155759,0.000001295482,0.0000032933497,0.0000375393],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99941605,0.000036397385,0.00016680227,0.00016295303,0.000104704064,0.00011308847],"domain_scores_gemma":[0.9994687,0.00011423359,0.000085773645,0.00020560225,0.00008326129,0.000042437627],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00017301008,0.00006523843,0.00007743792,0.000036048805,0.0002668091,0.00009322721,0.00032382848,0.000026248576,0.00000196499],"category_scores_gemma":[0.000025088248,0.000050017676,0.000019894016,0.00016363035,0.00007610469,0.00019903854,0.00012190691,0.000044298708,0.000026770735],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000064070687,0.0000234792,0.000082054685,0.000004307765,0.0000071989316,1.8166293e-7,0.00022289202,3.973465e-7,0.0037185661,0.96224433,0.0002886813,0.033401486],"study_design_scores_gemma":[0.0014813126,0.000574997,0.046662398,0.000027904951,0.000020777747,0.000022474702,0.000032317406,0.056434736,0.036182195,0.84474635,0.0134053575,0.00040916345],"about_ca_topic_score_codex":0.000009205505,"about_ca_topic_score_gemma":0.000002552499,"teacher_disagreement_score":0.11749798,"about_ca_system_score_codex":0.00001042785,"about_ca_system_score_gemma":0.00004048108,"threshold_uncertainty_score":0.20521069},"labels":[],"label_agreement":null},{"id":"W2795340484","doi":"10.1112/plms.12268","title":"Projective duals to algebraic and tropical hypersurfaces","year":2019,"lang":"en","type":"article","venue":"Proceedings of the London Mathematical Society","topic":"Polynomial and algebraic computation","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Dual polyhedron; Algebraic curve; Projective variety; Projective test; Duality (order theory); Variety (cybernetics); Algebraic number; Real projective plane; Transformation (genetics)","score_opus":0.008191380799601935,"score_gpt":0.22015500463325707,"score_spread":0.21196362383365513,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2795340484","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.99076366,0.000029251594,0.0037880468,0.003680645,0.00008579785,0.00047746237,6.776151e-7,0.00006153834,0.0011129347],"genre_scores_gemma":[0.9604533,0.0000032945236,0.03867693,0.0004280258,0.000028642677,0.000014103644,4.9304298e-8,0.000006965871,0.00038874472],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989995,0.000004906581,0.00021181542,0.00028086003,0.00030069923,0.00020226499],"domain_scores_gemma":[0.9994802,0.00013117107,0.0001001767,0.00011384443,0.000094434865,0.000080168094],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00020455976,0.000119062555,0.00022477447,0.000017106582,0.000074101335,0.000098891556,0.00054348726,0.000055903492,0.000009993072],"category_scores_gemma":[0.00010530955,0.00007456064,0.00013149646,0.00031503264,0.00007136021,0.0002574028,0.00056999293,0.00011667196,0.000036607948],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000019036268,0.00018598748,0.008231319,0.0005533286,0.00008593107,1.0207477e-7,0.013010437,0.000011425499,0.057481717,0.91081333,0.0032752396,0.0063321306],"study_design_scores_gemma":[0.0014551351,0.000554113,0.06311178,0.00041867635,0.000054754273,0.000044426455,0.0014668511,0.07426687,0.10080203,0.75614655,0.0009999006,0.0006789311],"about_ca_topic_score_codex":0.0000024921378,"about_ca_topic_score_gemma":8.523726e-8,"teacher_disagreement_score":0.15466681,"about_ca_system_score_codex":0.00002726281,"about_ca_system_score_gemma":0.000021541931,"threshold_uncertainty_score":0.30404946},"labels":[],"label_agreement":null},{"id":"W2799024692","doi":"10.1080/00927872.2018.1539173","title":"Newtonian valued differential fields with arbitrary value group","year":2019,"lang":"en","type":"article","venue":"Communications in Algebra","topic":"Polynomial and algebraic computation","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Differential algebra; Equivalence (formal languages); Uniqueness; Differential (mechanical device); Group (periodic table); Algebraic differential equation; Algebraic number; Differential algebraic geometry","score_opus":0.014830480996174806,"score_gpt":0.24713886012263883,"score_spread":0.23230837912646402,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2799024692","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.69096684,0.00035522997,0.29106298,0.00464857,0.00037195557,0.00047921122,0.0000020765542,0.000268329,0.011844825],"genre_scores_gemma":[0.9460523,0.0000316204,0.053109862,0.0005299957,0.000028344051,0.000034202436,0.00002059811,0.000010626356,0.00018243016],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99883276,0.00017104505,0.00026299764,0.00030779568,0.00018405849,0.00024134724],"domain_scores_gemma":[0.9974003,0.00019066663,0.00008891852,0.0022193182,0.000030489184,0.000070315466],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00015207542,0.00014560281,0.00017910957,0.00016711188,0.00012756881,0.00013899074,0.0024729269,0.00007409099,0.000040274645],"category_scores_gemma":[0.00001255383,0.00013007139,0.000045134395,0.000545015,0.000079202815,0.00046849213,0.000821486,0.00034335424,0.00013314867],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000150234755,0.00027114002,0.0066609737,0.000015630603,0.000025175734,0.0000031299235,0.00090941257,0.00016583237,0.00044063278,0.96096796,0.00016626623,0.030358842],"study_design_scores_gemma":[0.0029980994,0.0005145445,0.22867781,0.00027065058,0.00002215153,0.00004379026,0.000108402906,0.59892815,0.00060973107,0.16227107,0.0046241167,0.00093151303],"about_ca_topic_score_codex":0.00011853954,"about_ca_topic_score_gemma":0.000112315254,"teacher_disagreement_score":0.7986969,"about_ca_system_score_codex":0.00005110681,"about_ca_system_score_gemma":0.000081521765,"threshold_uncertainty_score":0.5304158},"labels":[],"label_agreement":null},{"id":"W2807401712","doi":"10.5539/jmr.v10n4p49","title":"Reproduction of Fuchs Relation for the Group $S_4^{SL_2}$ by Using Groebner Bases","year":2018,"lang":"en","type":"article","venue":"Journal of Mathematics Research","topic":"Polynomial and algebraic computation","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Invariant (physics); Gröbner basis; Pure mathematics; Group (periodic table); Galois group; Invariant theory; Polynomial; Algebra over a field; Order (exchange); Relation (database); Combinatorics; Mathematical analysis; Mathematical physics","score_opus":0.1485802392700331,"score_gpt":0.39874652401192956,"score_spread":0.25016628474189645,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2807401712","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15054935,0.00025255873,0.8471192,0.0014104132,0.00033997596,0.0002087006,0.0000012571228,0.000006724488,0.0001118307],"genre_scores_gemma":[0.8903206,0.00003120361,0.10873035,0.000020797426,0.00069780706,0.000004095935,5.213102e-7,0.000009754994,0.00018486465],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983943,0.00012256432,0.00048288028,0.00013264325,0.00069011515,0.00017746686],"domain_scores_gemma":[0.9972906,0.0010172619,0.00040999975,0.00032505367,0.0009107491,0.000046346227],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004840699,0.00006150686,0.00014556888,0.00019358465,0.00023922317,0.00009346465,0.0005334355,0.000037082867,0.000009613945],"category_scores_gemma":[0.0009665845,0.000038991286,0.00008190121,0.0004115524,0.00013235919,0.00042066924,0.000118023265,0.00018432467,0.0000038344415],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00026858842,0.0016184951,0.00028050976,0.00070281385,0.0003405954,0.0000077050645,0.012757537,0.0016467088,0.32629028,0.18791524,0.056577414,0.41159412],"study_design_scores_gemma":[0.0008057732,0.0011699745,0.00042894526,0.00025687378,0.000034720633,0.00018626073,0.0005878002,0.79548675,0.06558806,0.128303,0.0070060156,0.00014579593],"about_ca_topic_score_codex":0.000015598434,"about_ca_topic_score_gemma":0.0000020469515,"teacher_disagreement_score":0.79384005,"about_ca_system_score_codex":0.00006129246,"about_ca_system_score_gemma":0.00009058995,"threshold_uncertainty_score":0.18399355},"labels":[],"label_agreement":null},{"id":"W2808749144","doi":"10.1145/3208976.3208980","title":"An Efficient Algorithm for Computing Parametric Multivariate Polynomial GCD","year":2018,"lang":"en","type":"article","venue":"","topic":"Polynomial and algebraic computation","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"Chinese Academy of Sciences Key Project; National Natural Science Foundation of China; National Science Foundation","keywords":"Gröbner basis; Quotient; Mathematics; Parametric statistics; Ideal (ethics); Polynomial; Generator (circuit theory); Algorithm; Discrete mathematics; Combinatorics; Power (physics); Mathematical analysis","score_opus":0.017469084761623413,"score_gpt":0.28719882580559725,"score_spread":0.26972974104397385,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2808749144","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08691778,0.0000103315815,0.91062474,0.00017924482,0.00124063,0.0002709887,0.0000034535212,0.000333363,0.00041946553],"genre_scores_gemma":[0.58502704,9.729985e-8,0.41408947,0.00025399652,0.0005589683,0.0000042156194,0.0000031166703,0.0000063471434,0.000056728317],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985855,0.00005292887,0.00026755905,0.00050502527,0.00018432885,0.00040461335],"domain_scores_gemma":[0.99901134,0.00022673515,0.000100465055,0.00035745715,0.00014531495,0.00015866256],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00038676994,0.00015151844,0.0001637823,0.00020650022,0.00031434264,0.00024980327,0.0006867154,0.000056463465,0.000011034282],"category_scores_gemma":[0.00004219898,0.00013138805,0.000076713615,0.0006017105,0.000058690675,0.0002242451,0.00017811936,0.00006461805,0.00007923485],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000006537037,0.00013781151,0.000017783424,0.0000024654485,0.000010563171,0.0000011036083,0.0003963813,0.0015337216,0.00054396776,0.0061407858,0.00057756127,0.99063134],"study_design_scores_gemma":[0.0006963037,0.00036059786,0.002030689,0.000005004682,0.000004022357,0.0000062734257,0.0000138893265,0.99106014,0.0039712735,0.00057667197,0.0010733039,0.00020184234],"about_ca_topic_score_codex":0.00015033627,"about_ca_topic_score_gemma":0.000004669887,"teacher_disagreement_score":0.99042946,"about_ca_system_score_codex":0.000046949215,"about_ca_system_score_gemma":0.0000725778,"threshold_uncertainty_score":0.5357849},"labels":[],"label_agreement":null},{"id":"W2808956377","doi":"10.1145/3208976.3209024","title":"Computing Nearby Non-trivial Smith Forms","year":2018,"lang":"en","type":"article","venue":"","topic":"Polynomial and algebraic computation","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Matrix polynomial; Computation; Polynomial matrix; Robustness (evolution); Matrix (chemical analysis); Polynomial; Computer science; Rank (graph theory); Maple; Algorithm; Characteristic polynomial; Mathematics; Algebra over a field; Pure mathematics; Combinatorics; Mathematical analysis","score_opus":0.010344850210964608,"score_gpt":0.2403479700018728,"score_spread":0.2300031197909082,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2808956377","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1625946,0.0000060019306,0.8071807,0.00048602716,0.00054330484,0.00006719355,1.8126039e-7,0.00020480341,0.02891716],"genre_scores_gemma":[0.9531595,3.6446744e-7,0.04512411,0.0006206172,0.00052477256,8.251387e-7,5.62759e-7,0.0000043203286,0.0005648913],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999172,0.000012241995,0.00015512295,0.00025107918,0.00015299156,0.00025657407],"domain_scores_gemma":[0.99953234,0.000044401182,0.000049543884,0.00023397808,0.00005817025,0.00008157021],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00015322537,0.00009057523,0.00009571957,0.00005995463,0.00018611454,0.00016801592,0.0004995513,0.00003103554,0.000025318468],"category_scores_gemma":[0.000012002006,0.000069631686,0.00004261673,0.0002951009,0.000050239178,0.00035597844,0.00030987718,0.00006159573,0.00045368442],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008993408,0.000069398535,0.0009063493,0.000009265892,0.000018045299,0.000008070357,0.0014935927,0.000066544286,0.0011283308,0.11807222,0.010314332,0.86790484],"study_design_scores_gemma":[0.00052549154,0.00025563966,0.014921267,0.000017750703,0.000002404531,0.000020693353,0.000016369724,0.9529174,0.008721827,0.012378836,0.009963,0.00025933798],"about_ca_topic_score_codex":0.00004632772,"about_ca_topic_score_gemma":0.000010346528,"teacher_disagreement_score":0.9528508,"about_ca_system_score_codex":0.00002009216,"about_ca_system_score_gemma":0.00006802885,"threshold_uncertainty_score":0.58313465},"labels":[],"label_agreement":null},{"id":"W2883719596","doi":"10.1007/978-3-319-96418-8_43","title":"Sparse Multivariate Hensel Lifting: A High-Performance Design and Implementation","year":2018,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Polynomial and algebraic computation","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Computer science; Monic polynomial; Multivariate statistics; Polynomial; Bivariate analysis; Parallel computing; Algorithm; Theoretical computer science; Mathematics; Machine learning","score_opus":0.023309093992908318,"score_gpt":0.25913856101177296,"score_spread":0.23582946701886465,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2883719596","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009767216,0.000111125795,0.98763555,0.0004216786,0.001268662,0.00050042593,0.0000024020947,0.00015522754,0.00013770103],"genre_scores_gemma":[0.43243712,0.000030503412,0.5663375,0.00066465384,0.0004252471,0.000009128634,0.000004483421,0.000020821106,0.000070514776],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9969895,0.000051182615,0.00049341604,0.0012933245,0.0005985895,0.000574021],"domain_scores_gemma":[0.99831605,0.0003720559,0.0003198557,0.00064739585,0.00018281235,0.00016184174],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00095133355,0.00044601527,0.0003791995,0.0005639686,0.00034351222,0.0005437047,0.0013423016,0.00017639098,0.000025011663],"category_scores_gemma":[0.00003344968,0.0004101285,0.00004557106,0.00041263291,0.00044450266,0.00082989095,0.0009912128,0.00036559274,0.00005169995],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000012497398,0.000016160819,0.000039422408,0.000032826047,0.000012198064,0.000020466146,0.0019788921,0.012635934,0.00044489084,0.0073999637,0.000034537865,0.9773722],"study_design_scores_gemma":[0.00055419747,0.000390693,0.0012381705,0.00022756084,0.000009476788,0.00005573463,2.6739139e-7,0.8586777,0.004342746,0.13359858,0.00029481627,0.0006100948],"about_ca_topic_score_codex":0.00006313676,"about_ca_topic_score_gemma":0.000026856342,"teacher_disagreement_score":0.9767621,"about_ca_system_score_codex":0.00017668886,"about_ca_system_score_gemma":0.00038771375,"threshold_uncertainty_score":0.9998351},"labels":[],"label_agreement":null},{"id":"W2888696717","doi":"10.1007/978-3-319-99639-4_3","title":"Sparse Polynomial Arithmetic with the BPAS Library","year":2018,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Polynomial and algebraic computation","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"","keywords":"Remainder; Division (mathematics); Computer science; Computation; Representation (politics); Polynomial; Arithmetic; Algorithm; Division algorithm; Theoretical computer science; Algebra over a field; Mathematics; Pure mathematics","score_opus":0.011500431848715995,"score_gpt":0.208298807014318,"score_spread":0.196798375165602,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2888696717","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0005313822,0.00025551813,0.98350877,0.007241288,0.0019134721,0.00038937852,0.0000045125526,0.00024576698,0.005909921],"genre_scores_gemma":[0.3799369,0.000048640064,0.58865666,0.01617151,0.008271476,0.00003766444,0.000018372708,0.00016562775,0.006693121],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9966983,0.000051107374,0.00037549456,0.001367914,0.00084620225,0.00066097424],"domain_scores_gemma":[0.9975318,0.00051747006,0.0002820295,0.0013708832,0.00011425332,0.00018361773],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.00047969786,0.0005334479,0.00041415734,0.00054529833,0.00045403998,0.0013150002,0.004297814,0.00018845884,0.00008000574],"category_scores_gemma":[0.000024733812,0.00034216998,0.00011307058,0.0006070001,0.001886225,0.0010396756,0.0016356572,0.0007065152,0.00015400743],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003229226,0.000044168566,0.000023565935,0.000027866987,0.00003221978,0.00015046778,0.0029630037,0.0071626976,0.00003745625,0.03262669,0.0022707505,0.9546288],"study_design_scores_gemma":[0.0009811502,0.0012261434,0.0003935491,0.0006750747,0.00004039137,0.000419976,9.422847e-7,0.6698558,0.002146019,0.227704,0.094476305,0.002080676],"about_ca_topic_score_codex":0.000020189216,"about_ca_topic_score_gemma":0.00007308733,"teacher_disagreement_score":0.95254815,"about_ca_system_score_codex":0.00011247638,"about_ca_system_score_gemma":0.00086155446,"threshold_uncertainty_score":0.999903},"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,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_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","score_opus":0.006157845147717344,"score_gpt":0.2036365323705605,"score_spread":0.19747868722284317,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2897949163","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.52085173,0.00004815699,0.47794908,0.00014215907,0.0006609041,0.000008363705,1.2509723e-7,0.000009478906,0.0003299894],"genre_scores_gemma":[0.9971645,0.000014685481,0.0021270742,0.00021328103,0.00025818704,2.498889e-7,3.063184e-7,0.0000037563175,0.0002179491],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.999495,0.00005129026,0.00016480139,0.000086747445,0.00012292528,0.000079209756],"domain_scores_gemma":[0.9995231,0.00007353309,0.00019246117,0.00009937678,0.000067529385,0.00004396779],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00014864546,0.00006609708,0.0001283242,0.000054175653,0.000026590455,0.0000631094,0.00020586856,0.000021392867,0.0000044369867],"category_scores_gemma":[0.0000061417118,0.000049781098,0.00005526298,0.000111313646,0.000016201117,0.00052260625,0.00007276539,0.000090321504,0.000004663752],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000011125119,0.000018340723,0.000039284692,0.000002196598,0.00001697554,0.0000022394588,0.00015144987,0.00021909253,0.0003027831,0.85368454,0.00012531994,0.14542665],"study_design_scores_gemma":[0.00031500254,0.00023535767,0.0015409444,0.00003302548,0.0000064782325,0.000054296757,0.000028997983,0.0035411383,0.0068365927,0.9867127,0.0006158039,0.00007968303],"about_ca_topic_score_codex":0.000018944385,"about_ca_topic_score_gemma":0.0000015206135,"teacher_disagreement_score":0.47631276,"about_ca_system_score_codex":0.000025217994,"about_ca_system_score_gemma":0.00002986821,"threshold_uncertainty_score":0.20300142},"labels":[],"label_agreement":null},{"id":"W2901577540","doi":"10.1609/aaai.v33i01.33011435","title":"A SAT+CAS Approach to Finding Good Matrices: New Examples and Counterexamples","year":2019,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Polynomial and algebraic computation","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Wilfrid Laurier University; University of Waterloo","funders":"Compute Canada","keywords":"Counterexample; Circulant matrix; Conjecture; Algebraic number; Set (abstract data type); Order (exchange); Enumeration","score_opus":0.08115225128442288,"score_gpt":0.2795572415818648,"score_spread":0.1984049902974419,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2901577540","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.86264366,0.0000661172,0.11929554,0.002297729,0.00041035112,0.00080948183,0.0000054882894,0.00013205229,0.014339599],"genre_scores_gemma":[0.9862711,0.00001845053,0.012906412,0.00027854074,0.00007901863,0.000011152555,5.778601e-7,0.000010087372,0.00042469107],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99827,0.000012831466,0.00041179854,0.0005812659,0.0003950799,0.0003290253],"domain_scores_gemma":[0.9990262,0.00013165217,0.00025418098,0.00024343035,0.00019254847,0.00015198758],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00035264407,0.00021763908,0.000266354,0.00016755203,0.00013367529,0.0004621699,0.00143367,0.0000661023,0.000023871864],"category_scores_gemma":[0.00013168369,0.00016421861,0.000070044785,0.0006450482,0.000075080396,0.00045688346,0.0005679017,0.00017663006,0.00013870052],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003099152,0.000065984925,0.00065953686,0.000054243712,0.000011861005,1.0207585e-7,0.003405934,0.000104327926,0.015420079,0.8888046,0.00016489309,0.091277406],"study_design_scores_gemma":[0.00018777867,0.00085077266,0.006839602,0.0009883832,0.000037642163,0.00003739364,0.0025617066,0.22738951,0.23913911,0.5191102,0.0017481154,0.0011097853],"about_ca_topic_score_codex":0.0001867493,"about_ca_topic_score_gemma":0.0000106128455,"teacher_disagreement_score":0.36969444,"about_ca_system_score_codex":0.00004039577,"about_ca_system_score_gemma":0.00010978006,"threshold_uncertainty_score":0.669664},"labels":[],"label_agreement":null},{"id":"W2904231361","doi":"10.1111/itor.12622","title":"A generalized parametric divisor method for political apportionment","year":2018,"lang":"en","type":"article","venue":"International Transactions in Operational Research","topic":"Polynomial and algebraic computation","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Apportionment; Generalization; Parametric statistics; Mathematics; Computer science; Mathematical optimization; Econometrics; Statistics; Law","score_opus":0.11782807486762138,"score_gpt":0.4530292183096112,"score_spread":0.3352011434419898,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2904231361","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.005931632,0.000012515563,0.97529465,0.015283218,0.0006991956,0.00039924745,0.00002618498,0.000041263527,0.0023120823],"genre_scores_gemma":[0.7507872,0.0000056947474,0.24644522,0.00041632223,0.0003181804,0.00038117537,0.00002332536,0.0000074757286,0.0016154236],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99771833,0.00019768765,0.0003719024,0.00043150556,0.00087076484,0.00040977797],"domain_scores_gemma":[0.9980769,0.0008573854,0.000029033306,0.00019245272,0.00072189927,0.0001223357],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015860805,0.00009973854,0.00011350796,0.00078780745,0.0003092131,0.00027167995,0.00067185523,0.00006432298,0.0003926718],"category_scores_gemma":[0.00027493323,0.00009742123,0.00008182583,0.0008101589,0.00011094151,0.0005047262,0.000046411988,0.00021307614,0.000085621],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000059006758,0.00030993673,0.000117401556,0.000004551289,0.000038264672,0.0000026140126,0.00020184013,0.0026833133,0.000790059,0.93698806,0.0005538468,0.058251116],"study_design_scores_gemma":[0.00094059587,0.00016922386,0.0027232403,0.000013092017,0.0000022495822,0.000019840683,0.000037797774,0.89272225,0.004210963,0.07624619,0.02277226,0.00014229557],"about_ca_topic_score_codex":0.00026536788,"about_ca_topic_score_gemma":0.000093507624,"teacher_disagreement_score":0.8900389,"about_ca_system_score_codex":0.0003786311,"about_ca_system_score_gemma":0.0003512282,"threshold_uncertainty_score":0.42994806},"labels":[],"label_agreement":null},{"id":"W2912066439","doi":"10.1145/1277500","title":"Proceedings of the 2007 international workshop on Symbolic-numeric computation","year":2007,"lang":"en","type":"paratext","venue":"","topic":"Polynomial and algebraic computation","field":"Computer Science","cited_by":18,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Symbolic computation; Symbolic-numeric computation; Computation; The Symbolic; Computer science; Symbolic data analysis; Algebraic number; Polynomial; Symbolic trajectory evaluation; Algorithm; Algebra over a field; Theoretical computer science; Mathematics; Pure mathematics; Model checking","score_opus":0.01615852493625875,"score_gpt":0.27280529550739746,"score_spread":0.2566467705711387,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2912066439","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00476513,0.00011371121,0.26737586,0.0019004183,0.013487353,0.00044668023,0.000010665442,0.00010203223,0.71179813],"genre_scores_gemma":[0.46598664,0.0001267808,0.017325724,0.005053871,0.003635342,0.000039051447,0.000101475795,0.00007668259,0.5076544],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99816626,0.000015012066,0.000466455,0.0004532661,0.0006510691,0.00024795567],"domain_scores_gemma":[0.9988384,0.0001560324,0.00049313274,0.0001824058,0.00026598384,0.00006400984],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00023296819,0.0002527151,0.00027871516,0.000289882,0.00009140508,0.00017971813,0.0015845688,0.00018672603,0.00024509957],"category_scores_gemma":[0.000029995046,0.00017788874,0.00016819731,0.0006748662,0.00006361023,0.00024005365,0.00042583412,0.00035178545,0.0009810594],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000022094482,0.00013686341,0.000029540826,0.0000458017,0.00007402812,8.072468e-7,0.00034969806,0.0025591718,0.00016366462,0.030163603,0.7851839,0.18127081],"study_design_scores_gemma":[0.0020093706,0.00034971567,0.016769996,0.0020186305,0.00006777387,0.00008532522,0.00020335654,0.25570342,0.010052196,0.0138689745,0.6966543,0.0022169612],"about_ca_topic_score_codex":0.00003398152,"about_ca_topic_score_gemma":0.000001779598,"teacher_disagreement_score":0.46122152,"about_ca_system_score_codex":0.000111829344,"about_ca_system_score_gemma":0.00011242838,"threshold_uncertainty_score":0.9997968},"labels":[],"label_agreement":null},{"id":"W2912554709","doi":"10.4171/jems/1108","title":"Sums of squares and quadratic persistence on real projective varieties","year":2021,"lang":"en","type":"preprint","venue":"Journal of the European Mathematical Society","topic":"Polynomial and algebraic computation","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"","keywords":"Mathematics; Subvariety; Invariant (physics); Projective test; Quadratic equation; Homogeneous; Projective space; Combinatorics; Variety (cybernetics); Homogeneous coordinates; Pencil (optics); Integer (computer science); Pure mathematics; Discrete mathematics; Geometry; Computer science","score_opus":0.028957968543146008,"score_gpt":0.2443786010166939,"score_spread":0.2154206324735479,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2912554709","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6998651,0.00031629656,0.28930637,0.002437861,0.00077189505,0.00029872372,0.0000037674083,0.00003134178,0.006968635],"genre_scores_gemma":[0.96394044,0.00008489339,0.035518464,0.000121711484,0.0001769892,8.900161e-7,2.538048e-7,0.000012619182,0.0001437479],"study_design_codex":"qualitative","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.998057,0.00053215533,0.00056663045,0.00020694664,0.00050483434,0.00013241885],"domain_scores_gemma":[0.9981387,0.00039164003,0.00080772105,0.0003748981,0.00021806976,0.00006894517],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012791791,0.00017050952,0.0003956795,0.000025328876,0.000101759964,0.00020744865,0.00094957475,0.000060082686,0.000004071861],"category_scores_gemma":[0.0002608278,0.00010171362,0.0005394623,0.00012509631,0.00017906768,0.0001249738,0.0012936114,0.0006050755,0.0000017645241],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00017443721,0.003209767,0.00077914825,0.011578316,0.003886078,0.00025253228,0.5395402,0.013784711,0.012869517,0.3316731,0.01246921,0.069783024],"study_design_scores_gemma":[0.001859302,0.0014991361,0.06635183,0.0098913405,0.00066795264,0.00067332195,0.012487822,0.2421188,0.005704107,0.65726906,0.00012265104,0.0013546501],"about_ca_topic_score_codex":0.000004054081,"about_ca_topic_score_gemma":3.3343088e-7,"teacher_disagreement_score":0.52705234,"about_ca_system_score_codex":0.000059831193,"about_ca_system_score_gemma":0.00018061574,"threshold_uncertainty_score":0.4147761},"labels":[],"label_agreement":null},{"id":"W2913451037","doi":"10.2140/obs.2019.2.69","title":"Computation of triangular integral bases","year":2019,"lang":"en","type":"article","venue":"The Open Book Series","topic":"Polynomial and algebraic computation","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary; Simon Fraser University","funders":"Division of Mathematical Sciences; Pacific Institute for the Mathematical Sciences","keywords":"Computation; Computer science; Theoretical computer science; Computational science; Programming language","score_opus":0.015583125998144643,"score_gpt":0.2521841933991884,"score_spread":0.23660106740104375,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2913451037","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6725262,0.0009613976,0.22936341,0.013295827,0.0017529293,0.0021360368,0.000008778893,0.00022740668,0.079728],"genre_scores_gemma":[0.9890797,0.000008482785,0.0060567837,0.0005027021,0.000029270974,0.0000073997653,0.000003151069,0.000004541209,0.0043079476],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.999429,0.00007173549,0.00015576347,0.0001362203,0.00011352186,0.00009374958],"domain_scores_gemma":[0.9995188,0.000072603645,0.000097446944,0.00024934826,0.000041586267,0.00002019897],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00023033745,0.000068141766,0.00013247614,0.000027129918,0.000064176835,0.00014939503,0.00092528167,0.00001554082,0.000050040388],"category_scores_gemma":[0.000013917799,0.000044292497,0.000036459358,0.00013611499,0.000047034144,0.0013096142,0.00042878377,0.000045471632,0.000074084506],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001796707,0.00007751327,0.0003274634,0.000039582952,0.00005443453,0.0000037892505,0.0042877668,0.0013702357,0.0060346094,0.7857441,0.0040750382,0.19780582],"study_design_scores_gemma":[0.005761902,0.0025471812,0.031766485,0.00054320315,0.00006467519,0.00013835351,0.0018729985,0.19192792,0.21471947,0.3340798,0.21513562,0.0014423539],"about_ca_topic_score_codex":0.00012385657,"about_ca_topic_score_gemma":0.000009815331,"teacher_disagreement_score":0.45166427,"about_ca_system_score_codex":0.000010513221,"about_ca_system_score_gemma":0.000060929255,"threshold_uncertainty_score":0.18061957},"labels":[],"label_agreement":null},{"id":"W2913719028","doi":"","title":"Proceedings of the 2009 conference on Symbolic numeric computation","year":2009,"lang":"en","type":"article","venue":"","topic":"Polynomial and algebraic computation","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"Wilfrid Laurier University","funders":"","keywords":"Symbolic computation; Computation; Computer science; The Symbolic; Symbolic-numeric computation; Polynomial; Algebraic number; Symbolic data analysis; Theoretical computer science; Algebra over a field; Algorithm; Mathematics; Pure mathematics","score_opus":0.015195617945458062,"score_gpt":0.23565361493054054,"score_spread":0.22045799698508248,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2913719028","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.80569774,0.000015747053,0.11884019,0.007900205,0.00030601324,0.0002717553,7.7319027e-7,0.00019838483,0.066769175],"genre_scores_gemma":[0.9959366,0.000001328454,0.0028506282,0.0008944094,0.000028038297,0.0000012642771,2.6003352e-7,0.0000015444933,0.00028596754],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993639,0.000007987619,0.00015339423,0.00016706329,0.00019131391,0.00011636455],"domain_scores_gemma":[0.99967605,0.00002018018,0.00009970742,0.00008755832,0.000084174004,0.00003234007],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00007000503,0.00007494618,0.0000956887,0.000046680027,0.00006109804,0.00006524084,0.00043829015,0.000022369011,0.000005365599],"category_scores_gemma":[0.000009417093,0.00004850604,0.000041232364,0.00039439698,0.000021637099,0.00020293018,0.000047380272,0.000060842765,0.000019176996],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000004100108,0.00007856413,0.00015154126,0.00000427276,0.0000032163503,1.995687e-7,0.0004267304,0.00028513136,0.006123809,0.7716957,0.001968709,0.21925807],"study_design_scores_gemma":[0.0004618842,0.00044343885,0.2781782,0.0000745636,0.000006153742,0.000014502518,0.00004283725,0.4048148,0.027131489,0.28830022,0.00027352554,0.00025842205],"about_ca_topic_score_codex":0.00001031327,"about_ca_topic_score_gemma":5.546969e-7,"teacher_disagreement_score":0.48339546,"about_ca_system_score_codex":0.000012952825,"about_ca_system_score_gemma":0.00003260003,"threshold_uncertainty_score":0.1978019},"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,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_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","score_opus":0.006862694092006749,"score_gpt":0.2204633578798528,"score_spread":0.21360066378784606,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2914949175","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.76711524,0.00001263922,0.23087601,0.0006665126,0.00073262845,0.000021643664,0.0000010657244,0.000008672349,0.0005655567],"genre_scores_gemma":[0.99867284,0.0000074812565,0.0007453622,0.0003073984,0.0001675585,6.6283314e-7,0.000001934717,0.000005246832,0.000091498165],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992118,0.00007178696,0.00026955287,0.00009867868,0.000249735,0.0000984674],"domain_scores_gemma":[0.9991693,0.00011508874,0.00042187833,0.00015373182,0.000104443636,0.00003559168],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00013792429,0.00008917608,0.00016038243,0.00004924623,0.000039456583,0.000045935907,0.0003828801,0.000028179502,0.00000920409],"category_scores_gemma":[0.000005332713,0.00005856245,0.00012298852,0.00017638582,0.000023329385,0.00037317714,0.000051394305,0.00013509809,0.000008070108],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000051300092,0.00012116066,0.00004378831,0.0000041478384,0.000049244823,0.0000016573345,0.00021510657,0.0021028328,0.004065697,0.95687246,0.0036339832,0.032838605],"study_design_scores_gemma":[0.0010116231,0.0016062413,0.0013508195,0.00021647823,0.000028414333,0.00006806042,0.00010742007,0.02126308,0.34487954,0.6276739,0.001526202,0.00026822463],"about_ca_topic_score_codex":0.00009027875,"about_ca_topic_score_gemma":0.0000038488834,"teacher_disagreement_score":0.34081385,"about_ca_system_score_codex":0.00005945265,"about_ca_system_score_gemma":0.000034779165,"threshold_uncertainty_score":0.23881075},"labels":[],"label_agreement":null},{"id":"W2918756888","doi":"","title":"Formulae for two weighted binomial identities with the falling factorials","year":2018,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Polynomial and algebraic computation","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Falling (accident); Binomial (polynomial); Statistics; Psychology","score_opus":0.014469807073312907,"score_gpt":0.249990376373861,"score_spread":0.2355205693005481,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2918756888","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.87940025,0.000037120164,0.11264163,0.00088786986,0.0058514397,0.00041514696,0.0000036569036,0.00018192701,0.00058094825],"genre_scores_gemma":[0.99651915,0.0000012414987,0.0027337128,0.00019791439,0.00027644078,0.00004125541,0.000003879801,0.000012321047,0.00021406473],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99892247,0.00004669107,0.00019553458,0.00028936745,0.00023603585,0.00030988135],"domain_scores_gemma":[0.99896103,0.00029886205,0.000129293,0.0003492875,0.0001985966,0.00006295177],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00030310842,0.00015149945,0.00016659404,0.00006238217,0.0004536282,0.0003405904,0.0007705647,0.00003962337,0.0000069284793],"category_scores_gemma":[0.000027555052,0.00009773245,0.00006667851,0.00025880485,0.000101337704,0.0005388145,0.00015189275,0.00007646477,0.000036695154],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003930611,0.00003149583,0.00008935376,0.0000065706577,0.000038876075,0.000001418542,0.0010818593,0.000007910203,0.0010424297,0.9872442,0.0038522193,0.0065643573],"study_design_scores_gemma":[0.0024662446,0.00056249317,0.0008483207,0.000023441939,0.000022696535,0.00000755398,0.000047409878,0.016338963,0.019871138,0.9523535,0.0071386155,0.00031962158],"about_ca_topic_score_codex":0.00004984133,"about_ca_topic_score_gemma":0.00003070452,"teacher_disagreement_score":0.11711891,"about_ca_system_score_codex":0.00004509328,"about_ca_system_score_gemma":0.000096743526,"threshold_uncertainty_score":0.39854136},"labels":[],"label_agreement":null},{"id":"W2921056402","doi":"","title":"Subquadratic-Space Query-Efficient Data Structures for Realizable Order Types","year":2017,"lang":"en","type":"article","venue":"Dépôt institutionnel de l'Université libre de Bruxelles (Université Libre de Bruxelles)","topic":"Polynomial and algebraic computation","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Space (punctuation); Order (exchange); Query optimization; Theoretical computer science; Data mining","score_opus":0.02046159161076289,"score_gpt":0.23255362966730764,"score_spread":0.21209203805654475,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2921056402","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13111389,0.00090236234,0.8514079,0.0068195704,0.00088207267,0.00074442633,0.0003144863,0.0006360464,0.007179279],"genre_scores_gemma":[0.90975344,0.00040743107,0.08342482,0.0007067763,0.00052669796,0.000009238319,0.00036967927,0.000072375646,0.004729523],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9965408,0.0001814262,0.00036683248,0.001272407,0.00047670727,0.0011618598],"domain_scores_gemma":[0.9957152,0.00026789572,0.0005364512,0.0025817545,0.00031032795,0.00058837654],"candidate_categories":["metaepi_narrow","sts","scholarly_communication","open_science"],"consensus_categories":[],"category_scores_codex":[0.00052255765,0.0005688816,0.00053299236,0.00044322936,0.003549505,0.0010536411,0.0062654465,0.00041813435,0.000089053094],"category_scores_gemma":[0.00023822417,0.00064082077,0.00025127313,0.0006625662,0.00043049883,0.0031534901,0.002949754,0.00042475478,0.00006815077],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0011651138,0.0004291284,0.0018882557,0.00026369272,0.00046219403,0.0007663387,0.009344566,0.06707374,0.0019774304,0.7736031,0.096929885,0.04609656],"study_design_scores_gemma":[0.007237085,0.00022123067,0.014420442,0.00022525112,0.00026756048,0.00038481757,0.002503218,0.7640643,0.0019526344,0.012104063,0.19519992,0.0014194645],"about_ca_topic_score_codex":0.0018755976,"about_ca_topic_score_gemma":0.00062448706,"teacher_disagreement_score":0.77863955,"about_ca_system_score_codex":0.00058111333,"about_ca_system_score_gemma":0.0016414111,"threshold_uncertainty_score":0.9999834},"labels":[],"label_agreement":null},{"id":"W2921127985","doi":"10.1007/s11464-019-0760-1","title":"On multivariable Zassenhaus formula","year":2019,"lang":"en","type":"article","venue":"Frontiers of Mathematics in China","topic":"Polynomial and algebraic computation","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"York University","funders":"","keywords":"Multivariable calculus; Recursion (computer science); Algebra over a field; Calculus (dental)","score_opus":0.006157789649672317,"score_gpt":0.2201297560481151,"score_spread":0.2139719663984428,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2921127985","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4326704,0.000042663916,0.55597705,0.00014271571,0.00067459623,0.00019285874,0.0000012014568,0.000039582115,0.0102589335],"genre_scores_gemma":[0.75442594,0.0000022711222,0.24505712,0.000027377497,0.000011008128,0.0000029873001,8.6649555e-7,0.0000056084236,0.00046684203],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991876,0.000016889364,0.00025611778,0.00017784149,0.00019751221,0.00016407289],"domain_scores_gemma":[0.99933976,0.00010673216,0.0001337355,0.0003709051,0.00001652011,0.000032359567],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00025257314,0.000097563134,0.00021694259,0.0001367508,0.00001877648,0.000025631063,0.0004932897,0.00004528159,0.000009927909],"category_scores_gemma":[0.000067405614,0.00008441004,0.00004908653,0.00019585202,0.0000139212,0.00019513455,0.000108411376,0.00009987154,0.000047576872],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000016889204,0.00078343146,0.0019521811,0.00020668871,0.00003626097,0.0000063087487,0.005049564,0.006358985,0.0012685697,0.9557424,0.012726828,0.015851887],"study_design_scores_gemma":[0.00059524394,0.00010999259,0.002298789,0.00008882894,0.0000022873023,0.0000023453133,0.00005544358,0.5812883,0.0030419803,0.41217205,0.00020190653,0.00014289263],"about_ca_topic_score_codex":0.000015947178,"about_ca_topic_score_gemma":0.0000012773419,"teacher_disagreement_score":0.57492924,"about_ca_system_score_codex":0.000039731825,"about_ca_system_score_gemma":0.000029323159,"threshold_uncertainty_score":0.34421417},"labels":[],"label_agreement":null},{"id":"W2921763576","doi":"10.1142/s021819671950036x","title":"Polynomial-time tests for difference terms in idempotent varieties","year":2019,"lang":"en","type":"article","venue":"International Journal of Algebra and Computation","topic":"Polynomial and algebraic computation","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"","keywords":"Idempotence; Variety (cybernetics); Idempotent matrix; Algebra over a field; Term (time); Incidence algebra","score_opus":0.010669204357749559,"score_gpt":0.2602329400250152,"score_spread":0.2495637356672656,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2921763576","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7360181,0.000080390215,0.260808,0.0018323809,0.0010009562,0.00012879369,0.00000191172,0.000015554628,0.00011389921],"genre_scores_gemma":[0.9895141,0.000014345634,0.009886147,0.00029365707,0.00017416307,0.0000030855285,0.000004867529,0.0000057494203,0.00010385044],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988703,0.000041408653,0.00045914805,0.00017963961,0.00031778772,0.00013169336],"domain_scores_gemma":[0.9989904,0.0003018317,0.00033358793,0.0000681512,0.00024684347,0.000059142014],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00028486855,0.00011118613,0.00019561913,0.00029847806,0.000028863486,0.00020600691,0.00045923045,0.000044209024,0.0000056285694],"category_scores_gemma":[0.000052353218,0.00009780486,0.00007639687,0.000110225716,0.000023055729,0.0005591606,0.00010480416,0.00010186376,0.000010273498],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0004739498,0.0004286337,0.022726668,0.000053459356,0.0002343172,0.00005642841,0.0033330577,0.013284922,0.028022394,0.033431973,0.0021470112,0.8958072],"study_design_scores_gemma":[0.0038689296,0.00077688595,0.3506736,0.00019439757,0.00001420604,0.00029149954,0.00005539344,0.52125406,0.0014899567,0.12018203,0.0008371614,0.00036187065],"about_ca_topic_score_codex":0.000011205516,"about_ca_topic_score_gemma":0.0000024519804,"teacher_disagreement_score":0.8954453,"about_ca_system_score_codex":0.00006411916,"about_ca_system_score_gemma":0.0000835457,"threshold_uncertainty_score":0.39883664},"labels":[],"label_agreement":null},{"id":"W2943067960","doi":"10.1142/s0219498821501590","title":"Solving linear systems over tropical semirings through normalization method and its applications","year":2020,"lang":"en","type":"preprint","venue":"Journal of Algebra and Its Applications","topic":"Polynomial and algebraic computation","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Capilano University","funders":"","keywords":"Normalization (sociology); Flowchart; Rank (graph theory); Computer science; Algorithm; Mathematics; Combinatorics","score_opus":0.025457994887977033,"score_gpt":0.29821185023536173,"score_spread":0.2727538553473847,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2943067960","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010749037,0.005448728,0.9795386,0.0029571152,0.00021025493,0.0008307676,0.000025646556,0.000078483354,0.0001613767],"genre_scores_gemma":[0.9206558,0.0027009433,0.07366655,0.0006267713,0.0018702552,0.0003110251,0.00003203088,0.00004118195,0.000095460106],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.997879,0.000110683424,0.0008838207,0.0005301838,0.0003727083,0.00022357616],"domain_scores_gemma":[0.99777573,0.0002873411,0.00097359123,0.00029889776,0.00041049256,0.000253963],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00027408497,0.00028069984,0.0005003049,0.00016087962,0.00028580977,0.0003884127,0.000695993,0.00022263959,0.0000049154246],"category_scores_gemma":[0.000064708845,0.0002582856,0.00012748175,0.00039479707,0.000031315867,0.0006672574,0.0007666173,0.0006220466,0.000008391202],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002205777,0.00020317064,0.0001852706,0.0009846649,0.00028445903,0.000007645287,0.0024041396,0.006510594,0.0049280664,0.95202553,0.001063496,0.03138088],"study_design_scores_gemma":[0.000942434,0.00017432871,0.0038392209,0.000372831,0.0002809746,0.00037804668,0.00007488431,0.8334424,0.0017530149,0.09681488,0.061146267,0.00078071863],"about_ca_topic_score_codex":0.000009679673,"about_ca_topic_score_gemma":9.73428e-7,"teacher_disagreement_score":0.90990674,"about_ca_system_score_codex":0.000061867286,"about_ca_system_score_gemma":0.00021789446,"threshold_uncertainty_score":0.99998695},"labels":[],"label_agreement":null},{"id":"W2943131895","doi":"10.1007/s40096-020-00325-w","title":"On the maximal solution of a linear system over tropical semirings","year":2020,"lang":"en","type":"preprint","venue":"Mathematical sciences","topic":"Polynomial and algebraic computation","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Capilano University","funders":"","keywords":"Maple; Inverse; Mathematics; Column (typography); System of linear equations; Applied mathematics; Inverse system; Order (exchange); Matrix (chemical analysis); Mathematical optimization; Computer science; Mathematical analysis; Geometry","score_opus":0.04291614462939479,"score_gpt":0.2709182403172368,"score_spread":0.22800209568784202,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2943131895","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2674081,0.000022448321,0.71930337,0.0077826018,0.00032660033,0.00030641106,0.00000403126,0.0001529239,0.0046935324],"genre_scores_gemma":[0.9810438,8.6557253e-7,0.018607449,0.00019083264,0.000113166636,0.00001994063,4.530797e-7,0.0000040560053,0.000019412444],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998024,0.000110001354,0.00039535313,0.00048530375,0.00074649026,0.0002388604],"domain_scores_gemma":[0.9987372,0.00056373485,0.00022963352,0.00034397392,0.000036001642,0.00008946042],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005127419,0.00017174016,0.00030723496,0.00005711026,0.00019344642,0.00017660172,0.0016298497,0.00009614345,0.000027631415],"category_scores_gemma":[0.00025506064,0.00009698586,0.0001510957,0.0003282358,0.00031346251,0.00011684531,0.0012682307,0.00029580758,0.0000917862],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000036034473,0.000042488267,0.000015687141,0.00018690171,0.00000817784,0.0000025664451,0.00044644013,0.00036282104,0.00016005953,0.9976023,0.00024076026,0.0009281905],"study_design_scores_gemma":[0.000051806917,0.00009635366,0.00054759876,0.00028942723,0.0000069443245,0.0000046670866,0.000021111933,0.7090073,0.00057458394,0.2892727,0.000022575163,0.000104897845],"about_ca_topic_score_codex":0.000016115568,"about_ca_topic_score_gemma":6.970693e-7,"teacher_disagreement_score":0.71363574,"about_ca_system_score_codex":0.000050864364,"about_ca_system_score_gemma":0.0001325969,"threshold_uncertainty_score":0.39549688},"labels":[],"label_agreement":null},{"id":"W2943509803","doi":"10.1007/s12215-020-00529-y","title":"Solving linear systems over idempotent semifields through LU-factorization","year":2020,"lang":"en","type":"preprint","venue":"Rendiconti del Circolo Matematico di Palermo Series 2","topic":"Polynomial and algebraic computation","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Capilano University","funders":"","keywords":"Idempotence; Factorization; Mathematics; Algebra over a field; Extension (predicate logic); Square (algebra); Square matrix; Matrix (chemical analysis); Linear algebra; Applied mathematics; Pure mathematics; Computer science; Algorithm; Symmetric matrix; Geometry","score_opus":0.03002214271472021,"score_gpt":0.25848874340960654,"score_spread":0.22846660069488633,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2943509803","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.037627388,0.0016538515,0.9471155,0.0016838677,0.0071260664,0.0016928628,0.00007664324,0.0012660465,0.0017577829],"genre_scores_gemma":[0.98699117,0.00028037743,0.010435756,0.00038539697,0.00090546755,0.00027398806,0.00022177024,0.00008211191,0.00042397832],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9950115,0.00038395988,0.0016165454,0.0013514371,0.000925602,0.0007109276],"domain_scores_gemma":[0.9965649,0.0002441916,0.0013357367,0.0013391984,0.00024013722,0.00027582512],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.00044275605,0.0007987595,0.0013337202,0.0001937083,0.00032041842,0.0012115238,0.001788309,0.000690746,0.00004138677],"category_scores_gemma":[0.00023903296,0.00077992433,0.00036900103,0.0004891728,0.000094543546,0.0013334326,0.0021019576,0.0008606764,0.00010906613],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00028804864,0.0011974017,0.006529556,0.06086612,0.003378336,0.0012190172,0.048161954,0.11270958,0.02141935,0.696028,0.027935594,0.02026704],"study_design_scores_gemma":[0.0012807349,0.0003658362,0.010420464,0.0036247435,0.00032530806,0.0001351346,0.0005203919,0.9045427,0.0025339588,0.06999008,0.00352431,0.0027363556],"about_ca_topic_score_codex":0.00022839072,"about_ca_topic_score_gemma":0.0000145402955,"teacher_disagreement_score":0.94936377,"about_ca_system_score_codex":0.00024815643,"about_ca_system_score_gemma":0.00036537636,"threshold_uncertainty_score":0.9998253},"labels":[],"label_agreement":null},{"id":"W2944680259","doi":"10.1016/j.jsc.2019.05.001","title":"The complexity of sparse Hensel lifting and sparse polynomial factorization","year":2019,"lang":"en","type":"article","venue":"Journal of Symbolic Computation","topic":"Polynomial and algebraic computation","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Univariate; Polynomial; Interpolation (computer graphics); Multivariate statistics; Polynomial interpolation; Sparse grid; Diophantine equation; Algorithm; Applied mathematics; Discrete mathematics; Combinatorics; Image (mathematics); Linear interpolation; Computer science; Statistics; Artificial intelligence; Mathematical analysis","score_opus":0.027770756451189687,"score_gpt":0.25040911482240735,"score_spread":0.22263835837121768,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2944680259","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7280654,0.00015638596,0.26977068,0.0008682484,0.0008583309,0.00011687234,0.0000010224579,0.00001623561,0.00014684892],"genre_scores_gemma":[0.99116826,0.000029504701,0.008511088,0.00005679663,0.00020674997,4.5199383e-7,0.0000015817365,0.0000065195336,0.000019030673],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985622,0.00012095275,0.00064183323,0.00014835541,0.00036040175,0.00016624645],"domain_scores_gemma":[0.9982915,0.00031737637,0.000876922,0.0001392189,0.0002927693,0.00008222678],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00056889013,0.00011801819,0.00025882362,0.00014819068,0.00014042469,0.00014622501,0.00032977376,0.00004387585,0.0000026401663],"category_scores_gemma":[0.000073111,0.00008806279,0.00008282347,0.00029027092,0.0001067834,0.0005187234,0.00011892779,0.00015652967,0.0000060866796],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00032382217,0.0003533112,0.029246366,0.00017565975,0.00027781495,0.000016973589,0.013425588,0.028134264,0.029754786,0.14372483,0.001468004,0.7530986],"study_design_scores_gemma":[0.0024450787,0.00069826806,0.29487985,0.00018908436,0.000040972536,0.00026133878,0.00036669747,0.6260561,0.002714732,0.07081996,0.001168839,0.00035910492],"about_ca_topic_score_codex":0.000035144858,"about_ca_topic_score_gemma":0.0000054807238,"teacher_disagreement_score":0.7527395,"about_ca_system_score_codex":0.000043181895,"about_ca_system_score_gemma":0.00012458222,"threshold_uncertainty_score":0.35910964},"labels":[],"label_agreement":null},{"id":"W2949151702","doi":"10.48550/arxiv.1808.06328","title":"Solvability of Equations by Quadratures and Newton's Theorem","year":2018,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Polynomial and algebraic computation","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Mathematics; Galois group; Differential Galois theory; Valuation (finance); Pure mathematics; Differential (mechanical device); Differential equation; Elementary function; Applied mathematics; Galois cohomology; Algebra over a field; Mathematical analysis","score_opus":0.039175796952298496,"score_gpt":0.18584440804605473,"score_spread":0.14666861109375623,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2949151702","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4350618,0.00005861072,0.5637922,0.0001587562,0.0002227212,0.00011734157,0.000019006426,0.00006819239,0.00050131115],"genre_scores_gemma":[0.9986044,0.000027483526,0.0008914175,0.00004367545,0.00004569611,3.524531e-7,0.000013904143,0.0000052620476,0.0003678186],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988604,0.00011614931,0.00016093373,0.00063498685,0.00006441791,0.00016308014],"domain_scores_gemma":[0.99873626,0.00020373426,0.00021707673,0.0006161687,0.00013162171,0.00009515678],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00021823106,0.00016840496,0.00022147941,0.00010456498,0.00010408984,0.00006614133,0.00078174495,0.00015941996,0.000014263182],"category_scores_gemma":[0.000059771577,0.00017725714,0.00009174694,0.0002621773,0.00025169933,0.0002290119,0.001198484,0.00020992676,0.000008243406],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000033587665,0.00016720568,0.0021112368,0.00010763616,0.000096724165,0.000011494767,0.0008030894,0.013138422,0.0005666165,0.976311,0.0027690679,0.0038839164],"study_design_scores_gemma":[0.0002517444,0.0000713984,0.0028059676,0.00004405809,0.000032262556,8.8058516e-7,0.000026084526,0.48196292,0.0010242088,0.5132981,0.00021950704,0.0002628679],"about_ca_topic_score_codex":0.0001615989,"about_ca_topic_score_gemma":0.000027836213,"teacher_disagreement_score":0.56354254,"about_ca_system_score_codex":0.000048529066,"about_ca_system_score_gemma":0.0001347489,"threshold_uncertainty_score":0.72283363},"labels":[],"label_agreement":null},{"id":"W2949825392","doi":"10.48550/arxiv.math/0504303","title":"A conjecture on rational approximations to rational points","year":2005,"lang":"en","type":"preprint","venue":"ArXiv.org","topic":"Polynomial and algebraic computation","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Conjecture; Rational point; Mathematics; Point (geometry); Range (aeronautics); Variety (cybernetics); Lonely runner conjecture; Algebraic number; Pure mathematics; Collatz conjecture; Combinatorics; Mathematical analysis; Geometry; Statistics","score_opus":0.03508272591058667,"score_gpt":0.2703400183440699,"score_spread":0.23525729243348323,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2949825392","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.47311038,0.00003309136,0.49477717,0.028475445,0.0011744271,0.00053510815,0.000037394926,0.0002425147,0.0016144414],"genre_scores_gemma":[0.9563044,0.0000028566865,0.036263503,0.0051160785,0.0012397298,0.00014498497,0.00021209267,0.000016720594,0.000699651],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"observational","domain_scores_codex":[0.9980587,0.00008594402,0.00038881096,0.0007464545,0.00045434723,0.000265769],"domain_scores_gemma":[0.9987559,0.00016471982,0.00018081031,0.0005884032,0.00014265257,0.00016756287],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00020953418,0.00028663088,0.00024068152,0.00023357342,0.00020894186,0.00022457902,0.0008709547,0.00017705688,0.00010814102],"category_scores_gemma":[0.00011854633,0.00027777767,0.0001368057,0.0002640578,0.000030915697,0.00024782686,0.00072545855,0.00046028386,0.0010330639],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000088121,0.0010104771,0.012394884,0.00012217314,0.0002930847,0.000037967096,0.0054545305,0.26711732,0.0017506096,0.59088963,0.045647807,0.07519339],"study_design_scores_gemma":[0.0016172515,0.00033411273,0.59150314,0.00037842093,0.000045215344,0.000047664176,0.000020581989,0.265144,0.004799678,0.10230151,0.031831745,0.0019766917],"about_ca_topic_score_codex":0.000018202138,"about_ca_topic_score_gemma":0.000024227793,"teacher_disagreement_score":0.57910824,"about_ca_system_score_codex":0.000154015,"about_ca_system_score_gemma":0.00043767155,"threshold_uncertainty_score":0.99996746},"labels":[],"label_agreement":null},{"id":"W2950276765","doi":"10.48550/arxiv.0711.4656","title":"A condition number analysis of an algorithm for solving a system of polynomial equations with one degree of freedom","year":2007,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Polynomial and algebraic computation","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada; National Science Foundation","keywords":"Degree (music); Mathematics; Polynomial; System of polynomial equations; Algorithm; Applied mathematics; Mathematical analysis; Physics","score_opus":0.06582272374473892,"score_gpt":0.21690210581673716,"score_spread":0.15107938207199823,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2950276765","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.32780868,0.0000062173885,0.67154086,0.000003980667,0.00009225327,0.0002311937,0.00012885556,0.00003631555,0.00015162179],"genre_scores_gemma":[0.93262887,0.000001940516,0.06717493,0.00000307093,0.000043056218,0.0000013925383,0.00010296529,0.000008221074,0.000035585905],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986662,0.00006451718,0.00040653112,0.0005306559,0.00014288521,0.00018919235],"domain_scores_gemma":[0.99761194,0.00028521064,0.000923989,0.00060007855,0.0004888545,0.00008994099],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00034443408,0.00018018397,0.0005964472,0.0007147863,0.00006785011,0.00002211933,0.00070772425,0.00015771235,0.0000069931816],"category_scores_gemma":[0.000017646416,0.00020032134,0.0002885798,0.0012967337,0.00013188265,0.000300986,0.00031839404,0.00012745957,9.119596e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001587088,0.0004893447,0.0012909069,0.00042263092,0.002543067,0.00002069088,0.0010154118,0.87049365,0.00047086293,0.10930452,0.000011361072,0.013778842],"study_design_scores_gemma":[0.0007266362,0.00014914578,0.0038651205,0.00016241217,0.0011102054,0.00000117293,0.00016616135,0.9916494,0.00093926047,0.001037514,0.0000012586905,0.0001917389],"about_ca_topic_score_codex":0.001191537,"about_ca_topic_score_gemma":0.00033531952,"teacher_disagreement_score":0.60482013,"about_ca_system_score_codex":0.00013533952,"about_ca_system_score_gemma":0.00025215343,"threshold_uncertainty_score":0.8168867},"labels":[],"label_agreement":null},{"id":"W2950759234","doi":"10.48550/arxiv.1001.5272","title":"An in-place truncated Fourier transform and applications to polynomial multiplication","year":2010,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Polynomial and algebraic computation","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Fast Fourier transform; Multiplication (music); Smoothing; Split-radix FFT algorithm; Inverse; Polynomial; Arithmetic; Fourier transform; Prime-factor FFT algorithm; Rader's FFT algorithm; Discrete Fourier transform (general); Mathematics; Algorithm; Computer science; Combinatorics; Short-time Fourier transform; Mathematical analysis; Fourier analysis; Statistics","score_opus":0.031047270099164335,"score_gpt":0.20240220906541134,"score_spread":0.171354938966247,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2950759234","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4247087,0.000008067463,0.5738173,0.00038185556,0.00012755148,0.0005563338,0.000010831434,0.00012500984,0.00026432212],"genre_scores_gemma":[0.99258226,0.000019630454,0.006940182,0.00012255264,0.00011566699,0.000014166622,0.000033825756,0.000012311354,0.0001594139],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984441,0.000056661785,0.00019744868,0.0009834406,0.00006438943,0.0002539857],"domain_scores_gemma":[0.9986884,0.00006293906,0.000109203036,0.00080341275,0.00007684824,0.00025921402],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0001920277,0.00022518664,0.00021442583,0.00034705072,0.00012841553,0.00013198705,0.0010168903,0.00026133106,0.000005457311],"category_scores_gemma":[0.0000091454385,0.00027063733,0.000060021168,0.0005590497,0.000055910754,0.00041256906,0.00039104075,0.00047020946,0.000030460078],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002779101,0.00086455623,0.0036441884,0.00015303267,0.00008836481,0.000063053354,0.0039105755,0.2968075,0.009148876,0.17839786,0.00033755234,0.5063065],"study_design_scores_gemma":[0.0006556952,0.000057651836,0.007835221,0.000021368032,0.000019695799,0.0000037376153,0.000030163364,0.9692404,0.0006153588,0.018319262,0.0027614126,0.00043998778],"about_ca_topic_score_codex":0.00037696195,"about_ca_topic_score_gemma":0.0006740281,"teacher_disagreement_score":0.67243296,"about_ca_system_score_codex":0.00011886722,"about_ca_system_score_gemma":0.0001686033,"threshold_uncertainty_score":0.9999746},"labels":[],"label_agreement":null},{"id":"W2951746875","doi":"10.48550/arxiv.0903.3690","title":"Computations modulo regular chains","year":2009,"lang":"en","type":"preprint","venue":"ArXiv.org","topic":"Polynomial and algebraic computation","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"","keywords":"Modulo; Computation; Polynomial; Context (archaeology); Modular design; Code (set theory); Computer science; Modular arithmetic; Arithmetic; Modulo operation; Mathematics; Theoretical computer science; Algebra over a field; Algorithm; Parallel computing; Discrete mathematics; Programming language; Pure mathematics","score_opus":0.03531240272770002,"score_gpt":0.2605938649678938,"score_spread":0.22528146224019374,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2951746875","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.45192304,0.00025061957,0.5387599,0.006782381,0.001135713,0.0002257581,0.000006009042,0.00045551913,0.0004610699],"genre_scores_gemma":[0.97761273,0.00004683851,0.020008001,0.0011286983,0.00059650425,0.000025875557,0.00006615645,0.000019528192,0.00049565086],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.997691,0.000119572396,0.00044251975,0.0008954314,0.00044447384,0.00040701166],"domain_scores_gemma":[0.99827427,0.00007324305,0.00027221508,0.0010748069,0.00012899222,0.00017644743],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00030366855,0.00034807535,0.0003661763,0.00022483802,0.00021922526,0.00028804914,0.0018640957,0.00026006633,0.000010505885],"category_scores_gemma":[0.00003664599,0.0003605159,0.00021968044,0.00035893172,0.000056127006,0.00026640188,0.0014904863,0.0005918632,0.0002660446],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000017974338,0.00089734705,0.0182452,0.00029901235,0.00034358937,0.00024683212,0.005832832,0.18918896,0.0010194125,0.3585719,0.016089994,0.40924695],"study_design_scores_gemma":[0.00052218593,0.00009843722,0.28836086,0.00022693025,0.000034395292,0.00002243809,0.000018771356,0.5906286,0.0007331544,0.113808386,0.004623731,0.00092209503],"about_ca_topic_score_codex":0.00012918201,"about_ca_topic_score_gemma":0.000017374217,"teacher_disagreement_score":0.5256897,"about_ca_system_score_codex":0.00011066335,"about_ca_system_score_gemma":0.00024454336,"threshold_uncertainty_score":0.99988467},"labels":[],"label_agreement":null},{"id":"W2952206993","doi":"10.48550/arxiv.0709.1269","title":"A criterion for the half-plane property","year":2007,"lang":"en","type":"preprint","venue":"ArXiv.org","topic":"Polynomial and algebraic computation","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Property (philosophy); Matroid; Plane (geometry); Mathematics; Polynomial; Pure mathematics; Mathematical economics; Mathematical analysis; Combinatorics; Geometry; Philosophy; Epistemology","score_opus":0.06163905111541722,"score_gpt":0.2847629765331665,"score_spread":0.22312392541774928,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2952206993","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.17612256,0.0005376148,0.81008184,0.008451672,0.0030451068,0.00089205976,0.000008591781,0.00026467018,0.0005958674],"genre_scores_gemma":[0.98866785,0.000041118154,0.0069209146,0.0014621424,0.0009084958,0.00012848924,0.00003054319,0.000018445608,0.0018219827],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985928,0.000040564286,0.00029228348,0.0005503464,0.00019964983,0.00032435244],"domain_scores_gemma":[0.9987062,0.00022461555,0.00016008262,0.00072919397,0.00010724516,0.00007264751],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004759093,0.00022157506,0.00020855016,0.000075175616,0.00021427975,0.00020400101,0.0012822639,0.00015032427,0.000010649395],"category_scores_gemma":[0.00006693966,0.00012232097,0.00014614542,0.00012854754,0.000050668314,0.00014548618,0.000986899,0.00034192274,0.00008868273],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001016907,0.00023032767,0.008753887,0.0003931514,0.00019097248,0.000044264314,0.0030109503,0.0011087004,0.0022331574,0.0058637275,0.016939025,0.96113014],"study_design_scores_gemma":[0.0014643688,0.0004037022,0.23193495,0.0004912524,0.0001216536,0.00008264242,0.000050560036,0.39813408,0.007942924,0.017944906,0.33977538,0.0016535944],"about_ca_topic_score_codex":0.00030836224,"about_ca_topic_score_gemma":0.000042798765,"teacher_disagreement_score":0.95947653,"about_ca_system_score_codex":0.000061363186,"about_ca_system_score_gemma":0.00014321263,"threshold_uncertainty_score":0.49881044},"labels":[],"label_agreement":null},{"id":"W2952437841","doi":"10.48550/arxiv.1310.8260","title":"The Newton tree: geometric interpretation and applications to the motivic zeta function and the log canonical threshold","year":2013,"lang":"en","type":"preprint","venue":"","topic":"Polynomial and algebraic computation","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Interpretation (philosophy); Riemann zeta function; Mathematics; Function (biology); Tree (set theory); Pure mathematics; Applied mathematics; Combinatorics; Computer science","score_opus":0.013314632533660307,"score_gpt":0.2365256036177993,"score_spread":0.223210971084139,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2952437841","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01415086,0.0015694683,0.9417697,0.038180828,0.0005810344,0.0016721094,0.000002539348,0.00010118211,0.0019722527],"genre_scores_gemma":[0.9957657,0.00020178185,0.0005639992,0.0013418104,0.00027568854,0.0006507877,0.000007615981,0.000009170198,0.0011834868],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984909,0.00015005679,0.00032183997,0.0005484281,0.00026593622,0.00022282457],"domain_scores_gemma":[0.9978609,0.000980356,0.00016665073,0.0008007792,0.00009782524,0.00009345897],"candidate_categories":["scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.00075768086,0.00020971108,0.0001922503,0.0001320778,0.0005618804,0.0011485367,0.0010119803,0.00010363413,0.000005293266],"category_scores_gemma":[0.00007438837,0.0000932568,0.00007483201,0.0005437662,0.00019335726,0.00017363262,0.0018206129,0.00041595366,0.000039129292],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000029631747,0.000018814892,0.00010512301,0.000013462808,0.00005232016,1.09378675e-7,0.00046299468,0.0018824299,0.00001005556,0.24685052,0.0038220875,0.74675244],"study_design_scores_gemma":[0.0006147185,0.00008890287,0.04789727,0.000030280959,0.00007687189,0.000014695648,0.00009136417,0.71645266,0.000024522826,0.21664917,0.017751217,0.00030833163],"about_ca_topic_score_codex":0.0005388637,"about_ca_topic_score_gemma":0.0005202994,"teacher_disagreement_score":0.9816148,"about_ca_system_score_codex":0.00004637569,"about_ca_system_score_gemma":0.00010028515,"threshold_uncertainty_score":0.99988836},"labels":[],"label_agreement":null},{"id":"W2952900507","doi":"","title":"Semidefinite approximations of the polynomial abscissa0","year":2015,"lang":"en","type":"article","venue":"HAL (Le Centre pour la Communication Scientifique Directe)","topic":"Polynomial and algebraic computation","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Mathematics; Degree of a polynomial; Semidefinite programming; Polynomial; Degree (music); Applied mathematics; Mathematical analysis; Mathematical optimization","score_opus":0.016738180867952902,"score_gpt":0.212182340561161,"score_spread":0.1954441596932081,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2952900507","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12995629,0.00022859145,0.7893746,0.017614394,0.00039410515,0.00024694987,0.000010288535,0.00018888495,0.061985925],"genre_scores_gemma":[0.9421082,0.000007492645,0.054515094,0.00012962038,0.000017490653,0.00001223768,0.000010667377,0.000008851862,0.0031903551],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9973833,0.0014601196,0.0003265035,0.0002888003,0.00034825425,0.00019301953],"domain_scores_gemma":[0.99693733,0.00061051483,0.00026978867,0.0011756261,0.00087641715,0.00013032719],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0024488478,0.000119771845,0.00014466794,0.00008698808,0.00020150901,0.00015858364,0.0014580395,0.00005695703,0.000010163408],"category_scores_gemma":[0.0009151134,0.00009807907,0.000105839514,0.00067396805,0.00015251905,0.0003005687,0.000661621,0.00014138194,0.00003151704],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000007255852,0.00042189116,0.00227438,0.000026355701,0.000032619668,0.0000011016896,0.016916698,0.00031867283,0.0047274563,0.841699,0.006675564,0.12689902],"study_design_scores_gemma":[0.002953279,0.0000026622658,0.033351306,0.0008198068,0.00004782306,0.0000634724,0.00031816476,0.52177745,0.2988873,0.0845912,0.056232266,0.0009552969],"about_ca_topic_score_codex":0.00034284225,"about_ca_topic_score_gemma":0.00016300051,"teacher_disagreement_score":0.8121519,"about_ca_system_score_codex":0.00004811562,"about_ca_system_score_gemma":0.00027785223,"threshold_uncertainty_score":0.39995486},"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,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_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","score_opus":0.010836018412523095,"score_gpt":0.2698192020306663,"score_spread":0.2589831836181432,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2954735736","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.98340756,0.0004210833,0.009015265,0.006462781,0.00024840792,0.00022763036,7.187451e-7,0.000041691386,0.0001748793],"genre_scores_gemma":[0.9960139,0.00010955104,0.0012286525,0.0025714564,0.000050411832,0.0000059013378,0.0000011301939,0.000004706559,0.000014316121],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993042,0.000066593435,0.0001507667,0.00023215996,0.00012509816,0.00012122784],"domain_scores_gemma":[0.9995164,0.00010416071,0.000110413275,0.00019969828,0.000020155716,0.0000491175],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00010787006,0.00010054469,0.00024958083,0.000029354946,0.000017002514,0.000022961516,0.00020133749,0.0000058875717,0.000006453103],"category_scores_gemma":[0.000027004284,0.00007996088,0.00008828928,0.0001875948,0.00003000347,0.00025683368,0.000112616646,0.0000900873,0.00006480114],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000037825146,0.00035526932,0.0016492102,0.0038738942,0.00018276543,0.000008570975,0.0039362214,0.00028490732,0.37891164,0.34530362,0.0068358756,0.2586202],"study_design_scores_gemma":[0.005564979,0.0018007464,0.15497051,0.02352982,0.00038947145,0.000098136916,0.0001451183,0.67474085,0.07082448,0.03299962,0.031109493,0.0038267935],"about_ca_topic_score_codex":0.00008348214,"about_ca_topic_score_gemma":0.0000013566481,"teacher_disagreement_score":0.67445594,"about_ca_system_score_codex":0.0000234773,"about_ca_system_score_gemma":0.000009219793,"threshold_uncertainty_score":0.32607102},"labels":[],"label_agreement":null},{"id":"W2956505993","doi":"10.1016/j.jsc.2019.07.009","title":"On the Extended Hensel Construction and its application to the computation of real limit points","year":2019,"lang":"en","type":"article","venue":"Journal of Symbolic Computation","topic":"Polynomial and algebraic computation","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Univariate; Rational function; Polynomial; Computation; Limit (mathematics); Bivariate analysis; Algebraic number; Multivariate statistics; Discrete mathematics; Algebra over a field; Applied mathematics; Pure mathematics; Algorithm; Mathematical analysis","score_opus":0.010749298313966107,"score_gpt":0.24320198452094566,"score_spread":0.23245268620697956,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2956505993","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.61345464,0.000039512248,0.3809967,0.004639432,0.00036757937,0.0003165124,9.690336e-7,0.000015499965,0.00016917533],"genre_scores_gemma":[0.99404997,0.000019985648,0.005379688,0.00040197588,0.00012654885,0.000004633384,0.0000016947646,0.000007171099,0.000008333519],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984863,0.00017774958,0.0005510721,0.00019565909,0.0004543723,0.00013486897],"domain_scores_gemma":[0.9981637,0.00049672305,0.00070225185,0.00016112912,0.00040461903,0.00007156192],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00073966384,0.00012697102,0.000219592,0.00020508733,0.00012439404,0.00008651257,0.0003511018,0.000044766493,0.000002878166],"category_scores_gemma":[0.000074243835,0.00008055656,0.00007469682,0.00047363056,0.00003333383,0.00031100935,0.00008502377,0.00017252257,0.00002978812],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00015275071,0.00014308971,0.0003113365,0.000048059457,0.00008116527,0.0000019952606,0.004533785,0.0706048,0.008953256,0.3544263,0.0005540934,0.56018937],"study_design_scores_gemma":[0.0011531318,0.0009197116,0.07980738,0.0001833612,0.000036519123,0.0002353889,0.00036395114,0.7871186,0.002749028,0.12700205,0.00019961789,0.00023126752],"about_ca_topic_score_codex":0.00001364211,"about_ca_topic_score_gemma":0.000002415827,"teacher_disagreement_score":0.7165138,"about_ca_system_score_codex":0.000053769352,"about_ca_system_score_gemma":0.00008284938,"threshold_uncertainty_score":0.3285001},"labels":[],"label_agreement":null},{"id":"W2962823499","doi":"10.1016/j.disc.2017.08.041","title":"Ideal ramp schemes and related combinatorial objects","year":2017,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Polynomial and algebraic computation","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Ideal (ethics); Mathematics; Equivalence (formal languages); Orthogonal array; Scheme (mathematics); Term (time); Discrete mathematics; Algorithm; Combinatorics; Topology (electrical circuits); Mathematical analysis; Statistics","score_opus":0.013044044360356671,"score_gpt":0.2564547124330966,"score_spread":0.24341066807273992,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2962823499","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7716542,0.00016765177,0.19593112,0.0018381573,0.002456693,0.000401446,0.000005128372,0.00037219012,0.027173443],"genre_scores_gemma":[0.9836667,0.0000069456087,0.016038451,0.000023565124,0.000063659994,0.000004394151,0.0000020177395,0.000007736027,0.00018648451],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992256,0.000018405137,0.00020397348,0.00020314755,0.00017494237,0.00017391119],"domain_scores_gemma":[0.99906445,0.00007462814,0.00020212171,0.00054616964,0.000030956882,0.00008168593],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00021587411,0.00011389769,0.00016878259,0.000034088804,0.00038000225,0.0005261772,0.00059655367,0.000055185876,0.000005931135],"category_scores_gemma":[0.00017258817,0.000096321855,0.0000420554,0.00004461305,0.00008740426,0.00042338535,0.00043246202,0.00009346123,0.00003477075],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000029486434,0.000059056183,0.000041772997,0.00004284493,0.000028862834,0.000012132564,0.0020520592,0.0000021780872,0.00042876022,0.98260725,0.00019918203,0.01452296],"study_design_scores_gemma":[0.0016425718,0.00009413797,0.0005637607,0.000070830974,0.000015811933,0.000029938199,0.00005895163,0.17275172,0.0018174326,0.8222739,0.00043690333,0.00024404502],"about_ca_topic_score_codex":0.000007878895,"about_ca_topic_score_gemma":9.696221e-7,"teacher_disagreement_score":0.21201257,"about_ca_system_score_codex":0.000011183528,"about_ca_system_score_gemma":0.000030651394,"threshold_uncertainty_score":0.5073939},"labels":[],"label_agreement":null},{"id":"W2963147061","doi":"10.48550/arxiv.1605.07433","title":"Bit complexity for multi-homogeneous polynomial system solving\\n Application to polynomial minimization","year":2016,"lang":"en","type":"article","venue":"arXiv (Cornell University)","topic":"Polynomial and algebraic computation","field":"Computer Science","cited_by":26,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada; Institut Universitaire de France","keywords":"Mathematics; Homogeneous polynomial; Polynomial; Matrix polynomial; TRACE (psycholinguistics); Time complexity; Rank (graph theory); Minification; Set (abstract data type); Jacobian matrix and determinant; Probabilistic analysis of algorithms; Algebraic number; Quadratic equation; Linear system; Discrete mathematics; Algorithm; Probabilistic logic; Mathematical optimization; Applied mathematics; Combinatorics; Computer science","score_opus":0.06810500390180539,"score_gpt":0.20201600288343227,"score_spread":0.1339109989816269,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2963147061","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.17134728,0.0000061406063,0.82693714,0.0002936664,0.0004252331,0.0005323666,0.00002653532,0.0003108862,0.00012078004],"genre_scores_gemma":[0.98083824,0.000002000384,0.018207438,0.00010654325,0.00022237134,0.000007358735,0.000008672088,0.00001594412,0.0005914539],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984683,0.000068289315,0.000235664,0.00077457743,0.00007616493,0.00037702118],"domain_scores_gemma":[0.9988007,0.00013974837,0.00016953719,0.00050646724,0.00015119668,0.00023238201],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00016249658,0.00020097944,0.00021458723,0.00021309158,0.00028797364,0.00007532858,0.0008358734,0.00009583873,0.0000049481746],"category_scores_gemma":[0.000039724302,0.00018717302,0.00012736369,0.0005094608,0.00006694128,0.00045762636,0.0002714246,0.00004603905,0.00014654896],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0011416096,0.0007258335,0.005273743,0.00019982073,0.00022510847,0.00008127696,0.0012672486,0.055685233,0.054031596,0.69111806,0.009051361,0.1811991],"study_design_scores_gemma":[0.0022006761,0.00017157476,0.0030722676,0.00004415075,0.000028223361,0.000011787336,0.00004409401,0.98531127,0.0042652977,0.0007132429,0.0036841335,0.00045329472],"about_ca_topic_score_codex":0.00012758024,"about_ca_topic_score_gemma":0.000100376405,"teacher_disagreement_score":0.92962605,"about_ca_system_score_codex":0.00035202783,"about_ca_system_score_gemma":0.000105517815,"threshold_uncertainty_score":0.7632694},"labels":[],"label_agreement":null},{"id":"W2963178239","doi":"10.1016/j.jde.2008.02.012","title":"The Stokes phenomenon in the confluence of the hypergeometric equation using Riccati equation","year":2008,"lang":"en","type":"article","venue":"Journal of Differential Equations","topic":"Polynomial and algebraic computation","field":"Computer Science","cited_by":15,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Montréal","funders":"Natural Sciences and Engineering Research Council of Canada; Fonds Québécois de la Recherche sur la Nature et les Technologies","keywords":"Mathematics; Confluence; Regular singular point; Monodromy; Confluent hypergeometric function; Singular point of a curve; Mathematical analysis; Hypergeometric function; Divergence (linguistics); Riccati equation; Logarithm; Singular solution; Pure mathematics; Ordinary differential equation; Differential equation","score_opus":0.07032268888983645,"score_gpt":0.26786369271496885,"score_spread":0.1975410038251324,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2963178239","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.47615874,0.00015990346,0.52231306,0.0008001091,0.00040474057,0.0001114862,8.5381e-7,0.0000034630548,0.00004760634],"genre_scores_gemma":[0.9988602,0.000036366437,0.00088415743,0.0000709114,0.00012132019,0.0000035526793,8.535446e-7,0.0000038848243,0.000018765179],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9980397,0.00034713576,0.0006633312,0.000103207945,0.0006864964,0.00016010964],"domain_scores_gemma":[0.9974945,0.0011118229,0.0008077333,0.0002834105,0.00027178164,0.0000307464],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000680707,0.00009691468,0.00014677997,0.00024700348,0.00051010755,0.00009970539,0.0010306803,0.000034152752,0.0000039802103],"category_scores_gemma":[0.00057532144,0.000049057537,0.00012406836,0.0013580129,0.00010736424,0.00047190607,0.00009022189,0.00020704664,0.0000020094978],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001104959,0.0016324123,0.015877191,0.000048938113,0.00025145855,0.0000114078375,0.038248185,0.2376314,0.061925754,0.4438215,0.00034889238,0.20009239],"study_design_scores_gemma":[0.00086807186,0.00017649712,0.24358608,0.00006191011,0.000051353967,0.00005306672,0.00030207107,0.7296294,0.0015829765,0.023406226,0.00012969362,0.00015265733],"about_ca_topic_score_codex":0.00006507823,"about_ca_topic_score_gemma":0.000017736365,"teacher_disagreement_score":0.52270144,"about_ca_system_score_codex":0.000087380926,"about_ca_system_score_gemma":0.00026122612,"threshold_uncertainty_score":0.39233866},"labels":[],"label_agreement":null},{"id":"W2963227754","doi":"10.1007/s00026-017-0341-5","title":"On the Convergence of Monotone Hurwitz Generating Functions","year":2017,"lang":"en","type":"article","venue":"Annals of Combinatorics","topic":"Polynomial and algebraic computation","field":"Computer Science","cited_by":12,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec à Montréal; University of Waterloo","funders":"","keywords":"Monotone polygon; Mathematics; Hurwitz polynomial; Hurwitz matrix; Routh–Hurwitz stability criterion; Combinatorics; Algebraic number; Discrete mathematics; Genus; Pure mathematics; Polynomial; Mathematical analysis; Geometry","score_opus":0.06432653068586572,"score_gpt":0.3003179496197319,"score_spread":0.2359914189338662,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2963227754","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8864531,0.00009083305,0.10336257,0.0048275865,0.0015610991,0.00010410535,0.0000022133866,0.00002526802,0.0035732116],"genre_scores_gemma":[0.99908584,0.00002137895,0.0002481427,0.0002826479,0.00003568981,0.0000046918008,4.5131637e-7,0.0000030990989,0.0003180321],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992997,0.000035820045,0.00019487223,0.00013581777,0.00021626451,0.000117515745],"domain_scores_gemma":[0.99859655,0.00018088263,0.00031945997,0.00066058926,0.0002040595,0.000038471564],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002839203,0.0000712947,0.00011816142,0.00003717214,0.00032464997,0.000060893424,0.00087607617,0.000027535838,0.000009793162],"category_scores_gemma":[0.0002776538,0.00005321099,0.00006370379,0.000109969464,0.00007636371,0.00021674039,0.00019016107,0.00007346312,0.000019082805],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000003621136,0.00006874242,0.0001692292,0.000005161205,0.000012526315,8.698771e-7,0.0001476253,0.00033963774,0.0006098852,0.9897181,0.00298713,0.0059375092],"study_design_scores_gemma":[0.00025669072,0.0003953972,0.0060565826,0.000046098994,0.000005373292,0.0000021114374,0.000022667427,0.11504872,0.075042546,0.80163926,0.0013300745,0.00015449307],"about_ca_topic_score_codex":0.00006871199,"about_ca_topic_score_gemma":9.975895e-7,"teacher_disagreement_score":0.18807882,"about_ca_system_score_codex":0.000003997553,"about_ca_system_score_gemma":0.000056309498,"threshold_uncertainty_score":0.24969779},"labels":[],"label_agreement":null},{"id":"W2963295477","doi":"10.1007/s11786-020-00477-x","title":"A Short Contribution to the Theory of Regular Chains","year":2020,"lang":"en","type":"article","venue":"Mathematics in Computer Science","topic":"Polynomial and algebraic computation","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"Agence Nationale de la Recherche","keywords":"Computation; Context (archaeology); Differential (mechanical device); Mathematics; Mathematical economics; Computer science; Algebra over a field; Pure mathematics; Algorithm; Engineering; History","score_opus":0.024658429903805942,"score_gpt":0.25165112121179345,"score_spread":0.2269926913079875,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2963295477","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.104677826,0.000017258315,0.8900691,0.004661932,0.00021328626,0.00024832718,9.0948674e-7,0.000052057236,0.000059288763],"genre_scores_gemma":[0.8457708,8.85475e-7,0.15325403,0.0008909728,0.00006950612,0.0000074306777,2.1264228e-7,0.0000027829558,0.0000033942497],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985656,0.00005411481,0.00032386745,0.0003387975,0.0004637539,0.00025385487],"domain_scores_gemma":[0.999021,0.00020575196,0.000072041505,0.00046809652,0.000117443036,0.00011569557],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015645603,0.00010058964,0.00017284257,0.00011336972,0.00011291539,0.00013247682,0.0020015899,0.000021141263,0.0000012720894],"category_scores_gemma":[0.00019392345,0.00007082552,0.000041903037,0.0016491225,0.00015948649,0.00027804187,0.0008322487,0.00009212895,0.000019353849],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000033339913,0.000064124884,0.00006165611,0.000022677707,0.0000035912183,0.00000420577,0.008958184,0.0081203785,0.0017058608,0.8393066,0.00009132497,0.14165808],"study_design_scores_gemma":[0.000096897464,0.000085432854,0.002096847,0.00004276557,0.0000016553219,0.0000066296298,0.000019170895,0.9470892,0.0059895553,0.044347454,0.00012460955,0.00009979343],"about_ca_topic_score_codex":0.0000013655771,"about_ca_topic_score_gemma":0.0000015934789,"teacher_disagreement_score":0.93896884,"about_ca_system_score_codex":0.000041737014,"about_ca_system_score_gemma":0.000078878955,"threshold_uncertainty_score":0.37194854},"labels":[],"label_agreement":null},{"id":"W2963453538","doi":"","title":"Consistent systems of linear differential and difference equations","year":2016,"lang":"","type":"article","venue":"arXiv (Cornell University)","topic":"Polynomial and algebraic computation","field":"Computer Science","cited_by":22,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Mathematics; Linear differential equation; Differential equation; Mathematical analysis; Applied mathematics","score_opus":0.064131067390257,"score_gpt":0.17815267019862221,"score_spread":0.11402160280836522,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2963453538","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.47820064,0.00008265194,0.52086866,0.00010207473,0.0004761032,0.00012992769,0.000019621823,0.000028282924,0.0000920527],"genre_scores_gemma":[0.997318,0.00018370117,0.000086553264,0.000014730395,0.00008764435,4.078208e-7,0.0000014455208,0.000008063815,0.0022994527],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998319,0.00019593693,0.00034684048,0.0006966353,0.000114470626,0.00032714556],"domain_scores_gemma":[0.99820334,0.0005338594,0.00033308385,0.0004922016,0.00020370452,0.00023381737],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00012693506,0.0002372587,0.00035030258,0.00019082094,0.0002267582,0.00006613999,0.0005439529,0.00011267727,0.000034854696],"category_scores_gemma":[0.00007316987,0.00019705023,0.000121150464,0.00044548913,0.00040527288,0.00037559512,0.0005079163,0.00009501808,0.000038037542],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000083073886,0.0002633078,0.005994857,0.00011986125,0.00015068315,0.00004686249,0.00047421796,0.0034605314,0.0071505737,0.9594167,0.000026299609,0.022813058],"study_design_scores_gemma":[0.0016318031,0.00027672798,0.01691355,0.00034032785,0.00011839234,0.000007877352,0.00007365638,0.97332126,0.0006240959,0.006268474,0.000054640474,0.00036917222],"about_ca_topic_score_codex":0.00018167324,"about_ca_topic_score_gemma":0.000020896909,"teacher_disagreement_score":0.96986073,"about_ca_system_score_codex":0.00007971171,"about_ca_system_score_gemma":0.00015456551,"threshold_uncertainty_score":0.80354756},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.011316187036539511,"score_gpt":0.23468377025286177,"score_spread":0.22336758321632227,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2963674359","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9636122,0.00003962976,0.033416133,0.0017566247,0.00084437395,0.0000629462,6.0921616e-7,0.0000041116255,0.0002633741],"genre_scores_gemma":[0.8876203,0.0000048833035,0.11227464,0.00001759599,0.000060300594,2.601823e-7,3.9642075e-8,0.000002034701,0.000019945974],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99925196,0.000013288957,0.00037960146,0.000048639908,0.0002495369,0.00005698798],"domain_scores_gemma":[0.99874175,0.000069210546,0.0008359545,0.00018909438,0.0001301261,0.00003385861],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00046568783,0.00006013798,0.00017509333,0.00007104271,0.000039303282,0.00003166804,0.0005265745,0.000033100565,0.0000012941233],"category_scores_gemma":[0.0002131043,0.000034057422,0.00007115288,0.00011857189,0.000112235866,0.00041906728,0.00012126827,0.00013894224,4.667797e-7],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000033871125,0.0008429389,0.0025912037,0.0008766052,0.00019123316,0.000010666991,0.009642678,0.0014589181,0.31595635,0.596744,0.0010813253,0.07057018],"study_design_scores_gemma":[0.0020258408,0.00055460207,0.02618451,0.0010647582,0.00015359688,0.00092407723,0.00021626064,0.06457437,0.31948724,0.58139336,0.003065039,0.0003563481],"about_ca_topic_score_codex":0.0000044270923,"about_ca_topic_score_gemma":0.000009405159,"teacher_disagreement_score":0.07885851,"about_ca_system_score_codex":0.0000046729656,"about_ca_system_score_gemma":0.000095239586,"threshold_uncertainty_score":0.13888215},"labels":[],"label_agreement":null},{"id":"W2964021187","doi":"10.48550/arxiv.1406.0907","title":"Computing GCRDs of Approximate Differential Polynomials","year":2014,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Polynomial and algebraic computation","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Sylvester matrix; Mathematics; Differential operator; Differential (mechanical device); Difference polynomials; Polynomial matrix; Polynomial; Gegenbauer polynomials; Classical orthogonal polynomials; Algebra over a field; Pure mathematics; Orthogonal polynomials; Mathematical analysis; Matrix polynomial","score_opus":0.04361710527689889,"score_gpt":0.1880855420684244,"score_spread":0.14446843679152552,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2964021187","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.44617417,0.000013482269,0.5521684,0.00003415696,0.00068514247,0.00012570525,0.000006350988,0.00013427652,0.00065824436],"genre_scores_gemma":[0.9970004,0.00001288105,0.002473166,0.00004258178,0.0002127531,2.6436902e-7,0.000017290813,0.00001501711,0.00022566847],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9980552,0.000189701,0.0003653541,0.00091729476,0.00011684402,0.000355615],"domain_scores_gemma":[0.99809295,0.00015559795,0.0005800692,0.0009047049,0.000120873476,0.00014582937],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00025091504,0.00032042348,0.00054673164,0.000273056,0.00012193114,0.000104716375,0.0018336428,0.00023413784,0.000018072544],"category_scores_gemma":[0.000023891427,0.00035718127,0.00028963297,0.00033026672,0.000117178395,0.00018510084,0.0029038468,0.0003694981,0.000026548094],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007947342,0.00033591187,0.0017738409,0.00055036775,0.00030037094,0.00008066851,0.0008683999,0.43179527,0.0015147534,0.5382839,0.00058191456,0.023835156],"study_design_scores_gemma":[0.00050427066,0.000048424015,0.0020497954,0.00011381083,0.000045836758,0.0000028227616,0.0000106371745,0.9650732,0.0012264866,0.030469958,0.000074899435,0.00037985135],"about_ca_topic_score_codex":0.00016157121,"about_ca_topic_score_gemma":0.000006676071,"teacher_disagreement_score":0.5508262,"about_ca_system_score_codex":0.000092944574,"about_ca_system_score_gemma":0.00016118989,"threshold_uncertainty_score":0.999888},"labels":[],"label_agreement":null},{"id":"W2964311330","doi":"10.1142/s1005386716000596","title":"Gelfand-Kirillov Dimensions of Modules over Differential Difference Algebras","year":2016,"lang":"en","type":"article","venue":"Algebra Colloquium","topic":"Polynomial and algebraic computation","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Manitoba","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Differential (mechanical device); Basis (linear algebra); Pure mathematics; Dimension (graph theory); Type (biology); Algebra over a field; Automorphism; Polynomial; Mathematical analysis; Geometry","score_opus":0.010007837874371907,"score_gpt":0.22308768489960515,"score_spread":0.21307984702523325,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2964311330","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7616802,0.000096557,0.23546936,0.0010929098,0.0009664794,0.00019369679,0.000018469435,0.0001857977,0.00029652528],"genre_scores_gemma":[0.99572796,0.00005442192,0.0026287585,0.00020603776,0.00015672813,0.000023172503,0.0000038443454,0.00001934203,0.0011797159],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"observational","domain_scores_codex":[0.99773735,0.00011046174,0.000509403,0.0006267151,0.0005120656,0.00050403393],"domain_scores_gemma":[0.998259,0.00035623126,0.00024359135,0.00079432165,0.00013051354,0.00021632964],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00013359237,0.0002970401,0.00040862217,0.0002068906,0.0001630444,0.00008233472,0.0010319273,0.00011602398,0.0001363892],"category_scores_gemma":[0.000087133994,0.0001781711,0.000199282,0.00045454793,0.00018473591,0.0004818838,0.000675397,0.00009838238,0.0000904919],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007835417,0.00044362462,0.005686328,0.000038826158,0.000159117,0.000020622992,0.0005510039,0.000011883065,0.34814656,0.45322296,0.005335156,0.18630557],"study_design_scores_gemma":[0.0055448674,0.0008050527,0.5443739,0.00040564514,0.00010636535,0.000049427552,0.000027975017,0.014628925,0.18195967,0.24464928,0.00570861,0.0017402343],"about_ca_topic_score_codex":0.00006577991,"about_ca_topic_score_gemma":0.000026971056,"teacher_disagreement_score":0.53868765,"about_ca_system_score_codex":0.00005895828,"about_ca_system_score_gemma":0.00011418234,"threshold_uncertainty_score":0.7265607},"labels":[],"label_agreement":null},{"id":"W2984654445","doi":"10.1049/iet-ifs.2018.5288","title":"Choosing subfields for LUOV and lifting fields for rainbow","year":2019,"lang":"en","type":"article","venue":"IET Information Security","topic":"Polynomial and algebraic computation","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University of Edmonton","funders":"Viet Nam National University Ho Chi Minh City","keywords":"Rainbow; NIST; Public-key cryptography; Binary number; Cryptography; Signature (topology); Key (lock); Scheme (mathematics); Computer science; Multivariate statistics; Field (mathematics); Mathematics; Theoretical computer science; Algorithm; Arithmetic; Computer security; Statistics; Speech recognition; Physics; Optics; Encryption; Pure mathematics","score_opus":0.007333392382511736,"score_gpt":0.2300969670906782,"score_spread":0.22276357470816646,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2984654445","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.23023286,0.00002134596,0.7656781,0.0018591816,0.00056728773,0.0005210643,0.000009449303,0.00009553964,0.0010151351],"genre_scores_gemma":[0.98803335,0.0000027501485,0.010476547,0.0013200169,0.00008252623,0.000027734563,0.000021193262,0.0000022099698,0.000033680815],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994221,0.000008956586,0.00021995441,0.0001040974,0.0000889265,0.00015601609],"domain_scores_gemma":[0.9994186,0.0002041049,0.00011045028,0.00013026997,0.00009218423,0.000044370903],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00029830274,0.000073542884,0.00009709701,0.00006161683,0.00011711757,0.00023120624,0.00016610537,0.000070312,0.0000043149444],"category_scores_gemma":[0.000076911514,0.000071435825,0.00004655856,0.0000883948,0.000008004015,0.0017790378,0.000072116156,0.000063270425,0.000012265251],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008580008,0.000042439864,0.0009660525,0.00071849476,0.00003699206,1.8450841e-7,0.037853915,0.0007419054,0.00016589274,0.33066332,0.011933058,0.6167919],"study_design_scores_gemma":[0.0013214748,0.00016900437,0.0012797853,0.000033093624,0.00000472238,0.0000058758774,0.0002065346,0.8950502,0.0015172197,0.04911495,0.051061038,0.00023608198],"about_ca_topic_score_codex":0.000012158225,"about_ca_topic_score_gemma":0.0000027645353,"teacher_disagreement_score":0.8943083,"about_ca_system_score_codex":0.000013829111,"about_ca_system_score_gemma":0.00003400733,"threshold_uncertainty_score":0.29130682},"labels":[],"label_agreement":null},{"id":"W2995022371","doi":"10.4171/owr/2018/45","title":"Mini-Workshop: Asymptotic Invariants of Homogeneous Ideals","year":2019,"lang":"en","type":"article","venue":"Oberwolfach Reports","topic":"Polynomial and algebraic computation","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Manitoba","funders":"","keywords":"Homogeneous; Algebraic geometry; Algebraic number; Algebra over a field; Commutative property; Limit (mathematics); Mathematics; Measure (data warehouse); Commutative algebra; Order (exchange); Pure mathematics; Computer science; Mathematical analysis; Combinatorics","score_opus":0.010892391964261358,"score_gpt":0.22580736755029387,"score_spread":0.2149149755860325,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2995022371","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9524276,0.00020914864,0.036030006,0.00031949714,0.0014935667,0.000300007,0.0000013287469,0.00012778363,0.00909102],"genre_scores_gemma":[0.991869,0.0000049858945,0.005762162,0.0001485906,0.00006397392,0.00000657577,0.000005323618,0.000011121077,0.0021282805],"study_design_codex":"design_other","study_design_gemma":"observational","domain_scores_codex":[0.99815977,0.00005327825,0.00061545224,0.00049584074,0.00037980484,0.0002958465],"domain_scores_gemma":[0.99834913,0.00012934176,0.00043823099,0.00087360846,0.000094365016,0.00011534533],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00040599244,0.00015888792,0.0003006569,0.000119023425,0.000047903115,0.000073208554,0.00040399,0.00008275048,0.000085588916],"category_scores_gemma":[0.00009288373,0.00014744743,0.00011488634,0.00037402034,0.000029188906,0.00031062606,0.00027440846,0.00009929898,0.00011385497],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000056825364,0.001148544,0.11264773,0.00043200786,0.00043671989,0.0044880314,0.004387946,0.010953236,0.06787987,0.07089668,0.01423389,0.7124385],"study_design_scores_gemma":[0.0033802208,0.0013946727,0.47527918,0.0009307902,0.00017174392,0.013527416,0.00021551127,0.12072373,0.13933468,0.19558513,0.045379512,0.0040774047],"about_ca_topic_score_codex":0.00007497989,"about_ca_topic_score_gemma":0.000009698093,"teacher_disagreement_score":0.70836115,"about_ca_system_score_codex":0.000033377884,"about_ca_system_score_gemma":0.00015704769,"threshold_uncertainty_score":0.6012731},"labels":[],"label_agreement":null},{"id":"W2995188427","doi":"10.1093/imrn/rnaa230","title":"Wall-Crossing for Newton–Okounkov Bodies and the Tropical Grassmannian","year":2020,"lang":"en","type":"article","venue":"International Mathematics Research Notices","topic":"Polynomial and algebraic computation","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"","keywords":"Grassmannian; Connection (principal bundle); Perspective (graphical); Algebraic geometry; Tropical geometry; Algebraic number","score_opus":0.11394123481198744,"score_gpt":0.3814514172991042,"score_spread":0.2675101824871168,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2995188427","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.100677766,0.00021929231,0.64313436,0.25298125,0.0003306062,0.00059630215,0.0000071630784,0.000107850996,0.001945392],"genre_scores_gemma":[0.9540901,0.000014710208,0.044432256,0.0006961115,0.00032212868,0.000049678427,0.0000021180483,0.000008249094,0.0003846361],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986342,0.00007707358,0.00023570815,0.0002393962,0.0005896072,0.00022398279],"domain_scores_gemma":[0.9975581,0.0018853619,0.00007554158,0.00014297801,0.00024235215,0.000095642055],"candidate_categories":["scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0006159458,0.000086307205,0.0001341811,0.00007216942,0.00037968054,0.0014004669,0.00097256934,0.00002890363,0.0000074546165],"category_scores_gemma":[0.0011103991,0.000056036897,0.00005883462,0.0000898128,0.00036443086,0.00036921262,0.00044241812,0.00016915287,0.00002378555],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000066599474,0.000055276592,0.00010820347,0.000097572716,0.00006948053,0.000004550903,0.012860554,0.0001483007,0.00025111984,0.9705835,0.0021350484,0.013619778],"study_design_scores_gemma":[0.0007552716,0.00005519895,0.0005650558,0.00003090896,0.000003956817,0.000004049065,0.0001635941,0.8057704,0.00026196925,0.18166973,0.010647343,0.000072533185],"about_ca_topic_score_codex":0.000023634871,"about_ca_topic_score_gemma":0.00001680902,"teacher_disagreement_score":0.85341233,"about_ca_system_score_codex":0.000027224705,"about_ca_system_score_gemma":0.00006839934,"threshold_uncertainty_score":0.9996362},"labels":[],"label_agreement":null},{"id":"W2995572343","doi":"10.1145/3377006.3377014","title":"Bit complexity for critical point computation in smooth and compact real hypersurfaces","year":2019,"lang":"en","type":"article","venue":"ACM communications in computer algebra","topic":"Polynomial and algebraic computation","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Hypersurface; Jacobian matrix and determinant; Mathematics; Extension (predicate logic); Polynomial; Projection (relational algebra); Rank (graph theory); Algebraic number; Discrete mathematics; Algebra over a field; Pure mathematics; Algorithm; Computer science; Mathematical analysis; Applied mathematics; Combinatorics","score_opus":0.06155402739645428,"score_gpt":0.337018664761806,"score_spread":0.2754646373653517,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2995572343","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5577237,0.00035740403,0.42327797,0.016341012,0.0004754162,0.0009479544,0.000014207126,0.00022386009,0.00063849526],"genre_scores_gemma":[0.67749995,0.000058937807,0.3219598,0.00037525562,0.000029926072,0.000022439184,0.00003491979,0.000012336489,0.000006457682],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99780875,0.00033034498,0.00063789566,0.0005880549,0.0002130129,0.00042192018],"domain_scores_gemma":[0.9949711,0.002861246,0.00013252744,0.001802845,0.00011872335,0.000113552596],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0007319973,0.0002488624,0.0004261634,0.00038556196,0.00018671433,0.0002796712,0.0023711442,0.00010254335,0.00000609287],"category_scores_gemma":[0.00011578328,0.00026582295,0.00007865012,0.00064739917,0.00026381147,0.0008089364,0.0015686913,0.00032794193,0.000030153356],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008160286,0.0011007369,0.051331505,0.00019812424,0.000051917134,0.000007550565,0.0056096446,0.0071171923,0.00054484257,0.71834755,0.0012216057,0.21438771],"study_design_scores_gemma":[0.0011521828,0.00015471119,0.14206728,0.00008957119,0.000004400483,0.000011501478,0.000046631096,0.7139219,0.000029627885,0.14186703,0.00037156508,0.00028357687],"about_ca_topic_score_codex":0.0004994381,"about_ca_topic_score_gemma":0.00035334218,"teacher_disagreement_score":0.70680475,"about_ca_system_score_codex":0.00014032837,"about_ca_system_score_gemma":0.0000980366,"threshold_uncertainty_score":0.9999794},"labels":[],"label_agreement":null},{"id":"W2999271008","doi":"10.5802/jtnb.1115","title":"Numerical verification of the Cohen–Lenstra–Martinet heuristics and of Greenberg’s <mml:math xmlns:mml=\"http://www.w3.org/1998/Math/MathML\"> <mml:mi>p</mml:mi> </mml:math> -rationality conjecture","year":2020,"lang":"en","type":"article","venue":"Journal de Théorie des Nombres de Bordeaux","topic":"Polynomial and algebraic computation","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Okanagan University College; University of British Columbia, Okanagan Campus; University of British Columbia","funders":"","keywords":"Conjecture; Heuristics; Rationality; Mathematics; Heuristic; Field (mathematics); Combinatorics; Mathematical economics; Pure mathematics; Epistemology; Mathematical optimization; Philosophy","score_opus":0.015968234019613742,"score_gpt":0.2365076943428319,"score_spread":0.22053946032321814,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2999271008","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9277034,0.00017694989,0.06958609,0.0019380508,0.00021417768,0.000028202036,0.000022120916,0.000025051597,0.00030597436],"genre_scores_gemma":[0.99254733,0.000062485684,0.0065758955,0.00051892747,0.00025900957,0.0000059770327,0.000008039875,0.000013517732,0.0000088385605],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99870086,0.000108804146,0.00042377677,0.00019607,0.00035070456,0.00021979485],"domain_scores_gemma":[0.99881035,0.00022354649,0.00047858348,0.00023326496,0.0000982782,0.00015597572],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00037718852,0.00012201196,0.00012955509,0.000029955025,0.00021772938,0.00014101382,0.00044192042,0.000118523305,0.000008271595],"category_scores_gemma":[0.00034101467,0.00011520427,0.00013585122,0.00022185499,0.0001987146,0.00022797014,0.00016763584,0.0002968536,0.000008318391],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000072797215,0.000045400022,0.00033439754,0.00008963076,0.000055629673,0.00001964705,0.0010180229,0.0021831887,0.0017285957,0.9899681,0.0005825345,0.0039020411],"study_design_scores_gemma":[0.000408357,0.00032341393,0.017621692,0.00008633537,0.00006599929,0.00038062572,0.00008254879,0.94851214,0.008598464,0.022577107,0.0011866792,0.00015662977],"about_ca_topic_score_codex":0.00007299177,"about_ca_topic_score_gemma":0.00001227658,"teacher_disagreement_score":0.967391,"about_ca_system_score_codex":0.000016672459,"about_ca_system_score_gemma":0.0004459449,"threshold_uncertainty_score":0.46978936},"labels":[],"label_agreement":null},{"id":"W3006785504","doi":"10.1007/978-3-030-41258-6_28","title":"Polynomial Factorization in Maple 2019","year":2020,"lang":"en","type":"book-chapter","venue":"Communications in computer and information science","topic":"Polynomial and algebraic computation","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Maple; Factorization; Polynomial; Factoring; Factorization of polynomials; Integer (computer science); Mathematics; Algebra over a field; Discrete mathematics; Computer science; Algorithm; Pure mathematics; Matrix polynomial; Botany; Biology; Programming language","score_opus":0.027239480163130693,"score_gpt":0.26152158392730496,"score_spread":0.23428210376417427,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3006785504","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00016327623,0.0004357756,0.82395566,0.005676512,0.0009745646,0.0007279695,0.000026076632,0.00020087238,0.16783932],"genre_scores_gemma":[0.78206944,0.003839111,0.20469198,0.0056458283,0.00035248054,0.00006280826,0.00045132806,0.000039444094,0.002847602],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99829066,0.000032073975,0.0007292582,0.0003358652,0.00038879464,0.00022334531],"domain_scores_gemma":[0.9981617,0.00014628316,0.0002934273,0.001126758,0.00015171853,0.00012015091],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00052369584,0.0002184838,0.00026125787,0.001036317,0.00022482255,0.0005758485,0.0027439506,0.00012384758,0.000005795259],"category_scores_gemma":[0.000042950996,0.00023325448,0.00004070838,0.0006471825,0.00034550138,0.0067705587,0.0022357204,0.00042895335,0.000111165056],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000047330204,0.000019812323,0.000114409835,0.00002546494,0.0000038096948,0.0000010031677,0.0028246278,0.0006446702,0.0000144139285,0.5576233,0.0018288892,0.4368948],"study_design_scores_gemma":[0.00059451675,0.000076628305,0.0056452905,0.00017376067,0.0000031018442,0.000012836774,0.000011563461,0.76802295,0.000021936175,0.011422854,0.21352033,0.00049424684],"about_ca_topic_score_codex":0.000038257436,"about_ca_topic_score_gemma":0.000022645603,"teacher_disagreement_score":0.7819061,"about_ca_system_score_codex":0.00021228117,"about_ca_system_score_gemma":0.00039778827,"threshold_uncertainty_score":0.95118415},"labels":[],"label_agreement":null},{"id":"W3007372112","doi":"10.1007/978-3-030-41258-6_10","title":"The Z_Polyhedra Library in Maple","year":2020,"lang":"en","type":"book-chapter","venue":"Communications in computer and information science","topic":"Polynomial and algebraic computation","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"","keywords":"Polyhedron; Maple; Integer (computer science); Computer science; Presburger arithmetic; Parametric statistics; Combinatorics; Discrete mathematics; Mathematics; Theoretical computer science; Programming language","score_opus":0.026015036108191895,"score_gpt":0.2513998400193202,"score_spread":0.2253848039111283,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3007372112","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000100196674,0.0021034048,0.2693701,0.03877434,0.0009984812,0.000874882,0.00001583248,0.00032317388,0.68743956],"genre_scores_gemma":[0.50938267,0.030182851,0.4187567,0.027336506,0.00059089495,0.0002302929,0.00028219342,0.00008491237,0.013152969],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99852645,0.00003644777,0.0006395137,0.00024800308,0.00033031582,0.00021927753],"domain_scores_gemma":[0.99785256,0.0003578735,0.00023386726,0.0013867117,0.000067960165,0.000101015474],"candidate_categories":["scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0005569592,0.00017495807,0.0001807263,0.000512681,0.00048628027,0.0011563636,0.0043607857,0.00007694512,0.0000034013774],"category_scores_gemma":[0.000034606444,0.00014485233,0.000038303762,0.00060367456,0.000630528,0.007818243,0.0037748667,0.00045564506,0.00008663315],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000012125697,0.0000035326964,0.000018329303,0.00000570811,0.0000011538955,3.7722123e-7,0.0006969964,0.00006756134,4.9915514e-7,0.69705445,0.0004489791,0.30170122],"study_design_scores_gemma":[0.00019935488,0.00003155974,0.0015915217,0.000096165306,0.0000011797972,0.000009739062,0.000012172919,0.5212069,0.00000724023,0.070710145,0.40591773,0.000216241],"about_ca_topic_score_codex":0.000009110339,"about_ca_topic_score_gemma":0.000013819978,"teacher_disagreement_score":0.6742866,"about_ca_system_score_codex":0.000072266725,"about_ca_system_score_gemma":0.00037993756,"threshold_uncertainty_score":0.99988055},"labels":[],"label_agreement":null},{"id":"W3010777108","doi":"10.3842/sigma.2021.078","title":"Minimal Kinematics: An All k and n Peek into Trop&lt;sup&gt;+&lt;/sup&gt;G(k,n)","year":2021,"lang":"en","type":"article","venue":"Symmetry Integrability and Geometry Methods and Applications","topic":"Polynomial and algebraic computation","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Perimeter Institute","funders":"Institut Périmètre de physique théorique; Government of Canada; Ministry of Colleges and Universities; Innovation, Science and Economic Development Canada","keywords":"Peek; Kinematics; Physics; Combinatorics; Mathematics; Mathematical physics; Quantum mechanics; Nuclear magnetic resonance","score_opus":0.023035834810300453,"score_gpt":0.3327889177615248,"score_spread":0.30975308295122433,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3010777108","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3040423,0.0015977194,0.69123167,0.0020903598,0.000070573114,0.0003364035,0.000024470475,0.00011356141,0.0004929404],"genre_scores_gemma":[0.34357053,0.00022482155,0.6552645,0.00043887028,0.00015770787,0.00012591966,0.000040473464,0.000015119426,0.00016203974],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9969956,0.0005786066,0.0006253525,0.0011459236,0.0002578673,0.00039659714],"domain_scores_gemma":[0.99698997,0.0012849182,0.00016128315,0.0008668407,0.00025397664,0.00044300093],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.001770769,0.0003432146,0.0005286078,0.00027670505,0.00044923264,0.00045617518,0.00044422195,0.0001915809,0.000043472915],"category_scores_gemma":[0.0005380242,0.00030695566,0.000110352594,0.0012731403,0.0003629572,0.00057418057,0.0005175111,0.00035161676,0.0000090130925],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001071231,0.00028717372,0.0007027021,0.00019072049,0.0000554576,0.0000026562789,0.0010587844,0.000009729494,0.0057967957,0.20342809,0.00008640989,0.7883708],"study_design_scores_gemma":[0.0013968785,0.0007392985,0.026474604,0.00010043103,0.00021471691,0.00030579566,0.0019117283,0.16600898,0.008650845,0.7216252,0.071150444,0.00142105],"about_ca_topic_score_codex":0.0000748366,"about_ca_topic_score_gemma":0.000034481895,"teacher_disagreement_score":0.78694975,"about_ca_system_score_codex":0.000044066,"about_ca_system_score_gemma":0.00010020694,"threshold_uncertainty_score":0.99993825},"labels":[],"label_agreement":null},{"id":"W3011711392","doi":"10.1007/978-3-030-43120-4_8","title":"Comprehensive LU Factors of Polynomial Matrices","year":2020,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Polynomial and algebraic computation","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"","keywords":"LU decomposition; Maple; Classification of discontinuities; Computer science; Polynomial; Decomposition; Factorization; Matrix decomposition; Parametric statistics; Polynomial matrix; Matrix (chemical analysis); Algebra over a field; Algorithm; Applied mathematics; Matrix polynomial; Mathematics; Pure mathematics; Mathematical analysis; Statistics","score_opus":0.019533071307104886,"score_gpt":0.23856634245085412,"score_spread":0.21903327114374924,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3011711392","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0029509848,0.0005745608,0.99216187,0.00067325216,0.002019369,0.00031341088,0.000013351026,0.00015827088,0.0011349126],"genre_scores_gemma":[0.8334618,0.000040464885,0.16472892,0.000954555,0.0006779266,0.000003019579,0.000011423171,0.000036988476,0.00008485607],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9965903,0.00003539364,0.0006807754,0.0012948388,0.00091405516,0.00048461874],"domain_scores_gemma":[0.9976425,0.0006102867,0.00050588936,0.00079558627,0.00022036632,0.00022533596],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00018949721,0.00053843646,0.00075073243,0.00073919195,0.00015555428,0.00027265353,0.0031300362,0.00024831985,0.00001501328],"category_scores_gemma":[0.00004882661,0.00048072138,0.00021772733,0.00076028943,0.00059203804,0.00054739346,0.0015999274,0.0006009414,0.000029793564],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000027279511,0.000066431276,0.0003042913,0.00022425162,0.000054307307,0.0001053803,0.0031848832,0.030351,0.0016185736,0.025447402,0.00019777734,0.93841845],"study_design_scores_gemma":[0.0014013838,0.0013218644,0.0041945875,0.001017698,0.00005266726,0.000096525466,0.0000032696391,0.762697,0.023097381,0.19377033,0.00942741,0.0029198697],"about_ca_topic_score_codex":0.000078113706,"about_ca_topic_score_gemma":0.000019036717,"teacher_disagreement_score":0.93549854,"about_ca_system_score_codex":0.0001694618,"about_ca_system_score_gemma":0.0005834081,"threshold_uncertainty_score":0.99976444},"labels":[],"label_agreement":null},{"id":"W3014383176","doi":"10.2969/jmsj/80868086","title":"Newton polyhedra and order of contact on real hypersurfaces","year":2020,"lang":"en","type":"preprint","venue":"Journal of the Mathematical Society of Japan","topic":"Polynomial and algebraic computation","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Polyhedron; Hypersurface; Mathematics; Regular polygon; Order (exchange); Equivalence (formal languages); Singularity; Type (biology); Function (biology); Gravitational singularity; Pseudoconvex function; Simple (philosophy); Pure mathematics; Convex function; Mathematical analysis; Combinatorics; Geometry; Subderivative; Convex optimization","score_opus":0.026031537603699185,"score_gpt":0.2605852100663348,"score_spread":0.2345536724626356,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3014383176","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.94121444,0.00017477303,0.03534777,0.022142196,0.00036612756,0.00017979686,0.0000057642724,0.000014240615,0.00055489864],"genre_scores_gemma":[0.9568021,0.00011317822,0.0426362,0.00026194428,0.00012679803,6.632993e-7,2.6569668e-7,0.000009352469,0.000049457718],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9984506,0.000078806544,0.00067172287,0.00016244897,0.0005114235,0.00012501565],"domain_scores_gemma":[0.9979759,0.00036987782,0.0011285355,0.00028200445,0.00014327887,0.00010041506],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00045499686,0.0001644956,0.0005957593,0.000023486537,0.00004839868,0.000054292752,0.00093958096,0.00012937907,0.000008860893],"category_scores_gemma":[0.00012886137,0.00009983154,0.0004953066,0.00012944317,0.0001176752,0.000088863475,0.00077851396,0.00048973487,0.0000014073521],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00062345335,0.0034305,0.0021114617,0.01176516,0.0051998957,0.000012988059,0.13694286,0.00795708,0.1361801,0.5219804,0.049306877,0.12448923],"study_design_scores_gemma":[0.0020550352,0.0014805582,0.016785428,0.003432794,0.00035224538,0.00012800303,0.0012417143,0.2221523,0.017893251,0.73335564,0.00049761793,0.0006254143],"about_ca_topic_score_codex":0.000025351259,"about_ca_topic_score_gemma":3.6762208e-7,"teacher_disagreement_score":0.2141952,"about_ca_system_score_codex":0.00003771942,"about_ca_system_score_gemma":0.00017288758,"threshold_uncertainty_score":0.40710118},"labels":[],"label_agreement":null},{"id":"W3014808786","doi":"10.1017/cbo9780511803642.007","title":"Computational linear algebra","year":2007,"lang":"en","type":"book-chapter","venue":"Cambridge University Press eBooks","topic":"Polynomial and algebraic computation","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"","keywords":"Linear algebra; Algebra over a field; Mathematics; Computer science; Pure mathematics; Geometry","score_opus":0.02678711883980855,"score_gpt":0.21603281437474692,"score_spread":0.18924569553493836,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3014808786","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00003325545,0.00005191235,0.3132214,0.00003442502,0.00033463212,0.00016802858,0.00003718199,0.0002646318,0.68585455],"genre_scores_gemma":[0.00091087335,0.000010829648,0.010451341,0.0002743134,0.00026859264,2.3503961e-7,0.000064625514,0.000027685117,0.9879915],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99835974,0.000026074358,0.0002445716,0.0006314924,0.00042515027,0.00031299717],"domain_scores_gemma":[0.9987112,0.00014329942,0.00023949007,0.00048259387,0.0002019995,0.00022137963],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.000138067,0.00034828167,0.00032074985,0.0003022435,0.00021780572,0.000082272985,0.0011143896,0.00028697483,0.0000037642003],"category_scores_gemma":[0.00000564566,0.00042262796,0.0002229635,0.000020432843,0.00014915477,0.0002095508,0.00073460507,0.00042315325,0.00008178789],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000016345994,0.000008463389,3.255595e-7,0.000019922021,0.00006036376,0.00024122195,0.00003459142,0.00019138544,0.0000031784496,0.97169816,0.012177513,0.015548495],"study_design_scores_gemma":[0.000542798,0.00005878296,0.000028440567,0.00007971058,0.000044959335,0.000041206422,0.0000028473771,0.026132295,0.000082160914,0.00079326774,0.9716232,0.0005703193],"about_ca_topic_score_codex":0.00004671096,"about_ca_topic_score_gemma":9.614964e-7,"teacher_disagreement_score":0.97090495,"about_ca_system_score_codex":0.00017685216,"about_ca_system_score_gemma":0.00020619902,"threshold_uncertainty_score":0.99982256},"labels":[],"label_agreement":null},{"id":"W3016943584","doi":"10.1016/j.jalgebra.2020.04.014","title":"Algorithms for computing bases for 3-variable homogeneous integer-valued polynomials","year":2020,"lang":"en","type":"article","venue":"Journal of Algebra","topic":"Polynomial and algebraic computation","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Dalhousie University","keywords":"Degree (music); Homogeneous; Integer (computer science); Mathematics; Variable (mathematics); Polynomial; Homogeneous polynomial; Connection (principal bundle); Range (aeronautics); Combinatorics; Discrete mathematics; Mathematical analysis; Computer science; Physics; Geometry; Matrix polynomial","score_opus":0.03669622431571282,"score_gpt":0.2770379393879311,"score_spread":0.24034171507221827,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3016943584","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.020832436,0.00034597702,0.9714886,0.0057255304,0.0011454594,0.0003276551,0.000016385107,0.000060584145,0.000057388435],"genre_scores_gemma":[0.39849877,0.0000068451773,0.59535587,0.0037688506,0.0022860232,0.00000551312,0.0000046948617,0.000024442072,0.00004898424],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983092,0.000058423404,0.0007545775,0.0002747858,0.0002571238,0.0003458968],"domain_scores_gemma":[0.9978938,0.00065735506,0.0006392403,0.00015854166,0.00038895555,0.00026211262],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006540293,0.00018453664,0.00045278424,0.00012242976,0.00018064708,0.00023436987,0.0008571055,0.00006821128,0.000010275282],"category_scores_gemma":[0.0005438154,0.00016052791,0.00030825436,0.00030808893,0.000028848457,0.00046700976,0.00014965667,0.00014826056,0.0000054593006],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0008138541,0.0004834315,0.00011168893,0.00041851713,0.00070009363,0.00008809431,0.004550275,0.020059101,0.03277223,0.15427104,0.107576594,0.67815506],"study_design_scores_gemma":[0.003145289,0.0020642127,0.00009698386,0.00012182402,0.00008444909,0.0002418193,0.00009937853,0.90843314,0.02245697,0.030979788,0.031832945,0.00044317706],"about_ca_topic_score_codex":0.0000063692305,"about_ca_topic_score_gemma":4.5120797e-7,"teacher_disagreement_score":0.8883741,"about_ca_system_score_codex":0.000056344274,"about_ca_system_score_gemma":0.00033131125,"threshold_uncertainty_score":0.6546138},"labels":[],"label_agreement":null},{"id":"W3022975118","doi":"","title":"SAT Solvers and Computer Algebra Systems: A Powerful Combination for Mathematics","year":2018,"lang":"en","type":"article","venue":"arXiv (Cornell University)","topic":"Polynomial and algebraic computation","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Wilfrid Laurier University; University of Waterloo","funders":"","keywords":"Mathematical proof; Pruning; Automated theorem proving; Computer science; Domain (mathematical analysis); Variety (cybernetics); Theoretical computer science; Mathematics; Artificial intelligence","score_opus":0.03470944831623364,"score_gpt":0.1777916292314339,"score_spread":0.14308218091520025,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3022975118","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.32357696,0.000010181268,0.6754511,0.000059822778,0.0003514423,0.00017900417,0.0000021941253,0.000094884985,0.0002743938],"genre_scores_gemma":[0.99287826,0.0000046148048,0.0065293564,0.000101778984,0.000099478704,4.697509e-7,0.0000040673726,0.000006679979,0.00037528374],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99923533,0.00003075247,0.00012274615,0.00036232508,0.00005126618,0.00019755498],"domain_scores_gemma":[0.9992551,0.00016837964,0.00010232279,0.00024961345,0.00013418942,0.00009037136],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001641611,0.000117667085,0.00013891283,0.00011495637,0.00016879366,0.00012174938,0.000349313,0.000054750028,0.0000035438136],"category_scores_gemma":[0.000013913636,0.00012439904,0.000047546633,0.00027896508,0.0000965382,0.00047197586,0.00017963561,0.000045486755,0.000054107586],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000012200205,0.00007466693,0.00032638595,0.000044089382,0.000030202054,0.000008744815,0.00069640233,0.00075953995,0.00008360061,0.99500835,0.0013811006,0.001574715],"study_design_scores_gemma":[0.0007389495,0.00023156828,0.00076906575,0.000027574588,0.000015698346,0.000011374804,0.00006993906,0.95949686,0.000113875976,0.037662897,0.00069686526,0.00016533355],"about_ca_topic_score_codex":0.00001869217,"about_ca_topic_score_gemma":0.000006744549,"teacher_disagreement_score":0.9587373,"about_ca_system_score_codex":0.000054140015,"about_ca_system_score_gemma":0.000034110082,"threshold_uncertainty_score":0.5072845},"labels":[],"label_agreement":null},{"id":"W3029699236","doi":"10.1090/tran/8179","title":"𝜔-categorical structures avoiding height 1 identities","year":2020,"lang":"en","type":"article","venue":"Transactions of the American Mathematical Society","topic":"Polynomial and algebraic computation","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Engineering and Physical Sciences Research Council; European Research Council; Natural Sciences and Engineering Research Council of Canada; H2020 European Research Council; Austrian Science Fund; Grantová Agentura České Republiky","keywords":"Conjecture; Bounded function; Constraint satisfaction problem; Algebraic number; Homogeneous; Set (abstract data type)","score_opus":0.0182941084101748,"score_gpt":0.24045525638215157,"score_spread":0.22216114797197678,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3029699236","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.048934072,0.000018120445,0.9447324,0.005814127,0.00006935821,0.00008232208,0.0000022149165,0.000096509815,0.00025082246],"genre_scores_gemma":[0.96543777,0.000008401633,0.033709943,0.00073880545,0.000042228894,0.000004794967,1.8784647e-7,0.0000060678512,0.000051821353],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99911,0.0000649338,0.00023180309,0.00017452783,0.0002617517,0.00015698453],"domain_scores_gemma":[0.9993096,0.00020359934,0.00013677197,0.00023481924,0.000030220699,0.000085011445],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000093715644,0.00010116264,0.00021824091,0.000009998134,0.00021902341,0.00005203984,0.0007006954,0.00002039419,0.000048886446],"category_scores_gemma":[0.000030585445,0.000067887,0.0003399303,0.0005204365,0.00027600612,0.00017970042,0.00005482392,0.0002012682,0.00001544055],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000028090319,0.00034667374,0.00009357275,0.00040990877,0.00046819207,0.0000024680128,0.032652944,0.0058036307,0.019268587,0.87311435,0.0055115987,0.062299974],"study_design_scores_gemma":[0.0002987684,0.00015397377,0.001390649,0.000015314445,0.00007258394,0.000025307063,0.0013743173,0.2862161,0.014404913,0.6954819,0.000262791,0.00030335455],"about_ca_topic_score_codex":0.000013274709,"about_ca_topic_score_gemma":2.4208518e-7,"teacher_disagreement_score":0.91650367,"about_ca_system_score_codex":0.000023335215,"about_ca_system_score_gemma":0.00003608554,"threshold_uncertainty_score":0.27683514},"labels":[],"label_agreement":null},{"id":"W3040665003","doi":"10.1063/5.0025647","title":"Synchronous linear constraint system games","year":2021,"lang":"en","type":"article","venue":"Journal of Mathematical Physics","topic":"Polynomial and algebraic computation","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Parameterized complexity; Quotient; Algebraic number; Algebra over a field; Linear algebra; Class (philosophy); Isomorphism (crystallography); Graph","score_opus":0.015356093875726513,"score_gpt":0.24415655055491137,"score_spread":0.22880045667918486,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3040665003","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.023038803,0.00008946524,0.9732776,0.00052382384,0.00027678485,0.000029460207,6.969363e-7,0.000030328789,0.0027330143],"genre_scores_gemma":[0.8885311,0.0000027894384,0.110948004,0.000078667,0.00040202483,4.8981593e-7,2.1759074e-7,0.000004890331,0.00003181926],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99902374,0.000052450367,0.00040045782,0.00009692134,0.00029503257,0.00013138886],"domain_scores_gemma":[0.9990257,0.00022499177,0.0002411537,0.00017948735,0.00022470816,0.00010396744],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00022588027,0.00008379338,0.0002628913,0.000021586358,0.000046792637,0.000080932194,0.00029039587,0.000028648437,0.000010477922],"category_scores_gemma":[0.00008468012,0.000064447704,0.00015013854,0.00015683666,0.000037682446,0.0002365752,0.000093678565,0.00014959792,0.00005956133],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000029035102,0.00022530498,0.00000442803,0.00017699029,0.000057572244,0.00025621295,0.00045283802,0.0005871103,0.0010839383,0.93340224,0.0003345771,0.063415885],"study_design_scores_gemma":[0.000993439,0.0002509759,0.00013171112,0.00084666454,0.000068063375,0.003433547,0.0004299474,0.4337607,0.023436598,0.5355388,0.0007746895,0.00033485368],"about_ca_topic_score_codex":2.0103107e-7,"about_ca_topic_score_gemma":4.513368e-8,"teacher_disagreement_score":0.8654923,"about_ca_system_score_codex":0.000051671046,"about_ca_system_score_gemma":0.00017453199,"threshold_uncertainty_score":0.2628101},"labels":[],"label_agreement":null},{"id":"W3045495538","doi":"10.1145/3373207.3404065","title":"On the parallelization of triangular decompositions","year":2020,"lang":"en","type":"article","venue":"","topic":"Polynomial and algebraic computation","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"","keywords":"Concurrency; Computer science; Parallel computing; Set (abstract data type); Component (thermodynamics); Polynomial; Focus (optics); Multi-core processor; Parallelism (grammar); Class (philosophy); Decomposition; Theoretical computer science; Mathematics; Distributed computing; Programming language","score_opus":0.022355322771086858,"score_gpt":0.22801659975805902,"score_spread":0.20566127698697217,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3045495538","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.030313276,0.000008758856,0.9397017,0.026596153,0.00004332018,0.000068151996,4.288316e-7,0.000050439477,0.0032178152],"genre_scores_gemma":[0.9912569,9.702494e-7,0.0056084907,0.0030759706,0.000025106357,0.0000023831049,0.0000011788765,0.0000011988244,0.000027787602],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999674,0.00002982828,0.00008772008,0.0000828416,0.00008080091,0.000044773085],"domain_scores_gemma":[0.99971557,0.000107641434,0.000030997777,0.000100417674,0.000018757342,0.000026637172],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000044776276,0.000031311767,0.00004233984,0.000013276997,0.000042711,0.000022116634,0.00023412523,0.000009157947,0.0000421552],"category_scores_gemma":[0.0000316693,0.000019389916,0.000028527093,0.00018932314,0.000009696424,0.0000703755,0.000040510935,0.000024135461,0.000039472776],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000030074452,0.000013562687,0.0000051224674,0.0000012321487,0.0000036280474,3.4997277e-7,0.00026542405,0.0015428255,0.0012089566,0.9878123,0.0028746722,0.0062689437],"study_design_scores_gemma":[0.00036672264,0.0002091765,0.0012860603,0.000008347999,0.000004055075,0.000001282532,0.00002341822,0.8799171,0.023746954,0.09260938,0.0017292398,0.000098253935],"about_ca_topic_score_codex":0.0000038287726,"about_ca_topic_score_gemma":5.269871e-7,"teacher_disagreement_score":0.96094364,"about_ca_system_score_codex":0.0000031233772,"about_ca_system_score_gemma":0.000014136183,"threshold_uncertainty_score":0.07906978},"labels":[],"label_agreement":null},{"id":"W3045590231","doi":"10.1007/s00023-020-00945-x","title":"General solution of the exceptional Hermite differential equation and its minimal surface representation","year":2020,"lang":"en","type":"article","venue":"Annales Henri Poincaré","topic":"Polynomial and algebraic computation","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec à Trois-Rivières; Université de Montréal","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Hermite polynomials; Hermite interpolation; Codimension; Differential equation; Riccati equation; Partition (number theory); Euclidean space; Polynomial; Partial differential equation","score_opus":0.04443998813789545,"score_gpt":0.26097306486951405,"score_spread":0.2165330767316186,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3045590231","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.89908683,0.00016214013,0.09521124,0.00508307,0.00017777336,0.00012809575,0.0000065952245,0.000038672555,0.00010555673],"genre_scores_gemma":[0.99778384,0.000017209357,0.0015399407,0.00031010638,0.0002097489,0.0000026027074,0.000011438304,0.0000046132723,0.00012047353],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990095,0.00010034556,0.00022464753,0.00025799952,0.00027520212,0.00013229343],"domain_scores_gemma":[0.9995227,0.00006675654,0.00014018803,0.00012434326,0.000080929756,0.00006506692],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00007866261,0.0000933561,0.00011009145,0.000023669683,0.000117065465,0.000051084728,0.00025074894,0.000038820097,0.000013560837],"category_scores_gemma":[0.000053192834,0.00007584505,0.00006993666,0.00022249437,0.00004037189,0.00037066307,0.00022590872,0.00007267752,0.000011296517],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00015425432,0.00015803915,0.011209636,0.00012177392,0.00009028792,0.000005186488,0.0074820216,0.0058090757,0.8433258,0.061867256,0.003457694,0.06631896],"study_design_scores_gemma":[0.00032876612,0.000075214964,0.19188261,0.000016292724,0.000010190031,0.000006384174,0.00001653152,0.78954,0.016366461,0.0014761455,0.00016481477,0.00011656363],"about_ca_topic_score_codex":0.00002579684,"about_ca_topic_score_gemma":0.000005519908,"teacher_disagreement_score":0.8269594,"about_ca_system_score_codex":0.0000131726065,"about_ca_system_score_gemma":0.00005010425,"threshold_uncertainty_score":0.30928713},"labels":[],"label_agreement":null},{"id":"W3046897419","doi":"10.1016/j.jco.2021.101574","title":"Fast amortized multi-point evaluation","year":2021,"lang":"en","type":"article","venue":"Journal of Complexity","topic":"Polynomial and algebraic computation","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"Direction Générale de l’Armement","keywords":"Mathematics; Amortized analysis; Point (geometry); Combinatorics; Geometry; Computer science; Data structure; Programming language","score_opus":0.09116819641684006,"score_gpt":0.325743134216808,"score_spread":0.23457493779996796,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3046897419","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2049814,0.00020760282,0.7912651,0.0021965443,0.00077948015,0.000053312146,8.255125e-7,0.00001974644,0.0004960275],"genre_scores_gemma":[0.8190744,0.000006037529,0.18037489,0.00028705018,0.00019428853,8.9632323e-7,0.0000016913151,0.0000033946428,0.00005738453],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986335,0.00021950633,0.00043761835,0.00011186948,0.00046214805,0.00013535873],"domain_scores_gemma":[0.9985018,0.00007007628,0.00037454744,0.00020637613,0.0007447473,0.00010249954],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008767974,0.0000808637,0.00020143032,0.00007868863,0.000081663595,0.00012521888,0.00036543395,0.00002605143,0.000094438125],"category_scores_gemma":[0.00020362157,0.00006994491,0.00014035191,0.000265562,0.000034368175,0.00049885415,0.00013507684,0.00015173157,0.000019362267],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000079300065,0.0010367269,0.0011916449,0.00003717733,0.000192861,0.00022851843,0.003436738,0.0024794217,0.0170766,0.12418752,0.004252611,0.8458009],"study_design_scores_gemma":[0.0035573887,0.00016607674,0.12152344,0.00007183198,0.00004446588,0.00073934754,0.00012752066,0.62797457,0.013558795,0.23010777,0.0018727276,0.00025604657],"about_ca_topic_score_codex":0.00000660976,"about_ca_topic_score_gemma":0.000017214566,"teacher_disagreement_score":0.8455448,"about_ca_system_score_codex":0.00008395632,"about_ca_system_score_gemma":0.00036810577,"threshold_uncertainty_score":0.28522706},"labels":[],"label_agreement":null},{"id":"W3061782841","doi":"","title":"On partition regular systems","year":2017,"lang":"en","type":"dissertation","venue":"Mspace (University of Manitoba)","topic":"Polynomial and algebraic computation","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Research Manitoba","keywords":"Partition (number theory); Mathematics; Computer science; Combinatorics","score_opus":0.014061877817056371,"score_gpt":0.20400733017266873,"score_spread":0.18994545235561236,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3061782841","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8747469,0.00040944852,0.05465398,0.0014933695,0.0061252336,0.00071931095,0.000029217123,0.00038240908,0.06144011],"genre_scores_gemma":[0.98696816,0.00004989712,0.00064127496,0.000014543645,0.00012287988,6.147587e-7,0.0001634836,0.000013226921,0.012025929],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"observational","domain_scores_codex":[0.999012,0.00005716747,0.000086094275,0.00035185856,0.00032825986,0.00016465622],"domain_scores_gemma":[0.99874544,0.00004195205,0.00043995026,0.00059051084,0.0001148373,0.00006731627],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00012591312,0.00015753316,0.00025372594,0.00018413052,0.0003604573,0.00010835719,0.0009777738,0.00017224971,0.0000028931868],"category_scores_gemma":[0.000018636296,0.00020018272,0.000117651434,0.00008957422,0.000034786197,0.0003829066,0.000063056505,0.00015644878,0.00013783712],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":true,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005238422,0.00057919644,0.00088885095,0.0016641748,0.00049426797,0.0005141887,0.003387912,0.0037625923,0.0025585317,0.7179555,0.122268885,0.14540201],"study_design_scores_gemma":[0.005532241,0.0022182523,0.57476103,0.006127927,0.00055789424,0.000044228007,0.019087426,0.18783885,0.004410002,0.06354305,0.13168015,0.0041989493],"about_ca_topic_score_codex":0.0011275059,"about_ca_topic_score_gemma":0.025070632,"teacher_disagreement_score":0.6544125,"about_ca_system_score_codex":0.00008607,"about_ca_system_score_gemma":0.000092346345,"threshold_uncertainty_score":0.9927193},"labels":[],"label_agreement":null},{"id":"W3081496661","doi":"10.1093/imrn/rnab026","title":"The Formal Shift Operator on the Yangian Double","year":2021,"lang":"en","type":"article","venue":"International Mathematics Research Notices","topic":"Polynomial and algebraic computation","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Yangian; Homomorphism; Algebra over a field; Algebra homomorphism; Isomorphism (crystallography); Operator (biology); Hopf algebra","score_opus":0.09149200745750383,"score_gpt":0.3723669752791497,"score_spread":0.2808749678216459,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3081496661","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.45421746,0.0003261739,0.10886202,0.28107277,0.0030119997,0.0007772431,0.000014070601,0.00019446052,0.1515238],"genre_scores_gemma":[0.99292386,0.00001840658,0.0035259367,0.00037008975,0.0002514292,0.00004520525,0.000002643723,0.000007406478,0.0028550385],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9980253,0.00011767417,0.0002170575,0.00020216955,0.0011163086,0.0003215032],"domain_scores_gemma":[0.9967072,0.0023527446,0.00005913736,0.00043994156,0.00037766754,0.00006328701],"candidate_categories":["scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0017108613,0.00008258144,0.00007015887,0.00006886194,0.00067351514,0.0015291435,0.0018839936,0.000027428507,0.000110467074],"category_scores_gemma":[0.0005258019,0.000043748405,0.000059263166,0.00029538636,0.00010416831,0.0004479383,0.000735323,0.0002816178,0.000686538],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000007784624,0.000081032034,0.000009901482,0.0000066836787,0.000032375436,0.000013442031,0.0010167146,0.00016064124,0.000121268095,0.9901999,0.0020904623,0.0062597576],"study_design_scores_gemma":[0.0007236937,0.00012887988,0.0012420362,0.00015947667,0.0000049026185,0.00002748987,0.0011184335,0.4830018,0.020765595,0.4100951,0.082468376,0.00026421348],"about_ca_topic_score_codex":0.000014155648,"about_ca_topic_score_gemma":0.000068819674,"teacher_disagreement_score":0.5801048,"about_ca_system_score_codex":0.000059446393,"about_ca_system_score_gemma":0.00017224881,"threshold_uncertainty_score":0.99950737},"labels":[],"label_agreement":null},{"id":"W3081736912","doi":"10.1016/j.jsc.2022.10.002","title":"Computing critical points for invariant algebraic systems","year":2022,"lang":"en","type":"article","venue":"Journal of Symbolic Computation","topic":"Polynomial and algebraic computation","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"H2020 Marie Skłodowska-Curie Actions; Agence Nationale de la Recherche; H2020 Fast Track to Innovation; Horizon 2020; Natural Sciences and Engineering Research Council of Canada; European Commission","keywords":"Mathematics; Combinatorics; Invariant (physics); Polynomial; Jacobian matrix and determinant; Discrete mathematics; Algebraic number; Finite field; Invariant polynomial; Exponential function; Matrix polynomial; Mathematical analysis; Mathematical physics","score_opus":0.02115593940969856,"score_gpt":0.2819425198729099,"score_spread":0.26078658046321135,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3081736912","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.078560404,0.0003059686,0.9149127,0.0028648342,0.002967717,0.00024235439,0.0000047541585,0.00005568236,0.000085593274],"genre_scores_gemma":[0.96265316,0.000001775728,0.03638905,0.00040459726,0.0005097711,0.000009087871,0.0000048967963,0.000012734545,0.000014952928],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9977971,0.00027392487,0.0008202673,0.000233097,0.0005946007,0.0002810163],"domain_scores_gemma":[0.99781746,0.0009526558,0.00057879597,0.00013751045,0.0003745338,0.00013903256],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015094402,0.00014152011,0.0003341331,0.0003586609,0.00046387778,0.00025393037,0.0006528152,0.000032337473,0.000007087129],"category_scores_gemma":[0.00023201143,0.00014088624,0.00017241215,0.0004633296,0.000029889314,0.0005031501,0.0002834836,0.00026921782,0.000004561616],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00011066492,0.0004798934,0.00020891854,0.00015876655,0.00013347277,0.000098281445,0.0050260723,0.37495595,0.0012476376,0.46057585,0.008751578,0.14825289],"study_design_scores_gemma":[0.0010123384,0.0006258197,0.0015829082,0.000048566188,0.000021091228,0.00095490523,0.00026440725,0.94821185,0.00006819762,0.04486146,0.0021558271,0.0001926244],"about_ca_topic_score_codex":0.00001362393,"about_ca_topic_score_gemma":3.3879888e-7,"teacher_disagreement_score":0.88409275,"about_ca_system_score_codex":0.0001811137,"about_ca_system_score_gemma":0.00026457207,"threshold_uncertainty_score":0.5745174},"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,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_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","score_opus":0.022770234732376955,"score_gpt":0.26957829501562924,"score_spread":0.24680806028325228,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3082171719","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.75779295,0.00041560657,0.23204498,0.004429188,0.0025781046,0.00048951735,0.00007240863,0.0006237337,0.0015535392],"genre_scores_gemma":[0.99790454,0.00010131176,0.00059684674,0.00035825907,0.00028791625,0.00009656283,0.00002519575,0.000018474095,0.0006108923],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99870396,0.000053812175,0.00026182857,0.0004193445,0.000130964,0.00043006914],"domain_scores_gemma":[0.99883646,0.00034202373,0.000111797635,0.00035791742,0.0001754053,0.00017639394],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00012573518,0.00025089993,0.00026911666,0.0001473805,0.0005088691,0.00033163323,0.00047673238,0.000077624034,0.0000014765658],"category_scores_gemma":[0.000052737683,0.00021758873,0.00021165451,0.0006516338,0.000075386386,0.0006893808,0.0002457102,0.0003299636,0.00002527159],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000013671917,0.0001322832,0.00033905535,0.000031203934,0.00007683613,0.000008532835,0.0016160065,0.000376046,0.0002187623,0.96582276,0.006399489,0.024965372],"study_design_scores_gemma":[0.00065078295,0.0001976108,0.0025081595,0.00007838435,0.00001941177,0.00004208111,0.00028124117,0.24825552,0.0012534951,0.67415637,0.072160624,0.00039634027],"about_ca_topic_score_codex":0.000050735085,"about_ca_topic_score_gemma":0.000040157673,"teacher_disagreement_score":0.2916664,"about_ca_system_score_codex":0.00008451814,"about_ca_system_score_gemma":0.0001238435,"threshold_uncertainty_score":0.8873011},"labels":[],"label_agreement":null},{"id":"W3082224601","doi":"10.1016/j.jco.2021.101557","title":"Homotopy techniques for solving sparse column support determinantal polynomial systems","year":2021,"lang":"en","type":"preprint","venue":"Journal of Complexity","topic":"Polynomial and algebraic computation","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada; Agence Nationale de la Recherche; European Commission","keywords":"Combinatorics; Mathematics; Polynomial; Algebraic number; Invariant (physics); Mathematical analysis; Mathematical physics","score_opus":0.05357499197331212,"score_gpt":0.2973128765286256,"score_spread":0.24373788455531348,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3082224601","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.28742993,0.00039026685,0.7048401,0.00050277845,0.0058084773,0.0006415331,0.000044595978,0.00010873489,0.00023355651],"genre_scores_gemma":[0.7944109,0.000033826287,0.2033204,0.00012984047,0.0019238638,0.000029410761,0.000019994932,0.000025155678,0.00010661781],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9971629,0.00013783868,0.0012829879,0.00045310194,0.0005431976,0.0004200187],"domain_scores_gemma":[0.9965609,0.0002176815,0.0017359834,0.0005619694,0.000693631,0.00022987356],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.001125436,0.00034642647,0.0009866637,0.00029050873,0.0002047225,0.0010529988,0.0017230657,0.0002575361,0.000013385182],"category_scores_gemma":[0.0001137113,0.00033892225,0.00065219833,0.00015446768,0.00010905035,0.00056267984,0.0013349965,0.00072015857,0.000002370148],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.001667347,0.0049825534,0.004739898,0.008572236,0.0029905324,0.005298648,0.013678691,0.0030039542,0.029317342,0.06986955,0.17686364,0.6790156],"study_design_scores_gemma":[0.0063749603,0.005502937,0.022695515,0.0066034505,0.00072287366,0.013376635,0.0007008806,0.6950616,0.06597428,0.102610335,0.07510431,0.0052721747],"about_ca_topic_score_codex":0.00012411222,"about_ca_topic_score_gemma":0.00003591172,"teacher_disagreement_score":0.69205767,"about_ca_system_score_codex":0.00028403325,"about_ca_system_score_gemma":0.0014346199,"threshold_uncertainty_score":0.999984},"labels":[],"label_agreement":null},{"id":"W3082404028","doi":"10.1007/s11786-020-00475-z","title":"Foreword","year":2020,"lang":"en","type":"article","venue":"Mathematics in Computer Science","topic":"Polynomial and algebraic computation","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Mathematics","score_opus":0.030622989290350833,"score_gpt":0.2539979995728978,"score_spread":0.22337501028254697,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3082404028","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04576973,0.00001294449,0.95027006,0.003015925,0.00029915562,0.00011015334,5.073337e-7,0.00013399498,0.00038755705],"genre_scores_gemma":[0.5389576,6.92012e-7,0.45996076,0.0010005863,0.00007031812,0.0000029206412,1.2037725e-7,0.0000027579524,0.000004219455],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99855983,0.000014364368,0.00026968322,0.00043405377,0.00040971517,0.0003123786],"domain_scores_gemma":[0.99926686,0.00009605604,0.00007145175,0.0003531113,0.000049019385,0.00016347846],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00043521132,0.000110233195,0.00015150705,0.0001315372,0.000098648095,0.00022438407,0.0019318807,0.000021986203,0.000004140834],"category_scores_gemma":[0.000065084474,0.000098641576,0.00003439107,0.0015643004,0.00012687227,0.00071227486,0.00083887856,0.000111765214,0.000100704165],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000001980414,0.00016216097,0.0002659611,0.00008185646,0.0000037480665,0.000044189306,0.013886682,0.007956601,0.0014618287,0.49931058,0.0005816872,0.47624272],"study_design_scores_gemma":[0.00013853873,0.00005181066,0.0006240605,0.000021182304,4.8368446e-7,0.000009094088,0.0000053686986,0.95493376,0.0011656944,0.042807937,0.00011929774,0.00012274408],"about_ca_topic_score_codex":0.0000026607097,"about_ca_topic_score_gemma":0.0000014919735,"teacher_disagreement_score":0.9469772,"about_ca_system_score_codex":0.00004205314,"about_ca_system_score_gemma":0.00011658208,"threshold_uncertainty_score":0.40224868},"labels":[],"label_agreement":null},{"id":"W3093016922","doi":"10.4171/aihpd/185","title":"Planar kinematics: Cyclic fixed points, mirror superpotential, $k$-dimensional Catalan numbers, and root polytopes","year":2024,"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":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Perimeter Institute","funders":"Institut Périmètre de physique théorique; Government of Canada; Ministry of Colleges and Universities; Innovation, Science and Economic Development Canada","keywords":"Mathematics; Combinatorics; Polytope; Bounded function; Catalan number; Conjecture; Mathematical analysis","score_opus":0.013026210741369238,"score_gpt":0.24423420708489238,"score_spread":0.23120799634352315,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3093016922","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.89259726,0.0029274276,0.094605595,0.0050139567,0.0024948209,0.0003211494,0.000100166995,0.00043463078,0.0015049792],"genre_scores_gemma":[0.99777824,0.00010821577,0.0013034756,0.00029362197,0.00015187518,0.000023144417,0.00006459979,0.00002161244,0.00025524275],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99856126,0.00006745402,0.00031607714,0.0005051006,0.00018497987,0.00036512787],"domain_scores_gemma":[0.9989862,0.00030473043,0.00007888955,0.00032376847,0.00008680262,0.00021960643],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00015850953,0.0003025982,0.00027902905,0.0001606355,0.0004516118,0.00062748033,0.0003295532,0.00006715993,0.000007939674],"category_scores_gemma":[0.000023099026,0.00026512978,0.00013172906,0.0003792215,0.00012617891,0.0010181537,0.00026337712,0.00035573446,0.000042398737],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000013825924,0.00030095913,0.0007336072,0.00015363582,0.00026223675,0.0000788947,0.003115502,0.000051302184,0.0035468305,0.97194654,0.003804242,0.015992412],"study_design_scores_gemma":[0.00073624664,0.00020492055,0.003581647,0.00050993497,0.00008003596,0.0008034152,0.00022206151,0.1383482,0.0034293414,0.81039447,0.040842086,0.00084761676],"about_ca_topic_score_codex":0.00039173712,"about_ca_topic_score_gemma":0.00011799206,"teacher_disagreement_score":0.16155206,"about_ca_system_score_codex":0.00007334448,"about_ca_system_score_gemma":0.00015210507,"threshold_uncertainty_score":0.9999801},"labels":[],"label_agreement":null},{"id":"W3094990874","doi":"10.1007/978-3-030-60026-6_7","title":"Power Series Arithmetic with the BPAS Library","year":2020,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Polynomial and algebraic computation","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"","keywords":"Computer science; Arithmetic; Series (stratigraphy); Power (physics); Mathematics","score_opus":0.007876717954030232,"score_gpt":0.19267990443386337,"score_spread":0.18480318647983315,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3094990874","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000059254846,0.00032607824,0.9578573,0.03127225,0.001018842,0.00030438503,0.0000037542363,0.0002671234,0.008891016],"genre_scores_gemma":[0.4591623,0.000046126646,0.5113359,0.024355069,0.0018921557,0.000028090602,0.000012551425,0.00012140024,0.0030463685],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99729156,0.000038950395,0.00030063593,0.0011640828,0.00075486326,0.00044991306],"domain_scores_gemma":[0.998273,0.00036250136,0.00020438443,0.0009142289,0.000079415986,0.0001664439],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.00024060771,0.00045384394,0.0003727032,0.00030099656,0.00034086028,0.0012244354,0.0034567823,0.00012914685,0.00003519871],"category_scores_gemma":[0.000024267352,0.00028786488,0.00009398178,0.0006187052,0.0010984511,0.0012855122,0.0014991252,0.00072698697,0.000068497495],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000030144329,0.000028211525,0.00001935462,0.000041946627,0.000034392007,0.00030983306,0.003936956,0.013147377,0.000043768996,0.450973,0.00061719824,0.5308178],"study_design_scores_gemma":[0.0005891328,0.0013149907,0.00034036455,0.0005315382,0.000023899951,0.00044572126,0.0000014882288,0.2840735,0.0016958513,0.6159245,0.093206204,0.0018527976],"about_ca_topic_score_codex":0.000005023128,"about_ca_topic_score_gemma":0.000016612454,"teacher_disagreement_score":0.528965,"about_ca_system_score_codex":0.0000635164,"about_ca_system_score_gemma":0.0006263532,"threshold_uncertainty_score":0.9999573},"labels":[],"label_agreement":null},{"id":"W3101040267","doi":"","title":"Power Series Composition and Change of Basis","year":2008,"lang":"en","type":"preprint","venue":"","topic":"Polynomial and algebraic computation","field":"Computer Science","cited_by":15,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"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":"Laguerre polynomials; Euler's formula; Composition (language); Series (stratigraphy); Fibonacci number; Multiplication (music); Power series; Hermite polynomials; Exponential function; Mathematics; Computer science; Algorithm; Discrete mathematics; Pure mathematics; Combinatorics; Mathematical analysis","score_opus":0.023930130742076235,"score_gpt":0.23567727306029698,"score_spread":0.21174714231822075,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3101040267","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.63026667,0.0006320242,0.3552643,0.0044556404,0.0011946522,0.00044017675,0.000018839011,0.00027255833,0.007455099],"genre_scores_gemma":[0.9753513,0.00019530515,0.024076466,0.00019927861,0.0000573531,0.00001276758,0.0000087026065,0.0000038700264,0.00009500778],"study_design_codex":"design_other","study_design_gemma":"observational","domain_scores_codex":[0.99934864,0.000027214664,0.0001586807,0.00025244016,0.00012323892,0.00008979292],"domain_scores_gemma":[0.9995504,0.000023154636,0.000102990656,0.00023188803,0.000051196275,0.00004038253],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000051340416,0.00010968009,0.00017406588,0.00008651034,0.000039707877,0.00004346113,0.00024921098,0.000076650904,0.000010342578],"category_scores_gemma":[0.000002520701,0.00009943057,0.000045312565,0.00007115341,0.000048715134,0.00023804778,0.00082929735,0.00009268103,0.000004052905],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00011109842,0.00073315814,0.0033968925,0.0011358198,0.00033676604,0.00010409778,0.047651242,0.0005818637,0.0065913964,0.35169306,0.010256251,0.5774084],"study_design_scores_gemma":[0.0022661379,0.0011994402,0.5410776,0.0013492779,0.00007879616,0.00055450853,0.00017763601,0.17494032,0.0872651,0.17901538,0.008448675,0.0036271012],"about_ca_topic_score_codex":0.0001153602,"about_ca_topic_score_gemma":0.0000040045466,"teacher_disagreement_score":0.57378125,"about_ca_system_score_codex":0.000011932139,"about_ca_system_score_gemma":0.000030230003,"threshold_uncertainty_score":0.40546608},"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,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_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","score_opus":0.012412500053052713,"score_gpt":0.22409492801764844,"score_spread":0.21168242796459572,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3104562616","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.20276754,0.000042087926,0.79432255,0.00021534441,0.00022079571,0.00009194744,5.83249e-7,0.0000777442,0.0022613872],"genre_scores_gemma":[0.9894222,8.974559e-7,0.010322163,0.000031940053,0.000025569141,0.000005490057,6.967113e-7,0.0000014817383,0.00018958231],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99954295,0.000008811313,0.00014067852,0.00010783416,0.00011630232,0.000083433064],"domain_scores_gemma":[0.99967754,0.00003456468,0.00005654268,0.00015724986,0.000043330547,0.000030801773],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00007131904,0.00004102513,0.00007081556,0.0001571619,0.000029459447,0.000030735715,0.00023298232,0.000016938573,0.0000018068284],"category_scores_gemma":[0.000023495246,0.000033630036,0.000025852807,0.0006321777,0.000011730131,0.0002049036,0.00005898154,0.00002258607,0.000017136954],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000023086563,0.00012264254,0.00031697867,0.000031630734,0.000014644068,0.0000043127793,0.0003159622,0.019126177,0.0022698145,0.939096,0.00017520846,0.03852433],"study_design_scores_gemma":[0.0054147216,0.0013626883,0.13799946,0.00017730145,0.000031265656,0.00017621281,0.00008985667,0.63865244,0.07708693,0.13416633,0.0037194479,0.0011233614],"about_ca_topic_score_codex":0.00015380359,"about_ca_topic_score_gemma":0.000003929594,"teacher_disagreement_score":0.8049297,"about_ca_system_score_codex":0.000019577974,"about_ca_system_score_gemma":0.000055528424,"threshold_uncertainty_score":0.13713932},"labels":[],"label_agreement":null},{"id":"W3117272073","doi":"10.1007/978-3-030-67080-1_9","title":"Multiple Points and Beyond","year":2020,"lang":"en","type":"book-chapter","venue":"Texts & monographs in symbolic computation/Texts and monographs in symbolic computation","topic":"Polynomial and algebraic computation","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Hyperplane; Mathematics; Polynomial; Set (abstract data type); Connection (principal bundle); Topology (electrical circuits); Multivariate statistics; Pure mathematics; Discrete mathematics; Combinatorics; Computer science; Mathematical analysis; Geometry","score_opus":0.014584789993279966,"score_gpt":0.24028340643382515,"score_spread":0.22569861644054517,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3117272073","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3780407,0.03998345,0.45773515,0.009923949,0.006047339,0.012968142,0.00062370626,0.0038460505,0.09083154],"genre_scores_gemma":[0.9713381,0.0020359443,0.02347697,0.0013307194,0.00032130437,0.00014938918,0.0004949154,0.0001925832,0.0006600612],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9927649,0.00029328733,0.0023083,0.0025923082,0.00097332464,0.0010678667],"domain_scores_gemma":[0.9963448,0.0009952137,0.0010336757,0.00068192766,0.00027897005,0.0006654027],"candidate_categories":["metaepi_narrow"],"consensus_categories":["metaepi_narrow"],"category_scores_codex":[0.00082459045,0.0015024691,0.001857022,0.0036171002,0.00044069672,0.00079417485,0.000999879,0.0007595814,0.000017641973],"category_scores_gemma":[0.00007756472,0.0016944412,0.00043097648,0.0016121999,0.0005764224,0.0010904728,0.0010492333,0.0013403397,0.00004034757],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00011377351,0.00028183954,0.004358338,0.00031312133,0.0002297482,0.0001701317,0.009572077,0.0033801675,0.000026154805,0.14344424,0.0013681204,0.8367423],"study_design_scores_gemma":[0.0043322346,0.00044769695,0.048820708,0.0007407331,0.00010570032,0.00014294684,0.00018979312,0.30993187,0.000015686797,0.62744534,0.005523375,0.0023038927],"about_ca_topic_score_codex":0.0001630137,"about_ca_topic_score_gemma":0.00028116535,"teacher_disagreement_score":0.8344384,"about_ca_system_score_codex":0.00016353547,"about_ca_system_score_gemma":0.0002542579,"threshold_uncertainty_score":0.9997724},"labels":[],"label_agreement":null},{"id":"W3118978883","doi":"","title":"Integers represented by \\(x^4-y^4\\) revisited","year":2021,"lang":"en","type":"article","venue":"Bulletin of the Australian Mathematical Society","topic":"Polynomial and algebraic computation","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Mathematics; Combinatorics; Pure mathematics","score_opus":0.016084025686477873,"score_gpt":0.24780817079898265,"score_spread":0.23172414511250478,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3118978883","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10278769,0.00028198247,0.5426133,0.3354038,0.0006938024,0.00082968967,0.000045957262,0.00048472156,0.016859032],"genre_scores_gemma":[0.7631665,0.000023354254,0.16557528,0.003961774,0.00014186533,0.000021078731,0.000014849228,0.00003023713,0.06706508],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9987635,0.00010506845,0.0003354286,0.00027311192,0.0003090685,0.00021380177],"domain_scores_gemma":[0.9988657,0.00018816853,0.00013926702,0.00063607044,0.000091762784,0.00007902864],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00028721083,0.00011615515,0.00020880249,0.0000060796274,0.000091439906,0.000072053444,0.0007672252,0.000072075985,0.000621444],"category_scores_gemma":[0.00024995,0.00008150138,0.00035435686,0.00030676957,0.00011929724,0.000034057903,0.00044507787,0.0001711505,0.000116388415],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000016494695,0.00015172562,0.000059325794,0.00010795518,0.000059357648,0.0000018562629,0.00044067035,0.00001469807,0.0070233173,0.044613943,0.94604576,0.0014797737],"study_design_scores_gemma":[0.0014877132,0.00008607828,0.0022576875,0.00082754256,0.000102988626,0.000137777,0.00066742767,0.015662335,0.2546018,0.1967202,0.5265857,0.00086277083],"about_ca_topic_score_codex":0.000010952079,"about_ca_topic_score_gemma":7.212967e-8,"teacher_disagreement_score":0.6603788,"about_ca_system_score_codex":0.000029012337,"about_ca_system_score_gemma":0.000036839774,"threshold_uncertainty_score":0.6804377},"labels":[],"label_agreement":null},{"id":"W3120524214","doi":"10.1090/noti2280","title":"Sums of Squares: A Real Projective Story","year":2021,"lang":"en","type":"article","venue":"Notices of the American Mathematical Society","topic":"Polynomial and algebraic computation","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Facultad de Ciencias, Universidad de los Andes; Natural Sciences and Engineering Research Council of Canada; National Science Foundation","keywords":"Variety (cybernetics); Projective test; Mathematics; Algebra over a field; Algebraic number; Real algebraic geometry; Algebraic geometry; Focus (optics); Commutative property; Pure mathematics; Mathematical analysis; Statistics","score_opus":0.014177025232516984,"score_gpt":0.26377696575508974,"score_spread":0.24959994052257276,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3120524214","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.92191225,0.000041535008,0.07409341,0.0016440715,0.00008774777,0.00013381013,0.000004194464,0.000041523475,0.0020414556],"genre_scores_gemma":[0.9351465,0.000005670367,0.064532004,0.00018786991,0.000027632566,0.0000047970516,3.256549e-7,0.0000049429486,0.00009026442],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989711,0.0001335544,0.00022959299,0.00019014164,0.0003275406,0.0001480466],"domain_scores_gemma":[0.99845976,0.0005674523,0.0003774829,0.00042775017,0.00012750883,0.00004006984],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002662792,0.00008710419,0.00028211784,0.000010469024,0.000066969806,0.000019371128,0.0006037329,0.000021708205,0.00000798388],"category_scores_gemma":[0.00017877268,0.00005867324,0.00028498,0.0005022596,0.00039989213,0.000113770926,0.00037090946,0.000116088035,0.0000044832404],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000078272256,0.0025103337,0.0039287657,0.0021357322,0.0011086987,0.000010824894,0.10393513,0.0024670651,0.0735691,0.6290076,0.006382272,0.17486621],"study_design_scores_gemma":[0.0013619831,0.00078713195,0.07807605,0.0006468179,0.00024055531,0.000020092042,0.014163061,0.5117685,0.13785054,0.25358874,0.00057501055,0.0009215095],"about_ca_topic_score_codex":0.000061563835,"about_ca_topic_score_gemma":0.000003920083,"teacher_disagreement_score":0.5093015,"about_ca_system_score_codex":0.00003428672,"about_ca_system_score_gemma":0.00016817357,"threshold_uncertainty_score":0.23926252},"labels":[],"label_agreement":null},{"id":"W3157206289","doi":"10.1090/mcom/3782","title":"Tropical tangents for complete intersection curves","year":2022,"lang":"en","type":"article","venue":"Mathematics of Computation","topic":"Polynomial and algebraic computation","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Algorithm; Annotation; Artificial intelligence; Type (biology); Computer science; Intersection (aeronautics); Mathematics; Biology","score_opus":0.033607072665031726,"score_gpt":0.2703136146455875,"score_spread":0.2367065419805558,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3157206289","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0657447,0.000059896476,0.93268645,0.00054686546,0.00038805802,0.0003383818,0.000011560709,0.00007592577,0.0001481676],"genre_scores_gemma":[0.91169095,0.0000017890803,0.08797666,0.0001699987,0.000031343585,0.00006666261,0.000026640464,0.0000071800514,0.00002879014],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990859,0.000048660742,0.00031910362,0.00016011672,0.00027362138,0.00011257283],"domain_scores_gemma":[0.99931943,0.00020475315,0.0002298153,0.00013277662,0.00008415164,0.000029093651],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00018753734,0.00007870818,0.00016096339,0.000104184306,0.00014320335,0.000025265497,0.0003201822,0.0000126590485,0.0000113539445],"category_scores_gemma":[0.00003718406,0.00008303931,0.00008273441,0.00021833998,0.000017905633,0.00014465461,0.00018336509,0.000059073824,0.000003284856],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009338555,0.0019447689,0.00027498323,0.0027119678,0.00021067167,0.0000048956704,0.010092919,0.078684084,0.009710345,0.7082818,0.02209527,0.1658949],"study_design_scores_gemma":[0.00042497928,0.00026800236,0.00069606834,0.00004686583,0.000011106133,0.000013326513,0.00006470552,0.8660503,0.0004687026,0.13138281,0.0004677256,0.00010540946],"about_ca_topic_score_codex":0.000003946887,"about_ca_topic_score_gemma":9.519079e-7,"teacher_disagreement_score":0.84594625,"about_ca_system_score_codex":0.00005515118,"about_ca_system_score_gemma":0.00003139072,"threshold_uncertainty_score":0.33862448},"labels":[],"label_agreement":null},{"id":"W3161623357","doi":"10.1088/1742-6596/1903/1/012022","title":"Applying Residue Theorem to Compute Real Definite Integral","year":2021,"lang":"en","type":"article","venue":"Journal of Physics Conference Series","topic":"Polynomial and algebraic computation","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Ontario Tech University","funders":"","keywords":"Residue (chemistry); Residue theorem; Mathematics; Real analysis; Pure mathematics; Algebra over a field; Mathematical analysis; Chemistry; Initial value problem","score_opus":0.026369545645988653,"score_gpt":0.2525692850138116,"score_spread":0.22619973936782295,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3161623357","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06303608,0.0000388085,0.9317529,0.0019291996,0.00066180795,0.00007200885,0.000002546837,0.00003695352,0.0024696726],"genre_scores_gemma":[0.9276339,0.000040166753,0.07135822,0.00039462812,0.00040671838,0.0000040798027,0.0000019415154,0.000007274082,0.00015311808],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988254,0.00009719627,0.00036594048,0.00018659307,0.00031509929,0.0002098087],"domain_scores_gemma":[0.9986314,0.00011350992,0.00025625346,0.00023502285,0.0006212932,0.00014252942],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00022175578,0.00013922401,0.00028056806,0.000066657216,0.0001106442,0.00036542004,0.000594911,0.000033256212,0.0000079847],"category_scores_gemma":[0.000051047748,0.00011953982,0.00011558735,0.00042058103,0.00004716166,0.0009220911,0.00028729197,0.00023107606,0.000018342023],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000019746962,0.000031347867,0.00008706964,0.000007871981,0.000022361808,0.000056591412,0.001274871,0.00035398887,0.0055841017,0.61353546,0.0002631513,0.37876344],"study_design_scores_gemma":[0.00056068675,0.00048239675,0.004428535,0.00028957342,0.000023294815,0.0003413995,0.0006459597,0.0044285036,0.27570128,0.7085232,0.004149255,0.00042588028],"about_ca_topic_score_codex":0.000015473355,"about_ca_topic_score_gemma":0.000021399459,"teacher_disagreement_score":0.8645978,"about_ca_system_score_codex":0.000036245925,"about_ca_system_score_gemma":0.0005087599,"threshold_uncertainty_score":0.48746923},"labels":[],"label_agreement":null},{"id":"W3165058318","doi":"10.1007/978-3-030-85165-1_6","title":"On the Complexity and Parallel Implementation of Hensel’s Lemma and Weierstrass Preparation","year":2021,"lang":"en","type":"preprint","venue":"Lecture notes in computer science","topic":"Polynomial and algebraic computation","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"","keywords":"Factorization; Weierstrass factorization theorem; Lemma (botany); Computer science; Leverage (statistics); Degree (music); Speedup; Pipeline (software); Factor (programming language); Parallel computing; Algorithm; Artificial intelligence","score_opus":0.03210184032855441,"score_gpt":0.2982190984638437,"score_spread":0.2661172581352893,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3165058318","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4229077,0.00009980578,0.57420194,0.002192648,0.00032715072,0.00024216757,0.0000022772101,0.000021642674,0.000004664451],"genre_scores_gemma":[0.83773917,0.000019172687,0.16167429,0.0004880465,0.00005668451,0.00001297695,0.0000055071405,0.0000040005757,1.4948722e-7],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99784714,0.00016671787,0.00037210414,0.0008796398,0.00045837258,0.00027600184],"domain_scores_gemma":[0.9984805,0.000497724,0.00025419015,0.0005734682,0.0001226055,0.00007152837],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00078193337,0.00023137189,0.00027728992,0.00019813458,0.00021408586,0.0005882411,0.00083449256,0.00009102006,0.000003868159],"category_scores_gemma":[0.00006438431,0.00017855022,0.00004502398,0.00053014536,0.0006173295,0.00032284125,0.0016037893,0.00035473422,4.452946e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000029075618,0.000121411824,0.0024299389,0.00020157454,0.000037022153,0.00001629878,0.017284833,0.114071,0.0019782658,0.07681289,0.00002914355,0.78698856],"study_design_scores_gemma":[0.00024430492,0.00014656638,0.032012638,0.00012205315,0.000005101139,0.000018511144,0.000008019986,0.722081,0.0051073898,0.24003457,0.0000023454413,0.00021747084],"about_ca_topic_score_codex":0.00026023944,"about_ca_topic_score_gemma":0.00038783078,"teacher_disagreement_score":0.78677106,"about_ca_system_score_codex":0.00007630677,"about_ca_system_score_gemma":0.00033539193,"threshold_uncertainty_score":0.7281067},"labels":[],"label_agreement":null},{"id":"W3167257021","doi":"10.5206/mt.v1i1.14069","title":"Some Instructive Mathematical Errors","year":2021,"lang":"en","type":"preprint","venue":"Maple Transactions","topic":"Polynomial and algebraic computation","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Systematic error; Computer science; Maple; Error detection and correction; Calculus (dental); Algorithm; Mathematics; Statistics","score_opus":0.019928360775257035,"score_gpt":0.24660638462924256,"score_spread":0.22667802385398553,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3167257021","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.031512827,0.00014155757,0.96333325,0.0019602084,0.0017699314,0.00019647833,0.000016133596,0.00028309913,0.00078651414],"genre_scores_gemma":[0.8984493,0.000030060366,0.100386016,0.00019511953,0.00022932228,0.00008944437,0.000024718853,0.000017217135,0.0005788063],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99853206,0.00007301335,0.00030931376,0.0005580837,0.0002762559,0.000251291],"domain_scores_gemma":[0.99900854,0.000076409095,0.000093302224,0.00062677334,0.00007152831,0.0001234694],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00009803615,0.00022737269,0.00029908205,0.00014323855,0.00016782168,0.00039679295,0.0006780284,0.00018556869,0.0001905435],"category_scores_gemma":[0.000009498738,0.00023618306,0.00025716543,0.00022620987,0.00005674255,0.00054844975,0.00015651471,0.0005999418,0.00009570187],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000022908946,0.0014542846,0.000014436673,0.000980067,0.000907432,0.00022281059,0.023672868,0.07290618,0.0016275779,0.35328472,0.0006387189,0.544268],"study_design_scores_gemma":[0.0006010492,0.00005767073,0.0011714562,0.00026087617,0.000113807626,0.00012916583,0.00052537053,0.3592566,0.0049021873,0.6308979,0.0010600083,0.0010239149],"about_ca_topic_score_codex":0.00005896197,"about_ca_topic_score_gemma":0.000026544245,"teacher_disagreement_score":0.86693645,"about_ca_system_score_codex":0.00009531269,"about_ca_system_score_gemma":0.0002825804,"threshold_uncertainty_score":0.96312654},"labels":[],"label_agreement":null},{"id":"W3186186152","doi":"10.1016/j.aim.2023.108863","title":"Likelihood degenerations","year":2023,"lang":"en","type":"article","venue":"Advances in Mathematics","topic":"Polynomial and algebraic computation","field":"Computer Science","cited_by":32,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"","keywords":"Mathematics; Moduli space; Variety (cybernetics); Monomial; Algebraic geometry; Bounded function; Affine space; Algebra over a field; Affine transformation; Algebraic variety; Point (geometry); Affine variety; Algebraic number; Pure mathematics; Geometry; Mathematical analysis","score_opus":0.014067346740571373,"score_gpt":0.27550840748425737,"score_spread":0.261441060743686,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3186186152","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03723523,0.00034388236,0.95446515,0.00073298294,0.0004538863,0.000116075265,0.0000011620333,0.00038900686,0.00626265],"genre_scores_gemma":[0.63281727,0.00039438746,0.36577556,0.00018776309,0.00012404607,0.00005399957,0.000007045346,0.000012397586,0.0006275393],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994132,0.000011963301,0.00016607987,0.00012936522,0.00011625673,0.00016312931],"domain_scores_gemma":[0.999588,0.00013036704,0.00004031574,0.0001966079,0.000016177974,0.000028528992],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00015096224,0.000058528087,0.000078422156,0.00010784285,0.000050262362,0.00004399937,0.00030325714,0.000017363367,0.0000050800577],"category_scores_gemma":[0.000050412556,0.00005353361,0.000020895715,0.00068512006,0.000012772097,0.0004836457,0.00010039667,0.000045458135,0.000260972],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[3.442442e-7,0.00007014891,0.00015479245,0.00004300334,0.0000027335789,0.000012509991,0.001827577,0.0071846815,0.00028731284,0.6745927,0.00045578193,0.3153684],"study_design_scores_gemma":[0.00009497332,0.000010143554,0.00043255775,0.000019787505,7.7404803e-7,0.0000031632758,0.000045981447,0.3735159,0.00053321116,0.6221231,0.0031394414,0.00008091231],"about_ca_topic_score_codex":9.429459e-7,"about_ca_topic_score_gemma":0.000017925102,"teacher_disagreement_score":0.595582,"about_ca_system_score_codex":0.00001514893,"about_ca_system_score_gemma":0.000022419492,"threshold_uncertainty_score":0.33543545},"labels":[],"label_agreement":null},{"id":"W3187739487","doi":"10.48550/arxiv.2108.01558","title":"Intra-Basis Multiplication of Polynomials Given in Various Polynomial Bases","year":2021,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Polynomial and algebraic computation","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Capilano University","funders":"","keywords":"Polynomial matrix; Mathematics; Matrix polynomial; Reciprocal polynomial; Polynomial basis; Factorization of polynomials; Polynomial; Multiplication (music); Algebra over a field; Degree of a polynomial; Symmetric polynomial; Monomial basis; Monic polynomial; Square-free polynomial; Alternating polynomial; Irreducible polynomial; Pure mathematics; Combinatorics; Mathematical analysis","score_opus":0.04155283745644889,"score_gpt":0.19301668033869088,"score_spread":0.151463842882242,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3187739487","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6789764,0.00009549571,0.3193137,0.00027713316,0.0005174877,0.00028517874,0.000019667657,0.00009796269,0.00041693726],"genre_scores_gemma":[0.99541426,0.00008648364,0.004116362,0.00009295954,0.0001003959,0.0000024738026,0.000040115563,0.000014745922,0.00013218464],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9977743,0.00025217418,0.00044772564,0.0010846206,0.000111156594,0.0003300296],"domain_scores_gemma":[0.9980144,0.00025375286,0.00046246077,0.0009816022,0.00015512363,0.0001326991],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00027614785,0.00030561764,0.0005297169,0.00048541807,0.000070608716,0.00010561763,0.0013891429,0.0002891754,0.000027399616],"category_scores_gemma":[0.00008716736,0.0003813496,0.0002449796,0.00083670544,0.000100219324,0.00042138065,0.0015559412,0.00040755796,0.000015335454],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003906176,0.00201208,0.02781423,0.0006633311,0.00049816555,0.0009757762,0.0052356347,0.7792713,0.011173323,0.059702896,0.0015358116,0.11072683],"study_design_scores_gemma":[0.002204669,0.00013513937,0.04588346,0.00041441826,0.00010364369,0.000012600789,0.00021552785,0.9215079,0.015969696,0.012054253,0.0003656695,0.0011330328],"about_ca_topic_score_codex":0.0022712771,"about_ca_topic_score_gemma":0.00041995483,"teacher_disagreement_score":0.31643787,"about_ca_system_score_codex":0.0002970994,"about_ca_system_score_gemma":0.00054969365,"threshold_uncertainty_score":0.99986386},"labels":[],"label_agreement":null},{"id":"W3194658714","doi":"10.1007/978-3-030-85165-1_14","title":"Towards Extending Fulton’s Algorithm for Computing Intersection Multiplicities Beyond the Bivariate Case","year":2021,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Polynomial and algebraic computation","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"","keywords":"Intersection (aeronautics); Generalization; Bivariate analysis; Cover (algebra); Basis (linear algebra); Computer science; Planar; Algorithm; Multiplicity (mathematics); Mathematics; Computer graphics (images); Geometry; Cartography","score_opus":0.018669400749556662,"score_gpt":0.2602697904573892,"score_spread":0.2416003897078325,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3194658714","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00033600058,0.00047563264,0.9910609,0.00096097996,0.0058771637,0.0006239999,0.000016126487,0.00020250393,0.00044667115],"genre_scores_gemma":[0.17179975,0.000020751197,0.82408446,0.0017608803,0.0019396322,0.000025896907,0.000018707417,0.000050785216,0.00029914503],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9963835,0.00006691774,0.0006641023,0.0015158121,0.00063947827,0.0007301959],"domain_scores_gemma":[0.99710345,0.0010792466,0.000397876,0.0009059737,0.00037194428,0.00014152634],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0012211249,0.0005669465,0.00053820555,0.0005988778,0.00093772897,0.0012318878,0.0019388866,0.0002475526,0.000008083501],"category_scores_gemma":[0.000107679574,0.00045186677,0.00026845903,0.0006201203,0.00045868332,0.0005969194,0.0017202509,0.00072734157,0.000006866643],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000002710936,0.000015264886,0.0000011081148,0.000027665146,0.000020743328,0.00027475297,0.0020502128,0.014663262,0.000057961006,0.015803728,0.00001666172,0.96706593],"study_design_scores_gemma":[0.00034373562,0.00012321668,0.000021208869,0.00024587,0.000015646297,0.0016778148,0.0000049363757,0.9210378,0.0009322945,0.0742916,0.000780844,0.00052503665],"about_ca_topic_score_codex":0.00018174622,"about_ca_topic_score_gemma":0.00019492979,"teacher_disagreement_score":0.9665409,"about_ca_system_score_codex":0.00048352656,"about_ca_system_score_gemma":0.00053215295,"threshold_uncertainty_score":0.9998049},"labels":[],"label_agreement":null},{"id":"W319768494","doi":"10.1007/978-3-662-44199-2_71","title":"Doing Algebraic Geometry with the RegularChains Library","year":2014,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Polynomial and algebraic computation","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"","keywords":"Gröbner basis; Algebra over a field; Algebraic number; Computer science; Computation; Tangent; Intersection (aeronautics); Algebraic geometry; Dimension of an algebraic variety; Differential algebraic geometry; Mathematics; Pure mathematics; Algorithm; Geometry","score_opus":0.007286269031130672,"score_gpt":0.20052079420740876,"score_spread":0.1932345251762781,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W319768494","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0003165721,0.00038881728,0.9872429,0.00670965,0.0008579755,0.00035152154,0.0000020977072,0.00029938802,0.0038310792],"genre_scores_gemma":[0.38625926,0.000037513735,0.59899074,0.010234188,0.0018414294,0.000019580973,0.000012632813,0.00010019681,0.0025044498],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99631584,0.000072408584,0.000396976,0.0014341966,0.0010533251,0.00072724355],"domain_scores_gemma":[0.9969111,0.0009279837,0.00031054302,0.0015695208,0.000090557005,0.00019026402],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00080404826,0.0005481633,0.00046769402,0.00079758296,0.0004751394,0.0009979247,0.004537823,0.0002104488,0.000021492415],"category_scores_gemma":[0.000029658375,0.00035293767,0.00013033662,0.0010923238,0.0009763134,0.0007702795,0.0019679712,0.0009060576,0.0000525038],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000006056188,0.000009260751,0.00001689986,0.000025108435,0.000012859389,0.000047033296,0.00049642223,0.017970946,0.000031484386,0.110294186,0.00013003354,0.8709597],"study_design_scores_gemma":[0.0006502379,0.0005610785,0.00053337065,0.00084357016,0.000021674601,0.00031707477,4.5451597e-7,0.62751555,0.001601449,0.3138024,0.052545466,0.0016076831],"about_ca_topic_score_codex":0.000010358796,"about_ca_topic_score_gemma":0.00003585675,"teacher_disagreement_score":0.86935204,"about_ca_system_score_codex":0.000112467606,"about_ca_system_score_gemma":0.0005972878,"threshold_uncertainty_score":0.99989223},"labels":[],"label_agreement":null},{"id":"W3199701932","doi":"10.5206/mt.v2i1.14315","title":"On the Representation of Non-Holonomic Power Series","year":2022,"lang":"en","type":"article","venue":"Maple Transactions","topic":"Polynomial and algebraic computation","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Holonomic; Power series; Formal power series; Mathematics; Series (stratigraphy); Polynomial; Elementary function; Representation (politics); Algebra over a field; Applied mathematics; Pure mathematics; Computer science; Mathematical analysis","score_opus":0.012982861030941425,"score_gpt":0.23160658880614432,"score_spread":0.2186237277752029,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3199701932","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.25804615,0.0000065254235,0.73305976,0.0063006436,0.00049780926,0.00013263704,0.000012631276,0.000052920535,0.0018909596],"genre_scores_gemma":[0.9983059,0.0000010967034,0.0007772314,0.00018935882,0.000008180095,0.000046589244,0.000001866745,0.0000032621099,0.0006664912],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99948895,0.00005680121,0.00011491712,0.00013190022,0.00012855869,0.00007889931],"domain_scores_gemma":[0.9995669,0.000109696215,0.000046907262,0.00024672228,0.000013319355,0.000016465234],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000096373384,0.00004660791,0.000059295653,0.000056206947,0.00031092993,0.000023487877,0.00029140647,0.000008221135,0.00033121894],"category_scores_gemma":[0.0000036311135,0.000038715392,0.000059297305,0.00029393472,0.000025182268,0.00015064601,0.000020544976,0.00009698159,0.000015996666],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002237591,0.0008427447,0.00012513832,0.000019646313,0.0001667015,0.000013589744,0.022487804,0.3556164,0.033321436,0.45144412,0.014801359,0.12093731],"study_design_scores_gemma":[0.0032351213,0.0033970152,0.0663073,0.00003648595,0.000089876965,0.00021339046,0.005742443,0.458415,0.15839425,0.25043455,0.052368134,0.0013664373],"about_ca_topic_score_codex":0.0000630142,"about_ca_topic_score_gemma":0.0000087720655,"teacher_disagreement_score":0.74025977,"about_ca_system_score_codex":0.000026776963,"about_ca_system_score_gemma":0.000031225274,"threshold_uncertainty_score":0.3626615},"labels":[],"label_agreement":null},{"id":"W3201469789","doi":"10.5206/mt.v1i1.14039","title":"What we can learn from Bohemian Matrices?","year":2021,"lang":"en","type":"article","venue":"Maple Transactions","topic":"Polynomial and algebraic computation","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"Western University","funders":"Engineering and Physical Sciences Research Council","keywords":"Workbook; Reading (process); Computer science; Point (geometry); Linear algebra; Maple; Code (set theory); Algebra over a field; Eigenvalues and eigenvectors; Mathematics education; Programming language; Mathematics; Linguistics; Pure mathematics; Philosophy; Law","score_opus":0.014739717250307772,"score_gpt":0.22678042872350085,"score_spread":0.2120407114731931,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3201469789","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.014102035,0.0009627779,0.9535497,0.028897336,0.0016854802,0.00005805653,0.000019260331,0.00023707778,0.0004882889],"genre_scores_gemma":[0.97497433,0.00062275975,0.018497834,0.0007422925,0.00018302606,0.000017585351,0.000028826416,0.000012660492,0.0049207103],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9991279,0.0000441188,0.0001517371,0.00031601908,0.00016339443,0.00019683523],"domain_scores_gemma":[0.9993928,0.00008592168,0.00003600071,0.00033309648,0.000045374345,0.00010679447],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000041405296,0.00009910982,0.00010971248,0.000057965433,0.00020412606,0.00042765698,0.00029408708,0.00004824213,0.00034814898],"category_scores_gemma":[0.0000038044711,0.000105520594,0.0000918735,0.0004608733,0.000018008746,0.0006878393,0.000019448982,0.0001504232,0.00013745122],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000005100453,0.00020119941,0.000031940865,0.00001816961,0.000076010125,0.00008633125,0.0046609608,0.0027023447,0.00881723,0.0037268396,0.0022295685,0.9774443],"study_design_scores_gemma":[0.0025335571,0.00014364284,0.005881406,0.0002893222,0.0001569113,0.00017940841,0.0032593803,0.18383925,0.16703323,0.09599176,0.5390323,0.0016598908],"about_ca_topic_score_codex":0.00035903626,"about_ca_topic_score_gemma":0.00086678605,"teacher_disagreement_score":0.9757844,"about_ca_system_score_codex":0.000043581495,"about_ca_system_score_gemma":0.00012991931,"threshold_uncertainty_score":0.4303005},"labels":[],"label_agreement":null},{"id":"W350194719","doi":"10.1007/978-0-387-21690-4_21","title":"Characters and Gaussian Sums","year":2001,"lang":"en","type":"book-chapter","venue":"Universitext","topic":"Polynomial and algebraic computation","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"","keywords":"Symbol (formal); Abelian group; Legendre symbol; Mathematics; Quadratic equation; Gaussian; Pure mathematics; Algebra over a field; Arithmetic; Quadratic field; Quadratic function; Physics; Philosophy; Linguistics; Geometry; Quantum mechanics","score_opus":0.010003271674291691,"score_gpt":0.17884442445288004,"score_spread":0.16884115277858835,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W350194719","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00045472966,0.00020314664,0.010347077,0.00084281206,0.00030057228,0.00009080082,0.0000049530613,0.000115914,0.98764],"genre_scores_gemma":[0.027568402,0.00022474701,0.00074380304,0.0003645993,0.000170141,1.9711317e-7,0.000016173248,0.000016646072,0.9708953],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99930924,0.0000060662614,0.00008814646,0.0003270472,0.00012472781,0.00014475953],"domain_scores_gemma":[0.99951524,0.00002836687,0.00009007837,0.00023212076,0.000023767456,0.000110431545],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000032274565,0.0001669111,0.00015302899,0.0001933077,0.00009578991,0.00007655795,0.00034834348,0.000115216106,0.00012579351],"category_scores_gemma":[0.0000012177798,0.00017677044,0.000058940037,0.00003700549,0.000051729916,0.00028569993,0.00024564407,0.00014445843,0.00024094709],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000034005482,0.0000037137777,0.0000059750437,0.0000066723173,0.000023129442,0.00017779977,0.00022183951,0.0000017101274,0.00000820233,0.8960113,0.0014555084,0.10208073],"study_design_scores_gemma":[0.00031533805,0.000059509057,0.00057791144,0.00008766918,0.000022965965,0.000056277935,0.00000991563,0.0012405247,0.0000067128167,0.028489694,0.9687023,0.00043116874],"about_ca_topic_score_codex":0.00001210711,"about_ca_topic_score_gemma":0.0000033828524,"teacher_disagreement_score":0.96724683,"about_ca_system_score_codex":0.000057093894,"about_ca_system_score_gemma":0.00004065021,"threshold_uncertainty_score":0.7208489},"labels":[],"label_agreement":null},{"id":"W373928868","doi":"10.1007/978-3-662-43799-5_25","title":"Degree and Dimension Estimates for Invariant Ideals of $$P$$ -Solvable Recurrences","year":2014,"lang":"en","type":"book-chapter","venue":"","topic":"Polynomial and algebraic computation","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"","keywords":"Mathematics; Invariant (physics); Degree (music); Dimension (graph theory); Pure mathematics; Combinatorics; Discrete mathematics","score_opus":0.039705439754220084,"score_gpt":0.2495371727643556,"score_spread":0.20983173301013552,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W373928868","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00011888142,0.0009431408,0.9033854,0.00045661195,0.0004422994,0.00038412158,0.0000105677855,0.000092724134,0.094166234],"genre_scores_gemma":[0.0636189,0.000301679,0.72367686,0.0007256668,0.00041232278,0.00004344888,0.000073133335,0.000063965366,0.21108405],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99900913,0.000007742967,0.00031766284,0.0003692716,0.00015018659,0.00014599919],"domain_scores_gemma":[0.9988828,0.00045130987,0.00025441818,0.0002468784,0.00009810689,0.00006650139],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00025162956,0.00018923527,0.00035187943,0.00010636929,0.00006857381,0.000066733926,0.00032139523,0.000115855284,0.000019684516],"category_scores_gemma":[0.0000446854,0.00014832383,0.000067196146,0.000022617773,0.00006189337,0.000120486264,0.00023979276,0.00006565973,0.000010515028],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000004883177,0.000003673725,0.0000038032683,0.00006811816,0.000016970202,5.760111e-7,0.00004042928,0.000011551964,0.000095289186,0.8530212,0.0018145423,0.144919],"study_design_scores_gemma":[0.0003663231,0.00039306836,0.00007477992,0.00039144178,0.000040668052,0.0000134676775,0.0000015957762,0.10074979,0.0015263472,0.87354535,0.022504514,0.0003926802],"about_ca_topic_score_codex":0.00004045287,"about_ca_topic_score_gemma":0.00001966274,"teacher_disagreement_score":0.17970859,"about_ca_system_score_codex":0.000009854915,"about_ca_system_score_gemma":0.00006497368,"threshold_uncertainty_score":0.604847},"labels":[],"label_agreement":null},{"id":"W40396644","doi":"10.1007/978-3-642-31612-8_48","title":"Single-Solver Algorithms for 2QBF","year":2012,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Polynomial and algebraic computation","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Computer science; Problem solver; Solver; Algorithm; Computational science; Programming language","score_opus":0.03092021923973902,"score_gpt":0.252007707080522,"score_spread":0.22108748784078297,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W40396644","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000032279953,0.0008575326,0.9922038,0.0008056143,0.00392156,0.0005357852,0.00000859488,0.00021182492,0.0014230326],"genre_scores_gemma":[0.030719994,0.000020587242,0.9645872,0.0018033796,0.0021351918,0.000023793384,0.0000131496145,0.000048209225,0.0006484919],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.996528,0.000019633077,0.0005100756,0.0013207926,0.00072878983,0.0008926703],"domain_scores_gemma":[0.9976661,0.00059714454,0.00028407865,0.0009775101,0.00022626865,0.00024885463],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0007296367,0.00052458775,0.0004996337,0.0006284518,0.00027376626,0.0005157938,0.002648178,0.0003038804,0.000018887868],"category_scores_gemma":[0.00006814931,0.000482326,0.00020891592,0.00041884548,0.00040644442,0.0008800516,0.001052698,0.00045195932,0.00006416011],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000037484197,0.000034114797,0.0000038671815,0.000024233706,0.000008114207,0.0000079410465,0.00036855953,0.002508918,0.00024101739,0.018380739,0.000054409287,0.97836435],"study_design_scores_gemma":[0.00056997506,0.00035833323,0.00006412107,0.00026896325,0.000017988697,0.000077395176,9.9275255e-8,0.55425763,0.0043711225,0.3880999,0.05073405,0.0011803997],"about_ca_topic_score_codex":0.000012114627,"about_ca_topic_score_gemma":0.000022481234,"teacher_disagreement_score":0.97718394,"about_ca_system_score_codex":0.00032969902,"about_ca_system_score_gemma":0.00036371357,"threshold_uncertainty_score":0.99976283},"labels":[],"label_agreement":null},{"id":"W4206793588","doi":"10.1016/j.laa.2011.03.023","title":"Preface","year":2011,"lang":"en","type":"article","venue":"Linear Algebra and its Applications","topic":"Polynomial and algebraic computation","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Group for Research in Decision Analysis; HEC Montréal","funders":"","keywords":"Mathematics; Pure mathematics; Combinatorics","score_opus":0.025142185902940276,"score_gpt":0.2371583202159903,"score_spread":0.21201613431305,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4206793588","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.044977967,0.00045858597,0.941848,0.0006617529,0.000075498756,0.00033753153,0.0000037433376,0.00028894565,0.0113480175],"genre_scores_gemma":[0.9685214,0.000043737742,0.030253047,0.0003334107,0.000099165496,0.000091942195,0.0000036934614,0.0000058971036,0.00064766814],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99945825,0.000011203578,0.000115713585,0.00022684962,0.00006643035,0.00012152455],"domain_scores_gemma":[0.9995994,0.000026457052,0.00003814171,0.00021509717,0.000035927827,0.00008496912],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000053431,0.0000711005,0.00006511751,0.000039302853,0.00012293487,0.000029700559,0.00028720184,0.000030287983,0.000024289428],"category_scores_gemma":[0.000006060997,0.00006407477,0.000021234797,0.00020368274,0.000018404537,0.00022998765,0.00012385189,0.000055831228,0.00020398734],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000001214676,0.000052035502,0.00005780446,0.0000065945587,0.000006853337,4.2355654e-7,0.00061770465,0.0000019977035,0.00066099694,0.92152,0.0001797374,0.07689466],"study_design_scores_gemma":[0.0011408734,0.0002792793,0.040172677,0.000029837998,0.000045092595,0.000078392666,0.000095395975,0.23246205,0.05018149,0.41862026,0.255737,0.001157654],"about_ca_topic_score_codex":0.000008316344,"about_ca_topic_score_gemma":0.0000014718457,"teacher_disagreement_score":0.92354345,"about_ca_system_score_codex":0.0000045793577,"about_ca_system_score_gemma":0.000020784855,"threshold_uncertainty_score":0.26219124},"labels":[],"label_agreement":null},{"id":"W4207007373","doi":"10.1090/mbk/139/29","title":"The Fermat factorisation algorithm","year":2021,"lang":"en","type":"book-chapter","venue":"American Mathematical Society eBooks","topic":"Polynomial and algebraic computation","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université Laval","funders":"","keywords":"Fermat's Last Theorem; Computer science; Algorithm; Mathematics; Discrete mathematics","score_opus":0.015031886763425808,"score_gpt":0.2340649061507424,"score_spread":0.2190330193873166,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4207007373","genre_codex":"methods","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000020346724,0.00014095084,0.6824635,0.0010630602,0.00029164043,0.0002486957,0.0000074008203,0.00024500812,0.31551936],"genre_scores_gemma":[0.0020232871,0.00018640075,0.20702113,0.002510736,0.000976292,0.00007198319,0.000035927493,0.00012206509,0.78705215],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.998076,0.000036582613,0.00046299226,0.00047410937,0.0005927671,0.0003575135],"domain_scores_gemma":[0.99794966,0.0006824581,0.00038897395,0.00070927147,0.000116130366,0.00015348944],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00023803538,0.0003488218,0.00045263828,0.000018181347,0.00041710603,0.00040931324,0.00082026434,0.00013569364,0.000042052667],"category_scores_gemma":[0.000026925927,0.0002490072,0.0005571588,0.000043957945,0.0004945695,0.00007685161,0.00046658923,0.00043709352,0.00019734207],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[3.6247818e-7,0.0000062644176,6.8507205e-8,0.000013205189,0.00007387987,0.000003507949,0.00057626783,4.8420037e-7,0.00000908713,0.5430171,0.0022190583,0.4540807],"study_design_scores_gemma":[0.00013424638,0.0000696169,0.000007743375,0.00010482856,0.00004645662,0.00003145678,0.00015081295,0.030994022,0.00009849936,0.7887847,0.17904463,0.0005330258],"about_ca_topic_score_codex":0.000007694603,"about_ca_topic_score_gemma":0.0000011960456,"teacher_disagreement_score":0.4754424,"about_ca_system_score_codex":0.00014915162,"about_ca_system_score_gemma":0.00018604525,"threshold_uncertainty_score":0.99999624},"labels":[],"label_agreement":null},{"id":"W4210800098","doi":"10.1017/cbo9781107282094.005","title":"Duality theory","year":2018,"lang":"en","type":"book-chapter","venue":"Cambridge University Press eBooks","topic":"Polynomial and algebraic computation","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Duality (order theory); Selection (genetic algorithm); Computer science; Focus (optics); Reading (process); Section (typography); Point (geometry); Mathematics education; Range (aeronautics); Linear algebra; Mathematics; Engineering; Artificial intelligence; Pure mathematics; Linguistics; Geometry; Physics","score_opus":0.02074077535317502,"score_gpt":0.200591348954448,"score_spread":0.179850573601273,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4210800098","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000090288,0.000050005117,0.10039088,0.000025932606,0.0005155943,0.00017406588,0.000044526594,0.0002984242,0.89841026],"genre_scores_gemma":[0.0010386162,0.000010901449,0.0008068806,0.00015562534,0.0002644395,2.4561317e-7,0.000013784988,0.000017587918,0.9976919],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9986695,0.000073021714,0.00016394818,0.0005944636,0.00025169706,0.00024737962],"domain_scores_gemma":[0.9986207,0.00011173959,0.00020352166,0.00076348655,0.00014064404,0.00015993115],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00021383488,0.00028715938,0.00027738113,0.00013545991,0.0002010311,0.00009716995,0.00124925,0.00023278307,0.000010388693],"category_scores_gemma":[0.000008710237,0.0003233914,0.00018857028,0.00001005238,0.00023725351,0.00018732612,0.0010270043,0.00027056516,0.00010630718],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000019789346,0.0000049200307,1.13849744e-7,0.000017396762,0.000052080224,0.000083510036,0.00008251025,5.219615e-7,0.0000125716515,0.9568387,0.033584967,0.00930292],"study_design_scores_gemma":[0.0002922452,0.000054679746,0.000015198631,0.00006624147,0.00004847743,0.000015850967,0.000005364335,0.00046697707,0.00034404077,0.0034179173,0.99484295,0.00043004178],"about_ca_topic_score_codex":0.000029385692,"about_ca_topic_score_gemma":7.723872e-7,"teacher_disagreement_score":0.961258,"about_ca_system_score_codex":0.00012833797,"about_ca_system_score_gemma":0.00014119787,"threshold_uncertainty_score":0.9999218},"labels":[],"label_agreement":null},{"id":"W4210971937","doi":"10.1109/synasc54541.2021.00017","title":"Parametric Linear Algebra in Maple: Reduced Row Echelon Form","year":2021,"lang":"en","type":"article","venue":"","topic":"Polynomial and algebraic computation","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"","keywords":"Maple; Symbolic computation; Rank (graph theory); Algebra over a field; Matrix algebra; Parametric statistics; Linear algebra; Matrix (chemical analysis); Computer science; Mathematics; Pure mathematics; Combinatorics; Statistics; Geometry","score_opus":0.018001009931798415,"score_gpt":0.25230750468497276,"score_spread":0.23430649475317433,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4210971937","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6922986,0.0001977919,0.2933876,0.0046147658,0.00062280294,0.00013136858,8.4944037e-7,0.00024512573,0.008501095],"genre_scores_gemma":[0.9443411,0.0000130604785,0.05336399,0.0006915242,0.000076097735,0.0000068278905,0.0000059172517,0.000005408284,0.0014960666],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989276,0.000042385203,0.00023338351,0.00035219154,0.00018633662,0.00025808238],"domain_scores_gemma":[0.99937546,0.000118335905,0.00004386418,0.00032668828,0.000056292414,0.0000793744],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001825123,0.00010147928,0.00014030366,0.00018480972,0.000045001616,0.000103468614,0.00037457192,0.000057078247,0.00006273773],"category_scores_gemma":[0.00011843428,0.00009414531,0.00005464369,0.0017217051,0.000011351133,0.00036994438,0.00024734007,0.00012497512,0.00013410616],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009914069,0.00032565297,0.0011342326,0.000028530409,0.000021006448,0.0002118241,0.000815734,0.000707736,0.006341016,0.1650356,0.0033380073,0.8220307],"study_design_scores_gemma":[0.0014099794,0.0001311815,0.042697605,0.000045127923,0.0000060390435,0.000099699886,0.00007962756,0.69718564,0.15011418,0.1004187,0.00717816,0.00063407497],"about_ca_topic_score_codex":0.00007586835,"about_ca_topic_score_gemma":0.00006071638,"teacher_disagreement_score":0.82139665,"about_ca_system_score_codex":0.00005663635,"about_ca_system_score_gemma":0.00016320168,"threshold_uncertainty_score":0.38391346},"labels":[],"label_agreement":null},{"id":"W4211085118","doi":"10.1109/synasc54541.2021.00014","title":"Resultant-based Elimination for Skew Polynomials","year":2021,"lang":"en","type":"preprint","venue":"","topic":"Polynomial and algebraic computation","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Manitoba","funders":"","keywords":"Skew; Computer science; Telecommunications","score_opus":0.02765583890891731,"score_gpt":0.2777131934699517,"score_spread":0.2500573545610344,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4211085118","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0076057985,0.00016075681,0.9806151,0.0075171296,0.001989934,0.00056553975,0.000021631082,0.00033085945,0.0011932782],"genre_scores_gemma":[0.6339279,0.000009408585,0.36310762,0.0011993956,0.00041947025,0.00016959554,0.00026340538,0.000018803416,0.0008844258],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981239,0.00008217233,0.0004443792,0.0007980696,0.0002661403,0.00028536643],"domain_scores_gemma":[0.9982483,0.00037767942,0.00025533303,0.000707529,0.0003141437,0.000097007716],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00042214472,0.00024739694,0.00032645385,0.00017413964,0.00011497075,0.00063023507,0.0009255936,0.00022392056,0.000020567677],"category_scores_gemma":[0.00021450482,0.00024150948,0.00024057672,0.00020340526,0.000021472497,0.00020790634,0.0007127111,0.00019205718,0.000012987837],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007194528,0.00036745405,0.000017016355,0.00059068034,0.00012110085,0.000022848393,0.0008052147,0.014365013,0.0053145946,0.16082986,0.01764244,0.79985183],"study_design_scores_gemma":[0.0010125702,0.00010154871,0.0010564988,0.00019537956,0.00003090394,0.000003196357,0.000020052852,0.92893445,0.04016668,0.023086278,0.004729445,0.0006629764],"about_ca_topic_score_codex":0.0000947736,"about_ca_topic_score_gemma":0.000036851827,"teacher_disagreement_score":0.91456944,"about_ca_system_score_codex":0.00011025202,"about_ca_system_score_gemma":0.00077239535,"threshold_uncertainty_score":0.98484707},"labels":[],"label_agreement":null},{"id":"W4213152998","doi":"10.1090/fic/033/10","title":"Dynamic computations inside the algebraic closure of a valued field","year":2003,"lang":"en","type":"other","venue":"","topic":"Polynomial and algebraic computation","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Saskatchewan","funders":"","keywords":"Closure (psychology); Computation; Algebraic closure; Field (mathematics); Algebraic number; Mathematics; Algebra over a field; Computer science; Algorithm; Pure mathematics; Mathematical analysis; Political science","score_opus":0.008734753142889235,"score_gpt":0.23783233330287507,"score_spread":0.22909758015998583,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4213152998","genre_codex":"methods","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00010600024,0.0005030905,0.63895303,0.0013616511,0.00069726177,0.00029094238,0.0000057014086,0.00023801149,0.3578443],"genre_scores_gemma":[0.060162164,0.0000778594,0.113366894,0.0049005793,0.00017759805,0.000042344196,0.000033998345,0.00024627728,0.8209923],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9988278,0.00011543127,0.00028409585,0.0003236668,0.00025587567,0.00019308597],"domain_scores_gemma":[0.9988626,0.00021581173,0.00025398875,0.0005776572,0.000040361778,0.00004956356],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00013249174,0.0002076334,0.00026677316,0.00019640794,0.000065076274,0.00006172556,0.00083690934,0.00015438555,0.00037361085],"category_scores_gemma":[0.000039496943,0.00014205274,0.00013918574,0.0004363627,0.000057049365,0.000063166844,0.00016092518,0.00018595031,0.00009411687],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000001982621,0.000076029166,0.000031026397,0.0000595307,0.00012591579,0.0000054045486,0.00030931243,0.00020837609,0.000015797821,0.22991492,0.7413701,0.02788165],"study_design_scores_gemma":[0.002009443,0.0005712564,0.0014821774,0.00062036817,0.00016361178,0.00010324953,0.00010547151,0.23875642,0.00045908903,0.15511866,0.59878165,0.0018286152],"about_ca_topic_score_codex":0.00025864446,"about_ca_topic_score_gemma":0.00022374495,"teacher_disagreement_score":0.5255862,"about_ca_system_score_codex":0.000018124398,"about_ca_system_score_gemma":0.00015067193,"threshold_uncertainty_score":0.57927424},"labels":[],"label_agreement":null},{"id":"W4220870994","doi":"10.18280/mmep.090133","title":"Advantages of the Differential Equations for Solving Problems in Mathematical Physics with Symbolic Computation","year":2022,"lang":"en","type":"article","venue":"Mathematical Modelling and Engineering Problems","topic":"Polynomial and algebraic computation","field":"Computer Science","cited_by":23,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Symbolic computation; Contouring; Computation; Variety (cybernetics); Soliton; Dimension (graph theory); Applied mathematics; Differential equation; Calculus (dental); Mathematical software; Computer science; Software; Algebra over a field; Mathematics; Mathematical analysis; Physics; Algorithm; Nonlinear system; Artificial intelligence; Pure mathematics; Programming language; Quantum mechanics","score_opus":0.021247868838956727,"score_gpt":0.2136294382557255,"score_spread":0.19238156941676876,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4220870994","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06917338,0.000038217237,0.93012005,0.00012470702,0.00004677074,0.00041575998,0.0000028692161,0.00005836886,0.000019870567],"genre_scores_gemma":[0.9375112,0.0000014784774,0.062269606,0.0000064807186,0.000016533355,0.00016081332,0.0000025093836,0.000013252177,0.000018094393],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990769,0.000017920567,0.00029796638,0.00019440056,0.0002176698,0.00019515336],"domain_scores_gemma":[0.9993797,0.00033460907,0.00008311287,0.00014121197,0.000026295767,0.0000350861],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00020697409,0.00012015534,0.00020347553,0.000059078913,0.00013295535,0.00005218486,0.00022241489,0.000021276688,0.0000016857804],"category_scores_gemma":[0.000019252018,0.00008768068,0.00004642337,0.000238718,0.000024798177,0.00011436796,0.00015802044,0.0001426858,3.7665365e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000014593971,0.000079213816,0.000007784224,0.00034867358,0.0000083199475,1.050191e-7,0.0016489006,0.85860366,0.00034745288,0.13821007,9.248237e-7,0.000743436],"study_design_scores_gemma":[0.0002586821,0.00005419164,0.00001798292,0.00015194224,0.000009164921,0.000005422716,0.000020100066,0.8361253,0.00010745196,0.1631496,0.0000038103383,0.000096356576],"about_ca_topic_score_codex":0.0000036648235,"about_ca_topic_score_gemma":3.792768e-7,"teacher_disagreement_score":0.86833787,"about_ca_system_score_codex":0.000026749449,"about_ca_system_score_gemma":0.000021770269,"threshold_uncertainty_score":0.35755146},"labels":[],"label_agreement":null},{"id":"W4223411577","doi":"10.4171/aihpd/116","title":"Combinatorial expression of the fundamental second kind differential on an algebraic curve","year":2022,"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":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Fonds Québécois de la Recherche sur la Nature et les Technologies; Agence Nationale de la Recherche; European Commission; Centre de Recherches Mathématiques","keywords":"Differential (mechanical device); Mathematics; Algebraic expression; Expression (computer science); Algebraic number; Algebra over a field; Differential algebraic geometry; Pure mathematics; Computer science; Physics; Mathematical analysis; Differential equation; Ordinary differential equation; Differential algebraic equation","score_opus":0.014464880891657225,"score_gpt":0.24018633991686641,"score_spread":0.22572145902520918,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4223411577","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.98433757,0.00006832335,0.009378623,0.0002847537,0.0040888498,0.00023975672,0.000075218966,0.00006396622,0.0014629426],"genre_scores_gemma":[0.9993791,0.0000065674176,0.00003682186,0.00021022446,0.00018395451,0.000047759186,0.000027326478,0.000015103104,0.00009311626],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9984427,0.00026287136,0.00029645706,0.0003968987,0.00031272307,0.0002883607],"domain_scores_gemma":[0.9988254,0.0001852873,0.0002587582,0.00052752544,0.00007642343,0.0001266402],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00015549542,0.00023715226,0.00023823752,0.00009654193,0.0010753664,0.00016075841,0.00083034456,0.0000382865,0.000043066975],"category_scores_gemma":[0.000012707281,0.00018994948,0.00017954451,0.0003903794,0.00011653865,0.00057300745,0.0008635258,0.0005241653,0.0000030212123],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000053270498,0.0013495174,0.0007676293,0.000020047139,0.000055571865,0.000004021361,0.0029801023,0.00040306713,0.01132936,0.9764093,0.0005998952,0.0060281944],"study_design_scores_gemma":[0.0019753126,0.0009593374,0.006621893,0.000077635385,0.000025786454,0.00007896782,0.0005874489,0.032783464,0.050726656,0.88669485,0.018908072,0.000560558],"about_ca_topic_score_codex":0.00004139781,"about_ca_topic_score_gemma":0.000011219245,"teacher_disagreement_score":0.08971445,"about_ca_system_score_codex":0.00014640241,"about_ca_system_score_gemma":0.00015213364,"threshold_uncertainty_score":0.8270957},"labels":[],"label_agreement":null},{"id":"W4229621980","doi":"10.1090/fic/034/08","title":"Embedding and the convergence of the binomial and trinomial tree schemes","year":2002,"lang":"en","type":"other","venue":"","topic":"Polynomial and algebraic computation","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"York University","funders":"","keywords":"Trinomial; Mathematics; Binomial (polynomial); Embedding; Tree (set theory); Convergence (economics); Trinomial tree; Applied mathematics; Econometrics; Computer science; Binomial options pricing model; Statistics; Discrete mathematics; Combinatorics; Economics; Artificial intelligence","score_opus":0.00922425247579755,"score_gpt":0.2127096937008371,"score_spread":0.20348544122503953,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4229621980","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.017776623,0.00700549,0.14691348,0.0061743795,0.0046607237,0.0017964955,0.000020273033,0.0004461276,0.8152064],"genre_scores_gemma":[0.3683289,0.00062369363,0.0088347,0.000549691,0.000811173,0.000021435932,0.0000010321049,0.00009707909,0.6207323],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992505,0.00006539138,0.00016791301,0.00025286706,0.00014029951,0.00012303764],"domain_scores_gemma":[0.99935454,0.00012762379,0.00017290842,0.00030015805,0.000011208513,0.000033564644],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00012476923,0.00014349443,0.00022071748,0.000061086765,0.00007084826,0.00006764545,0.00053243805,0.00008079514,0.0001235114],"category_scores_gemma":[0.00002337188,0.00007129174,0.00006094329,0.00012338768,0.00030506233,0.00006274115,0.00043478826,0.000103644416,0.0000059713416],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000056635443,0.00005681247,0.0004080816,0.00014355902,0.0001677669,0.0000034382276,0.0015088291,0.000032965087,0.00017215604,0.3101949,0.3176844,0.36957043],"study_design_scores_gemma":[0.007934736,0.000103942715,0.0026588675,0.00032989203,0.000107536325,0.00006844677,0.00006839333,0.5259954,0.0014612196,0.0064312546,0.4538989,0.0009414081],"about_ca_topic_score_codex":0.00018595437,"about_ca_topic_score_gemma":0.000031460608,"teacher_disagreement_score":0.5259624,"about_ca_system_score_codex":0.000006524887,"about_ca_system_score_gemma":0.000030066012,"threshold_uncertainty_score":0.2907193},"labels":[],"label_agreement":null},{"id":"W4234815141","doi":"10.1007/978-3-030-01404-9_1","title":"Cubic Fields","year":2018,"lang":"en","type":"book-chapter","venue":"CMS books in mathematics","topic":"Polynomial and algebraic computation","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Materials science","score_opus":0.02632359795463996,"score_gpt":0.24177805571659972,"score_spread":0.21545445776195976,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4234815141","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00010547235,0.0001412122,0.19218554,0.00016577574,0.00057358533,0.00019687026,0.000002126335,0.00013818449,0.80649126],"genre_scores_gemma":[0.0023656737,0.000028561184,0.064540915,0.0003662372,0.00048286564,0.000011536885,0.000005589394,0.00004707816,0.93215156],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987441,0.000008062018,0.00043422298,0.00033768942,0.00025850243,0.00021747139],"domain_scores_gemma":[0.9988831,0.00011985508,0.00021452064,0.0006679655,0.000049760234,0.00006478829],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00020502893,0.0002563882,0.00033954842,0.00017657618,0.00004783777,0.00010709427,0.00086750253,0.0002564534,0.00021219505],"category_scores_gemma":[0.000026291369,0.0002414165,0.00010830563,0.000032862066,0.00007632804,0.00011342707,0.00036408246,0.00029047896,0.00073469896],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[7.3502457e-7,0.000018035767,3.853991e-7,0.000090216825,0.000013750732,0.000024306044,0.0013016673,0.000006335467,0.0000050886974,0.9784796,0.007694654,0.0123652285],"study_design_scores_gemma":[0.000115954135,0.00004802867,0.0000019980187,0.00032735753,0.000008063445,0.000017084378,0.0000041764642,0.015813768,0.00006400002,0.94215494,0.041165646,0.00027897483],"about_ca_topic_score_codex":0.0000018450107,"about_ca_topic_score_gemma":0.000011830288,"teacher_disagreement_score":0.12764463,"about_ca_system_score_codex":0.00006230592,"about_ca_system_score_gemma":0.00009018719,"threshold_uncertainty_score":0.9844679},"labels":[],"label_agreement":null},{"id":"W4235362156","doi":"10.1007/978-3-032-00906-7_2","title":"Mathematical Background","year":2017,"lang":"en","type":"book-chapter","venue":"Springer series in operations research/Springer series in operations research and financial engineering","topic":"Polynomial and algebraic computation","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia, Okanagan Campus; University of British Columbia; Polytechnique Montréal","funders":"","keywords":"Notation; Calculus (dental); Algebra over a field; Mathematical notation; Multivariate statistics; Linear algebra; Mathematics; Computer science; Pure mathematics; Arithmetic; Geometry; Statistics; Medicine","score_opus":0.06030680848287386,"score_gpt":0.32732327161289987,"score_spread":0.267016463130026,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4235362156","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.16139087,0.01753786,0.24022266,0.029075904,0.009473899,0.020494293,0.0006258682,0.0021548634,0.5190238],"genre_scores_gemma":[0.3843166,0.0097070355,0.10432535,0.00009187958,0.0025806453,0.0024217512,0.00015252059,0.00044111838,0.49596313],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9943167,0.0001808015,0.0011063471,0.0013832187,0.0014737807,0.0015391327],"domain_scores_gemma":[0.9965612,0.000352218,0.00004120761,0.0017831931,0.00087069033,0.00039144958],"candidate_categories":["metaepi_narrow","sts","scholarly_communication","research_integrity"],"consensus_categories":[],"category_scores_codex":[0.0035089043,0.0006327577,0.00080830837,0.0025341199,0.0017941154,0.0030267576,0.00215422,0.000610345,0.00014878427],"category_scores_gemma":[0.0017298046,0.00068406534,0.000118509306,0.00059313775,0.0010619961,0.0035262904,0.002905009,0.003393142,0.00017944296],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004178913,0.00009044663,0.000014588353,0.000199691,0.000022632661,0.0002054832,0.0014729396,0.018012289,0.0004279524,0.97322553,0.0001379683,0.0061486764],"study_design_scores_gemma":[0.0032450007,0.0024522343,0.0046207597,0.0057902257,0.000023974657,0.00044608035,0.00071019167,0.4690146,0.0025631974,0.14394891,0.36206564,0.005119143],"about_ca_topic_score_codex":0.00055121735,"about_ca_topic_score_gemma":0.008747,"teacher_disagreement_score":0.8292766,"about_ca_system_score_codex":0.0006868498,"about_ca_system_score_gemma":0.0013043755,"threshold_uncertainty_score":0.9995611},"labels":[],"label_agreement":null},{"id":"W4235684925","doi":"10.1007/s11786-019-00391-x","title":"Foreword","year":2019,"lang":"en","type":"article","venue":"Mathematics in Computer Science","topic":"Polynomial and algebraic computation","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Wilfrid Laurier University; École de Technologie Supérieure","funders":"","keywords":"Computer science; Mathematics","score_opus":0.013862578413046204,"score_gpt":0.2447117283599842,"score_spread":0.230849149946938,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4235684925","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2675731,0.000008515383,0.7303223,0.00023621263,0.00070245314,0.00013475522,2.6354658e-7,0.000074443116,0.000947966],"genre_scores_gemma":[0.6057656,5.912416e-7,0.39395234,0.00018393139,0.000031236254,0.0000031852232,1.3276478e-7,0.0000029433645,0.00006005679],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984916,0.000013805478,0.00026147216,0.0004366051,0.0004427821,0.00035372615],"domain_scores_gemma":[0.9990093,0.00012952897,0.0000769118,0.0006519573,0.00005388402,0.0000784116],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007703914,0.00011170782,0.0001574693,0.0002803315,0.00006994439,0.00022052572,0.0018649173,0.000026063597,0.0000102820595],"category_scores_gemma":[0.00002124264,0.00009781248,0.000035655026,0.0012748847,0.0000918177,0.00083865615,0.0007614084,0.0001048782,0.00035034784],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000011316866,0.00019601364,0.0013273051,0.00006681115,0.0000030242027,0.000013022435,0.0035696174,0.006559782,0.0013929481,0.6917288,0.00013738369,0.29500416],"study_design_scores_gemma":[0.00016225617,0.000042103213,0.002674401,0.00004402231,3.3994942e-7,0.000016336904,0.0000043352334,0.9114624,0.00088223926,0.08449804,0.0000844078,0.0001291004],"about_ca_topic_score_codex":0.000005036875,"about_ca_topic_score_gemma":0.0000029341973,"teacher_disagreement_score":0.90490264,"about_ca_system_score_codex":0.00007505528,"about_ca_system_score_gemma":0.000121283505,"threshold_uncertainty_score":0.45031294},"labels":[],"label_agreement":null},{"id":"W4236292154","doi":"10.1090/cbms/109/05","title":"Gromov representation","year":2008,"lang":"en","type":"book-chapter","venue":"Regional conference series in mathematics","topic":"Polynomial and algebraic computation","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Lethbridge","funders":"","keywords":"Representation (politics); Mathematics; Computer science; Political science","score_opus":0.06903410113931185,"score_gpt":0.26654923847756296,"score_spread":0.1975151373382511,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4236292154","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0003942522,0.0003873312,0.15721394,0.003178308,0.0005864124,0.00058876624,0.000011262904,0.00033058634,0.8373091],"genre_scores_gemma":[0.01896422,0.003706166,0.1337723,0.00045849723,0.0005061062,0.000054891967,0.00014020859,0.00009600213,0.8423016],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99832934,0.000019536155,0.0005141263,0.00043865386,0.00048631997,0.00021199448],"domain_scores_gemma":[0.99871486,0.00016021589,0.00033848864,0.0005635967,0.00015100416,0.00007184797],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00011164904,0.00029822212,0.00041151827,0.00020823184,0.00008337038,0.00010603532,0.00077238143,0.00021096058,0.000074843236],"category_scores_gemma":[0.000037883114,0.00029667444,0.00011612369,0.00008637585,0.00018036584,0.00048369198,0.00026708742,0.00030386684,0.00015232366],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000039898378,0.0000214918,0.0000012113338,0.00005415379,0.000014547781,0.0000614988,0.0013542052,0.000019558003,0.000012569005,0.9866292,0.0028730535,0.008954531],"study_design_scores_gemma":[0.00017040901,0.00006052329,0.000052386717,0.00039365576,0.000007162766,0.00029985467,0.00003247761,0.0068733143,0.00007556704,0.9552062,0.036414772,0.00041366435],"about_ca_topic_score_codex":0.000008292545,"about_ca_topic_score_gemma":0.00002448824,"teacher_disagreement_score":0.03354172,"about_ca_system_score_codex":0.000082634586,"about_ca_system_score_gemma":0.00027061073,"threshold_uncertainty_score":0.99994856},"labels":[],"label_agreement":null},{"id":"W4236932319","doi":"10.4086/cjtcs.2013.002","title":"","year":2013,"lang":"en","type":"article","venue":"Chicago Journal of Theoretical Computer Science","topic":"Polynomial and algebraic computation","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Natural Sciences and Engineering Research Council of Canada","funders":"","keywords":"Medicine","score_opus":0.007502958735596331,"score_gpt":0.22860672562146955,"score_spread":0.22110376688587322,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4236932319","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.40495637,0.00004631803,0.58464074,0.008857816,0.0012118114,0.00013877379,1.4094047e-7,0.000059636175,0.0000883774],"genre_scores_gemma":[0.702741,0.000006032433,0.29530573,0.0015093089,0.00042665566,0.000003137415,7.176645e-8,0.0000068861355,0.000001129178],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99459994,0.0002763282,0.0013649969,0.0007340598,0.001973145,0.001051504],"domain_scores_gemma":[0.994557,0.00078901876,0.0007464464,0.0009663921,0.0017241071,0.0012169972],"candidate_categories":["metaepi_narrow","sts","scholarly_communication","open_science"],"consensus_categories":[],"category_scores_codex":[0.0036373422,0.00035328214,0.00059657317,0.00077500107,0.0007231427,0.0022131135,0.0087918425,0.000082167164,0.0000269268],"category_scores_gemma":[0.0005232565,0.00024950772,0.00032612702,0.002564031,0.0035938974,0.0071244426,0.0021124422,0.00066998426,0.000035180925],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000012379846,0.00015820298,0.00020472864,0.0000067016467,0.000014395974,0.000035128985,0.000897347,0.0012410256,0.008062282,0.8011785,0.00009653517,0.18809278],"study_design_scores_gemma":[0.0007322147,0.00094192754,0.017380381,0.000073611045,0.0000076217857,0.0010728982,0.000015673866,0.4598363,0.012906211,0.50669336,0.000034664237,0.00030510512],"about_ca_topic_score_codex":0.0000073117335,"about_ca_topic_score_gemma":3.0254876e-7,"teacher_disagreement_score":0.45859528,"about_ca_system_score_codex":0.00014923494,"about_ca_system_score_gemma":0.0005081915,"threshold_uncertainty_score":0.9999957},"labels":[],"label_agreement":null},{"id":"W4240426603","doi":"10.1090/fic/058/05","title":"𝐶_{𝑎𝑏} curves and arithmetic on their Jacobians","year":2010,"lang":"en","type":"other","venue":"","topic":"Polynomial and algebraic computation","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Arithmetic; Mathematics","score_opus":0.008659997803084643,"score_gpt":0.21243571019020302,"score_spread":0.2037757123871184,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4240426603","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00006556621,0.00088943756,0.07686052,0.0022956457,0.0009787945,0.00022182104,0.000008933582,0.0005476477,0.91813165],"genre_scores_gemma":[0.0029780776,0.0004341139,0.011329666,0.004134201,0.00049050385,0.000013259882,0.000009592314,0.00012464804,0.9804859],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99923944,0.000024859051,0.00009856603,0.00035788747,0.00012224464,0.00015700168],"domain_scores_gemma":[0.99942964,0.000060841692,0.000070156384,0.00035428282,0.000009763226,0.000075296295],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00007405819,0.00018290822,0.00018132638,0.00014213774,0.000034768116,0.000087118744,0.00042721376,0.00013375244,0.00033316214],"category_scores_gemma":[0.000010544636,0.00012937858,0.00004069337,0.00010396557,0.000049903832,0.000048847076,0.00014585974,0.00020351852,0.00014201502],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[7.808522e-7,0.00004766206,0.000010369994,0.00007899618,0.000023879158,0.000005998572,0.00007378012,6.310548e-7,0.00006217461,0.03396988,0.6272121,0.33851373],"study_design_scores_gemma":[0.0002236351,0.00010501369,0.00053782045,0.00043089833,0.000007723447,0.000019560312,0.0000030926005,0.0030399903,0.00021043005,0.0057253544,0.98926115,0.00043532002],"about_ca_topic_score_codex":0.00015715606,"about_ca_topic_score_gemma":0.00023469065,"teacher_disagreement_score":0.36204904,"about_ca_system_score_codex":0.0000058282285,"about_ca_system_score_gemma":0.00003493223,"threshold_uncertainty_score":0.5275905},"labels":[],"label_agreement":null},{"id":"W4242828439","doi":"10.7287/peerj.preprints.504","title":"The design of Maple's sum-of-products and POLY data structures for representing mathematical objects","year":2014,"lang":"en","type":"preprint","venue":"","topic":"Polynomial and algebraic computation","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Maple; Computer science; Kernel (algebra); Object (grammar); Algebra over a field; Mathematics; Pure mathematics; Artificial intelligence","score_opus":0.0716409593781773,"score_gpt":0.30088979022402207,"score_spread":0.22924883084584477,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4242828439","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.006462952,0.0005114855,0.99103487,0.0008279995,0.00038850782,0.0005441102,0.000012672186,0.000043116917,0.0001742776],"genre_scores_gemma":[0.59054506,0.000015494756,0.40912372,0.000023367269,0.00014426619,0.00000972166,0.000013539236,0.000008221225,0.00011663569],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984084,0.00011464253,0.00044723743,0.00060474634,0.00023132413,0.00019366141],"domain_scores_gemma":[0.99622643,0.0014554239,0.00038827822,0.00176093,0.00012731286,0.000041647458],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011650686,0.00015792246,0.00031481436,0.00005619552,0.00009858538,0.00016904387,0.0019694369,0.000083040504,0.0000015803167],"category_scores_gemma":[0.000975975,0.00010063287,0.000041858697,0.00008365771,0.00011340821,0.00012453347,0.003909755,0.00012903796,5.417351e-7],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000665925,0.000069851194,0.00006956338,0.0021040665,0.00023111205,0.0000015588117,0.0015355395,0.0021053776,0.0034550047,0.6673078,0.0062213168,0.3168322],"study_design_scores_gemma":[0.00014166729,0.000033406675,0.00035382435,0.000071346745,0.000019894813,0.0000059887066,0.000019327288,0.5194332,0.011465507,0.46822006,0.00010585964,0.00012994467],"about_ca_topic_score_codex":0.00004019854,"about_ca_topic_score_gemma":0.0000028259826,"teacher_disagreement_score":0.58408207,"about_ca_system_score_codex":0.0000056890635,"about_ca_system_score_gemma":0.0001529769,"threshold_uncertainty_score":0.487323},"labels":[],"label_agreement":null},{"id":"W4245291382","doi":"10.1007/978-3-319-73232-9","title":"Advances in Computer Algebra","year":2018,"lang":"en","type":"book","venue":"Springer proceedings in mathematics & statistics","topic":"Polynomial and algebraic computation","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Wilfrid Laurier University","funders":"","keywords":"Symbolic computation; Algebra over a field; Linear algebra; Factorization; Computer science; Mathematics; Pure mathematics; Algorithm; Mathematical analysis","score_opus":0.010446811332817545,"score_gpt":0.24378203060302414,"score_spread":0.2333352192702066,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4245291382","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00019641874,0.00042172827,0.9059043,0.00006719021,0.0009021833,0.0005835142,0.000028435905,0.00019480735,0.09170145],"genre_scores_gemma":[0.0003290696,0.00045204628,0.9746776,0.00013593174,0.0006364227,0.000045338973,0.000020068535,0.00008071519,0.023622807],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9969287,0.000012345278,0.0010451607,0.00079615327,0.00061992207,0.0005977306],"domain_scores_gemma":[0.99835515,0.0003367146,0.0006126319,0.00033672986,0.00023993538,0.00011884772],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.000646951,0.000527738,0.00074127567,0.0006061198,0.00006862124,0.00034193715,0.001367301,0.00027560195,0.000025603067],"category_scores_gemma":[0.00014086351,0.00054332044,0.00007098812,0.00030861358,0.00015122081,0.00062027527,0.000722908,0.0006171789,0.00020529152],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000004325773,0.00014556783,0.000053020245,0.0012654975,0.000013457424,0.000060173057,0.0030563076,0.000036440226,0.0000041317844,0.8914692,0.010947082,0.09294484],"study_design_scores_gemma":[0.00034927865,0.000104840605,0.000109704284,0.0010872894,0.000011862074,0.000016072034,0.000011503612,0.13899447,0.0000206404,0.8339071,0.024786334,0.0006008929],"about_ca_topic_score_codex":0.0000041997155,"about_ca_topic_score_gemma":0.00004061192,"teacher_disagreement_score":0.13895802,"about_ca_system_score_codex":0.00038468218,"about_ca_system_score_gemma":0.00029387334,"threshold_uncertainty_score":0.99970186},"labels":[],"label_agreement":null},{"id":"W4246274077","doi":"10.1090/fim/009/04","title":"Homological algebra","year":2008,"lang":"en","type":"book-chapter","venue":"American Mathematical Society eBooks","topic":"Polynomial and algebraic computation","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Homological algebra; Algebra over a field; Pure mathematics; Mathematics; Functor","score_opus":0.01922290206068402,"score_gpt":0.23043418482749423,"score_spread":0.2112112827668102,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4246274077","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00015887112,0.0000879378,0.25420097,0.0006711263,0.00011539262,0.0002828428,0.0000062707654,0.0005587282,0.7439179],"genre_scores_gemma":[0.016795939,0.00017604465,0.25732014,0.0065086163,0.0007817886,0.000069023416,0.000020395595,0.00014894284,0.7181791],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99763626,0.000027913844,0.0005395187,0.00072899094,0.0005892617,0.00047803487],"domain_scores_gemma":[0.9981235,0.0003997482,0.00038608184,0.0007418341,0.0000712286,0.0002776027],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00015533119,0.000493407,0.0008019553,0.00004365684,0.00022545752,0.00010871144,0.0011078562,0.00024574384,0.00013170412],"category_scores_gemma":[0.000025663101,0.0004123703,0.00081560796,0.000047653673,0.0010945871,0.000074018324,0.0006305125,0.00059205433,0.00088677],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000001908907,0.00003013522,3.5551463e-7,0.000029025521,0.00010436575,0.000044173918,0.0008339539,0.0000010494855,0.000012872157,0.8635843,0.015209306,0.1201486],"study_design_scores_gemma":[0.00023355505,0.00029101755,0.00001664481,0.000104940955,0.00004567738,0.00024406328,0.000021798767,0.005585037,0.000046088553,0.8679486,0.12454798,0.0009146234],"about_ca_topic_score_codex":0.0000070244187,"about_ca_topic_score_gemma":4.460171e-7,"teacher_disagreement_score":0.11923398,"about_ca_system_score_codex":0.000112444315,"about_ca_system_score_gemma":0.00016055521,"threshold_uncertainty_score":0.99989116},"labels":[],"label_agreement":null},{"id":"W4249550536","doi":"10.1137/100808885","title":"Convexity Properties of the Condition Number II","year":2012,"lang":"en","type":"article","venue":"SIAM Journal on Matrix Analysis and Applications","topic":"Polynomial and algebraic computation","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada; Universitat de Barcelona; Conselho Nacional de Desenvolvimento Científico e Tecnológico; Fundação Carlos Chagas Filho de Amparo à Pesquisa do Estado do Rio de Janeiro; Agencia Nacional de Promoción Científica y Tecnológica; Consejo Nacional de Investigaciones Científicas y Técnicas; Coordenação de Aperfeiçoamento de Pessoal de Nível Superior","keywords":"Mathematics; Hessian matrix; Geodesic; Rank (graph theory); Lipschitz continuity; Pure mathematics; Matrix (chemical analysis); Metric (unit); Convex function; Homogeneous space; Convexity; Piecewise linear function; Mathematical analysis; Combinatorics; Applied mathematics; Regular polygon; Geometry","score_opus":0.013409910027748936,"score_gpt":0.26458913892988883,"score_spread":0.2511792289021399,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4249550536","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6208347,0.0003259348,0.3759553,0.0019176617,0.000082551094,0.00014072217,0.0000049685814,0.00002019817,0.0007179176],"genre_scores_gemma":[0.9987401,0.000029604675,0.0007676449,0.00011241067,0.0001278473,0.000011224073,0.0000010892512,0.0000018648278,0.00020826649],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"observational","domain_scores_codex":[0.9993854,0.000051372986,0.00020693727,0.00008655587,0.00016374953,0.000105939114],"domain_scores_gemma":[0.99944085,0.000024005976,0.00020412137,0.00018718731,0.00007216103,0.00007165367],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00023827683,0.00006030569,0.00012006075,0.00007469098,0.00040279527,0.000057648293,0.00023046693,0.000022284023,0.000022918233],"category_scores_gemma":[0.000007971768,0.00003586404,0.00011753159,0.0007011496,0.00005099745,0.00021454022,0.000080298494,0.00009989866,0.000011209004],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000120578225,0.0006659173,0.046217445,0.00003423739,0.0008060485,2.9478676e-7,0.001268843,0.0015508028,0.010873689,0.8797851,0.0011590088,0.057626523],"study_design_scores_gemma":[0.0015216112,0.00019521524,0.69898576,0.00012818442,0.0021372256,0.00025353726,0.0004028776,0.06618833,0.05862723,0.08852511,0.08204438,0.0009905323],"about_ca_topic_score_codex":0.000007743708,"about_ca_topic_score_gemma":0.0000015430086,"teacher_disagreement_score":0.79126,"about_ca_system_score_codex":0.000014421552,"about_ca_system_score_gemma":0.000024935389,"threshold_uncertainty_score":0.3098016},"labels":[],"label_agreement":null},{"id":"W4250044564","doi":"10.1007/978-3-642-38841-5_1","title":"Galois Theory","year":2013,"lang":"en","type":"book-chapter","venue":"","topic":"Polynomial and algebraic computation","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Mathematics; Computer science","score_opus":0.012460454198376214,"score_gpt":0.2001172391003089,"score_spread":0.1876567849019327,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4250044564","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0000027149608,0.00012067267,0.25009415,0.00028003164,0.00056774175,0.00008433336,7.30901e-7,0.00020232427,0.7486473],"genre_scores_gemma":[0.0009309338,0.000015929303,0.0060094655,0.0007936133,0.00020125246,0.0000037015516,0.0000039679007,0.000013207744,0.99202794],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992042,0.000009695021,0.00016396877,0.00031576015,0.00016785308,0.00013852296],"domain_scores_gemma":[0.99929905,0.00008906874,0.000081747625,0.00040915448,0.000045502376,0.000075482414],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.00009765879,0.0001755513,0.00015814354,0.000085266,0.000051411884,0.00012879302,0.0006388504,0.00012085019,0.0024212115],"category_scores_gemma":[0.0000050051003,0.00014050804,0.00009823525,0.000016422364,0.000030661104,0.00019890966,0.00028201746,0.00014204784,0.007144691],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[3.1593888e-7,0.0000016987724,4.9019178e-8,0.0000024495916,0.000009117557,0.000002528314,0.000023320885,9.972794e-7,0.0000033844258,0.76756984,0.019164694,0.21322161],"study_design_scores_gemma":[0.000044240343,0.000016714002,0.000009533276,0.000015463333,0.000003303108,0.000005934181,3.720644e-7,0.0012056645,0.000026663789,0.72025055,0.27825373,0.00016779784],"about_ca_topic_score_codex":0.000011023945,"about_ca_topic_score_gemma":0.0000020842756,"teacher_disagreement_score":0.25908905,"about_ca_system_score_codex":0.000026060548,"about_ca_system_score_gemma":0.000055541714,"threshold_uncertainty_score":0.9984907},"labels":[],"label_agreement":null},{"id":"W4250299769","doi":"10.1007/978-0-387-39940-9_3672","title":"SPJRU-Algebra","year":2009,"lang":"en","type":"book-chapter","venue":"Encyclopedia of Database Systems","topic":"Polynomial and algebraic computation","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Algebra over a field; Pure mathematics; Mathematics","score_opus":0.013635940304257868,"score_gpt":0.2227934880703658,"score_spread":0.20915754776610795,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4250299769","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000035397676,0.0034354131,0.051403165,0.0001359408,0.0029758012,0.0005565169,0.000307366,0.0002501732,0.9409002],"genre_scores_gemma":[0.003458896,0.0020149893,0.009769927,0.00019003666,0.0026419396,0.000025312418,0.0007797537,0.000090169764,0.981029],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.997349,0.000046883157,0.00086709426,0.00073066214,0.0006775429,0.00032880623],"domain_scores_gemma":[0.99743354,0.00015724184,0.00067734113,0.0014045874,0.00013327732,0.0001939995],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00036141896,0.0004481469,0.00070202886,0.00031863304,0.00007431834,0.00008866348,0.0013446949,0.00022536004,0.000059798553],"category_scores_gemma":[0.000037929844,0.0004250927,0.00019511383,0.00010219859,0.00005978899,0.0005458422,0.0004182108,0.0003370939,0.00042857172],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000059309214,0.000035939418,0.000003642955,0.00024171703,0.00005996998,0.00009241555,0.00012670395,0.000036133213,0.000030264038,0.86999214,0.038600158,0.090775],"study_design_scores_gemma":[0.00031427154,0.00012853391,0.00003148601,0.0008059583,0.000042457228,0.00005657281,0.000004607315,0.0020867572,0.000029532692,0.012599095,0.98326284,0.00063786906],"about_ca_topic_score_codex":0.00010002847,"about_ca_topic_score_gemma":0.000009257061,"teacher_disagreement_score":0.9446627,"about_ca_system_score_codex":0.00006585976,"about_ca_system_score_gemma":0.00028157502,"threshold_uncertainty_score":0.9998201},"labels":[],"label_agreement":null},{"id":"W4252316665","doi":"10.7287/peerj.preprints.504v1","title":"The design of Maple's sum-of-products and POLY data structures for representing mathematical objects","year":2014,"lang":"en","type":"preprint","venue":"","topic":"Polynomial and algebraic computation","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Maple; Computer science; Object (grammar); Kernel (algebra); Algebra over a field; Data structure; Mathematics; Algorithm; Programming language; Pure mathematics; Artificial intelligence","score_opus":0.0716409593781773,"score_gpt":0.30088979022402207,"score_spread":0.22924883084584477,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4252316665","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.006462952,0.0005114855,0.99103487,0.0008279995,0.00038850782,0.0005441102,0.000012672186,0.000043116917,0.0001742776],"genre_scores_gemma":[0.59054506,0.000015494756,0.40912372,0.000023367269,0.00014426619,0.00000972166,0.000013539236,0.000008221225,0.00011663569],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984084,0.00011464253,0.00044723743,0.00060474634,0.00023132413,0.00019366141],"domain_scores_gemma":[0.99622643,0.0014554239,0.00038827822,0.00176093,0.00012731286,0.000041647458],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011650686,0.00015792246,0.00031481436,0.00005619552,0.00009858538,0.00016904387,0.0019694369,0.000083040504,0.0000015803167],"category_scores_gemma":[0.000975975,0.00010063287,0.000041858697,0.00008365771,0.00011340821,0.00012453347,0.003909755,0.00012903796,5.417351e-7],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000665925,0.000069851194,0.00006956338,0.0021040665,0.00023111205,0.0000015588117,0.0015355395,0.0021053776,0.0034550047,0.6673078,0.0062213168,0.3168322],"study_design_scores_gemma":[0.00014166729,0.000033406675,0.00035382435,0.000071346745,0.000019894813,0.0000059887066,0.000019327288,0.5194332,0.011465507,0.46822006,0.00010585964,0.00012994467],"about_ca_topic_score_codex":0.00004019854,"about_ca_topic_score_gemma":0.0000028259826,"teacher_disagreement_score":0.58408207,"about_ca_system_score_codex":0.0000056890635,"about_ca_system_score_gemma":0.0001529769,"threshold_uncertainty_score":0.487323},"labels":[],"label_agreement":null},{"id":"W4252395218","doi":"10.1017/cbo9780511526374.001","title":"Preface","year":2006,"lang":"en","type":"book-chapter","venue":"Cambridge University Press eBooks","topic":"Polynomial and algebraic computation","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Psychology","score_opus":0.01522987684110791,"score_gpt":0.18154277756062218,"score_spread":0.16631290071951427,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4252395218","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000031591495,0.00008222265,0.08608858,0.000034628527,0.00033451448,0.00019683485,0.00003858138,0.00032749563,0.9128655],"genre_scores_gemma":[0.001057145,0.000009743042,0.00096763385,0.000065866094,0.00015044068,2.6886266e-7,0.000022648093,0.000019047351,0.9977072],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9987867,0.000022012811,0.00015281717,0.0005472266,0.0002478741,0.00024336117],"domain_scores_gemma":[0.9989732,0.000048131795,0.00018232958,0.0005886049,0.000087221124,0.00012052211],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.000054395987,0.00028740452,0.00026042372,0.00014795153,0.00015397133,0.00009972123,0.0010973274,0.00021791228,0.0000012800048],"category_scores_gemma":[0.0000021741175,0.0003406757,0.00017307201,0.0000097526,0.000091553615,0.00018050913,0.0007196259,0.00028381989,0.000041605017],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000059063123,0.000004748787,1.9768483e-7,0.000017032864,0.000026345408,0.00011816609,0.00001249611,0.00002384456,0.000016046022,0.8915439,0.101472236,0.0067590764],"study_design_scores_gemma":[0.00028617808,0.000031207244,0.000021597609,0.000056567234,0.000033897737,0.000013215855,8.2370866e-7,0.0020929768,0.00022883007,0.00014670267,0.9966973,0.00039068717],"about_ca_topic_score_codex":0.00013773743,"about_ca_topic_score_gemma":0.0000013201172,"teacher_disagreement_score":0.8952251,"about_ca_system_score_codex":0.00014534443,"about_ca_system_score_gemma":0.00012123577,"threshold_uncertainty_score":0.9999045},"labels":[],"label_agreement":null},{"id":"W4252961403","doi":"10.1090/fic/058/04","title":"An introduction to Gröbner bases","year":2010,"lang":"en","type":"other","venue":"","topic":"Polynomial and algebraic computation","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Computer science; Mathematics","score_opus":0.006703836772138352,"score_gpt":0.23444162131891738,"score_spread":0.22773778454677904,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4252961403","genre_codex":"methods","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0000370447,0.000011512353,0.7518169,0.0056056203,0.0030884352,0.00014201182,0.0000022195052,0.000810097,0.23848611],"genre_scores_gemma":[0.0006360312,0.0000014539988,0.14354181,0.0012942749,0.006729257,0.000011366881,0.000016212696,0.00008786255,0.8476817],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99921,0.000021764647,0.00008670225,0.00042008143,0.00012727594,0.00013417537],"domain_scores_gemma":[0.99926037,0.000008804312,0.00004475476,0.0005556703,0.000017639673,0.00011276516],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00007000703,0.00012421858,0.00011159277,0.00021683854,0.000026818427,0.00011450972,0.0005166056,0.00010595791,0.00174953],"category_scores_gemma":[0.000011873226,0.000102778366,0.000027639755,0.0001761986,0.000011085324,0.00012926874,0.000091301205,0.00010907799,0.00054756866],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[5.118691e-7,0.00001922412,0.0000012867773,0.0000024390308,0.0000029894063,8.382743e-7,0.000019645571,0.000007348356,0.00047251588,0.027327515,0.79574174,0.17640394],"study_design_scores_gemma":[0.000041237425,0.000045896508,0.000046600035,0.000004256236,0.0000018691322,0.0000041275616,0.000001053443,0.0018435129,0.00048371905,0.00072918605,0.9966352,0.0001633417],"about_ca_topic_score_codex":0.00024655618,"about_ca_topic_score_gemma":0.00039741214,"teacher_disagreement_score":0.6091956,"about_ca_system_score_codex":0.000009855196,"about_ca_system_score_gemma":0.000035019497,"threshold_uncertainty_score":0.99916303},"labels":[],"label_agreement":null},{"id":"W4253239398","doi":"10.1007/978-0-387-21690-4_5","title":"Algebraic Integers","year":2001,"lang":"en","type":"book-chapter","venue":"Universitext","topic":"Polynomial and algebraic computation","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"","keywords":"Mathematics; Algebraic number; Algebra over a field; Pure mathematics; Mathematical analysis","score_opus":0.011232846187910593,"score_gpt":0.18614757771528734,"score_spread":0.17491473152737674,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4253239398","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00003313399,0.00018246059,0.06360932,0.00050032313,0.00049125636,0.000090424546,0.000004135969,0.00020778019,0.93488115],"genre_scores_gemma":[0.0054269363,0.00007164342,0.0013851516,0.0003751553,0.00017368418,2.5615216e-7,0.000021651082,0.000019628716,0.9925259],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9989921,0.000009326308,0.00014137874,0.0004320415,0.00021771264,0.00020743144],"domain_scores_gemma":[0.99920684,0.000054488435,0.00012917959,0.00042579087,0.000060400598,0.000123279],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.00004818723,0.00023876395,0.00020891329,0.00031268146,0.0001066777,0.00007806266,0.0009138853,0.00017710806,0.0009189899],"category_scores_gemma":[0.0000036176227,0.000258842,0.00016159246,0.00008147316,0.000060157417,0.0003233576,0.00038209363,0.00025178998,0.0017926345],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000002891948,0.000004889599,9.3511966e-7,0.0000045243446,0.00003125117,0.00019204411,0.00016700539,0.000017466204,0.0000039734246,0.8470359,0.01605321,0.13648592],"study_design_scores_gemma":[0.00018760802,0.000045011195,0.000008061168,0.00005915953,0.000016648233,0.000038607235,0.0000085360025,0.0015286818,0.000008591945,0.08179027,0.9159766,0.00033221615],"about_ca_topic_score_codex":0.000014840687,"about_ca_topic_score_gemma":0.000005183431,"teacher_disagreement_score":0.8999234,"about_ca_system_score_codex":0.00015740017,"about_ca_system_score_gemma":0.00010479503,"threshold_uncertainty_score":0.9999943},"labels":[],"label_agreement":null},{"id":"W4253247702","doi":"10.1515/iupac.84.0535","title":"Equivalence Zone","year":2016,"lang":"en","type":"dataset","venue":"IUPAC Standards Online","topic":"Polynomial and algebraic computation","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Canada Research Chairs; University of Toronto","funders":"","keywords":"Glossary; Immunotoxicology; Medicine; Immunology; Immune system; Philosophy; Linguistics","score_opus":0.01551966557346888,"score_gpt":0.36568688542988737,"score_spread":0.35016721985641847,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4253247702","genre_codex":"dataset","genre_gemma":"dataset","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"dataset","genre_consensus":"dataset","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00001704803,0.0004133197,0.19043101,0.0014133598,0.0014879119,0.00013788632,0.80591446,0.00015842044,0.000026599766],"genre_scores_gemma":[0.000042982625,0.00034512774,0.0011095006,0.0005587669,0.0011429325,0.000009897646,0.99621034,0.000016150465,0.00056433125],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9971376,0.00008581476,0.00044089925,0.00072934025,0.0011095167,0.0004968001],"domain_scores_gemma":[0.99787384,0.0001477958,0.00028319436,0.0011867932,0.00030243333,0.00020594837],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00046218708,0.00038190233,0.00045212792,0.00022340952,0.00013192379,0.00019135005,0.001911224,0.00021924585,0.00044822792],"category_scores_gemma":[0.00019831896,0.0002883966,0.00015562847,0.000326029,0.00010236765,0.00036005946,0.00084218936,0.0003280598,0.000014479029],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009641909,0.00007370415,4.3067976e-7,0.00003993283,0.000023693043,0.000053039974,0.000009396389,0.0000025649388,0.000009182817,0.00031923904,0.9188067,0.08065249],"study_design_scores_gemma":[0.00044813394,0.0001543544,0.000015268211,0.0002591921,0.000017592889,0.000025514139,0.0000012915714,0.00027541257,0.000032824464,0.0019230775,0.9964382,0.00040915946],"about_ca_topic_score_codex":0.00007939431,"about_ca_topic_score_gemma":0.00011774461,"teacher_disagreement_score":0.19029588,"about_ca_system_score_codex":0.00027309026,"about_ca_system_score_gemma":0.00087705214,"threshold_uncertainty_score":0.99995685},"labels":[],"label_agreement":null},{"id":"W4254749724","doi":"10.1088/2053-2571/ab0bb3ch6","title":"Linear algebra","year":2019,"lang":"it","type":"book-chapter","venue":"Morgan & Claypool Publishers eBooks","topic":"Polynomial and algebraic computation","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"St. Francis Xavier University","funders":"","keywords":"Linear algebra; Algebra over a field; Mathematics; Pure mathematics; Geometry","score_opus":0.020035155381259526,"score_gpt":0.22001101754871094,"score_spread":0.19997586216745142,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4254749724","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0032617007,0.00025774195,0.02204239,0.003338427,0.00958422,0.0018976743,0.000072064955,0.0010805856,0.9584652],"genre_scores_gemma":[0.10022257,0.000010147413,0.0037157007,0.004754203,0.0030074068,0.000028080898,0.00018227866,0.00039560828,0.887684],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9919573,0.0001603088,0.0017387264,0.002764172,0.001744147,0.0016353627],"domain_scores_gemma":[0.99389637,0.00036283923,0.0012255372,0.0029074345,0.0006781243,0.0009297269],"candidate_categories":["metaepi_narrow","scholarly_communication","research_integrity","insufficient_payload"],"consensus_categories":["metaepi_narrow","insufficient_payload"],"category_scores_codex":[0.0008745063,0.0017050563,0.0015852237,0.0009530545,0.0005570041,0.0043171225,0.0043101227,0.0014111144,0.0017800608],"category_scores_gemma":[0.00013329882,0.0017745023,0.00092073047,0.00022243311,0.00050737645,0.002465285,0.0022066864,0.0022465084,0.006898053],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00011197865,0.00013649398,0.00014174367,0.00034751324,0.000859428,0.00036853956,0.0022613474,0.00020706894,0.0005971685,0.6458088,0.09574477,0.25341517],"study_design_scores_gemma":[0.0025421586,0.00076829747,0.00063557207,0.0006233258,0.00031720137,0.00018082082,0.00009026392,0.019485816,0.00081328955,0.047539625,0.9232325,0.003771112],"about_ca_topic_score_codex":0.00022662281,"about_ca_topic_score_gemma":0.000028530862,"teacher_disagreement_score":0.82748777,"about_ca_system_score_codex":0.00043624992,"about_ca_system_score_gemma":0.0019812512,"threshold_uncertainty_score":0.99988526},"labels":[],"label_agreement":null},{"id":"W4255281808","doi":"10.1007/0-387-21597-2_13","title":"Algebra","year":2004,"lang":"en","type":"book-chapter","venue":"Applied mathematical sciences","topic":"Polynomial and algebraic computation","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Sherbrooke","funders":"","keywords":"Algebra over a field; Presentation (obstetrics); Mathematics; Abstract algebra; Algebraic number; Pure mathematics; Medicine","score_opus":0.022850679656245456,"score_gpt":0.23709680809208655,"score_spread":0.2142461284358411,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4255281808","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000028902557,0.000053256117,0.1862785,0.0006431116,0.00013697476,0.00021344594,0.0000015397733,0.00023422699,0.81241006],"genre_scores_gemma":[0.10593452,0.00006333823,0.3861886,0.0028922248,0.00087576645,0.000094264135,0.0000115959865,0.000091980306,0.5038477],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99787265,0.000004769776,0.0003765965,0.0006719875,0.0007060589,0.00036792632],"domain_scores_gemma":[0.9989994,0.00020685047,0.00019344404,0.0004086347,0.000024759107,0.00016689903],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00040242533,0.000298106,0.0003565881,0.00013147542,0.00024605455,0.00030571202,0.0015751007,0.00016811468,0.000719335],"category_scores_gemma":[0.000018132694,0.00022841901,0.00011740829,0.00012395001,0.00045268468,0.00018751438,0.00047251716,0.00021417654,0.0024108428],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[4.9539034e-7,0.000014134858,2.9640594e-8,0.000029395545,0.0000073494675,0.0000048431307,0.00008172303,0.000031964926,0.000019243089,0.9777942,0.00023165008,0.021785012],"study_design_scores_gemma":[0.00009911361,0.0000418259,0.0000028146746,0.00008001042,0.000008075973,0.000009042955,0.0000026896516,0.0011970407,0.00014706959,0.98993516,0.008167706,0.0003094656],"about_ca_topic_score_codex":0.00000193771,"about_ca_topic_score_gemma":9.1529654e-7,"teacher_disagreement_score":0.3085623,"about_ca_system_score_codex":0.00006671912,"about_ca_system_score_gemma":0.00026096622,"threshold_uncertainty_score":0.9983659},"labels":[],"label_agreement":null},{"id":"W4290098640","doi":"10.1016/j.jsc.2022.08.015","title":"Parallelization of triangular decompositions: Techniques and implementation","year":2022,"lang":"en","type":"article","venue":"Journal of Symbolic Computation","topic":"Polynomial and algebraic computation","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"","keywords":"Concurrency; Pipeline (software); Component (thermodynamics); Set (abstract data type); Parallel computing; Polynomial; Focus (optics); Mathematics; Computer science; Class (philosophy); Parallelism (grammar); Distributed computing; Programming language","score_opus":0.008855122444873777,"score_gpt":0.28257560946351823,"score_spread":0.27372048701864443,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4290098640","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3941466,0.00032054857,0.60441047,0.0006931496,0.00019370299,0.00014652353,0.0000025211525,0.000025437781,0.0000610784],"genre_scores_gemma":[0.9602822,0.00003457339,0.03951059,0.000067611305,0.00007940889,0.0000070539445,0.000009094593,0.000004632348,0.000004811352],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987905,0.00014965866,0.00054745283,0.00010718101,0.00031982537,0.000085354004],"domain_scores_gemma":[0.99896383,0.000085395186,0.00066400744,0.00007142952,0.00017243669,0.00004287683],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00050383393,0.00007235006,0.00017165478,0.00034937495,0.00014733382,0.000043684126,0.0002020447,0.0000160632,0.000012415703],"category_scores_gemma":[0.000009780059,0.00007399268,0.000061059436,0.00037956875,0.00001780491,0.0004401845,0.000120215016,0.00009377597,2.9565635e-7],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000055480188,0.00016873484,0.0006815711,0.000034285986,0.000059601567,0.000019591582,0.0035961333,0.011488753,0.00784206,0.034700416,0.0007042742,0.9406491],"study_design_scores_gemma":[0.011071764,0.006924461,0.07825322,0.00021391775,0.00024304967,0.00485161,0.003710792,0.45354554,0.06021386,0.3669808,0.012818086,0.0011729148],"about_ca_topic_score_codex":0.000017176731,"about_ca_topic_score_gemma":0.0000010896925,"teacher_disagreement_score":0.9394762,"about_ca_system_score_codex":0.00006482797,"about_ca_system_score_gemma":0.00009391788,"threshold_uncertainty_score":0.3017334},"labels":[],"label_agreement":null},{"id":"W4294805266","doi":"10.5206/mt.v2i1.14463","title":"Computing Intersection Multiplicities with Regular Chains","year":2022,"lang":"en","type":"article","venue":"Maple Transactions","topic":"Polynomial and algebraic computation","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"Western University","funders":"Mitacs","keywords":"Multiplicity (mathematics); Intersection (aeronautics); Generalization; Maple; Mathematics; Algorithm; Computer science; Discrete mathematics; Geometry; Mathematical analysis","score_opus":0.00882055972406975,"score_gpt":0.19661853597663054,"score_spread":0.18779797625256078,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4294805266","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09220889,0.000014067846,0.9053854,0.0011532076,0.00043272553,0.00011315725,0.0000054761863,0.00031099934,0.00037610714],"genre_scores_gemma":[0.98990685,6.1012054e-7,0.009039609,0.00018683927,0.000043456635,0.00003198879,0.000004901428,0.000008011439,0.00077775307],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99918956,0.00006167083,0.0001281589,0.00024046731,0.00020286007,0.00017729132],"domain_scores_gemma":[0.9996329,0.000045386936,0.000048164296,0.0002035378,0.000024299496,0.000045720073],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00011470885,0.00009084243,0.000086969965,0.0001324812,0.00078064186,0.00006940647,0.00028179376,0.000013273878,0.00007154246],"category_scores_gemma":[0.0000011921821,0.00009030787,0.000053657455,0.0004138377,0.000028228775,0.00022194994,0.000035363628,0.00018204247,0.0000071005807],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007965406,0.000433312,0.00017849654,0.000034366756,0.00013559315,0.000037595903,0.024080312,0.5556709,0.004035941,0.04871966,0.00058381865,0.3660103],"study_design_scores_gemma":[0.00077090756,0.0003366341,0.0016640673,0.000011127534,0.000014289102,0.0001745303,0.0018743963,0.9826265,0.0018859892,0.0013435661,0.009005267,0.000292711],"about_ca_topic_score_codex":0.000177815,"about_ca_topic_score_gemma":0.0000845942,"teacher_disagreement_score":0.8976979,"about_ca_system_score_codex":0.00010445214,"about_ca_system_score_gemma":0.000045424007,"threshold_uncertainty_score":0.6004145},"labels":[],"label_agreement":null},{"id":"W4294805275","doi":"10.5206/mt.v2i1.14448","title":"A Maple implementation of a modular algorithm for computing the common zeros of a polynomial and a regular chain","year":2022,"lang":"en","type":"article","venue":"Maple Transactions","topic":"Polynomial and algebraic computation","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"Western University","funders":"Mitacs","keywords":"Maple; Computer science; Polynomial; Modular design; Function (biology); Univariate; Algorithm; Prime (order theory); Set (abstract data type); Field (mathematics); Mathematics; Discrete mathematics; Theoretical computer science; Programming language; Pure mathematics; Combinatorics","score_opus":0.01102797299899906,"score_gpt":0.2515330799983794,"score_spread":0.24050510699938038,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4294805275","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.18682286,0.000051392504,0.8113854,0.001037553,0.00016875305,0.00039572036,0.00010620646,0.000028216664,0.000003915819],"genre_scores_gemma":[0.96793467,0.0000022701124,0.031841468,0.00006891967,0.000032694887,0.00007355631,0.000012259858,0.000006911331,0.000027235814],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990852,0.000093481285,0.000291712,0.00019024144,0.00018532742,0.00015407953],"domain_scores_gemma":[0.99943984,0.0001328259,0.00015258424,0.00020606234,0.000037518847,0.000031173033],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003346609,0.000084129664,0.00015979,0.00009573776,0.00041862068,0.000025250285,0.00028319831,0.000016337737,0.000016689575],"category_scores_gemma":[0.0000017562468,0.000078111545,0.00009400424,0.00029037468,0.0000496779,0.000106499574,0.000054581422,0.000086749336,1.4369267e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000021363312,0.0001480794,0.000077640456,0.0000385579,0.000076670854,8.192403e-7,0.008225306,0.008305101,0.008881638,0.002842523,0.0001919373,0.9711904],"study_design_scores_gemma":[0.001565681,0.0004273257,0.0038246203,0.000007947323,0.00004046793,0.000027613178,0.0018299231,0.97728163,0.010226179,0.0028560031,0.001763934,0.00014867225],"about_ca_topic_score_codex":0.0006181785,"about_ca_topic_score_gemma":0.00005502127,"teacher_disagreement_score":0.9710417,"about_ca_system_score_codex":0.00003232358,"about_ca_system_score_gemma":0.00006051434,"threshold_uncertainty_score":0.3219734},"labels":[],"label_agreement":null},{"id":"W4294805288","doi":"10.5206/mt.v2i1.14452","title":"Speeding up polynomial GCD, a crucial operation in Maple","year":2022,"lang":"en","type":"article","venue":"Maple Transactions","topic":"Polynomial and algebraic computation","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Maple; Subroutine; Greatest common divisor; Mathematics; Integer (computer science); Modular arithmetic; Polynomial; Modular design; Algorithm; Computer science; Cryptography; Programming language","score_opus":0.01638891451863867,"score_gpt":0.23197690855224196,"score_spread":0.2155879940336033,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4294805288","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11379497,0.00004377701,0.8781058,0.003767733,0.0026863765,0.00025967584,0.000023069431,0.00019694686,0.0011216624],"genre_scores_gemma":[0.99517024,0.0000030415529,0.0032836006,0.00024738323,0.00014814943,0.000080665246,0.000010274749,0.00000902596,0.0010476018],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988183,0.00008820436,0.00025477135,0.00032461685,0.0002566097,0.00025752405],"domain_scores_gemma":[0.99963355,0.000047738664,0.000043323605,0.00019427556,0.000016135433,0.00006497235],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00023568535,0.000109955356,0.00012760719,0.00025173507,0.0005490557,0.000134865,0.00042645895,0.000029016888,0.0005314564],"category_scores_gemma":[0.000004932063,0.00012987517,0.00007872806,0.0005701372,0.000017910246,0.0004891236,0.00005345215,0.0002620109,0.00004129217],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00021477048,0.0009357418,0.00054326974,0.000035127636,0.00007106021,0.000087359505,0.02408337,0.2904908,0.03247605,0.025811456,0.010444072,0.6148069],"study_design_scores_gemma":[0.0036185326,0.00036923293,0.008055134,0.000015500025,0.000022536933,0.00014593497,0.0009489491,0.8889897,0.006112252,0.0046135667,0.08626289,0.0008458103],"about_ca_topic_score_codex":0.0005397165,"about_ca_topic_score_gemma":0.0003497883,"teacher_disagreement_score":0.8813753,"about_ca_system_score_codex":0.00019108331,"about_ca_system_score_gemma":0.00013035534,"threshold_uncertainty_score":0.58190745},"labels":[],"label_agreement":null},{"id":"W4294805317","doi":"10.5206/mt.v2i1.14425","title":"Maple-based introductory visual guide to Gröbner bases","year":2022,"lang":"en","type":"article","venue":"Maple Transactions","topic":"Polynomial and algebraic computation","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Ideal (ethics); Interpretation (philosophy); Computer science; Algebra over a field; Symbolic computation; Algebraic number; Algebraic geometry; Mathematics; Pure mathematics; Programming language; Epistemology; Philosophy","score_opus":0.009558556594637117,"score_gpt":0.24997879332737905,"score_spread":0.24042023673274193,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4294805317","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011923452,0.000023161207,0.9753765,0.010439758,0.0012365662,0.00018436031,0.000028811488,0.0003126879,0.00047472437],"genre_scores_gemma":[0.9729372,5.925422e-7,0.020620411,0.0030252112,0.00017918047,0.00016542964,0.000015877,0.00001492983,0.0030411454],"study_design_codex":"simulation_or_modeling","study_design_gemma":"not_applicable","domain_scores_codex":[0.99865705,0.00011494515,0.0002223486,0.00040072712,0.00033406916,0.000270863],"domain_scores_gemma":[0.99933505,0.000104456216,0.000037485188,0.0003452489,0.0000408767,0.000136867],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00021695491,0.00012656428,0.00012406238,0.00023567803,0.0005812668,0.000081980106,0.0005154198,0.000017826243,0.0010256524],"category_scores_gemma":[0.000010686767,0.00013885574,0.00010273042,0.00068338047,0.00002171231,0.00019484185,0.000050495975,0.00017315481,0.000109745895],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009469235,0.0009886605,0.00009900505,0.000031052015,0.00007025538,0.000048351907,0.0018054451,0.4606386,0.01727497,0.008363456,0.085235916,0.42534956],"study_design_scores_gemma":[0.00073599676,0.0003695462,0.001502765,0.0000054524853,0.000019711262,0.000026666869,0.00012295652,0.22693866,0.0066927476,0.0007327444,0.7624181,0.00043468084],"about_ca_topic_score_codex":0.00021035953,"about_ca_topic_score_gemma":0.00006502632,"teacher_disagreement_score":0.9610138,"about_ca_system_score_codex":0.00014411216,"about_ca_system_score_gemma":0.00018330442,"threshold_uncertainty_score":0.9998875},"labels":[],"label_agreement":null},{"id":"W4296297618","doi":"10.1155/2022/7049980","title":"Computing Independent Variable Sets for Polynomial Ideals","year":2022,"lang":"en","type":"article","venue":"Journal of Mathematics","topic":"Polynomial and algebraic computation","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Science North","funders":"Fundamental Research Funds for the Central Universities","keywords":"Mathematics; Lexicographical order; Polynomial; Ideal (ethics); Gröbner basis; Variable (mathematics); Computation; Field (mathematics); Variables; Algorithm; Discrete mathematics; Combinatorics; Pure mathematics; Mathematical analysis","score_opus":0.023084739073348508,"score_gpt":0.2726818659702463,"score_spread":0.24959712689689778,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4296297618","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09560511,0.00007375803,0.90216774,0.0006195713,0.0010477968,0.00016255012,0.000004603982,0.000023417542,0.0002954416],"genre_scores_gemma":[0.61862636,0.000001205207,0.38076276,0.00026965764,0.00022732302,0.0000053966987,7.125484e-7,0.000009419945,0.00009720095],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99865234,0.000052611475,0.00059100083,0.00010235283,0.0004183309,0.00018336694],"domain_scores_gemma":[0.99854845,0.00039758015,0.00071508496,0.0001525398,0.00011289504,0.000073474715],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00145401,0.00008777358,0.00023805675,0.00013325246,0.00023449809,0.00010146696,0.00073483423,0.000021599873,0.000017319144],"category_scores_gemma":[0.00010180215,0.00007910789,0.00012239088,0.0001928304,0.000009150868,0.00020664721,0.0003411422,0.00018883518,0.0000021154015],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013753906,0.002875878,0.00025812874,0.0006278027,0.0005991886,0.00016587162,0.023186263,0.15874672,0.0075285183,0.3836737,0.08526008,0.33694032],"study_design_scores_gemma":[0.0024048388,0.0007637474,0.00031709316,0.000068571935,0.000055793244,0.00162096,0.000851708,0.77775323,0.001000701,0.20051661,0.014283133,0.00036358603],"about_ca_topic_score_codex":0.0000026462994,"about_ca_topic_score_gemma":2.2993919e-7,"teacher_disagreement_score":0.6190065,"about_ca_system_score_codex":0.000101686506,"about_ca_system_score_gemma":0.00017324128,"threshold_uncertainty_score":0.32259265},"labels":[],"label_agreement":null},{"id":"W4296916461","doi":"10.1016/j.jsc.2023.102234","title":"Computing roadmaps in unbounded smooth real algebraic sets I: Connectivity results","year":2023,"lang":"en","type":"article","venue":"Journal of Symbolic Computation","topic":"Polynomial and algebraic computation","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"European Commission; Natural Sciences and Engineering Research Council of Canada; Austrian Science Fund; Agence Nationale de la Recherche; European Office of Aerospace Research and Development; Air Force Office of Scientific Research","keywords":"Mathematics; Bounded function; Algebraic number; Real algebraic geometry; Intersection (aeronautics); Computation; Dimension (graph theory); Set (abstract data type); Connected component; Robotics; Polynomial; Algebra over a field; Discrete mathematics; Theoretical computer science; Algorithm; Pure mathematics; Robot; Computer science; Artificial intelligence","score_opus":0.023006470980969553,"score_gpt":0.28940882830363396,"score_spread":0.26640235732266443,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4296916461","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8619494,0.000034884728,0.13412243,0.0018984121,0.001090403,0.0001500069,0.0000026390132,0.00016352168,0.00058833015],"genre_scores_gemma":[0.9944229,0.00002728821,0.005116845,0.00011790004,0.00026688012,0.0000012329153,0.0000119214965,0.000013642644,0.000021382479],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9972694,0.00030085916,0.0010995633,0.00034762092,0.00058139424,0.0004011906],"domain_scores_gemma":[0.9977687,0.0007794526,0.00083234924,0.00020529801,0.00026067926,0.00015349805],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001921493,0.0002030043,0.00043669558,0.0009201147,0.00015191469,0.00022634302,0.00057363475,0.000091431306,0.0000015037336],"category_scores_gemma":[0.00026148357,0.00019705141,0.00014437335,0.0020010362,0.00004443534,0.000807366,0.00021969074,0.00035089714,0.000041469164],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00019612456,0.00031341892,0.0034062904,0.0000615791,0.000081407015,0.00041184106,0.012536875,0.191063,0.0017623135,0.015380235,0.003540027,0.7712469],"study_design_scores_gemma":[0.0021628148,0.00022140524,0.35685045,0.0001341981,0.000007792203,0.000114036775,0.00013373992,0.5979978,0.00019453501,0.04179373,0.00016286959,0.00022664116],"about_ca_topic_score_codex":0.00015677049,"about_ca_topic_score_gemma":0.000056400535,"teacher_disagreement_score":0.77102023,"about_ca_system_score_codex":0.00020935433,"about_ca_system_score_gemma":0.00031421948,"threshold_uncertainty_score":0.8035523},"labels":[],"label_agreement":null},{"id":"W4297880405","doi":"10.1007/s11786-022-00534-7","title":"Factoring Multivariate Polynomials Represented by Black Boxes: A Maple + C Implementation","year":2022,"lang":"en","type":"article","venue":"Mathematics in Computer Science","topic":"Polynomial and algebraic computation","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Maple; Toeplitz matrix; Mathematics; Polynomial; Polynomial matrix; Sylvester matrix; Difference polynomials; Multivariate statistics; Algorithm; Algebra over a field; Discrete mathematics; Combinatorics; Matrix polynomial; Pure mathematics; Orthogonal polynomials","score_opus":0.02432263382272556,"score_gpt":0.3023487761771989,"score_spread":0.27802614235447337,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4297880405","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2490513,0.000015302077,0.74913496,0.0005965087,0.00064651616,0.00030231389,0.000008092287,0.00012912757,0.00011588286],"genre_scores_gemma":[0.8490829,0.0000014478452,0.15053093,0.000236797,0.000055006847,0.000044374447,0.0000051178895,0.0000093893805,0.000034033244],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99723995,0.000098462086,0.0005638794,0.00071623543,0.0008525933,0.0005288626],"domain_scores_gemma":[0.9986737,0.00021703099,0.00025632745,0.0006780452,0.000057657326,0.000117249234],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015302941,0.0001844992,0.00023387991,0.0003776618,0.00049022876,0.0004353976,0.0021145763,0.000020599104,0.000041128875],"category_scores_gemma":[0.0000389746,0.00019042398,0.000057375753,0.0016377808,0.0001296873,0.00068582746,0.002334161,0.00015706928,0.000021948697],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000026995564,0.0019088488,0.0029344468,0.00022515158,0.00007019179,0.00011479354,0.1358316,0.09492802,0.14957741,0.14197324,0.008176812,0.4642325],"study_design_scores_gemma":[0.0005896429,0.000098034085,0.0011055175,0.000017610673,0.0000021651747,0.000019140614,0.00021368345,0.9735696,0.008208814,0.015325519,0.00057396427,0.0002763273],"about_ca_topic_score_codex":0.00020441342,"about_ca_topic_score_gemma":0.000009248287,"teacher_disagreement_score":0.87864155,"about_ca_system_score_codex":0.00035387362,"about_ca_system_score_gemma":0.00018301708,"threshold_uncertainty_score":0.77652645},"labels":[],"label_agreement":null},{"id":"W4300221964","doi":"10.1007/978-3-031-14788-3_11","title":"An Interpolation Algorithm for Computing Dixon Resultants","year":2022,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Polynomial and algebraic computation","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Monic polynomial; Subroutine; Maple; Algorithm; Interpolation (computer graphics); Polynomial interpolation; Mathematics; Univariate; Polynomial; Computer science; Algebra over a field; Multivariate statistics; Linear interpolation; Pure mathematics; Computer graphics (images)","score_opus":0.01695797807085452,"score_gpt":0.2659098690330344,"score_spread":0.24895189096217984,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4300221964","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000118445525,0.00013797682,0.994458,0.00038274506,0.003263709,0.00063813274,0.000025434145,0.0002748769,0.0007006838],"genre_scores_gemma":[0.10539196,0.00001008286,0.89233136,0.0010062333,0.001015726,0.000016352882,0.00006106228,0.00004531977,0.0001219045],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99605745,0.000059715825,0.0006573716,0.0017141316,0.00085218815,0.0006591681],"domain_scores_gemma":[0.9974847,0.0006596932,0.00042593773,0.0010170076,0.00022531585,0.00018735939],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0012332231,0.00048109758,0.00047936646,0.0008466803,0.00062182714,0.0006414477,0.0031002443,0.00019251651,0.000023509243],"category_scores_gemma":[0.0000694674,0.00048983184,0.00014676857,0.00062210177,0.00025174962,0.0010992477,0.0012390689,0.00064325647,0.000009599775],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000062831505,0.00002983397,0.00000497232,0.0000132479345,0.000006625886,0.000013787672,0.00076246826,0.02011297,0.00016420576,0.012893047,0.0000142165545,0.9659783],"study_design_scores_gemma":[0.000353825,0.00039526355,0.00009255774,0.000108629465,0.00000571504,0.000031824726,3.1187096e-7,0.8991295,0.00026906148,0.097460695,0.0016337987,0.0005188192],"about_ca_topic_score_codex":0.000039650586,"about_ca_topic_score_gemma":0.000029634464,"teacher_disagreement_score":0.9654595,"about_ca_system_score_codex":0.0004203246,"about_ca_system_score_gemma":0.0004828413,"threshold_uncertainty_score":0.9997553},"labels":[],"label_agreement":null},{"id":"W4300536553","doi":"10.1007/978-3-031-14788-3_3","title":"Subresultant Chains Using Bézout Matrices","year":2022,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Polynomial and algebraic computation","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"","keywords":"Speedup; Computation; Gaussian elimination; Fraction (chemistry); Yield (engineering); Gaussian; Multivariate statistics; Matrix (chemical analysis); Mathematics; Algorithm; Combinatorics; Computer science; Parallel computing; Computational chemistry; Chemistry; Physics; Statistics; Organic chemistry; Chromatography; Thermodynamics","score_opus":0.02086754038059347,"score_gpt":0.2482668397128955,"score_spread":0.22739929933230205,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4300536553","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0006159745,0.00085030013,0.9921567,0.0006332013,0.0024366807,0.0003306437,0.000008449382,0.00023065304,0.0027374094],"genre_scores_gemma":[0.3813571,0.00019469815,0.6115982,0.003501745,0.0020668174,0.000020991632,0.000022679927,0.000111634676,0.0011261321],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.995782,0.00005066294,0.00059390196,0.0015960088,0.0012457772,0.0007316479],"domain_scores_gemma":[0.99776584,0.00042187914,0.0003998416,0.0010835996,0.00014014912,0.00018870861],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0008608002,0.0005215601,0.00051102374,0.0011138981,0.0005677792,0.0006090562,0.003677381,0.00018176727,0.00007062654],"category_scores_gemma":[0.00006181327,0.0005005038,0.0001618987,0.001100024,0.0003722492,0.0008198206,0.002668751,0.00083571067,0.000029361949],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000086850905,0.000038566282,0.000024532066,0.000039365757,0.000015225635,0.00021982215,0.0011828264,0.15381487,0.0003143559,0.08217392,0.0000255067,0.7621423],"study_design_scores_gemma":[0.00024426763,0.00012707296,0.00005490551,0.0001374818,0.000008567602,0.00013077068,1.792404e-7,0.91250587,0.0003872833,0.081165716,0.0045608133,0.00067710294],"about_ca_topic_score_codex":0.00012118066,"about_ca_topic_score_gemma":0.000049976767,"teacher_disagreement_score":0.7614652,"about_ca_system_score_codex":0.0006366169,"about_ca_system_score_gemma":0.0009022221,"threshold_uncertainty_score":0.99974465},"labels":[],"label_agreement":null},{"id":"W4301343525","doi":"10.48550/arxiv.1001.5272","title":"An in-place truncated Fourier transform and applications to polynomial\\n multiplication","year":2010,"lang":"","type":"preprint","venue":"arXiv (Cornell University)","topic":"Polynomial and algebraic computation","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Fast Fourier transform; Multiplication (music); Split-radix FFT algorithm; Smoothing; Inverse; Polynomial; Arithmetic; Prime-factor FFT algorithm; Fourier transform; Mathematics; Rader's FFT algorithm; Discrete Fourier transform (general); Algorithm; Computer science; Discrete mathematics; Combinatorics; Mathematical analysis; Short-time Fourier transform; Fourier analysis; Statistics","score_opus":0.034703188597414086,"score_gpt":0.20490868065930057,"score_spread":0.17020549206188648,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4301343525","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.452778,0.000021683843,0.54428333,0.00063011725,0.0002801674,0.0014431124,0.000028497774,0.00012644862,0.0004086556],"genre_scores_gemma":[0.993085,0.00013208014,0.0056646,0.00022265315,0.00025487444,0.000029474391,0.000061537845,0.000034541736,0.0005152366],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.996037,0.00018864068,0.00056580716,0.0024020514,0.00014689978,0.0006596047],"domain_scores_gemma":[0.99682325,0.00018864832,0.00032634853,0.0016477302,0.00023611326,0.0007779103],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0005498425,0.0005928027,0.0005418683,0.0007793105,0.00042906916,0.0003388906,0.0019245862,0.00061576837,0.00003367887],"category_scores_gemma":[0.000025104144,0.0007558283,0.00015674683,0.0017019521,0.00021989433,0.001044997,0.00069446064,0.0010595905,0.00013502657],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00055620825,0.0013054808,0.0031138079,0.00019572006,0.0001190618,0.000066733424,0.005309509,0.32965448,0.00996153,0.07780141,0.000120669334,0.5717954],"study_design_scores_gemma":[0.0013990237,0.00017062311,0.011999986,0.000065223474,0.000069418056,0.000010499328,0.00012291565,0.9665208,0.0008927299,0.011978185,0.0058470443,0.00092359417],"about_ca_topic_score_codex":0.001012455,"about_ca_topic_score_gemma":0.0017012107,"teacher_disagreement_score":0.6368663,"about_ca_system_score_codex":0.00032758847,"about_ca_system_score_gemma":0.00047016193,"threshold_uncertainty_score":0.99948925},"labels":[],"label_agreement":null},{"id":"W4306681222","doi":"10.4153/s0008439522000625","title":"Nearly sharp Lang–Weil bounds for a hypersurface","year":2022,"lang":"en","type":"article","venue":"Canadian Mathematical Bulletin","topic":"Polynomial and algebraic computation","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Hypersurface; Mathematics; Finite field; Type (biology); Combinatorics; Plane (geometry); Field (mathematics); Pure mathematics; Discrete mathematics; Geometry","score_opus":0.013577257526559295,"score_gpt":0.2107957215749219,"score_spread":0.1972184640483626,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4306681222","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15875243,0.00044070228,0.6014126,0.17657638,0.001576532,0.0017847663,0.00024797773,0.00061598246,0.058592655],"genre_scores_gemma":[0.93810916,7.92629e-7,0.04034609,0.0067377985,0.0001824675,0.00029297604,0.000023972947,0.000031284788,0.0142754465],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99894106,0.000041567477,0.00017272739,0.00026855286,0.00018903935,0.00038705737],"domain_scores_gemma":[0.999115,0.00019793051,0.000039102157,0.0002735574,0.000031207142,0.00034323515],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.00031891104,0.00010385389,0.0001447415,0.00012098488,0.00040177724,0.00016829044,0.0006480262,0.000028732555,0.0026260351],"category_scores_gemma":[0.000108955974,0.0001071842,0.00007891798,0.0002462001,0.00002943481,0.00004524776,0.00013945306,0.00012430466,0.0015410577],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000007219124,0.000058526704,0.000008500379,0.000038090348,0.00001995221,0.00003857585,0.0011442354,0.00020545557,0.000086220934,0.7887814,0.19413,0.01548179],"study_design_scores_gemma":[0.0003282803,0.00010786349,0.000052630847,0.000007679004,0.000004635864,0.00004207801,0.00008115087,0.03951637,0.00003423235,0.076575644,0.8830357,0.00021370615],"about_ca_topic_score_codex":0.00079285353,"about_ca_topic_score_gemma":0.00017940908,"teacher_disagreement_score":0.7793568,"about_ca_system_score_codex":0.00018250827,"about_ca_system_score_gemma":0.0003118386,"threshold_uncertainty_score":0.99923635},"labels":[],"label_agreement":null},{"id":"W4308765265","doi":"10.1007/s002000050004","title":"Algorithms for Computing Sparse Shifts for Multivariate Polynomials","year":2000,"lang":"en","type":"article","venue":"Applicable Algebra in Engineering Communication and Computing","topic":"Polynomial and algebraic computation","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Bell (Canada)","funders":"National Science Foundation","keywords":"Multivariate statistics; Computer science; Mathematics; Algorithm; Combinatorics; Algebra over a field; Pure mathematics; Statistics","score_opus":0.018051059396640316,"score_gpt":0.2598347592051651,"score_spread":0.24178369980852477,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4308765265","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12098924,0.00044612747,0.87655956,0.0006174529,0.000101914055,0.0008415336,0.0000043341147,0.00030767717,0.00013217701],"genre_scores_gemma":[0.6943653,0.000027777101,0.30517182,0.00019630157,0.00009148698,0.00007543167,0.000021459593,0.000021821588,0.000028583652],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998345,0.000047107384,0.0005419304,0.00047918258,0.000110417706,0.00047634824],"domain_scores_gemma":[0.998056,0.0010688207,0.00012799965,0.0005838291,0.000054925367,0.00010842094],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00079334265,0.00024020884,0.00033449856,0.00014956592,0.0003120339,0.0002309872,0.00085244316,0.00009558942,0.0000036844403],"category_scores_gemma":[0.000053360476,0.0002724413,0.000081755075,0.00037447695,0.000030595358,0.00028654246,0.00028110127,0.00018124397,0.0000056301583],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000022149892,0.00010403872,0.00009443235,0.00010613598,0.000032030566,6.029155e-7,0.0012562752,0.110516176,0.0013855626,0.0662979,0.00011669011,0.820068],"study_design_scores_gemma":[0.0012240941,0.00004407128,0.0021258623,0.00009766488,0.0000065232275,0.0000060015877,0.000021969232,0.9864659,0.0006113211,0.004322784,0.0047585173,0.00031533654],"about_ca_topic_score_codex":0.00011363704,"about_ca_topic_score_gemma":0.0000047718104,"teacher_disagreement_score":0.8759497,"about_ca_system_score_codex":0.00005786735,"about_ca_system_score_gemma":0.000032104323,"threshold_uncertainty_score":0.99997276},"labels":[],"label_agreement":null},{"id":"W4312108645","doi":"10.48550/arxiv.2212.11243","title":"Color-Dressed Generalized Biadjoint Scalar Amplitudes: Local Planarity","year":2022,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Polynomial and algebraic computation","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Perimeter Institute","funders":"","keywords":"Planarity testing; Scalar (mathematics); Amplitude; Mathematics; Mathematical physics; Pure mathematics; Physics; Combinatorics; Geometry; Optics","score_opus":0.07016561429483614,"score_gpt":0.19794869412957117,"score_spread":0.12778307983473502,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4312108645","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2966636,0.00006140063,0.70054567,0.00028794914,0.0009352403,0.00029086435,0.000043859112,0.00037588362,0.00079550094],"genre_scores_gemma":[0.99644387,0.00006153421,0.0021568537,0.00038444842,0.00010882043,0.000004180044,0.000102858095,0.000018825573,0.0007186166],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9972659,0.00033961778,0.0003069207,0.0014161646,0.00019946304,0.00047197132],"domain_scores_gemma":[0.9979842,0.00018499304,0.00030497665,0.0011652259,0.00010287031,0.0002577614],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00035166438,0.00038470703,0.00047452582,0.00030986327,0.00037867125,0.00021129062,0.0024054009,0.00023216149,0.00019889804],"category_scores_gemma":[0.000033282995,0.00045749402,0.00031459593,0.00069569476,0.00015943589,0.00029362005,0.0045500756,0.00079102465,0.000079144986],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008500453,0.00022396883,0.00068670954,0.000067385976,0.00014529974,0.0006259732,0.0002914495,0.6426152,0.0000844461,0.3517112,0.0015906569,0.0018726655],"study_design_scores_gemma":[0.0009157898,0.00009169132,0.0030154965,0.00004529618,0.000053956825,0.000008476938,0.00006018294,0.8937844,0.00010227868,0.09684279,0.004431052,0.00064857455],"about_ca_topic_score_codex":0.00095491624,"about_ca_topic_score_gemma":0.00010564566,"teacher_disagreement_score":0.6997803,"about_ca_system_score_codex":0.00052949804,"about_ca_system_score_gemma":0.00044226524,"threshold_uncertainty_score":0.9997877},"labels":[],"label_agreement":null},{"id":"W4312122229","doi":"10.1090/mcom/3888","title":"Computing error bounds for asymptotic expansions of regular P-recursive sequences","year":2023,"lang":"en","type":"article","venue":"Mathematics of Computation","topic":"Polynomial and algebraic computation","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada; Agence Nationale de la Recherche","keywords":"Mathematics; Sequence (biology); Symbolic computation; Asymptotic expansion; Polynomial; Uniqueness; Computation; Asymptotic analysis; Gravitational singularity; Singularity; Applied mathematics; Algebra over a field; Algorithm; Pure mathematics; Mathematical analysis","score_opus":0.0347644148784825,"score_gpt":0.30408699170061,"score_spread":0.26932257682212746,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4312122229","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.33204436,0.00002028375,0.6669807,0.0002691269,0.00021848915,0.00025059358,0.0000055725177,0.00011383708,0.00009704737],"genre_scores_gemma":[0.75822896,0.0000016245986,0.24165633,0.000015133625,0.000030504601,0.000007940227,0.000019695552,0.000008961669,0.00003085897],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99861497,0.000041510837,0.0005886695,0.00022492162,0.0003224043,0.00020755033],"domain_scores_gemma":[0.99805534,0.0008689729,0.0005100995,0.00022062598,0.00029711207,0.00004785857],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00051564205,0.00012901169,0.00031226326,0.00026909073,0.00011527368,0.00004471628,0.0004176765,0.000051190527,0.0000012871794],"category_scores_gemma":[0.00017043452,0.0001248983,0.0001240199,0.0007350281,0.000079294194,0.0002299116,0.00013663848,0.00004730792,0.000009669713],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001554137,0.00034914457,0.00007621555,0.0014380316,0.00013635201,0.000004010262,0.02203233,0.24609998,0.014864342,0.6305961,0.0018616841,0.08252627],"study_design_scores_gemma":[0.00025771183,0.00011670714,0.00052755006,0.0001428626,0.00001308547,0.0000035936089,0.0002721921,0.6978017,0.005424482,0.29532713,0.000016053906,0.000096928794],"about_ca_topic_score_codex":0.000008412011,"about_ca_topic_score_gemma":0.0000016419102,"teacher_disagreement_score":0.45170173,"about_ca_system_score_codex":0.000024539473,"about_ca_system_score_gemma":0.00008980078,"threshold_uncertainty_score":0.5093205},"labels":[],"label_agreement":null},{"id":"W4312377476","doi":"10.1145/3572867.3572877","title":"Algorithms for multivariate laurent series","year":2022,"lang":"en","type":"article","venue":"ACM communications in computer algebra","topic":"Polynomial and algebraic computation","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"","keywords":"Mathematics; Series (stratigraphy); Set (abstract data type); Dimension (graph theory); Zero (linguistics); Multivariate statistics; Laurent series; Decomposition; Field (mathematics); Combinatorics; Discrete mathematics; Pure mathematics; Statistics; Computer science; Chemistry","score_opus":0.051850534137806666,"score_gpt":0.31124842502778605,"score_spread":0.2593978908899794,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4312377476","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.005210187,0.00042764496,0.9739702,0.018277986,0.0010029235,0.00062271196,0.000026107129,0.00032600085,0.00013625856],"genre_scores_gemma":[0.30189168,0.000027679162,0.69629776,0.0008979903,0.00009397849,0.00059971225,0.000083067964,0.000015755215,0.00009237404],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99826324,0.00031104207,0.00043774233,0.0004285829,0.00023086385,0.0003285475],"domain_scores_gemma":[0.9958918,0.00070648035,0.00014833493,0.003108892,0.00007756988,0.00006691476],"candidate_categories":["open_science"],"consensus_categories":[],"category_scores_codex":[0.0005801937,0.00017468454,0.00021823692,0.0002549125,0.0007596686,0.00016193108,0.006235104,0.00003493484,0.000015361034],"category_scores_gemma":[0.00005461187,0.00019607277,0.00010579678,0.00073418417,0.00007233761,0.0005292772,0.007641607,0.00032054234,0.00001302399],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000022598304,0.00064402143,0.00036918555,0.000016851061,0.000053373227,0.000005681422,0.0039568264,0.0069133327,0.00015101957,0.38765928,0.00557053,0.5946373],"study_design_scores_gemma":[0.000989106,0.00021682143,0.0037127594,0.000013293941,0.000006123818,0.000039045106,0.000050263174,0.784083,0.00008092845,0.14630885,0.0641634,0.000336382],"about_ca_topic_score_codex":0.00010191768,"about_ca_topic_score_gemma":0.000054377313,"teacher_disagreement_score":0.7771697,"about_ca_system_score_codex":0.0001599337,"about_ca_system_score_gemma":0.00011895575,"threshold_uncertainty_score":0.99914163},"labels":[],"label_agreement":null},{"id":"W4312719737","doi":"10.1145/3572867.3572883","title":"A new interpolation algorithm for computing dixon resultants","year":2022,"lang":"en","type":"article","venue":"ACM communications in computer algebra","topic":"Polynomial and algebraic computation","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Monic polynomial; Interpolation (computer graphics); Algorithm; Polynomial interpolation; Subroutine; Mathematics; Polynomial; Computer science; Bilinear interpolation; Algebra over a field; Spline interpolation; Pure mathematics; Artificial intelligence; Image (mathematics)","score_opus":0.03726532653356616,"score_gpt":0.30605302826103253,"score_spread":0.26878770172746635,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4312719737","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0028172357,0.00030337763,0.98940206,0.0054858592,0.00089801033,0.00059247273,0.000015825426,0.00031130368,0.00017385268],"genre_scores_gemma":[0.25451458,0.000011934655,0.74435145,0.00072648143,0.00015765904,0.000078589896,0.00008647682,0.000016939824,0.000055907683],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9977539,0.00035481082,0.0006509397,0.00054402044,0.00030346288,0.00039285334],"domain_scores_gemma":[0.9953933,0.0012788083,0.00026164428,0.0028630204,0.00009504004,0.00010821745],"candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":[],"category_scores_codex":[0.0007993148,0.00021150112,0.00026632877,0.00041038377,0.0007775471,0.00022776735,0.006181304,0.00004896021,0.000014615997],"category_scores_gemma":[0.00008278326,0.0002511674,0.00011801422,0.0012071328,0.00004486097,0.00051929656,0.007627946,0.00043104152,0.000014041302],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000006915441,0.00012895142,0.00014262083,0.000004018945,0.000018631948,0.0000017634344,0.0018728314,0.0012569706,0.000047900772,0.029275523,0.003712591,0.96353126],"study_design_scores_gemma":[0.0010344959,0.0001554521,0.0020017994,0.000024758267,0.0000053781164,0.000025766773,0.00004281573,0.93126583,0.000029005196,0.05381827,0.011327773,0.00026866794],"about_ca_topic_score_codex":0.00018252998,"about_ca_topic_score_gemma":0.000041865387,"teacher_disagreement_score":0.9632626,"about_ca_system_score_codex":0.00022547624,"about_ca_system_score_gemma":0.00022691285,"threshold_uncertainty_score":0.99999404},"labels":[],"label_agreement":null},{"id":"W4313913042","doi":"10.48550/arxiv.2301.02300","title":"Locality Galois groups of meromorphic germs in several variables","year":2023,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Polynomial and algebraic computation","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Institut Périmètre de physique théorique; National Natural Science Foundation of China","keywords":"Locality; Meromorphic function; Mathematics; Galois group; Pure mathematics; Group (periodic table); Algebra over a field; Physics","score_opus":0.07717855243134902,"score_gpt":0.18856556441981795,"score_spread":0.11138701198846893,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4313913042","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5179843,0.000012854546,0.48085803,0.00009643766,0.0005033093,0.00013765803,0.000013522702,0.00014148364,0.00025241048],"genre_scores_gemma":[0.9984862,0.000041577998,0.00090482394,0.000041480245,0.000049632145,7.968386e-7,0.000019079669,0.000011661584,0.00044470455],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99824405,0.00017641562,0.00030631502,0.00085744687,0.0001120399,0.00030375773],"domain_scores_gemma":[0.9986298,0.00017410121,0.000264431,0.0007439207,0.00008532769,0.000102422164],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00042542274,0.00023342836,0.00039643122,0.00034460815,0.000053748197,0.00004993114,0.001387102,0.00021978575,0.000014979509],"category_scores_gemma":[0.000034836838,0.00027202358,0.00015841554,0.00095216377,0.00010101748,0.00028561935,0.002005488,0.00041396805,0.000050317212],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003776288,0.00017389678,0.008520252,0.00020137774,0.00008330854,0.00038825214,0.0005339829,0.704243,0.00009816235,0.28449896,0.00026082224,0.0009602055],"study_design_scores_gemma":[0.00040192562,0.000028392147,0.023231316,0.000120907935,0.000018171508,0.0000022358172,0.000021569887,0.7127902,0.00012400092,0.2629455,0.000028965507,0.00028681842],"about_ca_topic_score_codex":0.002046587,"about_ca_topic_score_gemma":0.0002598214,"teacher_disagreement_score":0.48050195,"about_ca_system_score_codex":0.0001790767,"about_ca_system_score_gemma":0.00023972419,"threshold_uncertainty_score":0.9999732},"labels":[],"label_agreement":null},{"id":"W4318816522","doi":"10.1090/proc/16428","title":"On products of polynomials II","year":2023,"lang":"en","type":"article","venue":"Proceedings of the American Mathematical Society","topic":"Polynomial and algebraic computation","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Trinity College","funders":"","keywords":"Algorithm; Mathematics; Computer science","score_opus":0.014483479614989329,"score_gpt":0.24642842321468778,"score_spread":0.23194494359969844,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4318816522","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.99086225,0.000004495123,0.0013437307,0.00580476,0.000063488165,0.00018522235,0.0000018665422,0.00012548993,0.0016086687],"genre_scores_gemma":[0.98397356,0.0000048194443,0.015393162,0.00026691682,0.000043736993,0.000010206283,1.5876941e-7,0.000007966708,0.00029946343],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99890727,0.0000062675545,0.00029031004,0.00022343197,0.00036577004,0.00020698026],"domain_scores_gemma":[0.9990619,0.00017314823,0.0004186312,0.00017831905,0.00012454062,0.00004347713],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00041562633,0.00010551761,0.00028924568,0.000032124233,0.000109238135,0.000022223583,0.0008643082,0.00002006339,0.0000029153498],"category_scores_gemma":[0.00037146252,0.00006802608,0.00019763947,0.0013761432,0.00029617976,0.00012048051,0.00059926324,0.000090372014,0.000018210498],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000019522597,0.0003502007,0.00021585781,0.0004573988,0.000097305994,1.3027534e-7,0.0068430314,0.000042848893,0.15345968,0.77786905,0.043933295,0.016711669],"study_design_scores_gemma":[0.00035883242,0.0005449975,0.009042299,0.00023594851,0.000030185925,0.0000059809845,0.0005660242,0.038548484,0.26068357,0.689362,0.0003122012,0.00030950527],"about_ca_topic_score_codex":0.000005843679,"about_ca_topic_score_gemma":1.9698598e-8,"teacher_disagreement_score":0.10722387,"about_ca_system_score_codex":0.000021765381,"about_ca_system_score_gemma":0.00003584855,"threshold_uncertainty_score":0.27740228},"labels":[],"label_agreement":null},{"id":"W4327989651","doi":"10.48550/arxiv.2303.09603","title":"Rigorous Analytic Combinatorics in Several Variables in SageMath","year":2023,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Polynomial and algebraic computation","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada; National Science Foundation","keywords":"Computation; Variety (cybernetics); Field (mathematics); Algebra over a field; Symbolic computation; Algebraic combinatorics; Algebraic number; Multivariate statistics; Extremal combinatorics; Computer science; Mathematics; Discrete mathematics; Algorithm; Pure mathematics; Artificial intelligence; Machine learning","score_opus":0.06707829405289947,"score_gpt":0.1893835361705361,"score_spread":0.12230524211763663,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4327989651","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.64550865,0.000027983348,0.3516957,0.00015784688,0.0010283161,0.00025012757,0.000005894763,0.00027034254,0.0010551715],"genre_scores_gemma":[0.9979371,0.000055605324,0.0004953768,0.00004623822,0.000031427724,0.0000010325979,0.000011989802,0.000013170013,0.0014080714],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99819183,0.00015022152,0.00026482885,0.0009180195,0.00009737187,0.00037772686],"domain_scores_gemma":[0.9988693,0.00018641356,0.00016028411,0.0006428803,0.000045536624,0.00009555753],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00039359496,0.00024365974,0.00036450426,0.00071128755,0.00005389543,0.00011098078,0.0013511801,0.00021056394,0.0000056638687],"category_scores_gemma":[0.00004293126,0.00029824517,0.00010794455,0.0017610795,0.00003918388,0.00032275118,0.0018153833,0.0005558156,0.000083791245],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000102489685,0.000121152705,0.010857947,0.000068309,0.000023513394,0.0011089349,0.00033944083,0.68411535,0.0000022402726,0.3029201,0.0001347514,0.0002980304],"study_design_scores_gemma":[0.00041141157,0.000015531214,0.023053432,0.000089884175,0.000008167514,0.000001663047,0.000018444658,0.6336733,0.0000036309107,0.34247565,0.000024466803,0.00022439996],"about_ca_topic_score_codex":0.0015387109,"about_ca_topic_score_gemma":0.0005565559,"teacher_disagreement_score":0.35242847,"about_ca_system_score_codex":0.00045304303,"about_ca_system_score_gemma":0.00025977383,"threshold_uncertainty_score":0.99994695},"labels":[],"label_agreement":null},{"id":"W4330338565","doi":"10.48550/arxiv.2303.10586","title":"Graded Differential Categories and Graded Differential Linear Logic","year":2023,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Polynomial and algebraic computation","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"Japan Society for the Promotion of Science; University of Ottawa; Aix-Marseille Université","keywords":"Linear logic; Mathematics; Mathematical proof; Sequent calculus; Substructural logic; Discrete mathematics; Differential calculus; Differential (mechanical device); Algebra over a field; Pure mathematics; Calculus (dental); Many-valued logic; Computer science; Description logic; Theoretical computer science","score_opus":0.08924973261820703,"score_gpt":0.19872678997356968,"score_spread":0.10947705735536266,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4330338565","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6142493,0.000022417611,0.38328943,0.00020861819,0.0015213835,0.00019270885,0.00001077863,0.00046120142,0.00004414256],"genre_scores_gemma":[0.9975973,0.00012391037,0.00030028838,0.000042087908,0.00030084248,0.000001737451,0.000065036154,0.000023323328,0.0015454943],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99776435,0.00014857038,0.00025561074,0.0012589904,0.00013562797,0.0004368587],"domain_scores_gemma":[0.9986362,0.00013428283,0.00023399823,0.0006947675,0.00008095175,0.00021980179],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00008174157,0.00042028853,0.0004498044,0.00032288337,0.00026601562,0.00025302198,0.0012560468,0.00029737025,0.000019861433],"category_scores_gemma":[0.00002726236,0.00043445043,0.00021269152,0.00045872142,0.00018868354,0.00027372534,0.003130139,0.0005664004,0.00007557998],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012539011,0.00033924397,0.0028207733,0.00033658935,0.00043361099,0.0007685909,0.0015549695,0.01938617,0.00090595655,0.96935457,0.0006574135,0.003316699],"study_design_scores_gemma":[0.0009853174,0.00009706973,0.017956087,0.00006204245,0.00011597774,0.000007847662,0.00005022415,0.5090861,0.00048103553,0.4703462,0.000058391634,0.0007536979],"about_ca_topic_score_codex":0.00032306413,"about_ca_topic_score_gemma":0.000067338566,"teacher_disagreement_score":0.4990084,"about_ca_system_score_codex":0.00008794505,"about_ca_system_score_gemma":0.000120151984,"threshold_uncertainty_score":0.99981076},"labels":[],"label_agreement":null},{"id":"W4360992368","doi":"10.1007/978-3-031-13017-5_4","title":"The Fundamental Theorem of Algebra","year":2023,"lang":"en","type":"book-chapter","venue":"Undergraduate texts in mathematics","topic":"Polynomial and algebraic computation","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Fredericton","funders":"","keywords":"Field (mathematics); Mathematics; Property (philosophy); Root (linguistics); Polynomial; Pure mathematics; Algebra over a field; Discrete mathematics; Mathematical analysis; Philosophy","score_opus":0.022327194409540667,"score_gpt":0.24495760320101864,"score_spread":0.22263040879147797,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4360992368","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0003320823,0.0006768834,0.09049675,0.0052143363,0.0020998127,0.0011963828,0.000031206728,0.0006089199,0.8993436],"genre_scores_gemma":[0.046934944,0.0008791128,0.017481996,0.00013103182,0.00019424384,0.000026766642,0.000021386002,0.00014974696,0.9341808],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99809015,0.000029195206,0.0007286267,0.00033283682,0.00052429264,0.00029490172],"domain_scores_gemma":[0.99760395,0.0010320854,0.00049885095,0.00075547193,0.000053934196,0.000055692322],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005663649,0.00030628627,0.00039983887,0.0002018971,0.00012535839,0.00013508237,0.0012639598,0.00014494002,0.000009260678],"category_scores_gemma":[0.000058568992,0.00021988303,0.00017344065,0.00013975363,0.00020868322,0.0001092214,0.00056124077,0.00031286763,0.00025063704],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000017691223,0.00002563162,0.0000011012376,0.00007610363,0.00003972461,0.000011707145,0.00040768605,0.000031077052,0.000008135645,0.97536206,0.0011293758,0.022905631],"study_design_scores_gemma":[0.00017041939,0.00004274449,0.000011835764,0.0003114538,0.000012786965,0.000013325015,0.000023023069,0.013812891,0.000043813678,0.98170686,0.0036253633,0.0002255062],"about_ca_topic_score_codex":0.000004840636,"about_ca_topic_score_gemma":0.000048696467,"teacher_disagreement_score":0.07301476,"about_ca_system_score_codex":0.000087434186,"about_ca_system_score_gemma":0.00011404619,"threshold_uncertainty_score":0.896657},"labels":[],"label_agreement":null},{"id":"W4361200815","doi":"10.1090/mcom/3849","title":"Sparse trace tests","year":2023,"lang":"en","type":"article","venue":"Mathematics of Computation","topic":"Polynomial and algebraic computation","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"National Science Foundation","keywords":"Mathematics; TRACE (psycholinguistics); Extension (predicate logic); Algebraic number; Set (abstract data type); Sparse approximation; Polynomial; Applied mathematics; Algebra over a field; Algorithm; Pure mathematics; Mathematical analysis; Computer science","score_opus":0.03140312312006853,"score_gpt":0.27760300026785845,"score_spread":0.2461998771477899,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4361200815","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.28870928,0.000014098282,0.70935124,0.00041052102,0.00017185917,0.000105009356,9.98137e-7,0.00030114967,0.000935838],"genre_scores_gemma":[0.88641375,0.0000025097731,0.113394484,0.000021928721,0.000029262343,0.0000051762026,0.000005354889,0.0000069996704,0.00012051876],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991186,0.000022889624,0.0002995852,0.00015464304,0.00025901693,0.00014524015],"domain_scores_gemma":[0.9992285,0.00029123566,0.0001678743,0.00018772538,0.00008207666,0.000042638712],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002789998,0.00008672266,0.00014909636,0.00018200783,0.00004971644,0.000051440584,0.00031394453,0.00003075212,0.0000031493153],"category_scores_gemma":[0.000068963906,0.00008348974,0.000051839637,0.00071632117,0.000022999753,0.00024110726,0.000108478904,0.000044772936,0.00020382061],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000005699845,0.00042701713,0.00015759734,0.00044898808,0.00005248404,0.000021742286,0.010946529,0.09376786,0.0102317585,0.4627515,0.0073685716,0.41382024],"study_design_scores_gemma":[0.00016703382,0.000038081285,0.0031331966,0.000032319764,0.00000356386,0.0000057651437,0.000034210723,0.78458977,0.0019780386,0.20983317,0.00009836522,0.00008646444],"about_ca_topic_score_codex":0.0000036367387,"about_ca_topic_score_gemma":0.0000011442133,"teacher_disagreement_score":0.69082195,"about_ca_system_score_codex":0.000013111269,"about_ca_system_score_gemma":0.00003522254,"threshold_uncertainty_score":0.34046125},"labels":[],"label_agreement":null},{"id":"W4366816394","doi":"10.1080/0025570x.2023.2199721","title":"A Novel Proof of the Desnanot-Jacobi Determinant Identity","year":2023,"lang":"en","type":"article","venue":"Mathematics Magazine","topic":"Polynomial and algebraic computation","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Brock University","funders":"","keywords":"Symbolic computation; Identity (music); Maple; Mathematics; Computation; Algebra over a field; Mathematics education; Calculus (dental); Pure mathematics; Algorithm; Philosophy","score_opus":0.024719364595001084,"score_gpt":0.25884692902463624,"score_spread":0.23412756442963517,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4366816394","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.21998619,0.000011317235,0.7776877,0.000617477,0.00035898853,0.00023868581,0.000004134762,0.000119493,0.0009760136],"genre_scores_gemma":[0.95077014,0.000001828026,0.047052227,0.00007990586,0.000047485795,0.000019830975,0.0000012231184,0.000011658706,0.0020156761],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99907297,0.000015544061,0.0002818801,0.00015673235,0.00029519427,0.00017769527],"domain_scores_gemma":[0.9991657,0.000105575185,0.00017021276,0.00046749113,0.000057325284,0.00003365403],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00033189883,0.00009319512,0.00015015918,0.0000753929,0.00007419356,0.00006062384,0.00084407063,0.00002778824,0.0000062136482],"category_scores_gemma":[0.00007804415,0.00006139804,0.00008376017,0.0008283186,0.000044672834,0.0002459929,0.0005968502,0.00005988717,0.0001088566],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008045213,0.0011926458,0.00041260006,0.0013566012,0.000113186376,0.000028859225,0.010943231,0.0012784805,0.3584553,0.48730808,0.008152467,0.13075048],"study_design_scores_gemma":[0.0005048054,0.00006176968,0.011940728,0.00018772586,0.000024776667,0.0000541974,0.000026516967,0.72454196,0.05205567,0.20979801,0.0005667187,0.00023711557],"about_ca_topic_score_codex":0.0000035247635,"about_ca_topic_score_gemma":0.000016851029,"teacher_disagreement_score":0.730784,"about_ca_system_score_codex":0.00001642122,"about_ca_system_score_gemma":0.0000492714,"threshold_uncertainty_score":0.25037393},"labels":[],"label_agreement":null},{"id":"W4367842011","doi":"10.1090/tran/8971","title":"Corrigendum to “Approximating rational points on toric varieties”","year":2023,"lang":"en","type":"preprint","venue":"Transactions of the American Mathematical Society","topic":"Polynomial and algebraic computation","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada; University of Waterloo","keywords":"Mathematics; Pure mathematics; Mathematical economics; Computer science","score_opus":0.039075578563501544,"score_gpt":0.27629362785965184,"score_spread":0.23721804929615029,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4367842011","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009457577,0.0000031248053,0.9807951,0.007657093,0.0011295425,0.00044179196,0.00003227257,0.0002300385,0.00025345854],"genre_scores_gemma":[0.58833134,0.000008123452,0.40789673,0.0013723131,0.00015516893,0.00018796028,0.000006271532,0.000045056408,0.0019970385],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9980146,0.00010122202,0.0005351522,0.0004495881,0.00062624534,0.0002731404],"domain_scores_gemma":[0.9981938,0.0003380662,0.00042523706,0.0008327172,0.00009625002,0.000113932765],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00042136898,0.0002426996,0.00045562338,0.000056419136,0.0002544422,0.000098540506,0.0013232856,0.0000779623,0.000028655633],"category_scores_gemma":[0.00008952381,0.00018374404,0.00061154267,0.0007813604,0.00018715774,0.0000756293,0.0003076026,0.00052241626,0.00010217424],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00011342253,0.003045198,0.000079794285,0.0022324494,0.0019312933,0.000004385249,0.05176805,0.20353398,0.0030033488,0.5086646,0.04702797,0.17859551],"study_design_scores_gemma":[0.00017885133,0.00018430171,0.0013374225,0.0002664521,0.00007103281,0.0000051531924,0.00034399366,0.533226,0.0012871639,0.4624779,0.00017078346,0.00045092092],"about_ca_topic_score_codex":0.000084893065,"about_ca_topic_score_gemma":0.0000020474195,"teacher_disagreement_score":0.57887375,"about_ca_system_score_codex":0.00015272289,"about_ca_system_score_gemma":0.00018560616,"threshold_uncertainty_score":0.7492864},"labels":[],"label_agreement":null},{"id":"W4371780216","doi":"10.4310/cntp.2023.v17.n2.a4","title":"Completing the $c_2$ completion conjecture for $p=2$","year":2023,"lang":"en","type":"article","venue":"Communications in Number Theory and Physics","topic":"Polynomial and algebraic computation","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Completion (oil and gas wells); Conjecture; Mathematics; Combinatorics; Engineering","score_opus":0.04698802234699838,"score_gpt":0.32221177855704647,"score_spread":0.2752237562100481,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4371780216","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03370121,0.00016909475,0.9479466,0.012282332,0.0002470588,0.0006358148,0.00007752138,0.00032941773,0.004610945],"genre_scores_gemma":[0.98538244,0.000040217947,0.013664924,0.00048494895,0.000069802925,0.000117240226,0.00012374287,0.0000070965793,0.00010961697],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99921846,0.00031137298,0.00014127218,0.00013552226,0.00005903705,0.00013435325],"domain_scores_gemma":[0.99510217,0.0040415353,0.000061084786,0.00074175827,0.000033401222,0.00002007066],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007677461,0.00007421804,0.00009427741,0.000018282764,0.00046411977,0.00008518785,0.0008977981,0.000024653822,0.0000066012203],"category_scores_gemma":[0.00009264237,0.000059143556,0.000037054255,0.0004543134,0.00015139203,0.00013541876,0.0004978558,0.00013370316,0.000032192638],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000038492244,0.000018932556,0.00020262654,0.000006786904,0.0000051743623,7.362624e-8,0.0013423789,0.00014225401,0.000026798456,0.9404354,0.001350817,0.056464896],"study_design_scores_gemma":[0.00019827811,0.000010703161,0.0034700085,0.000023312936,0.000003355695,0.000003056611,0.00013264024,0.10723223,0.000018722572,0.8442685,0.044553656,0.0000855302],"about_ca_topic_score_codex":0.00000772038,"about_ca_topic_score_gemma":0.000011045246,"teacher_disagreement_score":0.9516812,"about_ca_system_score_codex":0.000012036234,"about_ca_system_score_gemma":0.000018398825,"threshold_uncertainty_score":0.3569681},"labels":[],"label_agreement":null},{"id":"W4378191775","doi":"10.1109/synasc57785.2022.00014","title":"Homotopy Techniques for Analytic Combinatorics in Several Variables","year":2022,"lang":"en","type":"article","venue":"","topic":"Polynomial and algebraic computation","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"National Science Foundation","keywords":"Homotopy; Dimension (graph theory); Heuristic; Mathematics; Homotopy analysis method; Selection (genetic algorithm); Continuation; Algebra over a field; Computer science; Mathematical optimization; Combinatorics; Pure mathematics; Artificial intelligence","score_opus":0.011312552777045402,"score_gpt":0.23818580159945024,"score_spread":0.22687324882240484,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4378191775","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0109840045,0.000017722294,0.98445636,0.0010643393,0.00026623925,0.00025476457,0.0000025408863,0.00020254467,0.002751512],"genre_scores_gemma":[0.9534479,0.0000010028065,0.044925533,0.00045353576,0.000021559998,0.00011721559,0.00000410465,0.0000038092605,0.0010253376],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993812,0.000032966753,0.00013182391,0.00018646735,0.000117925105,0.0001496074],"domain_scores_gemma":[0.99968535,0.000087819375,0.000032634736,0.00014921835,0.000019089883,0.000025879652],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002777836,0.00005731799,0.00008922866,0.00012680904,0.000116537434,0.000049665614,0.0004183266,0.000013556956,0.000020883761],"category_scores_gemma":[0.000012356694,0.000057083245,0.000033886507,0.00046870485,0.0000066808416,0.00016557833,0.0002722209,0.00006938433,0.0000013255707],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000059428794,0.0001263254,0.00035246162,0.000007847067,0.000004916124,0.00000503002,0.00021071502,0.00096134754,0.00013427882,0.96909976,0.0038224324,0.02526892],"study_design_scores_gemma":[0.00032878443,0.00017051493,0.0007198177,0.0000024110527,0.0000017876393,0.00000795609,0.000020201644,0.57250804,0.001011973,0.4110796,0.014009517,0.00013944825],"about_ca_topic_score_codex":0.000080864535,"about_ca_topic_score_gemma":0.00000599566,"teacher_disagreement_score":0.9424639,"about_ca_system_score_codex":0.000092675815,"about_ca_system_score_gemma":0.00006512429,"threshold_uncertainty_score":0.23277871},"labels":[],"label_agreement":null},{"id":"W4380486389","doi":"10.1007/s00026-023-00654-2","title":"Asymptotics of Multivariate Sequences IV: Generating Functions with Poles on a Hyperplane Arrangement","year":2023,"lang":"en","type":"article","venue":"Annals of Combinatorics","topic":"Polynomial and algebraic computation","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada; National Science Foundation","keywords":"Mathematics; Hyperplane; Quotient; Multivariate statistics; Saddle point; Combinatorics; Function (biology); Analytic function; Saddle; Generating function; Discrete mathematics; Pure mathematics; Geometry; Mathematical optimization","score_opus":0.04950070409048338,"score_gpt":0.287967013732991,"score_spread":0.23846630964250762,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4380486389","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9293774,0.00008621042,0.06706725,0.0016535625,0.000555035,0.00014685905,0.000010863763,0.00014186444,0.00096097996],"genre_scores_gemma":[0.9980625,0.00002738683,0.0015875944,0.00012083407,0.000030650215,0.000005629709,0.0000070679953,0.000005940236,0.00015238978],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99902964,0.00004614401,0.00023669722,0.00018306362,0.00032218455,0.0001822763],"domain_scores_gemma":[0.99919766,0.00016138349,0.00018159144,0.00022713754,0.00017979702,0.000052457246],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00023357975,0.00010373122,0.00017084114,0.00015606763,0.000088042325,0.000028389146,0.00028702198,0.00003100432,0.0000016635324],"category_scores_gemma":[0.00003494471,0.0000844694,0.000044097098,0.0007493341,0.00003870317,0.00014143498,0.000081901926,0.000066155095,0.000011807934],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000051772124,0.00048046984,0.0016578673,0.00008439986,0.00015726528,0.000021911068,0.0015133766,0.055054765,0.0062120794,0.8853099,0.0027596864,0.046696555],"study_design_scores_gemma":[0.0022283515,0.005106613,0.031837568,0.00048262547,0.000048000657,0.000015058736,0.00038385796,0.72279114,0.08948329,0.14344496,0.0033064424,0.0008720871],"about_ca_topic_score_codex":0.00005337046,"about_ca_topic_score_gemma":0.000003867414,"teacher_disagreement_score":0.7418649,"about_ca_system_score_codex":0.000008544268,"about_ca_system_score_gemma":0.00006865538,"threshold_uncertainty_score":0.3444562},"labels":[],"label_agreement":null},{"id":"W4383221855","doi":"10.1145/3597066.3597119","title":"A New Black Box Factorization Algorithm - the Non-monic Case","year":2023,"lang":"en","type":"article","venue":"","topic":"Polynomial and algebraic computation","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Computer science; Subroutine; Algorithm; Monic polynomial; Factorization; Black box; Representation (politics); Maple; Polynomial; Mathematics; Artificial intelligence; Programming language","score_opus":0.014165136269830176,"score_gpt":0.24493117503582326,"score_spread":0.23076603876599308,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4383221855","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010635437,0.0000069186835,0.98462135,0.0027065664,0.0005234436,0.000116106996,9.1116704e-7,0.00033855322,0.0010506875],"genre_scores_gemma":[0.96225953,0.000008820971,0.02754715,0.0004831955,0.0003923946,0.0000062296303,0.0000075922235,0.000009055746,0.00928603],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993266,0.000023009121,0.000120313125,0.00019981054,0.00014669423,0.00018358981],"domain_scores_gemma":[0.9995108,0.00009465142,0.000035721336,0.0002607686,0.000024582616,0.00007343374],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000118873344,0.000078242556,0.00006210459,0.00006060434,0.00013560627,0.00017691671,0.00034508773,0.000027099519,0.00002702549],"category_scores_gemma":[0.000013147386,0.00005111146,0.000039218736,0.000801931,0.000014576643,0.00028173206,0.00018785713,0.000061328006,0.00066047936],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[6.08348e-7,0.000008908552,0.000022944592,0.0000024819483,0.000010006253,0.00016741213,0.0016975098,0.0007298345,0.00014312967,0.0117411,0.02808135,0.9573947],"study_design_scores_gemma":[0.00018833278,0.000034627115,0.0013906237,0.0000037112143,0.00000312317,0.0001087051,0.000067803114,0.9794264,0.0008275276,0.013192444,0.004642432,0.00011428766],"about_ca_topic_score_codex":0.00039761243,"about_ca_topic_score_gemma":0.00003229992,"teacher_disagreement_score":0.9786965,"about_ca_system_score_codex":0.000020504025,"about_ca_system_score_gemma":0.00009251312,"threshold_uncertainty_score":0.84893465},"labels":[],"label_agreement":null},{"id":"W4383604871","doi":"10.48550/arxiv.2307.02879","title":"Algorithms for computing norms and characteristic polynomials on general Drinfeld modules","year":2023,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Polynomial and algebraic computation","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Canarie","funders":"Agence Nationale de la Recherche","keywords":"Mathematics; Endomorphism; Endomorphism ring; Polynomial ring; Matrix norm; Polynomial; Computation; Rank (graph theory); Base (topology); Norm (philosophy); Algebra over a field; Simple (philosophy); Discrete mathematics; Pure mathematics; Combinatorics; Algorithm; Eigenvalues and eigenvectors","score_opus":0.09780367418924492,"score_gpt":0.21982838997477105,"score_spread":0.12202471578552614,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4383604871","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4710347,0.000010693792,0.5271658,0.0001694323,0.0010046655,0.0002767098,0.000036018235,0.00025187663,0.00005014866],"genre_scores_gemma":[0.99231195,0.000044415316,0.0057426877,0.00016341954,0.0004960212,0.0000022135598,0.000057444173,0.000026084157,0.001155756],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99808174,0.00006259896,0.00025340385,0.0011275223,0.000079652236,0.0003950934],"domain_scores_gemma":[0.9986306,0.00030025272,0.00026579277,0.00055230403,0.00008401412,0.00016706625],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00025346346,0.0003269015,0.00039591198,0.00028621635,0.0002511025,0.00023893079,0.00087425485,0.00019647901,0.000002262424],"category_scores_gemma":[0.000044338907,0.00035574014,0.00016925395,0.00024659417,0.00007050929,0.00020104933,0.0015284227,0.00029632833,0.000039436334],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00011412994,0.00024152068,0.002004965,0.00043866856,0.0003712368,0.00032681535,0.0009069754,0.43628368,0.00043617454,0.45172936,0.001354155,0.105792314],"study_design_scores_gemma":[0.00048154808,0.00010023928,0.0122733405,0.000095543306,0.000029118137,0.0000033664637,0.000009225845,0.9444351,0.00015071516,0.041778084,0.0002270599,0.00041661237],"about_ca_topic_score_codex":0.00014216894,"about_ca_topic_score_gemma":0.000013484281,"teacher_disagreement_score":0.5214231,"about_ca_system_score_codex":0.000117578114,"about_ca_system_score_gemma":0.0000900327,"threshold_uncertainty_score":0.99988943},"labels":[],"label_agreement":null},{"id":"W4385262785","doi":"10.22331/q-2023-07-26-1069","title":"Limitations of the Macaulay matrix approach for using the HHL algorithm to solve multivariate polynomial systems","year":2023,"lang":"en","type":"article","venue":"Quantum","topic":"Polynomial and algebraic computation","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada; Simons Institute for the Theory of Computing, University of California Berkeley; National Science Foundation; Government of Canada; Canadian Institute for Advanced Research; U.S. Department of Defense; Institute for Quantum Information and Matter, California Institute of Technology; Samsung","keywords":"Algorithm; Computer science; Maximum satisfiability problem; Polynomial; Boolean function; Mathematics","score_opus":0.10406646614989076,"score_gpt":0.30403377787493135,"score_spread":0.1999673117250406,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4385262785","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.033092942,0.00004295148,0.9633605,0.0011176628,0.0014771979,0.00073164364,0.000031201154,0.00009602432,0.00004989217],"genre_scores_gemma":[0.9009321,0.0000016296937,0.09824458,0.00011340912,0.0003406891,0.00009404899,0.00000820025,0.000016109067,0.00024924078],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989352,0.00006921668,0.00026967327,0.0002477343,0.00021580885,0.00026231827],"domain_scores_gemma":[0.9989307,0.00041531553,0.00013630437,0.00038435037,0.00008272256,0.000050589206],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00041373906,0.00010901451,0.00014555968,0.00009218022,0.0003203774,0.000120800985,0.0007674975,0.000042203883,2.9578882e-7],"category_scores_gemma":[0.00009522865,0.00006617883,0.00011825276,0.0007786836,0.000036838403,0.00012887914,0.0002726114,0.00007580621,0.000011112645],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000044117925,0.00021503447,0.000050376028,0.00014335243,0.00018972823,0.0000031930438,0.012682737,0.35415313,0.01979394,0.4908267,0.013812942,0.10808477],"study_design_scores_gemma":[0.000216572,0.00003334232,0.00056902715,0.000015742626,0.000012331955,0.0000048377256,0.00028943957,0.9957104,0.0005047128,0.0012290848,0.0013196677,0.00009486639],"about_ca_topic_score_codex":0.00022476832,"about_ca_topic_score_gemma":0.0000027732117,"teacher_disagreement_score":0.86783916,"about_ca_system_score_codex":0.000035513087,"about_ca_system_score_gemma":0.00011770046,"threshold_uncertainty_score":0.26986942},"labels":[],"label_agreement":null},{"id":"W4385413903","doi":"10.1007/978-981-99-2310-6","title":"Applied Linear Algebra, Probability and Statistics","year":2023,"lang":"en","type":"book","venue":"Indian statistical institute series","topic":"Polynomial and algebraic computation","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Manitoba","funders":"Indian Statistical Institute; McMaster University","keywords":"Statistics; Mathematics; Probability and statistics; Algebra over a field; Pure mathematics","score_opus":0.022513673714940608,"score_gpt":0.2473469236732189,"score_spread":0.22483324995827828,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4385413903","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0000514469,0.00005874797,0.9603757,0.0004374477,0.0015699296,0.000670286,0.0020167287,0.0006407365,0.034178928],"genre_scores_gemma":[0.00092965754,0.00012094856,0.76125664,0.0004963519,0.00086988346,0.00010434276,0.0019731247,0.000102104095,0.23414697],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.997456,0.000045693385,0.00060448586,0.00092503696,0.00046322096,0.0005055461],"domain_scores_gemma":[0.99832433,0.00044204103,0.00020520648,0.00056516676,0.0001114358,0.00035180917],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00024143417,0.0004753871,0.00059222704,0.00019222722,0.00029230752,0.0003568872,0.0006342917,0.0003147966,0.000033920856],"category_scores_gemma":[0.00023440016,0.00047094206,0.00004501647,0.00020978221,0.00095849385,0.00048731023,0.00063621666,0.0005551989,0.00055136526],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000014398705,0.000019221472,0.0000023363243,0.0002642968,0.00004432961,0.00026042663,0.00037135225,0.000020005862,0.0000020849438,0.8856904,0.018875217,0.094435945],"study_design_scores_gemma":[0.00024304986,0.00012797746,0.00038551688,0.00007702146,0.000030566873,0.000044306777,0.0000068318973,0.0013878365,0.00001441836,0.8986147,0.09849133,0.00057644316],"about_ca_topic_score_codex":0.000032767188,"about_ca_topic_score_gemma":0.00025632238,"teacher_disagreement_score":0.19996804,"about_ca_system_score_codex":0.0001574166,"about_ca_system_score_gemma":0.0011713593,"threshold_uncertainty_score":0.9997742},"labels":[],"label_agreement":null},{"id":"W4385986289","doi":"10.1007/s11128-023-04064-4","title":"Homomorphic polynomial public key encapsulation over two hidden rings for quantum-safe key encapsulation","year":2023,"lang":"en","type":"article","venue":"Quantum Information Processing","topic":"Polynomial and algebraic computation","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Quantropi (Canada)","funders":"","keywords":"Homomorphic encryption; Key encapsulation; Public-key cryptography; Computer science; Polynomial; Mathematics; Discrete mathematics; Encryption; Theoretical computer science; Key distribution; Computer security","score_opus":0.02727344498869097,"score_gpt":0.278034634753339,"score_spread":0.250761189764648,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4385986289","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3774514,0.000049324386,0.6167391,0.002333889,0.000999467,0.0005788624,0.0000152554485,0.001298907,0.0005338283],"genre_scores_gemma":[0.9925433,0.000008644395,0.0060953093,0.0005060801,0.00034687296,0.0001161785,0.00028572063,0.000027241987,0.0000706695],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99715334,0.00006530494,0.0010453854,0.00039934294,0.00068153354,0.0006550881],"domain_scores_gemma":[0.9980425,0.00017923089,0.0007714256,0.0003605538,0.0004672429,0.00017901088],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.001029518,0.00031485697,0.00029099986,0.000869791,0.0008405709,0.0015447458,0.0006897084,0.00015275556,0.00002115558],"category_scores_gemma":[0.00033415898,0.0003209205,0.00013621249,0.0017331726,0.000064690525,0.0119730495,0.00021922209,0.00020402251,0.0004069631],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008638325,0.000080286314,0.0007769753,0.00045811493,0.000040353505,0.0000028411312,0.013893451,0.005679794,0.0029448813,0.2962281,0.006599343,0.6732095],"study_design_scores_gemma":[0.0012878887,0.00008200099,0.008780633,0.00007884081,0.000011824881,0.0000134691,0.00015685316,0.952927,0.0006527174,0.02509281,0.010496897,0.00041908788],"about_ca_topic_score_codex":0.00006156291,"about_ca_topic_score_gemma":0.0000066800208,"teacher_disagreement_score":0.9472472,"about_ca_system_score_codex":0.00019090777,"about_ca_system_score_gemma":0.000432916,"threshold_uncertainty_score":0.9999243},"labels":[],"label_agreement":null},{"id":"W4386093749","doi":"10.1007/978-3-031-41724-5_13","title":"Solving Parametric Linear Systems Using Sparse Rational Function Interpolation","year":2023,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Polynomial and algebraic computation","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Maple; Kronecker delta; Rational function; Interpolation (computer graphics); Gaussian elimination; Computer science; Rank (graph theory); Algorithm; Parametric statistics; Function (biology); Integer (computer science); Matrix (chemical analysis); Applied mathematics; Gaussian; Algebra over a field; Mathematics; Discrete mathematics; Combinatorics; Pure mathematics; Artificial intelligence","score_opus":0.03922910040964225,"score_gpt":0.25706807340348864,"score_spread":0.21783897299384639,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4386093749","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00037550644,0.00027233458,0.99141026,0.00016805143,0.006662806,0.0004711096,0.0000032933804,0.0003182179,0.00031844116],"genre_scores_gemma":[0.6368324,0.000032596705,0.35928628,0.0005331098,0.0025474718,0.000015092321,0.000038628597,0.00007605913,0.00063836825],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9967095,0.00004500947,0.000579573,0.0012092981,0.00096211367,0.0004944911],"domain_scores_gemma":[0.99801224,0.0005418527,0.0003990009,0.00065069424,0.00026189914,0.0001343324],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0009381187,0.00039704744,0.0004000319,0.001363323,0.00038186935,0.00074711465,0.0012878171,0.00026693114,0.000011823283],"category_scores_gemma":[0.00012602062,0.00040199258,0.00012120912,0.001215588,0.00022427893,0.0009103922,0.0008000304,0.000562221,0.00015566584],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000006684235,0.000014118565,0.000043629192,0.000038145365,0.000014564463,0.000023852708,0.00031861794,0.72191983,0.0002452747,0.015570838,0.000023198349,0.26178125],"study_design_scores_gemma":[0.00015575245,0.00008706297,0.00020203502,0.00034345666,0.000009673661,0.000038355618,2.630065e-7,0.9340855,0.000039300994,0.064438164,0.000207256,0.00039317246],"about_ca_topic_score_codex":0.000102212914,"about_ca_topic_score_gemma":0.000050715586,"teacher_disagreement_score":0.6364569,"about_ca_system_score_codex":0.00033204848,"about_ca_system_score_gemma":0.00055127766,"threshold_uncertainty_score":0.9998432},"labels":[],"label_agreement":null},{"id":"W4386093787","doi":"10.1007/978-3-031-41724-5_20","title":"Efficient Quotients of Non-commutative Polynomials","year":2023,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Polynomial and algebraic computation","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Quotient; Mathematics; Polynomial; Commutative property; Variable (mathematics); Polynomial ring; Algebra over a field; Discrete mathematics; Pure mathematics; Mathematical analysis","score_opus":0.01665563499840427,"score_gpt":0.25544604547043165,"score_spread":0.23879041047202737,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4386093787","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0022509017,0.000098073564,0.99142754,0.0003759401,0.0029235973,0.0004601546,0.0000138531295,0.00017013586,0.0022797883],"genre_scores_gemma":[0.85864073,0.000015199329,0.13973492,0.0004891975,0.00038884455,0.000012446636,0.00000906188,0.000056120076,0.00065345684],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9960343,0.000045376662,0.00081657997,0.0013106838,0.0011337048,0.0006593084],"domain_scores_gemma":[0.9970181,0.00082630257,0.0005603339,0.00113792,0.00027561642,0.00018174479],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0009674685,0.0005158813,0.00074557343,0.0012796697,0.00019806526,0.00021371318,0.0032611142,0.00024698934,0.000009514631],"category_scores_gemma":[0.000117045834,0.0004761697,0.00020809195,0.0010991709,0.00071869505,0.00020744829,0.0020208072,0.0005609448,0.00012831266],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000011232204,0.00006421836,0.000027819018,0.00006609576,0.000025786954,0.00005436899,0.002588124,0.36286172,0.0005810997,0.012721062,0.000037039354,0.6209614],"study_design_scores_gemma":[0.00040746795,0.0002326222,0.000703578,0.0005410504,0.000009049938,0.0000157183,3.9304905e-7,0.91372055,0.00410941,0.079615414,0.00007228989,0.00057245203],"about_ca_topic_score_codex":0.00007097293,"about_ca_topic_score_gemma":0.000035205427,"teacher_disagreement_score":0.8563898,"about_ca_system_score_codex":0.00026845885,"about_ca_system_score_gemma":0.00067069277,"threshold_uncertainty_score":0.999769},"labels":[],"label_agreement":null},{"id":"W4386106337","doi":"10.1007/978-3-031-41724-5_1","title":"Computing GCDs of Multivariate Polynomials over Algebraic Number Fields Presented with Multiple Extensions","year":2023,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Polynomial and algebraic computation","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Monic polynomial; Euclidean algorithm; Mathematics; Algebraic number; Combinatorics; Separable space; Order (exchange); Discrete mathematics; Algebra over a field; Polynomial; Pure mathematics","score_opus":0.018340927989460153,"score_gpt":0.26145603365378994,"score_spread":0.24311510566432978,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4386106337","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0067833876,0.000060022317,0.9891236,0.0006960238,0.001699467,0.0005543757,0.000011518547,0.000328296,0.00074333115],"genre_scores_gemma":[0.8360821,0.000011711556,0.16213214,0.00065195264,0.00043020985,0.000006864245,0.000012955133,0.000061512714,0.000610524],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9955489,0.00007405428,0.0008689761,0.0016035242,0.0010992368,0.00080527726],"domain_scores_gemma":[0.99569005,0.0018519751,0.00061299914,0.0012782863,0.00034037657,0.00022629557],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0007412988,0.00063554285,0.0008533725,0.0007173687,0.0002987092,0.00029729755,0.00236858,0.00036350585,0.000019932271],"category_scores_gemma":[0.00022875614,0.00053376507,0.00019850965,0.0011088233,0.000626199,0.00053966045,0.001959934,0.0007894569,0.000051035],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009350044,0.0002062564,0.0015543855,0.00022054881,0.00016518103,0.00034905196,0.0033493359,0.2829904,0.0019342108,0.04078043,0.0002722747,0.66808444],"study_design_scores_gemma":[0.00095989427,0.00019570791,0.0050445287,0.00090854056,0.000019822108,0.000066291184,4.2989942e-7,0.9483403,0.0020837684,0.041330047,0.000259748,0.0007909052],"about_ca_topic_score_codex":0.0003293309,"about_ca_topic_score_gemma":0.0003029251,"teacher_disagreement_score":0.82929873,"about_ca_system_score_codex":0.00014610695,"about_ca_system_score_gemma":0.00059174,"threshold_uncertainty_score":0.9997114},"labels":[],"label_agreement":null},{"id":"W4386107019","doi":"10.1007/978-3-031-41724-5_4","title":"A Modular Algorithm for Computing the Intersection of a One-Dimensional Quasi-Component and a Hypersurface","year":2023,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Polynomial and algebraic computation","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"","keywords":"Solver; Polynomial; Modular design; Computer science; Hypersurface; Component (thermodynamics); Intersection (aeronautics); Speedup; Computation; Dimension (graph theory); Algorithm; Theoretical computer science; Parallel computing; Mathematics; Combinatorics; Pure mathematics","score_opus":0.021373869070245927,"score_gpt":0.24182094808107402,"score_spread":0.22044707901082808,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4386107019","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0031821325,0.00019157106,0.99345005,0.0008369302,0.0015877596,0.00057538174,0.000008792292,0.00011679282,0.00005057488],"genre_scores_gemma":[0.37313586,0.000010159883,0.625863,0.00045601404,0.00038051096,0.0000109986695,0.0000074408586,0.00003495831,0.00010106816],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99740255,0.000040040934,0.0005025377,0.0009969742,0.000650118,0.0004078011],"domain_scores_gemma":[0.99773455,0.0010828485,0.0003284658,0.00054681586,0.00021659855,0.00009073568],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0010669561,0.00033682951,0.00045418597,0.00036449844,0.000305499,0.00021234216,0.0012252907,0.00015362204,0.0000011032394],"category_scores_gemma":[0.000060775343,0.0002703667,0.00013933193,0.00043647317,0.0005030817,0.00024116949,0.0011469343,0.0003900453,0.000004781194],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000069547027,0.00003123064,0.0000028411398,0.000038292976,0.000023905093,0.000005278553,0.00097625586,0.0423143,0.00065237895,0.011148053,0.000005704255,0.94479483],"study_design_scores_gemma":[0.0003033431,0.00023610603,0.00020176802,0.00032972023,0.000010619955,0.000034797846,6.928079e-7,0.8932541,0.00066351343,0.10464189,0.00006166393,0.00026176497],"about_ca_topic_score_codex":0.0000732023,"about_ca_topic_score_gemma":0.000036613455,"teacher_disagreement_score":0.94453305,"about_ca_system_score_codex":0.00016002858,"about_ca_system_score_gemma":0.0002617869,"threshold_uncertainty_score":0.99997485},"labels":[],"label_agreement":null},{"id":"W4386225332","doi":"10.5206/mt.v3i2.16000","title":"Laurent Series and Puiseux Series in Maple","year":2023,"lang":"en","type":"article","venue":"Maple Transactions","topic":"Polynomial and algebraic computation","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"Maple Leaf Foods; Western University","funders":"","keywords":"Laurent series; Formal power series; Mathematics; Series (stratigraphy); Field (mathematics); Context (archaeology); Laurent polynomial; Power series; Algebra over a field; Pure mathematics; Mathematical analysis","score_opus":0.013566850848274694,"score_gpt":0.22293498172125953,"score_spread":0.20936813087298484,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4386225332","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2888478,0.00018393986,0.67727476,0.02965249,0.0012872561,0.00033384387,0.00003321563,0.0011481462,0.0012385609],"genre_scores_gemma":[0.99293387,0.00008812001,0.0033218754,0.00007792117,0.00003562609,0.00004159852,0.000007214931,0.0000070581177,0.0034866887],"study_design_codex":"design_other","study_design_gemma":"observational","domain_scores_codex":[0.99933815,0.00002616278,0.00013261466,0.00020815541,0.00010269523,0.00019222671],"domain_scores_gemma":[0.99972445,0.000034616718,0.000018006296,0.0001539839,0.000013933261,0.000055025383],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0000924547,0.000083291176,0.00009467803,0.00015220392,0.00014190057,0.00009748659,0.00015768608,0.000030716936,0.000036173253],"category_scores_gemma":[0.0000040669165,0.00008344836,0.000030209836,0.00059407536,0.000037553516,0.00057462574,0.00002189589,0.00008423177,0.00006131145],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00015388503,0.00045475952,0.004647751,0.00032446504,0.00012376203,0.0002381569,0.027795032,0.022559453,0.009418452,0.19780965,0.009242083,0.7272326],"study_design_scores_gemma":[0.0030329463,0.0007528093,0.3639813,0.00015274262,0.000042637126,0.00026345396,0.0022900547,0.17367408,0.016894076,0.18588069,0.25132057,0.001714634],"about_ca_topic_score_codex":0.0001305695,"about_ca_topic_score_gemma":0.0011797467,"teacher_disagreement_score":0.7255179,"about_ca_system_score_codex":0.000017546401,"about_ca_system_score_gemma":0.000030372721,"threshold_uncertainty_score":0.34029254},"labels":[],"label_agreement":null},{"id":"W4386245710","doi":"10.2140/jsag.2023.13.33","title":"Finding points on varieties with Macaulay2","year":2023,"lang":"en","type":"article","venue":"Journal of Software for Algebra and Geometry","topic":"Polynomial and algebraic computation","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University; University of Manitoba","funders":"Simons Foundation; National Science Foundation","keywords":"Variety (cybernetics); Dimension (graph theory); Mathematics; Point (geometry); Matrix (chemical analysis); Finite field; Field (mathematics); Pure mathematics; Combinatorics; Computer science; Algebra over a field; Geometry; Statistics","score_opus":0.01583543898819133,"score_gpt":0.24723023361223123,"score_spread":0.2313947946240399,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4386245710","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.597717,0.00008693197,0.40047306,0.0011847578,0.00037683945,0.00006902511,0.0000037290188,0.00006992618,0.000018772142],"genre_scores_gemma":[0.97359484,0.000028475466,0.025511196,0.00040434726,0.00022153869,0.0000032117855,0.000002685961,0.000011944183,0.00022177793],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991166,0.000016680826,0.00023278112,0.00015201316,0.0002718671,0.00021005851],"domain_scores_gemma":[0.99898666,0.0004594965,0.00020190339,0.00010943914,0.00013719442,0.00010530423],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00038067973,0.00011014282,0.0001920123,0.00047990942,0.00014913316,0.00013764742,0.00027131697,0.00004516598,0.000004819289],"category_scores_gemma":[0.00018930911,0.00007882787,0.000067812005,0.00079407095,0.00003121585,0.00037567687,0.00007740607,0.00013599134,0.00001022065],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005545975,0.00022608908,0.024412118,0.00033228935,0.0004243914,0.0002922467,0.0028483423,0.0018563268,0.0003003458,0.08582533,0.025769979,0.85715795],"study_design_scores_gemma":[0.007943041,0.009847581,0.3554392,0.0008864536,0.00014923386,0.0013350389,0.0005512405,0.01452629,0.005978132,0.58289874,0.019007426,0.001437611],"about_ca_topic_score_codex":0.0000013246901,"about_ca_topic_score_gemma":4.9963205e-7,"teacher_disagreement_score":0.85572034,"about_ca_system_score_codex":0.000019624504,"about_ca_system_score_gemma":0.00006568436,"threshold_uncertainty_score":0.3214507},"labels":[],"label_agreement":null},{"id":"W4386326626","doi":"10.1145/3617996","title":"A Cubic Algorithm for Computing the Hermite Normal Form of a Nonsingular Integer Matrix","year":2023,"lang":"en","type":"article","venue":"ACM Transactions on Algorithms","topic":"Polynomial and algebraic computation","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Mathematics; Invertible matrix; Integer (computer science); Combinatorics; Dimension (graph theory); Matrix multiplication; Matrix (chemical analysis); Multiplication (music); Hermite polynomials; Bounded function; Integer matrix; Freivalds' algorithm; Binary logarithm; Discrete mathematics; Algorithm; Symmetric matrix; Mathematical analysis; Pure mathematics; Computer science","score_opus":0.01897168193906021,"score_gpt":0.28207983003865267,"score_spread":0.2631081480995925,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4386326626","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0075026345,0.000035568297,0.98898846,0.0017683667,0.0009180532,0.00040518085,0.000032230502,0.00031262691,0.00003688316],"genre_scores_gemma":[0.48435694,0.000022846138,0.51409805,0.00036324395,0.00026559422,0.00008268629,0.000015385913,0.000038393886,0.0007568433],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99854404,0.00004883851,0.00037740014,0.00034596355,0.00029592687,0.00038785682],"domain_scores_gemma":[0.99825794,0.00078534684,0.0001282699,0.0006266471,0.00012646841,0.00007533571],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00046285108,0.00018375581,0.00022054576,0.00026247423,0.00042438554,0.0000983956,0.0009700337,0.000071828734,0.000008744961],"category_scores_gemma":[0.000035225195,0.00014321093,0.00024549803,0.001129551,0.00007612217,0.00030223528,0.00004952799,0.0002089224,0.000052887615],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000061204055,0.00006122353,0.0000015591862,0.00001389781,0.000046129986,0.0000036934807,0.0011850315,0.0026168178,0.0001723755,0.000564709,0.000119256314,0.99520916],"study_design_scores_gemma":[0.0006240787,0.00019111003,0.00034608875,0.000042799173,0.000024801097,0.000032294975,0.0001423155,0.9851027,0.0052294326,0.006712237,0.0013628626,0.00018927538],"about_ca_topic_score_codex":0.000058019403,"about_ca_topic_score_gemma":0.00000919994,"teacher_disagreement_score":0.9950199,"about_ca_system_score_codex":0.00004459544,"about_ca_system_score_gemma":0.00008894457,"threshold_uncertainty_score":0.5839972},"labels":[],"label_agreement":null},{"id":"W4386958456","doi":"10.1145/3625226","title":"Fast, Algebraic Multivariate Multipoint Evaluation in Small Characteristic and Applications","year":2023,"lang":"en","type":"article","venue":"Journal of the ACM","topic":"Polynomial and algebraic computation","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"National Science Foundation","keywords":"Polynomial; Univariate; Mathematics; Finite field; Algebraic number; Variable (mathematics); Factorization; Degree (music); Gröbner basis; Field (mathematics); Discrete mathematics; Factorization of polynomials; Symbolic computation; Time complexity; Combinatorics; Multivariate statistics; Algorithm; Pure mathematics; Matrix polynomial; Statistics","score_opus":0.03426032844672085,"score_gpt":0.27967895762957273,"score_spread":0.2454186291828519,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4386958456","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9401506,0.00006853742,0.051823672,0.007220339,0.00040389743,0.0002805107,0.0000010967046,0.000022379243,0.000028975921],"genre_scores_gemma":[0.994682,0.000012071979,0.004962781,0.0001336455,0.00015047524,0.00001454667,6.328056e-7,0.000003686704,0.000040155443],"study_design_codex":"design_other","study_design_gemma":"observational","domain_scores_codex":[0.99924093,0.00011013015,0.00027067453,0.00010355684,0.00016879723,0.00010589725],"domain_scores_gemma":[0.9990596,0.00018548996,0.00024345034,0.00038323583,0.00008744621,0.000040779716],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009015847,0.000058694804,0.000099988654,0.00013998128,0.00006589868,0.00006460393,0.00094801997,0.000022168286,0.0000020823202],"category_scores_gemma":[0.0005295429,0.000039860843,0.000044216205,0.00042425963,0.000017268674,0.00018481535,0.0005112759,0.00012592052,0.0000142401905],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000020520829,0.000101747515,0.0032954172,0.000024577,0.0000332954,0.000009211119,0.0025286237,0.0043946537,0.018370042,0.004570151,0.00041689334,0.96623486],"study_design_scores_gemma":[0.00070793746,0.000031660005,0.6488708,0.000052942516,0.000012860858,0.000045319084,0.00002867045,0.2504481,0.0004486758,0.09883337,0.00044354965,0.00007605987],"about_ca_topic_score_codex":0.000014775521,"about_ca_topic_score_gemma":0.000011501229,"teacher_disagreement_score":0.9661588,"about_ca_system_score_codex":0.00004391368,"about_ca_system_score_gemma":0.000072924035,"threshold_uncertainty_score":0.17616728},"labels":[],"label_agreement":null},{"id":"W4387298515","doi":"10.51286/albjm/1349935247","title":"TRACES OF ENTIRE FUNCTIONS ON ALGEBRAIC SUBVARIETIES","year":2012,"lang":"en","type":"article","venue":"Albanian Journal of Mathematics","topic":"Polynomial and algebraic computation","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Montréal; University of Ottawa","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Algebraic number; Mathematics; Algebra over a field; Pure mathematics; Mathematical analysis","score_opus":0.018569901743042606,"score_gpt":0.2330899211850506,"score_spread":0.214520019442008,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4387298515","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.67594475,0.00033999313,0.32070553,0.0006991276,0.00090647297,0.000056782606,0.0000015854671,0.000019699877,0.0013260469],"genre_scores_gemma":[0.9689132,0.000009401073,0.030614372,0.000054124906,0.00018945271,6.251756e-7,2.4389743e-7,0.000006453507,0.00021213859],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99893206,0.0000395088,0.00048437522,0.000059292895,0.00031665587,0.00016808053],"domain_scores_gemma":[0.9988203,0.00025702338,0.0005197309,0.0001869216,0.00011037466,0.000105661464],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00047798635,0.00009682913,0.00021626225,0.000144048,0.000058234018,0.000046975812,0.0003961011,0.000036027825,0.000033718912],"category_scores_gemma":[0.00009359396,0.00007407927,0.00012546631,0.00019383228,0.000040054645,0.0005639551,0.00004475857,0.0001270624,0.000034373283],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000036934907,0.0031932797,0.0037166344,0.0003889096,0.00042414677,0.000020970821,0.042933267,0.0005399532,0.0055599194,0.8113501,0.01295578,0.118880115],"study_design_scores_gemma":[0.0076945582,0.008619277,0.0963803,0.0032992607,0.00094445166,0.005386447,0.012930882,0.049871612,0.13666143,0.64179415,0.033312466,0.0031051945],"about_ca_topic_score_codex":0.0000011992655,"about_ca_topic_score_gemma":6.2524185e-7,"teacher_disagreement_score":0.29296842,"about_ca_system_score_codex":0.000018304134,"about_ca_system_score_gemma":0.000051490035,"threshold_uncertainty_score":0.3020865},"labels":[],"label_agreement":null},{"id":"W4387530586","doi":"10.1007/s11075-023-01668-w","title":"Max-convolution through numerics and tropical geometry","year":2023,"lang":"en","type":"article","venue":"Numerical Algorithms","topic":"Polynomial and algebraic computation","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"National Science Foundation","keywords":"Differentiable function; Mathematics; Convolution (computer science); Function (biology); Integer (computer science); Convergence (economics); Salient; Theory of computation; Algorithm; Applied mathematics; Mathematical analysis; Geometry; Computer science","score_opus":0.019586466382910547,"score_gpt":0.2573348117555992,"score_spread":0.23774834537268863,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4387530586","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.043241587,0.0001424824,0.95168597,0.0031849633,0.0006856284,0.00009514559,0.0000031075313,0.00061055104,0.00035055424],"genre_scores_gemma":[0.8658785,0.000107753105,0.1316286,0.001223244,0.00050204166,0.000028285962,0.000016852438,0.000021282332,0.0005934383],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99862504,0.0000516768,0.00021635338,0.00043629558,0.00029713247,0.00037348352],"domain_scores_gemma":[0.99940413,0.00013740413,0.000056190504,0.00023284336,0.00003592439,0.0001335335],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00008994005,0.00014532375,0.00019449233,0.00009662098,0.000157023,0.00011771871,0.00033740606,0.00007463474,0.00001581392],"category_scores_gemma":[0.000055828885,0.00012931804,0.00006140905,0.0013883612,0.000068454734,0.0004309553,0.00031154716,0.00016312451,0.00038125864],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000006782519,0.00007294776,0.0014913431,0.000014930479,0.000021948732,0.000048394864,0.00044823546,0.00016170942,0.0001790474,0.04084928,0.0033313162,0.9533741],"study_design_scores_gemma":[0.00051593536,0.0001936701,0.10746189,0.000010804413,0.000007848779,0.000058280355,0.000036569723,0.8169653,0.00028686202,0.045733187,0.028375128,0.00035455567],"about_ca_topic_score_codex":0.000054461612,"about_ca_topic_score_gemma":3.2350127e-7,"teacher_disagreement_score":0.9530195,"about_ca_system_score_codex":0.000037503658,"about_ca_system_score_gemma":0.00003742204,"threshold_uncertainty_score":0.52734363},"labels":[],"label_agreement":null},{"id":"W4388288343","doi":"10.5206/mt.v3i3.17002","title":"Solving multivariate polynomial systems using eigenvalues in Maple","year":2023,"lang":"en","type":"article","venue":"Maple Transactions","topic":"Polynomial and algebraic computation","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada; Ministerio de Ciencia e Innovación","keywords":"Univariate; Maple; Polynomial matrix; Eigenvalues and eigenvectors; Polynomial; Multivariate statistics; Mathematics; Matrix polynomial; Companion matrix; Algebra over a field; Matrix (chemical analysis); Applied mathematics; Pure mathematics; Mathematical analysis; Statistics","score_opus":0.039399108239962954,"score_gpt":0.27425690472248465,"score_spread":0.2348577964825217,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4388288343","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.18567877,0.000053368523,0.8116005,0.00035988333,0.0014804519,0.00019102628,0.000011129146,0.00044329138,0.00018157817],"genre_scores_gemma":[0.99382156,0.0000072309526,0.0055307243,0.000030473067,0.00011953012,0.000024641424,0.0000050530416,0.000013628654,0.00044718114],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987057,0.00008813874,0.00029636145,0.00033613085,0.00019146547,0.00038222712],"domain_scores_gemma":[0.9994613,0.00011534626,0.00005583476,0.0002602844,0.000026109215,0.00008114821],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00028031995,0.0001350574,0.00017134426,0.00037113766,0.0002609821,0.00018806534,0.00035012866,0.00006316019,0.0000191638],"category_scores_gemma":[0.000009487916,0.00014317024,0.00007974865,0.0010304556,0.000023520131,0.0004901162,0.000031240357,0.0001496187,0.00012594469],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000029620314,0.00023017275,0.00057251926,0.00010939771,0.00008315526,0.000102397826,0.0087127425,0.86718106,0.051547885,0.0054467763,0.00085644826,0.0651278],"study_design_scores_gemma":[0.00041355117,0.000017706809,0.0045184046,0.00003515117,0.0000065865015,0.000013521581,0.00015267942,0.9922349,0.00083255925,0.00041526346,0.0011732074,0.00018650421],"about_ca_topic_score_codex":0.0027769632,"about_ca_topic_score_gemma":0.00017006931,"teacher_disagreement_score":0.8081428,"about_ca_system_score_codex":0.000109442444,"about_ca_system_score_gemma":0.000107854896,"threshold_uncertainty_score":0.58383125},"labels":[],"label_agreement":null},{"id":"W4388940312","doi":"10.46298/entics.12290","title":"Graded Differential Categories and Graded Differential Linear Logic","year":2023,"lang":"en","type":"article","venue":"Electronic Notes in Theoretical Informatics and Computer Science","topic":"Polynomial and algebraic computation","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"Japan Society for the Promotion of Science; University of Ottawa; Aix-Marseille Université","keywords":"Linear logic; Mathematics; Mathematical proof; Sequent calculus; Substructural logic; Discrete mathematics; Differential calculus; Differential (mechanical device); Algebra over a field; Pure mathematics; Sequent; Calculus (dental); Many-valued logic; Computer science; Description logic; Theoretical computer science","score_opus":0.009090863616609317,"score_gpt":0.23913401523491556,"score_spread":0.23004315161830624,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4388940312","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.48516425,0.000025165904,0.5139939,0.00036375687,0.00022458506,0.00009849744,5.049871e-7,0.000105196814,0.000024093599],"genre_scores_gemma":[0.9932429,0.000086553606,0.0063293055,0.00023130047,0.00008753415,0.000009145269,0.0000041333924,0.0000054834504,0.0000036520942],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99793345,0.00004936199,0.00043066495,0.00035036806,0.00041550014,0.0008206519],"domain_scores_gemma":[0.9990844,0.00030195471,0.000088016626,0.000296728,0.00004968375,0.00017920458],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00050904346,0.00021803316,0.000256124,0.00033474676,0.00030941312,0.00054935995,0.00083803234,0.00006737883,0.000005870085],"category_scores_gemma":[0.000058190133,0.00017135257,0.000040060513,0.00113702,0.0012264346,0.0006574581,0.0011327866,0.00030043075,0.000013807827],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000060990574,0.000023572104,0.00007168855,0.000018631263,0.000004521545,0.0000026778064,0.0014517368,0.00014013043,0.0002049565,0.94954956,0.0000039456386,0.04852246],"study_design_scores_gemma":[0.00029222894,0.00015707717,0.0017956411,0.000013417909,0.000002828075,0.00001913362,0.000011256446,0.62123895,0.0010533428,0.37525237,0.000008370313,0.00015542649],"about_ca_topic_score_codex":0.0000080272375,"about_ca_topic_score_gemma":0.000003168685,"teacher_disagreement_score":0.6210988,"about_ca_system_score_codex":0.000051480536,"about_ca_system_score_gemma":0.00014449665,"threshold_uncertainty_score":0.6987555},"labels":[],"label_agreement":null},{"id":"W4389152131","doi":"10.1088/1572-9494/ad1095","title":"Planar matrices and arrays of Feynman diagrams: poles for higher <i>k</i>","year":2023,"lang":"lv","type":"article","venue":"Communications in Theoretical Physics","topic":"Polynomial and algebraic computation","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Perimeter Institute; University of Waterloo","funders":"","keywords":"Feynman diagram; Planar; Physics; Mathematical physics; Mathematics; Computer science; Computer graphics (images)","score_opus":0.03686666026338758,"score_gpt":0.30191208492346927,"score_spread":0.2650454246600817,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4389152131","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.29554966,0.0097454265,0.60639906,0.06583023,0.0018972098,0.003174326,0.0006297428,0.0007683986,0.016005935],"genre_scores_gemma":[0.985432,0.00093834044,0.013177128,0.00015589254,0.000118787226,0.00005651569,0.000059557187,0.000017704679,0.000044031578],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.998562,0.00021820105,0.00044018336,0.0003020656,0.00016777727,0.00030981563],"domain_scores_gemma":[0.9960684,0.0022795566,0.00016687451,0.0013126106,0.00008923014,0.0000833214],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00047914684,0.00017821549,0.00030939194,0.00011602145,0.00020684378,0.00010275481,0.001611578,0.0000936252,0.0000037543762],"category_scores_gemma":[0.0000947472,0.00017576541,0.00009536602,0.0010317874,0.0013109319,0.00020378498,0.000807626,0.00021786155,0.000024885507],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000013237929,0.00016572088,0.0001727619,0.000079480975,0.000019384648,4.298996e-7,0.0011755299,0.00010468368,0.00013771714,0.94331807,0.00039401223,0.054418996],"study_design_scores_gemma":[0.00037496502,0.00009585648,0.0013633632,0.00013284775,0.000025547719,6.056769e-7,0.00010153405,0.14212671,0.00025499158,0.85449445,0.000854744,0.00017437695],"about_ca_topic_score_codex":0.000027122122,"about_ca_topic_score_gemma":0.000008953851,"teacher_disagreement_score":0.6898824,"about_ca_system_score_codex":0.000031221156,"about_ca_system_score_gemma":0.00006624872,"threshold_uncertainty_score":0.7167505},"labels":[],"label_agreement":null},{"id":"W4390961899","doi":"10.48550/arxiv.2401.07082","title":"Bernstein-Sato theory modulo $p^m$","year":2024,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Polynomial and algebraic computation","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada; National Science Foundation","keywords":"Modulo; Mathematics; Prime (order theory); Primitive root modulo n; Root of unity; Integer (computer science); Torsion (gastropod); Polynomial; Reduction (mathematics); Context (archaeology); Combinatorics; Zero (linguistics); Pure mathematics; Discrete mathematics; Mathematical analysis; Physics; Geometry; Quantum mechanics; Computer science","score_opus":0.04128401055991166,"score_gpt":0.1775376680015153,"score_spread":0.13625365744160364,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4390961899","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.33288872,0.00027686186,0.65345925,0.00030859522,0.0020906401,0.00021249887,0.0000145806935,0.00069485436,0.010053997],"genre_scores_gemma":[0.99159765,0.000044151395,0.0008331574,0.00015587527,0.00020347408,8.803478e-7,0.000009895679,0.00001965575,0.007135268],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99807996,0.00014643156,0.00018225725,0.0011697719,0.00009619538,0.00032536578],"domain_scores_gemma":[0.99853116,0.0001245247,0.00012572197,0.0009839133,0.00007168251,0.00016301387],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00028513954,0.0003080737,0.00026729857,0.00028457702,0.00010984109,0.00023059633,0.0017290044,0.00022321005,0.000018899333],"category_scores_gemma":[0.000017889228,0.00033277285,0.00026567277,0.0005300872,0.000081584294,0.00021661076,0.0045504253,0.00064892805,0.0005362504],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000011183461,0.00003611386,0.00004391696,0.000076740835,0.000084956286,0.00034062454,0.00030923897,0.050522532,0.000027195141,0.9358154,0.00060623366,0.01212587],"study_design_scores_gemma":[0.000118661475,0.000018895875,0.00014720543,0.00007672867,0.00003718161,0.0000046294494,0.000016711689,0.3732986,0.00011379706,0.6251752,0.00071265845,0.00027973985],"about_ca_topic_score_codex":0.000084982756,"about_ca_topic_score_gemma":0.000021084037,"teacher_disagreement_score":0.65870893,"about_ca_system_score_codex":0.00017036786,"about_ca_system_score_gemma":0.00024319574,"threshold_uncertainty_score":0.99991244},"labels":[],"label_agreement":null},{"id":"W4391183293","doi":"10.1090/mawrld/031","title":"Integer and Polynomial Algebra","year":2023,"lang":"en","type":"book","venue":"Mathematical world","topic":"Polynomial and algebraic computation","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Mathematics; Integer (computer science); Algebra over a field; Polynomial; Discrete mathematics; Pure mathematics; Computer science; Mathematical analysis; Programming language","score_opus":0.01780030997161364,"score_gpt":0.23980586335699267,"score_spread":0.22200555338537903,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4391183293","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00009214191,0.00022149556,0.18378818,0.0034084627,0.0011211885,0.0004592545,0.000012667412,0.0010848909,0.8098117],"genre_scores_gemma":[0.000682344,0.0000054898014,0.006316951,0.00041763744,0.00048467636,0.000020694668,0.000012144956,0.00004569638,0.99201435],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9983539,0.00003057709,0.00042027596,0.0005276507,0.00033544004,0.00033213737],"domain_scores_gemma":[0.9985485,0.0006206405,0.00013254634,0.0004790173,0.000031129668,0.00018814254],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0002537029,0.0003110303,0.0004703114,0.0003156777,0.00009127996,0.000286565,0.0006733262,0.00013962194,0.00015107576],"category_scores_gemma":[0.00007361635,0.0002654292,0.00013060443,0.00024606206,0.000112352725,0.00015995423,0.00079854816,0.0003882076,0.002770543],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000026293123,0.000023149007,6.214298e-7,0.0001420861,0.000036845864,0.000035797762,0.00019504299,0.0000012363432,0.0000051612346,0.714795,0.25309983,0.03166262],"study_design_scores_gemma":[0.00018367465,0.000032520435,0.000033026023,0.0003108241,0.000023252136,0.000022818846,0.0000020104562,0.012994035,0.000024701485,0.90892774,0.07705854,0.0003868442],"about_ca_topic_score_codex":0.0000016830658,"about_ca_topic_score_gemma":0.000010973662,"teacher_disagreement_score":0.19413276,"about_ca_system_score_codex":0.000083751576,"about_ca_system_score_gemma":0.00015705738,"threshold_uncertainty_score":0.9999798},"labels":[],"label_agreement":null},{"id":"W4391556953","doi":"10.1016/j.jsc.2025.102532","title":"Computing roadmaps in unbounded smooth real algebraic sets II: Algorithm and complexity","year":2025,"lang":"en","type":"article","venue":"Journal of Symbolic Computation","topic":"Polynomial and algebraic computation","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada; Fonds Wetenschappelijk Onderzoek; European Office of Aerospace Research and Development; Air Force Office of Scientific Research; Austrian Science Fund; Agence Nationale de la Recherche","keywords":"Algebraic number; Computer science; Algorithm; Algebra over a field; Mathematics; Pure mathematics","score_opus":0.018845130115064463,"score_gpt":0.2839940453018797,"score_spread":0.26514891518681527,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4391556953","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.493984,0.00018466127,0.5032598,0.0013952575,0.00057959865,0.000114627466,0.0000010260671,0.00004100532,0.00044000617],"genre_scores_gemma":[0.9230928,0.000035912883,0.076424405,0.00029642542,0.00011436604,9.4287986e-7,0.000004190689,0.0000069793723,0.000023992121],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9979838,0.00019003179,0.0008887832,0.00029868854,0.0003488671,0.0002898454],"domain_scores_gemma":[0.9987228,0.00026552568,0.0005138101,0.00015039032,0.00023103264,0.00011647682],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00081897445,0.00019847858,0.00044684418,0.0007059869,0.00024882174,0.00022289463,0.00044461022,0.00008198146,0.0000022124364],"category_scores_gemma":[0.00005426358,0.00019360967,0.00009354805,0.0009462939,0.0000954137,0.0006056196,0.00034608383,0.0003249865,0.000002083912],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000021384532,0.00017573105,0.0014208391,0.000036740035,0.000046177127,0.000037748076,0.00270925,0.0046771066,0.00019913218,0.03210442,0.00041555834,0.95815593],"study_design_scores_gemma":[0.0014870949,0.00016720161,0.21976961,0.00018966083,0.000013509723,0.00009750061,0.00009201594,0.635785,0.00009339832,0.14193544,0.00019255342,0.0001770097],"about_ca_topic_score_codex":0.0001788632,"about_ca_topic_score_gemma":0.000032149357,"teacher_disagreement_score":0.9579789,"about_ca_system_score_codex":0.00017468253,"about_ca_system_score_gemma":0.00029894762,"threshold_uncertainty_score":0.7895173},"labels":[],"label_agreement":null},{"id":"W4391661128","doi":"10.1090/conm/796/15995","title":"Improved methods for finding imaginary quadratic fields with high 𝑛-rank","year":2024,"lang":"en","type":"other","venue":"Contemporary mathematics - American Mathematical Society","topic":"Polynomial and algebraic computation","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Algorithm; Annotation; Rank (graph theory); Computer science; Artificial intelligence; Mathematics; Combinatorics","score_opus":0.029446100734195506,"score_gpt":0.32369191565202887,"score_spread":0.29424581491783336,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4391661128","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000012798068,0.0009317359,0.91562665,0.0015838039,0.00033102906,0.0014954109,0.000041625823,0.0011072166,0.07886971],"genre_scores_gemma":[0.001358973,0.000022701226,0.8877121,0.00052223145,0.00030661936,0.0004038525,0.00003174195,0.000519134,0.10912261],"study_design_codex":"not_applicable","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99702007,0.00012261263,0.00085486285,0.0010085903,0.0003844143,0.00060948275],"domain_scores_gemma":[0.9964096,0.0012514292,0.0008456968,0.0011495607,0.00008086721,0.00026283826],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0008625788,0.00078055466,0.0014920806,0.00016537483,0.000121909645,0.0004426619,0.0012335097,0.0002755354,0.00013987775],"category_scores_gemma":[0.00014416262,0.0005829215,0.0006298829,0.00067397836,0.00048549543,0.00023065721,0.00044242464,0.00052943575,0.0001557941],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000018250632,0.00059455825,9.1572514e-7,0.008581051,0.0013992427,0.000026760777,0.0058267703,0.0000040378995,0.00022689016,0.23910262,0.7184027,0.025816206],"study_design_scores_gemma":[0.00093074265,0.0007542285,8.9466545e-7,0.0022056953,0.00030177616,0.000062797204,0.00067081937,0.3693743,0.00020665377,0.58521795,0.038696617,0.0015775595],"about_ca_topic_score_codex":0.000059900034,"about_ca_topic_score_gemma":0.0000024585972,"teacher_disagreement_score":0.6797061,"about_ca_system_score_codex":0.00010019785,"about_ca_system_score_gemma":0.00033403933,"threshold_uncertainty_score":0.9996622},"labels":[],"label_agreement":null},{"id":"W4391740240","doi":"10.48550/arxiv.2402.07353","title":"Optimized Gröbner basis algorithms for maximal determinantal ideals and critical point computations","year":2024,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Polynomial and algebraic computation","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computation; Basis (linear algebra); Determinantal point process; Mathematics; Point (geometry); Algorithm; Critical point (mathematics); Algebra over a field; Pure mathematics; Physics; Mathematical analysis; Geometry; Random matrix","score_opus":0.061624988279743956,"score_gpt":0.23270135271022552,"score_spread":0.17107636443048158,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4391740240","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.073744714,0.00012712892,0.9230306,0.00095346884,0.001092328,0.0004056313,0.000091481474,0.0002740634,0.00028055356],"genre_scores_gemma":[0.90305394,0.000030721694,0.096299015,0.00013942973,0.00015254025,0.000005923116,0.000023531382,0.000021206282,0.00027367633],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99802125,0.0000932581,0.0002738107,0.001152217,0.00008609415,0.0003733639],"domain_scores_gemma":[0.99853396,0.00057594874,0.00010346269,0.0004118973,0.00015179344,0.00022290413],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00025485433,0.00031691857,0.00038926146,0.0002967576,0.00022748965,0.00037159902,0.0006746878,0.00020916204,0.0000119494],"category_scores_gemma":[0.00007206756,0.0003445746,0.00026212676,0.0003018191,0.00017147264,0.00029095096,0.0022546872,0.00037890897,0.000031380874],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012420549,0.00024015617,0.000072611285,0.0007170116,0.0002508853,0.0008243025,0.00090489106,0.13473323,0.000058023805,0.81887716,0.0014615848,0.041735914],"study_design_scores_gemma":[0.00046390304,0.00006438632,0.00018611601,0.00008803771,0.0000888347,0.000026252963,0.000032783228,0.708598,0.000064252046,0.2900316,0.00006081924,0.00029500033],"about_ca_topic_score_codex":0.000070143586,"about_ca_topic_score_gemma":0.0000068945787,"teacher_disagreement_score":0.8293092,"about_ca_system_score_codex":0.000119857505,"about_ca_system_score_gemma":0.00019797376,"threshold_uncertainty_score":0.99990064},"labels":[],"label_agreement":null},{"id":"W4392733100","doi":"10.1017/9781108874144.022","title":"Stratification and stratified Morse theory","year":2024,"lang":"en","type":"other","venue":"","topic":"Polynomial and algebraic computation","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Stratification (seeds); Morse code; Stratified sampling; Mathematics; Statistics; Computer science; Biology; Telecommunications","score_opus":0.012153521205201976,"score_gpt":0.24113893094695366,"score_spread":0.2289854097417517,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4392733100","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000006870043,0.00084733305,0.30239278,0.0004697401,0.00038826506,0.0001239054,0.0000035366456,0.0005681209,0.69519943],"genre_scores_gemma":[0.004835806,0.000026963577,0.009309476,0.00016549445,0.00019334412,0.000009584997,0.000010933709,0.000073477226,0.9853749],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99932295,0.000030615975,0.00010927592,0.0003465915,0.00009888587,0.0000916728],"domain_scores_gemma":[0.9996095,0.000024305096,0.000049687344,0.00026377267,0.0000069565162,0.000045795343],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00010884224,0.00012607465,0.000101675294,0.00012458902,0.000015348669,0.00023283956,0.00022442939,0.00009146121,0.0002181464],"category_scores_gemma":[0.0000048597535,0.00010007603,0.000024481522,0.00010947218,0.000029078126,0.00007424737,0.000079452795,0.00008739637,0.0006430137],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[3.3599736e-7,0.0000053669096,1.2039175e-7,0.00002617406,0.000012127823,0.0000024549092,0.00006164899,2.8971604e-7,0.000039310697,0.6768767,0.26881653,0.054158896],"study_design_scores_gemma":[0.00013082032,0.000044020802,0.000052500152,0.00013278976,0.000023408254,0.000013865522,0.000026318587,0.010785974,0.00017160292,0.6969065,0.29129106,0.00042113065],"about_ca_topic_score_codex":0.00004358337,"about_ca_topic_score_gemma":0.000040805255,"teacher_disagreement_score":0.2930833,"about_ca_system_score_codex":0.000006939583,"about_ca_system_score_gemma":0.00004005866,"threshold_uncertainty_score":0.82648546},"labels":[],"label_agreement":null},{"id":"W4392733177","doi":"10.1017/9781108874144.005","title":"Generating functions","year":2024,"lang":"en","type":"book-chapter","venue":"Cambridge University Press eBooks","topic":"Polynomial and algebraic computation","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science","score_opus":0.019386299653014086,"score_gpt":0.1909278615034941,"score_spread":0.17154156185048003,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4392733177","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000027632474,0.00022268567,0.09518496,0.00005765209,0.0010243078,0.00013513556,0.000049382244,0.00044315006,0.9028551],"genre_scores_gemma":[0.00047070958,0.0000149664,0.0010375892,0.00008066238,0.00033117962,4.4298142e-7,0.000021524726,0.000021127442,0.9980218],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99892545,0.000013021104,0.00014117573,0.0005369993,0.00018901225,0.00019436226],"domain_scores_gemma":[0.9992318,0.000043340904,0.00009472213,0.00043621112,0.000074491494,0.000119402444],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.000056223125,0.00024397449,0.00019749546,0.0001869418,0.00021429427,0.0001882791,0.0006266633,0.00016752449,0.0000022575655],"category_scores_gemma":[0.0000025142776,0.00027988566,0.00018149245,0.000014046637,0.00006310332,0.00015263195,0.00072998815,0.00035430197,0.00013416004],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000024353305,0.0000022310273,3.8804252e-8,0.000022363765,0.00005535913,0.0001548883,0.00002939666,0.000053195232,0.000047187703,0.94819134,0.03858602,0.01285553],"study_design_scores_gemma":[0.00011839132,0.000026668547,9.0211597e-7,0.000087692315,0.00006320289,0.000023586077,0.000003944585,0.021530978,0.00006718627,0.00020051996,0.9775687,0.00030824484],"about_ca_topic_score_codex":0.00004239844,"about_ca_topic_score_gemma":0.0000014150536,"teacher_disagreement_score":0.94799083,"about_ca_system_score_codex":0.0001373925,"about_ca_system_score_gemma":0.00011997129,"threshold_uncertainty_score":0.9999653},"labels":[],"label_agreement":null},{"id":"W4392733188","doi":"10.1017/9781108874144.013","title":"Effective computations and ACSV","year":2024,"lang":"en","type":"book-chapter","venue":"Cambridge University Press eBooks","topic":"Polynomial and algebraic computation","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computation; Computer science; Algorithm","score_opus":0.011597208982810294,"score_gpt":0.19466340835164808,"score_spread":0.18306619936883778,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4392733188","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00011201936,0.0003107666,0.058516536,0.00007626996,0.0004483316,0.00035913585,0.000058784048,0.0003378249,0.93978035],"genre_scores_gemma":[0.0052568107,0.000027460857,0.00076134346,0.000065637636,0.00011946732,9.379057e-7,0.00001498852,0.000019976002,0.9937334],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9989696,0.000022094635,0.00011772846,0.00055760733,0.00016127183,0.0001716998],"domain_scores_gemma":[0.99926144,0.00014762845,0.00008952923,0.00028972296,0.00007684429,0.00013482326],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00005981158,0.00025704288,0.0002446957,0.00021078979,0.00016671375,0.00017307821,0.0004486211,0.0001606332,5.2811316e-7],"category_scores_gemma":[0.000003264485,0.00028984717,0.00011323841,0.000015066283,0.00013520116,0.0001581565,0.0008368752,0.00032330342,0.000035759214],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000056393887,0.0000029821008,1.4284628e-7,0.00005843609,0.00007862643,0.00016001813,0.00009485317,0.000012121851,0.00001129877,0.9701809,0.005908821,0.023486117],"study_design_scores_gemma":[0.00039009994,0.00008862584,0.000053042062,0.00025135197,0.00013853585,0.000056262135,0.000007264372,0.016277993,0.00011855001,0.0027199795,0.97937894,0.00051934866],"about_ca_topic_score_codex":0.00004471239,"about_ca_topic_score_gemma":0.0000011790999,"teacher_disagreement_score":0.97347015,"about_ca_system_score_codex":0.00010813357,"about_ca_system_score_gemma":0.00006697394,"threshold_uncertainty_score":0.99995536},"labels":[],"label_agreement":null},{"id":"W4392744773","doi":"10.1090/proc/16826","title":"Sufficient conditions for a problem of Polya","year":2024,"lang":"lv","type":"article","venue":"Proceedings of the American Mathematical Society","topic":"Polynomial and algebraic computation","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"Science and Engineering Research Board","keywords":"Mathematics; Mathematical economics; Combinatorics","score_opus":0.014036179113911645,"score_gpt":0.26915530985625025,"score_spread":0.2551191307423386,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4392744773","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.85179347,0.0004335843,0.13020907,0.012843588,0.00032402048,0.0016053416,0.00015927231,0.00019202927,0.002439641],"genre_scores_gemma":[0.9391852,0.000018511555,0.05997697,0.00019860662,0.00011108682,0.00006326517,9.982753e-7,0.000021188042,0.00042414782],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9981588,0.000008879135,0.0006337892,0.00039079686,0.00044964114,0.0003580655],"domain_scores_gemma":[0.9984188,0.00049739017,0.0005415988,0.00015512979,0.00029153202,0.00009554352],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005585794,0.0002092972,0.0004944964,0.00004395926,0.00015695492,0.00016182644,0.00088718947,0.00005023292,0.000014286867],"category_scores_gemma":[0.000109551824,0.00014374933,0.0008277089,0.0011746791,0.0009824113,0.00020823632,0.00043583591,0.00018551931,0.00001075568],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001314303,0.00045044362,0.00005438621,0.003943722,0.00026026374,1.0264815e-7,0.012233311,0.000029203506,0.02941985,0.9319107,0.013732499,0.007952376],"study_design_scores_gemma":[0.0002690076,0.0005509715,0.0006213855,0.0015625042,0.0002609171,0.00001832224,0.0022640086,0.4703995,0.016232992,0.506495,0.0010034445,0.00032196866],"about_ca_topic_score_codex":0.000019131658,"about_ca_topic_score_gemma":1.321771e-7,"teacher_disagreement_score":0.4703703,"about_ca_system_score_codex":0.000075658136,"about_ca_system_score_gemma":0.00017403427,"threshold_uncertainty_score":0.5861927},"labels":[],"label_agreement":null},{"id":"W4394694416","doi":"10.1080/10236198.2024.2336480","title":"On two-term hypergeometric recursions with free lower parameters","year":2024,"lang":"en","type":"article","venue":"The Journal of Difference Equations and Applications","topic":"Polynomial and algebraic computation","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Mathematics; Term (time); Hypergeometric distribution; Hypergeometric function; Lauricella hypergeometric series; Pure mathematics; Basic hypergeometric series; Generalized hypergeometric function; Combinatorics; Hypergeometric function of a matrix argument","score_opus":0.018213397999389296,"score_gpt":0.2506218770775987,"score_spread":0.2324084790782094,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4394694416","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.19386303,0.00036294834,0.802141,0.0031629712,0.00010477576,0.00012905327,0.000004891054,0.000028531073,0.00020276105],"genre_scores_gemma":[0.9948399,0.00008917968,0.004718487,0.00012522405,0.00007430633,0.000021397183,0.0000011617115,0.0000049931537,0.00012531856],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992879,0.000045850873,0.00021293695,0.00012396846,0.00021725224,0.00011207007],"domain_scores_gemma":[0.9982872,0.0011226973,0.00010888447,0.00032018733,0.00008295502,0.00007810371],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002386349,0.00008962297,0.00009963304,0.00025108698,0.0002319064,0.00018438826,0.00054786814,0.000018156585,0.000006526529],"category_scores_gemma":[0.000049074202,0.0000491434,0.00004109371,0.00091253646,0.00006945962,0.00019238378,0.000068756606,0.00018542295,0.000013667727],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000013574391,0.00014116835,0.000038441092,0.000009154642,0.000051726078,0.000003009027,0.0005472463,0.0016049618,0.0006836186,0.63595426,0.00044288937,0.36050993],"study_design_scores_gemma":[0.001274444,0.0017115833,0.015971363,0.00047131284,0.00027822962,0.0003418291,0.00020261631,0.16328941,0.00068937876,0.8125863,0.0026316273,0.000551886],"about_ca_topic_score_codex":0.00000649415,"about_ca_topic_score_gemma":0.0000046692735,"teacher_disagreement_score":0.8009769,"about_ca_system_score_codex":0.000024652296,"about_ca_system_score_gemma":0.00008263154,"threshold_uncertainty_score":0.20040098},"labels":[],"label_agreement":null},{"id":"W4394815724","doi":"10.31857/s0044466923010155","title":"On the Structure of Solutions to the Key Gosper Equation in Problems of Symbolic Summation","year":2023,"lang":"en","type":"article","venue":"Журнал вычислительной математики и математической физики","topic":"Polynomial and algebraic computation","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Wilfrid Laurier University","funders":"","keywords":"Computer science","score_opus":0.03209112951881296,"score_gpt":0.23946023306246517,"score_spread":0.2073691035436522,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4394815724","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9044717,0.00015107283,0.070062205,0.02065765,0.0009043248,0.001855512,0.00007096356,0.00026709156,0.0015594735],"genre_scores_gemma":[0.99815655,0.000030215475,0.0008152574,0.00057260034,0.00012691638,0.000075510405,0.000037638474,0.000028059492,0.00015725878],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99633485,0.0004188491,0.0010206637,0.0005938419,0.0009831028,0.00064867997],"domain_scores_gemma":[0.99685276,0.0010678408,0.00047161654,0.0012234212,0.00027267434,0.00011166741],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012687993,0.00034134794,0.00043248877,0.0006729639,0.00032085553,0.00011800198,0.001726844,0.00020124427,0.00008785284],"category_scores_gemma":[0.00055399217,0.00022323892,0.00017345791,0.0039846953,0.00014513038,0.0004503522,0.0005072205,0.00049044285,0.00020042487],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000046698093,0.0002227628,0.0013235214,0.00012851242,0.00008286618,0.0000035191476,0.01701368,0.22117043,0.031740274,0.655282,0.0069351383,0.0660506],"study_design_scores_gemma":[0.001485368,0.00066929753,0.19280905,0.0007474706,0.00004934315,0.000013804212,0.0008156148,0.48175493,0.02649255,0.29132295,0.0028921391,0.00094749435],"about_ca_topic_score_codex":0.00040327222,"about_ca_topic_score_gemma":0.00099267,"teacher_disagreement_score":0.36395904,"about_ca_system_score_codex":0.00012771095,"about_ca_system_score_gemma":0.00024622606,"threshold_uncertainty_score":0.9103419},"labels":[],"label_agreement":null},{"id":"W4395695590","doi":"10.1007/s00200-024-00655-5","title":"Sparse polynomial interpolation: faster strategies over finite fields","year":2024,"lang":"en","type":"article","venue":"Applicable Algebra in Engineering Communication and Computing","topic":"Polynomial and algebraic computation","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Pacific Institute for the Mathematical Sciences; Simon Fraser University","funders":"","keywords":"Monomial; Interpolation (computer graphics); Focus (optics); Monomial basis; Polynomial; Mathematics; Finite field; Field (mathematics); Polynomial interpolation; Degree (music); Combinatorics; Polynomial basis; Basis (linear algebra); Discrete mathematics; Algebra over a field; Pure mathematics; Computer science; Mathematical analysis; Linear interpolation; Geometry; Physics","score_opus":0.009363980997397995,"score_gpt":0.23314801559123247,"score_spread":0.22378403459383447,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4395695590","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11862965,0.0014244668,0.87733066,0.00080472504,0.00022039122,0.0001408387,6.738227e-7,0.0003989274,0.0010496523],"genre_scores_gemma":[0.981097,0.000051323794,0.018532852,0.00016292547,0.000086659966,0.0000150878395,0.0000074077525,0.000012951281,0.00003382245],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990157,0.00003591452,0.00031012335,0.00030278656,0.00010761622,0.00022789584],"domain_scores_gemma":[0.99903697,0.00041966696,0.00004100315,0.00042684606,0.000016954957,0.000058542704],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002682189,0.0001580522,0.00015357132,0.00019813229,0.000089938556,0.0006330668,0.00051547703,0.000074537915,0.000009902515],"category_scores_gemma":[0.000013643914,0.00016670019,0.000040364277,0.0004554979,0.000025461324,0.0006212089,0.00048317196,0.0003147012,0.000015844103],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000104335095,0.000078369776,0.0006851933,0.00026918657,0.00006274531,0.000017228238,0.006027916,0.13509545,0.0020174964,0.5450457,0.0008585038,0.3098318],"study_design_scores_gemma":[0.00016684028,0.000017407932,0.0021568004,0.00015721093,0.0000029814773,0.000011116028,0.00005929099,0.9901908,0.00010965011,0.0033772958,0.0035650954,0.00018551952],"about_ca_topic_score_codex":0.00008720189,"about_ca_topic_score_gemma":0.000012469786,"teacher_disagreement_score":0.86246735,"about_ca_system_score_codex":0.000033706852,"about_ca_system_score_gemma":0.000040430623,"threshold_uncertainty_score":0.67978364},"labels":[],"label_agreement":null},{"id":"W4396218073","doi":"10.1016/j.jalgebra.2024.04.018","title":"Newton iteration for lexicographic Gröbner bases in two variables","year":2024,"lang":"en","type":"article","venue":"Journal of Algebra","topic":"Polynomial and algebraic computation","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Mathematics; Lexicographical order; Newton's method; Applied mathematics; Algebra over a field; Calculus (dental); Pure mathematics; Combinatorics; Nonlinear system","score_opus":0.014313333254385044,"score_gpt":0.283058965541225,"score_spread":0.26874563228683995,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4396218073","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.19884907,0.0011770283,0.79279137,0.0050657266,0.0017774969,0.0001117048,0.000001572716,0.000046198915,0.00017981722],"genre_scores_gemma":[0.9782598,0.000023922472,0.020568935,0.00042334554,0.0006181,0.000004356304,0.0000016914436,0.000007783043,0.00009204824],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991147,0.00003669766,0.00037867134,0.00014546547,0.00017552794,0.00014893714],"domain_scores_gemma":[0.9994059,0.00025043136,0.000114250404,0.00009488736,0.000086516055,0.000048004502],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00052638137,0.00008863107,0.00014513683,0.00048414824,0.00004050517,0.00037332554,0.00028099556,0.000025719128,0.00001023285],"category_scores_gemma":[0.000054750784,0.00007061807,0.00012378128,0.00053113827,0.000014090993,0.0012364105,0.000038391732,0.00012849279,0.0000050422077],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000055495148,0.00013968514,0.00062355615,0.00010590112,0.00007154486,0.0001107926,0.0009963657,0.0032229188,0.007008041,0.7633635,0.011443637,0.21285859],"study_design_scores_gemma":[0.0012537794,0.00038973123,0.0034757769,0.00045431528,0.0000310422,0.00025770397,0.00002145749,0.43342552,0.0038043347,0.5243336,0.032280676,0.00027205644],"about_ca_topic_score_codex":0.000016541995,"about_ca_topic_score_gemma":0.000018024131,"teacher_disagreement_score":0.7794107,"about_ca_system_score_codex":0.000036772482,"about_ca_system_score_gemma":0.00014441911,"threshold_uncertainty_score":0.3599987},"labels":[],"label_agreement":null},{"id":"W4396626795","doi":"10.24124/2024/59487","title":"Mahler’s measure and its related two open problems","year":2024,"lang":"en","type":"dissertation","venue":"","topic":"Polynomial and algebraic computation","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Northern British Columbia","funders":"","keywords":"Measure (data warehouse); Algebraic number; Polynomial; Computation; Mathematics; Computer science; Discrete mathematics; Calculus (dental); Theoretical computer science; Algorithm; Data mining; Mathematical analysis; Medicine","score_opus":0.023163516289733323,"score_gpt":0.2793449595372442,"score_spread":0.25618144324751085,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4396626795","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15689036,0.024612945,0.0125841005,0.013503469,0.01651238,0.0059774998,0.000022478196,0.0029896838,0.7669071],"genre_scores_gemma":[0.56731045,0.00011071964,0.002849236,0.00026683873,0.00015131549,0.000120286284,0.00029959664,0.000059035825,0.4288325],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99857664,0.000042221858,0.00030027283,0.0006396995,0.00024368033,0.00019748784],"domain_scores_gemma":[0.99943894,0.00003386477,0.000106594736,0.00023161228,0.00009326189,0.00009575317],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00025642832,0.00022955761,0.00024161748,0.00014688165,0.00009734104,0.00096225477,0.0009909695,0.00015071381,0.00005328389],"category_scores_gemma":[0.0000181534,0.00019036866,0.000052184365,0.00038555433,0.000004126547,0.00055428944,0.00035688,0.00029322514,0.00033781986],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002267324,0.0000800252,0.0000073499036,0.0006134407,0.00024012497,0.00005961242,0.008302724,0.00014133133,0.0024304434,0.5250509,0.018627105,0.4444243],"study_design_scores_gemma":[0.0022985872,0.00032920513,0.0015382199,0.0026440201,0.00019055181,0.0001383709,0.00025791946,0.41668597,0.004732893,0.5410651,0.027739659,0.002379512],"about_ca_topic_score_codex":0.0002288424,"about_ca_topic_score_gemma":0.00061125954,"teacher_disagreement_score":0.44204476,"about_ca_system_score_codex":0.000059152473,"about_ca_system_score_gemma":0.0001979055,"threshold_uncertainty_score":0.9279045},"labels":[],"label_agreement":null},{"id":"W4399140109","doi":"10.1093/imrn/rnae114","title":"On a Theorem of Lafforgue","year":2024,"lang":"en","type":"article","venue":"International Mathematics Research Notices","topic":"Polynomial and algebraic computation","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Banff International Research Station for Mathematical Innovation and Discovery; National Science Foundation","keywords":"Mathematics; Indecomposable module; Matroid; Polytope; Equivalence (formal languages); Pure mathematics; Combinatorics; Algebra over a field; Discrete mathematics","score_opus":0.06915160072418039,"score_gpt":0.3943060371251771,"score_spread":0.3251544364009967,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4399140109","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.26341817,0.0002841394,0.57429796,0.010269045,0.002154274,0.0003543313,0.000021096559,0.0003137572,0.14888722],"genre_scores_gemma":[0.98536813,0.0000081777725,0.0136346305,0.000029658955,0.00009890491,0.000010096088,0.0000017975601,0.000006344363,0.00084226223],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985568,0.00004792895,0.00020190822,0.0001883329,0.00085341407,0.00015163416],"domain_scores_gemma":[0.9977576,0.0017762339,0.00003596454,0.00020710849,0.00018054822,0.000042506515],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009521391,0.00006315073,0.000081336715,0.00036864605,0.000041726642,0.00029319103,0.0009773931,0.000026073409,0.00008056368],"category_scores_gemma":[0.0003742075,0.000047613063,0.000052530533,0.0003108931,0.00007306992,0.00029834593,0.000252204,0.00015991586,0.00028801986],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000003271673,0.000082690414,0.0000016754751,0.00007037769,0.000029471572,0.000012743651,0.0009224128,0.00024713745,0.00056129065,0.9796218,0.0009565578,0.017490529],"study_design_scores_gemma":[0.000048059326,0.000058906862,0.000031295476,0.00019118424,9.864452e-7,0.0000036514248,0.000034732926,0.4420075,0.0032266334,0.5529319,0.0014239994,0.00004110697],"about_ca_topic_score_codex":0.0000121715075,"about_ca_topic_score_gemma":0.000002861645,"teacher_disagreement_score":0.72194993,"about_ca_system_score_codex":0.000045214907,"about_ca_system_score_gemma":0.000076301425,"threshold_uncertainty_score":0.37020084},"labels":[],"label_agreement":null},{"id":"W4399198666","doi":"10.48550/arxiv.2405.19216","title":"Central Limit Theorem for Tensor Products of Free Variables via Bi-Free Independence","year":2024,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Polynomial and algebraic computation","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Independence (probability theory); Limit (mathematics); Mathematics; Tensor (intrinsic definition); Central limit theorem; Pure mathematics; Mathematical analysis; Statistics","score_opus":0.039751472303818494,"score_gpt":0.17826240892970996,"score_spread":0.13851093662589148,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4399198666","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12551916,0.00017450773,0.86927664,0.00069400563,0.0020223842,0.0007073197,0.00012161375,0.00029909224,0.001185287],"genre_scores_gemma":[0.9882472,0.000034172434,0.010321383,0.00005459346,0.00024126474,0.0000025746763,0.000014781966,0.000020807815,0.0010632253],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9978231,0.00008096577,0.00027906513,0.0012216691,0.00015614886,0.0004390385],"domain_scores_gemma":[0.9973281,0.00021095714,0.0002772461,0.001745847,0.0003057197,0.00013211739],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00033164388,0.00031423796,0.00037059758,0.0002863771,0.00009675528,0.00011690632,0.0035021636,0.00026175653,0.000009520461],"category_scores_gemma":[0.00021643932,0.0003225438,0.00021891898,0.0006630661,0.00013228723,0.00025889152,0.005106417,0.00047103871,0.0000143913985],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007484725,0.00013302914,0.00020389755,0.0006014161,0.00017288199,0.00008332904,0.00048066938,0.06215459,0.00055876485,0.92963773,0.0019174342,0.003981401],"study_design_scores_gemma":[0.00039603334,0.00007108253,0.000424555,0.00014384749,0.00007923693,0.0000047976146,0.000017142016,0.34222484,0.0023899178,0.65372723,0.00022823595,0.0002930794],"about_ca_topic_score_codex":0.00020113372,"about_ca_topic_score_gemma":0.000041361032,"teacher_disagreement_score":0.86272806,"about_ca_system_score_codex":0.00013538705,"about_ca_system_score_gemma":0.00051400077,"threshold_uncertainty_score":0.99992263},"labels":[],"label_agreement":null},{"id":"W4399695041","doi":"10.3390/appliedmath4030047","title":"A Rational Approximation of the Two-Term Machin-like Formula for π","year":2024,"lang":"en","type":"preprint","venue":"AppliedMath","topic":"Polynomial and algebraic computation","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Thoth Technology (Canada); York University","funders":"National Research Council Canada; York University","keywords":"Pi; Term (time); Mathematics; Rational function; Applied mathematics; Physics; Pure mathematics; Geometry; Quantum mechanics","score_opus":0.01574296308686302,"score_gpt":0.2601165080610401,"score_spread":0.24437354497417707,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4399695041","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.043057714,0.00012866991,0.9509229,0.000903451,0.0018316953,0.0012358169,0.000053409836,0.00014066856,0.0017256761],"genre_scores_gemma":[0.94959986,0.0000022095196,0.04917382,0.00021136076,0.00028777806,0.00036521454,0.000065620814,0.000016296139,0.00027783893],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987853,0.000020879928,0.0003388172,0.00041323487,0.00028259685,0.00015914453],"domain_scores_gemma":[0.99906504,0.00008715376,0.00024421432,0.000511658,0.00005953497,0.000032395852],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00026256402,0.00018058206,0.00020176593,0.0000775889,0.000090327,0.00016312202,0.00090652634,0.000091402544,0.0000027627464],"category_scores_gemma":[0.000009427947,0.00012963777,0.00020410644,0.00014444422,0.00003454994,0.00006881974,0.0016361742,0.00024554657,0.000016244603],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000070384035,0.000039509297,0.000006735802,0.00037121432,0.000037169542,2.7350512e-7,0.00078847486,0.0026856419,0.00076865323,0.9497172,0.0012546151,0.044323474],"study_design_scores_gemma":[0.00020514212,0.000010292126,0.00022169152,0.000074905125,0.000020540909,0.0000034400841,0.0000032962068,0.45911545,0.0016560527,0.5378989,0.00066182535,0.00012851132],"about_ca_topic_score_codex":0.000013575876,"about_ca_topic_score_gemma":0.0000064681603,"teacher_disagreement_score":0.9065421,"about_ca_system_score_codex":0.000053185384,"about_ca_system_score_gemma":0.00024548476,"threshold_uncertainty_score":0.5286475},"labels":[],"label_agreement":null},{"id":"W4399726561","doi":"10.32920/26052676.v1","title":"Evacuating the ℓp Disc","year":2024,"lang":"en","type":"preprint","venue":"","topic":"Polynomial and algebraic computation","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Computer science","score_opus":0.020689269476119307,"score_gpt":0.2688633891336638,"score_spread":0.2481741196575445,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4399726561","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.022896618,0.0009263299,0.87572336,0.037086405,0.0056234393,0.00035517232,0.0000037503723,0.0009300798,0.056454863],"genre_scores_gemma":[0.98297393,0.000006070388,0.011574346,0.0006551078,0.00050791056,0.00003059423,0.0000037053753,0.0000087778,0.0042395624],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99901485,0.000043732733,0.0001804013,0.00040253717,0.00020395023,0.00015454947],"domain_scores_gemma":[0.9992293,0.00011695481,0.0000564466,0.00053673936,0.000024567848,0.000035973742],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00026732922,0.00013661702,0.00010743371,0.000046601108,0.00008912822,0.00068211777,0.0012136939,0.00006075724,0.000021799235],"category_scores_gemma":[0.000022465949,0.00007516633,0.00010910608,0.00014713082,0.000021345399,0.000054531713,0.005240416,0.00046218364,0.00038086038],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[5.2263357e-7,0.00001173966,0.000008065537,0.000065253924,0.000037519047,0.000008933099,0.0015615671,0.0019057532,0.00005900818,0.5241205,0.011987242,0.4602339],"study_design_scores_gemma":[0.0000208069,0.0000058830747,0.00019105274,0.00005288138,0.0000068904405,0.0000041603053,0.000012163175,0.51118606,0.00020249214,0.48626873,0.0019306467,0.00011824624],"about_ca_topic_score_codex":0.000101372556,"about_ca_topic_score_gemma":0.0000160249,"teacher_disagreement_score":0.9600773,"about_ca_system_score_codex":0.00003111119,"about_ca_system_score_gemma":0.00014304311,"threshold_uncertainty_score":0.6577678},"labels":[],"label_agreement":null},{"id":"W4399726610","doi":"10.32920/26052676","title":"Evacuating the ℓp Disc","year":2024,"lang":"en","type":"preprint","venue":"","topic":"Polynomial and algebraic computation","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Business","score_opus":0.020689269476119307,"score_gpt":0.2688633891336638,"score_spread":0.2481741196575445,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4399726610","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.022896618,0.0009263299,0.87572336,0.037086405,0.0056234393,0.00035517232,0.0000037503723,0.0009300798,0.056454863],"genre_scores_gemma":[0.98297393,0.000006070388,0.011574346,0.0006551078,0.00050791056,0.00003059423,0.0000037053753,0.0000087778,0.0042395624],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99901485,0.000043732733,0.0001804013,0.00040253717,0.00020395023,0.00015454947],"domain_scores_gemma":[0.9992293,0.00011695481,0.0000564466,0.00053673936,0.000024567848,0.000035973742],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00026732922,0.00013661702,0.00010743371,0.000046601108,0.00008912822,0.00068211777,0.0012136939,0.00006075724,0.000021799235],"category_scores_gemma":[0.000022465949,0.00007516633,0.00010910608,0.00014713082,0.000021345399,0.000054531713,0.005240416,0.00046218364,0.00038086038],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[5.2263357e-7,0.00001173966,0.000008065537,0.000065253924,0.000037519047,0.000008933099,0.0015615671,0.0019057532,0.00005900818,0.5241205,0.011987242,0.4602339],"study_design_scores_gemma":[0.0000208069,0.0000058830747,0.00019105274,0.00005288138,0.0000068904405,0.0000041603053,0.000012163175,0.51118606,0.00020249214,0.48626873,0.0019306467,0.00011824624],"about_ca_topic_score_codex":0.000101372556,"about_ca_topic_score_gemma":0.0000160249,"teacher_disagreement_score":0.9600773,"about_ca_system_score_codex":0.00003111119,"about_ca_system_score_gemma":0.00014304311,"threshold_uncertainty_score":0.6577678},"labels":[],"label_agreement":null},{"id":"W4400459020","doi":"10.1186/s13635-024-00170-7","title":"Performance comparison of quantum-safe multivariate polynomial public key encapsulation algorithm","year":2024,"lang":"en","type":"article","venue":"EURASIP Journal on Information Security","topic":"Polynomial and algebraic computation","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University; Quantropi (Canada)","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Encapsulation (networking); Multivariate statistics; Algorithm; Public-key cryptography; Key encapsulation; Quantum; Key (lock); Theoretical computer science; Computer security; Symmetric-key algorithm; Machine learning; Encryption","score_opus":0.02251915169230447,"score_gpt":0.281203308325278,"score_spread":0.25868415663297356,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4400459020","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.36180443,0.00012155481,0.63046956,0.0018242532,0.0031770875,0.00017600451,0.000016532065,0.00018996887,0.0022206388],"genre_scores_gemma":[0.99434066,0.000030486886,0.005122428,0.00016248786,0.00029868848,0.00000373189,0.000022168148,0.0000064431783,0.00001291649],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99769855,0.00012547847,0.0010475968,0.0001626938,0.0006775552,0.00028812437],"domain_scores_gemma":[0.9986483,0.00016268442,0.0005099986,0.0002246326,0.00028551082,0.00016889235],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008849615,0.00019373206,0.00025332655,0.0005849693,0.00028296348,0.00082574785,0.00056037435,0.000093355586,0.000043752534],"category_scores_gemma":[0.00010022043,0.00016612589,0.00013877329,0.0006692838,0.000043210774,0.0067261476,0.00011193329,0.00054053316,0.00025536798],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000037781945,0.00011490941,0.00037783905,0.00008821706,0.000052167146,0.0000043129166,0.012110611,0.002674351,0.00014688379,0.05976819,0.0037256498,0.9208991],"study_design_scores_gemma":[0.00046052094,0.0002473547,0.007377775,0.000105558276,0.000006603885,0.00007739335,0.000082870065,0.9675517,0.0011964135,0.0015571755,0.021150809,0.00018584503],"about_ca_topic_score_codex":0.0000130431645,"about_ca_topic_score_gemma":5.404983e-7,"teacher_disagreement_score":0.9648773,"about_ca_system_score_codex":0.00014507996,"about_ca_system_score_gemma":0.00024274077,"threshold_uncertainty_score":0.79627055},"labels":[],"label_agreement":null},{"id":"W4401015388","doi":"10.5206/mt.v4i1.17129","title":"L^infinity-norm computation for linear time-invariant systems depending on parameters","year":2024,"lang":"en","type":"article","venue":"Maple Transactions","topic":"Polynomial and algebraic computation","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Parametric statistics; Computation; Mathematics; Norm (philosophy); Sigma; Projection (relational algebra); Invariant (physics); Algebraic number; Uniform norm; LTI system theory; Linear system; Applied mathematics; Discrete mathematics; Algebra over a field; Algorithm; Pure mathematics; Mathematical analysis","score_opus":0.027606847777001425,"score_gpt":0.26409951862006964,"score_spread":0.23649267084306821,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4401015388","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0034794651,0.00006219037,0.9916718,0.0011724723,0.0018204714,0.0003870377,0.000039599356,0.0005792073,0.0007877733],"genre_scores_gemma":[0.963,0.000005729582,0.035355475,0.00012804607,0.00016314977,0.00011010082,0.000034709905,0.000021766808,0.0011809957],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989253,0.000049467366,0.0002465955,0.00036173355,0.00018278461,0.00023411616],"domain_scores_gemma":[0.9991131,0.0005567331,0.00003742185,0.00017074145,0.00003750894,0.000084519175],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00024401456,0.00014076466,0.00014470033,0.00022010077,0.0002691669,0.00037303622,0.00021867658,0.00005877005,0.000012133923],"category_scores_gemma":[0.000010016238,0.00013420694,0.00013138301,0.0003674414,0.00001773303,0.0003654301,0.000007803519,0.00014679373,0.00025796937],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000039585986,0.00017675075,0.000002321603,0.00032056437,0.00018538805,0.00002801687,0.0013834995,0.683277,0.0020046104,0.08069341,0.002367324,0.22952151],"study_design_scores_gemma":[0.00021846536,0.00014297948,0.000026371328,0.00007298499,0.000025071176,0.000021988975,0.000017801685,0.9893238,0.0007361756,0.0023536098,0.006896126,0.00016460834],"about_ca_topic_score_codex":0.00008179359,"about_ca_topic_score_gemma":0.000008452686,"teacher_disagreement_score":0.9595206,"about_ca_system_score_codex":0.000087299915,"about_ca_system_score_gemma":0.00007474814,"threshold_uncertainty_score":0.54728},"labels":[],"label_agreement":null},{"id":"W4401767940","doi":"10.1007/978-3-031-69070-9_3","title":"A Modular Algorithm to Compute the Resultant of Multivariate Polynomials over Algebraic Number Fields Presented with Multiple Extensions","year":2024,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Polynomial and algebraic computation","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Modular design; Algebraic number; Computer science; Algebra over a field; Algorithm; Multivariate statistics; Mathematics; Pure mathematics; Programming language; Machine learning","score_opus":0.012349575831576287,"score_gpt":0.25140765378230645,"score_spread":0.23905807795073017,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4401767940","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0015606082,0.00023081672,0.9914593,0.0032655639,0.001813455,0.0009677554,0.000033288787,0.00018928265,0.00047991148],"genre_scores_gemma":[0.48027423,0.000018902285,0.515164,0.0025070717,0.00078065787,0.000035649195,0.00001287592,0.00007788289,0.0011287014],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9954376,0.00007162092,0.0008222886,0.0017347515,0.0011978254,0.0007358762],"domain_scores_gemma":[0.99612445,0.0012521914,0.00034457725,0.0016414515,0.00037625938,0.00026105673],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0007850206,0.0006612146,0.0007476428,0.0005884636,0.0002935619,0.0004996752,0.002975765,0.00027985207,0.000013314536],"category_scores_gemma":[0.00013423323,0.0004365083,0.00020553384,0.0013123873,0.0005652558,0.00040323523,0.002375801,0.00088178343,0.00005838256],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000709186,0.0001255462,0.000033388693,0.000092532435,0.00015387087,0.00030340796,0.0034756723,0.26083925,0.0015727738,0.036812916,0.00028527112,0.69623446],"study_design_scores_gemma":[0.00052145944,0.000230689,0.0006931919,0.000780297,0.000027009744,0.000096622476,4.4199862e-7,0.9374263,0.0015723567,0.055646226,0.0024115758,0.0005937728],"about_ca_topic_score_codex":0.00039757925,"about_ca_topic_score_gemma":0.00028600034,"teacher_disagreement_score":0.6956407,"about_ca_system_score_codex":0.00017524003,"about_ca_system_score_gemma":0.00052741845,"threshold_uncertainty_score":0.99980867},"labels":[],"label_agreement":null},{"id":"W4401768400","doi":"10.1007/978-3-031-69070-9_9","title":"Counting the Integer Points of Parametric Polytopes: A Maple Implementation","year":2024,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Polynomial and algebraic computation","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"","keywords":"Maple; Computer science; Polytope; Integer (computer science); Parametric statistics; Algorithm; Discrete mathematics; Programming language; Mathematics; Statistics; Botany","score_opus":0.015499528736504868,"score_gpt":0.2683730491502423,"score_spread":0.25287352041373745,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4401768400","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0007939751,0.00069453655,0.9931357,0.0018911944,0.00183544,0.0003614821,0.000006081802,0.00009386565,0.0011877373],"genre_scores_gemma":[0.93490356,0.000032451077,0.06299167,0.0012364144,0.00046597706,0.000011471097,0.0000071968807,0.000030171354,0.0003210955],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99716663,0.000028760813,0.00061497977,0.00090722914,0.00085337413,0.00042904203],"domain_scores_gemma":[0.9980214,0.0006405728,0.00033509807,0.00075479003,0.0001784439,0.000069665],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010885765,0.00033733575,0.00035495544,0.0009249803,0.00016667988,0.0005215842,0.0022837592,0.00012581417,0.000027245049],"category_scores_gemma":[0.00006400024,0.00024031573,0.00014436606,0.0013213119,0.00039203162,0.0004209586,0.0012429839,0.0005437159,0.000055577875],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000003457123,0.000016540469,0.000045440207,0.00007378345,0.000023904111,0.000021165497,0.0018981885,0.0075731785,0.00010139478,0.08730683,0.000075914184,0.9028602],"study_design_scores_gemma":[0.00018746834,0.00013634183,0.00024606384,0.00037191564,0.000017285882,0.000047471734,0.0000020692717,0.5294374,0.002183571,0.4651327,0.0018350169,0.00040263633],"about_ca_topic_score_codex":0.00012587973,"about_ca_topic_score_gemma":0.000091751135,"teacher_disagreement_score":0.93410957,"about_ca_system_score_codex":0.00021324915,"about_ca_system_score_gemma":0.00042631524,"threshold_uncertainty_score":0.9799791},"labels":[],"label_agreement":null},{"id":"W4402858306","doi":"10.1016/j.jsc.2024.102389","title":"An <mml:math xmlns:mml=\"http://www.w3.org/1998/Math/MathML\" altimg=\"si1.svg\"> <mml:mi mathvariant=\"fraktur\">m</mml:mi> </mml:math> -adic algorithm for bivariate Gröbner bases","year":2024,"lang":"nl","type":"article","venue":"Journal of Symbolic Computation","topic":"Polynomial and algebraic computation","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"European Research Council; Natural Sciences and Engineering Research Council of Canada; Fonds Québécois de la Recherche sur la Nature et les Technologies","keywords":"Mathematics; Algorithm; Bivariate analysis; Statistics","score_opus":0.01845828149499284,"score_gpt":0.26250158108830496,"score_spread":0.2440432995933121,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4402858306","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.50821733,0.00084116706,0.4851258,0.0010933342,0.0042247763,0.000099394805,0.00006260221,0.00013320097,0.00020235473],"genre_scores_gemma":[0.94216174,0.00021638928,0.052830294,0.00079149933,0.0036424263,0.00004153976,0.00009568299,0.00011770775,0.000102742204],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9957442,0.00022973683,0.0014624919,0.0007561009,0.0010649986,0.00074247166],"domain_scores_gemma":[0.9966733,0.000873006,0.0012020437,0.0004722241,0.00032308436,0.00045633194],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0016404757,0.00048029423,0.00045255868,0.0005482692,0.00059034186,0.0017416367,0.0009432932,0.00040342743,0.00004857791],"category_scores_gemma":[0.00015970856,0.00052613375,0.0007062524,0.00079947594,0.00017324797,0.001963355,0.0003152951,0.00068508484,0.0005026196],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000087288914,0.00022719053,0.0000014856287,0.00028475383,0.00032430337,0.00034987734,0.0024292928,0.012465927,0.00064342975,0.7627611,0.0018220469,0.21860327],"study_design_scores_gemma":[0.0009783069,0.0012878117,0.00029012407,0.0009302816,0.0003674017,0.0014027427,0.00024258929,0.9792207,0.0009578819,0.010246749,0.0035987967,0.00047660366],"about_ca_topic_score_codex":0.00021700843,"about_ca_topic_score_gemma":0.000018836368,"teacher_disagreement_score":0.9667548,"about_ca_system_score_codex":0.00007600977,"about_ca_system_score_gemma":0.001159503,"threshold_uncertainty_score":0.999719},"labels":[],"label_agreement":null},{"id":"W4403305175","doi":"10.1017/9781009302180.032","title":"Solution Is a Tree","year":2024,"lang":"en","type":"book-chapter","venue":"Cambridge University Press eBooks","topic":"Polynomial and algebraic computation","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"York University","funders":"","keywords":"Tree (set theory); Forestry; Computer science; Geography; Mathematics; Combinatorics","score_opus":0.019951066176322797,"score_gpt":0.19409273643288769,"score_spread":0.17414167025656488,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4403305175","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000020817357,0.0002265748,0.043503612,0.00018512654,0.00068652414,0.0001789703,0.000055607332,0.00040604675,0.9547367],"genre_scores_gemma":[0.0013064523,0.000028615355,0.00044248148,0.00014782908,0.00018552672,3.6916376e-7,0.000013157198,0.000020679412,0.9978549],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99875534,0.000012765231,0.00014577199,0.000609575,0.00024658846,0.00022994578],"domain_scores_gemma":[0.9991496,0.000034387223,0.00011150615,0.0005017897,0.00007312031,0.00012955614],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.000058361384,0.0002761556,0.00023626276,0.00022178197,0.000136016,0.00014297775,0.00084120024,0.00022336344,0.0000024628225],"category_scores_gemma":[0.0000013624659,0.00031741502,0.00023058087,0.000015203527,0.00008598265,0.00017814746,0.0008470546,0.00033179112,0.0001575644],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000006968146,0.0000032882624,3.973285e-8,0.000036677084,0.000057406654,0.00016561472,0.00007564708,9.873773e-7,0.000036680707,0.90826327,0.070750594,0.020602852],"study_design_scores_gemma":[0.00021125862,0.00003734852,0.0000037694258,0.0001426025,0.00007928757,0.000021953745,0.0000021117753,0.008612418,0.00032164276,0.000872912,0.989316,0.0003787081],"about_ca_topic_score_codex":0.00006799337,"about_ca_topic_score_gemma":0.0000014954969,"teacher_disagreement_score":0.9185654,"about_ca_system_score_codex":0.00019093299,"about_ca_system_score_gemma":0.00012314944,"threshold_uncertainty_score":0.9999278},"labels":[],"label_agreement":null},{"id":"W4403305644","doi":"10.1017/9781009302180.018","title":"Recursive Images","year":2024,"lang":"en","type":"book-chapter","venue":"Cambridge University Press eBooks","topic":"Polynomial and algebraic computation","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"York University","funders":"","keywords":"Computer science","score_opus":0.014882467496586305,"score_gpt":0.19508183679879396,"score_spread":0.18019936930220765,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4403305644","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000008606805,0.000361904,0.024447149,0.00012599153,0.00087534025,0.00019908082,0.00009004018,0.0004229917,0.9734689],"genre_scores_gemma":[0.0003338342,0.00005181164,0.0008012023,0.00007891034,0.00020200756,3.6838512e-7,0.000016413722,0.000024433393,0.998491],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9987399,0.000016497614,0.00014223167,0.00063751935,0.00023025328,0.00023359212],"domain_scores_gemma":[0.9990431,0.000064414,0.00012242422,0.00052457635,0.000101762016,0.00014370779],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.000060586484,0.00029974015,0.00026336606,0.00021907892,0.00012435165,0.00017070984,0.0010331426,0.00020031536,0.000002010986],"category_scores_gemma":[0.0000036566441,0.00033849105,0.00021720192,0.000013966148,0.000118984084,0.00018879208,0.00097545475,0.00040120902,0.00014863997],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000066606276,0.0000026780444,2.9003122e-8,0.000037568585,0.000063734464,0.00045924966,0.00004400039,0.0000023305508,0.000017386259,0.9159974,0.07463834,0.008730663],"study_design_scores_gemma":[0.00016798382,0.00004325221,0.0000027445415,0.0001784175,0.00007518166,0.000029760597,0.0000046211426,0.0005462345,0.00043532733,0.0022014892,0.99591136,0.00040361966],"about_ca_topic_score_codex":0.000046823578,"about_ca_topic_score_gemma":5.2032067e-7,"teacher_disagreement_score":0.92127305,"about_ca_system_score_codex":0.00016175103,"about_ca_system_score_gemma":0.00012451489,"threshold_uncertainty_score":0.9999067},"labels":[],"label_agreement":null},{"id":"W4403305810","doi":"10.1017/9781009302180.015","title":"Abstractions, Techniques, and Theory","year":2024,"lang":"en","type":"book-chapter","venue":"Cambridge University Press eBooks","topic":"Polynomial and algebraic computation","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"York University","funders":"","keywords":"Computer science","score_opus":0.012746301337327988,"score_gpt":0.19479488902368566,"score_spread":0.18204858768635768,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4403305810","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000014273499,0.00049425906,0.014459193,0.000056314882,0.0002954101,0.00017818052,0.000038498605,0.0005215348,0.98394233],"genre_scores_gemma":[0.00056158996,0.00011362953,0.0008991871,0.00003897361,0.00014142021,5.062732e-7,0.0000075903126,0.000017139564,0.99821997],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99914914,0.000015528225,0.00011296949,0.00044950575,0.0001323339,0.0001405045],"domain_scores_gemma":[0.9993578,0.00007345673,0.00008578981,0.0003392276,0.000043890217,0.000099786645],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0000998217,0.00021143847,0.00017341152,0.00018775799,0.00012600789,0.00012842608,0.00044331426,0.00018648489,0.0000014566124],"category_scores_gemma":[0.000001551401,0.00023471982,0.00009126414,0.000007160641,0.00011190648,0.000156678,0.00059692457,0.0003557608,0.000029133305],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000006827306,0.0000021915507,2.8596327e-8,0.000036304198,0.000038990333,0.00028111984,0.000021159023,2.4418432e-7,0.000014118452,0.9398831,0.008076189,0.051639736],"study_design_scores_gemma":[0.000085938686,0.000027205773,0.0000024970686,0.000109301116,0.00005443729,0.00009520533,0.0000038681874,0.00023514869,0.00030379242,0.0045676236,0.99425495,0.00026004875],"about_ca_topic_score_codex":0.00003087568,"about_ca_topic_score_gemma":4.8065937e-7,"teacher_disagreement_score":0.98617876,"about_ca_system_score_codex":0.00008618149,"about_ca_system_score_gemma":0.000069964575,"threshold_uncertainty_score":0.95715964},"labels":[],"label_agreement":null},{"id":"W4403306209","doi":"10.1017/9781009302180.045","title":"Recurrence Relations","year":2024,"lang":"en","type":"book-chapter","venue":"Cambridge University Press eBooks","topic":"Polynomial and algebraic computation","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"York University","funders":"","keywords":"Medicine","score_opus":0.020110493429564943,"score_gpt":0.1992407464156212,"score_spread":0.17913025298605625,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4403306209","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000009533063,0.00026311833,0.04418865,0.00011160518,0.00084555097,0.00017378548,0.000060665647,0.00037018777,0.9539769],"genre_scores_gemma":[0.0008480549,0.000029501596,0.00084368425,0.00004189775,0.00013161254,4.124946e-7,0.000018918383,0.000016975722,0.9980689],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9988757,0.0000150564465,0.00015092065,0.0005573622,0.00021179451,0.00018920994],"domain_scores_gemma":[0.9991005,0.00007251715,0.00011313312,0.00050351524,0.000083454695,0.00012688976],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.000064064574,0.000240095,0.00019910681,0.00020939771,0.00015662689,0.00013525675,0.00087601284,0.00019165722,0.000002821276],"category_scores_gemma":[0.0000047712647,0.00027942398,0.00016812186,0.000019152387,0.00009288536,0.00019652801,0.00074417604,0.0004349848,0.00024606424],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000002926513,0.0000024679514,1.1443563e-7,0.00002141823,0.000034984387,0.00013309208,0.0000424874,0.0000069923317,0.0000034228117,0.94772536,0.043047044,0.008979672],"study_design_scores_gemma":[0.00011092215,0.000025511981,0.000006652718,0.0001786238,0.000053197622,0.000017367673,0.000002063374,0.0044032866,0.000036108064,0.0017757264,0.99307066,0.000319878],"about_ca_topic_score_codex":0.000033303048,"about_ca_topic_score_gemma":0.0000010089205,"teacher_disagreement_score":0.9500236,"about_ca_system_score_codex":0.00015834394,"about_ca_system_score_gemma":0.000155315,"threshold_uncertainty_score":0.9999658},"labels":[],"label_agreement":null},{"id":"W4403513238","doi":"10.3390/math12203258","title":"Elimination Algorithms for Skew Polynomials with Applications in Cybersecurity","year":2024,"lang":"en","type":"article","venue":"Mathematics","topic":"Polynomial and algebraic computation","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Trent University; Nottingham Trent University","keywords":"Skew; Algorithm; Computer science; Mathematics; Telecommunications","score_opus":0.020069111247687565,"score_gpt":0.2782433930003854,"score_spread":0.25817428175269785,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4403513238","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0073719397,0.000121582445,0.9902001,0.00092770864,0.00009709398,0.00051158294,0.0000068377135,0.00017740157,0.00058573467],"genre_scores_gemma":[0.47777864,0.00000627027,0.52140504,0.000060503204,0.00011869684,0.00033053066,0.000014578954,0.000015137779,0.00027058812],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993051,0.000010050697,0.00019973383,0.00021628852,0.00012302733,0.00014575919],"domain_scores_gemma":[0.99941933,0.0002723594,0.000043016636,0.00019529766,0.00003464098,0.000035372206],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00023078069,0.00009260874,0.00011813985,0.00012597871,0.00005321361,0.00017317735,0.00024647705,0.000034601828,0.0000027873698],"category_scores_gemma":[0.00001714029,0.00007322678,0.00003656923,0.00037271713,0.000018342535,0.00024453492,0.0000455304,0.00005666209,0.000020673007],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000013024256,0.00010649959,0.0000071953596,0.00022134936,0.000011466752,0.0000023886323,0.0035232108,0.000081977676,0.00013791007,0.91583073,0.00032509258,0.07975089],"study_design_scores_gemma":[0.00024380113,0.00006940342,0.00025534726,0.00012272621,0.000013584425,0.00001267063,0.00010949718,0.6882913,0.0014961557,0.3038313,0.005359509,0.00019466328],"about_ca_topic_score_codex":0.000009322147,"about_ca_topic_score_gemma":0.000016443348,"teacher_disagreement_score":0.68820935,"about_ca_system_score_codex":0.000051945946,"about_ca_system_score_gemma":0.000065448956,"threshold_uncertainty_score":0.29861015},"labels":[],"label_agreement":null},{"id":"W4403714180","doi":"10.1142/s0219061324500326","title":"Higher dimensional chain conditions","year":2024,"lang":"en","type":"article","venue":"Journal of Mathematical Logic","topic":"Polynomial and algebraic computation","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Chain (unit); Mathematics; Physics","score_opus":0.026741755615223628,"score_gpt":0.28029606004736235,"score_spread":0.2535543044321387,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4403714180","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03459124,0.00071488926,0.93813485,0.018674986,0.0015699533,0.0000714443,0.0000020959826,0.00011320668,0.006127325],"genre_scores_gemma":[0.96393627,0.0000027094925,0.034562822,0.00049615785,0.00028603495,0.000001250106,4.117298e-7,0.0000043059526,0.0007100446],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99920756,0.000034985773,0.00030343857,0.00008750083,0.00025667663,0.00010982589],"domain_scores_gemma":[0.9993305,0.000371742,0.00007052945,0.00008750949,0.000053022697,0.00008669578],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00032530073,0.00006689459,0.00014012442,0.00009416555,0.00003845549,0.00011939336,0.00025693112,0.00003131582,0.0003525673],"category_scores_gemma":[0.000051369752,0.000042189244,0.000115085146,0.00015346194,0.000031355077,0.00027176875,0.00006603731,0.00014847127,0.00032457316],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000013389074,0.0000592425,8.1489463e-7,0.000024412377,0.000019117826,0.0001272712,0.00007266999,0.00010510976,0.00058257737,0.9901613,0.00573611,0.003110047],"study_design_scores_gemma":[0.00009379731,0.000094183255,0.00024638156,0.00010779198,0.000010137739,0.0004260549,0.0000028188551,0.044229798,0.0001306526,0.9525752,0.0020230443,0.000060104594],"about_ca_topic_score_codex":1.4376585e-7,"about_ca_topic_score_gemma":2.3781636e-8,"teacher_disagreement_score":0.929345,"about_ca_system_score_codex":0.000026188616,"about_ca_system_score_gemma":0.000060293263,"threshold_uncertainty_score":0.41718397},"labels":[],"label_agreement":null},{"id":"W4403868260","doi":"10.1007/s43037-024-00391-5","title":"Correction to: On the numerical ranges of matrices in max algebra","year":2024,"lang":"en","type":"article","venue":"Banach Journal of Mathematical Analysis","topic":"Polynomial and algebraic computation","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Regina","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Algebra over a field; Pure mathematics","score_opus":0.013118870231820701,"score_gpt":0.260536656472704,"score_spread":0.24741778624088331,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4403868260","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.14970648,0.00028705725,0.84225845,0.0067440323,0.0003054344,0.00006199651,7.494719e-7,0.000017691405,0.00061808166],"genre_scores_gemma":[0.9942671,0.00001557763,0.005424785,0.00011781578,0.000067291396,0.0000021423764,1.8495363e-7,0.0000037461327,0.00010133356],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986259,0.00012208591,0.0005480512,0.00013800256,0.00043916216,0.00012679896],"domain_scores_gemma":[0.9982543,0.0012791043,0.00015313782,0.0001701113,0.00006965082,0.00007370954],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00093515846,0.00009230862,0.00034406286,0.0006656213,0.00002896476,0.00010813875,0.00048074388,0.000025639449,0.000095120275],"category_scores_gemma":[0.00028906725,0.000051517218,0.00031359104,0.0025494194,0.000021368716,0.00016463545,0.00006296152,0.00018785591,0.000042099426],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00014176761,0.001218001,0.00091458205,0.00027965356,0.002868785,0.00028704168,0.0071012634,0.041705318,0.0013437718,0.5370167,0.021967543,0.38515556],"study_design_scores_gemma":[0.00013204159,0.00026552397,0.004369811,0.0003333713,0.00037164302,0.00006136259,0.00013298595,0.92165345,0.0016198176,0.07058702,0.0003371539,0.00013583632],"about_ca_topic_score_codex":0.000018129766,"about_ca_topic_score_gemma":0.00000586272,"teacher_disagreement_score":0.87994814,"about_ca_system_score_codex":0.000044928813,"about_ca_system_score_gemma":0.00004485855,"threshold_uncertainty_score":0.21008112},"labels":[],"label_agreement":null},{"id":"W4403974064","doi":"10.1007/s13366-024-00776-5","title":"Quatroids and rational plane cubics","year":2024,"lang":"de","type":"article","venue":"Beiträge zur Algebra und Geometrie / Contributions to Algebra and Geometry","topic":"Polynomial and algebraic computation","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Plane (geometry); Computer science; Mathematics; Geometry","score_opus":0.008963003809878066,"score_gpt":0.27122253702980287,"score_spread":0.2622595332199248,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4403974064","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.25224873,0.23961556,0.46753755,0.027652936,0.0068686367,0.001632269,0.0033031853,0.00085999974,0.00028113122],"genre_scores_gemma":[0.9846768,0.004538173,0.0025151866,0.0023244014,0.0031485856,0.000116057265,0.0008413559,0.000098067554,0.0017413989],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9925784,0.00034043097,0.0015251765,0.002415372,0.0013338582,0.0018067476],"domain_scores_gemma":[0.9936653,0.0027101673,0.0002625264,0.0009799731,0.0007075309,0.0016745015],"candidate_categories":["metaepi_narrow","sts","scholarly_communication","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0020792594,0.0011382741,0.0012017114,0.004123513,0.0014222639,0.0038961126,0.0009958633,0.0006871133,0.00028102266],"category_scores_gemma":[0.0017964699,0.0011559295,0.00037711847,0.010159471,0.0005325544,0.0017063457,0.0014569312,0.0011891373,0.0014791719],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013234458,0.00036148223,0.0012548732,0.00039766886,0.0014217754,0.0002678681,0.0008890364,0.00012773476,0.000452945,0.70848864,0.018479213,0.26772642],"study_design_scores_gemma":[0.004828946,0.0025822455,0.04131165,0.0011715705,0.001960327,0.00040971104,0.00022040229,0.06309418,0.0023950674,0.14495449,0.7326109,0.0044605522],"about_ca_topic_score_codex":0.00022584818,"about_ca_topic_score_gemma":0.00005225312,"teacher_disagreement_score":0.732428,"about_ca_system_score_codex":0.0003951901,"about_ca_system_score_gemma":0.0010517101,"threshold_uncertainty_score":0.99987775},"labels":[],"label_agreement":null},{"id":"W4403975967","doi":"10.55016/ojs/cdm.v19i3.74031","title":"Unified framework for tableau models of Grothendieck Polynomials","year":2024,"lang":"en","type":"article","venue":"Contributions to Discrete Mathematics","topic":"Polynomial and algebraic computation","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Combinatorics; Algebra over a field; Pure mathematics","score_opus":0.024598212673889248,"score_gpt":0.30908797722307413,"score_spread":0.2844897645491849,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4403975967","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0014385055,0.000326033,0.9925595,0.0032319028,0.0004395672,0.00077991,0.00037452628,0.000245426,0.0006046598],"genre_scores_gemma":[0.6464044,0.0000070994615,0.3528988,0.00010433198,0.00013826329,0.00014220871,0.000017316383,0.000016288372,0.00027128172],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987016,0.000026973741,0.00046936027,0.00029549183,0.0001860821,0.00032050957],"domain_scores_gemma":[0.9982961,0.0008355001,0.00009208359,0.00046747862,0.00017955006,0.00012930922],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00042016932,0.00016111512,0.00031040263,0.00017827969,0.00012757565,0.0002205079,0.0005725451,0.00008794676,0.000010738253],"category_scores_gemma":[0.00040906,0.00013892981,0.00016720247,0.0005700818,0.00003917467,0.00034397162,0.00018387602,0.00009767433,0.000040908984],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000043002615,0.000035329915,2.396903e-7,0.00012076578,0.00004073066,9.959646e-7,0.0010422473,0.0014691042,0.0007619658,0.991578,0.0011884563,0.0037578815],"study_design_scores_gemma":[0.00010287214,0.000053493375,0.0000029477117,0.00019137193,0.000021247373,0.000003230626,0.000028372016,0.37572652,0.0036188867,0.61873215,0.0014021128,0.00011678706],"about_ca_topic_score_codex":0.000008843172,"about_ca_topic_score_gemma":0.000001796963,"teacher_disagreement_score":0.6449659,"about_ca_system_score_codex":0.0000821549,"about_ca_system_score_gemma":0.00016299837,"threshold_uncertainty_score":0.56653935},"labels":[],"label_agreement":null},{"id":"W4404097419","doi":"10.1007/s43037-024-00394-2","title":"Correction to: On the numerical ranges of matrices in max algebra","year":2024,"lang":"en","type":"article","venue":"Banach Journal of Mathematical Analysis","topic":"Polynomial and algebraic computation","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Regina","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Algebra over a field; Matrix algebra; Pure mathematics; Eigenvalues and eigenvectors; Physics","score_opus":0.013118870231820701,"score_gpt":0.260536656472704,"score_spread":0.24741778624088331,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4404097419","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.14970648,0.00028705725,0.84225845,0.0067440323,0.0003054344,0.00006199651,7.494719e-7,0.000017691405,0.00061808166],"genre_scores_gemma":[0.9942671,0.00001557763,0.005424785,0.00011781578,0.000067291396,0.0000021423764,1.8495363e-7,0.0000037461327,0.00010133356],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986259,0.00012208591,0.0005480512,0.00013800256,0.00043916216,0.00012679896],"domain_scores_gemma":[0.9982543,0.0012791043,0.00015313782,0.0001701113,0.00006965082,0.00007370954],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00093515846,0.00009230862,0.00034406286,0.0006656213,0.00002896476,0.00010813875,0.00048074388,0.000025639449,0.000095120275],"category_scores_gemma":[0.00028906725,0.000051517218,0.00031359104,0.0025494194,0.000021368716,0.00016463545,0.00006296152,0.00018785591,0.000042099426],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00014176761,0.001218001,0.00091458205,0.00027965356,0.002868785,0.00028704168,0.0071012634,0.041705318,0.0013437718,0.5370167,0.021967543,0.38515556],"study_design_scores_gemma":[0.00013204159,0.00026552397,0.004369811,0.0003333713,0.00037164302,0.00006136259,0.00013298595,0.92165345,0.0016198176,0.07058702,0.0003371539,0.00013583632],"about_ca_topic_score_codex":0.000018129766,"about_ca_topic_score_gemma":0.00000586272,"teacher_disagreement_score":0.87994814,"about_ca_system_score_codex":0.000044928813,"about_ca_system_score_gemma":0.00004485855,"threshold_uncertainty_score":0.21008112},"labels":[],"label_agreement":null},{"id":"W4404131303","doi":"10.1137/1.9781611978162.ch4","title":"Chapter 4: Data-Driven Polynomial Optimization","year":2024,"lang":"en","type":"book-chapter","venue":"Society for Industrial and Applied Mathematics eBooks","topic":"Polynomial and algebraic computation","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Polynomial; Computer science; Mathematics; Mathematical analysis","score_opus":0.0719644296990688,"score_gpt":0.25248008090299306,"score_spread":0.18051565120392427,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4404131303","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00002570563,0.0001821196,0.54053366,0.00066837255,0.0014567721,0.0021898283,0.0005257219,0.0005393281,0.4538785],"genre_scores_gemma":[0.0018705983,0.00010928768,0.5459273,0.00071500527,0.0070807138,0.000207393,0.00096190325,0.00033600983,0.44279182],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9980974,0.0000017859325,0.0005425532,0.0007836786,0.00028980197,0.00028476404],"domain_scores_gemma":[0.9986746,0.00016550814,0.00031242997,0.0006724651,0.000045344896,0.00012967602],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00029081304,0.00043492106,0.0005043343,0.00006790908,0.000230552,0.00040438803,0.0008315676,0.000580203,0.000017480288],"category_scores_gemma":[0.000007475792,0.0003928734,0.00030692594,0.000022302182,0.00013389511,0.00010851309,0.0010258213,0.00044595794,0.000026882695],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000007732919,0.000009937227,5.2822764e-9,0.00012922286,0.00020455652,8.090169e-7,0.00059711176,0.00021663963,0.00003280397,0.94721466,0.008425824,0.043160684],"study_design_scores_gemma":[0.0012740125,0.00009733423,1.495404e-8,0.00029996774,0.0003695876,0.00001463775,0.00005193327,0.33976364,0.00010778601,0.4718528,0.18532191,0.00084635615],"about_ca_topic_score_codex":0.0000019071042,"about_ca_topic_score_gemma":0.0000011676519,"teacher_disagreement_score":0.47536188,"about_ca_system_score_codex":0.000049451544,"about_ca_system_score_gemma":0.00013266005,"threshold_uncertainty_score":0.9998523},"labels":[],"label_agreement":null},{"id":"W4404204827","doi":"10.1016/j.disc.2024.114316","title":"On combinatorial and hypergeometric approaches toward second-order difference equations","year":2024,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Polynomial and algebraic computation","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Dalhousie University","funders":"Killam Trusts","keywords":"Mathematics; Hypergeometric distribution; Order (exchange); Combinatorial analysis; Hypergeometric function; Basic hypergeometric series; Combinatorics; Generalized hypergeometric function; Discrete mathematics; Pure mathematics","score_opus":0.04607739107835068,"score_gpt":0.2513396514244652,"score_spread":0.2052622603461145,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4404204827","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1029982,0.0002659273,0.8916119,0.0007376427,0.00077390793,0.00015837442,0.000007919747,0.00022022553,0.0032259559],"genre_scores_gemma":[0.9857305,0.000005202496,0.0137160905,0.000050732346,0.00007600676,0.000018335617,0.0000059009612,0.000010272372,0.00038690303],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991097,0.00002384387,0.00019504958,0.0002785071,0.00022575601,0.0001671354],"domain_scores_gemma":[0.99903923,0.0006005608,0.00003920538,0.00022612224,0.000022391596,0.00007250385],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00016095198,0.00013571532,0.00015085145,0.00020052659,0.00008515659,0.00040037069,0.00028433022,0.000045631212,0.000021220023],"category_scores_gemma":[0.00014684878,0.00010579274,0.000043569038,0.0006731166,0.000037172067,0.0001859782,0.00016202,0.00012165702,0.000060026072],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[7.780828e-7,0.00004077071,0.000002835108,0.00011557501,0.000016173624,0.0000027642698,0.0017210031,0.000042930762,0.00004167678,0.97730505,0.000115672934,0.02059475],"study_design_scores_gemma":[0.000119507946,0.00006242561,0.000118318676,0.00004842849,0.000008780462,0.00000535121,0.000046844718,0.5700325,0.0001280612,0.4291236,0.00017258251,0.00013360748],"about_ca_topic_score_codex":0.0000022383076,"about_ca_topic_score_gemma":8.114561e-7,"teacher_disagreement_score":0.88273233,"about_ca_system_score_codex":0.000022435528,"about_ca_system_score_gemma":0.00004480024,"threshold_uncertainty_score":0.43141025},"labels":[],"label_agreement":null},{"id":"W4404530077","doi":"","title":"Extended Adams-Wood integral","year":2024,"lang":"en","type":"preprint","venue":"HAL (Le Centre pour la Communication Scientifique Directe)","topic":"Polynomial and algebraic computation","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"York University","funders":"","keywords":"Mathematics","score_opus":0.012376159201152911,"score_gpt":0.23011817900511164,"score_spread":0.21774201980395874,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4404530077","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.040828366,0.0023975645,0.8602337,0.032176606,0.0017886371,0.0004796489,0.000040111387,0.0013228978,0.060732447],"genre_scores_gemma":[0.86638427,0.0001508474,0.120365515,0.00022508945,0.000089775654,0.00008096821,0.0001694171,0.000048407084,0.012485693],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99466234,0.0025184331,0.00059322064,0.0012403902,0.0005331022,0.00045251666],"domain_scores_gemma":[0.99510354,0.00082688604,0.00034113275,0.0024366106,0.001050459,0.00024135035],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0032201472,0.00043207928,0.00040299783,0.0003186075,0.00025194755,0.0013568576,0.003021987,0.00028975704,0.00006126893],"category_scores_gemma":[0.000564228,0.00042871205,0.0003401461,0.00062105927,0.00015687624,0.00021780505,0.0059618424,0.0011391436,0.00027984183],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000038681706,0.00027586133,0.000022628215,0.00014804327,0.00007908148,0.000019634754,0.006405631,0.000049684997,0.00080337725,0.6253985,0.003769408,0.36302426],"study_design_scores_gemma":[0.0005604068,0.0000011089634,0.001718978,0.00326429,0.00006949537,0.0000503744,0.00006890972,0.39583966,0.041836068,0.53576154,0.019699432,0.0011297206],"about_ca_topic_score_codex":0.00072717224,"about_ca_topic_score_gemma":0.0004489733,"teacher_disagreement_score":0.8255559,"about_ca_system_score_codex":0.00017059577,"about_ca_system_score_gemma":0.0006009749,"threshold_uncertainty_score":0.9998165},"labels":[],"label_agreement":null},{"id":"W4404975185","doi":"10.2140/astat.2024.15.167","title":"Homaloidal polynomials and Gaussian models of maximum likelihood degree 1","year":2024,"lang":"en","type":"article","venue":"Algebraic Statistics","topic":"Polynomial and algebraic computation","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Degree (music); Mathematics; Maximum likelihood; Gaussian; Statistics; Applied mathematics; Physics","score_opus":0.021535040467936112,"score_gpt":0.2457748315041732,"score_spread":0.2242397910362371,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4404975185","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.022729075,0.002006895,0.972387,0.00064329227,0.00068459666,0.00014509722,0.00013512341,0.00018731554,0.0010815882],"genre_scores_gemma":[0.8443587,0.00008315118,0.15511976,0.00015015207,0.00011721237,0.000007866986,0.000014026341,0.000018805898,0.00013035395],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99849606,0.000053270312,0.00040158432,0.0004374717,0.0002778597,0.00033376072],"domain_scores_gemma":[0.99896365,0.00041877775,0.00008587967,0.0003105161,0.000058142232,0.00016301728],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00022946658,0.00019726428,0.00026084966,0.00019196422,0.0000763112,0.00022850897,0.00039927466,0.000072804265,0.00002566082],"category_scores_gemma":[0.000047591773,0.00018141727,0.000050345545,0.0003431171,0.000106671076,0.00045094543,0.0002447272,0.00013665794,0.0000344352],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000004236114,0.000021351785,0.000022885913,0.000077365024,0.00003525097,0.000036973765,0.0005661853,0.00002448877,0.00032401455,0.59711564,0.002257234,0.39951438],"study_design_scores_gemma":[0.00023972875,0.0001311369,0.0017056532,0.000065660635,0.000025792217,0.000052718955,0.000018718269,0.2607394,0.0006997218,0.7355823,0.00051547174,0.00022370573],"about_ca_topic_score_codex":0.000091076625,"about_ca_topic_score_gemma":0.000022172495,"teacher_disagreement_score":0.8216296,"about_ca_system_score_codex":0.000028711973,"about_ca_system_score_gemma":0.00020412513,"threshold_uncertainty_score":0.7397981},"labels":[],"label_agreement":null},{"id":"W4405498872","doi":"10.1103/physrevd.110.125018","title":"<mml:math xmlns:mml=\"http://www.w3.org/1998/Math/MathML\" display=\"inline\"> <mml:mrow> <mml:msup> <mml:mrow> <mml:mi>ϕ</mml:mi> </mml:mrow> <mml:mrow> <mml:mi>p</mml:mi> </mml:mrow> </mml:msup> </mml:mrow> </mml:math> amplitudes from the positive tropical Grassmannian: Triangulations of extended diagrams","year":2024,"lang":"en","type":"article","venue":"Physical review. D/Physical review. D.","topic":"Polynomial and algebraic computation","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo; Perimeter Institute","funders":"Science and Technology Facilities Council; Natural Sciences and Engineering Research Council of Canada; Ministry of Colleges and Universities; Canada Research Chairs; Government of Canada; Innovation, Science and Economic Development Canada; Institut Périmètre de physique théorique; Simons Foundation","keywords":"Computer science","score_opus":0.018249143857090616,"score_gpt":0.3113628999090186,"score_spread":0.293113756051928,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4405498872","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.77762014,0.018739006,0.011690484,0.00692702,0.0028313112,0.00023192102,0.0004925956,0.000508963,0.18095854],"genre_scores_gemma":[0.98196983,0.007403288,0.002114129,0.0028073397,0.0030815671,0.0013353975,0.0008618623,0.00034023772,0.00008636515],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99118084,0.00077654625,0.0019256532,0.0019569937,0.0024402614,0.0017196828],"domain_scores_gemma":[0.99126726,0.0036922395,0.0014836955,0.0024131392,0.00020425768,0.00093942153],"candidate_categories":["metaepi_narrow","scholarly_communication","insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.001172101,0.00087659515,0.000661549,0.0002136069,0.0009046621,0.0011745304,0.002756555,0.000693502,0.02479674],"category_scores_gemma":[0.0021910134,0.0012098867,0.0029642708,0.0017871805,0.0012458984,0.0015993346,0.0020078104,0.0015991905,0.0021377115],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00023086254,0.0005380991,0.000010755359,0.0020094076,0.00088055944,0.00036502708,0.00085436297,0.00022495433,0.0019144443,0.8877845,0.08108202,0.024104998],"study_design_scores_gemma":[0.0019149786,0.0024915584,0.0020055256,0.010763211,0.0037778656,0.000573479,0.00032040395,0.30671227,0.648377,0.0062244725,0.014210677,0.0026285278],"about_ca_topic_score_codex":0.0006415422,"about_ca_topic_score_gemma":0.00022049011,"teacher_disagreement_score":0.88156,"about_ca_system_score_codex":0.000023502227,"about_ca_system_score_gemma":0.0010557559,"threshold_uncertainty_score":0.9998624},"labels":[],"label_agreement":null},{"id":"W4405758514","doi":"10.1145/3709136","title":"Algorithm 1054: <tt>ellipFor</tt> , a Fortran Software Library for Legendre Elliptic Integrals and Jacobi Elliptic Functions with Generalized Input Arguments","year":2024,"lang":"en","type":"article","venue":"ACM Transactions on Mathematical Software","topic":"Polynomial and algebraic computation","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Saskatchewan","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Fortran; Legendre polynomials; Jacobi elliptic functions; Elliptic integral; Elliptic function; Mathematics; Software; Quarter period; Algebra over a field; Computer science; Applied mathematics; Elliptic curve; Pure mathematics; Programming language; Mathematical analysis","score_opus":0.016009860650394517,"score_gpt":0.24146536856018444,"score_spread":0.2254555079097899,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4405758514","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008141632,0.0004778189,0.986634,0.0015756037,0.00045489654,0.00095686124,0.00020246665,0.0015358983,0.000020801916],"genre_scores_gemma":[0.019946447,0.00008265735,0.97543705,0.00043924083,0.00014858006,0.0005189318,0.00008014511,0.00010007398,0.0032468545],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9975344,0.000065300905,0.0005525718,0.00086090254,0.00041148518,0.00057535555],"domain_scores_gemma":[0.99773234,0.0010539849,0.00007972968,0.00073547167,0.00006870223,0.0003297881],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00017608315,0.00046707576,0.00047098135,0.00031875365,0.00047850556,0.0006947156,0.0006826932,0.00017903866,0.00020977984],"category_scores_gemma":[0.000055441553,0.00036128412,0.00027540218,0.0007187426,0.00013709691,0.0012730914,0.000048141046,0.0003996269,0.00018130486],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005526866,0.00037193694,0.000014349115,0.0006411396,0.00030857505,0.00003169563,0.00087095716,0.00096837146,0.000044816537,0.006560056,0.00040570906,0.98972714],"study_design_scores_gemma":[0.0022016983,0.001454071,0.00011615323,0.0013221836,0.0005062104,0.0004096132,0.0001866541,0.1580492,0.0024118382,0.81715894,0.014803492,0.0013799547],"about_ca_topic_score_codex":0.000005954997,"about_ca_topic_score_gemma":0.000004380242,"teacher_disagreement_score":0.9883472,"about_ca_system_score_codex":0.00007161048,"about_ca_system_score_gemma":0.00016985701,"threshold_uncertainty_score":0.9998839},"labels":[],"label_agreement":null},{"id":"W4406662110","doi":"10.22331/q-2025-01-21-1604","title":"Linear gate bounds against natural functions for position-verification","year":2025,"lang":"en","type":"article","venue":"Quantum","topic":"Polynomial and algebraic computation","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Perimeter Institute; University of Waterloo","funders":"Institut Périmètre de physique théorique; Government of Canada; Ministry of Colleges and Universities; Innovation, Science and Economic Development Canada","keywords":"Position (finance); Natural (archaeology); Computer science; Mathematics; Business; Geology","score_opus":0.010901588106826171,"score_gpt":0.26030863742540206,"score_spread":0.24940704931857588,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4406662110","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06660576,0.0001285849,0.9247031,0.0051932097,0.0021089902,0.00018375367,0.0000064421733,0.00019869837,0.0008714592],"genre_scores_gemma":[0.9909253,0.000004440619,0.0060772244,0.00090495957,0.00012833354,0.00004073688,0.00006256575,0.0000038153403,0.0018526047],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99935806,0.000020414021,0.00016098446,0.00023218157,0.00007849599,0.00014985845],"domain_scores_gemma":[0.99951935,0.000081568665,0.00005169349,0.00022182059,0.00009508143,0.000030487816],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00010581775,0.00007688085,0.00007788653,0.000102048194,0.00026267293,0.000112231544,0.00024291892,0.000033793152,0.0000018366438],"category_scores_gemma":[0.000035264093,0.000073974705,0.00006652114,0.00032395133,0.000021810767,0.00027322915,0.00004691514,0.000067736546,0.00004200569],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000332755,0.00010850466,0.000054597338,0.000040050116,0.00004240715,0.0000015878516,0.00024245636,0.001084276,0.010999061,0.8293776,0.020337362,0.1376788],"study_design_scores_gemma":[0.00032468612,0.00004429936,0.0025779926,0.000022538432,0.000007698015,0.0000016613517,0.000015181239,0.9315634,0.0014445452,0.0322792,0.031602178,0.00011666409],"about_ca_topic_score_codex":0.00001055696,"about_ca_topic_score_gemma":0.00000460328,"teacher_disagreement_score":0.9304791,"about_ca_system_score_codex":0.000046397403,"about_ca_system_score_gemma":0.00010474279,"threshold_uncertainty_score":0.3016601},"labels":[],"label_agreement":null},{"id":"W4406691577","doi":"10.46298/lmcs-21(1:5)2025","title":"Complete and tractable machine-independent characterizations of second-order polytime","year":2025,"lang":"en","type":"article","venue":"Logical Methods in Computer Science","topic":"Polynomial and algebraic computation","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Order (exchange); Computer science; Finance; Business","score_opus":0.033764576946367635,"score_gpt":0.3425569021045388,"score_spread":0.3087923251581712,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4406691577","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.033548687,0.000103385864,0.96375924,0.0008376428,0.0006303894,0.00016701556,0.000003919778,0.00006111242,0.00088857935],"genre_scores_gemma":[0.3368652,0.000004892606,0.66246706,0.0005903562,0.000018027256,0.000005549776,8.0668434e-7,0.0000019035349,0.00004617145],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9980829,0.00024694868,0.00043929912,0.000641024,0.00025218882,0.00033766538],"domain_scores_gemma":[0.9986961,0.0005683399,0.0001221578,0.00039926672,0.000109520566,0.000104643004],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015737617,0.00014983346,0.00030662018,0.00041077158,0.00016917386,0.00020007008,0.0011814217,0.000058395777,0.000021035243],"category_scores_gemma":[0.0001302809,0.00012602651,0.000040068542,0.002156515,0.0003387204,0.0005995554,0.0010441871,0.00019359597,0.0000025350223],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000068047802,0.00015537524,0.0014018177,0.0000316932,0.000007105417,0.0000065253253,0.00036418447,0.00083551265,0.06348951,0.15032896,0.00001174586,0.7833608],"study_design_scores_gemma":[0.00032701125,0.0000791021,0.13936506,0.000041179366,0.0000025720926,0.000015543332,0.0000025892132,0.81173986,0.004281867,0.04352349,0.00046359605,0.00015812207],"about_ca_topic_score_codex":0.000029255305,"about_ca_topic_score_gemma":0.00000844928,"teacher_disagreement_score":0.8109044,"about_ca_system_score_codex":0.000043307,"about_ca_system_score_gemma":0.00016582916,"threshold_uncertainty_score":0.51392126},"labels":[],"label_agreement":null},{"id":"W4406874117","doi":"10.1016/j.jalgebra.2025.01.014","title":"On the arithmetic complexity of computing Gröbner bases of comaximal determinantal ideals","year":2025,"lang":"en","type":"article","venue":"Journal of Algebra","topic":"Polynomial and algebraic computation","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"European Office of Aerospace Research and Development; Agence Nationale de la Recherche","keywords":"Mathematics; Arithmetic; Algebra over a field; Pure mathematics","score_opus":0.02416527610934628,"score_gpt":0.2689396538621193,"score_spread":0.24477437775277305,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4406874117","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.857141,0.00009316776,0.13973986,0.0020035545,0.00042459305,0.00007500705,0.0000024108724,0.000009277026,0.0005111254],"genre_scores_gemma":[0.98992366,0.000003809151,0.009482671,0.0005136591,0.000054250726,2.917583e-7,2.5382067e-7,0.0000034967745,0.000017937247],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99846166,0.00016812285,0.00073819346,0.00012331296,0.000348497,0.00016021494],"domain_scores_gemma":[0.997713,0.0010294983,0.00075555855,0.00023818797,0.0002164377,0.000047291695],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007466612,0.00011654342,0.00036667302,0.00021857467,0.00009346558,0.000043876622,0.00082868827,0.000035027624,0.000012248036],"category_scores_gemma":[0.00021341248,0.00007569018,0.00019876884,0.0004007846,0.00020072205,0.00016584845,0.00021925566,0.00020064859,0.0000018867847],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012099672,0.00048083824,0.0017143458,0.00011472991,0.0001659594,0.000042965767,0.0008832364,0.00084057136,0.0084395,0.9032802,0.002877491,0.08103914],"study_design_scores_gemma":[0.0022844619,0.0017206888,0.18501978,0.0014554854,0.00010448993,0.00029014033,0.00022380904,0.16979653,0.12894458,0.50946003,0.0003236808,0.00037634542],"about_ca_topic_score_codex":0.00002717616,"about_ca_topic_score_gemma":0.0000040083887,"teacher_disagreement_score":0.3938202,"about_ca_system_score_codex":0.000030376683,"about_ca_system_score_gemma":0.00015716613,"threshold_uncertainty_score":0.3086556},"labels":[],"label_agreement":null},{"id":"W4407127179","doi":"10.1007/978-3-031-83438-7","title":"Algorithms and Discrete Applied Mathematics","year":2025,"lang":"en","type":"book","venue":"Lecture notes in computer science","topic":"Polynomial and algebraic computation","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Indian Statistical Institute; Univerza v Mariboru; Indian Institute of Technology Kharagpur; Akademia Górniczo-Hutnicza im. Stanislawa Staszica; Freie Universität Berlin; Indian Institute of Technology Delhi; Technische Universiteit Eindhoven; Indian Institute of Technology Bhilai; University of Ottawa; Indian Institute of Technology Gandhinagar; University of Lethbridge; Indian Institute of Technology Kanpur; Indian Institute of Science","keywords":"Computer science; Theoretical computer science; Algorithm; Computer graphics (images); Algebra over a field; Mathematics; Pure mathematics","score_opus":0.009227838638047612,"score_gpt":0.23569103056477958,"score_spread":0.22646319192673198,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4407127179","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000039159535,0.00031607307,0.9919056,0.0006416763,0.0011017023,0.0003491393,0.000003787144,0.00016715031,0.0054756827],"genre_scores_gemma":[0.009552091,0.000033928176,0.98735434,0.0012715977,0.0004393679,0.00001804103,0.000008102172,0.000018187966,0.0013043747],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99722505,0.000017938462,0.00042927483,0.001209829,0.0006034354,0.00051445497],"domain_scores_gemma":[0.9981873,0.00055783207,0.00019076887,0.00084543787,0.00008110402,0.00013754326],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00052581076,0.00041040799,0.00048410194,0.0006324357,0.00022450507,0.00066519505,0.0021664232,0.00021061316,0.0000026082269],"category_scores_gemma":[0.00005291173,0.00036007227,0.00006697853,0.00093928043,0.00045573965,0.00033008592,0.0019207967,0.00051517884,0.0000132280575],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000012684047,0.000020292762,0.0000025284887,0.000102881444,0.000007878227,0.000015874479,0.00085827714,0.0038697724,0.00006560915,0.026271151,0.0001287955,0.96865565],"study_design_scores_gemma":[0.00018906892,0.00004102682,0.000053917633,0.00026082218,0.000006360391,0.000021727215,1.491521e-7,0.6655709,0.00044803394,0.3322789,0.0007558814,0.0003731529],"about_ca_topic_score_codex":0.0000086573855,"about_ca_topic_score_gemma":0.000014617893,"teacher_disagreement_score":0.9682825,"about_ca_system_score_codex":0.00023367057,"about_ca_system_score_gemma":0.00096690893,"threshold_uncertainty_score":0.99988514},"labels":[],"label_agreement":null},{"id":"W4407294297","doi":"10.5802/aif.3697","title":"Abelian reduction in differential-algebraic and bimeromorphic geometry","year":2025,"lang":"en","type":"article","venue":"Annales de l’institut Fourier","topic":"Polynomial and algebraic computation","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Abelian group; Mathematics; Differential algebraic geometry; Reduction (mathematics); Differential (mechanical device); Algebra over a field; Algebraic number; Geometry; Pure mathematics; Physics; Mathematical analysis; Differential equation; Differential algebraic equation; Ordinary differential equation","score_opus":0.010270159262041108,"score_gpt":0.23794042714135288,"score_spread":0.22767026787931177,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4407294297","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8974348,0.0007783334,0.09633697,0.0032958805,0.00067165104,0.00013643272,0.0000015935876,0.000099285295,0.001245096],"genre_scores_gemma":[0.9955372,0.00012307776,0.003205629,0.00038067976,0.00008547151,0.000013654331,0.0000050318017,0.000004657135,0.0006445572],"study_design_codex":"design_other","study_design_gemma":"observational","domain_scores_codex":[0.9989589,0.000052570278,0.00021957447,0.00035511612,0.00012933405,0.00028448968],"domain_scores_gemma":[0.9995326,0.000039275757,0.000052791234,0.0002598821,0.00003243777,0.000083045226],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00016908912,0.00013896689,0.00016380553,0.00045626555,0.00013958916,0.0001512439,0.00030586953,0.00007953115,0.000012997154],"category_scores_gemma":[0.000042294905,0.00013656568,0.000044136897,0.00079410954,0.00010411024,0.0004196744,0.00018330022,0.00016623255,0.000020252357],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004353321,0.00027563822,0.012069734,0.00011881192,0.000090068286,0.000090342124,0.0013723269,0.0004968754,0.005119808,0.33972353,0.005294688,0.63530463],"study_design_scores_gemma":[0.003875148,0.00026073205,0.5267763,0.0007086233,0.00007526302,0.00027671453,0.00014393449,0.18864805,0.011534669,0.20373167,0.06262622,0.0013426916],"about_ca_topic_score_codex":0.000104221945,"about_ca_topic_score_gemma":0.000044850578,"teacher_disagreement_score":0.633962,"about_ca_system_score_codex":0.00005033013,"about_ca_system_score_gemma":0.00014744147,"threshold_uncertainty_score":0.55689865},"labels":[],"label_agreement":null},{"id":"W4407385828","doi":"10.1145/3717582.3717595","title":"Sparse Hensel Lifting Algorithms for Multivariate Polynomial Factorization","year":2024,"lang":"en","type":"article","venue":"ACM communications in computer algebra","topic":"Polynomial and algebraic computation","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Multivariate statistics; Factorization; Polynomial; Computer science; Algorithm; Mathematics; Machine learning","score_opus":0.06592509873222369,"score_gpt":0.330300286538179,"score_spread":0.2643751878059553,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4407385828","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.006387342,0.00076404994,0.98318964,0.0063787065,0.0018917501,0.0005495691,0.00001711734,0.000685834,0.00013600414],"genre_scores_gemma":[0.4900508,0.00004798326,0.5090595,0.000285239,0.00033537712,0.00009452818,0.00007092623,0.000022381746,0.000033251887],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.997953,0.00019357611,0.00061531767,0.00062139,0.00020326869,0.00041343182],"domain_scores_gemma":[0.9955709,0.0016893145,0.0001128362,0.0024100041,0.000116282645,0.00010066395],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0005764042,0.00025739276,0.0002627552,0.00043489583,0.00031914667,0.00067519874,0.003656414,0.0001194472,0.0000045452775],"category_scores_gemma":[0.00014417904,0.00026701624,0.00014249739,0.0009998532,0.000079096164,0.0009953475,0.0021252295,0.00033799466,0.000061943174],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008521557,0.00019530699,0.00022397244,0.000054940698,0.0000681887,0.000006984909,0.0038225653,0.0009695955,0.000617474,0.13531847,0.0025558872,0.8561581],"study_design_scores_gemma":[0.0005029995,0.00006783406,0.0022451887,0.00012810981,0.000010679295,0.00001521258,0.000011910633,0.9359017,0.00017828599,0.045506638,0.015107837,0.00032362062],"about_ca_topic_score_codex":0.00013943165,"about_ca_topic_score_gemma":0.00003881093,"teacher_disagreement_score":0.9349321,"about_ca_system_score_codex":0.00016344691,"about_ca_system_score_gemma":0.00019139446,"threshold_uncertainty_score":0.9999782},"labels":[],"label_agreement":null},{"id":"W4407385849","doi":"10.1145/3717582.3717588","title":"A Maple Program to Factor Multivariate Polynomials Given by Black Boxes","year":2024,"lang":"en","type":"article","venue":"ACM communications in computer algebra","topic":"Polynomial and algebraic computation","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Maple; Factor (programming language); Multivariate statistics; Mathematics; Multivariate analysis; Algebra over a field; Pure mathematics; Computer science; Statistics; Programming language; Botany; Biology","score_opus":0.03666088420154946,"score_gpt":0.32913825764884397,"score_spread":0.2924773734472945,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4407385849","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05176829,0.0014528399,0.88780665,0.05407129,0.0010883904,0.001487056,0.0000640277,0.0018427739,0.0004186855],"genre_scores_gemma":[0.6539025,0.000060222093,0.34457615,0.0008855144,0.0001217429,0.00019400108,0.000049166592,0.000027742755,0.00018298613],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9975869,0.00030074647,0.0006130132,0.00072477455,0.00027091528,0.00050366006],"domain_scores_gemma":[0.9952094,0.00094719045,0.00008339301,0.0034771136,0.00007785435,0.00020502426],"candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":[],"category_scores_codex":[0.00036257904,0.00030684858,0.0003249633,0.00043975128,0.00019868866,0.00096102874,0.006052217,0.00011059724,0.000020867172],"category_scores_gemma":[0.00008695211,0.00030472153,0.00013209287,0.00141653,0.00012495731,0.00076979323,0.0046461183,0.00040537576,0.000526865],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000006064152,0.00040613394,0.00016770215,0.000034767203,0.000067560904,0.000010073157,0.004518396,0.00024122234,0.0011254753,0.019243065,0.034044713,0.9401348],"study_design_scores_gemma":[0.00052885606,0.0002784463,0.0057991394,0.00026042428,0.000011739194,0.000016772352,0.000021049438,0.77484214,0.0007152761,0.02258821,0.19423464,0.0007033007],"about_ca_topic_score_codex":0.00030338985,"about_ca_topic_score_gemma":0.0000673575,"teacher_disagreement_score":0.93943155,"about_ca_system_score_codex":0.00017476731,"about_ca_system_score_gemma":0.00014921634,"threshold_uncertainty_score":0.9999405},"labels":[],"label_agreement":null},{"id":"W4407560818","doi":"10.4171/owr/2024/35","title":"Polynomial Optimization for Nonlinear Dynamics: Theory, Algorithms and Applications","year":2025,"lang":"en","type":"article","venue":"Oberwolfach Reports","topic":"Polynomial and algebraic computation","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"Agence Nationale de la Recherche; National Science Foundation","keywords":"Nonlinear system; Polynomial; Partial differential equation; Dynamical systems theory; Ordinary differential equation; Computer science; Mathematics; Applied mathematics; Algebraic number; Algebra over a field; Mathematical optimization; Differential equation; Mathematical analysis; Pure mathematics","score_opus":0.006668857016302725,"score_gpt":0.24533160858206116,"score_spread":0.23866275156575842,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4407560818","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0011063366,0.00016023363,0.9949289,0.0008381632,0.0004010513,0.0005541556,0.0000075791204,0.00015228675,0.0018512823],"genre_scores_gemma":[0.24567418,0.000036229103,0.74709547,0.00088142656,0.0005587623,0.00069935713,0.00028305876,0.000029202858,0.004742298],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989549,0.000025834248,0.00032379807,0.00042535944,0.00009454793,0.00017558258],"domain_scores_gemma":[0.9992202,0.0001253417,0.00014646086,0.0003565707,0.000090932255,0.0000604886],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003429027,0.0001160385,0.00013885122,0.000114869734,0.00021659896,0.00015636721,0.0001761239,0.00006420058,0.000003793597],"category_scores_gemma":[0.000051781117,0.000113834874,0.000053866217,0.0002608218,0.000041737494,0.00022746986,0.00014276656,0.00006059946,0.0000013398254],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010357995,0.00008539574,0.00035408745,0.000038579823,0.000038030466,0.000008873747,0.00008119611,0.0066351276,0.00004494354,0.062669374,0.0017270936,0.92830694],"study_design_scores_gemma":[0.0002248903,0.000027201433,0.00044382713,0.000012997339,0.000017770535,0.000050909264,0.000012604377,0.9523568,0.00026546617,0.023552934,0.02288893,0.00014568334],"about_ca_topic_score_codex":0.000019800344,"about_ca_topic_score_gemma":0.000008112468,"teacher_disagreement_score":0.9457217,"about_ca_system_score_codex":0.000057251855,"about_ca_system_score_gemma":0.00011876926,"threshold_uncertainty_score":0.46420515},"labels":[],"label_agreement":null},{"id":"W4407603218","doi":"10.32388/1ublln","title":"Review of: \"Evaluation of Bfloat16, Posit, and Takum Arithmetics in Sparse Linear Solvers\"","year":2025,"lang":"en","type":"peer-review","venue":"","topic":"Polynomial and algebraic computation","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Montréal; Polytechnique Montréal","funders":"","keywords":"Arithmetic; Computer science; Parallel computing; Mathematics","score_opus":0.04667295702005062,"score_gpt":0.3322382990068492,"score_spread":0.28556534198679856,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4407603218","genre_codex":"review","genre_gemma":"review","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"review","genre_consensus":"review","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00006086072,0.9047334,0.051168952,0.03145215,0.0017652255,0.0017200027,0.000059767335,0.000043864668,0.008995785],"genre_scores_gemma":[0.00060488004,0.88670033,0.071380004,0.016684508,0.00026173878,0.000093693874,0.000489767,0.000026209196,0.023758844],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9976514,0.00026814343,0.0008641119,0.000413502,0.0006445899,0.00015822554],"domain_scores_gemma":[0.99811894,0.0001822144,0.00047165016,0.0005039727,0.00067382795,0.00004936835],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0022905113,0.00021565327,0.00080644846,0.00024005928,0.00001922893,0.000015613978,0.00047096424,0.00011910068,0.00008229598],"category_scores_gemma":[0.00044129218,0.00019052335,0.00013328684,0.000720792,0.00004557023,0.0001256201,0.00039359822,0.00020494223,0.0000058705423],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000020951347,0.00010635824,0.000009037486,0.0584472,0.000047902846,0.0000023597206,0.00005252598,0.00004631709,0.000013499896,0.003815147,0.4660169,0.47144067],"study_design_scores_gemma":[0.0010875601,0.00018990302,0.00030223944,0.2661328,0.00080904487,0.000017047387,0.0000044717194,0.12797718,0.00048328802,0.005444752,0.5968465,0.0007051959],"about_ca_topic_score_codex":0.0002499066,"about_ca_topic_score_gemma":0.00008085663,"teacher_disagreement_score":0.4707355,"about_ca_system_score_codex":0.0000612372,"about_ca_system_score_gemma":0.00073340494,"threshold_uncertainty_score":0.7769317},"labels":[],"label_agreement":null},{"id":"W4407870734","doi":"10.5206/mt.v5i1.21229","title":"Implementing Kaltofen and Yagati's fast transposed Vandermonde solver","year":2025,"lang":"en","type":"article","venue":"Maple Transactions","topic":"Polynomial and algebraic computation","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":true,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Vandermonde matrix; Computer science; Solver; Parallel computing; Arithmetic; Mathematics; Programming language; Physics","score_opus":0.008216937398284021,"score_gpt":0.2335388498091797,"score_spread":0.22532191241089566,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4407870734","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.018802637,0.000075183896,0.9753106,0.0028605745,0.00025824885,0.00013361704,0.000007376183,0.0001755285,0.0023761995],"genre_scores_gemma":[0.9891033,0.000012742861,0.0092135025,0.00033899897,0.000020361595,0.000017391309,0.000003855573,0.000004561185,0.0012852445],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991444,0.00002893101,0.00018734783,0.0002639816,0.00010016992,0.0002751696],"domain_scores_gemma":[0.99963963,0.00007202393,0.000027710637,0.00017816982,0.000024722412,0.000057724123],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00012354,0.00010461656,0.00011140979,0.00012642102,0.0003972714,0.00012435656,0.00021268315,0.000035335524,0.000053823085],"category_scores_gemma":[0.0000019231702,0.00010570368,0.00006106602,0.00033052327,0.000029774754,0.00031405094,0.000017116647,0.00010566817,0.000007373407],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000012842867,0.00011164529,0.00029137052,0.00006684218,0.00010440546,0.0000059425306,0.0028047138,0.00063172035,0.010042964,0.03535296,0.0005712119,0.9500034],"study_design_scores_gemma":[0.007591473,0.00025528955,0.07331946,0.00020558969,0.0002834994,0.000051301897,0.0010779558,0.6007349,0.054872803,0.09975767,0.16023865,0.0016114046],"about_ca_topic_score_codex":0.000093582996,"about_ca_topic_score_gemma":0.00026883345,"teacher_disagreement_score":0.97030073,"about_ca_system_score_codex":0.000022083637,"about_ca_system_score_gemma":0.00005690399,"threshold_uncertainty_score":0.43104708},"labels":[],"label_agreement":null},{"id":"W4407951085","doi":"10.1109/synasc65383.2024.00016","title":"Comprehensive LU Decomposition and True Path","year":2024,"lang":"en","type":"article","venue":"","topic":"Polynomial and algebraic computation","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"","keywords":"Decomposition; Path (computing); Computer science; Computer network; Chemistry","score_opus":0.010705369406720544,"score_gpt":0.2561249174168412,"score_spread":0.24541954801012064,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4407951085","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.24112993,0.0006458528,0.7533589,0.0017400236,0.00046327678,0.000059648253,8.38311e-7,0.00034162955,0.0022599162],"genre_scores_gemma":[0.98415637,0.000016204043,0.015147002,0.00041856425,0.00006543477,0.0000027320632,0.0000021261314,0.0000027512956,0.0001887868],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99955374,0.000016641905,0.00007677472,0.00019598925,0.0000687636,0.000088100714],"domain_scores_gemma":[0.9997711,0.000073102536,0.000008006628,0.00008726534,0.000015632731,0.000044902805],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00003239094,0.000057651596,0.000054465516,0.000052297793,0.00004841598,0.00022928684,0.000101095764,0.0000178125,0.000009447573],"category_scores_gemma":[0.0000013486016,0.000046710822,0.000020967347,0.00013447371,0.000014676309,0.0003062517,0.00009118406,0.00004348377,0.00005468169],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000017863657,0.000013189539,0.000032163356,0.000032743003,0.000012229723,0.000030989613,0.00051582145,0.00003879319,0.0042843525,0.3638317,0.0029629818,0.62824327],"study_design_scores_gemma":[0.0001762528,0.000090767404,0.009394765,0.00004704637,0.000004922683,0.000110490546,0.000033647928,0.9074857,0.002287411,0.064646736,0.01553295,0.00018928514],"about_ca_topic_score_codex":0.000018336259,"about_ca_topic_score_gemma":0.0000015030475,"teacher_disagreement_score":0.9074469,"about_ca_system_score_codex":0.000011153375,"about_ca_system_score_gemma":0.000018452267,"threshold_uncertainty_score":0.22110184},"labels":[],"label_agreement":null},{"id":"W4408892537","doi":"10.61091/jcmcc125-12","title":"Minimum and maximum strong diameters of the Cartesian and strong products of cycles","year":2025,"lang":"en","type":"article","venue":"Journal of Combinatorial Mathematics and Combinatorial Computing","topic":"Polynomial and algebraic computation","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Cartesian product; Cartesian coordinate system; Mathematics; Geometry; Combinatorics","score_opus":0.01058884917322312,"score_gpt":0.23768347061789058,"score_spread":0.22709462144466747,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4408892537","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9768084,0.00060328556,0.015742239,0.00052070623,0.0058802366,0.00023105193,0.0000013356591,0.000011758596,0.00020097461],"genre_scores_gemma":[0.9939248,0.00002027288,0.0058417525,0.000011051398,0.00018978892,6.084028e-7,1.3383946e-7,0.000007964843,0.000003654898],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99819195,0.000117721494,0.00089694717,0.00020690329,0.00038287422,0.00020358738],"domain_scores_gemma":[0.997703,0.0005982023,0.0010237361,0.00026074992,0.00033294168,0.00008133652],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009083273,0.00019280025,0.0005962695,0.00017734662,0.00016700829,0.00013000444,0.00050613564,0.000079428355,2.6433008e-7],"category_scores_gemma":[0.00034283762,0.00014577183,0.00009271463,0.00038420205,0.00019278786,0.0002309923,0.0005715334,0.00024045297,4.0119232e-8],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003375003,0.0002209158,0.0012112497,0.00046986336,0.00011255174,0.000002374908,0.0016386777,0.000033982113,0.002415889,0.97946686,0.000058311016,0.01433558],"study_design_scores_gemma":[0.0043885647,0.0007132446,0.006391406,0.0011882571,0.000159438,0.000056293473,0.0005782662,0.026416026,0.011727471,0.94799596,0.00009377944,0.0002912824],"about_ca_topic_score_codex":0.000014447048,"about_ca_topic_score_gemma":4.6341987e-7,"teacher_disagreement_score":0.031470884,"about_ca_system_score_codex":0.000027675873,"about_ca_system_score_gemma":0.00018078845,"threshold_uncertainty_score":0.5944403},"labels":[],"label_agreement":null},{"id":"W4409164950","doi":"10.1007/jhep04(2025)030","title":"The CEGM NLSM","year":2025,"lang":"en","type":"article","venue":"Journal of High Energy Physics","topic":"Polynomial and algebraic computation","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Institut Périmètre de physique théorique; European Commission","keywords":"Physics; Particle physics; Mathematical physics; Theoretical physics; Quantum electrodynamics","score_opus":0.00626229319974875,"score_gpt":0.21605148701549215,"score_spread":0.2097891938157434,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4409164950","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0072156973,0.00038769946,0.9862688,0.003359716,0.0014785237,0.000008074817,1.4752575e-7,0.000013034694,0.0012682931],"genre_scores_gemma":[0.99609345,0.000077561795,0.0023186854,0.0005065809,0.00036444288,5.28445e-7,1.400466e-7,0.0000020723394,0.0006365517],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994341,0.00003613897,0.00019980466,0.00006450152,0.00016029351,0.00010515327],"domain_scores_gemma":[0.9993703,0.00015743179,0.00017159426,0.0001584907,0.000111448295,0.000030776915],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00012172499,0.00005732971,0.00009628143,0.000031182215,0.00014115803,0.00011507751,0.00059392635,0.000016371165,4.0667564e-7],"category_scores_gemma":[0.000013103259,0.000035292825,0.00007990618,0.0002668888,0.000024862084,0.00024100626,0.00010404403,0.00008689665,0.0000018998257],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000003072084,0.000014716907,0.000004545448,6.8357764e-7,0.000017164102,0.0000026822952,0.000019335532,0.00064774574,0.00004231653,0.72587484,0.0028721252,0.2705008],"study_design_scores_gemma":[0.00020827103,0.00004203595,0.0007053787,0.000017415072,0.0000067472934,0.0000053058475,0.0000042603797,0.004264452,0.0052522104,0.9357414,0.053703647,0.00004884929],"about_ca_topic_score_codex":0.00001830669,"about_ca_topic_score_gemma":0.0000032032747,"teacher_disagreement_score":0.9888777,"about_ca_system_score_codex":0.000026261861,"about_ca_system_score_gemma":0.00012532335,"threshold_uncertainty_score":0.14391997},"labels":[],"label_agreement":null},{"id":"W4409329991","doi":"10.1112/plms.70039","title":"Counting integral points on symmetric varieties with applications to arithmetic statistics","year":2025,"lang":"en","type":"article","venue":"Proceedings of the London Mathematical Society","topic":"Polynomial and algebraic computation","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"Natural Sciences and Engineering Research Council of Canada; Alfred P. Sloan Foundation; National Science Foundation","keywords":"Mathematics; Arithmetic; Statistics","score_opus":0.009534283544957356,"score_gpt":0.24062564817526996,"score_spread":0.2310913646303126,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4409329991","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.025836006,0.000013894671,0.9660473,0.0038883106,0.00005039743,0.00049573526,0.0000046606156,0.00008512434,0.003578557],"genre_scores_gemma":[0.5493857,0.000002844937,0.44854885,0.0012866698,0.0000310735,0.000097807184,5.300901e-7,0.000009348386,0.00063711905],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989174,0.0000041066523,0.00026596338,0.0002489999,0.0003606921,0.00020281575],"domain_scores_gemma":[0.9990792,0.00031379936,0.00013658516,0.00015669482,0.000259194,0.000054492357],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003320039,0.00013195498,0.00019988604,0.00006469326,0.0001797556,0.00016062781,0.0007792363,0.000045005272,0.0000032226424],"category_scores_gemma":[0.00020573522,0.00008218663,0.00008896651,0.0013232505,0.00009707973,0.000119073855,0.0003298727,0.00017611278,0.000014896014],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000004910181,0.00009451835,0.00014448151,0.00020233424,0.000027947599,2.979402e-8,0.0004997766,0.000015582362,0.00026209262,0.9893053,0.0022214549,0.0072215437],"study_design_scores_gemma":[0.0003150236,0.00011825271,0.001798957,0.00026955217,0.000044209864,0.0000037844275,0.0002198779,0.060787063,0.0069497367,0.9285409,0.0007732613,0.00017936602],"about_ca_topic_score_codex":0.000004773033,"about_ca_topic_score_gemma":2.839161e-7,"teacher_disagreement_score":0.52354974,"about_ca_system_score_codex":0.000068286245,"about_ca_system_score_gemma":0.00005153918,"threshold_uncertainty_score":0.33514735},"labels":[],"label_agreement":null},{"id":"W4410634726","doi":"10.1080/10236198.2025.2509780","title":"Hypergeometric accelerations with shifted indices","year":2025,"lang":"en","type":"article","venue":"The Journal of Difference Equations and Applications","topic":"Polynomial and algebraic computation","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Dalhousie University","funders":"Killam Trusts","keywords":"Hypergeometric function; Mathematics; Mathematical analysis","score_opus":0.014808746975443302,"score_gpt":0.24744517136013075,"score_spread":0.23263642438468746,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4410634726","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09450241,0.00035006597,0.90081894,0.0035502096,0.00003220414,0.00014072238,0.0000015781593,0.000016341095,0.000587498],"genre_scores_gemma":[0.99421334,0.00008317811,0.0052224463,0.0001749356,0.000041411542,0.0000252423,0.0000012514334,0.00000181758,0.00023637012],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"observational","domain_scores_codex":[0.9994119,0.00004590627,0.00023624509,0.00008134111,0.00013829177,0.000086350294],"domain_scores_gemma":[0.9988395,0.00056314864,0.0001928694,0.00019507464,0.00016706524,0.000042345077],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00022070708,0.00006774554,0.000097240176,0.00028265166,0.00039012893,0.00013698338,0.00046705146,0.000019957783,0.0000037843645],"category_scores_gemma":[0.000038114504,0.000039208157,0.000021826443,0.0013647152,0.000063706546,0.00023244804,0.00006543285,0.000119664954,0.000002499997],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000007008353,0.00012720525,0.0008569325,0.000007815921,0.000052150925,2.518331e-7,0.00066542975,0.0006199938,0.0008602838,0.73538554,0.00008583669,0.2613316],"study_design_scores_gemma":[0.0021092314,0.0005976535,0.43056569,0.00020422027,0.0003943934,0.00010639441,0.0009868324,0.12873231,0.0026046056,0.42006344,0.013068562,0.0005666539],"about_ca_topic_score_codex":0.000011440146,"about_ca_topic_score_gemma":0.000014025365,"teacher_disagreement_score":0.89971095,"about_ca_system_score_codex":0.000015518244,"about_ca_system_score_gemma":0.0001414856,"threshold_uncertainty_score":0.3000596},"labels":[],"label_agreement":null},{"id":"W4411003246","doi":"10.1137/24m1701022","title":"A Bounded Diameter Strengthening of Kőnig’s Theorem","year":2025,"lang":"en","type":"article","venue":"SIAM Journal on Discrete Mathematics","topic":"Polynomial and algebraic computation","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"European Research Council; Natural Sciences and Engineering Research Council of Canada; Agencia Nacional de Investigación y Desarrollo; Fondo Nacional de Desarrollo Científico y Tecnológico; National Science Foundation","keywords":"Mathematics; Bounded function; Discrete mathematics; Combinatorics; Bounded inverse theorem; Bounded operator; Mathematical analysis","score_opus":0.011800303759493544,"score_gpt":0.2605877890637624,"score_spread":0.24878748530426886,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4411003246","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11035492,0.00007511379,0.8752127,0.000995569,0.00044715736,0.0000973735,0.0000019384076,0.000049785805,0.012765393],"genre_scores_gemma":[0.90046,0.000013786855,0.09877639,0.00020513189,0.000054114862,0.000002395038,5.233696e-7,0.000008031343,0.00047961783],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99875873,0.00007060799,0.0005057002,0.0001508095,0.00030481795,0.000209341],"domain_scores_gemma":[0.9988459,0.00036232514,0.00031621143,0.00032701116,0.00007556126,0.00007302338],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004905702,0.0001426602,0.00025927115,0.0002158401,0.00013220121,0.0002150231,0.0006699902,0.000043580312,0.000019108322],"category_scores_gemma":[0.00016658154,0.00010358959,0.00016177677,0.00031740582,0.00005468509,0.00022290541,0.00014839451,0.0002250238,0.000012583677],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001055916,0.00011629247,0.00002663558,0.00006876957,0.000078787445,0.000010801417,0.0023800025,0.00022153411,0.0006138033,0.9590803,0.00045275287,0.036939785],"study_design_scores_gemma":[0.0005833173,0.00018559885,0.00025762714,0.0005761203,0.000025797393,0.000046313548,0.00024543313,0.08938535,0.005688573,0.902206,0.0006154249,0.00018444247],"about_ca_topic_score_codex":0.0000010876169,"about_ca_topic_score_gemma":7.415234e-7,"teacher_disagreement_score":0.7901051,"about_ca_system_score_codex":0.00004216839,"about_ca_system_score_gemma":0.00010144246,"threshold_uncertainty_score":0.42242607},"labels":[],"label_agreement":null},{"id":"W4411081002","doi":"10.1007/s00010-025-01177-2","title":"On the minimal polynomials of the arguments of dilogarithm ladders","year":2025,"lang":"en","type":"article","venue":"Aequationes Mathematicae","topic":"Polynomial and algebraic computation","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Dalhousie University","funders":"Killam Trusts","keywords":"Mathematics; Combinatorics; Algebra over a field; Pure mathematics","score_opus":0.01611193566242591,"score_gpt":0.24776402278727974,"score_spread":0.23165208712485383,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4411081002","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5757446,0.000043041167,0.39639917,0.014291006,0.00050532835,0.0005946947,0.0000056139424,0.00004415892,0.0123723755],"genre_scores_gemma":[0.99629253,0.0000010205966,0.0028872483,0.00035304268,0.000009954482,0.000015987604,4.7752116e-7,0.0000025962916,0.0004371615],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991135,0.000087419685,0.00033700047,0.00012537205,0.00023966249,0.00009702391],"domain_scores_gemma":[0.99817836,0.0010682556,0.00023219337,0.0004495536,0.000058646532,0.000012999265],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00034886558,0.00007891141,0.00014466286,0.000061433064,0.00009228021,0.000026345358,0.0006980051,0.000025872188,0.000026544265],"category_scores_gemma":[0.00036497012,0.000042790147,0.0000841347,0.00037414854,0.00008709624,0.00008670655,0.00017730104,0.00004991476,0.000017567108],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000044228564,0.00009047096,0.000041571566,0.000029312027,0.000029434663,6.789781e-8,0.0005471167,0.000075204145,0.0011047479,0.991563,0.0010912471,0.005423361],"study_design_scores_gemma":[0.00043090628,0.00006746877,0.008943286,0.0002597802,0.0000322521,0.0000012705888,0.00014047942,0.053099353,0.051418014,0.8853373,0.00015392526,0.00011598049],"about_ca_topic_score_codex":0.000012475073,"about_ca_topic_score_gemma":0.0000024488486,"teacher_disagreement_score":0.4205479,"about_ca_system_score_codex":0.000013800845,"about_ca_system_score_gemma":0.00007185921,"threshold_uncertainty_score":0.17449315},"labels":[],"label_agreement":null},{"id":"W4411133433","doi":"10.1093/imrn/rnaf149","title":"A Finiteness Result for Common Zeros of Iterates of Rational Functions","year":2025,"lang":"en","type":"article","venue":"International Mathematics Research Notices","topic":"Polynomial and algebraic computation","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Iterated function; Pure mathematics; Rational function; Mathematical analysis","score_opus":0.08386227359725505,"score_gpt":0.410660755740705,"score_spread":0.3267984821434499,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4411133433","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.23576745,0.00005730569,0.75520116,0.0030477836,0.000531024,0.00037262682,0.00010194227,0.0000290571,0.0048916764],"genre_scores_gemma":[0.9594608,0.0000039982533,0.03912317,0.000025504198,0.00004506117,0.000057706784,0.000027904267,0.0000035807473,0.0012522608],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986665,0.000056970417,0.00044581393,0.0001704454,0.0005258399,0.00013439964],"domain_scores_gemma":[0.99563944,0.0027775806,0.00016560157,0.00021864654,0.0011717714,0.000026963844],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000848402,0.00006774719,0.00015322777,0.00044374226,0.00009374352,0.000108599634,0.0008209704,0.00003642979,0.000014686329],"category_scores_gemma":[0.00085504726,0.000059783157,0.00006970518,0.0004161839,0.00010611196,0.0002923965,0.00024442378,0.00008914913,0.0000062072454],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000044478456,0.00042421021,0.00030211394,0.0002464533,0.00009754547,5.1449047e-7,0.0006876756,0.0019261242,0.0070347167,0.97991514,0.0013119446,0.008009072],"study_design_scores_gemma":[0.00064265705,0.00013058206,0.0022563487,0.00031801086,0.000008484,0.0000011804096,0.00013220514,0.5626152,0.026527597,0.40538314,0.0018972855,0.00008728815],"about_ca_topic_score_codex":0.000033551736,"about_ca_topic_score_gemma":0.000014527073,"teacher_disagreement_score":0.7236934,"about_ca_system_score_codex":0.000033792407,"about_ca_system_score_gemma":0.0001699388,"threshold_uncertainty_score":0.24378863},"labels":[],"label_agreement":null},{"id":"W4411771305","doi":"10.5539/jmr.v17n2p50","title":"Subtraction Trees Express Factorial n! as Function of Polynomial x_n","year":2025,"lang":"en","type":"article","venue":"Journal of Mathematics Research","topic":"Polynomial and algebraic computation","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Factorial; Subtraction; Polynomial; Combinatorics; Function (biology); Factorial experiment; Statistics; Arithmetic; Mathematical analysis","score_opus":0.05547826851465961,"score_gpt":0.3670145681300679,"score_spread":0.3115362996154083,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4411771305","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.49887657,0.00012466196,0.49557662,0.0006544766,0.0018951327,0.00013036041,9.314722e-7,0.000015465563,0.0027257607],"genre_scores_gemma":[0.9893878,0.00003469715,0.009429924,0.000010600601,0.0004242295,0.000001812997,3.323486e-7,0.0000049334817,0.00070568046],"study_design_codex":"bench_or_experimental","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9980379,0.000172564,0.0005899284,0.00011833967,0.0008803812,0.00020094168],"domain_scores_gemma":[0.99792814,0.00081028766,0.00033811314,0.0002349431,0.0006143226,0.00007421463],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001970193,0.00008215834,0.0002395128,0.0006182752,0.00011687596,0.0001366297,0.0006417571,0.00007610241,0.000024397259],"category_scores_gemma":[0.00041157968,0.00006590881,0.0001226235,0.0005135398,0.00005918033,0.0005570159,0.00012881782,0.0003800018,0.00001428553],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00094468583,0.0028427814,0.00034162143,0.0007103391,0.00051453884,0.000052495252,0.009250658,0.0013867883,0.39339614,0.2530945,0.052119214,0.28534624],"study_design_scores_gemma":[0.006042666,0.003793876,0.011438667,0.0014494224,0.000115128845,0.00018671989,0.0025487181,0.06195637,0.23818402,0.6333215,0.04038177,0.0005811112],"about_ca_topic_score_codex":0.00003486794,"about_ca_topic_score_gemma":0.000006943498,"teacher_disagreement_score":0.4905112,"about_ca_system_score_codex":0.00009425087,"about_ca_system_score_gemma":0.00048274445,"threshold_uncertainty_score":0.26876834},"labels":[],"label_agreement":null},{"id":"W4411851694","doi":"10.1007/978-3-031-76568-1_2","title":"Division, Factors, Primes, Congruences, GCD, etc.","year":2025,"lang":"en","type":"book-chapter","venue":"CMS/CAIMS books in mathematics","topic":"Polynomial and algebraic computation","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary; University of Ottawa; Mount Royal University","funders":"","keywords":"Congruence relation; Division (mathematics); Arithmetic; Mathematics; Combinatorics","score_opus":0.01983452406612118,"score_gpt":0.24429953567625462,"score_spread":0.22446501161013344,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4411851694","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0003547787,0.001318816,0.19857651,0.00037010535,0.0018761066,0.0009839239,0.00004458581,0.0004985576,0.79597664],"genre_scores_gemma":[0.0082617635,0.00016077115,0.051993467,0.00043500104,0.00019889585,0.00003125418,0.00007539541,0.00008450254,0.93875897],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9970792,0.000033360993,0.0010217346,0.0007825481,0.0006274592,0.0004556984],"domain_scores_gemma":[0.9973807,0.0006377943,0.00052840024,0.0011634962,0.00013839605,0.00015123723],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0004177442,0.0006276102,0.0008436735,0.00045952442,0.00014622403,0.00031455467,0.0018499345,0.0004393719,0.000086321554],"category_scores_gemma":[0.00013211953,0.00056225236,0.00023744126,0.00012070583,0.0001526192,0.00028380743,0.00092203455,0.00064881885,0.00014532333],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000014239745,0.00005507674,0.000025202524,0.00025915098,0.000047385376,0.000035251138,0.001035305,0.000025518877,0.000012858085,0.96918625,0.009999451,0.019317148],"study_design_scores_gemma":[0.000346161,0.00006501343,0.00008925228,0.0015489488,0.00003367161,0.000009713623,0.000020785925,0.011584378,0.00019502974,0.896333,0.08899042,0.0007836602],"about_ca_topic_score_codex":0.000033832308,"about_ca_topic_score_gemma":0.00003991814,"teacher_disagreement_score":0.14658304,"about_ca_system_score_codex":0.00021013041,"about_ca_system_score_gemma":0.00048625618,"threshold_uncertainty_score":0.9996829},"labels":[],"label_agreement":null},{"id":"W4411858298","doi":"10.1007/978-3-031-76568-1_11","title":"Primality","year":2025,"lang":"en","type":"book-chapter","venue":"CMS/CAIMS books in mathematics","topic":"Polynomial and algebraic computation","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary; University of Ottawa; Mount Royal University","funders":"","keywords":"Primality test; Computer science; Mathematics; Prime (order theory); Combinatorics","score_opus":0.02209715015484251,"score_gpt":0.24738253288304884,"score_spread":0.22528538272820633,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4411858298","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000031686508,0.00026068965,0.17333534,0.00026173878,0.0005440163,0.00037004123,0.000008596371,0.00021652259,0.8249714],"genre_scores_gemma":[0.000775198,0.000048846836,0.083234794,0.00044897074,0.00016679488,0.000023218468,0.000012710888,0.000038176513,0.9152513],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99801385,0.000020143398,0.00072962214,0.0005476274,0.00038313406,0.0003056421],"domain_scores_gemma":[0.9982074,0.00029730785,0.00032496912,0.0010080617,0.00007884712,0.000083413],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0004151195,0.00039192435,0.00058068946,0.00029541957,0.00007451303,0.00017045015,0.0012496554,0.00029720695,0.00004683084],"category_scores_gemma":[0.0000641936,0.0003849046,0.00018345888,0.000072584495,0.00008583797,0.00016415697,0.0007002723,0.00047432323,0.00018404481],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000001308333,0.00003368856,0.0000015954198,0.0002483799,0.000021794238,0.000025926684,0.00041050246,0.000011224312,0.000006907892,0.9692156,0.0034078385,0.026615284],"study_design_scores_gemma":[0.00020632519,0.00002583016,0.000015406036,0.00068678765,0.000018410803,0.000010750369,0.0000041460257,0.01463703,0.00007590415,0.93052167,0.053402133,0.00039558508],"about_ca_topic_score_codex":0.0000069486127,"about_ca_topic_score_gemma":0.0000180553,"teacher_disagreement_score":0.09027992,"about_ca_system_score_codex":0.00018377182,"about_ca_system_score_gemma":0.0002966146,"threshold_uncertainty_score":0.9998603},"labels":[],"label_agreement":null},{"id":"W4411859050","doi":"10.1007/978-3-031-76568-1_19","title":"The Pell Equation","year":2025,"lang":"en","type":"book-chapter","venue":"CMS/CAIMS books in mathematics","topic":"Polynomial and algebraic computation","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary; University of Ottawa; Mount Royal University","funders":"","keywords":"Mathematics","score_opus":0.027158590858969718,"score_gpt":0.24141959123379228,"score_spread":0.21426100037482257,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4411859050","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000011185898,0.0005203944,0.28216568,0.0006294931,0.0007365681,0.00039607007,0.0000033518997,0.00012961484,0.7154076],"genre_scores_gemma":[0.00073305785,0.00016029454,0.022522422,0.00024966567,0.00018739214,0.000026577998,0.000009398245,0.000032113443,0.9760791],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99826264,0.000024726942,0.0006519298,0.0003843957,0.00039852448,0.00027779854],"domain_scores_gemma":[0.9977826,0.00084583956,0.00035036643,0.0008806637,0.00008726209,0.00005326815],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005592748,0.0003111309,0.00033893154,0.00018639489,0.0001869927,0.00030605873,0.001271477,0.00021089386,0.000015859063],"category_scores_gemma":[0.00010337769,0.00024007045,0.00014484492,0.00007059091,0.00009285274,0.00013841855,0.00047680506,0.00040407255,0.00022482955],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000012745265,0.000013138796,3.6803988e-7,0.00007150168,0.00001637534,0.0000069317566,0.00045736725,0.00003645657,0.00000417865,0.9385332,0.0043541854,0.05650504],"study_design_scores_gemma":[0.00013440914,0.000021144138,0.0000032652536,0.00036569554,0.000013867619,0.000004900747,0.0000096767435,0.08317327,0.000039585313,0.8394619,0.07654129,0.00023100269],"about_ca_topic_score_codex":0.000004671587,"about_ca_topic_score_gemma":0.000026233965,"teacher_disagreement_score":0.26067144,"about_ca_system_score_codex":0.00014528603,"about_ca_system_score_gemma":0.00023091705,"threshold_uncertainty_score":0.97897893},"labels":[],"label_agreement":null},{"id":"W4412039806","doi":"10.1007/s44426-025-00006-y","title":"The algebraic matroid of the Heron variety","year":2025,"lang":"en","type":"article","venue":"Acta Universitatis Sapientiae Mathematica","topic":"Polynomial and algebraic computation","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"Natural Sciences and Engineering Research Council of Canada; Alexander von Humboldt-Stiftung","keywords":"Heron; Matroid; Mathematics; Variety (cybernetics); Combinatorics; Statistics; Geology","score_opus":0.0038967726850554427,"score_gpt":0.19671464855937393,"score_spread":0.19281787587431848,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4412039806","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.19724795,0.00036484003,0.74127275,0.023369892,0.0015699208,0.0007284887,0.000008950138,0.00019906543,0.035238124],"genre_scores_gemma":[0.987562,0.000011521221,0.009447187,0.00014826261,0.000008849901,0.0000027066242,7.9760025e-7,0.0000044419785,0.0028142612],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99903,0.00009531795,0.0002271092,0.00020099337,0.00024229777,0.0002042963],"domain_scores_gemma":[0.99847937,0.0005636292,0.00016722368,0.00067752204,0.00007887418,0.000033370256],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00022900735,0.000112158275,0.00013792411,0.00006372127,0.00045960737,0.00010833358,0.0015402607,0.00003767447,0.00002162074],"category_scores_gemma":[0.000078437246,0.00006905373,0.00012813523,0.0006481869,0.00015833828,0.0002568845,0.0006672347,0.00010381995,0.0000194958],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000051877214,0.000051683142,0.000046961417,0.000040945994,0.00007713794,0.0000010300798,0.0015746005,0.00001355764,0.001024561,0.9744051,0.012590568,0.010168674],"study_design_scores_gemma":[0.001219001,0.00010547421,0.013984429,0.00033797364,0.00016095862,0.0000174279,0.0017310955,0.04935514,0.0063227746,0.90063745,0.025720933,0.0004073625],"about_ca_topic_score_codex":0.000015065512,"about_ca_topic_score_gemma":0.000013090088,"teacher_disagreement_score":0.790314,"about_ca_system_score_codex":0.000045725847,"about_ca_system_score_gemma":0.00010982974,"threshold_uncertainty_score":0.35349748},"labels":[],"label_agreement":null},{"id":"W4412224191","doi":"","title":"Higher homological algebra","year":2024,"lang":"en","type":"article","venue":"","topic":"Polynomial and algebraic computation","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Algebra over a field; Homological algebra; Mathematics; Pure mathematics","score_opus":0.018451963666914317,"score_gpt":0.24832781004143667,"score_spread":0.22987584637452235,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4412224191","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.019810691,0.00055650575,0.89514977,0.01860206,0.001764651,0.00005122701,5.136737e-7,0.001248096,0.06281651],"genre_scores_gemma":[0.9771958,0.000002829158,0.010248893,0.0021317797,0.00014047037,0.0000030879266,4.6323757e-7,0.0000024202996,0.01027424],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995077,0.000010729146,0.00007119372,0.00020913912,0.00008882277,0.00011241349],"domain_scores_gemma":[0.9997732,0.000046270092,0.0000047490544,0.00012595335,0.000007757645,0.000042044536],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.000054255233,0.000051454994,0.00004519566,0.000038421702,0.000028387469,0.00020959374,0.00026131267,0.000025699712,0.00045586252],"category_scores_gemma":[0.0000018730814,0.00003507996,0.00003930586,0.00021239274,0.0000135958,0.00022730447,0.00012132904,0.000054409113,0.0012001835],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[2.1081705e-7,0.00000671855,0.000008529421,0.0000025050365,0.0000039216975,0.000024838428,0.000059830127,0.0000015050293,0.00013157677,0.8353328,0.027343208,0.13708432],"study_design_scores_gemma":[0.000098838515,0.000078260666,0.005510283,0.000014398501,0.0000032214696,0.00004309421,0.0000020470102,0.13123263,0.0024241267,0.5296249,0.33074608,0.00022214343],"about_ca_topic_score_codex":0.0000067279593,"about_ca_topic_score_gemma":2.5668234e-7,"teacher_disagreement_score":0.9573851,"about_ca_system_score_codex":0.0000103024995,"about_ca_system_score_gemma":0.000022498676,"threshold_uncertainty_score":0.9995775},"labels":[],"label_agreement":null},{"id":"W4412321406","doi":"","title":"Separation bounds for real roots of polynomial systems","year":2011,"lang":"en","type":"article","venue":"","topic":"Polynomial and algebraic computation","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Separation (statistics); Polynomial; Mathematics; Combinatorics; Statistics; Mathematical analysis","score_opus":0.034554410202410166,"score_gpt":0.2708695511149486,"score_spread":0.2363151409125384,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4412321406","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13920593,0.00002037191,0.8456631,0.000048173682,0.00080839166,0.00020809977,0.0000022265406,0.00009425623,0.013949484],"genre_scores_gemma":[0.9817376,0.0000013167921,0.017324807,0.000021734373,0.00010958108,0.000016802212,0.0000028726934,0.0000032632558,0.0007819972],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994008,0.000018475392,0.00020778683,0.00015832686,0.00009118281,0.00012342619],"domain_scores_gemma":[0.9995903,0.00004117453,0.00009178542,0.00017136706,0.00006430237,0.000041092906],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001452912,0.00006247996,0.00010672034,0.000057631358,0.00004747094,0.00004087913,0.00026060903,0.000034805442,0.000005092522],"category_scores_gemma":[0.000007669056,0.00005380386,0.00004701472,0.00010377859,0.000016601954,0.00030004198,0.0000495797,0.000019350167,0.00000905584],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000105391686,0.00019308749,0.00092726585,0.00007676929,0.000049602022,0.0000016675287,0.0031581307,0.00027827357,0.0122961225,0.9147579,0.01525097,0.052904796],"study_design_scores_gemma":[0.001899566,0.0011246791,0.049259193,0.000038794326,0.000024220604,0.000020636391,0.00013759024,0.87968516,0.0459784,0.015130854,0.006155052,0.0005458342],"about_ca_topic_score_codex":0.000543799,"about_ca_topic_score_gemma":0.000026728007,"teacher_disagreement_score":0.8996271,"about_ca_system_score_codex":0.000017359274,"about_ca_system_score_gemma":0.00007098636,"threshold_uncertainty_score":0.21940577},"labels":[],"label_agreement":null},{"id":"W4412425279","doi":"10.1080/10586458.2025.2527786","title":"Computational Progress on the Unfair 0-1 Polynomial Conjecture","year":2025,"lang":"en","type":"article","venue":"Experimental Mathematics","topic":"Polynomial and algebraic computation","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Mathematics; Conjecture; Polynomial; Combinatorics; Algebra over a field; Discrete mathematics; Pure mathematics; Mathematical analysis","score_opus":0.012037978824021247,"score_gpt":0.27154737482317437,"score_spread":0.2595093959991531,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4412425279","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5479942,0.00075657794,0.4007936,0.02494175,0.0020223395,0.0012612741,0.000009019308,0.00065714377,0.021564074],"genre_scores_gemma":[0.974607,3.3332398e-7,0.023747774,0.0012448308,0.00006490373,0.00004589044,0.0000030975677,0.000006221051,0.00027996788],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99912316,0.00003954824,0.00021434651,0.00021779502,0.00023278067,0.00017237806],"domain_scores_gemma":[0.9993065,0.00026589262,0.00007649893,0.00029140356,0.000022064134,0.00003761362],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00011845351,0.00014581461,0.00013035478,0.00006606885,0.0002188014,0.0001856511,0.0005972795,0.000040097304,0.000028721784],"category_scores_gemma":[0.000017434182,0.00009718353,0.000069070884,0.0002466335,0.00009643595,0.000108592394,0.000216827,0.000108845314,0.000079913494],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000063855864,0.00032844194,0.000013342231,0.00001260941,0.000030045663,0.0000037641857,0.001848559,0.00049058447,0.00044203695,0.9800908,0.012671633,0.0040618028],"study_design_scores_gemma":[0.0016842958,0.00041407486,0.00071989984,0.00026757777,0.000015345347,0.000042851672,0.0010637,0.5786569,0.15947978,0.25117055,0.005850579,0.00063441525],"about_ca_topic_score_codex":0.0000020798218,"about_ca_topic_score_gemma":2.4987065e-7,"teacher_disagreement_score":0.7289203,"about_ca_system_score_codex":0.00006469211,"about_ca_system_score_gemma":0.0000688639,"threshold_uncertainty_score":0.39630294},"labels":[],"label_agreement":null},{"id":"W4412475677","doi":"10.28924/2291-8639-23-2025-168","title":"Higher-Order Derivations and Their Applications in Algebraic Structures","year":2025,"lang":"en","type":"article","venue":"International Journal of Analysis and Applications","topic":"Polynomial and algebraic computation","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Order (exchange); Algebraic number; Algebra over a field; Mathematics education; Pure mathematics; Mathematical analysis; Business","score_opus":0.006167546984948429,"score_gpt":0.26343671773380245,"score_spread":0.257269170748854,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4412475677","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.046207402,0.00057702983,0.9476757,0.0049778754,0.000061300874,0.00010371988,0.000006598626,0.000012874479,0.00037750378],"genre_scores_gemma":[0.99074686,0.0001326734,0.008577303,0.00032788416,0.00008409464,0.00003199911,0.000010730514,0.0000022893375,0.00008615749],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"observational","domain_scores_codex":[0.9991913,0.000026388105,0.0003906625,0.00017933059,0.00013146993,0.00008085071],"domain_scores_gemma":[0.99912107,0.00017550024,0.00020639018,0.00014791868,0.00029852966,0.000050572857],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00014160937,0.00009136528,0.0001799991,0.00081238494,0.00009358499,0.0001757571,0.00047602013,0.000035116947,0.000008801444],"category_scores_gemma":[0.000014211861,0.00007265396,0.00007856099,0.0013380352,0.000056250803,0.0002558316,0.0001285523,0.00010574283,5.578393e-7],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000042609267,0.00010051899,0.0141770085,0.0000049445625,0.0006362272,8.589689e-7,0.00027718747,0.0008850507,0.0006573706,0.80678666,0.0000949067,0.17637502],"study_design_scores_gemma":[0.0006683934,0.000023445102,0.47777262,0.000023263061,0.00018497156,0.000016197793,0.00022429913,0.017241461,0.000764265,0.47243297,0.030439027,0.00020909317],"about_ca_topic_score_codex":0.000035601344,"about_ca_topic_score_gemma":0.00004835231,"teacher_disagreement_score":0.9445395,"about_ca_system_score_codex":0.000032691773,"about_ca_system_score_gemma":0.00006736817,"threshold_uncertainty_score":0.29627424},"labels":[],"label_agreement":null},{"id":"W4412806721","doi":"10.1016/j.disc.2025.114705","title":"Linear independence over naturally-ordered semirings with applications to dimension arguments in extremal combinatorics","year":2025,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Polynomial and algebraic computation","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Mathematics; Dimension (graph theory); Combinatorics; Extremal combinatorics; Independence (probability theory); Algebraic combinatorics; Enumerative combinatorics; Discrete mathematics; Statistics","score_opus":0.008895538497888881,"score_gpt":0.2632374750934048,"score_spread":0.2543419365955159,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4412806721","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.23612824,0.000053359836,0.7614517,0.00064633327,0.000087263856,0.0005368967,0.0000019769036,0.00010141181,0.0009927641],"genre_scores_gemma":[0.9248166,0.000004977777,0.07432206,0.0002939718,0.000011806538,0.000076226956,0.000004678565,0.000008521477,0.00046117033],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99884605,0.00001925448,0.00027429694,0.00032225694,0.0003132527,0.00022490893],"domain_scores_gemma":[0.99925536,0.00010144751,0.00008906296,0.00041032772,0.00007316363,0.00007066746],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00016110243,0.00015233953,0.00018427554,0.00017936582,0.00008883672,0.000092013586,0.0005375377,0.00006128152,0.000003131045],"category_scores_gemma":[0.00003211004,0.0001255899,0.00003006356,0.00091226003,0.000021554046,0.00023349609,0.00034718562,0.0001678448,0.000023804543],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000030006371,0.0005387467,0.0036422259,0.00032498842,0.000052728858,0.000023092922,0.004214019,0.002330048,0.003080367,0.96421736,0.00047981812,0.021066617],"study_design_scores_gemma":[0.0023460838,0.00020478114,0.017657606,0.0010613468,0.000035744164,0.000018437453,0.00028312558,0.62782156,0.0074554384,0.33999175,0.0021791372,0.00094495673],"about_ca_topic_score_codex":0.000021470472,"about_ca_topic_score_gemma":0.00001903208,"teacher_disagreement_score":0.68868834,"about_ca_system_score_codex":0.00007644425,"about_ca_system_score_gemma":0.00007095788,"threshold_uncertainty_score":0.51214075},"labels":[],"label_agreement":null},{"id":"W4413411346","doi":"10.4153/s0008439525101094","title":"Infinite matroids in tropical differential algebra","year":2025,"lang":"en","type":"article","venue":"Canadian Mathematical Bulletin","topic":"Polynomial and algebraic computation","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"Ministerio de Ciencia e Innovación","keywords":"Mathematics; Matroid; Differential (mechanical device); Algebra over a field; Pure mathematics; Combinatorics","score_opus":0.006790658793707376,"score_gpt":0.21356359182305043,"score_spread":0.20677293302934305,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4413411346","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.46038345,0.000066102846,0.44720414,0.053628948,0.0004803942,0.0003680576,0.0000050634258,0.00016746666,0.037696376],"genre_scores_gemma":[0.99256045,0.0000018325101,0.004335474,0.0017116552,0.0000453212,0.000021506748,0.0000022202876,0.0000058478286,0.0013156999],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99881434,0.000059369686,0.000307925,0.00027994183,0.00012849299,0.00040993906],"domain_scores_gemma":[0.9992159,0.00016245325,0.000026432732,0.00029823266,0.000022442453,0.00027456775],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.00009146799,0.0001347577,0.00021208914,0.00032501065,0.00007171524,0.0001531316,0.0005636237,0.00008759003,0.0013728418],"category_scores_gemma":[0.00014704264,0.00012597727,0.00006506872,0.00037142422,0.000053016833,0.000049492657,0.000117425276,0.00018639164,0.0018991614],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000030415115,0.00004205729,0.00031242843,0.000029530256,0.00000800316,0.00002882483,0.00012481352,0.000006545989,0.00004580501,0.9791615,0.009086579,0.011150877],"study_design_scores_gemma":[0.0013777101,0.00007221716,0.0560066,0.00028248676,0.000011504269,0.00002533029,0.000035458972,0.05561047,0.00025527776,0.760509,0.12523578,0.0005781752],"about_ca_topic_score_codex":0.0005312564,"about_ca_topic_score_gemma":0.001114647,"teacher_disagreement_score":0.532177,"about_ca_system_score_codex":0.0001423323,"about_ca_system_score_gemma":0.00025422545,"threshold_uncertainty_score":0.99954003},"labels":[],"label_agreement":null},{"id":"W4414053630","doi":"10.1007/s40687-025-00551-5","title":"The first level of $$\\mathbb Z_p$$-extensions and compatibility of heuristics","year":2025,"lang":"en","type":"article","venue":"Research in the Mathematical Sciences","topic":"Polynomial and algebraic computation","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Regina","funders":"American Mathematical Society","keywords":"Heuristics; Compatibility (geochemistry); Quadratic equation; Invariant (physics); Cyclotomic field; Prime (order theory); Quadratic field","score_opus":0.2974581575421071,"score_gpt":0.44216618701127586,"score_spread":0.14470802946916878,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4414053630","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.80387187,0.00042047893,0.14580011,0.037468735,0.00012596301,0.0006831277,0.0000061668325,0.000019289297,0.011604271],"genre_scores_gemma":[0.9950079,0.000022811855,0.0048895325,0.000035210644,0.000005782661,0.0000073309916,5.03558e-8,6.677514e-7,0.000030735035],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99836236,0.00027549744,0.00030159223,0.00017734923,0.0006484228,0.00023476894],"domain_scores_gemma":[0.9920758,0.007392664,0.00005204869,0.0003326794,0.00011709755,0.000029686804],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.007326538,0.00005036015,0.00013345071,0.000100249825,0.00045568956,0.000113678696,0.0013765192,0.000020093605,0.0000016131775],"category_scores_gemma":[0.0014471539,0.000023426484,0.000026753965,0.0012830624,0.0017304447,0.00008499619,0.0005470571,0.00014104336,0.000002475602],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000002597846,0.000092138514,0.00032970248,0.00007454936,0.000002186713,4.817312e-7,0.00083730306,0.000030177092,0.000058630747,0.9866671,0.00026492478,0.011640187],"study_design_scores_gemma":[0.00006411294,0.000064001826,0.021349445,0.0001094027,0.0000010167768,0.0000017372861,0.0003245684,0.13695008,0.0003264256,0.84066594,0.0001166602,0.000026605852],"about_ca_topic_score_codex":0.000083977204,"about_ca_topic_score_gemma":0.000067303554,"teacher_disagreement_score":0.19113602,"about_ca_system_score_codex":0.000013204463,"about_ca_system_score_gemma":0.00013426253,"threshold_uncertainty_score":0.6375896},"labels":[],"label_agreement":null},{"id":"W4414135039","doi":"10.1017/9781009335935.003","title":"Algebraic Preliminaries","year":2025,"lang":"en","type":"book-chapter","venue":"Cambridge University Press eBooks","topic":"Polynomial and algebraic computation","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Algebra over a field; Algebraic number; Conjugacy class; Class (philosophy); Field (mathematics); Calculus (dental)","score_opus":0.013784646494564205,"score_gpt":0.1881283028050192,"score_spread":0.17434365631045498,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4414135039","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000015502148,0.00019875023,0.06977497,0.00011843826,0.0005777441,0.00026499823,0.000045859357,0.00038487525,0.92861885],"genre_scores_gemma":[0.00063875504,0.000040384864,0.001209266,0.00018607192,0.000104294624,6.641215e-7,0.000022681743,0.000014855145,0.997783],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99858546,0.00003202442,0.00019323236,0.00065681426,0.00025224892,0.0002802252],"domain_scores_gemma":[0.998678,0.00012685715,0.0001865891,0.0007414845,0.00013113038,0.00013591166],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.000071548995,0.00035237768,0.0003499898,0.00026865499,0.00024421938,0.00014804829,0.001434381,0.00027687367,0.0000020215648],"category_scores_gemma":[0.000010658812,0.00041845208,0.00021853778,0.000018567054,0.00015377482,0.00021695292,0.0013059997,0.00036082364,0.000026015565],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000016538375,0.0000054582597,1.737491e-7,0.000048270314,0.00006532057,0.00011798543,0.00004066523,0.000003327475,0.000006426879,0.89746296,0.07924008,0.022992762],"study_design_scores_gemma":[0.00033256062,0.00005591196,0.0000138605255,0.00017657483,0.00007808214,0.000011619978,0.0000038081705,0.0016878733,0.00024075716,0.00059255335,0.99636585,0.0004405439],"about_ca_topic_score_codex":0.000064595944,"about_ca_topic_score_gemma":0.0000013311422,"teacher_disagreement_score":0.91712576,"about_ca_system_score_codex":0.00015335115,"about_ca_system_score_gemma":0.00029732395,"threshold_uncertainty_score":0.9998267},"labels":[],"label_agreement":null},{"id":"W4414146786","doi":"10.53733/329","title":"Classification of connected shelves","year":2025,"lang":"en","type":"article","venue":"New Zealand journal of mathematics","topic":"Polynomial and algebraic computation","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Ericsson (Canada)","funders":"","keywords":"Conjecture; Algebraic number; Polynomial; Computation; Binary number; Idempotence; Symbolic computation; Algebra over a field","score_opus":0.018578123032656144,"score_gpt":0.2634944568131583,"score_spread":0.24491633378050215,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4414146786","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3005251,0.00011293686,0.69444656,0.0033463037,0.0003537429,0.000053552445,4.530527e-7,0.000016611622,0.0011447641],"genre_scores_gemma":[0.9150426,0.000024815707,0.08322465,0.00007134179,0.00007989959,2.9026523e-7,3.7362273e-7,0.0000028977377,0.0015531282],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992679,0.000022432967,0.0004325648,0.00005359739,0.00015494204,0.00006859098],"domain_scores_gemma":[0.99906594,0.00020367885,0.00041001645,0.00013623358,0.00014095214,0.000043204887],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002470993,0.000054083157,0.00017658327,0.00014030212,0.000020356158,0.00003424828,0.00033963614,0.000030285393,0.0000058938263],"category_scores_gemma":[0.000111979956,0.00004047324,0.000060684917,0.00023618908,0.000014843166,0.0001496911,0.000036512298,0.0000713397,0.0000024339158],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000039714814,0.00089327083,0.0034360264,0.00028787056,0.00023580437,0.000011024406,0.0069357166,0.00039849916,0.03409661,0.6522873,0.07957493,0.2218032],"study_design_scores_gemma":[0.0029805426,0.00047320026,0.04294816,0.00080504315,0.000093622395,0.00013257879,0.0003278308,0.11710453,0.017099194,0.80675614,0.011048155,0.00023101723],"about_ca_topic_score_codex":0.0000031829136,"about_ca_topic_score_gemma":0.0000016586594,"teacher_disagreement_score":0.6145175,"about_ca_system_score_codex":0.000014175367,"about_ca_system_score_gemma":0.00018038413,"threshold_uncertainty_score":0.16504507},"labels":[],"label_agreement":null},{"id":"W4414969469","doi":"10.4153/s0008439525100714","title":"Harmonic exponential terms are polynomial","year":2025,"lang":"en","type":"article","venue":"Canadian Mathematical Bulletin","topic":"Polynomial and algebraic computation","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Polynomial; Matrix polynomial; Reciprocal polynomial; Monic polynomial; Alternating polynomial; Integer (computer science); Stable polynomial; Degree of a polynomial; Exponential function","score_opus":0.008820085092746942,"score_gpt":0.213674687802737,"score_spread":0.20485460270999004,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4414969469","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15975662,0.00026197697,0.5997026,0.13357055,0.0019246945,0.0007308982,0.000020642794,0.00050859153,0.10352344],"genre_scores_gemma":[0.98725855,0.0000019279173,0.004584808,0.0032106475,0.00012048421,0.00002489093,0.0000028375596,0.000008395579,0.0047874437],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99878675,0.000044853514,0.00026553398,0.00032753043,0.00013831348,0.0004370221],"domain_scores_gemma":[0.9990445,0.00011477684,0.00005352961,0.00038865325,0.000030485944,0.00036805277],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.00016908297,0.00014822179,0.00020015177,0.00022140423,0.00017635719,0.00023101261,0.00072347734,0.00008317107,0.0013154773],"category_scores_gemma":[0.00012855313,0.00014121232,0.00009110269,0.00025584293,0.00006106623,0.0000654032,0.0001343185,0.00014682255,0.005326263],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010185536,0.00010450841,0.00012501655,0.000094534145,0.00005765458,0.00016330357,0.00035688758,0.000017714581,0.0004193051,0.5015131,0.42961168,0.06752609],"study_design_scores_gemma":[0.0014182798,0.000070046925,0.0067760726,0.0003858063,0.000030032128,0.00006259039,0.00007577255,0.027399695,0.0027513057,0.22524375,0.7348848,0.0009018652],"about_ca_topic_score_codex":0.00060524454,"about_ca_topic_score_gemma":0.00046541385,"teacher_disagreement_score":0.82750195,"about_ca_system_score_codex":0.00015770373,"about_ca_system_score_gemma":0.00028905564,"threshold_uncertainty_score":0.99959743},"labels":[],"label_agreement":null},{"id":"W4415368689","doi":"10.37236/14483","title":"A Short Proof of Seymour’s 6-Flow Theorem","year":2025,"lang":"","type":"article","venue":"The Electronic Journal of Combinatorics","topic":"Polynomial and algebraic computation","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Graph; Proof complexity; Mathematical proof; Calculus (dental); Graph theory","score_opus":0.006860189723091736,"score_gpt":0.23842303830001657,"score_spread":0.23156284857692483,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4415368689","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10725179,0.020273209,0.8605458,0.0059679253,0.0035733026,0.00039349138,0.0000016435537,0.000017859424,0.00197495],"genre_scores_gemma":[0.99795574,0.00075030513,0.000099810604,0.00015517363,0.00017340832,0.000002557738,3.740368e-7,0.000015125563,0.00084752624],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9960429,0.0005108123,0.0014052605,0.00027112183,0.0008601876,0.0009097323],"domain_scores_gemma":[0.99679184,0.0005387348,0.0009923344,0.0006623941,0.0008976766,0.000117024756],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0034223134,0.00033566667,0.0007284857,0.0003796147,0.00026942094,0.00014802568,0.0028033047,0.00014562104,0.000009868479],"category_scores_gemma":[0.00020660847,0.00023694843,0.0004657045,0.0020013186,0.00024834924,0.00043448646,0.00043965608,0.0014205348,0.0000026666125],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013536889,0.00043245452,0.00008760149,0.00005854512,0.00034987106,0.000008294005,0.00080739765,0.0016791914,0.0001564488,0.8258953,0.0005942058,0.16979532],"study_design_scores_gemma":[0.0010599664,0.0012890788,0.00052355696,0.00028392934,0.00022747078,0.00014944303,0.00008063049,0.054029275,0.01024346,0.92981154,0.0020929154,0.00020875725],"about_ca_topic_score_codex":0.0000067099118,"about_ca_topic_score_gemma":0.0000034156174,"teacher_disagreement_score":0.8907039,"about_ca_system_score_codex":0.0005748135,"about_ca_system_score_gemma":0.003680058,"threshold_uncertainty_score":0.9662476},"labels":[],"label_agreement":null},{"id":"W4415692432","doi":"10.4153/s0008439525101331","title":"A division algorithm for the Gaussian integers’ minimal Euclidean function","year":2025,"lang":"en","type":"article","venue":"Canadian Mathematical Bulletin","topic":"Polynomial and algebraic computation","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"University of Cambridge","keywords":"Euclidean domain; Euclidean geometry; Euclidean algorithm; Euclidean distance; Euclidean shortest path; Non-Euclidean geometry; Division (mathematics); Euclidean distance matrix","score_opus":0.009926549685176879,"score_gpt":0.22780706999308487,"score_spread":0.217880520307908,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4415692432","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00051834533,0.00008351679,0.95843023,0.03509469,0.0004116002,0.00035698156,0.00000600348,0.0000639716,0.005034662],"genre_scores_gemma":[0.86799407,0.0000050089648,0.11257102,0.009974089,0.00027483355,0.0002269867,0.000013316534,0.000023665392,0.008916992],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999009,0.00003582206,0.000234277,0.0002684454,0.000119574426,0.00033284706],"domain_scores_gemma":[0.9987574,0.0006244353,0.000042005144,0.00031861523,0.000054457203,0.00020308107],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00037296937,0.00012414563,0.00014027495,0.00013291126,0.00030975023,0.00021217261,0.00055000436,0.00006297342,0.0003658249],"category_scores_gemma":[0.0001978849,0.00008753105,0.000098931974,0.00025368313,0.000057846864,0.000051224357,0.000084209074,0.00011615165,0.00083089276],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00000267435,0.00001829821,0.000002839695,0.00001826484,0.00002188883,0.0000031573275,0.0001610927,0.000008477834,0.000012378024,0.33899754,0.04200662,0.61874676],"study_design_scores_gemma":[0.00038391276,0.00008887401,0.0007922548,0.0001011728,0.000021803284,0.000006314734,0.00010432503,0.43698072,0.00007634872,0.21158229,0.3496678,0.00019418799],"about_ca_topic_score_codex":0.00043135232,"about_ca_topic_score_gemma":0.00030638176,"teacher_disagreement_score":0.86747575,"about_ca_system_score_codex":0.00010166788,"about_ca_system_score_gemma":0.00021683417,"threshold_uncertainty_score":0.9999471},"labels":[],"label_agreement":null},{"id":"W4415749759","doi":"10.1007/978-3-032-09645-6_20","title":"Parallel Computation of the Power Series Solutions to Linear Ordinary Differential Equations","year":2025,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Polynomial and algebraic computation","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Dalhousie University; Western University","funders":"","keywords":"Ordinary differential equation; Power series; Speedup; Computation; Series (stratigraphy); Linear algebra; Code (set theory); Polynomial; Differential equation","score_opus":0.01831064232261277,"score_gpt":0.24993763101889016,"score_spread":0.2316269886962774,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4415749759","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00019467637,0.00014704933,0.99196756,0.0034917467,0.0026208113,0.00050673826,0.000012823582,0.00009276937,0.00096585293],"genre_scores_gemma":[0.679972,0.000009803259,0.31746197,0.001070118,0.00028311773,0.000018997058,0.000009709742,0.000020154823,0.0011541427],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9973916,0.00005691717,0.00056366506,0.0008468361,0.00070970156,0.00043132436],"domain_scores_gemma":[0.99809825,0.00038173966,0.00026790047,0.0008349913,0.00031187895,0.0001052439],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00031142635,0.0003485505,0.0003910033,0.0006186868,0.00044713472,0.00019179458,0.0022544384,0.00017236367,0.0000102854565],"category_scores_gemma":[0.00014561463,0.0002770918,0.00018055491,0.001032412,0.00044357972,0.00040792863,0.0022170132,0.00042677097,0.000015200975],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000016605572,0.00007581568,0.00001768607,0.0000493961,0.000027153808,0.000006288023,0.0012136425,0.46924043,0.00040179587,0.18298832,0.0002192151,0.34574366],"study_design_scores_gemma":[0.00025205183,0.00019417139,0.00089928706,0.0005295317,0.000015916276,0.000013899897,3.4952743e-7,0.8260054,0.00050592853,0.1704993,0.00065256085,0.00043162514],"about_ca_topic_score_codex":0.00003238835,"about_ca_topic_score_gemma":0.00008972332,"teacher_disagreement_score":0.6797773,"about_ca_system_score_codex":0.0001867367,"about_ca_system_score_gemma":0.0007717625,"threshold_uncertainty_score":0.9999681},"labels":[],"label_agreement":null},{"id":"W4415749773","doi":"10.1007/978-3-032-09645-6_13","title":"A New Black Box GCD Algorithm Using Hensel Lifting","year":2025,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Polynomial and algebraic computation","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Greatest common divisor; Black box; Function (biology); Factorization; Representation (politics); Interpolation (computer graphics); Efficient algorithm; Bivariate analysis","score_opus":0.016292755323527166,"score_gpt":0.2491867639732643,"score_spread":0.23289400864973714,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4415749773","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000048281698,0.00045071266,0.9917869,0.00084379147,0.0035296602,0.0003324472,0.0000039725055,0.0002547602,0.0027494726],"genre_scores_gemma":[0.0039004912,0.000018734647,0.9914985,0.0018707709,0.0014292912,0.0000011388781,0.0000039806537,0.000027404625,0.0012497383],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.995855,0.000038905884,0.00065782625,0.0017311297,0.00090988155,0.00080729806],"domain_scores_gemma":[0.9976026,0.00047516852,0.0003374176,0.001106084,0.00020606033,0.0002726787],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0006000536,0.0006152691,0.00061022275,0.0010395362,0.00033639683,0.00089160044,0.0030649519,0.00032037598,0.000016756985],"category_scores_gemma":[0.00008579917,0.0006048166,0.00019335991,0.0010771977,0.0003626961,0.00070143153,0.0020764144,0.0008226825,0.000043909382],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000019393801,0.0000108214,0.0000046547866,0.000026210926,0.0000118272665,0.000064100794,0.000688456,0.022074282,0.00007229609,0.011016766,0.00012014174,0.9659085],"study_design_scores_gemma":[0.00023616148,0.000059820242,0.000018540915,0.000552937,0.000010299456,0.000053411124,1.4930613e-7,0.80389595,0.0004763438,0.19270226,0.0014436686,0.000550429],"about_ca_topic_score_codex":0.00015742585,"about_ca_topic_score_gemma":0.00003676911,"teacher_disagreement_score":0.9653581,"about_ca_system_score_codex":0.00044017372,"about_ca_system_score_gemma":0.002025007,"threshold_uncertainty_score":0.99964035},"labels":[],"label_agreement":null},{"id":"W4416008677","doi":"10.1073/pnas.2515667122","title":"Quantum higher-order Fourier analysis and the Clifford hierarchy","year":2025,"lang":"en","type":"article","venue":"Proceedings of the National Academy of Sciences","topic":"Polynomial and algebraic computation","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"Army Research Office; Multidisciplinary University Research Initiative; National Science Foundation","keywords":"Fourier transform; Diagonal; Fourier analysis; Quantum Fourier transform; Quantum; Algebra over a field; Unitary state; Clifford analysis; Hilbert space","score_opus":0.021739850160057767,"score_gpt":0.28921596460500143,"score_spread":0.2674761144449437,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4416008677","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.84151274,0.00059106475,0.004381962,0.13572778,0.00014957537,0.00036774497,0.000005260516,0.000046311838,0.017217558],"genre_scores_gemma":[0.9932765,0.000018233923,0.0052300985,0.0010098119,0.000031880354,0.0000065855875,3.0597466e-8,8.235821e-7,0.00042605493],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987031,0.000013138356,0.00026276708,0.00022988934,0.0006740912,0.00011701394],"domain_scores_gemma":[0.99918556,0.0003210838,0.00025210885,0.000013153009,0.00020788344,0.00002018653],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015115143,0.000070567155,0.0001569391,0.00028550142,0.00030264238,0.00008724242,0.0012807992,0.000038156806,0.0000031372872],"category_scores_gemma":[0.00025589488,0.0000364784,0.0000913541,0.0034416886,0.0010766445,0.00045288497,0.00040081204,0.0001095669,3.5878406e-7],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008445932,0.000011746638,0.002291538,0.000011101786,0.000055507302,1.2760126e-9,0.00014389958,0.00009559898,0.0010495309,0.9918244,0.00039750486,0.0041107154],"study_design_scores_gemma":[0.00028696522,0.000012317654,0.13103972,0.000022388687,0.000045808043,8.2114843e-7,0.000023795477,0.12351617,0.005441732,0.73898137,0.000573624,0.00005527727],"about_ca_topic_score_codex":0.00001641607,"about_ca_topic_score_gemma":1.3587824e-7,"teacher_disagreement_score":0.25284302,"about_ca_system_score_codex":0.000013252057,"about_ca_system_score_gemma":0.0000414549,"threshold_uncertainty_score":0.39669415},"labels":[],"label_agreement":null},{"id":"W4416619986","doi":"10.48550/arxiv.2510.20435","title":"The exceptional set in Cassel's theorem on small cyclotomic integers","year":2025,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Polynomial and algebraic computation","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Modulo; Conjecture; Equivalence (formal languages); Equivalence relation; Algebraic number; Embedding; Cyclotomic field; Parametric statistics","score_opus":0.057291768974818844,"score_gpt":0.1957957710981617,"score_spread":0.13850400212334285,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4416619986","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7220592,0.00003458701,0.26665896,0.0008482125,0.0014054412,0.00036516789,0.000021089201,0.00017891632,0.008428443],"genre_scores_gemma":[0.99729484,0.000074390875,0.0002130869,0.00022093579,0.000069162,0.0000020855377,0.000013059349,0.0000056972367,0.0021067616],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99844,0.0002182704,0.00019430196,0.00077229016,0.000078359655,0.0002967765],"domain_scores_gemma":[0.9984984,0.00050205516,0.0001492461,0.0007128922,0.000062554034,0.000074857395],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00035742705,0.0002419022,0.00020090885,0.00027442304,0.00018984558,0.00014962695,0.0018557807,0.00016728534,0.000007812507],"category_scores_gemma":[0.000040741506,0.00021458422,0.0001618752,0.0004966466,0.00010913022,0.00011647005,0.0013984968,0.0006364217,0.00006157634],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000053555697,0.000048359278,0.00063249626,0.000017096118,0.000036023648,0.000089562905,0.00027754263,0.19368736,0.0000072424436,0.7976915,0.0003921118,0.007067124],"study_design_scores_gemma":[0.00044928578,0.00003859424,0.006410422,0.00014776911,0.000013678367,0.0000026967584,0.00007471366,0.61260754,0.00005543981,0.37878248,0.0010901515,0.0003272394],"about_ca_topic_score_codex":0.00024788408,"about_ca_topic_score_gemma":0.00036243387,"teacher_disagreement_score":0.4189202,"about_ca_system_score_codex":0.00036649193,"about_ca_system_score_gemma":0.00035880745,"threshold_uncertainty_score":0.87504905},"labels":[],"label_agreement":null},{"id":"W4416710361","doi":"10.1090/mbk/154/05","title":"The modified Gauss-Cramér heuristic","year":2025,"lang":"en","type":"book-chapter","venue":"American Mathematical Society eBooks","topic":"Polynomial and algebraic computation","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Montréal","funders":"","keywords":"","score_opus":0.013402910639916927,"score_gpt":0.2391563279797574,"score_spread":0.22575341733984047,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4416710361","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0000100741945,0.000101235106,0.41375265,0.0011815567,0.00018095298,0.0002845127,0.0000058541323,0.00024142067,0.58424175],"genre_scores_gemma":[0.008617105,0.00007347214,0.025397802,0.0025234309,0.0003060274,0.00006678081,0.0000068608074,0.000055306322,0.9629532],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9978752,0.000034306333,0.000553568,0.00056777475,0.00051573577,0.00045343107],"domain_scores_gemma":[0.997065,0.0013590965,0.0003791993,0.0009413017,0.00009395228,0.00016144558],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00030477837,0.00041890037,0.0005698407,0.000031308486,0.00046763243,0.0003251297,0.0014090496,0.00014453559,0.0000151372],"category_scores_gemma":[0.000069669506,0.00029305968,0.00061742496,0.000064707376,0.000866379,0.00004523849,0.00067585934,0.00053799513,0.00017883038],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000020082116,0.000008624366,3.90283e-8,0.000038282375,0.00009363603,0.00000314657,0.0003126534,0.0000026817022,0.0000034876691,0.816116,0.006843123,0.17657636],"study_design_scores_gemma":[0.00012678574,0.00006729592,0.0000028130337,0.00014006304,0.00005457667,0.000008638468,0.00003869571,0.03907255,0.000012968126,0.8988717,0.06122023,0.0003836612],"about_ca_topic_score_codex":0.000026194086,"about_ca_topic_score_gemma":0.0000042541947,"teacher_disagreement_score":0.38835484,"about_ca_system_score_codex":0.0001228216,"about_ca_system_score_gemma":0.00028355946,"threshold_uncertainty_score":0.99995214},"labels":[],"label_agreement":null},{"id":"W4416829596","doi":"10.5206/mt.v5i4.24335","title":"Error in Homotopy Methods for Random Roots","year":2025,"lang":"","type":"article","venue":"Maple Transactions","topic":"Polynomial and algebraic computation","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"Western University","funders":"","keywords":"Homotopy; Monomial; Univariate; Polynomial; Degree (music); Unit circle; Computation; Homotopy analysis method","score_opus":0.025385322773678307,"score_gpt":0.34938658108736836,"score_spread":0.32400125831369003,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4416829596","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0011257816,0.0008747491,0.9839226,0.0075603686,0.0038510424,0.0012966853,0.000037036385,0.00012220892,0.0012095168],"genre_scores_gemma":[0.6687955,0.00008244658,0.31992012,0.0006694712,0.00012674855,0.0006107038,0.000010259552,0.000023899916,0.009760829],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99749017,0.0003965423,0.00070643565,0.0007040594,0.00013282723,0.00056996814],"domain_scores_gemma":[0.99804044,0.0011499779,0.000099481316,0.0004942246,0.000096106465,0.00011979765],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0010432735,0.0002934593,0.0004898981,0.0005802447,0.00046653228,0.0002527581,0.00066344964,0.00019604784,0.00014701],"category_scores_gemma":[0.000060983606,0.00032190958,0.00034008297,0.0015211041,0.00009042514,0.00045427572,0.000028672092,0.00036958457,0.000022125714],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00018983921,0.00034192312,0.00001652862,0.000119272365,0.00007865003,0.0000020741272,0.0010410228,0.009095627,0.001035056,0.007867644,0.00032168193,0.9798907],"study_design_scores_gemma":[0.006148796,0.00012334326,0.0022923185,0.00013598808,0.00010689394,0.000005008449,0.00008963995,0.8982888,0.0043834792,0.033615395,0.0544356,0.00037475524],"about_ca_topic_score_codex":0.0002957647,"about_ca_topic_score_gemma":0.0005178874,"teacher_disagreement_score":0.9795159,"about_ca_system_score_codex":0.00015688757,"about_ca_system_score_gemma":0.00043853285,"threshold_uncertainty_score":0.9999233},"labels":[],"label_agreement":null},{"id":"W45795502","doi":"","title":"Closed Paths In The Coset Diagrams for Acting On Real Quadratic Fields.","year":2004,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Polynomial and algebraic computation","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Coset; Mathematics; Quadratic equation; Pure mathematics; Geometry; Combinatorics","score_opus":0.01708393881577699,"score_gpt":0.2567556941902353,"score_spread":0.2396717553744583,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W45795502","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9840194,0.000013439964,0.009841632,0.003158725,0.0014674846,0.00038841978,0.0000012120962,0.00007394109,0.0010357344],"genre_scores_gemma":[0.9984777,0.0000040315776,0.0007471631,0.0006766312,0.000022829972,0.000049313647,0.0000047704116,0.0000051614375,0.000012379363],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99913263,0.0000599968,0.00018180898,0.00022579363,0.00017341036,0.00022638538],"domain_scores_gemma":[0.99908835,0.00048898073,0.000070662456,0.00029228677,0.00002401787,0.00003570491],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003398626,0.000102169506,0.000115457064,0.00004726477,0.00012970198,0.00012018249,0.0005544773,0.00005121485,7.386082e-7],"category_scores_gemma":[0.00009481588,0.000076090924,0.000055654855,0.00025238885,0.000015902908,0.00017394136,0.00005248266,0.00014035068,0.000014494818],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000095785335,0.0001385335,0.00013084983,0.0000072729977,0.0000039643055,0.000009757006,0.0027172174,0.00024351633,0.00004254815,0.9609448,0.000293495,0.035458505],"study_design_scores_gemma":[0.001398993,0.00034865233,0.005805708,0.0000323587,0.0000029085697,0.0000020082512,0.0000984583,0.0053454004,0.0007390566,0.9858485,0.00024217671,0.00013580777],"about_ca_topic_score_codex":0.00015260988,"about_ca_topic_score_gemma":0.00007759443,"teacher_disagreement_score":0.035322696,"about_ca_system_score_codex":0.00005802912,"about_ca_system_score_gemma":0.00006372866,"threshold_uncertainty_score":0.31028977},"labels":[],"label_agreement":null},{"id":"W611620027","doi":"10.71781/15621","title":"Les systèmes super intégrables d’ordre trois séparables en coordonnées paraboliques","year":2012,"lang":"fr","type":"dissertation","venue":"Papyrus : Institutional Repository (Université de Montréal)","topic":"Polynomial and algebraic computation","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada; Université de Montréal; Centre de Recherches Mathématiques","keywords":"Humanities; Art","score_opus":0.009863853647327978,"score_gpt":0.19162696824140732,"score_spread":0.18176311459407934,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W611620027","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8893692,0.077066146,0.009762971,0.0014765769,0.003956223,0.0006260654,0.00009901038,0.00043421346,0.017209634],"genre_scores_gemma":[0.9559067,0.0012122622,0.0027287086,0.000110082445,0.0007968878,0.00005456889,0.00043391503,0.000050110317,0.038706765],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"observational","domain_scores_codex":[0.995658,0.00056521565,0.0007759773,0.0010729611,0.00091916823,0.0010087192],"domain_scores_gemma":[0.99723583,0.0003920763,0.00061189773,0.00062078534,0.0005303657,0.0006090677],"candidate_categories":["metaepi_narrow","sts"],"consensus_categories":[],"category_scores_codex":[0.00040964095,0.00088092627,0.00082460814,0.00052342133,0.008832139,0.0003567353,0.0013169934,0.0008032581,0.00009352071],"category_scores_gemma":[0.00010307347,0.0009664869,0.000543525,0.0006141361,0.0004275327,0.0018519145,0.0004619665,0.00070237735,0.00018326144],"study_design_candidate":"observational","study_design_consensus":null,"about_ca_topic_candidate":true,"about_ca_topic_consensus":true,"about_ca_system_candidate":true,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0008315237,0.000906903,0.044311136,0.0010044514,0.0010818549,0.0015011544,0.18030906,0.00702735,0.019754808,0.6125741,0.0019820114,0.12871566],"study_design_scores_gemma":[0.0028945561,0.0005229397,0.68770516,0.002761819,0.0013276777,0.003044431,0.052107226,0.03415392,0.03929248,0.00908187,0.1631424,0.0039655357],"about_ca_topic_score_codex":0.15366013,"about_ca_topic_score_gemma":0.022417223,"teacher_disagreement_score":0.643394,"about_ca_system_score_codex":0.00479902,"about_ca_system_score_gemma":0.002223021,"threshold_uncertainty_score":0.99927855},"labels":[],"label_agreement":null},{"id":"W614305353","doi":"","title":"Randomization, relaxation, and complexity in polynomial equation solving : Banff International Research Station workshop on Randomization, Relaxation, and Complexity, February 28-March 5, 2010, Banff, Ontario, Canada","year":2011,"lang":"en","type":"book","venue":"American Mathematical Society eBooks","topic":"Polynomial and algebraic computation","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Mathematics; Polynomial; Combinatorics; Univariate; Discrete mathematics; Multivariate statistics; Mathematical analysis; Statistics","score_opus":0.06910609449979718,"score_gpt":0.2829841280381021,"score_spread":0.2138780335383049,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W614305353","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.024308525,0.00020663039,0.8445169,0.009404394,0.0014118684,0.005928567,0.00014693124,0.00044994242,0.11362629],"genre_scores_gemma":[0.46705922,0.00060817564,0.23608781,0.0058006146,0.0024149742,0.001389612,0.0042795166,0.0005957162,0.28176433],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9942127,0.00069794944,0.0015544107,0.0012305571,0.0015988493,0.0007055454],"domain_scores_gemma":[0.99391484,0.0031888003,0.0011590585,0.00063688564,0.0007603366,0.00034009476],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.002599382,0.000624188,0.0010851232,0.00040177064,0.00074970303,0.0005177048,0.00087229337,0.00032162352,0.000167907],"category_scores_gemma":[0.00089424156,0.00063046406,0.00018723556,0.00038872487,0.0013482664,0.00049890537,0.0006733122,0.0012790244,0.000019510597],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":true,"about_ca_topic_consensus":true,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0023765187,0.00060537143,0.0010935927,0.0006885324,0.0008534127,0.000033716748,0.0538508,0.001057817,0.00006396154,0.6502032,0.21517771,0.07399534],"study_design_scores_gemma":[0.016276341,0.0003202853,0.018594239,0.0018160744,0.000111764886,0.000046750196,0.0009157464,0.23131593,0.00003957144,0.7229191,0.0057492834,0.0018949353],"about_ca_topic_score_codex":0.247448,"about_ca_topic_score_gemma":0.3546787,"teacher_disagreement_score":0.608429,"about_ca_system_score_codex":0.0022065516,"about_ca_system_score_gemma":0.002973268,"threshold_uncertainty_score":0.99961466},"labels":[],"label_agreement":null},{"id":"W640741031","doi":"","title":"Computer Algebra 2006: Latest Advances in Symbolic Algorithms Proceedings of the Waterloo Workshop in Computer Algebra 2006, Ontario, Canada, 10-12 April 2006","year":2007,"lang":"en","type":"book","venue":"World Scientific Publishing Co., Inc. eBooks","topic":"Polynomial and algebraic computation","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Symbolic computation; Algebra over a field; Linear algebra; Computer science; Algorithm; Mathematics; Pure mathematics","score_opus":0.01120420066109226,"score_gpt":0.2109891391280301,"score_spread":0.19978493846693784,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W640741031","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.078175366,0.004039098,0.020296061,0.0073233037,0.065062575,0.010420121,0.0012114431,0.0017302072,0.8117418],"genre_scores_gemma":[0.020778853,0.0000049099003,0.009204817,0.0018801033,0.0016845478,0.000087064145,0.00042772765,0.00014901167,0.96578294],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99010396,0.00015671235,0.0023799706,0.002578984,0.002775324,0.002005033],"domain_scores_gemma":[0.99515665,0.0006359679,0.0015106518,0.0013722033,0.00081933604,0.0005052118],"candidate_categories":["metaepi_narrow","scholarly_communication","open_science","research_integrity"],"consensus_categories":[],"category_scores_codex":[0.0037900815,0.0011713039,0.0014529316,0.0026485187,0.0006733771,0.006068706,0.0067342916,0.0005743121,0.00011543926],"category_scores_gemma":[0.000080456535,0.0010157281,0.00033473698,0.0018164095,0.00086308026,0.0038486707,0.0025351408,0.0025170739,0.00003065053],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":true,"about_ca_topic_consensus":true,"about_ca_system_candidate":true,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000043219206,0.0002300702,0.002068414,0.00026160767,0.00007621483,0.000112376016,0.0055184383,0.0013465572,0.000028499153,0.012831506,0.8570555,0.12042762],"study_design_scores_gemma":[0.0019368589,0.00008551547,0.007811462,0.002772944,0.000048878206,0.00006232958,0.00005331101,0.03662686,0.00033562983,0.015810896,0.9322103,0.0022450124],"about_ca_topic_score_codex":0.20438276,"about_ca_topic_score_gemma":0.9493752,"teacher_disagreement_score":0.74499243,"about_ca_system_score_codex":0.00278299,"about_ca_system_score_gemma":0.00568365,"threshold_uncertainty_score":0.9999532},"labels":[],"label_agreement":null},{"id":"W644202785","doi":"10.46298/dmtcs.2824","title":"On extensions of the Newton-Raphson iterative scheme to arbitrary orders","year":2010,"lang":"fr","type":"article","venue":"Discrete Mathematics & Theoretical Computer Science","topic":"Polynomial and algebraic computation","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Newton's method; Convergence (economics); Enumeration; Applied mathematics; Scheme (mathematics); Series (stratigraphy); Pure mathematics; Combinatorics; Mathematical analysis; Nonlinear system; Physics","score_opus":0.013663764389732356,"score_gpt":0.2650734282298485,"score_spread":0.2514096638401161,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W644202785","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.28921968,0.00003420663,0.68273747,0.019587182,0.0042505166,0.000596808,0.000018164164,0.00006871634,0.0034872396],"genre_scores_gemma":[0.7119233,0.0000018461473,0.285835,0.0018670992,0.00020177146,0.000011074909,8.570597e-7,0.000020016707,0.00013899757],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9956676,0.000185017,0.00078131736,0.0010364646,0.0014076264,0.00092201465],"domain_scores_gemma":[0.9956508,0.0011757987,0.00030289564,0.0017725736,0.0005038733,0.0005940183],"candidate_categories":["metaepi_narrow","sts"],"consensus_categories":[],"category_scores_codex":[0.0015633312,0.00047175246,0.0005093056,0.0002829108,0.00079750165,0.000713979,0.0036878346,0.00015477338,0.00015511234],"category_scores_gemma":[0.00082837744,0.00032480023,0.0003027055,0.0026704292,0.0057001295,0.0006652726,0.0022569988,0.00088895,0.00014914028],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010840674,0.0002731411,0.0000112721755,0.000054886976,0.0000145722515,0.0000067644996,0.004700795,0.0003781649,0.0070929686,0.9795311,0.0004950696,0.0074304305],"study_design_scores_gemma":[0.00017520372,0.00027736052,0.0003944898,0.00040639428,0.00001552991,0.000036718753,0.000030827086,0.52500117,0.0071077924,0.4660248,0.00023945261,0.00029028524],"about_ca_topic_score_codex":0.00001871963,"about_ca_topic_score_gemma":0.000008639461,"teacher_disagreement_score":0.52462304,"about_ca_system_score_codex":0.000048079804,"about_ca_system_score_gemma":0.0004911528,"threshold_uncertainty_score":0.9999204},"labels":[],"label_agreement":null},{"id":"W6894291905","doi":"10.5683/sp3/f9ngdo","title":"Essentiel Excel","year":2019,"lang":"fr","type":"dataset","venue":"Borealis","topic":"Polynomial and algebraic computation","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Dalhousie University","funders":"","keywords":"Work (physics); Microsoft excel; Statistical analysis; Ms excel","score_opus":0.030650982166021024,"score_gpt":0.26500744317416225,"score_spread":0.23435646100814123,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6894291905","genre_codex":"dataset","genre_gemma":"dataset","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"dataset","genre_consensus":"dataset","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000032262764,0.00071606506,0.023570633,0.0040175663,0.0039388426,0.00032657513,0.9644332,0.00007616655,0.0028886802],"genre_scores_gemma":[0.0000794985,0.00020374259,0.0011064967,0.0016994396,0.0012405455,0.00001750983,0.9898114,0.000022866685,0.0058184755],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99740654,0.000120860124,0.0004928703,0.00084423943,0.00053828495,0.0005971901],"domain_scores_gemma":[0.99761456,0.00020257408,0.00033514824,0.001476393,0.00014239558,0.00022895627],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00023698097,0.00045000637,0.0004918653,0.00017760321,0.00016060387,0.00051349454,0.0018011885,0.0003553627,0.00016867113],"category_scores_gemma":[0.00007113821,0.00045266535,0.0002410402,0.0003515572,0.00013789887,0.00050949614,0.0008237754,0.0004101836,0.0019360024],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":true,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000066592984,0.000119933706,0.0000070573333,0.00014903423,0.000046797602,0.00006621465,0.00020024137,0.00010053642,0.000009244015,0.0072881877,0.9660448,0.025961312],"study_design_scores_gemma":[0.00033548716,0.00008980758,0.0015628728,0.00016133253,0.000054877528,0.000048174767,0.000011379267,0.011524319,0.000044503122,0.0017451195,0.9838961,0.000526079],"about_ca_topic_score_codex":0.026738573,"about_ca_topic_score_gemma":0.001505793,"teacher_disagreement_score":0.025435233,"about_ca_system_score_codex":0.00009716725,"about_ca_system_score_gemma":0.00038361785,"threshold_uncertainty_score":0.9997925},"labels":[],"label_agreement":null},{"id":"W6910503647","doi":"10.48550/arxiv.1710.02848","title":"Walks in the quarter plane, genus zero case","year":2017,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Polynomial and algebraic computation","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Zero (linguistics); Quarter (Canadian coin); Series (stratigraphy); Kernel (algebra); Genus; Algebraic number; Plane (geometry); Differential (mechanical device)","score_opus":0.060157172968655304,"score_gpt":0.1936504973945985,"score_spread":0.1334933244259432,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6910503647","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7302619,0.000046718473,0.26392215,0.00050081353,0.000813013,0.00026056424,0.000011440695,0.00009227514,0.0040911124],"genre_scores_gemma":[0.9990291,0.000017480594,0.00022311794,0.00019343608,0.000089625384,9.646034e-7,0.000008502249,0.0000058744677,0.0004319027],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99866366,0.00016009413,0.00014598254,0.0006795576,0.00007586924,0.0002748116],"domain_scores_gemma":[0.99825853,0.0001313285,0.0001991909,0.0012981929,0.000038103288,0.00007465066],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00029004307,0.00021151704,0.00020096925,0.00016251254,0.00024517404,0.00027938426,0.0022260293,0.00016782469,0.000007364783],"category_scores_gemma":[0.000017270617,0.0001864751,0.00012112941,0.0001630782,0.000073563606,0.0003006278,0.0009814906,0.0005114028,0.00009123621],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00011847831,0.00062713947,0.00713591,0.00023542983,0.00023318149,0.15859246,0.013813213,0.17308837,0.000027467477,0.57474244,0.019984478,0.051401433],"study_design_scores_gemma":[0.0010773395,0.00009864869,0.010110451,0.00010276909,0.000051263603,0.00096039043,0.00020475799,0.7529434,0.000022593393,0.23013246,0.0034387007,0.0008572345],"about_ca_topic_score_codex":0.0010565188,"about_ca_topic_score_gemma":0.00040334262,"teacher_disagreement_score":0.579855,"about_ca_system_score_codex":0.00008032884,"about_ca_system_score_gemma":0.00012398948,"threshold_uncertainty_score":0.76042336},"labels":[],"label_agreement":null},{"id":"W6924377308","doi":"10.15468/dl.czr3hj","title":"Occurrence Download","year":2025,"lang":"en","type":"dataset","venue":"Global Biodiversity Information Facility","topic":"Polynomial and algebraic computation","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Matching (statistics); Download; Range (aeronautics); Set (abstract data type); Data set","score_opus":0.010435616385110955,"score_gpt":0.21330125074216771,"score_spread":0.20286563435705676,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6924377308","genre_codex":"dataset","genre_gemma":"dataset","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"dataset","genre_consensus":"dataset","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000035819736,0.000019461477,0.0021377613,0.00046659858,0.001234573,0.00021510349,0.99554914,0.00017543974,0.0001660831],"genre_scores_gemma":[0.000008500608,0.000023621356,0.000018776476,0.0009816271,0.000001523169,0.0000027682715,0.99896294,2.6020144e-9,2.6731402e-7],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9986133,0.000060947626,0.00036449655,0.00028856762,0.00040347816,0.00026923738],"domain_scores_gemma":[0.998707,0.00003309344,0.00024901037,0.00067533914,0.00021082046,0.00012476613],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0001948374,0.00024827398,0.00023951281,0.00013293506,0.00027193813,0.00036222552,0.001482961,0.00023574966,0.00012637087],"category_scores_gemma":[0.0001026793,0.00025598562,0.00014128788,0.00059565424,0.0000745883,0.0016780468,0.0010345059,0.00022937944,0.023770036],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000007830794,0.000022581742,0.000044794193,0.00008548368,0.000016497357,0.0000014264292,0.000025269384,0.000018235305,1.1792657e-8,0.0000037916082,0.98446786,0.015306214],"study_design_scores_gemma":[0.00023388692,0.000021929563,0.000039289665,0.0000038954136,0.000015797297,0.00000265127,0.000009584955,0.000008254904,0.000002754244,0.0000136524895,0.9994085,0.00023980178],"about_ca_topic_score_codex":0.00032063122,"about_ca_topic_score_gemma":0.000006758793,"teacher_disagreement_score":0.023643665,"about_ca_system_score_codex":0.00026051528,"about_ca_system_score_gemma":0.00035488477,"threshold_uncertainty_score":0.9999892},"labels":[],"label_agreement":null},{"id":"W6925343135","doi":"10.17605/osf.io/chxvq","title":"Identifying quality indicators of tools that support the practice of knowledge translation: Protocol for a scoping review","year":2020,"lang":"en","type":"other","venue":"Open Science Framework","topic":"Polynomial and algebraic computation","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Protocol (science); Quality (philosophy); Identification (biology); Context (archaeology); Data collection","score_opus":0.21493758606963356,"score_gpt":0.48701921583395086,"score_spread":0.27208162976431727,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6925343135","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[4.0832566e-7,0.0009815637,0.6840235,0.003394009,0.00045259215,0.1833414,0.000019536412,0.00006250844,0.12772447],"genre_scores_gemma":[0.0007685529,0.0003231051,0.82218415,0.0034721303,0.00047560892,0.16677561,0.0000118726175,0.00015968407,0.0058293003],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9974288,0.0002440231,0.00068814703,0.0006576575,0.0007252613,0.0002561623],"domain_scores_gemma":[0.9955268,0.0015416245,0.0017354096,0.0009611772,0.00013308207,0.000101944664],"candidate_categories":["open_science"],"consensus_categories":[],"category_scores_codex":[0.004276659,0.00019497484,0.0005748506,0.00016413858,0.00019501026,0.00046565133,0.005894704,0.00012020011,0.00017436086],"category_scores_gemma":[0.0022321246,0.00013984885,0.00013273345,0.0022646897,0.00040586034,0.0012493486,0.0009981188,0.0002512019,0.000014908264],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000051473064,0.0002493422,0.000053348955,0.024214478,0.000067132605,0.0000019726058,0.0058278427,0.0000045986003,0.00007515481,0.12687953,0.043230325,0.7993448],"study_design_scores_gemma":[0.0010410498,0.00039473048,0.00021338135,0.19260447,0.00010919007,0.000009791218,0.00021106884,0.0005318258,0.002816506,0.011742436,0.7893762,0.0009493733],"about_ca_topic_score_codex":0.000042151703,"about_ca_topic_score_gemma":0.000011415716,"teacher_disagreement_score":0.79839545,"about_ca_system_score_codex":0.000029233017,"about_ca_system_score_gemma":0.0017949998,"threshold_uncertainty_score":0.9994839},"labels":[],"label_agreement":null},{"id":"W6926281463","doi":"10.25316/ir-11164","title":"The Nanaimo Free Press [Wednesday, April 5, 1876]","year":2019,"lang":"en","type":"other","venue":"VIUSpace (Vancouver Island University Library)","topic":"Polynomial and algebraic computation","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"","score_opus":0.006577668065048513,"score_gpt":0.1753531950600664,"score_spread":0.1687755269950179,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6926281463","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0000053144477,0.0006557666,0.01475943,0.0018677199,0.005884124,0.00039432227,0.000080374615,0.0007558057,0.97559714],"genre_scores_gemma":[0.00014875976,0.0005207729,0.0013609462,0.00017357692,0.00035502098,9.601832e-7,0.0000045131756,0.0001260024,0.99730945],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99822396,0.00013506597,0.00014287131,0.00065650896,0.0003808799,0.00046069268],"domain_scores_gemma":[0.99790496,0.00017826672,0.00028568864,0.0014592909,0.000021366594,0.00015040615],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.000051888797,0.00037963365,0.00033865593,0.00022208948,0.0002879442,0.00031387544,0.0033509019,0.00028160826,0.00009833515],"category_scores_gemma":[0.000012639533,0.00029704178,0.0001874729,0.00042807107,0.00011868447,0.0008962978,0.0017963342,0.00032796743,0.00020899043],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":true,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000017237106,0.000024820221,0.000005552954,0.000028617129,0.00007352014,0.00004003733,0.00015046619,0.000024259587,0.0000010172547,0.01632772,0.9805928,0.0027139704],"study_design_scores_gemma":[0.0008002613,0.000048912345,0.000018690804,0.0000839096,0.000024260458,0.000001580142,0.000058426598,0.0014556303,0.0000309355,0.0009516311,0.99609905,0.0004267112],"about_ca_topic_score_codex":0.0007885717,"about_ca_topic_score_gemma":0.07633045,"teacher_disagreement_score":0.07554188,"about_ca_system_score_codex":0.0000503746,"about_ca_system_score_gemma":0.00026426453,"threshold_uncertainty_score":0.99994814},"labels":[],"label_agreement":null},{"id":"W6930629290","doi":"10.5281/zenodo.15092035","title":"Helminthenfunde beim einheimischen Marderhund Nyctereutesprocyonoides (Gray, 1834)","year":2001,"lang":"de","type":"article","venue":"Zenodo (CERN European Organization for Nuclear Research)","topic":"Polynomial and algebraic computation","field":"Computer Science","cited_by":16,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Echinococcus; Subconscious; Epizootiology; Christian ministry","score_opus":0.037373760318588474,"score_gpt":0.2440134757541269,"score_spread":0.20663971543553844,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6930629290","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09224948,0.007434027,0.55611724,0.023017729,0.0043265787,0.0033470215,0.00057372474,0.007217755,0.30571643],"genre_scores_gemma":[0.97603124,0.0014489093,0.0049645873,0.0013823707,0.0026435538,2.2151626e-7,0.001717116,0.0027704844,0.009041501],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9957404,0.0006975483,0.00064178783,0.0011486382,0.00075771793,0.0010138965],"domain_scores_gemma":[0.99724334,0.00009873236,0.0003062169,0.0010626095,0.00074772805,0.0005413945],"candidate_categories":["metaepi_narrow","sts","scholarly_communication","insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.0010688256,0.00042816825,0.0003730304,0.0004574401,0.0036945806,0.003991033,0.003226258,0.00017400729,0.008736918],"category_scores_gemma":[0.00055975484,0.00046663714,0.00017623608,0.0013079519,0.00034229975,0.0009354947,0.0037536903,0.000577864,0.034896757],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00015338363,0.0004332388,0.000016569127,0.00011252618,0.00022556499,0.00012528917,0.00320863,0.00025912782,0.002266631,0.01566608,0.17961003,0.7979229],"study_design_scores_gemma":[0.00087401725,0.00044708853,0.0006909689,0.00010308372,0.000057932026,0.00023760016,0.00015692698,0.014740421,0.0004984929,0.0026955537,0.9789535,0.0005444575],"about_ca_topic_score_codex":0.00009397689,"about_ca_topic_score_gemma":0.0000016109805,"teacher_disagreement_score":0.8837818,"about_ca_system_score_codex":0.0002884264,"about_ca_system_score_gemma":0.000025901283,"threshold_uncertainty_score":0.9997785},"labels":[],"label_agreement":null},{"id":"W6930745414","doi":"10.5281/zenodo.12372591","title":"the hound of the baskervilles pdf","year":2024,"lang":"en","type":"other","venue":"Zenodo (CERN European Organization for Nuclear Research)","topic":"Polynomial and algebraic computation","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Curse; Legend; Adventure; Watson; Performance art; Mythology; Porch","score_opus":0.01796761875960162,"score_gpt":0.22217380132026743,"score_spread":0.2042061825606658,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6930745414","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000023390598,0.0008476519,0.008964723,0.0021187775,0.0006751034,0.00030466626,0.00005048561,0.000596073,0.98641914],"genre_scores_gemma":[0.012743747,0.00027850873,0.00040922206,0.00019431085,0.00053656904,6.3379304e-8,0.00009783588,0.003747786,0.98199195],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99870956,0.00022801892,0.0001823479,0.00031365844,0.00035819312,0.00020821301],"domain_scores_gemma":[0.9989361,0.000029729985,0.00015022804,0.00071333715,0.00011596957,0.00005463969],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.0003835259,0.00012659113,0.00011068759,0.000121754725,0.0008135422,0.0008973001,0.0027916995,0.00006294433,0.0041461866],"category_scores_gemma":[0.00014647387,0.0000795469,0.00008310024,0.00055930385,0.00018558807,0.00006922989,0.002610597,0.00023074963,0.01810327],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000017875168,0.000013264755,5.4562314e-8,0.0000405838,0.00003076412,0.000001461114,0.00017632164,0.0000037370453,0.000056114346,0.039750922,0.87929744,0.08062758],"study_design_scores_gemma":[0.00007791867,0.000033139204,0.000030810075,0.000092567025,0.000008192659,0.000020444179,0.000026008502,0.0006019368,0.000059252307,0.00254207,0.9964165,0.00009117251],"about_ca_topic_score_codex":0.000028943019,"about_ca_topic_score_gemma":0.0000020093612,"teacher_disagreement_score":0.11711908,"about_ca_system_score_codex":0.000050806866,"about_ca_system_score_gemma":0.000007552235,"threshold_uncertainty_score":0.9967642},"labels":[],"label_agreement":null},{"id":"W6930925002","doi":"10.5281/zenodo.15372602","title":"FIGURE 8 in Three new species of the plant bug tribe Pilophorini from Japan (Hemiptera: Heteroptera: Miridae: Phylinae)","year":2025,"lang":"en","type":"other","venue":"Zenodo (CERN European Organization for Nuclear Research)","topic":"Polynomial and algebraic computation","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Agriculture and Agri-Food Canada","funders":"","keywords":"Holotype; Paratype; Dorsum; Ovipositor; Tribe; Male genitalia","score_opus":0.027053928478481787,"score_gpt":0.21559344816690423,"score_spread":0.18853951968842245,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6930925002","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0036902628,0.00069212884,0.02694455,0.002661704,0.0011665428,0.0009954051,0.0009070612,0.00089186104,0.9620505],"genre_scores_gemma":[0.2326541,0.00052942365,0.0036683327,0.0007950178,0.002085368,3.1428806e-7,0.00310629,0.004606125,0.752555],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.998212,0.00019289563,0.00034998695,0.00054857036,0.0004023424,0.0002942345],"domain_scores_gemma":[0.998713,0.000045560144,0.00025294442,0.00079033663,0.00010195252,0.00009619941],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.00018243566,0.00023439956,0.0003008821,0.00032943435,0.0003258491,0.00043276587,0.002731731,0.00012468762,0.0074940254],"category_scores_gemma":[0.00015017716,0.00019852149,0.00010105363,0.00071486307,0.0001009571,0.00012534445,0.0021620651,0.0003640845,0.001289605],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000028593013,0.00009364911,0.000023317798,0.00006187487,0.000056379664,0.000008305949,0.0006911026,0.000022583567,0.00041816878,0.005425099,0.89878404,0.094386905],"study_design_scores_gemma":[0.0005888353,0.000076607095,0.003924207,0.00033011357,0.000009853757,0.0000048371257,0.000019060308,0.0004988223,0.0004354801,0.0013477706,0.99255866,0.00020572587],"about_ca_topic_score_codex":0.0005980842,"about_ca_topic_score_gemma":0.000024405712,"teacher_disagreement_score":0.22896384,"about_ca_system_score_codex":0.00011027649,"about_ca_system_score_gemma":0.000028545843,"threshold_uncertainty_score":0.999488},"labels":[],"label_agreement":null},{"id":"W6957947819","doi":"10.6084/m9.figshare.12864788.v1","title":"Additional file 1 of Characterization and genomic analysis of a diesel-degrading bacterium, Acinetobacter calcoaceticus CA16, isolated from Canadian soil","year":2020,"lang":"en","type":"other","venue":"Figshare","topic":"Polynomial and algebraic computation","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Acinetobacter calcoaceticus; Soil bacteria; Bacteria; Strain (injury); Acinetobacter; Soil microbiology","score_opus":0.011648895296239801,"score_gpt":0.18809697090872954,"score_spread":0.17644807561248974,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6957947819","genre_codex":"dataset","genre_gemma":"dataset","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"dataset","genre_consensus":"dataset","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00009282456,0.000033286928,0.00013975399,0.00004561078,0.000038159495,0.000117290016,0.99673337,0.00005349259,0.002746192],"genre_scores_gemma":[0.0016901529,0.0000021076949,0.0006553352,0.00010381156,0.00013794616,0.00006931095,0.9900622,0.0000506439,0.007228504],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99898446,0.000036123245,0.00030087758,0.00037298445,0.00013518732,0.00017034635],"domain_scores_gemma":[0.998869,0.00022834928,0.00045324504,0.00022224867,0.00005779361,0.00016934467],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.000008666494,0.00020000432,0.0004477412,0.00051113986,0.000032688928,0.00005701278,0.00033473157,0.00016357863,0.93353724],"category_scores_gemma":[0.0001853187,0.00020459329,0.00011493768,0.00063393445,0.000010960469,0.00009900307,0.00013828279,0.00010582873,0.00019301614],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":true,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000020641905,0.00000601931,0.000007957983,0.00004761847,0.00030686765,0.0000048559577,0.00011141371,0.0000040208183,0.00028352195,0.0000022071702,0.9944307,0.0047927517],"study_design_scores_gemma":[0.00009648838,0.000026901133,0.026546538,0.0009871743,0.00010076752,0.0000010921259,0.000002917047,0.04395883,0.000029116833,0.000003435503,0.9279894,0.00025729014],"about_ca_topic_score_codex":0.008454987,"about_ca_topic_score_gemma":0.017556662,"teacher_disagreement_score":0.9333442,"about_ca_system_score_codex":0.000047819256,"about_ca_system_score_gemma":0.0002257716,"threshold_uncertainty_score":0.9981478},"labels":[],"label_agreement":null},{"id":"W6966853300","doi":"10.48550/arxiv.1101.1449","title":"Formal Theories for Linear Algebra","year":2011,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Polynomial and algebraic computation","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Algebra over a field; Universal algebra; Linear algebra; Term algebra; Algebra representation; Linear operators","score_opus":0.05957935455752031,"score_gpt":0.18761718210199788,"score_spread":0.12803782754447757,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6966853300","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.097160645,0.00003514015,0.8985931,0.000074872274,0.0009890109,0.00031569973,0.000016659258,0.00027551036,0.0025393297],"genre_scores_gemma":[0.98946923,0.0000248566,0.008758599,0.00012807906,0.00020740103,0.000002526404,0.000022211125,0.000013859479,0.0013732522],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985889,0.000050861145,0.00017445684,0.000750113,0.00005364227,0.00038197907],"domain_scores_gemma":[0.9987202,0.00011841708,0.00019991268,0.0006984183,0.00013544965,0.00012754551],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0002242618,0.00025398354,0.00025772254,0.00016032992,0.00020040077,0.00008426748,0.0015440587,0.00020292623,0.000017594786],"category_scores_gemma":[0.000027769078,0.00027103233,0.00025269462,0.00023144773,0.00008698624,0.0006103477,0.001757035,0.00026488118,0.00006310629],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000038521604,0.00004129279,0.00007797209,0.000048812937,0.00004776996,0.000019575165,0.00036407847,0.008496563,0.000007906819,0.9865538,0.00017715577,0.004126554],"study_design_scores_gemma":[0.0003413136,0.00006957379,0.0002411962,0.000028034594,0.000029927078,0.0000021245703,0.000019002064,0.33290547,0.0003809399,0.6648725,0.00080956466,0.00030033672],"about_ca_topic_score_codex":0.00006783253,"about_ca_topic_score_gemma":0.000016101143,"teacher_disagreement_score":0.8923086,"about_ca_system_score_codex":0.00006756644,"about_ca_system_score_gemma":0.00019503654,"threshold_uncertainty_score":0.9999742},"labels":[],"label_agreement":null},{"id":"W6968287511","doi":"10.5281/zenodo.15100608","title":"MATH+ Adventskaleder: Aufgaben und Lösungen 2024","year":2025,"lang":"de","type":"book","venue":"Zenodo (CERN European Organization for Nuclear Research)","topic":"Polynomial and algebraic computation","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"Deutsche Forschungsgemeinschaft","keywords":"Quarter (Canadian coin); Work (physics); Term (time)","score_opus":0.024889137636605673,"score_gpt":0.24983705187649116,"score_spread":0.2249479142398855,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6968287511","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0002772707,0.00366947,0.08226244,0.0036604812,0.0037703663,0.0021326144,0.0013315051,0.0023415824,0.9005543],"genre_scores_gemma":[0.012081169,0.0019328191,0.0022576016,0.0015803737,0.003594538,5.303497e-7,0.01502965,0.0047128964,0.95881045],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99505603,0.0006695701,0.000802474,0.0014991092,0.0009852973,0.000987541],"domain_scores_gemma":[0.99673337,0.00011238027,0.00043171374,0.0013486403,0.00090318406,0.00047069427],"candidate_categories":["metaepi_narrow","sts","scholarly_communication","insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.0011216949,0.0005820286,0.00054595765,0.0007968824,0.003775677,0.0036281236,0.00477007,0.00034065865,0.0092427535],"category_scores_gemma":[0.00047419732,0.000653862,0.0002736942,0.0011576974,0.00031352194,0.0005851487,0.0073500476,0.000999858,0.045934428],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003937622,0.00015160172,4.0186728e-7,0.0002811057,0.00030574747,0.000057478028,0.00067687494,0.000118680065,0.000045415356,0.063567206,0.52256525,0.41219088],"study_design_scores_gemma":[0.00063343643,0.0002543364,0.00015486986,0.00035082496,0.00015047262,0.000059235346,0.000031518633,0.00832719,0.000037101283,0.00437008,0.9850385,0.0005924027],"about_ca_topic_score_codex":0.000041112682,"about_ca_topic_score_gemma":0.0000010227162,"teacher_disagreement_score":0.4624733,"about_ca_system_score_codex":0.00079631916,"about_ca_system_score_gemma":0.00009106225,"threshold_uncertainty_score":0.9995913},"labels":[],"label_agreement":null},{"id":"W6969572482","doi":"10.5683/sp3/e4jcyl","title":"Data and Statistics at the Reference Desk - A Panel Discussion","year":2005,"lang":"en","type":"dataset","venue":"Borealis","topic":"Polynomial and algebraic computation","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Regina","funders":"","keywords":"Panel discussion; Session (web analytics); Desk; Reference data; Data collection; Summary statistics","score_opus":0.06258917321183308,"score_gpt":0.2933523609621764,"score_spread":0.2307631877503433,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6969572482","genre_codex":"dataset","genre_gemma":"dataset","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"dataset","genre_consensus":"dataset","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0000023426476,0.00021632039,0.028924232,0.001790351,0.00011793097,0.00012244903,0.968747,0.000033083816,0.00004628482],"genre_scores_gemma":[0.000008609759,0.00045218822,0.0050785,0.0004211622,0.00020965225,0.0000076198025,0.9935704,0.0000058584264,0.0002460455],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9986364,0.00009048846,0.00022644004,0.0005370156,0.00029823688,0.00021138303],"domain_scores_gemma":[0.9976547,0.00018216288,0.00017086102,0.0018681475,0.000029211293,0.00009495544],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00023794279,0.00019291503,0.00017360682,0.0000440528,0.00023338338,0.00024111013,0.0021170324,0.00009959968,0.000022847378],"category_scores_gemma":[0.000085039304,0.00009720092,0.000014461712,0.000094554714,0.00009295188,0.00022693415,0.003011303,0.00020619875,0.000027978738],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":true,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000031472032,0.000012287467,8.242752e-7,0.000013668559,0.000007716094,0.000008785946,0.000029470699,0.0000023912166,7.9311917e-7,0.00042176782,0.8887525,0.1107466],"study_design_scores_gemma":[0.00010330227,0.000023004986,0.0004925165,0.000030394447,0.000024833444,0.000024530822,0.000003356598,0.007718657,0.0000015004981,0.0012468317,0.99015987,0.00017119275],"about_ca_topic_score_codex":0.0056699724,"about_ca_topic_score_gemma":0.024806408,"teacher_disagreement_score":0.11057541,"about_ca_system_score_codex":0.00004160681,"about_ca_system_score_gemma":0.000108778855,"threshold_uncertainty_score":0.99298835},"labels":[],"label_agreement":null},{"id":"W6979261142","doi":"","title":"Homeomorphism type of the non-negative part of a complete toric variety","year":2025,"lang":"en","type":"article","venue":"ArXiv.org","topic":"Polynomial and algebraic computation","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Homeomorphism (graph theory); Variety (cybernetics); Type (biology); Toric variety; Decomposition; Argument (complex analysis)","score_opus":0.03463963447350462,"score_gpt":0.25219200140144404,"score_spread":0.21755236692793942,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6979261142","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9639341,0.000055684613,0.032062177,0.000995043,0.0011632823,0.00013728242,0.0000041409558,0.000024715699,0.0016235763],"genre_scores_gemma":[0.9983703,0.000004965557,0.00087847013,0.00026077667,0.000037151443,0.0000033365795,8.060649e-7,0.0000024717256,0.0004417268],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.99931353,0.000048214795,0.00021974748,0.00017160086,0.00012835357,0.00011854002],"domain_scores_gemma":[0.99919456,0.00015313008,0.00014085289,0.00036739992,0.00012054763,0.000023488281],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000121018624,0.00007780808,0.00016008053,0.000042640808,0.000069238165,0.000010076167,0.00057711673,0.00003096475,0.000009470602],"category_scores_gemma":[0.00006896107,0.000056340436,0.00006850035,0.0007764976,0.00008535168,0.000101868,0.00030684282,0.00008154063,0.000014620613],"study_design_candidate":"observational","study_design_consensus":"observational","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012196888,0.00073587557,0.62515324,0.0003122715,0.0004940299,0.000008766128,0.0088827945,0.0012478654,0.07759943,0.21951208,0.024352059,0.041579653],"study_design_scores_gemma":[0.00046647154,0.000096547294,0.9516262,0.000092914896,0.000018323035,0.0000012545992,0.000024988552,0.009625627,0.02307202,0.0108324215,0.004025569,0.000117683216],"about_ca_topic_score_codex":0.000120574274,"about_ca_topic_score_gemma":0.000009525004,"teacher_disagreement_score":0.32647297,"about_ca_system_score_codex":0.000022631433,"about_ca_system_score_gemma":0.00012823608,"threshold_uncertainty_score":0.22974963},"labels":[],"label_agreement":null},{"id":"W6979314228","doi":"","title":"Compatibility of Real-Rooted Polynomials with Mixed Signs","year":2024,"lang":"en","type":"article","venue":"arXiv (Cornell University)","topic":"Polynomial and algebraic computation","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Compatibility (geochemistry); Interlacing; Algebra over a field; Characterization (materials science); Invariant (physics); Orthogonal polynomials","score_opus":0.046948505715767426,"score_gpt":0.18584786393278574,"score_spread":0.13889935821701832,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6979314228","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.63206846,0.000019954237,0.3661718,0.00007755936,0.00015320495,0.00008410809,0.0000046322975,0.00017768225,0.001242631],"genre_scores_gemma":[0.99859875,0.0000084728,0.0009911206,0.000020421563,0.000028889666,2.0021145e-7,0.0000035026724,0.0000063715147,0.00034225066],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99901986,0.00008690533,0.00015213709,0.00048410767,0.000069746035,0.00018722129],"domain_scores_gemma":[0.99917936,0.00018046227,0.00006846389,0.0004101122,0.000069075395,0.000092544346],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00017423858,0.0001251991,0.00018403135,0.00014869495,0.00006531543,0.000054675467,0.0004958759,0.0000454707,0.000017803488],"category_scores_gemma":[0.0000103194925,0.00011393009,0.000076169046,0.00093823666,0.00010119765,0.00045715665,0.0001532807,0.0000934812,0.000035903195],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00014074738,0.00023700648,0.005302755,0.00015773105,0.00017296296,0.00037324225,0.0010217396,0.04052246,0.010210802,0.9272953,0.0009863157,0.013578885],"study_design_scores_gemma":[0.00079787755,0.00048154272,0.026196007,0.00012904365,0.000059521415,0.000012007017,0.00009002136,0.9310209,0.01045713,0.029807055,0.0005075656,0.00044130156],"about_ca_topic_score_codex":0.00039006208,"about_ca_topic_score_gemma":0.000107787724,"teacher_disagreement_score":0.8974883,"about_ca_system_score_codex":0.00007038396,"about_ca_system_score_gemma":0.00015190343,"threshold_uncertainty_score":0.4645934},"labels":[],"label_agreement":null},{"id":"W6979984054","doi":"","title":"Apples for Apples: Redundant Trade in British Columbia","year":2014,"lang":"en","type":"other","venue":"Arca (British Columbia Electronic Library Network)","topic":"Polynomial and algebraic computation","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Nucleofection; Gestational period; TSG101; Dysgeusia; Liquation; Diafiltration; Emperipolesis; Triacetin; Demotion","score_opus":0.004112914454479104,"score_gpt":0.17613781177899557,"score_spread":0.17202489732451645,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6979984054","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.001646504,0.06784769,0.036249585,0.002953493,0.008574489,0.018183181,0.0013274574,0.011366772,0.8518508],"genre_scores_gemma":[0.31101847,0.005347868,0.01858611,0.0032595985,0.0071642045,0.002015519,0.0017950675,0.001619925,0.6491932],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99424833,0.00028138186,0.0009223142,0.0017949619,0.0004644443,0.0022885704],"domain_scores_gemma":[0.9979901,0.00030954776,0.00052262604,0.0008461115,0.000016737114,0.00031490327],"candidate_categories":["metaepi_narrow","scholarly_communication","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00039114707,0.0003946514,0.0011262031,0.00010580365,0.00036431977,0.006845258,0.002325732,0.00060511846,0.015515459],"category_scores_gemma":[0.000025915086,0.0010065567,0.00038796308,0.0010693354,0.0001815889,0.0008103738,0.0005398721,0.00082289166,0.000032632557],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":true,"about_ca_topic_consensus":true,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000033776178,0.0001421111,0.0007549005,0.0001364404,0.00008049707,0.00006483934,0.00001599617,0.00005939231,3.8729073e-7,0.008394825,0.84678787,0.14355935],"study_design_scores_gemma":[0.0013969166,0.0003021811,0.0006879692,0.0011586323,0.0000273474,0.00022483565,0.0000044579533,0.006062984,7.272261e-7,0.23594442,0.7531738,0.0010157014],"about_ca_topic_score_codex":0.061667707,"about_ca_topic_score_gemma":0.8363892,"teacher_disagreement_score":0.7747215,"about_ca_system_score_codex":0.00016859255,"about_ca_system_score_gemma":0.0010258208,"threshold_uncertainty_score":0.9992385},"labels":[],"label_agreement":null},{"id":"W6982698738","doi":"","title":"ISSAC 2001 July 22 - 25, 2001, University of Western Ontario, London, Ontario, Canada ; proceedings of the 2001 International Symposium on Symbolic and Algebraic Computation","year":2001,"lang":"en","type":"article","venue":"","topic":"Polynomial and algebraic computation","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Algebraic number; Computation; Symbolic computation; Algebra over a field; Conjunction (astronomy)","score_opus":0.009088831870722635,"score_gpt":0.19075652750470795,"score_spread":0.18166769563398533,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6982698738","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.977929,0.000009338907,0.0041942145,0.00272071,0.00048228708,0.00023396204,0.0000061957844,0.00003515281,0.0143891135],"genre_scores_gemma":[0.983664,0.000013380325,0.0011638782,0.00044690058,0.000039459796,8.707484e-7,0.0000068303584,0.0000068815675,0.014657828],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.9985715,0.000020523743,0.00028879475,0.00036170508,0.00046710696,0.00029035268],"domain_scores_gemma":[0.9991392,0.00006657825,0.00027329082,0.00015085068,0.00024125894,0.00012885517],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00016664645,0.00017457176,0.0002261962,0.00008733208,0.00013190288,0.000057346082,0.0007233568,0.00005807791,0.00016541907],"category_scores_gemma":[0.000009748477,0.00015204163,0.000059426355,0.00029447724,0.000079206075,0.0004248445,0.000288825,0.00017450012,0.0000045037614],"study_design_candidate":"observational","study_design_consensus":"observational","about_ca_topic_candidate":true,"about_ca_topic_consensus":true,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00029020646,0.0007836002,0.692437,0.00009117144,0.00034538616,0.00004601259,0.009603435,0.00425116,0.004050584,0.012978554,0.25528675,0.019836145],"study_design_scores_gemma":[0.0019163534,0.00027152165,0.9169154,0.00015614471,0.000044836514,0.00008945108,0.00014407323,0.028953282,0.0013496707,0.002018517,0.047672674,0.00046808718],"about_ca_topic_score_codex":0.9452902,"about_ca_topic_score_gemma":0.98501104,"teacher_disagreement_score":0.22447838,"about_ca_system_score_codex":0.00057358784,"about_ca_system_score_gemma":0.0008336196,"threshold_uncertainty_score":0.62000775},"labels":[],"label_agreement":null},{"id":"W6984997124","doi":"","title":"Päärynä - Pyrus L.","year":2013,"lang":"fi","type":"other","venue":"Jukuri (Natural Resources Institute Finland (Luke))","topic":"Polynomial and algebraic computation","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Context (archaeology); Quarter (Canadian coin); Population","score_opus":0.011692651756018767,"score_gpt":0.22904028464186432,"score_spread":0.21734763288584555,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6984997124","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08494166,0.02273135,0.014371639,0.0061289463,0.034260146,0.0027694313,0.00019117839,0.0012325337,0.8333731],"genre_scores_gemma":[0.1064194,0.00066426315,0.0043166196,0.0018007614,0.0065266113,0.00008541091,0.00018595307,0.00026537903,0.8797356],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9933932,0.00026532752,0.0012185242,0.0021503763,0.0013289471,0.0016436198],"domain_scores_gemma":[0.99607867,0.00027911874,0.0010473583,0.0017026647,0.00020853689,0.00068362214],"candidate_categories":["metaepi_narrow","scholarly_communication","insufficient_payload"],"consensus_categories":["metaepi_narrow","insufficient_payload"],"category_scores_codex":[0.00039492137,0.0015194674,0.0014080404,0.0007745087,0.00080303143,0.0014792887,0.0035140452,0.0011612801,0.0025224795],"category_scores_gemma":[0.00023675681,0.0012345485,0.0006770062,0.0010591878,0.0007692937,0.0013091081,0.0016232178,0.0019818023,0.013533735],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012652541,0.00029991657,0.0003532645,0.00049940945,0.0005602982,0.0004567911,0.0034664841,0.0009811908,0.00013410412,0.02483788,0.3418885,0.62639564],"study_design_scores_gemma":[0.0013505346,0.00019296243,0.003675282,0.0006609598,0.00010383679,0.00012213469,0.00003106053,0.034743033,0.000072223644,0.001001329,0.95641154,0.0016350952],"about_ca_topic_score_codex":0.0015078082,"about_ca_topic_score_gemma":0.00030318968,"teacher_disagreement_score":0.62476057,"about_ca_system_score_codex":0.00031332576,"about_ca_system_score_gemma":0.00046027498,"threshold_uncertainty_score":0.99975544},"labels":[],"label_agreement":null},{"id":"W6995378820","doi":"","title":"Chapter 91: Sage","year":2014,"lang":"en","type":"article","venue":"Sound Ideas (University of Puget Sound)","topic":"Polynomial and algebraic computation","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Linear algebra; Linear subspace; Algebra over a field; Section (typography); Matrix algebra; Sign (mathematics)","score_opus":0.00976799711611769,"score_gpt":0.1901208202014271,"score_spread":0.1803528230853094,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6995378820","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.45710137,0.00002779283,0.5368941,0.00043896798,0.00018137766,0.000043641154,0.0000016492054,0.00008836687,0.0052227355],"genre_scores_gemma":[0.9909288,0.000005285974,0.007611277,0.0001488226,0.00006601572,7.6809734e-8,0.00000292638,0.0000049424307,0.0012318464],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99912983,0.000047548405,0.00009978353,0.00029008058,0.0002194521,0.00021332511],"domain_scores_gemma":[0.9992817,0.000077907265,0.000115617186,0.0003568735,0.00005809307,0.000109833934],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00021543023,0.000110260844,0.0001678753,0.00012508983,0.00023965634,0.000057340298,0.00070759456,0.00005517917,0.000097209675],"category_scores_gemma":[0.000020384663,0.00013168815,0.000113866954,0.00019684162,0.000118328215,0.0005774938,0.00029672286,0.000091216556,0.00020967652],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000005554691,0.000022078939,0.0004028259,0.000008165819,0.000014971084,0.000003919416,0.0009478203,0.00006736538,0.000029761442,0.9930023,0.00014928084,0.005345962],"study_design_scores_gemma":[0.00038006343,0.00006864534,0.0048601115,0.000010005606,0.00000896201,0.0000057012744,0.00012287214,0.013992973,0.000004133277,0.97763526,0.002758007,0.00015326405],"about_ca_topic_score_codex":0.00016663954,"about_ca_topic_score_gemma":0.00010798078,"teacher_disagreement_score":0.5338274,"about_ca_system_score_codex":0.000032729204,"about_ca_system_score_gemma":0.000024790115,"threshold_uncertainty_score":0.5370087},"labels":[],"label_agreement":null},{"id":"W7021116633","doi":"","title":"Monocromo antinaturalismo. Patkau Architects, Linear House, British Columbia, Canada.","year":2012,"lang":"it","type":"article","venue":"Virtual Community of Pathological Anatomy (University of Castilla La Mancha)","topic":"Polynomial and algebraic computation","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Set (abstract data type); Relation (database); Term (time); Selection (genetic algorithm)","score_opus":0.01689077477271695,"score_gpt":0.20904304617175093,"score_spread":0.19215227139903399,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7021116633","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.98569995,0.00056237157,0.011273562,0.00046505517,0.00045728587,0.00027356084,0.0002865433,0.00013442543,0.0008472242],"genre_scores_gemma":[0.9949964,0.00018616067,0.0037912386,0.00017429773,0.00007758091,3.7298625e-7,0.000027816886,0.000021883494,0.000724248],"study_design_codex":"design_other","study_design_gemma":"observational","domain_scores_codex":[0.99563307,0.0019907951,0.0004702213,0.00040397243,0.00069408945,0.0008078471],"domain_scores_gemma":[0.9967677,0.0009765367,0.0006514894,0.0007963978,0.00034225377,0.0004656141],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0012106344,0.0003179115,0.00089441135,0.00013807461,0.0009858841,0.000116328,0.0020887388,0.00036019477,0.00015315728],"category_scores_gemma":[0.00022525997,0.0004927858,0.0002912461,0.0007957254,0.0011305608,0.0005805956,0.0023738225,0.0014190464,0.000009854405],"study_design_candidate":"observational","study_design_consensus":null,"about_ca_topic_candidate":true,"about_ca_topic_consensus":true,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00040142107,0.0059099123,0.06795721,0.0010756829,0.00061257207,0.0035252837,0.034007918,0.0012423118,0.0020602704,0.017146897,0.013517511,0.852543],"study_design_scores_gemma":[0.0021594823,0.0013639783,0.9541285,0.000537768,0.00014947572,0.0006762052,0.006839879,0.012674463,0.0001507351,0.0013218658,0.018811049,0.0011866136],"about_ca_topic_score_codex":0.80627495,"about_ca_topic_score_gemma":0.68498415,"teacher_disagreement_score":0.8861713,"about_ca_system_score_codex":0.00013227024,"about_ca_system_score_gemma":0.00041368164,"threshold_uncertainty_score":0.9997524},"labels":[],"label_agreement":null},{"id":"W7022137050","doi":"","title":"","year":2021,"lang":"fr","type":"other","venue":"Directory of Open access Books (OAPEN Foundation)","topic":"Polynomial and algebraic computation","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Paid work; Context (archaeology); Gender relations","score_opus":0.10888053117931196,"score_gpt":0.38862361247747906,"score_spread":0.2797430812981671,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7022137050","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.022872282,0.0020074672,0.12671494,0.0054603084,0.0111730145,0.0049733464,0.000009069241,0.00029522553,0.82649434],"genre_scores_gemma":[0.11539119,0.0005232856,0.022630211,0.0027441168,0.0015862811,0.0006399774,0.0010212417,0.0005273565,0.85493636],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.98897046,0.0016919647,0.0029072901,0.0034063032,0.0016678997,0.0013560951],"domain_scores_gemma":[0.98933834,0.0013588688,0.004096154,0.0029545515,0.0015077074,0.0007443906],"candidate_categories":["metaepi_narrow","scholarly_communication","open_science","insufficient_payload"],"consensus_categories":["metaepi_narrow","scholarly_communication","open_science","insufficient_payload"],"category_scores_codex":[0.001757408,0.0016278506,0.0028518809,0.001094508,0.0010464488,0.022501396,0.023079142,0.00040313488,0.07384505],"category_scores_gemma":[0.0007202145,0.0018526404,0.00074927433,0.0021842837,0.0009994544,0.015780296,0.020872146,0.00088591164,0.00094432425],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":true,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000088961926,0.00062789145,0.0039144694,0.0005465358,0.0006080947,0.00009959232,0.0008450492,0.00043885206,0.0015601295,0.3601379,0.0008260653,0.6303064],"study_design_scores_gemma":[0.0026721691,0.00017890077,0.15667562,0.0031802075,0.00020088784,0.000065352724,0.00006258599,0.010220543,0.006111775,0.018097645,0.80020523,0.0023290687],"about_ca_topic_score_codex":0.016323527,"about_ca_topic_score_gemma":0.00794624,"teacher_disagreement_score":0.79937917,"about_ca_system_score_codex":0.00070478336,"about_ca_system_score_gemma":0.004928127,"threshold_uncertainty_score":0.9998336},"labels":[],"label_agreement":null},{"id":"W7023860005","doi":"","title":"Plasma functionalization of graphene nanoflakes for non-noble catalyst in fuel cells","year":2013,"lang":"en","type":"dissertation","venue":"eScholarship@McGill (McGill)","topic":"Polynomial and algebraic computation","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Graphene; Catalysis; Platinum; Nanocrystalline material; Nanomaterials; Graphite; Palladium; Crystallinity","score_opus":0.011131258291684558,"score_gpt":0.21647692607893598,"score_spread":0.2053456677872514,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7023860005","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.98332924,0.0001840958,0.0004227458,0.000021308893,0.0040191463,0.0016265233,0.00048731075,0.00019853981,0.009711098],"genre_scores_gemma":[0.98694885,0.00007553645,0.0054948535,0.00008200887,0.00006500828,0.000387271,0.0016002768,0.000085327774,0.0052608857],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9964632,0.00012896322,0.0011318909,0.0010700244,0.00064423494,0.00056170934],"domain_scores_gemma":[0.99736893,0.00034117332,0.00087269256,0.00064451655,0.00058704475,0.00018561799],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0005584635,0.00057041785,0.0007111216,0.00083470077,0.0003764397,0.00012421106,0.0010954781,0.0005173154,0.000038287115],"category_scores_gemma":[0.0001603884,0.00061192655,0.00035299198,0.0011363592,0.000040557185,0.0014443044,0.00013822381,0.00042210045,0.00009309001],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00031814596,0.00080090197,0.00005563714,0.0022272258,0.00029641006,0.000014880635,0.0001349255,0.0025570248,0.36275458,0.3641012,0.00016066755,0.2665784],"study_design_scores_gemma":[0.0038493671,0.0005448892,0.00366786,0.0010062548,0.00016415601,0.000014091333,0.0001922573,0.019267073,0.7843036,0.16652943,0.018366637,0.0020943703],"about_ca_topic_score_codex":0.0004927688,"about_ca_topic_score_gemma":0.0014663792,"teacher_disagreement_score":0.42154902,"about_ca_system_score_codex":0.00027494138,"about_ca_system_score_gemma":0.00013314781,"threshold_uncertainty_score":0.9996332},"labels":[],"label_agreement":null},{"id":"W7024342040","doi":"","title":"Risk management of large-diameter water transmission mains","year":2005,"lang":"en","type":"report","venue":"NPARC","topic":"Polynomial and algebraic computation","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mains electricity; Risk management; Transmission (telecommunications); Risk assessment; Electricity","score_opus":0.015191916261663599,"score_gpt":0.26004019335613127,"score_spread":0.24484827709446766,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7024342040","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0023638308,0.00028396898,0.7813066,0.0005020106,0.0009909641,0.00031916713,0.000027745955,0.00013814501,0.21406753],"genre_scores_gemma":[0.49079356,0.005699553,0.4609505,0.00029227865,0.0012357193,0.00007260408,0.00016488439,0.0000923787,0.04069852],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9978978,0.000067579094,0.00045030154,0.00046932104,0.00074627984,0.0003687],"domain_scores_gemma":[0.99905545,0.000026730568,0.00019505172,0.0005280392,0.00009933983,0.00009538641],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006461071,0.00022641513,0.0003301374,0.00016780125,0.000075789125,0.000048767673,0.00068323663,0.00014844198,0.0004248618],"category_scores_gemma":[0.0000037103364,0.00015954232,0.00022264049,0.0001286936,0.000022269693,0.00014377506,0.000289973,0.00023124431,0.000087676584],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000005133227,0.00010206908,0.000014708294,0.00020449448,0.00010325705,0.000031835076,0.00030206065,0.000043761305,0.0003996728,0.0014782184,0.009823215,0.98749155],"study_design_scores_gemma":[0.0006573317,0.00009671752,0.0017781679,0.00037984052,0.0001237736,0.000023865483,0.0000080118225,0.0116240755,0.0072637545,0.018448034,0.9590911,0.00050530647],"about_ca_topic_score_codex":0.000023482062,"about_ca_topic_score_gemma":0.0000035477524,"teacher_disagreement_score":0.9869863,"about_ca_system_score_codex":0.00009645424,"about_ca_system_score_gemma":0.00010479599,"threshold_uncertainty_score":0.6505947},"labels":[],"label_agreement":null},{"id":"W7024392819","doi":"","title":"Reimagining First Nations' Engagement in the Full Life Cycle of Oil and Gas Processing and Land Stewardship in Canada","year":2023,"lang":"en","type":"article","venue":"Scholarship@Western (Western University)","topic":"Polynomial and algebraic computation","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Stewardship (theology); Sustainability; Government (linguistics); Indigenous; Agency (philosophy); Natural resource; Local government; Petroleum industry; Indigenization","score_opus":0.05341206084158373,"score_gpt":0.2693162965100069,"score_spread":0.21590423566842315,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7024392819","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.99729985,0.00008032712,0.00032704542,0.0020464035,0.000064961656,0.00006521198,0.000003217089,0.00003072527,0.00008225835],"genre_scores_gemma":[0.9996599,0.0000699487,0.00006128391,0.00011027428,0.000015373938,0.0000011966146,0.0000026965834,0.0000052627665,0.00007404026],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.99887955,0.00019390658,0.0001786185,0.0002837872,0.00024361991,0.00022051018],"domain_scores_gemma":[0.99931204,0.00031481942,0.000096681164,0.00016752999,0.00003476122,0.00007415876],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005678599,0.00011147892,0.00014339732,0.00042990848,0.0001836441,0.00016733933,0.00045901854,0.000030450741,5.784514e-7],"category_scores_gemma":[0.00007104499,0.00009795483,0.00001408705,0.0010027947,0.000038575814,0.0008829764,0.0003442227,0.0002542653,0.0000016734878],"study_design_candidate":"observational","study_design_consensus":"observational","about_ca_topic_candidate":true,"about_ca_topic_consensus":true,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000011591239,0.000014925968,0.98230493,0.00009712417,0.0000048741267,0.000096894306,0.0022090506,0.0005244387,0.000021318361,0.0001205205,2.9449882e-7,0.014594023],"study_design_scores_gemma":[0.0006289002,0.000026267016,0.99723434,0.00021174122,0.0000057324182,0.000009330841,0.0006297633,0.000678742,0.000033483186,0.00021376587,0.00019970456,0.00012819907],"about_ca_topic_score_codex":0.009416227,"about_ca_topic_score_gemma":0.82563305,"teacher_disagreement_score":0.8162168,"about_ca_system_score_codex":0.0001166201,"about_ca_system_score_gemma":0.00039182222,"threshold_uncertainty_score":0.99718016},"labels":[],"label_agreement":null},{"id":"W7026484280","doi":"","title":"Abondance et impact des espèces concurrentes sur la régénération résineuse après coupe avec protection de la régénération dans un secteur de la forêt boréale du Québec","year":2019,"lang":"fr","type":"other","venue":"Corpus Université Laval (Université Laval)","topic":"Polynomial and algebraic computation","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Statistical analysis; Work safety; Epidemiological surveillance","score_opus":0.007926222263297256,"score_gpt":0.19653006414659893,"score_spread":0.18860384188330168,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7026484280","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7208164,0.0017374855,0.21923088,0.001507336,0.0008686286,0.0011825399,0.0001555737,0.0006330399,0.053868163],"genre_scores_gemma":[0.9196127,0.0021473323,0.0015416797,0.00010642722,0.00034244877,0.000009235765,0.00012424185,0.00018171655,0.07593424],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.995109,0.0019568184,0.00040940792,0.001127677,0.0005759882,0.00082110823],"domain_scores_gemma":[0.99650025,0.0011320397,0.0008434618,0.0006523783,0.00044719197,0.00042470207],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0009326056,0.00086108973,0.0007230182,0.0006696984,0.0009555764,0.0008089978,0.0013034734,0.00081833766,0.00015772885],"category_scores_gemma":[0.00022230847,0.001010641,0.00050193164,0.001167731,0.00082979945,0.0020316744,0.0005590031,0.00096266816,0.0001068286],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":true,"about_ca_topic_consensus":true,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0016762628,0.0020169083,0.087013096,0.0011827283,0.001597789,0.002120422,0.19606763,0.02683059,0.19887188,0.19177903,0.011463134,0.27938053],"study_design_scores_gemma":[0.00942949,0.0018743301,0.25333294,0.0018677545,0.001077095,0.0020552378,0.0020085785,0.2997617,0.03039452,0.004263889,0.3905777,0.0033567497],"about_ca_topic_score_codex":0.13159774,"about_ca_topic_score_gemma":0.07138267,"teacher_disagreement_score":0.37911457,"about_ca_system_score_codex":0.0030704313,"about_ca_system_score_gemma":0.00492813,"threshold_uncertainty_score":0.9992344},"labels":[],"label_agreement":null},{"id":"W7027376854","doi":"","title":"Convergence of discrete exterior calculus","year":2017,"lang":"en","type":"dissertation","venue":"eScholarship@McGill (McGill)","topic":"Polynomial and algebraic computation","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Triangulation; Convergence (economics); Calculus (dental); Zero (linguistics)","score_opus":0.014754739436892605,"score_gpt":0.2538447502438197,"score_spread":0.2390900108069271,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7027376854","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9168117,0.0005183945,0.0001350393,0.000049055656,0.006986169,0.0007667292,0.0005625232,0.00040451452,0.073765874],"genre_scores_gemma":[0.98575413,0.00012338124,0.0019920813,0.00009012954,0.000068206755,0.000061588886,0.0002104383,0.00007143927,0.0116286045],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99607706,0.00021119718,0.0009678215,0.0012265254,0.00086126145,0.00065613625],"domain_scores_gemma":[0.99610573,0.00015718881,0.0013374109,0.0016688013,0.0003935827,0.00033725624],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0005937748,0.00065911835,0.0008465573,0.0003189958,0.001040228,0.00021524534,0.003045514,0.00049893826,0.00012522424],"category_scores_gemma":[0.000431604,0.0006680502,0.0004513663,0.00038483893,0.00010181637,0.0015976861,0.0003913992,0.00078585796,0.00026031717],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000084259475,0.000106811596,0.000013852597,0.0003465576,0.00013079731,0.00008050492,0.00003176911,0.000026134565,0.0526104,0.23818296,0.000011622877,0.7083743],"study_design_scores_gemma":[0.0028597896,0.0008226751,0.016351819,0.0025080312,0.000366183,0.00010973164,0.00014686158,0.0056152255,0.7084013,0.16948844,0.088815585,0.0045143366],"about_ca_topic_score_codex":0.00051186973,"about_ca_topic_score_gemma":0.00045090856,"teacher_disagreement_score":0.70386,"about_ca_system_score_codex":0.00022751934,"about_ca_system_score_gemma":0.00014834052,"threshold_uncertainty_score":0.99957705},"labels":[],"label_agreement":null},{"id":"W7033397756","doi":"","title":"Power grid posts 36.6% drop in June quarter net profit","year":2022,"lang":"en","type":"other","venue":"","topic":"Polynomial and algebraic computation","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Power grid; Quarter (Canadian coin); Profit (economics); Net profit; Grid; Drop (telecommunication)","score_opus":0.0057200928833736325,"score_gpt":0.21644611229038072,"score_spread":0.21072601940700708,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7033397756","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00025093716,0.00024016976,0.011513237,0.0033898866,0.0041584233,0.0004647306,0.000013788832,0.0005784131,0.97939044],"genre_scores_gemma":[0.0036557836,0.000007888928,0.003646475,0.0012108632,0.0003409656,0.00004872189,0.000048051614,0.00012186878,0.99091935],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9985847,0.000072667135,0.00022608301,0.0005258414,0.00029124072,0.00029949204],"domain_scores_gemma":[0.9993121,0.000028028739,0.00011383652,0.00046565084,0.00001038592,0.00006996788],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00012533291,0.00022221504,0.00024393122,0.00036995113,0.000034799865,0.00009643757,0.0008274556,0.000105962456,0.011238634],"category_scores_gemma":[0.000005610023,0.00019729568,0.00007045733,0.00041739637,0.0000197131,0.00012089476,0.000411045,0.00024073603,0.00056199555],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00000337381,0.00003424525,0.00009892414,0.000010023334,0.0000112545595,0.0000385402,0.00018467376,0.0000056967865,0.000013610928,0.008256046,0.9872539,0.004089729],"study_design_scores_gemma":[0.0003907267,0.00009364089,0.0013171892,0.000032045995,0.0000024105066,0.000014710583,0.00002017984,0.002784964,0.0000137617535,0.0012314696,0.9936932,0.0004057288],"about_ca_topic_score_codex":0.00034435026,"about_ca_topic_score_gemma":0.00033459425,"teacher_disagreement_score":0.011528967,"about_ca_system_score_codex":0.00006948079,"about_ca_system_score_gemma":0.00009605282,"threshold_uncertainty_score":0.9896652},"labels":[],"label_agreement":null},{"id":"W7036735419","doi":"","title":"De lâimmersion à lâengagement, la perspective des concepteurs de jeux vidéo sur lâexpérience de jeu","year":2013,"lang":"fr","type":"other","venue":"Library and Archives Canada (Government of Canada)","topic":"Polynomial and algebraic computation","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Perspective (graphical); Ethical theory; Collaborative design","score_opus":0.006703631421355477,"score_gpt":0.16631163179580835,"score_spread":0.15960800037445289,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7036735419","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0635661,0.0024936697,0.043759253,0.007873627,0.000608563,0.00046092342,0.00013507351,0.000042669883,0.8810601],"genre_scores_gemma":[0.7009923,0.00071311253,0.012161879,0.0028545463,0.00023644257,0.00002340736,0.0000048135016,0.00007921166,0.28293428],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99655014,0.00046340848,0.00045295386,0.0005762312,0.0011638376,0.00079340674],"domain_scores_gemma":[0.99770325,0.0007701619,0.0005867461,0.0003026498,0.0000033850083,0.00063378975],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.000070379014,0.00041696682,0.00042332333,0.00005587813,0.0003773957,0.00018339613,0.00081736594,0.000094991636,0.0004382536],"category_scores_gemma":[0.00004108095,0.00043448672,0.00007722409,0.00017075229,0.000453871,0.0007224494,0.00049602403,0.0003941699,7.165825e-8],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":true,"about_ca_topic_consensus":true,"about_ca_system_candidate":true,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000116374904,0.00010544521,0.014518971,0.00038474222,0.00020302329,0.00030641476,0.004509949,0.00084283727,0.012825607,0.8537203,0.011754482,0.100711845],"study_design_scores_gemma":[0.001929734,0.0005391753,0.21051082,0.0022513284,0.00016886526,0.00017672728,0.021164639,0.19089155,0.06954683,0.03602416,0.4646036,0.0021925685],"about_ca_topic_score_codex":0.037190996,"about_ca_topic_score_gemma":0.023492796,"teacher_disagreement_score":0.81769615,"about_ca_system_score_codex":0.00013420206,"about_ca_system_score_gemma":0.005883639,"threshold_uncertainty_score":0.9998107},"labels":[],"label_agreement":null},{"id":"W7040765327","doi":"","title":"The Lens of Faith","year":2007,"lang":"en","type":"article","venue":"Fisher Digital Publications (St. John Fisher College)","topic":"Polynomial and algebraic computation","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Christianity; Faith; Natural (archaeology); History of Christianity; Lens (geology); History of science","score_opus":0.014451548619892774,"score_gpt":0.22191292593279,"score_spread":0.2074613773128972,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7040765327","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.026780397,0.00020254894,0.27109924,0.047724318,0.0014069513,0.0010488533,0.00033922956,0.0008314642,0.650567],"genre_scores_gemma":[0.9746724,0.000008189801,0.0024081795,0.00059700245,0.00018467916,0.000046556255,0.00007180677,0.000025846766,0.021985378],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9978982,0.00003578873,0.0006211092,0.0004566078,0.00048362688,0.0005046454],"domain_scores_gemma":[0.9976242,0.00053969515,0.00026191166,0.0009827896,0.00042736944,0.00016404355],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00051543606,0.00021003463,0.00020086062,0.0002340371,0.00041696854,0.0009717908,0.0016064589,0.00009437245,0.000047110927],"category_scores_gemma":[0.00022459014,0.00016459655,0.00015645512,0.0018813306,0.0001787001,0.0029764154,0.00039230034,0.00018762382,0.00007099674],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000021457941,0.00036678652,0.004411634,0.000015346066,0.00009581691,0.0000037536397,0.00033161498,0.000018466628,0.00005059246,0.37980542,0.50981206,0.10506705],"study_design_scores_gemma":[0.00038945797,0.000078248195,0.057213366,0.000012032384,0.000007551449,0.000017428463,0.000087162865,0.0018751612,0.00017029117,0.014108681,0.9257668,0.00027380057],"about_ca_topic_score_codex":0.000019308962,"about_ca_topic_score_gemma":0.00009787228,"teacher_disagreement_score":0.94789195,"about_ca_system_score_codex":0.0000941087,"about_ca_system_score_gemma":0.00024681038,"threshold_uncertainty_score":0.9371001},"labels":[],"label_agreement":null},{"id":"W7043734666","doi":"","title":"Towards Tropical Psi Classes","year":2021,"lang":"en","type":"article","venue":"Scholarship @ Claremont (The Claremont Colleges)","topic":"Polynomial and algebraic computation","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Tropical geometry; Exposition (narrative); Moduli space; Relation (database); Euler's formula; Field (mathematics); Algebra over a field","score_opus":0.024310532614138278,"score_gpt":0.26213392273887437,"score_spread":0.23782339012473608,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7043734666","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6071769,0.006772231,0.2180264,0.13758966,0.0070514423,0.0016489883,0.000056885045,0.0018592078,0.019818295],"genre_scores_gemma":[0.972384,0.00013044591,0.0182522,0.0057687378,0.0006959848,0.000062862404,0.000025582527,0.00005185156,0.0026283588],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"observational","domain_scores_codex":[0.99490786,0.00087212224,0.0007848558,0.0012262964,0.0012193075,0.0009895783],"domain_scores_gemma":[0.99638253,0.00043214133,0.00024969247,0.0018465611,0.0006353164,0.00045377648],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0008167319,0.0005286452,0.0005868703,0.00018548672,0.00095761276,0.0012666214,0.002548357,0.00036593562,0.0001338216],"category_scores_gemma":[0.00083869486,0.00041668033,0.00046774707,0.0017438639,0.00016728372,0.0014279889,0.0011618541,0.0013149864,0.00036777812],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00020767885,0.0010427132,0.010920357,0.00011722701,0.00051400444,0.0019351225,0.0018899972,0.00051286,0.009477041,0.5265678,0.025011493,0.42180368],"study_design_scores_gemma":[0.0046952376,0.00051873515,0.4312724,0.0003335155,0.00021955272,0.0010784045,0.0006419927,0.025530599,0.036287952,0.17523798,0.3216431,0.0025405108],"about_ca_topic_score_codex":0.00003785601,"about_ca_topic_score_gemma":0.00034820216,"teacher_disagreement_score":0.42035204,"about_ca_system_score_codex":0.000349716,"about_ca_system_score_gemma":0.0010978475,"threshold_uncertainty_score":0.9998285},"labels":[],"label_agreement":null},{"id":"W7092812258","doi":"10.1016/j.ifacol.2025.10.043","title":"Projective geometry in robust stabilization problems Part II: Möbius transformations","year":2025,"lang":"en","type":"article","venue":"IFAC-PapersOnLine","topic":"Polynomial and algebraic computation","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Safran Electronics (Canada)","funders":"","keywords":"Equivalence (formal languages); Factorization; Algebraic number; Algebra over a field; Coprime integers; Algebraic geometry; Representation (politics); Ideal (ethics)","score_opus":0.015544439055363573,"score_gpt":0.24028940011076863,"score_spread":0.22474496105540506,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7092812258","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3232394,0.0003062565,0.6632662,0.0076675373,0.0007159463,0.0009664552,0.000027711447,0.00033663094,0.0034738975],"genre_scores_gemma":[0.81796736,0.00007947671,0.17920783,0.0008693321,0.00014612367,0.00015975448,0.00012326578,0.000015069296,0.0014317568],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987028,0.00006364175,0.0003792219,0.00036815176,0.00019898727,0.00028718676],"domain_scores_gemma":[0.9994513,0.000085777574,0.000074918345,0.00024193517,0.00009393163,0.000052149724],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00025721983,0.00016036183,0.00018686023,0.0003950766,0.00020715421,0.00009183186,0.00037277857,0.00007947423,0.000026407293],"category_scores_gemma":[0.0000651058,0.00015005382,0.00006202575,0.0017739629,0.000037362242,0.0007383987,0.000106239364,0.000176079,0.000017232978],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007689404,0.002262749,0.006866386,0.00046784282,0.00014882337,0.000017359138,0.028923465,0.17820443,0.004124491,0.13869044,0.0002784916,0.6399386],"study_design_scores_gemma":[0.0020360432,0.00026007596,0.018172229,0.00030237043,0.000022663495,0.000008982176,0.00041893654,0.96258855,0.0017204979,0.009032565,0.0048977383,0.0005393526],"about_ca_topic_score_codex":0.00012000953,"about_ca_topic_score_gemma":0.0005674068,"teacher_disagreement_score":0.78438413,"about_ca_system_score_codex":0.00014176911,"about_ca_system_score_gemma":0.00022131314,"threshold_uncertainty_score":0.6119017},"labels":[],"label_agreement":null},{"id":"W7094742359","doi":"","title":"Review of &lt;i&gt;Weeds of the Midwestern United States &amp; Central Canada,&lt;/i&gt; edited by Charles T. Bryson and Michael S. DeFelice","year":2010,"lang":"","type":"article","venue":"Insecta mundi","topic":"Polynomial and algebraic computation","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Terminology; Weed; Identification (biology); Key (lock); Nomenclature; Geologist; Diversity (politics); Range (aeronautics)","score_opus":0.009258336171272459,"score_gpt":0.21468375797660066,"score_spread":0.20542542180532822,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7094742359","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9595877,0.030936858,0.0011086615,0.0034914175,0.0037493913,0.0006448212,0.00037283564,0.000030242705,0.00007810432],"genre_scores_gemma":[0.9843723,0.011726073,0.00033483567,0.0025760373,0.0003751776,0.000011046532,0.00016324526,0.000033954402,0.0004073348],"study_design_codex":"bench_or_experimental","study_design_gemma":"not_applicable","domain_scores_codex":[0.99638116,0.0003738789,0.0011333378,0.0006451701,0.00072438846,0.00074207754],"domain_scores_gemma":[0.99662143,0.0005550831,0.0010085929,0.001021634,0.0004616193,0.00033164176],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0005472111,0.0004756491,0.0006937338,0.00017973167,0.00027639145,0.000113720496,0.001548416,0.00018482064,0.00005713296],"category_scores_gemma":[0.00033407108,0.0003932675,0.00017636293,0.001402315,0.000536641,0.0003588846,0.0007017539,0.00050643936,0.0000036707152],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":true,"about_ca_topic_consensus":true,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00029712485,0.0016583541,0.03216068,0.021902708,0.0009570645,0.00002178975,0.021320775,0.00028311953,0.60140586,0.009199177,0.17468517,0.13610816],"study_design_scores_gemma":[0.0017896345,0.00030511263,0.11312216,0.009151639,0.00030766308,0.0001213873,0.000012395723,0.030901946,0.0040759016,0.0005267316,0.83841467,0.0012707668],"about_ca_topic_score_codex":0.4701473,"about_ca_topic_score_gemma":0.75130236,"teacher_disagreement_score":0.6637295,"about_ca_system_score_codex":0.000092997456,"about_ca_system_score_gemma":0.0009991577,"threshold_uncertainty_score":0.99985194},"labels":[],"label_agreement":null},{"id":"W7095313136","doi":"","title":"Canada. 1 Positivity in Power Series Rings.","year":2009,"lang":"en","type":"article","venue":"","topic":"Polynomial and algebraic computation","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Quadratic equation; Multiplication (music); Set (abstract data type); Representation (politics); Finite set; Ring (chemistry)","score_opus":0.004123168386934417,"score_gpt":0.19065173377095715,"score_spread":0.18652856538402274,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7095313136","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8352599,0.000035161964,0.079376936,0.027185112,0.00035954767,0.00009351826,0.0000011624115,0.00014423269,0.05754442],"genre_scores_gemma":[0.99453795,3.692851e-7,0.002900243,0.0019484947,0.000011099818,4.443764e-7,2.9075943e-7,7.229617e-7,0.00060040184],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"observational","domain_scores_codex":[0.9995783,0.000012297094,0.00007273539,0.00012174654,0.00009084503,0.00012410538],"domain_scores_gemma":[0.9998253,0.0000124413955,0.0000138174655,0.00010068878,0.000011488693,0.00003625328],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00005147279,0.00004594818,0.00005399228,0.000026896621,0.000032552674,0.00004164233,0.00017630424,0.000011441568,0.00000931945],"category_scores_gemma":[0.0000068585764,0.000040587176,0.0000092589,0.00015961229,0.00000459443,0.00031630133,0.000037247224,0.00003897483,0.0000044098156],"study_design_candidate":"observational","study_design_consensus":null,"about_ca_topic_candidate":true,"about_ca_topic_consensus":true,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009993282,0.000086661414,0.0018306461,0.0000022380332,0.0000037323944,0.000118452605,0.0005521865,0.00033416238,0.0016604628,0.8237822,0.0139129115,0.15770636],"study_design_scores_gemma":[0.00025849717,0.000100744124,0.94721025,0.0000103863,5.454305e-7,0.000028047129,0.000013878774,0.01156792,0.0062226243,0.025768366,0.008578231,0.0002405323],"about_ca_topic_score_codex":0.17009485,"about_ca_topic_score_gemma":0.392268,"teacher_disagreement_score":0.94537956,"about_ca_system_score_codex":0.000049349143,"about_ca_system_score_gemma":0.00019503257,"threshold_uncertainty_score":0.8354316},"labels":[],"label_agreement":null},{"id":"W7096934721","doi":"","title":"UNIVERSITY OF TORONTO Contents","year":2013,"lang":"en","type":"article","venue":"","topic":"Polynomial and algebraic computation","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Affine transformation; Intersection (aeronautics); Linear subspace; Ring (chemistry); Semigroup; Algebra over a field; Set (abstract data type)","score_opus":0.010479073746782903,"score_gpt":0.18620559065660708,"score_spread":0.1757265169098242,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7096934721","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.23791298,0.00004137497,0.7084688,0.00048255827,0.00014298639,0.000073167685,1.9586241e-7,0.00007139795,0.052806567],"genre_scores_gemma":[0.98903745,0.0000022661097,0.008987119,0.000059972725,0.0000048974207,5.9128936e-8,1.4317018e-7,4.056945e-7,0.0019076548],"study_design_codex":"design_other","study_design_gemma":"observational","domain_scores_codex":[0.9998191,0.0000065843797,0.000031365056,0.000057520203,0.00004108593,0.000044353445],"domain_scores_gemma":[0.99983513,0.000011329418,0.000016258815,0.000082751074,0.000029907951,0.000024634282],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000013714963,0.000018925666,0.00003248933,0.0000036899985,0.0000155103,0.000008915123,0.00019639546,0.000007876969,0.0003094187],"category_scores_gemma":[0.0000017731574,0.000017062925,0.000014827782,0.00001837867,0.0000084766225,0.00035667134,0.00007213563,0.0000071933846,0.00008993183],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":true,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000023888804,0.000070823495,0.0011531166,0.0000057000843,0.000016148699,0.0000016745399,0.0012895874,0.000015718397,0.008416832,0.26953053,0.017335111,0.7021624],"study_design_scores_gemma":[0.0017127835,0.000260055,0.52409637,0.000022420521,0.0000064802384,0.000006003893,0.0007872111,0.4095593,0.009145397,0.03638259,0.017591381,0.00042999518],"about_ca_topic_score_codex":0.007512098,"about_ca_topic_score_gemma":0.00018751554,"teacher_disagreement_score":0.7511245,"about_ca_system_score_codex":0.000011296697,"about_ca_system_score_gemma":0.0000066949638,"threshold_uncertainty_score":0.999097},"labels":[],"label_agreement":null},{"id":"W7097677607","doi":"","title":"Edmonton","year":2008,"lang":"en","type":"article","venue":"","topic":"Polynomial and algebraic computation","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Formal power series; Natural number; Series (stratigraphy); Multiplication (music); Polynomial; Complement (music); Power series; Sequence (biology); Section (typography)","score_opus":0.017154209905644938,"score_gpt":0.21352102844472684,"score_spread":0.1963668185390819,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7097677607","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.101912245,0.000022524271,0.8476219,0.00096189603,0.0001588975,0.000021707207,3.5877907e-8,0.00020391884,0.04909686],"genre_scores_gemma":[0.97422725,0.0000028206107,0.022765676,0.00043567395,0.000043186552,9.978743e-7,1.7319212e-7,8.967267e-7,0.0025233135],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997304,0.0000055609676,0.00004532985,0.00008642052,0.00006265318,0.00006960009],"domain_scores_gemma":[0.9998305,0.000012777753,0.000009047576,0.00010761476,0.0000101035985,0.000029961104],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000022135113,0.000026796746,0.000028865663,0.000019371852,0.000054706874,0.000012580932,0.00018697893,0.0000084735175,0.000018541754],"category_scores_gemma":[0.00000350764,0.000021506765,0.000015838228,0.0000901433,0.000008959943,0.00018100176,0.000053744774,0.000017602602,0.00018778519],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000018329586,0.000063262654,0.0009767396,0.0000018511172,0.0000060192897,0.000049199614,0.000917658,0.00009745384,0.0019265866,0.6230308,0.03683122,0.33609742],"study_design_scores_gemma":[0.0011313343,0.0002276421,0.2801973,0.000008535415,0.0000023765613,0.0005099386,0.000014157291,0.4520889,0.030649303,0.094309814,0.14013718,0.00072353554],"about_ca_topic_score_codex":0.000025419587,"about_ca_topic_score_gemma":0.0000021990097,"teacher_disagreement_score":0.87231505,"about_ca_system_score_codex":0.0000055162454,"about_ca_system_score_gemma":0.000018507746,"threshold_uncertainty_score":0.24136613},"labels":[],"label_agreement":null},{"id":"W7097818255","doi":"","title":"Edmonton","year":2008,"lang":"en","type":"article","venue":"","topic":"Polynomial and algebraic computation","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Formal power series; Natural number; Series (stratigraphy); Multiplication (music); Polynomial; Complement (music); Power series; Sequence (biology); Section (typography)","score_opus":0.017154209905644938,"score_gpt":0.21352102844472684,"score_spread":0.1963668185390819,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7097818255","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.101912245,0.000022524271,0.8476219,0.00096189603,0.0001588975,0.000021707207,3.5877907e-8,0.00020391884,0.04909686],"genre_scores_gemma":[0.97422725,0.0000028206107,0.022765676,0.00043567395,0.000043186552,9.978743e-7,1.7319212e-7,8.967267e-7,0.0025233135],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997304,0.0000055609676,0.00004532985,0.00008642052,0.00006265318,0.00006960009],"domain_scores_gemma":[0.9998305,0.000012777753,0.000009047576,0.00010761476,0.0000101035985,0.000029961104],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000022135113,0.000026796746,0.000028865663,0.000019371852,0.000054706874,0.000012580932,0.00018697893,0.0000084735175,0.000018541754],"category_scores_gemma":[0.00000350764,0.000021506765,0.000015838228,0.0000901433,0.000008959943,0.00018100176,0.000053744774,0.000017602602,0.00018778519],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000018329586,0.000063262654,0.0009767396,0.0000018511172,0.0000060192897,0.000049199614,0.000917658,0.00009745384,0.0019265866,0.6230308,0.03683122,0.33609742],"study_design_scores_gemma":[0.0011313343,0.0002276421,0.2801973,0.000008535415,0.0000023765613,0.0005099386,0.000014157291,0.4520889,0.030649303,0.094309814,0.14013718,0.00072353554],"about_ca_topic_score_codex":0.000025419587,"about_ca_topic_score_gemma":0.0000021990097,"teacher_disagreement_score":0.87231505,"about_ca_system_score_codex":0.0000055162454,"about_ca_system_score_gemma":0.000018507746,"threshold_uncertainty_score":0.24136613},"labels":[],"label_agreement":null},{"id":"W7098129587","doi":"","title":"ɛ","year":2013,"lang":"en","type":"article","venue":"","topic":"Polynomial and algebraic computation","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Calculus (dental); Algebraic number; Algebra over a field; Natural (archaeology)","score_opus":0.008539159767639136,"score_gpt":0.20263251489579195,"score_spread":0.19409335512815282,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7098129587","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.038262434,0.0000056721287,0.9074003,0.0028107907,0.000116652365,0.000032100415,8.624869e-9,0.00014816046,0.051223844],"genre_scores_gemma":[0.9617616,1.8726575e-7,0.035555605,0.00073141366,0.000021326136,0.0000034741236,7.309367e-8,5.4554204e-7,0.0019257773],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99982285,0.0000034360064,0.000030888677,0.000056637393,0.000033757595,0.0000524482],"domain_scores_gemma":[0.9998695,0.000010294719,0.000005420814,0.000080378304,0.000010694644,0.000023675511],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.000013672603,0.000017327942,0.000016629372,0.0000125673505,0.000015856118,0.000062185216,0.00015784906,0.000005143059,0.0001475228],"category_scores_gemma":[0.0000022653244,0.000012780989,0.00000858509,0.00005866691,0.000003097874,0.0002718007,0.000049454313,0.000010738081,0.0018063271],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[2.9345788e-8,0.000006320749,0.00007388012,3.692019e-7,8.8936804e-7,2.691672e-7,0.000047107085,0.000006697023,0.0007273541,0.42181203,0.01625596,0.5610691],"study_design_scores_gemma":[0.00019335769,0.000039757815,0.062485997,0.0000021549686,4.5849342e-7,0.000009383056,0.00000861056,0.48139837,0.006351612,0.4302361,0.019093256,0.0001809351],"about_ca_topic_score_codex":0.000048405636,"about_ca_topic_score_gemma":5.602229e-7,"teacher_disagreement_score":0.92349917,"about_ca_system_score_codex":0.0000024710293,"about_ca_system_score_gemma":0.0000054229818,"threshold_uncertainty_score":0.99897087},"labels":[],"label_agreement":null},{"id":"W7098188037","doi":"","title":"Research Article The Impact of Exercise Consultation on Activity Levels and Metabolic Markers in Obese Adolescents: A Pilot Study","year":2013,"lang":"en","type":"article","venue":"","topic":"Polynomial and algebraic computation","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Anthropometry; Physical activity; Obesity; Randomized controlled trial; Intervention (counseling); Body mass index; Physical exercise; Research article","score_opus":0.060680200104155806,"score_gpt":0.3444988577273788,"score_spread":0.283818657623223,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7098188037","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9970929,0.00002869693,0.0016430399,0.00024501226,0.000024110937,0.0007954075,6.737286e-7,0.000018982402,0.00015116135],"genre_scores_gemma":[0.9997573,0.0000039006886,0.00013480819,0.000014200698,0.0000069153025,0.00003904489,7.266825e-8,0.0000029968103,0.000040757375],"study_design_codex":"design_other","study_design_gemma":"observational","domain_scores_codex":[0.99881697,0.00034479934,0.0001506378,0.00021307073,0.00026917303,0.00020536987],"domain_scores_gemma":[0.9992219,0.00031128156,0.00004440986,0.00024408086,0.00011653078,0.00006175247],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00086937344,0.00007731827,0.00012618498,0.00015470845,0.0000750853,0.00011669136,0.00026020646,0.000012298134,0.00001699886],"category_scores_gemma":[0.00011132671,0.00004583718,0.000019212383,0.00065264775,0.00006745413,0.00046512712,0.00015763118,0.00014037857,0.000026908074],"study_design_candidate":"observational","study_design_consensus":null,"about_ca_topic_candidate":true,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00076858565,0.0071379268,0.12753545,0.000041878957,0.00007448908,0.000008414286,0.012028307,0.0014981942,0.033064533,0.004098081,0.00058099447,0.81316316],"study_design_scores_gemma":[0.000844735,0.000699338,0.9322141,0.000031598956,0.0000017120205,6.8174745e-7,0.00032420695,0.062349018,0.0017614694,0.0017223794,2.0747822e-7,0.00005054526],"about_ca_topic_score_codex":0.006705631,"about_ca_topic_score_gemma":0.000118023694,"teacher_disagreement_score":0.8131126,"about_ca_system_score_codex":0.00003126003,"about_ca_system_score_gemma":0.000061289466,"threshold_uncertainty_score":0.9999088},"labels":[],"label_agreement":null},{"id":"W7098437365","doi":"","title":"General Terms","year":2008,"lang":"en","type":"article","venue":"","topic":"Polynomial and algebraic computation","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Beluga; Beluga Whale; Simple (philosophy); Interface (matter)","score_opus":0.017322097899577064,"score_gpt":0.2206561686988762,"score_spread":0.20333407079929913,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7098437365","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.30189118,0.000008469171,0.66896343,0.0007264754,0.00021459945,0.000021305364,6.8095154e-8,0.00016703372,0.028007444],"genre_scores_gemma":[0.9479956,0.0000020889065,0.04618592,0.00073054177,0.00009351093,0.000001313528,3.6836923e-7,0.0000012488201,0.0049894005],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99968785,0.0000064625806,0.00005360968,0.00010144788,0.0000664047,0.000084231],"domain_scores_gemma":[0.9998218,0.000008521496,0.000010327848,0.00011729691,0.0000074141453,0.000034665267],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000020553183,0.00003271055,0.000033867647,0.00002230327,0.000060632447,0.000017821778,0.00021456627,0.000009727219,0.000020982],"category_scores_gemma":[0.0000023231605,0.000025327485,0.000019706535,0.00008599147,0.000011924496,0.00017502306,0.00006955614,0.000019993895,0.00015985803],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000018186557,0.000063981985,0.0029245578,0.000001998003,0.000008353136,0.00007587455,0.0007463499,0.00024790948,0.003639415,0.64337194,0.037231863,0.31168598],"study_design_scores_gemma":[0.0008091034,0.00013720126,0.20449084,0.0000044118838,0.0000017157727,0.00050652545,0.0000032255355,0.64272296,0.023725549,0.06929491,0.05778148,0.00052208145],"about_ca_topic_score_codex":0.000019255305,"about_ca_topic_score_gemma":0.0000010952091,"teacher_disagreement_score":0.64610445,"about_ca_system_score_codex":0.0000057140905,"about_ca_system_score_gemma":0.000015562742,"threshold_uncertainty_score":0.20547049},"labels":[],"label_agreement":null},{"id":"W7098818820","doi":"","title":"A Critical Cost Benefit Analysis of","year":2006,"lang":"en","type":"article","venue":"","topic":"Polynomial and algebraic computation","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Cost–benefit analysis; Cost benefit; Data collection; Benefit analysis","score_opus":0.010551161888253568,"score_gpt":0.25532903579694594,"score_spread":0.24477787390869238,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7098818820","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08387744,0.000019224384,0.9046346,0.0006988159,0.00005718032,0.000023326182,0.0000015675379,0.00004889879,0.010638971],"genre_scores_gemma":[0.98449653,2.2283545e-7,0.015117016,0.00010271578,0.000019953566,0.0000014617707,0.0000023700454,8.364029e-7,0.00025888337],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995617,0.000006894436,0.00012600711,0.00011638661,0.00010213513,0.00008687857],"domain_scores_gemma":[0.99966586,0.00010243944,0.000018890041,0.00013882332,0.000049711503,0.000024252478],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00005278072,0.0000352458,0.00009658058,0.00013791079,0.000021574624,0.00003368344,0.00018584213,0.00001395192,0.000047282432],"category_scores_gemma":[0.000011924843,0.000029762936,0.000068865,0.0007458108,0.000020046587,0.00013283361,0.000056656543,0.00001710678,0.000010885548],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[6.5858785e-7,0.00003927654,0.0011573313,0.000001317382,0.000024886796,0.0000010977791,0.000018011404,0.0019125,0.00030000886,0.9725401,0.00026707922,0.02373775],"study_design_scores_gemma":[0.00008945237,0.000020779244,0.16175272,0.0000019509737,0.0000660555,9.741537e-7,0.0000026543087,0.7855276,0.0024500557,0.049481086,0.00052599027,0.00008070705],"about_ca_topic_score_codex":0.00032480527,"about_ca_topic_score_gemma":0.000106017455,"teacher_disagreement_score":0.923059,"about_ca_system_score_codex":0.000007321068,"about_ca_system_score_gemma":0.000010289786,"threshold_uncertainty_score":0.12136973},"labels":[],"label_agreement":null},{"id":"W7100316805","doi":"","title":"Learning Matrix Functions over Rings (Extended Abstract)","year":2007,"lang":"en","type":"article","venue":"","topic":"Polynomial and algebraic computation","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Class (philosophy); Matrix (chemical analysis); Commutative ring; Identity matrix; Ring (chemistry); Identity (music); Decision tree; Polynomial","score_opus":0.009084097157487028,"score_gpt":0.25560853305545567,"score_spread":0.24652443589796863,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7100316805","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.28267106,0.000017226545,0.6956206,0.00026054017,0.00036142094,0.000041559313,1.9411063e-7,0.0003580552,0.020669315],"genre_scores_gemma":[0.9838833,9.653639e-7,0.008274421,0.00016149905,0.000121491634,0.0000011058814,0.0000022603544,0.0000041684925,0.0075507835],"study_design_codex":"design_other","study_design_gemma":"observational","domain_scores_codex":[0.9992515,0.0000071550435,0.00016011953,0.00020334283,0.00015396938,0.00022392793],"domain_scores_gemma":[0.9996027,0.00009444273,0.00005055742,0.00013994682,0.000029810919,0.00008257313],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00027912002,0.00007478348,0.000064394335,0.00009527657,0.00014789647,0.00010734788,0.00021696255,0.00003349081,0.00015204278],"category_scores_gemma":[0.000021681148,0.00006694014,0.000047659407,0.00024455093,0.0000140427455,0.00038893567,0.000102081096,0.00013500167,0.00030284462],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000012897854,0.000101624726,0.0019004589,0.000008982375,0.000022052156,0.00003056502,0.00069133774,0.0013883675,0.0051681614,0.1265955,0.00291986,0.8611602],"study_design_scores_gemma":[0.00077141274,0.00018166946,0.82666034,0.000016292797,0.00000825118,0.000050028153,0.00014271759,0.07927239,0.0037824237,0.009898009,0.07871125,0.0005052178],"about_ca_topic_score_codex":0.00012621892,"about_ca_topic_score_gemma":0.000032273885,"teacher_disagreement_score":0.86065495,"about_ca_system_score_codex":0.000029492694,"about_ca_system_score_gemma":0.000024959181,"threshold_uncertainty_score":0.38925558},"labels":[],"label_agreement":null},{"id":"W7100344856","doi":"","title":"Book Review of G","year":2001,"lang":"en","type":"article","venue":"","topic":"Polynomial and algebraic computation","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Indigenous; Ethnic group; Ethnography; Publishing; Independence (probability theory); Period (music)","score_opus":0.01193746651520978,"score_gpt":0.24680598901461412,"score_spread":0.23486852249940435,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7100344856","genre_codex":"methods","genre_gemma":"commentary","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00013896878,0.19344759,0.74810255,0.010204546,0.00013251942,0.000075558826,9.453226e-8,0.000086797285,0.04781141],"genre_scores_gemma":[0.03962344,0.22004987,0.079613276,0.56859034,0.0003418793,0.000021489474,0.000004964336,0.000014762182,0.09173996],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99972427,0.000008790468,0.000089240064,0.00006437195,0.00006471638,0.000048626902],"domain_scores_gemma":[0.9997952,0.000015479483,0.000025661586,0.00012430079,0.000020313217,0.000019026047],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000058274487,0.000023703082,0.000054374024,0.000014379523,0.000008941716,0.00000507346,0.00018592927,0.0000053756958,0.00034554704],"category_scores_gemma":[0.000008064926,0.000018104274,0.00002357119,0.00012611852,0.0000057780812,0.00013673682,0.000048966747,0.000012629521,0.00005447413],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[4.831389e-7,0.000021224549,0.000024239114,0.00020145779,0.0000029434482,0.0000030708425,0.000021640146,0.0000023791677,0.00009876278,0.039492875,0.69162977,0.26850116],"study_design_scores_gemma":[0.0000568375,0.000020991423,0.00043140858,0.00034537012,0.0000011787332,0.000011577374,2.7053343e-7,0.0038950192,0.0007581913,0.0014709489,0.9929631,0.000045108874],"about_ca_topic_score_codex":0.000005059859,"about_ca_topic_score_gemma":1.9403613e-7,"teacher_disagreement_score":0.6684892,"about_ca_system_score_codex":0.0000030248957,"about_ca_system_score_gemma":0.0000144474725,"threshold_uncertainty_score":0.37834978},"labels":[],"label_agreement":null},{"id":"W7100553861","doi":"","title":"PAPERS","year":2010,"lang":"en","type":"article","venue":"","topic":"Polynomial and algebraic computation","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Field (mathematics); Calculus (dental); Human anatomy; Natural (archaeology)","score_opus":0.0057658236000847,"score_gpt":0.20877597255284538,"score_spread":0.20301014895276068,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7100553861","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.25080943,0.000003432967,0.35739398,0.0043069627,0.0014868797,0.00004276365,9.181546e-8,0.00040827953,0.38554817],"genre_scores_gemma":[0.96864915,1.4488926e-7,0.029540466,0.00053281477,0.00005145982,8.331922e-7,1.250671e-7,7.9187595e-7,0.001224225],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99977857,0.000002623496,0.000033986038,0.00007844066,0.000045195302,0.000061160325],"domain_scores_gemma":[0.99981856,0.000015736925,0.00000722125,0.000119930286,0.0000067208875,0.000031846128],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000035875804,0.000023091492,0.000020222944,0.000014664598,0.0000270493,0.000040616003,0.00021362657,0.000011368431,0.000086397034],"category_scores_gemma":[0.0000067030237,0.000017719092,0.000013162461,0.00006441046,0.000007482971,0.00010802218,0.00005079845,0.000043963297,0.00014736086],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[1.355222e-7,0.000005826101,0.00007630452,2.6239954e-7,7.4897963e-7,8.541919e-7,0.00004326475,0.0000020370057,0.025525957,0.6483517,0.00079651695,0.3251964],"study_design_scores_gemma":[0.00065362937,0.00008834645,0.08416841,0.0000030965934,0.0000025363095,0.00006252754,0.000014872337,0.16520874,0.060430467,0.16559425,0.5232277,0.00054545025],"about_ca_topic_score_codex":0.00000891131,"about_ca_topic_score_gemma":0.000015529171,"teacher_disagreement_score":0.7178397,"about_ca_system_score_codex":0.0000011863684,"about_ca_system_score_gemma":0.000012326781,"threshold_uncertainty_score":0.18940748},"labels":[],"label_agreement":null},{"id":"W7100670250","doi":"","title":"AN ANALYSIS OF THE REAL INTEREST RATE UNDER REGIME SHIFTS","year":2011,"lang":"en","type":"article","venue":"","topic":"Polynomial and algebraic computation","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Corporation; Private sector; Product (mathematics); Market research; Private enterprise","score_opus":0.04587961553430887,"score_gpt":0.25953868748296854,"score_spread":0.21365907194865968,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7100670250","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7402092,0.000002026912,0.25416642,0.00024736093,0.00011729248,0.0000294178,4.591664e-7,0.000042317806,0.005185496],"genre_scores_gemma":[0.99728227,9.390547e-7,0.0022418373,0.00023061117,0.000012235423,8.213997e-7,7.045662e-7,0.000001684702,0.0002289054],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"observational","domain_scores_codex":[0.9994808,0.00007722503,0.00012881635,0.00015838273,0.00006720192,0.000087562905],"domain_scores_gemma":[0.9993932,0.00003002018,0.00006928815,0.00043951915,0.000029729845,0.00003823107],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001531681,0.00005129862,0.0000934325,0.00008827696,0.00003593054,0.0000268619,0.00066905294,0.000018923853,0.000047808888],"category_scores_gemma":[0.0000045547376,0.000030841424,0.00007877838,0.00062060775,0.000034036933,0.00021848404,0.00013582908,0.0000341481,0.000007953558],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009473181,0.00011860077,0.007024715,0.0000018045846,0.00021075083,0.000001366917,0.0025845557,0.0005663741,0.0022266917,0.97123826,0.00013826939,0.015879132],"study_design_scores_gemma":[0.000071099304,0.00004060561,0.8092505,0.0000027230687,0.00005100093,2.58604e-7,0.00003844339,0.16795732,0.004182388,0.01832113,0.00001786516,0.0000667155],"about_ca_topic_score_codex":0.00074257934,"about_ca_topic_score_gemma":0.0007579047,"teacher_disagreement_score":0.95291716,"about_ca_system_score_codex":0.000009998252,"about_ca_system_score_gemma":0.000025383159,"threshold_uncertainty_score":0.12576768},"labels":[],"label_agreement":null},{"id":"W7100754491","doi":"","title":"Public Pensions and Elderly Mortality in Canada: Comparing Means Tested and Universal Eligibility, 1921–1966","year":2010,"lang":"en","type":"article","venue":"","topic":"Polynomial and algebraic computation","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Government (linguistics); Pension; Value (mathematics); Value of life; Meaning (existential); Social security; Mortality rate; Present value","score_opus":0.038494888627118834,"score_gpt":0.24712270860891025,"score_spread":0.20862781998179142,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7100754491","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9901475,0.000012176563,0.0062416727,0.0012575616,0.00017974238,0.00009034181,0.0000011731654,0.00004928645,0.0020205763],"genre_scores_gemma":[0.99742013,0.0000021077828,0.0024019242,0.00012426311,0.000014118036,0.0000010578425,0.0000015396979,0.0000023479158,0.00003248371],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.9991574,0.000033389835,0.00016061624,0.00030678755,0.00014003199,0.00020176386],"domain_scores_gemma":[0.99940544,0.00012396544,0.00003565038,0.00023135594,0.00004257368,0.00016101658],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001830656,0.00008990761,0.00013921507,0.00007019076,0.00009399172,0.00011954948,0.00022541116,0.000028537695,0.000008732582],"category_scores_gemma":[0.000048092235,0.000082175095,0.000010664253,0.00022850302,0.000052118627,0.00038216036,0.00028737416,0.00016922948,0.0000011606436],"study_design_candidate":"observational","study_design_consensus":"observational","about_ca_topic_candidate":true,"about_ca_topic_consensus":true,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000020474197,0.00004268668,0.9069461,0.000010249967,0.000010134757,0.000022453005,0.00028979505,0.000043911437,0.0011933729,0.064315766,0.00026269865,0.026860781],"study_design_scores_gemma":[0.00026568794,0.000014990181,0.8168939,0.0000037622058,0.0000021635606,0.0000135531545,0.00004799079,0.17971274,0.00007742973,0.0027055212,0.00015457637,0.000107682215],"about_ca_topic_score_codex":0.7295812,"about_ca_topic_score_gemma":0.9888627,"teacher_disagreement_score":0.25928155,"about_ca_system_score_codex":0.00005834344,"about_ca_system_score_gemma":0.0005700935,"threshold_uncertainty_score":0.33510032},"labels":[],"label_agreement":null},{"id":"W7101439414","doi":"10.5281/zenodo.17457855","title":"Code for Coexistence in Periodic Environments","year":2025,"lang":"","type":"other","venue":"Zenodo (CERN European Organization for Nuclear Research)","topic":"Polynomial and algebraic computation","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto; University of Guelph","funders":"","keywords":"Code (set theory); Code generation; Source code; Software","score_opus":0.03096531963115837,"score_gpt":0.2476467798897201,"score_spread":0.21668146025856172,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7101439414","genre_codex":"methods","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0006718665,0.00067743764,0.49899194,0.002130658,0.001077503,0.0030464414,0.0014484813,0.00071890047,0.49123678],"genre_scores_gemma":[0.29278907,0.0018258345,0.012454785,0.0020575314,0.0015737333,0.000001880883,0.0064272764,0.012102262,0.6707676],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99627805,0.0004837254,0.000629893,0.0013121886,0.00053236395,0.00076375884],"domain_scores_gemma":[0.9982743,0.00008604693,0.000339863,0.0008737248,0.00018678817,0.00023923267],"candidate_categories":["metaepi_narrow","sts","scholarly_communication","insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.00086674094,0.00041020568,0.00043556,0.0007304451,0.0019694872,0.0016819717,0.003327398,0.0002308951,0.009841957],"category_scores_gemma":[0.0005635205,0.00048190542,0.00014723862,0.0009057916,0.00033049285,0.0003370178,0.0029929478,0.00046440956,0.006713465],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013615077,0.00052414037,0.0000029402281,0.00038587532,0.000102723556,0.000029848365,0.0027224328,0.0004548831,0.0010163856,0.022807775,0.27296355,0.69885325],"study_design_scores_gemma":[0.0012075069,0.00032078833,0.00038502095,0.000317132,0.000020364707,0.000025038888,0.00009087458,0.017367901,0.00011284637,0.0008855101,0.9788263,0.0004407031],"about_ca_topic_score_codex":0.00004102402,"about_ca_topic_score_gemma":0.0000035472754,"teacher_disagreement_score":0.70586276,"about_ca_system_score_codex":0.0004741349,"about_ca_system_score_gemma":0.0000323953,"threshold_uncertainty_score":0.99976325},"labels":[],"label_agreement":null},{"id":"W7102496730","doi":"10.5281/zenodo.17488075","title":"Rigorous Proof that 196 is a Lychrel Number: Modular Obstructions and Computational Certification","year":2025,"lang":"en","type":"preprint","venue":"Zenodo (CERN European Organization for Nuclear Research)","topic":"Polynomial and algebraic computation","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Modular design; Modulo; Mathematical proof; Algebraic number; Computational complexity theory; Algebra over a field; Proof assistant; Lift (data mining); Invariant (physics)","score_opus":0.040265608444516286,"score_gpt":0.2564458483170466,"score_spread":0.2161802398725303,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7102496730","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.017112255,0.00026455754,0.9477862,0.0051615653,0.00073410035,0.0011429243,0.0005355149,0.0015638497,0.025698999],"genre_scores_gemma":[0.97634166,0.000103843966,0.018567549,0.00045198936,0.00021788767,6.608916e-7,0.0024182193,0.0004493815,0.0014488047],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9976075,0.00027933446,0.00036506547,0.00094138924,0.0004888505,0.00031785437],"domain_scores_gemma":[0.9982271,0.00004811522,0.00024642405,0.00071551057,0.00059376995,0.00016904717],"candidate_categories":["metaepi_narrow","sts","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.00038115864,0.00025497962,0.00023530742,0.00030485445,0.0018764767,0.0018323751,0.0015971668,0.0001599428,0.0006935383],"category_scores_gemma":[0.00013502383,0.00028887222,0.00008686182,0.000513911,0.00015501569,0.00039022634,0.0041846726,0.00049391534,0.0007107382],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004131873,0.00031807963,0.000021185331,0.00046894,0.00021743264,0.000012945519,0.0052206675,0.01384824,0.00028497295,0.09465123,0.10310136,0.7818136],"study_design_scores_gemma":[0.00073938677,0.00009004764,0.0043903845,0.00020047514,0.00004863672,0.00023540125,0.00009363596,0.37835014,0.00045495076,0.08612163,0.5286175,0.0006578305],"about_ca_topic_score_codex":0.000058312835,"about_ca_topic_score_gemma":3.55475e-7,"teacher_disagreement_score":0.9592294,"about_ca_system_score_codex":0.0002051208,"about_ca_system_score_gemma":0.000029415844,"threshold_uncertainty_score":0.99995637},"labels":[],"label_agreement":null},{"id":"W7104542363","doi":"10.1145/3747199.3747556","title":"Symbolic Mathematical Computation 1965–1975","year":2025,"lang":"","type":"article","venue":"","topic":"Polynomial and algebraic computation","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo; Western University","funders":"","keywords":"Event (particle physics); Symbolic-numeric computation; Computation; Ideal (ethics); The Symbolic; Symbolic computation; Formative assessment; Moment (physics)","score_opus":0.014457318140394549,"score_gpt":0.26981524320599926,"score_spread":0.25535792506560473,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7104542363","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01226964,0.00029882524,0.86371535,0.0038234224,0.0018129232,0.00038912756,0.0000019398824,0.0002859467,0.117402814],"genre_scores_gemma":[0.9386101,0.0000203491,0.030293409,0.002272179,0.00020884785,0.000017725764,0.000006219981,0.000013128561,0.028558047],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9972108,0.00016234827,0.000839888,0.0007818835,0.00042440856,0.00058066635],"domain_scores_gemma":[0.9985451,0.0004108488,0.00016366119,0.0005067267,0.00018154776,0.000192134],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0004378371,0.00035937995,0.0004653639,0.0003917718,0.0003574233,0.00071818,0.0008785154,0.00017173946,0.00027492378],"category_scores_gemma":[0.000080574224,0.0003427416,0.00021103249,0.0014721033,0.00015030535,0.0005355145,0.0006828991,0.00027219884,0.0013953942],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008157964,0.00022072274,0.000046727728,0.0001146445,0.000054301243,0.000007047838,0.00031634435,0.0008110693,0.00011221459,0.64029986,0.005050509,0.35295844],"study_design_scores_gemma":[0.0005914119,0.00007081131,0.0017157325,0.00020007158,0.00003903024,0.000013521876,0.000023504981,0.7885296,0.0007314029,0.20420651,0.0035740791,0.00030435732],"about_ca_topic_score_codex":0.00003935447,"about_ca_topic_score_gemma":0.000005550262,"teacher_disagreement_score":0.92634046,"about_ca_system_score_codex":0.000067918925,"about_ca_system_score_gemma":0.00046205262,"threshold_uncertainty_score":0.9999025},"labels":[],"label_agreement":null},{"id":"W7108456235","doi":"10.1016/j.aam.2025.103003","title":"Decomposing conditional independence ideals with hidden variables","year":2025,"lang":"en","type":"article","venue":"Advances in Applied Mathematics","topic":"Polynomial and algebraic computation","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"St. John's College, University of Oxford; Natural Sciences and Engineering Research Council of Canada; Engineering and Physical Sciences Research Council; KU Leuven; Fonds Wetenschappelijk Onderzoek; Canadian Institute for Advanced Research; UK Research and Innovation; National Science Foundation","keywords":"Conditional independence; Independence (probability theory); Hidden variable theory; Conditional expectation; Variable (mathematics); Random variable","score_opus":0.006332649715279815,"score_gpt":0.25668432775473143,"score_spread":0.25035167803945163,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7108456235","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.005903692,0.0002004577,0.9637086,0.00014294904,0.00009597801,0.00018513502,0.0000013524236,0.00009391339,0.02966797],"genre_scores_gemma":[0.5573483,0.000014130658,0.44237894,0.00017431368,0.000013589339,0.000032655164,0.0000026628356,0.0000036148722,0.000031783802],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990531,0.000009531386,0.00026613683,0.00025359256,0.0002260937,0.0001915151],"domain_scores_gemma":[0.99913216,0.0004605294,0.00011203315,0.00023669947,0.000028298135,0.000030296582],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00019772195,0.0001220157,0.0001812726,0.00013163709,0.0000824082,0.000085701846,0.00047551855,0.000041476873,0.0000053693066],"category_scores_gemma":[0.000022940543,0.00010423643,0.000016018996,0.00046303094,0.00005387183,0.0003471664,0.00014393593,0.00012001957,0.000013050805],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000004400535,0.00005791696,0.00012298893,0.0000717989,0.0000053663075,0.0000036984552,0.00017997634,0.0024743793,0.00037292184,0.96712714,0.000025453026,0.029553968],"study_design_scores_gemma":[0.0004136796,0.000013167344,0.0002803478,0.00013657301,0.0000045456895,0.000009216962,0.000059217786,0.03510236,0.0025480827,0.96059006,0.0006998468,0.00014292846],"about_ca_topic_score_codex":0.0000023005377,"about_ca_topic_score_gemma":0.0000134722095,"teacher_disagreement_score":0.55144465,"about_ca_system_score_codex":0.000050467504,"about_ca_system_score_gemma":0.00009631736,"threshold_uncertainty_score":0.42506382},"labels":[],"label_agreement":null},{"id":"W7110468400","doi":"","title":"Gröbner-Shirshov bases in some noncommutative algebras","year":2014,"lang":"en","type":"dissertation","venue":"Mspace (University of Manitoba)","topic":"Polynomial and algebraic computation","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Manitoba","funders":"","keywords":"Noncommutative geometry; Dimension (graph theory); Differential (mechanical device); Polynomial; Basis (linear algebra); Differential algebra; Algebra over a field","score_opus":0.01198264619849338,"score_gpt":0.21019832757629445,"score_spread":0.19821568137780107,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7110468400","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9616455,0.00024658284,0.026606211,0.0015921164,0.0011168433,0.00036554417,0.000014904585,0.00018107194,0.008231243],"genre_scores_gemma":[0.9896292,0.00007927881,0.007947143,0.0001277313,0.00012362887,0.0000010913915,0.00021454287,0.000024120951,0.001853241],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"observational","domain_scores_codex":[0.99847144,0.00018070314,0.00017818542,0.0005051379,0.00036772923,0.00029679658],"domain_scores_gemma":[0.9987448,0.00021474285,0.00038766407,0.00043727952,0.000116400166,0.00009913757],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00023905296,0.00026918077,0.00047153415,0.0005270134,0.00016387147,0.000052646195,0.0012771497,0.00021702943,0.000007719347],"category_scores_gemma":[0.00003438313,0.00034919166,0.00016775294,0.0004669981,0.00006614105,0.0007335904,0.00022695791,0.00034157193,0.00010908372],"study_design_candidate":"observational","study_design_consensus":null,"about_ca_topic_candidate":true,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0011155526,0.0020162717,0.027751656,0.0025252104,0.0007908147,0.0011868927,0.03723189,0.0039269994,0.0033027732,0.450994,0.046115134,0.42304277],"study_design_scores_gemma":[0.0034879653,0.0006738703,0.85655683,0.0011770747,0.00014845558,0.000012338002,0.021031639,0.055902112,0.0022054706,0.04442009,0.012327912,0.0020562336],"about_ca_topic_score_codex":0.00319255,"about_ca_topic_score_gemma":0.23822787,"teacher_disagreement_score":0.8288052,"about_ca_system_score_codex":0.00015404158,"about_ca_system_score_gemma":0.00018892423,"threshold_uncertainty_score":0.999896},"labels":[],"label_agreement":null},{"id":"W7113171008","doi":"","title":"The Tropical Geometry of Flag Positroids","year":2024,"lang":"en","type":"article","venue":"Digital Access to Scholarship at Harvard (DASH) (Harvard University)","topic":"Polynomial and algebraic computation","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Flag (linear algebra); Grassmannian; Matroid; Variety (cybernetics); Rank (graph theory); Polytope; Linear subspace; Tree (set theory)","score_opus":0.01578828711775801,"score_gpt":0.2370452471638585,"score_spread":0.2212569600461005,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7113171008","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9169147,0.00007212741,0.0673418,0.0014753494,0.0010773093,0.00039065423,0.000090364796,0.0005469304,0.012090742],"genre_scores_gemma":[0.99397004,0.000025835388,0.0005095979,0.00023988003,0.00013042642,0.0000021728724,0.000015595826,0.00002158958,0.0050848653],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9976899,0.000101103025,0.00034211902,0.0007128647,0.00060830923,0.0005456824],"domain_scores_gemma":[0.99822307,0.00045687574,0.00009913679,0.00066156354,0.00018984023,0.00036954693],"candidate_categories":["scholarly_communication","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00022105538,0.00028642168,0.00028752317,0.0006330394,0.00045304722,0.0034031405,0.0033681614,0.000120890014,0.00006403139],"category_scores_gemma":[0.00016526697,0.00024250106,0.0002958608,0.0024687317,0.00014132872,0.00608969,0.002581533,0.0003824715,0.0018634886],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00058032264,0.00033515773,0.04311864,0.00021842374,0.0005723309,0.00086219946,0.0006890185,0.00050391373,0.00407698,0.53572136,0.010659878,0.4026618],"study_design_scores_gemma":[0.00051724253,0.0002901404,0.0895689,0.00016450831,0.00004615049,0.000044446126,0.00003152855,0.0021964442,0.0058674263,0.0058370414,0.89482945,0.0006067244],"about_ca_topic_score_codex":0.000012858443,"about_ca_topic_score_gemma":0.0000214764,"teacher_disagreement_score":0.8841696,"about_ca_system_score_codex":0.0003328641,"about_ca_system_score_gemma":0.00018921505,"threshold_uncertainty_score":0.9989137},"labels":[],"label_agreement":null},{"id":"W7124934559","doi":"10.1145/3787957.3787958","title":"Integer Hulls, Z-Polyhedra and Presburger Arithmetic in Action","year":2025,"lang":"en","type":"article","venue":"ACM communications in computer algebra","topic":"Polynomial and algebraic computation","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"","keywords":"Presburger arithmetic; Undecidable problem; Integer (computer science); Decidability; Algebra over a field; Integer programming; Integer points in convex polyhedra; Action (physics)","score_opus":0.03513085089192196,"score_gpt":0.3165719697226975,"score_spread":0.28144111883077555,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7124934559","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.16175938,0.0014371829,0.8149313,0.019489586,0.0006899781,0.00044168462,0.0000013815283,0.00023200159,0.0010175094],"genre_scores_gemma":[0.8732375,0.0002742981,0.12525322,0.0010219043,0.000030989224,0.000064421816,0.00000816805,0.0000072722187,0.00010221558],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983995,0.00028286414,0.0004841106,0.0004313907,0.00012939748,0.00027275854],"domain_scores_gemma":[0.9964717,0.00086980144,0.00008867015,0.002460853,0.000055984452,0.00005297328],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00045822706,0.00017763354,0.00024177246,0.0006955274,0.00014411694,0.00022519485,0.0027209015,0.000095993135,0.0000040401787],"category_scores_gemma":[0.000103396786,0.00018699966,0.000046800407,0.0012717013,0.0001307193,0.0006300551,0.003398428,0.0004239549,0.000015014462],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008404331,0.0003389567,0.010193423,0.000032036383,0.00002580981,0.000005278522,0.0012888111,0.0005133042,0.00013164194,0.19472407,0.0011189249,0.79161936],"study_design_scores_gemma":[0.00084441126,0.000040721734,0.14837423,0.00022566812,0.000007308172,0.000014910773,0.000032843225,0.66765463,0.00019196817,0.1753117,0.006994769,0.00030683549],"about_ca_topic_score_codex":0.00025598766,"about_ca_topic_score_gemma":0.00032460503,"teacher_disagreement_score":0.7913125,"about_ca_system_score_codex":0.00011799036,"about_ca_system_score_gemma":0.000109342356,"threshold_uncertainty_score":0.76256245},"labels":[],"label_agreement":null},{"id":"W7127345856","doi":"10.1109/ccece64018.2025.11364404","title":"New Permutation Polynomials on Modular Lipschitz Integers","year":2025,"lang":"","type":"article","venue":"","topic":"Polynomial and algebraic computation","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Defence Research and Development Canada","funders":"","keywords":"Invertible matrix; Permutation (music); Modular design; Lipschitz continuity; Polynomial; Permutation matrix","score_opus":0.011086337199612778,"score_gpt":0.2562619030148738,"score_spread":0.245175565815261,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7127345856","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03812816,0.0004192587,0.8916645,0.018238228,0.0055537513,0.0005027866,0.0000034701002,0.00027171386,0.045218144],"genre_scores_gemma":[0.94152284,0.0000377411,0.01063636,0.004908872,0.00054281356,0.000009609714,0.000007644837,0.00001683115,0.042317268],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9967636,0.00021334637,0.0008130689,0.0011129723,0.00046998358,0.00062705047],"domain_scores_gemma":[0.9981934,0.0003168889,0.00022175172,0.00081080146,0.00012907991,0.00032808253],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00041749558,0.00047592924,0.00046883433,0.0006475116,0.00036937214,0.00082726666,0.0011716947,0.0002212062,0.0004062752],"category_scores_gemma":[0.0001730025,0.00046155427,0.00029107797,0.0013809471,0.00007428969,0.0007443828,0.00043061617,0.00038897185,0.0008661202],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000063845364,0.00009886592,0.000033078755,0.00002391206,0.000072278126,0.000007188972,0.00071271154,0.0044760946,0.00095298036,0.1958116,0.019269498,0.77847797],"study_design_scores_gemma":[0.0026499054,0.00071069575,0.00829264,0.0005703066,0.00009742699,0.000010364241,0.00017580652,0.8643194,0.031252306,0.07188395,0.01895994,0.0010772665],"about_ca_topic_score_codex":0.0006628965,"about_ca_topic_score_gemma":0.000035072564,"teacher_disagreement_score":0.9033947,"about_ca_system_score_codex":0.00027228234,"about_ca_system_score_gemma":0.001293659,"threshold_uncertainty_score":0.99991184},"labels":[],"label_agreement":null},{"id":"W7128641650","doi":"10.1109/focs63196.2025.00037","title":"Deterministic factorization of constant-depth algebraic circuits in subexponential time","year":2025,"lang":"","type":"article","venue":"","topic":"Polynomial and algebraic computation","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Irreducibility; Algebraic number; Factorization; Electronic circuit; Finite field; Factorization of polynomials; Field (mathematics)","score_opus":0.012261756164263766,"score_gpt":0.24575247712328152,"score_spread":0.23349072095901777,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7128641650","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.16163689,0.00019884773,0.8232081,0.0003603808,0.0018795946,0.00047881415,0.000012818535,0.000082241815,0.012142311],"genre_scores_gemma":[0.9973952,0.000021368602,0.0005300317,0.0001725331,0.00006422448,0.000007353806,0.0000133566355,0.000010520956,0.0017854186],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9970038,0.00023210682,0.0011627453,0.0007144017,0.00038325987,0.0005037066],"domain_scores_gemma":[0.9984973,0.00040087942,0.00033009215,0.00048656878,0.0001698435,0.00011530165],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0003668987,0.000323631,0.00055752776,0.00072357693,0.00010898834,0.00019004896,0.0008011987,0.00019096112,0.0002567484],"category_scores_gemma":[0.00017692854,0.00034719513,0.00014387789,0.0017965616,0.00020327493,0.00053322746,0.000395151,0.000199826,0.00011271288],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006067738,0.0006990972,0.005561317,0.00031192243,0.00010661142,0.000044918917,0.002116347,0.00057247997,0.04853193,0.2103846,0.0004567501,0.73115337],"study_design_scores_gemma":[0.0034721142,0.00044209446,0.07273239,0.0007794757,0.00009007038,0.000015743077,0.00008100174,0.84616065,0.023866054,0.051135898,0.00034589585,0.00087859697],"about_ca_topic_score_codex":0.0001468008,"about_ca_topic_score_gemma":0.00007154053,"teacher_disagreement_score":0.8455882,"about_ca_system_score_codex":0.00013951561,"about_ca_system_score_gemma":0.00092073507,"threshold_uncertainty_score":0.999898},"labels":[],"label_agreement":null},{"id":"W7133001852","doi":"","title":"Simplicial Approximation of the Hodge Laplacian Using Cauchy Sequences of Hilbert Complexes","year":2024,"lang":"","type":"dissertation","venue":"TSpace","topic":"Polynomial and algebraic computation","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"University of Toronto","keywords":"Measure (data warehouse); Discretization; Manifold (fluid mechanics); Cauchy distribution; Class (philosophy); Differential form; Sequence (biology); Set (abstract data type); Laplace operator; Differential (mechanical device)","score_opus":0.03357225168738883,"score_gpt":0.327263181864991,"score_spread":0.29369093017760217,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7133001852","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.96706855,0.00095541164,0.025954673,0.000663181,0.0032082533,0.0006772316,0.000029299617,0.000052825148,0.0013905942],"genre_scores_gemma":[0.9954916,0.000020089901,0.003096514,0.000048900583,0.000277211,0.000009837656,0.000055607805,0.0000307606,0.00096943695],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99690914,0.0002546014,0.0009715003,0.00066978467,0.0008136701,0.0003813254],"domain_scores_gemma":[0.9974321,0.00023833915,0.001293658,0.0006065649,0.00034543392,0.00008388976],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00040717208,0.00045268607,0.0006912249,0.00028654106,0.00028696505,0.00017565743,0.0012231146,0.00027554051,0.00004413956],"category_scores_gemma":[0.00008402605,0.00036511477,0.00039692412,0.0013223676,0.00027640536,0.00033185442,0.0003208696,0.0003977977,0.000016053022],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001864257,0.0003667293,0.00034122984,0.0044783237,0.00035610583,0.000008408634,0.18789475,0.02028538,0.63643974,0.08860023,0.0005295385,0.06051311],"study_design_scores_gemma":[0.00049387396,0.00024418446,0.0047872555,0.0025731262,0.00039410847,0.000029697176,0.0054969974,0.6466671,0.3173947,0.020649595,0.0004160101,0.00085333694],"about_ca_topic_score_codex":0.0033924629,"about_ca_topic_score_gemma":0.0006134298,"teacher_disagreement_score":0.62638175,"about_ca_system_score_codex":0.00013909553,"about_ca_system_score_gemma":0.0009218687,"threshold_uncertainty_score":0.9998801},"labels":[],"label_agreement":null},{"id":"W7139294083","doi":"","title":"Інтегрування лінійних звичайних диференціальних рівнянь четвертого порядка в середовищі MAPLE","year":2021,"lang":"en","type":"article","venue":"The Scientific Issues of Ternopil Volodymyr Hnatiuk National Pedagogical University Series pedagogy","topic":"Polynomial and algebraic computation","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Ordinary differential equation; Maple; Eigenvalues and eigenvectors; Differential equation; Power series; Eigenfunction; Series (stratigraphy); Boundary value problem; Power (physics)","score_opus":0.0540626732694392,"score_gpt":0.3074944945058248,"score_spread":0.2534318212363856,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7139294083","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7021719,0.0020760547,0.12557498,0.0851941,0.0076703057,0.0012220371,0.00055764784,0.001173521,0.07435941],"genre_scores_gemma":[0.86156505,0.000045322584,0.00806648,0.00035232096,0.00035082048,0.0000032625421,0.00016261006,0.000019977077,0.12943414],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99551123,0.00041786593,0.0005669249,0.0010933602,0.0017898032,0.0006208395],"domain_scores_gemma":[0.99639744,0.00045276305,0.00039255104,0.00093478296,0.0015984742,0.00022401797],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0010544193,0.00037015538,0.00049037643,0.00039735224,0.0011153657,0.00047237345,0.0027156142,0.00018487663,0.0006608502],"category_scores_gemma":[0.0004527959,0.0003192963,0.00032476187,0.0016813863,0.0010720596,0.0015337731,0.0017244976,0.00037824307,0.00025938998],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00014320023,0.000618202,0.00033092307,0.000083357445,0.00016380547,0.00018951787,0.0054529756,0.0016575642,0.0047780005,0.9581603,0.014346798,0.014075387],"study_design_scores_gemma":[0.0020990546,0.00049325655,0.008603504,0.00010432794,0.00009731909,0.00029631698,0.0067400867,0.022432607,0.021770604,0.11663326,0.8194349,0.0012947551],"about_ca_topic_score_codex":0.00018715557,"about_ca_topic_score_gemma":0.00036648687,"teacher_disagreement_score":0.841527,"about_ca_system_score_codex":0.00020891232,"about_ca_system_score_gemma":0.0010266384,"threshold_uncertainty_score":0.9999259},"labels":[],"label_agreement":null},{"id":"W7144598021","doi":"","title":"有理区間数とGPU並列処理による陰関数描画について (Computer Algebra : Design of Algorithms, Implementations and Applications)","year":2012,"lang":"ja","type":"article","venue":"Institutional Repositories DataBase (IRDB)","topic":"Polynomial and algebraic computation","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Alpha Technologies (Canada)","funders":"","keywords":"Algebra over a field; Implementation; Boolean algebra; Abstraction; Algebraic number","score_opus":0.032060957547386935,"score_gpt":0.2823717457368072,"score_spread":0.25031078818942026,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7144598021","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0077521233,0.0032182194,0.98330396,0.00033870988,0.0033705963,0.00094304717,0.00062096794,0.00012652625,0.000325816],"genre_scores_gemma":[0.7321953,0.0003229475,0.26075906,0.00029359374,0.0053549623,0.0002467693,0.00064514705,0.000031528976,0.0001506522],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9964861,0.00023062479,0.001049906,0.0007503908,0.0008076619,0.00067527447],"domain_scores_gemma":[0.99725914,0.00055753416,0.0005201855,0.0007991407,0.0004155701,0.0004484366],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0007640984,0.00043829906,0.0004322833,0.00028080927,0.000981951,0.00033920349,0.0006840903,0.00013965987,0.000041560066],"category_scores_gemma":[0.00008035086,0.00045259815,0.00011814046,0.0008497535,0.00060805597,0.0031092463,0.0009161498,0.00027923725,0.00006779051],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010263924,0.0013159257,0.0042168945,0.0004553935,0.0004602145,0.00003830239,0.0029097477,0.0027023193,0.0068100807,0.8353741,0.006573986,0.13904037],"study_design_scores_gemma":[0.008215977,0.0016251123,0.09023733,0.0019065144,0.0014131957,0.0035578788,0.0010473306,0.35633194,0.063851036,0.013864497,0.45210782,0.00584139],"about_ca_topic_score_codex":0.00048081804,"about_ca_topic_score_gemma":0.000008261946,"teacher_disagreement_score":0.82150966,"about_ca_system_score_codex":0.00020339551,"about_ca_system_score_gemma":0.00070275634,"threshold_uncertainty_score":0.9997926},"labels":[],"label_agreement":null},{"id":"W7144927423","doi":"","title":"疎な多変数多項式系の高速な変数消去法の探求 (Computer Algebra : Theory and its Applications)","year":2019,"lang":"ja","type":"article","venue":"Institutional Repositories DataBase (IRDB)","topic":"Polynomial and algebraic computation","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"123 Certification (Canada)","funders":"","keywords":"Remainder; Polynomial; Algebra over a field; Basis (linear algebra); Ideal (ethics); Field (mathematics); Gröbner basis; Square-free polynomial","score_opus":0.010552549375177139,"score_gpt":0.237854894190646,"score_spread":0.22730234481546888,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7144927423","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.26873147,0.00979908,0.6957257,0.0015436801,0.014172218,0.0023007104,0.0007403919,0.0005889998,0.00639777],"genre_scores_gemma":[0.98191226,0.00026859183,0.010136223,0.0009311447,0.003936762,0.0001271475,0.0004103558,0.000035738212,0.0022417877],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99589306,0.00029826796,0.00080938224,0.0014736196,0.00089305866,0.0006326309],"domain_scores_gemma":[0.99684006,0.0008735117,0.00034718896,0.0011283273,0.00040124712,0.0004096727],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0008769237,0.00054666004,0.00046973437,0.00024292959,0.0009291507,0.0008865525,0.0010644109,0.00021630792,0.00011477388],"category_scores_gemma":[0.00014487153,0.00054463546,0.00015337211,0.0007549151,0.0003685552,0.0028190962,0.001532839,0.00049337524,0.0011951711],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00011483476,0.00021518546,0.00040540088,0.00027272903,0.00012934276,0.000078096375,0.0004748696,0.00039068458,0.0031371051,0.9684918,0.0011261919,0.025163779],"study_design_scores_gemma":[0.0046252054,0.00083308015,0.015157878,0.0019561402,0.0003469865,0.0026459706,0.00021603022,0.1804727,0.01770988,0.041518517,0.7305491,0.0039684996],"about_ca_topic_score_codex":0.000092260394,"about_ca_topic_score_gemma":0.000008567842,"teacher_disagreement_score":0.9269733,"about_ca_system_score_codex":0.000227135,"about_ca_system_score_gemma":0.0008514739,"threshold_uncertainty_score":0.99970055},"labels":[],"label_agreement":null},{"id":"W7144940018","doi":"","title":"数式処理(システム)におけるマルチスレッド化の試み (Computer Algebra : Design of Algorithms, Implementations and Applications)","year":2006,"lang":"ja","type":"article","venue":"Institutional Repositories DataBase (IRDB)","topic":"Polynomial and algebraic computation","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Alpha Technologies (Canada)","funders":"","keywords":"Algebra over a field; Implementation; Boolean algebra; Abstraction; Algebraic number","score_opus":0.020107265672448676,"score_gpt":0.26115367364452446,"score_spread":0.2410464079720758,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7144940018","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.007072688,0.0017162736,0.9859605,0.00052355026,0.0020792405,0.001020852,0.00094238017,0.00015889845,0.00052562205],"genre_scores_gemma":[0.6674521,0.00022774255,0.32394347,0.0002818573,0.00572318,0.00031544582,0.0016539,0.000043043692,0.00035924968],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99599653,0.0002046287,0.0012720663,0.0010829102,0.0008944782,0.0005493836],"domain_scores_gemma":[0.9972576,0.0005221269,0.0005943002,0.0008579964,0.0005311326,0.00023684157],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00051259826,0.00048300138,0.0004716273,0.0003226162,0.0011203378,0.00053956755,0.00077745726,0.00015014216,0.000035632456],"category_scores_gemma":[0.000046734127,0.000507257,0.00013795179,0.0009567569,0.00073022797,0.0019529517,0.0007994526,0.0002795054,0.000048876176],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012201697,0.0010432943,0.001399985,0.00041866573,0.000288465,0.00014314702,0.00060432614,0.015941946,0.010314881,0.8702394,0.01087336,0.08861056],"study_design_scores_gemma":[0.007932419,0.0012874054,0.038213443,0.0014561303,0.00082610635,0.0021429232,0.00029934818,0.5805698,0.050603617,0.047099628,0.26540956,0.004159633],"about_ca_topic_score_codex":0.0017260701,"about_ca_topic_score_gemma":0.00006440899,"teacher_disagreement_score":0.8231397,"about_ca_system_score_codex":0.00022119445,"about_ca_system_score_gemma":0.0010147573,"threshold_uncertainty_score":0.9997379},"labels":[],"label_agreement":null},{"id":"W7145219913","doi":"","title":"多変数代数関数のTaylor & Hensel級数の収束領域 (Computer Algebra : Design of Algorithms, Implementations and Applications)","year":2009,"lang":"ja","type":"article","venue":"Institutional Repositories DataBase (IRDB)","topic":"Polynomial and algebraic computation","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"123 Certification (Canada)","funders":"","keywords":"Algebra over a field; Implementation; Boolean algebra; Algebraic number; Abstraction","score_opus":0.025079894172331644,"score_gpt":0.2757851129614862,"score_spread":0.2507052187891546,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7145219913","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0052754465,0.0021077571,0.9878318,0.0010950359,0.0017133926,0.0009954551,0.0005793818,0.00015650557,0.00024524302],"genre_scores_gemma":[0.6420159,0.00053903396,0.35181192,0.0008484325,0.0036539896,0.0001476403,0.0007966167,0.000026672027,0.0001597997],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.996291,0.00019276932,0.0011333319,0.0010334195,0.0008269071,0.0005226167],"domain_scores_gemma":[0.99734044,0.0004262318,0.0005207262,0.00086166285,0.00052149,0.00032947632],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0005118465,0.00046037158,0.00047050318,0.0003033066,0.0010287347,0.00049111666,0.0007692893,0.00013715138,0.000024807441],"category_scores_gemma":[0.00007193247,0.0004813549,0.00012973514,0.000925292,0.0004935483,0.0019568256,0.00045694335,0.0002877885,0.000038174254],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00015918972,0.0010169164,0.00030432746,0.00025537197,0.00027731425,0.00014096074,0.0015896994,0.0058605284,0.010232933,0.6348433,0.0054190597,0.3399004],"study_design_scores_gemma":[0.009174886,0.0038726798,0.050038677,0.0023018064,0.000985107,0.0032135397,0.0005325534,0.66028,0.04683927,0.058579545,0.15904091,0.005141007],"about_ca_topic_score_codex":0.000303269,"about_ca_topic_score_gemma":0.000010409701,"teacher_disagreement_score":0.6544195,"about_ca_system_score_codex":0.00019084185,"about_ca_system_score_gemma":0.00084785785,"threshold_uncertainty_score":0.9997638},"labels":[],"label_agreement":null},{"id":"W7145593311","doi":"","title":"疎な多変数多項式の拡張Hensel構成算法の再構築 (数式処理の新たな発展 : その最新研究と基礎理論の再構成)","year":2017,"lang":"ja","type":"article","venue":"Institutional Repositories DataBase (IRDB)","topic":"Polynomial and algebraic computation","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"123 Certification (Canada)","funders":"","keywords":"Identification (biology); Product (mathematics); Work (physics)","score_opus":0.027929282132615297,"score_gpt":0.27646267612094233,"score_spread":0.24853339398832702,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7145593311","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.44613597,0.0064517604,0.29773256,0.020615522,0.1314268,0.0023520442,0.0038681957,0.0016043987,0.08981276],"genre_scores_gemma":[0.9778133,0.00018447753,0.0105920695,0.00048542072,0.00655624,0.000050375067,0.00038366427,0.000039245362,0.0038952008],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99435616,0.0001772439,0.0011007319,0.0016963134,0.0016176342,0.0010519037],"domain_scores_gemma":[0.99360853,0.00028823616,0.0010291378,0.0037627132,0.00064992486,0.0006614323],"candidate_categories":["metaepi_narrow","sts","scholarly_communication","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0007050912,0.00075996836,0.0006575852,0.00022977122,0.007163787,0.004719793,0.0037837457,0.00029645473,0.00011209618],"category_scores_gemma":[0.0012971015,0.0007724314,0.00035444516,0.00034826793,0.0016030857,0.0065249363,0.002972831,0.00074772444,0.0010208788],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003684819,0.0010108206,0.005296511,0.0004318602,0.0005395972,0.0037348408,0.002133145,0.00081761886,0.009216776,0.8712912,0.040295366,0.064863734],"study_design_scores_gemma":[0.003791913,0.00046758258,0.075175,0.0019870047,0.00029304603,0.0020149741,0.00015243457,0.043252718,0.018591253,0.007201147,0.8439729,0.0031000029],"about_ca_topic_score_codex":0.0032074202,"about_ca_topic_score_gemma":0.0002731842,"teacher_disagreement_score":0.8640901,"about_ca_system_score_codex":0.00049669924,"about_ca_system_score_gemma":0.0020821986,"threshold_uncertainty_score":0.99975693},"labels":[],"label_agreement":null},{"id":"W7146217003","doi":"","title":"疎な多変数多項式の拡張Hensel構成の効率化 (数式処理とその周辺分野の研究)","year":2017,"lang":"ja","type":"article","venue":"Institutional Repositories DataBase (IRDB)","topic":"Polynomial and algebraic computation","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"123 Certification (Canada)","funders":"","keywords":"Process (computing); Identification (biology); Product (mathematics)","score_opus":0.02812217617013227,"score_gpt":0.2771191860563926,"score_spread":0.2489970098862603,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7146217003","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.31342146,0.0063336506,0.43851554,0.01832062,0.12867005,0.0020129653,0.0030901514,0.0013869663,0.088248566],"genre_scores_gemma":[0.9794005,0.00016743659,0.010710849,0.0004497317,0.0055906493,0.00004084933,0.0003318979,0.000032331383,0.0032757334],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9950526,0.00015468748,0.0009635047,0.0014943203,0.0014317125,0.0009032088],"domain_scores_gemma":[0.9942168,0.0002506409,0.0009164376,0.003471648,0.00057166925,0.00057278114],"candidate_categories":["metaepi_narrow","sts","scholarly_communication","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0006389435,0.0006526003,0.00056691305,0.0002049791,0.0064710313,0.0042027696,0.003426431,0.0002587502,0.000086697386],"category_scores_gemma":[0.0011522139,0.0006623904,0.0003041696,0.0002965729,0.0014281413,0.0060403394,0.0026806546,0.0006355215,0.00088315667],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00028334896,0.0008007811,0.0037794204,0.00033747812,0.00041469143,0.0031685592,0.0015096404,0.00059503305,0.008704141,0.8954515,0.028650109,0.056305338],"study_design_scores_gemma":[0.0042022625,0.0005360326,0.067853615,0.0023219183,0.000324199,0.0024597873,0.00013635479,0.06433844,0.024227621,0.010205484,0.81998277,0.0034115012],"about_ca_topic_score_codex":0.0025656926,"about_ca_topic_score_gemma":0.00015054975,"teacher_disagreement_score":0.885246,"about_ca_system_score_codex":0.00040686727,"about_ca_system_score_gemma":0.0017831305,"threshold_uncertainty_score":0.9998948},"labels":[],"label_agreement":null},{"id":"W7146643278","doi":"","title":"Hensel級数の収束性と多価性について (Computer Algebra : Design of Algorithms, Implementations and Applications)","year":2009,"lang":"ja","type":"article","venue":"Institutional Repositories DataBase (IRDB)","topic":"Polynomial and algebraic computation","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"123 Certification (Canada)","funders":"","keywords":"Algebra over a field; Implementation; Boolean algebra; Abstraction; Algebraic number","score_opus":0.02495974045482539,"score_gpt":0.2760463219425711,"score_spread":0.2510865814877457,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7146643278","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0051743872,0.0016607373,0.98860884,0.0010042773,0.0016247946,0.0009316453,0.0005596013,0.00014750619,0.00028818502],"genre_scores_gemma":[0.65283716,0.00042775663,0.34149554,0.0007777079,0.0034139354,0.00012307674,0.00073285267,0.000023585771,0.00016837126],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99649763,0.0001883191,0.0010655164,0.00097520964,0.0007853814,0.0004879171],"domain_scores_gemma":[0.99750316,0.0003991754,0.0004880307,0.0008249122,0.0004774751,0.00030727306],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0004910787,0.00042974507,0.00044058956,0.00028892673,0.0009693363,0.0004586411,0.0007246096,0.00013026096,0.000021592934],"category_scores_gemma":[0.00006291404,0.00045093265,0.00011984092,0.0008815625,0.00047091403,0.0018406932,0.00042905027,0.00027151272,0.00003405252],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012952535,0.00090874056,0.00031637785,0.00019498845,0.00024603694,0.00012703791,0.0014826227,0.005858408,0.008314171,0.67952853,0.0059205857,0.296973],"study_design_scores_gemma":[0.008631011,0.0036883457,0.058595598,0.0019237812,0.0009011847,0.0032293738,0.00049896893,0.61218464,0.042570177,0.06409414,0.19876058,0.004922217],"about_ca_topic_score_codex":0.00028660594,"about_ca_topic_score_gemma":0.000008938521,"teacher_disagreement_score":0.64766276,"about_ca_system_score_codex":0.00017215681,"about_ca_system_score_gemma":0.0008914068,"threshold_uncertainty_score":0.99979424},"labels":[],"label_agreement":null},{"id":"W7146919260","doi":"","title":"拡張Hensel構成の効率化 - 疎な多変数多項式の因数分解を念頭に - (Computer Algebra --Theory and its Applications)","year":2019,"lang":"ja","type":"article","venue":"Institutional Repositories DataBase (IRDB)","topic":"Polynomial and algebraic computation","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"123 Certification (Canada)","funders":"","keywords":"Algebra over a field; Matrix algebra; Boolean algebra; Universal algebra; Class (philosophy)","score_opus":0.010823025315529342,"score_gpt":0.23739535673160697,"score_spread":0.22657233141607763,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7146919260","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.324203,0.010255154,0.64056575,0.0013364969,0.015217308,0.0024172908,0.0008037179,0.0006483463,0.0045529115],"genre_scores_gemma":[0.9802772,0.0002983584,0.010784079,0.0009169253,0.0043002632,0.00013710794,0.00055897335,0.000041610892,0.002685482],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99543214,0.0003140539,0.0009243861,0.0016370087,0.0009870817,0.00070535386],"domain_scores_gemma":[0.9965413,0.00090474804,0.0004142351,0.0012253257,0.00044507332,0.0004692746],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00089455507,0.00061749207,0.0005376876,0.00028563556,0.0010402413,0.00097290514,0.0011110355,0.00024648814,0.00014902746],"category_scores_gemma":[0.00015408602,0.0006313022,0.00017442704,0.0008394401,0.00040504275,0.0029881857,0.0014906692,0.0005410248,0.0011844169],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00015427849,0.00026418033,0.00031848508,0.00030638327,0.00017148025,0.00011757056,0.0007140453,0.00069422997,0.0043888255,0.97141826,0.0021625978,0.019289652],"study_design_scores_gemma":[0.0046587517,0.00082720147,0.007551263,0.0015985606,0.00038017833,0.0030193944,0.00022570573,0.19066305,0.015279173,0.03513721,0.73669803,0.003961501],"about_ca_topic_score_codex":0.00013659951,"about_ca_topic_score_gemma":0.000007905036,"teacher_disagreement_score":0.9362811,"about_ca_system_score_codex":0.00025769655,"about_ca_system_score_gemma":0.00089152163,"threshold_uncertainty_score":0.9996138},"labels":[],"label_agreement":null},{"id":"W81492129","doi":"","title":"On Graceful Generalized Spiders and Caterpillars.","year":2008,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Polynomial and algebraic computation","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics","score_opus":0.013052843332068093,"score_gpt":0.22129552602372116,"score_spread":0.20824268269165305,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W81492129","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9952755,0.00015990307,0.0014694192,0.00095220143,0.0012889784,0.000089294874,4.3971363e-7,0.00013930043,0.00062494614],"genre_scores_gemma":[0.99777913,0.00005269961,0.0013178654,0.00066329347,0.00000929648,0.000005834378,0.0000016610426,0.0000068711033,0.0001633249],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.999147,0.00004687016,0.00014074364,0.0002893562,0.00017605214,0.00019999046],"domain_scores_gemma":[0.9994697,0.00007881179,0.00005246658,0.00026389255,0.000031047446,0.00010409024],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0000930113,0.00011907114,0.00013601902,0.00007425932,0.00018809245,0.000053645083,0.00027957995,0.000040921284,0.000005058733],"category_scores_gemma":[0.00002973683,0.00010941327,0.00003654587,0.00019110097,0.000053484775,0.00021144545,0.00012482457,0.00008044434,0.000055935667],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000070249052,0.000045183566,0.00079938874,0.000003053782,0.0000091212005,0.000039520124,0.00038870578,0.0000301905,0.00024174433,0.9862533,0.004257631,0.0079251],"study_design_scores_gemma":[0.001381802,0.00021466897,0.018179413,0.000013972011,0.0000036356478,0.00007639659,0.0000043940927,0.009636066,0.0024635356,0.9651549,0.0025905245,0.0002807045],"about_ca_topic_score_codex":0.00004976252,"about_ca_topic_score_gemma":0.0000014135296,"teacher_disagreement_score":0.021098448,"about_ca_system_score_codex":0.000026453557,"about_ca_system_score_gemma":0.00003754448,"threshold_uncertainty_score":0.44617435},"labels":[],"label_agreement":null},{"id":"W82211389","doi":"","title":"Solving Nonlinear Polynomial Systems via Symbolic-Numeric Elimination Method","year":2004,"lang":"en","type":"article","venue":"","topic":"Polynomial and algebraic computation","field":"Computer Science","cited_by":19,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"","keywords":"Mathematics; Monomial; Combinatorics; Homogeneous polynomial; Polynomial; Degree (music); Dimension (graph theory); Vector space; Order (exchange); Gröbner basis; Matrix (chemical analysis); Discrete mathematics; Matrix polynomial; Pure mathematics; Mathematical analysis; Physics","score_opus":0.010485611207979431,"score_gpt":0.25500402275951034,"score_spread":0.24451841155153092,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W82211389","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.018332614,0.00008518439,0.97673476,0.0012128152,0.0011634219,0.00017394213,8.5001795e-7,0.00036129527,0.0019351229],"genre_scores_gemma":[0.753783,0.000002911541,0.24525401,0.00027725683,0.00038242716,0.000010860587,0.0000042952634,0.000009614703,0.0002756296],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986776,0.000070232105,0.00030964467,0.00037963619,0.00026267947,0.00030019373],"domain_scores_gemma":[0.99931693,0.00008695768,0.00011523096,0.00029905708,0.00006891886,0.00011288783],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00032374755,0.00015486144,0.00019666906,0.00015812866,0.00016104753,0.00025351258,0.0005093946,0.000064487984,0.000007212579],"category_scores_gemma":[0.000023300416,0.0001397118,0.00007456656,0.00044683434,0.000016873222,0.00062667305,0.00017166234,0.000104442835,0.00016136849],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000016248865,0.00024362406,0.000057280202,0.000052398067,0.00005538702,0.000030930587,0.0021163917,0.05833569,0.021924725,0.15729214,0.0006282108,0.759247],"study_design_scores_gemma":[0.00068795367,0.00011161155,0.0018552121,0.000027556314,0.000009768852,0.000107862164,0.000042622964,0.9830672,0.008969437,0.0031420558,0.0016465564,0.0003321429],"about_ca_topic_score_codex":0.0008398762,"about_ca_topic_score_gemma":0.000013509427,"teacher_disagreement_score":0.92473155,"about_ca_system_score_codex":0.00012295731,"about_ca_system_score_gemma":0.00012907345,"threshold_uncertainty_score":0.5697282},"labels":[],"label_agreement":null},{"id":"W853507063","doi":"10.1007/978-3-662-44199-2_67","title":"A Package for Parametric Matrix Computations","year":2014,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Polynomial and algebraic computation","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"","keywords":"Symbolic computation; Maple; Algebra over a field; Computer science; Parametric statistics; Computation; Polynomial; Canonical form; Matrix (chemical analysis); Linear algebra; Multivariate statistics; Algorithm; Applied mathematics; Mathematics; Pure mathematics","score_opus":0.017030682757007233,"score_gpt":0.2641130273252443,"score_spread":0.24708234456823705,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W853507063","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000074605945,0.0003034265,0.99444485,0.0011386914,0.0021411018,0.000741324,0.000013163624,0.00027133475,0.00087152916],"genre_scores_gemma":[0.2743096,0.000015309606,0.7226433,0.0013539908,0.00085961836,0.000034512093,0.0000242412,0.000047181253,0.0007122532],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9962767,0.00003766195,0.00065201765,0.0015431594,0.0007578474,0.0007326156],"domain_scores_gemma":[0.99625725,0.0017114352,0.00038724937,0.0011122175,0.00030616313,0.0002256735],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0008904644,0.0005367763,0.00062301476,0.0014784817,0.00037864098,0.00074144045,0.0028813197,0.00028591967,0.00000904434],"category_scores_gemma":[0.00021809789,0.0005095196,0.00024588848,0.001075393,0.0004039547,0.00038924406,0.0008477137,0.0004988095,0.00009004423],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000049664272,0.00002312008,0.000008672248,0.0000601018,0.000012071414,0.000012030927,0.00024258767,0.05849643,0.000035834742,0.13082246,0.00012618047,0.8101556],"study_design_scores_gemma":[0.00033143468,0.00017905077,0.00006755545,0.00013168486,0.000008963574,0.000029436176,4.266544e-8,0.66356045,0.00023784295,0.3319799,0.0029942933,0.00047934387],"about_ca_topic_score_codex":0.000015349133,"about_ca_topic_score_gemma":0.000029281653,"teacher_disagreement_score":0.8096762,"about_ca_system_score_codex":0.00028341563,"about_ca_system_score_gemma":0.00053513586,"threshold_uncertainty_score":0.99973565},"labels":[],"label_agreement":null}]}