{"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5765202,0.0005947144,0.33120775,0.00081861566,0.00028135258,0.00021011023,0.0010248107,0.0013648443,0.08797761],"genre_scores_gemma":[0.9012135,0.000151776,0.07869408,0.00009314806,0.00009139712,0.00010474956,0.00110745,0.00021066042,0.018333176],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99968386,0.000055293764,0.000021619055,0.000054664586,0.000115846284,0.0000687869],"domain_scores_gemma":[0.99926275,0.0002766759,0.00004905461,0.00016043485,0.00015229815,0.00009864874],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005373447,0.00036669077,0.0005901167,0.0008249804,0.0010754126,0.0015837754,0.00091003353,0.0004417965,0.0054434454],"category_scores_gemma":[0.0010671299,0.00039245214,0.00081249553,0.00058397435,0.0009795784,0.0026125507,0.0012752666,0.0010684228,0.00080488273],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001285991,0.00006680037,0.00040380022,0.0001249777,0.000013357144,0.0001238692,0.00051376986,0.0012680118,0.009318274,0.96548235,0.002222043,0.020334227],"study_design_scores_gemma":[0.000039268776,0.00007760869,0.0003395956,0.000029398503,0.000022932882,0.0002518604,0.0001769666,0.009072665,0.010272264,0.9690168,0.01068183,0.000018860295],"about_ca_topic_score_codex":0.00018000208,"about_ca_topic_score_gemma":0.0004467436,"teacher_disagreement_score":0.0054434454,"about_ca_system_score_codex":0.0006460906,"about_ca_system_score_gemma":0.00050178997,"threshold_uncertainty_score":0.018210173},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.61922,0.0021939469,0.2607514,0.0023964297,0.0013106904,0.0000869333,0.0012077052,0.0009940814,0.11183878],"genre_scores_gemma":[0.96056134,0.000650346,0.017015317,0.00026695084,0.0005191454,0.000057868703,0.0006530221,0.00020111725,0.02007482],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99862754,0.00029939812,0.000056178844,0.00013480165,0.0005610375,0.00032106275],"domain_scores_gemma":[0.9952276,0.001158929,0.00053625397,0.00039839552,0.0016422091,0.0010366166],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001444982,0.0007651213,0.00083669444,0.0038137003,0.0012862907,0.0037548197,0.0009950537,0.00093712576,0.011253232],"category_scores_gemma":[0.010075048,0.0003229712,0.00047583025,0.0012880616,0.0021400708,0.0035798603,0.0018674656,0.0015196797,0.0019526567],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00020517847,0.000030459998,0.001361208,0.00007843217,0.0000144614405,0.00014001326,0.0001254883,0.0035333207,0.0036281664,0.9590769,0.01101486,0.02079158],"study_design_scores_gemma":[0.000051003055,0.00012253271,0.003332861,0.00007145178,0.000022395601,0.0004939665,0.00029323428,0.047745094,0.005245677,0.9305252,0.011996612,0.000100064666],"about_ca_topic_score_codex":0.0010020039,"about_ca_topic_score_gemma":0.00081892445,"teacher_disagreement_score":0.011253232,"about_ca_system_score_codex":0.0015587898,"about_ca_system_score_gemma":0.0009099568,"threshold_uncertainty_score":0.037645817},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6071187,0.0018566237,0.16816214,0.0020443888,0.00041232124,0.00004584739,0.00035560082,0.00026210683,0.21974225],"genre_scores_gemma":[0.9757697,0.00045763783,0.009360565,0.00016684766,0.00020390635,0.00002933493,0.00015803585,0.000044229673,0.013809718],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99938655,0.0001384436,0.00002644325,0.000118689575,0.00017631851,0.00015356921],"domain_scores_gemma":[0.99936503,0.00019386629,0.000092389295,0.00012771883,0.00010946888,0.000111458074],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00069438585,0.0002603125,0.000393428,0.00077628635,0.0010991053,0.0012924641,0.00033822987,0.00021214392,0.0040082866],"category_scores_gemma":[0.0012629626,0.00022180412,0.0004039274,0.00053137465,0.0027198754,0.0023906447,0.0019220547,0.0014059071,0.0005648914],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000029016815,0.000012295916,0.00012566474,0.000015715652,0.000004477158,0.000035055473,0.00013851044,0.0011007545,0.0010374003,0.9927221,0.0004702242,0.0043088244],"study_design_scores_gemma":[0.0000087620265,0.000019878453,0.00026916884,0.000010013079,0.000003863605,0.000058237274,0.000058527246,0.0025670326,0.0011668324,0.9916005,0.004227206,0.000009965903],"about_ca_topic_score_codex":0.00054119184,"about_ca_topic_score_gemma":0.0006088333,"teacher_disagreement_score":0.0040082866,"about_ca_system_score_codex":0.0006372857,"about_ca_system_score_gemma":0.0003508429,"threshold_uncertainty_score":0.013409078},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.079503305,0.00026896683,0.9104253,0.00039884137,0.00013613544,0.00021719804,0.00030471888,0.003687521,0.005057978],"genre_scores_gemma":[0.31860366,0.00020761111,0.67580926,0.00014078249,0.000072494746,0.00017819212,0.0012124081,0.00026521558,0.0035104514],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99852484,0.00026861104,0.00021729479,0.00030385965,0.00044388798,0.00024155785],"domain_scores_gemma":[0.9984773,0.0003559579,0.00010678578,0.00045705918,0.00048637064,0.00011658626],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014734961,0.00066707,0.0008885975,0.0014352731,0.0009534063,0.0022534088,0.0016986415,0.00092199567,0.0048264456],"category_scores_gemma":[0.0033297876,0.0003198561,0.00090051926,0.0025392564,0.00088648923,0.004872029,0.0029378822,0.0011629637,0.0015113868],"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.0009481653,0.00041084466,0.003070282,0.00030266208,0.00010454052,0.00018408742,0.000565882,0.028176982,0.032202594,0.30288726,0.009503943,0.62164277],"study_design_scores_gemma":[0.0003813781,0.00035879645,0.00096817693,0.000070049646,0.00008138045,0.00040467398,0.0004722463,0.43275777,0.06662195,0.47647914,0.021294491,0.0001099731],"about_ca_topic_score_codex":0.0009959452,"about_ca_topic_score_gemma":0.0011700769,"teacher_disagreement_score":0.0048264456,"about_ca_system_score_codex":0.0012283564,"about_ca_system_score_gemma":0.0030926792,"threshold_uncertainty_score":0.016146123},"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.020775478,0.013753555,0.40064383,0.006839187,0.00143517,0.00006199375,0.00021179763,0.00013772737,0.55614114],"genre_scores_gemma":[0.6274243,0.012117233,0.05907886,0.0013917165,0.0013462148,0.00016132259,0.00023230797,0.00017987535,0.2980682],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99980885,0.00004801226,0.000008538015,0.000030525494,0.000077519304,0.000026603488],"domain_scores_gemma":[0.99976593,0.0001053352,0.000020473784,0.000029190947,0.000051037718,0.000028090017],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00047664874,0.00074544305,0.0005696124,0.0006270563,0.0011805946,0.0023878727,0.0009889454,0.001462837,0.0090798745],"category_scores_gemma":[0.001145635,0.00035793622,0.00072469003,0.0008599902,0.0027699196,0.0044858074,0.0013242358,0.0028680123,0.00077633106],"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.0000022358622,0.0000042554348,0.000016708864,0.000014676007,0.0000013989479,0.000014675853,0.00003736918,0.0012320392,0.00010797518,0.992886,0.0027254086,0.0029572481],"study_design_scores_gemma":[0.0000013640628,0.000005808786,0.000024010871,0.000015748414,0.0000014984357,0.00003296273,0.000044399832,0.0051492234,0.000108856446,0.98414177,0.010470071,0.0000042660577],"about_ca_topic_score_codex":0.0018744156,"about_ca_topic_score_gemma":0.0024248,"teacher_disagreement_score":0.0090798745,"about_ca_system_score_codex":0.0013561448,"about_ca_system_score_gemma":0.00084734376,"threshold_uncertainty_score":0.030375183},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.80837446,0.00097480154,0.1480319,0.0014080541,0.000102264916,0.00007014495,0.00048375857,0.0002407482,0.040313825],"genre_scores_gemma":[0.9894391,0.00017981864,0.0085601695,0.000084642976,0.000092009905,0.000023798675,0.00011928812,0.000015003139,0.0014862043],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99787307,0.00055307767,0.00014365533,0.0003452418,0.0007103595,0.00037447776],"domain_scores_gemma":[0.9898868,0.00504498,0.0016513444,0.00091370876,0.0013908672,0.0011121727],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021439225,0.0005124772,0.0005474581,0.0017051129,0.000922617,0.0030384173,0.00077353563,0.00058455265,0.00512024],"category_scores_gemma":[0.009901971,0.00044321743,0.00048520396,0.0009903564,0.0032901932,0.004648548,0.0016266739,0.0017152531,0.00045567632],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001821655,0.000047314774,0.0011905801,0.000090427864,0.000021636475,0.00020284622,0.00032628953,0.005307812,0.006987048,0.974743,0.0013152643,0.009585717],"study_design_scores_gemma":[0.00003472385,0.00011215999,0.0009533322,0.000022843298,0.000013548915,0.00036951905,0.00016552082,0.0329796,0.0061687003,0.9565517,0.0025810983,0.00004716344],"about_ca_topic_score_codex":0.00080721936,"about_ca_topic_score_gemma":0.0006576731,"teacher_disagreement_score":0.00512024,"about_ca_system_score_codex":0.0009840496,"about_ca_system_score_gemma":0.0007835519,"threshold_uncertainty_score":0.017128944},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.005742392,0.0002693246,0.9769496,0.00010872414,0.0001540639,0.00011610426,0.00029338305,0.0037591478,0.012607274],"genre_scores_gemma":[0.047075197,0.00024875006,0.9432813,0.00006787082,0.00006495423,0.00014206994,0.0012589267,0.00068295875,0.007177925],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99934095,0.00007546175,0.00004610048,0.00014875302,0.00029863638,0.000090068774],"domain_scores_gemma":[0.99912816,0.00021594753,0.000028489974,0.00027729955,0.0002987759,0.000051262152],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005157455,0.0013147277,0.0011210387,0.0015895086,0.000983187,0.0022343167,0.0024354614,0.0006985588,0.01763089],"category_scores_gemma":[0.0028315561,0.0006541387,0.0013255279,0.0025065122,0.00092394976,0.003884997,0.0028459271,0.0022870493,0.0069805635],"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.00021863858,0.00009624874,0.00032355796,0.00033169828,0.00003573717,0.00007943123,0.000193636,0.01529619,0.012320938,0.18499738,0.029795812,0.75631076],"study_design_scores_gemma":[0.00017146447,0.00014716812,0.0006048993,0.00012469382,0.00010329528,0.0004528508,0.0002629735,0.39781815,0.023179058,0.4772431,0.09980526,0.000087071574],"about_ca_topic_score_codex":0.0024917168,"about_ca_topic_score_gemma":0.0044726436,"teacher_disagreement_score":0.01763089,"about_ca_system_score_codex":0.0010196923,"about_ca_system_score_gemma":0.0012732211,"threshold_uncertainty_score":0.05898124},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5079136,0.0050707287,0.114662595,0.002240948,0.00071195303,0.00012227816,0.00064264267,0.00034820373,0.36828712],"genre_scores_gemma":[0.94494826,0.003449625,0.011820348,0.0001269996,0.00069239613,0.00005830857,0.00031034517,0.00015177613,0.038441844],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99963593,0.000047884434,0.000021273976,0.00007173431,0.00013779207,0.00008534459],"domain_scores_gemma":[0.9992181,0.00014544747,0.00020553169,0.000104875144,0.00014535151,0.00018080459],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00051594316,0.0007872056,0.0004382582,0.0032419823,0.001628383,0.0037465058,0.0005970192,0.0005942621,0.007992931],"category_scores_gemma":[0.002232403,0.0002958928,0.0004957984,0.0020955887,0.0037542419,0.0061529423,0.0021546746,0.0016373846,0.001166988],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000053264607,0.0000052935097,0.0002883702,0.00001908498,0.0000016968713,0.00009971131,0.00025025,0.0004729406,0.00040854196,0.9945169,0.00063389406,0.003297905],"study_design_scores_gemma":[0.000011246621,0.000028822642,0.001087863,0.000043102016,0.000009022361,0.0008002042,0.00058601587,0.0046391767,0.0010797601,0.96695495,0.024741627,0.000018213352],"about_ca_topic_score_codex":0.0011358385,"about_ca_topic_score_gemma":0.0006881098,"teacher_disagreement_score":0.007992931,"about_ca_system_score_codex":0.0010898686,"about_ca_system_score_gemma":0.00059049623,"threshold_uncertainty_score":0.026739001},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.44593754,0.0014339415,0.19403774,0.0015968484,0.00058296317,0.000090605514,0.0005322843,0.00048873224,0.35529935],"genre_scores_gemma":[0.9411164,0.00082293054,0.022131668,0.00014868577,0.00030247893,0.000038826816,0.00022090947,0.00013501968,0.035083078],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99942017,0.00009237272,0.000027387945,0.000120408746,0.00023744882,0.000102227],"domain_scores_gemma":[0.9993814,0.00019916013,0.000084498446,0.000077236065,0.00019354913,0.000064118205],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00048478783,0.00048809435,0.00033483357,0.0015593768,0.0008421214,0.0013883705,0.00038359372,0.00038531813,0.007226159],"category_scores_gemma":[0.0029870905,0.0001798055,0.0005286295,0.000732555,0.0018614632,0.0017902307,0.0012020476,0.00150594,0.0016190445],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000015101275,0.00001047767,0.00018956522,0.00002503742,0.000003015788,0.00008297966,0.00017492136,0.0007893239,0.0013636998,0.98881686,0.0008967087,0.0076323277],"study_design_scores_gemma":[0.000017891938,0.00003407243,0.0007610134,0.000017238832,0.000011308607,0.0003662118,0.0001485755,0.01116946,0.0035372311,0.9715076,0.012408256,0.000021156557],"about_ca_topic_score_codex":0.0012693808,"about_ca_topic_score_gemma":0.0012612999,"teacher_disagreement_score":0.007226159,"about_ca_system_score_codex":0.001325896,"about_ca_system_score_gemma":0.000439787,"threshold_uncertainty_score":0.024173915},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3538791,0.0024849835,0.31822714,0.002326952,0.0007049286,0.00011645928,0.0014319832,0.0009171984,0.3199113],"genre_scores_gemma":[0.92048204,0.00094786467,0.041773524,0.00020176702,0.0003795071,0.000073763156,0.000702744,0.00018911573,0.035249528],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99885,0.00021484708,0.00009790596,0.00024839296,0.00039814244,0.00019071574],"domain_scores_gemma":[0.99882466,0.00040107514,0.00014838677,0.00012874547,0.00034774703,0.00014938765],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007177476,0.0005018617,0.0005817669,0.0020888627,0.00151867,0.0028006511,0.00076032494,0.00041006305,0.008129814],"category_scores_gemma":[0.0021611555,0.00033147004,0.0009058538,0.0012650489,0.002534453,0.0036839584,0.0019048244,0.001377894,0.0011454418],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000011124875,0.000003038377,0.00017929486,0.000028727995,0.0000035466846,0.0000580477,0.00020244588,0.00058545225,0.00036230925,0.99362355,0.00088714575,0.004055298],"study_design_scores_gemma":[0.000008625292,0.000025485753,0.0005985618,0.000027607435,0.000014680948,0.0003021336,0.00020136265,0.0065243742,0.0016138944,0.96667784,0.02398325,0.000022215843],"about_ca_topic_score_codex":0.0022024917,"about_ca_topic_score_gemma":0.0015112617,"teacher_disagreement_score":0.008129814,"about_ca_system_score_codex":0.0024975652,"about_ca_system_score_gemma":0.00071447116,"threshold_uncertainty_score":0.027196884},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.86670554,0.00042594466,0.10642386,0.00015609105,0.000043926553,0.000023605495,0.0001645995,0.0001511891,0.025905227],"genre_scores_gemma":[0.98782897,0.00017220812,0.008734015,0.000013590375,0.000046816844,0.000018049948,0.000100639976,0.000044176075,0.00304141],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995078,0.00005802525,0.000019867184,0.00010725647,0.00018252405,0.00012447781],"domain_scores_gemma":[0.99930596,0.00017391956,0.0002073285,0.00008822224,0.00007156136,0.00015306163],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002684012,0.00040185667,0.00042814456,0.0025676908,0.0008580769,0.002664998,0.00066292984,0.0002863876,0.0043545626],"category_scores_gemma":[0.0016864319,0.00038836236,0.00056253537,0.0015992876,0.0020790999,0.0033165435,0.0025853822,0.001304539,0.0003259895],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000049916907,0.000015020612,0.0024405567,0.00004281191,0.000020415042,0.0002649155,0.0004528064,0.0058903163,0.004020087,0.97682357,0.00029572294,0.009683879],"study_design_scores_gemma":[0.000028872977,0.00009149782,0.007321484,0.00005324712,0.000063542575,0.0011595212,0.0010551496,0.05272832,0.009429426,0.91641927,0.011592956,0.00005663637],"about_ca_topic_score_codex":0.0007894536,"about_ca_topic_score_gemma":0.00068955834,"teacher_disagreement_score":0.0043545626,"about_ca_system_score_codex":0.0007936932,"about_ca_system_score_gemma":0.0002630346,"threshold_uncertainty_score":0.014567494},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12986034,0.0051948735,0.63735306,0.013124803,0.0014437961,0.0004900407,0.002539486,0.004697839,0.20529568],"genre_scores_gemma":[0.6066349,0.0030217622,0.32364357,0.0016862703,0.0019396631,0.000595211,0.0041197287,0.0019232308,0.056435745],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9937198,0.0014392893,0.00031812736,0.0010382008,0.0024419662,0.0010425585],"domain_scores_gemma":[0.9835195,0.011051432,0.0005926303,0.0029518835,0.0013229973,0.0005615413],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004445842,0.0017481145,0.0027695245,0.0018089586,0.0031962285,0.007467051,0.0042812014,0.0025478627,0.03317034],"category_scores_gemma":[0.021412909,0.0011143204,0.0022168811,0.0035070763,0.0037564575,0.018964853,0.0060283598,0.0066090566,0.008556996],"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.0024650963,0.000523415,0.0028596274,0.00058373844,0.0001588375,0.00018859003,0.0005982029,0.07278578,0.0053087124,0.62549067,0.058622897,0.2304145],"study_design_scores_gemma":[0.00021170496,0.00008589803,0.0005618112,0.000073529394,0.00006324048,0.00014785677,0.00015248856,0.20939745,0.0024091688,0.7784153,0.008428732,0.000052855783],"about_ca_topic_score_codex":0.006234856,"about_ca_topic_score_gemma":0.007444633,"teacher_disagreement_score":0.03317034,"about_ca_system_score_codex":0.0049066534,"about_ca_system_score_gemma":0.005947643,"threshold_uncertainty_score":0.11096585},"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":"other","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011842524,0.051157083,0.20559822,0.068630695,0.02195953,0.00006713371,0.002526922,0.0015383431,0.63667953],"genre_scores_gemma":[0.37735853,0.062175833,0.08882906,0.03369984,0.03471017,0.00021070194,0.0028405648,0.0035044278,0.39667094],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991887,0.00024326603,0.000045324003,0.00017856855,0.00022891683,0.00011514845],"domain_scores_gemma":[0.9990588,0.000332903,0.00005213884,0.00022925453,0.0002214062,0.00010549948],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011053033,0.00072364486,0.00066873454,0.0015056323,0.002239507,0.0038255174,0.0007611448,0.0009872834,0.034720466],"category_scores_gemma":[0.002707232,0.00035297428,0.0008077237,0.002191005,0.004400756,0.008837881,0.0018694131,0.003959635,0.010299976],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000011458439,0.000006044862,0.00009801031,0.00007745441,0.000005954188,0.000056864075,0.00047440972,0.00023987704,0.00047722267,0.92346895,0.06004206,0.01504163],"study_design_scores_gemma":[0.000003807525,0.000017422955,0.0002915194,0.00010573812,0.000005167962,0.00025777507,0.0002250348,0.00046070095,0.00024673258,0.3377902,0.66057575,0.000020089396],"about_ca_topic_score_codex":0.0017492748,"about_ca_topic_score_gemma":0.0013277163,"teacher_disagreement_score":0.034720466,"about_ca_system_score_codex":0.0015766376,"about_ca_system_score_gemma":0.0009049842,"threshold_uncertainty_score":0.11615145},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.030498749,0.017394148,0.6596941,0.004192878,0.0018851494,0.00007898018,0.00041011185,0.0011415449,0.2847043],"genre_scores_gemma":[0.5351695,0.016401362,0.31034842,0.0015076774,0.0028353787,0.00021296857,0.0010166802,0.0012316329,0.13127634],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992976,0.00020882714,0.00003581057,0.00011568904,0.00027335988,0.00006864568],"domain_scores_gemma":[0.99898976,0.0006551065,0.000034316436,0.00017018327,0.00010019225,0.000050511015],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013437804,0.0012174248,0.0013746048,0.001665656,0.0011048007,0.003295688,0.0016049937,0.00093497057,0.01307727],"category_scores_gemma":[0.004653851,0.0006733959,0.0011586949,0.0025606551,0.004157985,0.0081090145,0.002150409,0.0037538225,0.0030059388],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000024115156,0.000009388379,0.000081575155,0.00007313988,0.000009510883,0.000024916913,0.000085686,0.0016857882,0.00039501206,0.96356565,0.0051682075,0.028877007],"study_design_scores_gemma":[0.0000069059433,0.0000050589765,0.00007668882,0.000018169285,0.0000044033113,0.000035464927,0.000011569747,0.0044808765,0.0003223102,0.98695767,0.008074071,0.0000069355056],"about_ca_topic_score_codex":0.0010767151,"about_ca_topic_score_gemma":0.0011814035,"teacher_disagreement_score":0.01307727,"about_ca_system_score_codex":0.0019251517,"about_ca_system_score_gemma":0.00081052125,"threshold_uncertainty_score":0.043747783},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.050547842,0.002201525,0.91898036,0.00045189075,0.0008443691,0.0003760696,0.0004560365,0.010255241,0.015886689],"genre_scores_gemma":[0.2095037,0.00048652134,0.7798915,0.00024101742,0.00019288548,0.0002191525,0.001123451,0.0004970928,0.007844714],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99930334,0.00016476416,0.000040997787,0.0001519121,0.00018509568,0.00015385501],"domain_scores_gemma":[0.9994437,0.00011127259,0.000033615368,0.00020807497,0.00015040973,0.000052977182],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006079334,0.0008816775,0.0019208458,0.002170434,0.0016420238,0.00174484,0.0019647868,0.00088172127,0.011145779],"category_scores_gemma":[0.0019397701,0.00040827307,0.000750941,0.003456431,0.00075981684,0.0025379572,0.002290999,0.0009803333,0.0031255896],"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.0010007715,0.00023225347,0.0011094194,0.00029551564,0.00007853801,0.00020480569,0.00014132327,0.025914526,0.014329513,0.045601748,0.035735045,0.8753566],"study_design_scores_gemma":[0.00084678194,0.00089359895,0.0013061815,0.000105834566,0.00014895873,0.0013848095,0.00032871476,0.704067,0.06389539,0.12709196,0.099756144,0.00017470549],"about_ca_topic_score_codex":0.0016224601,"about_ca_topic_score_gemma":0.0024345035,"teacher_disagreement_score":0.011145779,"about_ca_system_score_codex":0.00081498263,"about_ca_system_score_gemma":0.0018716414,"threshold_uncertainty_score":0.03728634},"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":"other","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009523802,0.0017172961,0.26271224,0.00081656245,0.0009226887,0.00008890479,0.0008335715,0.0009103585,0.72247463],"genre_scores_gemma":[0.22223584,0.0028899773,0.17919685,0.0008179305,0.0010484857,0.00018211159,0.0038013984,0.0012966334,0.5885308],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99971837,0.000031497755,0.000010692071,0.00005595613,0.0001453885,0.000038064114],"domain_scores_gemma":[0.9997905,0.000026923646,0.000010094664,0.00006584927,0.000080600774,0.000026019548],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002766375,0.00059014966,0.00055986375,0.0009798757,0.0008715691,0.0017171231,0.0006852686,0.00041513075,0.05253354],"category_scores_gemma":[0.0006376548,0.00033235102,0.00054115057,0.0011299665,0.00096393254,0.001779239,0.0011833288,0.001937587,0.017622426],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002211674,0.00002326287,0.00006324312,0.00008290586,0.000007908546,0.000042683852,0.00011914968,0.0016082969,0.0021043126,0.8370064,0.052159086,0.10676062],"study_design_scores_gemma":[0.000008705696,0.000017886181,0.00014765476,0.000035232293,0.000011099101,0.00014250175,0.000071426446,0.005951086,0.0015586478,0.82546026,0.16658351,0.000012000429],"about_ca_topic_score_codex":0.00079063897,"about_ca_topic_score_gemma":0.00193916,"teacher_disagreement_score":0.05253354,"about_ca_system_score_codex":0.0007141427,"about_ca_system_score_gemma":0.0005890636,"threshold_uncertainty_score":0.17574221},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.015481291,0.00015803156,0.98076516,0.00018335634,0.00006565169,0.00007483808,0.00015264798,0.0012403163,0.0018786419],"genre_scores_gemma":[0.22747597,0.00016649657,0.7679677,0.000109075576,0.00007463826,0.00019746365,0.0005296013,0.00028042422,0.0031986125],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99822277,0.00038358624,0.0001648675,0.0003910399,0.0006898668,0.00014793067],"domain_scores_gemma":[0.99027354,0.005308704,0.0007197847,0.0016912257,0.0017258548,0.00028093503],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019384135,0.0013026884,0.0011670163,0.0030599048,0.0009795555,0.0027873537,0.0026619795,0.0018365819,0.008506806],"category_scores_gemma":[0.02435123,0.000722586,0.00082871655,0.002512571,0.0018589541,0.0042673023,0.003529818,0.002317632,0.002296503],"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.0010031696,0.00026159562,0.0050607375,0.0005626349,0.00013926906,0.00014695807,0.00036817684,0.15496166,0.02258125,0.2717644,0.0073254546,0.5358248],"study_design_scores_gemma":[0.00008349559,0.000055737193,0.000466004,0.000048583057,0.00003221035,0.000090387526,0.00009451542,0.7619136,0.01013711,0.22444566,0.0026065814,0.00002611822],"about_ca_topic_score_codex":0.0015272072,"about_ca_topic_score_gemma":0.0019441536,"teacher_disagreement_score":0.008506806,"about_ca_system_score_codex":0.0010361618,"about_ca_system_score_gemma":0.0017381469,"threshold_uncertainty_score":0.028458118},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011276899,0.00044824564,0.9767696,0.00023374544,0.000060839062,0.000022786793,0.00007770436,0.0002259021,0.01088421],"genre_scores_gemma":[0.36452317,0.00093583635,0.61449414,0.00015392128,0.00018945102,0.00014139908,0.0003371891,0.0007276654,0.018497255],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993374,0.00020723717,0.000022718035,0.0001490669,0.000222511,0.000061036255],"domain_scores_gemma":[0.9983871,0.0010964372,0.00006966116,0.00029205493,0.00011156968,0.000043223743],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009873135,0.0012050316,0.0015175114,0.00046829524,0.0005603934,0.0015335133,0.0016395093,0.0015098808,0.006899341],"category_scores_gemma":[0.0068570105,0.0007822452,0.00077840453,0.0012043071,0.0015362706,0.0035675752,0.0022612615,0.002409487,0.0011532843],"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.00017280759,0.00011003999,0.000298966,0.0004776657,0.000054671884,0.00009707643,0.000120862314,0.585305,0.0035702141,0.20541944,0.008345244,0.19602801],"study_design_scores_gemma":[0.000012354437,0.0000290479,0.00008707479,0.000016627377,0.00001034414,0.0000646478,0.000029313498,0.9012866,0.00090321334,0.09519242,0.0023583255,0.000010068255],"about_ca_topic_score_codex":0.0014211702,"about_ca_topic_score_gemma":0.0027235576,"teacher_disagreement_score":0.006899341,"about_ca_system_score_codex":0.0006675225,"about_ca_system_score_gemma":0.0008721078,"threshold_uncertainty_score":0.023080528},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.72376776,0.00138918,0.17733993,0.0028905338,0.00065910065,0.00011051063,0.00044042786,0.00014915428,0.09325342],"genre_scores_gemma":[0.97583914,0.0007535677,0.010954407,0.00021636042,0.00039233145,0.000043338492,0.00020876128,0.00006860537,0.011523468],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99910516,0.0002750631,0.00005239948,0.00015812079,0.00022229855,0.00018703674],"domain_scores_gemma":[0.9971372,0.0014642623,0.0004698663,0.0003668715,0.00023778966,0.00032400977],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018655191,0.00061520794,0.0009080358,0.001560652,0.0016341623,0.003255038,0.0011566421,0.00096996815,0.0068158316],"category_scores_gemma":[0.005552086,0.0005488529,0.0011959301,0.0014068278,0.0053014345,0.005647575,0.00240571,0.002702992,0.00056916417],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003527764,0.000014269775,0.00031250756,0.000011714245,0.0000036994188,0.000043657223,0.00013566355,0.0010799051,0.00025703106,0.99531037,0.00033034018,0.0024656092],"study_design_scores_gemma":[0.000012056577,0.0000075941325,0.00010551773,0.0000052359223,0.0000029006571,0.000029414858,0.000051334144,0.0024874061,0.000095311225,0.9965983,0.00060013897,0.0000047230355],"about_ca_topic_score_codex":0.001322458,"about_ca_topic_score_gemma":0.0013286404,"teacher_disagreement_score":0.0068158316,"about_ca_system_score_codex":0.0018043923,"about_ca_system_score_gemma":0.00082256197,"threshold_uncertainty_score":0.02280122},"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":"other","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.078055665,0.027131066,0.35337368,0.0044537405,0.0023315612,0.000104357576,0.00046509708,0.00044456546,0.5336402],"genre_scores_gemma":[0.6853483,0.019422859,0.11169766,0.0013319827,0.002296301,0.000156211,0.0009978297,0.00046570748,0.17828313],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9996125,0.00009263286,0.000020544237,0.00006818337,0.00012117557,0.000085056665],"domain_scores_gemma":[0.9995982,0.00016844095,0.000037454265,0.000073430565,0.000071143455,0.0000514083],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007614989,0.0014932326,0.0009902886,0.0020908078,0.0011528317,0.0032602823,0.00078792754,0.00074425124,0.007937341],"category_scores_gemma":[0.001548775,0.0005263411,0.000975613,0.0022912333,0.0043075383,0.00516816,0.0016690427,0.00394931,0.0023162784],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000015236246,0.000008211879,0.00003133701,0.00003442482,0.0000029977234,0.000021724096,0.00020170034,0.00027890873,0.0002983068,0.98733574,0.0020923864,0.009678833],"study_design_scores_gemma":[0.0000050398435,0.0000061159108,0.000053599633,0.000017945,0.0000030990025,0.00004977312,0.000051356958,0.0005867829,0.0001536075,0.9892407,0.009827308,0.0000045722213],"about_ca_topic_score_codex":0.0007831424,"about_ca_topic_score_gemma":0.0009676085,"teacher_disagreement_score":0.007937341,"about_ca_system_score_codex":0.0017310377,"about_ca_system_score_gemma":0.0005073086,"threshold_uncertainty_score":0.026553035},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.40955922,0.0041980534,0.42519248,0.031256393,0.001196116,0.00007378762,0.0008845639,0.00066286454,0.12697652],"genre_scores_gemma":[0.9595329,0.00087401824,0.02256902,0.000696662,0.0011165397,0.00006988036,0.0002759484,0.00012367201,0.014741283],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989945,0.0004181072,0.000040270897,0.00016929023,0.00020933879,0.00016842321],"domain_scores_gemma":[0.9935236,0.0051132645,0.00045208546,0.00034428306,0.00019114645,0.00037566086],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014679345,0.00062884064,0.0021025194,0.0015048448,0.0021014481,0.0028097136,0.001705017,0.0020741294,0.008762303],"category_scores_gemma":[0.0072545586,0.0005705264,0.0010431941,0.00172451,0.0037745133,0.00800248,0.003020395,0.005350093,0.0006865773],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007461972,0.000020948592,0.000101311445,0.00004311448,0.000013747517,0.000053687905,0.00008082677,0.0018578356,0.00018949686,0.9930248,0.0015582987,0.0029811685],"study_design_scores_gemma":[0.000020008527,0.000007348115,0.0000540289,0.0000070262668,0.00000746191,0.00004670958,0.000024420691,0.008011422,0.00015098974,0.99089056,0.00077139976,0.0000087227345],"about_ca_topic_score_codex":0.00045496103,"about_ca_topic_score_gemma":0.00043434784,"teacher_disagreement_score":0.008762303,"about_ca_system_score_codex":0.0011902218,"about_ca_system_score_gemma":0.0007719848,"threshold_uncertainty_score":0.02931279},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.026281122,0.00023284428,0.9483084,0.00021862204,0.0000751024,0.000079837206,0.00016846549,0.012781948,0.0118537005],"genre_scores_gemma":[0.23973724,0.0001893098,0.7499859,0.00014197767,0.0000509008,0.0001308229,0.00053954497,0.0015237655,0.007700517],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987437,0.00023067903,0.00010627352,0.00019865115,0.00043741465,0.00028330038],"domain_scores_gemma":[0.99883586,0.00037314242,0.00006989388,0.00047711036,0.00017911,0.00006492547],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007648774,0.0008589865,0.0009500346,0.00068171666,0.0009188421,0.0026515396,0.0031973606,0.00078238756,0.011011068],"category_scores_gemma":[0.0024193886,0.0007890836,0.0010562475,0.0012661748,0.0006031527,0.0040606814,0.0023265125,0.0018961636,0.0036174378],"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.001103204,0.0004689974,0.0015391163,0.00072315324,0.000121164,0.00043516434,0.0005278131,0.035969354,0.060363073,0.2871622,0.025157092,0.5864297],"study_design_scores_gemma":[0.0003276871,0.00035907383,0.0007608429,0.0001221082,0.00017656611,0.00054630777,0.00019533986,0.6049756,0.11414914,0.2157514,0.062523715,0.00011230773],"about_ca_topic_score_codex":0.0009826752,"about_ca_topic_score_gemma":0.0026435945,"teacher_disagreement_score":0.011011068,"about_ca_system_score_codex":0.0009939196,"about_ca_system_score_gemma":0.0013258638,"threshold_uncertainty_score":0.03683567},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.49842817,0.003763944,0.071695454,0.006650834,0.0011841675,0.000068466514,0.0007014846,0.00053190027,0.4169756],"genre_scores_gemma":[0.95982045,0.00090035173,0.0044230875,0.00032085,0.0008939263,0.000038875554,0.00029501514,0.000111677786,0.03319572],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995596,0.00010968615,0.00002042876,0.00010344705,0.000104585924,0.0001022753],"domain_scores_gemma":[0.9989421,0.0003834702,0.00014796358,0.0001078508,0.0001441558,0.00027438556],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008247037,0.0006881364,0.0009802342,0.002696997,0.002919633,0.0035446098,0.000588258,0.00073382875,0.016767029],"category_scores_gemma":[0.0024484128,0.00043933734,0.00068969734,0.0019782458,0.0037771282,0.0049959184,0.0020040323,0.002400286,0.0012447046],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000023346367,0.0000065543627,0.00016136869,0.000015541462,0.000002638079,0.000036205212,0.00012832729,0.000244059,0.00018159632,0.9966292,0.0010076733,0.0015635194],"study_design_scores_gemma":[0.000012983546,0.0000057722973,0.0002382988,0.0000074424606,0.0000051966263,0.00007488936,0.000058586007,0.0007927171,0.00014194612,0.9950177,0.0036392307,0.0000052009595],"about_ca_topic_score_codex":0.00072246586,"about_ca_topic_score_gemma":0.0009961971,"teacher_disagreement_score":0.016767029,"about_ca_system_score_codex":0.0016878648,"about_ca_system_score_gemma":0.00054031535,"threshold_uncertainty_score":0.05609131},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.85535806,0.00037760104,0.074964106,0.0012134309,0.00013608775,0.00006374843,0.00018527058,0.00014111643,0.06756044],"genre_scores_gemma":[0.97770005,0.00025441407,0.010297376,0.00013110472,0.00008959676,0.00007406054,0.00023245573,0.00009865039,0.0111222165],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9997843,0.000037227466,0.00000659287,0.00003472458,0.00006642243,0.00007086881],"domain_scores_gemma":[0.9997482,0.00006436939,0.000055307868,0.000040481358,0.000033307853,0.000058438098],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00023360044,0.00082680694,0.00060125487,0.0011879394,0.0014726915,0.0026596806,0.0007634585,0.0017805023,0.0049944515],"category_scores_gemma":[0.0009744894,0.00038615416,0.00071581244,0.0006733667,0.002439182,0.0026863038,0.0014336032,0.0013337733,0.0006286597],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003944693,0.00003769668,0.00063218677,0.000043531556,0.000006765787,0.00024915993,0.0003047175,0.018131502,0.0043253675,0.9713794,0.0007847313,0.004065379],"study_design_scores_gemma":[0.000030478219,0.000037480986,0.0010833207,0.00002184925,0.00000606102,0.0003307507,0.00054933125,0.11898806,0.0023829353,0.8734111,0.0031263959,0.000032115462],"about_ca_topic_score_codex":0.0010337445,"about_ca_topic_score_gemma":0.00074546365,"teacher_disagreement_score":0.0049944515,"about_ca_system_score_codex":0.00094119227,"about_ca_system_score_gemma":0.0004037867,"threshold_uncertainty_score":0.016708136},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.051522564,0.0005413835,0.83821076,0.00039081828,0.00029346292,0.00022111219,0.0017329742,0.010012187,0.0970747],"genre_scores_gemma":[0.3739045,0.00061568007,0.5611076,0.0002766183,0.00026321813,0.00030836053,0.0055866763,0.0031899977,0.05474746],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99910384,0.00017401046,0.000051141178,0.00014263454,0.0003540313,0.00017441467],"domain_scores_gemma":[0.9990345,0.0002761083,0.00004731415,0.00035244875,0.00020973785,0.00007993928],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007567908,0.001019496,0.001252425,0.0014674425,0.001622108,0.0029830246,0.0021584898,0.00060877844,0.04668291],"category_scores_gemma":[0.0023538892,0.0007338707,0.0013895624,0.002708503,0.00097008416,0.004675767,0.00241457,0.0017746371,0.014610939],"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.0005124768,0.0002359387,0.0006503979,0.0005296949,0.000069099704,0.00020017593,0.00043253796,0.017785648,0.009327182,0.46516284,0.06786403,0.43722996],"study_design_scores_gemma":[0.00012655312,0.00009643486,0.0002214068,0.00009419053,0.000045649456,0.00015664138,0.00017599172,0.103241764,0.01920547,0.82745206,0.0491295,0.000054369222],"about_ca_topic_score_codex":0.0017196211,"about_ca_topic_score_gemma":0.0058293757,"teacher_disagreement_score":0.04668291,"about_ca_system_score_codex":0.0011608563,"about_ca_system_score_gemma":0.0012223875,"threshold_uncertainty_score":0.15616995},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9403572,0.00013655482,0.040384322,0.00023788276,0.00002703841,0.000025586003,0.000115352384,0.00015483533,0.01856118],"genre_scores_gemma":[0.9957497,0.000097611744,0.002442499,0.000013827349,0.000022851775,0.0000097083275,0.00009078957,0.000024968895,0.001548044],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99942243,0.00007997521,0.000029572744,0.00015886231,0.0001462911,0.00016292179],"domain_scores_gemma":[0.9989427,0.00032418684,0.00018280208,0.000251502,0.00008689704,0.00021198617],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006707535,0.0004600872,0.0004396061,0.0010150142,0.0012742371,0.002130567,0.000641839,0.00056275306,0.0054524983],"category_scores_gemma":[0.0026258281,0.0003773988,0.00085451576,0.00067358103,0.0029689104,0.0045771697,0.0025439686,0.0017180224,0.00031866357],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007156488,0.000024616762,0.002296378,0.000040427563,0.000012195494,0.00033103712,0.000937778,0.003653263,0.004121398,0.9828628,0.00022016642,0.005428367],"study_design_scores_gemma":[0.000043141743,0.00011715248,0.002442344,0.000034777982,0.000039808943,0.0005082101,0.0010011995,0.018130511,0.0071170884,0.9649071,0.0056137093,0.00004500863],"about_ca_topic_score_codex":0.0007820566,"about_ca_topic_score_gemma":0.0005370401,"teacher_disagreement_score":0.0054524983,"about_ca_system_score_codex":0.000903112,"about_ca_system_score_gemma":0.00032785328,"threshold_uncertainty_score":0.018240392},"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3037238,0.005091063,0.18370119,0.0035797514,0.0012135507,0.00009325674,0.0014978464,0.0013618902,0.49973765],"genre_scores_gemma":[0.8743337,0.0015135487,0.030415459,0.0005658345,0.0006543795,0.00006418821,0.0010129663,0.0004588613,0.090981275],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990024,0.00023339051,0.00005833645,0.0002506335,0.00030469487,0.00015054045],"domain_scores_gemma":[0.99903035,0.0003758708,0.00011278898,0.00012504024,0.00021191544,0.00014408868],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007386897,0.00057463633,0.0008035478,0.0019351367,0.0015281746,0.0031090644,0.00065587036,0.00041533713,0.012360298],"category_scores_gemma":[0.0023687389,0.00050096697,0.0010792917,0.0014432025,0.0024367697,0.0035811462,0.0026736278,0.0018273193,0.0025617492],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000043496682,0.000009117113,0.00034818574,0.00006293922,0.000015912177,0.000059089347,0.00025171417,0.0006962473,0.0006693986,0.9831697,0.0031986688,0.011475523],"study_design_scores_gemma":[0.000015166854,0.0000206059,0.0008193429,0.000020493917,0.000017081098,0.00016527843,0.00016247817,0.0018038175,0.0009422937,0.97269565,0.023320153,0.000017573968],"about_ca_topic_score_codex":0.0014792645,"about_ca_topic_score_gemma":0.0021244627,"teacher_disagreement_score":0.012360298,"about_ca_system_score_codex":0.0015920791,"about_ca_system_score_gemma":0.0005541877,"threshold_uncertainty_score":0.04134935},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.21204294,0.0041689537,0.6329384,0.003992164,0.0006006142,0.00005560563,0.0006142607,0.0010353716,0.14455174],"genre_scores_gemma":[0.94067323,0.001242209,0.032177392,0.00052412465,0.00050854194,0.00006389592,0.0004204688,0.00028393,0.024106195],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99804306,0.0005666465,0.000096052725,0.00034872198,0.0006056788,0.00033977997],"domain_scores_gemma":[0.9965299,0.0018328497,0.00023824025,0.0006530308,0.0004181845,0.000327917],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002260557,0.0009666378,0.0013404181,0.0022516437,0.0017220218,0.0038688816,0.0015934911,0.0009265574,0.007992745],"category_scores_gemma":[0.008252793,0.00056655594,0.00067251624,0.0023253707,0.0032797547,0.009705763,0.0042069736,0.0032063457,0.00072804384],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000020837697,0.000009641121,0.00014225484,0.00002523483,0.000004321772,0.000014858097,0.00006228098,0.0015775914,0.00023764092,0.99310476,0.00087199564,0.0039285636],"study_design_scores_gemma":[0.000007435582,0.0000053504064,0.000093654424,0.000011944594,0.000008933282,0.000019966094,0.000019161125,0.015338034,0.00052795483,0.9814891,0.0024724803,0.000005917092],"about_ca_topic_score_codex":0.0014629449,"about_ca_topic_score_gemma":0.0017425946,"teacher_disagreement_score":0.007992745,"about_ca_system_score_codex":0.003013369,"about_ca_system_score_gemma":0.0008222006,"threshold_uncertainty_score":0.026738405},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13333198,0.0003411106,0.8443705,0.00047015044,0.00022292706,0.000119428645,0.0004824068,0.003464463,0.017196953],"genre_scores_gemma":[0.47840023,0.0003770437,0.4982209,0.00030146388,0.0002680209,0.00014657187,0.001899808,0.00077564846,0.019610336],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99891496,0.00022926612,0.000059587317,0.00021105724,0.00043798352,0.00014722819],"domain_scores_gemma":[0.9976169,0.0012621224,0.0001265193,0.0004939722,0.00038045103,0.00012009364],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010870275,0.0009388953,0.0012442617,0.0012315342,0.0010620792,0.0034233383,0.0016512288,0.0009767923,0.011436023],"category_scores_gemma":[0.007355558,0.00057873013,0.00074887817,0.001984737,0.0013017247,0.006071744,0.0026477014,0.0018410735,0.0032844548],"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.0009052164,0.00036206967,0.0035314423,0.00032707833,0.00007912904,0.00029425864,0.00083206675,0.06084975,0.025147522,0.441252,0.018488495,0.447931],"study_design_scores_gemma":[0.00009993378,0.00018545087,0.00086783036,0.0000505547,0.000028869857,0.00031126235,0.00034366705,0.39129913,0.015148552,0.58167255,0.009922505,0.00006976988],"about_ca_topic_score_codex":0.0016793165,"about_ca_topic_score_gemma":0.004690895,"teacher_disagreement_score":0.011436023,"about_ca_system_score_codex":0.00083553046,"about_ca_system_score_gemma":0.001033363,"threshold_uncertainty_score":0.0382573},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0105914585,0.00021619114,0.9803569,0.0005603113,0.00008993187,0.00013019859,0.00052771514,0.00033012434,0.007197288],"genre_scores_gemma":[0.31534913,0.0005122128,0.6684885,0.000302012,0.00022385395,0.00039329167,0.002226265,0.00036478933,0.01213994],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99909985,0.00018214305,0.000039534134,0.0003132346,0.00021084117,0.00015441455],"domain_scores_gemma":[0.9986829,0.00078628026,0.00007155733,0.00015536661,0.0002404601,0.000063333195],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001038969,0.00077243254,0.001379674,0.0006922672,0.0006877856,0.00225094,0.001897377,0.0014994915,0.020510059],"category_scores_gemma":[0.0046269502,0.00053237873,0.0013533224,0.0010432946,0.0009729832,0.0032931156,0.0018272183,0.0019017074,0.0019125202],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003120468,0.00022859723,0.0008776011,0.0010086052,0.00006913049,0.00040562722,0.00034078106,0.34316292,0.006166833,0.3888335,0.037914738,0.22067969],"study_design_scores_gemma":[0.000037901926,0.00004911778,0.00010093059,0.00003768247,0.000020759195,0.000087904446,0.00015600401,0.83990455,0.001010494,0.1550297,0.0035484566,0.000016458642],"about_ca_topic_score_codex":0.0037767603,"about_ca_topic_score_gemma":0.004305939,"teacher_disagreement_score":0.020510059,"about_ca_system_score_codex":0.0009214565,"about_ca_system_score_gemma":0.0016469087,"threshold_uncertainty_score":0.06861293},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.017127683,0.0060234577,0.77881914,0.01030818,0.0006648971,0.000079456004,0.00023220727,0.0014265922,0.18531841],"genre_scores_gemma":[0.6612921,0.005933954,0.3009047,0.002929719,0.0019543464,0.00029757613,0.0004269986,0.0012143056,0.025046393],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9972389,0.0011010654,0.00015347802,0.0004168491,0.0008150263,0.00027466926],"domain_scores_gemma":[0.9935314,0.003961775,0.00020137963,0.0017804236,0.00036451928,0.0001604669],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0034520782,0.0009813771,0.0015925446,0.0013985417,0.0026100893,0.005594765,0.002380873,0.0028078745,0.0066874577],"category_scores_gemma":[0.011299015,0.001014747,0.0020301058,0.0025619052,0.017445829,0.01575719,0.0045053335,0.007924344,0.0016453328],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000063495254,0.00000299629,0.000021241012,0.000016079373,0.0000021989251,0.0000066389566,0.00004484295,0.0005520503,0.000048429392,0.9954502,0.0007104201,0.0031385017],"study_design_scores_gemma":[0.000003835175,0.000002359241,0.0000113497435,0.000007013853,0.0000021848793,0.000010775975,0.00000781153,0.0013295354,0.00006009474,0.9958497,0.00271249,0.0000027727933],"about_ca_topic_score_codex":0.0013908168,"about_ca_topic_score_gemma":0.0011995478,"teacher_disagreement_score":0.0066874577,"about_ca_system_score_codex":0.0020316483,"about_ca_system_score_gemma":0.0011886678,"threshold_uncertainty_score":0.022371769},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05084414,0.001914754,0.81796473,0.0008214359,0.00044390626,0.000116984906,0.0003255325,0.0037858076,0.12378272],"genre_scores_gemma":[0.5630544,0.0028591298,0.32660908,0.00035290676,0.0005901706,0.00013837448,0.00091611367,0.0024629591,0.10301691],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995554,0.000060142018,0.000022253585,0.00008011319,0.00019333378,0.00008866148],"domain_scores_gemma":[0.9992034,0.0003167999,0.000032359352,0.00031473738,0.00009436333,0.000038379298],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00041110517,0.00060838053,0.0009303937,0.0008600767,0.0008582441,0.0014651602,0.0011265589,0.0003675156,0.018660698],"category_scores_gemma":[0.002203592,0.000557866,0.00072743767,0.0018178793,0.0013043985,0.005468284,0.0025134746,0.0017049878,0.0033040505],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00018082937,0.00006222541,0.00028417353,0.00035922282,0.000022366543,0.000087510525,0.00025072618,0.009543905,0.00844895,0.64189523,0.015247132,0.32361764],"study_design_scores_gemma":[0.00004222299,0.000046206012,0.00022560896,0.000069485985,0.000031584466,0.00018314524,0.00007268027,0.031908423,0.010880738,0.88777214,0.068740524,0.000027093027],"about_ca_topic_score_codex":0.00075592985,"about_ca_topic_score_gemma":0.0015488369,"teacher_disagreement_score":0.018660698,"about_ca_system_score_codex":0.00071339717,"about_ca_system_score_gemma":0.0005781033,"threshold_uncertainty_score":0.06242627},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00867471,0.0026097784,0.9781064,0.00082448026,0.0004965287,0.000041281153,0.000113330796,0.0003932824,0.008740329],"genre_scores_gemma":[0.41474134,0.0064847213,0.5215423,0.0018987856,0.0019168068,0.0004458837,0.0009128894,0.0017059239,0.05035131],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9938958,0.0013864756,0.00025534883,0.0007606953,0.0030701312,0.000631548],"domain_scores_gemma":[0.9786673,0.013258615,0.0007484822,0.002454832,0.004107354,0.00076332554],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.010030181,0.002394405,0.0021556828,0.0023912655,0.0012890471,0.0022990324,0.0027947954,0.002959961,0.0055322754],"category_scores_gemma":[0.03380861,0.00068338023,0.0021222106,0.0018029433,0.004734688,0.0062264325,0.008130952,0.008001427,0.0017691475],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00076327607,0.00014101116,0.0015664544,0.0006136056,0.00013635906,0.0003903139,0.0005396604,0.24773811,0.011903545,0.63656324,0.010161419,0.08948299],"study_design_scores_gemma":[0.000030869007,0.000116175106,0.0003319516,0.00013977516,0.00004064261,0.00016366575,0.000054985256,0.7955193,0.005959578,0.1905815,0.0069955266,0.00006587724],"about_ca_topic_score_codex":0.0033940147,"about_ca_topic_score_gemma":0.0025238516,"teacher_disagreement_score":0.010030181,"about_ca_system_score_codex":0.002745044,"about_ca_system_score_gemma":0.0017169662,"threshold_uncertainty_score":0.053045273},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.40103287,0.0060408795,0.48958603,0.0062811105,0.0005354557,0.00009114651,0.00016686793,0.00020540752,0.09606028],"genre_scores_gemma":[0.91950536,0.004491973,0.05047415,0.00058576174,0.00070464646,0.00011361458,0.00016221944,0.0001272168,0.023835167],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.999374,0.0002894093,0.0000324838,0.0000715863,0.0001435986,0.00008897222],"domain_scores_gemma":[0.99721414,0.0016219812,0.0004304375,0.00013439241,0.0003564155,0.00024269546],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019807469,0.0012240922,0.00090103934,0.0021426221,0.0011626839,0.0014525247,0.0007934278,0.0014978318,0.0035653708],"category_scores_gemma":[0.012143131,0.00033761022,0.00071260013,0.0015411092,0.004071874,0.00315532,0.0025479416,0.0022375644,0.0008816645],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000014915494,0.000015738555,0.00019691918,0.00006853783,0.000008225132,0.00014480112,0.00017629986,0.0077404343,0.0011673496,0.9864265,0.00059311214,0.003447229],"study_design_scores_gemma":[0.000017499808,0.00002689141,0.00016107295,0.00003810928,0.000007794727,0.00014455846,0.00007523061,0.06889501,0.00051550765,0.928218,0.0018847417,0.000015599871],"about_ca_topic_score_codex":0.0013058404,"about_ca_topic_score_gemma":0.000807039,"teacher_disagreement_score":0.0035653708,"about_ca_system_score_codex":0.0013011415,"about_ca_system_score_gemma":0.0006074295,"threshold_uncertainty_score":0.011927366},"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":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2887043,0.006769771,0.20294249,0.00204558,0.0026029868,0.0004662939,0.0059748003,0.0063878396,0.48410594],"genre_scores_gemma":[0.6143662,0.0016368172,0.059163302,0.001065175,0.00020933824,0.00039933398,0.0076868744,0.0012478033,0.3142252],"study_design_codex":"bench_or_experimental","study_design_gemma":"not_applicable","domain_scores_codex":[0.9996407,0.000019177965,0.000020409425,0.0001504355,0.00009270847,0.00007658153],"domain_scores_gemma":[0.99963474,0.00003742157,0.00006069743,0.00009974176,0.000057831898,0.000109648376],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00021091643,0.0011796914,0.00048746084,0.00060730014,0.0019942787,0.0020867249,0.0013343659,0.0011394487,0.07318414],"category_scores_gemma":[0.00070147985,0.0006121901,0.0007832917,0.00057940156,0.00091890333,0.00139136,0.0034355205,0.0011575978,0.046610165],"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.0010332343,0.00011810641,0.010726929,0.0007890632,0.00010123529,0.005274007,0.001483318,0.0037936997,0.5332783,0.11735445,0.021050869,0.30499682],"study_design_scores_gemma":[0.00011376875,0.00057006517,0.024286306,0.00037562635,0.00019145463,0.007681145,0.0016441926,0.010366917,0.10901321,0.049270436,0.79632276,0.00016422024],"about_ca_topic_score_codex":0.0021230024,"about_ca_topic_score_gemma":0.0029145677,"teacher_disagreement_score":0.92681587,"about_ca_system_score_codex":0.0004915377,"about_ca_system_score_gemma":0.0009555194,"threshold_uncertainty_score":0.2448253},"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":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01258335,0.00069265865,0.087167986,0.023444664,0.0066191508,0.00060875656,0.03216619,0.10672561,0.7299916],"genre_scores_gemma":[0.17631252,0.0018857322,0.06196165,0.009103674,0.0022590407,0.00064210105,0.054116093,0.10019568,0.5935235],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99755436,0.00036961093,0.0001936705,0.0005409173,0.0007787144,0.0005626882],"domain_scores_gemma":[0.99635494,0.00068335526,0.00015736916,0.0009797778,0.0013324342,0.00049220305],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.0020025612,0.001034109,0.0013723335,0.0015383961,0.0022091076,0.007600573,0.0017194698,0.0029674175,0.35062313],"category_scores_gemma":[0.010802916,0.001207445,0.0014869544,0.0011173615,0.0016851319,0.015645169,0.0031688018,0.0020683883,0.3153854],"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.0005506465,0.00013912385,0.0019274822,0.0004243335,0.00004405338,0.0003197891,0.0010443493,0.000454963,0.0027798763,0.054852318,0.8747754,0.06268772],"study_design_scores_gemma":[0.00006704244,0.00003213242,0.0011603045,0.00013090171,0.000025456877,0.00016050928,0.00071246276,0.0010254638,0.009151398,0.015382279,0.9720705,0.00008156516],"about_ca_topic_score_codex":0.0126109645,"about_ca_topic_score_gemma":0.017856756,"teacher_disagreement_score":0.64937687,"about_ca_system_score_codex":0.002582859,"about_ca_system_score_gemma":0.0016155043,"threshold_uncertainty_score":0.9262573},"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":"other","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0064568697,0.043440115,0.20313056,0.010310252,0.0024569924,0.00009818586,0.00097359647,0.0013594155,0.73177403],"genre_scores_gemma":[0.41061676,0.03990211,0.087053806,0.002998146,0.0076833568,0.0005776551,0.00409917,0.0012285481,0.44584042],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994153,0.00017900873,0.00003502694,0.00007332337,0.00023800923,0.000059368936],"domain_scores_gemma":[0.9996131,0.0001786972,0.000020519361,0.00007872193,0.00008387238,0.000025160803],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000685458,0.001189191,0.0010426239,0.0021536949,0.0018073476,0.0037640529,0.0012014483,0.0009697423,0.024665514],"category_scores_gemma":[0.0010939544,0.00088976754,0.0009572698,0.0028640481,0.0041642585,0.0076823165,0.0013872822,0.004908677,0.008035],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000035431854,0.0000086773825,0.0000151590175,0.000056221856,0.0000037909654,0.000008360332,0.00011959945,0.00019278706,0.00010918365,0.97864807,0.01096135,0.009873381],"study_design_scores_gemma":[0.00000593666,0.000003332293,0.00002657976,0.00002815434,0.0000035275468,0.000019690975,0.00003986805,0.0003725603,0.00008350977,0.9436701,0.055742864,0.0000038383073],"about_ca_topic_score_codex":0.0013856357,"about_ca_topic_score_gemma":0.0015161262,"teacher_disagreement_score":0.024665514,"about_ca_system_score_codex":0.0031380306,"about_ca_system_score_gemma":0.0011784256,"threshold_uncertainty_score":0.082514346},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07013687,0.0022910153,0.7765936,0.0018306224,0.0005164638,0.00014131783,0.00037015474,0.0010213868,0.14709863],"genre_scores_gemma":[0.5986971,0.0037596035,0.31950384,0.0007764013,0.00089516863,0.00017963779,0.00093525765,0.00093820924,0.07431471],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990005,0.00026319196,0.0000493883,0.00020547575,0.00039155546,0.00008991847],"domain_scores_gemma":[0.99908674,0.0003639733,0.000059150072,0.00017552181,0.00020592763,0.00010861718],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001276646,0.0008963964,0.001129917,0.002122459,0.0010352258,0.0026449237,0.0013538697,0.00061284105,0.009836282],"category_scores_gemma":[0.0025635667,0.0007061916,0.001265108,0.0016541358,0.0049206517,0.0055761775,0.003638565,0.0048237205,0.0020885346],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000007761754,0.000008807021,0.000036068788,0.00003255844,0.0000034920936,0.000014461879,0.00022704208,0.0007044512,0.00026992452,0.9893861,0.0011616142,0.008147631],"study_design_scores_gemma":[0.000010319755,0.000011837086,0.000057794172,0.000010023544,0.0000038883163,0.000026788988,0.000056964287,0.0021650125,0.0003259085,0.9862054,0.011119761,0.000006227702],"about_ca_topic_score_codex":0.0015331535,"about_ca_topic_score_gemma":0.0013186377,"teacher_disagreement_score":0.009836282,"about_ca_system_score_codex":0.0017819894,"about_ca_system_score_gemma":0.0008236317,"threshold_uncertainty_score":0.03290564},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.22594218,0.0012129878,0.7135139,0.00075937464,0.0005997646,0.0001805368,0.0015140875,0.008238958,0.048038125],"genre_scores_gemma":[0.8652215,0.0003285252,0.12116011,0.00016817455,0.00010820745,0.00009174466,0.0016631216,0.0007753368,0.010483296],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989054,0.00014413771,0.000064843916,0.00023820292,0.00035916458,0.00028819474],"domain_scores_gemma":[0.99752766,0.0008391328,0.00017262607,0.0008152899,0.0004115423,0.00023364705],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008531319,0.0006022192,0.00073417847,0.00235073,0.0012599797,0.0031880261,0.0012042806,0.00062961335,0.009221098],"category_scores_gemma":[0.006967285,0.00038445953,0.00063097157,0.002509411,0.0013167309,0.0051390016,0.0025195049,0.0020514445,0.0027655868],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0009042971,0.00020280245,0.009114226,0.00023679886,0.00011372097,0.00017816552,0.00048732458,0.048019577,0.021742905,0.64309317,0.024323193,0.25158387],"study_design_scores_gemma":[0.00006745642,0.00012582944,0.0017306192,0.00005680194,0.000046344216,0.0001202347,0.00022422451,0.2479326,0.018147843,0.7184728,0.013013972,0.000061308514],"about_ca_topic_score_codex":0.006412206,"about_ca_topic_score_gemma":0.010475149,"teacher_disagreement_score":0.009221098,"about_ca_system_score_codex":0.0019293939,"about_ca_system_score_gemma":0.0015505591,"threshold_uncertainty_score":0.030847669},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0028556366,0.0072872434,0.006384655,0.0019221293,0.0010929103,0.000016184855,0.00034093147,0.0002642123,0.9798361],"genre_scores_gemma":[0.10215858,0.018873537,0.004809307,0.0009633866,0.0025516436,0.000043448486,0.0008029758,0.0004421361,0.86935496],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99982363,0.000025354922,0.0000064262513,0.000027580996,0.00008728719,0.000029731465],"domain_scores_gemma":[0.9997873,0.000047513553,0.00001523757,0.000040967956,0.000066184315,0.000042809876],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001584947,0.00032208196,0.00026785617,0.0010483294,0.0012393265,0.0024118917,0.0003034148,0.00027800284,0.048150517],"category_scores_gemma":[0.00058605365,0.00018996286,0.00024225084,0.0013054967,0.001250107,0.0027760128,0.0009211427,0.0011392658,0.011328201],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000061902647,0.000004582686,0.00005426379,0.00006369037,0.0000026855748,0.00004509128,0.0002999393,0.0001682832,0.0005218386,0.8654626,0.09946309,0.033907775],"study_design_scores_gemma":[0.0000017730565,0.0000064726255,0.00020062832,0.000043564098,0.00000254588,0.0002081157,0.00011660023,0.00016337463,0.00021267548,0.10181167,0.8972288,0.0000038374833],"about_ca_topic_score_codex":0.0010138096,"about_ca_topic_score_gemma":0.0016285838,"teacher_disagreement_score":0.048150517,"about_ca_system_score_codex":0.0011608608,"about_ca_system_score_gemma":0.00078773353,"threshold_uncertainty_score":0.16107953},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08423921,0.00020688142,0.8994327,0.00019414537,0.000079412195,0.0000928474,0.00027491862,0.0048561394,0.010623715],"genre_scores_gemma":[0.59796023,0.00018580495,0.3893079,0.00012325132,0.000091902875,0.00012119708,0.0008772332,0.0010237719,0.010308749],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991986,0.00017088313,0.000033132892,0.00012159566,0.0003282976,0.00014753456],"domain_scores_gemma":[0.9981104,0.0009011488,0.00013866166,0.0004814058,0.0002814576,0.00008685562],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007204737,0.0008214528,0.0011350889,0.0009769073,0.00048100555,0.0010040465,0.0012317032,0.0005681961,0.014853674],"category_scores_gemma":[0.0045380914,0.00039897513,0.0007430101,0.0017479513,0.000539256,0.0023005698,0.0016359057,0.0016528891,0.0022916486],"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.0013099405,0.0004228754,0.0017522215,0.0003908704,0.00008790693,0.00021292386,0.0003028894,0.194159,0.021623615,0.11490932,0.013192127,0.65163624],"study_design_scores_gemma":[0.00010584417,0.00017158117,0.00037038216,0.000025820676,0.000025770689,0.000081141465,0.00007349182,0.93491393,0.012846204,0.045218803,0.0061433716,0.000023628496],"about_ca_topic_score_codex":0.0026636182,"about_ca_topic_score_gemma":0.0074526216,"teacher_disagreement_score":0.014853674,"about_ca_system_score_codex":0.0007794292,"about_ca_system_score_gemma":0.0011223755,"threshold_uncertainty_score":0.049690545},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.026543088,0.00044787498,0.955469,0.0001868059,0.00012629088,0.00011986161,0.00013923856,0.0021140184,0.014853834],"genre_scores_gemma":[0.29479095,0.00053154415,0.6981799,0.00008186247,0.00007513584,0.00019909312,0.00031568063,0.00031075106,0.0055150646],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99875486,0.00022076395,0.000075742064,0.000110235174,0.0007601727,0.00007819841],"domain_scores_gemma":[0.99848324,0.0005146806,0.00007875709,0.00057062577,0.00030486955,0.0000478865],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000978681,0.00043708915,0.00058173365,0.00057689595,0.0007021165,0.0010294155,0.0011387304,0.0005150153,0.0032413753],"category_scores_gemma":[0.004699882,0.00024957064,0.00041150727,0.0010915955,0.0006925374,0.0015767067,0.0011597433,0.0010138593,0.0010916111],"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.00042140245,0.00017054158,0.002354138,0.00039814838,0.00009787109,0.0002621674,0.0003604551,0.36909956,0.036111254,0.21163003,0.011356213,0.36773825],"study_design_scores_gemma":[0.00009163206,0.0000989454,0.0005077787,0.000022622047,0.000019859845,0.00015705376,0.000031173324,0.9102883,0.017524611,0.05295805,0.0182745,0.000025431935],"about_ca_topic_score_codex":0.0012747493,"about_ca_topic_score_gemma":0.0015696745,"teacher_disagreement_score":0.0032413753,"about_ca_system_score_codex":0.00062102184,"about_ca_system_score_gemma":0.0008555538,"threshold_uncertainty_score":0.010843515},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7660704,0.0002775903,0.18087564,0.00067455636,0.00021770097,0.000076829594,0.00024920056,0.0004142828,0.05114386],"genre_scores_gemma":[0.98899055,0.00012184016,0.0072940406,0.00011039331,0.000086419204,0.000021868875,0.0001567562,0.0000630027,0.003155091],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9982399,0.0002113352,0.00013787799,0.000417583,0.00063913723,0.00035413526],"domain_scores_gemma":[0.99679923,0.00039343827,0.0006022243,0.0009006639,0.00073064625,0.00057371287],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019747259,0.00060151133,0.0011574968,0.0019360533,0.0020438023,0.004122163,0.0014912346,0.000948788,0.0038728332],"category_scores_gemma":[0.0042685647,0.0004807651,0.0014657052,0.0016291048,0.005923082,0.007897206,0.0063911327,0.0039615436,0.00037181002],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000041782278,0.000022535056,0.0010544697,0.00003952152,0.000022857863,0.000389108,0.0005604098,0.0011873306,0.0036133626,0.98995435,0.00017030163,0.0029439474],"study_design_scores_gemma":[0.00004688138,0.00015112352,0.0033266142,0.000058067,0.000047659407,0.0014109628,0.0008958034,0.008765343,0.007590653,0.9688034,0.008848922,0.00005457751],"about_ca_topic_score_codex":0.0006970197,"about_ca_topic_score_gemma":0.00040175725,"teacher_disagreement_score":0.004122163,"about_ca_system_score_codex":0.0019006305,"about_ca_system_score_gemma":0.0005768479,"threshold_uncertainty_score":0.013790071},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011985974,0.0012105312,0.82798964,0.0020322925,0.00047206564,0.00014704364,0.00030482988,0.012986945,0.14287071],"genre_scores_gemma":[0.15316914,0.0026265392,0.76807255,0.001003854,0.00059861,0.00041252928,0.00040842564,0.004355829,0.0693525],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9989736,0.00035689745,0.000049112496,0.00013522762,0.00040981622,0.00007541338],"domain_scores_gemma":[0.9964128,0.0026882393,0.00013068563,0.00032219637,0.00020690952,0.00023925045],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001627054,0.0006749144,0.000412842,0.0012795054,0.00064826105,0.0014752159,0.0010066326,0.0008278373,0.047759652],"category_scores_gemma":[0.007871954,0.00042789325,0.00057573663,0.0011290734,0.0013655494,0.0035715457,0.0029357753,0.0019207232,0.014025363],"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.00025366823,0.00021322387,0.0010273521,0.00061734923,0.000024294528,0.0006250531,0.0017427383,0.006726885,0.021078423,0.20834537,0.10303896,0.6563066],"study_design_scores_gemma":[0.00011632327,0.00027195684,0.00225166,0.00054213125,0.000036885136,0.0027105606,0.00043351596,0.03651621,0.04342573,0.22113301,0.69244987,0.0001121936],"about_ca_topic_score_codex":0.00047545283,"about_ca_topic_score_gemma":0.00092249387,"teacher_disagreement_score":0.047759652,"about_ca_system_score_codex":0.0006641656,"about_ca_system_score_gemma":0.00079090684,"threshold_uncertainty_score":0.15977198},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.025699964,0.00089763955,0.9166916,0.000906175,0.0005963185,0.00029937376,0.00039299694,0.00665104,0.047864925],"genre_scores_gemma":[0.16369678,0.0006189193,0.7750122,0.00069455104,0.00033395918,0.0004565863,0.0019047267,0.0017386504,0.055543683],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9978574,0.00028110246,0.00016484928,0.0005510696,0.00081652903,0.00032904852],"domain_scores_gemma":[0.9980715,0.000623252,0.000071270115,0.00068235985,0.00046013674,0.00009159883],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013821924,0.0021395762,0.0015885397,0.0041727186,0.0022275248,0.0042237206,0.0036478457,0.0020745934,0.032358855],"category_scores_gemma":[0.0057121026,0.0009399676,0.001748991,0.0057225116,0.0022083435,0.00937436,0.005497084,0.0026187745,0.011288505],"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.00053089426,0.00016036733,0.0011114153,0.00024552832,0.00006257441,0.00018131733,0.00041836847,0.00977785,0.008801869,0.15851526,0.025912762,0.7942819],"study_design_scores_gemma":[0.00026729508,0.0002544368,0.0016271126,0.0002162223,0.00016149822,0.0008415193,0.0005309917,0.15369081,0.029112192,0.70172685,0.111375906,0.00019505649],"about_ca_topic_score_codex":0.005802117,"about_ca_topic_score_gemma":0.007877545,"teacher_disagreement_score":0.032358855,"about_ca_system_score_codex":0.0022761563,"about_ca_system_score_gemma":0.0018811603,"threshold_uncertainty_score":0.108251154},"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":"software","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"software","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.016804473,0.0019058496,0.7348123,0.00088632264,0.0003664885,0.00031994793,0.04900874,0.14673267,0.04916325],"genre_scores_gemma":[0.21829814,0.003973434,0.54422665,0.00082200876,0.0007901088,0.0007976297,0.1773202,0.017308662,0.036463168],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983198,0.00021173038,0.0002367939,0.00028927697,0.00082753855,0.00011470344],"domain_scores_gemma":[0.99485356,0.0010574037,0.00030022865,0.0024856573,0.0007042786,0.0005989052],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017199961,0.0008746406,0.0019713626,0.004401358,0.0008755424,0.004954263,0.004667619,0.0011625799,0.03863502],"category_scores_gemma":[0.0063516805,0.0007823957,0.00085152825,0.006267235,0.00074329297,0.008090435,0.0052198633,0.0014150053,0.017306477],"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.0012945092,0.00029807846,0.0050987774,0.0010203801,0.00013258673,0.0011238181,0.0007015685,0.013887048,0.010489976,0.13790773,0.2891116,0.53893393],"study_design_scores_gemma":[0.00024103955,0.00014659607,0.0027602334,0.00011940861,0.000113268565,0.0016127437,0.00021180211,0.04826375,0.014745417,0.069870345,0.8617595,0.0001559067],"about_ca_topic_score_codex":0.001273884,"about_ca_topic_score_gemma":0.001276747,"teacher_disagreement_score":0.03863502,"about_ca_system_score_codex":0.00093407667,"about_ca_system_score_gemma":0.0013231762,"threshold_uncertainty_score":0.12924701},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05166064,0.002240904,0.84967124,0.0012189533,0.00080096733,0.00018345668,0.0006638385,0.0014252503,0.092134684],"genre_scores_gemma":[0.7000784,0.0023917458,0.20766489,0.0009963284,0.002190677,0.0004239224,0.0008400462,0.0014095485,0.08400431],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99854964,0.00030845494,0.00009345038,0.00045197236,0.00033412708,0.00026234012],"domain_scores_gemma":[0.9977691,0.00063582236,0.00031717436,0.0004414993,0.00050432247,0.00033204388],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014314912,0.0018563052,0.0010561872,0.0030811615,0.0015210551,0.003488246,0.0016205874,0.001409432,0.017938804],"category_scores_gemma":[0.008437166,0.00063401426,0.0011064648,0.002464111,0.002915801,0.0075069135,0.002238035,0.0025524464,0.005347071],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000031977437,0.000013428196,0.00011449005,0.00003570428,0.000004418624,0.000053140757,0.00021351651,0.00068635563,0.000627262,0.98178047,0.0027488952,0.013690337],"study_design_scores_gemma":[0.000012526469,0.00002323161,0.00009025132,0.000021633849,0.000012209144,0.00019109975,0.00009018283,0.010724783,0.00066111726,0.9761475,0.011992815,0.000032713495],"about_ca_topic_score_codex":0.0010401767,"about_ca_topic_score_gemma":0.0009820393,"teacher_disagreement_score":0.017938804,"about_ca_system_score_codex":0.0010913927,"about_ca_system_score_gemma":0.00076177355,"threshold_uncertainty_score":0.060011268},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01796551,0.0012701177,0.93732375,0.001206495,0.00012596755,0.000070473354,0.00017636368,0.0001630889,0.041698217],"genre_scores_gemma":[0.3324893,0.002528551,0.6105717,0.0007455663,0.00047869203,0.00049965596,0.0005643873,0.00036416602,0.051758062],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99961805,0.00013125064,0.000018447143,0.00007326952,0.00011386028,0.000045074183],"domain_scores_gemma":[0.9996673,0.00011356072,0.00004516858,0.000059263344,0.00007259546,0.00004214007],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00088462245,0.0007192197,0.0006099049,0.0009013085,0.00083428697,0.0015676998,0.0011269882,0.001257683,0.012843897],"category_scores_gemma":[0.0017190606,0.00042348047,0.00077202934,0.00061426027,0.0014502718,0.002571186,0.0014377909,0.0019247092,0.0018392666],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000016149128,0.000007480379,0.00006421441,0.00005401458,0.000006418401,0.000035761605,0.00009147997,0.009862341,0.0012116804,0.97245276,0.0016166188,0.014581156],"study_design_scores_gemma":[0.0000128425545,0.000034707686,0.00015702685,0.00002333484,0.0000048571937,0.00008893908,0.000051437826,0.091064475,0.00067446916,0.89435565,0.013517663,0.000014641251],"about_ca_topic_score_codex":0.00038449364,"about_ca_topic_score_gemma":0.0004949916,"teacher_disagreement_score":0.012843897,"about_ca_system_score_codex":0.00043505,"about_ca_system_score_gemma":0.0006306076,"threshold_uncertainty_score":0.04296714},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.22097628,0.0052428064,0.54369867,0.0073675094,0.0011045297,0.00010840739,0.0008088799,0.0012114617,0.2194815],"genre_scores_gemma":[0.89590526,0.0013528995,0.07151998,0.0011741715,0.0010086914,0.00010387944,0.00038144382,0.00025724288,0.028296396],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9982474,0.00064296025,0.00010920211,0.00029659056,0.00046552593,0.00023835927],"domain_scores_gemma":[0.99821883,0.0007834088,0.00017115098,0.0002460248,0.00041222235,0.00016841317],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001751883,0.0003216162,0.0010460733,0.0010966731,0.0030472279,0.0042084903,0.0007292812,0.00076432043,0.009446145],"category_scores_gemma":[0.0029284814,0.0004910661,0.0007410379,0.0012306003,0.0036364843,0.0061163283,0.0022144585,0.0021175425,0.0027234086],"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.000026074027,0.0000087733,0.000091329435,0.000019477247,0.0000066161465,0.000041535972,0.00012944976,0.00025280315,0.00037873953,0.9953241,0.0010801902,0.0026409563],"study_design_scores_gemma":[0.000015523081,0.000013152411,0.000121120574,0.0000048906977,0.000010252618,0.00011585216,0.00005028452,0.0021987192,0.00066366047,0.99017674,0.006617834,0.0000121300045],"about_ca_topic_score_codex":0.0007538537,"about_ca_topic_score_gemma":0.00093590864,"teacher_disagreement_score":0.009446145,"about_ca_system_score_codex":0.0013156716,"about_ca_system_score_gemma":0.00096419983,"threshold_uncertainty_score":0.031600475},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011225311,0.00010671648,0.9840518,0.00016924377,0.000034569064,0.00007014487,0.000047457277,0.0011284074,0.0031661943],"genre_scores_gemma":[0.11226524,0.00012682877,0.88365823,0.00007168991,0.00008096793,0.00015003217,0.00026146142,0.00018921995,0.0031964125],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99914825,0.00018638899,0.00007291667,0.00015623693,0.00028312553,0.00015312624],"domain_scores_gemma":[0.99833304,0.0006569602,0.00012915605,0.00046742905,0.000329412,0.00008401083],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012558678,0.0007166383,0.00079964916,0.0009616439,0.00079124194,0.001161015,0.0013649064,0.00079674355,0.007913317],"category_scores_gemma":[0.0056218193,0.0004001357,0.00074359553,0.0012688949,0.0009171243,0.0023982397,0.0022650536,0.0013625077,0.0026553255],"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.00043188938,0.00017516034,0.0021254062,0.00020701971,0.000052438165,0.00024729944,0.0003693365,0.09055454,0.007443721,0.2788084,0.012338683,0.6072461],"study_design_scores_gemma":[0.00019253431,0.00009242965,0.00032682763,0.00003273556,0.000027981041,0.00027428576,0.00009945413,0.76429754,0.007862951,0.21383654,0.012921348,0.000035341276],"about_ca_topic_score_codex":0.0014851375,"about_ca_topic_score_gemma":0.0027477515,"teacher_disagreement_score":0.007913317,"about_ca_system_score_codex":0.00085947535,"about_ca_system_score_gemma":0.0015778036,"threshold_uncertainty_score":0.026472688},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.16452537,0.00024272074,0.822365,0.00022610214,0.00006020338,0.00007240089,0.00086990144,0.0037077141,0.007930546],"genre_scores_gemma":[0.61312115,0.00029215548,0.37626418,0.00012335088,0.000093012495,0.0001380142,0.0029487135,0.0005458396,0.0064734844],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993856,0.00011542503,0.000037385034,0.00011920605,0.00019492664,0.00014747496],"domain_scores_gemma":[0.9987257,0.0004291794,0.00010700281,0.0002922521,0.00035149237,0.00009431228],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00041770205,0.00053488376,0.00054913654,0.00080169854,0.000534554,0.0015969214,0.0006481508,0.00039632537,0.005027777],"category_scores_gemma":[0.003045341,0.0003732643,0.00046937456,0.000981105,0.0005733073,0.0018835873,0.0014164932,0.0007086195,0.0022510984],"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.00087584706,0.00018672888,0.006905528,0.00039710553,0.00008628584,0.00029326446,0.0005110357,0.10994786,0.063251704,0.30565736,0.02392553,0.48796168],"study_design_scores_gemma":[0.00008911977,0.00021404654,0.0012530689,0.00005876066,0.000027516202,0.0002837847,0.00025832286,0.601359,0.07315518,0.30743387,0.015813936,0.00005345063],"about_ca_topic_score_codex":0.0011046396,"about_ca_topic_score_gemma":0.0021038745,"teacher_disagreement_score":0.005027777,"about_ca_system_score_codex":0.00048269622,"about_ca_system_score_gemma":0.0010503703,"threshold_uncertainty_score":0.016819596},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.013305167,0.0003657567,0.9665884,0.00017236591,0.000107506436,0.00007195154,0.00013277982,0.00043013156,0.018825982],"genre_scores_gemma":[0.37849784,0.0010045449,0.6013038,0.00022855282,0.0002922414,0.00036845208,0.00054385,0.0009150172,0.016845636],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99923754,0.00031388065,0.000041867956,0.00009920628,0.00023242005,0.00007515447],"domain_scores_gemma":[0.99914145,0.00037825186,0.000055491015,0.00018831792,0.00018869688,0.00004781868],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017339621,0.00090506097,0.0009456934,0.0030154597,0.0010617857,0.001972165,0.0017316872,0.0007726932,0.0077262544],"category_scores_gemma":[0.0031860934,0.0003451933,0.0012162114,0.0017361019,0.0016115576,0.0029227675,0.0013716853,0.0019045243,0.0025425088],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000007292077,0.000012044626,0.0000727629,0.00003874675,0.000006093398,0.000027962082,0.000077660894,0.004297188,0.0006017456,0.9783845,0.0007945914,0.015679346],"study_design_scores_gemma":[0.000006421713,0.000018862875,0.0000482094,0.000021189988,0.000007729756,0.00007334655,0.0000258646,0.075771436,0.0020201518,0.9147788,0.0072118305,0.000016125074],"about_ca_topic_score_codex":0.00044575075,"about_ca_topic_score_gemma":0.0004040801,"teacher_disagreement_score":0.0077262544,"about_ca_system_score_codex":0.0010721147,"about_ca_system_score_gemma":0.0007958899,"threshold_uncertainty_score":0.025846899},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.74630684,0.00086250826,0.21451367,0.00047754176,0.00009267984,0.000046388708,0.00033422367,0.0005007046,0.036865406],"genre_scores_gemma":[0.9820879,0.0002900573,0.011229322,0.00004268328,0.000044244087,0.000019142304,0.00015796123,0.00006583647,0.0060627703],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99947244,0.000102349615,0.000024608595,0.00011492396,0.00011136496,0.00017424556],"domain_scores_gemma":[0.99887544,0.00044202,0.00015802248,0.000173429,0.0001933652,0.00015773189],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00052704493,0.0004049941,0.0004874325,0.0010733508,0.0007138161,0.0012905685,0.0004927151,0.00025434184,0.004126872],"category_scores_gemma":[0.0031283263,0.00026487524,0.00029082276,0.0011160435,0.001973131,0.0023033821,0.0018938612,0.00084110367,0.000622777],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00016486303,0.000019727917,0.0023296024,0.00011841153,0.000009833897,0.0003020799,0.0005073099,0.012942753,0.005117184,0.9554518,0.0015668784,0.021469666],"study_design_scores_gemma":[0.00005958633,0.0002067664,0.002755378,0.0000764179,0.000035211833,0.0011435649,0.00076080055,0.08526787,0.0077896016,0.87930644,0.022550749,0.00004751855],"about_ca_topic_score_codex":0.0015233989,"about_ca_topic_score_gemma":0.001027383,"teacher_disagreement_score":0.004126872,"about_ca_system_score_codex":0.0008516013,"about_ca_system_score_gemma":0.0003711131,"threshold_uncertainty_score":0.013805807},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.047048446,0.0013381802,0.8642316,0.0027973407,0.00043961598,0.00022036325,0.00030791416,0.0012351808,0.08238136],"genre_scores_gemma":[0.60265017,0.0021277785,0.34821936,0.0009648085,0.0004925674,0.00023838044,0.0011715316,0.0007625934,0.04337289],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9980259,0.000617507,0.00008941843,0.0003398101,0.00063125486,0.00029609833],"domain_scores_gemma":[0.9961397,0.002599227,0.00011771896,0.0007269985,0.00029407116,0.0001223143],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018797052,0.0014209679,0.0013007983,0.0011300531,0.0016209949,0.0021732976,0.0020596206,0.001340344,0.019847171],"category_scores_gemma":[0.011155527,0.00070178503,0.001473847,0.0022984268,0.0027260196,0.0073969867,0.0060419696,0.004721528,0.0020290455],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00018612233,0.00009867814,0.00071763224,0.00041923838,0.00006004301,0.000075834774,0.0006272834,0.05071753,0.0021994188,0.7437035,0.010597979,0.19059676],"study_design_scores_gemma":[0.000038238286,0.000043107088,0.0001886926,0.000042604388,0.000035849982,0.000060936487,0.00016082362,0.10318854,0.0014982858,0.87996864,0.01475876,0.000015553547],"about_ca_topic_score_codex":0.0026762777,"about_ca_topic_score_gemma":0.003920231,"teacher_disagreement_score":0.019847171,"about_ca_system_score_codex":0.0014126342,"about_ca_system_score_gemma":0.0012356262,"threshold_uncertainty_score":0.06639546},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8524874,0.0003987847,0.08692396,0.0016480333,0.00050998776,0.000087813416,0.00039403894,0.0006101351,0.0569399],"genre_scores_gemma":[0.96454996,0.00028519856,0.013181275,0.000322273,0.00030887383,0.000059450318,0.00032521348,0.00029777506,0.020669993],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990683,0.0001272501,0.00004240386,0.00020656858,0.00026626955,0.00028923718],"domain_scores_gemma":[0.99372804,0.0023661165,0.0007780131,0.00092940446,0.0006774238,0.0015209031],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013116815,0.0004547726,0.0009600167,0.0031762333,0.003225724,0.0035297796,0.0011079373,0.0013516054,0.009001744],"category_scores_gemma":[0.0061493567,0.00047137897,0.0009192344,0.0013442233,0.0051336433,0.006370506,0.0019612405,0.0029396873,0.0007601311],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001118529,0.000037964324,0.00047316763,0.00002131121,0.00000414607,0.00009783731,0.0003665089,0.00065713,0.001226374,0.993032,0.000769013,0.0032027147],"study_design_scores_gemma":[0.000022295077,0.000022713375,0.00034130146,0.0000072171215,0.000005770422,0.00009239739,0.00012269463,0.0030592852,0.0007008526,0.9940078,0.0016020981,0.000015477555],"about_ca_topic_score_codex":0.0020255542,"about_ca_topic_score_gemma":0.0024586057,"teacher_disagreement_score":0.009001744,"about_ca_system_score_codex":0.0021127427,"about_ca_system_score_gemma":0.0008465233,"threshold_uncertainty_score":0.030113816},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010933653,0.004678291,0.95461446,0.0076868935,0.0016264473,0.00002941747,0.00016431988,0.0004784004,0.019788068],"genre_scores_gemma":[0.6370932,0.007219279,0.31507742,0.0066342507,0.012326335,0.00030197168,0.00044666842,0.0022572665,0.01864357],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99065644,0.004394919,0.0004941396,0.0015648678,0.0022258468,0.00066377816],"domain_scores_gemma":[0.91733325,0.068562545,0.0015119304,0.008350104,0.002928809,0.001313293],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0148126045,0.0017483549,0.0032241773,0.0018768832,0.0022426685,0.004186548,0.00417451,0.0033276316,0.0040204767],"category_scores_gemma":[0.07299543,0.0010949293,0.0032962896,0.0021640046,0.009700149,0.01013897,0.0060476195,0.013616717,0.0007320909],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008493338,0.00002857327,0.00044107108,0.00010934374,0.00008191623,0.00009943477,0.00013277969,0.013660599,0.0010479254,0.9665726,0.004559479,0.013181356],"study_design_scores_gemma":[0.000016897126,0.000036441277,0.0003740617,0.000044735945,0.00004541544,0.00007167611,0.000019769348,0.14678808,0.0009760784,0.8474307,0.0041523413,0.000043701144],"about_ca_topic_score_codex":0.003129864,"about_ca_topic_score_gemma":0.0026192602,"teacher_disagreement_score":0.0148126045,"about_ca_system_score_codex":0.0028114761,"about_ca_system_score_gemma":0.0021361276,"threshold_uncertainty_score":0.07833749},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.035172097,0.00037281448,0.94547683,0.00038696337,0.000120531084,0.0002740418,0.0004241891,0.002980075,0.014792403],"genre_scores_gemma":[0.16776806,0.00021249811,0.82308686,0.00015805125,0.000042204254,0.00032914898,0.0011688279,0.0007641227,0.0064702914],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992631,0.00015739244,0.000063875406,0.00020269657,0.00019891164,0.000113969094],"domain_scores_gemma":[0.99908924,0.00041913817,0.000052642466,0.00019572728,0.0001740046,0.00006928088],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00081282656,0.0016276955,0.0014921715,0.0016464454,0.0014051247,0.0021283582,0.0017437504,0.0012516875,0.0138532035],"category_scores_gemma":[0.002724336,0.00088471384,0.0014143202,0.001445775,0.0010685007,0.003346159,0.004140402,0.0024679957,0.00592721],"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.0007133814,0.00029169105,0.0013283478,0.00078410126,0.00013024869,0.00026572807,0.0006669289,0.0074840845,0.020982139,0.36391267,0.022617621,0.58082306],"study_design_scores_gemma":[0.0004608831,0.00041640975,0.0008836896,0.00015554592,0.00022617339,0.0007519217,0.0005316323,0.059136875,0.03992077,0.8484805,0.04888821,0.00014735894],"about_ca_topic_score_codex":0.000558088,"about_ca_topic_score_gemma":0.0010371207,"teacher_disagreement_score":0.0138532035,"about_ca_system_score_codex":0.00093260134,"about_ca_system_score_gemma":0.0010033916,"threshold_uncertainty_score":0.046343565},"labels":[],"label_agreement":null},{"id":"W1982363352","doi":"10.1090/s0025-5718-05-01790-4","title":"Gröbner bases and generalized Padé approximation","year":2005,"lang":"en","type":"article","venue":"Mathematics of Computation","topic":"Polynomial and algebraic computation","field":"Computer Science","cited_by":14,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"Office of Naval Research; Multidisciplinary University Research Initiative; Mitacs; National Security Agency; National Science Foundation","keywords":"Mathematics; Basis (linear algebra); Multivariate statistics; Applied mathematics; Degree (music); Standard basis; Algebra over a field; Pure mathematics; Geometry; Statistics","score_opus":0.01683051534729296,"score_gpt":0.24697828104676153,"score_spread":0.23014776569946857,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1982363352","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008212271,0.0022099244,0.9629669,0.00054283335,0.00017659804,0.000033235407,0.00011076219,0.00040853492,0.02533898],"genre_scores_gemma":[0.4075728,0.0053046164,0.55890393,0.000704661,0.00063852046,0.00022415908,0.0005534293,0.0003333288,0.025764465],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99898905,0.00030498297,0.000030746658,0.00013855335,0.00039171998,0.00014499218],"domain_scores_gemma":[0.9995468,0.0001908579,0.000041290874,0.00013198143,0.000065304404,0.000023665089],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009583073,0.0009651566,0.0012783691,0.0014533721,0.0006751624,0.0018174059,0.0012292812,0.001068032,0.0071183075],"category_scores_gemma":[0.0040998454,0.00037796874,0.000858604,0.0026226093,0.0019911248,0.0025539135,0.0019149722,0.0029758231,0.0024476722],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002709406,0.000023630575,0.00007743579,0.00006613846,0.000014770764,0.00005419962,0.000037252164,0.053371202,0.0007613652,0.9020389,0.0024386237,0.041089382],"study_design_scores_gemma":[0.00001112332,0.000021956625,0.00010146505,0.00003403129,0.000007157974,0.00012683905,0.000020305493,0.20534323,0.0009551073,0.78436637,0.008991873,0.000020487365],"about_ca_topic_score_codex":0.0012432341,"about_ca_topic_score_gemma":0.0010826797,"teacher_disagreement_score":0.0071183075,"about_ca_system_score_codex":0.0007130648,"about_ca_system_score_gemma":0.00059847796,"threshold_uncertainty_score":0.023813128},"labels":[],"label_agreement":null},{"id":"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.70605206,0.00096123794,0.23235577,0.0012840565,0.00015409228,0.000036407575,0.0002873499,0.00019749004,0.05867158],"genre_scores_gemma":[0.97337455,0.00051567523,0.0143253105,0.000088049164,0.00031013822,0.000028506292,0.00013967406,0.00007444339,0.011143628],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99923694,0.00016289497,0.000023514445,0.00012628586,0.00031290913,0.00013754386],"domain_scores_gemma":[0.9982357,0.0006302187,0.00033962782,0.00018316376,0.00035664113,0.00025460005],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008123546,0.0005197337,0.0004990867,0.0013278219,0.0010149727,0.0016867315,0.00043628673,0.0004933658,0.005231958],"category_scores_gemma":[0.0036397218,0.00029986125,0.00049720996,0.00082239305,0.0038645237,0.0036762203,0.001652609,0.0012651044,0.0006003129],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000037695747,0.000008491227,0.00033702955,0.000035991117,0.0000046815526,0.00009093798,0.00017725572,0.0017401496,0.0013847569,0.990289,0.00049907353,0.0053950036],"study_design_scores_gemma":[0.000008410335,0.00003753306,0.00067059684,0.00001670121,0.0000066872944,0.00020252347,0.00009048362,0.011710634,0.0008816897,0.9841033,0.0022551126,0.00001627962],"about_ca_topic_score_codex":0.0008502043,"about_ca_topic_score_gemma":0.0007980475,"teacher_disagreement_score":0.005231958,"about_ca_system_score_codex":0.0008072743,"about_ca_system_score_gemma":0.0004137249,"threshold_uncertainty_score":0.017502606},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.26291797,0.000077833516,0.7307573,0.000278339,0.000040571224,0.000044056153,0.00023299638,0.0011747575,0.004476148],"genre_scores_gemma":[0.78399974,0.0000960418,0.21038873,0.00006776002,0.000048517057,0.00003741346,0.00059925515,0.00016055391,0.0046019764],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995204,0.00008655655,0.00002731158,0.000087847795,0.00015976629,0.00011812546],"domain_scores_gemma":[0.99912685,0.00027003753,0.000083865096,0.00027320112,0.00015948359,0.000086627486],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00050598726,0.00047729394,0.00051641103,0.0005987116,0.0004272303,0.0009350931,0.00050713815,0.00035768893,0.0044678645],"category_scores_gemma":[0.0025522376,0.00024470597,0.00046421593,0.00048771786,0.0008305206,0.002405765,0.0013634436,0.0009123547,0.0015304871],"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.0016076089,0.00022698373,0.004893158,0.00031580147,0.00004737833,0.00040288983,0.00077259407,0.051020764,0.080071144,0.39338818,0.007144233,0.4601092],"study_design_scores_gemma":[0.00012998148,0.0005626393,0.0017737913,0.000044825232,0.000027463455,0.00050284265,0.00039773804,0.37774456,0.1124676,0.49831405,0.007933204,0.00010129797],"about_ca_topic_score_codex":0.00065571634,"about_ca_topic_score_gemma":0.00082477526,"teacher_disagreement_score":0.0044678645,"about_ca_system_score_codex":0.00028212066,"about_ca_system_score_gemma":0.0006463687,"threshold_uncertainty_score":0.01494652},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.026707213,0.005403428,0.857419,0.00940668,0.0013404666,0.00021735179,0.00062300044,0.0021097632,0.09677309],"genre_scores_gemma":[0.38573495,0.00405501,0.54922116,0.0036879147,0.0017089596,0.0009045126,0.0017059064,0.0017827079,0.051198993],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9914267,0.0022353663,0.00037932224,0.0015369095,0.0031231302,0.0012986022],"domain_scores_gemma":[0.98322415,0.009911832,0.0005496251,0.0036544914,0.0018426863,0.00081730506],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.007490114,0.0024492422,0.0027312343,0.0035125497,0.003314309,0.00741341,0.006922249,0.005600803,0.0238584],"category_scores_gemma":[0.030095784,0.001197092,0.002519536,0.004423776,0.004894931,0.01466626,0.0076380735,0.011102332,0.010940201],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005476893,0.00021893233,0.00040750916,0.00025201528,0.00009534874,0.00007562001,0.00021263507,0.023658823,0.0034725696,0.89070654,0.015448817,0.06490356],"study_design_scores_gemma":[0.00009064169,0.00010193696,0.00025144295,0.00012843723,0.00007593402,0.00012231432,0.000044522683,0.1201083,0.003640817,0.8609197,0.014451188,0.000064744054],"about_ca_topic_score_codex":0.0018388543,"about_ca_topic_score_gemma":0.0024907945,"teacher_disagreement_score":0.0238584,"about_ca_system_score_codex":0.0052782837,"about_ca_system_score_gemma":0.005169587,"threshold_uncertainty_score":0.079814315},"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.36038065,0.007103416,0.21188352,0.0043721143,0.0009736212,0.00007557366,0.00040502177,0.00051803916,0.41428813],"genre_scores_gemma":[0.939851,0.003367207,0.017030735,0.0006145854,0.0010503593,0.00007139473,0.00037687688,0.00030427187,0.03733363],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993728,0.00017713296,0.000032777083,0.00012985985,0.00016412332,0.00012331991],"domain_scores_gemma":[0.99714154,0.001498081,0.0002468624,0.0003446291,0.0004515884,0.00031726915],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018397524,0.0013536131,0.0010044561,0.004331438,0.0018274297,0.0040311776,0.0014372481,0.0009625408,0.012163574],"category_scores_gemma":[0.0082810735,0.00042657412,0.0011156821,0.0024402728,0.005251513,0.0074286894,0.002423505,0.0043654256,0.0030522223],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004587666,0.000022355322,0.0001400893,0.000044012035,0.0000071503914,0.00008607167,0.00033688106,0.0007291059,0.00064676785,0.9846293,0.0014244078,0.011888153],"study_design_scores_gemma":[0.0000114171635,0.000028362965,0.00020621032,0.000024942205,0.00000886828,0.00014778339,0.00009403517,0.0037590847,0.00093708094,0.9918909,0.0028694891,0.000021703938],"about_ca_topic_score_codex":0.0013984604,"about_ca_topic_score_gemma":0.00074359693,"teacher_disagreement_score":0.012163574,"about_ca_system_score_codex":0.0015507755,"about_ca_system_score_gemma":0.0006853101,"threshold_uncertainty_score":0.040691257},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.257883,0.0043020407,0.4560899,0.004376935,0.00063237466,0.00014844982,0.00019908953,0.00056455116,0.27580363],"genre_scores_gemma":[0.8990526,0.0023953374,0.065696985,0.00036609572,0.0009816327,0.00013229427,0.00019321163,0.00013112999,0.03105074],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991124,0.00020921341,0.000044007436,0.00017692443,0.00032115245,0.0001363861],"domain_scores_gemma":[0.9981,0.0011839268,0.00013868917,0.00026236282,0.00016780719,0.00014720716],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009929413,0.0007310222,0.0010180217,0.0013284689,0.0016928344,0.002564864,0.0011645189,0.000778267,0.010935703],"category_scores_gemma":[0.004085475,0.0004524405,0.000892488,0.002514106,0.0038517378,0.0069152643,0.0033079563,0.0029575736,0.0013485446],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000016875574,0.000014079325,0.00006169922,0.00002919305,0.0000026429504,0.000019341413,0.00008637176,0.0010697107,0.00029017587,0.9895795,0.000703202,0.008127328],"study_design_scores_gemma":[0.0000060714556,0.0000057493144,0.00003691165,0.0000066658945,0.0000039614033,0.000036255235,0.000026293894,0.0036010733,0.0004431073,0.99363387,0.002195807,0.000004153555],"about_ca_topic_score_codex":0.00062135817,"about_ca_topic_score_gemma":0.00067040604,"teacher_disagreement_score":0.010935703,"about_ca_system_score_codex":0.0016421754,"about_ca_system_score_gemma":0.0006758622,"threshold_uncertainty_score":0.036583543},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.55911905,0.0040000235,0.28673172,0.023668919,0.0007127692,0.0002550562,0.002998765,0.0011718663,0.12134174],"genre_scores_gemma":[0.93793947,0.0014315969,0.041865595,0.00094035437,0.00094471575,0.00019168918,0.0018437302,0.0003732865,0.01446957],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9965101,0.0011079378,0.00015985181,0.0006026232,0.0009772892,0.0006421088],"domain_scores_gemma":[0.9765595,0.01899292,0.0011505173,0.0017624263,0.0008745615,0.0006601691],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0023372977,0.0011035784,0.0023692395,0.0014817549,0.002057161,0.006614951,0.0028880374,0.0024492014,0.019127954],"category_scores_gemma":[0.020739162,0.0006432137,0.0014572074,0.0028325324,0.003648761,0.015767429,0.0037705242,0.0046120477,0.0016540777],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00089119707,0.0002579833,0.0024476976,0.00051577546,0.000111576715,0.0003143153,0.0005644181,0.08145178,0.0017117023,0.847187,0.019555971,0.044990662],"study_design_scores_gemma":[0.000066573375,0.000023531346,0.00029573878,0.000019410945,0.000019449339,0.000077423945,0.00008826877,0.0740661,0.00031164175,0.9237812,0.0012313493,0.000019205927],"about_ca_topic_score_codex":0.0034330396,"about_ca_topic_score_gemma":0.0046484713,"teacher_disagreement_score":0.019127954,"about_ca_system_score_codex":0.0027175636,"about_ca_system_score_gemma":0.0025666885,"threshold_uncertainty_score":0.0639894},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.052775808,0.02230082,0.45225865,0.02998353,0.00442383,0.00012320622,0.003969811,0.0027450877,0.43141928],"genre_scores_gemma":[0.68554497,0.0111309625,0.07544407,0.0025193417,0.0061077564,0.00029449296,0.0061142687,0.0013014884,0.21154265],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.998569,0.00050061994,0.00012842694,0.0002248008,0.00046784867,0.000109333385],"domain_scores_gemma":[0.99603397,0.0018655715,0.0002260752,0.0007924577,0.000821239,0.00026076072],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0022445857,0.0010360329,0.0015636955,0.0046406714,0.0038868163,0.009099012,0.0017155429,0.0014107212,0.025845183],"category_scores_gemma":[0.0064453166,0.001273816,0.0011491807,0.0056686043,0.0045469166,0.014326346,0.0035255486,0.0068901405,0.005757047],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000017085755,0.00001171134,0.00008461286,0.000040198407,0.000005743258,0.000011664103,0.00011974733,0.00013748046,0.000101854996,0.9870272,0.006375492,0.006067123],"study_design_scores_gemma":[0.00000712915,0.000004637054,0.00007931377,0.00002158104,0.000009830601,0.000023522909,0.00004756519,0.0007175287,0.00019879936,0.9827291,0.016155047,0.000005835013],"about_ca_topic_score_codex":0.0013787656,"about_ca_topic_score_gemma":0.0014307486,"teacher_disagreement_score":0.025845183,"about_ca_system_score_codex":0.0027228077,"about_ca_system_score_gemma":0.0013550834,"threshold_uncertainty_score":0.08646071},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.28515923,0.0038417699,0.5864887,0.005863846,0.00047937498,0.00007648669,0.0005690151,0.0010963609,0.11642518],"genre_scores_gemma":[0.9456314,0.0010617027,0.037965734,0.00023316307,0.00052527175,0.000052835578,0.00031187668,0.0002638249,0.013954203],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9970253,0.0007274964,0.00008502281,0.0004858628,0.0010997708,0.0005765968],"domain_scores_gemma":[0.981861,0.014014558,0.00094462687,0.0012788214,0.0009932627,0.0009077598],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0024277337,0.0009395504,0.0017219401,0.0025875533,0.0016423019,0.004578332,0.0028346071,0.0013286765,0.009493467],"category_scores_gemma":[0.026638063,0.00076226704,0.0006709743,0.0018040953,0.005339681,0.012672704,0.005063694,0.0057210713,0.0015284618],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000886679,0.00003413621,0.000805492,0.00007968783,0.000010478199,0.00007516425,0.0002452948,0.00986741,0.0010594528,0.9744834,0.0024568941,0.010793883],"study_design_scores_gemma":[0.000008165054,0.000009166674,0.00016410697,0.000018157925,0.0000073403426,0.000056072844,0.000055140532,0.03789509,0.00084392575,0.9592555,0.0016773043,0.000010013674],"about_ca_topic_score_codex":0.0011728901,"about_ca_topic_score_gemma":0.0013998642,"teacher_disagreement_score":0.009493467,"about_ca_system_score_codex":0.0022661681,"about_ca_system_score_gemma":0.0011156969,"threshold_uncertainty_score":0.031758845},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.015150667,0.0003471715,0.9693996,0.00040170123,0.00020724883,0.000113163944,0.00013195716,0.0024080924,0.011840348],"genre_scores_gemma":[0.41746494,0.00032761184,0.56117374,0.00037983636,0.00034292426,0.00038504676,0.000616724,0.0016254078,0.01768377],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9961605,0.001086007,0.00024963488,0.0007455817,0.0013369968,0.00042121415],"domain_scores_gemma":[0.98940825,0.005149635,0.00039619787,0.0036834893,0.0010908569,0.00027157587],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0028320893,0.0013203167,0.0013778447,0.0017828004,0.0014679339,0.0025966996,0.0035489814,0.0011729001,0.017976325],"category_scores_gemma":[0.013477548,0.00085808185,0.00168952,0.0017914352,0.0026526847,0.0065472126,0.004754006,0.0031893402,0.0027858552],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0008476485,0.0003187938,0.0017750106,0.00034596192,0.00014847264,0.00017523371,0.00038013808,0.06796348,0.006784383,0.48656663,0.011957567,0.4227367],"study_design_scores_gemma":[0.0001060015,0.000066010114,0.00022355227,0.000029848585,0.000051415547,0.000083286715,0.00006751392,0.2869491,0.0054472014,0.7008592,0.0060901768,0.000026694137],"about_ca_topic_score_codex":0.0021318132,"about_ca_topic_score_gemma":0.0041929693,"teacher_disagreement_score":0.017976325,"about_ca_system_score_codex":0.0014610564,"about_ca_system_score_gemma":0.0020356684,"threshold_uncertainty_score":0.060136735},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4448121,0.005417873,0.43399116,0.0038276194,0.0010405947,0.00007921907,0.0003651814,0.00073697715,0.10972926],"genre_scores_gemma":[0.94658077,0.0027793983,0.015385745,0.00040566703,0.0010078879,0.00007428089,0.00020212407,0.00022380587,0.033340313],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995085,0.00014076922,0.000029551325,0.000066145294,0.00015794947,0.00009709506],"domain_scores_gemma":[0.99768186,0.001180995,0.00031531366,0.00022779974,0.00034553598,0.00024852468],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012641287,0.00076235307,0.0005635566,0.0029210213,0.0011947869,0.0037860293,0.0005756179,0.0007420007,0.0068779225],"category_scores_gemma":[0.010677063,0.00035919587,0.0006713402,0.0014749587,0.00278407,0.005184177,0.001468463,0.0022297495,0.0014774596],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000028611412,0.0000066954062,0.00019726086,0.00002357372,0.0000033648835,0.00011979273,0.00018231315,0.0013953329,0.00096660876,0.99050903,0.00068726554,0.0058800383],"study_design_scores_gemma":[0.000007674627,0.000010639102,0.00011174139,0.000026975891,0.0000039711576,0.00010716375,0.000051124065,0.0073963273,0.0006799538,0.9883619,0.0032314532,0.0000110552155],"about_ca_topic_score_codex":0.0008853096,"about_ca_topic_score_gemma":0.000643788,"teacher_disagreement_score":0.0068779225,"about_ca_system_score_codex":0.0017438857,"about_ca_system_score_gemma":0.000752656,"threshold_uncertainty_score":0.023008943},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.31366736,0.0010865323,0.62258524,0.0019531506,0.00021006398,0.0002530308,0.0007791378,0.003940687,0.05552469],"genre_scores_gemma":[0.90825987,0.0002856782,0.08306767,0.0002466383,0.0000976128,0.000074790536,0.0006421094,0.00023103772,0.0070946324],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9978992,0.0004579496,0.00016592431,0.0005384165,0.000575449,0.0003631531],"domain_scores_gemma":[0.99567044,0.0015649563,0.00035355942,0.0015889303,0.0005929742,0.0002291443],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018213011,0.00069741637,0.0008855581,0.00075027393,0.00087760034,0.0020146787,0.0009834404,0.0007891144,0.007348942],"category_scores_gemma":[0.012599332,0.00035044912,0.00069631956,0.0007218001,0.0021623024,0.0032462599,0.0030816086,0.0009832742,0.0020724542],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0025420717,0.00015197763,0.007826399,0.0004172519,0.00007585613,0.00078165194,0.0009370011,0.028605673,0.025991488,0.5731506,0.012692233,0.34682778],"study_design_scores_gemma":[0.0003309867,0.0003721405,0.0017237059,0.00014173436,0.000117420816,0.001481759,0.00034930685,0.23782872,0.08020776,0.65180504,0.025537862,0.00010363102],"about_ca_topic_score_codex":0.00066004536,"about_ca_topic_score_gemma":0.00045277353,"teacher_disagreement_score":0.007348942,"about_ca_system_score_codex":0.001075905,"about_ca_system_score_gemma":0.0013201307,"threshold_uncertainty_score":0.02458471},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.16387267,0.0025461186,0.65652525,0.002632684,0.0016390511,0.00015063953,0.00033678563,0.0012182496,0.1710785],"genre_scores_gemma":[0.84260195,0.001116528,0.09189754,0.000609526,0.0008403969,0.0001301634,0.00020189308,0.00072156655,0.06188047],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99847823,0.00043282576,0.00008526836,0.00018567237,0.0005927222,0.00022523828],"domain_scores_gemma":[0.998669,0.00037659294,0.00009446842,0.00033086495,0.00035510477,0.00017390621],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019226071,0.0011183455,0.0017947372,0.0031704216,0.0020148598,0.0035397424,0.0018603835,0.0010631649,0.013926371],"category_scores_gemma":[0.004201799,0.0005336514,0.0011675929,0.0024215956,0.003495831,0.0071978485,0.003713445,0.0030363337,0.0022920826],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000026250053,0.000020365647,0.00008612291,0.000046137284,0.0000111092495,0.00004254348,0.0000910627,0.0018925037,0.0004411855,0.9884114,0.001184333,0.007746939],"study_design_scores_gemma":[0.00000778639,0.000011355752,0.000077901444,0.00001344353,0.0000072267712,0.00004147962,0.000032263935,0.013046573,0.00076364324,0.9830928,0.002891893,0.00001361399],"about_ca_topic_score_codex":0.0010166159,"about_ca_topic_score_gemma":0.0014951421,"teacher_disagreement_score":0.013926371,"about_ca_system_score_codex":0.0017286581,"about_ca_system_score_gemma":0.0007383881,"threshold_uncertainty_score":0.0465883},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.19017503,0.0054990794,0.5852479,0.032157134,0.0009846301,0.0004465553,0.0030929402,0.0020590615,0.18033774],"genre_scores_gemma":[0.7338867,0.003218855,0.2215599,0.0038491858,0.0016188475,0.0007207342,0.003259946,0.0012441146,0.030641768],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.991998,0.0017486166,0.0004765678,0.00173427,0.003023856,0.0010186428],"domain_scores_gemma":[0.9769652,0.0162121,0.00081816973,0.0039546997,0.0014849597,0.000564972],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005171476,0.0012192983,0.0019652264,0.0016262208,0.003705337,0.0077874046,0.0035153616,0.0026746425,0.01613923],"category_scores_gemma":[0.022850648,0.0011499084,0.0039948025,0.002598439,0.007299951,0.022440216,0.009761967,0.008966274,0.0030435203],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000176256,0.000053118594,0.0005988005,0.00016883081,0.000027249991,0.0001245612,0.00029374976,0.005179995,0.0005809095,0.9694401,0.0073652137,0.015991185],"study_design_scores_gemma":[0.000035652083,0.000015365302,0.00014188515,0.000025633894,0.000011576282,0.00006455604,0.00004689056,0.014389993,0.0003581968,0.9792697,0.0056210267,0.000019450403],"about_ca_topic_score_codex":0.004113618,"about_ca_topic_score_gemma":0.0022611925,"teacher_disagreement_score":0.01613923,"about_ca_system_score_codex":0.005164388,"about_ca_system_score_gemma":0.0031494533,"threshold_uncertainty_score":0.05399114},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4869374,0.00024527212,0.42705315,0.00056979497,0.00047031965,0.00014277882,0.0005195504,0.0008133241,0.083248414],"genre_scores_gemma":[0.90497446,0.00018428703,0.07151345,0.00022008742,0.00019332962,0.00006548242,0.0005703414,0.0002539993,0.022024598],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992318,0.0001307586,0.00004206234,0.00013508339,0.00024198073,0.00021842924],"domain_scores_gemma":[0.99882644,0.00030582334,0.000074050266,0.0004316549,0.0002264899,0.00013548341],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007366096,0.0003733994,0.0008544376,0.0009185602,0.0014554345,0.001542161,0.0009837413,0.00045423125,0.016351575],"category_scores_gemma":[0.002574071,0.0003944891,0.0009134846,0.0007637707,0.0015409589,0.0024773534,0.0029019518,0.0018963766,0.0016005368],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00023060488,0.000068377034,0.00024966692,0.00007446163,0.000016711987,0.00018070321,0.00045326306,0.0030391621,0.0063478188,0.95893556,0.0021373532,0.0282664],"study_design_scores_gemma":[0.00003972337,0.00009541955,0.0002885906,0.000027466862,0.000023464341,0.00011931858,0.0002635578,0.020028282,0.0052010356,0.9659481,0.007940248,0.00002483278],"about_ca_topic_score_codex":0.0011732739,"about_ca_topic_score_gemma":0.00143768,"teacher_disagreement_score":0.016351575,"about_ca_system_score_codex":0.0006439556,"about_ca_system_score_gemma":0.0004802535,"threshold_uncertainty_score":0.054701507},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09626761,0.00023693203,0.8884631,0.0009934597,0.00015561501,0.000099500656,0.00030505733,0.0010041312,0.012474712],"genre_scores_gemma":[0.7227593,0.00018065283,0.2606223,0.00027961467,0.00013823196,0.00016034654,0.0005845476,0.00024568645,0.015029328],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995585,0.000108297376,0.000016923232,0.00007841539,0.00018060349,0.000057239093],"domain_scores_gemma":[0.9982218,0.0012668563,0.000095512216,0.00019301084,0.00015606022,0.00006670321],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003902414,0.0006345529,0.0006812708,0.00033622005,0.0004508955,0.00078652886,0.0007342978,0.0010951526,0.0118374545],"category_scores_gemma":[0.0039370917,0.000557824,0.00041492342,0.0005608711,0.0008107654,0.0017333514,0.0016541784,0.0016175229,0.0011914445],"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.00028077388,0.00014694722,0.00095851877,0.0005418193,0.00008177784,0.00034275974,0.0002491396,0.7461213,0.010502981,0.084295794,0.014176619,0.14230168],"study_design_scores_gemma":[0.00007034342,0.00007934496,0.00009783574,0.000008227849,0.000008181855,0.000046312187,0.00009782044,0.9444661,0.0029311897,0.050549027,0.0016373119,0.000008277133],"about_ca_topic_score_codex":0.0016219667,"about_ca_topic_score_gemma":0.004376303,"teacher_disagreement_score":0.0118374545,"about_ca_system_score_codex":0.00035151266,"about_ca_system_score_gemma":0.00095816766,"threshold_uncertainty_score":0.039600253},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15848596,0.004650442,0.5040455,0.010350992,0.002885547,0.00024423754,0.00068683893,0.002155394,0.31649512],"genre_scores_gemma":[0.7691908,0.003278958,0.14000084,0.0022528342,0.0022009243,0.00028367396,0.0013473176,0.0013967529,0.08004785],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986076,0.00038361005,0.00005520633,0.00018073099,0.00046314148,0.00030962023],"domain_scores_gemma":[0.99815696,0.0010914085,0.000073558906,0.00028182578,0.0002443217,0.0001519933],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013379857,0.0012355438,0.0019351109,0.002252127,0.0027570496,0.0035589172,0.0015173618,0.0012271928,0.016589388],"category_scores_gemma":[0.0046718605,0.0007265637,0.0019129562,0.0026196036,0.004831592,0.0068913414,0.003871492,0.0052967523,0.00307139],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010016922,0.00007873259,0.000153341,0.000068185414,0.000012374917,0.000060249098,0.00027064164,0.0030271441,0.0006822172,0.97047365,0.0064038457,0.018669458],"study_design_scores_gemma":[0.000019516323,0.000011628239,0.000034107583,0.000010709555,0.0000056013296,0.000022329443,0.000044477845,0.005136622,0.0003398203,0.99096394,0.0034011893,0.0000100340385],"about_ca_topic_score_codex":0.0040282668,"about_ca_topic_score_gemma":0.005358107,"teacher_disagreement_score":0.016589388,"about_ca_system_score_codex":0.0020359794,"about_ca_system_score_gemma":0.0011889532,"threshold_uncertainty_score":0.05549699},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.95165366,0.00028834984,0.012172148,0.00059045065,0.00014883916,0.00001777291,0.00017900088,0.00008457291,0.034865107],"genre_scores_gemma":[0.9926184,0.00009184929,0.0017839214,0.000030220934,0.000056524896,0.00000995268,0.00008206961,0.000021233234,0.0053058416],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9998505,0.000018080507,0.000007268708,0.000029210183,0.000048450318,0.000046500285],"domain_scores_gemma":[0.9996076,0.000070473165,0.00007552632,0.000018584788,0.00007339149,0.0001543359],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00041016078,0.00038104973,0.00038906457,0.0015447617,0.00075608405,0.0013988786,0.0003959347,0.00028720216,0.0050633047],"category_scores_gemma":[0.00091023464,0.00016847852,0.00015248034,0.00057530304,0.0015040647,0.0011135839,0.00074236706,0.0005692678,0.00069017406],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00059492607,0.00009686547,0.005875849,0.000115674804,0.000018895264,0.0009939482,0.0007854073,0.004354264,0.01706249,0.9414114,0.0038000646,0.024890248],"study_design_scores_gemma":[0.000264565,0.00031717264,0.008681891,0.000099572644,0.00003811907,0.0013954053,0.0009516146,0.040828526,0.009495215,0.914902,0.022905495,0.00012050704],"about_ca_topic_score_codex":0.001129437,"about_ca_topic_score_gemma":0.001230619,"teacher_disagreement_score":0.0050633047,"about_ca_system_score_codex":0.0011369744,"about_ca_system_score_gemma":0.0003143543,"threshold_uncertainty_score":0.016938388},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1817153,0.00051688065,0.7399249,0.0019643563,0.0005295733,0.00012794096,0.00020464709,0.0019015712,0.07311486],"genre_scores_gemma":[0.9123042,0.0003013891,0.07461641,0.0002551602,0.00022584654,0.000039618757,0.00022297491,0.0002822729,0.011752132],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99827635,0.00021410902,0.00008974993,0.0003273943,0.00058448495,0.0005079639],"domain_scores_gemma":[0.9941453,0.002283452,0.00025417632,0.0019658662,0.0009917422,0.00035948528],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017346423,0.0004894471,0.0009069143,0.0014462252,0.002328065,0.0034144043,0.0011528685,0.0011639594,0.009672829],"category_scores_gemma":[0.009932507,0.0006376025,0.0011329758,0.0013114118,0.0045849215,0.0074639777,0.004746639,0.0045752926,0.0013404412],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013002727,0.000064130916,0.0008254084,0.0000523631,0.000008975972,0.00017760557,0.00034625398,0.0031097352,0.0025193444,0.9553367,0.0019952476,0.035434265],"study_design_scores_gemma":[0.000020870439,0.00002224774,0.00026457323,0.000021393096,0.000017370616,0.00013914416,0.00008804868,0.013473941,0.004120712,0.97695345,0.004858519,0.000019768066],"about_ca_topic_score_codex":0.0016221412,"about_ca_topic_score_gemma":0.002009099,"teacher_disagreement_score":0.009672829,"about_ca_system_score_codex":0.0013303009,"about_ca_system_score_gemma":0.001638931,"threshold_uncertainty_score":0.032358825},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.058524303,0.00088820024,0.8685044,0.0012006724,0.0002413149,0.00015230967,0.0008018991,0.00034562283,0.069341265],"genre_scores_gemma":[0.7444708,0.0012188702,0.19711852,0.0004538568,0.00042083638,0.00056688616,0.0014608181,0.00019815702,0.05409131],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992537,0.00016641659,0.000052706797,0.00015273488,0.00020790036,0.00016659348],"domain_scores_gemma":[0.99929917,0.00032342074,0.00008390676,0.00006694174,0.00016623792,0.000060363884],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00089723634,0.001020935,0.0008367917,0.00075701583,0.0011562245,0.0024757385,0.0015564456,0.0011950714,0.01322189],"category_scores_gemma":[0.0029141535,0.0005052386,0.0011269234,0.0011438957,0.0013166525,0.0026771456,0.0022342296,0.0024766817,0.0016944153],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000060561215,0.000019800951,0.00008132493,0.00008656448,0.000018392873,0.00003870292,0.00018147854,0.004523262,0.0021379523,0.97895026,0.0016126718,0.012288925],"study_design_scores_gemma":[0.00003991051,0.00003730097,0.00011730004,0.00002571072,0.000013933716,0.00005647317,0.00008034159,0.03797039,0.0019807895,0.9540075,0.0056480602,0.000022197532],"about_ca_topic_score_codex":0.000876486,"about_ca_topic_score_gemma":0.00082481146,"teacher_disagreement_score":0.01322189,"about_ca_system_score_codex":0.0011584724,"about_ca_system_score_gemma":0.0009704494,"threshold_uncertainty_score":0.044231653},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06589235,0.005355206,0.5665033,0.005049036,0.0010724552,0.00012440965,0.0010154053,0.0008540188,0.35413384],"genre_scores_gemma":[0.7683628,0.0060054595,0.14211659,0.00092525873,0.0010429318,0.00026830286,0.0018686497,0.00042957184,0.078980446],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99913365,0.00030664296,0.00005112622,0.00013597599,0.00024536348,0.00012725625],"domain_scores_gemma":[0.99877125,0.00064636447,0.00008424559,0.00028446747,0.00012418353,0.00008946217],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013769291,0.0007598614,0.0008248829,0.0020683943,0.0014247464,0.0036034079,0.0012883879,0.0009533655,0.0152918575],"category_scores_gemma":[0.003154053,0.00039583206,0.0008849836,0.0028538285,0.0039689997,0.007707964,0.003209844,0.0032282975,0.0022920587],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000014807112,0.0000062076706,0.000029352355,0.000026047659,0.0000026266064,0.000015445228,0.00013391937,0.00046251295,0.00013057371,0.9909909,0.0011319136,0.0070556286],"study_design_scores_gemma":[0.0000046882124,0.0000070323927,0.00004032458,0.000021351882,0.0000035028504,0.000026631906,0.000041553783,0.0013736048,0.00013195856,0.9920884,0.006256831,0.000004254036],"about_ca_topic_score_codex":0.0010467726,"about_ca_topic_score_gemma":0.0009660563,"teacher_disagreement_score":0.0152918575,"about_ca_system_score_codex":0.0017815297,"about_ca_system_score_gemma":0.0005069337,"threshold_uncertainty_score":0.0511564},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7639295,0.0010479016,0.154936,0.0018006867,0.00039226157,0.000052609044,0.00017946598,0.0003917035,0.077269964],"genre_scores_gemma":[0.9751561,0.00028677366,0.013371645,0.00027061743,0.00036011692,0.00004032582,0.00012668218,0.00014572633,0.010242031],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99920136,0.00016691267,0.00003643544,0.00017120103,0.00022703584,0.0001970538],"domain_scores_gemma":[0.9976101,0.00057667954,0.00047228517,0.0004233741,0.0002538215,0.0006638246],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012472306,0.000602266,0.0013384395,0.00276479,0.0029912188,0.003184602,0.0017443657,0.0012813153,0.0063161063],"category_scores_gemma":[0.0047343937,0.00071729283,0.00069274864,0.002051385,0.004350915,0.0050520683,0.0019025047,0.00256328,0.00075853226],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000029902887,0.000014116532,0.00015123331,0.000010898573,0.000002896288,0.00004929819,0.000087790286,0.00045721384,0.00067657174,0.99699605,0.00036449,0.0011595333],"study_design_scores_gemma":[0.000014046786,0.000013467038,0.0002683616,0.0000075183443,0.000004773257,0.00012515836,0.00007354643,0.007437758,0.00046978184,0.9904631,0.0011054456,0.000017149434],"about_ca_topic_score_codex":0.0007632167,"about_ca_topic_score_gemma":0.00086681684,"teacher_disagreement_score":0.0063161063,"about_ca_system_score_codex":0.0012292045,"about_ca_system_score_gemma":0.00080402114,"threshold_uncertainty_score":0.02112943},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.015981795,0.00060446095,0.9687319,0.00064724014,0.00008793006,0.00014038754,0.0003987124,0.00446518,0.008942338],"genre_scores_gemma":[0.2252955,0.0005462133,0.76341903,0.00026382357,0.00013658666,0.0002561823,0.0013819414,0.00072612544,0.007974578],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99792933,0.00050239725,0.00016201449,0.00051990227,0.0005112324,0.00037520562],"domain_scores_gemma":[0.99796706,0.00073745986,0.00011322679,0.0007188857,0.00032991296,0.00013345666],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017613062,0.0008147477,0.0008471576,0.0012786764,0.0011365257,0.0030080315,0.0022141943,0.0009237733,0.01396196],"category_scores_gemma":[0.005800362,0.00053973316,0.0014290329,0.0015954829,0.0012860456,0.0066476464,0.004258267,0.0022683612,0.003687413],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00031086203,0.00017841432,0.00097500475,0.00029807584,0.00006625057,0.000094134026,0.0004395372,0.022247711,0.0034080083,0.69052243,0.015337911,0.26612166],"study_design_scores_gemma":[0.00008125443,0.00004587711,0.00014382838,0.00006413206,0.000026981183,0.00012113272,0.00013506168,0.14559676,0.004311161,0.83086514,0.018585198,0.000023550334],"about_ca_topic_score_codex":0.0018538091,"about_ca_topic_score_gemma":0.0033633152,"teacher_disagreement_score":0.01396196,"about_ca_system_score_codex":0.0021684668,"about_ca_system_score_gemma":0.0019437105,"threshold_uncertainty_score":0.04670745},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05117023,0.00058902346,0.92146164,0.0003962166,0.000143624,0.00012775033,0.00038738668,0.011562595,0.014161479],"genre_scores_gemma":[0.40366307,0.00041493526,0.5801675,0.00017841431,0.00010853849,0.00013726493,0.0016515683,0.0007640836,0.012914595],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9984086,0.00025532284,0.0000964707,0.00031047326,0.00059507124,0.00033396232],"domain_scores_gemma":[0.99777067,0.0006242393,0.00014697948,0.000835033,0.0005432749,0.00007972805],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001391097,0.0010788837,0.0010613697,0.001389522,0.00076392357,0.0018061376,0.0012893786,0.00092974846,0.015610275],"category_scores_gemma":[0.0058944877,0.00050781976,0.0009054129,0.0015073265,0.00081034447,0.003637248,0.0021910728,0.0012429488,0.006300237],"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.0016369111,0.00016336836,0.0031710404,0.0003105552,0.00007154843,0.00037130414,0.0003801117,0.030265747,0.022461759,0.116212,0.019689772,0.8052659],"study_design_scores_gemma":[0.00075378775,0.0007910258,0.0025595038,0.00015811095,0.00011892292,0.0018391233,0.00044462728,0.60658276,0.13164966,0.1694696,0.08545194,0.00018094383],"about_ca_topic_score_codex":0.0013161816,"about_ca_topic_score_gemma":0.0012320405,"teacher_disagreement_score":0.015610275,"about_ca_system_score_codex":0.0009644717,"about_ca_system_score_gemma":0.001193858,"threshold_uncertainty_score":0.052221596},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.082528844,0.00050552364,0.7485506,0.0005957896,0.000225864,0.00020608169,0.0031036956,0.10761882,0.056664877],"genre_scores_gemma":[0.435644,0.00031862524,0.5342077,0.00047345168,0.00015221526,0.00048704236,0.0051482804,0.009323621,0.014245046],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984944,0.0002827242,0.00009897851,0.00020842702,0.00066562823,0.00024975082],"domain_scores_gemma":[0.9976355,0.00088084803,0.0001763138,0.00071079814,0.0004646925,0.00013180044],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010733334,0.00085437484,0.0007464325,0.0009641856,0.00075158954,0.0018828937,0.0015564383,0.0005911004,0.019222273],"category_scores_gemma":[0.0054010716,0.00051028805,0.00078145025,0.0015625122,0.0009033676,0.0032826304,0.0024401522,0.0013520219,0.007436002],"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.00300687,0.00043180783,0.004480808,0.0009834239,0.00014155461,0.00063199317,0.0010428595,0.061192628,0.030338153,0.18476097,0.16569342,0.5472955],"study_design_scores_gemma":[0.0006796201,0.00064788817,0.0019080385,0.0001553705,0.00008398388,0.0006779017,0.0002059646,0.3605467,0.15614854,0.17287715,0.30585533,0.00021352485],"about_ca_topic_score_codex":0.001254165,"about_ca_topic_score_gemma":0.0017618176,"teacher_disagreement_score":0.019222273,"about_ca_system_score_codex":0.00083408586,"about_ca_system_score_gemma":0.0014200637,"threshold_uncertainty_score":0.06430489},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.23034294,0.009204662,0.51256794,0.016286882,0.00043374122,0.000094548646,0.00031609015,0.0006069686,0.23014632],"genre_scores_gemma":[0.9587652,0.0020048453,0.021489056,0.00053797057,0.00076062913,0.000054783683,0.000158926,0.00011876405,0.016109746],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9981117,0.0005708877,0.000070905815,0.000415607,0.00055079494,0.0002800349],"domain_scores_gemma":[0.994528,0.003571105,0.0003155227,0.0010082725,0.00038563207,0.00019151057],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014433943,0.00045024927,0.0011768473,0.0013836971,0.001895505,0.0031708616,0.0011271251,0.0010255651,0.007295995],"category_scores_gemma":[0.007440544,0.00040765296,0.0011348694,0.001975458,0.008639913,0.010043613,0.0032425695,0.0034668418,0.00079679146],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008048883,0.000003638442,0.000047834063,0.000013157504,0.0000027689048,0.000008381783,0.000054689044,0.0009193657,0.00009050893,0.9964886,0.00044781077,0.0019151106],"study_design_scores_gemma":[0.0000037841671,0.000002424522,0.00006139467,0.0000021613994,0.0000027054027,0.000013319431,0.000016302165,0.0021075206,0.0001150237,0.99567336,0.0019993996,0.0000027629746],"about_ca_topic_score_codex":0.002173276,"about_ca_topic_score_gemma":0.0013122876,"teacher_disagreement_score":0.007295995,"about_ca_system_score_codex":0.0030187054,"about_ca_system_score_gemma":0.0010272498,"threshold_uncertainty_score":0.024407566},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15035494,0.0002273552,0.827991,0.00024947876,0.0001840664,0.00009521286,0.00020094166,0.0028392447,0.017857743],"genre_scores_gemma":[0.5869369,0.00012478688,0.40582305,0.00012048375,0.000057540874,0.00009014673,0.00024848175,0.00053218007,0.006066453],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99977785,0.00005978936,0.0000094138095,0.000026970823,0.00009648202,0.0000293945],"domain_scores_gemma":[0.9994653,0.00017327211,0.000029622928,0.000102389095,0.00017560307,0.000053834065],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00028780327,0.00044316353,0.0005952496,0.00049499,0.00046176405,0.00053650746,0.0006346364,0.00040233732,0.0034026597],"category_scores_gemma":[0.0014907009,0.00017509492,0.0004078209,0.0007512394,0.0005399841,0.00062854314,0.0007843258,0.00057350233,0.0007869956],"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.0008160912,0.00028380164,0.00607365,0.0003025522,0.00019661777,0.001040231,0.00055068877,0.36289877,0.13957371,0.1961261,0.023433357,0.2687045],"study_design_scores_gemma":[0.00007655313,0.000072355426,0.00042625694,0.000009862345,0.000009759379,0.00010123968,0.000017388355,0.9709237,0.013996507,0.009556603,0.0047934772,0.000016300766],"about_ca_topic_score_codex":0.003088469,"about_ca_topic_score_gemma":0.0035973608,"teacher_disagreement_score":0.0034026597,"about_ca_system_score_codex":0.00057460763,"about_ca_system_score_gemma":0.00085670484,"threshold_uncertainty_score":0.011382997},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12755784,0.001171029,0.7730319,0.016919157,0.00067796133,0.0001799565,0.0004904913,0.00039179655,0.07957989],"genre_scores_gemma":[0.67701215,0.001507214,0.26497263,0.0020665333,0.0012780312,0.00036739293,0.00114819,0.00051475706,0.05113308],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99805534,0.0009681507,0.000083371706,0.0003990064,0.0002825403,0.00021159438],"domain_scores_gemma":[0.99100715,0.0070597897,0.00037328908,0.00087927724,0.000365003,0.00031540814],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0026686138,0.0007440719,0.002037432,0.0008808282,0.001667349,0.0033466856,0.0025257284,0.0027210047,0.016801756],"category_scores_gemma":[0.014588192,0.0004846321,0.0019158764,0.0015441101,0.004536347,0.009858207,0.004313385,0.0050514187,0.0013343501],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006743481,0.000036357545,0.00014254265,0.00007899546,0.00001659208,0.00008524795,0.00010413506,0.013292019,0.00020908777,0.97057915,0.005029745,0.010358655],"study_design_scores_gemma":[0.000027496097,0.000016018566,0.000056294768,0.000015028461,0.000007890373,0.000056883004,0.00005493718,0.047389705,0.00013104064,0.9501108,0.0021236814,0.000010245217],"about_ca_topic_score_codex":0.0014690526,"about_ca_topic_score_gemma":0.0016631973,"teacher_disagreement_score":0.016801756,"about_ca_system_score_codex":0.0012838043,"about_ca_system_score_gemma":0.0014307322,"threshold_uncertainty_score":0.05620742},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4227947,0.0007769439,0.53225595,0.0014288987,0.0005543205,0.0001035698,0.00032265266,0.0006809451,0.041082002],"genre_scores_gemma":[0.9150251,0.0005957387,0.050303478,0.00029824188,0.00029609766,0.00006939772,0.0005819193,0.000326188,0.03250381],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99893826,0.00025801122,0.00005175439,0.00014734962,0.00039513968,0.00020941785],"domain_scores_gemma":[0.998312,0.0007295441,0.00021206237,0.00024253853,0.00027810203,0.0002257321],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013776191,0.0009976028,0.0012379527,0.0022444436,0.0013200602,0.0028548762,0.0021068437,0.001127428,0.0077483845],"category_scores_gemma":[0.007195879,0.00063354225,0.0011612374,0.0016182739,0.0027575358,0.006251693,0.002356792,0.0035218934,0.00141526],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006545997,0.000036079342,0.0004443152,0.000037994632,0.000016765001,0.00006072938,0.00018008439,0.0055048885,0.00065804133,0.9847075,0.0009867618,0.0073013552],"study_design_scores_gemma":[0.000018411352,0.00002080847,0.00016871595,0.0000139732365,0.000010725665,0.000058624657,0.00006161308,0.06558045,0.0006746794,0.9320625,0.0013078091,0.000021679974],"about_ca_topic_score_codex":0.0023976213,"about_ca_topic_score_gemma":0.0029772567,"teacher_disagreement_score":0.0077483845,"about_ca_system_score_codex":0.0018698499,"about_ca_system_score_gemma":0.0008847813,"threshold_uncertainty_score":0.025920987},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.018264625,0.0005024787,0.91390014,0.0008909965,0.00024737383,0.00011651341,0.0015209095,0.024758592,0.03979845],"genre_scores_gemma":[0.4426509,0.0010067028,0.512414,0.00039883473,0.00034362756,0.0004844195,0.0044543645,0.0051309504,0.033116203],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99856025,0.00042710858,0.00006661125,0.00012201219,0.00062572845,0.00019814621],"domain_scores_gemma":[0.99706584,0.0013941927,0.000112080335,0.00077899656,0.00044864937,0.0002001559],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019668243,0.0008611505,0.0011063853,0.0012489312,0.0009197215,0.002850411,0.0016316109,0.0007507706,0.044493273],"category_scores_gemma":[0.009535429,0.00061358354,0.0011298169,0.0017187913,0.0009682153,0.004909346,0.004091381,0.001790553,0.018473543],"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.00090421736,0.00023073965,0.0023713056,0.0007662253,0.00011514497,0.00034063208,0.00048521045,0.12933172,0.0042126295,0.32652155,0.11764653,0.41707408],"study_design_scores_gemma":[0.00017077113,0.000088633016,0.0003306131,0.00007745445,0.000024309797,0.00011367567,0.00009572891,0.5775855,0.006421044,0.35868552,0.056358136,0.00004852082],"about_ca_topic_score_codex":0.0019361695,"about_ca_topic_score_gemma":0.0037720862,"teacher_disagreement_score":0.044493273,"about_ca_system_score_codex":0.0009557656,"about_ca_system_score_gemma":0.0013516621,"threshold_uncertainty_score":0.1488449},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.27985415,0.0013887279,0.5864701,0.0022541045,0.0014803071,0.000082526276,0.0003262338,0.0010377333,0.12710606],"genre_scores_gemma":[0.8139501,0.0010011703,0.07041716,0.00070398016,0.00076917675,0.00008294434,0.0003834693,0.00076867,0.11192334],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99948573,0.00010950726,0.00001919572,0.00016083497,0.00013377196,0.000090856076],"domain_scores_gemma":[0.9985839,0.00041466494,0.00021549402,0.00034676553,0.00027887264,0.00016035765],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00060553325,0.0007478095,0.0006371035,0.0021362843,0.0015783883,0.0021806268,0.0010507371,0.0012831106,0.021040032],"category_scores_gemma":[0.004769366,0.00052913994,0.0005549261,0.0013741918,0.0018582925,0.005675812,0.0019355732,0.002032981,0.003704691],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005866443,0.000013343421,0.00010889654,0.000025201483,0.0000056912654,0.000083535604,0.00017618803,0.0015541994,0.002624045,0.98261696,0.00245364,0.010279691],"study_design_scores_gemma":[0.000010706826,0.000027216176,0.00014311729,0.00001696068,0.0000067922124,0.00011992959,0.00010648199,0.009588267,0.0022521524,0.97995776,0.0077548274,0.000015729207],"about_ca_topic_score_codex":0.0006018686,"about_ca_topic_score_gemma":0.00047201544,"teacher_disagreement_score":0.021040032,"about_ca_system_score_codex":0.000635421,"about_ca_system_score_gemma":0.00038091172,"threshold_uncertainty_score":0.07038587},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0005420211,0.000044162156,0.99261826,0.00012022036,0.000048257873,0.000106150466,0.00007010746,0.0026435733,0.0038072956],"genre_scores_gemma":[0.019175528,0.00021917203,0.973682,0.00013793049,0.00010331058,0.00039889058,0.00036187758,0.0009380525,0.004983171],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99813867,0.00032436056,0.00017079255,0.00031068816,0.0009210664,0.00013444955],"domain_scores_gemma":[0.99704295,0.0013798961,0.00012548103,0.0007417477,0.0006310958,0.000078742545],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017972447,0.0016635868,0.0010264956,0.0022069686,0.0016675537,0.002672462,0.0023617966,0.0009326276,0.024914837],"category_scores_gemma":[0.0073797773,0.001178877,0.001715133,0.0016064752,0.0019453326,0.004137403,0.004361562,0.003136213,0.016376588],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000095720505,0.00021336024,0.00037741612,0.0004426943,0.00007638814,0.00035655717,0.00064402947,0.006489136,0.015236106,0.47326565,0.030488463,0.4723144],"study_design_scores_gemma":[0.00018812541,0.00013968753,0.00043030336,0.00016090469,0.000084580985,0.0012527835,0.00016944914,0.10605471,0.026299788,0.70551425,0.15954168,0.00016373498],"about_ca_topic_score_codex":0.0010194631,"about_ca_topic_score_gemma":0.0013234832,"teacher_disagreement_score":0.024914837,"about_ca_system_score_codex":0.000981113,"about_ca_system_score_gemma":0.002500651,"threshold_uncertainty_score":0.08334839},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7261364,0.0015665736,0.2081695,0.0007197423,0.0002419817,0.000043167965,0.00024703715,0.00022708524,0.06264854],"genre_scores_gemma":[0.9785523,0.0004244054,0.012935318,0.000076780045,0.0001276074,0.000022274566,0.000085997766,0.000036907124,0.0077383467],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99926656,0.00013661101,0.00005301464,0.00011986372,0.00025713467,0.00016677732],"domain_scores_gemma":[0.9982217,0.00054380053,0.0003556576,0.00017583843,0.0003986414,0.00030432208],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00088761334,0.0005115865,0.00032974477,0.00202216,0.000784331,0.0016505271,0.00037470023,0.00032916182,0.0028828555],"category_scores_gemma":[0.0026585814,0.00022077323,0.00043080712,0.0009960975,0.0018701872,0.002925925,0.00097297214,0.0009173156,0.0004756194],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004162344,0.000019335885,0.0008952939,0.000029629207,0.000007153773,0.000109095075,0.00034868665,0.0025591496,0.0031358525,0.9780341,0.00070180703,0.0141182225],"study_design_scores_gemma":[0.000014771722,0.00014584034,0.0023207378,0.000027210272,0.000014708016,0.0005589568,0.00034718367,0.026030434,0.005558717,0.9509483,0.013977212,0.000055789966],"about_ca_topic_score_codex":0.0007680817,"about_ca_topic_score_gemma":0.00071276753,"teacher_disagreement_score":0.0028828555,"about_ca_system_score_codex":0.00068155036,"about_ca_system_score_gemma":0.0003788518,"threshold_uncertainty_score":0.009644151},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12175524,0.00792805,0.48285773,0.0063685994,0.0012420552,0.00012594035,0.0011987648,0.0010094376,0.37751418],"genre_scores_gemma":[0.8166826,0.004410409,0.09231287,0.0019747175,0.001225539,0.00022649197,0.0008483569,0.00026730806,0.08205173],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99924743,0.00010775893,0.000043151136,0.00014255359,0.0003102095,0.00014900815],"domain_scores_gemma":[0.99901104,0.00030857863,0.0000561021,0.00016552724,0.00034477067,0.000113972295],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015678864,0.0005123265,0.00067945523,0.0030057887,0.0018482051,0.0025928568,0.0008014212,0.0008399292,0.00470491],"category_scores_gemma":[0.0025372466,0.00035591808,0.0011755739,0.0017107218,0.002180245,0.004498824,0.001963025,0.0020526415,0.0012306437],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000013418364,0.000005757412,0.00011048361,0.000030896437,0.000011401372,0.000031659183,0.0001235159,0.00025085727,0.0006234962,0.989422,0.0022986894,0.0070778597],"study_design_scores_gemma":[0.000014657252,0.00002070411,0.000639821,0.000024320836,0.000013920724,0.0001350688,0.000047809175,0.002821533,0.000637855,0.97816896,0.0174597,0.000015548077],"about_ca_topic_score_codex":0.0038062294,"about_ca_topic_score_gemma":0.0019964979,"teacher_disagreement_score":0.00470491,"about_ca_system_score_codex":0.0024586946,"about_ca_system_score_gemma":0.00077600265,"threshold_uncertainty_score":0.017839134},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.41940466,0.0016745892,0.1526382,0.0045758705,0.0028188513,0.00031833444,0.00050868146,0.00077799475,0.41728285],"genre_scores_gemma":[0.913593,0.00060186535,0.024142785,0.0009211354,0.0019219232,0.0002933165,0.00056469097,0.00045311457,0.05750818],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9959949,0.0010359873,0.0002722702,0.0006491178,0.0012274304,0.00082030747],"domain_scores_gemma":[0.99700874,0.0011801375,0.00033166434,0.00033310693,0.00048728418,0.0006590047],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0022347695,0.0010084233,0.0014158619,0.002733698,0.0054838187,0.0062380186,0.0015891364,0.001545838,0.013518623],"category_scores_gemma":[0.0071113147,0.0010656482,0.0015605987,0.0018242153,0.008762494,0.008298345,0.0046391524,0.0056135594,0.0023176023],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000025213436,0.000018689243,0.00005404081,0.000009648734,0.0000020049854,0.00003167925,0.00031200738,0.000060290964,0.00029662557,0.99693143,0.00073266344,0.0015256801],"study_design_scores_gemma":[0.000031978096,0.000014865778,0.000113373055,0.0000072985395,0.0000030473218,0.000042225904,0.00010704096,0.0004957455,0.00039564274,0.9957146,0.0030622962,0.000011857199],"about_ca_topic_score_codex":0.0013457149,"about_ca_topic_score_gemma":0.001367598,"teacher_disagreement_score":0.013518623,"about_ca_system_score_codex":0.0022226826,"about_ca_system_score_gemma":0.0010881138,"threshold_uncertainty_score":0.04522431},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4902224,0.0022598654,0.036317866,0.0021580225,0.00075485226,0.00006747702,0.00064716965,0.00084436993,0.46672806],"genre_scores_gemma":[0.967373,0.0005564367,0.0019029627,0.000057610425,0.000370828,0.000012549305,0.00033600134,0.000057885463,0.029332604],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9996586,0.000058194448,0.0000148232975,0.0000638298,0.00010637788,0.000098210396],"domain_scores_gemma":[0.99935895,0.00023775446,0.0001070436,0.00009316531,0.00008325655,0.00011971028],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00042783734,0.0003887087,0.00049399235,0.002050008,0.00074212055,0.001903398,0.00043119086,0.00031493118,0.016900677],"category_scores_gemma":[0.001333443,0.00014697363,0.00035193213,0.0009818914,0.0024250816,0.0022876302,0.00091386324,0.00078180555,0.0021011173],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000102962,0.000047697016,0.0005424922,0.00006274721,0.0000086903065,0.00012222308,0.00031796418,0.0010648222,0.001396515,0.971557,0.0040752664,0.020701597],"study_design_scores_gemma":[0.00003328405,0.000056651785,0.00094470306,0.000025736606,0.000017256936,0.00012591913,0.0001900231,0.002717708,0.0019386453,0.98049957,0.013436468,0.000014125379],"about_ca_topic_score_codex":0.00089590496,"about_ca_topic_score_gemma":0.00072198827,"teacher_disagreement_score":0.016900677,"about_ca_system_score_codex":0.0014527811,"about_ca_system_score_gemma":0.000497268,"threshold_uncertainty_score":0.056538463},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.014120598,0.00080320507,0.9661216,0.0003836713,0.00024966896,0.00024873234,0.0003520905,0.0047358084,0.01298465],"genre_scores_gemma":[0.14045914,0.00045590455,0.84481275,0.00019460537,0.00017888009,0.0003873672,0.0012558766,0.0005713517,0.011684125],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991412,0.00015232524,0.000055125314,0.0002060021,0.00028889245,0.00015645578],"domain_scores_gemma":[0.9988452,0.00044705058,0.0000514283,0.0003267621,0.00025468096,0.00007484914],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007733927,0.0012911495,0.0010480513,0.0016414039,0.0015269476,0.0016743691,0.001997819,0.0010959728,0.022876529],"category_scores_gemma":[0.0034212992,0.0004857678,0.0009354781,0.002162566,0.0009197491,0.0023721512,0.002360825,0.0018934427,0.0073562684],"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.0004974356,0.00023159027,0.00064294453,0.00033270582,0.00007046735,0.00017243187,0.00024695083,0.014128695,0.020923732,0.08817918,0.02805608,0.84651774],"study_design_scores_gemma":[0.0011303236,0.00070329726,0.0018750828,0.00019134794,0.0002106054,0.00132418,0.00034241079,0.40214285,0.05182697,0.43768835,0.10234381,0.00022072374],"about_ca_topic_score_codex":0.0033361223,"about_ca_topic_score_gemma":0.0073583163,"teacher_disagreement_score":0.022876529,"about_ca_system_score_codex":0.0012406211,"about_ca_system_score_gemma":0.0020552923,"threshold_uncertainty_score":0.07652962},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.012061092,0.0012495711,0.9682067,0.0005101158,0.00024583584,0.000045913966,0.000023081293,0.00015158627,0.01750605],"genre_scores_gemma":[0.3177566,0.004664455,0.6571933,0.0006711052,0.0007180379,0.00024494735,0.00010231596,0.00045671637,0.018192492],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989274,0.00050022535,0.000066601046,0.00006758093,0.00037442305,0.00006378396],"domain_scores_gemma":[0.9974159,0.001583301,0.00015897669,0.0003127019,0.00041588073,0.000113239184],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0035785288,0.00094119844,0.00090097403,0.0017379789,0.0010408836,0.0020168503,0.0013018629,0.0010575801,0.002692728],"category_scores_gemma":[0.010296413,0.00039456715,0.0011873031,0.0017289764,0.0031405524,0.003858247,0.0022672552,0.0030857876,0.0011163407],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000015623209,0.000018739183,0.00012895334,0.000060670325,0.000008356093,0.0001611677,0.00021104918,0.014458835,0.0019051173,0.96473354,0.0007866655,0.017511265],"study_design_scores_gemma":[0.000013418775,0.000029530811,0.00012236154,0.000081108454,0.000010140941,0.00018737827,0.000062454754,0.18305671,0.0020408826,0.8073434,0.007011401,0.000041129566],"about_ca_topic_score_codex":0.0011598887,"about_ca_topic_score_gemma":0.0015716921,"teacher_disagreement_score":0.0035785288,"about_ca_system_score_codex":0.0010187906,"about_ca_system_score_gemma":0.00075551897,"threshold_uncertainty_score":0.01892531},"labels":[],"label_agreement":null},{"id":"W2014664484","doi":"10.1090/s0025-5718-2014-02817-2","title":"Computation of the topological type of a real Riemann surface","year":2014,"lang":"en","type":"article","venue":"Mathematics of Computation","topic":"Polynomial and algebraic computation","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Center for Diagnosis and Research on Alzheimer's Disease","funders":"Agence Nationale de la Recherche","keywords":"Computation; Type (biology); Surface (topology); Riemann surface; Topology (electrical circuits); Mathematics; Riemann hypothesis; Computer science; Pure mathematics; Geometry; Geology; Algorithm; Combinatorics; Paleontology","score_opus":0.02789749109193495,"score_gpt":0.27876166687241455,"score_spread":0.2508641757804796,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2014664484","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.31257322,0.00029516785,0.65991014,0.00033019678,0.00019996434,0.00012497109,0.002619439,0.0056334827,0.018313445],"genre_scores_gemma":[0.63816965,0.00018460325,0.34857342,0.00006159644,0.000059268536,0.00011758607,0.0038013326,0.0008896713,0.008142926],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9996934,0.000024040663,0.000019533312,0.00007146271,0.00013682336,0.000054765555],"domain_scores_gemma":[0.99935776,0.0001767491,0.000061872706,0.00012766749,0.00021116689,0.00006482195],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003872108,0.00058851956,0.00076162914,0.0036970186,0.0005147284,0.002630957,0.001052732,0.00070632884,0.008306378],"category_scores_gemma":[0.0026651733,0.00033837988,0.0009031795,0.0011679188,0.00070685544,0.0020247232,0.001511296,0.0007078406,0.003265375],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0013491231,0.00018876925,0.02517569,0.0009962007,0.00019267226,0.0009843314,0.00097045425,0.08275378,0.055201083,0.2902289,0.019106662,0.5228523],"study_design_scores_gemma":[0.00012534129,0.0001761865,0.0060286927,0.00012671214,0.00007606576,0.0008189054,0.00045453594,0.6090661,0.036430657,0.32249796,0.024090033,0.00010875849],"about_ca_topic_score_codex":0.0009283469,"about_ca_topic_score_gemma":0.0011215877,"teacher_disagreement_score":0.008306378,"about_ca_system_score_codex":0.0010685947,"about_ca_system_score_gemma":0.0005670916,"threshold_uncertainty_score":0.027787626},"labels":[],"label_agreement":null},{"id":"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0114949215,0.0048547625,0.5430581,0.041257568,0.0019003601,0.00018176959,0.00076535775,0.002551284,0.39393586],"genre_scores_gemma":[0.49212626,0.004887782,0.38598397,0.0068242415,0.0017121033,0.0004594495,0.0006226643,0.0008849232,0.106498726],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9969844,0.0012775742,0.0001522143,0.00065433007,0.00075278105,0.00017858492],"domain_scores_gemma":[0.99450433,0.0032994882,0.00013717327,0.0010005559,0.0008757139,0.00018270565],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0055862446,0.00041007026,0.00056286063,0.0018897796,0.0030562792,0.004486065,0.0015133057,0.0018652084,0.007784889],"category_scores_gemma":[0.01386833,0.00050030224,0.0009006016,0.0010552407,0.012666786,0.00737277,0.0033510684,0.0043924637,0.0034081745],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009117955,0.0000032083003,0.000030516416,0.000013900025,0.0000020679072,0.00001560683,0.00013703966,0.0002427707,0.000053613985,0.9916652,0.0038291826,0.0039978107],"study_design_scores_gemma":[0.000016214906,0.000009171063,0.000036519323,0.000028988296,0.0000053557433,0.000039357175,0.00002863795,0.0017223705,0.00034209288,0.9253725,0.0723854,0.0000133759895],"about_ca_topic_score_codex":0.0038972283,"about_ca_topic_score_gemma":0.0027731776,"teacher_disagreement_score":0.007784889,"about_ca_system_score_codex":0.0037967924,"about_ca_system_score_gemma":0.003156229,"threshold_uncertainty_score":0.02954328},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.30135828,0.0008331993,0.5186665,0.0046149166,0.00093816075,0.00023940581,0.0013668286,0.0010670368,0.17091565],"genre_scores_gemma":[0.8766789,0.00051366404,0.09449805,0.0012738721,0.0006259365,0.00018997162,0.0010316008,0.00028943244,0.024898695],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9980197,0.00038571886,0.0002252519,0.0004417814,0.0006127754,0.00031480734],"domain_scores_gemma":[0.9975484,0.00080070976,0.00017632566,0.00048099938,0.00063562137,0.00035794885],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0024878546,0.0005908495,0.00089846354,0.0017461028,0.0032790583,0.003049709,0.0012440196,0.0015216657,0.007470593],"category_scores_gemma":[0.0032347715,0.00070941576,0.001339822,0.0015622587,0.0058749523,0.008620486,0.0034305004,0.004855629,0.0012187068],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000007848369,0.000008933412,0.00009118383,0.000007363557,0.0000020281436,0.000030559946,0.00013076188,0.00006542182,0.0002972177,0.9972728,0.00043775458,0.0016481605],"study_design_scores_gemma":[0.00002034755,0.000013492034,0.00020025377,0.0000049314335,0.000006803133,0.000109632,0.000110059096,0.0005294293,0.00057565543,0.99324644,0.0051713577,0.000011573821],"about_ca_topic_score_codex":0.0010580054,"about_ca_topic_score_gemma":0.001460598,"teacher_disagreement_score":0.007470593,"about_ca_system_score_codex":0.0016816348,"about_ca_system_score_gemma":0.001418909,"threshold_uncertainty_score":0.024991572},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09424672,0.00077446195,0.86743873,0.0005095157,0.0004597274,0.00014094051,0.00013338201,0.00036382378,0.035932716],"genre_scores_gemma":[0.690293,0.0014164059,0.2909272,0.0003476412,0.00075499015,0.00022234146,0.0002823578,0.00038367638,0.015372276],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992724,0.00014311975,0.000060772316,0.00019470653,0.0002589059,0.000070136804],"domain_scores_gemma":[0.99900204,0.00031197214,0.000112846465,0.00018247832,0.0002989528,0.000091740025],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010354789,0.0008255419,0.0006771629,0.0029818194,0.0009174519,0.0010792146,0.000862743,0.00063810794,0.0078308275],"category_scores_gemma":[0.0046452223,0.00032279175,0.00059061387,0.0010428842,0.0024358982,0.006545548,0.0017909681,0.0024141555,0.0012423848],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010838395,0.00008952073,0.002309402,0.00025094787,0.00003088462,0.00046397696,0.0006490054,0.0065359552,0.020243129,0.88502777,0.0025397995,0.0817511],"study_design_scores_gemma":[0.000052424373,0.00015223843,0.0013467829,0.00008311936,0.000038343736,0.0012663878,0.0002695164,0.06674167,0.014340635,0.8945175,0.021063743,0.0001275469],"about_ca_topic_score_codex":0.00040928976,"about_ca_topic_score_gemma":0.000459249,"teacher_disagreement_score":0.0078308275,"about_ca_system_score_codex":0.00048348645,"about_ca_system_score_gemma":0.0006066383,"threshold_uncertainty_score":0.026196718},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0025140657,0.00045799668,0.9852668,0.0006733476,0.00020570059,0.00019063223,0.00013577747,0.002468985,0.00808669],"genre_scores_gemma":[0.042251587,0.00080204854,0.937187,0.000495812,0.00029613543,0.00048730234,0.000675409,0.00079429423,0.01701052],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9966601,0.0006167219,0.00024098445,0.0007473524,0.0012113235,0.00052356534],"domain_scores_gemma":[0.9970085,0.00116193,0.00017572759,0.00094266614,0.0005704869,0.00014061197],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017829881,0.0019945218,0.001095668,0.0028430438,0.0015664457,0.0030098914,0.0033718469,0.002012423,0.0155607965],"category_scores_gemma":[0.009612874,0.0007565439,0.002122928,0.003916064,0.0021458974,0.0077377534,0.004041107,0.004207569,0.007567147],"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.00016680319,0.00016167891,0.00056132197,0.00025951664,0.000030771975,0.00009819273,0.00034079584,0.011655212,0.0022396015,0.41170782,0.023683969,0.5490943],"study_design_scores_gemma":[0.00022493779,0.00016524897,0.0003955635,0.00024995374,0.000053016993,0.0009237558,0.00027899598,0.21840416,0.014188039,0.5983393,0.16665456,0.00012250889],"about_ca_topic_score_codex":0.0019141235,"about_ca_topic_score_gemma":0.0029977958,"teacher_disagreement_score":0.0155607965,"about_ca_system_score_codex":0.0022047164,"about_ca_system_score_gemma":0.002495036,"threshold_uncertainty_score":0.052056074},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.43054017,0.00051839533,0.5083956,0.0003762136,0.000240152,0.00013297262,0.00016919582,0.0016897079,0.057937592],"genre_scores_gemma":[0.9674692,0.00015247024,0.024558593,0.00003671034,0.00002106341,0.000055341425,0.00008851677,0.00012651757,0.0074915914],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9997305,0.000033714347,0.000012134954,0.000056160923,0.000079254074,0.00008814701],"domain_scores_gemma":[0.9996637,0.00007035631,0.00005521177,0.00010525966,0.00005812974,0.000047296522],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00035187192,0.00051361293,0.0008538638,0.0012690199,0.0011401409,0.001527856,0.001595793,0.00071198144,0.013998347],"category_scores_gemma":[0.0012769153,0.0003995957,0.00047135723,0.0007799515,0.0010816508,0.002280069,0.002217298,0.000640155,0.0011836946],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00052382774,0.000110051646,0.0008636273,0.0001415087,0.000055686905,0.00023607467,0.00032917358,0.24251205,0.03527233,0.58949405,0.0033703644,0.12709126],"study_design_scores_gemma":[0.00014740591,0.00024100086,0.00062315696,0.000043283104,0.000065224966,0.00016863624,0.0004136625,0.6391689,0.012980204,0.3301364,0.015943913,0.00006821797],"about_ca_topic_score_codex":0.0013032642,"about_ca_topic_score_gemma":0.0015433163,"teacher_disagreement_score":0.013998347,"about_ca_system_score_codex":0.00084418815,"about_ca_system_score_gemma":0.0005552666,"threshold_uncertainty_score":0.046829164},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.804564,0.00026308547,0.16816555,0.00012459022,0.000057956087,0.000033188197,0.0002926239,0.00071685447,0.025782118],"genre_scores_gemma":[0.9752358,0.00013639417,0.020454185,0.00001791817,0.000022433798,0.00001710072,0.00020616264,0.000131206,0.0037788558],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995364,0.00008999975,0.000015331907,0.00007919192,0.00013400617,0.0001450387],"domain_scores_gemma":[0.999416,0.0002412989,0.00007797871,0.000099937,0.00007353518,0.00009127806],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00032317635,0.0005290721,0.0004966266,0.0024680204,0.0006474285,0.0019848656,0.00052415975,0.00039882262,0.0069427467],"category_scores_gemma":[0.0016652596,0.00020526903,0.000489167,0.001156571,0.0013744347,0.0029285233,0.0014415104,0.0010304801,0.0006357787],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000845119,0.000029930809,0.0028132484,0.000078476216,0.000017044762,0.00024223769,0.00031338114,0.019968767,0.0051796488,0.9373978,0.0009933261,0.03288156],"study_design_scores_gemma":[0.000015141503,0.000051702937,0.0023392227,0.00004108366,0.000030306164,0.00028831314,0.00031660355,0.09476609,0.015386308,0.8791177,0.0076072505,0.000040332776],"about_ca_topic_score_codex":0.0006473955,"about_ca_topic_score_gemma":0.00091347937,"teacher_disagreement_score":0.0069427467,"about_ca_system_score_codex":0.0007835459,"about_ca_system_score_gemma":0.00038449472,"threshold_uncertainty_score":0.023225784},"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.27781263,0.0088369595,0.121038355,0.0026159275,0.00085910683,0.000060734663,0.00040852293,0.00027333922,0.5880945],"genre_scores_gemma":[0.9467445,0.004179914,0.015008549,0.00028120747,0.0006387539,0.00005156385,0.00025441687,0.000083708124,0.03275742],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9997944,0.000044193137,0.000009231073,0.00003613315,0.00007078665,0.000045333316],"domain_scores_gemma":[0.9997607,0.00007545005,0.000050733863,0.000033344186,0.00003791968,0.000041816795],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003012961,0.0003722489,0.00023174696,0.000827389,0.00082298886,0.0017089442,0.000431181,0.00032747688,0.007640127],"category_scores_gemma":[0.0007830212,0.00013047871,0.00026737142,0.000628323,0.0023153676,0.0025562102,0.0011188851,0.0010502132,0.00057888735],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000027918056,0.0000018788753,0.00004721675,0.000015936208,0.0000012883687,0.00003183133,0.00010347962,0.0002840087,0.00015772905,0.99606836,0.0004275587,0.0028578383],"study_design_scores_gemma":[0.000006621283,0.000028514265,0.000669347,0.0000438296,0.000007601393,0.00032720322,0.00043499822,0.0028214136,0.00080704055,0.9516739,0.043166317,0.000013234365],"about_ca_topic_score_codex":0.0009038084,"about_ca_topic_score_gemma":0.00085627305,"teacher_disagreement_score":0.007640127,"about_ca_system_score_codex":0.0008642314,"about_ca_system_score_gemma":0.0003015487,"threshold_uncertainty_score":0.02555877},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5821571,0.004050715,0.25243196,0.0058823926,0.0012143756,0.00015309633,0.0007998188,0.001002126,0.15230836],"genre_scores_gemma":[0.96550316,0.00094481837,0.010287694,0.00046404244,0.0008419086,0.0000815996,0.0003091826,0.00015235266,0.021415232],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985947,0.0003705457,0.00006750631,0.00033715536,0.00027890864,0.0003511943],"domain_scores_gemma":[0.99763525,0.0011153984,0.00019698075,0.0003179179,0.00022100302,0.0005135119],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018459932,0.0018118911,0.0018031946,0.0042879595,0.003795404,0.0060681943,0.0012663503,0.0014959159,0.008502511],"category_scores_gemma":[0.0033742017,0.0009275126,0.0021591657,0.0028865093,0.006519181,0.0111668,0.0045642937,0.0051352438,0.0012160942],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000046714496,0.000020491132,0.00016684637,0.00002127019,0.000009737636,0.00004938252,0.00036223003,0.00022481951,0.00036133674,0.9956974,0.0004938937,0.0025458725],"study_design_scores_gemma":[0.000016066251,0.00002231808,0.00013646131,0.000008718051,0.000013351183,0.00008569643,0.0000784249,0.0006933786,0.00030612753,0.99632,0.002307583,0.000011835715],"about_ca_topic_score_codex":0.0010032017,"about_ca_topic_score_gemma":0.00076527154,"teacher_disagreement_score":0.008502511,"about_ca_system_score_codex":0.0028921089,"about_ca_system_score_gemma":0.0008745981,"threshold_uncertainty_score":0.028443754},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05725285,0.00010303512,0.9314772,0.00022263866,0.00006605841,0.00006812199,0.0004265117,0.0014602899,0.008923378],"genre_scores_gemma":[0.47471857,0.0001809459,0.51912606,0.00011957017,0.000073099385,0.000108565684,0.0016347974,0.00018580814,0.0038525409],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989318,0.0001925785,0.000090617825,0.00021349352,0.00037313806,0.0001984405],"domain_scores_gemma":[0.99822646,0.0005572174,0.000118516306,0.00067427167,0.00032304396,0.00010049029],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006838448,0.00046412786,0.0009724901,0.0010780853,0.00086241093,0.0027901758,0.0014267572,0.00052222185,0.0075625293],"category_scores_gemma":[0.003812838,0.00032747968,0.001110031,0.0024226578,0.0012227055,0.0054393266,0.0022234556,0.0013308376,0.0016232389],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0004476071,0.00012271454,0.0011136484,0.0002689046,0.00006708017,0.00019235835,0.0005919609,0.090600654,0.009053345,0.69870394,0.008506842,0.19033097],"study_design_scores_gemma":[0.00003397101,0.00006235224,0.00014136132,0.000030013753,0.000023111885,0.00008923356,0.00019529698,0.39474148,0.0078048906,0.58990145,0.006951154,0.000025674792],"about_ca_topic_score_codex":0.0017801878,"about_ca_topic_score_gemma":0.0041791094,"teacher_disagreement_score":0.0075625293,"about_ca_system_score_codex":0.0009823345,"about_ca_system_score_gemma":0.0008146394,"threshold_uncertainty_score":0.025299132},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.44710428,0.00083074137,0.4497268,0.0011295485,0.0006991569,0.00015361031,0.00074806344,0.0019854808,0.09762235],"genre_scores_gemma":[0.8846654,0.0004126335,0.06781177,0.00041635337,0.00032427273,0.00006872449,0.00081900094,0.0006198661,0.044861972],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99954456,0.00006854997,0.000019940277,0.00007990492,0.00014904108,0.00013800923],"domain_scores_gemma":[0.99940133,0.00023639867,0.0000529363,0.00015726624,0.000093611554,0.00005842005],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003038244,0.0007557113,0.0005956502,0.00065886194,0.00077954103,0.0015570156,0.0006159677,0.00043220056,0.010403031],"category_scores_gemma":[0.0016520481,0.0002642605,0.0007072584,0.0005445023,0.0011037599,0.0017771688,0.0014006423,0.0012314669,0.0025167428],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00046956143,0.00020396635,0.0006397672,0.00021918968,0.000047167785,0.00040917777,0.00069670024,0.01290393,0.027669918,0.83573234,0.014678606,0.106329694],"study_design_scores_gemma":[0.0000719979,0.00012960054,0.00045025864,0.000029494557,0.000033838256,0.00029329414,0.00017754074,0.028676977,0.027460953,0.928885,0.013749772,0.000041205807],"about_ca_topic_score_codex":0.0008760093,"about_ca_topic_score_gemma":0.001494579,"teacher_disagreement_score":0.010403031,"about_ca_system_score_codex":0.00045662269,"about_ca_system_score_gemma":0.0005687794,"threshold_uncertainty_score":0.034801602},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.33755592,0.008065691,0.5101986,0.0103764385,0.0011676772,0.00020589314,0.0011957607,0.0008109237,0.13042307],"genre_scores_gemma":[0.9237472,0.0011798099,0.062194455,0.0009166427,0.00069883297,0.00018712308,0.0004697509,0.00020325254,0.010402918],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99668473,0.0008570333,0.00014884614,0.0006683382,0.0012018166,0.0004391962],"domain_scores_gemma":[0.98607266,0.009014236,0.001117794,0.0017199895,0.0009628774,0.0011124499],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0031936364,0.0011029735,0.0014551551,0.0021676929,0.0017371709,0.0031204089,0.0020866294,0.0016137135,0.01548031],"category_scores_gemma":[0.016861908,0.00050841813,0.0011068175,0.0010099116,0.0034013288,0.0070949774,0.003782202,0.004832858,0.0017606592],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00043411768,0.00008519206,0.001178045,0.000310535,0.000065695785,0.00016087928,0.00019986286,0.014861919,0.006663744,0.95352113,0.004538945,0.01797996],"study_design_scores_gemma":[0.00004101891,0.00008413259,0.0006171945,0.000057500634,0.000036463705,0.00022678851,0.000050999708,0.069252245,0.003924321,0.9177665,0.007899898,0.000042883035],"about_ca_topic_score_codex":0.000284662,"about_ca_topic_score_gemma":0.0004392913,"teacher_disagreement_score":0.01548031,"about_ca_system_score_codex":0.0018740587,"about_ca_system_score_gemma":0.0007342684,"threshold_uncertainty_score":0.05178678},"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":"software","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"software","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008592908,0.00033081474,0.8583666,0.0002502098,0.00012665911,0.00012241745,0.0016066683,0.11226858,0.018335167],"genre_scores_gemma":[0.1911643,0.0008749082,0.7459767,0.0005948428,0.0003364832,0.00081328675,0.007937634,0.01711602,0.03518579],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9989436,0.0001450679,0.00006691665,0.00010720677,0.00057594094,0.00016130334],"domain_scores_gemma":[0.9981298,0.0005367873,0.00010772241,0.00056978466,0.00053999916,0.00011606011],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009379498,0.0008493731,0.00080231065,0.0013301634,0.0010697187,0.0022726257,0.0028563887,0.00069339556,0.028064108],"category_scores_gemma":[0.0048024976,0.0007636368,0.0010134726,0.0021368535,0.0005803652,0.004266038,0.0025729537,0.0021334044,0.016450174],"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.0010043544,0.00025003697,0.0020924022,0.0010459956,0.00009963784,0.00055450015,0.0005349747,0.016923718,0.03194327,0.14451484,0.19105943,0.60997677],"study_design_scores_gemma":[0.0004564175,0.00038727964,0.0018028643,0.00022501044,0.00010715383,0.0011895875,0.00015552907,0.23918468,0.133505,0.13160932,0.49113286,0.00024432296],"about_ca_topic_score_codex":0.0009773234,"about_ca_topic_score_gemma":0.0013606002,"teacher_disagreement_score":0.028064108,"about_ca_system_score_codex":0.00059144443,"about_ca_system_score_gemma":0.0013426086,"threshold_uncertainty_score":0.09388375},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5054777,0.00042082666,0.3722073,0.0005950614,0.000092322334,0.00018738926,0.00094534643,0.0013893015,0.11868466],"genre_scores_gemma":[0.9304967,0.00024090125,0.051614683,0.00014642841,0.000073649266,0.000086642525,0.0007806727,0.00043926723,0.01612112],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.999173,0.00011026775,0.000059929644,0.00017668982,0.00023279634,0.00024733538],"domain_scores_gemma":[0.99789643,0.0007299748,0.00028263655,0.000362212,0.0005075103,0.00022128405],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00085533893,0.00037889482,0.0010291134,0.0014801219,0.0017732421,0.0029050605,0.0010991519,0.00057327177,0.008459787],"category_scores_gemma":[0.0023248186,0.0006553599,0.001008257,0.0012088887,0.0025320337,0.0041332967,0.0018689896,0.001638782,0.003018987],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003425763,0.00005796538,0.0012589904,0.000086675114,0.000020463745,0.00029180685,0.000849985,0.0022514125,0.010692445,0.96848506,0.0014421708,0.014220445],"study_design_scores_gemma":[0.000116872885,0.00018255922,0.0014392635,0.000033196447,0.000050826635,0.00088574825,0.0007777027,0.013205441,0.02071818,0.9467004,0.015831219,0.000058400597],"about_ca_topic_score_codex":0.00069553265,"about_ca_topic_score_gemma":0.0008125098,"teacher_disagreement_score":0.008459787,"about_ca_system_score_codex":0.0008561197,"about_ca_system_score_gemma":0.0008291222,"threshold_uncertainty_score":0.028300762},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0007680506,0.00001094948,0.99873036,0.000013154108,0.000010548969,0.000008950574,0.000006000089,0.00014076,0.00031126125],"genre_scores_gemma":[0.04488425,0.000039282506,0.953964,0.000017553753,0.00002476985,0.000056012435,0.00006184103,0.00012209939,0.00083013205],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993486,0.00013923383,0.0000450409,0.00012805518,0.0002887965,0.000050340757],"domain_scores_gemma":[0.99918777,0.00028246574,0.00006442269,0.00020727038,0.00022091313,0.00003704858],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011517577,0.0006082852,0.0006446003,0.001003351,0.000750359,0.00087613036,0.0010574003,0.0005262924,0.0057459706],"category_scores_gemma":[0.0036156166,0.0003074961,0.0006784491,0.0006250654,0.001080836,0.0017512703,0.0015096723,0.0011364623,0.0017872637],"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.00011711804,0.000051393607,0.00055774016,0.0002036786,0.00003775084,0.000085362815,0.0002023872,0.11545596,0.012892163,0.44790587,0.00295014,0.4195403],"study_design_scores_gemma":[0.000037265603,0.00007975739,0.00018738906,0.000027838554,0.000014984141,0.00015212539,0.000045869838,0.812566,0.007209127,0.1665912,0.013058917,0.00002954913],"about_ca_topic_score_codex":0.00080780336,"about_ca_topic_score_gemma":0.0009635427,"teacher_disagreement_score":0.0057459706,"about_ca_system_score_codex":0.0006438801,"about_ca_system_score_gemma":0.00091527577,"threshold_uncertainty_score":0.0192222},"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3331165,0.007421278,0.26309985,0.010025545,0.00069670496,0.00013369133,0.001196189,0.00044992153,0.3838604],"genre_scores_gemma":[0.9408797,0.002276298,0.018223641,0.0006592071,0.0006686307,0.00012860175,0.00071922556,0.000130337,0.036314327],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9981185,0.00046797798,0.00008545537,0.0003431426,0.00065163313,0.00033323007],"domain_scores_gemma":[0.99512684,0.0029777668,0.00040758654,0.00044220238,0.00049481686,0.0005508044],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0023744171,0.0010408226,0.0014119194,0.0027143762,0.0031222622,0.006600359,0.002110666,0.0020889314,0.013202723],"category_scores_gemma":[0.0063669025,0.00060297677,0.0015923375,0.0022514842,0.0054928316,0.013198883,0.0047178254,0.0065765125,0.0014791201],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003632178,0.000017705535,0.00018906359,0.000039390314,0.0000063652633,0.000028814007,0.00010262831,0.0012381581,0.0002499951,0.99484456,0.0010471332,0.0021998447],"study_design_scores_gemma":[0.000009971085,0.000007978465,0.00015919494,0.000010148595,0.0000087716935,0.00003604886,0.00003687422,0.0048535652,0.00022140531,0.993256,0.0013908695,0.000009296831],"about_ca_topic_score_codex":0.0020290397,"about_ca_topic_score_gemma":0.002354589,"teacher_disagreement_score":0.013202723,"about_ca_system_score_codex":0.0041890014,"about_ca_system_score_gemma":0.0013421918,"threshold_uncertainty_score":0.04416752},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.41137585,0.00016200983,0.47857788,0.0010216453,0.00061780517,0.00016146441,0.00058880646,0.0013041552,0.10619027],"genre_scores_gemma":[0.913346,0.00016653047,0.056096476,0.0003061186,0.00022015613,0.00005149937,0.0005104884,0.00049341284,0.028809246],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99922943,0.000098028184,0.000041185947,0.00014171658,0.00026960234,0.00022010178],"domain_scores_gemma":[0.9988788,0.00020093122,0.00013665883,0.0001927384,0.00038014294,0.00021078004],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00066059356,0.00035311913,0.00043817336,0.00239291,0.0009772507,0.0027298387,0.00054571236,0.00040081184,0.008651994],"category_scores_gemma":[0.0026132006,0.00025174516,0.0005923234,0.0012958044,0.0014754625,0.0024351638,0.0011427145,0.0013850334,0.0017151935],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000668176,0.000065828695,0.00052845303,0.000028084978,0.000009570005,0.00013860581,0.00034694048,0.0014651635,0.005345283,0.9544874,0.003709914,0.03380789],"study_design_scores_gemma":[0.00004392778,0.000075626915,0.00096144987,0.000019732712,0.000017538974,0.00032492704,0.00036524274,0.017855976,0.0047598854,0.9624578,0.013076035,0.00004185175],"about_ca_topic_score_codex":0.0011022252,"about_ca_topic_score_gemma":0.0012304983,"teacher_disagreement_score":0.008651994,"about_ca_system_score_codex":0.0011124982,"about_ca_system_score_gemma":0.0008197188,"threshold_uncertainty_score":0.028943837},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.60035795,0.0020185632,0.22430947,0.0035738149,0.00060887187,0.00017121044,0.00049856474,0.0005586528,0.16790287],"genre_scores_gemma":[0.97092956,0.00052920356,0.015290466,0.0003282786,0.00056398625,0.00006849568,0.00037904351,0.00016539614,0.011745513],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9975707,0.0004881495,0.00020435074,0.00038312442,0.00088533846,0.00046837953],"domain_scores_gemma":[0.98619187,0.008329572,0.0007993388,0.0011839702,0.0020332262,0.001461999],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0045793667,0.0009174402,0.0016979309,0.0043802066,0.0036185312,0.005308455,0.0015875982,0.0014601613,0.008794874],"category_scores_gemma":[0.012439163,0.00078319176,0.0015707054,0.0022659462,0.007088246,0.0122021185,0.004419788,0.005426377,0.0007919741],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006551947,0.000032049524,0.00053149305,0.00003524429,0.000005537088,0.000098314544,0.00032754173,0.00029294056,0.00074303313,0.99443495,0.0004516142,0.0029818239],"study_design_scores_gemma":[0.000015862257,0.000033697685,0.00028105636,0.000017176722,0.00000999288,0.00010110679,0.00013215201,0.0019551395,0.0010433438,0.9945247,0.0018704954,0.000015247848],"about_ca_topic_score_codex":0.0005715959,"about_ca_topic_score_gemma":0.00068210077,"teacher_disagreement_score":0.008794874,"about_ca_system_score_codex":0.0017166628,"about_ca_system_score_gemma":0.00086527044,"threshold_uncertainty_score":0.029421806},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.013364427,0.0010620076,0.834614,0.0011558989,0.0010524158,0.0018555829,0.0026794267,0.092173226,0.052043106],"genre_scores_gemma":[0.13272335,0.0011134957,0.7823145,0.0007823916,0.00034051365,0.0024447418,0.012346761,0.010511024,0.057423256],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99646974,0.0004688249,0.00031213573,0.00049378996,0.0016636511,0.0005918931],"domain_scores_gemma":[0.99786335,0.00036186425,0.000092219154,0.0006488722,0.0007959442,0.00023779018],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021800646,0.0016001299,0.000848666,0.0015298824,0.0009725685,0.0029697546,0.003479381,0.001360461,0.08746994],"category_scores_gemma":[0.0051480588,0.0009702085,0.0013885478,0.0016366366,0.00060868013,0.0038211895,0.0031500568,0.0022771626,0.039750062],"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.0023800076,0.00084391143,0.0022814528,0.0010098993,0.00017057033,0.00093557267,0.0005886127,0.021391386,0.05104831,0.050681215,0.2437682,0.62490094],"study_design_scores_gemma":[0.0011821387,0.001411129,0.0013243075,0.00032829965,0.00018036827,0.000949492,0.0003866615,0.34962153,0.100013256,0.02779167,0.51654583,0.00026531934],"about_ca_topic_score_codex":0.0037014207,"about_ca_topic_score_gemma":0.0024377343,"teacher_disagreement_score":0.08746994,"about_ca_system_score_codex":0.001440102,"about_ca_system_score_gemma":0.002717105,"threshold_uncertainty_score":0.29261607},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.27859968,0.00024934483,0.712499,0.00015474275,0.000038360482,0.00007338643,0.00045678773,0.001202444,0.00672616],"genre_scores_gemma":[0.64930254,0.00015370519,0.34592676,0.000046388683,0.000054343833,0.00006783469,0.0014537985,0.00019596485,0.002798719],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99914396,0.00008164524,0.000042564076,0.00024689315,0.00036168838,0.0001232026],"domain_scores_gemma":[0.99836534,0.0006421626,0.0001763459,0.00028102624,0.00044845464,0.000086594984],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006450222,0.00043446748,0.0006977687,0.0019579206,0.00059447315,0.0014708247,0.0007486876,0.0004082149,0.0022888712],"category_scores_gemma":[0.0037416413,0.00020257357,0.0005665265,0.0010559527,0.0008990446,0.0017169227,0.0011203362,0.0010716675,0.0005368272],"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.00069504866,0.00008869466,0.0078169005,0.00038579086,0.00006600594,0.00043054498,0.0010676772,0.032093354,0.055990092,0.30591878,0.008938749,0.5865084],"study_design_scores_gemma":[0.00012238555,0.0002697368,0.0061669517,0.000108068234,0.00010323327,0.0013083499,0.0006654911,0.49173328,0.06646843,0.40238747,0.030476134,0.00019055785],"about_ca_topic_score_codex":0.0011254926,"about_ca_topic_score_gemma":0.0010830526,"teacher_disagreement_score":0.0022888712,"about_ca_system_score_codex":0.0005868462,"about_ca_system_score_gemma":0.0006920848,"threshold_uncertainty_score":0.007657051},"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":"editorial","genre_gemma":"editorial","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"editorial","genre_consensus":"editorial","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00017605512,0.013592321,0.00063207425,0.043637324,0.9224213,0.000058319125,0.00016715174,0.000092775415,0.019222734],"genre_scores_gemma":[0.0013557004,0.010504534,0.00038054315,0.021407014,0.83657897,0.000070866256,0.0003546061,0.00022925463,0.12911849],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99895006,0.00013877514,0.000115326984,0.0001656577,0.00051166455,0.00011852917],"domain_scores_gemma":[0.9933878,0.001913913,0.00041271836,0.00027235088,0.0027997775,0.0012134193],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015469017,0.002857023,0.0035075862,0.0038035945,0.0023755524,0.006196043,0.001741272,0.006525355,0.10537937],"category_scores_gemma":[0.005865747,0.00058400497,0.001744061,0.0017875886,0.0010670775,0.0050262837,0.0016224958,0.007535724,0.06115853],"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.000034269047,0.000020952422,0.000039545692,0.00016494634,0.000010126239,0.000048228987,0.000008743103,0.000024840507,0.00014854397,0.0011818307,0.9868522,0.01146581],"study_design_scores_gemma":[0.00002428882,0.000057243666,0.00061178324,0.0002256764,0.000025961092,0.00011619131,0.000030861887,0.00015585765,0.00015188522,0.003593382,0.9949941,0.000012850852],"about_ca_topic_score_codex":0.000834854,"about_ca_topic_score_gemma":0.0018538666,"teacher_disagreement_score":0.10537937,"about_ca_system_score_codex":0.0015649669,"about_ca_system_score_gemma":0.0014868737,"threshold_uncertainty_score":0.3525291},"labels":[],"label_agreement":null},{"id":"W2031855337","doi":"10.1090/s0025-5718-07-01935-7","title":"A fast, rigorous technique for computing the regulator of a real quadratic field","year":2007,"lang":"en","type":"article","venue":"Mathematics of Computation","topic":"Polynomial and algebraic computation","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Correctness; Mathematics; Regulator; Computation; Quadratic equation; Field (mathematics); Linear-quadratic regulator; Algorithm; Applied mathematics; Discrete mathematics; Mathematical optimization; Optimal control; Pure mathematics; Geometry","score_opus":0.014460199964147312,"score_gpt":0.27954016659564385,"score_spread":0.2650799666314965,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2031855337","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0016917741,0.00007821964,0.9922436,0.00013780902,0.00007386839,0.000035887766,0.00007594571,0.0017870204,0.003875855],"genre_scores_gemma":[0.053566433,0.0002750022,0.9339249,0.00025818724,0.00019235452,0.00032193848,0.00046575043,0.0027446053,0.00825092],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99871886,0.00031176774,0.000073831456,0.00019620855,0.0005951931,0.0001042019],"domain_scores_gemma":[0.9976307,0.0010996864,0.00012557117,0.0004454998,0.00060398574,0.00009447655],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0029064629,0.001450856,0.0009977291,0.0019185526,0.0008534555,0.0022405356,0.0020221062,0.0009668298,0.01882135],"category_scores_gemma":[0.009458699,0.0005999443,0.0014534628,0.0012050327,0.0016502363,0.0040911073,0.003081866,0.0034873197,0.010551584],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00016909435,0.00011981417,0.00071013655,0.0006068515,0.000094525174,0.00015315233,0.0004537784,0.046418473,0.015994482,0.55860037,0.027653644,0.34902567],"study_design_scores_gemma":[0.00012820594,0.00013632816,0.00033960454,0.00011657764,0.000046926136,0.00017360794,0.00011848666,0.44664624,0.010571203,0.49821788,0.04341246,0.00009255028],"about_ca_topic_score_codex":0.0019626447,"about_ca_topic_score_gemma":0.0026301388,"teacher_disagreement_score":0.01882135,"about_ca_system_score_codex":0.0010409539,"about_ca_system_score_gemma":0.0018378305,"threshold_uncertainty_score":0.062963724},"labels":[],"label_agreement":null},{"id":"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.83940256,0.0010619686,0.08946631,0.00054410216,0.0001627241,0.00008943423,0.00028008033,0.00043723127,0.06855555],"genre_scores_gemma":[0.97091395,0.00051836617,0.020989796,0.00005624461,0.00014238106,0.000082313585,0.00019687919,0.00006259741,0.007037426],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99919206,0.00009510363,0.000054567186,0.00018523433,0.0002842575,0.00018879662],"domain_scores_gemma":[0.9981066,0.0007606076,0.0003605401,0.00027507896,0.0002653851,0.00023188617],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006856969,0.00075808284,0.000503607,0.0019082914,0.0013219486,0.0019784425,0.0006088841,0.0006030164,0.005983157],"category_scores_gemma":[0.0035826627,0.00039056255,0.0007392756,0.0012075704,0.0023171084,0.0034310906,0.0026290256,0.0018242742,0.0011119621],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00051639386,0.000074344265,0.0025446552,0.0002339229,0.000029600349,0.0008135254,0.00085727614,0.021696975,0.018180897,0.892065,0.0023102856,0.060677193],"study_design_scores_gemma":[0.00007809272,0.00028780304,0.0020052544,0.00009356445,0.000031398202,0.00054051995,0.00029611227,0.03890493,0.009054846,0.93239,0.016254757,0.00006284131],"about_ca_topic_score_codex":0.0006721238,"about_ca_topic_score_gemma":0.000619052,"teacher_disagreement_score":0.005983157,"about_ca_system_score_codex":0.0010097019,"about_ca_system_score_gemma":0.00061437325,"threshold_uncertainty_score":0.020015597},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.21433128,0.0011502978,0.69043654,0.004603399,0.00035809856,0.0005192659,0.0004625927,0.0013279085,0.08681072],"genre_scores_gemma":[0.8518338,0.0012231867,0.13261834,0.0008186315,0.0005391939,0.00056409324,0.00054486503,0.0004537531,0.011404122],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9958407,0.0012855348,0.00044562726,0.00056239916,0.0012983087,0.0005673858],"domain_scores_gemma":[0.9701948,0.018841598,0.0011460389,0.003641757,0.0050210063,0.0011548116],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.007881415,0.0007927087,0.0014482347,0.004863707,0.0029696783,0.00482321,0.0032633224,0.0035654467,0.008990105],"category_scores_gemma":[0.047019232,0.00046365912,0.0011514747,0.0039798915,0.0064835465,0.005273031,0.004504767,0.0036207943,0.002668577],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00029222586,0.000059273618,0.0028442685,0.00014062128,0.00003512077,0.00023491426,0.0003982778,0.012954535,0.005314789,0.94693166,0.002075759,0.028718479],"study_design_scores_gemma":[0.00009020725,0.00016685209,0.0012308575,0.00014265573,0.00004079717,0.00037554148,0.00022911356,0.10494001,0.010482052,0.87377536,0.008477256,0.00004934895],"about_ca_topic_score_codex":0.00096721994,"about_ca_topic_score_gemma":0.0005611281,"teacher_disagreement_score":0.008990105,"about_ca_system_score_codex":0.0013865987,"about_ca_system_score_gemma":0.0020285028,"threshold_uncertainty_score":0.04168141},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.14599222,0.000078316036,0.8451035,0.00009978893,0.00002704868,0.00006217617,0.00015228915,0.0028635277,0.005621075],"genre_scores_gemma":[0.56164086,0.0000626433,0.43483597,0.00005658606,0.000027613029,0.000048589733,0.0006136328,0.00021741587,0.0024967263],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995889,0.000056650733,0.000020207744,0.000076146,0.00018270014,0.00007535274],"domain_scores_gemma":[0.99911755,0.00024754513,0.00012648276,0.00029739176,0.00016115887,0.000049916696],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00034305642,0.0005002324,0.0004530715,0.00080829195,0.0004404452,0.0011198816,0.0007282887,0.00031210153,0.002869114],"category_scores_gemma":[0.0024354637,0.000293086,0.00031995523,0.0008398924,0.0007208494,0.0013835924,0.0007570996,0.0004743211,0.0010240942],"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.00055617985,0.00028021075,0.0061871535,0.00021080751,0.00006561801,0.00040264105,0.00030675155,0.21319786,0.09230226,0.15029813,0.00918901,0.52700335],"study_design_scores_gemma":[0.000061928855,0.00015265684,0.00077075633,0.000008821835,0.000011514349,0.000110919864,0.00006191102,0.88315135,0.04196492,0.070366874,0.0033127095,0.000025648618],"about_ca_topic_score_codex":0.0017189917,"about_ca_topic_score_gemma":0.0041332534,"teacher_disagreement_score":0.002869114,"about_ca_system_score_codex":0.0007613483,"about_ca_system_score_gemma":0.0014247932,"threshold_uncertainty_score":0.009598076},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.20847136,0.0027370744,0.6754894,0.004461052,0.0017161987,0.000118148106,0.0005395608,0.0008463985,0.105620705],"genre_scores_gemma":[0.86302465,0.0011053331,0.112234175,0.0011085423,0.0015803552,0.00014875252,0.00044680538,0.00041332142,0.019938199],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99857175,0.00026105164,0.000113483235,0.00040432508,0.0004622829,0.000187207],"domain_scores_gemma":[0.9973182,0.0014075529,0.00018010798,0.00028218902,0.0004913453,0.0003205837],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00254511,0.001052898,0.0018601622,0.0023573337,0.0030038615,0.006300082,0.0021137572,0.0023668185,0.0065862546],"category_scores_gemma":[0.0066573774,0.0009463852,0.0016380931,0.003002394,0.006684338,0.014596488,0.003926634,0.0072456356,0.0011866293],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000027205884,0.000027717375,0.00011155018,0.000032917393,0.000006189338,0.00006764409,0.0002303658,0.00018860797,0.0005665658,0.9920449,0.0009707693,0.0057255263],"study_design_scores_gemma":[0.0000131076185,0.000010514665,0.00005901025,0.000010565687,0.000009347754,0.0000837561,0.000038761737,0.001765712,0.00038807117,0.9957294,0.0018786946,0.000012959099],"about_ca_topic_score_codex":0.00068009563,"about_ca_topic_score_gemma":0.00064886746,"teacher_disagreement_score":0.0065862546,"about_ca_system_score_codex":0.002256956,"about_ca_system_score_gemma":0.0009265799,"threshold_uncertainty_score":0.022033215},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.048360407,0.00024520227,0.94163394,0.00028653603,0.000083723644,0.00015911338,0.00025516417,0.004365617,0.0046102894],"genre_scores_gemma":[0.30021864,0.0002072254,0.69305664,0.00016262532,0.00013861348,0.00019881083,0.0011851294,0.00034144684,0.0044907704],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99898356,0.00013866839,0.00007883714,0.00021929113,0.00039710884,0.0001824177],"domain_scores_gemma":[0.99848074,0.00043380787,0.00013888386,0.00049862935,0.00033816806,0.00010979055],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00087031553,0.00080470106,0.00095601333,0.0016655115,0.0008500002,0.001236008,0.0012647676,0.0006226493,0.0045638666],"category_scores_gemma":[0.004331831,0.0004628515,0.0006902293,0.0019736043,0.0009009874,0.0032984852,0.0031736058,0.0011134503,0.001869566],"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.00055502274,0.00020389083,0.0033820395,0.0002024263,0.000057272566,0.00023977703,0.00034105618,0.02076235,0.023740677,0.065607995,0.013204191,0.87170327],"study_design_scores_gemma":[0.0007322653,0.0010923756,0.0021932407,0.000119883916,0.00012264182,0.0017249823,0.00032265598,0.5378493,0.08279437,0.31645873,0.05644407,0.0001455111],"about_ca_topic_score_codex":0.0010713602,"about_ca_topic_score_gemma":0.001653166,"teacher_disagreement_score":0.0045638666,"about_ca_system_score_codex":0.0007213617,"about_ca_system_score_gemma":0.0017339967,"threshold_uncertainty_score":0.01526767},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.79250604,0.0005236173,0.112062596,0.0012085442,0.00018755224,0.000050029168,0.00025661034,0.00034371135,0.09286139],"genre_scores_gemma":[0.9788396,0.00019373905,0.010989467,0.00010061426,0.00016020167,0.000041764644,0.00016871007,0.00011595019,0.009390073],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99853456,0.00027582725,0.00008770969,0.0002979885,0.0003814425,0.00042251524],"domain_scores_gemma":[0.99755895,0.0012135329,0.0003792773,0.00018849452,0.00029614416,0.00036370644],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013877413,0.0008857201,0.0013730982,0.0038072714,0.004150936,0.005358051,0.0015400684,0.0014317,0.008039989],"category_scores_gemma":[0.004209941,0.00089938386,0.0012496266,0.0021927038,0.005131433,0.008280408,0.0030293784,0.0029109118,0.00072978495],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000041966123,0.000013465856,0.00022359798,0.000008904599,0.000005220704,0.00008078266,0.00017940851,0.00036485185,0.00041980593,0.9972095,0.00024714236,0.0012053899],"study_design_scores_gemma":[0.000015283902,0.00001032635,0.00022996575,0.000007580063,0.000009154548,0.00008994542,0.00018305815,0.0032900902,0.00057897,0.9946818,0.00088807364,0.00001566449],"about_ca_topic_score_codex":0.00170786,"about_ca_topic_score_gemma":0.0018700929,"teacher_disagreement_score":0.008039989,"about_ca_system_score_codex":0.002099831,"about_ca_system_score_gemma":0.0006603367,"threshold_uncertainty_score":0.026896417},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.055896044,0.00025949365,0.9272762,0.00023049137,0.00004204547,0.00010305067,0.00020634805,0.009174074,0.0068122335],"genre_scores_gemma":[0.31805328,0.00017465212,0.6731386,0.000112599046,0.000046118894,0.00013075465,0.00066774274,0.0012243948,0.0064519043],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993647,0.0002373786,0.00002645185,0.000088811255,0.00021967145,0.0000630435],"domain_scores_gemma":[0.9988661,0.0006970611,0.00006227562,0.00020140925,0.00013327022,0.000039960752],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006770539,0.0005018849,0.0005911131,0.00053824205,0.00055690674,0.0008752867,0.0006681936,0.0002872145,0.011387806],"category_scores_gemma":[0.0025514949,0.00029331996,0.0003048277,0.0011443234,0.0004766949,0.0011297108,0.001077248,0.00088692945,0.0017942172],"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.00076157047,0.00024186748,0.0018178932,0.0003390062,0.000040398067,0.00011980527,0.0003352881,0.059381146,0.03336503,0.060184557,0.023617223,0.8197961],"study_design_scores_gemma":[0.00023090732,0.00011284626,0.00054590014,0.000021615337,0.000023510756,0.00007091188,0.000066644156,0.87506914,0.034338415,0.07490132,0.014593486,0.000025360288],"about_ca_topic_score_codex":0.0016179972,"about_ca_topic_score_gemma":0.0049638487,"teacher_disagreement_score":0.011387806,"about_ca_system_score_codex":0.0004731669,"about_ca_system_score_gemma":0.00081204885,"threshold_uncertainty_score":0.03809595},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.23808031,0.00089972647,0.6987769,0.0007885567,0.00022347446,0.0001549822,0.00052111567,0.0009810415,0.059573825],"genre_scores_gemma":[0.7787637,0.00061152293,0.1823664,0.00022226988,0.00015303084,0.000110931374,0.00121915,0.00050814607,0.03604496],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99952364,0.00009692185,0.00002721139,0.00006016225,0.00015413525,0.0001379566],"domain_scores_gemma":[0.99952936,0.00011260408,0.000030135147,0.0001207196,0.00012957474,0.00007762443],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005986411,0.00063944975,0.0008622713,0.0010582377,0.00084222015,0.002040972,0.0006772962,0.00035299343,0.010832838],"category_scores_gemma":[0.0011670153,0.00038964843,0.0007840437,0.000839982,0.0008972671,0.0028516513,0.0020647608,0.0016906698,0.0024841889],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00024655633,0.00012735475,0.00023689958,0.000102322956,0.000022496994,0.00006063203,0.00031817792,0.005356102,0.008792101,0.91323453,0.0056860186,0.06581687],"study_design_scores_gemma":[0.000037843223,0.00003419424,0.000107553096,0.000019018751,0.000017494698,0.000040797488,0.00009221243,0.030728342,0.004259489,0.9574022,0.00724945,0.000011304176],"about_ca_topic_score_codex":0.00072758674,"about_ca_topic_score_gemma":0.0016381807,"teacher_disagreement_score":0.010832838,"about_ca_system_score_codex":0.0008657888,"about_ca_system_score_gemma":0.000754762,"threshold_uncertainty_score":0.036239505},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07409711,0.00033672914,0.8889197,0.00047080067,0.00008152759,0.00019041232,0.0003319267,0.0043620225,0.031209832],"genre_scores_gemma":[0.48739633,0.0006279231,0.4936599,0.00022909668,0.00013210946,0.000117691685,0.0014197796,0.00094039243,0.015476737],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9984534,0.00018840784,0.00007528258,0.00024653669,0.0007337477,0.0003026233],"domain_scores_gemma":[0.9990048,0.0002918908,0.000070903836,0.00042479162,0.00016830387,0.00003941864],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006479001,0.00059183047,0.0010135405,0.00088075275,0.000891291,0.0017913482,0.0012878414,0.0003141584,0.008347335],"category_scores_gemma":[0.0026359027,0.00032019906,0.0012202553,0.0010174342,0.001169923,0.0023776894,0.0026025218,0.0013160269,0.0027442232],"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.00037778268,0.00016310936,0.0014401836,0.00048546854,0.00009466642,0.0005711136,0.001188725,0.03228135,0.035569128,0.37759435,0.013591691,0.53664243],"study_design_scores_gemma":[0.00019497263,0.00024673424,0.0013447492,0.000096672564,0.00023269388,0.0012147749,0.0006750645,0.19922274,0.21180758,0.44184613,0.14300635,0.00011148867],"about_ca_topic_score_codex":0.0012032429,"about_ca_topic_score_gemma":0.001998889,"teacher_disagreement_score":0.008347335,"about_ca_system_score_codex":0.0010091003,"about_ca_system_score_gemma":0.00077205244,"threshold_uncertainty_score":0.027924597},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.31724855,0.00043124755,0.62836313,0.0009199272,0.00022046996,0.00014228522,0.0027122046,0.00096784503,0.04899433],"genre_scores_gemma":[0.9082315,0.0004716758,0.067680895,0.00028914667,0.00018199297,0.00035467552,0.003452408,0.00021934629,0.019118365],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99848783,0.00026905534,0.000115761,0.00038852642,0.00047532443,0.00026346336],"domain_scores_gemma":[0.9963043,0.0017886154,0.00041708347,0.00034500487,0.0007411869,0.00040375508],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008955546,0.00093636266,0.0012307398,0.0012682913,0.0017401925,0.0042063105,0.0011357664,0.0011439404,0.0073423744],"category_scores_gemma":[0.0032243088,0.0007491419,0.0010716149,0.0010020966,0.0024127294,0.0034435487,0.0014206338,0.002419653,0.0014451857],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00037109834,0.0001102354,0.00080252707,0.00011339933,0.000058614292,0.00022116184,0.00021237876,0.013145838,0.0053897593,0.9620151,0.0019980653,0.015561979],"study_design_scores_gemma":[0.000060077586,0.00015699423,0.0005201353,0.000045120647,0.000022436467,0.00023471513,0.0001497638,0.055241514,0.0040280316,0.9347194,0.004773164,0.00004872484],"about_ca_topic_score_codex":0.0010126657,"about_ca_topic_score_gemma":0.0009677187,"teacher_disagreement_score":0.0073423744,"about_ca_system_score_codex":0.0011539216,"about_ca_system_score_gemma":0.0013100604,"threshold_uncertainty_score":0.024562657},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.896012,0.00037337135,0.035478644,0.00036317317,0.00014565777,0.000045639197,0.00012246902,0.00024200397,0.067217015],"genre_scores_gemma":[0.9878941,0.00013826997,0.005997265,0.00005245444,0.00005884639,0.000030264702,0.00009794043,0.000061711144,0.005669063],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99929833,0.000085872234,0.0000649854,0.00012111324,0.00018173033,0.00024789493],"domain_scores_gemma":[0.99888974,0.00040805657,0.0002269622,0.00019805288,0.000106913576,0.00017027369],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00055933336,0.0003781107,0.0005955745,0.0014978024,0.0019468516,0.0029895727,0.00073192874,0.0008507598,0.010010366],"category_scores_gemma":[0.0039144387,0.0005497422,0.0005840787,0.0008752784,0.002524375,0.0029400436,0.0020204904,0.0014572525,0.0011354354],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00017458733,0.000036762205,0.0011587312,0.00006487532,0.000007377003,0.00078540103,0.0006656303,0.0036300041,0.01521663,0.9604334,0.00071500946,0.01711151],"study_design_scores_gemma":[0.000046139037,0.00011927449,0.00067514594,0.00004567227,0.000014965588,0.00080829323,0.00056681724,0.012549189,0.01792976,0.958948,0.008254381,0.00004237115],"about_ca_topic_score_codex":0.0002148015,"about_ca_topic_score_gemma":0.00023766224,"teacher_disagreement_score":0.010010366,"about_ca_system_score_codex":0.0006420329,"about_ca_system_score_gemma":0.00041797885,"threshold_uncertainty_score":0.033487976},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4606786,0.0028602039,0.4152477,0.009981155,0.0005098291,0.00048058358,0.0067917434,0.0050913845,0.098358795],"genre_scores_gemma":[0.79151535,0.0013098513,0.18123887,0.00066222716,0.0007016513,0.00020775557,0.008047607,0.0010680433,0.015248626],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9936923,0.0012527201,0.00052079395,0.0011846323,0.002392806,0.0009568532],"domain_scores_gemma":[0.9327086,0.05730446,0.0018136029,0.004976542,0.0020658348,0.0011308623],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0035835155,0.0012174039,0.0020136395,0.002896624,0.0029812483,0.007444598,0.003336314,0.0017874168,0.026231188],"category_scores_gemma":[0.033191916,0.0007825042,0.0029780823,0.0050198133,0.0036569734,0.01643368,0.0046968604,0.004016877,0.0031487858],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0031828631,0.0006697287,0.010798791,0.0019276085,0.0003507302,0.00071358186,0.0013442927,0.09874232,0.009190544,0.55900836,0.041810807,0.27226037],"study_design_scores_gemma":[0.00020014525,0.000116994124,0.0015106719,0.000084135776,0.00014179786,0.00038433677,0.0002636212,0.13843939,0.00471276,0.84839684,0.0056918883,0.000057475725],"about_ca_topic_score_codex":0.0031586047,"about_ca_topic_score_gemma":0.0064975894,"teacher_disagreement_score":0.026231188,"about_ca_system_score_codex":0.0035581142,"about_ca_system_score_gemma":0.002536963,"threshold_uncertainty_score":0.087752104},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.052892797,0.0011470004,0.93265563,0.00038500153,0.00016424937,0.00006309808,0.00019121631,0.0015457866,0.010955191],"genre_scores_gemma":[0.6042003,0.0010275092,0.3822243,0.00042147946,0.00016001811,0.000063744425,0.00035976348,0.00071657717,0.0108263],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991019,0.00016936849,0.000042373187,0.00017982561,0.00035565018,0.00015093597],"domain_scores_gemma":[0.9982911,0.0006554098,0.000095110794,0.0006385781,0.0002696954,0.000050154104],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000849905,0.0007678355,0.0007463472,0.0008997216,0.00078205025,0.0012911267,0.0008567815,0.00056151696,0.0068255262],"category_scores_gemma":[0.0049458803,0.00027864584,0.0006884391,0.0011307131,0.0015570482,0.0024697715,0.0014416209,0.0010380198,0.0015637922],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000721754,0.00012972139,0.002705015,0.000374705,0.00008974851,0.00040970652,0.00091618835,0.08995119,0.025405861,0.46182546,0.010035935,0.40743476],"study_design_scores_gemma":[0.00014555929,0.00025916597,0.0007334102,0.00012119349,0.000076518336,0.0009216487,0.0002957768,0.31968275,0.056929503,0.5430183,0.077732354,0.00008378144],"about_ca_topic_score_codex":0.0029275543,"about_ca_topic_score_gemma":0.0030825753,"teacher_disagreement_score":0.0068255262,"about_ca_system_score_codex":0.00067795813,"about_ca_system_score_gemma":0.0009993474,"threshold_uncertainty_score":0.022833705},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7837547,0.00046700367,0.123652644,0.0010752906,0.0001996488,0.000077344026,0.0002727355,0.0003908473,0.09010984],"genre_scores_gemma":[0.982395,0.00011535932,0.010056644,0.00012065997,0.00009685173,0.000024910565,0.00009492647,0.000044735145,0.0070509366],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.999577,0.00007713479,0.000023186605,0.000075956086,0.00013851622,0.000108230925],"domain_scores_gemma":[0.9996105,0.00007412507,0.00007870898,0.00006753331,0.00006712538,0.0001020134],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00040209215,0.0003436297,0.00031599886,0.0013222414,0.0008158778,0.0014699894,0.00041762358,0.00036227668,0.0041166176],"category_scores_gemma":[0.0009517237,0.00016495484,0.00049273204,0.0005650844,0.0024615442,0.0022382492,0.0017855088,0.0009478235,0.00031575313],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000023534149,0.00001609804,0.00027659975,0.000013840476,0.0000027916021,0.00017319474,0.00035903454,0.001259822,0.001308598,0.99258596,0.0004440687,0.0035363548],"study_design_scores_gemma":[0.000012161453,0.000031834472,0.00060145307,0.000014585061,0.0000044009626,0.00027061778,0.00023251881,0.013269128,0.0012228873,0.9784505,0.00587283,0.000017127873],"about_ca_topic_score_codex":0.0008498536,"about_ca_topic_score_gemma":0.00054540165,"teacher_disagreement_score":0.0041166176,"about_ca_system_score_codex":0.00092550216,"about_ca_system_score_gemma":0.0003247391,"threshold_uncertainty_score":0.013771474},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.16373052,0.0003157378,0.8306127,0.00043953463,0.000046954592,0.000056080626,0.000111767724,0.00023832868,0.004448309],"genre_scores_gemma":[0.5628695,0.00046125648,0.4229961,0.00015127775,0.00011014553,0.00014646689,0.0003134509,0.00015350302,0.012798307],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.999744,0.00005543416,0.000016301297,0.000060189857,0.00007079556,0.00005324964],"domain_scores_gemma":[0.9987078,0.0009587995,0.00008784772,0.00007100331,0.00011945033,0.00005513136],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009960101,0.0008688113,0.0015606461,0.0005840573,0.00042541776,0.0011157396,0.0010332277,0.0017256086,0.0026640615],"category_scores_gemma":[0.0033801477,0.0004931516,0.00095601426,0.00082855194,0.0008983788,0.0012777938,0.0015068315,0.0014679423,0.00034728472],"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.00015226031,0.0001501007,0.002116365,0.00036690867,0.00007527899,0.0004955365,0.0004913439,0.8317018,0.0121647585,0.09866257,0.0010465627,0.052576497],"study_design_scores_gemma":[0.000037548903,0.00003637477,0.00014583916,0.000009610543,0.000008472811,0.000046797664,0.00005648662,0.96817344,0.0021495898,0.028480148,0.0008430592,0.000012655058],"about_ca_topic_score_codex":0.0028633836,"about_ca_topic_score_gemma":0.0026921353,"teacher_disagreement_score":0.0028633836,"about_ca_system_score_codex":0.00074287766,"about_ca_system_score_gemma":0.0007595392,"threshold_uncertainty_score":0.008912146},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.39962777,0.0025050002,0.3818511,0.014087174,0.0013623893,0.00011133519,0.00061797525,0.0018580408,0.19797927],"genre_scores_gemma":[0.9473789,0.0009066573,0.028627062,0.0009221717,0.00048492904,0.000065749606,0.00053833873,0.00024344219,0.020832812],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9969741,0.00072606653,0.00017127453,0.0007625679,0.0007985172,0.00056741893],"domain_scores_gemma":[0.9928911,0.003657253,0.0005431549,0.0013344132,0.0011536737,0.00042042867],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0024534515,0.0010874999,0.0012681724,0.0012572219,0.0022003434,0.0036810979,0.0017352287,0.0020174223,0.016612167],"category_scores_gemma":[0.02239417,0.000589035,0.0018180332,0.0014564805,0.0064664115,0.010102859,0.0031281286,0.0039260406,0.0028013745],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00011611801,0.000022165337,0.0016389068,0.00010240999,0.000019421022,0.00010261706,0.00042541415,0.0058714547,0.00045295554,0.9789773,0.0037474222,0.008523845],"study_design_scores_gemma":[0.00003952118,0.000071427115,0.0007008284,0.00008532546,0.000024982717,0.00018767762,0.00042226943,0.025739817,0.0009998207,0.9610333,0.0106614325,0.000033672757],"about_ca_topic_score_codex":0.0043464084,"about_ca_topic_score_gemma":0.0019826847,"teacher_disagreement_score":0.016612167,"about_ca_system_score_codex":0.0021798105,"about_ca_system_score_gemma":0.0008077764,"threshold_uncertainty_score":0.055573225},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.003789935,0.00034692005,0.98176736,0.00039545563,0.0003331395,0.0002311184,0.0007949543,0.0077084927,0.00463275],"genre_scores_gemma":[0.056002013,0.0004868405,0.92582756,0.0007870688,0.00028339666,0.0011223499,0.0028662418,0.0030714972,0.009553083],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99337775,0.0014085503,0.001019304,0.0012530838,0.0023697866,0.00057141326],"domain_scores_gemma":[0.9870739,0.002532671,0.00087189116,0.0048683286,0.0039877356,0.0006653702],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005113979,0.0012988193,0.0016999785,0.0023944278,0.0024927051,0.0069105923,0.0044193245,0.0014112418,0.0079275165],"category_scores_gemma":[0.018821642,0.0019314243,0.002535731,0.0040637157,0.0034582596,0.014174831,0.0071137967,0.0051854113,0.007820235],"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.0013186539,0.00021644284,0.0027087226,0.0008625375,0.00014865743,0.00036509635,0.0012199702,0.0093331635,0.011498743,0.53253525,0.076050825,0.36374193],"study_design_scores_gemma":[0.00033404992,0.00061062374,0.0007038558,0.00031645823,0.00013100186,0.0008730346,0.00029498505,0.07372811,0.07745972,0.263563,0.58165723,0.00032798425],"about_ca_topic_score_codex":0.0022456197,"about_ca_topic_score_gemma":0.0021588625,"teacher_disagreement_score":0.0079275165,"about_ca_system_score_codex":0.0021107732,"about_ca_system_score_gemma":0.0042817323,"threshold_uncertainty_score":0.027045608},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3195038,0.0011039831,0.42778513,0.0014147407,0.0011870578,0.00023958091,0.0006548382,0.0021834583,0.24592748],"genre_scores_gemma":[0.8675815,0.0011859845,0.07408727,0.0004000404,0.00083261717,0.000102928345,0.0007192553,0.00043130532,0.054659076],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995067,0.00007918685,0.000025262085,0.00011106216,0.00014359741,0.0001341592],"domain_scores_gemma":[0.9991547,0.00029535836,0.00010077249,0.00020393329,0.00012753726,0.0001176625],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00044817288,0.0006805135,0.00050234655,0.0007823771,0.0007588081,0.0013419369,0.00041592596,0.0004107348,0.019645229],"category_scores_gemma":[0.0018866064,0.00028572953,0.00046051416,0.00070965046,0.001117384,0.0024587451,0.0017169971,0.0013952798,0.0035611535],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002183266,0.00011304881,0.0005184735,0.00017686177,0.000022730528,0.00033817184,0.00040709137,0.0041682976,0.012984095,0.8906708,0.008681523,0.08170061],"study_design_scores_gemma":[0.000037184967,0.0001220727,0.00017011982,0.000045108874,0.0000139503745,0.00025960788,0.00011734769,0.014987086,0.011958809,0.95616525,0.016104547,0.000018946635],"about_ca_topic_score_codex":0.0004801121,"about_ca_topic_score_gemma":0.00091200345,"teacher_disagreement_score":0.019645229,"about_ca_system_score_codex":0.0003782232,"about_ca_system_score_gemma":0.00056702323,"threshold_uncertainty_score":0.0657199},"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":"software","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"software","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00843213,0.001031855,0.7865816,0.0010618764,0.00034765343,0.0008214372,0.0142211765,0.054060295,0.13344194],"genre_scores_gemma":[0.14841674,0.0019817823,0.66981936,0.002003287,0.0008278203,0.0022520928,0.042406842,0.022886198,0.10940585],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9981395,0.00026689898,0.00014838655,0.0003738449,0.0007940504,0.00027732967],"domain_scores_gemma":[0.99820113,0.0006038048,0.00011849849,0.00035485378,0.0005987087,0.00012301966],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015025731,0.0010528709,0.0011209288,0.0017633723,0.0014096824,0.00289385,0.002524711,0.0009961752,0.09021201],"category_scores_gemma":[0.004288184,0.0008874189,0.0019910804,0.0020197239,0.0012297092,0.0035535456,0.002969526,0.0033784762,0.058757223],"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.0004947501,0.00033394326,0.0015308611,0.0013043878,0.00006460871,0.0002777219,0.00072169566,0.0053233155,0.008560897,0.5397324,0.17061028,0.27104524],"study_design_scores_gemma":[0.0001287722,0.0000966825,0.00070178113,0.00013580447,0.0000449726,0.0006571843,0.00010689996,0.021255644,0.014662473,0.4048525,0.5572916,0.00006562542],"about_ca_topic_score_codex":0.0014476149,"about_ca_topic_score_gemma":0.0014432487,"teacher_disagreement_score":0.09021201,"about_ca_system_score_codex":0.0013077211,"about_ca_system_score_gemma":0.0022118303,"threshold_uncertainty_score":0.30178928},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011914599,0.0034697575,0.94495165,0.0013497295,0.00035399015,0.00013279455,0.00024122957,0.0051900344,0.032396257],"genre_scores_gemma":[0.2732733,0.0031198876,0.7097268,0.0007137705,0.0005953649,0.0002926047,0.00065853767,0.001410107,0.010209606],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99589807,0.0010312549,0.00021874897,0.0006870702,0.0017887107,0.00037605016],"domain_scores_gemma":[0.98720574,0.0058441176,0.00033519324,0.004471042,0.0018106427,0.00033319206],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0026966494,0.0012365433,0.0014681532,0.0018217518,0.0017300525,0.006220977,0.0041540675,0.002010125,0.03602001],"category_scores_gemma":[0.019021248,0.0010878671,0.0010833658,0.0037609502,0.0025008223,0.01160342,0.0034551583,0.0039604036,0.009432795],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005941585,0.00013432253,0.0009220841,0.0005971545,0.000053528092,0.000096723335,0.00036987753,0.017212605,0.0041354964,0.47735772,0.023730416,0.47479597],"study_design_scores_gemma":[0.00014130105,0.00015625257,0.00020389151,0.00030784422,0.000046654386,0.00029579806,0.00023190556,0.14449477,0.008596056,0.7996121,0.04584536,0.000068182395],"about_ca_topic_score_codex":0.0022051896,"about_ca_topic_score_gemma":0.0034869567,"teacher_disagreement_score":0.03602001,"about_ca_system_score_codex":0.0025068878,"about_ca_system_score_gemma":0.0027152526,"threshold_uncertainty_score":0.120498955},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.023787368,0.00022505003,0.9619853,0.00020410625,0.00011297107,0.00016557093,0.00037034054,0.0027041815,0.010445104],"genre_scores_gemma":[0.23755787,0.00028015944,0.75213444,0.00014838317,0.000077266726,0.00025218405,0.0021886595,0.0005793977,0.0067816963],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990194,0.00018645935,0.000088972214,0.00019115856,0.00029793792,0.00021602926],"domain_scores_gemma":[0.9965436,0.0016948638,0.00014846584,0.00071309286,0.0007151264,0.00018483074],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011761637,0.0011405548,0.0010526512,0.0014711084,0.001144313,0.0025472064,0.0018284075,0.0008817944,0.020822197],"category_scores_gemma":[0.007007956,0.0005945601,0.0013617942,0.0022519703,0.00094094424,0.0034165208,0.0025143248,0.0022964168,0.0045835027],"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.0007883709,0.00033470555,0.0017449955,0.00051253283,0.00010308594,0.00014374962,0.00046970753,0.10049866,0.008123822,0.20306793,0.023595387,0.6606171],"study_design_scores_gemma":[0.00017818503,0.00011577837,0.00028210864,0.000058742935,0.000059301194,0.000086812375,0.00024794895,0.6724374,0.006651343,0.31173787,0.008111553,0.00003285954],"about_ca_topic_score_codex":0.004809504,"about_ca_topic_score_gemma":0.013461999,"teacher_disagreement_score":0.020822197,"about_ca_system_score_codex":0.0016186568,"about_ca_system_score_gemma":0.0019813492,"threshold_uncertainty_score":0.06965721},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06834289,0.0011699253,0.90300876,0.003383648,0.0003196727,0.00045736547,0.00068268547,0.0037858617,0.018849183],"genre_scores_gemma":[0.8278608,0.0008784693,0.16149926,0.0010117728,0.00036071704,0.00025240387,0.0014169917,0.00069606263,0.006023584],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.98255354,0.007182772,0.0009866445,0.002702955,0.004040933,0.0025330356],"domain_scores_gemma":[0.89980775,0.081292436,0.002074462,0.011166353,0.004782161,0.00087684416],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.009894003,0.0017434483,0.0025712936,0.0023704276,0.0025282898,0.0056924266,0.00503564,0.0028169642,0.010370442],"category_scores_gemma":[0.07458779,0.0018782546,0.004014135,0.0027421634,0.0073836693,0.015214676,0.008822781,0.0053964118,0.0013222598],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0021934514,0.0004678892,0.0054516154,0.0011938734,0.00041346852,0.0006328455,0.0010830769,0.24339794,0.007485867,0.56617767,0.012103586,0.15939887],"study_design_scores_gemma":[0.00017304797,0.00010407726,0.0006307121,0.00009618682,0.00013834388,0.00008869871,0.00014830401,0.46597272,0.005225178,0.5244371,0.0029364475,0.000049143728],"about_ca_topic_score_codex":0.01170761,"about_ca_topic_score_gemma":0.009975066,"teacher_disagreement_score":0.01170761,"about_ca_system_score_codex":0.0043651913,"about_ca_system_score_gemma":0.008315601,"threshold_uncertainty_score":0.05232507},"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":"software","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"software","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00094495795,0.00023823055,0.96214586,0.00030044795,0.00015597013,0.000094463634,0.00216461,0.019097913,0.014857581],"genre_scores_gemma":[0.020543069,0.00044134166,0.9416192,0.00027575818,0.00017949917,0.0006812419,0.0041183573,0.011626834,0.020514695],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99894863,0.00021148102,0.00006325889,0.0001572178,0.0005462983,0.00007306658],"domain_scores_gemma":[0.9980876,0.0008780251,0.00010305196,0.0003669082,0.0004928554,0.00007161281],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011511199,0.0017761084,0.0014143606,0.001422424,0.0010053335,0.0019045469,0.0020292453,0.001233872,0.12228794],"category_scores_gemma":[0.0054896805,0.000997837,0.0015399181,0.0011947289,0.00077411265,0.0021185745,0.0033102809,0.0033736434,0.03701022],"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.000099066376,0.0001016816,0.00092880573,0.0012141536,0.00015425452,0.0003206532,0.0004896372,0.04135973,0.006343874,0.2706718,0.32396373,0.35435262],"study_design_scores_gemma":[0.0001644889,0.000054672,0.00053130515,0.00019050963,0.000049389866,0.0005873667,0.00015824153,0.3539547,0.006639184,0.24639961,0.39118183,0.00008876461],"about_ca_topic_score_codex":0.0026198619,"about_ca_topic_score_gemma":0.0061558587,"teacher_disagreement_score":0.12228794,"about_ca_system_score_codex":0.00050833117,"about_ca_system_score_gemma":0.0013763012,"threshold_uncertainty_score":0.40909386},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.74477077,0.001689461,0.11059608,0.009047946,0.0014022388,0.00011220258,0.00028336878,0.00029702316,0.13180092],"genre_scores_gemma":[0.9381478,0.00051798584,0.015923372,0.0005590554,0.0005175869,0.0000667263,0.0001820538,0.00018074579,0.043904748],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990476,0.00025844533,0.000046967205,0.00015992939,0.00020961041,0.00027750497],"domain_scores_gemma":[0.9982169,0.0007828875,0.00017289947,0.00024414004,0.00024436135,0.00033869056],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018283199,0.00096417184,0.0015599821,0.0023315307,0.004196589,0.0036421053,0.0019312294,0.002703064,0.011301216],"category_scores_gemma":[0.0076907873,0.00073150825,0.0013716298,0.0016355031,0.005341102,0.0077951415,0.0033753563,0.0042232014,0.0011521445],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000052981497,0.00002037022,0.00015733464,0.000017977,0.0000054104135,0.00007198546,0.00028794346,0.00053627224,0.00033639406,0.99483395,0.0009942907,0.0026849536],"study_design_scores_gemma":[0.000019982072,0.000011859135,0.00010791065,0.000008008352,0.000004031867,0.000048146583,0.00015747981,0.003265204,0.00021268018,0.99431795,0.0018335131,0.000013318041],"about_ca_topic_score_codex":0.00506715,"about_ca_topic_score_gemma":0.0039672996,"teacher_disagreement_score":0.011301216,"about_ca_system_score_codex":0.002359501,"about_ca_system_score_gemma":0.0013776388,"threshold_uncertainty_score":0.037806332},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8715467,0.0014698543,0.060045406,0.005736132,0.00008520654,0.000023305014,0.00046632334,0.00016191875,0.06046528],"genre_scores_gemma":[0.9897696,0.0005612507,0.0032182375,0.00014627074,0.00018564302,0.000028211303,0.00017161576,0.000021758153,0.0058974503],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99938536,0.00019047216,0.000019894178,0.000108592576,0.00017224603,0.00012342255],"domain_scores_gemma":[0.9949163,0.0035758994,0.00052058435,0.00019641525,0.00031771767,0.00047303515],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011875214,0.0004986744,0.000814303,0.0016528063,0.001827214,0.0041418,0.001005503,0.000783854,0.0048159813],"category_scores_gemma":[0.008379522,0.0006504838,0.00043301168,0.0021310637,0.004999629,0.005742659,0.0014873622,0.0029675823,0.00029140507],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000064266314,0.000025725667,0.001275398,0.000026680345,0.000006576923,0.00005018506,0.0002308944,0.0025625837,0.0002801349,0.9913577,0.0010112005,0.0031086376],"study_design_scores_gemma":[0.000016842883,0.000006764809,0.00071156083,0.0000062605136,0.0000043137497,0.000060195493,0.00006103187,0.007950809,0.00013298017,0.99013805,0.0009016245,0.000009612477],"about_ca_topic_score_codex":0.0027471858,"about_ca_topic_score_gemma":0.0032437795,"teacher_disagreement_score":0.0048159813,"about_ca_system_score_codex":0.0025026726,"about_ca_system_score_gemma":0.0010374952,"threshold_uncertainty_score":0.018158317},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.95395184,0.0002317308,0.029296992,0.00020885319,0.000024765684,0.000022754266,0.00010028706,0.00017773517,0.015985012],"genre_scores_gemma":[0.99434495,0.00011620512,0.0030624731,0.000015003672,0.00003066607,0.000013956049,0.00011421373,0.000033639484,0.0022688846],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99883646,0.00015143519,0.00007310109,0.00015150613,0.00044227854,0.0003452411],"domain_scores_gemma":[0.99818134,0.0006751674,0.0002900174,0.00028039757,0.00021335123,0.0003597692],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007608863,0.00045639265,0.0008465081,0.0027258005,0.0019995968,0.0037384648,0.00087872247,0.000775285,0.006265771],"category_scores_gemma":[0.0038142384,0.0004524519,0.00088317087,0.0016268874,0.004363519,0.003781227,0.0043919883,0.0024116302,0.00038842604],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001529827,0.000065126434,0.009740466,0.000102232894,0.000032330874,0.00071208086,0.0017266293,0.013495258,0.004680804,0.96013933,0.00072557165,0.008427183],"study_design_scores_gemma":[0.000054917124,0.00016503749,0.012189086,0.000081775564,0.00009084021,0.0017410475,0.002503964,0.06476042,0.0077454415,0.8972952,0.013272257,0.00010001909],"about_ca_topic_score_codex":0.0016795357,"about_ca_topic_score_gemma":0.0009671302,"teacher_disagreement_score":0.006265771,"about_ca_system_score_codex":0.0014667448,"about_ca_system_score_gemma":0.00033989962,"threshold_uncertainty_score":0.020961046},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13106063,0.00022806671,0.84707063,0.00030946278,0.00007838515,0.000042313495,0.0003418812,0.004012424,0.016856162],"genre_scores_gemma":[0.49551642,0.00020689158,0.4979198,0.000061853985,0.00004272691,0.000064714506,0.00047981358,0.00036198442,0.0053459276],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9998338,0.000031032887,0.000010223611,0.00002451801,0.000065818655,0.00003456895],"domain_scores_gemma":[0.9997241,0.00009390497,0.000016384747,0.00007949936,0.000063406296,0.00002276648],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00019403287,0.00040771806,0.00053349044,0.00034507122,0.0004236448,0.0007245382,0.00073083653,0.00042071159,0.0053693103],"category_scores_gemma":[0.00095673685,0.00022072397,0.00035302842,0.0007692746,0.0003216603,0.0005988174,0.0007099708,0.00057437655,0.0009568836],"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.00031588977,0.0001600666,0.0032470445,0.00029387747,0.00008904231,0.00064194005,0.00040226846,0.5432765,0.044352334,0.07410911,0.012866866,0.3202452],"study_design_scores_gemma":[0.000049141778,0.00003427735,0.00033291843,0.000009403888,0.0000071065683,0.000083416184,0.00003494088,0.97533005,0.0073262597,0.010214208,0.0065691276,0.000009045002],"about_ca_topic_score_codex":0.005284128,"about_ca_topic_score_gemma":0.008301752,"teacher_disagreement_score":0.0053693103,"about_ca_system_score_codex":0.00032959765,"about_ca_system_score_gemma":0.00066659396,"threshold_uncertainty_score":0.017962098},"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.20955886,0.028544854,0.29739824,0.09307404,0.00415157,0.000091707465,0.0014695682,0.0004617909,0.36524943],"genre_scores_gemma":[0.8968232,0.008962015,0.03746866,0.0031338416,0.0045525,0.00014312725,0.00096633565,0.00019144398,0.047758933],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9984957,0.00060177373,0.00008777171,0.00025940133,0.00036227508,0.00019302624],"domain_scores_gemma":[0.9939229,0.0042776424,0.00038818017,0.0004892215,0.00059416186,0.00032781172],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0035251451,0.0004993841,0.0006714663,0.0023837097,0.0022935583,0.0047453283,0.00092381594,0.0016417025,0.009270719],"category_scores_gemma":[0.00888994,0.00035415668,0.0006434771,0.0025037704,0.0055011446,0.012104393,0.002866293,0.0038174503,0.0009431622],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000079672345,0.0000043526848,0.00009684332,0.000031234395,0.0000020778998,0.000024521674,0.00012500181,0.00037038015,0.00012802205,0.992577,0.0032443695,0.0033881585],"study_design_scores_gemma":[0.000003617358,0.0000037256066,0.00014679076,0.000021072285,0.000002401925,0.00005330838,0.00009588063,0.00085716945,0.00014397985,0.98697215,0.011692967,0.000006943344],"about_ca_topic_score_codex":0.0011086288,"about_ca_topic_score_gemma":0.0008916788,"teacher_disagreement_score":0.009270719,"about_ca_system_score_codex":0.0026228214,"about_ca_system_score_gemma":0.00080610934,"threshold_uncertainty_score":0.031013668},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5861562,0.0024871896,0.13011317,0.001254204,0.00022402045,0.000089856316,0.0007070018,0.0002334685,0.27873486],"genre_scores_gemma":[0.9676821,0.0012796891,0.011937983,0.00009771968,0.00016737594,0.00003975845,0.00032032558,0.00008286365,0.018392287],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9996803,0.0000415237,0.000017808185,0.000076371805,0.00009695794,0.00008706535],"domain_scores_gemma":[0.9995521,0.00007872982,0.00010870167,0.000079972684,0.000086350694,0.00009418495],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00031799986,0.00046500535,0.00033789568,0.0017897256,0.0014888331,0.0018805929,0.00049259816,0.00035081315,0.008538363],"category_scores_gemma":[0.0009832254,0.00022494016,0.0004634572,0.0014187071,0.0023932322,0.0045625605,0.0017903656,0.0013832025,0.00080605404],"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.0000055287005,0.0000046225664,0.00063323823,0.000022348124,0.0000030709964,0.000063298394,0.00033603443,0.0007794034,0.0008037959,0.99374044,0.0003643829,0.0032438557],"study_design_scores_gemma":[0.0000066207103,0.000025184672,0.001565801,0.000037061745,0.000010130204,0.00063762267,0.0009443825,0.003925679,0.0018523637,0.95099294,0.039980542,0.000021723117],"about_ca_topic_score_codex":0.00077830476,"about_ca_topic_score_gemma":0.0005703094,"teacher_disagreement_score":0.008538363,"about_ca_system_score_codex":0.00090033,"about_ca_system_score_gemma":0.0003534211,"threshold_uncertainty_score":0.028563678},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.004368246,0.0014077384,0.9888177,0.0004067272,0.00008820394,0.00004007173,0.000021750355,0.00038615207,0.004463362],"genre_scores_gemma":[0.0926453,0.0051233396,0.8961625,0.00020567072,0.0003550487,0.00028571277,0.00012244812,0.0003413469,0.004758632],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9985555,0.00040182183,0.00006006134,0.00016405825,0.0007075073,0.000111016685],"domain_scores_gemma":[0.99809474,0.0010430062,0.00015899571,0.00037913668,0.00028188026,0.00004229258],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016992505,0.0013093881,0.0006907142,0.0010750766,0.000652856,0.0013253979,0.001127834,0.00078417786,0.0039936434],"category_scores_gemma":[0.006083992,0.0004930482,0.001125692,0.0017167904,0.0019339527,0.0030588547,0.0014652286,0.002136576,0.0016015673],"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.00007112505,0.00006678133,0.00044253463,0.0004794853,0.00007879509,0.00006481675,0.00022631878,0.122010626,0.007456063,0.5919344,0.005193788,0.2719753],"study_design_scores_gemma":[0.00009099599,0.0001028313,0.00026474008,0.00010918363,0.00004912959,0.000121304794,0.000059818107,0.42344445,0.010243118,0.5310277,0.034447473,0.00003933592],"about_ca_topic_score_codex":0.0008856395,"about_ca_topic_score_gemma":0.00096881326,"teacher_disagreement_score":0.0039936434,"about_ca_system_score_codex":0.0009129446,"about_ca_system_score_gemma":0.0014878184,"threshold_uncertainty_score":0.0133600235},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.57172513,0.00011045288,0.41090304,0.00075287774,0.00019643886,0.00009194247,0.00067888974,0.0012714231,0.014269721],"genre_scores_gemma":[0.8833609,0.000071979564,0.10461646,0.00013471364,0.00012155747,0.000042952648,0.0007240491,0.00027498516,0.010652378],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992607,0.00014759567,0.000033513392,0.00015479152,0.00027653557,0.00012696668],"domain_scores_gemma":[0.99832994,0.00072769594,0.00015809653,0.00028521713,0.00032577105,0.00017343152],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010324459,0.0006278788,0.00081042165,0.000981826,0.0007591264,0.0022032452,0.0010408489,0.0010249023,0.010032117],"category_scores_gemma":[0.005281003,0.00044915744,0.00054480776,0.0008951758,0.0011880983,0.0037528097,0.0014069008,0.0015612191,0.0017415001],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0016566147,0.000781097,0.007566888,0.0003148285,0.00010726322,0.00086181937,0.0009700998,0.05894682,0.057202883,0.6940848,0.015198874,0.16230792],"study_design_scores_gemma":[0.00014851497,0.00028375775,0.0013467603,0.00003538193,0.000026576474,0.0004149497,0.00045928618,0.3867583,0.023860915,0.58079714,0.0057924464,0.00007606207],"about_ca_topic_score_codex":0.000682891,"about_ca_topic_score_gemma":0.0021011294,"teacher_disagreement_score":0.010032117,"about_ca_system_score_codex":0.0005530055,"about_ca_system_score_gemma":0.0008340048,"threshold_uncertainty_score":0.033560753},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5332248,0.001946199,0.2677781,0.0012653692,0.0004603458,0.00013676795,0.00069600187,0.00062134984,0.193871],"genre_scores_gemma":[0.922588,0.0009097213,0.051256593,0.00027370406,0.0003019207,0.00016899736,0.000830274,0.00012013516,0.023550665],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99941015,0.00013049676,0.000029077111,0.00006575935,0.00019324134,0.00017131308],"domain_scores_gemma":[0.99934846,0.00011537914,0.0000926416,0.00011385737,0.00015829918,0.00017131132],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007649667,0.00043241915,0.000585869,0.0013282709,0.0013308243,0.0021872127,0.0006118961,0.00040539211,0.006428611],"category_scores_gemma":[0.0014887659,0.0003465581,0.000435664,0.0011101781,0.0012879494,0.002063318,0.001686823,0.0014192247,0.0022599623],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005704969,0.000025451911,0.00016726374,0.000028611685,0.000004377012,0.000040542767,0.00015943515,0.00083931827,0.002068641,0.9858517,0.0012721024,0.009485409],"study_design_scores_gemma":[0.000029089417,0.000054669203,0.00030146018,0.000021907394,0.0000075227567,0.0000939446,0.00019151361,0.005299909,0.0037496008,0.97781277,0.012416581,0.000020995125],"about_ca_topic_score_codex":0.00045539121,"about_ca_topic_score_gemma":0.00066404504,"teacher_disagreement_score":0.006428611,"about_ca_system_score_codex":0.00073195033,"about_ca_system_score_gemma":0.0006756706,"threshold_uncertainty_score":0.021505833},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.20769317,0.00015808262,0.7813511,0.00022023563,0.000060020568,0.00009603652,0.0005061911,0.0020817989,0.007833405],"genre_scores_gemma":[0.57905996,0.00011102707,0.41428682,0.00009308651,0.00003958539,0.00012753108,0.0017193495,0.0004680907,0.0040946114],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993298,0.00010260433,0.000049168346,0.00010941648,0.0002618075,0.00014719302],"domain_scores_gemma":[0.99909234,0.00030020124,0.000056110195,0.0002219157,0.00025569176,0.00007373999],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004513332,0.0004914782,0.00062127324,0.00074093626,0.0006222791,0.00085414003,0.00077551627,0.00035911676,0.0071222754],"category_scores_gemma":[0.002510816,0.00031006197,0.00061334827,0.00050001097,0.0006118684,0.0019033444,0.0018287173,0.0006420558,0.0017142148],"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.0014950024,0.00028019806,0.0049608564,0.0005071912,0.0000971622,0.0004311341,0.00059445715,0.07214099,0.09995527,0.2921923,0.011192894,0.5161526],"study_design_scores_gemma":[0.00013914579,0.0003017097,0.0010576225,0.000058910005,0.000030266832,0.00030711014,0.00042351198,0.43485838,0.0956164,0.45457017,0.012565835,0.00007101466],"about_ca_topic_score_codex":0.0007024224,"about_ca_topic_score_gemma":0.0013162456,"teacher_disagreement_score":0.0071222754,"about_ca_system_score_codex":0.00045976345,"about_ca_system_score_gemma":0.0011021827,"threshold_uncertainty_score":0.02382642},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.111888394,0.00053303584,0.8801609,0.00018737801,0.00008226399,0.00006921136,0.00014163335,0.0011871931,0.005749918],"genre_scores_gemma":[0.3980096,0.00061834947,0.59548753,0.000110005494,0.00019403288,0.00011655142,0.00083356973,0.00028196277,0.004348365],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99850816,0.00031280352,0.00011066091,0.0003631762,0.00049079425,0.00021437698],"domain_scores_gemma":[0.9968298,0.001442643,0.00031194495,0.00077000086,0.00052568194,0.00011989205],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016603416,0.0010317084,0.0012499671,0.0020129546,0.0010450627,0.0017663555,0.0010273013,0.00060367485,0.004307923],"category_scores_gemma":[0.008887025,0.00035672518,0.0006163101,0.0027270697,0.0014511317,0.006245359,0.002612137,0.0010121192,0.0018359447],"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.000820329,0.00017470478,0.0048149563,0.00031877318,0.000068005356,0.0004385454,0.0005188697,0.1053986,0.015872657,0.28430355,0.0054803547,0.5817906],"study_design_scores_gemma":[0.00015245602,0.00039154335,0.0008718248,0.00007581219,0.00004685836,0.0006624882,0.00022524556,0.50338763,0.028727176,0.44962543,0.01576786,0.00006561518],"about_ca_topic_score_codex":0.0011175771,"about_ca_topic_score_gemma":0.0011689578,"teacher_disagreement_score":0.004307923,"about_ca_system_score_codex":0.0007719694,"about_ca_system_score_gemma":0.0010353082,"threshold_uncertainty_score":0.014411449},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5978802,0.0026526696,0.21964507,0.010324621,0.0011917448,0.00012999284,0.0008640751,0.00059287384,0.16671881],"genre_scores_gemma":[0.9445251,0.0018313377,0.020873098,0.00046523567,0.0009984238,0.00007841163,0.00040039365,0.00020610538,0.03062197],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99921596,0.00018724239,0.000036751524,0.00015009893,0.00023019283,0.0001796742],"domain_scores_gemma":[0.99905246,0.00034043874,0.00013191566,0.00016852375,0.00012722613,0.00017938031],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007217306,0.00075117894,0.0008286463,0.002639434,0.0024368393,0.003466639,0.0008978786,0.0009525238,0.012001966],"category_scores_gemma":[0.0023171953,0.0005520481,0.0009053111,0.0028268478,0.004318371,0.008485741,0.0038332916,0.004104517,0.0010486955],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010540934,0.0000068219124,0.00007603251,0.000014020074,0.0000024361866,0.000022375018,0.00018738053,0.0003804941,0.00017686875,0.9959512,0.00056366,0.0026083393],"study_design_scores_gemma":[0.000006595402,0.000004948479,0.00007328512,0.000005547237,0.0000032329265,0.000028712797,0.000082028484,0.0009954901,0.00016371369,0.9959252,0.002705886,0.0000053889435],"about_ca_topic_score_codex":0.0017051842,"about_ca_topic_score_gemma":0.0015329103,"teacher_disagreement_score":0.012001966,"about_ca_system_score_codex":0.001701218,"about_ca_system_score_gemma":0.00069301605,"threshold_uncertainty_score":0.040150583},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2378205,0.0010195693,0.6785197,0.0011992195,0.0005052397,0.00011279907,0.0004520775,0.00067683274,0.07969406],"genre_scores_gemma":[0.8693169,0.00068039907,0.10901694,0.00033623754,0.00018881228,0.00007628953,0.00059584324,0.00023377326,0.019554777],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99947447,0.00014560013,0.00002465906,0.00005743265,0.0002058092,0.00009213957],"domain_scores_gemma":[0.9982889,0.0008162249,0.00011036579,0.00040689352,0.00026293934,0.00011468874],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007972456,0.00050897186,0.00072663807,0.0011134455,0.00091201696,0.0017050293,0.0007547292,0.0006338312,0.011242276],"category_scores_gemma":[0.0059207045,0.0002692149,0.00041562275,0.0015743221,0.0015803364,0.0029923553,0.0018165965,0.0014367398,0.0011819669],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001839767,0.00004204228,0.00062384765,0.00005819784,0.000011873213,0.000080193386,0.00028673885,0.02086139,0.0013383455,0.921636,0.0049242587,0.049953133],"study_design_scores_gemma":[0.000012936257,0.00002356071,0.00012807605,0.000019552903,0.000006599114,0.000046771816,0.00014546547,0.117010154,0.0006331716,0.87870896,0.0032555202,0.000009223076],"about_ca_topic_score_codex":0.0018643368,"about_ca_topic_score_gemma":0.00337057,"teacher_disagreement_score":0.011242276,"about_ca_system_score_codex":0.00070008036,"about_ca_system_score_gemma":0.0003940424,"threshold_uncertainty_score":0.03760916},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2019485,0.0003980157,0.7721696,0.000402679,0.00010119259,0.00021528603,0.0017441139,0.0048879604,0.018132593],"genre_scores_gemma":[0.6165655,0.00021352552,0.36686668,0.00015335142,0.00008782219,0.0001319975,0.003506286,0.00050674763,0.011968001],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993759,0.00009021136,0.000028561546,0.00019088932,0.00016620963,0.00014823014],"domain_scores_gemma":[0.9987243,0.00030591458,0.00009247926,0.0004451402,0.00028455234,0.00014759395],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005447662,0.0005204721,0.000580714,0.0005357484,0.00044964813,0.0010103596,0.0005335245,0.00025608382,0.008038194],"category_scores_gemma":[0.0025652277,0.00022402129,0.00045466665,0.00048998394,0.0005873865,0.001633243,0.0013550222,0.0009064552,0.0023289553],"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.0016061155,0.00039288693,0.0036800464,0.0006760522,0.0000712617,0.00056275015,0.0006403572,0.06963397,0.05767654,0.29146224,0.034300804,0.5392969],"study_design_scores_gemma":[0.00019263176,0.0005050932,0.002678178,0.00007591517,0.000028514329,0.00086844945,0.0004332541,0.4973216,0.077815786,0.37588432,0.044092555,0.00010380195],"about_ca_topic_score_codex":0.0015456385,"about_ca_topic_score_gemma":0.0024624413,"teacher_disagreement_score":0.008038194,"about_ca_system_score_codex":0.00063178694,"about_ca_system_score_gemma":0.0014814707,"threshold_uncertainty_score":0.026890457},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10454675,0.0006761895,0.77539164,0.00084670604,0.00072758493,0.00032699478,0.0009786368,0.002159435,0.11434606],"genre_scores_gemma":[0.71625817,0.0007331153,0.22734825,0.000520368,0.0003311653,0.0002832461,0.0013583876,0.00096298935,0.05220426],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9979399,0.00045940655,0.000117632684,0.00023050961,0.0008450311,0.00040749714],"domain_scores_gemma":[0.9987967,0.00022589858,0.0000887585,0.00022519262,0.00039194853,0.00027153108],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011899201,0.00072224735,0.0007400595,0.002356699,0.001847564,0.0031539614,0.0009127002,0.0006971841,0.008089861],"category_scores_gemma":[0.0023576287,0.0006132196,0.00093353435,0.0017484607,0.0021230287,0.0035081543,0.0030341777,0.0020795185,0.0028198012],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000019428702,0.000023174742,0.00019649448,0.00004078235,0.000007439523,0.00011229066,0.00017247788,0.0014460069,0.002382612,0.98138773,0.0018044756,0.012407168],"study_design_scores_gemma":[0.00002757694,0.000065477776,0.00030446058,0.000036606678,0.000018742046,0.00020274776,0.00021319697,0.01233012,0.0056499257,0.94215924,0.0389423,0.000049597707],"about_ca_topic_score_codex":0.00095988036,"about_ca_topic_score_gemma":0.0014887261,"teacher_disagreement_score":0.008089861,"about_ca_system_score_codex":0.0014148671,"about_ca_system_score_gemma":0.001279622,"threshold_uncertainty_score":0.02706331},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.047368146,0.00030941743,0.9438465,0.00020894206,0.00006716006,0.000027511825,0.00012449436,0.00028385347,0.007763957],"genre_scores_gemma":[0.38178185,0.00090727006,0.6025114,0.00018344923,0.00029514835,0.00007198583,0.00082976994,0.0005054483,0.012913705],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.999627,0.000087915745,0.000015349728,0.00007308761,0.00014891995,0.00004761552],"domain_scores_gemma":[0.9993104,0.00027366466,0.000065683394,0.00013285455,0.00015795881,0.00005953165],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00097415654,0.00056544546,0.0004588742,0.00084590376,0.00058484555,0.0008737676,0.000575394,0.00025461818,0.0040726396],"category_scores_gemma":[0.0027955237,0.00020636483,0.00043336992,0.0013260046,0.0010169308,0.0014735353,0.0007068218,0.0009136434,0.0014030228],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002588179,0.000069537695,0.0016098662,0.00019198882,0.000025178615,0.0002395982,0.00026536788,0.0495932,0.013231012,0.56941086,0.0079615535,0.35714307],"study_design_scores_gemma":[0.000022294029,0.00009092386,0.00087725196,0.00004890676,0.000025519164,0.0003417702,0.0000893008,0.32571247,0.012895319,0.6429447,0.016920533,0.000031083444],"about_ca_topic_score_codex":0.0009222628,"about_ca_topic_score_gemma":0.0009908675,"teacher_disagreement_score":0.0040726396,"about_ca_system_score_codex":0.00042192207,"about_ca_system_score_gemma":0.00034205872,"threshold_uncertainty_score":0.0136243105},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008106232,0.00061210815,0.48217562,0.004614054,0.0008499483,0.00022476801,0.022557253,0.049542144,0.43131787],"genre_scores_gemma":[0.18356912,0.001940509,0.21158503,0.002324036,0.00073502836,0.00052357756,0.0679273,0.054417603,0.47697777],"study_design_codex":"not_applicable","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990246,0.00022511045,0.00007421818,0.00018798136,0.0003522181,0.0001358611],"domain_scores_gemma":[0.99753124,0.00073066755,0.00013980042,0.00078570616,0.0006607985,0.00015171446],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011457425,0.0008152789,0.0006778135,0.0013887832,0.0009643363,0.0038465196,0.0012933649,0.0008797542,0.2680255],"category_scores_gemma":[0.006349172,0.0005801194,0.0008926556,0.0022871243,0.0007948535,0.004494634,0.0018411225,0.0021130445,0.15915856],"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.00031068557,0.00006260463,0.0005873592,0.00032414324,0.000024939407,0.000100755235,0.00022244867,0.0044710655,0.0047782757,0.27901235,0.595779,0.11432638],"study_design_scores_gemma":[0.000111704976,0.00005030983,0.0010246359,0.00013404149,0.000028392,0.00023248326,0.00015606578,0.03523295,0.018118165,0.24474967,0.70008814,0.00007353882],"about_ca_topic_score_codex":0.0054899673,"about_ca_topic_score_gemma":0.007815441,"teacher_disagreement_score":0.2680255,"about_ca_system_score_codex":0.0019271675,"about_ca_system_score_gemma":0.0013070026,"threshold_uncertainty_score":0.8966346},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011920712,0.0001309882,0.97873527,0.00006684783,0.000043698412,0.00004864656,0.00014723497,0.0057961456,0.0031104388],"genre_scores_gemma":[0.0917364,0.00014299792,0.9019636,0.00004473729,0.000046233974,0.000071603674,0.000520703,0.00087629515,0.004597397],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994823,0.00008382702,0.0000386313,0.00014787258,0.00017782995,0.000069492795],"domain_scores_gemma":[0.9990681,0.00021404398,0.00008151791,0.00029439383,0.00028270352,0.000059278962],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005990538,0.0009940222,0.0007218214,0.0009593638,0.0005674287,0.00091871206,0.00071717426,0.00034855655,0.021874202],"category_scores_gemma":[0.0031153816,0.00029738632,0.0006454665,0.0012992882,0.00079103047,0.0015523635,0.0012920691,0.00082352775,0.010198802],"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.0004645804,0.00006634127,0.002110811,0.00022386189,0.00005087217,0.00024984032,0.0003561727,0.028659256,0.030418115,0.053755082,0.01760157,0.86604357],"study_design_scores_gemma":[0.0002437804,0.0007989659,0.0013965096,0.00007900033,0.000066797744,0.0012848488,0.0003108181,0.6346047,0.16849056,0.077738814,0.11486297,0.00012226457],"about_ca_topic_score_codex":0.0021434817,"about_ca_topic_score_gemma":0.002858076,"teacher_disagreement_score":0.021874202,"about_ca_system_score_codex":0.0004981326,"about_ca_system_score_gemma":0.0008115612,"threshold_uncertainty_score":0.07317644},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09352256,0.0008982533,0.8420854,0.000367864,0.0004054715,0.000052996926,0.000060841754,0.00039796167,0.062208716],"genre_scores_gemma":[0.72960496,0.0014005387,0.24372804,0.00029999443,0.0005446884,0.00009673392,0.00016664085,0.0005527897,0.023605667],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994468,0.00014932838,0.00001758543,0.000045543457,0.00028104638,0.000059622624],"domain_scores_gemma":[0.99957544,0.000102398226,0.00006165774,0.000113473005,0.00009755451,0.000049524486],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00081744854,0.00040096734,0.0005678445,0.001545712,0.0008904155,0.00091345544,0.0012856752,0.0004926463,0.004225502],"category_scores_gemma":[0.002244437,0.0001813147,0.00077833707,0.0011027692,0.0018669998,0.002098764,0.0008821969,0.0009600743,0.00071545126],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000013426155,0.000019636082,0.00018598652,0.00003872628,0.000008986702,0.000064453714,0.000119281125,0.006017438,0.0010757747,0.9741983,0.00081634556,0.017441751],"study_design_scores_gemma":[0.000011914002,0.00003809443,0.00035037196,0.000018463277,0.000012701357,0.0001654079,0.00006013373,0.15333837,0.002457615,0.83711064,0.006408355,0.000027898905],"about_ca_topic_score_codex":0.00079096534,"about_ca_topic_score_gemma":0.0010708633,"teacher_disagreement_score":0.004225502,"about_ca_system_score_codex":0.00057998835,"about_ca_system_score_gemma":0.00050073495,"threshold_uncertainty_score":0.014135659},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.028557729,0.00010718139,0.96264267,0.00007045759,0.00004120975,0.00006585137,0.000055913926,0.0005342432,0.007924804],"genre_scores_gemma":[0.24422707,0.00031969245,0.74506927,0.00011482092,0.00007736071,0.0001449967,0.0003984329,0.00062203954,0.00902631],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99905497,0.00017691172,0.000072663366,0.0001118981,0.0004684271,0.00011515445],"domain_scores_gemma":[0.99922335,0.00026533107,0.000049966755,0.00024972708,0.00017554616,0.000036085246],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011418707,0.0007911029,0.001010761,0.001128609,0.0007658081,0.0010858858,0.0011144361,0.00039720745,0.004651839],"category_scores_gemma":[0.0027750202,0.00032667423,0.0012427291,0.00092224387,0.001265853,0.0021506555,0.0011810394,0.0014052571,0.0019504218],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00024117959,0.00013074733,0.0004933534,0.00031570037,0.000072315524,0.000451994,0.00068211515,0.048460435,0.044160962,0.56154585,0.0063503594,0.33709502],"study_design_scores_gemma":[0.00008179466,0.00020613382,0.00037084523,0.000053681757,0.00008678313,0.0005273041,0.00017875634,0.38046673,0.07497709,0.5008761,0.042095695,0.000079126214],"about_ca_topic_score_codex":0.0007672339,"about_ca_topic_score_gemma":0.0011479782,"teacher_disagreement_score":0.004651839,"about_ca_system_score_codex":0.00065683277,"about_ca_system_score_gemma":0.0008027263,"threshold_uncertainty_score":0.015561998},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.19176193,0.0026989318,0.67331225,0.0027209718,0.0015031922,0.00008000585,0.00014729986,0.0011951816,0.1265803],"genre_scores_gemma":[0.8982726,0.000961523,0.08147813,0.0005577939,0.0007792096,0.00006471958,0.00010751282,0.00049543654,0.017283054],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99884087,0.00037047642,0.00008179104,0.0001634917,0.00033974653,0.00020368925],"domain_scores_gemma":[0.99835193,0.00071265304,0.00015088599,0.00039125446,0.0002564477,0.00013675111],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012938171,0.00061805244,0.0011909441,0.0013916164,0.002402317,0.0031832717,0.0011850789,0.0011007468,0.007103114],"category_scores_gemma":[0.006464249,0.00035239157,0.0007496761,0.0017881878,0.0035061848,0.0060547804,0.0025893913,0.002015349,0.0013329294],"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.0000499503,0.000018553947,0.00011196209,0.00004194248,0.000008075188,0.0002702488,0.00020026228,0.0024685818,0.0007295507,0.9839595,0.0016521908,0.010489207],"study_design_scores_gemma":[0.00000920043,0.000015865035,0.000047479207,0.000014521136,0.000007855695,0.00013128246,0.000041290245,0.014503886,0.00091921556,0.9807562,0.0035380225,0.000015091933],"about_ca_topic_score_codex":0.00090040127,"about_ca_topic_score_gemma":0.0015418945,"teacher_disagreement_score":0.007103114,"about_ca_system_score_codex":0.0009691183,"about_ca_system_score_gemma":0.0009208074,"threshold_uncertainty_score":0.023762286},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.89637566,0.0017256443,0.034081697,0.0007972114,0.00017871015,0.00007986249,0.00050396984,0.00021495672,0.06604235],"genre_scores_gemma":[0.98139197,0.000572471,0.0048398757,0.00007047947,0.00023765893,0.000033550252,0.00061478093,0.00004578504,0.012193391],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99804723,0.0003346495,0.00011749645,0.0003740532,0.0007119937,0.00041460397],"domain_scores_gemma":[0.9984452,0.0005961451,0.00032374493,0.00015910128,0.0001840317,0.00029185085],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008807322,0.0009935228,0.0012466143,0.002884331,0.0022842828,0.0029049432,0.0010262409,0.0009497667,0.0072229956],"category_scores_gemma":[0.0030609916,0.0005843003,0.0011181564,0.0021961075,0.0031679284,0.0036772334,0.0029801074,0.0018411593,0.00090633216],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00015362982,0.00007051148,0.0029493594,0.00014713596,0.000043560132,0.0010096831,0.00066210073,0.007849807,0.004740545,0.9656511,0.0028215193,0.013901117],"study_design_scores_gemma":[0.00007340411,0.00008844418,0.004596858,0.000052770796,0.000038083217,0.0007276917,0.00028716103,0.031344395,0.003172765,0.94679964,0.012772308,0.000046478533],"about_ca_topic_score_codex":0.0024041748,"about_ca_topic_score_gemma":0.0014824839,"teacher_disagreement_score":0.0072229956,"about_ca_system_score_codex":0.0023484016,"about_ca_system_score_gemma":0.00048687385,"threshold_uncertainty_score":0.024163365},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11900979,0.00041597403,0.8701174,0.00035991383,0.000070687965,0.00009740242,0.00006636702,0.00018677088,0.009675626],"genre_scores_gemma":[0.729502,0.0010119156,0.25831908,0.00007220723,0.000082236584,0.00015005024,0.00018928337,0.00018833227,0.01048472],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99958974,0.00009384849,0.000023554512,0.000107019616,0.00013460957,0.00005121096],"domain_scores_gemma":[0.99841046,0.00090031396,0.00014864017,0.00017922194,0.00021046415,0.00015092362],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012369262,0.0009293553,0.0009622534,0.0022996594,0.0012881402,0.002107272,0.001206207,0.0013228115,0.0085980445],"category_scores_gemma":[0.007013881,0.0005913991,0.00072461617,0.0010586673,0.0032962584,0.0035648018,0.004630085,0.0027654304,0.000753936],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006804468,0.000051322382,0.0014815041,0.00017626573,0.000023352917,0.00019724904,0.000540305,0.024967961,0.005369627,0.9183648,0.00047923013,0.048280176],"study_design_scores_gemma":[0.00003492399,0.00012179352,0.00062227907,0.00013539345,0.00002094695,0.00019578061,0.0006639663,0.1743766,0.008491315,0.8094388,0.0058479514,0.000050263017],"about_ca_topic_score_codex":0.0007570036,"about_ca_topic_score_gemma":0.00064084964,"teacher_disagreement_score":0.0085980445,"about_ca_system_score_codex":0.0007250161,"about_ca_system_score_gemma":0.00053206267,"threshold_uncertainty_score":0.028763354},"labels":[],"label_agreement":null},{"id":"W2076473088","doi":"10.1090/s0025-5718-2011-02490-7","title":"The infrastructure of a global field of arbitrary unit rank","year":2011,"lang":"en","type":"article","venue":"Mathematics of Computation","topic":"Polynomial and algebraic computation","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"Carl von Ossietzky Universität Oldenburg; Schweizerischer Nationalfonds zur Förderung der Wissenschaftlichen Forschung; University of Calgary; National Science Foundation","keywords":"Field (mathematics); Rank (graph theory); Class (philosophy); Unit (ring theory); Interpretation (philosophy); Function (biology)","score_opus":0.016393943351044136,"score_gpt":0.2519302619105993,"score_spread":0.23553631855955517,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2076473088","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.053946413,0.00036244304,0.86283946,0.00090649567,0.00021254012,0.000096791686,0.00031256062,0.0012911652,0.08003205],"genre_scores_gemma":[0.7004074,0.0006630118,0.2624012,0.00037462846,0.00028038048,0.00016868235,0.0004439736,0.00071498513,0.03454572],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992042,0.0001961555,0.000040899766,0.00016552705,0.00022582615,0.00016736757],"domain_scores_gemma":[0.9991905,0.0001998635,0.0000649435,0.000337886,0.00012150552,0.00008533741],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001060941,0.00050353113,0.000411981,0.0012301838,0.0009850721,0.002680616,0.001021766,0.00062255526,0.012609325],"category_scores_gemma":[0.002479094,0.000273854,0.0006408194,0.00104223,0.003188246,0.009323119,0.0032561633,0.0021440694,0.002212222],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000015624664,0.0000052504643,0.00010470439,0.0000334468,0.0000025282595,0.000035962283,0.00020962807,0.00060500717,0.00060530764,0.98783714,0.0009010103,0.00964439],"study_design_scores_gemma":[0.000020613043,0.00005443964,0.00021653964,0.000039807852,0.000015996175,0.00017176577,0.00031556367,0.007857605,0.0037501624,0.9360493,0.051481996,0.000026227359],"about_ca_topic_score_codex":0.00063220435,"about_ca_topic_score_gemma":0.00071737013,"teacher_disagreement_score":0.012609325,"about_ca_system_score_codex":0.00088719354,"about_ca_system_score_gemma":0.000771222,"threshold_uncertainty_score":0.042182446},"labels":[],"label_agreement":null},{"id":"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.94061714,0.0002627553,0.033782285,0.0001922797,0.000053486183,0.00002513864,0.0000810697,0.00010299197,0.024882842],"genre_scores_gemma":[0.9948649,0.00008363902,0.0022837608,0.00001492598,0.00004292089,0.00000662754,0.000051312978,0.000017143317,0.0026347102],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9997662,0.000029683013,0.000010996644,0.000050623745,0.00008073367,0.00006190023],"domain_scores_gemma":[0.99957556,0.000057494686,0.000104303814,0.00005402661,0.00007175543,0.0001368764],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00037111487,0.0002633116,0.00035013905,0.0017374603,0.0007034242,0.0010715903,0.00031195756,0.000259772,0.003127348],"category_scores_gemma":[0.0007374739,0.00016151654,0.00034064148,0.000461471,0.0022526304,0.0022012407,0.0012582497,0.00071558525,0.00026477425],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000050335668,0.000025702178,0.0026695954,0.000032822558,0.000010613833,0.00042311844,0.0007851665,0.001955054,0.007271337,0.9788929,0.00037103888,0.0075123487],"study_design_scores_gemma":[0.000040047384,0.00035504202,0.023922214,0.00008052379,0.000054396853,0.0038489364,0.0015695335,0.032424353,0.016893933,0.895797,0.02491418,0.00009976291],"about_ca_topic_score_codex":0.00047419954,"about_ca_topic_score_gemma":0.00035204738,"teacher_disagreement_score":0.003127348,"about_ca_system_score_codex":0.0006740877,"about_ca_system_score_gemma":0.00020989409,"threshold_uncertainty_score":0.010461986},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.36946315,0.004158688,0.45715916,0.0036446543,0.0009851182,0.000044082153,0.0005529645,0.000830265,0.16316198],"genre_scores_gemma":[0.9557811,0.0013124028,0.015650347,0.00034536212,0.0007836633,0.00003676271,0.00022980465,0.0001647705,0.025695767],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.999602,0.00006943599,0.00001872573,0.0001104212,0.00012092968,0.00007849692],"domain_scores_gemma":[0.9991492,0.00038194915,0.00008594085,0.00012487374,0.00011726216,0.00014064522],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005288248,0.000601101,0.00065082306,0.001424511,0.0011205556,0.0019312643,0.0006028989,0.00055336114,0.008497769],"category_scores_gemma":[0.0019505584,0.00045128784,0.00053765596,0.0015163746,0.0026491259,0.008246285,0.0024206871,0.00265602,0.0008294556],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000025131221,0.000012890582,0.00022621229,0.000037046662,0.0000067195942,0.000055187098,0.00018722171,0.0007514466,0.0009760779,0.98662126,0.0012414837,0.009859326],"study_design_scores_gemma":[0.000005429971,0.000010041128,0.00029025265,0.0000067871993,0.0000072305947,0.000080648315,0.000046716854,0.0034015444,0.0009331327,0.991232,0.0039748405,0.000011318683],"about_ca_topic_score_codex":0.00061454927,"about_ca_topic_score_gemma":0.0007121687,"teacher_disagreement_score":0.008497769,"about_ca_system_score_codex":0.0006035339,"about_ca_system_score_gemma":0.00036995058,"threshold_uncertainty_score":0.028427899},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.80302334,0.001873187,0.099357404,0.0020402588,0.0001680789,0.00007669775,0.00052642304,0.0002884145,0.09264618],"genre_scores_gemma":[0.9853198,0.00038449443,0.0068570063,0.00011427966,0.0001511007,0.000050965835,0.00021453673,0.000042367075,0.0068654404],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988568,0.00020714423,0.00004534841,0.00024627201,0.0003838108,0.00026065693],"domain_scores_gemma":[0.99731064,0.001665483,0.00028559135,0.00016491332,0.0002201638,0.00035321258],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017325594,0.0007108834,0.0012868446,0.0036714238,0.0029280302,0.005001708,0.0012541016,0.0007016537,0.005790183],"category_scores_gemma":[0.0057526436,0.00077651424,0.0007756922,0.0022743251,0.005143048,0.007336187,0.0028085557,0.002317471,0.00039597662],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000053659638,0.000020469657,0.00044833453,0.000019809566,0.0000071098752,0.000053144147,0.00032490876,0.0010168914,0.0002739259,0.99466336,0.0002698795,0.002848444],"study_design_scores_gemma":[0.000019959827,0.000008181253,0.00034536928,0.000013696907,0.000009705866,0.00007600157,0.000092598006,0.0032917974,0.0003395634,0.99447256,0.0013202175,0.000010322879],"about_ca_topic_score_codex":0.0014598214,"about_ca_topic_score_gemma":0.0018593655,"teacher_disagreement_score":0.005790183,"about_ca_system_score_codex":0.0034517779,"about_ca_system_score_gemma":0.0010608141,"threshold_uncertainty_score":0.0250445},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12555173,0.0005648565,0.73353326,0.004546602,0.0007016909,0.0005762432,0.0023385305,0.023389688,0.10879739],"genre_scores_gemma":[0.75685334,0.00018880762,0.20361209,0.00091284467,0.00026281818,0.00018715441,0.0036982982,0.0014366653,0.032848056],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99527526,0.0009459329,0.00023466638,0.0009586521,0.0017813813,0.00080413],"domain_scores_gemma":[0.9888537,0.003927821,0.00035569456,0.004352641,0.002198102,0.00031210715],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019508703,0.000902635,0.0012108553,0.00091891125,0.0016500304,0.0031540978,0.0022675907,0.0012601046,0.036715344],"category_scores_gemma":[0.012000677,0.0009389346,0.0009533442,0.0012740908,0.0020011333,0.0049384376,0.004670608,0.0032718207,0.0057486],"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.0016814175,0.0007952223,0.0032965387,0.0006890981,0.00014065679,0.00030596307,0.00058684015,0.043509115,0.016939305,0.40642634,0.089219555,0.4364099],"study_design_scores_gemma":[0.0006823171,0.00031271187,0.0011118394,0.00012069909,0.00014553481,0.00038501868,0.0004377915,0.26357445,0.055433623,0.64018875,0.037529968,0.0000773108],"about_ca_topic_score_codex":0.0035914895,"about_ca_topic_score_gemma":0.010533037,"teacher_disagreement_score":0.036715344,"about_ca_system_score_codex":0.0019028643,"about_ca_system_score_gemma":0.005773882,"threshold_uncertainty_score":0.122825086},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15267785,0.0012811854,0.5902788,0.0076735583,0.0009099228,0.0002469041,0.001513296,0.0008078859,0.24461058],"genre_scores_gemma":[0.85506445,0.001079012,0.098984964,0.0022457575,0.0010749254,0.0004234157,0.0019073169,0.00066142995,0.038558625],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989864,0.00015863076,0.00008425571,0.00029209792,0.00030647355,0.0001721492],"domain_scores_gemma":[0.99504685,0.0021506327,0.0002743453,0.0006479636,0.0013655345,0.00051461137],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014079396,0.00064247235,0.0011532635,0.0022930042,0.0020300797,0.0034978478,0.0016755715,0.0024088682,0.01639498],"category_scores_gemma":[0.008685842,0.0004903488,0.0009278618,0.0015247014,0.0038554806,0.007971032,0.0033493887,0.0041153296,0.0036249063],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000052615153,0.000017970062,0.00030973522,0.000038719907,0.0000060705756,0.00008292253,0.00008165943,0.0002814365,0.0020867696,0.98790514,0.0030440704,0.006092903],"study_design_scores_gemma":[0.000041363728,0.000048151825,0.0005574053,0.000035014164,0.000012464806,0.00038389236,0.00016848942,0.0069157253,0.0038471788,0.9718482,0.016117612,0.00002443546],"about_ca_topic_score_codex":0.00072774664,"about_ca_topic_score_gemma":0.00043736424,"teacher_disagreement_score":0.01639498,"about_ca_system_score_codex":0.0008968569,"about_ca_system_score_gemma":0.0008345665,"threshold_uncertainty_score":0.054846644},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.20513132,0.00055785134,0.77750427,0.0003415307,0.00020031977,0.00011572807,0.00023678674,0.00086786546,0.015044265],"genre_scores_gemma":[0.52784586,0.00096724764,0.42925566,0.00018445199,0.00021410867,0.00014241239,0.0006661827,0.0007933941,0.039930657],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991904,0.000090122994,0.000030660525,0.00014244409,0.00041510817,0.00013135899],"domain_scores_gemma":[0.99931204,0.00034192257,0.00007230756,0.00006858005,0.00016254127,0.000042602307],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010035483,0.0009107453,0.0008940882,0.0011278194,0.00082528626,0.0020568175,0.0009958707,0.0005209151,0.005826759],"category_scores_gemma":[0.0026483838,0.00042638992,0.0012105105,0.0010029968,0.0019410474,0.0028420405,0.0014273273,0.0022714,0.001619305],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00042599894,0.00014967579,0.0035225074,0.00051815866,0.00012110924,0.0008254795,0.0018761148,0.014219367,0.05249064,0.6952346,0.0044492376,0.22616711],"study_design_scores_gemma":[0.000233313,0.00048198638,0.0029994717,0.00014136554,0.00014937074,0.0014286949,0.0006215151,0.09330984,0.1321714,0.7305134,0.03780054,0.00014908695],"about_ca_topic_score_codex":0.0015903171,"about_ca_topic_score_gemma":0.0033327388,"teacher_disagreement_score":0.005826759,"about_ca_system_score_codex":0.0009886161,"about_ca_system_score_gemma":0.00075422705,"threshold_uncertainty_score":0.019492507},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.31833506,0.0012736503,0.64297193,0.00073831517,0.00022231779,0.00015128937,0.000653806,0.01680904,0.018844645],"genre_scores_gemma":[0.5630053,0.00025805723,0.43016613,0.00013939271,0.00004500662,0.0001683454,0.0009428172,0.0007244147,0.004550489],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99921346,0.00012328003,0.00006199028,0.00013353697,0.00029401382,0.00017374814],"domain_scores_gemma":[0.9987129,0.00041683452,0.00009584259,0.00029742415,0.00040616246,0.00007083811],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00051744236,0.0006653823,0.0003819271,0.0006899014,0.00057344005,0.00085231697,0.00180705,0.00050944707,0.0050345967],"category_scores_gemma":[0.0024309834,0.00030377516,0.0004571172,0.0013014972,0.00035598932,0.0013451569,0.0005728078,0.0008824281,0.00094771024],"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.001645818,0.0007165055,0.009690771,0.00078987476,0.00022360274,0.00066574983,0.0005738958,0.21003029,0.14280038,0.055122342,0.028457258,0.54928356],"study_design_scores_gemma":[0.00015105549,0.00027771675,0.0016571841,0.00003150376,0.000058941994,0.0001531416,0.00007964621,0.89118767,0.082130805,0.012597379,0.01162254,0.000052430696],"about_ca_topic_score_codex":0.004782389,"about_ca_topic_score_gemma":0.010979018,"teacher_disagreement_score":0.0050345967,"about_ca_system_score_codex":0.0012034315,"about_ca_system_score_gemma":0.0018639952,"threshold_uncertainty_score":0.016842425},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.73331445,0.0012317599,0.16008438,0.0016423473,0.0003564139,0.000082718565,0.00032274294,0.00039374214,0.10257147],"genre_scores_gemma":[0.97253686,0.00031014747,0.00977758,0.00014787074,0.00020786027,0.000022926872,0.00017241297,0.00008092007,0.016743349],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99946696,0.000055109012,0.000023559684,0.00010643977,0.00016757323,0.00018045593],"domain_scores_gemma":[0.9990295,0.00026263198,0.00012975733,0.00008933285,0.0002285279,0.00026012384],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00082952756,0.0004993232,0.00075399387,0.002506902,0.0015221825,0.0030064334,0.0007806992,0.00043445735,0.005449603],"category_scores_gemma":[0.0016859986,0.00039102076,0.0006121382,0.0012244806,0.003223837,0.004480319,0.0019117465,0.002178218,0.0007193198],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005476934,0.000027536968,0.0004298452,0.00002120502,0.00000589626,0.00005822731,0.00038160337,0.00046607733,0.0010208116,0.9907012,0.00066761667,0.006165178],"study_design_scores_gemma":[0.000024143563,0.00002785644,0.0004861046,0.000013141044,0.000013598289,0.00012590949,0.0001667605,0.0032011406,0.0010863044,0.9911671,0.0036724664,0.00001539616],"about_ca_topic_score_codex":0.0009992551,"about_ca_topic_score_gemma":0.0011367659,"teacher_disagreement_score":0.005449603,"about_ca_system_score_codex":0.0019047091,"about_ca_system_score_gemma":0.0008540648,"threshold_uncertainty_score":0.018230677},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6391321,0.0026797918,0.25251797,0.016772931,0.00058347196,0.00040317234,0.0036439658,0.002180946,0.082085624],"genre_scores_gemma":[0.9318899,0.00086713186,0.05496813,0.0006251795,0.00046348118,0.00022901178,0.002023565,0.00039789244,0.008535739],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9928895,0.0016579259,0.0005111529,0.0011260039,0.0025596183,0.0012558069],"domain_scores_gemma":[0.93927366,0.049672797,0.0017470525,0.0064121527,0.001893938,0.0010003021],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0032879158,0.0010217509,0.0022195322,0.0014762593,0.0030622708,0.008925815,0.004190213,0.0023644068,0.020018127],"category_scores_gemma":[0.037705455,0.0008768996,0.002191471,0.0039804545,0.004797115,0.024023656,0.005965099,0.0049128295,0.0017831712],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0028712829,0.0004931856,0.0072971364,0.0008722878,0.00020823789,0.0004611767,0.0015158552,0.15230098,0.0052500414,0.70296556,0.022715855,0.10304845],"study_design_scores_gemma":[0.00011143839,0.00005715279,0.00056820083,0.000046608417,0.00006243584,0.00009617792,0.00024362096,0.19334728,0.0018684904,0.8016877,0.0018708786,0.000039945793],"about_ca_topic_score_codex":0.006946403,"about_ca_topic_score_gemma":0.011236717,"teacher_disagreement_score":0.020018127,"about_ca_system_score_codex":0.0053505036,"about_ca_system_score_gemma":0.0049141115,"threshold_uncertainty_score":0.06696731},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01968574,0.0003084608,0.8627258,0.00038634014,0.0002570411,0.00039007902,0.001885539,0.08592117,0.028439814],"genre_scores_gemma":[0.18927588,0.00026811167,0.7793646,0.00057493726,0.00014291462,0.000775664,0.0041849925,0.008698918,0.016713949],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99831355,0.00018412118,0.00011341494,0.00034614094,0.00066015864,0.00038261633],"domain_scores_gemma":[0.99844885,0.0004178778,0.00009411941,0.00046258984,0.00046760056,0.000108866625],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008642338,0.0019194895,0.0009914619,0.0017639139,0.0012017116,0.0018322566,0.0037861338,0.0012991132,0.049420238],"category_scores_gemma":[0.003916873,0.0008404051,0.001302145,0.0020233816,0.0009204223,0.0026161105,0.0016962361,0.0016163375,0.016431792],"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.002831338,0.0006783744,0.002240717,0.0007845213,0.0001685102,0.00058818585,0.0003182407,0.06439068,0.05603377,0.057308055,0.10218069,0.71247685],"study_design_scores_gemma":[0.0017526872,0.00093394716,0.0015171403,0.00017551357,0.00013583855,0.0008539158,0.00018041067,0.63633907,0.11356945,0.0694505,0.17475267,0.0003388803],"about_ca_topic_score_codex":0.008544799,"about_ca_topic_score_gemma":0.005950096,"teacher_disagreement_score":0.049420238,"about_ca_system_score_codex":0.0016254553,"about_ca_system_score_gemma":0.0027016927,"threshold_uncertainty_score":0.16532719},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8200498,0.0012469544,0.13097982,0.0021298318,0.00009986834,0.000046523906,0.00011689274,0.00017147153,0.045158774],"genre_scores_gemma":[0.9811044,0.0004085662,0.0112025,0.0001279795,0.000047826965,0.000041098225,0.00010249165,0.000056170757,0.006909032],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9998565,0.000035058416,0.000006246003,0.00002508804,0.000049496473,0.000027687953],"domain_scores_gemma":[0.99978536,0.00005940423,0.000043602635,0.000027392127,0.000044873093,0.00003928298],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00039029826,0.0003693695,0.00040695543,0.000736109,0.00082636235,0.0013617813,0.00069775345,0.0009734004,0.002761634],"category_scores_gemma":[0.0016433211,0.00028236097,0.00048595725,0.00034454872,0.0016679078,0.0019053529,0.0012690924,0.0007006647,0.0003742281],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000022620055,0.000014142909,0.0007186795,0.00002488161,0.000008945794,0.00018973256,0.00018764484,0.041011285,0.002357236,0.9508001,0.00070288416,0.0039618704],"study_design_scores_gemma":[0.00003492912,0.000024365578,0.00061115425,0.000016194192,0.0000055981054,0.00023222508,0.00015581788,0.31385946,0.000716633,0.68217117,0.0021522297,0.000020248031],"about_ca_topic_score_codex":0.0018346222,"about_ca_topic_score_gemma":0.0007167325,"teacher_disagreement_score":0.002761634,"about_ca_system_score_codex":0.0008999535,"about_ca_system_score_gemma":0.00036428086,"threshold_uncertainty_score":0.009238601},"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":"editorial","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0031161935,0.051019832,0.009655482,0.06508581,0.6437615,0.00009098217,0.000738855,0.0004734075,0.2260579],"genre_scores_gemma":[0.021132832,0.021058552,0.0016435441,0.006856459,0.7795973,0.0001250919,0.00073881866,0.0004233722,0.16842405],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9984584,0.00035841,0.00012190623,0.00037139273,0.00056759693,0.00012231183],"domain_scores_gemma":[0.99627954,0.0017238312,0.00021991228,0.0003428882,0.000757791,0.00067590235],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020016362,0.0024681485,0.0040905788,0.0044550407,0.002741724,0.0076343846,0.0018051732,0.0036523566,0.0796292],"category_scores_gemma":[0.005025297,0.00082508416,0.0018276741,0.0033597082,0.0021820404,0.006498753,0.0021834509,0.0042466754,0.013776649],"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.00012147661,0.00009123323,0.0002601026,0.0007076521,0.00006862519,0.00015202732,0.00008274763,0.0003020315,0.00040330915,0.09194449,0.866315,0.03955124],"study_design_scores_gemma":[0.00006051034,0.00008132143,0.001345251,0.00028037129,0.00009889029,0.0004644773,0.000087814704,0.0015691336,0.00033852243,0.119121924,0.87651235,0.000039444025],"about_ca_topic_score_codex":0.00042462163,"about_ca_topic_score_gemma":0.0011582164,"teacher_disagreement_score":0.0796292,"about_ca_system_score_codex":0.0026169305,"about_ca_system_score_gemma":0.0012566989,"threshold_uncertainty_score":0.2663862},"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":"methods","genre_gemma":"software","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"software","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0055278437,0.0007218986,0.68938375,0.00031790466,0.00042635584,0.000120445126,0.0022809021,0.27559334,0.025627557],"genre_scores_gemma":[0.1674761,0.0013009799,0.68020594,0.0014043744,0.0007045476,0.0006497261,0.011622555,0.09437667,0.042259075],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99847025,0.00021251287,0.00009694074,0.00032286323,0.00067112246,0.00022639833],"domain_scores_gemma":[0.99787414,0.0007113846,0.00008925711,0.00077311584,0.00042525027,0.00012684855],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011219692,0.0019465615,0.0015660365,0.002128192,0.0010242269,0.0030954545,0.0038495774,0.0011342268,0.06752293],"category_scores_gemma":[0.006732198,0.0014935047,0.0016547479,0.0022664466,0.0009781249,0.0061583854,0.004295003,0.002826884,0.03409825],"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.0013086769,0.00025415907,0.0016194275,0.0008820151,0.00019695522,0.0003853711,0.00042326428,0.008211272,0.013676343,0.07902095,0.24666609,0.6473555],"study_design_scores_gemma":[0.0008117726,0.00035704506,0.000947965,0.000353462,0.00021718112,0.0005750856,0.00015594113,0.18593004,0.092502736,0.28253844,0.4353053,0.00030499836],"about_ca_topic_score_codex":0.0016936791,"about_ca_topic_score_gemma":0.002514313,"teacher_disagreement_score":0.06752293,"about_ca_system_score_codex":0.0010642016,"about_ca_system_score_gemma":0.0013878254,"threshold_uncertainty_score":0.2258867},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8575402,0.00033184103,0.12768006,0.00031790516,0.000059807164,0.00002420741,0.000063808395,0.00010956771,0.013872575],"genre_scores_gemma":[0.98240215,0.0001869438,0.012304397,0.000034502264,0.00003282072,0.000011875297,0.00006796837,0.000031649946,0.004927653],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994399,0.00012804601,0.00003202857,0.0000731754,0.00023758195,0.000089203844],"domain_scores_gemma":[0.9991041,0.00038606024,0.00014603796,0.00013505583,0.00013635414,0.0000923694],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010205698,0.00034201393,0.00057370163,0.0006171406,0.0006456274,0.0013088918,0.000658027,0.00038875738,0.0026574035],"category_scores_gemma":[0.0041034333,0.00017502382,0.00048671468,0.0005348919,0.0014838595,0.0020142174,0.00074585306,0.0011883667,0.00032081475],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001775957,0.000055809895,0.0023661572,0.000106846775,0.00002637143,0.0004255916,0.00061084435,0.023332452,0.010335338,0.9529833,0.00043609762,0.009143649],"study_design_scores_gemma":[0.00004960637,0.00014913957,0.0011849849,0.000042889897,0.000035944726,0.0006080236,0.0003711326,0.25590324,0.014619561,0.722398,0.004603218,0.000034320816],"about_ca_topic_score_codex":0.0006540437,"about_ca_topic_score_gemma":0.000788077,"teacher_disagreement_score":0.0026574035,"about_ca_system_score_codex":0.0013213394,"about_ca_system_score_gemma":0.00037716894,"threshold_uncertainty_score":0.0095870495},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.026652629,0.00048418398,0.90228194,0.0011637828,0.0004631123,0.000104039544,0.00015944494,0.0012163832,0.06747462],"genre_scores_gemma":[0.44549823,0.00084038737,0.50404114,0.0005333654,0.0009172925,0.0003007183,0.00033901102,0.0007831329,0.046746854],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993716,0.00018937807,0.000031568372,0.0000836439,0.00025455526,0.0000692381],"domain_scores_gemma":[0.99938357,0.00024509412,0.000069659836,0.00011887908,0.00010566147,0.0000771273],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013397327,0.0007343884,0.0006876234,0.0017616316,0.0011927441,0.00185266,0.00084270496,0.00097142893,0.010200312],"category_scores_gemma":[0.004936952,0.00031338274,0.0011083864,0.0007972186,0.0020745758,0.0030932291,0.0033527168,0.0019918156,0.002444884],"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.000043171687,0.000019672652,0.00018749225,0.00005674725,0.000008909653,0.000102222424,0.00017156427,0.012019043,0.0007597935,0.9557949,0.0030514938,0.027785128],"study_design_scores_gemma":[0.000025353253,0.000030170277,0.00013875826,0.000028160757,0.000008690175,0.000104400366,0.00005164005,0.10268632,0.0016185837,0.8630377,0.032246985,0.000023251034],"about_ca_topic_score_codex":0.0011937142,"about_ca_topic_score_gemma":0.0009541397,"teacher_disagreement_score":0.010200312,"about_ca_system_score_codex":0.0010163138,"about_ca_system_score_gemma":0.00077258056,"threshold_uncertainty_score":0.03412348},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.16628093,0.00080987054,0.81607,0.00080508075,0.00019116445,0.00017818027,0.00061042514,0.0042020543,0.010852273],"genre_scores_gemma":[0.5304751,0.00038598632,0.45948246,0.00015002649,0.00018006835,0.00023782243,0.0021616365,0.00064726046,0.006279806],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99911743,0.00018454292,0.0000697187,0.00021738124,0.00026145176,0.00014954878],"domain_scores_gemma":[0.99555606,0.0025383017,0.0003316792,0.000730927,0.0005262589,0.00031675288],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017571462,0.0015674566,0.0011372274,0.0032422412,0.0011205086,0.0037657195,0.0027279377,0.0015448513,0.009973273],"category_scores_gemma":[0.010246058,0.0006830631,0.0010312005,0.0023022527,0.0014666163,0.005877897,0.0029270952,0.0024906963,0.0018599737],"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.001054464,0.00053225603,0.011872671,0.00046012952,0.00026381368,0.00020448367,0.0006794216,0.14374438,0.010309082,0.28947175,0.016850185,0.5245575],"study_design_scores_gemma":[0.00023042472,0.00012597248,0.0017168156,0.000047475296,0.00007626021,0.00011725655,0.00023468594,0.5521736,0.0060010906,0.43440473,0.00482158,0.000050074377],"about_ca_topic_score_codex":0.0021405476,"about_ca_topic_score_gemma":0.005737997,"teacher_disagreement_score":0.009973273,"about_ca_system_score_codex":0.002079081,"about_ca_system_score_gemma":0.002260375,"threshold_uncertainty_score":0.03336388},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.49527568,0.0019291469,0.27721065,0.013654753,0.0026799086,0.0002615322,0.000557763,0.0020030905,0.20642745],"genre_scores_gemma":[0.9435461,0.00069008686,0.0369427,0.0016796617,0.00072834024,0.00018559537,0.0005011151,0.000589962,0.015136525],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99719787,0.0010084006,0.0001488938,0.00053811865,0.0006040502,0.00050267664],"domain_scores_gemma":[0.99488175,0.003178814,0.0003104867,0.00081990036,0.0003993875,0.00040959672],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0038973247,0.0016831366,0.002436538,0.0028296893,0.003613195,0.0053054295,0.002070334,0.0036428114,0.009706239],"category_scores_gemma":[0.014857848,0.0011173924,0.002561854,0.0022343805,0.0067785867,0.008992505,0.0059612747,0.0070258463,0.0011965072],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006045087,0.00003266817,0.00016912833,0.000026207863,0.000011277077,0.000088510606,0.00022746203,0.00061781256,0.00027865855,0.9945094,0.0017144562,0.0022638573],"study_design_scores_gemma":[0.00004339218,0.0000146869825,0.0001255148,0.000020042147,0.000017860824,0.00007807085,0.00012820486,0.0063420665,0.00032707865,0.98998415,0.002902866,0.00001607573],"about_ca_topic_score_codex":0.0019263697,"about_ca_topic_score_gemma":0.0018095339,"teacher_disagreement_score":0.009706239,"about_ca_system_score_codex":0.002577011,"about_ca_system_score_gemma":0.0009163142,"threshold_uncertainty_score":0.032470584},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.091754496,0.00030396722,0.89510363,0.0013848444,0.00008427111,0.00007568219,0.00039979254,0.000926012,0.009967149],"genre_scores_gemma":[0.5677907,0.0004272262,0.41852865,0.0002811235,0.00020419214,0.00010738273,0.0013857885,0.00038484475,0.0108901495],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99896824,0.00024344507,0.00006355886,0.00031712672,0.00023792479,0.00016972207],"domain_scores_gemma":[0.9985696,0.00076732854,0.00007907112,0.00036178157,0.00017304553,0.000049127008],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013781249,0.0006200815,0.0012045577,0.00064920366,0.0007757487,0.0018626668,0.001064775,0.000994433,0.008886546],"category_scores_gemma":[0.0047440897,0.00033743551,0.00084778666,0.0009695062,0.0012577735,0.0039441343,0.0014875833,0.001957613,0.0018568911],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00061342376,0.00017114422,0.0015954198,0.00040272728,0.00006676618,0.0002153631,0.0003792777,0.049198195,0.007820295,0.592753,0.013378026,0.3334064],"study_design_scores_gemma":[0.00011866951,0.00013875803,0.00052844384,0.000055438377,0.00004286316,0.00049594673,0.00036337465,0.25756925,0.016058188,0.7085784,0.016002791,0.000047829762],"about_ca_topic_score_codex":0.00058493135,"about_ca_topic_score_gemma":0.00033894632,"teacher_disagreement_score":0.008886546,"about_ca_system_score_codex":0.0005599809,"about_ca_system_score_gemma":0.000664924,"threshold_uncertainty_score":0.029728472},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.68714225,0.0021590218,0.24450223,0.0022838265,0.00022981055,0.000054030155,0.00033558536,0.00021875768,0.06307442],"genre_scores_gemma":[0.9843724,0.0003127341,0.01232607,0.0001227631,0.00012244098,0.000049084807,0.00009636347,0.000020882835,0.0025773845],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99872786,0.00027207402,0.00007701776,0.00020316185,0.00038418057,0.0003356374],"domain_scores_gemma":[0.99619126,0.0018546405,0.00036834527,0.00031334782,0.0007157195,0.0005566374],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018294122,0.00046712943,0.00093683647,0.002677823,0.0015254463,0.0024316495,0.0009387585,0.00084781414,0.004389887],"category_scores_gemma":[0.0055811424,0.0002846843,0.0007799032,0.0009084598,0.0030796768,0.004717581,0.002138839,0.0021541025,0.0004094287],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000034544515,0.000013341323,0.00047129576,0.000030076204,0.0000080928785,0.00005298026,0.00012368392,0.0016981281,0.0017584477,0.993725,0.0002791577,0.00180523],"study_design_scores_gemma":[0.000015137262,0.000023829749,0.0005303794,0.00002832996,0.000008170902,0.0001456637,0.000086869346,0.02530847,0.0029098447,0.9687669,0.0021496124,0.000026828611],"about_ca_topic_score_codex":0.0006666375,"about_ca_topic_score_gemma":0.0003520813,"teacher_disagreement_score":0.004389887,"about_ca_system_score_codex":0.0015984222,"about_ca_system_score_gemma":0.0007123139,"threshold_uncertainty_score":0.014685631},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03333533,0.00045911127,0.94015014,0.00028191658,0.0001964961,0.00007206359,0.00036333138,0.0014184372,0.023723174],"genre_scores_gemma":[0.46171057,0.0010125787,0.5059723,0.0002627688,0.00032591147,0.00014310832,0.0019175679,0.0011856593,0.027469559],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989429,0.00017510969,0.000068900255,0.00021487036,0.0004073139,0.0001909213],"domain_scores_gemma":[0.99889743,0.00029661282,0.00008292166,0.00019950308,0.0004413381,0.00008227486],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011146389,0.0009090053,0.0007156746,0.0026244272,0.0008003333,0.0019369455,0.0008149283,0.0004432413,0.011856729],"category_scores_gemma":[0.0040091923,0.00030817967,0.0010131105,0.001991358,0.001231064,0.0025947862,0.0013434304,0.00112433,0.0038459986],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002353349,0.000049045637,0.0012587768,0.00028824405,0.00002674718,0.00027124223,0.00055073836,0.031343162,0.012351817,0.67861384,0.007713737,0.26729727],"study_design_scores_gemma":[0.000048355345,0.00016868439,0.00082511385,0.00015200755,0.000037467387,0.00056169817,0.00035351005,0.290812,0.020407608,0.61030906,0.07625433,0.00007005747],"about_ca_topic_score_codex":0.0024057971,"about_ca_topic_score_gemma":0.0021277291,"teacher_disagreement_score":0.011856729,"about_ca_system_score_codex":0.0015128275,"about_ca_system_score_gemma":0.0013615917,"threshold_uncertainty_score":0.039664745},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2636636,0.0011104088,0.7041586,0.00076302426,0.00036965738,0.00005618009,0.00023181376,0.0005690685,0.029077506],"genre_scores_gemma":[0.9237487,0.00052390643,0.06390679,0.00012459401,0.00038625352,0.00003771583,0.00019236108,0.00015173903,0.010927821],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988984,0.00023435289,0.000051998046,0.00027664073,0.00037750296,0.00016109896],"domain_scores_gemma":[0.9967871,0.0013482012,0.00047202336,0.00051883515,0.0005703449,0.00030354728],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010182608,0.0009657876,0.0008570959,0.0015062382,0.0011078528,0.0023914932,0.00083486387,0.0008386704,0.006718628],"category_scores_gemma":[0.008141395,0.0005223087,0.0006475717,0.0014216176,0.0021593228,0.004062537,0.0018401089,0.0021935157,0.0017525996],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00027509226,0.00006309882,0.0009676906,0.0001038685,0.000022513259,0.0003070088,0.0006033293,0.010770222,0.00642725,0.941198,0.0033702182,0.035891853],"study_design_scores_gemma":[0.000022280796,0.000050969305,0.00029313113,0.000020525307,0.000012227944,0.0002418167,0.00011150263,0.039930172,0.004317806,0.95204246,0.0029208704,0.000036200432],"about_ca_topic_score_codex":0.0007427853,"about_ca_topic_score_gemma":0.0011113457,"teacher_disagreement_score":0.006718628,"about_ca_system_score_codex":0.0006846615,"about_ca_system_score_gemma":0.0007689141,"threshold_uncertainty_score":0.022476077},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08740393,0.0007825906,0.90025014,0.00041296377,0.0000611666,0.000030613868,0.00007372185,0.00022492098,0.010760027],"genre_scores_gemma":[0.901039,0.0011288525,0.08898457,0.00014643167,0.00019351077,0.00006147903,0.00017451291,0.00020141175,0.008070169],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99916124,0.00027020706,0.00003369226,0.00017218507,0.00024234563,0.00012027771],"domain_scores_gemma":[0.99700767,0.0018457142,0.0003124699,0.00029430547,0.0003612327,0.00017869743],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018312775,0.0007573933,0.0006494295,0.001368495,0.00072957005,0.0016015421,0.0006967826,0.00086224335,0.0034425],"category_scores_gemma":[0.0076639815,0.0003849471,0.0005879382,0.00081154535,0.0029751882,0.0024282522,0.0015049307,0.0021351236,0.00057613873],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010537888,0.00003319801,0.001441066,0.00014437773,0.000042792904,0.00028426017,0.0006517415,0.1837111,0.007035295,0.7688898,0.0012705078,0.036390558],"study_design_scores_gemma":[0.0000055757196,0.000031013802,0.00056583364,0.000028067954,0.000008417856,0.000085729094,0.00009027843,0.7446002,0.0014507612,0.25150287,0.0015955466,0.000035762332],"about_ca_topic_score_codex":0.0019465301,"about_ca_topic_score_gemma":0.0010350188,"teacher_disagreement_score":0.0034425,"about_ca_system_score_codex":0.0009139887,"about_ca_system_score_gemma":0.0006828048,"threshold_uncertainty_score":0.011516273},"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":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9312672,0.00042200566,0.0129647255,0.0009490122,0.00013068577,0.000037278558,0.0005885112,0.00022651996,0.05341405],"genre_scores_gemma":[0.98976517,0.00022100138,0.0015630738,0.000048156853,0.00019583653,0.000015639609,0.00029799002,0.00006643719,0.007826729],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988808,0.00016331172,0.00006378615,0.00016251655,0.0003648349,0.00036463406],"domain_scores_gemma":[0.9959121,0.0014271473,0.0006268048,0.00034091398,0.0003995465,0.0012935101],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013804599,0.0008122308,0.0012795031,0.0064529614,0.002380007,0.006028149,0.0011380076,0.0008773266,0.01971597],"category_scores_gemma":[0.005035779,0.00068239885,0.0005958414,0.0027388625,0.0038237115,0.007016528,0.0033007385,0.0017480188,0.0015715415],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00023291064,0.00006145969,0.0034720898,0.00007244822,0.00001664846,0.00020913007,0.00084478984,0.0016521928,0.00204419,0.9793808,0.0017587214,0.010254751],"study_design_scores_gemma":[0.00005785233,0.00008487311,0.0029687656,0.000055429762,0.00003154993,0.00036652788,0.0005421428,0.0061348667,0.00166573,0.98424226,0.0037932815,0.000056793127],"about_ca_topic_score_codex":0.0009880089,"about_ca_topic_score_gemma":0.0015494049,"teacher_disagreement_score":0.01971597,"about_ca_system_score_codex":0.0014821565,"about_ca_system_score_gemma":0.0007978023,"threshold_uncertainty_score":0.06595647},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5117063,0.0015259639,0.3468132,0.0023046026,0.00038569348,0.00006913514,0.0011558193,0.0004017403,0.13563754],"genre_scores_gemma":[0.96904445,0.0008708001,0.012923677,0.00026398667,0.00039769706,0.000029594257,0.00045171627,0.00009828918,0.01591978],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99968827,0.000057361067,0.000012717367,0.00006515215,0.000093620394,0.000082868435],"domain_scores_gemma":[0.9991671,0.00026597024,0.00018144379,0.000146862,0.00011328514,0.00012542632],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00043616348,0.0003963329,0.00050643604,0.0008805504,0.0004995015,0.0016034478,0.00051349227,0.00038187415,0.011739819],"category_scores_gemma":[0.002111837,0.00020577165,0.00035451492,0.0015021368,0.0010539768,0.0024948926,0.0012219871,0.0012513084,0.0016968998],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00017412392,0.000025743358,0.00060948124,0.000051132272,0.000015840342,0.00019283597,0.00011382423,0.001132427,0.004862187,0.9476657,0.0039529153,0.04120384],"study_design_scores_gemma":[0.00008124209,0.000058748592,0.0016431062,0.000016372825,0.000024834782,0.00070973486,0.00014717189,0.009969922,0.0065210573,0.9684003,0.012401658,0.000025797726],"about_ca_topic_score_codex":0.000507172,"about_ca_topic_score_gemma":0.0003745156,"teacher_disagreement_score":0.011739819,"about_ca_system_score_codex":0.00035646954,"about_ca_system_score_gemma":0.00042662857,"threshold_uncertainty_score":0.03927362},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.18123735,0.0002582705,0.79374427,0.00021985373,0.000073158146,0.000084018735,0.00024648223,0.0010902009,0.023046331],"genre_scores_gemma":[0.81899965,0.0003533399,0.16759261,0.00009984904,0.0000718631,0.00008184514,0.0004647552,0.00038427213,0.011951809],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992329,0.00025115197,0.000039125443,0.00013112274,0.00021606202,0.0001297424],"domain_scores_gemma":[0.99827087,0.0009921069,0.00018963315,0.00022602912,0.00022444538,0.00009683435],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010742735,0.000567568,0.0007136967,0.0009745906,0.0005926608,0.0014338379,0.0009653364,0.00057231466,0.0075504947],"category_scores_gemma":[0.0053554694,0.0003990333,0.000690299,0.0014497973,0.0009896151,0.002263564,0.0013295853,0.0017186401,0.0013694473],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00076642935,0.00017214222,0.0011286655,0.00018916368,0.000039308467,0.00016424374,0.00039523182,0.043894093,0.0070116865,0.85058594,0.0027295349,0.09292343],"study_design_scores_gemma":[0.00017673892,0.00024720764,0.00053406175,0.00006831037,0.000042925003,0.0001649084,0.00011197639,0.2707763,0.013604883,0.70090294,0.013324109,0.000045572095],"about_ca_topic_score_codex":0.0009139791,"about_ca_topic_score_gemma":0.0011594224,"teacher_disagreement_score":0.0075504947,"about_ca_system_score_codex":0.0010493436,"about_ca_system_score_gemma":0.0005312129,"threshold_uncertainty_score":0.025258958},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10405218,0.00949384,0.72658986,0.01566654,0.00057341566,0.00043397516,0.00214175,0.0039873566,0.13706109],"genre_scores_gemma":[0.64888567,0.0053978837,0.27607894,0.002664778,0.0018852579,0.0013012076,0.0060386476,0.0026746679,0.055072926],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99091643,0.0019156268,0.0003574779,0.0013207668,0.0032446599,0.0022450024],"domain_scores_gemma":[0.9576454,0.03270738,0.0015689048,0.004037534,0.00245556,0.001585143],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.006014928,0.0024712475,0.0022271348,0.0037008442,0.0029378638,0.0064157983,0.0045509567,0.0025587196,0.025204426],"category_scores_gemma":[0.03810701,0.001251765,0.0029165058,0.004828106,0.0044050245,0.018138893,0.00941959,0.010347638,0.004027752],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0014677119,0.00050078426,0.003083019,0.0011305669,0.00015679485,0.0001979713,0.00067485386,0.09141534,0.0050943242,0.7591648,0.028203053,0.10891066],"study_design_scores_gemma":[0.00010110994,0.00013007685,0.00072536163,0.00012918649,0.00010447991,0.00017111751,0.00013610983,0.23828839,0.0040569566,0.7415261,0.0145879295,0.000043055243],"about_ca_topic_score_codex":0.0025433868,"about_ca_topic_score_gemma":0.004061279,"teacher_disagreement_score":0.025204426,"about_ca_system_score_codex":0.0064318315,"about_ca_system_score_gemma":0.0034623884,"threshold_uncertainty_score":0.08431721},"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":"software","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"software","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.025844453,0.00069917546,0.6310675,0.0013361595,0.0013982301,0.0001836687,0.0069213947,0.018716093,0.31383333],"genre_scores_gemma":[0.37527317,0.0010090366,0.33228964,0.001987736,0.00074124266,0.0006353664,0.020394318,0.007635602,0.26003394],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99916875,0.00007078904,0.000048191145,0.0002398955,0.00032852456,0.0001438623],"domain_scores_gemma":[0.99925333,0.000077807665,0.000050622057,0.00030789644,0.00024106966,0.00006919512],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00027108792,0.000585485,0.00050973945,0.00079402834,0.001060103,0.0025634982,0.0010598439,0.00040873827,0.09005038],"category_scores_gemma":[0.0014385285,0.00025955908,0.00059776765,0.0010497711,0.0005795534,0.0027069345,0.00287085,0.0012497385,0.041162044],"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.00040945283,0.00015220615,0.0017667104,0.00033206018,0.000040850446,0.00039026712,0.00020290003,0.008787625,0.01272451,0.5966924,0.15386869,0.22463238],"study_design_scores_gemma":[0.0000673734,0.00010149262,0.001203631,0.00006209157,0.000028903029,0.0006017917,0.00010697574,0.05325164,0.023091646,0.24198648,0.679442,0.000056125926],"about_ca_topic_score_codex":0.001424357,"about_ca_topic_score_gemma":0.0025162245,"teacher_disagreement_score":0.09005038,"about_ca_system_score_codex":0.00059629924,"about_ca_system_score_gemma":0.00086479157,"threshold_uncertainty_score":0},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.022215553,0.000196839,0.9640355,0.00057381176,0.00018772678,0.00022350668,0.00037085137,0.0044486127,0.007747572],"genre_scores_gemma":[0.2393091,0.00017690787,0.7451678,0.00035471155,0.0001411268,0.00039307593,0.0011578264,0.00042475038,0.012874692],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99785787,0.00021830453,0.0001510746,0.0006973198,0.0007453597,0.00033006634],"domain_scores_gemma":[0.9971449,0.001106386,0.00016595455,0.0009657227,0.00045536665,0.00016165234],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007942534,0.001590131,0.001205384,0.00078356947,0.0016015315,0.0020822168,0.0023839115,0.001972993,0.013687618],"category_scores_gemma":[0.004005717,0.00091151183,0.0016584584,0.0013279275,0.0012529327,0.0032209512,0.0036641,0.0026319092,0.004535016],"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.001154052,0.00063731225,0.0021530222,0.00061043375,0.00022655344,0.00037485058,0.00036870156,0.042687044,0.045869507,0.120892614,0.025480427,0.7595455],"study_design_scores_gemma":[0.0009803532,0.00061961496,0.0015182734,0.000095932104,0.0002733236,0.0010610726,0.0002707322,0.6283372,0.056776494,0.2844313,0.025440406,0.00019525985],"about_ca_topic_score_codex":0.0030064846,"about_ca_topic_score_gemma":0.0076300576,"teacher_disagreement_score":0.013687618,"about_ca_system_score_codex":0.0014457302,"about_ca_system_score_gemma":0.0040754974,"threshold_uncertainty_score":0.0457896},"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":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.14896806,0.0074327732,0.47205934,0.008238614,0.00097655755,0.0000532524,0.00061872357,0.0004970325,0.36115554],"genre_scores_gemma":[0.8168299,0.0045812787,0.05077877,0.0010314028,0.0011370747,0.000119962264,0.00074154313,0.00024277018,0.12453726],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99967456,0.000077839795,0.000010085257,0.000063828746,0.00011175745,0.00006186683],"domain_scores_gemma":[0.9995521,0.00023275142,0.000045844765,0.000045266,0.000085278945,0.00003866183],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00043501784,0.00060335075,0.00068195316,0.0014469739,0.001986785,0.0018675793,0.00085053523,0.0006320938,0.010920159],"category_scores_gemma":[0.0011862015,0.0004571381,0.00074956607,0.0013159723,0.0029491477,0.0037685563,0.0012990711,0.0033784297,0.0015657285],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000007220075,0.0000074609175,0.000063180625,0.000020101643,0.0000037999764,0.00001403855,0.00006892431,0.0007137337,0.00011643624,0.9919652,0.0021370724,0.004882886],"study_design_scores_gemma":[0.0000055274722,0.0000036087308,0.00010408093,0.000007719085,0.0000043165032,0.000028526798,0.000025297213,0.0016391517,0.00015846928,0.9903346,0.0076834764,0.0000051995967],"about_ca_topic_score_codex":0.0022836493,"about_ca_topic_score_gemma":0.0028762615,"teacher_disagreement_score":0.010920159,"about_ca_system_score_codex":0.0013253418,"about_ca_system_score_gemma":0.000649152,"threshold_uncertainty_score":0.036531627},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.015100354,0.001466123,0.953203,0.0012669944,0.00018448543,0.000048847145,0.000041948864,0.00021987809,0.028468292],"genre_scores_gemma":[0.51941264,0.0034704288,0.46796414,0.00027676162,0.0004132756,0.00015485883,0.000076274104,0.00012103267,0.008110629],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.999173,0.00035442875,0.00004063009,0.0000690506,0.00032333765,0.000039465565],"domain_scores_gemma":[0.99903166,0.00048418652,0.00007810842,0.00020040426,0.0001596122,0.000046023317],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009673841,0.00040679253,0.0005343961,0.0010205635,0.00066427636,0.0013606916,0.00054882385,0.00039104125,0.0029079777],"category_scores_gemma":[0.0033402788,0.00022060405,0.000465916,0.0009014863,0.0032593035,0.0012817754,0.0022425652,0.0014075408,0.000595076],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000007334514,0.000008844009,0.000158863,0.00005846791,0.0000073817905,0.000053328677,0.00010734825,0.03453164,0.0011475,0.9412341,0.0004505604,0.02223463],"study_design_scores_gemma":[0.000005421395,0.000015287935,0.00012352955,0.000019985753,0.0000026052035,0.000067593784,0.000038252965,0.15287973,0.0009181657,0.8366915,0.009230019,0.00000791947],"about_ca_topic_score_codex":0.0011186709,"about_ca_topic_score_gemma":0.0006096875,"teacher_disagreement_score":0.0029079777,"about_ca_system_score_codex":0.0010399008,"about_ca_system_score_gemma":0.0009503723,"threshold_uncertainty_score":0.009728193},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7327075,0.0018508473,0.18023458,0.0042496272,0.00060450606,0.00015743007,0.00081011665,0.0007519965,0.078633316],"genre_scores_gemma":[0.9607653,0.0008885561,0.021076499,0.0004537368,0.00046792705,0.00012766472,0.00049013674,0.00041751767,0.015312624],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99713445,0.0008171799,0.00023222834,0.00037965013,0.0006974133,0.00073908793],"domain_scores_gemma":[0.98409826,0.010497492,0.0019382477,0.0012257003,0.0010781812,0.0011620622],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004400167,0.0010737466,0.0015896382,0.00391237,0.003433299,0.006503172,0.0026592088,0.00245694,0.011781162],"category_scores_gemma":[0.023660263,0.0009839358,0.0014917878,0.0027034457,0.0070135454,0.015360429,0.004529672,0.00443918,0.0013757999],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000345835,0.00004562034,0.0013034188,0.00009329494,0.000016796092,0.00015074504,0.0007609299,0.0038478149,0.0014358927,0.9844237,0.0013735241,0.006202343],"study_design_scores_gemma":[0.000043170174,0.000036409343,0.0004355619,0.00007526011,0.000030416677,0.00008168713,0.00024397137,0.013882332,0.0011773705,0.9818308,0.0021164697,0.00004647509],"about_ca_topic_score_codex":0.0021435684,"about_ca_topic_score_gemma":0.0029749067,"teacher_disagreement_score":0.011781162,"about_ca_system_score_codex":0.0039654085,"about_ca_system_score_gemma":0.002085735,"threshold_uncertainty_score":0.039411902},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04099223,0.0003638713,0.94016457,0.0005375764,0.00008461782,0.000039790844,0.00007030609,0.00028096433,0.01746611],"genre_scores_gemma":[0.5787966,0.00047293163,0.41485092,0.00022165384,0.000107062144,0.00014323137,0.00025651188,0.00041108922,0.0047398913],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985789,0.0004875494,0.000107857246,0.00022400306,0.00039421552,0.00020741609],"domain_scores_gemma":[0.99647176,0.0020853404,0.00016965721,0.0008160222,0.0003044847,0.00015279077],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002068276,0.0006323457,0.0010589357,0.0010039633,0.0014203123,0.0029319867,0.002244292,0.0010276571,0.006004705],"category_scores_gemma":[0.00981788,0.00070477766,0.0010292395,0.0011931396,0.0029783414,0.008088767,0.0042507844,0.0041398164,0.0007797891],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001602036,0.00005900602,0.00021020403,0.00014704572,0.000019793873,0.000038990926,0.0003319144,0.06201355,0.002255488,0.8928128,0.0013187618,0.04063237],"study_design_scores_gemma":[0.000029455236,0.000027721848,0.000055510758,0.000048970232,0.000013172091,0.000028377573,0.00009923647,0.21848619,0.003267677,0.77458566,0.0033448185,0.00001321031],"about_ca_topic_score_codex":0.0008598059,"about_ca_topic_score_gemma":0.0012605818,"teacher_disagreement_score":0.006004705,"about_ca_system_score_codex":0.0011436779,"about_ca_system_score_gemma":0.0010033313,"threshold_uncertainty_score":0.020087719},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12721041,0.0008545148,0.83492315,0.0005095376,0.0003439067,0.00013035262,0.0004567252,0.008161889,0.02740951],"genre_scores_gemma":[0.57021254,0.00042377118,0.41066822,0.00023078875,0.00020297464,0.00011954702,0.0005325429,0.00070015795,0.016909469],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99943703,0.000089811525,0.00004840267,0.00011907312,0.00016781835,0.00013785811],"domain_scores_gemma":[0.99874496,0.00038558894,0.00006683956,0.00058508234,0.00014157886,0.00007601905],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005263752,0.00048598988,0.0010986935,0.001267184,0.0014029425,0.0019454955,0.0014586868,0.00064524106,0.0110582495],"category_scores_gemma":[0.0020153623,0.0004777541,0.0006589517,0.0028260723,0.000904327,0.00488132,0.0035548918,0.00086386537,0.0019561166],"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.0020157965,0.00034536832,0.0020627782,0.00043544208,0.00010477464,0.00023179811,0.0005195174,0.017923791,0.038753703,0.3392244,0.018367453,0.5800151],"study_design_scores_gemma":[0.00066386274,0.0005353247,0.0012280125,0.00016209664,0.00033654764,0.00051739905,0.0003486525,0.22357178,0.098838374,0.5995222,0.074139446,0.000136341],"about_ca_topic_score_codex":0.0015207292,"about_ca_topic_score_gemma":0.004194491,"teacher_disagreement_score":0.0110582495,"about_ca_system_score_codex":0.00094089593,"about_ca_system_score_gemma":0.0014387594,"threshold_uncertainty_score":0.036993504},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2504251,0.011110153,0.5557524,0.005240074,0.00094289985,0.00011955466,0.00073564326,0.0006716979,0.17500247],"genre_scores_gemma":[0.8934291,0.003339035,0.06490933,0.00047081357,0.0010774719,0.00011511702,0.0009191861,0.00019361239,0.035546277],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99927145,0.00014970981,0.000026870563,0.00022243033,0.00020391004,0.0001255943],"domain_scores_gemma":[0.99856806,0.0008085874,0.00014889278,0.00022645117,0.00013813064,0.00010982382],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007209329,0.0006831103,0.0011635958,0.0014398332,0.0016333207,0.003864448,0.0010698559,0.000782947,0.015366979],"category_scores_gemma":[0.004006322,0.0005718842,0.0009576451,0.0026496123,0.0029320368,0.0065961927,0.0019590491,0.0038487383,0.0019441729],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007325837,0.000022238295,0.0001786685,0.00004551163,0.00000765189,0.000023765486,0.00017134027,0.0023075978,0.0003357948,0.9797831,0.00239545,0.014655833],"study_design_scores_gemma":[0.000012063638,0.000008095892,0.0001154518,0.000009473979,0.00000666434,0.000034696473,0.000046521418,0.0039526355,0.00014155018,0.9921146,0.0035526596,0.0000057526354],"about_ca_topic_score_codex":0.0014026753,"about_ca_topic_score_gemma":0.0012409342,"teacher_disagreement_score":0.015366979,"about_ca_system_score_codex":0.0013812581,"about_ca_system_score_gemma":0.0006180604,"threshold_uncertainty_score":0.051407635},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.17038201,0.000117575146,0.81795007,0.00030320033,0.00009266483,0.00007980791,0.00018565895,0.0017169722,0.009172065],"genre_scores_gemma":[0.64195687,0.00012314777,0.3463522,0.00015197847,0.0001060663,0.00011044171,0.0005916101,0.00034486267,0.01026275],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99807847,0.00032172675,0.00010066337,0.00035855922,0.0008358727,0.00030473404],"domain_scores_gemma":[0.9972025,0.001063399,0.00024643127,0.0007994049,0.00052739924,0.00016076211],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00091656647,0.00057780417,0.0007765552,0.0009161583,0.0009969837,0.0020908425,0.0010135464,0.00084048643,0.005969815],"category_scores_gemma":[0.007503007,0.0005406039,0.00065345643,0.0009258518,0.0013992311,0.0043890076,0.0023316748,0.0016223537,0.0016633802],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0012691288,0.00033393368,0.0034185858,0.00016863833,0.00007914796,0.00026061863,0.0005283432,0.09568616,0.042272538,0.48127154,0.009101624,0.3656098],"study_design_scores_gemma":[0.00013637426,0.00021342564,0.0006290242,0.000022236916,0.000017614419,0.00021981716,0.00017985907,0.5485534,0.03460168,0.40717605,0.008181449,0.00006909978],"about_ca_topic_score_codex":0.0012539946,"about_ca_topic_score_gemma":0.0029554681,"teacher_disagreement_score":0.005969815,"about_ca_system_score_codex":0.0010135628,"about_ca_system_score_gemma":0.0014645724,"threshold_uncertainty_score":0.019971073},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.031366833,0.00025688842,0.9497798,0.0004175256,0.00015954551,0.00018865544,0.00035123032,0.0040271734,0.013452421],"genre_scores_gemma":[0.19059525,0.00021240157,0.7946874,0.00023219326,0.000050577404,0.00023724751,0.001331462,0.0008093752,0.011844132],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992275,0.00013150262,0.000053086074,0.00023671442,0.00024513953,0.00010596443],"domain_scores_gemma":[0.9986066,0.0004039908,0.000052445703,0.00055616215,0.00028017987,0.00010047114],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007164273,0.00081981526,0.0011228438,0.0012925153,0.001089758,0.0018361834,0.0025417844,0.001750561,0.016196731],"category_scores_gemma":[0.0043652784,0.0006248587,0.0010967938,0.0015897033,0.00086808065,0.0035213984,0.0047785277,0.0022531128,0.005166148],"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.0005701787,0.0003204623,0.001293141,0.00043142127,0.000117941876,0.00021291134,0.00039377145,0.04746759,0.010104491,0.26013696,0.031987913,0.64696324],"study_design_scores_gemma":[0.00021016317,0.0003039458,0.00066918635,0.00009215289,0.00008984861,0.00041281272,0.00025988155,0.50425607,0.013932294,0.4476135,0.032079313,0.00008084419],"about_ca_topic_score_codex":0.0016670623,"about_ca_topic_score_gemma":0.002453958,"teacher_disagreement_score":0.016196731,"about_ca_system_score_codex":0.0006346781,"about_ca_system_score_gemma":0.0015898062,"threshold_uncertainty_score":0.054183424},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.17093234,0.02029054,0.5838777,0.013603648,0.0019359834,0.000100022415,0.000604298,0.0009057402,0.20774977],"genre_scores_gemma":[0.86562383,0.007867386,0.05935537,0.00068293174,0.0035361308,0.00008238142,0.0003692315,0.00022372886,0.062258966],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989949,0.0002641914,0.00006773771,0.00021582462,0.00031636519,0.00014097168],"domain_scores_gemma":[0.99794525,0.0012159222,0.00016264374,0.000295497,0.00020822619,0.00017247647],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015429688,0.0007935347,0.0016288984,0.0018233411,0.0017718164,0.0038575893,0.0011606379,0.00092308654,0.009870848],"category_scores_gemma":[0.0036650768,0.0007076805,0.000745895,0.0043317345,0.004300856,0.012794379,0.002072057,0.0052810884,0.0014582104],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000265668,0.00002083296,0.00013909352,0.000055348104,0.0000058325904,0.000028624896,0.000108060034,0.00060319493,0.00019758224,0.98789585,0.0013395316,0.009579443],"study_design_scores_gemma":[0.000009986885,0.000014403762,0.00016289964,0.00001346376,0.000012910094,0.000081487924,0.000038092734,0.00382438,0.00032037817,0.9880129,0.0074991775,0.000009942316],"about_ca_topic_score_codex":0.0007955855,"about_ca_topic_score_gemma":0.00094376935,"teacher_disagreement_score":0.009870848,"about_ca_system_score_codex":0.001958887,"about_ca_system_score_gemma":0.0010394948,"threshold_uncertainty_score":0.03302133},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.033667024,0.00061776565,0.93826985,0.00057148014,0.00026412326,0.0003356025,0.0010597884,0.009933664,0.0152807],"genre_scores_gemma":[0.13830712,0.0002601971,0.8436271,0.00023244954,0.00014172273,0.00029163892,0.004394498,0.001040782,0.011704405],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987349,0.00014186789,0.000086239466,0.00046983574,0.00039024442,0.00017688372],"domain_scores_gemma":[0.99782985,0.0007584948,0.00011907781,0.00071928813,0.0004205794,0.0001527015],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009108181,0.0016957105,0.0019493846,0.0022688112,0.0017140582,0.004122682,0.002840363,0.001970404,0.017601578],"category_scores_gemma":[0.004262578,0.00081327785,0.001630423,0.003037243,0.0011627537,0.005239664,0.0039709285,0.0028693215,0.008543882],"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.00056500454,0.00025269674,0.001539258,0.00038200125,0.00008306727,0.00010504514,0.00030311118,0.008950394,0.013873909,0.06367826,0.03490265,0.87536466],"study_design_scores_gemma":[0.00058870413,0.00056466,0.0030789215,0.00017512935,0.00030580608,0.0009692174,0.00073725526,0.34612104,0.03578379,0.5259822,0.08550974,0.00018351595],"about_ca_topic_score_codex":0.0020910306,"about_ca_topic_score_gemma":0.0039900835,"teacher_disagreement_score":0.017601578,"about_ca_system_score_codex":0.0018923924,"about_ca_system_score_gemma":0.0024522848,"threshold_uncertainty_score":0.05888313},"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":"commentary","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0056006243,0.066710256,0.038881518,0.816498,0.011798443,0.00002355356,0.0002675065,0.00018591087,0.060034126],"genre_scores_gemma":[0.41370195,0.15485723,0.081459604,0.10709026,0.15352295,0.00042113225,0.0011130293,0.0006645457,0.08716927],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9978144,0.00086226116,0.00008005728,0.0003388292,0.00066657644,0.00023778102],"domain_scores_gemma":[0.9856286,0.00988713,0.00035949788,0.0011094413,0.0019110978,0.0011042769],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.006080948,0.00080996775,0.0014207326,0.0012251566,0.0038032546,0.008712415,0.0021917524,0.005683269,0.014763343],"category_scores_gemma":[0.022172725,0.00048015965,0.0008091053,0.0013387608,0.012257244,0.024034755,0.004768551,0.01215737,0.003827157],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000058668855,0.00008410958,0.0002119257,0.00018774698,0.000016223798,0.00004674916,0.00035167392,0.0010360283,0.00012094512,0.82614714,0.12886003,0.04287875],"study_design_scores_gemma":[0.000014395836,0.000008686443,0.00004831417,0.000079080884,0.000002298037,0.000033979264,0.00031640232,0.0010241678,0.000047304697,0.94655395,0.051860515,0.000010892829],"about_ca_topic_score_codex":0.0012520083,"about_ca_topic_score_gemma":0.0012329087,"teacher_disagreement_score":0.014763343,"about_ca_system_score_codex":0.0022422173,"about_ca_system_score_gemma":0.0031373,"threshold_uncertainty_score":0.04938835},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.004149775,0.00006800833,0.9921708,0.00005875855,0.00003849021,0.000047155816,0.00011496107,0.0012315204,0.0021204178],"genre_scores_gemma":[0.08377961,0.00019154795,0.9119078,0.00005571913,0.00005449701,0.00012955605,0.001005444,0.00029134576,0.0025845612],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990171,0.00014862017,0.0000894888,0.00018426518,0.00041295943,0.0001475701],"domain_scores_gemma":[0.9982729,0.0004566957,0.000103825216,0.0005886302,0.0004785795,0.00009934556],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008923511,0.0007821222,0.0006829981,0.0011530948,0.00052696484,0.0014851162,0.0015820557,0.0006064952,0.01215177],"category_scores_gemma":[0.004585126,0.00045138935,0.000994547,0.0016800642,0.00064644136,0.003170298,0.002142569,0.0017551206,0.003952153],"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.00027611264,0.00019173812,0.0012939344,0.00041137915,0.00007854656,0.00015641525,0.00024319495,0.09218825,0.0129303755,0.1850686,0.01702917,0.6901323],"study_design_scores_gemma":[0.000093861716,0.00009161914,0.00021095737,0.000035825815,0.000031796964,0.0001717918,0.00007704907,0.7974569,0.0116758,0.17645219,0.013671832,0.000030303167],"about_ca_topic_score_codex":0.0013486537,"about_ca_topic_score_gemma":0.0037111328,"teacher_disagreement_score":0.01215177,"about_ca_system_score_codex":0.00077203993,"about_ca_system_score_gemma":0.0009810503,"threshold_uncertainty_score":0.04065174},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.052172855,0.0119177215,0.80070055,0.003134443,0.0007973708,0.00013405296,0.0008299864,0.0002624469,0.13005069],"genre_scores_gemma":[0.627739,0.01638296,0.26148948,0.0014226678,0.0016234684,0.0003379872,0.0012084882,0.0003252565,0.08947072],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99940944,0.00014644134,0.000036729412,0.00010078376,0.00023897424,0.00006769193],"domain_scores_gemma":[0.9995011,0.00026085763,0.000043237902,0.000054393822,0.00011959881,0.000020782603],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00083228765,0.00058810186,0.00065563543,0.0011138339,0.00065507233,0.0013421235,0.00065106223,0.00073096645,0.007394133],"category_scores_gemma":[0.0030632012,0.00026116244,0.0007729465,0.0015246703,0.0012907924,0.0026582617,0.0013132385,0.0021212464,0.0017668355],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000004420288,0.000004359525,0.000102446706,0.00004970638,0.0000039962165,0.000045165772,0.00010448193,0.0039101294,0.0008520044,0.98421854,0.0019057485,0.0087990165],"study_design_scores_gemma":[0.000008233437,0.000009474803,0.00021601004,0.000025147485,0.000005647986,0.00014186741,0.000041717973,0.042034436,0.00056664925,0.9317159,0.025224656,0.000010350392],"about_ca_topic_score_codex":0.0012776094,"about_ca_topic_score_gemma":0.0012630209,"teacher_disagreement_score":0.007394133,"about_ca_system_score_codex":0.0013660528,"about_ca_system_score_gemma":0.0005012866,"threshold_uncertainty_score":0.024735868},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08470601,0.0013843316,0.87148124,0.0083163055,0.00038741005,0.00023111547,0.0025515624,0.0069260695,0.024015987],"genre_scores_gemma":[0.58020914,0.00070965925,0.39514986,0.0019661856,0.0006117272,0.00046235695,0.003786396,0.0023720956,0.014732633],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99341017,0.0016903011,0.00048627914,0.0021472487,0.001264394,0.0010015462],"domain_scores_gemma":[0.97620153,0.016227115,0.0010244634,0.004490742,0.0013840304,0.00067214726],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.006190499,0.001953865,0.0025737442,0.0015173893,0.002238659,0.0051344475,0.004954599,0.0035063464,0.024297792],"category_scores_gemma":[0.04735806,0.0010728468,0.0043576504,0.0022490185,0.003604642,0.015423104,0.0050804685,0.0058920295,0.0053633596],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0030931155,0.00034430478,0.008195558,0.0015426829,0.0005720303,0.00034094157,0.0009268653,0.19882667,0.006143357,0.47912052,0.06548216,0.23541181],"study_design_scores_gemma":[0.00020099017,0.0001521869,0.0007482669,0.00008327352,0.00013291824,0.00014670017,0.00016898636,0.4445522,0.0049623516,0.54320717,0.005588049,0.000056987035],"about_ca_topic_score_codex":0.0045272005,"about_ca_topic_score_gemma":0.007924161,"teacher_disagreement_score":0.024297792,"about_ca_system_score_codex":0.0042806426,"about_ca_system_score_gemma":0.0048163673,"threshold_uncertainty_score":0.081284225},"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":"software","genre_gemma":"software","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"software","genre_consensus":"software","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0015253252,0.00094352587,0.35304287,0.00056388555,0.0006662057,0.00021838867,0.022424955,0.5207901,0.099824764],"genre_scores_gemma":[0.066307105,0.0031635123,0.41492042,0.0020050409,0.0007046371,0.0021135262,0.08480964,0.2775706,0.14840546],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99871194,0.0002466203,0.00009719771,0.00026702302,0.00044725978,0.00023003198],"domain_scores_gemma":[0.99853444,0.00047832337,0.00010518157,0.00051907985,0.00021626463,0.00014663246],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0015326886,0.0020431576,0.0017518655,0.002183028,0.0010596905,0.0036973415,0.0036667767,0.001402493,0.35495424],"category_scores_gemma":[0.005777652,0.0016613741,0.0025011136,0.0025180073,0.00095699617,0.0055303583,0.004606512,0.003066211,0.25302732],"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.0006949395,0.00015659643,0.00067832647,0.001915516,0.00011946871,0.00045307193,0.00025093605,0.0057525216,0.003998329,0.08596683,0.6502586,0.24975489],"study_design_scores_gemma":[0.00028754878,0.00008881576,0.0002895811,0.0002461006,0.000039697305,0.00031684106,0.00006193678,0.016146494,0.007959177,0.121113636,0.8533562,0.000093956754],"about_ca_topic_score_codex":0.0014227261,"about_ca_topic_score_gemma":0.0022709526,"teacher_disagreement_score":0.35495424,"about_ca_system_score_codex":0.00092687615,"about_ca_system_score_gemma":0.0019048206,"threshold_uncertainty_score":0.92007947},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06355971,0.00019202211,0.9192847,0.00014389762,0.000061373656,0.00007498575,0.00005027195,0.00062306726,0.016010026],"genre_scores_gemma":[0.62582135,0.00049866014,0.36194173,0.000057904283,0.00008593848,0.00012308639,0.0002086803,0.00030627134,0.010956304],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99958307,0.00009786351,0.000026821328,0.00006854718,0.00018220802,0.000041510953],"domain_scores_gemma":[0.9995931,0.00011842756,0.00004394844,0.00013265015,0.000072540584,0.000039373303],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006490533,0.00039770265,0.00055748224,0.0010508607,0.00067271944,0.0015226369,0.0005506106,0.00028161437,0.00395509],"category_scores_gemma":[0.00198503,0.00025570396,0.00064809585,0.00051973196,0.0022813138,0.0014239867,0.002016957,0.0012133261,0.0009417568],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000032460204,0.000032152206,0.00030650414,0.000071468356,0.000010661186,0.00014475123,0.0004403983,0.032687474,0.006896758,0.91422606,0.0007606879,0.044390712],"study_design_scores_gemma":[0.000041641568,0.00009236964,0.0003489859,0.00003331405,0.000011899193,0.00021587306,0.0001693564,0.23615241,0.011255546,0.7310095,0.020637821,0.000031356954],"about_ca_topic_score_codex":0.0007173581,"about_ca_topic_score_gemma":0.0005509284,"teacher_disagreement_score":0.00395509,"about_ca_system_score_codex":0.00081550854,"about_ca_system_score_gemma":0.0006678759,"threshold_uncertainty_score":0.013231099},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8529311,0.0011025716,0.06685485,0.001723798,0.00017668774,0.00008677948,0.0006290045,0.00033472222,0.076160476],"genre_scores_gemma":[0.97785735,0.00042140277,0.0071504177,0.00011441208,0.00018874844,0.000051692565,0.00049024663,0.000049443035,0.01367629],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991605,0.000117476164,0.000053359236,0.00017061378,0.00028059664,0.00021739435],"domain_scores_gemma":[0.9984933,0.00051973615,0.0002816021,0.00010952891,0.00019490477,0.0004009478],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00097639684,0.0007480458,0.0010598399,0.0026125133,0.002707698,0.0039643724,0.0010165399,0.0006892511,0.0054833973],"category_scores_gemma":[0.0019859578,0.000655568,0.00070334243,0.0011436631,0.0041180076,0.0060988916,0.002718131,0.0026911357,0.00064143416],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000079161364,0.000036222704,0.0003820335,0.00002794065,0.000008566214,0.00013610494,0.000815547,0.00043049201,0.0011504638,0.99372935,0.00043231976,0.0027717652],"study_design_scores_gemma":[0.000054207067,0.00003632601,0.0005718404,0.000017221771,0.000012770055,0.00019381645,0.0004927154,0.0021139642,0.0010937866,0.99140865,0.003988965,0.000015724163],"about_ca_topic_score_codex":0.00085710856,"about_ca_topic_score_gemma":0.00077526795,"teacher_disagreement_score":0.0054833973,"about_ca_system_score_codex":0.0017632482,"about_ca_system_score_gemma":0.000651979,"threshold_uncertainty_score":0.018343747},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09072094,0.00023778793,0.8948484,0.0006863353,0.000086287306,0.000108901404,0.0003029829,0.0013959028,0.011612406],"genre_scores_gemma":[0.37705657,0.0002369845,0.607717,0.00018247221,0.000097210075,0.00019725923,0.0009265785,0.00026379645,0.013322158],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99946433,0.00014777125,0.000032103293,0.0000880606,0.0001841254,0.000083685576],"domain_scores_gemma":[0.9967654,0.0024071082,0.00012804945,0.0003718689,0.0002285621,0.0000989748],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008867959,0.0009628054,0.0008334023,0.0002957089,0.00084971427,0.0012196231,0.00076489785,0.00086376467,0.016325343],"category_scores_gemma":[0.0052534114,0.000419291,0.00060926983,0.00087845704,0.00083134085,0.0020236117,0.0014094972,0.001758392,0.003030653],"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.0005595962,0.00028495144,0.0026711158,0.00085167587,0.00012522831,0.0005974411,0.0006781665,0.40527323,0.015954586,0.22752343,0.016153142,0.3293274],"study_design_scores_gemma":[0.000075338656,0.00013077614,0.0003505212,0.00001841117,0.000014674508,0.00016066605,0.0002468227,0.9073627,0.008240483,0.07983331,0.0035429944,0.000023377786],"about_ca_topic_score_codex":0.0029144029,"about_ca_topic_score_gemma":0.010964489,"teacher_disagreement_score":0.016325343,"about_ca_system_score_codex":0.0005748267,"about_ca_system_score_gemma":0.0012608664,"threshold_uncertainty_score":0.05461377},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.31710258,0.051476438,0.3815316,0.051805794,0.0021917203,0.000097482145,0.0017073246,0.00066693383,0.19342007],"genre_scores_gemma":[0.9081338,0.009643649,0.052101314,0.0022960405,0.0038760337,0.0001357036,0.001124435,0.0001590819,0.02252986],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9968458,0.0011914846,0.00016682214,0.00054966606,0.0008153583,0.0004308548],"domain_scores_gemma":[0.992531,0.00526646,0.00047160272,0.0006082644,0.0005523731,0.000570233],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0035498887,0.00080872833,0.0010885622,0.002452537,0.0027692467,0.005619618,0.0023439173,0.0027274496,0.0076995296],"category_scores_gemma":[0.0060856678,0.0006126527,0.0014699901,0.0029442317,0.010412052,0.01897666,0.0043517454,0.0054537165,0.0007451703],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000075284106,0.000009253279,0.00011757708,0.000038765153,0.0000038133396,0.00002161663,0.0001744679,0.000499714,0.00008051324,0.99580294,0.0006476942,0.0025961515],"study_design_scores_gemma":[0.0000035768358,0.000008277771,0.000077558536,0.000011944091,0.0000011974138,0.000024872244,0.000121416815,0.0011504627,0.00004353499,0.994852,0.0037007476,0.000004288713],"about_ca_topic_score_codex":0.0010199293,"about_ca_topic_score_gemma":0.0005461349,"teacher_disagreement_score":0.0076995296,"about_ca_system_score_codex":0.0023443142,"about_ca_system_score_gemma":0.000982576,"threshold_uncertainty_score":0.025757432},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6931172,0.006422257,0.15438199,0.0038816973,0.0009292803,0.00009095294,0.00086800824,0.0002797347,0.14002898],"genre_scores_gemma":[0.9757632,0.0014507878,0.010620975,0.00021540561,0.0006278279,0.00008270633,0.00026446523,0.00006658823,0.0109080365],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9989039,0.00031282747,0.00008609002,0.00020235103,0.00033602357,0.00015875309],"domain_scores_gemma":[0.9975101,0.00092403084,0.0004254084,0.00020951629,0.00042533982,0.00050563854],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011559289,0.00084491004,0.0008154499,0.0067479997,0.0016837344,0.0052439803,0.0011915728,0.0013650007,0.0067720506],"category_scores_gemma":[0.0058391388,0.00039344223,0.00082365365,0.002775733,0.0037417554,0.005650749,0.0025506346,0.0019285115,0.00072748726],"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.000027992819,0.000006527058,0.0002067419,0.000024547848,0.000007779391,0.00003801929,0.00011801118,0.00039855335,0.00029180205,0.9957253,0.00031747,0.0028373224],"study_design_scores_gemma":[0.000010950798,0.000029276163,0.0005579169,0.000018528064,0.000009342511,0.00018240421,0.00013038328,0.003336127,0.00039468697,0.99259186,0.002714911,0.000023697301],"about_ca_topic_score_codex":0.0008288871,"about_ca_topic_score_gemma":0.0005398163,"teacher_disagreement_score":0.0067720506,"about_ca_system_score_codex":0.0018967567,"about_ca_system_score_gemma":0.0006684892,"threshold_uncertainty_score":0.022654712},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10132219,0.0003619703,0.87005794,0.0018973938,0.00036557007,0.00020707044,0.0006755611,0.0033008067,0.021811541],"genre_scores_gemma":[0.7892133,0.00016535244,0.19769089,0.0006830276,0.00041507167,0.00026012247,0.0015215557,0.0006161913,0.009434464],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9955635,0.0015572859,0.00024812235,0.0009185639,0.0010738025,0.00063874014],"domain_scores_gemma":[0.9709952,0.019842751,0.0010940313,0.0038252217,0.0030866752,0.0011561115],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0026403542,0.0012287836,0.0014452147,0.002148529,0.0018377877,0.003402894,0.002901655,0.0027476666,0.011640803],"category_scores_gemma":[0.03152819,0.00054154656,0.0015398887,0.0018995019,0.0041458304,0.007370513,0.004609069,0.0030771391,0.0033785354],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0019753734,0.00031958762,0.0069996784,0.00043492857,0.00015039094,0.000547387,0.00047395803,0.024914276,0.023021087,0.7008005,0.017398259,0.22296463],"study_design_scores_gemma":[0.00020516329,0.00053655374,0.0015899177,0.00010267888,0.00009437902,0.0005111213,0.00018407706,0.22126032,0.023517203,0.7446812,0.0072023496,0.00011499885],"about_ca_topic_score_codex":0.0017234653,"about_ca_topic_score_gemma":0.001772735,"teacher_disagreement_score":0.011640803,"about_ca_system_score_codex":0.0012904562,"about_ca_system_score_gemma":0.0025281613,"threshold_uncertainty_score":0.038942397},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.016082246,0.00016537098,0.9691048,0.00012729058,0.00006965702,0.000055337532,0.00009735213,0.0014308806,0.012867068],"genre_scores_gemma":[0.3688708,0.00036667142,0.6219944,0.00007746352,0.000058900634,0.00014867686,0.00062964647,0.0005297633,0.0073236856],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995454,0.00007967291,0.00002694404,0.00007266556,0.0001999076,0.0000754033],"domain_scores_gemma":[0.9994437,0.00011885721,0.00002105304,0.00019313637,0.00019358999,0.000029647019],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002927523,0.00044000795,0.00057061395,0.00047466264,0.00049421564,0.0010703631,0.0009320395,0.00031694776,0.008094278],"category_scores_gemma":[0.0018273019,0.00021759629,0.0005932217,0.0011581624,0.0005244571,0.0011280183,0.0008803369,0.0007960989,0.0018449358],"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.0003203448,0.000117998185,0.0010534762,0.00035003512,0.000058411835,0.00022404362,0.0003308306,0.26407635,0.041192878,0.34728253,0.011789998,0.3332032],"study_design_scores_gemma":[0.00002982338,0.000047523463,0.00019135379,0.000010907238,0.000014299128,0.000063731546,0.000041096526,0.90239114,0.017085187,0.06834619,0.011767197,0.000011596773],"about_ca_topic_score_codex":0.00264625,"about_ca_topic_score_gemma":0.0035518392,"teacher_disagreement_score":0.008094278,"about_ca_system_score_codex":0.00069873227,"about_ca_system_score_gemma":0.0007508136,"threshold_uncertainty_score":0.027078092},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.14885882,0.00044833226,0.8133249,0.0004220618,0.00016504772,0.000073634335,0.00011172482,0.0004936391,0.03610182],"genre_scores_gemma":[0.95364827,0.00031099282,0.034209475,0.00009939814,0.00006818874,0.00009686288,0.000085250475,0.000059218433,0.011422271],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9997148,0.000049730374,0.00001081231,0.00006822873,0.0001044597,0.000051829207],"domain_scores_gemma":[0.9997174,0.00007174316,0.00007361877,0.000050176113,0.000055189255,0.00003177111],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00018540633,0.0003795296,0.00031392637,0.0003183684,0.0003758961,0.0008986789,0.00055372226,0.0003155822,0.004775961],"category_scores_gemma":[0.00084884313,0.00017151577,0.0002810334,0.0002688471,0.0012516427,0.000860589,0.0012040937,0.0005796341,0.0005017139],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009458375,0.000045971625,0.0007150864,0.00010108189,0.000037448484,0.00024216081,0.0002737566,0.26496002,0.02599487,0.6470624,0.0018036327,0.05866897],"study_design_scores_gemma":[0.00004877017,0.00021076099,0.00041858142,0.000014798223,0.000014261011,0.000115034054,0.00010383555,0.78890496,0.007813145,0.19347024,0.008862936,0.000022655113],"about_ca_topic_score_codex":0.0009775832,"about_ca_topic_score_gemma":0.00080150826,"teacher_disagreement_score":0.004775961,"about_ca_system_score_codex":0.00046355286,"about_ca_system_score_gemma":0.00036320867,"threshold_uncertainty_score":0.015977204},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.038462218,0.00008060047,0.95412505,0.00011280142,0.000049275528,0.00007835867,0.00008234347,0.0016270962,0.0053821886],"genre_scores_gemma":[0.38607442,0.00014334032,0.6046177,0.00012263203,0.000126372,0.00015419586,0.0005394677,0.00046723566,0.007754568],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991691,0.00011216059,0.000045895034,0.0001624201,0.00033721823,0.00017330074],"domain_scores_gemma":[0.99908984,0.00021241934,0.000106588006,0.00035357082,0.00018094972,0.00005668339],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005699516,0.0008582269,0.000602454,0.0007839372,0.00064257893,0.0011119451,0.00097044604,0.00038831646,0.008182869],"category_scores_gemma":[0.0023899977,0.00029976922,0.00086055085,0.0008591241,0.00087029615,0.0023459252,0.0023054443,0.0010230761,0.002866574],"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.0006408416,0.00022243807,0.0022375956,0.00027813326,0.000063427746,0.00030458038,0.00048902625,0.034670793,0.06473952,0.38171822,0.0073330333,0.5073025],"study_design_scores_gemma":[0.00024428044,0.00070101715,0.0013092804,0.00006386556,0.000089919165,0.0007267747,0.00017236914,0.35594362,0.15549691,0.462014,0.02313006,0.00010792461],"about_ca_topic_score_codex":0.00049642974,"about_ca_topic_score_gemma":0.0009131007,"teacher_disagreement_score":0.008182869,"about_ca_system_score_codex":0.0006585368,"about_ca_system_score_gemma":0.0008342238,"threshold_uncertainty_score":0.027374446},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05503716,0.0009364743,0.8928487,0.00038459394,0.0003000697,0.00006950667,0.0002696506,0.00027270685,0.04988118],"genre_scores_gemma":[0.676807,0.0012447108,0.2797617,0.00021590567,0.00014835784,0.00017265933,0.00043301057,0.00037320316,0.040843412],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99969935,0.00008167162,0.000018891364,0.00003116038,0.00012490508,0.000044003646],"domain_scores_gemma":[0.9996195,0.00012603178,0.000030001936,0.0001019861,0.0000819891,0.00004040298],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00065169507,0.0004992916,0.0008060003,0.0008580164,0.0007225003,0.0021039466,0.0012449186,0.0008565832,0.006902639],"category_scores_gemma":[0.0023912305,0.0003431508,0.00056767976,0.0007702586,0.0013124007,0.0020344723,0.0015734994,0.0023983675,0.0014523136],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000033207398,0.000025840547,0.000105423846,0.000042129966,0.000007021567,0.000028449662,0.00011422084,0.02303644,0.00087498483,0.95913213,0.00083120697,0.015768958],"study_design_scores_gemma":[0.000032556014,0.000019929086,0.000084916464,0.00003964287,0.000007863993,0.000044974284,0.0000897013,0.34834054,0.001266962,0.63971424,0.01033836,0.000020303092],"about_ca_topic_score_codex":0.0015879091,"about_ca_topic_score_gemma":0.0028480294,"teacher_disagreement_score":0.006902639,"about_ca_system_score_codex":0.00064994814,"about_ca_system_score_gemma":0.0005692442,"threshold_uncertainty_score":0.023091614},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.20760916,0.00017051525,0.75464714,0.00018980961,0.00010285696,0.000092233975,0.00047042043,0.002825039,0.03389284],"genre_scores_gemma":[0.74804693,0.00022833218,0.23635925,0.00009932253,0.00009822112,0.00007921508,0.0009512752,0.0006872379,0.01345032],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99947804,0.00006320049,0.00003724724,0.00012931145,0.00016871038,0.00012343327],"domain_scores_gemma":[0.9988539,0.00034793833,0.00009239349,0.0003898546,0.00023162797,0.000084290106],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00065117294,0.00047790393,0.000608206,0.00079752295,0.00077433354,0.0015676768,0.0007099342,0.00038822263,0.01650254],"category_scores_gemma":[0.0031051992,0.00026376513,0.00078073936,0.00093669724,0.0010447367,0.0031954297,0.0018120169,0.000842298,0.0032522008],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0008105026,0.000103279555,0.0035553547,0.00037515178,0.00004645998,0.0004800381,0.0006854332,0.044800334,0.032127354,0.66066474,0.010098789,0.24625257],"study_design_scores_gemma":[0.000083432744,0.0001844052,0.00064922054,0.000065007735,0.000029990706,0.0004655986,0.0002448549,0.21016686,0.068721816,0.6965373,0.022805009,0.000046463545],"about_ca_topic_score_codex":0.0006488477,"about_ca_topic_score_gemma":0.0012662146,"teacher_disagreement_score":0.01650254,"about_ca_system_score_codex":0.0005201495,"about_ca_system_score_gemma":0.00072916795,"threshold_uncertainty_score":0.055206478},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.70656633,0.0064953305,0.1619054,0.0034847483,0.0009453354,0.000080335725,0.00029034997,0.00041860208,0.11981355],"genre_scores_gemma":[0.9683791,0.003325782,0.010751221,0.00022268837,0.0008357853,0.000050898947,0.0001939524,0.00020489986,0.016035581],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986393,0.00036635945,0.00007518867,0.00018359623,0.00042123056,0.0003143492],"domain_scores_gemma":[0.9937736,0.004174043,0.0004966183,0.00037150964,0.00064845994,0.000535695],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0026443515,0.0018890369,0.0016759335,0.005307244,0.0020542478,0.004295903,0.001825022,0.0009655438,0.005151249],"category_scores_gemma":[0.015266812,0.0008000024,0.00076243735,0.0047604586,0.0067294533,0.008057821,0.003309167,0.003779614,0.00097257865],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013424057,0.000061014976,0.001417811,0.0001356019,0.00002199776,0.00035889845,0.0009700939,0.0027468477,0.0015292388,0.9769677,0.0015739242,0.014082587],"study_design_scores_gemma":[0.00003333742,0.000032372,0.000571837,0.000056064222,0.000035213212,0.00025298784,0.00019156242,0.009509309,0.00083193625,0.9860546,0.0024083448,0.000022590637],"about_ca_topic_score_codex":0.001543442,"about_ca_topic_score_gemma":0.001566404,"teacher_disagreement_score":0.005307244,"about_ca_system_score_codex":0.002414493,"about_ca_system_score_gemma":0.0010608258,"threshold_uncertainty_score":0.01751846},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.21482697,0.0098550385,0.4769686,0.018940084,0.0010148692,0.00020123224,0.0014690327,0.0011579358,0.27556613],"genre_scores_gemma":[0.9378889,0.0031461,0.03829291,0.0016676575,0.0015157132,0.00030903597,0.0010764116,0.00057816354,0.015525002],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9921949,0.0023116511,0.00036519815,0.0012345231,0.0024073273,0.0014864006],"domain_scores_gemma":[0.9084241,0.07615072,0.0022987116,0.004606914,0.0039447662,0.0045747915],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.011893669,0.0032234448,0.0033903539,0.009173249,0.003680383,0.010216405,0.00662743,0.0034318655,0.018063748],"category_scores_gemma":[0.05165883,0.0015759718,0.002122646,0.0051156487,0.012079888,0.027297055,0.013047364,0.014875641,0.002484514],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000106165586,0.000057908474,0.0004629081,0.00009680076,0.000022728902,0.000060262453,0.00024819403,0.0026341772,0.00045550172,0.9892119,0.0016417474,0.005001778],"study_design_scores_gemma":[0.000017085556,0.000016111784,0.00018362504,0.000043248085,0.000019080193,0.000035751935,0.000041287058,0.011517661,0.00031177964,0.98652816,0.0012703242,0.000015896763],"about_ca_topic_score_codex":0.0013536569,"about_ca_topic_score_gemma":0.0014620529,"teacher_disagreement_score":0.018063748,"about_ca_system_score_codex":0.006263331,"about_ca_system_score_gemma":0.0018259907,"threshold_uncertainty_score":0.06290054},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.39508542,0.0014902011,0.54446226,0.0018669895,0.000108232765,0.00022006704,0.0006810722,0.0005154257,0.055570345],"genre_scores_gemma":[0.86784923,0.0008258424,0.12148048,0.00015789016,0.0002479809,0.0003012855,0.00059726107,0.00020900616,0.008331085],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9952786,0.00052581576,0.00037689874,0.0006667152,0.0026192889,0.0005327588],"domain_scores_gemma":[0.98481005,0.009810196,0.0018317252,0.0015784856,0.0013667321,0.00060276594],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020435865,0.000605507,0.00081320497,0.0028610253,0.001706563,0.005932399,0.0016642981,0.001325449,0.0070370133],"category_scores_gemma":[0.018137004,0.00067453337,0.0016952656,0.002898642,0.0047174264,0.015527195,0.0041767284,0.0023402828,0.00056406343],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00018137395,0.000043261443,0.005226983,0.00025935192,0.000046278525,0.00018915764,0.00081409904,0.034322303,0.005416383,0.9146806,0.0011151098,0.037705023],"study_design_scores_gemma":[0.000013686275,0.00003934453,0.0017358738,0.00004333342,0.000030963092,0.00026561826,0.00020586024,0.07337838,0.005580968,0.9144112,0.0042434293,0.000051408308],"about_ca_topic_score_codex":0.0022198616,"about_ca_topic_score_gemma":0.0022923006,"teacher_disagreement_score":0.0070370133,"about_ca_system_score_codex":0.0036744287,"about_ca_system_score_gemma":0.0016578836,"threshold_uncertainty_score":0.026660025},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.26744777,0.0009777058,0.49457988,0.0034210158,0.001697055,0.0003473098,0.0010622056,0.0012644716,0.22920263],"genre_scores_gemma":[0.8407971,0.0010742901,0.056469917,0.00058535003,0.00095034565,0.00024263599,0.0009443094,0.00061173335,0.09832419],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99884343,0.00024686762,0.00007488842,0.00023530968,0.00041534647,0.00018420363],"domain_scores_gemma":[0.9982962,0.0005025465,0.00016425515,0.00023492119,0.000565563,0.00023665285],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011926406,0.0013571604,0.0009155366,0.0025061818,0.0016273722,0.00449518,0.0011632052,0.0012087311,0.018577289],"category_scores_gemma":[0.004815165,0.0006349988,0.0007921325,0.0018650264,0.0032639974,0.0074493177,0.0019251214,0.0028574455,0.003480646],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000027869593,0.000024305858,0.0000841073,0.000014879455,0.0000031518,0.000045112614,0.00018192749,0.000413263,0.0005081046,0.99084395,0.0016283033,0.006224982],"study_design_scores_gemma":[0.000010806419,0.000011064565,0.000036616122,0.0000040784535,0.0000020087175,0.00006758181,0.000049017977,0.0030103435,0.0002722729,0.9941723,0.0023541893,0.0000098162345],"about_ca_topic_score_codex":0.0013346391,"about_ca_topic_score_gemma":0.0017925731,"teacher_disagreement_score":0.018577289,"about_ca_system_score_codex":0.0015713755,"about_ca_system_score_gemma":0.0010455303,"threshold_uncertainty_score":0.0621472},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.29261008,0.00032941968,0.6810101,0.0005659083,0.00016534401,0.00014145172,0.0011728219,0.006589201,0.017415639],"genre_scores_gemma":[0.7475825,0.00008569995,0.2445843,0.00008904181,0.000072224975,0.0000601273,0.0019073142,0.00076631026,0.0048525482],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9993036,0.00008805996,0.00003870305,0.00018899352,0.0002616621,0.00011897923],"domain_scores_gemma":[0.99807966,0.00084113237,0.00012078582,0.00048112293,0.0003729207,0.00010448298],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005280159,0.0007420548,0.0012938743,0.001613602,0.0012485512,0.0026622089,0.0013924834,0.0009777141,0.011472133],"category_scores_gemma":[0.0042826943,0.0004134718,0.000999635,0.0011997346,0.001116523,0.0030721785,0.0023691752,0.0015908767,0.0024282283],"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.001012584,0.00027121443,0.004823807,0.00067577645,0.00011301249,0.00039503135,0.0007150938,0.037990645,0.03787111,0.2396989,0.02604143,0.6503914],"study_design_scores_gemma":[0.00019063713,0.00018722983,0.0018359842,0.00006711812,0.00010037023,0.00030507758,0.00038365115,0.43692362,0.029010225,0.5153572,0.015561562,0.00007727091],"about_ca_topic_score_codex":0.0011597157,"about_ca_topic_score_gemma":0.0027879686,"teacher_disagreement_score":0.011472133,"about_ca_system_score_codex":0.0010346127,"about_ca_system_score_gemma":0.0013242321,"threshold_uncertainty_score":0.03837812},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.024568431,0.00038916522,0.94314086,0.00029350026,0.00034887108,0.0001058391,0.000084914114,0.0011588533,0.029909588],"genre_scores_gemma":[0.3495366,0.0010392552,0.6092245,0.00042883912,0.00043845733,0.00022921972,0.0004997417,0.0016150123,0.036988392],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9982632,0.0003131574,0.000084876425,0.00048895675,0.0006528074,0.00019698842],"domain_scores_gemma":[0.9983437,0.0006294385,0.00008763791,0.0005158759,0.0003393581,0.00008407705],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013006948,0.00082839676,0.0009840538,0.0014840382,0.0014978652,0.0022684368,0.0011024573,0.00063600845,0.013840759],"category_scores_gemma":[0.007725146,0.00051698904,0.0013901348,0.0012999963,0.00230063,0.0045397785,0.0025993031,0.0026572405,0.0056527774],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013094091,0.000042323278,0.000407702,0.000073818745,0.000018552271,0.00016848603,0.00023954755,0.008036486,0.005029733,0.85991585,0.00329475,0.1226418],"study_design_scores_gemma":[0.000022482871,0.000041539843,0.00016761452,0.0000255679,0.00001610924,0.00027545632,0.000054116925,0.049556863,0.0123197865,0.92082345,0.01667434,0.000022688744],"about_ca_topic_score_codex":0.00052691536,"about_ca_topic_score_gemma":0.00049636443,"teacher_disagreement_score":0.013840759,"about_ca_system_score_codex":0.0008945939,"about_ca_system_score_gemma":0.0006051943,"threshold_uncertainty_score":0.04630196},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0050780503,0.000083286875,0.98849154,0.00011287332,0.000040413528,0.00006294707,0.00024703555,0.0011458703,0.004738037],"genre_scores_gemma":[0.209403,0.00026040195,0.77904844,0.00022113962,0.00006701459,0.0003243601,0.0012550082,0.0011924942,0.0082281865],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986498,0.00025907272,0.00007954537,0.00021644252,0.0005945053,0.0002006263],"domain_scores_gemma":[0.99811506,0.00051940646,0.00011833661,0.00078353955,0.00035779065,0.00010584757],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011169135,0.00062043325,0.0008178693,0.0015261575,0.0007185445,0.0018570229,0.0025088356,0.00071041205,0.015403067],"category_scores_gemma":[0.0042153555,0.00066439697,0.0016033616,0.0014428631,0.0011917595,0.0033933744,0.0033419458,0.0018886727,0.002944079],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003222201,0.0000815937,0.0014102707,0.0005806387,0.00009934987,0.00034666658,0.0003785812,0.06897863,0.013429205,0.5907178,0.01450147,0.3091536],"study_design_scores_gemma":[0.000110499954,0.00010525794,0.00032269608,0.000111688256,0.00007161476,0.00058299396,0.00014161089,0.6267296,0.018519046,0.30169368,0.051532134,0.00007917014],"about_ca_topic_score_codex":0.0016411329,"about_ca_topic_score_gemma":0.0021238886,"teacher_disagreement_score":0.015403067,"about_ca_system_score_codex":0.00079241,"about_ca_system_score_gemma":0.0017559455,"threshold_uncertainty_score":0.051528394},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5355101,0.0018533224,0.3864106,0.0010022039,0.00018405673,0.00004993245,0.0002613864,0.00018524911,0.07454319],"genre_scores_gemma":[0.9578311,0.0007930938,0.026810745,0.00007804879,0.00016126821,0.000056868143,0.00017976551,0.00003874588,0.014050344],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99969614,0.000052940355,0.000012192141,0.000049426602,0.0001370136,0.000052277886],"domain_scores_gemma":[0.9993248,0.00022062108,0.0001574999,0.000051815212,0.00009513586,0.00015007264],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00052983995,0.0002878118,0.00039181052,0.0016834033,0.0011423973,0.0014745938,0.0004779402,0.00032360584,0.0022568689],"category_scores_gemma":[0.0012878556,0.00021533549,0.00035625382,0.00089850335,0.0030031563,0.0029342794,0.0013434131,0.0011098456,0.0003280503],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008203341,0.0000045388347,0.00036094032,0.0000117806585,0.0000018894982,0.00003252874,0.00018488974,0.0010203277,0.00059038546,0.9951794,0.00024943022,0.0023557858],"study_design_scores_gemma":[0.000007805024,0.00002323772,0.0014285372,0.000019005183,0.000006893778,0.00023335623,0.0003039226,0.017976265,0.002097393,0.9678545,0.0100296,0.000019485236],"about_ca_topic_score_codex":0.001447437,"about_ca_topic_score_gemma":0.0010571283,"teacher_disagreement_score":0.0022568689,"about_ca_system_score_codex":0.0012463697,"about_ca_system_score_gemma":0.00047946608,"threshold_uncertainty_score":0.009043038},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.02106933,0.00019670524,0.9509823,0.00034425556,0.00022930857,0.00016645905,0.00058859953,0.005444017,0.020979008],"genre_scores_gemma":[0.2371387,0.00033195651,0.7285643,0.00047198465,0.0001719041,0.000427036,0.0025589173,0.002503205,0.027831964],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99673873,0.00069914124,0.00018032826,0.00089397014,0.0010637633,0.00042402954],"domain_scores_gemma":[0.9968472,0.0005904597,0.00018419314,0.0013752114,0.00088491576,0.000117901705],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00108666,0.0009447694,0.0009559049,0.0008906191,0.0011489005,0.0021483512,0.001431931,0.00064088235,0.018314937],"category_scores_gemma":[0.0068617593,0.0005954697,0.0012222624,0.0011043315,0.0016770278,0.0035461884,0.003417932,0.0019493558,0.009972148],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005318372,0.00015335798,0.0014743312,0.00033659773,0.000076215845,0.00026767436,0.00041458785,0.042592674,0.0430757,0.53857803,0.030450536,0.34204844],"study_design_scores_gemma":[0.00008468883,0.00022419373,0.000694648,0.000087156426,0.000047159585,0.00055513205,0.00025511766,0.2279972,0.120822564,0.57238233,0.07671337,0.00013645102],"about_ca_topic_score_codex":0.0012558922,"about_ca_topic_score_gemma":0.0016182823,"teacher_disagreement_score":0.018314937,"about_ca_system_score_codex":0.000970871,"about_ca_system_score_gemma":0.0013816034,"threshold_uncertainty_score":0.06126952},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.029166732,0.00010370507,0.9622339,0.00018833549,0.00006200058,0.00006314034,0.0002322809,0.0015704581,0.006379495],"genre_scores_gemma":[0.23905657,0.00018274484,0.7521108,0.000118831136,0.00005267349,0.000080216756,0.0009275027,0.00045535926,0.007015291],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99937797,0.000105258085,0.000047090354,0.000119484794,0.00025338412,0.00009685987],"domain_scores_gemma":[0.99946994,0.00012259664,0.000041386455,0.00022165896,0.00012452036,0.00001992723],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006192576,0.00062046724,0.0007333499,0.0009843549,0.00043797898,0.0013542493,0.00086400297,0.0004028643,0.010178407],"category_scores_gemma":[0.0024347943,0.00031304025,0.0006616785,0.0008733948,0.00075655105,0.002077316,0.0015092929,0.0011838187,0.0043318826],"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.00048167692,0.000100032514,0.0015264044,0.00040409662,0.00003826811,0.00023523375,0.0003049067,0.026165428,0.060778294,0.26901722,0.009284233,0.6316643],"study_design_scores_gemma":[0.00015769756,0.00032959497,0.000996312,0.00009414378,0.00004372497,0.000932441,0.0004841037,0.43739328,0.17203027,0.33335057,0.05407458,0.0001133054],"about_ca_topic_score_codex":0.00040692944,"about_ca_topic_score_gemma":0.00053824333,"teacher_disagreement_score":0.010178407,"about_ca_system_score_codex":0.00040189325,"about_ca_system_score_gemma":0.0006276099,"threshold_uncertainty_score":0.034050226},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04135557,0.003393837,0.850873,0.02604732,0.0018925325,0.000035679663,0.00023457575,0.0013593098,0.07480815],"genre_scores_gemma":[0.630804,0.0028251274,0.32708916,0.0036705236,0.00066586817,0.00006956255,0.00019402592,0.0012552154,0.03342649],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99873346,0.0003239258,0.000063260704,0.0003308311,0.00039191364,0.00015658847],"domain_scores_gemma":[0.9954035,0.002223929,0.00028451617,0.001236791,0.00065688917,0.00019428275],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0024284062,0.000535547,0.00063524063,0.0009625288,0.002247782,0.004758281,0.0021402836,0.0028053683,0.01391714],"category_scores_gemma":[0.018828139,0.0004017902,0.0007509084,0.001049519,0.0049249893,0.0183653,0.0023337875,0.005671658,0.004095008],"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.000047761114,0.0000111006775,0.00058992376,0.00007513176,0.000009295551,0.0001139452,0.00056601927,0.0015535115,0.0012890939,0.94795746,0.0054316972,0.04235514],"study_design_scores_gemma":[0.00000596695,0.000015816688,0.000112284106,0.00004309007,0.00000615931,0.00019083655,0.0002819158,0.00428758,0.002603672,0.97105724,0.021376448,0.000018891198],"about_ca_topic_score_codex":0.0011520326,"about_ca_topic_score_gemma":0.0011060913,"teacher_disagreement_score":0.01391714,"about_ca_system_score_codex":0.0010371009,"about_ca_system_score_gemma":0.00082834,"threshold_uncertainty_score":0.046557486},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13382865,0.0011367004,0.816463,0.0018126229,0.0015741246,0.00016797043,0.00044053714,0.0010391735,0.04353723],"genre_scores_gemma":[0.737608,0.0008278648,0.22960648,0.0008090179,0.0010962004,0.0002616686,0.0007348615,0.00047263052,0.028583251],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99898595,0.00025580425,0.00008020112,0.00022173044,0.00029502984,0.0001613474],"domain_scores_gemma":[0.99864453,0.00042480728,0.00012831764,0.00040599718,0.00026041295,0.00013602289],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001035033,0.0006645506,0.00086370046,0.0011458511,0.0015511431,0.0028687608,0.0011760656,0.00087194203,0.012404096],"category_scores_gemma":[0.0043519624,0.0004156146,0.00063852384,0.001289803,0.0019500091,0.0053969235,0.0021229095,0.002337748,0.0030896433],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012884128,0.000020054638,0.0001372144,0.000053335145,0.000006380244,0.000050752533,0.00009141478,0.0034822528,0.0024729527,0.9654296,0.0035823442,0.024544844],"study_design_scores_gemma":[0.000021069125,0.000031726202,0.00005855823,0.000013171852,0.0000051793377,0.00006436794,0.000021105063,0.023120735,0.0017130352,0.9693112,0.0056179618,0.000021874392],"about_ca_topic_score_codex":0.0007288286,"about_ca_topic_score_gemma":0.00087073486,"teacher_disagreement_score":0.012404096,"about_ca_system_score_codex":0.0011963311,"about_ca_system_score_gemma":0.001129309,"threshold_uncertainty_score":0.0414958},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13343559,0.0006283008,0.8125171,0.0003689214,0.0001828062,0.000088494955,0.0001783858,0.0011246066,0.05147569],"genre_scores_gemma":[0.6472496,0.0006649895,0.33191812,0.00019152822,0.00014533948,0.00015794035,0.0005041642,0.00029267103,0.018875588],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99930465,0.00011995851,0.000036953927,0.000110025016,0.00029622082,0.00013221991],"domain_scores_gemma":[0.99915504,0.00041885386,0.0000601727,0.00018455232,0.0001409795,0.000040379782],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005809122,0.0004053939,0.00043564264,0.0007649889,0.0009731681,0.0016157888,0.0008559659,0.00042226206,0.012142422],"category_scores_gemma":[0.0029485798,0.00021536299,0.00065451284,0.001285691,0.0010703049,0.0034556412,0.0015010893,0.0010730497,0.0022815156],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00015816922,0.000043648586,0.00072920043,0.0001684827,0.000014506445,0.00014911659,0.0003947842,0.019713927,0.008026607,0.8607702,0.004576089,0.10525522],"study_design_scores_gemma":[0.00003392253,0.000109674875,0.00030604526,0.00004781362,0.00001581747,0.00033400767,0.00015855947,0.174999,0.011523584,0.7915272,0.020920398,0.000023990482],"about_ca_topic_score_codex":0.0008863258,"about_ca_topic_score_gemma":0.0011455417,"teacher_disagreement_score":0.012142422,"about_ca_system_score_codex":0.0010097005,"about_ca_system_score_gemma":0.00038110383,"threshold_uncertainty_score":0.040620446},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8800745,0.0003076446,0.10448459,0.00018262521,0.00005308922,0.00003792773,0.00038416722,0.0005867775,0.013888566],"genre_scores_gemma":[0.9355889,0.00024272234,0.05604426,0.000029766095,0.000040259434,0.00003219364,0.0008722284,0.00022247637,0.0069271284],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99981266,0.000024599958,0.0000118540875,0.00005442536,0.00005493808,0.00004161206],"domain_scores_gemma":[0.99917656,0.00032161354,0.00008858225,0.00010981228,0.00013897468,0.00016437523],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00038452385,0.000579694,0.0007175759,0.0018616538,0.00093575526,0.0026904612,0.0011626646,0.00074731227,0.008997232],"category_scores_gemma":[0.0019456623,0.00046111704,0.00046882787,0.0010785465,0.0017736347,0.0030986567,0.0013559536,0.001197558,0.001458798],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0008724635,0.0002447734,0.01453155,0.0005389364,0.00009275341,0.00083086285,0.0017484186,0.030660704,0.02417988,0.83055514,0.004783846,0.09096062],"study_design_scores_gemma":[0.000055866025,0.00015731184,0.0032978381,0.00011322493,0.000052705327,0.00032992958,0.00096603774,0.15603985,0.0120785935,0.8220897,0.004775104,0.000043849665],"about_ca_topic_score_codex":0.0012310089,"about_ca_topic_score_gemma":0.0021660023,"teacher_disagreement_score":0.008997232,"about_ca_system_score_codex":0.00070684904,"about_ca_system_score_gemma":0.00035058864,"threshold_uncertainty_score":0.030098736},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08155993,0.00043902377,0.8897257,0.00035607215,0.00010207108,0.0000627413,0.00016854808,0.00092678104,0.02665909],"genre_scores_gemma":[0.7735526,0.00041355458,0.21750607,0.000067230605,0.00006662133,0.0000926139,0.00025844784,0.00026577836,0.0077771256],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.999673,0.000086357766,0.00001640691,0.000022901371,0.00015735492,0.000044010547],"domain_scores_gemma":[0.99932945,0.00029613692,0.000049441896,0.00012063769,0.00016532597,0.000038998198],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00092399685,0.00044853,0.00064242835,0.0007604253,0.0005658104,0.0016831108,0.0008859535,0.0005230398,0.005866334],"category_scores_gemma":[0.0041479096,0.00026457515,0.00036613463,0.00063440227,0.0009498902,0.001787142,0.0011250323,0.00119382,0.0012009545],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000086203756,0.00004738447,0.00046683158,0.00011729849,0.000014420703,0.00009384649,0.00024809438,0.15401216,0.0040134797,0.7771562,0.0016892732,0.062054932],"study_design_scores_gemma":[0.00003715838,0.000023074848,0.000079116995,0.000037145375,0.000006943427,0.000034256595,0.00004461511,0.7752772,0.0042496286,0.21551305,0.0046838624,0.000013836205],"about_ca_topic_score_codex":0.0010521084,"about_ca_topic_score_gemma":0.0019148927,"teacher_disagreement_score":0.005866334,"about_ca_system_score_codex":0.0008878565,"about_ca_system_score_gemma":0.00076218933,"threshold_uncertainty_score":0.01962477},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.013483325,0.0002219165,0.96921164,0.00018460215,0.00021244031,0.00008183191,0.000129504,0.001054772,0.015419991],"genre_scores_gemma":[0.21422912,0.0010887005,0.76195556,0.00028510913,0.0003973595,0.00022065685,0.0008430363,0.0007782121,0.020202253],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992741,0.00009158543,0.000056341876,0.00011983947,0.0003097657,0.00014841078],"domain_scores_gemma":[0.9989229,0.00022845296,0.000055408178,0.0005315238,0.00017196269,0.00008981482],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00061593746,0.00060485693,0.0005763164,0.0011335646,0.0011406803,0.0014587694,0.0008725052,0.00044411782,0.018772779],"category_scores_gemma":[0.0024323333,0.0004332462,0.0013699353,0.0014051206,0.0009347345,0.0029009269,0.0036723013,0.0025289648,0.0053002755],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00019653687,0.0001392182,0.00045066062,0.00029693494,0.0000339364,0.00027076938,0.00087251735,0.004960143,0.029928524,0.53622144,0.015145572,0.41148373],"study_design_scores_gemma":[0.00010087872,0.00022025913,0.00049170904,0.00018187077,0.000074954754,0.0007825728,0.0005404997,0.08365609,0.031990815,0.77979666,0.1020903,0.00007346064],"about_ca_topic_score_codex":0.00050459127,"about_ca_topic_score_gemma":0.0008989392,"teacher_disagreement_score":0.018772779,"about_ca_system_score_codex":0.00043617343,"about_ca_system_score_gemma":0.00036611702,"threshold_uncertainty_score":0.06280118},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2116708,0.00017871248,0.7810455,0.00018687622,0.000050279403,0.000092545204,0.0003277822,0.0023028902,0.00414468],"genre_scores_gemma":[0.3723157,0.000121986035,0.6208398,0.000058074507,0.00007385384,0.00012854322,0.0011539942,0.00080835767,0.004499819],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99837744,0.00035998644,0.00016218868,0.00030099112,0.00055095606,0.00024845355],"domain_scores_gemma":[0.9954325,0.0022301178,0.00040925515,0.0008513052,0.00077880744,0.00029808382],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0024694353,0.00064933364,0.001258148,0.0026486686,0.0012015707,0.002233427,0.0013523051,0.0009255485,0.0053449874],"category_scores_gemma":[0.014222139,0.0006436663,0.0013416486,0.0013509503,0.0012559413,0.0049992,0.002431727,0.0011813067,0.002437056],"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.0012344865,0.0003506544,0.009678499,0.0007857256,0.0001661779,0.0007475563,0.0021827428,0.04604564,0.05274822,0.35908353,0.011607406,0.5153694],"study_design_scores_gemma":[0.00010396591,0.00045485666,0.0016709862,0.000088101035,0.000073861156,0.0007494646,0.000584677,0.29766425,0.043402355,0.6409653,0.014083443,0.00015881675],"about_ca_topic_score_codex":0.0004129969,"about_ca_topic_score_gemma":0.00080779643,"teacher_disagreement_score":0.0053449874,"about_ca_system_score_codex":0.0007347731,"about_ca_system_score_gemma":0.0010300389,"threshold_uncertainty_score":0.017880738},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.25750527,0.00041730874,0.62179095,0.00062080665,0.00031896302,0.00014295263,0.00075364806,0.00047521904,0.117975004],"genre_scores_gemma":[0.91551733,0.00031189926,0.052701563,0.00016818619,0.00015468172,0.00009668534,0.00081813557,0.00015620192,0.030075332],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99959356,0.00006568372,0.000028608256,0.000063391184,0.00014462309,0.00010412619],"domain_scores_gemma":[0.99919635,0.00018749478,0.000078642755,0.000112216825,0.0003070596,0.00011831701],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00046664182,0.00036137176,0.0006089674,0.00094188075,0.00077437237,0.0020421874,0.00064435095,0.00043816713,0.019021297],"category_scores_gemma":[0.0012838263,0.00022317322,0.00058117806,0.0006489241,0.0013470639,0.0015313092,0.0008944998,0.0011858739,0.0017280517],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005078852,0.000028858229,0.00015955331,0.00003191124,0.000008176863,0.00005099552,0.00021745152,0.005029409,0.0017153948,0.98223084,0.0017185543,0.008758005],"study_design_scores_gemma":[0.000016248387,0.000024897812,0.00012188406,0.000010872238,0.000006921216,0.000044303153,0.00012520346,0.065114945,0.00076852186,0.930144,0.0036118117,0.000010249683],"about_ca_topic_score_codex":0.0022727933,"about_ca_topic_score_gemma":0.003165529,"teacher_disagreement_score":0.019021297,"about_ca_system_score_codex":0.00089373434,"about_ca_system_score_gemma":0.0007656198,"threshold_uncertainty_score":0.06363261},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008566555,0.0044726306,0.93563646,0.0008063874,0.00024351553,0.00008447467,0.00016271447,0.0010326247,0.048994627],"genre_scores_gemma":[0.30561888,0.012924211,0.62970275,0.0010195965,0.00080837304,0.00033203745,0.0010663123,0.0009253791,0.04760245],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99922943,0.00019989302,0.000049285747,0.00014742701,0.00027463597,0.00009929785],"domain_scores_gemma":[0.99954236,0.00021404613,0.00003635629,0.00012711625,0.00005726126,0.000022844395],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006677611,0.0007461438,0.00074527966,0.0012397115,0.0010583749,0.0017452743,0.0010355347,0.0005540887,0.020259801],"category_scores_gemma":[0.0022619285,0.00049421255,0.0010280546,0.002214939,0.0023542685,0.002659072,0.0031025154,0.0029405567,0.0043464927],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000071661234,0.00005722635,0.00040240484,0.00036307814,0.00003676109,0.00021083288,0.00042960426,0.02016668,0.0024163006,0.7261032,0.012617219,0.23712504],"study_design_scores_gemma":[0.00003129297,0.000072801784,0.0005166249,0.00014297571,0.000019495545,0.00032677973,0.00019978482,0.048577417,0.003776498,0.87017745,0.07612689,0.000032006596],"about_ca_topic_score_codex":0.0024301105,"about_ca_topic_score_gemma":0.0019213733,"teacher_disagreement_score":0.020259801,"about_ca_system_score_codex":0.0009063895,"about_ca_system_score_gemma":0.0007817604,"threshold_uncertainty_score":0.067775786},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.057878062,0.0013632233,0.8318752,0.0014213095,0.0009736723,0.000086206244,0.00014140579,0.000863544,0.10539737],"genre_scores_gemma":[0.6477078,0.0021065515,0.28216666,0.00058127096,0.0008006743,0.00020354892,0.00030839493,0.00073371665,0.065391384],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99951744,0.00011692363,0.00003402016,0.00008693701,0.00017139994,0.000073131116],"domain_scores_gemma":[0.99919206,0.00039403627,0.000037976653,0.00017981457,0.00013243404,0.00006360038],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007957318,0.00080882624,0.0008522454,0.002346368,0.0018789155,0.002004098,0.001345148,0.0008915424,0.018263783],"category_scores_gemma":[0.002843241,0.0004756754,0.0011490438,0.0023909723,0.0026399437,0.0065877116,0.0029625597,0.004009638,0.0026475654],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000021910966,0.000018583665,0.00006439488,0.00003310461,0.00000645024,0.000039073224,0.00026202205,0.00074303726,0.0008569561,0.9747338,0.0013170881,0.021903569],"study_design_scores_gemma":[0.000007652618,0.00001154331,0.000039988776,0.000011666199,0.0000062290974,0.00003010872,0.000061766295,0.005220023,0.00056454266,0.9893299,0.0047086873,0.000007874046],"about_ca_topic_score_codex":0.0013176227,"about_ca_topic_score_gemma":0.0018934861,"teacher_disagreement_score":0.018263783,"about_ca_system_score_codex":0.0011509893,"about_ca_system_score_gemma":0.00051431987,"threshold_uncertainty_score":0.061098456},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.059687473,0.00025744003,0.9250386,0.0006281934,0.00016010461,0.00013758868,0.00022779817,0.0034033898,0.010459406],"genre_scores_gemma":[0.68052405,0.0002808397,0.3034808,0.0004392257,0.00029340724,0.00021708815,0.0008266762,0.0012570588,0.0126809515],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9961111,0.00091422437,0.00024383048,0.00066351146,0.0013675981,0.0006997653],"domain_scores_gemma":[0.9916545,0.003397443,0.00045339068,0.0030846372,0.0011246742,0.0002853793],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0027057158,0.0013967268,0.0012965266,0.0013953018,0.0012718479,0.0036850243,0.002582331,0.0012359134,0.013048525],"category_scores_gemma":[0.013643214,0.00083071645,0.0014455534,0.0016028625,0.0017681943,0.007752037,0.0064221793,0.0032955927,0.0032269384],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.001814799,0.0004111614,0.0024226194,0.00032035183,0.00013464162,0.00017324969,0.00057618355,0.05077999,0.016781192,0.52185357,0.012992185,0.39174014],"study_design_scores_gemma":[0.00022725968,0.00018865264,0.00034884157,0.000052294356,0.00009369886,0.00013870912,0.00010663949,0.27800447,0.024106516,0.6921076,0.0045729964,0.000052332074],"about_ca_topic_score_codex":0.0006591128,"about_ca_topic_score_gemma":0.0016707607,"teacher_disagreement_score":0.013048525,"about_ca_system_score_codex":0.0018282788,"about_ca_system_score_gemma":0.0017950644,"threshold_uncertainty_score":0.0436517},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6822766,0.0035726049,0.27945456,0.0014843014,0.00015173531,0.0001223311,0.00058643933,0.0015590164,0.030792363],"genre_scores_gemma":[0.93000364,0.0010556909,0.06298095,0.00009944271,0.00023858294,0.00008252924,0.0006476652,0.00022579146,0.0046657603],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9977641,0.00034757992,0.00016644003,0.0002980455,0.0010935226,0.00033035083],"domain_scores_gemma":[0.9888144,0.007904714,0.0008495682,0.001346817,0.00086504145,0.0002194253],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016069233,0.0006634169,0.00065575977,0.0015430835,0.00084486377,0.0022968014,0.0014675175,0.0005175092,0.0057403157],"category_scores_gemma":[0.014431811,0.00025560183,0.00070925936,0.0027242624,0.0013607407,0.0058887852,0.0012470668,0.0013329827,0.00081965595],"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.0029636554,0.00078449736,0.01508972,0.0010367298,0.00016230356,0.00044975593,0.00078297564,0.31899232,0.040133674,0.28443673,0.009210065,0.32595754],"study_design_scores_gemma":[0.000088089146,0.0002528546,0.0030517706,0.000031113916,0.00006128525,0.0002736864,0.00009704086,0.8797398,0.019255966,0.094528966,0.002575747,0.000043504235],"about_ca_topic_score_codex":0.0018285243,"about_ca_topic_score_gemma":0.0024965936,"teacher_disagreement_score":0.0057403157,"about_ca_system_score_codex":0.0019199875,"about_ca_system_score_gemma":0.0018297806,"threshold_uncertainty_score":0.019203246},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.48635408,0.0004564078,0.48547834,0.00063767476,0.00021080406,0.00008571687,0.0004789537,0.001709285,0.024588715],"genre_scores_gemma":[0.8982233,0.00021835534,0.09543778,0.000107519634,0.00008286775,0.000026610995,0.0005135089,0.00028724066,0.0051028593],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99898285,0.00011727552,0.000072237846,0.00023796933,0.00037871444,0.00021093554],"domain_scores_gemma":[0.9973627,0.0011541378,0.00018585126,0.0007115037,0.00037334932,0.00021250015],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008511275,0.0004932203,0.0009520702,0.0025910076,0.0010554323,0.0034387803,0.0012220948,0.00045681314,0.006008788],"category_scores_gemma":[0.00508077,0.00056168536,0.0008778032,0.002727879,0.002944198,0.0073230937,0.002778724,0.0017426767,0.00089372875],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000525464,0.00015837666,0.008671269,0.00016836615,0.000047457932,0.00028256953,0.001000581,0.016933812,0.008544877,0.795216,0.0040289415,0.16442217],"study_design_scores_gemma":[0.000040453862,0.00005387615,0.00086029375,0.000018964105,0.00003692718,0.00012653561,0.00020573947,0.03365973,0.0063625146,0.9532739,0.0053288527,0.000032327214],"about_ca_topic_score_codex":0.0021052114,"about_ca_topic_score_gemma":0.0032218057,"teacher_disagreement_score":0.006008788,"about_ca_system_score_codex":0.0017783339,"about_ca_system_score_gemma":0.00090112607,"threshold_uncertainty_score":0.020101368},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.047666036,0.0070067886,0.87172973,0.00091686746,0.0005551521,0.00015025809,0.00022647805,0.0049385387,0.06681028],"genre_scores_gemma":[0.2602939,0.00483948,0.7003644,0.0005672321,0.000425887,0.0002387338,0.00089106656,0.0014849133,0.030894332],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995009,0.0001042634,0.000024586681,0.000068335234,0.0002266945,0.00007524823],"domain_scores_gemma":[0.9992349,0.00030736445,0.000028293725,0.00023441485,0.00016305705,0.000031925036],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00053153094,0.0008760977,0.00072450156,0.00057820557,0.00063144084,0.0010785378,0.0013254464,0.0005463314,0.008775906],"category_scores_gemma":[0.0016430614,0.00044365198,0.0007737247,0.0012736801,0.00059190294,0.0024173672,0.0011378374,0.0016206816,0.0028840015],"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.00047988954,0.00019444675,0.0005851093,0.0006873641,0.00009047893,0.00014810883,0.00025166592,0.059861213,0.047654707,0.18045454,0.044335824,0.6652566],"study_design_scores_gemma":[0.00011958743,0.000309226,0.00086236733,0.00013685424,0.00008196338,0.00042886927,0.00009329462,0.5812818,0.03682167,0.30908448,0.07073805,0.00004191313],"about_ca_topic_score_codex":0.0010176407,"about_ca_topic_score_gemma":0.0024619366,"teacher_disagreement_score":0.008775906,"about_ca_system_score_codex":0.0005962771,"about_ca_system_score_gemma":0.00081622927,"threshold_uncertainty_score":0.029358387},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.14360675,0.00062090287,0.83495474,0.00048242632,0.00023752073,0.00009221881,0.00015837251,0.0007453727,0.019101797],"genre_scores_gemma":[0.8266672,0.0005929821,0.15476368,0.00014909921,0.00019669444,0.00011763343,0.0003718973,0.00031135982,0.016829452],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.999154,0.00021984434,0.00007042957,0.00016645854,0.00024188252,0.00014742094],"domain_scores_gemma":[0.99845326,0.0006227743,0.00020632845,0.00023718517,0.00032263057,0.00015784366],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010260683,0.0008773165,0.0010239864,0.0010999532,0.00097306893,0.0027567137,0.0010653224,0.001106779,0.009943636],"category_scores_gemma":[0.0044610216,0.0005414235,0.0011153963,0.0006987473,0.0027515457,0.0034229318,0.0031916578,0.0014971736,0.0010998029],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013484551,0.000089250265,0.0007633911,0.00012911449,0.00005113314,0.00018314659,0.00047766737,0.06708095,0.0049322774,0.88274866,0.001767205,0.041642413],"study_design_scores_gemma":[0.00004581912,0.00006999933,0.00018034127,0.000026215177,0.000021341424,0.000080307465,0.00014660328,0.2660859,0.0024524122,0.72512054,0.0057405964,0.000029867406],"about_ca_topic_score_codex":0.0022679735,"about_ca_topic_score_gemma":0.002606544,"teacher_disagreement_score":0.009943636,"about_ca_system_score_codex":0.0012526225,"about_ca_system_score_gemma":0.0007738309,"threshold_uncertainty_score":0.033264756},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15954845,0.005469095,0.61263645,0.008065146,0.0036698724,0.0002533486,0.00043238117,0.00029238578,0.20963286],"genre_scores_gemma":[0.80689013,0.0046537626,0.12811518,0.0037479056,0.002769552,0.00023049595,0.00024855073,0.00019549276,0.05314894],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99937844,0.00010704926,0.00002898455,0.00016060851,0.00020426803,0.00012062312],"domain_scores_gemma":[0.99912757,0.00040780744,0.00006782836,0.00013986492,0.00019206226,0.000064920154],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010178728,0.00049269444,0.00090345676,0.0013202091,0.0019184648,0.001179624,0.0011134158,0.00078190985,0.004148617],"category_scores_gemma":[0.0042721904,0.00022893607,0.00080422044,0.001565516,0.002462528,0.0030581816,0.0020279197,0.0028439604,0.0007519671],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000035048302,0.000025119036,0.00032137375,0.00009967475,0.000012388779,0.00017620479,0.0003141945,0.0026107575,0.0021455963,0.96649563,0.0043414123,0.023422664],"study_design_scores_gemma":[0.000024725761,0.000035142664,0.00036345297,0.000028379387,0.00001069479,0.00032636063,0.00007346929,0.010013552,0.001675785,0.96008265,0.0273433,0.000022363442],"about_ca_topic_score_codex":0.0020337463,"about_ca_topic_score_gemma":0.0012779167,"teacher_disagreement_score":0.004148617,"about_ca_system_score_codex":0.0011075288,"about_ca_system_score_gemma":0.00082100637,"threshold_uncertainty_score":0.013878465},"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.19544476,0.010262807,0.22277988,0.0092717875,0.0014110672,0.00007048221,0.0007872538,0.00024179637,0.55973023],"genre_scores_gemma":[0.9091787,0.008561244,0.019031933,0.0008991919,0.0015279899,0.000053110867,0.00061760814,0.00016362935,0.059966646],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99952936,0.00016470038,0.000017218012,0.00008413444,0.00013322906,0.000071335504],"domain_scores_gemma":[0.99948704,0.00024198438,0.000044039683,0.000053869393,0.00009323174,0.00007985401],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006254072,0.00067744753,0.0006531722,0.0014733888,0.0016218518,0.003303284,0.0006693476,0.00053285947,0.0088799],"category_scores_gemma":[0.0013769495,0.00038962724,0.00046274203,0.001438397,0.0043307473,0.0069832546,0.0027530417,0.0030838093,0.0017347108],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000007909859,0.0000028495458,0.000037160215,0.000010151686,0.0000012066704,0.000017163899,0.00008617067,0.0002604629,0.00012501844,0.9971752,0.00067592546,0.0016008387],"study_design_scores_gemma":[0.0000037197622,0.0000048972815,0.00007662091,0.000006837821,0.0000019343695,0.000035292353,0.00008028631,0.0007022509,0.00010002815,0.99371064,0.0052739643,0.0000035143212],"about_ca_topic_score_codex":0.001154721,"about_ca_topic_score_gemma":0.0005679584,"teacher_disagreement_score":0.0088799,"about_ca_system_score_codex":0.00094431895,"about_ca_system_score_gemma":0.00046222893,"threshold_uncertainty_score":0.02970624},"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":"empirical","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.63265544,0.0018861005,0.24923043,0.0012656999,0.00043613432,0.00009135859,0.00044439838,0.0016696941,0.11232081],"genre_scores_gemma":[0.9308961,0.000374648,0.056584194,0.0001360268,0.00012154182,0.000023614257,0.00027722857,0.00015291396,0.011433717],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9993554,0.00015955811,0.0000467941,0.0001356555,0.00016849143,0.00013414862],"domain_scores_gemma":[0.9986388,0.00065415195,0.00010869809,0.00030604802,0.00020109935,0.00009122239],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012062157,0.00049336744,0.00065378536,0.0012360351,0.0010422524,0.0023021146,0.0010579188,0.00052934856,0.010604169],"category_scores_gemma":[0.0037471608,0.00029239914,0.0007129065,0.0012615402,0.0016095549,0.005453755,0.0017297156,0.0011716445,0.0011919689],"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.0003295247,0.00007012982,0.0012964896,0.00019993204,0.000025536054,0.00018008311,0.00044906806,0.008463919,0.003908451,0.9059788,0.0032917932,0.07580635],"study_design_scores_gemma":[0.000042219355,0.000060046274,0.00043012475,0.000046495003,0.000028042386,0.00014554728,0.00012119066,0.03159548,0.007818716,0.950029,0.009655645,0.000027522037],"about_ca_topic_score_codex":0.0008219222,"about_ca_topic_score_gemma":0.0016919619,"teacher_disagreement_score":0.010604169,"about_ca_system_score_codex":0.0012479371,"about_ca_system_score_gemma":0.000674238,"threshold_uncertainty_score":0.03547448},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04619574,0.0009565049,0.9314113,0.00025817196,0.00025075488,0.00013531186,0.00024663855,0.0042522214,0.016293429],"genre_scores_gemma":[0.36222863,0.0007629163,0.6163852,0.0002466921,0.00017778651,0.00026174026,0.0013132861,0.0009265293,0.017697163],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99866784,0.0002985272,0.000075173906,0.00023525037,0.0004953587,0.00022786074],"domain_scores_gemma":[0.9983872,0.00071415125,0.00007336266,0.00043498637,0.00032620138,0.00006411774],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00093754416,0.0009941558,0.0009015614,0.0015555538,0.0011324994,0.002936215,0.0012174033,0.0007779629,0.014800183],"category_scores_gemma":[0.0047452427,0.00061989896,0.0009548422,0.0021436133,0.0008120381,0.004246889,0.0030421433,0.0020806696,0.0041646166],"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.0006067015,0.00024763285,0.0006538004,0.00021235326,0.00005849531,0.000112429036,0.000249996,0.019639313,0.010167971,0.19039905,0.01449969,0.7631527],"study_design_scores_gemma":[0.00031300154,0.00023721626,0.0007190356,0.00009835261,0.00008751284,0.0003831546,0.00035041495,0.38052025,0.037539914,0.5491414,0.030520998,0.000088776425],"about_ca_topic_score_codex":0.0017497304,"about_ca_topic_score_gemma":0.0030196458,"teacher_disagreement_score":0.014800183,"about_ca_system_score_codex":0.00090377696,"about_ca_system_score_gemma":0.001193093,"threshold_uncertainty_score":0.04951155},"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":"software","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"software","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0005592163,0.00024529814,0.94130343,0.00012823057,0.00009901419,0.000108474225,0.0037784432,0.043910842,0.009867202],"genre_scores_gemma":[0.02141083,0.0008557902,0.91328365,0.0004117149,0.00019316077,0.001294489,0.014047868,0.018866744,0.02963575],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9990934,0.00014767022,0.00007792998,0.00013375134,0.00045145,0.00009584226],"domain_scores_gemma":[0.9986945,0.0005951218,0.0000591251,0.00027227908,0.0003294109,0.000049507835],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009861055,0.0019163669,0.001636532,0.0018483564,0.0006799965,0.002163067,0.002734785,0.0011282467,0.1323348],"category_scores_gemma":[0.0037171587,0.0011657437,0.002400858,0.0014182194,0.000508629,0.0027889328,0.0029548572,0.0033218057,0.054769825],"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.00018032563,0.00019390354,0.00082743226,0.0015626502,0.00016179585,0.0005008434,0.00027858219,0.021357944,0.008793061,0.13272612,0.2647076,0.5687098],"study_design_scores_gemma":[0.00024604006,0.00011730607,0.0006914952,0.00019680192,0.00007807364,0.0010041277,0.00008945818,0.1526981,0.011360742,0.17799169,0.6554209,0.00010530944],"about_ca_topic_score_codex":0.0008306124,"about_ca_topic_score_gemma":0.0016182954,"teacher_disagreement_score":0.1323348,"about_ca_system_score_codex":0.0005448023,"about_ca_system_score_gemma":0.001022869,"threshold_uncertainty_score":0.44270402},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.055820905,0.0003792476,0.92835176,0.00015559157,0.00009144636,0.00007235942,0.00014965149,0.007927367,0.0070516206],"genre_scores_gemma":[0.33611637,0.00023731966,0.65553415,0.00010144079,0.000062229126,0.000095754214,0.00042784034,0.0005942094,0.0068307887],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995766,0.000055950863,0.00003221849,0.0000985242,0.00014628297,0.00009035796],"domain_scores_gemma":[0.9994135,0.0001748672,0.000042845404,0.0002004929,0.00012429208,0.000044021872],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00038813695,0.00046177264,0.000633743,0.0006740148,0.0007906224,0.00094651146,0.0012996626,0.00040638592,0.004435148],"category_scores_gemma":[0.0013325778,0.0003063421,0.00044408752,0.0015049701,0.0005882521,0.001976186,0.0016588611,0.00058930845,0.0011877974],"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.000724605,0.00020875758,0.0018873396,0.00030243574,0.000057347217,0.0002125198,0.00039043627,0.08532815,0.042063016,0.07466284,0.011872228,0.7822904],"study_design_scores_gemma":[0.0003086334,0.00021056084,0.0007620974,0.000036570942,0.000044954333,0.00026088374,0.00012389146,0.7914927,0.07668898,0.09532268,0.03469115,0.000056799592],"about_ca_topic_score_codex":0.0042144572,"about_ca_topic_score_gemma":0.0061650695,"teacher_disagreement_score":0.004435148,"about_ca_system_score_codex":0.0006586883,"about_ca_system_score_gemma":0.001290603,"threshold_uncertainty_score":0.014837086},"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":"software","genre_gemma":"software","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"software","genre_consensus":"software","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0008850291,0.0017991193,0.33600986,0.0012607027,0.0011099962,0.00027354644,0.02405175,0.3608893,0.27372068],"genre_scores_gemma":[0.029081328,0.006279847,0.32202587,0.0027926941,0.0015672316,0.0011439876,0.08971264,0.2044961,0.34290028],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99776137,0.00026647135,0.00016822912,0.0003194727,0.0011888612,0.00029568016],"domain_scores_gemma":[0.99745435,0.00049376785,0.00010870965,0.0009543811,0.00073801476,0.00025083314],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0017382536,0.0017472284,0.0017841256,0.0035023885,0.001507351,0.0053472617,0.0046427622,0.001333043,0.44039842],"category_scores_gemma":[0.008234641,0.0016853879,0.0019306018,0.0045864405,0.0008589296,0.008519782,0.006319261,0.0031756265,0.43725196],"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.00010317509,0.00004709616,0.0002202131,0.00046750318,0.00002619192,0.00010463019,0.00009884011,0.00068505073,0.0011569402,0.031725343,0.7319833,0.23338169],"study_design_scores_gemma":[0.000038143153,0.00001887733,0.00016495113,0.00008770561,0.000010796223,0.00015664496,0.00002388324,0.0026010997,0.002179505,0.027347779,0.9673379,0.00003273096],"about_ca_topic_score_codex":0.0018213487,"about_ca_topic_score_gemma":0.0026467408,"teacher_disagreement_score":0.44039842,"about_ca_system_score_codex":0.0015333067,"about_ca_system_score_gemma":0.0028203146,"threshold_uncertainty_score":0.7982037},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.25423786,0.0069251778,0.5430726,0.003176735,0.0015672791,0.000097549186,0.00048269978,0.0005172714,0.18992278],"genre_scores_gemma":[0.92883945,0.0027334555,0.04120772,0.00039840126,0.0011665369,0.00006153913,0.00029478304,0.00017479698,0.025123313],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99892753,0.00026814462,0.00006072672,0.0002311084,0.00036122504,0.0001513003],"domain_scores_gemma":[0.9987078,0.00040715045,0.00014552493,0.00025276834,0.0002123695,0.0002744248],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014217773,0.00053829054,0.00057050685,0.0021903212,0.0015499353,0.0033946855,0.00087231066,0.00086670544,0.007826508],"category_scores_gemma":[0.0032273002,0.00025745426,0.0006820295,0.0018462148,0.006216503,0.008534383,0.003954534,0.0030700134,0.00087374845],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009256673,0.0000033781885,0.000058673442,0.000014887793,0.0000015544134,0.00004091097,0.00018033714,0.00030078914,0.00041305317,0.9958947,0.00019989868,0.0028826713],"study_design_scores_gemma":[0.0000064679043,0.00003485386,0.00017722411,0.000015581785,0.0000036375716,0.0001504251,0.00014009292,0.0027195832,0.0005841699,0.98502666,0.011131246,0.0000100406305],"about_ca_topic_score_codex":0.00040790852,"about_ca_topic_score_gemma":0.00019502798,"teacher_disagreement_score":0.007826508,"about_ca_system_score_codex":0.00084114505,"about_ca_system_score_gemma":0.00048180448,"threshold_uncertainty_score":0.026182294},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.19726512,0.00025299343,0.707602,0.00031574245,0.00009697558,0.000108533364,0.00033986906,0.080015436,0.014003332],"genre_scores_gemma":[0.6352992,0.0001269004,0.35609108,0.00019259696,0.000038441,0.00015195682,0.0005958017,0.0025288316,0.004975191],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9993389,0.00019362324,0.000032392458,0.00011063982,0.00023798448,0.000086348584],"domain_scores_gemma":[0.99855536,0.00065365277,0.000076618926,0.00039519864,0.0002411776,0.00007798769],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007525248,0.0006743415,0.00052397593,0.00040779874,0.00053244294,0.0016400691,0.0013772623,0.00056789594,0.0043107155],"category_scores_gemma":[0.0023379382,0.0003795003,0.00038570052,0.000714156,0.0007039976,0.0013725418,0.00096591003,0.0010233013,0.0012739191],"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.0048263064,0.00109162,0.012652465,0.0008688473,0.00040766472,0.0018312775,0.0015731204,0.3340081,0.12823184,0.08371604,0.03291561,0.39787713],"study_design_scores_gemma":[0.00029153394,0.000253822,0.0011084396,0.000041409545,0.000056265177,0.0001532565,0.00010063427,0.92836237,0.045114554,0.014054059,0.010420118,0.00004343513],"about_ca_topic_score_codex":0.0018790872,"about_ca_topic_score_gemma":0.0027521648,"teacher_disagreement_score":0.0043107155,"about_ca_system_score_codex":0.000565852,"about_ca_system_score_gemma":0.001136688,"threshold_uncertainty_score":0.014420807},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009273164,0.00030462636,0.96438116,0.00021107854,0.00010911455,0.00016445306,0.00041263705,0.015597829,0.009545947],"genre_scores_gemma":[0.106011406,0.00018686235,0.88234633,0.00013723536,0.00007733976,0.00034132236,0.0014490058,0.0008770462,0.008573412],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9990734,0.0001151636,0.00006355258,0.00020497206,0.00041327818,0.00012959952],"domain_scores_gemma":[0.9989838,0.000250214,0.00005048842,0.00026155642,0.0004013112,0.00005253601],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006177971,0.0012751622,0.0007357313,0.0016813524,0.0011967848,0.0017634672,0.0020210326,0.0008213405,0.020224566],"category_scores_gemma":[0.0027466828,0.0004886332,0.00065357913,0.0021809072,0.00049070443,0.0020477595,0.0013406351,0.0013934233,0.011177172],"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.00045864048,0.00017309809,0.0019345435,0.00027809752,0.000085729,0.00018265008,0.00020675837,0.024833655,0.02590518,0.056599792,0.047800504,0.84154135],"study_design_scores_gemma":[0.00046426023,0.00025379678,0.0020598557,0.00007166058,0.00007748629,0.00068401796,0.00014923287,0.7132589,0.08468692,0.0797652,0.11836948,0.00015921034],"about_ca_topic_score_codex":0.004961788,"about_ca_topic_score_gemma":0.008292504,"teacher_disagreement_score":0.020224566,"about_ca_system_score_codex":0.0013410648,"about_ca_system_score_gemma":0.002355539,"threshold_uncertainty_score":0.06765795},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.017630968,0.00035388742,0.96598655,0.0012643125,0.0001443164,0.000077805504,0.00006468932,0.004048411,0.010429042],"genre_scores_gemma":[0.20786251,0.00026252866,0.78432864,0.00045758224,0.00022985345,0.00012194707,0.00016481007,0.00083011354,0.0057420554],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99728656,0.0006466706,0.00013625543,0.00057414605,0.00093200576,0.0004242798],"domain_scores_gemma":[0.99214375,0.0025350437,0.00021866067,0.0034412588,0.0012994038,0.00036181763],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004719366,0.00091748,0.0014744996,0.0021278742,0.0019519718,0.004149941,0.002552783,0.0017903185,0.007056808],"category_scores_gemma":[0.01587485,0.0007266018,0.00096778636,0.0020273505,0.003453266,0.0071399016,0.005367968,0.004080891,0.0035876369],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0014641188,0.00015732582,0.0026954112,0.00022373188,0.00006698863,0.00024477206,0.0008320734,0.01912632,0.008353743,0.55055135,0.019648626,0.39663556],"study_design_scores_gemma":[0.0002309555,0.000279411,0.00042669396,0.00015652199,0.00006194016,0.0005691288,0.0002677755,0.30771643,0.025004422,0.6148782,0.05032873,0.00007979614],"about_ca_topic_score_codex":0.0021940938,"about_ca_topic_score_gemma":0.002807107,"teacher_disagreement_score":0.007056808,"about_ca_system_score_codex":0.0021126603,"about_ca_system_score_gemma":0.0036118103,"threshold_uncertainty_score":0.02495867},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.39218515,0.00041103456,0.5841693,0.00037704123,0.00010527297,0.00006487863,0.00023288147,0.0010663657,0.021388007],"genre_scores_gemma":[0.7834055,0.0001702598,0.21302478,0.00006452356,0.0000541632,0.00003689522,0.0002555081,0.00011296797,0.002875375],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.999724,0.00002568561,0.000011547902,0.000041211166,0.00015417246,0.00004335185],"domain_scores_gemma":[0.99917656,0.00034840207,0.00008618977,0.00019275247,0.00014470276,0.000051300536],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00021565457,0.0003378765,0.00026947967,0.00091843156,0.000462141,0.00053308246,0.00047961276,0.0002736927,0.0038667286],"category_scores_gemma":[0.0029841126,0.00015417082,0.00025699934,0.00071787654,0.0005473512,0.0010195461,0.00090257946,0.00067956373,0.00045881997],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00038978588,0.000100283985,0.010603471,0.0003001451,0.000056399953,0.00094412663,0.0005715325,0.055469215,0.06931972,0.4417732,0.007093785,0.4133782],"study_design_scores_gemma":[0.00013430948,0.00023749248,0.0069306097,0.00005390257,0.00005057003,0.0014945724,0.0003712997,0.39111084,0.15971996,0.4164359,0.023356514,0.00010411118],"about_ca_topic_score_codex":0.0007298092,"about_ca_topic_score_gemma":0.00194559,"teacher_disagreement_score":0.0038667286,"about_ca_system_score_codex":0.00046456011,"about_ca_system_score_gemma":0.00054259493,"threshold_uncertainty_score":0.012935519},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.007888522,0.0002059562,0.9767776,0.00012801668,0.000121225945,0.00008465405,0.0002879414,0.0038116148,0.010694506],"genre_scores_gemma":[0.0812687,0.00026717165,0.8991151,0.00011639318,0.000085645195,0.00018212156,0.0015894708,0.0013061375,0.016069252],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991517,0.0000886534,0.000050775343,0.00018863566,0.000399831,0.00012036331],"domain_scores_gemma":[0.99921036,0.00017679267,0.000023627157,0.0003037706,0.00022728529,0.00005818101],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005967857,0.0013426476,0.0012426487,0.0019179618,0.0011059812,0.0029337713,0.002549339,0.0011230995,0.02302875],"category_scores_gemma":[0.0021821412,0.00066124956,0.0014657401,0.002461221,0.0009597026,0.0035978088,0.0035728952,0.0029625935,0.009873314],"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.00028482068,0.00014421309,0.0005185137,0.00025262343,0.00006664769,0.0000772437,0.00020514433,0.00951146,0.012377688,0.21760376,0.02413631,0.73482156],"study_design_scores_gemma":[0.00021883332,0.00019025245,0.00071666064,0.000109167486,0.00008672802,0.0003775011,0.00026023295,0.1889865,0.021151049,0.7250228,0.06278303,0.000097305434],"about_ca_topic_score_codex":0.0021140904,"about_ca_topic_score_gemma":0.003449966,"teacher_disagreement_score":0.02302875,"about_ca_system_score_codex":0.001002224,"about_ca_system_score_gemma":0.0014560465,"threshold_uncertainty_score":0.077038884},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.021667607,0.00045318864,0.97044635,0.0004442359,0.00008796907,0.00013068522,0.00012250566,0.0013085129,0.0053388895],"genre_scores_gemma":[0.198695,0.0006455331,0.7891356,0.00027157296,0.00014015447,0.00026401295,0.0007104576,0.000425104,0.009712707],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.997283,0.00051482674,0.0003064681,0.00067886664,0.0008412219,0.00037554846],"domain_scores_gemma":[0.9965796,0.0019255168,0.00018184428,0.0006489014,0.0005509402,0.00011328513],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0022796383,0.0009095229,0.0008733951,0.0013074813,0.0012690985,0.0035213467,0.0024843095,0.00119869,0.009192434],"category_scores_gemma":[0.0069356686,0.0005206964,0.0015234584,0.0020256804,0.0017479347,0.008346897,0.0034665305,0.0024905528,0.0020520915],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00011797804,0.000107834996,0.0006839995,0.0002402789,0.000031885727,0.0000860121,0.00060509134,0.021713177,0.0038434067,0.8223952,0.004036781,0.14613837],"study_design_scores_gemma":[0.000059261238,0.000047371428,0.00017518483,0.00005121775,0.00002082812,0.0001358164,0.00018704611,0.16317911,0.006623271,0.81185746,0.017635137,0.000028367034],"about_ca_topic_score_codex":0.001160194,"about_ca_topic_score_gemma":0.0014488617,"teacher_disagreement_score":0.009192434,"about_ca_system_score_codex":0.0023930967,"about_ca_system_score_gemma":0.001701721,"threshold_uncertainty_score":0.030751765},"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":"other","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.071650885,0.0057352534,0.4126221,0.0014785326,0.00095016515,0.00015893109,0.0009493563,0.0015024858,0.50495225],"genre_scores_gemma":[0.7184849,0.0074129896,0.14615992,0.0005162538,0.00086832594,0.00016396133,0.0031784906,0.0013155988,0.121899515],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993368,0.00012930749,0.000036597095,0.00008257845,0.00032856042,0.00008617309],"domain_scores_gemma":[0.9995839,0.0001581866,0.000025965073,0.00011692438,0.000092388735,0.000022710663],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00045564893,0.0007240832,0.00096116663,0.0012556148,0.001100548,0.0018112899,0.0011427657,0.00038946126,0.010850362],"category_scores_gemma":[0.001932373,0.00052065076,0.0012055334,0.0018344073,0.0018749125,0.0034634008,0.0018120464,0.0023922771,0.003080589],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004017646,0.0000132440655,0.00006616086,0.00013633036,0.0000124289345,0.00009120722,0.00032598208,0.001658688,0.002542229,0.9334024,0.008512835,0.053198323],"study_design_scores_gemma":[0.000020348029,0.000025799533,0.00027486033,0.00004853253,0.00002638527,0.00022853035,0.00010672703,0.0064894673,0.0046749744,0.88751453,0.10056873,0.000021043074],"about_ca_topic_score_codex":0.0014149824,"about_ca_topic_score_gemma":0.0015083604,"teacher_disagreement_score":0.010850362,"about_ca_system_score_codex":0.0012468043,"about_ca_system_score_gemma":0.0005292781,"threshold_uncertainty_score":0.036298096},"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.014896242,0.018938107,0.34504667,0.042558398,0.004096861,0.000093622366,0.00094933016,0.0028716393,0.5705491],"genre_scores_gemma":[0.53896886,0.016352516,0.13153017,0.009476623,0.0050458093,0.0003877044,0.00088481995,0.0017522929,0.29560116],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9983423,0.00055841525,0.00008205726,0.0002854898,0.0005943834,0.00013740735],"domain_scores_gemma":[0.99565434,0.0023217034,0.000118252865,0.0013426854,0.00043039565,0.00013271735],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019756171,0.0009376447,0.0009273933,0.0015046477,0.0033810218,0.0069525936,0.001609896,0.0024196808,0.024617907],"category_scores_gemma":[0.010646281,0.0008228344,0.0007673936,0.0017965442,0.011841476,0.025735969,0.004218606,0.0073636156,0.00811932],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000022218164,0.000008887693,0.00006531515,0.000046383444,0.000003745038,0.00001656138,0.00030913937,0.0004042329,0.00017479139,0.96236515,0.015623446,0.020960268],"study_design_scores_gemma":[0.0000061085684,0.0000062249815,0.000026834621,0.00004502692,0.0000029432952,0.000048403723,0.0001133128,0.0011627689,0.00029296154,0.94950026,0.048785247,0.0000098476185],"about_ca_topic_score_codex":0.0012694545,"about_ca_topic_score_gemma":0.0013639312,"teacher_disagreement_score":0.024617907,"about_ca_system_score_codex":0.0017724246,"about_ca_system_score_gemma":0.0011563363,"threshold_uncertainty_score":0.08235514},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.013281872,0.000103569364,0.9816943,0.00034444095,0.000060541013,0.00008188823,0.00008304241,0.0006986939,0.0036516772],"genre_scores_gemma":[0.28468913,0.00012915219,0.709563,0.00031492204,0.000120379285,0.00034553854,0.00033338423,0.00027229666,0.0042322003],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9982089,0.0006602726,0.00009960406,0.0002962741,0.0004988579,0.00023616548],"domain_scores_gemma":[0.99357986,0.004501892,0.00027328773,0.00082765816,0.0005087683,0.00030864772],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002418224,0.0009214792,0.0015331731,0.0010253433,0.0011812606,0.0018772503,0.0021956176,0.0017416758,0.008674017],"category_scores_gemma":[0.013675308,0.0008912159,0.0011830289,0.0012383538,0.0018335495,0.002178899,0.0032400677,0.0027420355,0.0014495234],"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.0005911393,0.00021104103,0.0013010511,0.0001553592,0.00009690279,0.00008718794,0.0001392797,0.7175457,0.0024609875,0.14397027,0.0040557026,0.12938535],"study_design_scores_gemma":[0.00005421519,0.000024870216,0.00005360135,0.000009007765,0.000009507684,0.0000137061525,0.000011055443,0.9514121,0.00043580396,0.047494285,0.0004729971,0.000008748095],"about_ca_topic_score_codex":0.005493168,"about_ca_topic_score_gemma":0.011646445,"teacher_disagreement_score":0.008674017,"about_ca_system_score_codex":0.0017085903,"about_ca_system_score_gemma":0.004223484,"threshold_uncertainty_score":0.029017508},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5235495,0.0018450252,0.36604774,0.0014821681,0.00026413877,0.00012504237,0.00095127133,0.0004418015,0.10529336],"genre_scores_gemma":[0.95533943,0.00082948495,0.026989881,0.00010605596,0.00019569021,0.0001183441,0.0007451434,0.00010109311,0.015574862],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.999035,0.00012366458,0.000063554864,0.00029760975,0.00031986344,0.00016026173],"domain_scores_gemma":[0.99923813,0.00017977452,0.00013102444,0.00015755805,0.00011326413,0.00018028339],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00056430616,0.00051770825,0.00060901087,0.0020979133,0.0016930422,0.004224437,0.0006978143,0.00044861698,0.0075461515],"category_scores_gemma":[0.0014955992,0.00034702328,0.0008181842,0.0016103105,0.003464579,0.005410512,0.003630972,0.0022443582,0.0006825673],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000070378637,0.000005884933,0.00017415003,0.000011366658,0.0000032604241,0.00003931373,0.00015270697,0.00046434157,0.0005477677,0.9955112,0.00034971576,0.0027332753],"study_design_scores_gemma":[0.000012322467,0.000024800225,0.0006670439,0.000017364113,0.000011934532,0.00024689888,0.0003563408,0.0064439196,0.0015287626,0.97613883,0.014529409,0.000022382756],"about_ca_topic_score_codex":0.0010437797,"about_ca_topic_score_gemma":0.0009022734,"teacher_disagreement_score":0.0075461515,"about_ca_system_score_codex":0.0014811074,"about_ca_system_score_gemma":0.00060020137,"threshold_uncertainty_score":0.025244415},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3060056,0.0007735394,0.6497666,0.0005444591,0.000336994,0.000100497964,0.0001462976,0.000627166,0.04169886],"genre_scores_gemma":[0.8834734,0.0005574332,0.0943457,0.00019812174,0.00013156986,0.00004929787,0.00012454003,0.000261601,0.020858426],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995813,0.00008464586,0.000024706376,0.00008594235,0.00012239814,0.000101138794],"domain_scores_gemma":[0.99949515,0.00023481289,0.00005043835,0.00009869352,0.000076518765,0.000044386423],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006891034,0.0006566697,0.00049610995,0.0008476752,0.0006969054,0.0010420687,0.00044864626,0.00040396975,0.0075947708],"category_scores_gemma":[0.0020920509,0.00030189042,0.0006472363,0.00088687957,0.0018062441,0.0027087,0.001687712,0.0007690888,0.00088247773],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00036990413,0.00012833871,0.0010507113,0.00017132264,0.0000456624,0.00045173717,0.0007634765,0.021581292,0.015842011,0.79999834,0.0034938687,0.1561033],"study_design_scores_gemma":[0.00006341692,0.0001059749,0.0003377383,0.000046193232,0.000023658986,0.00021597014,0.00021166388,0.056688778,0.010164882,0.91956425,0.012543924,0.00003357112],"about_ca_topic_score_codex":0.001387444,"about_ca_topic_score_gemma":0.0023789394,"teacher_disagreement_score":0.0075947708,"about_ca_system_score_codex":0.00091842376,"about_ca_system_score_gemma":0.0004926515,"threshold_uncertainty_score":0.025407016},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0023644727,0.00022415067,0.9477472,0.00012308967,0.00010981378,0.0000764513,0.0006318744,0.037657954,0.011064985],"genre_scores_gemma":[0.0830391,0.00053531217,0.87595177,0.00032662225,0.00017298464,0.0003150624,0.0031511458,0.019972049,0.016536],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99863017,0.00021380778,0.00019386309,0.0002850565,0.0005635263,0.00011358971],"domain_scores_gemma":[0.9965533,0.001638831,0.0001473646,0.0009170602,0.0006360443,0.00010746676],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020055547,0.0010505875,0.0012749156,0.0019637565,0.0008907528,0.004014964,0.00241205,0.0012631537,0.053553175],"category_scores_gemma":[0.010847992,0.0010104433,0.0021569263,0.0016336326,0.0012928619,0.004219838,0.0023199606,0.0029248665,0.019379364],"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.00029067206,0.00018257416,0.0021343313,0.0008309255,0.00015592256,0.0002431416,0.000596227,0.01148337,0.008505188,0.44097322,0.053795367,0.4808091],"study_design_scores_gemma":[0.00027655324,0.00007552992,0.000660841,0.0003259877,0.0000838749,0.0005546185,0.00015026434,0.14904948,0.03405621,0.5545977,0.26002908,0.0001399037],"about_ca_topic_score_codex":0.0012926303,"about_ca_topic_score_gemma":0.001957398,"teacher_disagreement_score":0.053553175,"about_ca_system_score_codex":0.0010342962,"about_ca_system_score_gemma":0.0013385084,"threshold_uncertainty_score":0.1791532},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.83582765,0.0016383486,0.062441394,0.0007562953,0.0003093267,0.000045954446,0.0001419272,0.00014513102,0.098694086],"genre_scores_gemma":[0.97441727,0.00032969133,0.0077478136,0.00013312798,0.00014771422,0.000035014942,0.000092467526,0.000056442386,0.01704035],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99911004,0.0001751836,0.00006342049,0.00012979352,0.0003690762,0.0001524462],"domain_scores_gemma":[0.99869186,0.00047619158,0.00021295346,0.00011976998,0.00030422886,0.00019505512],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009384316,0.0004349764,0.0006366683,0.0019126539,0.0012577034,0.0020983426,0.00064648053,0.0007006437,0.0061649797],"category_scores_gemma":[0.004043009,0.00036188404,0.0009877707,0.00077227573,0.0025230714,0.0030084904,0.0017129774,0.0017834336,0.0007205115],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000037600712,0.000018166415,0.0009430672,0.000035150846,0.000011229948,0.0003941823,0.00040891976,0.0011743793,0.0017552284,0.9905563,0.00065600104,0.0040097577],"study_design_scores_gemma":[0.000029119175,0.000029133733,0.001022899,0.000030574545,0.000011421017,0.0005402761,0.0001604464,0.01835048,0.0019787636,0.9723785,0.0054397746,0.000028735936],"about_ca_topic_score_codex":0.0013115804,"about_ca_topic_score_gemma":0.0013001498,"teacher_disagreement_score":0.0061649797,"about_ca_system_score_codex":0.0018943002,"about_ca_system_score_gemma":0.00078138616,"threshold_uncertainty_score":0.020623863},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.38154507,0.0009709232,0.28787065,0.0014814577,0.001397339,0.000109496075,0.0003979959,0.0005589337,0.3256681],"genre_scores_gemma":[0.88742346,0.0005942489,0.06981064,0.0006964874,0.00042698198,0.000121932884,0.00023085871,0.0003362149,0.040359166],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99966145,0.00006913412,0.000022592463,0.00007040636,0.000101123085,0.00007520916],"domain_scores_gemma":[0.9997297,0.00003774971,0.000051475454,0.00007999483,0.000056331348,0.000044658595],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005902076,0.00044511724,0.00034494183,0.00063351326,0.0010346732,0.0013024948,0.0006807869,0.00044511337,0.007297266],"category_scores_gemma":[0.0007662588,0.00021750378,0.00046533413,0.00063839206,0.0017383612,0.0020563565,0.00086725183,0.0010989734,0.0014783406],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000025635089,0.000013035885,0.00013396684,0.000032291184,0.000003941923,0.000096243,0.00008583147,0.0007426675,0.0035931536,0.9842562,0.0018142896,0.009202798],"study_design_scores_gemma":[0.000010425069,0.000043761862,0.0007050313,0.000027065518,0.0000087068165,0.00030628813,0.00008697717,0.011131087,0.007341773,0.9497546,0.0305529,0.00003134928],"about_ca_topic_score_codex":0.00035639835,"about_ca_topic_score_gemma":0.0005341058,"teacher_disagreement_score":0.007297266,"about_ca_system_score_codex":0.0007052026,"about_ca_system_score_gemma":0.0004955749,"threshold_uncertainty_score":0.024411798},"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":"software","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"software","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0050770557,0.00041747006,0.8110626,0.0008345975,0.00043935067,0.00012007617,0.0026302657,0.0737269,0.10569163],"genre_scores_gemma":[0.18187791,0.0016851993,0.6562978,0.0005170735,0.0005829172,0.0003217049,0.012481824,0.03234228,0.11389333],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99815804,0.0004428456,0.00010086436,0.00030493975,0.0007808952,0.00021229938],"domain_scores_gemma":[0.9978896,0.0005737032,0.000068201974,0.0010420842,0.00022928692,0.0001972073],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016441012,0.001068435,0.0015187793,0.0019893784,0.0017676045,0.0032898947,0.0027150526,0.0006263711,0.19727059],"category_scores_gemma":[0.0039508017,0.0010942505,0.0018576364,0.0028703543,0.0015926476,0.0065212506,0.0061705587,0.0023634937,0.07737746],"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.00050833,0.00023637738,0.0010463261,0.0006537578,0.00015383966,0.0002531641,0.0006313907,0.0059010102,0.006351621,0.34892622,0.22089691,0.41444108],"study_design_scores_gemma":[0.000214858,0.00010033577,0.00038938457,0.0001872241,0.00006660939,0.00036484966,0.00019160232,0.03248623,0.014552141,0.4499215,0.50143284,0.000092567905],"about_ca_topic_score_codex":0.0014915442,"about_ca_topic_score_gemma":0.004167663,"teacher_disagreement_score":0.19727059,"about_ca_system_score_codex":0.0009090045,"about_ca_system_score_gemma":0.0015260711,"threshold_uncertainty_score":0.65993583},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.028317982,0.0033972,0.76849186,0.0030341567,0.0009819784,0.00012225039,0.00065688434,0.00082173914,0.19417596],"genre_scores_gemma":[0.49045014,0.008221008,0.3742604,0.002916067,0.0032397439,0.0003370018,0.0018697149,0.002562318,0.11614365],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99733174,0.0006936315,0.0001822669,0.0006032895,0.00091998215,0.00026916037],"domain_scores_gemma":[0.99385554,0.0030759678,0.0003638816,0.0014596827,0.0009507055,0.00029434747],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002586215,0.0017247989,0.0020251868,0.0034787797,0.0020533127,0.0039032917,0.0024524366,0.0011162349,0.020439358],"category_scores_gemma":[0.017995974,0.00091716094,0.003826775,0.004150814,0.0037174092,0.012100579,0.0067070206,0.0064586108,0.007224705],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000087107896,0.000042709198,0.0005306337,0.0002342668,0.00006420386,0.0001690142,0.0005305186,0.003984057,0.0006774415,0.9472642,0.006978941,0.039436907],"study_design_scores_gemma":[0.000016931339,0.00003934125,0.00029856648,0.00007503416,0.00006281979,0.00014651324,0.00013105334,0.01683932,0.0006449783,0.9545336,0.027179876,0.00003195603],"about_ca_topic_score_codex":0.002745475,"about_ca_topic_score_gemma":0.0025724494,"teacher_disagreement_score":0.020439358,"about_ca_system_score_codex":0.0021195556,"about_ca_system_score_gemma":0.00093997613,"threshold_uncertainty_score":0.06837648},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.086470805,0.0007090764,0.8973249,0.0011759452,0.000080306665,0.0002662141,0.0011621801,0.008069834,0.004740736],"genre_scores_gemma":[0.4655534,0.00035976616,0.52720845,0.00036353065,0.00014224258,0.0003487698,0.0033428462,0.00062800664,0.0020529819],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9960173,0.0006076543,0.00039197752,0.0013405834,0.0010855466,0.0005569334],"domain_scores_gemma":[0.98938155,0.007185249,0.0005965419,0.001860823,0.0006791736,0.00029668858],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021336256,0.0012433343,0.0017246275,0.0015464504,0.0014693618,0.0034361961,0.0029875026,0.0023701198,0.0053029535],"category_scores_gemma":[0.014647198,0.0009691359,0.002013971,0.0029260737,0.0017462665,0.008758543,0.0040101926,0.0022347397,0.0017610062],"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.0022658845,0.00055620295,0.0072467695,0.0012297076,0.0002778887,0.00026162228,0.00082423026,0.18560466,0.025752483,0.11348061,0.027351866,0.6351481],"study_design_scores_gemma":[0.00031154946,0.0003349827,0.0015806293,0.000046963443,0.000110992194,0.00042560312,0.0002771898,0.75305057,0.010828843,0.22703075,0.005913952,0.00008801852],"about_ca_topic_score_codex":0.0038313821,"about_ca_topic_score_gemma":0.0056691472,"teacher_disagreement_score":0.0053029535,"about_ca_system_score_codex":0.0024365252,"about_ca_system_score_gemma":0.004649623,"threshold_uncertainty_score":0.01774019},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.17644782,0.00011083107,0.81638604,0.000056750265,0.000014309904,0.000031611322,0.000062598294,0.00019141035,0.0066985977],"genre_scores_gemma":[0.9594181,0.00012371964,0.03751561,0.000019164801,0.000016089405,0.00007338147,0.00009989944,0.000042811356,0.0026912058],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99965835,0.000077897275,0.000014704248,0.00006048806,0.00011975003,0.00006882045],"domain_scores_gemma":[0.99884963,0.00075991976,0.00012504922,0.00014034008,0.00006710026,0.000057858717],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004702151,0.0006046846,0.00048432316,0.0003827853,0.00042776248,0.00064844184,0.00048754615,0.00037996113,0.0030967556],"category_scores_gemma":[0.0020117585,0.00031832594,0.0006752824,0.00017883943,0.0012703193,0.0010704375,0.0015840265,0.0010492137,0.00017848986],"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.00019342169,0.00004616052,0.0016601424,0.00012760957,0.000035080015,0.00038330452,0.00032264768,0.7779,0.017667405,0.18013507,0.00034144588,0.02118776],"study_design_scores_gemma":[0.000008086753,0.000083999905,0.00038412146,0.00001000074,0.0000050503822,0.000058834026,0.000056997746,0.9495863,0.00464814,0.044244956,0.00090582494,0.0000078232],"about_ca_topic_score_codex":0.0011422862,"about_ca_topic_score_gemma":0.00082635885,"teacher_disagreement_score":0.0030967556,"about_ca_system_score_codex":0.0004657166,"about_ca_system_score_gemma":0.0002557405,"threshold_uncertainty_score":0.0103597045},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07507314,0.00064932875,0.8978004,0.0006424423,0.00020520808,0.00016101591,0.00012993177,0.00040066178,0.024937822],"genre_scores_gemma":[0.55043805,0.0007613112,0.4350937,0.00048648834,0.00022354008,0.0002714404,0.00032328552,0.00026309007,0.012139054],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99738723,0.00092641305,0.00022898361,0.0004181409,0.0007369629,0.00030235696],"domain_scores_gemma":[0.99762326,0.001229748,0.00019417601,0.00060439034,0.00024983415,0.00009848257],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0025771314,0.00056135963,0.0007728044,0.00094249926,0.0010764068,0.0021838727,0.00085742056,0.0008722562,0.006632637],"category_scores_gemma":[0.006697703,0.0005528637,0.0015866071,0.0012391277,0.0032863552,0.004228201,0.002748355,0.0024207444,0.0014598492],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000044534714,0.000033807217,0.00019766674,0.000083984174,0.000013293765,0.00007174701,0.00038520436,0.0055649765,0.0018233625,0.9583944,0.00064372487,0.03274323],"study_design_scores_gemma":[0.000022876138,0.000043323358,0.000047908554,0.000036985854,0.000012298549,0.00004552519,0.000056375447,0.01464635,0.0028658963,0.97517186,0.007034188,0.000016270247],"about_ca_topic_score_codex":0.0007103345,"about_ca_topic_score_gemma":0.00073084526,"teacher_disagreement_score":0.006632637,"about_ca_system_score_codex":0.0012204546,"about_ca_system_score_gemma":0.0010598995,"threshold_uncertainty_score":0.022188365},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.97573435,0.00031584798,0.00702115,0.0006215594,0.000060904134,0.000017187649,0.00026249723,0.000094329094,0.01587212],"genre_scores_gemma":[0.9974095,0.00009829906,0.0007554989,0.000027506529,0.00006394057,0.0000069429707,0.00013975405,0.000013516527,0.0014850404],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989712,0.00013232448,0.000051790557,0.00020712885,0.0003452913,0.00029225508],"domain_scores_gemma":[0.9975802,0.0007235486,0.00041385897,0.00016829226,0.00032713474,0.00078693934],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00081285636,0.00040623467,0.0008663091,0.0035622974,0.0018624486,0.004108887,0.00075919076,0.0006738629,0.0058220793],"category_scores_gemma":[0.0033667933,0.00036890074,0.00047925932,0.0013112794,0.0039887438,0.0026139836,0.0028882255,0.0014994179,0.0004519827],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002577209,0.0001295602,0.010475572,0.00007755325,0.000041301268,0.000653485,0.0010911258,0.0033991565,0.005245792,0.96249855,0.002133691,0.013996539],"study_design_scores_gemma":[0.000072386894,0.00012428453,0.012097602,0.000047714042,0.000038637023,0.00089877355,0.0007391597,0.023542367,0.00336203,0.9534428,0.005551245,0.000083028084],"about_ca_topic_score_codex":0.0012036464,"about_ca_topic_score_gemma":0.0005427193,"teacher_disagreement_score":0.0058220793,"about_ca_system_score_codex":0.0014506426,"about_ca_system_score_gemma":0.00043951557,"threshold_uncertainty_score":0.019476831},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.013849514,0.00569329,0.029746776,0.0016174228,0.0006443543,0.000045640238,0.00041078567,0.00040213636,0.94759005],"genre_scores_gemma":[0.23705354,0.009742815,0.017185327,0.00077002536,0.0012276476,0.0000882079,0.00095540663,0.00025718086,0.7327199],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9998313,0.00002416204,0.000006163844,0.000028616916,0.00008347141,0.000026232223],"domain_scores_gemma":[0.9998889,0.000028357235,0.00000960073,0.000020589168,0.000028720438,0.000023713792],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00020055218,0.0003972385,0.00031174734,0.00069213886,0.0007249999,0.0021706335,0.0002944994,0.00019394002,0.02239255],"category_scores_gemma":[0.00043948126,0.00022964373,0.00021646974,0.00085953966,0.0011269625,0.0031270834,0.0013262162,0.0014140239,0.007749561],"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.0000069692683,0.000010447434,0.00008978145,0.00006421147,0.0000019596177,0.000041261024,0.00033055423,0.00020584602,0.00060654315,0.94348234,0.021595158,0.033564985],"study_design_scores_gemma":[0.000004906632,0.000015558011,0.00045564622,0.000049451508,0.0000035069666,0.00031763915,0.00015428086,0.0005547608,0.00077889574,0.5097425,0.48791817,0.0000047049657],"about_ca_topic_score_codex":0.00026763,"about_ca_topic_score_gemma":0.00045507815,"teacher_disagreement_score":0.02239255,"about_ca_system_score_codex":0.0006132208,"about_ca_system_score_gemma":0.0004344555,"threshold_uncertainty_score":0.07491052},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8835079,0.0007354512,0.07956212,0.0018734501,0.0003038091,0.00011601191,0.000119472716,0.00015094875,0.033630766],"genre_scores_gemma":[0.9707644,0.00034041444,0.015637806,0.00015116566,0.00010183606,0.00012316232,0.0000864899,0.000037407593,0.012757437],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9999056,0.000021815596,0.0000054635925,0.00001748723,0.00002086351,0.00002875109],"domain_scores_gemma":[0.9995166,0.00025847668,0.00010185402,0.000021931392,0.000037742495,0.000063339845],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00031460467,0.0005283993,0.00034108866,0.00034609388,0.0004883173,0.00096022297,0.0005364911,0.0008313496,0.0057791257],"category_scores_gemma":[0.0025019252,0.00024344769,0.00030378412,0.00024893993,0.0009496929,0.00080082536,0.0008518038,0.00083083916,0.0003047658],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0014883701,0.00036248576,0.0050909077,0.0008378839,0.00017355177,0.0017607703,0.0014122131,0.13990223,0.18543798,0.6234211,0.008482735,0.031629756],"study_design_scores_gemma":[0.00087758154,0.0006938789,0.003989631,0.00015883698,0.00012438091,0.0010776108,0.0022810716,0.4856745,0.05659068,0.4359925,0.012421623,0.00011766684],"about_ca_topic_score_codex":0.0004139835,"about_ca_topic_score_gemma":0.00060618087,"teacher_disagreement_score":0.0057791257,"about_ca_system_score_codex":0.0004067987,"about_ca_system_score_gemma":0.00044459352,"threshold_uncertainty_score":0.019333065},"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09300318,0.015220306,0.26710597,0.012370607,0.0013535359,0.00019178099,0.0007736008,0.00058390887,0.6093972],"genre_scores_gemma":[0.7688607,0.008874912,0.12952092,0.0007138523,0.0006041821,0.00033925884,0.0003797983,0.00045557803,0.09025075],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9966974,0.0008572764,0.00014109674,0.00056952535,0.0014014078,0.0003332625],"domain_scores_gemma":[0.9968656,0.0010266606,0.00033295617,0.00059368426,0.0009450377,0.0002360826],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018272428,0.0004149964,0.00043158958,0.0021735241,0.0026030676,0.006458011,0.00065619644,0.001153765,0.013515508],"category_scores_gemma":[0.007147768,0.0005583583,0.0005593523,0.0019325222,0.0059223995,0.004247619,0.0024070563,0.0022307,0.004362722],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000043269654,0.000026977346,0.0010271404,0.00017243491,0.000016127815,0.00023911217,0.0024341852,0.00086677156,0.0043913033,0.934975,0.0041936846,0.05161392],"study_design_scores_gemma":[0.000026204429,0.000058154255,0.0030681924,0.00019871586,0.000039898605,0.000996083,0.0025141477,0.0023455014,0.0066235713,0.7285989,0.2554428,0.00008784372],"about_ca_topic_score_codex":0.0029465505,"about_ca_topic_score_gemma":0.0030653747,"teacher_disagreement_score":0.013515508,"about_ca_system_score_codex":0.0025877848,"about_ca_system_score_gemma":0.0035750587,"threshold_uncertainty_score":0.04521388},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2539834,0.0070232567,0.50974876,0.0033564754,0.0022720732,0.00016788539,0.0008829807,0.0011168695,0.22144821],"genre_scores_gemma":[0.83913124,0.0024503658,0.11843163,0.00039780227,0.0004816163,0.00013622286,0.00092677795,0.00028833788,0.03775594],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99878734,0.0002577502,0.00008440216,0.0002560626,0.00040599637,0.00020847523],"domain_scores_gemma":[0.9980263,0.0012294799,0.00010695949,0.00031174475,0.0002481022,0.00007736553],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001261461,0.00091366295,0.0008918777,0.0021468173,0.0013834652,0.003582426,0.0018083466,0.00079133356,0.015279484],"category_scores_gemma":[0.007862515,0.00039243643,0.0006195103,0.0028551286,0.0024431811,0.007842944,0.0032074768,0.0015841103,0.0021477023],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002207755,0.00003852856,0.000789215,0.0002125489,0.000029183762,0.000115601055,0.0004662034,0.010473253,0.0014181315,0.8993376,0.006581256,0.08031781],"study_design_scores_gemma":[0.000033503275,0.000033838798,0.00026066697,0.00009852768,0.000021776787,0.000077882294,0.00013032969,0.025458127,0.0029949297,0.95388,0.016980989,0.000029294539],"about_ca_topic_score_codex":0.002076878,"about_ca_topic_score_gemma":0.004064762,"teacher_disagreement_score":0.015279484,"about_ca_system_score_codex":0.0022076007,"about_ca_system_score_gemma":0.00095870363,"threshold_uncertainty_score":0.051114917},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.91704625,0.00020450389,0.07510312,0.00018317996,0.00002339972,0.00003064805,0.00008236568,0.00010796399,0.0072186],"genre_scores_gemma":[0.98782593,0.000083888466,0.0090030655,0.000017725659,0.000018619341,0.000019204008,0.000058070058,0.000031018168,0.0029425232],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99905115,0.00017076342,0.000058320384,0.00010874069,0.0003382506,0.00027277353],"domain_scores_gemma":[0.99781114,0.0008710452,0.00038119213,0.00030309765,0.00029901616,0.0003344475],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017500327,0.0003909734,0.0005118303,0.002480295,0.0012780854,0.0025750347,0.0010150432,0.0006320716,0.0045781736],"category_scores_gemma":[0.005106241,0.00039662397,0.00055223226,0.001289254,0.0035884276,0.005118564,0.0032547025,0.0016570543,0.0004252039],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013492658,0.000025719088,0.002847695,0.000045368346,0.000012854069,0.0002006248,0.00069177867,0.0058877557,0.0031379436,0.9791278,0.0001968626,0.007690636],"study_design_scores_gemma":[0.000036105783,0.00009514993,0.0025401327,0.000043596145,0.000019393015,0.00035658007,0.0006210241,0.03663891,0.010984445,0.9448578,0.0037546044,0.000052173324],"about_ca_topic_score_codex":0.0008105657,"about_ca_topic_score_gemma":0.00039752148,"teacher_disagreement_score":0.0045781736,"about_ca_system_score_codex":0.0012273946,"about_ca_system_score_gemma":0.00041782233,"threshold_uncertainty_score":0.015315533},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.045089543,0.00013070344,0.9486841,0.00014186911,0.000056999448,0.000025791036,0.00008755887,0.0004773379,0.0053061526],"genre_scores_gemma":[0.51028496,0.00032289833,0.48449033,0.000078203135,0.0001181536,0.00008440917,0.000222186,0.00047292258,0.0039259605],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99953985,0.00007204098,0.000028542461,0.00014015114,0.00014972218,0.00006964455],"domain_scores_gemma":[0.9984555,0.00095057226,0.00014413231,0.0002203964,0.00015262539,0.000076715005],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006729577,0.0006290564,0.00070012273,0.001483185,0.00057417894,0.0011243304,0.00084766065,0.00038303717,0.00527518],"category_scores_gemma":[0.0048127687,0.00025084836,0.00065312267,0.0010857157,0.0014301246,0.0037895201,0.0015886946,0.0011343603,0.0015431811],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00064096093,0.00009861144,0.004742266,0.00040958603,0.00007674229,0.00053191226,0.00054092327,0.06829515,0.07210396,0.49028215,0.0077422084,0.35453558],"study_design_scores_gemma":[0.00007886997,0.00041828305,0.0051106815,0.00008682897,0.000064873326,0.0011237476,0.00028759398,0.38183436,0.077197924,0.5111974,0.02244432,0.00015512647],"about_ca_topic_score_codex":0.00031983323,"about_ca_topic_score_gemma":0.0005156462,"teacher_disagreement_score":0.00527518,"about_ca_system_score_codex":0.0004090072,"about_ca_system_score_gemma":0.0004087065,"threshold_uncertainty_score":0.017647266},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06719974,0.0004925375,0.90028906,0.0014693899,0.0005090794,0.00096025405,0.0011572166,0.0033339772,0.024588747],"genre_scores_gemma":[0.8421738,0.00033317413,0.13048722,0.00033034687,0.0001298766,0.00073161046,0.0011005269,0.00012943395,0.024583941],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9961927,0.0012032246,0.00043858733,0.00044347165,0.0010583061,0.0006636829],"domain_scores_gemma":[0.99631256,0.00072773243,0.0003912829,0.0015449366,0.0006529021,0.0003706529],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0024950907,0.0006141473,0.0013416186,0.0008797898,0.0018990898,0.00238211,0.0027152798,0.0024047787,0.015017689],"category_scores_gemma":[0.0047421134,0.00041408787,0.0007509166,0.0014947135,0.0013933125,0.0046764705,0.0058901417,0.0026063155,0.005967636],"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.0070266887,0.0009012028,0.002374573,0.0011243152,0.00028891081,0.002729958,0.0018206699,0.022519546,0.09817295,0.62778145,0.023009125,0.21225062],"study_design_scores_gemma":[0.0016397281,0.0017627763,0.0018279792,0.00017742762,0.00032645295,0.00388119,0.00048678985,0.28691825,0.16037042,0.4197222,0.12230248,0.00058438187],"about_ca_topic_score_codex":0.0002483113,"about_ca_topic_score_gemma":0.0002798807,"teacher_disagreement_score":0.015017689,"about_ca_system_score_codex":0.00067969254,"about_ca_system_score_gemma":0.002016718,"threshold_uncertainty_score":0.050239146},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5142509,0.0021117493,0.26547992,0.0107721025,0.00053006026,0.000092218244,0.00061800826,0.000545619,0.20559941],"genre_scores_gemma":[0.95018625,0.0006658298,0.01604282,0.0006897134,0.00042199087,0.00009256954,0.0006055894,0.00022364635,0.031071616],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9983418,0.0007510924,0.00005135754,0.00021926212,0.00043402804,0.0002024031],"domain_scores_gemma":[0.98808646,0.00846471,0.000921636,0.00081111817,0.00084141653,0.0008747754],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015406521,0.0006452817,0.0010364791,0.0014566039,0.0018805903,0.0026644506,0.0019141283,0.0020596392,0.013926129],"category_scores_gemma":[0.015275273,0.00074937247,0.00046836265,0.0020098935,0.0033142003,0.0065058935,0.0023343195,0.004127146,0.001303577],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000118619806,0.00006489306,0.00054936745,0.00008980369,0.000008701611,0.0001014971,0.00017401547,0.0057364022,0.0005696863,0.9772898,0.0063946303,0.008902585],"study_design_scores_gemma":[0.000018862782,0.0000126053965,0.00017993439,0.000011992737,0.000004845088,0.00006915272,0.000048101192,0.02283064,0.00024971482,0.9753828,0.0011827504,0.000008596905],"about_ca_topic_score_codex":0.00097202335,"about_ca_topic_score_gemma":0.0014369615,"teacher_disagreement_score":0.013926129,"about_ca_system_score_codex":0.0011127074,"about_ca_system_score_gemma":0.00079395756,"threshold_uncertainty_score":0.046587527},"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":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.72789866,0.0013470696,0.14210966,0.0011424241,0.0002781055,0.000035353893,0.00026710785,0.00020958169,0.12671204],"genre_scores_gemma":[0.96758246,0.00045053283,0.01293668,0.00011744874,0.00017652544,0.000038113554,0.0002214349,0.00003863663,0.018438194],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99960715,0.0000948119,0.000019242687,0.000053474392,0.0001568527,0.00006863243],"domain_scores_gemma":[0.9991391,0.00043294556,0.00010645347,0.000089114925,0.000109503635,0.00012294248],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007310588,0.00038223888,0.00029116124,0.0014647222,0.0011594573,0.0015086469,0.00055801566,0.00034427358,0.0057358807],"category_scores_gemma":[0.0016766918,0.00020636895,0.00044152705,0.00077096256,0.0017832477,0.0026323048,0.00142507,0.001256688,0.00043992113],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000014559851,0.000010781922,0.00011703136,0.0000142092995,0.0000020375119,0.000025758665,0.00012378187,0.00050730625,0.0007560074,0.9959927,0.00024359072,0.0021922193],"study_design_scores_gemma":[0.000008422834,0.000026430795,0.00025488483,0.000011144682,0.0000031039972,0.00007017747,0.00009895931,0.0036049832,0.0012013367,0.9913578,0.0033542619,0.000008403771],"about_ca_topic_score_codex":0.0003433216,"about_ca_topic_score_gemma":0.0002711223,"teacher_disagreement_score":0.0057358807,"about_ca_system_score_codex":0.0008542682,"about_ca_system_score_gemma":0.00030588973,"threshold_uncertainty_score":0.019188404},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.24491616,0.0044988366,0.42536855,0.008086925,0.00048469,0.00015501435,0.0017795354,0.00029609242,0.31441417],"genre_scores_gemma":[0.9341323,0.0033334675,0.031319458,0.0012166062,0.0010756594,0.00014925354,0.001306274,0.00012861857,0.027338298],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989176,0.0002948254,0.000052488558,0.00024084345,0.0003082774,0.00018595505],"domain_scores_gemma":[0.9968137,0.0014302484,0.00029174183,0.0005205815,0.0006623996,0.00028140197],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014246561,0.0006164972,0.00080881355,0.0018730706,0.0014320109,0.0013813542,0.0010705461,0.0007253185,0.006546958],"category_scores_gemma":[0.0038159618,0.00037297196,0.00077655824,0.0024924397,0.0034701067,0.0065795905,0.0037006103,0.0031634201,0.00077597273],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000007104921,0.0000071158324,0.0001700827,0.000030937692,0.0000034222296,0.000072786934,0.00019209973,0.00045713465,0.00023521783,0.99578434,0.0009707235,0.0020690153],"study_design_scores_gemma":[0.000005757964,0.00001330562,0.00037586555,0.000017767537,0.0000053307795,0.00014596393,0.000058402864,0.0026509606,0.0003230797,0.9886396,0.0077554886,0.000008323507],"about_ca_topic_score_codex":0.0010192848,"about_ca_topic_score_gemma":0.0006354422,"teacher_disagreement_score":0.006546958,"about_ca_system_score_codex":0.0015680469,"about_ca_system_score_gemma":0.0005647175,"threshold_uncertainty_score":0.021901727},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.069420174,0.00018137532,0.9238673,0.00029254673,0.00006682156,0.000036036938,0.000073372255,0.00030136088,0.0057609994],"genre_scores_gemma":[0.54082555,0.00041240294,0.44971687,0.0001043247,0.00014787806,0.000080331236,0.00019926229,0.00013158005,0.008381671],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99984515,0.00003506266,0.0000054260427,0.00001986313,0.000066542634,0.000027857626],"domain_scores_gemma":[0.99968886,0.0001761177,0.000029570896,0.00004575538,0.000036362868,0.000023342787],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00040479144,0.00041652625,0.0006248623,0.0004429283,0.00030398867,0.00041453398,0.000544495,0.00035431812,0.0021682975],"category_scores_gemma":[0.0021196806,0.000247099,0.00042141517,0.0007220209,0.00062102283,0.00080053695,0.0011545065,0.0013115348,0.00028177284],"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.00019224925,0.000120760844,0.0019511153,0.00017486616,0.000062326966,0.00026544707,0.00028978442,0.5327175,0.010589346,0.28223893,0.00377014,0.16762751],"study_design_scores_gemma":[0.000025908263,0.00003431338,0.00014220751,0.0000071752656,0.0000066908005,0.000030738374,0.000025951143,0.9359317,0.0018907443,0.059724595,0.0021716964,0.000008342614],"about_ca_topic_score_codex":0.0018064497,"about_ca_topic_score_gemma":0.0038718325,"teacher_disagreement_score":0.0021682975,"about_ca_system_score_codex":0.00042349298,"about_ca_system_score_gemma":0.00059182936,"threshold_uncertainty_score":0.0072537065},"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":"empirical","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8995477,0.0007895876,0.035877284,0.00086024316,0.000065000546,0.000032388678,0.00022347977,0.00010874773,0.062495604],"genre_scores_gemma":[0.9858246,0.0005435817,0.004474363,0.00004216743,0.00009467353,0.000019000803,0.00016593172,0.00004392562,0.008791742],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9996618,0.00004021525,0.000015676293,0.000058466325,0.00012390867,0.00009983439],"domain_scores_gemma":[0.9995546,0.000070960916,0.00012028055,0.000041231775,0.00006568548,0.00014727429],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00041144216,0.0006309424,0.00034456595,0.0028691879,0.0012490245,0.0030447068,0.00050553726,0.0005301521,0.0069581955],"category_scores_gemma":[0.0012258161,0.00024788597,0.00040602565,0.0017186359,0.0023025034,0.005589262,0.0022401242,0.0010516869,0.0005849528],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000018820601,0.000008265383,0.00057801115,0.000019092786,0.000004258649,0.00012172352,0.00037053743,0.0010887055,0.0012537367,0.9923424,0.00028490782,0.0039094845],"study_design_scores_gemma":[0.0000128309375,0.000035638128,0.0012636748,0.000029708128,0.000012165594,0.000387831,0.0006198193,0.0110573685,0.0024498554,0.9772857,0.0068263276,0.000019054844],"about_ca_topic_score_codex":0.00077311334,"about_ca_topic_score_gemma":0.000584003,"teacher_disagreement_score":0.0069581955,"about_ca_system_score_codex":0.0011478788,"about_ca_system_score_gemma":0.00031149603,"threshold_uncertainty_score":0.023277462},"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":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.026608923,0.042858396,0.29634464,0.08490496,0.051695645,0.00035091751,0.003763351,0.0012178862,0.49225533],"genre_scores_gemma":[0.28670505,0.027783398,0.121472925,0.006935244,0.027810477,0.0004598876,0.0053427503,0.0011364887,0.52235377],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9979607,0.000562795,0.00011183387,0.00051276415,0.0005785281,0.00027341783],"domain_scores_gemma":[0.99778914,0.0006850715,0.000046905498,0.00032579462,0.00063582836,0.0005172644],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0036461584,0.0012896735,0.0012584667,0.0016210089,0.0015339303,0.0069440324,0.0019067463,0.0013478916,0.026617404],"category_scores_gemma":[0.004624614,0.000548029,0.0021688826,0.0018023992,0.0022213473,0.0045255413,0.0035367867,0.0056207534,0.00650406],"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.00012556209,0.00010864336,0.0004046462,0.00027452898,0.00008072104,0.0002269459,0.0007385318,0.003006083,0.0019218547,0.70886797,0.21825196,0.0659925],"study_design_scores_gemma":[0.000052906653,0.00006264602,0.00054587447,0.0002241197,0.000043270815,0.00021493703,0.00019596654,0.008972422,0.0021213612,0.3590352,0.62849134,0.00003983991],"about_ca_topic_score_codex":0.002536484,"about_ca_topic_score_gemma":0.0038918066,"teacher_disagreement_score":0.026617404,"about_ca_system_score_codex":0.004531274,"about_ca_system_score_gemma":0.003934527,"threshold_uncertainty_score":0.089044094},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.23850405,0.0020942052,0.40926766,0.0058299997,0.000845501,0.00030976572,0.00086302933,0.00038495453,0.3419009],"genre_scores_gemma":[0.7765073,0.0015109716,0.0733951,0.0010862092,0.0008230804,0.00026972598,0.0006604309,0.00032180324,0.14542527],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99961495,0.00008077537,0.000024124141,0.0000647215,0.00014238588,0.00007302786],"domain_scores_gemma":[0.9996247,0.00009629067,0.000052348438,0.00006319294,0.00010390228,0.000059536917],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00055224646,0.0007167609,0.0008656424,0.0012031501,0.00097278715,0.0014955414,0.00091560464,0.0015674977,0.007894875],"category_scores_gemma":[0.0019153977,0.0003048062,0.0010607197,0.000682167,0.0015511777,0.0018930925,0.0020511418,0.0019662105,0.0012331969],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000007702586,0.000009662949,0.00016946661,0.000021555436,0.0000039254915,0.000076292345,0.00009829718,0.004447656,0.0007127153,0.99047184,0.0008142947,0.0031665452],"study_design_scores_gemma":[0.000036638045,0.000017623004,0.0003648458,0.000022389255,0.0000054376947,0.00023635782,0.00007603353,0.11424254,0.00079791737,0.87615794,0.008022223,0.000019940097],"about_ca_topic_score_codex":0.0019277032,"about_ca_topic_score_gemma":0.0014305892,"teacher_disagreement_score":0.007894875,"about_ca_system_score_codex":0.0015300004,"about_ca_system_score_gemma":0.00080607855,"threshold_uncertainty_score":0.026410997},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.019522296,0.018828688,0.70646137,0.019673718,0.015785478,0.0003584951,0.0022505056,0.0018597507,0.21525963],"genre_scores_gemma":[0.47320387,0.020645367,0.36218846,0.01836581,0.020513907,0.0013662975,0.0032630828,0.003266361,0.09718687],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985435,0.0003483428,0.00012225358,0.00030827188,0.00048196618,0.00019572541],"domain_scores_gemma":[0.9970686,0.0016669376,0.00016759973,0.00026775082,0.00060202816,0.00022711519],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0028808606,0.0030005807,0.0018489884,0.004517581,0.0027579358,0.0037374527,0.001691618,0.0024595158,0.029722748],"category_scores_gemma":[0.0075801816,0.0011428518,0.00384405,0.0037392515,0.0037724355,0.0068357284,0.005305711,0.0093465075,0.0073117577],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006724728,0.0000983282,0.00024359707,0.00046702818,0.00004649845,0.0005254646,0.000338649,0.0009857771,0.0031142414,0.93612725,0.022960994,0.035024997],"study_design_scores_gemma":[0.000017880231,0.000032278014,0.00033125706,0.0000813251,0.00002659113,0.00026387733,0.000045820427,0.0014744237,0.0008653059,0.9607055,0.036120698,0.00003499414],"about_ca_topic_score_codex":0.0009273487,"about_ca_topic_score_gemma":0.00083813997,"teacher_disagreement_score":0.029722748,"about_ca_system_score_codex":0.0019650215,"about_ca_system_score_gemma":0.0010092879,"threshold_uncertainty_score":0.09943253},"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.26504037,0.00268613,0.096984915,0.0014131436,0.0011464772,0.0000883245,0.00030191237,0.0005373764,0.6318014],"genre_scores_gemma":[0.8621489,0.0029295196,0.020336866,0.00040565498,0.00089610904,0.000068664085,0.0003532703,0.00022183437,0.11263912],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9997267,0.000041297793,0.000013536357,0.000046632274,0.00010131657,0.0000704391],"domain_scores_gemma":[0.9997111,0.00010497363,0.00003169876,0.000057250232,0.000053052336,0.000041914333],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00031813994,0.00053619995,0.00048656165,0.0008202153,0.0009293416,0.0018973859,0.00052880944,0.00043974273,0.0071542617],"category_scores_gemma":[0.000875993,0.00030311267,0.00041743394,0.000786098,0.0022511927,0.002838813,0.0015436125,0.002062399,0.001759389],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000032998403,0.000020725221,0.00006674398,0.00004754862,0.0000036024858,0.000059449718,0.00013922955,0.0003576446,0.0016657544,0.98118263,0.0016215633,0.014802208],"study_design_scores_gemma":[0.0000146388575,0.000016610384,0.00005519228,0.000019365132,0.0000052429887,0.00010674394,0.000057670153,0.0009519815,0.0016754388,0.9862962,0.010793209,0.000007684398],"about_ca_topic_score_codex":0.00041364226,"about_ca_topic_score_gemma":0.0005714336,"teacher_disagreement_score":0.0071542617,"about_ca_system_score_codex":0.000630354,"about_ca_system_score_gemma":0.00052457635,"threshold_uncertainty_score":0.023933351},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1036819,0.009236424,0.46351022,0.005836944,0.0013227075,0.00023876643,0.0027776693,0.0030729903,0.4103224],"genre_scores_gemma":[0.8069312,0.0048946906,0.11807007,0.0016272854,0.0010759579,0.0004927736,0.002631721,0.0010331445,0.063243255],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99706984,0.00033753182,0.00011638185,0.0005039185,0.0012359094,0.00073643366],"domain_scores_gemma":[0.9881417,0.0072223726,0.00035253543,0.0023440432,0.0011999842,0.00073925883],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0026703493,0.0012207138,0.0012887672,0.003340901,0.0022312796,0.0055421144,0.0033868898,0.0014843097,0.022268225],"category_scores_gemma":[0.017460784,0.00062669633,0.0012141961,0.003732603,0.0029737528,0.008213724,0.00514448,0.004256072,0.005648375],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00038919598,0.000120265264,0.0019066148,0.000362802,0.00005926744,0.00011719766,0.00034648768,0.012097242,0.0061080167,0.8489347,0.026672745,0.102885485],"study_design_scores_gemma":[0.000042705928,0.00009127678,0.0012680874,0.00015351111,0.000108803884,0.00037712065,0.00011407531,0.041699905,0.006425965,0.897494,0.052180313,0.000044240085],"about_ca_topic_score_codex":0.0018460697,"about_ca_topic_score_gemma":0.0039794324,"teacher_disagreement_score":0.022268225,"about_ca_system_score_codex":0.0033600482,"about_ca_system_score_gemma":0.0016763094,"threshold_uncertainty_score":0.07449466},"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":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0016573338,0.09448054,0.07076185,0.004871403,0.006113206,0.000067735426,0.00040623624,0.0009399045,0.8207017],"genre_scores_gemma":[0.048031688,0.0889794,0.040321127,0.0016769166,0.011492995,0.00021508803,0.00087476696,0.00083630526,0.80757165],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9994242,0.00008902737,0.000023491215,0.00009760434,0.00032920486,0.00003650061],"domain_scores_gemma":[0.9994746,0.00019877566,0.000023690925,0.00012366628,0.00012296336,0.000056297533],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00045882238,0.00161757,0.0015346477,0.0034065067,0.0011332354,0.0038076527,0.000981299,0.0007900925,0.06274124],"category_scores_gemma":[0.0015490944,0.0005878066,0.0007826124,0.0044523156,0.0020989669,0.0049654697,0.0023682443,0.003101809,0.027604215],"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.000011826705,0.000028965247,0.00008942982,0.0004411653,0.000020050138,0.00003246033,0.00012692323,0.001050784,0.0006234322,0.5911538,0.17795646,0.22846477],"study_design_scores_gemma":[0.0000043003715,0.000010681635,0.00020330478,0.00016009677,0.0000075647545,0.00012478877,0.000038378024,0.0019117679,0.00029162155,0.45018783,0.54704976,0.00000987543],"about_ca_topic_score_codex":0.00060042564,"about_ca_topic_score_gemma":0.0011548058,"teacher_disagreement_score":0.06274124,"about_ca_system_score_codex":0.0014978831,"about_ca_system_score_gemma":0.0011864065,"threshold_uncertainty_score":0.20989037},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2876396,0.0009250947,0.54468256,0.0017178517,0.00037495268,0.00013731723,0.00053623976,0.00022992055,0.16375647],"genre_scores_gemma":[0.86437154,0.000861964,0.095989905,0.0006059199,0.00023345329,0.0002792626,0.00041894606,0.00013279701,0.037106093],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995797,0.00011254266,0.000016295868,0.0000709119,0.00011529056,0.00010509024],"domain_scores_gemma":[0.9996784,0.00008125637,0.000042322376,0.000046752513,0.00007893382,0.000072431394],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00063016085,0.0003808048,0.00051242684,0.0011927749,0.0010028912,0.0010525119,0.00077810825,0.0006792209,0.0054503577],"category_scores_gemma":[0.0013228233,0.00024240195,0.00051132514,0.0005929603,0.0014913866,0.0014335043,0.0015806727,0.0016549573,0.0011126609],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000005544695,0.000004594031,0.00006137948,0.0000074755967,0.0000017984069,0.000012230485,0.000035784273,0.0013061722,0.00033618763,0.99563015,0.00052473415,0.0020739026],"study_design_scores_gemma":[0.000014930805,0.000023587641,0.00021769915,0.000019366467,0.0000041259236,0.000055134748,0.00006783637,0.0391311,0.0006706028,0.95158356,0.00819349,0.000018483948],"about_ca_topic_score_codex":0.0015282079,"about_ca_topic_score_gemma":0.0013717081,"teacher_disagreement_score":0.0054503577,"about_ca_system_score_codex":0.00074581435,"about_ca_system_score_gemma":0.00077387405,"threshold_uncertainty_score":0.0182333},"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":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.23745404,0.0012583724,0.33745372,0.0023047237,0.0012984022,0.00031562385,0.0047053862,0.0030272235,0.4121825],"genre_scores_gemma":[0.92260987,0.00031786883,0.03468276,0.0005889211,0.00027226645,0.00013262893,0.0039918055,0.00037505894,0.0370288],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99768674,0.0004189975,0.0002749525,0.0005852143,0.00051727763,0.00051684835],"domain_scores_gemma":[0.99541,0.0015348472,0.00030317824,0.0010701267,0.001167522,0.0005142835],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013547253,0.00035400293,0.0005681994,0.0014125656,0.0024934262,0.0041955546,0.0010150762,0.0011525194,0.021416765],"category_scores_gemma":[0.0053301323,0.00043561336,0.001960006,0.0009377009,0.0029222216,0.006651936,0.0028679876,0.0027981303,0.002649746],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000121675585,0.0000718129,0.0011881114,0.0000400393,0.000023821502,0.00018187275,0.00040840666,0.0005638189,0.0010413465,0.9796566,0.0034214505,0.013281083],"study_design_scores_gemma":[0.000044634573,0.00004265422,0.0010114801,0.000028623093,0.000027191572,0.00037192236,0.00026980287,0.0023157615,0.0017843565,0.97171956,0.022362232,0.00002178978],"about_ca_topic_score_codex":0.0062380475,"about_ca_topic_score_gemma":0.004662781,"teacher_disagreement_score":0.021416765,"about_ca_system_score_codex":0.0019730642,"about_ca_system_score_gemma":0.0016877933,"threshold_uncertainty_score":0.071646154},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.61049694,0.0047599324,0.09641504,0.005654746,0.0009266807,0.00006911096,0.0010686872,0.00043229878,0.28017655],"genre_scores_gemma":[0.9692693,0.0010169188,0.008013758,0.00021754691,0.00053213397,0.000029004179,0.00027578144,0.00008097527,0.020564623],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990608,0.00022311824,0.000042501193,0.00013625671,0.00028503532,0.00025232654],"domain_scores_gemma":[0.9963313,0.002044249,0.00046273204,0.00028400973,0.00033803625,0.00053974014],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014174823,0.0006362194,0.0008574892,0.0026274421,0.0020122852,0.0035921123,0.00077806896,0.0007110579,0.011360294],"category_scores_gemma":[0.0068111955,0.00041380338,0.00052873004,0.0020890804,0.005443902,0.009570002,0.0023049705,0.0024153213,0.0011760438],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006627609,0.000018527355,0.00044192933,0.000032354834,0.0000054043903,0.00005019652,0.00017980093,0.0010157882,0.0003507122,0.9908241,0.0017314554,0.0052834265],"study_design_scores_gemma":[0.000008308606,0.000014307273,0.000418676,0.000014027843,0.000005686927,0.000072305585,0.00009619396,0.0026797375,0.00031901838,0.99400866,0.0023503455,0.000012721972],"about_ca_topic_score_codex":0.0026537913,"about_ca_topic_score_gemma":0.003764904,"teacher_disagreement_score":0.011360294,"about_ca_system_score_codex":0.0017897997,"about_ca_system_score_gemma":0.0009108845,"threshold_uncertainty_score":0.03800392},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.060543522,0.0006831075,0.9142895,0.0025514606,0.00021168606,0.00012839824,0.0006026091,0.0011096889,0.01988003],"genre_scores_gemma":[0.69005275,0.0007539288,0.29416615,0.0006634665,0.0004485505,0.0002836856,0.0008632748,0.0009470658,0.011821216],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.997414,0.00080901274,0.00017458941,0.00042343803,0.0008508484,0.00032815285],"domain_scores_gemma":[0.98630965,0.00991021,0.0004323395,0.00211328,0.0009568897,0.0002776743],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0024916325,0.0008711693,0.0015332475,0.0013370897,0.0013317595,0.0039210333,0.002618819,0.0014970632,0.011105343],"category_scores_gemma":[0.019030022,0.0004994731,0.0013396887,0.0024425827,0.002105587,0.007387829,0.0035611787,0.0043946495,0.001490708],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000771027,0.0001922099,0.0013858845,0.00038593396,0.00006630179,0.000114412695,0.0003313032,0.09827294,0.005652465,0.73681706,0.010460901,0.14554954],"study_design_scores_gemma":[0.00003609646,0.00003270639,0.00020897276,0.000019167614,0.000029281944,0.000044511075,0.0000338379,0.38653147,0.0023231346,0.60914797,0.0015747689,0.000018138828],"about_ca_topic_score_codex":0.0025625352,"about_ca_topic_score_gemma":0.0037396317,"teacher_disagreement_score":0.011105343,"about_ca_system_score_codex":0.0021367986,"about_ca_system_score_gemma":0.0019896263,"threshold_uncertainty_score":0.03715104},"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.35453182,0.0049849655,0.23780873,0.0038099089,0.00075868686,0.00020215084,0.0014265055,0.0016421021,0.39483514],"genre_scores_gemma":[0.9425799,0.0010547279,0.012963464,0.00030075977,0.00040149613,0.00007932141,0.0005883084,0.00020494589,0.04182704],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990583,0.00029295616,0.000042798656,0.0001974859,0.0002333108,0.00017520926],"domain_scores_gemma":[0.99812144,0.0008184036,0.00017645623,0.00039110874,0.00016172086,0.00033082042],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008677904,0.0008068648,0.0006929335,0.0015789528,0.0017531511,0.004287616,0.0007062848,0.0006734334,0.017650176],"category_scores_gemma":[0.003291499,0.0005181565,0.00075409515,0.0012721198,0.0038139739,0.008103379,0.004391832,0.0023737913,0.0024925924],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000057032776,0.000013698978,0.00020391915,0.000061827006,0.0000094564475,0.00006608779,0.0002066472,0.0007891978,0.00057745905,0.9897065,0.0025057462,0.0058024717],"study_design_scores_gemma":[0.000023575549,0.000026158796,0.00022613358,0.000024273144,0.000013998108,0.00014183816,0.00017921321,0.0019928385,0.0014998943,0.9818465,0.014013872,0.000011747682],"about_ca_topic_score_codex":0.00055577623,"about_ca_topic_score_gemma":0.00069702003,"teacher_disagreement_score":0.017650176,"about_ca_system_score_codex":0.0009337696,"about_ca_system_score_gemma":0.00047012814,"threshold_uncertainty_score":0.059045732},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.38935694,0.003405545,0.20962541,0.0045793564,0.0012131456,0.00017541765,0.001748478,0.0013761254,0.38851967],"genre_scores_gemma":[0.9662312,0.00063068036,0.00982087,0.0004093229,0.0004244558,0.00003099791,0.00030310833,0.0001213572,0.022027915],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993237,0.00008710355,0.00003544577,0.0002150511,0.00018017954,0.0001584694],"domain_scores_gemma":[0.9982628,0.00060428656,0.00026243465,0.0004211987,0.0002519822,0.00019739794],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004003318,0.00041517723,0.0005829542,0.0011458761,0.0013986815,0.002524795,0.0005993053,0.00067523995,0.01287793],"category_scores_gemma":[0.0057977065,0.00027600364,0.0004090842,0.0012415804,0.002345654,0.00342299,0.0019832416,0.0019996834,0.004504006],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00022748194,0.000051554307,0.0011113038,0.00016635239,0.000016489992,0.00030531362,0.00044743964,0.0009987038,0.008837234,0.93175906,0.0074076783,0.04867146],"study_design_scores_gemma":[0.00010013139,0.00015011618,0.0015809053,0.000080416095,0.000035217803,0.0015694136,0.00038317993,0.0038302154,0.008940245,0.93638,0.04687541,0.00007467265],"about_ca_topic_score_codex":0.00067078095,"about_ca_topic_score_gemma":0.0006186008,"teacher_disagreement_score":0.01287793,"about_ca_system_score_codex":0.0006326968,"about_ca_system_score_gemma":0.0005230336,"threshold_uncertainty_score":0.043080986},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.60897523,0.0006304197,0.36406898,0.0003003584,0.00008034854,0.00008537459,0.00045937768,0.0015930305,0.02380681],"genre_scores_gemma":[0.8840372,0.000226032,0.10772421,0.000057308986,0.000044074706,0.000034575107,0.0008235044,0.00013964764,0.0069134366],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99942786,0.00007003849,0.00004345406,0.00015032303,0.00018487897,0.00012337623],"domain_scores_gemma":[0.99931633,0.00022883258,0.00006215716,0.0001743018,0.00015092247,0.000067477384],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006941801,0.00043146202,0.00056701567,0.0011275273,0.0005559315,0.0015877215,0.00078055303,0.00032979128,0.006641403],"category_scores_gemma":[0.0019882265,0.00018004363,0.0006415943,0.0010045326,0.0010658914,0.004141411,0.0016934098,0.0011045192,0.0011803781],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0007257304,0.00018355665,0.0063763345,0.000439379,0.000052501215,0.0005454962,0.0010424841,0.024194054,0.022158667,0.68045646,0.0028190631,0.26100624],"study_design_scores_gemma":[0.000043789394,0.00016721083,0.0018621747,0.00006498681,0.000042382235,0.00037248895,0.0003044771,0.06739427,0.03696863,0.87726307,0.015475318,0.00004122174],"about_ca_topic_score_codex":0.0005764386,"about_ca_topic_score_gemma":0.00090144895,"teacher_disagreement_score":0.006641403,"about_ca_system_score_codex":0.00083691295,"about_ca_system_score_gemma":0.0007859397,"threshold_uncertainty_score":0.02221775},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.82940197,0.0012391644,0.040137406,0.0019696085,0.00017881948,0.000033506964,0.00028821247,0.00025103756,0.12650026],"genre_scores_gemma":[0.98590547,0.00045607798,0.0017293056,0.000073933414,0.00019612546,0.000017265585,0.00012753879,0.00006125561,0.011432973],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99944574,0.00008550162,0.000025836334,0.00014374485,0.000115574185,0.00018359596],"domain_scores_gemma":[0.9988594,0.00035703657,0.00021103241,0.00015002248,0.00015054042,0.00027199206],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00068178744,0.00037451222,0.0008098303,0.0021436492,0.002154525,0.003618082,0.000606588,0.00046526897,0.009650937],"category_scores_gemma":[0.0027466242,0.00033947165,0.00055235595,0.0016162435,0.0037771787,0.0067106206,0.0030442323,0.0017958849,0.00067031954],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004796883,0.000010707274,0.00073125947,0.000017443184,0.00000491555,0.000065959845,0.00029009383,0.00039401304,0.0005010704,0.99378294,0.00051559595,0.0036380526],"study_design_scores_gemma":[0.000028550448,0.000025355157,0.0014873552,0.000016033413,0.000016440204,0.0002561437,0.00037391996,0.0019101698,0.00097638305,0.9894935,0.0054007196,0.000015308253],"about_ca_topic_score_codex":0.0010714,"about_ca_topic_score_gemma":0.0007110813,"teacher_disagreement_score":0.009650937,"about_ca_system_score_codex":0.0014882676,"about_ca_system_score_gemma":0.0006737133,"threshold_uncertainty_score":0.03228563},"labels":[],"label_agreement":null},{"id":"W2464139764","doi":"10.1090/mcom/3076","title":"Computation of invariants of finite abelian groups","year":2015,"lang":"en","type":"article","venue":"Mathematics of Computation","topic":"Polynomial and algebraic computation","field":"Computer Science","cited_by":16,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada; Agence Nationale de la Recherche; Nanyang Technological University; Division of Mathematical Sciences; National University of Singapore","keywords":"Mathematics; Generating set of a group; Abelian group; Invariant (physics); Homogeneous space; Computation; Polynomial; Integer (computer science); Discrete mathematics; Algebra over a field; Pure mathematics; Algorithm; Computer science; Mathematical analysis; Geometry","score_opus":0.04075089591998207,"score_gpt":0.26849546060062607,"score_spread":0.227744564680644,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2464139764","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.70884514,0.00011755199,0.27349702,0.00030020383,0.000054235432,0.00010790139,0.00023670995,0.0010503465,0.015790846],"genre_scores_gemma":[0.9344806,0.000047570316,0.06194318,0.00003836614,0.00003551975,0.0000524558,0.0005016833,0.00015756226,0.002742994],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994962,0.00008328236,0.000026479058,0.00009009583,0.00016616925,0.00013769782],"domain_scores_gemma":[0.999196,0.00042660595,0.00010530176,0.0001263032,0.000089354464,0.000056431738],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006322824,0.0005013635,0.0006919971,0.0012420329,0.0006753931,0.0013477915,0.0012217073,0.00044492842,0.003701899],"category_scores_gemma":[0.0025102622,0.00024428684,0.0008293778,0.0008628034,0.0015283048,0.0020724197,0.0011796413,0.00081292965,0.0005516604],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00024625368,0.00020937703,0.0036846264,0.00018126692,0.000047525868,0.00034237947,0.00047831217,0.072683394,0.016011821,0.8271785,0.0023817455,0.07655488],"study_design_scores_gemma":[0.00003995514,0.00009464098,0.0004838532,0.000015302025,0.0000284538,0.00007976375,0.00009599448,0.2396553,0.023998192,0.7324751,0.0030073097,0.000026141968],"about_ca_topic_score_codex":0.00069324824,"about_ca_topic_score_gemma":0.0008794235,"teacher_disagreement_score":0.003701899,"about_ca_system_score_codex":0.0013249575,"about_ca_system_score_gemma":0.0007832992,"threshold_uncertainty_score":0.012384057},"labels":[],"label_agreement":null},{"id":"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.003645195,0.047483534,0.044090047,0.006870576,0.005560713,0.000040073097,0.0003145951,0.0003974428,0.89159775],"genre_scores_gemma":[0.14126192,0.06854918,0.02655021,0.00313726,0.01104365,0.00022827023,0.0006279246,0.0007132476,0.74788827],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.999767,0.000039374823,0.0000114326285,0.000030793617,0.00013064087,0.000020782025],"domain_scores_gemma":[0.9997063,0.00011519162,0.000020497415,0.000034144294,0.000087301334,0.000036398964],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00025621156,0.00076911337,0.00049675116,0.0019539758,0.0010193211,0.0047377,0.0007506501,0.0006621652,0.027897676],"category_scores_gemma":[0.0012737863,0.00032642987,0.0002545944,0.0023256429,0.0023965016,0.006312647,0.0014196214,0.002504785,0.00878289],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000039319625,0.000005632899,0.000016309159,0.00006269219,0.000001153694,0.000010211659,0.00013534722,0.00015869953,0.00016914612,0.9372789,0.037174195,0.02498387],"study_design_scores_gemma":[0.0000036129127,0.0000038952735,0.000053016687,0.000065826665,0.0000015696089,0.000047035308,0.000065106055,0.00030327545,0.00011089583,0.69675773,0.30258197,0.000006117802],"about_ca_topic_score_codex":0.00083117257,"about_ca_topic_score_gemma":0.0012130892,"teacher_disagreement_score":0.027897676,"about_ca_system_score_codex":0.0018356966,"about_ca_system_score_gemma":0.0010390037,"threshold_uncertainty_score":0.093327045},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13123763,0.00045300828,0.86163646,0.000102069025,0.000026311374,0.00003785663,0.00018678236,0.0029867697,0.0033331362],"genre_scores_gemma":[0.6663079,0.0002769032,0.33035764,0.000036783043,0.000032002103,0.00008154296,0.00053545466,0.0003902238,0.0019814458],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990139,0.00014356084,0.00008945097,0.00025219127,0.0003562737,0.0001445726],"domain_scores_gemma":[0.99698573,0.0013273562,0.0003301366,0.0005121979,0.000644333,0.0002002857],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016091794,0.0007779421,0.0011288454,0.0024335692,0.0006811484,0.00221751,0.0016420605,0.00058411463,0.0037538656],"category_scores_gemma":[0.012306268,0.00047499008,0.00057257985,0.0012369934,0.001379335,0.0047992626,0.002549709,0.0010898655,0.0015145433],"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.0012701753,0.0001448581,0.01868185,0.0006750651,0.000119622826,0.0010683445,0.0011932756,0.12189798,0.030576402,0.26625562,0.004375953,0.55374086],"study_design_scores_gemma":[0.00007426083,0.00013270557,0.0016035407,0.00011221512,0.000043257256,0.0006418088,0.00035879793,0.6093484,0.035067365,0.3416821,0.010850023,0.000085478256],"about_ca_topic_score_codex":0.00091072876,"about_ca_topic_score_gemma":0.0009089222,"teacher_disagreement_score":0.0037538656,"about_ca_system_score_codex":0.00089570525,"about_ca_system_score_gemma":0.00074671075,"threshold_uncertainty_score":0.012557924},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1327152,0.00119415,0.5353111,0.0009678437,0.0011338627,0.0001400882,0.00020644092,0.0009413,0.32739002],"genre_scores_gemma":[0.68243456,0.0011798727,0.10171544,0.00054337917,0.0003120001,0.0001268399,0.0003969473,0.0010299388,0.21226098],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99942267,0.00008361102,0.00003261651,0.00013636523,0.00023678549,0.00008797082],"domain_scores_gemma":[0.9992156,0.0002591906,0.00006549972,0.00021742916,0.00017912271,0.00006306632],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005748385,0.0005690367,0.0007258042,0.0009013098,0.00081469846,0.0013850321,0.0011728699,0.0008162463,0.0330354],"category_scores_gemma":[0.0039227377,0.00039206588,0.00044596623,0.0010618748,0.0011231306,0.002434412,0.0024892478,0.0020559202,0.005534745],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00023377023,0.000048637154,0.00031130255,0.00016787012,0.000014232618,0.00023166605,0.0003660229,0.0065200776,0.01533349,0.8212881,0.0073261424,0.14815868],"study_design_scores_gemma":[0.00006915284,0.00012025487,0.0005686326,0.00008362453,0.000016777958,0.00071977597,0.0002603636,0.061263107,0.01653191,0.8821838,0.03814475,0.00003792318],"about_ca_topic_score_codex":0.00029344135,"about_ca_topic_score_gemma":0.00038363392,"teacher_disagreement_score":0.0330354,"about_ca_system_score_codex":0.00069705455,"about_ca_system_score_gemma":0.00040105908,"threshold_uncertainty_score":0.1105144},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011021613,0.019612094,0.02130117,0.0022522837,0.0012526191,0.00002956426,0.00022744307,0.00026532958,0.94403774],"genre_scores_gemma":[0.26219794,0.039447937,0.020194117,0.0011358038,0.0025717313,0.00010463668,0.0005357909,0.00020307132,0.673609],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9998523,0.0000322366,0.000007480805,0.000027369597,0.0000638527,0.000016654461],"domain_scores_gemma":[0.9998258,0.0000678766,0.0000098482,0.00003349501,0.000038518927,0.000024508228],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00031175537,0.0003439808,0.000272375,0.0008420708,0.00073090376,0.0014791039,0.00025217328,0.00022890267,0.017269138],"category_scores_gemma":[0.0005377788,0.00017085568,0.00032282682,0.0009407032,0.0014370545,0.0033719847,0.0009086221,0.0013397614,0.0034308967],"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.00001368607,0.000010588328,0.000066275905,0.00014519304,0.0000029384282,0.0000810782,0.00034799156,0.00031925584,0.00060820364,0.9260182,0.03122789,0.04115874],"study_design_scores_gemma":[0.0000067746596,0.000020994454,0.00025434117,0.00011163388,0.0000034851817,0.00037879575,0.000112419126,0.00037552623,0.00026786188,0.39942685,0.5990355,0.0000057361067],"about_ca_topic_score_codex":0.0004040974,"about_ca_topic_score_gemma":0.0005848968,"teacher_disagreement_score":0.017269138,"about_ca_system_score_codex":0.0009406359,"about_ca_system_score_gemma":0.0006352775,"threshold_uncertainty_score":0.057771027},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.029806476,0.00011115461,0.9592277,0.00030916795,0.000061612845,0.00007752518,0.00040000357,0.00514778,0.0048586186],"genre_scores_gemma":[0.34261146,0.00015079105,0.64679146,0.00018724863,0.00009278935,0.00023865518,0.001816443,0.00076941104,0.0073418976],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985262,0.00021436696,0.000090097274,0.0003388608,0.00055943977,0.0002709276],"domain_scores_gemma":[0.99640733,0.001404928,0.00023329453,0.0011057125,0.0006816711,0.00016706917],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00083417527,0.0010363295,0.00092579145,0.0009921555,0.00094083545,0.0019254101,0.001598687,0.0009710075,0.008142251],"category_scores_gemma":[0.00694541,0.00059413805,0.00087745785,0.001629869,0.0011326736,0.0025576015,0.0024372544,0.0015877729,0.0037047614],"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.0012588772,0.00035338238,0.0052416762,0.00034953488,0.00012601198,0.00031947822,0.00057600765,0.17167157,0.031164791,0.17384076,0.037110128,0.57798785],"study_design_scores_gemma":[0.00012292113,0.00009909645,0.00060173374,0.000017653987,0.000017305001,0.00013161618,0.00010046442,0.8741264,0.018568778,0.10121034,0.004954676,0.000048984537],"about_ca_topic_score_codex":0.0058321343,"about_ca_topic_score_gemma":0.015638547,"teacher_disagreement_score":0.008142251,"about_ca_system_score_codex":0.0017274866,"about_ca_system_score_gemma":0.003390096,"threshold_uncertainty_score":0.027238607},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.027164942,0.000379079,0.95159566,0.00032901147,0.0001836634,0.00017513706,0.00050682033,0.00948416,0.010181424],"genre_scores_gemma":[0.17018616,0.00023784606,0.8177504,0.00017038698,0.00015426042,0.00019346707,0.0015808064,0.00066169363,0.0090649305],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991749,0.00009993023,0.00006522192,0.00017867406,0.00033099056,0.00015023153],"domain_scores_gemma":[0.9992065,0.00011567651,0.000048011392,0.00022103256,0.0003439992,0.00006477636],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005815751,0.0007428638,0.00096419157,0.0015874713,0.001086763,0.0010977602,0.0011298588,0.0005575327,0.0127613135],"category_scores_gemma":[0.0024387746,0.00037583194,0.0006490546,0.0023467646,0.00062727055,0.0020228953,0.0023234575,0.00081965484,0.005210431],"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.0005258409,0.00015789285,0.0016669215,0.00018390207,0.00004247813,0.0003150717,0.00014738609,0.03867018,0.019122321,0.048481166,0.03154033,0.8591465],"study_design_scores_gemma":[0.0006188432,0.00045434103,0.0009902931,0.00006174593,0.00007443323,0.0011716408,0.00016149387,0.6958682,0.0617659,0.12552057,0.1132048,0.00010773396],"about_ca_topic_score_codex":0.0020595156,"about_ca_topic_score_gemma":0.00272109,"teacher_disagreement_score":0.0127613135,"about_ca_system_score_codex":0.0007065433,"about_ca_system_score_gemma":0.0017605091,"threshold_uncertainty_score":0.042690873},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.002204701,0.03227598,0.032397587,0.0029368303,0.0037409323,0.00004050339,0.00041322203,0.00052337657,0.92546684],"genre_scores_gemma":[0.036602482,0.051421117,0.021983884,0.0013842501,0.005532804,0.000080606835,0.00072967686,0.00072945346,0.88153565],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99976784,0.000023246523,0.000011044736,0.000033063803,0.00013865528,0.00002613278],"domain_scores_gemma":[0.9998233,0.00006282653,0.000008920951,0.000025953217,0.000057815123,0.000021222353],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00021343917,0.00096756243,0.0006623391,0.0019958036,0.00085558754,0.0017260006,0.00074720825,0.0006043147,0.0691694],"category_scores_gemma":[0.0006551723,0.00047507999,0.00045110827,0.003047551,0.0013373347,0.003426561,0.0014394843,0.0029130813,0.028138638],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000023420438,0.000033178003,0.00005428801,0.00041263097,0.0000058932987,0.00006925079,0.00020466522,0.0011966936,0.0014140606,0.58819944,0.16746128,0.24092524],"study_design_scores_gemma":[0.0000047007325,0.0000137730585,0.00011709164,0.00013718675,0.000003786168,0.00016322278,0.00003077477,0.0005067492,0.00036602467,0.20356399,0.79508245,0.000010257008],"about_ca_topic_score_codex":0.00065809407,"about_ca_topic_score_gemma":0.000952876,"teacher_disagreement_score":0.0691694,"about_ca_system_score_codex":0.0013164224,"about_ca_system_score_gemma":0.0007423282,"threshold_uncertainty_score":0.23139471},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.035429854,0.0007168093,0.9115504,0.00036359296,0.0005561524,0.00006661073,0.00015166815,0.0008288745,0.05033603],"genre_scores_gemma":[0.42471802,0.0020445767,0.52202564,0.00033705964,0.0006062308,0.000088157736,0.00044687826,0.00063670037,0.049096715],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9996643,0.000064835964,0.000015053657,0.00005922243,0.00014733458,0.00004933598],"domain_scores_gemma":[0.9997029,0.000103495026,0.000018527557,0.000106659405,0.00004801587,0.000020491987],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00045445215,0.00056370435,0.00062439026,0.0009022588,0.0006527179,0.0010906996,0.0006794439,0.0005430145,0.01130904],"category_scores_gemma":[0.0015633159,0.0004121515,0.0006391007,0.0010594199,0.0011185852,0.0020582303,0.0021025816,0.0018134847,0.002520188],"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.00015903692,0.00006501007,0.0002601318,0.00024964556,0.000023184277,0.00020528233,0.00019279489,0.010167086,0.014266419,0.7467103,0.00613691,0.22156423],"study_design_scores_gemma":[0.00004127676,0.00015270604,0.00033762268,0.000088557834,0.000035812107,0.00054688274,0.00012532515,0.08997529,0.017015794,0.83381605,0.05781455,0.000050180308],"about_ca_topic_score_codex":0.00048203877,"about_ca_topic_score_gemma":0.00072444184,"teacher_disagreement_score":0.01130904,"about_ca_system_score_codex":0.00034576852,"about_ca_system_score_gemma":0.0003658625,"threshold_uncertainty_score":0.03783244},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.23568188,0.0009340779,0.72850806,0.00059187267,0.00027230714,0.000091015645,0.0010246333,0.002175569,0.030720666],"genre_scores_gemma":[0.8066471,0.00084304216,0.17142396,0.00015583768,0.0003047333,0.000055693286,0.002046547,0.0005572179,0.017965848],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99933964,0.000087826294,0.000027349042,0.0001744076,0.00024182344,0.00012888605],"domain_scores_gemma":[0.9983253,0.00083078357,0.00016695347,0.00025267174,0.0002929423,0.00013125915],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000498832,0.0006991676,0.00069179205,0.0012542778,0.0005872314,0.0024273319,0.001044472,0.00045276727,0.009086708],"category_scores_gemma":[0.004578643,0.00045446624,0.0006635715,0.0017336642,0.0009794707,0.004829621,0.0015876263,0.0014211837,0.0028042493],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00052587717,0.00014874565,0.004756859,0.00054390874,0.00007926129,0.00031108616,0.0007984833,0.032031346,0.02861329,0.5319313,0.018642826,0.38161695],"study_design_scores_gemma":[0.00005098728,0.0001177883,0.0012169152,0.000062981606,0.000035164732,0.00041573553,0.00022218355,0.077402994,0.0148521755,0.89202094,0.013558527,0.00004352481],"about_ca_topic_score_codex":0.0008113593,"about_ca_topic_score_gemma":0.001837926,"teacher_disagreement_score":0.009086708,"about_ca_system_score_codex":0.000899039,"about_ca_system_score_gemma":0.0008171456,"threshold_uncertainty_score":0.030398011},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15183853,0.0013461072,0.7309619,0.004067418,0.0005926578,0.00015678132,0.0011146585,0.00183133,0.10809068],"genre_scores_gemma":[0.7377835,0.0013564485,0.22140808,0.0011324908,0.00044047998,0.00018870039,0.0006152154,0.0011435964,0.035931572],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99852645,0.000163866,0.00009652166,0.00036330012,0.00038947267,0.00046037827],"domain_scores_gemma":[0.9953858,0.001699032,0.00032855166,0.0009919642,0.00092745863,0.0006671244],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011917703,0.00072575925,0.001212477,0.002392895,0.0022029025,0.0060120784,0.0020455974,0.0022473694,0.017439388],"category_scores_gemma":[0.007513283,0.00091565173,0.0012572926,0.0019632417,0.0048920563,0.015343721,0.0037230665,0.0058369273,0.0037400564],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000049270155,0.000019914045,0.00033097147,0.000043920358,0.0000036530257,0.000050690818,0.000206966,0.0003431622,0.0010509159,0.9845716,0.0012423251,0.0120865],"study_design_scores_gemma":[0.000016350381,0.000022438933,0.00039376074,0.000022818438,0.000009638725,0.00011294034,0.0001307789,0.003579534,0.0011318171,0.98763824,0.0069208867,0.000020833486],"about_ca_topic_score_codex":0.0024618169,"about_ca_topic_score_gemma":0.003659815,"teacher_disagreement_score":0.017439388,"about_ca_system_score_codex":0.0023435282,"about_ca_system_score_gemma":0.0013747744,"threshold_uncertainty_score":0.05834061},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11135984,0.013141776,0.7631475,0.0058034766,0.0010434062,0.0002477826,0.002578194,0.0012953309,0.10138266],"genre_scores_gemma":[0.8200588,0.020598497,0.11754412,0.0028166368,0.008383249,0.00066181284,0.0047202753,0.0011846524,0.024031863],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99562824,0.000747219,0.00027858815,0.0010967907,0.0016141178,0.00063502014],"domain_scores_gemma":[0.9776863,0.015320744,0.0024480599,0.0020666108,0.0015887734,0.000889447],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0052759685,0.0020039617,0.0020744887,0.0075898236,0.0030686331,0.0059636603,0.003075301,0.0016048308,0.015770093],"category_scores_gemma":[0.03667986,0.0011441164,0.0014988233,0.012233281,0.0049062134,0.011416429,0.0034616317,0.0040664147,0.0024322001],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002576952,0.00015244613,0.0057414374,0.00059274054,0.000091376874,0.0004228945,0.0007222012,0.016821364,0.0043521626,0.88465405,0.012945668,0.07324596],"study_design_scores_gemma":[0.0000496235,0.00011761513,0.0028123793,0.00015546208,0.00009022011,0.0010521895,0.00023110118,0.043160476,0.0062355986,0.9236951,0.022318985,0.000081263526],"about_ca_topic_score_codex":0.0014712295,"about_ca_topic_score_gemma":0.0011958486,"teacher_disagreement_score":0.015770093,"about_ca_system_score_codex":0.002984944,"about_ca_system_score_gemma":0.00160177,"threshold_uncertainty_score":0.05275625},"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":"software","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"software","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.040917426,0.0004981781,0.92485195,0.0005945168,0.00012551298,0.0001087716,0.00067649764,0.013708239,0.01851893],"genre_scores_gemma":[0.5239838,0.0008571106,0.45264217,0.00035629937,0.0002807815,0.00033360324,0.00207348,0.0030073,0.016465425],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99581194,0.00095310487,0.00042088766,0.00079556974,0.0016689667,0.00034946698],"domain_scores_gemma":[0.99280566,0.002357107,0.0004242861,0.0031441879,0.00080343767,0.00046530992],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0037178015,0.00084756373,0.0012519397,0.0030084793,0.0016235914,0.0059654303,0.0024795968,0.0010682971,0.013576683],"category_scores_gemma":[0.02109566,0.0010620625,0.0013767155,0.003049064,0.0037197978,0.024148153,0.0063687465,0.002038425,0.007022803],"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.00045906316,0.00017376977,0.0027752433,0.00031809628,0.000070313195,0.00033303633,0.0007526377,0.02705033,0.0045343395,0.7483132,0.010402053,0.20481798],"study_design_scores_gemma":[0.000031480165,0.000043511416,0.00011835064,0.000054251006,0.000019923542,0.00011579553,0.00008833884,0.07912383,0.007099688,0.8956738,0.017593993,0.00003682321],"about_ca_topic_score_codex":0.0012723573,"about_ca_topic_score_gemma":0.0019053702,"teacher_disagreement_score":0.013576683,"about_ca_system_score_codex":0.0010316923,"about_ca_system_score_gemma":0.0016148031,"threshold_uncertainty_score":0.04541856},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.20410927,0.00092322635,0.5454733,0.0030924696,0.0012026464,0.00018977052,0.0008005715,0.0007886399,0.24342018],"genre_scores_gemma":[0.9039366,0.0007587762,0.056558162,0.0012214134,0.0008685614,0.00015577444,0.0009880917,0.00041820205,0.03509439],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99847084,0.00017620147,0.00011027847,0.00047863304,0.00046927854,0.00029481074],"domain_scores_gemma":[0.99652267,0.0016997408,0.00014454279,0.0005653394,0.00075324514,0.000314423],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015615203,0.0005473058,0.000961348,0.0019887052,0.002423081,0.0027835537,0.0012519724,0.0013163942,0.014970686],"category_scores_gemma":[0.0053750887,0.00054131227,0.0015932203,0.001394245,0.0036929513,0.010348399,0.004387789,0.0037911243,0.0012591004],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000033830536,0.000033148015,0.00021164805,0.000024517805,0.000006972091,0.00006296131,0.00023119482,0.00023548712,0.0005757252,0.99017227,0.00091094314,0.0075013535],"study_design_scores_gemma":[0.00001633258,0.000015187446,0.00013559511,0.000008987577,0.0000086313,0.000060378796,0.000058159938,0.0015221346,0.0004810956,0.99347335,0.004213578,0.0000065489044],"about_ca_topic_score_codex":0.0011532421,"about_ca_topic_score_gemma":0.0009241777,"teacher_disagreement_score":0.014970686,"about_ca_system_score_codex":0.0013290314,"about_ca_system_score_gemma":0.00068323145,"threshold_uncertainty_score":0.05008197},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.65577227,0.00054319814,0.32396114,0.0014247878,0.00016004292,0.00014987342,0.0011792557,0.0016309315,0.0151785435],"genre_scores_gemma":[0.9544945,0.00017131976,0.04031693,0.00007605633,0.000059901173,0.00003962958,0.00090018206,0.00015229634,0.0037892142],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988859,0.00024297115,0.00007213336,0.00027424013,0.0003388943,0.00018584864],"domain_scores_gemma":[0.99416095,0.0035602148,0.00046675498,0.00084788864,0.00058304606,0.000381192],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013823293,0.0008345824,0.0009798771,0.001111989,0.00093632337,0.0033444976,0.0017460529,0.0011662962,0.013071701],"category_scores_gemma":[0.012002594,0.0006704681,0.0006623779,0.0010555725,0.002238999,0.0069350186,0.004027645,0.002740586,0.0015058116],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0016428204,0.00027732644,0.008960074,0.00089547137,0.0001426799,0.00056363805,0.001416453,0.045149498,0.01337497,0.8248479,0.008865614,0.093863614],"study_design_scores_gemma":[0.0001174955,0.00013073265,0.00088554487,0.000060543305,0.000051566523,0.00017774467,0.0006013197,0.098731294,0.0074542374,0.8885062,0.0032476652,0.00003579496],"about_ca_topic_score_codex":0.000499651,"about_ca_topic_score_gemma":0.0009119775,"teacher_disagreement_score":0.013071701,"about_ca_system_score_codex":0.0010117341,"about_ca_system_score_gemma":0.0006355492,"threshold_uncertainty_score":0.043729126},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7483622,0.0035437392,0.15158977,0.0016061557,0.0002794449,0.0000934847,0.001634368,0.0012401902,0.09165072],"genre_scores_gemma":[0.97357744,0.00072378415,0.017861955,0.00012234473,0.00017815287,0.000027978174,0.0006401939,0.0002461712,0.006621888],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9980989,0.0005142348,0.0001191248,0.00033798363,0.0005122256,0.00041759215],"domain_scores_gemma":[0.9890708,0.007348081,0.0008382965,0.0012385846,0.00078217045,0.00072199653],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0025710685,0.00059685844,0.0008421459,0.0026640845,0.00094281405,0.004013321,0.0016543431,0.0009041585,0.012095034],"category_scores_gemma":[0.014306564,0.00077164057,0.00063788303,0.0017192323,0.0026644608,0.015984228,0.0031160421,0.0017441275,0.0013933325],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00104918,0.00008854639,0.006700752,0.0003227553,0.000054466178,0.0001831563,0.0019672737,0.0066394475,0.005659945,0.8938603,0.0051121567,0.078362055],"study_design_scores_gemma":[0.00008609367,0.00022613113,0.005466887,0.0000869631,0.00012993373,0.0003168051,0.0011760772,0.010785419,0.0071190726,0.9583054,0.016226199,0.00007502281],"about_ca_topic_score_codex":0.0005795548,"about_ca_topic_score_gemma":0.00082626665,"teacher_disagreement_score":0.012095034,"about_ca_system_score_codex":0.0011381643,"about_ca_system_score_gemma":0.0006752139,"threshold_uncertainty_score":0.040461898},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.049526293,0.00017268298,0.9411867,0.000993261,0.00008396784,0.0002309555,0.0003584533,0.0015327531,0.005914962],"genre_scores_gemma":[0.5668061,0.0001261271,0.42618197,0.00029518444,0.00006848346,0.0003169033,0.00081662764,0.00018998147,0.005198671],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9976986,0.00049759005,0.00013725068,0.00060062914,0.0006395749,0.0004263308],"domain_scores_gemma":[0.9956077,0.0022290598,0.00032223368,0.0012208313,0.00043224578,0.0001879626],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014427787,0.0005677771,0.001211723,0.00096583227,0.0013615141,0.002108023,0.0027221658,0.0019013452,0.006436053],"category_scores_gemma":[0.007032543,0.00045949707,0.0010592993,0.0015161118,0.0014818656,0.0045133564,0.0043808473,0.0022654082,0.0013055787],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0008742023,0.00047387846,0.0022861776,0.00036913785,0.00014102871,0.0002231313,0.0006260624,0.0870131,0.014490486,0.61998487,0.011696196,0.26182172],"study_design_scores_gemma":[0.0001483908,0.000091643524,0.00035895873,0.000020567464,0.000033729397,0.00009255893,0.00010997401,0.54899853,0.0065693106,0.44094867,0.0025895657,0.00003806371],"about_ca_topic_score_codex":0.0017783899,"about_ca_topic_score_gemma":0.0021199288,"teacher_disagreement_score":0.006436053,"about_ca_system_score_codex":0.0019389588,"about_ca_system_score_gemma":0.0031961026,"threshold_uncertainty_score":0.021530747},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8480728,0.0015028119,0.08021934,0.0029124296,0.00026288297,0.000029699453,0.00018963608,0.00018885171,0.066621564],"genre_scores_gemma":[0.9819566,0.001038021,0.005961703,0.0002087358,0.00035642012,0.000037396185,0.00014992422,0.000087246764,0.0102038635],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9996531,0.00011227358,0.000013766002,0.000052721025,0.000092378745,0.00007571077],"domain_scores_gemma":[0.9964148,0.0024182736,0.00033580154,0.00028300172,0.00025506876,0.00029309277],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011488507,0.00044634452,0.00062364026,0.0025172206,0.0010690031,0.0026075519,0.0011137818,0.0011482314,0.006176741],"category_scores_gemma":[0.00822091,0.00036114926,0.0004980716,0.0015718873,0.00248297,0.003762076,0.0010289546,0.0017735756,0.000632594],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000260937,0.000016746264,0.00027666235,0.000016741107,0.0000025624104,0.000049432874,0.00012406959,0.0026511746,0.0004692315,0.9922948,0.0006060805,0.0034664373],"study_design_scores_gemma":[0.000012808615,0.00001397566,0.0003371597,0.000017206574,0.000003976288,0.00011003028,0.0000636382,0.028884593,0.00032309396,0.9692479,0.0009728923,0.000012710198],"about_ca_topic_score_codex":0.00072073366,"about_ca_topic_score_gemma":0.0005395493,"teacher_disagreement_score":0.006176741,"about_ca_system_score_codex":0.0007840052,"about_ca_system_score_gemma":0.00046568163,"threshold_uncertainty_score":0.020663261},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0114779575,0.0002884973,0.9553356,0.00036335128,0.0001609917,0.00012734326,0.0001798824,0.001671066,0.030395249],"genre_scores_gemma":[0.26692298,0.0007922053,0.68971246,0.00042197853,0.0003252924,0.000529983,0.0013157718,0.0021972791,0.037782036],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986236,0.00036111788,0.000054990353,0.00016476547,0.00059207034,0.00020349139],"domain_scores_gemma":[0.99919385,0.00032140446,0.000033512104,0.00018482053,0.00022339879,0.00004296589],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00085573964,0.00089464546,0.0009757376,0.0014286729,0.001276302,0.0022464625,0.0010156082,0.00056094036,0.015595335],"category_scores_gemma":[0.0032773959,0.00038319005,0.0010710567,0.0021154126,0.0019145391,0.0028205817,0.002724345,0.0024673855,0.0075246054],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000108909044,0.00008993059,0.00022729613,0.00015613926,0.000021267679,0.00010890053,0.00027245158,0.021265794,0.004260521,0.79454815,0.011925468,0.16701518],"study_design_scores_gemma":[0.00003035768,0.000036896756,0.00006818483,0.000020354377,0.000008990691,0.000072002695,0.00009004253,0.08553223,0.004223724,0.8912687,0.018628592,0.000020015243],"about_ca_topic_score_codex":0.0018582738,"about_ca_topic_score_gemma":0.002172365,"teacher_disagreement_score":0.015595335,"about_ca_system_score_codex":0.0010101646,"about_ca_system_score_gemma":0.0011533848,"threshold_uncertainty_score":0.052171648},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7927698,0.00055244524,0.1436894,0.0005561877,0.00015778757,0.000089195215,0.00027212722,0.0002935312,0.06161945],"genre_scores_gemma":[0.94808376,0.0003938471,0.02314183,0.000085858635,0.000121096935,0.00010189725,0.00031427204,0.00018189452,0.02757559],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99926347,0.00013443081,0.000051463176,0.00017006423,0.00021136536,0.00016928768],"domain_scores_gemma":[0.9973515,0.0010494612,0.0003377489,0.000268546,0.0004318564,0.0005608296],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010191222,0.0005405848,0.0005671989,0.0030063088,0.0021265065,0.004374629,0.001123618,0.0011327233,0.011548908],"category_scores_gemma":[0.0051082447,0.0006431475,0.00070184126,0.0012757223,0.00358395,0.004637688,0.002539445,0.002134376,0.0011708194],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000053054915,0.000024275674,0.00054506445,0.000029768804,0.000008684004,0.00018725694,0.0002799396,0.0010182314,0.0012901552,0.9937218,0.00027265216,0.0025690596],"study_design_scores_gemma":[0.000024586967,0.0000384134,0.00047718408,0.000037849964,0.000008574785,0.00014495892,0.00032045608,0.013117228,0.0017630449,0.981808,0.0022459533,0.000013696275],"about_ca_topic_score_codex":0.0010154388,"about_ca_topic_score_gemma":0.0016486447,"teacher_disagreement_score":0.011548908,"about_ca_system_score_codex":0.0014462176,"about_ca_system_score_gemma":0.00047728253,"threshold_uncertainty_score":0.038634956},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04012964,0.06166688,0.056982737,0.058437493,0.009326595,0.00010979066,0.0033582468,0.0012481299,0.76874053],"genre_scores_gemma":[0.3509978,0.018684998,0.01845958,0.0016255132,0.0029833692,0.00012095806,0.0013441874,0.00042744918,0.6053562],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99901044,0.00017988891,0.000018580135,0.00016748361,0.00042195618,0.00020167786],"domain_scores_gemma":[0.99916923,0.000111320674,0.000043187858,0.00013568031,0.0003135735,0.00022692248],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011082006,0.0007335851,0.0006901566,0.0019357548,0.002431255,0.005314642,0.00081852765,0.0008528169,0.0363128],"category_scores_gemma":[0.0022511082,0.0003428269,0.000538454,0.0020246964,0.0025944565,0.003382574,0.0017286902,0.0020871141,0.0033671823],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003444298,0.000016410926,0.0002876289,0.000052905747,0.000017005334,0.00008277726,0.0002825109,0.00074187893,0.0010404877,0.9175953,0.06020954,0.019638995],"study_design_scores_gemma":[0.000047016874,0.000019542214,0.0023236773,0.00011595302,0.000017474413,0.00019693316,0.0002943521,0.0032942474,0.0016195581,0.20317997,0.7888413,0.000050011513],"about_ca_topic_score_codex":0.21825548,"about_ca_topic_score_gemma":0.20967266,"teacher_disagreement_score":0.21825548,"about_ca_system_score_codex":0.014503621,"about_ca_system_score_gemma":0.008003733,"threshold_uncertainty_score":0.43397015},"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":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0018827313,0.0061687334,0.006823394,0.030845726,0.0089478055,0.00012536766,0.015480435,0.005439731,0.9242862],"genre_scores_gemma":[0.017267503,0.009292722,0.014825847,0.0073434603,0.0037590438,0.00022486638,0.025155805,0.0017207135,0.92041004],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9986386,0.0001395241,0.00005544156,0.0002756288,0.000664566,0.00022633091],"domain_scores_gemma":[0.99694675,0.00023808547,0.00019832475,0.0005398212,0.00095656636,0.0011204114],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0017048913,0.0012863642,0.000979843,0.0029440513,0.0018935772,0.00502014,0.0018571112,0.0022411838,0.54225844],"category_scores_gemma":[0.0058393823,0.00043757688,0.0008822167,0.0034088467,0.0005407907,0.0051113283,0.0043028756,0.0027811353,0.32004538],"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.000022201533,0.00003574342,0.00035341672,0.00009932186,0.00000853037,0.000039319788,0.00002491574,0.00006828602,0.00017168513,0.03639512,0.888897,0.07388452],"study_design_scores_gemma":[0.000009537812,0.000009687134,0.00042868737,0.00007592869,0.0000045537845,0.00005788731,0.00002989695,0.00014948162,0.00013587916,0.012106966,0.98698306,0.0000083136665],"about_ca_topic_score_codex":0.0038439715,"about_ca_topic_score_gemma":0.007927344,"teacher_disagreement_score":0.54225844,"about_ca_system_score_codex":0.0029035637,"about_ca_system_score_gemma":0.0039922306,"threshold_uncertainty_score":0.65291274},"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.32203397,0.0043751616,0.14437683,0.0037185326,0.0018448704,0.00007480466,0.00020623367,0.000569779,0.52279985],"genre_scores_gemma":[0.7453356,0.0026320503,0.019942556,0.0007435073,0.0010232235,0.00006010315,0.00025291028,0.0002610102,0.22974908],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9997938,0.00004234689,0.000010239848,0.000027498127,0.000082029444,0.000044045424],"domain_scores_gemma":[0.9997502,0.00008223907,0.000025224539,0.00004724313,0.00004842079,0.000046705292],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00038599828,0.00076181535,0.0008273035,0.0010117987,0.00083557144,0.0017149004,0.0010312207,0.0014104828,0.014020426],"category_scores_gemma":[0.0015936914,0.0003217588,0.0006438381,0.0009121491,0.0016806714,0.002105038,0.0014678003,0.002546352,0.0027508002],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000028222057,0.00003181709,0.00007077804,0.000043704757,0.000007966585,0.00012617839,0.00023009261,0.0011836,0.0027941398,0.9847274,0.0018552268,0.00890089],"study_design_scores_gemma":[0.000028573695,0.000019869924,0.0002020855,0.000017105422,0.0000061389123,0.0002607958,0.00011049574,0.009295282,0.0009879144,0.9834278,0.0056248237,0.000019072088],"about_ca_topic_score_codex":0.0004921612,"about_ca_topic_score_gemma":0.000570726,"teacher_disagreement_score":0.014020426,"about_ca_system_score_codex":0.00066475297,"about_ca_system_score_gemma":0.0004887187,"threshold_uncertainty_score":0.046902955},"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11436513,0.015091985,0.10187163,0.0046704835,0.002141007,0.000038142978,0.00018466607,0.0003975306,0.7612394],"genre_scores_gemma":[0.7858457,0.0069359164,0.01610504,0.0007384227,0.003415472,0.00007510593,0.00027462418,0.00025952535,0.18635017],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99970275,0.000060504248,0.000011681817,0.000047091464,0.00013508958,0.000042742497],"domain_scores_gemma":[0.99975127,0.00008733916,0.00003224933,0.000037672737,0.000058610683,0.000032724336],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00048190186,0.00078216614,0.0006354937,0.0026960005,0.0013465662,0.0020534808,0.0007286709,0.0007651417,0.009381943],"category_scores_gemma":[0.00091550563,0.00031006878,0.0005155155,0.0018484921,0.0036190727,0.00464696,0.001530982,0.0022029467,0.0014639351],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000022584854,0.0000049424602,0.000016003434,0.0000082099805,0.000001519402,0.000009754513,0.000041920783,0.00010518239,0.000109243956,0.995044,0.0008727685,0.0037841657],"study_design_scores_gemma":[0.000002406726,0.0000038173,0.00007547447,0.0000053407416,0.0000020512487,0.000046547804,0.000025195046,0.0005004034,0.00009205529,0.9918682,0.0073747416,0.0000037827635],"about_ca_topic_score_codex":0.0006781055,"about_ca_topic_score_gemma":0.00065094896,"teacher_disagreement_score":0.009381943,"about_ca_system_score_codex":0.0011419457,"about_ca_system_score_gemma":0.0003398975,"threshold_uncertainty_score":0.03138572},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06578809,0.010758822,0.03560396,0.0034914822,0.0006575578,0.00003700896,0.00025645026,0.0002242964,0.8831822],"genre_scores_gemma":[0.748129,0.0137263,0.022624988,0.0005071692,0.002970393,0.000068778245,0.00059600914,0.00011858071,0.2112588],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9997137,0.000057449408,0.000012393845,0.000046056673,0.00013613085,0.0000343138],"domain_scores_gemma":[0.99970275,0.00012491696,0.000032121738,0.000038108705,0.00006742248,0.000034600234],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003676111,0.0006381396,0.00041301048,0.0013543172,0.0012272286,0.0030509515,0.0006708909,0.00046706863,0.0077840053],"category_scores_gemma":[0.0011700061,0.0002709479,0.00040506164,0.0017780792,0.0035653284,0.004143459,0.0008570142,0.0020621184,0.0014173742],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000005437125,0.0000032825303,0.000037660408,0.00001912279,0.0000013195694,0.000012933612,0.00009939765,0.00027479115,0.00019463009,0.991379,0.0019889288,0.005983566],"study_design_scores_gemma":[0.00000331132,0.00001021968,0.00024543307,0.000010753621,0.0000024826577,0.000073108786,0.00006782937,0.00055409456,0.00018407893,0.96779007,0.031053958,0.0000045783195],"about_ca_topic_score_codex":0.0010414728,"about_ca_topic_score_gemma":0.0006756422,"teacher_disagreement_score":0.0077840053,"about_ca_system_score_codex":0.0014535942,"about_ca_system_score_gemma":0.00057958683,"threshold_uncertainty_score":0.026040077},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.014728379,0.0018865679,0.38966322,0.0022871436,0.0010976013,0.00018525969,0.0010419248,0.0023760053,0.5867338],"genre_scores_gemma":[0.12524678,0.003776956,0.31096095,0.001090054,0.0005306942,0.00018102695,0.0026580377,0.0016602433,0.55389524],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99969625,0.000045779285,0.000012054181,0.00008038209,0.00012555283,0.00003992727],"domain_scores_gemma":[0.9998635,0.000051498453,0.000008448951,0.000031317624,0.000034113953,0.000011061363],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00034110103,0.0011637416,0.0007432353,0.00050004077,0.0011152979,0.0015810913,0.0008020782,0.0006955741,0.06572882],"category_scores_gemma":[0.000753709,0.00037592746,0.0007594487,0.0007849052,0.000901872,0.0021606456,0.001519122,0.0022158623,0.0287834],"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.00010529192,0.000068396585,0.0002738461,0.00075809966,0.000048744863,0.00013738051,0.00034971876,0.0053115822,0.009793735,0.35107538,0.16648279,0.46559504],"study_design_scores_gemma":[0.00006355672,0.00007908592,0.00039810213,0.00015372552,0.000042406475,0.0005289177,0.000280354,0.015230192,0.018367495,0.4689012,0.49592152,0.0000334024],"about_ca_topic_score_codex":0.0012635876,"about_ca_topic_score_gemma":0.0021172855,"teacher_disagreement_score":0.06572882,"about_ca_system_score_codex":0.0005634167,"about_ca_system_score_gemma":0.000738929,"threshold_uncertainty_score":0.21988481},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.20484714,0.0060898694,0.60627156,0.0033610063,0.00064237206,0.00010498744,0.0010294772,0.002089022,0.17556459],"genre_scores_gemma":[0.8870312,0.003200713,0.08427297,0.00046842874,0.00087531336,0.00013205057,0.0010255456,0.0006650843,0.02232864],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99712783,0.0003139276,0.0001740221,0.000598005,0.0010821277,0.000704067],"domain_scores_gemma":[0.9890555,0.005954647,0.00046039472,0.0019241489,0.0013529263,0.0012523696],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0026090492,0.0012277873,0.0014384402,0.0042197774,0.0020586466,0.0054976633,0.0021236998,0.0011940332,0.008458815],"category_scores_gemma":[0.009398391,0.00074637425,0.0014506729,0.002231442,0.0043377043,0.009207843,0.0052480116,0.00583959,0.0022557685],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00014514777,0.00005246062,0.0016687985,0.00017572282,0.00002323368,0.00027275886,0.0003880611,0.0050963066,0.0052401647,0.96310776,0.002304116,0.021525443],"study_design_scores_gemma":[0.000018228116,0.00009812755,0.0013644336,0.0001344209,0.00006329062,0.00043680865,0.00013678378,0.021028202,0.00768217,0.95108414,0.017889269,0.0000641445],"about_ca_topic_score_codex":0.0011965215,"about_ca_topic_score_gemma":0.0013372266,"teacher_disagreement_score":0.008458815,"about_ca_system_score_codex":0.0022314843,"about_ca_system_score_gemma":0.00091178186,"threshold_uncertainty_score":0.028297603},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.49799842,0.0027889921,0.42660087,0.0029336656,0.0004805181,0.0001537575,0.0006180463,0.00030576668,0.06812002],"genre_scores_gemma":[0.8726829,0.0014635022,0.09806827,0.00021361622,0.00013781096,0.00019655109,0.0003914843,0.00009754308,0.026748296],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9997029,0.000046943052,0.000021274913,0.00006449525,0.00007443314,0.000089803376],"domain_scores_gemma":[0.9995815,0.00021186398,0.00009416455,0.000039745886,0.000048214497,0.000024443847],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005599967,0.00065631873,0.00046256938,0.0007253561,0.000689373,0.0014528317,0.0009794668,0.0013903804,0.008271332],"category_scores_gemma":[0.003395749,0.00030691273,0.0005491428,0.00069160777,0.0012932806,0.0018759693,0.0011785434,0.0012764655,0.0008975801],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00054148317,0.000095251016,0.0024416163,0.00073137536,0.000055395783,0.0010753691,0.0006059777,0.03229722,0.040577985,0.8778452,0.003421987,0.04031119],"study_design_scores_gemma":[0.00023211332,0.00013679924,0.0017060705,0.00018621185,0.00006172267,0.0017424977,0.0008976635,0.12834443,0.037736773,0.8112249,0.01761259,0.00011816754],"about_ca_topic_score_codex":0.0002641444,"about_ca_topic_score_gemma":0.00049032917,"teacher_disagreement_score":0.008271332,"about_ca_system_score_codex":0.0008203224,"about_ca_system_score_gemma":0.00056273805,"threshold_uncertainty_score":0.027670383},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5062396,0.0029553086,0.16623859,0.005542491,0.0011175594,0.00010218519,0.00059059006,0.0004073743,0.31680632],"genre_scores_gemma":[0.97596914,0.0006010279,0.008042044,0.0003587831,0.0008517827,0.000055767345,0.0001618779,0.000058520814,0.013901053],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991466,0.000100475154,0.00003282018,0.0002091649,0.00023775788,0.00027313933],"domain_scores_gemma":[0.99814653,0.00072595157,0.00025296863,0.00023653141,0.00029401627,0.00034396333],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012688054,0.00046047135,0.0007005802,0.001870263,0.0018675216,0.002943973,0.0005230889,0.0006915,0.00763897],"category_scores_gemma":[0.003589183,0.00024856094,0.0009953543,0.0006929808,0.006167066,0.0029308342,0.0018972515,0.0025584775,0.0010615846],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003261377,0.000013555308,0.0003090958,0.000019386664,0.0000034495088,0.000077106335,0.00023447881,0.0002457469,0.0004846671,0.99492455,0.0011308605,0.002524573],"study_design_scores_gemma":[0.000044427194,0.000056204473,0.0010212866,0.000026672551,0.000009898583,0.0003090241,0.00009991306,0.0047437004,0.0007327618,0.9841098,0.00881937,0.000026971804],"about_ca_topic_score_codex":0.002214407,"about_ca_topic_score_gemma":0.0011355354,"teacher_disagreement_score":0.00763897,"about_ca_system_score_codex":0.0017035049,"about_ca_system_score_gemma":0.0007861842,"threshold_uncertainty_score":0.025554895},"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.043765992,0.010009359,0.31138316,0.010493546,0.0017197618,0.00021961008,0.0008429931,0.00067478564,0.6208908],"genre_scores_gemma":[0.6446781,0.009957639,0.21529515,0.00093343604,0.0012333394,0.00048591083,0.00050317176,0.0006859333,0.1262273],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99691147,0.0007555748,0.00014907718,0.00051908154,0.0014027237,0.0002622544],"domain_scores_gemma":[0.99735236,0.0007914246,0.00031551387,0.00056652736,0.0008104477,0.0001636652],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017796922,0.00049902557,0.00041979132,0.0020024413,0.0023351102,0.006427347,0.00077891164,0.0012266716,0.02587344],"category_scores_gemma":[0.005837738,0.00057367404,0.00072461204,0.0018760873,0.0054463707,0.004649921,0.0025986887,0.0026226828,0.007455324],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000041827243,0.000026170677,0.0005238605,0.00015597038,0.000018294626,0.00011048233,0.000962095,0.00067373295,0.0034057403,0.9395797,0.0048984247,0.049603686],"study_design_scores_gemma":[0.00003319918,0.00005198996,0.0018156994,0.000150099,0.000040805164,0.0004819167,0.000969724,0.0024546634,0.0062409015,0.70026565,0.28742772,0.00006771224],"about_ca_topic_score_codex":0.0024876867,"about_ca_topic_score_gemma":0.0031011484,"teacher_disagreement_score":0.02587344,"about_ca_system_score_codex":0.0023700835,"about_ca_system_score_gemma":0.0032288393,"threshold_uncertainty_score":0.0865553},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.89836365,0.00022596316,0.042481497,0.00035044903,0.00009730638,0.000053947755,0.00014717017,0.00025829833,0.058021594],"genre_scores_gemma":[0.9856477,0.0001381176,0.004624437,0.000038738457,0.00004912539,0.000023322087,0.00012339078,0.00006660847,0.009288435],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99960333,0.00005040942,0.000020958136,0.00010739323,0.00010744537,0.00011046347],"domain_scores_gemma":[0.99960643,0.00007199282,0.00007050327,0.000052863106,0.00006558529,0.0001326207],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00033967837,0.0003763147,0.0004335046,0.0012973555,0.0015580404,0.0028555484,0.00038842086,0.0003570695,0.0055432576],"category_scores_gemma":[0.0008570889,0.0002947255,0.00061728037,0.00060634204,0.0035027978,0.002935934,0.0017389702,0.0015948754,0.0007310093],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000902128,0.000026382075,0.0017048314,0.000034373752,0.0000118558,0.0005581279,0.0011897755,0.001525052,0.004680643,0.9849379,0.00055169256,0.0046889707],"study_design_scores_gemma":[0.00008200569,0.00017586582,0.0072238925,0.00005533695,0.000046228786,0.0013574088,0.0019344809,0.013630797,0.014109699,0.9379763,0.023323266,0.000084748855],"about_ca_topic_score_codex":0.0010956316,"about_ca_topic_score_gemma":0.00083061954,"teacher_disagreement_score":0.0055432576,"about_ca_system_score_codex":0.0011054904,"about_ca_system_score_gemma":0.00037766527,"threshold_uncertainty_score":0.018544078},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.48843783,0.0019963696,0.11324668,0.0052820444,0.0009924464,0.0001008392,0.00028582482,0.00031838086,0.3893395],"genre_scores_gemma":[0.9792802,0.00038060138,0.0058330614,0.000256191,0.0005270452,0.000041759584,0.000081190585,0.000050226663,0.013549721],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.999348,0.00007886289,0.000025016334,0.00014803951,0.00018903564,0.0002110406],"domain_scores_gemma":[0.99857664,0.0005247145,0.00019574031,0.00020470278,0.00019467712,0.0003036486],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008859707,0.0004712289,0.00055617926,0.001508588,0.0020674535,0.003094544,0.0004955697,0.00081266003,0.008657713],"category_scores_gemma":[0.0031114004,0.00023741333,0.00078524643,0.00052511034,0.0067897327,0.0026995135,0.001991015,0.0026233904,0.0011878439],"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.0000376025,0.000014429634,0.00031379482,0.000020329764,0.0000024788342,0.0001257918,0.00027809243,0.00028441095,0.00086516317,0.99390596,0.0010660912,0.003085705],"study_design_scores_gemma":[0.000048666683,0.0000633113,0.0009555159,0.000028479979,0.000008367966,0.0003811077,0.00012484277,0.0043413555,0.0012298565,0.9820166,0.01077784,0.000024005476],"about_ca_topic_score_codex":0.0019044661,"about_ca_topic_score_gemma":0.0010532943,"teacher_disagreement_score":0.008657713,"about_ca_system_score_codex":0.0017785557,"about_ca_system_score_gemma":0.0007449126,"threshold_uncertainty_score":0.02896297},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.078560896,0.00036770466,0.9127215,0.00013929752,0.00003970786,0.00006183219,0.0000605132,0.0007188879,0.007329692],"genre_scores_gemma":[0.5648716,0.00070236064,0.42808157,0.000085209795,0.00012272129,0.000144156,0.0002218816,0.00038793942,0.005382591],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992501,0.00020179802,0.000046211564,0.00014005414,0.0002532633,0.00010852281],"domain_scores_gemma":[0.99778134,0.0011952997,0.00012203637,0.0004844682,0.00031625852,0.00010061603],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013432794,0.0005891554,0.0006297679,0.0017192216,0.0007727469,0.001222603,0.0008858032,0.00050809886,0.0047733462],"category_scores_gemma":[0.0051248255,0.00042707703,0.00067223684,0.0020299861,0.002362154,0.0029600142,0.0028604933,0.0010921214,0.0010278426],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0004005378,0.00010044712,0.003511413,0.00030023107,0.00007512752,0.00055549934,0.000917887,0.06497218,0.022922011,0.65633726,0.0019643619,0.24794297],"study_design_scores_gemma":[0.0000587356,0.00034708861,0.0019560608,0.000082696126,0.000060674836,0.0006630107,0.00015636394,0.32541478,0.026082458,0.62938917,0.015676187,0.000112787566],"about_ca_topic_score_codex":0.0010584132,"about_ca_topic_score_gemma":0.00081987894,"teacher_disagreement_score":0.0047733462,"about_ca_system_score_codex":0.0006426944,"about_ca_system_score_gemma":0.00059020927,"threshold_uncertainty_score":0.015968442},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01918857,0.00018656901,0.9581723,0.00021193989,0.00008321521,0.00023415018,0.0005888202,0.010697377,0.010637066],"genre_scores_gemma":[0.13297969,0.00008412903,0.85508996,0.00013431658,0.00003445264,0.00019437891,0.0027316958,0.0012397742,0.0075116763],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99934167,0.00006834083,0.000048910584,0.00016823929,0.00020642263,0.0001663565],"domain_scores_gemma":[0.9994468,0.00012171856,0.000029014602,0.00020232976,0.0001621716,0.000037915834],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00052617805,0.0011170971,0.0007129408,0.0015565525,0.00078651647,0.001166873,0.0013119902,0.00060335075,0.022474699],"category_scores_gemma":[0.0013019225,0.0004530615,0.0011778319,0.0010480094,0.00071148324,0.001756269,0.0026399172,0.0015259179,0.0073025804],"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.00051116204,0.00022602154,0.0013457042,0.00037748207,0.00007291394,0.0001941283,0.00036250064,0.020788709,0.035140928,0.064433865,0.03234399,0.8442025],"study_design_scores_gemma":[0.0004823936,0.00044206387,0.0013200988,0.0001239581,0.00014164105,0.00075954123,0.00046367786,0.4418216,0.14012754,0.2988002,0.115373276,0.00014404277],"about_ca_topic_score_codex":0.0021262001,"about_ca_topic_score_gemma":0.0033304242,"teacher_disagreement_score":0.022474699,"about_ca_system_score_codex":0.0011209522,"about_ca_system_score_gemma":0.0014174425,"threshold_uncertainty_score":0.07518536},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.21265405,0.00037075707,0.7613042,0.0010371691,0.00013910433,0.000088031295,0.0011163254,0.0021665995,0.021123804],"genre_scores_gemma":[0.7510609,0.00025236863,0.23867157,0.0001461828,0.00008201371,0.00005709803,0.0016446539,0.00071631634,0.0073689083],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99919206,0.0001264179,0.000038238246,0.00012867668,0.00036985354,0.00014477776],"domain_scores_gemma":[0.99745053,0.0013981399,0.00011737357,0.00041488992,0.00040323415,0.00021586903],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00088824745,0.00058829697,0.0013284354,0.0016972213,0.0008026773,0.0038671622,0.0013574214,0.00085955433,0.010011764],"category_scores_gemma":[0.0069481074,0.0005816272,0.00091792195,0.0013266406,0.0012892842,0.0038951277,0.0025511878,0.0024237116,0.0017808947],"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.0007722274,0.0002307711,0.006256007,0.00044233678,0.00016640328,0.0003472004,0.00050568406,0.33953962,0.011246269,0.33163252,0.023165751,0.28569525],"study_design_scores_gemma":[0.000024403793,0.000052438783,0.0007194744,0.000028067148,0.000023390938,0.000063514686,0.00010569957,0.79281694,0.0047639287,0.19904259,0.0023447033,0.000014839259],"about_ca_topic_score_codex":0.0031685294,"about_ca_topic_score_gemma":0.004824497,"teacher_disagreement_score":0.010011764,"about_ca_system_score_codex":0.0013774572,"about_ca_system_score_gemma":0.0011904808,"threshold_uncertainty_score":0.033492684},"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":"software","genre_gemma":"software","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"software","genre_consensus":"software","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.003004851,0.00071315747,0.09581844,0.00077281694,0.0008727536,0.00016983782,0.047160316,0.7993124,0.052175365],"genre_scores_gemma":[0.039794195,0.0010839554,0.15046927,0.0016575259,0.00056261604,0.0009985503,0.13992251,0.6077393,0.05777196],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9969965,0.00048758992,0.00026455073,0.0005778551,0.001225199,0.00044819294],"domain_scores_gemma":[0.99601364,0.001035117,0.0002516685,0.0013638912,0.0011058629,0.0002297757],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0030989852,0.003779621,0.002078557,0.002744034,0.0008362748,0.0048501506,0.0061139925,0.0023720847,0.23082155],"category_scores_gemma":[0.011301935,0.0024570941,0.002510397,0.0022724126,0.00091419194,0.004544919,0.0032980242,0.0061373385,0.23112148],"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.00035301244,0.00012596797,0.0012540821,0.0007562823,0.00011689575,0.00012798219,0.00010189666,0.0022266882,0.0024203297,0.02432013,0.91857433,0.049622335],"study_design_scores_gemma":[0.00071443734,0.00016957913,0.0017538766,0.0005025844,0.00012384969,0.0004962026,0.000089591114,0.022288058,0.04070698,0.05582809,0.87713623,0.00019055314],"about_ca_topic_score_codex":0.0020408528,"about_ca_topic_score_gemma":0.0025109488,"teacher_disagreement_score":0.23082155,"about_ca_system_score_codex":0.0014382859,"about_ca_system_score_gemma":0.0025912873,"threshold_uncertainty_score":0.772175},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011436001,0.011817804,0.7854148,0.013541118,0.0015558786,0.00019240596,0.0013635724,0.001390603,0.17328778],"genre_scores_gemma":[0.5267086,0.009367802,0.3898097,0.0061288956,0.004161322,0.0011410331,0.0030931425,0.0005617709,0.0590277],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99820256,0.0006756272,0.00013375704,0.00017904064,0.00061677926,0.00019227188],"domain_scores_gemma":[0.99828655,0.0007588759,0.00013768826,0.00031733525,0.0003847997,0.00011475585],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0034020531,0.0012265152,0.0007670248,0.0032643573,0.0020633454,0.005162799,0.0018175495,0.0014126699,0.010985104],"category_scores_gemma":[0.003104842,0.00056926266,0.0016910818,0.0028709387,0.0070936102,0.010134151,0.00258447,0.0062392545,0.0028246283],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000012127566,0.000003686829,0.000014721053,0.000013127684,0.0000015163217,0.000007772749,0.00006652441,0.00010371032,0.000054960237,0.99774456,0.0008048288,0.0011834216],"study_design_scores_gemma":[0.0000073772244,0.0000038759745,0.00002606489,0.000015939728,0.0000022548195,0.000022989072,0.000041254985,0.00093246147,0.00008550058,0.98147684,0.01738151,0.0000040161553],"about_ca_topic_score_codex":0.0018785417,"about_ca_topic_score_gemma":0.0018031698,"teacher_disagreement_score":0.010985104,"about_ca_system_score_codex":0.0038729857,"about_ca_system_score_gemma":0.0014693465,"threshold_uncertainty_score":0.036748827},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.52896607,0.0022791522,0.397141,0.001656417,0.00034397715,0.0000688438,0.0005561613,0.000563127,0.06842524],"genre_scores_gemma":[0.95562065,0.0007219317,0.025930915,0.00008283696,0.0003240712,0.000020745849,0.00022620366,0.00014745908,0.016925141],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988783,0.00038503754,0.000053918946,0.00015687397,0.00033192773,0.00019385394],"domain_scores_gemma":[0.997965,0.0010724713,0.0001948836,0.00030984796,0.0002913891,0.00016655817],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002261978,0.00048976816,0.0011194828,0.0014897585,0.001197624,0.0028614372,0.0007466719,0.00041030778,0.007973144],"category_scores_gemma":[0.0055046645,0.00034051356,0.0006734944,0.0025152254,0.0021597503,0.0059666745,0.0018390381,0.0014627945,0.0007301282],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00022692698,0.000047163332,0.0013413447,0.00008575359,0.000018511253,0.000076509416,0.00019967783,0.0057351124,0.0012309557,0.9618459,0.0013274858,0.027864782],"study_design_scores_gemma":[0.000026605778,0.00003125249,0.0006108819,0.000021523712,0.000023675317,0.00010430769,0.00007043879,0.03294337,0.0027915158,0.9589173,0.0044399924,0.000019187708],"about_ca_topic_score_codex":0.0011790601,"about_ca_topic_score_gemma":0.0014138214,"teacher_disagreement_score":0.007973144,"about_ca_system_score_codex":0.0015333842,"about_ca_system_score_gemma":0.0009870651,"threshold_uncertainty_score":0.02667278},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2870594,0.00029743157,0.6879304,0.00042264556,0.00013394674,0.0001307376,0.0017396471,0.0019514142,0.02033443],"genre_scores_gemma":[0.7145297,0.00022654707,0.2776482,0.0001015344,0.000069457965,0.00011666739,0.0023164682,0.0003273806,0.0046640546],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988778,0.0001331798,0.000109504756,0.000257834,0.00042940507,0.00019222149],"domain_scores_gemma":[0.9970688,0.0014276296,0.00029662997,0.0005776716,0.0004816805,0.00014748708],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00047163203,0.000508901,0.0008001408,0.0014821627,0.00093023846,0.0025001466,0.00093864265,0.0007676336,0.008064413],"category_scores_gemma":[0.005903103,0.00047949553,0.0009111844,0.001393144,0.0018202204,0.0049576256,0.001707404,0.001441614,0.0015801896],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0011328467,0.00022747129,0.0155012105,0.00072290085,0.00011506013,0.0007379575,0.0011628622,0.1415055,0.025006987,0.51417714,0.009871679,0.2898383],"study_design_scores_gemma":[0.00006678342,0.00026951203,0.0024133392,0.0001308449,0.00003846191,0.00032951203,0.00063975086,0.30436447,0.021765435,0.65557086,0.014341933,0.00006905847],"about_ca_topic_score_codex":0.0016480938,"about_ca_topic_score_gemma":0.0012355996,"teacher_disagreement_score":0.008064413,"about_ca_system_score_codex":0.0005634935,"about_ca_system_score_gemma":0.00054955797,"threshold_uncertainty_score":0.026978195},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.060026735,0.005751019,0.83464324,0.0035831728,0.0009710205,0.00016889157,0.0008340515,0.0021148978,0.09190689],"genre_scores_gemma":[0.7921312,0.006026704,0.15904291,0.0016381475,0.0025518597,0.0005536707,0.0014184504,0.0014883304,0.035148762],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9949616,0.0013514039,0.00018566038,0.0009714957,0.0016790808,0.0008508396],"domain_scores_gemma":[0.9698288,0.020588074,0.0013273917,0.004977349,0.0020663382,0.0012120869],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003842341,0.0042092316,0.0029675614,0.004207365,0.0019499274,0.0056816544,0.004680032,0.0028703762,0.024406705],"category_scores_gemma":[0.033079185,0.001413857,0.001396725,0.0052996874,0.004292883,0.017105838,0.00938162,0.00803002,0.007645685],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0008625595,0.0002410726,0.00096517266,0.0004995217,0.00008482798,0.00019319089,0.000457509,0.054600928,0.0057310984,0.8321727,0.015549186,0.08864233],"study_design_scores_gemma":[0.000049168695,0.00012559845,0.00031606026,0.00013070751,0.00006002883,0.00010139874,0.000065993314,0.109585084,0.00390373,0.87793744,0.0076690083,0.000055843946],"about_ca_topic_score_codex":0.0010441089,"about_ca_topic_score_gemma":0.0022579227,"teacher_disagreement_score":0.024406705,"about_ca_system_score_codex":0.00238922,"about_ca_system_score_gemma":0.0017886227,"threshold_uncertainty_score":0.08164853},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.018078899,0.012420111,0.6520146,0.0035944462,0.0018609706,0.000052707204,0.00029089412,0.0006038225,0.3110835],"genre_scores_gemma":[0.43944335,0.015349601,0.14286551,0.0011846257,0.0028000243,0.00021285734,0.0005523532,0.0014399434,0.3961517],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99948186,0.00012581318,0.000022068429,0.000080612546,0.00024480658,0.000044908058],"domain_scores_gemma":[0.99943346,0.0002854837,0.000045509634,0.00012599943,0.00006129792,0.000048265225],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000912213,0.0011760314,0.0013427263,0.0006919905,0.0006130239,0.0022671463,0.0010429263,0.0010216332,0.015718441],"category_scores_gemma":[0.003203989,0.0004673523,0.00078170566,0.0013979085,0.0016316583,0.0031739348,0.001687512,0.003426203,0.0033300014],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000037894217,0.000034352932,0.000047862777,0.00009262263,0.000021997788,0.000029143806,0.000025098481,0.024624402,0.00045888143,0.90347624,0.014936828,0.056214575],"study_design_scores_gemma":[0.000007168518,0.000009625547,0.00004545626,0.000016339038,0.0000051711995,0.000018229028,0.0000036777235,0.0327407,0.0001680685,0.9571655,0.009814256,0.000005828503],"about_ca_topic_score_codex":0.00047422934,"about_ca_topic_score_gemma":0.00046897115,"teacher_disagreement_score":0.015718441,"about_ca_system_score_codex":0.0011744457,"about_ca_system_score_gemma":0.0008366526,"threshold_uncertainty_score":0.052583396},"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":"other","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.082674816,0.0020296674,0.34635502,0.0035427203,0.004053476,0.00026028496,0.0008628529,0.001125221,0.559096],"genre_scores_gemma":[0.5023249,0.0029059385,0.10187132,0.0016106103,0.00418719,0.00028137385,0.0011901673,0.0024267293,0.3832018],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99951494,0.00009408575,0.00002456633,0.000107980275,0.00019047233,0.00006791377],"domain_scores_gemma":[0.99973744,0.000029157341,0.000023381886,0.000056626355,0.000097797165,0.000055618344],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00053003494,0.0009699816,0.00082849705,0.0015149638,0.0016735068,0.0025117227,0.000833245,0.0010172277,0.01687554],"category_scores_gemma":[0.0010166798,0.00046034757,0.0007955734,0.0010447253,0.0023908017,0.004710243,0.0022899343,0.004017806,0.008509818],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000020870333,0.000014095391,0.00004772194,0.000045144756,0.000005713233,0.000056149704,0.0001906289,0.0003399585,0.001535877,0.9781586,0.0057667997,0.0138183925],"study_design_scores_gemma":[0.0000101301775,0.00003211097,0.000085408145,0.000018850043,0.0000074241084,0.00037698742,0.00009140518,0.0012389751,0.0017997657,0.9288447,0.067470156,0.00002406377],"about_ca_topic_score_codex":0.0003125127,"about_ca_topic_score_gemma":0.0003837455,"teacher_disagreement_score":0.01687554,"about_ca_system_score_codex":0.00076298503,"about_ca_system_score_gemma":0.0007678007,"threshold_uncertainty_score":0.0564543},"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":"software","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"software","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0011200943,0.0011535054,0.5303933,0.000827979,0.0009444831,0.00021586583,0.04053056,0.27287132,0.15194297],"genre_scores_gemma":[0.025595205,0.003126663,0.49580604,0.0021522876,0.0007955965,0.0012077691,0.14835364,0.1825531,0.14040963],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9970952,0.00034008524,0.0002493854,0.0005070412,0.0014908897,0.00031739817],"domain_scores_gemma":[0.9973551,0.0006137246,0.00012631986,0.0010143535,0.0007177293,0.00017284857],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0015516668,0.0030155228,0.0028803125,0.0040613757,0.0019878347,0.0063760835,0.0072722835,0.0025301545,0.33631298],"category_scores_gemma":[0.005202589,0.0025815943,0.00423835,0.006134265,0.0014045059,0.0077313418,0.0057858117,0.0055209803,0.26231974],"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.00021149483,0.00010455425,0.0003078259,0.001082476,0.00007963054,0.00015862542,0.00012717294,0.004411724,0.0032459516,0.076060414,0.75595295,0.15825717],"study_design_scores_gemma":[0.00013060312,0.00003195986,0.00021469618,0.00019543762,0.000025147068,0.00017371526,0.000033789544,0.014989339,0.007303625,0.05644928,0.92037874,0.00007366547],"about_ca_topic_score_codex":0.0046847365,"about_ca_topic_score_gemma":0.008554375,"teacher_disagreement_score":0.33631298,"about_ca_system_score_codex":0.0023897407,"about_ca_system_score_gemma":0.0023754046,"threshold_uncertainty_score":0.946669},"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":"software","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"software","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.004864326,0.0009150477,0.4402731,0.0014138288,0.0013714529,0.00025534088,0.026843494,0.35118917,0.17287429],"genre_scores_gemma":[0.0973927,0.0013006884,0.4733328,0.0038488281,0.0013089834,0.0009343243,0.09107316,0.14768252,0.183126],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99891496,0.0001334716,0.0000690985,0.00018605248,0.0005266791,0.00016974506],"domain_scores_gemma":[0.99838924,0.00021673384,0.00014445739,0.00041167668,0.0006599512,0.000177902],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008761725,0.0015754543,0.0008786698,0.00207899,0.0012586381,0.0029642393,0.0025304733,0.0010598893,0.19372736],"category_scores_gemma":[0.0031252673,0.00079345645,0.000883835,0.002260356,0.00073676935,0.002801461,0.0025918852,0.0020192272,0.13307174],"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.00025775947,0.000054672346,0.0005614625,0.00033491067,0.000028330875,0.00015625985,0.00008513634,0.0017337346,0.0059016333,0.0390002,0.82883096,0.123054914],"study_design_scores_gemma":[0.00007570072,0.00004458053,0.0006435893,0.0000803229,0.000010272019,0.00030254797,0.000021813077,0.01840225,0.01972763,0.013242691,0.9473834,0.00006511797],"about_ca_topic_score_codex":0.004903679,"about_ca_topic_score_gemma":0.0058250353,"teacher_disagreement_score":0.19372736,"about_ca_system_score_codex":0.0012642533,"about_ca_system_score_gemma":0.00161398,"threshold_uncertainty_score":0.6480826},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09503891,0.00026223456,0.88896906,0.00026171393,0.00017841926,0.000107063555,0.00025523643,0.0036560146,0.011271413],"genre_scores_gemma":[0.45193422,0.0003381482,0.5346875,0.00021470693,0.00019174974,0.00010295602,0.00093484926,0.001123426,0.010472383],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99804085,0.00029381362,0.00017245254,0.00040495096,0.0006893478,0.00039862088],"domain_scores_gemma":[0.99720865,0.0009969865,0.0002039414,0.0009788448,0.00046123602,0.0001502839],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019180822,0.0009193491,0.0009803744,0.0017614427,0.0014208468,0.0025089204,0.0011261721,0.00078560447,0.014169754],"category_scores_gemma":[0.008452457,0.0005384286,0.0011694707,0.0018247771,0.0017558192,0.005150013,0.0043861894,0.0018009312,0.0035096968],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00062865706,0.0002152314,0.004799795,0.0004793226,0.00008269686,0.0006860399,0.0010235113,0.018156579,0.030940708,0.48480582,0.013611192,0.44457042],"study_design_scores_gemma":[0.00018624657,0.00028508567,0.0010445189,0.00011778775,0.00006837405,0.0007171189,0.00042964664,0.0953667,0.08520462,0.7763114,0.040160768,0.00010771057],"about_ca_topic_score_codex":0.0007251294,"about_ca_topic_score_gemma":0.0009448603,"teacher_disagreement_score":0.014169754,"about_ca_system_score_codex":0.00079839205,"about_ca_system_score_gemma":0.0011117163,"threshold_uncertainty_score":0.04740256},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1634522,0.00025192293,0.7909973,0.0008699281,0.00037832,0.000101927006,0.0001391711,0.0010727651,0.042736493],"genre_scores_gemma":[0.7753753,0.00021296287,0.20804845,0.00018092411,0.00015997239,0.00008763582,0.00017262172,0.00049466005,0.015267431],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.999686,0.00009326097,0.000015260428,0.000052381758,0.000103408245,0.000049622726],"domain_scores_gemma":[0.9991036,0.0006207992,0.000032456897,0.000098382945,0.00009767395,0.00004703677],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004581303,0.00055798376,0.00087423733,0.0007311054,0.0010657558,0.0013377635,0.0009839691,0.0010090335,0.013686349],"category_scores_gemma":[0.0031651515,0.000421218,0.00064610934,0.00072375004,0.0013684552,0.00209346,0.0019234658,0.0019154823,0.0011896074],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001343437,0.00027238933,0.0012695636,0.00041406692,0.00008950731,0.0003961823,0.00057403295,0.14439492,0.007628297,0.693277,0.010136271,0.1414134],"study_design_scores_gemma":[0.00006905361,0.00004880601,0.00015941595,0.000017639857,0.000019482462,0.00008876575,0.0002050207,0.47525647,0.003470764,0.5152368,0.0054076635,0.00002008423],"about_ca_topic_score_codex":0.0017560506,"about_ca_topic_score_gemma":0.004190157,"teacher_disagreement_score":0.013686349,"about_ca_system_score_codex":0.00046563076,"about_ca_system_score_gemma":0.0007357173,"threshold_uncertainty_score":0.045785427},"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2017748,0.040483348,0.3379451,0.013927559,0.0030857117,0.00010660994,0.0014453311,0.000954598,0.40027687],"genre_scores_gemma":[0.92926127,0.012033907,0.028986135,0.0005954759,0.0023569865,0.00007283093,0.00034916136,0.0001614696,0.026182665],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993963,0.00013813727,0.00003416338,0.00014923031,0.00017501517,0.00010706444],"domain_scores_gemma":[0.9975739,0.001532197,0.0002418365,0.00020667547,0.00022658953,0.00021874417],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00087207626,0.00060781516,0.00078901777,0.0041662185,0.0010184097,0.0026671968,0.00078248564,0.00088955817,0.00753417],"category_scores_gemma":[0.00814868,0.00035956572,0.0005707363,0.005276642,0.0038656744,0.006187434,0.0022357341,0.00361058,0.0020358427],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000040867715,0.000022142158,0.0003671884,0.00008661345,0.000008087931,0.00007850362,0.00015640145,0.0018541375,0.0004222602,0.969409,0.0043997983,0.023155097],"study_design_scores_gemma":[0.000008992157,0.00001403712,0.00028543393,0.00002889105,0.000008791464,0.00023305883,0.00006769282,0.006318389,0.00034299583,0.9810924,0.011583862,0.000015452382],"about_ca_topic_score_codex":0.001851819,"about_ca_topic_score_gemma":0.0014947462,"teacher_disagreement_score":0.00753417,"about_ca_system_score_codex":0.0024026872,"about_ca_system_score_gemma":0.00095565536,"threshold_uncertainty_score":0.0252043},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8292153,0.0005343652,0.065162174,0.0009810406,0.00012547741,0.000056609126,0.0003070217,0.0001683319,0.10344975],"genre_scores_gemma":[0.9849304,0.00022778078,0.0059620654,0.00005944261,0.00013868816,0.000018029248,0.00013541654,0.000055249682,0.008472947],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.999554,0.000075569595,0.000018988712,0.00007975167,0.00015271695,0.00011899485],"domain_scores_gemma":[0.99945027,0.000077651304,0.000120374825,0.000071552924,0.00010142717,0.0001787736],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00037891304,0.00037460934,0.00030207698,0.0019075433,0.0012100005,0.002213915,0.00048675766,0.00041505895,0.006925679],"category_scores_gemma":[0.001434624,0.00026819657,0.000460562,0.0009261594,0.0029815459,0.0034403035,0.002210547,0.001772595,0.0005007486],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000014606447,0.000009939552,0.00041044396,0.000013915058,0.0000032893213,0.00014736324,0.00034026802,0.0009655004,0.0013407317,0.99407154,0.00030486422,0.0023774095],"study_design_scores_gemma":[0.000030663112,0.00007174812,0.002343331,0.00002970661,0.000014119961,0.00088221533,0.0010114919,0.016636882,0.0028414414,0.9556092,0.020493977,0.00003516572],"about_ca_topic_score_codex":0.0010013493,"about_ca_topic_score_gemma":0.00071001647,"teacher_disagreement_score":0.006925679,"about_ca_system_score_codex":0.00094673864,"about_ca_system_score_gemma":0.00026391784,"threshold_uncertainty_score":0.023168683},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.607995,0.0010022157,0.20366395,0.0023896853,0.0002851621,0.000047136673,0.00018422768,0.00025123658,0.18418153],"genre_scores_gemma":[0.9675163,0.00035492645,0.014152079,0.00013856133,0.00021526004,0.000020781932,0.000070199116,0.000025531614,0.017506469],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99956995,0.0000771316,0.000023400811,0.0000959114,0.00016940276,0.000064198466],"domain_scores_gemma":[0.99906963,0.00026838313,0.00013900262,0.00017095543,0.000210578,0.00014155143],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00073310605,0.00025250454,0.00031028435,0.0008325787,0.0008629823,0.0015572957,0.00046469894,0.00039004814,0.0025228662],"category_scores_gemma":[0.0021039054,0.00018409362,0.00036506326,0.00070258876,0.0036931108,0.004514014,0.0016258816,0.0013443519,0.00031440318],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000056991908,0.0000027623166,0.00007678207,0.000005671517,9.073225e-7,0.000022958608,0.00010043087,0.00017855366,0.00051163114,0.9973918,0.000095647556,0.0016070886],"study_design_scores_gemma":[0.0000060730567,0.000014696091,0.00015203348,0.000004946419,0.0000024577744,0.00008604527,0.000052067644,0.0016425669,0.00096784683,0.9920739,0.0049916245,0.0000057086518],"about_ca_topic_score_codex":0.000503612,"about_ca_topic_score_gemma":0.00046572223,"teacher_disagreement_score":0.0025228662,"about_ca_system_score_codex":0.00149631,"about_ca_system_score_gemma":0.00071088003,"threshold_uncertainty_score":0.010856569},"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.23379824,0.0038301132,0.35996822,0.0028243316,0.0019595167,0.0001506127,0.0005634916,0.0005010828,0.3964045],"genre_scores_gemma":[0.8593789,0.0014879131,0.098118864,0.0005168472,0.0010431821,0.000094285504,0.00030465994,0.0002520421,0.038803283],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99948835,0.00010928011,0.000025943187,0.00011605062,0.00016874947,0.000091641414],"domain_scores_gemma":[0.99975914,0.000047715275,0.000025869342,0.00006396151,0.00006324757,0.00004008033],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00056576263,0.00042242996,0.00051085505,0.0013388443,0.0014180872,0.0012117438,0.00036026686,0.0005346327,0.00665343],"category_scores_gemma":[0.0013584192,0.00014837286,0.0005763807,0.0007029474,0.0022984857,0.00214251,0.0015018778,0.0016466664,0.0011287992],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001324576,0.0000064055,0.000069249036,0.000019160858,0.0000035431183,0.000057865032,0.00024797,0.00046569793,0.0011554309,0.9853206,0.00097083667,0.011669844],"study_design_scores_gemma":[0.000007056451,0.000026903805,0.00014466414,0.0000102475515,0.000004185066,0.00011135696,0.00005955531,0.0013836208,0.0018243844,0.9793594,0.017054457,0.000014256462],"about_ca_topic_score_codex":0.0008277833,"about_ca_topic_score_gemma":0.00074849755,"teacher_disagreement_score":0.00665343,"about_ca_system_score_codex":0.0006075256,"about_ca_system_score_gemma":0.0005486782,"threshold_uncertainty_score":0.022257924},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010506244,0.0005113049,0.9789176,0.00015478763,0.00009722224,0.00016305312,0.0002671062,0.0054239454,0.003958769],"genre_scores_gemma":[0.11044471,0.00028148037,0.8828502,0.00010350958,0.000081834725,0.00026416345,0.0015823491,0.00048020168,0.0039115385],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985329,0.00015209551,0.00015232486,0.000371913,0.00051213516,0.00027860588],"domain_scores_gemma":[0.99927276,0.0001677938,0.00006444668,0.00018125922,0.0002473235,0.00006649192],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00074907055,0.0015292692,0.0013297589,0.002595328,0.0010823718,0.0018278342,0.0014234539,0.0007975576,0.011974506],"category_scores_gemma":[0.0025882404,0.00052437413,0.0012375949,0.0024149122,0.0008175845,0.0030241867,0.003394047,0.0016250367,0.006212039],"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.00042123056,0.00016723337,0.0017710197,0.00045307784,0.00007544674,0.00048856233,0.00033065586,0.01786996,0.025260773,0.055873476,0.016715962,0.8805726],"study_design_scores_gemma":[0.00053759996,0.00067308714,0.002086357,0.00023448159,0.00015900446,0.0032456773,0.00063781877,0.5232836,0.07249603,0.25684667,0.139532,0.00026768807],"about_ca_topic_score_codex":0.0013196806,"about_ca_topic_score_gemma":0.0016948025,"teacher_disagreement_score":0.011974506,"about_ca_system_score_codex":0.00091986515,"about_ca_system_score_gemma":0.0021028416,"threshold_uncertainty_score":0.040058732},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07292854,0.000035881538,0.92124933,0.00016999185,0.00003240347,0.000042423453,0.00004337941,0.0005789655,0.004919016],"genre_scores_gemma":[0.5433095,0.00007326836,0.44909713,0.00008508711,0.000039143106,0.000062067586,0.00016926887,0.0003160544,0.0068484955],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990746,0.00014286807,0.00004245001,0.00021878177,0.0004212583,0.0001000787],"domain_scores_gemma":[0.9984522,0.0005998364,0.00018640485,0.00035256057,0.00030023127,0.00010886678],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009703735,0.0005856847,0.0010393343,0.0006879334,0.00092424644,0.0012384027,0.0009938779,0.0008855623,0.008056994],"category_scores_gemma":[0.007003238,0.0003741771,0.0006082533,0.0007005715,0.0014699852,0.0039299177,0.0016293592,0.0012335406,0.0016719407],"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.0003683349,0.00017298729,0.0024139897,0.00027584037,0.000045603967,0.00046245081,0.0005229112,0.39936444,0.036950126,0.3751407,0.0029623809,0.18132022],"study_design_scores_gemma":[0.000022731878,0.000108033586,0.00019487018,0.00001162786,0.0000061767114,0.000121083875,0.00013148921,0.8238971,0.0152328145,0.15715168,0.0030972874,0.000025142203],"about_ca_topic_score_codex":0.001233912,"about_ca_topic_score_gemma":0.0025531398,"teacher_disagreement_score":0.008056994,"about_ca_system_score_codex":0.0007157036,"about_ca_system_score_gemma":0.0011701459,"threshold_uncertainty_score":0.02695334},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.021250691,0.00023394509,0.9633282,0.00015295482,0.00014311474,0.00017677434,0.00014541116,0.005753504,0.008815442],"genre_scores_gemma":[0.26999006,0.00033485776,0.7150166,0.00023577336,0.00018991702,0.00023243592,0.00054541265,0.000534404,0.012920528],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995691,0.00005588261,0.000025168863,0.00006735088,0.0001877009,0.0000948101],"domain_scores_gemma":[0.9996233,0.000053797306,0.00002922717,0.00013143105,0.00012387567,0.0000383299],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00035707903,0.00085368933,0.0006101252,0.00069687894,0.0005155123,0.0009947546,0.001413661,0.0005107918,0.014410352],"category_scores_gemma":[0.0009901164,0.00048445366,0.00046651997,0.00091255107,0.00039532126,0.0012167669,0.00147772,0.0008945462,0.004930727],"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.0006855965,0.00032952908,0.001132381,0.000425059,0.00008278236,0.0003559676,0.0001800189,0.018778093,0.12689029,0.07201007,0.026568837,0.7525613],"study_design_scores_gemma":[0.00047604542,0.0015662026,0.001732207,0.00013225173,0.00019866764,0.001591983,0.00026697907,0.5986417,0.22922567,0.07282432,0.093156494,0.00018744133],"about_ca_topic_score_codex":0.00066048745,"about_ca_topic_score_gemma":0.0017382501,"teacher_disagreement_score":0.014410352,"about_ca_system_score_codex":0.0003130292,"about_ca_system_score_gemma":0.00080596923,"threshold_uncertainty_score":0.048207402},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.004961681,0.008580656,0.49810043,0.0022555916,0.001700359,0.00012690117,0.0028605682,0.011048869,0.47036502],"genre_scores_gemma":[0.10383602,0.019233081,0.44302166,0.0019339254,0.0036188208,0.0003943394,0.009530891,0.0074374923,0.41099384],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9993327,0.00008595991,0.000036938403,0.00010414491,0.0003880121,0.00005223059],"domain_scores_gemma":[0.9996182,0.00010693645,0.000023655946,0.00012187954,0.000092938666,0.000036360438],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00043535265,0.0011318701,0.001037596,0.0022216442,0.0011291923,0.0026723668,0.001508672,0.0006057347,0.064523876],"category_scores_gemma":[0.0015804063,0.0008726789,0.0011996576,0.0044759144,0.0010909858,0.0044022,0.0022715514,0.0039742,0.05150778],"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.0000923087,0.000057864883,0.000100552126,0.00053692615,0.000027854998,0.000057550966,0.000119221426,0.002515139,0.0033472625,0.38661823,0.15994854,0.44657847],"study_design_scores_gemma":[0.0000245202,0.000027045631,0.00016385627,0.00013959369,0.000021770691,0.0003089107,0.000028960769,0.0044841287,0.004769776,0.43349472,0.5565028,0.0000338341],"about_ca_topic_score_codex":0.000662228,"about_ca_topic_score_gemma":0.0012679211,"teacher_disagreement_score":0.064523876,"about_ca_system_score_codex":0.0009994388,"about_ca_system_score_gemma":0.0011895717,"threshold_uncertainty_score":0.21585387},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.28800827,0.0028474252,0.54770505,0.0010411615,0.00033715283,0.00005472001,0.00017742053,0.00053759187,0.15929125],"genre_scores_gemma":[0.9158646,0.00077210536,0.06871221,0.00011992275,0.00018577631,0.000050133374,0.00014742214,0.00016984683,0.013977916],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995216,0.00010790472,0.000018024744,0.000056910834,0.00018487129,0.00011066616],"domain_scores_gemma":[0.99967563,0.000116587355,0.000033982153,0.00004656039,0.000079474135,0.000047781596],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00059705245,0.0004321527,0.0005920251,0.0022360256,0.0014686008,0.0018819215,0.00080463896,0.000634298,0.005475368],"category_scores_gemma":[0.0016201137,0.00021842484,0.00054147124,0.0012863501,0.002223204,0.0034260694,0.0011726331,0.0017322429,0.00058319874],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000003271796,0.0000051784837,0.000054853892,0.000008008073,0.0000019067227,0.000020319048,0.000047804187,0.0010587375,0.00029511264,0.9953393,0.00019948125,0.002966102],"study_design_scores_gemma":[0.0000017158743,0.0000043953705,0.00007516309,0.000007145653,0.0000013379922,0.000030216846,0.000026646014,0.010309705,0.00033580392,0.98753124,0.0016722273,0.0000043549103],"about_ca_topic_score_codex":0.0011021082,"about_ca_topic_score_gemma":0.00070609397,"teacher_disagreement_score":0.005475368,"about_ca_system_score_codex":0.0011997832,"about_ca_system_score_gemma":0.00054054457,"threshold_uncertainty_score":0.018316925},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.423781,0.0017583775,0.4808564,0.0080288565,0.00043226374,0.00020233187,0.0010522353,0.0015482204,0.08234034],"genre_scores_gemma":[0.78710306,0.00066819036,0.20191596,0.0007334315,0.0001884348,0.00018046508,0.0008248362,0.0001799121,0.008205674],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9982816,0.00066205533,0.00009613846,0.00025933606,0.000534615,0.00016625896],"domain_scores_gemma":[0.9920195,0.006005476,0.00034261894,0.0008280588,0.0005486707,0.0002557177],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013725929,0.0007905855,0.0006590315,0.0017987348,0.0016727033,0.0022530463,0.001388469,0.0015353697,0.0054550227],"category_scores_gemma":[0.009524694,0.00042924122,0.00083478435,0.0021394906,0.0028781975,0.0032568038,0.0020333768,0.0026442094,0.0005049966],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00034417634,0.0002406132,0.0045196493,0.00036374322,0.00007688655,0.000984884,0.0006152637,0.041961446,0.0045106006,0.894045,0.010816463,0.04152121],"study_design_scores_gemma":[0.0001104922,0.000111635054,0.00087665784,0.00010464085,0.00006552205,0.0009901684,0.00051570986,0.25231075,0.010130322,0.71834373,0.01638104,0.000059199207],"about_ca_topic_score_codex":0.0013539154,"about_ca_topic_score_gemma":0.003100229,"teacher_disagreement_score":0.0054550227,"about_ca_system_score_codex":0.00094966125,"about_ca_system_score_gemma":0.00079014973,"threshold_uncertainty_score":0.018248856},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.020655021,0.00032100375,0.97616005,0.00014781422,0.000057217276,0.00005784543,0.000032226028,0.00011211576,0.0024566918],"genre_scores_gemma":[0.6275236,0.00036567342,0.36679476,0.00009948887,0.00012746111,0.00023063975,0.00011866063,0.00013432246,0.004605314],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9974711,0.001337595,0.000105841435,0.0003586896,0.0005295541,0.00019731624],"domain_scores_gemma":[0.99590576,0.0026406834,0.0002542673,0.00061314576,0.00040465675,0.00018149999],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005187166,0.00067397853,0.0012670459,0.0019542156,0.00082169037,0.0013573724,0.0018291457,0.0010936164,0.0050466857],"category_scores_gemma":[0.014561551,0.00030746037,0.0010819023,0.0012553578,0.0018599348,0.0020882266,0.0025759633,0.0017598111,0.00045182678],"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.00014370489,0.00008186949,0.0031836005,0.00016637072,0.00008982828,0.00012051126,0.0002925858,0.5141932,0.0021929962,0.19871871,0.0022498958,0.27856678],"study_design_scores_gemma":[0.000015277168,0.00005044257,0.00044926678,0.000022840586,0.000009618699,0.00005631297,0.00003594734,0.9483355,0.00080745225,0.047411066,0.0027910352,0.000015269243],"about_ca_topic_score_codex":0.001953322,"about_ca_topic_score_gemma":0.001116253,"teacher_disagreement_score":0.005187166,"about_ca_system_score_codex":0.0010323963,"about_ca_system_score_gemma":0.0011727371,"threshold_uncertainty_score":0.02743268},"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":"methods","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.006663863,0.045551263,0.51648885,0.032458626,0.06367355,0.0007476152,0.0033847343,0.0064395196,0.32459202],"genre_scores_gemma":[0.08893853,0.050220802,0.35160896,0.008024257,0.027859826,0.0015234924,0.021343322,0.0059118792,0.44456896],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9940805,0.0016827934,0.0005285261,0.00091021415,0.0024019838,0.00039600898],"domain_scores_gemma":[0.9949654,0.0013716535,0.00011268262,0.0010743759,0.0020506242,0.0004252969],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005673961,0.0020935812,0.00212566,0.0021556017,0.0018821105,0.009789897,0.0034282028,0.0028368093,0.0854157],"category_scores_gemma":[0.011017825,0.0008760668,0.0025218127,0.0019528638,0.0021762373,0.005827607,0.0047206874,0.0069637992,0.033357546],"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.0003030455,0.0001712782,0.0004699734,0.00062219094,0.00015205088,0.00031212668,0.0005444175,0.006031862,0.0026099053,0.16983789,0.58238924,0.23655598],"study_design_scores_gemma":[0.000045396726,0.000049075737,0.000264976,0.00036770754,0.000042950396,0.00021472291,0.0001218832,0.013475939,0.0018331698,0.05935058,0.9241965,0.00003714804],"about_ca_topic_score_codex":0.0028003356,"about_ca_topic_score_gemma":0.0024869568,"teacher_disagreement_score":0.0854157,"about_ca_system_score_codex":0.003248093,"about_ca_system_score_gemma":0.004810113,"threshold_uncertainty_score":0.28574395},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9081033,0.0010426561,0.070690505,0.0005868292,0.000066453074,0.000021782505,0.00016173841,0.00019528216,0.019131353],"genre_scores_gemma":[0.9915558,0.0003097567,0.0053698313,0.000025164398,0.00012559422,0.00002153154,0.00013501743,0.000039139086,0.0024180284],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99931836,0.00011072483,0.00003816016,0.00019408607,0.00022018289,0.00011855014],"domain_scores_gemma":[0.99757296,0.0010415885,0.00062563585,0.00024002935,0.00012652652,0.0003932922],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00065485603,0.00081208715,0.00055074965,0.0021783134,0.00081667426,0.0020432305,0.00075078604,0.00032146383,0.003645041],"category_scores_gemma":[0.0034166798,0.00028965226,0.0004214602,0.0014155209,0.0039711567,0.004032457,0.0029755458,0.0018652467,0.00045189678],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00033526256,0.00007905141,0.007841809,0.00020832654,0.000045550438,0.0003676884,0.0006328079,0.01276892,0.011689377,0.923684,0.0016358343,0.040711384],"study_design_scores_gemma":[0.000035693185,0.00020269661,0.0052461983,0.000036242927,0.00003847047,0.00053571037,0.0002482617,0.039694786,0.010013615,0.9390989,0.004791082,0.000058345566],"about_ca_topic_score_codex":0.00027506478,"about_ca_topic_score_gemma":0.00020035647,"teacher_disagreement_score":0.003645041,"about_ca_system_score_codex":0.00071195123,"about_ca_system_score_gemma":0.00025595273,"threshold_uncertainty_score":0.012193859},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.30491596,0.00019067324,0.66130495,0.00019138263,0.00007357343,0.0001007833,0.00047065466,0.00087873614,0.031873338],"genre_scores_gemma":[0.7376221,0.00016192537,0.25396582,0.00005389105,0.000033429882,0.00006169183,0.001289272,0.00016504663,0.0066468148],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99976915,0.000025489306,0.000015432617,0.000041988784,0.000083367726,0.00006457973],"domain_scores_gemma":[0.999652,0.00010715742,0.000022107703,0.000083039464,0.00009074752,0.00004482528],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003708415,0.00026305616,0.00037009275,0.0006951106,0.00044369404,0.0012500415,0.00053488044,0.00024838967,0.006448222],"category_scores_gemma":[0.0015652104,0.00014688101,0.00039249408,0.00056938344,0.00050301827,0.0013844564,0.0013068091,0.0007305103,0.0012311548],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00047558622,0.00014062767,0.0033716233,0.00023048303,0.000036126297,0.00036311732,0.0006370313,0.04568475,0.03307119,0.6205125,0.0066510024,0.288826],"study_design_scores_gemma":[0.000057028414,0.000112990594,0.0007662374,0.00005906898,0.000022172955,0.00031989114,0.00038485558,0.3841928,0.060242344,0.53626513,0.017547522,0.000029990537],"about_ca_topic_score_codex":0.00048684,"about_ca_topic_score_gemma":0.00091798056,"teacher_disagreement_score":0.006448222,"about_ca_system_score_codex":0.0006058337,"about_ca_system_score_gemma":0.0004133563,"threshold_uncertainty_score":0.021571398},"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":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.006963986,0.043122195,0.39011076,0.021909978,0.07347766,0.0005562307,0.0055320947,0.0076375674,0.4506896],"genre_scores_gemma":[0.109793924,0.045132432,0.2874309,0.007005129,0.020050973,0.0013091778,0.02555439,0.00556538,0.49815777],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9963464,0.0009025397,0.00034083487,0.0005913436,0.0015926465,0.00022622506],"domain_scores_gemma":[0.9961808,0.00088222756,0.000104543986,0.0009826466,0.001550129,0.00029975944],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0030148549,0.0014178292,0.0017408752,0.0015707876,0.0013686977,0.006965161,0.0021133388,0.0018673296,0.0995906],"category_scores_gemma":[0.010564711,0.00054231007,0.0016231649,0.0018185439,0.0016736862,0.0036297713,0.0033788036,0.0043658507,0.039683755],"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.0002454522,0.000070381866,0.00076754636,0.0005410353,0.00014023934,0.00020769029,0.00022246518,0.006131572,0.0022118692,0.15482773,0.61341935,0.22121473],"study_design_scores_gemma":[0.00003085555,0.000038817743,0.0003286021,0.00025270958,0.00003036148,0.00014891718,0.000048480877,0.0150802545,0.0009462405,0.04916887,0.93390197,0.000024001742],"about_ca_topic_score_codex":0.0035776328,"about_ca_topic_score_gemma":0.0026268337,"teacher_disagreement_score":0.0995906,"about_ca_system_score_codex":0.0023553104,"about_ca_system_score_gemma":0.0038986225,"threshold_uncertainty_score":0.33316374},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.32012376,0.0007777566,0.57717663,0.0003382947,0.00017810361,0.00008420139,0.0001307262,0.00031433275,0.10087615],"genre_scores_gemma":[0.8724155,0.00042702086,0.109688014,0.000109462555,0.00014432201,0.0001355785,0.00017255991,0.00028496972,0.016622683],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99942976,0.00009008485,0.000031220916,0.00008330724,0.00024338713,0.0001222079],"domain_scores_gemma":[0.999503,0.00012475223,0.00006989236,0.000105017556,0.00011516896,0.0000819908],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010098822,0.00067209813,0.0006581302,0.0022841026,0.0012079811,0.0024540059,0.0011605207,0.0006830671,0.0056778896],"category_scores_gemma":[0.0019472879,0.00036959827,0.00075480656,0.00095542375,0.0024192412,0.0036897017,0.0011948352,0.0021155535,0.0006170321],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000061567316,0.000008182132,0.00006882773,0.000009852721,0.0000022206975,0.000035362773,0.00008927329,0.0013522619,0.0009503473,0.9947747,0.0001524119,0.0025503933],"study_design_scores_gemma":[0.00000318523,0.000010855566,0.00014679563,0.000014496127,0.000003461695,0.000064959706,0.000045820165,0.027606321,0.0012660285,0.9691402,0.0016898009,0.000008047561],"about_ca_topic_score_codex":0.00054020435,"about_ca_topic_score_gemma":0.00059890846,"teacher_disagreement_score":0.0056778896,"about_ca_system_score_codex":0.0013169653,"about_ca_system_score_gemma":0.00067746855,"threshold_uncertainty_score":0.018994391},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12628971,0.001006526,0.6011851,0.003148715,0.0018844183,0.00019144303,0.00058892736,0.0009379385,0.26476726],"genre_scores_gemma":[0.7282618,0.00069619174,0.17121205,0.0015827172,0.001017633,0.00033605087,0.00065760117,0.0009699513,0.09526591],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9982436,0.0003808705,0.00014182541,0.00028258664,0.0006080179,0.0003432036],"domain_scores_gemma":[0.9984383,0.00059866626,0.00012300785,0.0002677522,0.00032988185,0.00024235279],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0024429543,0.0010443472,0.0011911297,0.0029761274,0.0031729497,0.0053899335,0.002073878,0.002366502,0.016258955],"category_scores_gemma":[0.006360327,0.0008408773,0.0015698605,0.0025840497,0.0040403316,0.00863921,0.003601847,0.0036302574,0.0038185294],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010797838,0.000010527538,0.000055528126,0.000012169663,0.0000022468287,0.00006280686,0.00010377898,0.000104639716,0.00032291605,0.99507624,0.000977653,0.0032607412],"study_design_scores_gemma":[0.000009272642,0.000005338294,0.0000632652,0.000013307272,0.0000061006062,0.000107732645,0.000038400984,0.0021048298,0.00042678244,0.9931852,0.0040248996,0.000014865934],"about_ca_topic_score_codex":0.0008361652,"about_ca_topic_score_gemma":0.0010750168,"teacher_disagreement_score":0.016258955,"about_ca_system_score_codex":0.0022974352,"about_ca_system_score_gemma":0.0009655999,"threshold_uncertainty_score":0.054391623},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07222534,0.0020335142,0.85678935,0.004006636,0.00051930745,0.0005145066,0.00836666,0.03200474,0.023539929],"genre_scores_gemma":[0.39990884,0.0008694343,0.5524241,0.0011947086,0.0005219099,0.0005983016,0.012027402,0.0073788497,0.02507651],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9883188,0.0018597109,0.0010624574,0.0016541282,0.0053878683,0.001716958],"domain_scores_gemma":[0.97521055,0.009160118,0.00087108504,0.011904487,0.002191203,0.0006626126],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0037744378,0.0017120872,0.0026425438,0.0029669534,0.0020747485,0.009705456,0.005775647,0.0022920258,0.03139307],"category_scores_gemma":[0.022687405,0.0015882675,0.0036044796,0.008033875,0.002950856,0.021536738,0.007536363,0.0058871494,0.0107946955],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.003072842,0.00069172843,0.0026271408,0.0015630865,0.00021886064,0.00016147149,0.0010110686,0.025485782,0.016494771,0.49336,0.08451653,0.37079668],"study_design_scores_gemma":[0.0005391675,0.00022333607,0.00070236577,0.00013523041,0.00023577047,0.00026358067,0.0004520016,0.13151328,0.02334719,0.8032551,0.039196722,0.00013624581],"about_ca_topic_score_codex":0.0055091954,"about_ca_topic_score_gemma":0.010852004,"teacher_disagreement_score":0.03139307,"about_ca_system_score_codex":0.006626005,"about_ca_system_score_gemma":0.006793461,"threshold_uncertainty_score":0.105020344},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7256603,0.004420443,0.11701673,0.0040812707,0.000789307,0.0000738797,0.00047570514,0.00035010578,0.14713223],"genre_scores_gemma":[0.967427,0.0013493338,0.008509752,0.00035163222,0.00055317563,0.000027239581,0.00013394473,0.000056107532,0.02159174],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99971384,0.000055839446,0.000012754069,0.000056045006,0.000082888815,0.000078530036],"domain_scores_gemma":[0.99980456,0.00004881527,0.000031023133,0.000024058498,0.00005259974,0.00003908575],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004164919,0.00044078042,0.0008621998,0.0020359852,0.0017672882,0.0011317482,0.0006416112,0.0005508922,0.005868576],"category_scores_gemma":[0.0008788585,0.00018677418,0.0006639308,0.002067533,0.0014094978,0.0031702872,0.0012617343,0.0013085166,0.0004629708],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000029748866,0.0000126086015,0.00032676928,0.00004205329,0.000008080301,0.000078543635,0.00016855488,0.00066350977,0.0008787599,0.99039006,0.000885778,0.00651559],"study_design_scores_gemma":[0.000020252712,0.000031510914,0.00082822185,0.000012834046,0.000025976864,0.00018612896,0.00009689499,0.006627762,0.0007980553,0.98564595,0.0057036644,0.00002274263],"about_ca_topic_score_codex":0.0013876039,"about_ca_topic_score_gemma":0.00089716923,"teacher_disagreement_score":0.005868576,"about_ca_system_score_codex":0.0011659147,"about_ca_system_score_gemma":0.00091126777,"threshold_uncertainty_score":0.01963234},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2572861,0.0006258863,0.7187048,0.0029491559,0.0003332845,0.00047124294,0.0018517695,0.0070608906,0.010716796],"genre_scores_gemma":[0.7413274,0.00016646524,0.24932417,0.0004938768,0.00029503278,0.00021778225,0.0031250762,0.000799786,0.0042504095],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.988958,0.0022538174,0.0010733623,0.0028791034,0.0030401999,0.0017953763],"domain_scores_gemma":[0.9293596,0.056327313,0.0029109535,0.0066542593,0.0032394445,0.0015083734],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0064500305,0.0011477394,0.0023438402,0.001916284,0.0019044643,0.006581178,0.0054864716,0.002409353,0.011617899],"category_scores_gemma":[0.038970035,0.0009674333,0.003293892,0.002533989,0.004658295,0.019678494,0.005609746,0.0042139827,0.0024863097],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0057197493,0.0013733301,0.018439112,0.0021437758,0.00046789242,0.0012684427,0.0020204906,0.056640636,0.037290942,0.60123837,0.015012585,0.2583846],"study_design_scores_gemma":[0.0003548098,0.0004473682,0.00097091927,0.000086197,0.00012858964,0.00032421018,0.0005391342,0.11615338,0.02984231,0.8467448,0.004280819,0.00012749177],"about_ca_topic_score_codex":0.0016267945,"about_ca_topic_score_gemma":0.0021542923,"teacher_disagreement_score":0.011617899,"about_ca_system_score_codex":0.0023401047,"about_ca_system_score_gemma":0.0033641658,"threshold_uncertainty_score":0.038865745},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.006069201,0.0003887607,0.9891551,0.0001253145,0.00004783651,0.000027605736,0.000028107585,0.00021424815,0.003943802],"genre_scores_gemma":[0.14234227,0.0011352538,0.8510249,0.00012665076,0.00015774574,0.00012491384,0.00011165598,0.0003104464,0.0046661184],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9983997,0.0004923019,0.00011303728,0.00026480306,0.00060307916,0.00012711668],"domain_scores_gemma":[0.99891627,0.00047666594,0.000094261755,0.00020253212,0.00024623828,0.0000639444],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020857211,0.0006531582,0.0006625796,0.00089168176,0.0009719882,0.0008657265,0.0007331434,0.00033993102,0.0042328998],"category_scores_gemma":[0.0035873316,0.00033701336,0.0012728731,0.0012030458,0.0015849778,0.0024077834,0.0016593017,0.0013739137,0.0010011009],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000871231,0.00008785231,0.0010368472,0.00041518785,0.00007241305,0.00020145261,0.00074724125,0.06118501,0.021726532,0.7122306,0.00303636,0.1991733],"study_design_scores_gemma":[0.000031696807,0.00010864499,0.00051663344,0.00010682227,0.00004351479,0.00049520994,0.0002025715,0.38898778,0.019839594,0.5585855,0.03099517,0.000086832144],"about_ca_topic_score_codex":0.0023870002,"about_ca_topic_score_gemma":0.0029024966,"teacher_disagreement_score":0.0042328998,"about_ca_system_score_codex":0.0007990158,"about_ca_system_score_gemma":0.0013660223,"threshold_uncertainty_score":0.014160514},"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":"empirical","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5773627,0.0007477333,0.33173892,0.003272659,0.00026116645,0.00010606904,0.0007615588,0.00036384593,0.08538539],"genre_scores_gemma":[0.93347406,0.00060438394,0.04721929,0.00023975706,0.00026532644,0.00007281391,0.0006924183,0.000153255,0.01727865],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993789,0.00016917537,0.000034468343,0.000117152966,0.00013710867,0.00016318883],"domain_scores_gemma":[0.9986688,0.00087152165,0.0001047982,0.00007811438,0.00011259859,0.00016418692],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001152515,0.0008455346,0.0011113452,0.0012016384,0.0014257521,0.0029009446,0.0009980535,0.0009481645,0.011229901],"category_scores_gemma":[0.0037679314,0.00043584654,0.0010187067,0.0011428577,0.002792752,0.003992494,0.0030634764,0.002477847,0.00086670864],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001228184,0.000037550883,0.0004105629,0.00010647948,0.00002535093,0.00008254252,0.00039682465,0.0065615247,0.0021247938,0.98026365,0.0015806286,0.008287357],"study_design_scores_gemma":[0.000032476975,0.00003549822,0.00018572158,0.000026195898,0.000016223945,0.00006590901,0.0002113393,0.02693725,0.00131169,0.96967614,0.0014885389,0.000013076562],"about_ca_topic_score_codex":0.0012922469,"about_ca_topic_score_gemma":0.0014530157,"teacher_disagreement_score":0.011229901,"about_ca_system_score_codex":0.0012722234,"about_ca_system_score_gemma":0.0008764317,"threshold_uncertainty_score":0.037567794},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07811144,0.0006406815,0.89478564,0.0009232942,0.00018533986,0.00008030763,0.00020141546,0.00094916,0.024122741],"genre_scores_gemma":[0.5782278,0.000865728,0.40112874,0.00036768572,0.000372052,0.00018560335,0.0005012873,0.00048885937,0.017862165],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99933416,0.00022790342,0.000031198404,0.00010604084,0.00020471746,0.00009602045],"domain_scores_gemma":[0.9990814,0.000591903,0.00005653957,0.00012204583,0.000096939235,0.000051157585],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009894251,0.00091677654,0.0010006555,0.00063956314,0.00071534596,0.0017964406,0.0007735843,0.00054195477,0.008480502],"category_scores_gemma":[0.0036221708,0.0004016447,0.0007440793,0.00085806666,0.0012297895,0.002680463,0.0015249569,0.002492914,0.0019111981],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00035951342,0.00032693413,0.001099531,0.00066762656,0.00007673836,0.00023523874,0.00085361174,0.07929035,0.008657108,0.67291844,0.01466096,0.220854],"study_design_scores_gemma":[0.0001235239,0.000098463344,0.00012386152,0.0000788957,0.000025183297,0.000089375055,0.00018980754,0.23737681,0.0067537096,0.7457916,0.009328006,0.000020751278],"about_ca_topic_score_codex":0.0009173899,"about_ca_topic_score_gemma":0.001804121,"teacher_disagreement_score":0.008480502,"about_ca_system_score_codex":0.00059171795,"about_ca_system_score_gemma":0.00093942054,"threshold_uncertainty_score":0.028370082},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.61813074,0.0015580356,0.31511313,0.008093127,0.0004878397,0.00030473672,0.0029135256,0.0016712265,0.051727615],"genre_scores_gemma":[0.9235342,0.0006038303,0.06300639,0.00041984985,0.0004014385,0.0001424291,0.0018421652,0.00029488222,0.009754812],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9968562,0.00054040656,0.00015977639,0.0004828931,0.0012070274,0.00075368944],"domain_scores_gemma":[0.98888105,0.007436087,0.0006430534,0.0019205977,0.0007389841,0.00038020278],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015505487,0.0007714127,0.0015037275,0.00090286764,0.0015920791,0.0038817634,0.0019413095,0.0014378512,0.017824389],"category_scores_gemma":[0.013156161,0.0006781976,0.0013768931,0.0019064621,0.002176606,0.009627981,0.0035545789,0.002736233,0.0018952857],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0034530095,0.00057991134,0.0073362044,0.0009874823,0.00020518401,0.0008839194,0.0010104434,0.17171052,0.01507015,0.5850874,0.032875255,0.18080051],"study_design_scores_gemma":[0.00019148493,0.00010736989,0.0010189905,0.000041272226,0.000067293855,0.0002263265,0.00025545922,0.27363557,0.0038028448,0.71769756,0.0029113812,0.000044471268],"about_ca_topic_score_codex":0.0031534138,"about_ca_topic_score_gemma":0.004592915,"teacher_disagreement_score":0.017824389,"about_ca_system_score_codex":0.0018066698,"about_ca_system_score_gemma":0.0029035152,"threshold_uncertainty_score":0.059628487},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.40340593,0.0010977798,0.5464068,0.0016621054,0.000157052,0.000085522,0.00011916706,0.00021985882,0.046845805],"genre_scores_gemma":[0.931877,0.00064038864,0.05221468,0.00017478975,0.0002600287,0.00010958119,0.00012824689,0.000089602334,0.014505547],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991823,0.0002917804,0.000032443517,0.00010567748,0.0002640419,0.00012378818],"domain_scores_gemma":[0.9990357,0.00057076267,0.00010459722,0.000058785183,0.00014228206,0.00008792938],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014851983,0.0005495067,0.0007984438,0.0010759742,0.0008445675,0.001391529,0.00075258827,0.0007386541,0.002400818],"category_scores_gemma":[0.004908048,0.00035841836,0.0014440228,0.00053189177,0.002583241,0.0021250602,0.002387106,0.0014764076,0.0003667547],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000032170345,0.000013201197,0.000489403,0.00003320648,0.00001625473,0.00009648642,0.000313111,0.0061495076,0.0016661568,0.9850091,0.00054856896,0.005632879],"study_design_scores_gemma":[0.0000354001,0.000041448922,0.00032402022,0.000016125143,0.000011667593,0.00011738626,0.00004733959,0.104946055,0.0013427838,0.89054954,0.0025506786,0.000017564462],"about_ca_topic_score_codex":0.001474798,"about_ca_topic_score_gemma":0.00070802815,"teacher_disagreement_score":0.002400818,"about_ca_system_score_codex":0.0010223098,"about_ca_system_score_gemma":0.00062485103,"threshold_uncertainty_score":0.008031547},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.57701427,0.002639127,0.29895607,0.008950587,0.00063542573,0.00006776788,0.0003915155,0.0009752579,0.11036996],"genre_scores_gemma":[0.97405607,0.00091345265,0.016156722,0.00037235257,0.00020607217,0.000036446785,0.00022343552,0.00007929085,0.007956096],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9982443,0.00030238772,0.000100401456,0.00039488735,0.0006059731,0.0003521038],"domain_scores_gemma":[0.99595284,0.0018332537,0.00038699215,0.00097406656,0.00054322823,0.0003096172],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018122947,0.0005884658,0.0009921177,0.0009720515,0.0016485412,0.0027350776,0.0011878625,0.001543697,0.0064226957],"category_scores_gemma":[0.014547455,0.00043723002,0.0008542032,0.001451189,0.0062928116,0.008318193,0.0032586541,0.0030310047,0.0009368856],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001484229,0.000019161618,0.0021269894,0.0001033929,0.000015749656,0.00011353777,0.00065154285,0.011667219,0.0015317868,0.9700313,0.0024115609,0.011179246],"study_design_scores_gemma":[0.000053610544,0.00012253682,0.0017533293,0.000108844215,0.000029248431,0.00044129568,0.0006955524,0.038194228,0.0033256307,0.9330135,0.02221857,0.00004356258],"about_ca_topic_score_codex":0.00175486,"about_ca_topic_score_gemma":0.00073641096,"teacher_disagreement_score":0.0064226957,"about_ca_system_score_codex":0.0011332403,"about_ca_system_score_gemma":0.00041004017,"threshold_uncertainty_score":0.021486044},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.024323799,0.00011130597,0.9663739,0.00044188867,0.000030009749,0.00007920984,0.00007164638,0.00050295214,0.008065254],"genre_scores_gemma":[0.24361897,0.00016837806,0.7509135,0.00017396633,0.000084612686,0.0002431361,0.00037937777,0.00038464784,0.0040334077],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985825,0.00033814576,0.00005890866,0.00026519908,0.0005693091,0.00018600191],"domain_scores_gemma":[0.9933189,0.005405476,0.00028430426,0.00042792017,0.000407242,0.00015611337],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0023256473,0.0009990275,0.00086042745,0.00095713703,0.0010613509,0.0015717862,0.001333276,0.0014248,0.007990984],"category_scores_gemma":[0.01299122,0.0003962077,0.00089224573,0.0008733232,0.0026406895,0.0031514,0.0016116312,0.0028768703,0.0011286277],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00070474145,0.00019253747,0.0026358538,0.0004070254,0.000066736684,0.00013670867,0.0005658608,0.37692833,0.014984206,0.42246345,0.009414488,0.1715],"study_design_scores_gemma":[0.000034168857,0.00004711526,0.00022935696,0.000016653412,0.000010127649,0.000038571372,0.00002330849,0.9102603,0.0029135381,0.08486581,0.0015471118,0.00001389779],"about_ca_topic_score_codex":0.002685015,"about_ca_topic_score_gemma":0.0031062872,"teacher_disagreement_score":0.007990984,"about_ca_system_score_codex":0.002123835,"about_ca_system_score_gemma":0.002596134,"threshold_uncertainty_score":0.026732504},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0073125265,0.0005399925,0.98446757,0.00023731151,0.00018250848,0.00002814538,0.00005420758,0.00070029334,0.006477489],"genre_scores_gemma":[0.2051499,0.0017090827,0.7802554,0.0002294085,0.00052419765,0.00008897386,0.00025028913,0.00071571884,0.0110771],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99907446,0.00019785407,0.00006289297,0.00015357294,0.0004086812,0.000102608836],"domain_scores_gemma":[0.9985189,0.0005709464,0.0000923514,0.00050430116,0.00024468737,0.000068800444],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000774154,0.0010754603,0.00088956155,0.0009254043,0.00070421066,0.001557275,0.0012556214,0.0009194236,0.009101687],"category_scores_gemma":[0.005790425,0.0004500521,0.0008868619,0.0017427424,0.001689409,0.0024856734,0.002273438,0.0026338627,0.0035817197],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00050468324,0.00014281545,0.00051526434,0.00037838306,0.00004179167,0.0005191784,0.00039932563,0.049778637,0.04617578,0.47722048,0.008597147,0.41572663],"study_design_scores_gemma":[0.00007114929,0.0002482324,0.00028486544,0.000083588624,0.00003966385,0.0016373735,0.000100139754,0.44494978,0.074549265,0.41669282,0.061270323,0.00007275963],"about_ca_topic_score_codex":0.0006750125,"about_ca_topic_score_gemma":0.000788196,"teacher_disagreement_score":0.009101687,"about_ca_system_score_codex":0.0006882262,"about_ca_system_score_gemma":0.0005818781,"threshold_uncertainty_score":0.030448198},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.19395779,0.00019946528,0.75862885,0.00023816862,0.00012181249,0.00010398349,0.00066652737,0.0030993447,0.0429841],"genre_scores_gemma":[0.7408857,0.0002453575,0.24317408,0.00010488104,0.00012171576,0.000100892634,0.0010889305,0.0008682245,0.013410197],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994111,0.00008138577,0.000038559065,0.00014957148,0.00019024506,0.00012909863],"domain_scores_gemma":[0.99882346,0.00035680094,0.00009428878,0.00041593314,0.00021400748,0.00009546375],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00072743837,0.00046046343,0.0006661313,0.00097363367,0.0008619546,0.0018823257,0.0007821881,0.0004362379,0.018203646],"category_scores_gemma":[0.003587882,0.0002549629,0.0007988152,0.0011784924,0.0011876482,0.0034741375,0.0021159058,0.0009346784,0.003646543],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005487107,0.000092039045,0.0026048338,0.00032089127,0.00003732396,0.0003053017,0.0006105534,0.03381326,0.019141724,0.75033176,0.009887665,0.18230595],"study_design_scores_gemma":[0.000062911575,0.000105918596,0.0004928993,0.000057134217,0.000022525019,0.0003058246,0.00020892294,0.1755908,0.041853163,0.76032764,0.02093337,0.000038935075],"about_ca_topic_score_codex":0.00057631504,"about_ca_topic_score_gemma":0.0011207071,"teacher_disagreement_score":0.018203646,"about_ca_system_score_codex":0.0005958198,"about_ca_system_score_gemma":0.0007688064,"threshold_uncertainty_score":0.06089729},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.44105774,0.00043233717,0.4682982,0.0034191506,0.00021831316,0.00043028095,0.0013980432,0.000705184,0.08404071],"genre_scores_gemma":[0.9715072,0.000106333064,0.022111429,0.00029223599,0.00008673588,0.0001557292,0.0006009108,0.00006437334,0.0050750156],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99927837,0.000097109,0.000060797312,0.00019944216,0.000198071,0.00016618645],"domain_scores_gemma":[0.99559385,0.0014708316,0.0004216817,0.0005946943,0.0014276946,0.00049123494],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011428364,0.00034314606,0.00052941137,0.00097566086,0.0012309256,0.0017110198,0.0009227857,0.0014350743,0.014794287],"category_scores_gemma":[0.005945233,0.00033426998,0.00049270317,0.00062684144,0.0019293589,0.003140033,0.0017117627,0.0015777429,0.0023680832],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000323385,0.000072522445,0.0029150012,0.00010790943,0.00002383972,0.0004367259,0.00030360444,0.0050272555,0.03310948,0.93656486,0.0042281523,0.016887227],"study_design_scores_gemma":[0.0003445821,0.00090427353,0.004236737,0.00007802148,0.000035038083,0.0013919735,0.0011114493,0.088273,0.07157238,0.7859894,0.045968708,0.000094361356],"about_ca_topic_score_codex":0.00082721165,"about_ca_topic_score_gemma":0.0004631692,"teacher_disagreement_score":0.014794287,"about_ca_system_score_codex":0.0006138851,"about_ca_system_score_gemma":0.00075919146,"threshold_uncertainty_score":0.049491823},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.31512064,0.0010135785,0.60081506,0.0022884689,0.00023265419,0.00005630414,0.0002370719,0.000667198,0.07956902],"genre_scores_gemma":[0.91228276,0.0006203444,0.072296955,0.00015171937,0.00025019713,0.000050755352,0.00014891972,0.00020767128,0.013990541],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9997553,0.00004148442,0.0000095713185,0.0000499904,0.00008837865,0.000055235734],"domain_scores_gemma":[0.99951684,0.00016164298,0.00009135302,0.000049742244,0.00007487904,0.00010558459],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00033340175,0.00034195735,0.00044190622,0.0016903003,0.0010375022,0.0021895866,0.0006699941,0.0006072292,0.004535561],"category_scores_gemma":[0.0019475123,0.0002686521,0.0004740737,0.0010489094,0.0028298025,0.0035204848,0.0014298476,0.0015732768,0.0005983901],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000014000979,0.0000070573565,0.00036558276,0.000015620979,0.0000014277199,0.000056127323,0.00014350927,0.0015605404,0.0007605213,0.99170786,0.00072210876,0.004645608],"study_design_scores_gemma":[0.000007620505,0.000017644856,0.00047299787,0.000015165637,0.0000041631315,0.00015512013,0.000121957506,0.023754999,0.0011641636,0.96880645,0.005466796,0.000012940337],"about_ca_topic_score_codex":0.0012953639,"about_ca_topic_score_gemma":0.0015529654,"teacher_disagreement_score":0.004535561,"about_ca_system_score_codex":0.0012593775,"about_ca_system_score_gemma":0.00049824134,"threshold_uncertainty_score":0.015172958},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.061737277,0.00014113069,0.932255,0.00013078697,0.000038393657,0.000025034531,0.00006675562,0.00011627775,0.005489312],"genre_scores_gemma":[0.8081984,0.00029334924,0.18558422,0.00006879726,0.000038115028,0.00007629016,0.00018671647,0.00010039894,0.0054536685],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9996544,0.00011861455,0.000013844077,0.00005446202,0.000114516304,0.000044129716],"domain_scores_gemma":[0.99849176,0.0008593076,0.00017095711,0.00015957157,0.00021711524,0.000101335696],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008724457,0.000617617,0.0005238179,0.00037568886,0.00023289969,0.00095025176,0.0006111737,0.00074019836,0.0022838449],"category_scores_gemma":[0.004770484,0.00024781367,0.0004052677,0.000283224,0.0012631153,0.00093069556,0.0008113234,0.0015113313,0.0003500017],"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.00011514406,0.000046957804,0.0005039305,0.00012806607,0.000014336177,0.00007726736,0.0001157624,0.731407,0.0066001723,0.2467817,0.00088410475,0.013325557],"study_design_scores_gemma":[0.000004344704,0.000019338127,0.000037703783,0.000007560443,0.0000011282687,0.000008675071,0.000008693639,0.9859969,0.0006012904,0.012843069,0.00046788834,0.0000033716692],"about_ca_topic_score_codex":0.0012291763,"about_ca_topic_score_gemma":0.0018838483,"teacher_disagreement_score":0.0022838449,"about_ca_system_score_codex":0.00072790444,"about_ca_system_score_gemma":0.0005816327,"threshold_uncertainty_score":0.007640183},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.25105804,0.000681078,0.7074019,0.00030396736,0.00012772746,0.00006241447,0.00017546474,0.00035664704,0.039832775],"genre_scores_gemma":[0.798181,0.0006637038,0.18743052,0.000086893175,0.00016142975,0.00015192975,0.00029269033,0.0002922775,0.012739546],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994086,0.00013353566,0.000035218836,0.00011305799,0.00020990585,0.00009966862],"domain_scores_gemma":[0.99946135,0.00018003483,0.00009414864,0.000072381845,0.000121980636,0.00007005701],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001084073,0.0005038355,0.00060035754,0.0026572265,0.0012975866,0.0028329245,0.0010150293,0.00067827874,0.004205727],"category_scores_gemma":[0.002679135,0.00030717763,0.00053132576,0.0015391081,0.002255144,0.004766766,0.0013091211,0.0018957512,0.0006759746],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000061886467,0.0000066114576,0.000103375736,0.000009990023,0.0000027001615,0.00002331854,0.000061733124,0.0014336964,0.00058336684,0.9923637,0.000182826,0.0052225157],"study_design_scores_gemma":[0.000003057399,0.000011713973,0.00022517849,0.000013138084,0.0000038327826,0.00007044153,0.000059551243,0.036543027,0.0015838722,0.95860726,0.0028647257,0.000014209517],"about_ca_topic_score_codex":0.0005255332,"about_ca_topic_score_gemma":0.00040600993,"teacher_disagreement_score":0.004205727,"about_ca_system_score_codex":0.0010430595,"about_ca_system_score_gemma":0.0007722839,"threshold_uncertainty_score":0.014069557},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.115823716,0.0012496079,0.85572404,0.00054619735,0.00025957476,0.000059177168,0.000083408544,0.00059626513,0.025658017],"genre_scores_gemma":[0.7313313,0.0014257267,0.25447685,0.0002372104,0.00027233473,0.000079418714,0.00013861361,0.00031081794,0.011727714],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.999432,0.0002017668,0.000035955876,0.000110869616,0.00014658005,0.00007280645],"domain_scores_gemma":[0.99838376,0.0009258498,0.00007927822,0.00026256006,0.0002468889,0.00010173275],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019302288,0.00061998254,0.00089905574,0.0021017073,0.0010859041,0.0015713987,0.0012511362,0.00079028384,0.0058851875],"category_scores_gemma":[0.0052906633,0.00045771454,0.00096561655,0.0021142652,0.0038086693,0.003995609,0.0037129826,0.001752748,0.0008348838],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00015283056,0.0000365386,0.0008117471,0.00011954912,0.000029204268,0.00028159938,0.0005440643,0.007980601,0.004075282,0.93012667,0.0008736659,0.054968145],"study_design_scores_gemma":[0.000030164636,0.00007816281,0.00048535888,0.00004994349,0.000030274296,0.0002321699,0.00009850155,0.048815306,0.0044658016,0.93839854,0.007263725,0.000052073014],"about_ca_topic_score_codex":0.0008096093,"about_ca_topic_score_gemma":0.00093929796,"teacher_disagreement_score":0.0058851875,"about_ca_system_score_codex":0.00069648784,"about_ca_system_score_gemma":0.0005092094,"threshold_uncertainty_score":0.019687891},"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.39810163,0.003475314,0.1923361,0.0048315567,0.0006762253,0.0001634365,0.000854291,0.0005630279,0.3989985],"genre_scores_gemma":[0.9389446,0.0014871185,0.018869368,0.0003441542,0.00055034726,0.000069002774,0.00042167984,0.00013055597,0.03918313],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991067,0.00019828245,0.000049225862,0.00017050636,0.00027519866,0.0002000939],"domain_scores_gemma":[0.9983935,0.0006115667,0.0003157396,0.00030636697,0.0001342235,0.00023852581],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00095641194,0.0006156141,0.0007451469,0.003086254,0.002980279,0.0050467816,0.0016640566,0.0013570975,0.01761697],"category_scores_gemma":[0.0032291505,0.00055732817,0.00078711065,0.0040687523,0.0062617254,0.011372346,0.0037049549,0.0040535294,0.001404221],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000007986619,0.0000047814738,0.00003720119,0.0000082447705,7.78731e-7,0.000014069344,0.000056397887,0.00014269177,0.000047988266,0.99860805,0.0002328283,0.0008390341],"study_design_scores_gemma":[0.000007651481,0.0000068775876,0.00011199517,0.000009370286,0.0000045295146,0.000086203625,0.000091380854,0.0011580252,0.00018618384,0.9939831,0.0043464815,0.000008201368],"about_ca_topic_score_codex":0.00056285044,"about_ca_topic_score_gemma":0.00040076388,"teacher_disagreement_score":0.01761697,"about_ca_system_score_codex":0.0016806289,"about_ca_system_score_gemma":0.00053829874,"threshold_uncertainty_score":0.05893457},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0769029,0.00047851587,0.90696585,0.0017944918,0.00006298853,0.00011183255,0.00027340523,0.0008550112,0.012554944],"genre_scores_gemma":[0.7264143,0.00048713014,0.26210248,0.00041752702,0.00017817586,0.00027050453,0.0005942207,0.00039308172,0.009142448],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99850994,0.00041556632,0.00010047234,0.0002501955,0.00045498574,0.0002689269],"domain_scores_gemma":[0.99454087,0.0038655684,0.00022676833,0.0009229134,0.00030735554,0.0001365687],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016604775,0.00064083165,0.00088574964,0.0005893551,0.00082625996,0.0020575458,0.001445945,0.0008419886,0.007727359],"category_scores_gemma":[0.0085116895,0.00028784634,0.0008738372,0.0011315844,0.0015446563,0.0038705785,0.0029629203,0.002419081,0.00091164035],"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.0007252584,0.00015577317,0.0017856664,0.00050770637,0.00006391455,0.00013877815,0.00048219136,0.22652254,0.010565074,0.6101668,0.008440404,0.14044589],"study_design_scores_gemma":[0.00003495141,0.000052750947,0.000320079,0.000016683809,0.000025691968,0.000054370244,0.00004535985,0.70612216,0.004033443,0.28753167,0.0017460071,0.000016847405],"about_ca_topic_score_codex":0.0016556919,"about_ca_topic_score_gemma":0.0030346725,"teacher_disagreement_score":0.007727359,"about_ca_system_score_codex":0.0017671038,"about_ca_system_score_gemma":0.0013565684,"threshold_uncertainty_score":0.025850594},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.51881015,0.0025071918,0.3444776,0.005312754,0.0008178324,0.0001552711,0.00023157922,0.00043025755,0.12725738],"genre_scores_gemma":[0.9648492,0.00093221234,0.017095191,0.0003944383,0.00067917816,0.00008430535,0.00012983661,0.00014867396,0.015686996],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99888223,0.00041172793,0.000057423036,0.000183008,0.0002841217,0.00018155923],"domain_scores_gemma":[0.9972908,0.0010737295,0.00034548453,0.00034706653,0.00051146006,0.00043144997],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001696224,0.0006443215,0.0017887818,0.0021429248,0.0020185912,0.0041478407,0.001060599,0.0021357862,0.005674534],"category_scores_gemma":[0.006273198,0.0006774821,0.0014853185,0.0012285332,0.0041574123,0.005910108,0.003641211,0.0030881925,0.00068820163],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000015413309,0.000009680254,0.00018895997,0.000012062067,0.000006696459,0.00008040922,0.00011923103,0.0015044707,0.0006710975,0.9956334,0.0005525575,0.0012059371],"study_design_scores_gemma":[0.00002247716,0.00001610687,0.0002726524,0.000012234204,0.000011003001,0.00013954463,0.0000742805,0.050352,0.0005792079,0.9470363,0.0014596515,0.0000245685],"about_ca_topic_score_codex":0.0024558206,"about_ca_topic_score_gemma":0.0015978143,"teacher_disagreement_score":0.005674534,"about_ca_system_score_codex":0.0016165267,"about_ca_system_score_gemma":0.0014672832,"threshold_uncertainty_score":0.018983245},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.51594114,0.0025037758,0.3497065,0.0040105386,0.00035793465,0.00009774495,0.00034141468,0.00050643756,0.1265344],"genre_scores_gemma":[0.9519405,0.0017882037,0.022304205,0.0006336233,0.00061727926,0.00014450992,0.00036496474,0.00028820965,0.021918407],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9981804,0.0008034046,0.00006690902,0.00019665768,0.00045278025,0.00029987944],"domain_scores_gemma":[0.969815,0.024251917,0.00093772274,0.001245556,0.002478405,0.0012714313],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004672688,0.0011996478,0.001590742,0.004028506,0.0020172296,0.0034545066,0.0022992666,0.0015864763,0.009105029],"category_scores_gemma":[0.032628514,0.0008063071,0.0012344839,0.0019428753,0.0053843535,0.007827464,0.004050289,0.0043984256,0.001015242],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000405451,0.000020977128,0.00039005675,0.00003507046,0.000007983796,0.00005622128,0.00023030334,0.003095607,0.00043468003,0.99063873,0.0008039024,0.0042459127],"study_design_scores_gemma":[0.000014785016,0.00001979928,0.0002840933,0.00002214939,0.000008682433,0.00007968691,0.000065081935,0.03422346,0.000360279,0.96414113,0.00076538225,0.000015528616],"about_ca_topic_score_codex":0.0016239934,"about_ca_topic_score_gemma":0.00143019,"teacher_disagreement_score":0.009105029,"about_ca_system_score_codex":0.0022064184,"about_ca_system_score_gemma":0.0010921546,"threshold_uncertainty_score":0.030459344},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.016239015,0.054194078,0.55828243,0.031845134,0.055528957,0.00011744948,0.0013980746,0.0015968004,0.28079805],"genre_scores_gemma":[0.29754585,0.07365959,0.24451594,0.013933023,0.11228758,0.0002881098,0.0028754966,0.002214583,0.2526798],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986571,0.00026913127,0.00008619196,0.0003983464,0.00045248918,0.0001367346],"domain_scores_gemma":[0.9968495,0.0017831485,0.00014413506,0.0004460625,0.00047016927,0.0003069903],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012575357,0.0014009698,0.00093622523,0.0025699707,0.0021005424,0.003340744,0.0017567916,0.0022870197,0.024318416],"category_scores_gemma":[0.00493296,0.00060289603,0.0014955713,0.0034280284,0.0031414768,0.009079614,0.0036921233,0.005019859,0.009589564],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000094027906,0.00006635884,0.00032154308,0.0005464293,0.00003651155,0.00018233435,0.0002429793,0.0018337691,0.0014117886,0.87081784,0.056677744,0.06776878],"study_design_scores_gemma":[0.0000089786745,0.000028378505,0.00016740501,0.00009782637,0.000022575356,0.0001566126,0.00004265582,0.0024373156,0.0003746756,0.85399777,0.14264168,0.000024192306],"about_ca_topic_score_codex":0.0007670994,"about_ca_topic_score_gemma":0.00072469626,"teacher_disagreement_score":0.024318416,"about_ca_system_score_codex":0.001340129,"about_ca_system_score_gemma":0.0008587321,"threshold_uncertainty_score":0.08135325},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09144044,0.00069512805,0.87392724,0.0013609121,0.00032932003,0.000108026485,0.00032273858,0.00022196585,0.031594243],"genre_scores_gemma":[0.77410764,0.00051591935,0.19557153,0.0004770061,0.00035100267,0.00039523197,0.000504794,0.00010365185,0.027973155],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.998629,0.00046774154,0.000060726117,0.00028170212,0.0004311162,0.00012983289],"domain_scores_gemma":[0.9989557,0.00046943236,0.00016051806,0.000097360426,0.00024094225,0.000076008415],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013540548,0.0005827481,0.0007724583,0.00067199377,0.0008243557,0.0017692534,0.0011617363,0.0013009945,0.0043054996],"category_scores_gemma":[0.0030921544,0.00033021098,0.0009260565,0.00078601786,0.002083629,0.0015010836,0.002000443,0.001724473,0.00059951557],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000013120755,0.000022558355,0.0004734183,0.000042443353,0.000018118337,0.00012903308,0.0002455481,0.023725225,0.0012326351,0.96893084,0.0007964116,0.004370673],"study_design_scores_gemma":[0.00003933833,0.00005666659,0.00032503405,0.000017791204,0.000014419001,0.000107191394,0.00014345955,0.3015949,0.0009120106,0.68840474,0.008353798,0.000030639963],"about_ca_topic_score_codex":0.0020295708,"about_ca_topic_score_gemma":0.0014893833,"teacher_disagreement_score":0.0043054996,"about_ca_system_score_codex":0.0011896403,"about_ca_system_score_gemma":0.0009811238,"threshold_uncertainty_score":0.014403343},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.45952263,0.0033491193,0.40154105,0.0020121008,0.0013535293,0.000114500166,0.00033438153,0.0005118409,0.13126072],"genre_scores_gemma":[0.9608805,0.00090670085,0.024127493,0.00019548397,0.00059867743,0.00003891218,0.00014684549,0.00009219438,0.013013078],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.999062,0.00022322834,0.000053154683,0.00016807018,0.00035854135,0.00013512408],"domain_scores_gemma":[0.9985084,0.00039508753,0.00017604028,0.00025091652,0.00027527555,0.00039423053],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014982953,0.00048339498,0.0006170404,0.0019714555,0.001267641,0.0027234904,0.00082346686,0.0006912648,0.007133577],"category_scores_gemma":[0.0028577922,0.00023836643,0.0006068627,0.0013826137,0.0055665113,0.006177531,0.0039147176,0.002625477,0.00063222635],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000020617597,0.0000075989074,0.00013621169,0.000020902988,0.000003012725,0.00011630288,0.0002842062,0.00060492096,0.0009820326,0.99391335,0.0002322676,0.0036785158],"study_design_scores_gemma":[0.000015263508,0.00008951291,0.00036764223,0.000023141585,0.000006748626,0.00029703346,0.00022403608,0.0063943663,0.0011595371,0.97941923,0.0119875455,0.000015967365],"about_ca_topic_score_codex":0.00035735543,"about_ca_topic_score_gemma":0.00017944805,"teacher_disagreement_score":0.007133577,"about_ca_system_score_codex":0.00074879255,"about_ca_system_score_gemma":0.00039805274,"threshold_uncertainty_score":0.02386421},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07546742,0.000095331045,0.921265,0.00007159821,0.000037770536,0.000041711202,0.00013235139,0.0008600241,0.0020287775],"genre_scores_gemma":[0.41671056,0.00011000757,0.5798541,0.000041982716,0.000037010344,0.000051685787,0.00046095054,0.00018109355,0.0025526974],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99918646,0.00010548741,0.000049461418,0.0001695202,0.00038400377,0.0001050995],"domain_scores_gemma":[0.9986889,0.0005027608,0.00014601542,0.00028379294,0.0002974249,0.00008118538],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00081873406,0.0005635367,0.0006980125,0.0013836444,0.00047330605,0.0012835689,0.00073554233,0.0004984473,0.0036224457],"category_scores_gemma":[0.006763621,0.00027764472,0.00051597686,0.0011955262,0.0008921951,0.0020260853,0.0016254482,0.0008567901,0.00095245405],"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.00051648996,0.000100397505,0.005577754,0.0003065938,0.00006074035,0.00046434652,0.0005618513,0.18044353,0.052850857,0.2488409,0.0038557204,0.5064208],"study_design_scores_gemma":[0.000045124514,0.00015455463,0.00085181603,0.0000306623,0.000015600846,0.00027491292,0.00022301824,0.8325633,0.034352683,0.12373551,0.0077228663,0.000029909024],"about_ca_topic_score_codex":0.001108235,"about_ca_topic_score_gemma":0.0019005735,"teacher_disagreement_score":0.0036224457,"about_ca_system_score_codex":0.00061441574,"about_ca_system_score_gemma":0.0008688904,"threshold_uncertainty_score":0.01211828},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.71253866,0.0007084423,0.26221305,0.0005032392,0.00009179057,0.00006620733,0.00021429235,0.00014566147,0.0235186],"genre_scores_gemma":[0.96527416,0.00028848858,0.031885076,0.000053086904,0.00007102648,0.00005090635,0.00011255198,0.000022133607,0.002242594],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995234,0.00010780206,0.000026515003,0.0000843795,0.00017019284,0.0000877593],"domain_scores_gemma":[0.9991767,0.00032915125,0.000110196146,0.00008065106,0.00015584049,0.00014748392],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008081998,0.0003468068,0.00038950433,0.002363649,0.00064584805,0.0012879046,0.0007040301,0.00037624387,0.003072605],"category_scores_gemma":[0.0026427272,0.00020165723,0.00047796546,0.00084694085,0.0019229458,0.0041593965,0.0014295807,0.0009983715,0.00024968587],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000017050897,0.000015083153,0.0010878575,0.000027896067,0.000007852037,0.000034449804,0.00017940537,0.0025644284,0.0014497361,0.9858489,0.00025061512,0.008516876],"study_design_scores_gemma":[0.000007859891,0.000015728025,0.0008740455,0.000013420434,0.0000046830414,0.000084063024,0.00007607604,0.022705542,0.0023489015,0.9721593,0.0016924877,0.00001788984],"about_ca_topic_score_codex":0.0004371156,"about_ca_topic_score_gemma":0.0005843126,"teacher_disagreement_score":0.003072605,"about_ca_system_score_codex":0.0009487343,"about_ca_system_score_gemma":0.000571028,"threshold_uncertainty_score":0.01027894},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.33396986,0.0014213648,0.62205416,0.0018555365,0.00023499448,0.00021332697,0.00023945284,0.0007024881,0.039308812],"genre_scores_gemma":[0.83518213,0.00059582805,0.15469049,0.0003857302,0.0001515893,0.00015344143,0.00023171218,0.00016456713,0.008444356],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990546,0.00025170896,0.00005539224,0.00019432225,0.00024938004,0.00019464774],"domain_scores_gemma":[0.99869823,0.00044863005,0.0001739677,0.0004676968,0.00010886454,0.000102662176],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014877943,0.00050421554,0.00044336906,0.000856955,0.0008991054,0.0012723138,0.00053519383,0.0006032772,0.003991685],"category_scores_gemma":[0.0031417082,0.00031234085,0.000685413,0.00068760966,0.0019443256,0.00395955,0.0025844222,0.0018585338,0.0010835867],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0006974433,0.00013503713,0.002225924,0.00023639866,0.000028777618,0.0001723311,0.00040091135,0.009860335,0.048768174,0.8372742,0.0030241087,0.09717636],"study_design_scores_gemma":[0.00014920901,0.0005493484,0.0010089811,0.00013736842,0.000050314768,0.0005115141,0.00028241705,0.044122163,0.06023933,0.8656633,0.027174667,0.00011137193],"about_ca_topic_score_codex":0.00019635668,"about_ca_topic_score_gemma":0.0003164007,"teacher_disagreement_score":0.003991685,"about_ca_system_score_codex":0.00077297195,"about_ca_system_score_gemma":0.0006813032,"threshold_uncertainty_score":0.013353527},"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":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.123159036,0.032898903,0.1918868,0.09325982,0.14493805,0.0006290568,0.003922222,0.002726104,0.40658003],"genre_scores_gemma":[0.44611204,0.01429038,0.042247083,0.0052085314,0.06755612,0.0005665182,0.0067626345,0.0020300427,0.4152266],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9981456,0.0006514501,0.00009850294,0.00047407628,0.0003973907,0.00023295806],"domain_scores_gemma":[0.9966383,0.00081761385,0.00010921351,0.00045879686,0.00093009684,0.0010459475],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0047082966,0.0012916593,0.0008501448,0.0016185072,0.0014122213,0.004065403,0.0021570318,0.0013527483,0.03881894],"category_scores_gemma":[0.0047475044,0.00041446567,0.0015070632,0.0011272153,0.0011625467,0.0043323287,0.0037713088,0.0037338496,0.010642409],"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.00056369556,0.000430845,0.0016397595,0.0007243128,0.00014967816,0.00064981304,0.0012333832,0.0025737532,0.009489811,0.26073167,0.6112166,0.11059671],"study_design_scores_gemma":[0.00015033857,0.0006204823,0.0067413645,0.00070460554,0.00023175849,0.0016217469,0.0014321465,0.018236704,0.01715682,0.26080924,0.69209754,0.00019731067],"about_ca_topic_score_codex":0.00053370453,"about_ca_topic_score_gemma":0.0007913893,"teacher_disagreement_score":0.03881894,"about_ca_system_score_codex":0.0018406371,"about_ca_system_score_gemma":0.0013945797,"threshold_uncertainty_score":0.12986225},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8370678,0.00037280182,0.088145174,0.00065637025,0.000210245,0.000041943105,0.000075573735,0.00017160106,0.07325847],"genre_scores_gemma":[0.9869862,0.00011444937,0.0066359043,0.000048070262,0.000055922937,0.000016888673,0.00003185791,0.000031103278,0.0060796444],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9996847,0.00006537099,0.000012659892,0.00006162638,0.000098897675,0.000076808865],"domain_scores_gemma":[0.99964476,0.00007568905,0.00007486192,0.00004051351,0.000043352877,0.00012079526],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00037107064,0.00026775556,0.00027076816,0.0011643392,0.0012918802,0.0014796575,0.0003272291,0.000378528,0.004411939],"category_scores_gemma":[0.0009800498,0.00020050743,0.00043451184,0.00040462476,0.002825923,0.0020317642,0.0016664483,0.001106156,0.00036585444],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000015427106,0.000007694873,0.00037375157,0.000010071578,0.0000029353769,0.00017212715,0.0003450157,0.0007869122,0.0011154335,0.99512285,0.0002832087,0.0017645061],"study_design_scores_gemma":[0.000020144313,0.00005962174,0.0018368791,0.000030176185,0.000011266256,0.0006291512,0.0005869963,0.009618645,0.0035604483,0.97338796,0.010230647,0.000028046723],"about_ca_topic_score_codex":0.0008108215,"about_ca_topic_score_gemma":0.0004571917,"teacher_disagreement_score":0.004411939,"about_ca_system_score_codex":0.0008427279,"about_ca_system_score_gemma":0.00030860922,"threshold_uncertainty_score":0.014759421},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.41826555,0.0006676275,0.5708858,0.001120527,0.000055775527,0.0001094627,0.00049199763,0.0006094832,0.0077938493],"genre_scores_gemma":[0.9477969,0.00029597682,0.048964545,0.00010042781,0.00009942624,0.00015799,0.00046554406,0.00017836984,0.0019408236],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99782014,0.0005077659,0.00014036614,0.0003265921,0.000810272,0.00039489317],"domain_scores_gemma":[0.98249614,0.012504843,0.0011862528,0.0021300046,0.0010637654,0.00061905826],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0028168757,0.0007104205,0.0012836776,0.0026431659,0.0010867092,0.0033284586,0.0017347654,0.0010060085,0.005089826],"category_scores_gemma":[0.021728128,0.00046708243,0.0009067221,0.0017012998,0.004063959,0.008239667,0.0037451393,0.0024606579,0.0005112615],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0007891066,0.000075340926,0.0059972014,0.00030684896,0.00007383299,0.00017284404,0.00045709682,0.1590081,0.0072077825,0.7943396,0.0026014207,0.02897087],"study_design_scores_gemma":[0.000021813801,0.00006108009,0.0009295797,0.000021263199,0.00001883998,0.000056732802,0.00004630935,0.49200144,0.0028088992,0.50337607,0.0006273398,0.00003061649],"about_ca_topic_score_codex":0.0013057546,"about_ca_topic_score_gemma":0.0010976739,"teacher_disagreement_score":0.005089826,"about_ca_system_score_codex":0.002393486,"about_ca_system_score_gemma":0.0010369716,"threshold_uncertainty_score":0.017366052},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.88654065,0.00060094293,0.055792324,0.0040800646,0.00016231641,0.0001221939,0.0017021771,0.00090423675,0.050095063],"genre_scores_gemma":[0.98424983,0.00007034866,0.013642232,0.00013869995,0.000019948531,0.000068019355,0.00041749864,0.00006495437,0.0013284418],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99660385,0.0013686891,0.00016517502,0.000472742,0.0008091099,0.00058057223],"domain_scores_gemma":[0.9621177,0.027200196,0.0022758935,0.005477862,0.001953666,0.0009747086],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005338339,0.00058936886,0.000930219,0.0011772403,0.0013898384,0.0015743438,0.0016530708,0.0014206377,0.010354496],"category_scores_gemma":[0.04569506,0.00029391903,0.000641927,0.0013205104,0.002598516,0.0034830584,0.001398597,0.0018453599,0.00060329837],"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.0012526965,0.00046837665,0.01810681,0.0005764583,0.00017495749,0.0003143348,0.00082407374,0.17151144,0.0027688355,0.7573823,0.019600652,0.027018927],"study_design_scores_gemma":[0.0005225677,0.00018530228,0.003540766,0.00007922435,0.000052875905,0.00012803654,0.0006008792,0.46571624,0.0053817434,0.5181993,0.0055342545,0.000058697322],"about_ca_topic_score_codex":0.004490987,"about_ca_topic_score_gemma":0.005082643,"teacher_disagreement_score":0.010354496,"about_ca_system_score_codex":0.003046892,"about_ca_system_score_gemma":0.0026777175,"threshold_uncertainty_score":0.03463924},"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":"other","genre_gemma":"software","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"software","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.015491927,0.006426844,0.39967707,0.002250263,0.0018017871,0.00007935344,0.00083117565,0.003363534,0.5700781],"genre_scores_gemma":[0.21807213,0.006148192,0.18826449,0.0009804515,0.001443733,0.0001599484,0.001540313,0.0017220797,0.5816686],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99975556,0.000045944886,0.000007721279,0.000041773415,0.00011526906,0.00003375753],"domain_scores_gemma":[0.99981016,0.00007061475,0.000009904085,0.000037180744,0.000054985012,0.000017195045],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002842571,0.0006485568,0.00040453853,0.00070732547,0.0008036623,0.00175239,0.00044970258,0.00036248312,0.036883928],"category_scores_gemma":[0.001178942,0.0003412376,0.0005034423,0.0011077452,0.0006822142,0.0022231224,0.0009671444,0.0013745767,0.019739443],"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.00008560042,0.000034543962,0.0000953803,0.00022586455,0.000011926831,0.000106894855,0.00021101515,0.0038507502,0.0024178396,0.68101114,0.08598507,0.2259639],"study_design_scores_gemma":[0.00001196009,0.000041560656,0.00019045205,0.00010113934,0.000009995536,0.00032446516,0.00004548164,0.008865214,0.0038265756,0.44915473,0.5374023,0.00002611915],"about_ca_topic_score_codex":0.0008836536,"about_ca_topic_score_gemma":0.0011384999,"teacher_disagreement_score":0.036883928,"about_ca_system_score_codex":0.0009421909,"about_ca_system_score_gemma":0.0004577739,"threshold_uncertainty_score":0.123389006},"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":"software","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"software","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0013263241,0.003368192,0.43427342,0.0006655903,0.0010476408,0.00013739345,0.009927451,0.05386614,0.49538788],"genre_scores_gemma":[0.023486663,0.009050964,0.3419875,0.0011913095,0.00076785753,0.0007145124,0.025844133,0.04787063,0.5490864],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9994554,0.00005511184,0.000028412547,0.00009141128,0.00030325682,0.00006655471],"domain_scores_gemma":[0.9996282,0.0001084185,0.000017670904,0.000109238725,0.00009648423,0.000039941842],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00030774015,0.0017190932,0.0012944562,0.0029154797,0.0011720586,0.0033805575,0.002563913,0.0008952752,0.2988423],"category_scores_gemma":[0.0015523044,0.0012322294,0.0016976085,0.004988836,0.0007410259,0.0048680548,0.0033234577,0.0025892276,0.24935822],"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.000067677436,0.000041521616,0.00007579037,0.00062000134,0.00002151436,0.00007257781,0.000096625576,0.0025193708,0.0018752905,0.12142622,0.46923175,0.40395176],"study_design_scores_gemma":[0.000016163729,0.000010921532,0.000068996,0.00009880798,0.000008946222,0.00013883237,0.00002046417,0.0020813856,0.00220369,0.060129575,0.9351992,0.00002293763],"about_ca_topic_score_codex":0.00113396,"about_ca_topic_score_gemma":0.0018684079,"teacher_disagreement_score":0.2988423,"about_ca_system_score_codex":0.0008978538,"about_ca_system_score_gemma":0.0009963253,"threshold_uncertainty_score":0.99972713},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5062774,0.00062774454,0.3032072,0.0019347209,0.0006263584,0.00009273207,0.0001456645,0.0006128316,0.1864753],"genre_scores_gemma":[0.95005363,0.00022073083,0.03023449,0.0003954036,0.00009708754,0.00004953136,0.00007923473,0.0002786414,0.018591221],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9996567,0.000068907415,0.000018571332,0.000101620666,0.000087476095,0.00006672879],"domain_scores_gemma":[0.9996418,0.00007725147,0.0000655606,0.00008751869,0.00006915722,0.000058753903],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00048993627,0.00064060144,0.0004076221,0.0006834314,0.001482685,0.0016369598,0.0010385569,0.0008532034,0.008012468],"category_scores_gemma":[0.0018775279,0.00032893248,0.00058966805,0.00037841362,0.0031345082,0.004419811,0.0015007406,0.001912288,0.0012274459],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000020114396,0.000009502129,0.00029834977,0.000020915602,0.0000036864085,0.0001729112,0.00025332233,0.00069654745,0.001642596,0.9897747,0.00067108765,0.006436245],"study_design_scores_gemma":[0.000008904201,0.000027034686,0.00043265405,0.00002094489,0.000005698107,0.0002939625,0.00019213706,0.0062313383,0.0014709268,0.98700744,0.004294884,0.0000141150595],"about_ca_topic_score_codex":0.0010697498,"about_ca_topic_score_gemma":0.0012203611,"teacher_disagreement_score":0.008012468,"about_ca_system_score_codex":0.0007216532,"about_ca_system_score_gemma":0.0008905911,"threshold_uncertainty_score":0.026804388},"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":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.041116476,0.020446874,0.24553186,0.0014846321,0.0014125704,0.00006266575,0.00073604716,0.0018516234,0.68735737],"genre_scores_gemma":[0.40546656,0.017406723,0.07729973,0.0006741886,0.0024668956,0.00012385,0.0013173368,0.0012974757,0.49394724],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99978787,0.000034327284,0.000007653946,0.00003750316,0.000090776564,0.00004191483],"domain_scores_gemma":[0.99979645,0.000052587922,0.000018487704,0.000039792743,0.00005757434,0.000035157955],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000251354,0.0009394277,0.00061097014,0.0012088042,0.00068716315,0.001975541,0.000448272,0.00027279914,0.014031207],"category_scores_gemma":[0.0008825345,0.00039588698,0.0003303895,0.0016470733,0.00088521134,0.0024183195,0.0009420216,0.0016756074,0.007894131],"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.000027423675,0.000018157723,0.0000878384,0.00009188615,0.0000057561756,0.000038430007,0.00024679708,0.00134091,0.0024754468,0.90418655,0.022148121,0.06933262],"study_design_scores_gemma":[0.000007012168,0.000030397747,0.00020718307,0.000056824432,0.000008798358,0.00018361196,0.00009633354,0.0028256937,0.0022266714,0.80720854,0.18713148,0.000017490584],"about_ca_topic_score_codex":0.0006715309,"about_ca_topic_score_gemma":0.0012500605,"teacher_disagreement_score":0.014031207,"about_ca_system_score_codex":0.00079534674,"about_ca_system_score_gemma":0.00046369713,"threshold_uncertainty_score":0.046939075},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8304379,0.0004478212,0.11772549,0.0003111976,0.00007499683,0.000067794186,0.0001611735,0.000085885535,0.050687633],"genre_scores_gemma":[0.9817901,0.00023629783,0.009463395,0.000028258808,0.00005263434,0.000018144148,0.000115273004,0.000038311144,0.00825758],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993162,0.00010961615,0.000034980607,0.00010302966,0.0003019858,0.00013414757],"domain_scores_gemma":[0.99878615,0.00037914375,0.0002732273,0.000090032256,0.00022830452,0.00024314619],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004786181,0.0003580956,0.00044776552,0.0019191315,0.001075722,0.0020559856,0.000515907,0.00053036446,0.0052070334],"category_scores_gemma":[0.002193598,0.00021896741,0.00044472553,0.000589977,0.003062099,0.0027801793,0.0012711957,0.0013557393,0.00048253316],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000050173214,0.000025704932,0.0011399034,0.000042809963,0.0000050558797,0.00018534099,0.0004875107,0.004364116,0.003346821,0.9830057,0.00034744013,0.0069993837],"study_design_scores_gemma":[0.00002262461,0.000118089425,0.0029156408,0.000038777216,0.0000074382774,0.0005179781,0.0009926877,0.045553602,0.0049895076,0.93755233,0.0072513777,0.000039769162],"about_ca_topic_score_codex":0.0012520518,"about_ca_topic_score_gemma":0.0008821704,"teacher_disagreement_score":0.0052070334,"about_ca_system_score_codex":0.0009990585,"about_ca_system_score_gemma":0.00037036117,"threshold_uncertainty_score":0.017419279},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0018181751,0.055441134,0.11887813,0.0064259907,0.0020556021,0.00007544004,0.0028298246,0.0024765732,0.80999917],"genre_scores_gemma":[0.065272,0.065175295,0.0676724,0.002896598,0.0035960844,0.00024611244,0.006842432,0.0017693989,0.7865298],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.999398,0.00012346283,0.000030477091,0.00009181289,0.00031624964,0.000040014416],"domain_scores_gemma":[0.99944645,0.00024474142,0.000015926473,0.00013243087,0.00012664247,0.00003372187],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007026859,0.00064907776,0.00064010586,0.0012936994,0.0007131817,0.0027479776,0.0007109847,0.0004255305,0.08557081],"category_scores_gemma":[0.0016522824,0.0004444973,0.00057918596,0.0026762446,0.0012068248,0.003272483,0.0011506418,0.0022086578,0.044688974],"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.00001881508,0.0000225773,0.00013695567,0.0005635872,0.000025162499,0.000033359192,0.00020432587,0.00075545406,0.0005956981,0.3252985,0.4573738,0.21497177],"study_design_scores_gemma":[0.0000058269993,0.000010583864,0.00024445858,0.00013715813,0.000006271581,0.00011237862,0.000047443093,0.0009113905,0.00041109527,0.25345984,0.7446457,0.000007883705],"about_ca_topic_score_codex":0.0009850881,"about_ca_topic_score_gemma":0.0018478903,"teacher_disagreement_score":0.08557081,"about_ca_system_score_codex":0.0017109857,"about_ca_system_score_gemma":0.0012146403,"threshold_uncertainty_score":0.28626287},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06316336,0.00053090364,0.9217228,0.0003007359,0.0001400995,0.00015911517,0.00048698942,0.0026040715,0.010891831],"genre_scores_gemma":[0.31417266,0.00041881343,0.67726254,0.00015232012,0.000101819336,0.00022442217,0.0019502611,0.0004831605,0.0052339477],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991272,0.00020475198,0.00007346544,0.00014651062,0.00023989032,0.00020812219],"domain_scores_gemma":[0.9979644,0.001004365,0.000116552386,0.00041158195,0.00036613172,0.00013688483],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012067546,0.0011436521,0.0010051808,0.0016525782,0.0009694189,0.0033247862,0.0021223389,0.0009370562,0.011289469],"category_scores_gemma":[0.005487742,0.00054044824,0.0011688125,0.0021782904,0.0008954232,0.0038384537,0.0032884972,0.002136033,0.00363018],"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.0009793361,0.00038381224,0.0019824777,0.00048294957,0.00011388184,0.00014302398,0.0005957634,0.052144967,0.011250357,0.28633997,0.011284319,0.63429916],"study_design_scores_gemma":[0.0002598826,0.00014035092,0.0005092121,0.00011220506,0.00008259473,0.00011912529,0.0004329782,0.25436875,0.01454596,0.7188209,0.0105539225,0.0000541609],"about_ca_topic_score_codex":0.0016362718,"about_ca_topic_score_gemma":0.0046855723,"teacher_disagreement_score":0.011289469,"about_ca_system_score_codex":0.0012123834,"about_ca_system_score_gemma":0.0015047336,"threshold_uncertainty_score":0.037767053},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.007611919,0.10139621,0.64293545,0.111886956,0.0036068913,0.00014818959,0.00047351932,0.0022905904,0.1296503],"genre_scores_gemma":[0.23017839,0.09641236,0.60403496,0.025419664,0.014871115,0.0006075656,0.0011091655,0.001297691,0.026069148],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99160516,0.0040798364,0.00044104946,0.0010459556,0.0024555277,0.00037244402],"domain_scores_gemma":[0.9859006,0.010754599,0.0003347783,0.0018725246,0.00068670994,0.00045081903],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0069053066,0.0014098891,0.0018818016,0.0036295059,0.0022471873,0.011132302,0.0025066887,0.0039897854,0.014216069],"category_scores_gemma":[0.0146686565,0.0015087855,0.001957601,0.0033540176,0.014491813,0.02977337,0.008556506,0.014734593,0.004653939],"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.000024037563,0.000017962557,0.00015717151,0.00022327308,0.000029360634,0.00006903985,0.00026100903,0.0010358907,0.00031798487,0.95921034,0.007398628,0.031255376],"study_design_scores_gemma":[0.000016202197,0.000017158982,0.00009194607,0.00019202905,0.00001188151,0.00013289039,0.00008622103,0.0040268353,0.00023217865,0.92588085,0.069286615,0.000025280082],"about_ca_topic_score_codex":0.001381312,"about_ca_topic_score_gemma":0.0016238852,"teacher_disagreement_score":0.014216069,"about_ca_system_score_codex":0.0023280215,"about_ca_system_score_gemma":0.0025856136,"threshold_uncertainty_score":0.047557473},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5770567,0.0002678818,0.35442466,0.0024312222,0.0001022888,0.00012002933,0.00093786384,0.0012855493,0.06337384],"genre_scores_gemma":[0.9582274,0.00009956577,0.03050848,0.00026929204,0.00006725428,0.00009748387,0.00076792773,0.00013542325,0.009827187],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9979479,0.00034458708,0.00014275732,0.00063620805,0.0005573711,0.0003712634],"domain_scores_gemma":[0.99600816,0.001762719,0.00045016062,0.0009459147,0.0004974524,0.00033556976],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001063011,0.00027588842,0.0005810941,0.0007236321,0.0018102007,0.0032163847,0.0011208171,0.00082077563,0.004815213],"category_scores_gemma":[0.004651996,0.00040386192,0.0013944821,0.00083144783,0.003449156,0.0050229607,0.0030594962,0.0023006247,0.0008473724],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000047073558,0.000023752566,0.0008018586,0.00002772833,0.000007423965,0.0001236279,0.00049856474,0.0025235151,0.0019817017,0.9882719,0.00056125055,0.005131545],"study_design_scores_gemma":[0.00002226534,0.000028025815,0.00037288936,0.000011970196,0.0000143143225,0.0000884412,0.00021524739,0.010116996,0.0026596838,0.9812788,0.005176064,0.000015240656],"about_ca_topic_score_codex":0.0021555123,"about_ca_topic_score_gemma":0.0022633646,"teacher_disagreement_score":0.004815213,"about_ca_system_score_codex":0.0023898534,"about_ca_system_score_gemma":0.0012430027,"threshold_uncertainty_score":0.017339647},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.17497435,0.00037643893,0.729737,0.0028327652,0.00014216956,0.0003188539,0.00071615126,0.0004268499,0.090475544],"genre_scores_gemma":[0.9238483,0.00030003587,0.057047136,0.00038572348,0.00010305081,0.00037084604,0.00035465515,0.000065330765,0.017525015],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99876773,0.00050665496,0.00007078365,0.00023476781,0.00025661325,0.00016341817],"domain_scores_gemma":[0.9987564,0.0006047076,0.0001691245,0.00018033506,0.000158639,0.00013086102],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010938565,0.0005728004,0.00059650134,0.0005023616,0.0009549632,0.0015688079,0.0013320227,0.0009430558,0.008136587],"category_scores_gemma":[0.0026000722,0.0002291833,0.00074179604,0.0006646053,0.0024351706,0.003450179,0.0017605108,0.0013597996,0.00053997914],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000012731635,0.000011673482,0.00008471336,0.000019291174,0.0000055105984,0.000045899782,0.00008438021,0.004397576,0.00048613033,0.99302906,0.00041043074,0.0014125684],"study_design_scores_gemma":[0.00003394692,0.0000191982,0.0001122818,0.000007050846,0.0000067609412,0.000041241536,0.00006769493,0.086299315,0.0005815867,0.9100928,0.0027263816,0.000011771976],"about_ca_topic_score_codex":0.0024283957,"about_ca_topic_score_gemma":0.0023125042,"teacher_disagreement_score":0.008136587,"about_ca_system_score_codex":0.0016485732,"about_ca_system_score_gemma":0.0010932502,"threshold_uncertainty_score":0.027219653},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.019542169,0.00033449195,0.9650059,0.00024171764,0.00008210801,0.00006821804,0.00011342581,0.0019608366,0.012651175],"genre_scores_gemma":[0.33508933,0.00072706153,0.6534731,0.00019688117,0.00012306511,0.00022370002,0.00079754554,0.001072104,0.008297169],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99851507,0.0003114964,0.000090853755,0.00023170048,0.0005898144,0.0002611302],"domain_scores_gemma":[0.9980263,0.0006870725,0.00009793051,0.00064546725,0.00046618425,0.00007710604],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001168133,0.00065952283,0.00067129993,0.0007196653,0.00089695555,0.0015377004,0.0010629193,0.00040330272,0.008217035],"category_scores_gemma":[0.005189765,0.00038843937,0.00095209474,0.0017440885,0.0011995438,0.0020612276,0.0018565172,0.0011921767,0.0021663846],"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.0005696839,0.00013744172,0.0016715716,0.00041753694,0.00006402749,0.00028557482,0.0006760062,0.26434994,0.026863808,0.2820887,0.012324982,0.4105509],"study_design_scores_gemma":[0.000075865864,0.00007042886,0.00025257096,0.00003172226,0.000019049654,0.00010281837,0.00009094021,0.84143585,0.0160903,0.1251385,0.01667297,0.000018946435],"about_ca_topic_score_codex":0.005040182,"about_ca_topic_score_gemma":0.005309349,"teacher_disagreement_score":0.008217035,"about_ca_system_score_codex":0.0010485961,"about_ca_system_score_gemma":0.0009522394,"threshold_uncertainty_score":0.027488708},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.71136695,0.0009212528,0.11419895,0.0037405407,0.00059643725,0.000058738184,0.0002707553,0.00032352854,0.16852282],"genre_scores_gemma":[0.95277387,0.00031996204,0.0073740873,0.00027548446,0.00038118288,0.00003062004,0.00018809104,0.000098432385,0.03855836],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99973506,0.000049457718,0.000010144073,0.00004137592,0.000087236105,0.000076700446],"domain_scores_gemma":[0.9997993,0.000034921566,0.000033471002,0.000018819917,0.000045852343,0.00006759562],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003626829,0.00077375607,0.0011758483,0.0015807224,0.0012060198,0.0026639022,0.0011165157,0.0018638782,0.006539216],"category_scores_gemma":[0.001162132,0.00028641766,0.00078728475,0.00087369396,0.0022026917,0.0022007767,0.00206911,0.0019633071,0.00082927744],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003534223,0.000042241947,0.00016455716,0.000025259134,0.000011579725,0.00016340133,0.00010634076,0.0032212983,0.0016313018,0.99068063,0.0008663167,0.0030516007],"study_design_scores_gemma":[0.000036787,0.000029531688,0.00035280228,0.000013839046,0.000009298303,0.0002333291,0.00016668825,0.04362188,0.00063140213,0.9527277,0.0021517323,0.000025047686],"about_ca_topic_score_codex":0.001308994,"about_ca_topic_score_gemma":0.0011946548,"teacher_disagreement_score":0.006539216,"about_ca_system_score_codex":0.001500352,"about_ca_system_score_gemma":0.0007822485,"threshold_uncertainty_score":0.021875918},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12669417,0.0030422057,0.775226,0.002363636,0.0013071493,0.00056282745,0.0023145017,0.03525517,0.05323438],"genre_scores_gemma":[0.5330157,0.0005270634,0.4256598,0.00074765494,0.00039128037,0.0005426658,0.0023810468,0.0034357968,0.03329903],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9943158,0.0010159356,0.00034560557,0.00084944285,0.0022492008,0.0012239036],"domain_scores_gemma":[0.9908041,0.0029607273,0.00031697346,0.0038267917,0.0015975293,0.00049397035],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0023801473,0.002780646,0.0027265316,0.0027007845,0.0025360484,0.0050630914,0.004552326,0.002265696,0.046187207],"category_scores_gemma":[0.008944504,0.0010978684,0.0023548845,0.005453031,0.0023891416,0.008769678,0.008057634,0.0031638998,0.010242355],"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.0052142018,0.0004961375,0.0028920118,0.00095467386,0.00040119357,0.0005043602,0.00046990873,0.040206477,0.022663023,0.11484583,0.07921617,0.73213595],"study_design_scores_gemma":[0.0009958844,0.0005779071,0.0019051695,0.00021280735,0.00047460178,0.00063057814,0.00044230366,0.5119076,0.040625196,0.4034542,0.038558774,0.00021494615],"about_ca_topic_score_codex":0.004835374,"about_ca_topic_score_gemma":0.010432845,"teacher_disagreement_score":0.046187207,"about_ca_system_score_codex":0.0035249372,"about_ca_system_score_gemma":0.004103562,"threshold_uncertainty_score":0.15451157},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4132033,0.0039412077,0.36018103,0.0027502624,0.00032893015,0.00015243934,0.00060780917,0.0003998726,0.21843521],"genre_scores_gemma":[0.9444957,0.0014437991,0.030680701,0.00037281495,0.0002828987,0.0001169939,0.00043799766,0.00011067426,0.022058504],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99915075,0.00020963985,0.000038583188,0.00021026796,0.00026667654,0.00012401966],"domain_scores_gemma":[0.9990017,0.00048255603,0.00009214658,0.0001671692,0.00016913393,0.000087272674],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008503481,0.00034127897,0.0005216303,0.00091559894,0.0010767699,0.0016194816,0.0004653712,0.0004912569,0.0050247675],"category_scores_gemma":[0.0027016322,0.0002929223,0.00054837915,0.0008515311,0.0035365885,0.0027213101,0.0020159676,0.0015171805,0.0006059013],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000007429611,0.0000034524053,0.00014409251,0.000023474766,0.0000031823467,0.000026275327,0.00021255338,0.0008235029,0.0005888987,0.9951847,0.00048246767,0.0025000942],"study_design_scores_gemma":[0.0000094372,0.000014826679,0.00022807882,0.000017393926,0.0000065145286,0.00008008664,0.00011542907,0.0069177374,0.00052742404,0.98477745,0.0072983243,0.0000073719943],"about_ca_topic_score_codex":0.001266009,"about_ca_topic_score_gemma":0.0009164006,"teacher_disagreement_score":0.0050247675,"about_ca_system_score_codex":0.0012271806,"about_ca_system_score_gemma":0.00057615986,"threshold_uncertainty_score":0.016809523},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.79607207,0.00078406534,0.082124725,0.0017953749,0.00070002035,0.000055897206,0.00017129144,0.0004278255,0.11786874],"genre_scores_gemma":[0.9760761,0.0001884677,0.0063559674,0.00026347215,0.0002125636,0.000030694206,0.0000560168,0.00007041214,0.016746303],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9996382,0.00005556887,0.0000138531095,0.00008729955,0.000105771076,0.0000992293],"domain_scores_gemma":[0.99979514,0.00002601342,0.00002474298,0.00003386922,0.000052772288,0.000067442474],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00043189002,0.00043622582,0.00033666703,0.00066061557,0.0011000108,0.0012105649,0.00043305857,0.00051645905,0.0076132403],"category_scores_gemma":[0.0005835815,0.00019347495,0.00048732583,0.00034783207,0.0024773402,0.0023065228,0.001431235,0.0010398999,0.001098244],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003326572,0.00001562665,0.000098862234,0.00001514311,0.0000027612657,0.0001003471,0.00022682987,0.00029662615,0.0043647825,0.99094087,0.00041373706,0.0034911712],"study_design_scores_gemma":[0.00003357382,0.00007194838,0.0002920216,0.000013420215,0.0000048867864,0.00028346115,0.00023661603,0.002911869,0.00487557,0.9843403,0.006910731,0.000025675647],"about_ca_topic_score_codex":0.0007048653,"about_ca_topic_score_gemma":0.00037305767,"teacher_disagreement_score":0.0076132403,"about_ca_system_score_codex":0.001077959,"about_ca_system_score_gemma":0.00062159303,"threshold_uncertainty_score":0.025468826},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7020085,0.00046035432,0.278964,0.0002928697,0.00008693573,0.00016018623,0.0004408402,0.0012741556,0.016312202],"genre_scores_gemma":[0.9585674,0.00013089059,0.038731635,0.000033453307,0.000032203043,0.000038645274,0.00046431902,0.00019699027,0.0018045409],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99946433,0.00009167855,0.0000340794,0.000107329055,0.0001744653,0.00012815333],"domain_scores_gemma":[0.99646205,0.0022887257,0.00028341357,0.00024691282,0.0004945666,0.00022440843],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000718577,0.0008557526,0.0009953585,0.0041557997,0.0010776339,0.0021642519,0.0010637282,0.00070219784,0.008152959],"category_scores_gemma":[0.0070254346,0.0005687358,0.000616158,0.001329703,0.0021263894,0.0031120647,0.0018276906,0.0014504443,0.00084285357],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0012497115,0.00038387164,0.0156029435,0.000721573,0.00017477677,0.0008630216,0.0014905141,0.11011894,0.02021534,0.6896685,0.008215861,0.15129498],"study_design_scores_gemma":[0.00009377921,0.00013444555,0.0011934395,0.00006910507,0.000057646906,0.00009051936,0.00037627053,0.22766013,0.010358943,0.7581375,0.0017986164,0.00002958259],"about_ca_topic_score_codex":0.0017827257,"about_ca_topic_score_gemma":0.0028741593,"teacher_disagreement_score":0.008152959,"about_ca_system_score_codex":0.0012334196,"about_ca_system_score_gemma":0.0007747163,"threshold_uncertainty_score":0.02727437},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0053197793,0.00006255227,0.9904722,0.000047552563,0.000023895065,0.00002086959,0.000019380324,0.00014133702,0.0038925628],"genre_scores_gemma":[0.24721101,0.00033928463,0.74697894,0.000117307085,0.00008466203,0.0001538211,0.000116667354,0.00047636023,0.004521923],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990553,0.0002672157,0.00004346596,0.000063024876,0.00047930828,0.00009163824],"domain_scores_gemma":[0.9983187,0.00083297404,0.00012777899,0.00032675962,0.0003095578,0.00008427668],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0022228602,0.00047752418,0.00072257704,0.001139528,0.00078654726,0.0015892418,0.001080217,0.0005444618,0.0052691633],"category_scores_gemma":[0.0069528967,0.0002936163,0.00078253413,0.0011381914,0.0013402541,0.0017932574,0.0014485312,0.0015913608,0.0011507114],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006537842,0.000039789407,0.00051244296,0.00006670071,0.00002630476,0.00008649281,0.00012654178,0.11183267,0.0032773116,0.8418247,0.0009947384,0.04114697],"study_design_scores_gemma":[0.000014954511,0.000021489095,0.000106932006,0.000021649397,0.000008076761,0.00005579362,0.000016893773,0.8575784,0.0023195245,0.13656832,0.0032756336,0.000012283532],"about_ca_topic_score_codex":0.001812839,"about_ca_topic_score_gemma":0.0028442752,"teacher_disagreement_score":0.0052691633,"about_ca_system_score_codex":0.0011176633,"about_ca_system_score_gemma":0.0011846189,"threshold_uncertainty_score":0.01762712},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04068487,0.00022701203,0.9421075,0.00049785717,0.00017092677,0.00006307415,0.00009679723,0.000596617,0.01555536],"genre_scores_gemma":[0.59241456,0.00047426362,0.3829621,0.00026375873,0.00023917909,0.00016515999,0.00031394255,0.0005090922,0.022657854],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99974376,0.00006946565,0.000009690534,0.000035229168,0.000107770626,0.000034190445],"domain_scores_gemma":[0.99932075,0.00039195025,0.00003200753,0.00010881331,0.0000987697,0.000047749967],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00036871547,0.00062841043,0.0006907531,0.000723958,0.00065061834,0.0008057837,0.001017643,0.00081285444,0.010877238],"category_scores_gemma":[0.0029564437,0.00031009535,0.0005711886,0.0007550842,0.0010190046,0.0017445459,0.002049677,0.0024546399,0.0015341552],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00019058862,0.00022212169,0.0007024458,0.00034232484,0.00007092611,0.00019681387,0.00040099057,0.13242765,0.013701366,0.5758477,0.012170881,0.2637262],"study_design_scores_gemma":[0.000041188774,0.00007517902,0.00014071018,0.000020445417,0.000015240559,0.00007270816,0.000109220244,0.5738568,0.003358897,0.41663474,0.0056578754,0.000016956183],"about_ca_topic_score_codex":0.0012686538,"about_ca_topic_score_gemma":0.0029040885,"teacher_disagreement_score":0.010877238,"about_ca_system_score_codex":0.00041468005,"about_ca_system_score_gemma":0.00053365086,"threshold_uncertainty_score":0.03638804},"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":"other","genre_gemma":"editorial","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"editorial","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00045149698,0.014706423,0.0025739525,0.10574765,0.3630141,0.0002366651,0.0022038934,0.0010390489,0.5100268],"genre_scores_gemma":[0.0015334586,0.0031704505,0.0005681521,0.027277214,0.03535893,0.00010609712,0.0009776433,0.00048126356,0.9305268],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99910957,0.00011625262,0.000041998876,0.00014089055,0.00048317507,0.000107997854],"domain_scores_gemma":[0.99653697,0.00048497086,0.00015394576,0.00024727028,0.001636591,0.00094031275],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011303293,0.00092044426,0.0008058667,0.0016975761,0.0019020052,0.004131266,0.001304785,0.0028266232,0.4362795],"category_scores_gemma":[0.007943937,0.000275532,0.0005991183,0.001007404,0.0007286665,0.0028165076,0.0025977693,0.004077687,0.4581577],"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.000011435588,0.0000063226353,0.000019015748,0.00004254594,9.959274e-7,0.000013879831,0.000010096578,0.000007095976,0.000064401946,0.0019056135,0.9761237,0.021794919],"study_design_scores_gemma":[0.0000036795082,0.000006514298,0.000057074107,0.0000652326,0.0000013257238,0.00002917121,0.000015634623,0.000009282069,0.0000513205,0.0012745125,0.9984841,0.0000022956706],"about_ca_topic_score_codex":0.0019277747,"about_ca_topic_score_gemma":0.0037931597,"teacher_disagreement_score":0.4362795,"about_ca_system_score_codex":0.0016747,"about_ca_system_score_gemma":0.0024673797,"threshold_uncertainty_score":0},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.94054216,0.00023300582,0.032931224,0.00029470597,0.00003540803,0.00001846635,0.0000569802,0.000055244436,0.025832748],"genre_scores_gemma":[0.9881125,0.0000917202,0.008230392,0.00004244544,0.000017972669,0.00002237379,0.000057145193,0.000018177485,0.0034072665],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9998411,0.000031703246,0.00000763483,0.000033829034,0.000049905946,0.00003575468],"domain_scores_gemma":[0.9998085,0.000049381604,0.000054081273,0.000027515896,0.000026127464,0.000034370376],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001596916,0.00031541826,0.00026497274,0.00056237396,0.00095600786,0.0012400239,0.0006606174,0.00052432664,0.00379211],"category_scores_gemma":[0.00072019873,0.00016600982,0.00037318608,0.00035106388,0.001699532,0.0013122645,0.0008627397,0.0006890157,0.00029754455],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002690572,0.000014627814,0.00097387674,0.000032048898,0.0000049456457,0.00021900945,0.00017329966,0.0060439203,0.004080321,0.9845658,0.00030132188,0.0035638548],"study_design_scores_gemma":[0.000021524364,0.00004896986,0.0017634665,0.000020418307,0.0000074438435,0.0003860589,0.0004817152,0.05786141,0.003903918,0.9333295,0.0021500052,0.000025595498],"about_ca_topic_score_codex":0.0013122038,"about_ca_topic_score_gemma":0.0014037958,"teacher_disagreement_score":0.00379211,"about_ca_system_score_codex":0.0007096558,"about_ca_system_score_gemma":0.0004927398,"threshold_uncertainty_score":0.012685835},"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":"other","genre_gemma":"software","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"software","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.002837495,0.007447772,0.28804967,0.0013742141,0.0020428686,0.00007854699,0.0019942063,0.009288127,0.6868871],"genre_scores_gemma":[0.06684357,0.016092448,0.20953998,0.001262147,0.0035709115,0.00025794137,0.00643683,0.0070196255,0.6889766],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9994665,0.00007360204,0.000037423768,0.000090361966,0.0002930029,0.000039145973],"domain_scores_gemma":[0.9996549,0.00009024196,0.000021487907,0.00011077416,0.00008778431,0.00003476269],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00048048244,0.0010089913,0.0009598232,0.0027227146,0.0011566035,0.003117199,0.001506627,0.0006116868,0.08699134],"category_scores_gemma":[0.0014329788,0.00076118077,0.001210525,0.004508459,0.0010852121,0.005198272,0.0017561067,0.003128912,0.070161425],"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.00006475901,0.000042366846,0.000082214516,0.0003843391,0.000020753332,0.0000710825,0.00012224169,0.0011166616,0.002381731,0.4881904,0.16226591,0.3452576],"study_design_scores_gemma":[0.0000143216885,0.000015965574,0.00012311107,0.000096934564,0.000014800537,0.00027653668,0.000020705884,0.0019963146,0.002644676,0.30043438,0.69434166,0.000020712283],"about_ca_topic_score_codex":0.0005410856,"about_ca_topic_score_gemma":0.00088632706,"teacher_disagreement_score":0.08699134,"about_ca_system_score_codex":0.0010219091,"about_ca_system_score_gemma":0.0009176225,"threshold_uncertainty_score":0.29101503},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.021572517,0.00034004106,0.95084053,0.00027406475,0.0003178073,0.00009526175,0.00008570503,0.0012626362,0.025211401],"genre_scores_gemma":[0.32649374,0.00094915717,0.63490623,0.0004153944,0.00042741696,0.00023004746,0.00051944336,0.0017172327,0.034341373],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99818355,0.0003296458,0.00008482507,0.0005161721,0.0006880955,0.00019760337],"domain_scores_gemma":[0.9983072,0.00064933795,0.000086171465,0.0005402652,0.00033583728,0.000081194295],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012353603,0.0008918021,0.0010274579,0.0015148607,0.0014703128,0.0024995795,0.0011548107,0.0006653842,0.014175578],"category_scores_gemma":[0.0074493736,0.00052230794,0.0013180508,0.0013933119,0.0021952947,0.0046231924,0.0025399283,0.0027570429,0.0059705474],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013403408,0.00004633777,0.0004007778,0.00008038613,0.000018371855,0.00017540708,0.00024535155,0.009527991,0.0064467085,0.84223074,0.003827412,0.13686638],"study_design_scores_gemma":[0.000023594814,0.000039070364,0.00016275872,0.000026403852,0.00001530426,0.00028088974,0.000054984033,0.06379116,0.015199521,0.90274626,0.01763579,0.000024325182],"about_ca_topic_score_codex":0.0005202742,"about_ca_topic_score_gemma":0.0004848186,"teacher_disagreement_score":0.014175578,"about_ca_system_score_codex":0.00094753917,"about_ca_system_score_gemma":0.0006255142,"threshold_uncertainty_score":0.04742199},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.50417227,0.0009802253,0.4199788,0.0015305121,0.0003347637,0.000085399704,0.00029291256,0.0003136185,0.07231137],"genre_scores_gemma":[0.9710704,0.00031840472,0.020282853,0.00009876406,0.00022581762,0.000031728843,0.00010811747,0.000045221448,0.007818661],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992218,0.00027510652,0.00003883245,0.0001371517,0.00023559578,0.000091534705],"domain_scores_gemma":[0.9988986,0.00034789983,0.00026397273,0.00014034135,0.00019035251,0.00015873577],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00063391577,0.0003701453,0.00040591668,0.0005548373,0.0006497688,0.0012286742,0.00033379262,0.0003239611,0.005445849],"category_scores_gemma":[0.0033900072,0.00018267587,0.00041980293,0.0003480316,0.0030997498,0.0024683655,0.0026692396,0.001604727,0.00039254496],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001195609,0.000004685284,0.00021632895,0.000017028495,0.0000042162546,0.0000758367,0.00021092044,0.003665468,0.00082927954,0.99087596,0.00042398434,0.0036643215],"study_design_scores_gemma":[0.000012398478,0.000032903383,0.00028929155,0.000012329452,0.000004606692,0.00013306022,0.00010932778,0.034294706,0.0007713166,0.95961523,0.0047105863,0.000014185606],"about_ca_topic_score_codex":0.000453941,"about_ca_topic_score_gemma":0.00043389096,"teacher_disagreement_score":0.005445849,"about_ca_system_score_codex":0.00084176037,"about_ca_system_score_gemma":0.0004171756,"threshold_uncertainty_score":0.01821816},"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.005959963,0.008100785,0.025364496,0.011266294,0.0012670569,0.000022282884,0.00014406993,0.00012718394,0.9477478],"genre_scores_gemma":[0.43549818,0.0072494494,0.012792829,0.0052116923,0.0031221164,0.00019081155,0.0003406473,0.0005474956,0.5350469],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988176,0.00035973737,0.000029999492,0.0003406578,0.00030461792,0.00014733674],"domain_scores_gemma":[0.99895465,0.0003663256,0.00006246399,0.00033536114,0.00018008568,0.00010101285],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010314618,0.0007263003,0.0009941179,0.0016357765,0.004280234,0.006211153,0.0012866362,0.002854447,0.047994453],"category_scores_gemma":[0.004097214,0.00039892606,0.000582792,0.0013411804,0.012639252,0.014067602,0.005145027,0.0053308066,0.009903658],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000019582963,0.0000013064387,0.000008071893,0.000005716573,7.3677836e-7,0.000006219655,0.00013274692,0.000022964154,0.000011604208,0.99547344,0.0026157799,0.0017194495],"study_design_scores_gemma":[0.0000018524541,0.0000017105951,0.000015986912,0.000019138519,9.788632e-7,0.000017598155,0.00009705764,0.00006938527,0.000020921456,0.96497613,0.03477709,0.000002131253],"about_ca_topic_score_codex":0.0014629867,"about_ca_topic_score_gemma":0.001308235,"teacher_disagreement_score":0.047994453,"about_ca_system_score_codex":0.0030521657,"about_ca_system_score_gemma":0.0011805784,"threshold_uncertainty_score":0.16055751},"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.18710639,0.0067621814,0.11477888,0.022766426,0.008327507,0.000108716755,0.0010372698,0.000863708,0.6582489],"genre_scores_gemma":[0.8467364,0.002649855,0.051563002,0.0035304322,0.0021375683,0.00011661658,0.00042386216,0.00038502915,0.09245729],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992719,0.00021637793,0.000043690852,0.00015354692,0.00016182021,0.00015269805],"domain_scores_gemma":[0.9992436,0.00024042744,0.000095446,0.00017149211,0.00017639234,0.000072700735],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008755774,0.00052210514,0.0007243621,0.0016960058,0.0026836568,0.005119594,0.0010742372,0.0014648694,0.013167748],"category_scores_gemma":[0.0027296802,0.00034967586,0.0004816417,0.0023067717,0.0034415415,0.0057765893,0.001838899,0.003572194,0.0029966247],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000049157592,0.000003930258,0.000045892815,0.00001995531,0.0000020377022,0.000049276816,0.000102538455,0.00010262318,0.00038273205,0.9916973,0.0026773615,0.0048672818],"study_design_scores_gemma":[0.00003582244,0.000026675716,0.00025931012,0.000044167402,0.000016645783,0.0002593544,0.00019678663,0.0012847944,0.00088762527,0.94092256,0.056047022,0.00001919984],"about_ca_topic_score_codex":0.0021107108,"about_ca_topic_score_gemma":0.0020695215,"teacher_disagreement_score":0.013167748,"about_ca_system_score_codex":0.001377808,"about_ca_system_score_gemma":0.0009241056,"threshold_uncertainty_score":0.044050455},"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12660822,0.032788195,0.31719953,0.05412429,0.0037145263,0.000029505994,0.00041274502,0.0004629297,0.46466008],"genre_scores_gemma":[0.88634217,0.016310329,0.035859335,0.004204026,0.006071249,0.000073659874,0.00016906045,0.00047333984,0.05049679],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9982121,0.00068959274,0.000084564585,0.00035260117,0.0005225258,0.0001385827],"domain_scores_gemma":[0.9976756,0.0012997381,0.00019712176,0.00025397135,0.00038008534,0.00019349408],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021361988,0.00074027525,0.00054286263,0.0015382101,0.0023678085,0.005511273,0.0009877355,0.0010993043,0.0046824226],"category_scores_gemma":[0.0045577963,0.00042085155,0.00047443216,0.0019356535,0.011040694,0.015099955,0.0028363883,0.004096759,0.0008094123],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000004196853,0.0000023297623,0.000055307955,0.0000135855025,0.0000015821538,0.000017009628,0.000085720574,0.00013441646,0.00010312302,0.9957029,0.0009439098,0.0029358433],"study_design_scores_gemma":[0.0000042423494,0.00001963398,0.00029315698,0.000027928649,0.0000039207866,0.0001965087,0.00022253382,0.0011366897,0.0003799586,0.9408391,0.056861825,0.0000144532],"about_ca_topic_score_codex":0.0007254885,"about_ca_topic_score_gemma":0.00047160644,"teacher_disagreement_score":0.005511273,"about_ca_system_score_codex":0.001495347,"about_ca_system_score_gemma":0.0004152168,"threshold_uncertainty_score":0.01566428},"labels":[],"label_agreement":null},{"id":"W3157206289","doi":"10.1090/mcom/3782","title":"Tropical tangents for complete intersection curves","year":2022,"lang":"en","type":"article","venue":"Mathematics of Computation","topic":"Polynomial and algebraic computation","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Algorithm; Annotation; Artificial intelligence; Type (biology); Computer science; Intersection (aeronautics); Mathematics; Biology","score_opus":0.033607072665031726,"score_gpt":0.2703136146455875,"score_spread":0.2367065419805558,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3157206289","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.39034387,0.0010128592,0.28989607,0.0024480429,0.0007049202,0.00022341587,0.0015142853,0.0013520961,0.31250444],"genre_scores_gemma":[0.911842,0.0009210989,0.03034036,0.00029797008,0.00032528862,0.00014994497,0.0010612091,0.0007338341,0.054328308],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.998667,0.00021268896,0.000076308876,0.00027315068,0.0004342017,0.00033662634],"domain_scores_gemma":[0.9983125,0.0002957955,0.00022193583,0.00014167298,0.00067473797,0.00035338703],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009297118,0.0006242385,0.0005010725,0.0027226147,0.00223713,0.0034801334,0.0007884676,0.00060378504,0.018958045],"category_scores_gemma":[0.0032657785,0.00033870825,0.0009978438,0.0019598773,0.0027983403,0.006052207,0.003245999,0.0021303114,0.0029950507],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000020448957,0.0000105487725,0.00023610426,0.000023592902,0.000005415857,0.00009324404,0.00041697657,0.0006776526,0.0006006195,0.99157214,0.0012514953,0.0050917533],"study_design_scores_gemma":[0.00003114559,0.00009071982,0.0012205747,0.000053109226,0.000021669617,0.00032590298,0.0016068316,0.009208367,0.0030550552,0.93721074,0.04712261,0.00005329208],"about_ca_topic_score_codex":0.0047744317,"about_ca_topic_score_gemma":0.0023751582,"teacher_disagreement_score":0.018958045,"about_ca_system_score_codex":0.002323829,"about_ca_system_score_gemma":0.0009704715,"threshold_uncertainty_score":0.06342095},"labels":[],"label_agreement":null},{"id":"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11974071,0.0006302468,0.86167306,0.00030312926,0.00031105525,0.000038067094,0.00006550625,0.0007496217,0.016488522],"genre_scores_gemma":[0.796854,0.00049425504,0.19405562,0.00014570175,0.00015025918,0.000028760836,0.000110785935,0.0004965294,0.0076641277],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9996358,0.00008610981,0.000022183585,0.000058575697,0.00015263002,0.000044648354],"domain_scores_gemma":[0.9986914,0.0005713931,0.00007705043,0.00017773737,0.00037562285,0.0001068417],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014396604,0.0004531207,0.0005145307,0.0020448908,0.000553517,0.0013417355,0.00079035346,0.0005167592,0.003839342],"category_scores_gemma":[0.006772846,0.00017674346,0.00044071884,0.00070225337,0.0013237308,0.0025526711,0.0011203251,0.0011208118,0.00072371966],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010427092,0.00005177665,0.0011877416,0.00011822082,0.00002140136,0.00034234143,0.00022144536,0.039956458,0.009437511,0.89199656,0.0021974668,0.05436482],"study_design_scores_gemma":[0.000015170785,0.000058959664,0.00037873216,0.000024258155,0.0000074797917,0.00018108262,0.000052887757,0.48016435,0.0054842946,0.50874186,0.0048678177,0.000023162089],"about_ca_topic_score_codex":0.0010834768,"about_ca_topic_score_gemma":0.0009120118,"teacher_disagreement_score":0.003839342,"about_ca_system_score_codex":0.0011001765,"about_ca_system_score_gemma":0.000489115,"threshold_uncertainty_score":0.012843907},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.14768301,0.0013709723,0.739362,0.0041265003,0.00074866,0.00050861633,0.00075760344,0.008595126,0.0968475],"genre_scores_gemma":[0.7316556,0.0007265639,0.23270583,0.00076108536,0.0006060014,0.00055847166,0.0016273771,0.0022311083,0.029127993],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9930815,0.0015500694,0.00049148576,0.0010727391,0.0024309552,0.0013733115],"domain_scores_gemma":[0.98550725,0.0072326786,0.00061447744,0.005139254,0.0012035883,0.00030278557],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0038430968,0.0015018363,0.00255279,0.0019886256,0.002751589,0.0072649135,0.0045638992,0.0016628221,0.028647685],"category_scores_gemma":[0.013303893,0.0013715384,0.0029791896,0.0035408863,0.0037194567,0.017971763,0.0068654227,0.004004751,0.0048248493],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0017116459,0.0004439496,0.0018642981,0.0004744442,0.00019078908,0.00037368888,0.0007894582,0.028977767,0.013655838,0.7843348,0.018983945,0.14819941],"study_design_scores_gemma":[0.00034301626,0.00016108877,0.00066974224,0.000057748188,0.00018792729,0.00017949291,0.00023404107,0.15650262,0.026564877,0.80383223,0.011153906,0.000113376875],"about_ca_topic_score_codex":0.004437031,"about_ca_topic_score_gemma":0.0055344165,"teacher_disagreement_score":0.028647685,"about_ca_system_score_codex":0.0042123985,"about_ca_system_score_gemma":0.004249877,"threshold_uncertainty_score":0.0958361},"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":"commentary","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0109600155,0.05754139,0.28248763,0.3089724,0.20491655,0.00017199846,0.0024974758,0.0064694537,0.1259831],"genre_scores_gemma":[0.23035823,0.062043183,0.24442245,0.12323223,0.096746475,0.00056482275,0.002741125,0.0075949724,0.23229659],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.98021704,0.006044668,0.0021569275,0.0026245576,0.007845759,0.0011111127],"domain_scores_gemma":[0.9497043,0.021674262,0.0037274181,0.00974238,0.014184801,0.0009668531],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.012834829,0.0031469287,0.0014232018,0.004766562,0.0061597163,0.006524477,0.0042536943,0.003788566,0.031697176],"category_scores_gemma":[0.08597664,0.0008363409,0.002038398,0.0051903557,0.007629127,0.015176956,0.006734143,0.009085214,0.018073231],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00017866485,0.00009716684,0.0012268267,0.0009393345,0.00007356801,0.0021230264,0.0021574118,0.0017867091,0.0010576668,0.4990734,0.4302686,0.061017707],"study_design_scores_gemma":[0.000026338523,0.000029979588,0.00045161345,0.0007782209,0.000042991313,0.0020158284,0.00066714233,0.0017158439,0.0025432543,0.3474387,0.6441759,0.00011414417],"about_ca_topic_score_codex":0.0032197805,"about_ca_topic_score_gemma":0.0026174458,"teacher_disagreement_score":0.031697176,"about_ca_system_score_codex":0.003987448,"about_ca_system_score_gemma":0.0027649242,"threshold_uncertainty_score":0.10603762},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.026098635,0.0018641036,0.8949222,0.0056045535,0.0008007239,0.00010240516,0.00088763714,0.0014220269,0.06829782],"genre_scores_gemma":[0.5870857,0.002503721,0.20099263,0.0026429414,0.00301823,0.000422723,0.0029193184,0.002439519,0.19797528],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.996536,0.0015050033,0.00019168251,0.00071050756,0.0008314748,0.00022528476],"domain_scores_gemma":[0.9865546,0.007215973,0.0008987132,0.0025244993,0.001830871,0.00097524904],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0061432724,0.0012122351,0.0017837969,0.004615358,0.0019790726,0.005276664,0.0016888726,0.0032431737,0.02878254],"category_scores_gemma":[0.04761044,0.0011501932,0.0018647965,0.0017964416,0.0036091374,0.008190133,0.0057852687,0.00566328,0.008903298],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006014887,0.000019626204,0.0008159505,0.0000730475,0.00003571906,0.00016480783,0.00015563297,0.005423793,0.000628621,0.96043235,0.006188102,0.026002346],"study_design_scores_gemma":[0.000012451082,0.000017508875,0.00040585562,0.00003410853,0.0000130526905,0.00032739132,0.000035529007,0.032047175,0.0005682942,0.9581753,0.008343375,0.000020079653],"about_ca_topic_score_codex":0.0009215104,"about_ca_topic_score_gemma":0.0008300545,"teacher_disagreement_score":0.02878254,"about_ca_system_score_codex":0.0021631885,"about_ca_system_score_gemma":0.0011455646,"threshold_uncertainty_score":0.09628719},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01437918,0.00031153543,0.9675561,0.000117983494,0.00015730284,0.00004456676,0.00009094913,0.00016871256,0.017173598],"genre_scores_gemma":[0.3801596,0.0014088273,0.6000627,0.00017056559,0.00023553264,0.00012471029,0.00030427403,0.00039380716,0.01713995],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992042,0.00019534194,0.00005419677,0.00013296845,0.0003300285,0.000083190964],"domain_scores_gemma":[0.99942136,0.00017496516,0.00004532072,0.00015050724,0.00017596332,0.000031987496],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009699339,0.0004855977,0.0004094533,0.00081993046,0.00048650667,0.0012686411,0.0007966085,0.00042268855,0.007203971],"category_scores_gemma":[0.0026211543,0.0001898819,0.00047985197,0.00084278086,0.0010714832,0.0019157724,0.0013100373,0.001503315,0.0023835523],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000043981923,0.000029269679,0.00022333502,0.00012504372,0.000009646107,0.00011136946,0.00019945357,0.00981634,0.0073118573,0.9020308,0.001720551,0.07837834],"study_design_scores_gemma":[0.000023027349,0.00016498902,0.00039328728,0.000113068425,0.000024713223,0.0006777668,0.0002105116,0.19530712,0.027236475,0.7135818,0.06221595,0.000051227842],"about_ca_topic_score_codex":0.00035453757,"about_ca_topic_score_gemma":0.000714827,"teacher_disagreement_score":0.007203971,"about_ca_system_score_codex":0.0005010169,"about_ca_system_score_gemma":0.00049638195,"threshold_uncertainty_score":0.024099648},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.017608864,0.00050164154,0.9617356,0.0003973645,0.0002287388,0.00012378451,0.00017651441,0.0026353637,0.016592104],"genre_scores_gemma":[0.12478349,0.0004915807,0.8576015,0.00038803398,0.00022683044,0.00015097548,0.00083314505,0.0006198025,0.014904662],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99781275,0.00031423548,0.0001928304,0.00054093363,0.00078654644,0.00035272946],"domain_scores_gemma":[0.99678963,0.0009974822,0.00012862131,0.0011080257,0.0008205894,0.00015562867],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018650574,0.0017287708,0.001692711,0.005680281,0.0016204572,0.004253355,0.0035182573,0.0015803206,0.016836561],"category_scores_gemma":[0.008257712,0.0009247868,0.0017778354,0.0058784126,0.0020032027,0.009098802,0.0062517165,0.003398248,0.0069060386],"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.00032470727,0.00017798804,0.001992334,0.00023931751,0.00005615934,0.0001708242,0.00041028394,0.010526569,0.007863776,0.20199631,0.012167875,0.7640738],"study_design_scores_gemma":[0.000100685385,0.00018297958,0.001100578,0.00021802595,0.000105743224,0.0006819354,0.00039442297,0.18439697,0.021217883,0.7061372,0.08532804,0.00013558833],"about_ca_topic_score_codex":0.0038969505,"about_ca_topic_score_gemma":0.0050151427,"teacher_disagreement_score":0.016836561,"about_ca_system_score_codex":0.0014707504,"about_ca_system_score_gemma":0.0017161637,"threshold_uncertainty_score":0.056323886},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.004311048,0.001296435,0.7737408,0.0009628086,0.0005534735,0.000065345346,0.0009705942,0.016209455,0.20188998],"genre_scores_gemma":[0.10925828,0.004313059,0.6715047,0.00067731517,0.00085837574,0.00021278205,0.004880713,0.017054338,0.19124055],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99896455,0.00021717166,0.00005847783,0.00017898022,0.0004972403,0.000083628416],"domain_scores_gemma":[0.9991536,0.00027090556,0.000030105066,0.00036041994,0.000113285234,0.00007166347],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008719811,0.0009753974,0.0011640154,0.0019754732,0.0015488657,0.0034938296,0.0019765473,0.0006236854,0.08611958],"category_scores_gemma":[0.0020194396,0.0010883611,0.0015906678,0.0022611883,0.0017875113,0.0061411727,0.00373144,0.0030981265,0.04574398],"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.00006793366,0.00006850487,0.0002551518,0.00033690783,0.000041661602,0.000096163014,0.0003940899,0.0024939922,0.0024268066,0.604783,0.09990774,0.28912807],"study_design_scores_gemma":[0.000033662305,0.000020984608,0.00014055286,0.00011897005,0.000020261983,0.00028373022,0.00009711554,0.00707029,0.004814645,0.60532385,0.38203645,0.00003946625],"about_ca_topic_score_codex":0.00075504073,"about_ca_topic_score_gemma":0.0021201265,"teacher_disagreement_score":0.08611958,"about_ca_system_score_codex":0.0008471475,"about_ca_system_score_gemma":0.0009973419,"threshold_uncertainty_score":0.2880987},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.033665147,0.0008521316,0.9461798,0.0003446538,0.00018852773,0.000040626313,0.0000792276,0.0005004039,0.018149544],"genre_scores_gemma":[0.41588947,0.0019616862,0.5557619,0.0004112659,0.00041603422,0.0002196513,0.00032097043,0.0012528198,0.023766188],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.999185,0.00026629024,0.000059879465,0.000106103114,0.00030341485,0.00007925881],"domain_scores_gemma":[0.99884194,0.00052716164,0.00010529527,0.0002621818,0.00019989365,0.00006352912],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015490038,0.00083331484,0.00069395854,0.0016052772,0.00084728794,0.0022678054,0.0015937058,0.00069392443,0.006252164],"category_scores_gemma":[0.0059943004,0.0004146996,0.0007344703,0.001597834,0.0025377208,0.003748881,0.0016128148,0.0018776184,0.0028671436],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003598513,0.00002398686,0.00022857611,0.000092157876,0.0000076121364,0.00016711219,0.00042237513,0.01123702,0.003340842,0.9484782,0.0010317382,0.03493437],"study_design_scores_gemma":[0.000014932912,0.000050049697,0.00013316289,0.00006584884,0.000009043217,0.00012993286,0.000066054956,0.13985606,0.0036486387,0.8453516,0.010648937,0.000025723211],"about_ca_topic_score_codex":0.0005891889,"about_ca_topic_score_gemma":0.0006462935,"teacher_disagreement_score":0.006252164,"about_ca_system_score_codex":0.0008390225,"about_ca_system_score_gemma":0.0006335815,"threshold_uncertainty_score":0.020915568},"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010746095,0.13847502,0.08553094,0.3648646,0.0231866,0.000046061814,0.00095660466,0.0017333191,0.37446073],"genre_scores_gemma":[0.34617317,0.18127933,0.087919444,0.08411979,0.03174569,0.00028565057,0.0021521228,0.0016563623,0.2646685],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992067,0.00033956065,0.000023837694,0.000106676234,0.0002367673,0.000086498614],"domain_scores_gemma":[0.9977386,0.001211114,0.000084369116,0.00025106283,0.00042449014,0.00029037325],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013935646,0.0007645182,0.00077513506,0.0010878351,0.0020934378,0.004070969,0.0012152866,0.0017180608,0.03485515],"category_scores_gemma":[0.009748497,0.00031661254,0.0006185159,0.00097973,0.0044754343,0.017396118,0.0026206668,0.0052805627,0.0137291625],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000038447495,0.000039371713,0.00045068638,0.0005485656,0.00001568502,0.0001353752,0.0027871162,0.000492741,0.00026623788,0.56016165,0.31926182,0.11580219],"study_design_scores_gemma":[0.0000053574645,0.000016165171,0.00019826212,0.00032497064,0.0000036722524,0.00011071252,0.0009613983,0.0004574003,0.00018456389,0.6068549,0.39086437,0.000018251241],"about_ca_topic_score_codex":0.0023546023,"about_ca_topic_score_gemma":0.0030322974,"teacher_disagreement_score":0.03485515,"about_ca_system_score_codex":0.0012523523,"about_ca_system_score_gemma":0.0012526804,"threshold_uncertainty_score":0.11660212},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010293366,0.009763276,0.012638497,0.0025668181,0.0010494023,0.000019039295,0.000111092144,0.00030023526,0.96325815],"genre_scores_gemma":[0.17801473,0.0073491307,0.0044686566,0.0007023556,0.001538602,0.00004477807,0.00016850932,0.00024382997,0.80746955],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99980336,0.0000465094,0.0000058285946,0.000027416221,0.00008698511,0.000029897481],"domain_scores_gemma":[0.99984443,0.000046732865,0.000011114753,0.000035443005,0.000033599485,0.000028618328],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00019947828,0.00075633585,0.0005735404,0.0013891523,0.0017706697,0.0027953747,0.0005437111,0.00072609127,0.022690857],"category_scores_gemma":[0.00081445434,0.00033633306,0.00023365568,0.002325166,0.0021054107,0.0038190084,0.0012533207,0.0021068377,0.007738328],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000063902553,0.00001796425,0.000044350607,0.000032265783,0.0000020106124,0.000019328763,0.00025217334,0.00019270502,0.00017216995,0.9394552,0.03325181,0.026553646],"study_design_scores_gemma":[0.0000043730547,0.000008626513,0.00015978658,0.000036023557,0.00000405613,0.00012842665,0.00008239632,0.0007635404,0.00036899693,0.79593784,0.20249905,0.0000068306576],"about_ca_topic_score_codex":0.0007798672,"about_ca_topic_score_gemma":0.0013924013,"teacher_disagreement_score":0.022690857,"about_ca_system_score_codex":0.0014266893,"about_ca_system_score_gemma":0.0006092254,"threshold_uncertainty_score":0.07590848},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.37298763,0.0070519657,0.30767184,0.0043292185,0.0013030439,0.00014787847,0.0012074579,0.00065445877,0.30464643],"genre_scores_gemma":[0.92888707,0.0026950256,0.026547452,0.0003399085,0.0013268639,0.00010602102,0.00064915844,0.00038487045,0.039063532],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.999084,0.00021400064,0.000040538038,0.00018186419,0.0003065859,0.0001730678],"domain_scores_gemma":[0.9981694,0.00090557995,0.00014809737,0.00022268757,0.00027175652,0.00028239106],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012061617,0.001009185,0.0008202615,0.0030529103,0.001536694,0.002905414,0.0014912927,0.0005716861,0.0076491483],"category_scores_gemma":[0.004479305,0.0005948095,0.0008760948,0.0016467902,0.0037434532,0.0067873243,0.0032058412,0.0037563595,0.0017696274],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000059696195,0.000029797942,0.000589168,0.00007170789,0.00001005261,0.00004398117,0.0002539723,0.0015068143,0.0019759089,0.97980464,0.0036699402,0.011984261],"study_design_scores_gemma":[0.000012091032,0.000020796888,0.0006249172,0.000027963662,0.00001554816,0.000114405906,0.00009574838,0.009321292,0.0017367705,0.9818479,0.006155947,0.00002669528],"about_ca_topic_score_codex":0.0009490467,"about_ca_topic_score_gemma":0.0012123516,"teacher_disagreement_score":0.0076491483,"about_ca_system_score_codex":0.002087408,"about_ca_system_score_gemma":0.0005813631,"threshold_uncertainty_score":0.02558899},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0153355105,0.0019862761,0.9396743,0.0011707194,0.00027400206,0.00016753275,0.0011970932,0.006232949,0.03396154],"genre_scores_gemma":[0.17675227,0.0013755222,0.7798374,0.00043720112,0.0002628008,0.00042201005,0.0038203031,0.00227649,0.034816053],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99832743,0.00031969606,0.000112686736,0.0004083579,0.0005725156,0.00025920308],"domain_scores_gemma":[0.99724907,0.001464222,0.000108733315,0.00074711186,0.00034833557,0.000082539016],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001307454,0.001703504,0.0017212394,0.0014213313,0.0015024693,0.0035063117,0.0033033078,0.0018236535,0.047543637],"category_scores_gemma":[0.0054950486,0.0011596169,0.001927485,0.003854395,0.0009944442,0.008161577,0.0035370523,0.0033869268,0.010303077],"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.00047692584,0.0002350383,0.0005786484,0.0010993072,0.00011415783,0.000118569136,0.00035676942,0.03691218,0.0062809987,0.27954593,0.04793026,0.62635124],"study_design_scores_gemma":[0.00022466606,0.00007256214,0.0002481321,0.00011548914,0.00007399535,0.00022294959,0.00012670943,0.19871542,0.008827609,0.76085186,0.030475719,0.000044856828],"about_ca_topic_score_codex":0.0031313836,"about_ca_topic_score_gemma":0.0073838686,"teacher_disagreement_score":0.047543637,"about_ca_system_score_codex":0.002484606,"about_ca_system_score_gemma":0.0023249637,"threshold_uncertainty_score":0.15904933},"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":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0014634607,0.013396614,0.008835554,0.04535387,0.29578176,0.00046935567,0.008599498,0.0013363083,0.62476355],"genre_scores_gemma":[0.005536107,0.003734729,0.0018918186,0.007042802,0.029527083,0.000179333,0.003893095,0.000586363,0.94760877],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9992144,0.00011884535,0.000040098814,0.00013487249,0.00041593288,0.00007575495],"domain_scores_gemma":[0.99547833,0.0005635149,0.00014206153,0.00040805415,0.0025262984,0.00088178535],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0014100799,0.0008363409,0.0005748188,0.0028198021,0.0024246501,0.003479252,0.0011495979,0.0010524051,0.40365586],"category_scores_gemma":[0.009870508,0.00024355888,0.00050760363,0.0017722879,0.00058913976,0.0025104948,0.0021896283,0.0026832817,0.2663203],"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.00002628448,0.000019275947,0.00008529103,0.00006970758,0.0000018516284,0.000030272557,0.00004131672,0.000052937598,0.000117025695,0.0064982204,0.9527253,0.0403325],"study_design_scores_gemma":[0.0000040190594,0.000008584841,0.00019972038,0.00007464635,0.0000016295867,0.000026605927,0.000044612203,0.000032197073,0.0001019643,0.0036319655,0.9958703,0.0000037931472],"about_ca_topic_score_codex":0.0035501856,"about_ca_topic_score_gemma":0.005634736,"teacher_disagreement_score":0.5963441,"about_ca_system_score_codex":0.002187907,"about_ca_system_score_gemma":0.0022770055,"threshold_uncertainty_score":0},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010170874,0.006121973,0.56967133,0.003249773,0.0015139477,0.000079676596,0.00038455357,0.0021390407,0.40666878],"genre_scores_gemma":[0.21195821,0.008568517,0.49495173,0.0020648697,0.0016713853,0.00018931548,0.0014484084,0.0022926177,0.276855],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992835,0.00015262571,0.000029754196,0.00015004912,0.00029799418,0.00008604589],"domain_scores_gemma":[0.99935025,0.00026831363,0.000022177734,0.00021443728,0.000120398705,0.000024353272],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008156881,0.0009596518,0.0007862332,0.0014231246,0.0011515816,0.002749236,0.0010068124,0.0010426844,0.029651374],"category_scores_gemma":[0.0030309372,0.0004890353,0.0008416758,0.0019634548,0.0020321761,0.004837598,0.0016973563,0.003566482,0.015359997],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009724758,0.000023522338,0.000101127276,0.00010119335,0.000012615131,0.000035820314,0.000111063826,0.002502121,0.0015538882,0.6537811,0.039533183,0.30214706],"study_design_scores_gemma":[0.000030419122,0.000028680965,0.00013626328,0.000080524245,0.000012744078,0.00018736023,0.00003422473,0.008642292,0.0027573507,0.7898735,0.1981882,0.000028405271],"about_ca_topic_score_codex":0.0008914847,"about_ca_topic_score_gemma":0.00078234094,"teacher_disagreement_score":0.029651374,"about_ca_system_score_codex":0.001221784,"about_ca_system_score_gemma":0.0010232199,"threshold_uncertainty_score":0.09919375},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.002125788,0.010366663,0.08794038,0.0035445502,0.0016664113,0.000060457714,0.00047107448,0.00029691512,0.89352775],"genre_scores_gemma":[0.15495841,0.02326241,0.079198755,0.0041693714,0.0030923197,0.00033768,0.0018793135,0.00084485585,0.7322569],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99934727,0.00015173055,0.000026970396,0.00015197776,0.00024413905,0.00007795789],"domain_scores_gemma":[0.9996979,0.00010137803,0.000020980058,0.00006213945,0.000082794984,0.000034807777],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005510198,0.0007420693,0.0007367718,0.0011453589,0.0015444704,0.0042628166,0.0009884185,0.0010741733,0.04546197],"category_scores_gemma":[0.0013303028,0.0003871728,0.0008303512,0.0012256352,0.002322156,0.0038098542,0.0020219618,0.0033284398,0.018782958],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000004992957,0.0000072977214,0.000025812436,0.000054451775,0.000003368778,0.000019996778,0.00007479855,0.00021350879,0.00014682798,0.95737994,0.025249448,0.01681958],"study_design_scores_gemma":[0.0000039052716,0.000010300644,0.00008430968,0.00007204027,0.0000036322904,0.00017977283,0.000061554114,0.00081858755,0.00022839385,0.6560982,0.3424329,0.0000062906015],"about_ca_topic_score_codex":0.0006505564,"about_ca_topic_score_gemma":0.00063166325,"teacher_disagreement_score":0.04546197,"about_ca_system_score_codex":0.0017790123,"about_ca_system_score_gemma":0.0010853874,"threshold_uncertainty_score":0.15208548},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0036202972,0.00026543744,0.94475657,0.00035307228,0.00014806175,0.0001222939,0.0022029525,0.018733935,0.029797351],"genre_scores_gemma":[0.13814478,0.00079673406,0.81307274,0.0007101917,0.0006116091,0.0008761452,0.006554012,0.0109781185,0.028255668],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.998466,0.0004605452,0.00008276562,0.00018034573,0.0006714563,0.00013896104],"domain_scores_gemma":[0.99812955,0.0006304071,0.00013380389,0.0005060814,0.00048745642,0.00011258309],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016634095,0.0011672948,0.0014064802,0.0015993844,0.0008887249,0.004613654,0.0020354618,0.0007633086,0.07809573],"category_scores_gemma":[0.0062621855,0.0007160072,0.0016359596,0.002320294,0.0011220339,0.004549859,0.0027807518,0.0026664168,0.04099466],"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.000295813,0.00014150128,0.0006630688,0.0007839274,0.00007589303,0.00044449032,0.00071042625,0.016370812,0.005748532,0.57295054,0.14568153,0.2561334],"study_design_scores_gemma":[0.000106372405,0.00010028401,0.00029725075,0.00012775637,0.000027001553,0.00048094062,0.000116946394,0.06641344,0.010211104,0.6843964,0.2376391,0.00008337124],"about_ca_topic_score_codex":0.0006233114,"about_ca_topic_score_gemma":0.0009588704,"teacher_disagreement_score":0.07809573,"about_ca_system_score_codex":0.0005500831,"about_ca_system_score_gemma":0.00086603017,"threshold_uncertainty_score":0.26125628},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0098856175,0.00029535813,0.9828644,0.000096423624,0.000103215876,0.00004477953,0.000069601185,0.0004350948,0.006205525],"genre_scores_gemma":[0.20928295,0.0011683225,0.77327794,0.00013524159,0.00036933686,0.000082459715,0.00038530954,0.00034589964,0.014952514],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99918145,0.000118735625,0.00004278116,0.00012072903,0.00045293706,0.0000833649],"domain_scores_gemma":[0.99923193,0.00020971827,0.00007582213,0.00018120118,0.00025629977,0.000044960707],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007484679,0.0005348784,0.00070266577,0.0015345513,0.0006579461,0.0012776661,0.0011180014,0.0003308188,0.0054411376],"category_scores_gemma":[0.0019912338,0.00026507812,0.0008596334,0.0011021176,0.00093904644,0.002176489,0.0018283641,0.0012251432,0.0028622837],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00014114696,0.00010002072,0.00093086,0.00033691066,0.000047994217,0.00035285274,0.000399097,0.028731095,0.035408843,0.5368649,0.0054087173,0.39127764],"study_design_scores_gemma":[0.000085974905,0.00039119177,0.00077051355,0.00009839058,0.00008287996,0.0012571446,0.00018031633,0.36642882,0.08533915,0.4651953,0.080065794,0.00010454532],"about_ca_topic_score_codex":0.0002342383,"about_ca_topic_score_gemma":0.000521598,"teacher_disagreement_score":0.0054411376,"about_ca_system_score_codex":0.00039295215,"about_ca_system_score_gemma":0.00050035806,"threshold_uncertainty_score":0.018202364},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.034279175,0.00036739468,0.8899988,0.0007143003,0.00024227255,0.00009544331,0.00024509756,0.0010227081,0.07303484],"genre_scores_gemma":[0.576981,0.0012466675,0.38765228,0.0002758637,0.00028575663,0.00014208686,0.0005742195,0.0007315021,0.03211058],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993963,0.00007639615,0.000030782787,0.00012621724,0.00023189768,0.00013846622],"domain_scores_gemma":[0.9995504,0.00014858284,0.00003952655,0.00012371858,0.000092906404,0.000044713608],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006183246,0.0006732691,0.00052013266,0.0009550851,0.0011727901,0.0031054132,0.0008071532,0.00055668363,0.01219458],"category_scores_gemma":[0.0018328496,0.0002884238,0.000869126,0.0011749173,0.002382591,0.007797001,0.0023848608,0.002060697,0.0020476046],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002903598,0.000019730112,0.00016312076,0.000045991015,0.0000042679735,0.00010384627,0.00020613398,0.003042752,0.0025487973,0.96715945,0.001751022,0.024925882],"study_design_scores_gemma":[0.000021665679,0.000035903107,0.00018078949,0.000061263534,0.000013880653,0.00032524654,0.00018250012,0.035390284,0.012452843,0.8911141,0.060190465,0.000031011514],"about_ca_topic_score_codex":0.0012487016,"about_ca_topic_score_gemma":0.0010956305,"teacher_disagreement_score":0.01219458,"about_ca_system_score_codex":0.0009688949,"about_ca_system_score_gemma":0.00069892104,"threshold_uncertainty_score":0.04079491},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0077463374,0.007296433,0.95671976,0.001738205,0.00056186493,0.00004778297,0.00010397638,0.00040696425,0.025378589],"genre_scores_gemma":[0.23762694,0.011217264,0.7378043,0.00060045696,0.0011906023,0.0002861012,0.00022344591,0.00041711726,0.010633771],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988825,0.00036327046,0.00008178103,0.0001448801,0.00048071938,0.00004686764],"domain_scores_gemma":[0.9990361,0.00039182624,0.000062618965,0.00024395852,0.000215584,0.00004998265],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011572283,0.0007489535,0.0007118253,0.0016124346,0.00090099295,0.0015453133,0.0009889511,0.0008860062,0.004016364],"category_scores_gemma":[0.0040838416,0.00031077222,0.0013230974,0.0015789482,0.0020020248,0.003578136,0.0021823768,0.0025979066,0.0016836188],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000037548154,0.000032078646,0.0007105176,0.000356795,0.00004203962,0.00013540991,0.00028068962,0.0106796855,0.003565625,0.8856246,0.0024128908,0.09612203],"study_design_scores_gemma":[0.000045337452,0.000060579994,0.0004459395,0.00016692856,0.00005649768,0.0006003176,0.00011942914,0.14621666,0.003045674,0.77205956,0.07712693,0.000056121982],"about_ca_topic_score_codex":0.0011898577,"about_ca_topic_score_gemma":0.0008487429,"teacher_disagreement_score":0.004016364,"about_ca_system_score_codex":0.00057884626,"about_ca_system_score_gemma":0.0011118317,"threshold_uncertainty_score":0.013436079},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8280348,0.0005481581,0.079487726,0.0009038452,0.00012917219,0.00004104686,0.00019875325,0.00015653553,0.09049985],"genre_scores_gemma":[0.97642285,0.0002718298,0.010833942,0.0000864754,0.00014326158,0.000023919252,0.00012304801,0.000060159786,0.012034488],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9997031,0.0000451206,0.000011631396,0.000067342495,0.000108876215,0.000063793326],"domain_scores_gemma":[0.999686,0.000088121815,0.0000544303,0.000033376622,0.000050083225,0.00008796882],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00031419285,0.000479117,0.0005201081,0.0023443676,0.0008674882,0.00238488,0.0006161724,0.0006185554,0.0036101649],"category_scores_gemma":[0.00092103344,0.0002527565,0.00042614248,0.0011249594,0.0026411996,0.0020655163,0.0012753402,0.0010262302,0.00040156697],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000035002107,0.000020176727,0.0005436693,0.000035794044,0.0000053171852,0.0004219931,0.0003186761,0.001780207,0.0043422114,0.98516995,0.0006585354,0.006668463],"study_design_scores_gemma":[0.000029081713,0.000058824153,0.002198965,0.000023559132,0.000016206508,0.0016859834,0.00027118943,0.020283476,0.004076764,0.95690346,0.014409185,0.0000432708],"about_ca_topic_score_codex":0.0005317136,"about_ca_topic_score_gemma":0.0007207951,"teacher_disagreement_score":0.0036101649,"about_ca_system_score_codex":0.0014301798,"about_ca_system_score_gemma":0.00038172395,"threshold_uncertainty_score":0.012077212},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.38334838,0.003058768,0.44468376,0.0028064472,0.00046062176,0.00007413533,0.00032293244,0.0004637605,0.1647812],"genre_scores_gemma":[0.8726822,0.0017680327,0.06691344,0.00020155673,0.00022846647,0.00008690228,0.00026475292,0.00023134571,0.05762323],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991667,0.00031180555,0.00002980519,0.00011360306,0.00026781167,0.000110349116],"domain_scores_gemma":[0.9974354,0.0012885736,0.00018541052,0.00038522808,0.0005046377,0.0002008053],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015239335,0.00033338874,0.00069292064,0.0015842824,0.0011792628,0.0023794079,0.0008100476,0.0006666769,0.009105558],"category_scores_gemma":[0.010353156,0.00028033523,0.000405327,0.0016001391,0.0021267424,0.005137505,0.0024591403,0.0024376984,0.0015723822],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003114855,0.000009528269,0.00015408383,0.000017084722,0.0000021122873,0.000016088658,0.0001363599,0.0018566091,0.00019128625,0.9879873,0.0008469754,0.008751315],"study_design_scores_gemma":[0.000009608815,0.000011602963,0.00014866983,0.00001784379,0.0000040268033,0.00007690436,0.000054292163,0.021832027,0.00035251648,0.97242945,0.0050544967,0.000008588711],"about_ca_topic_score_codex":0.0015029337,"about_ca_topic_score_gemma":0.0016995353,"teacher_disagreement_score":0.009105558,"about_ca_system_score_codex":0.0015189507,"about_ca_system_score_gemma":0.0008134802,"threshold_uncertainty_score":0.030461133},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.001094284,0.0018076294,0.003062851,0.0008007347,0.00047864328,0.000025404619,0.0006736759,0.00035043116,0.9917064],"genre_scores_gemma":[0.016503803,0.0023480472,0.0029922174,0.00028861497,0.0003759802,0.000028345687,0.0009278327,0.00029497728,0.9762403],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9997273,0.000021655904,0.0000067145547,0.00004371293,0.00016518781,0.000035509565],"domain_scores_gemma":[0.99983,0.000027585593,0.0000102541735,0.00003698979,0.00006499691,0.000030163537],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00018984408,0.0007600601,0.00056848815,0.0012842072,0.0013515655,0.0026998392,0.0006916984,0.00044153485,0.23803325],"category_scores_gemma":[0.00063945405,0.0004118901,0.0003053329,0.0022241147,0.0008375476,0.002872035,0.0013168481,0.0022784425,0.09172603],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000032863747,0.000034548284,0.000101420046,0.00024029864,0.0000043636173,0.000039093975,0.00016158642,0.0003809254,0.00081845815,0.42599893,0.39972168,0.17246585],"study_design_scores_gemma":[0.0000063904836,0.0000073899314,0.00012492388,0.00004658143,0.0000025892311,0.000072678675,0.000034726752,0.00022593327,0.00040103713,0.05976237,0.9393105,0.0000048835245],"about_ca_topic_score_codex":0.0022654298,"about_ca_topic_score_gemma":0.005093319,"teacher_disagreement_score":0.23803325,"about_ca_system_score_codex":0.0016389287,"about_ca_system_score_gemma":0.0013926611,"threshold_uncertainty_score":0.79630053},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.003972027,0.009142176,0.067022346,0.015330202,0.0028274818,0.00009599557,0.0028065417,0.00031491232,0.89848846],"genre_scores_gemma":[0.14400747,0.02016972,0.03275289,0.009071323,0.008495725,0.000547764,0.0048192,0.0007067748,0.7794291],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99921095,0.00016667151,0.000057999114,0.00019841625,0.0002575356,0.00010837024],"domain_scores_gemma":[0.99904114,0.00035349242,0.00011310883,0.00013280063,0.00029015788,0.00006925535],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009682826,0.0012278184,0.00077638583,0.0032839742,0.0022936196,0.003823243,0.0016543242,0.0016544273,0.13335942],"category_scores_gemma":[0.0035322339,0.0003666093,0.0008069386,0.0028113625,0.0023611845,0.005582569,0.002066587,0.0035665536,0.056924745],"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.000003469752,0.000008234617,0.000036672867,0.00005054966,0.000002018522,0.000025675043,0.00007076138,0.00010441072,0.00007402113,0.96501,0.025745342,0.008868875],"study_design_scores_gemma":[0.000004454873,0.000008465869,0.000110345994,0.00006639637,0.000005738633,0.00016881141,0.00007411488,0.00045274268,0.000118363765,0.686468,0.31251436,0.000008279905],"about_ca_topic_score_codex":0.0015722406,"about_ca_topic_score_gemma":0.0011843911,"teacher_disagreement_score":0.13335942,"about_ca_system_score_codex":0.0016808897,"about_ca_system_score_gemma":0.001042824,"threshold_uncertainty_score":0.4461317},"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":"other","genre_gemma":"editorial","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"editorial","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0004373541,0.016253518,0.0025432021,0.117565446,0.40637243,0.00022847424,0.0020041822,0.0009484618,0.4536469],"genre_scores_gemma":[0.0017023323,0.0037534481,0.00062226277,0.033075955,0.044461407,0.00011710597,0.0009665182,0.00048052103,0.9148204],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9990752,0.0001234564,0.00004486517,0.00014784532,0.00049770344,0.000110938854],"domain_scores_gemma":[0.99641657,0.00051046495,0.00016369544,0.00025663272,0.0016913412,0.00096124643],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0011714129,0.00092377723,0.0007957887,0.0016557351,0.0018978094,0.004106057,0.0013052877,0.0029704731,0.40133682],"category_scores_gemma":[0.0083204275,0.00027007383,0.0006031431,0.0009762257,0.00076799025,0.0028120526,0.0026252337,0.004238634,0.4179261],"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.000011664974,0.0000063122075,0.000019028252,0.000044794993,0.0000010691898,0.000014630305,0.000010098043,0.000007226953,0.00006350389,0.002010196,0.9756613,0.022150181],"study_design_scores_gemma":[0.0000037214884,0.000006618238,0.000056303492,0.000068783454,0.0000013946974,0.00003156831,0.000014856241,0.000009113374,0.000050924646,0.0013515602,0.9984028,0.000002311926],"about_ca_topic_score_codex":0.0018541146,"about_ca_topic_score_gemma":0.003555562,"teacher_disagreement_score":0.5986632,"about_ca_system_score_codex":0.0017035308,"about_ca_system_score_gemma":0.002533942,"threshold_uncertainty_score":0},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011321896,0.002947719,0.04314474,0.00230687,0.0010449927,0.000044092572,0.0004349615,0.00050156325,0.93825316],"genre_scores_gemma":[0.32819146,0.005966247,0.036253024,0.0019466577,0.0021567026,0.00017427093,0.0017399385,0.0013236438,0.62224805],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9996555,0.00006324656,0.000011037977,0.000059790706,0.00016098506,0.000049455954],"domain_scores_gemma":[0.99986935,0.000026780643,0.000010260584,0.000037420577,0.00003913087,0.00001711968],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00031142682,0.000900125,0.00076827826,0.002311767,0.001504521,0.003010664,0.0010273169,0.0008716663,0.030801544],"category_scores_gemma":[0.00065361056,0.00030364198,0.00057912245,0.0020032788,0.0020607274,0.0037250554,0.0020342476,0.0033124965,0.011254336],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000005379322,0.000007842244,0.00001264638,0.000027396667,0.0000031141024,0.0000139138065,0.00008236777,0.00012363828,0.00031192508,0.97042054,0.010662399,0.01832883],"study_design_scores_gemma":[0.0000047675217,0.000007875305,0.00008572145,0.00001979576,0.0000054065304,0.00009148492,0.00005406832,0.00058594,0.00040768977,0.91572404,0.083004884,0.000008364117],"about_ca_topic_score_codex":0.00072454085,"about_ca_topic_score_gemma":0.0009819486,"teacher_disagreement_score":0.030801544,"about_ca_system_score_codex":0.0011745851,"about_ca_system_score_gemma":0.00069230446,"threshold_uncertainty_score":0.10304141},"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":"empirical","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.44252962,0.000613833,0.42084223,0.0024630362,0.000657314,0.00030737507,0.002323283,0.0029388887,0.12732439],"genre_scores_gemma":[0.87947625,0.00019754555,0.09613602,0.0007819988,0.000053957407,0.000119226315,0.0007813883,0.00014195696,0.022311646],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99973196,0.00004510099,0.000019241455,0.00008928532,0.000041336272,0.000073112016],"domain_scores_gemma":[0.99955827,0.00013148042,0.000049806018,0.00014039385,0.000055508077,0.000064557185],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0002956607,0.00029597347,0.00028022862,0.00033314948,0.00064983976,0.0008436108,0.0005541101,0.000486918,0.008127876],"category_scores_gemma":[0.0009060847,0.00016598054,0.00038421882,0.00034890368,0.0011799762,0.0021352528,0.0014836575,0.0006909207,0.0010548041],"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.00056758424,0.00007972122,0.0020325703,0.00022307529,0.00003178915,0.00031787908,0.00018782495,0.0034668557,0.032576796,0.8878411,0.007897164,0.0647777],"study_design_scores_gemma":[0.000091399255,0.0004966546,0.002026883,0.00007432358,0.000070161026,0.00095562154,0.0002613639,0.038537133,0.061483584,0.76980734,0.12613524,0.00006038219],"about_ca_topic_score_codex":0.000319893,"about_ca_topic_score_gemma":0.00089416443,"teacher_disagreement_score":0.99187213,"about_ca_system_score_codex":0.00060926605,"about_ca_system_score_gemma":0.00049244514,"threshold_uncertainty_score":0},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.17603047,0.0014048673,0.04840186,0.0021304125,0.0006242782,0.000061979204,0.0004498446,0.00058462133,0.7703117],"genre_scores_gemma":[0.7058061,0.0025402303,0.019955447,0.00026697366,0.0011725391,0.000049847215,0.00059280195,0.00045927867,0.26915684],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994198,0.00006081508,0.00001857855,0.00012257764,0.00027136822,0.000106822794],"domain_scores_gemma":[0.9996025,0.000093451,0.000075902055,0.0000724556,0.000095923475,0.000059835736],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00036207057,0.00097109395,0.0005576597,0.0028802387,0.0016497745,0.0030176425,0.0009566817,0.0006206098,0.023895068],"category_scores_gemma":[0.001760086,0.0003003617,0.0005104644,0.0025691777,0.002547754,0.003836569,0.0017570927,0.0019796744,0.005141357],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000026918626,0.000014565157,0.00012978193,0.00002756145,0.0000038180438,0.00004273742,0.00010401067,0.0011271139,0.0006223986,0.97154003,0.004588691,0.021772353],"study_design_scores_gemma":[0.000013471975,0.000015710566,0.00051080296,0.000023149927,0.0000080435475,0.00012347904,0.000057263187,0.0042477045,0.0012226806,0.96433216,0.029427601,0.000017822296],"about_ca_topic_score_codex":0.0025896255,"about_ca_topic_score_gemma":0.0025957737,"teacher_disagreement_score":0.023895068,"about_ca_system_score_codex":0.002031305,"about_ca_system_score_gemma":0.0008965843,"threshold_uncertainty_score":0.07993692},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0037641933,0.00039224108,0.9835302,0.0004242835,0.00038295775,0.00018296318,0.00063774054,0.00649538,0.0041901404],"genre_scores_gemma":[0.059542984,0.00054034975,0.92290485,0.0008177305,0.00035182864,0.0009785432,0.0023538177,0.0033852928,0.009124518],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9932487,0.001580189,0.000966074,0.0013033856,0.0023340494,0.0005675721],"domain_scores_gemma":[0.98701096,0.0025669257,0.0008551305,0.0048601115,0.004035367,0.0006714368],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0052363845,0.0013085996,0.0016885069,0.002170554,0.002208391,0.0066243643,0.0040990063,0.0014389703,0.007246448],"category_scores_gemma":[0.019395128,0.0018910212,0.0024515302,0.00360153,0.003562433,0.012300526,0.006381164,0.0055616405,0.00754632],"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.0013562978,0.00018418804,0.0023186277,0.0009253144,0.00014701573,0.00036352596,0.0011333146,0.009774988,0.013978091,0.54307824,0.06967234,0.35706803],"study_design_scores_gemma":[0.00033187,0.00058541144,0.0007301367,0.00031421267,0.00013410512,0.0009261592,0.00025491553,0.074214935,0.08887757,0.27092603,0.56237227,0.00033240722],"about_ca_topic_score_codex":0.0016563035,"about_ca_topic_score_gemma":0.0015431223,"teacher_disagreement_score":0.007246448,"about_ca_system_score_codex":0.0019475373,"about_ca_system_score_gemma":0.0038082984,"threshold_uncertainty_score":0.027692974},"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":"other","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0020564473,0.13204546,0.06321203,0.008469847,0.014826418,0.000085896965,0.0007945198,0.0014328385,0.77707654],"genre_scores_gemma":[0.027658774,0.09394047,0.026888983,0.0016991659,0.013658663,0.00016776219,0.0010789688,0.00088497874,0.8340223],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9990896,0.00010326507,0.000036406564,0.00015894623,0.0005488618,0.00006298661],"domain_scores_gemma":[0.9991085,0.00026538206,0.0000365616,0.00022692794,0.00024495894,0.000117581],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00078141893,0.0015579113,0.0017080755,0.0034371745,0.0011539876,0.003928451,0.0011041667,0.0008563261,0.07337124],"category_scores_gemma":[0.0021014393,0.00070566614,0.0007705835,0.0052532223,0.0016751337,0.0052596647,0.002512932,0.0039481735,0.045762468],"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.000015895566,0.00003863612,0.00010599951,0.0005216724,0.000022483611,0.00002609125,0.00011827502,0.0010084887,0.00071017275,0.31526685,0.37911102,0.30305445],"study_design_scores_gemma":[0.0000052090413,0.000014933087,0.0002428705,0.00015768115,0.000009845847,0.00008878476,0.000029989627,0.0015500856,0.00029511467,0.16901425,0.82858074,0.000010486008],"about_ca_topic_score_codex":0.00077349285,"about_ca_topic_score_gemma":0.0014594224,"teacher_disagreement_score":0.07337124,"about_ca_system_score_codex":0.0017856421,"about_ca_system_score_gemma":0.0017413426,"threshold_uncertainty_score":0.24545121},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0017452323,0.00682513,0.0074163177,0.0017124143,0.000941229,0.000015835649,0.0001716402,0.00023458936,0.98093766],"genre_scores_gemma":[0.065248534,0.008353483,0.006207645,0.00092163484,0.0022204,0.000062501655,0.0004618155,0.0003105562,0.9162135],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99979967,0.00003670656,0.000007743284,0.000037567497,0.00010034962,0.000017976397],"domain_scores_gemma":[0.9998822,0.000024406423,0.000007378826,0.00003242373,0.00003954623,0.000013920159],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002461054,0.00057424296,0.00061898003,0.0016655164,0.0012903111,0.0024317976,0.0005530034,0.00053762604,0.055525303],"category_scores_gemma":[0.0005720856,0.00028042612,0.00028410676,0.001799663,0.0015798678,0.003520294,0.0012853256,0.0020582813,0.016252505],"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.000004664925,0.000009607987,0.000035959456,0.00006765483,0.000003816679,0.000015548105,0.00016008913,0.00012227386,0.00023699205,0.88053954,0.07257062,0.046233226],"study_design_scores_gemma":[0.0000039591737,0.000007036893,0.00018964466,0.000040312923,0.0000040378277,0.0000961682,0.00005660321,0.00033621024,0.00019457251,0.46870393,0.53036255,0.000004981863],"about_ca_topic_score_codex":0.0010167287,"about_ca_topic_score_gemma":0.0016069822,"teacher_disagreement_score":0.055525303,"about_ca_system_score_codex":0.0017320531,"about_ca_system_score_gemma":0.0007611532,"threshold_uncertainty_score":0.18575066},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.22267067,0.0019899344,0.57672447,0.0044664964,0.00042218386,0.00039660017,0.0029782492,0.00050532166,0.18984605],"genre_scores_gemma":[0.91222197,0.0012014648,0.053589616,0.0006903914,0.00041310574,0.000541934,0.0029683055,0.000495065,0.027878132],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99866533,0.00026609315,0.000068986046,0.0003116271,0.0004671973,0.00022090146],"domain_scores_gemma":[0.994076,0.0030897672,0.00058838853,0.00033711095,0.0013477199,0.00056101126],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001585475,0.0009641631,0.00088823016,0.0014102363,0.0011095285,0.0026715,0.0010004438,0.0009608975,0.011897878],"category_scores_gemma":[0.010497879,0.0003953454,0.0009036461,0.0007296705,0.0024897512,0.003312533,0.0014141882,0.002408921,0.0015655905],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00014612461,0.00003732887,0.00164705,0.00015596134,0.000020367486,0.00018345744,0.0001586481,0.020533167,0.0046216254,0.9498452,0.009842237,0.012808853],"study_design_scores_gemma":[0.000035219666,0.0001337658,0.0024931626,0.00006770264,0.00002085403,0.00033974688,0.00013546398,0.34808105,0.0056746816,0.6298941,0.013044377,0.00007988519],"about_ca_topic_score_codex":0.003673919,"about_ca_topic_score_gemma":0.0019847995,"teacher_disagreement_score":0.011897878,"about_ca_system_score_codex":0.002685863,"about_ca_system_score_gemma":0.0015390905,"threshold_uncertainty_score":0.039802432},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.001185383,0.0057906974,0.006970415,0.0012391481,0.00061935955,0.0000137279285,0.00010699487,0.00015878597,0.9839156],"genre_scores_gemma":[0.032752037,0.007041019,0.0035605272,0.00057120575,0.00090230897,0.00003030361,0.0002402749,0.00022056515,0.95468175],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99977225,0.00004683469,0.0000058936985,0.000036820828,0.00010920238,0.000029119952],"domain_scores_gemma":[0.99989283,0.00002653915,0.0000052362952,0.00002577063,0.000031078078,0.000018464676],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002114708,0.00091226335,0.00046612573,0.001538566,0.0012142806,0.002931751,0.00057248195,0.00056520966,0.05717719],"category_scores_gemma":[0.00045838018,0.00028439536,0.00026870845,0.0015917873,0.0019063605,0.0033173868,0.0012991794,0.002052788,0.022515245],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009543525,0.000020649175,0.000055507884,0.000094013885,0.0000039482507,0.000025790874,0.00029443923,0.00027782013,0.00040368788,0.77077574,0.13265419,0.09538467],"study_design_scores_gemma":[0.0000027360984,0.0000061834758,0.000099276636,0.000069786845,0.0000029011178,0.00007714253,0.000081279606,0.000249254,0.00026024212,0.2623792,0.73676723,0.0000047752133],"about_ca_topic_score_codex":0.0010117461,"about_ca_topic_score_gemma":0.0022482772,"teacher_disagreement_score":0.05717719,"about_ca_system_score_codex":0.0018138973,"about_ca_system_score_gemma":0.0008870359,"threshold_uncertainty_score":0.19127673},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.005725266,0.0037880896,0.11467375,0.0016542702,0.0016018033,0.00009895307,0.0013187596,0.002357616,0.86878145],"genre_scores_gemma":[0.2382695,0.0081796255,0.14846867,0.0027474416,0.00421766,0.0004324703,0.0049665053,0.002340065,0.59037805],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9990257,0.000165061,0.000057608137,0.00022394008,0.0004353779,0.000092248774],"domain_scores_gemma":[0.9995876,0.00006870673,0.000026094003,0.00010142524,0.00016933662,0.000046886948],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00056998717,0.00091299164,0.0013237629,0.0020259696,0.0024853603,0.0044342387,0.0014889671,0.0006823393,0.058936935],"category_scores_gemma":[0.00110754,0.0005414266,0.00083754834,0.0028603205,0.002629716,0.0053227725,0.0021419534,0.0034818223,0.035074465],"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.000017794728,0.000020319347,0.00005560765,0.00013155007,0.000008825864,0.00003232341,0.00014235543,0.00019987287,0.00058665115,0.9114756,0.033774886,0.053554308],"study_design_scores_gemma":[0.000008882391,0.00001443236,0.00011617388,0.00003143437,0.000009518307,0.00017053311,0.000039737148,0.0008159577,0.00088476366,0.80816936,0.18972301,0.000016170383],"about_ca_topic_score_codex":0.0008349733,"about_ca_topic_score_gemma":0.000797257,"teacher_disagreement_score":0.058936935,"about_ca_system_score_codex":0.0011619377,"about_ca_system_score_gemma":0.0011549366,"threshold_uncertainty_score":0.1971637},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0037641933,0.00039224108,0.9835302,0.0004242835,0.00038295775,0.00018296318,0.00063774054,0.00649538,0.0041901404],"genre_scores_gemma":[0.059542984,0.00054034975,0.92290485,0.0008177305,0.00035182864,0.0009785432,0.0023538177,0.0033852928,0.009124518],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9932487,0.001580189,0.000966074,0.0013033856,0.0023340494,0.0005675721],"domain_scores_gemma":[0.98701096,0.0025669257,0.0008551305,0.0048601115,0.004035367,0.0006714368],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0052363845,0.0013085996,0.0016885069,0.002170554,0.002208391,0.0066243643,0.0040990063,0.0014389703,0.007246448],"category_scores_gemma":[0.019395128,0.0018910212,0.0024515302,0.00360153,0.003562433,0.012300526,0.006381164,0.0055616405,0.00754632],"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.0013562978,0.00018418804,0.0023186277,0.0009253144,0.00014701573,0.00036352596,0.0011333146,0.009774988,0.013978091,0.54307824,0.06967234,0.35706803],"study_design_scores_gemma":[0.00033187,0.00058541144,0.0007301367,0.00031421267,0.00013410512,0.0009261592,0.00025491553,0.074214935,0.08887757,0.27092603,0.56237227,0.00033240722],"about_ca_topic_score_codex":0.0016563035,"about_ca_topic_score_gemma":0.0015431223,"teacher_disagreement_score":0.007246448,"about_ca_system_score_codex":0.0019475373,"about_ca_system_score_gemma":0.0038082984,"threshold_uncertainty_score":0.027692974},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0011006081,0.011200212,0.0047518057,0.017302426,0.07776923,0.0003521501,0.00825067,0.0013147368,0.87795824],"genre_scores_gemma":[0.0034265895,0.0040472336,0.0012170359,0.0029534162,0.008475518,0.0001299788,0.0046575405,0.0005166804,0.97457594],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.999461,0.0000670891,0.000034269913,0.000099983255,0.00028729797,0.000050408347],"domain_scores_gemma":[0.99813926,0.00026775626,0.00007338313,0.00016726654,0.0010026608,0.00034961992],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00078017195,0.0007741259,0.0005784649,0.0023261884,0.0021135642,0.0031498128,0.0011989967,0.0011983739,0.5005956],"category_scores_gemma":[0.004562333,0.00028037265,0.00043305257,0.0019182229,0.00056376425,0.0029391828,0.0018638133,0.0027698234,0.31073225],"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.000016984735,0.000015591824,0.000054039545,0.00008522827,9.4981567e-7,0.000036282756,0.000092640126,0.000041397616,0.00010940938,0.006029652,0.9555516,0.037966304],"study_design_scores_gemma":[0.0000016075744,0.0000067708074,0.000113402944,0.00006964154,5.3232e-7,0.000037524467,0.000042774496,0.00001113914,0.00003490414,0.0013320057,0.99834776,0.000001990162],"about_ca_topic_score_codex":0.00263492,"about_ca_topic_score_gemma":0.0034578112,"teacher_disagreement_score":0.5005956,"about_ca_system_score_codex":0.001875124,"about_ca_system_score_gemma":0.0013179792,"threshold_uncertainty_score":0},"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":"other","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0021946728,0.046388555,0.17381047,0.0071511623,0.007927907,0.00012701856,0.0015231483,0.002268291,0.7586088],"genre_scores_gemma":[0.05041309,0.080801666,0.15318084,0.00356871,0.01506857,0.00035862016,0.0029322407,0.0026305222,0.6910457],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990814,0.00014343888,0.000056865916,0.00017330454,0.00046750225,0.00007757719],"domain_scores_gemma":[0.9993061,0.00027933472,0.000025769194,0.00015002044,0.00015880217,0.000079993355],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007714248,0.0016129646,0.0011966018,0.0039009599,0.0011937477,0.004117564,0.001346018,0.0011723936,0.07722801],"category_scores_gemma":[0.0017628856,0.0008375922,0.0009604298,0.006889883,0.0022930445,0.0064171604,0.0022599043,0.005184757,0.03503555],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000022369246,0.00008115869,0.000097542106,0.00034377023,0.000013332114,0.000056884688,0.00010334827,0.0013439909,0.0006524166,0.5380627,0.18463534,0.27458715],"study_design_scores_gemma":[0.00000885444,0.00001339095,0.0001949499,0.00016123673,0.0000069975686,0.00018474869,0.000028819932,0.0018596706,0.0004169272,0.28753403,0.70957273,0.00001760286],"about_ca_topic_score_codex":0.0016803643,"about_ca_topic_score_gemma":0.002977921,"teacher_disagreement_score":0.07722801,"about_ca_system_score_codex":0.0021475898,"about_ca_system_score_gemma":0.0015247276,"threshold_uncertainty_score":0.2583534},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0015458209,0.0050114463,0.008183926,0.0009532831,0.0007233901,0.000027056967,0.00027011786,0.00026632982,0.98301864],"genre_scores_gemma":[0.03479996,0.0056926627,0.0075578685,0.00039853397,0.0007578022,0.000054564614,0.00047077128,0.00023530128,0.9500326],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99971956,0.000040349383,0.000013863542,0.000052086125,0.0001411528,0.000033105334],"domain_scores_gemma":[0.9997496,0.00005772459,0.000017645278,0.000058739115,0.00008296636,0.00003335733],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002741696,0.001006929,0.00065176777,0.0019382032,0.0016290522,0.0042591407,0.00074421795,0.00044039567,0.074985206],"category_scores_gemma":[0.00095915364,0.00045805698,0.00023420213,0.0032573566,0.0014377334,0.005335755,0.001347789,0.0020743436,0.036063515],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000016006265,0.000020716747,0.00006988936,0.00011213624,0.000002673836,0.000028531258,0.00029005957,0.00016291518,0.00036603413,0.7648028,0.13640344,0.09772483],"study_design_scores_gemma":[0.0000050735007,0.0000081167,0.000108585744,0.000053634012,0.0000039448755,0.00010653689,0.000065800305,0.00018496174,0.00024767264,0.1264821,0.8727291,0.000004431939],"about_ca_topic_score_codex":0.00091154955,"about_ca_topic_score_gemma":0.0020849828,"teacher_disagreement_score":0.074985206,"about_ca_system_score_codex":0.0017689401,"about_ca_system_score_gemma":0.0008293956,"threshold_uncertainty_score":0.2508505},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"dataset","genre_consensus":"dataset","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0014434765,0.0006908125,0.0014609481,0.0003972507,0.00014665767,0.0001920521,0.9826319,0.0014446583,0.011592213],"genre_scores_gemma":[0.0048900745,0.00045876615,0.0026710704,0.00026895112,0.00004389506,0.00036710568,0.98848057,0.00018216185,0.0026373747],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9962663,0.0005039376,0.00064360315,0.0012189576,0.0008793414,0.00048795727],"domain_scores_gemma":[0.9953858,0.0014866712,0.00032407674,0.001441419,0.001123577,0.00023841811],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018280403,0.0022107763,0.0017374287,0.004850632,0.0014254758,0.005243575,0.0036767966,0.0023468796,0.12933591],"category_scores_gemma":[0.01988202,0.00053220877,0.002870345,0.005543736,0.0008367032,0.00452343,0.0032636344,0.0030086264,0.10596156],"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.00035988347,0.00010881322,0.0032585864,0.0017725923,0.00009275671,0.00007068386,0.00006865565,0.001524512,0.00017938009,0.010764772,0.9519196,0.029879665],"study_design_scores_gemma":[0.00042929949,0.00006444729,0.00362786,0.00069356785,0.000050985407,0.00024558825,0.0002613411,0.002225445,0.0005248405,0.0239435,0.9678987,0.00003445492],"about_ca_topic_score_codex":0.01168058,"about_ca_topic_score_gemma":0.01321399,"teacher_disagreement_score":0.12933591,"about_ca_system_score_codex":0.002137725,"about_ca_system_score_gemma":0.003585888,"threshold_uncertainty_score":0.43267173},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0013596463,0.012399035,0.039052162,0.0013111242,0.0011585868,0.000059961352,0.0017320964,0.0014010682,0.94152623],"genre_scores_gemma":[0.020488555,0.008594693,0.017200429,0.00038741442,0.00082710927,0.000091521004,0.0018648655,0.00066011044,0.9498854],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.999416,0.000068740475,0.000033437693,0.00010747125,0.0003324632,0.000041869087],"domain_scores_gemma":[0.9996488,0.00006312731,0.000018987872,0.00011088351,0.00013322783,0.000024977086],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00042444738,0.0012386316,0.0013284929,0.0020910744,0.0011691182,0.003994666,0.0010059093,0.0005038165,0.14701514],"category_scores_gemma":[0.0010147875,0.00086728204,0.0005261826,0.004179139,0.0011255054,0.0032978393,0.0013669481,0.0023950178,0.09579653],"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.000015419539,0.000030861775,0.000112376714,0.00033114955,0.00001752028,0.000055418113,0.00022168865,0.0005268571,0.0009260406,0.34820825,0.3328595,0.31669497],"study_design_scores_gemma":[0.0000060084326,0.000013110339,0.0002472586,0.00008798043,0.000011012483,0.00012721121,0.000055950066,0.00072210404,0.0004652267,0.13990219,0.8583524,0.000009522623],"about_ca_topic_score_codex":0.0027464568,"about_ca_topic_score_gemma":0.0053262,"teacher_disagreement_score":0.14701514,"about_ca_system_score_codex":0.0013534043,"about_ca_system_score_gemma":0.0011398672,"threshold_uncertainty_score":0.4918146},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0018400123,0.00290912,0.022240186,0.0017729363,0.0016208608,0.00003927894,0.0006940747,0.00038195102,0.9685016],"genre_scores_gemma":[0.051702544,0.0036405365,0.009621073,0.0010360336,0.0017418439,0.00010699749,0.001105783,0.00030983967,0.93073535],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99959594,0.000060268932,0.00001804657,0.00010342733,0.00018580665,0.00003663907],"domain_scores_gemma":[0.9997931,0.000029953795,0.0000128791835,0.000057677356,0.00008567199,0.000020650692],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00030904615,0.0008030778,0.00073965825,0.0015388516,0.0015911282,0.0030894906,0.0007831846,0.00054724555,0.10776542],"category_scores_gemma":[0.00074122223,0.0003420227,0.00044564347,0.0015393023,0.0015469181,0.0036557035,0.0013015666,0.0022681884,0.043784976],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000006148268,0.0000112763455,0.00003682005,0.000058091427,0.0000046674013,0.00001821451,0.00009932052,0.0000975779,0.00029585842,0.89749765,0.06942722,0.03244723],"study_design_scores_gemma":[0.0000053501058,0.0000058819746,0.00011465352,0.000020173573,0.0000051064603,0.00009534599,0.00004180795,0.00031485656,0.00036237552,0.55546457,0.44356441,0.0000054296283],"about_ca_topic_score_codex":0.00105322,"about_ca_topic_score_gemma":0.0010894788,"teacher_disagreement_score":0.10776542,"about_ca_system_score_codex":0.0013168098,"about_ca_system_score_gemma":0.00071434106,"threshold_uncertainty_score":0},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05322437,0.00032545906,0.914017,0.00028429498,0.00020486902,0.00019883476,0.00046394192,0.0072021117,0.024079083],"genre_scores_gemma":[0.40462193,0.00034999172,0.57819325,0.00018671941,0.00013415511,0.00028109513,0.0016308492,0.0012139026,0.0133881215],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9991773,0.00015072497,0.00006051923,0.00015313944,0.0002609094,0.00019744804],"domain_scores_gemma":[0.9984668,0.0003601804,0.00006092902,0.0005802773,0.0004494966,0.00008238799],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005698742,0.0007836318,0.0008753317,0.000969613,0.0012273922,0.0016143817,0.001638573,0.0004934406,0.025587363],"category_scores_gemma":[0.0027933351,0.0005085553,0.0010686055,0.0019567944,0.0006955741,0.0018968983,0.0018280796,0.0010920891,0.0043698447],"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.0010238851,0.00042618084,0.0017945218,0.0004478939,0.00012257589,0.00027833937,0.0005936958,0.08214095,0.036078576,0.090741955,0.032528624,0.7538228],"study_design_scores_gemma":[0.00030276363,0.00025413252,0.0005887474,0.00005939682,0.0000767139,0.00021081393,0.00035010354,0.85041314,0.04598013,0.0764195,0.02529568,0.00004882766],"about_ca_topic_score_codex":0.007109207,"about_ca_topic_score_gemma":0.014523133,"teacher_disagreement_score":0.025587363,"about_ca_system_score_codex":0.0008810985,"about_ca_system_score_gemma":0.0015498092,"threshold_uncertainty_score":0.08559823},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0851635,0.00009775952,0.8974419,0.00009083929,0.00007373542,0.00007640519,0.00029067742,0.0038801995,0.01288495],"genre_scores_gemma":[0.552904,0.00011231537,0.43739772,0.0000934783,0.00006696923,0.00016796996,0.0013541213,0.00083670876,0.0070667663],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99787986,0.0002632063,0.0001700756,0.00041799212,0.0009038339,0.00036497894],"domain_scores_gemma":[0.9967321,0.00073961174,0.0002174079,0.0012431169,0.0008949729,0.0001727472],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012598411,0.00091241545,0.0010722083,0.001969953,0.0015596487,0.0028000227,0.0023632261,0.0009547622,0.014760207],"category_scores_gemma":[0.008094278,0.00054736657,0.001042836,0.0021716014,0.0012469122,0.005834952,0.0049953707,0.001946821,0.0038056893],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0010104419,0.00025382335,0.00840539,0.00040938533,0.00012881057,0.0006291607,0.000798493,0.113426425,0.029154714,0.4466825,0.011332315,0.38776863],"study_design_scores_gemma":[0.00007201345,0.00016555126,0.00083216815,0.00006795299,0.00003034539,0.00031630034,0.00023152087,0.5313253,0.0632234,0.3855069,0.018143376,0.00008516657],"about_ca_topic_score_codex":0.001442945,"about_ca_topic_score_gemma":0.0025753973,"teacher_disagreement_score":0.014760207,"about_ca_system_score_codex":0.0012345732,"about_ca_system_score_gemma":0.0010126493,"threshold_uncertainty_score":0.0493778},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.013689318,0.00015400122,0.94389445,0.000107548534,0.000065249646,0.00012420087,0.00045052325,0.033007484,0.00850721],"genre_scores_gemma":[0.2371027,0.00023222159,0.73466295,0.00018549435,0.00009720021,0.00040783765,0.0021994237,0.005075503,0.020036584],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993538,0.00008856932,0.000042239495,0.00013587825,0.0002529712,0.00012647116],"domain_scores_gemma":[0.99930656,0.00019838264,0.000053451076,0.00024385104,0.00013916878,0.000058602833],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000669192,0.0010030952,0.0007078588,0.00096741994,0.00080128416,0.0012719126,0.0015402209,0.0007512684,0.031268775],"category_scores_gemma":[0.0020717327,0.0006119673,0.00091073225,0.0009835857,0.000754926,0.0021227733,0.0020048001,0.0012643147,0.00994998],"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.0010849184,0.00029520498,0.0028295526,0.0007680219,0.00014783021,0.00059941056,0.00073063595,0.02474164,0.04930119,0.09105759,0.06336196,0.7650821],"study_design_scores_gemma":[0.0006718047,0.0010861498,0.0026201499,0.0001861618,0.000121948084,0.0017597128,0.00030834245,0.4829509,0.1675985,0.10879747,0.23366627,0.00023262361],"about_ca_topic_score_codex":0.0008817855,"about_ca_topic_score_gemma":0.001482464,"teacher_disagreement_score":0.031268775,"about_ca_system_score_codex":0.00059920026,"about_ca_system_score_gemma":0.00090281304,"threshold_uncertainty_score":0.10460448},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06640529,0.0006762233,0.9067784,0.00033457082,0.00024356229,0.00013560952,0.00025925145,0.014595118,0.010571928],"genre_scores_gemma":[0.36588052,0.00043651933,0.61953145,0.00025512555,0.00024168535,0.00017675754,0.00073383056,0.0014350621,0.011309054],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99896157,0.00015932877,0.000059374648,0.00017415467,0.00045383954,0.00019171709],"domain_scores_gemma":[0.998055,0.00066555105,0.00013437726,0.00063260394,0.00041681106,0.00009581462],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00077196746,0.0009346673,0.0007888362,0.00095256965,0.00075582543,0.0012145431,0.00096128345,0.00055360777,0.010232672],"category_scores_gemma":[0.004780319,0.00040334655,0.00051782076,0.00105348,0.0007720775,0.0043935124,0.0022601106,0.0010804341,0.0039204583],"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.0011647927,0.00019298604,0.0042604655,0.0005502555,0.00008691283,0.00057440944,0.0005828208,0.02855741,0.05510632,0.0776399,0.035243247,0.79604036],"study_design_scores_gemma":[0.00042819759,0.0009949462,0.003341471,0.00013360276,0.0001073514,0.001934718,0.00027531642,0.4278399,0.29224727,0.102542356,0.16996779,0.00018709118],"about_ca_topic_score_codex":0.00085284945,"about_ca_topic_score_gemma":0.0015893369,"teacher_disagreement_score":0.010232672,"about_ca_system_score_codex":0.00059859006,"about_ca_system_score_gemma":0.00089671207,"threshold_uncertainty_score":0.034231663},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0014869638,0.018399442,0.48964614,0.0060767517,0.004465614,0.00051068945,0.042563252,0.08893853,0.34791255],"genre_scores_gemma":[0.018164111,0.017811324,0.38216957,0.010458067,0.005124362,0.0015132275,0.05655451,0.043070957,0.4651338],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99940443,0.00011751111,0.000052435073,0.00012094152,0.00024275023,0.00006186013],"domain_scores_gemma":[0.9977927,0.0011252862,0.00008578931,0.00017157543,0.00065868656,0.00016593128],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00065925956,0.002302785,0.0013091224,0.003548295,0.00063840725,0.0031656162,0.0017127433,0.0014815002,0.38487643],"category_scores_gemma":[0.005701153,0.00087762764,0.0010374498,0.0036136967,0.00063436484,0.0052934573,0.0020333717,0.0034205155,0.22711977],"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.00009730542,0.000049541544,0.000074891366,0.00066290214,0.000011165535,0.00014152401,0.00016945605,0.001164605,0.0016510069,0.023367237,0.8507861,0.12182435],"study_design_scores_gemma":[0.000014829333,0.000020692147,0.00017106875,0.0001623717,0.0000025500499,0.00025716246,0.00003072601,0.0013395539,0.00038015243,0.022707537,0.9748926,0.00002066367],"about_ca_topic_score_codex":0.0017724937,"about_ca_topic_score_gemma":0.0021440824,"teacher_disagreement_score":0.38487643,"about_ca_system_score_codex":0.0011896482,"about_ca_system_score_gemma":0.0011596632,"threshold_uncertainty_score":0.8773991},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05854542,0.00022916323,0.9341331,0.00024372603,0.000051675022,0.00006968185,0.00018102527,0.0007756996,0.0057704477],"genre_scores_gemma":[0.3319082,0.00027243837,0.661417,0.00011284715,0.0000994321,0.00018853786,0.0009913152,0.00025357795,0.0047566616],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986532,0.00028526457,0.0000885377,0.0002986134,0.00046171344,0.00021262802],"domain_scores_gemma":[0.99847454,0.00083148055,0.00010105466,0.0002712308,0.00025240582,0.00006927306],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010506455,0.0005642613,0.00083094876,0.0017753968,0.001483803,0.0020639405,0.0011944944,0.0006539536,0.0032160152],"category_scores_gemma":[0.0041353544,0.00046189153,0.0013987828,0.0015723146,0.0014026152,0.0033063346,0.002439884,0.0018886521,0.0009993655],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00027378736,0.00012980396,0.0022535217,0.0003045019,0.00006427024,0.00022147545,0.00063226867,0.06672337,0.012933159,0.67902213,0.005587715,0.23185404],"study_design_scores_gemma":[0.000031779407,0.00005271033,0.00046797225,0.000034019657,0.00003497409,0.00012798604,0.00012229051,0.27811134,0.013026747,0.7005598,0.007396062,0.00003429796],"about_ca_topic_score_codex":0.0011040884,"about_ca_topic_score_gemma":0.0015236071,"teacher_disagreement_score":0.0032160152,"about_ca_system_score_codex":0.0011638253,"about_ca_system_score_gemma":0.0014947498,"threshold_uncertainty_score":0.010758698},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5136016,0.0010792878,0.45151392,0.0011052208,0.00010659307,0.00015099865,0.001478112,0.0013181788,0.029646173],"genre_scores_gemma":[0.91548115,0.0006041397,0.07620416,0.0001408469,0.00010584094,0.00010685372,0.0016581417,0.00034205941,0.00535677],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990146,0.0001448374,0.000070781236,0.00032906965,0.00029367508,0.00014708555],"domain_scores_gemma":[0.988983,0.007829697,0.0007646174,0.0011296106,0.0007170063,0.0005759882],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009529882,0.0009901479,0.001161213,0.0034969072,0.0016024467,0.0044826036,0.002590329,0.0014161033,0.011060701],"category_scores_gemma":[0.012501602,0.00079689507,0.0015823668,0.0035904467,0.0033282042,0.011847832,0.0048298663,0.0034436337,0.0010014375],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00040548484,0.00016702965,0.0051360265,0.0005768612,0.00008667764,0.00024848213,0.0012183698,0.09953073,0.0040514744,0.82356805,0.0050713927,0.059939433],"study_design_scores_gemma":[0.000025257517,0.000071258306,0.0009997286,0.000075680444,0.000044790624,0.00010416605,0.00035019318,0.14660797,0.0024529211,0.84689087,0.0023426784,0.000034502988],"about_ca_topic_score_codex":0.0027748407,"about_ca_topic_score_gemma":0.0037582137,"teacher_disagreement_score":0.011060701,"about_ca_system_score_codex":0.0014268258,"about_ca_system_score_gemma":0.00072656607,"threshold_uncertainty_score":0.03700179},"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":"software","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"software","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010329807,0.00013396113,0.92379844,0.00012182689,0.000091627364,0.00010783828,0.0004864782,0.05652171,0.0084084],"genre_scores_gemma":[0.17248398,0.00021412362,0.79722196,0.00037348378,0.00009504642,0.00028631123,0.0013298236,0.013327851,0.014667379],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99906534,0.00012628692,0.000063519525,0.00022211125,0.0002977238,0.00022510438],"domain_scores_gemma":[0.99846566,0.0005085183,0.00007942064,0.0005386225,0.0002955104,0.00011230621],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009659367,0.0014583506,0.0009959447,0.0010052042,0.0008501249,0.0021816853,0.0025202252,0.0011772896,0.049369548],"category_scores_gemma":[0.0050012213,0.0010262927,0.001578289,0.0013991819,0.00085748715,0.0034110295,0.0031756656,0.0016641896,0.014344086],"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.0026779547,0.00038341657,0.002554109,0.00077722577,0.0002360794,0.00065512606,0.000634545,0.026049327,0.037450176,0.09215929,0.08510944,0.75131327],"study_design_scores_gemma":[0.0010873402,0.00039915266,0.00120748,0.00032314763,0.00022760445,0.00066825096,0.0002593979,0.48021385,0.1592601,0.13107099,0.22500971,0.00027300086],"about_ca_topic_score_codex":0.0036994237,"about_ca_topic_score_gemma":0.0037993977,"teacher_disagreement_score":0.049369548,"about_ca_system_score_codex":0.0008134658,"about_ca_system_score_gemma":0.0012619536,"threshold_uncertainty_score":0.16515756},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.033748765,0.00042035527,0.9295522,0.00021815671,0.00031071887,0.0001637197,0.0004158108,0.0034223667,0.03174805],"genre_scores_gemma":[0.19462684,0.00032964905,0.7771196,0.000120976205,0.00015737217,0.00016233827,0.0013505316,0.00077681453,0.02535592],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990447,0.00014384622,0.000067598856,0.00018926161,0.0004099963,0.0001444701],"domain_scores_gemma":[0.99855036,0.00056157255,0.00007533377,0.00033225352,0.0003906903,0.00008975769],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010793668,0.0011745548,0.0010531523,0.0027644418,0.0014394041,0.0021023713,0.0018501036,0.0006705508,0.02055301],"category_scores_gemma":[0.0040085604,0.0005546681,0.0010450234,0.003172476,0.0009715196,0.0033377572,0.0025421265,0.0017961294,0.005003507],"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.00062593573,0.00018883,0.0012462634,0.0002742709,0.000048457467,0.00012229862,0.00027775424,0.014323891,0.011919688,0.23021838,0.013157666,0.7275966],"study_design_scores_gemma":[0.00025866093,0.00050527236,0.0018224653,0.00016435611,0.00014616366,0.0005006167,0.00040331951,0.3636021,0.054143667,0.49035472,0.08794621,0.00015241782],"about_ca_topic_score_codex":0.0014572594,"about_ca_topic_score_gemma":0.0034497825,"teacher_disagreement_score":0.02055301,"about_ca_system_score_codex":0.0012027124,"about_ca_system_score_gemma":0.0010834803,"threshold_uncertainty_score":0.0687567},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.083126344,0.0010140662,0.6736096,0.0003081594,0.0008728684,0.00014786099,0.00021846523,0.001354202,0.2393484],"genre_scores_gemma":[0.5007993,0.00259354,0.26240602,0.00027906083,0.00060331373,0.00017303931,0.00051595195,0.0017476184,0.23088223],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99964774,0.000063265376,0.000017288916,0.00007379829,0.00014293831,0.000055083452],"domain_scores_gemma":[0.99972624,0.00008331297,0.000025385694,0.000070490605,0.000054482036,0.000040149785],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00038322932,0.0011431413,0.00082827173,0.0013626199,0.0012748629,0.0018310151,0.0007688528,0.0005171103,0.0181078],"category_scores_gemma":[0.0007029253,0.0006452027,0.0007370513,0.0011779963,0.0013686592,0.0028312262,0.001681835,0.0023162477,0.006116647],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000112831454,0.00006346128,0.0001523012,0.00010344611,0.000014958071,0.00014810906,0.00033371354,0.0038459168,0.011880339,0.90186197,0.0044466676,0.077036254],"study_design_scores_gemma":[0.00003107798,0.00015015615,0.00016786518,0.00006988905,0.00002990719,0.00037298928,0.00017125883,0.02324039,0.019004742,0.88447875,0.072239056,0.000043834414],"about_ca_topic_score_codex":0.0006388434,"about_ca_topic_score_gemma":0.0014118536,"teacher_disagreement_score":0.0181078,"about_ca_system_score_codex":0.00068119256,"about_ca_system_score_gemma":0.00040011684,"threshold_uncertainty_score":0.060576618},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009759332,0.00055914704,0.9798306,0.00029756376,0.00020851998,0.000028119848,0.000054769225,0.0007269087,0.008534969],"genre_scores_gemma":[0.24741253,0.0018447912,0.7344904,0.0002692897,0.00058499473,0.00008573273,0.00027915178,0.0007478384,0.014285349],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992304,0.00017681946,0.000050642768,0.00012050867,0.0003318874,0.00008978422],"domain_scores_gemma":[0.9987669,0.00048216205,0.00007006938,0.00043649616,0.00018793286,0.00005640939],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00067014387,0.0009258156,0.0007154625,0.0008008765,0.00071137137,0.0013514542,0.001022452,0.0008260282,0.009198773],"category_scores_gemma":[0.0047752177,0.00036647753,0.000777459,0.0013917754,0.0015783365,0.0021048267,0.0020077522,0.002510729,0.0032616525],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0004477544,0.00014622134,0.0005775229,0.000319571,0.000037176313,0.00047608194,0.00044668902,0.044051323,0.045613777,0.4755645,0.01011351,0.42220584],"study_design_scores_gemma":[0.00006422641,0.00023773973,0.00032862966,0.000076620396,0.00003685284,0.0015506987,0.00009995615,0.48313063,0.077181645,0.37063423,0.06659263,0.00006610631],"about_ca_topic_score_codex":0.00082107517,"about_ca_topic_score_gemma":0.0009579851,"teacher_disagreement_score":0.009198773,"about_ca_system_score_codex":0.00069346104,"about_ca_system_score_gemma":0.0005388072,"threshold_uncertainty_score":0.030772984},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.39730966,0.004518598,0.4602588,0.00847319,0.0006763827,0.00012957361,0.0009667505,0.0016512257,0.12601578],"genre_scores_gemma":[0.9666273,0.0011111872,0.022548258,0.00042760198,0.0005107715,0.00010586981,0.00034866674,0.00023309191,0.008087193],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99736136,0.0005620367,0.000086340435,0.0004991818,0.0009706529,0.00052046805],"domain_scores_gemma":[0.9902018,0.005617147,0.0007014329,0.0016192037,0.0007961666,0.0010643436],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0037499212,0.0018446284,0.001973391,0.0039892606,0.0022632289,0.0038540761,0.0023868436,0.001818162,0.013263231],"category_scores_gemma":[0.018612698,0.00081615226,0.0013319097,0.0014364156,0.0068529397,0.011795372,0.0062879915,0.006464788,0.00150856],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00014552815,0.000048714177,0.0010868058,0.00011101563,0.000023947574,0.00011776185,0.00010957523,0.0124315545,0.0028390556,0.97291374,0.0023138085,0.007858588],"study_design_scores_gemma":[0.000024121982,0.000053506086,0.0008221,0.00005189545,0.000024295412,0.00017295728,0.000052507876,0.08071393,0.0030430441,0.9119166,0.0030760646,0.00004898162],"about_ca_topic_score_codex":0.0009908401,"about_ca_topic_score_gemma":0.0010224471,"teacher_disagreement_score":0.013263231,"about_ca_system_score_codex":0.0031720586,"about_ca_system_score_gemma":0.00089745136,"threshold_uncertainty_score":0.044369936},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.015705006,0.000295596,0.9788871,0.00027842604,0.00011046131,0.000085886684,0.00014665474,0.0014677697,0.0030231625],"genre_scores_gemma":[0.18709828,0.00053788983,0.802392,0.00026157056,0.00031300748,0.0002937846,0.0009168188,0.0003721706,0.007814448],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989612,0.0002167137,0.00006550659,0.00019553167,0.00042380096,0.00013717335],"domain_scores_gemma":[0.99760336,0.0010755333,0.0001467438,0.00062922935,0.0004218395,0.00012336495],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011178831,0.0012193762,0.001022191,0.0012900003,0.0010161041,0.0017712169,0.001449143,0.001051459,0.009584542],"category_scores_gemma":[0.0076679494,0.0005484259,0.0008600759,0.0020236888,0.0010077428,0.003945585,0.003040174,0.0027073284,0.0033376873],"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.00062179356,0.0002230757,0.00096513616,0.0002843205,0.00008691379,0.000073166906,0.00029644978,0.06208115,0.012685241,0.20276846,0.014500447,0.7054139],"study_design_scores_gemma":[0.00018491555,0.000163097,0.00035968327,0.000048567686,0.00005316509,0.000117049625,0.00016627574,0.44195923,0.011278473,0.5350947,0.010528702,0.000046157696],"about_ca_topic_score_codex":0.0014850096,"about_ca_topic_score_gemma":0.004345329,"teacher_disagreement_score":0.009584542,"about_ca_system_score_codex":0.0008168946,"about_ca_system_score_gemma":0.0014184695,"threshold_uncertainty_score":0.032063484},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5821926,0.00049485464,0.27681607,0.001046013,0.000439996,0.000087776665,0.00015900258,0.000677098,0.13808659],"genre_scores_gemma":[0.95849496,0.00017547076,0.029478041,0.0002889398,0.00007319001,0.00003507317,0.00007122657,0.00012037636,0.01126267],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9997545,0.000061361316,0.000011175588,0.00004282448,0.00008132333,0.00004882353],"domain_scores_gemma":[0.99961394,0.00007657203,0.00004703549,0.00011240031,0.000075232274,0.000074811156],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00032267638,0.000381928,0.00028365178,0.00083899207,0.0007084338,0.001232203,0.0006408649,0.0007991715,0.003883451],"category_scores_gemma":[0.001167877,0.0001933713,0.0003818843,0.00053679623,0.001608749,0.0017329479,0.0009877189,0.00097242167,0.00037442546],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010970275,0.000006510964,0.00015108827,0.000016968714,0.0000023472553,0.00008970297,0.00008556562,0.0010316436,0.0026645265,0.9928269,0.00035902564,0.002754657],"study_design_scores_gemma":[0.00001636503,0.000023835333,0.00040644882,0.00001886147,0.000007126262,0.00034188922,0.00015490266,0.037273318,0.0035096118,0.9542422,0.0039790547,0.000026385676],"about_ca_topic_score_codex":0.0007576462,"about_ca_topic_score_gemma":0.0009688788,"teacher_disagreement_score":0.003883451,"about_ca_system_score_codex":0.00050750136,"about_ca_system_score_gemma":0.00043069504,"threshold_uncertainty_score":0.012991428},"labels":[],"label_agreement":null},{"id":"W4312122229","doi":"10.1090/mcom/3888","title":"Computing error bounds for asymptotic expansions of regular P-recursive sequences","year":2023,"lang":"en","type":"article","venue":"Mathematics of Computation","topic":"Polynomial and algebraic computation","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada; Agence Nationale de la Recherche","keywords":"Mathematics; Sequence (biology); Symbolic computation; Asymptotic expansion; Polynomial; Uniqueness; Computation; Asymptotic analysis; Gravitational singularity; Singularity; Applied mathematics; Algebra over a field; Algorithm; Pure mathematics; Mathematical analysis","score_opus":0.0347644148784825,"score_gpt":0.30408699170061,"score_spread":0.26932257682212746,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4312122229","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05713406,0.000115969226,0.9382202,0.00013351873,0.00003550559,0.000046666184,0.000034130317,0.00086988206,0.003410008],"genre_scores_gemma":[0.48466173,0.00021525516,0.5106208,0.00011396818,0.000066825756,0.00017118998,0.0002482587,0.0006541429,0.003247884],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.997338,0.0007308362,0.00018581776,0.00028503215,0.0012580921,0.00020218031],"domain_scores_gemma":[0.98273796,0.012790832,0.0010426891,0.0013494956,0.0017223192,0.00035674727],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0055480334,0.0009224755,0.0007682926,0.0031035244,0.0007903987,0.0018064901,0.0015581346,0.0010137206,0.0025757316],"category_scores_gemma":[0.0537215,0.0004768146,0.0007157421,0.0011471699,0.0029271075,0.0031885053,0.0030508908,0.0023417438,0.0009504981],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00028042422,0.0001100895,0.005718364,0.00026081668,0.000058267036,0.0002782157,0.000894195,0.32645053,0.012310301,0.51561373,0.0016001782,0.13642488],"study_design_scores_gemma":[0.000011076165,0.00004583707,0.0003200337,0.000042244083,0.0000072212683,0.000052180654,0.000060384165,0.82572156,0.007137394,0.1655658,0.0010180286,0.000018232517],"about_ca_topic_score_codex":0.0014128011,"about_ca_topic_score_gemma":0.0021481775,"teacher_disagreement_score":0.0055480334,"about_ca_system_score_codex":0.001718622,"about_ca_system_score_gemma":0.0012666453,"threshold_uncertainty_score":0.029341161},"labels":[],"label_agreement":null},{"id":"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.015007399,0.0009823657,0.9651828,0.0005632881,0.00021010936,0.00012229034,0.0004650743,0.003881639,0.013585062],"genre_scores_gemma":[0.22659746,0.0009797672,0.7506426,0.00026404715,0.0003845597,0.0002873888,0.001804915,0.0011027459,0.01793662],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.998694,0.00030280653,0.000108895016,0.00029108376,0.00038367926,0.00021952383],"domain_scores_gemma":[0.997823,0.0010155628,0.00012750109,0.00060320686,0.00032001786,0.00011075987],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014210586,0.0010851331,0.0010315577,0.0017856983,0.0009006878,0.003225713,0.0020098763,0.00082675536,0.016942887],"category_scores_gemma":[0.008456587,0.00052144093,0.0010744066,0.0023495157,0.000756515,0.0050342837,0.0026093794,0.001986297,0.0056219553],"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.00033792827,0.00017388232,0.0013057857,0.00036160855,0.00010728282,0.00012383627,0.00027769466,0.06485344,0.0032156517,0.36954638,0.024315856,0.5353806],"study_design_scores_gemma":[0.00011081899,0.00005565021,0.00021389437,0.000071910625,0.000032951917,0.00013128492,0.00010241645,0.42069072,0.0032620116,0.5498929,0.025410999,0.000024380153],"about_ca_topic_score_codex":0.0015664673,"about_ca_topic_score_gemma":0.0033022135,"teacher_disagreement_score":0.016942887,"about_ca_system_score_codex":0.0013367516,"about_ca_system_score_gemma":0.0013189128,"threshold_uncertainty_score":0.056679606},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.012552853,0.00007486502,0.9795991,0.000060535625,0.000058552007,0.00004595116,0.00014191287,0.0020610357,0.0054052537],"genre_scores_gemma":[0.12222878,0.00014439107,0.8691317,0.000061134946,0.00006175962,0.00007028923,0.0006758318,0.00039412876,0.0072319545],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993569,0.0000758803,0.0000457847,0.00012056935,0.00031271967,0.00008820402],"domain_scores_gemma":[0.9993616,0.00015602191,0.000049203027,0.00013547121,0.0002575543,0.000040157112],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00061082107,0.00074955256,0.00054108276,0.0016444902,0.00076992076,0.0010019109,0.0011375059,0.00038157534,0.009400561],"category_scores_gemma":[0.0023112064,0.00033462615,0.0006266808,0.0015687331,0.0005915164,0.0019862424,0.0015652784,0.0012202582,0.0025281697],"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.00035105343,0.000096977914,0.0012622669,0.00021836311,0.00003912258,0.00019635867,0.0003157624,0.04896672,0.034128733,0.1814047,0.01062224,0.72239774],"study_design_scores_gemma":[0.00011968884,0.0002936033,0.00087335595,0.00005042432,0.000046232657,0.0004982268,0.0002010248,0.7096588,0.10272812,0.11450682,0.07089633,0.00012731375],"about_ca_topic_score_codex":0.0016061418,"about_ca_topic_score_gemma":0.003347328,"teacher_disagreement_score":0.009400561,"about_ca_system_score_codex":0.00070078595,"about_ca_system_score_gemma":0.001007472,"threshold_uncertainty_score":0.031448066},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8857222,0.00019860861,0.09031763,0.00052540214,0.000048096572,0.000058936796,0.00008381873,0.00016919164,0.022875963],"genre_scores_gemma":[0.98213506,0.00011335481,0.008504209,0.00007668477,0.000082583065,0.000050045706,0.00005255575,0.000042525,0.008943062],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99946994,0.00015192234,0.00003022534,0.00010821757,0.0001277253,0.00011190083],"domain_scores_gemma":[0.99915516,0.00021089226,0.00023313389,0.00011523368,0.00011388616,0.00017177203],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00082776515,0.00040108702,0.00046387664,0.0015387946,0.0013382101,0.0015394232,0.0005383955,0.0004855708,0.0032904092],"category_scores_gemma":[0.0015383572,0.00025594005,0.00071480323,0.00061847875,0.0029336642,0.0031566776,0.0016935114,0.0011778398,0.00039019185],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000039911214,0.000029703118,0.0006156816,0.000024403615,0.000009465778,0.00019931605,0.0008214323,0.0012210096,0.0032670768,0.98818356,0.00021488772,0.005373575],"study_design_scores_gemma":[0.00002555797,0.000074135,0.00093392585,0.000013808677,0.00001260274,0.0002399943,0.00038193012,0.009169699,0.0028073366,0.9827319,0.0035871577,0.000021990367],"about_ca_topic_score_codex":0.0004264141,"about_ca_topic_score_gemma":0.00036993244,"teacher_disagreement_score":0.0032904092,"about_ca_system_score_codex":0.0010185859,"about_ca_system_score_gemma":0.00041794177,"threshold_uncertainty_score":0.011007547},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.041945554,0.0050577144,0.56367016,0.0029172527,0.0047446,0.00009810753,0.00087260426,0.0013186693,0.37937534],"genre_scores_gemma":[0.6716333,0.005329844,0.13441606,0.0024672707,0.0039677466,0.0002835342,0.0021389297,0.0027386746,0.17702457],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9978563,0.0004757274,0.00011031659,0.00058194576,0.0005860264,0.00038969447],"domain_scores_gemma":[0.99826187,0.0005761734,0.0001858406,0.00032606086,0.0004849033,0.00016505897],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015906646,0.0015319795,0.00080309843,0.0018152092,0.0022353576,0.0037453778,0.001089209,0.00083391933,0.026258545],"category_scores_gemma":[0.005788569,0.0007305559,0.001677673,0.0016796867,0.004144084,0.0063104406,0.0048533925,0.0037612393,0.011017737],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000042579806,0.000012747631,0.00020017609,0.00008693242,0.000012451608,0.00017306836,0.00051858043,0.0006048739,0.0010023348,0.9706434,0.011957837,0.014745061],"study_design_scores_gemma":[0.0000113293,0.000045116507,0.0002632505,0.00005012169,0.00001798632,0.00031418414,0.00016146322,0.0034651428,0.0016521184,0.9365671,0.05743176,0.000020337522],"about_ca_topic_score_codex":0.0016619033,"about_ca_topic_score_gemma":0.0011814508,"teacher_disagreement_score":0.026258545,"about_ca_system_score_codex":0.0013861511,"about_ca_system_score_gemma":0.00064505514,"threshold_uncertainty_score":0.08784366},"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":"methods","genre_gemma":"software","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"software","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0050495556,0.00039250724,0.9414311,0.00067484647,0.00030844877,0.00006614047,0.0017273704,0.015137022,0.03521293],"genre_scores_gemma":[0.11090926,0.0011024447,0.83428884,0.00097048463,0.0008297227,0.00062660297,0.0056513553,0.01802501,0.027596373],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99706036,0.0008411039,0.0001592939,0.0003106676,0.0014479917,0.00018064104],"domain_scores_gemma":[0.9964322,0.0015913564,0.000181699,0.0008917443,0.00073198933,0.00017099443],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0032804343,0.0012379186,0.0015415068,0.0034320382,0.0014016739,0.006036863,0.002939018,0.0007173291,0.031700194],"category_scores_gemma":[0.01078267,0.0008851599,0.001719748,0.003364588,0.002426803,0.0072584297,0.0035616409,0.005727172,0.017767413],"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.000028210216,0.00003574393,0.00027437686,0.000106174564,0.000018179282,0.00007158791,0.00026186867,0.0034357856,0.00074001186,0.9294608,0.027988689,0.037578516],"study_design_scores_gemma":[0.00003195963,0.00001313933,0.00025613085,0.00006913492,0.000010616045,0.000096546275,0.000045509518,0.028447827,0.0020981717,0.87957305,0.08931171,0.000046217196],"about_ca_topic_score_codex":0.0016160081,"about_ca_topic_score_gemma":0.0027453497,"teacher_disagreement_score":0.031700194,"about_ca_system_score_codex":0.0017359076,"about_ca_system_score_gemma":0.002054378,"threshold_uncertainty_score":0.10604769},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.115482114,0.0035031848,0.6580078,0.004108242,0.00043894694,0.00011861557,0.00057501445,0.0008078391,0.21695817],"genre_scores_gemma":[0.8836134,0.0014292526,0.075442664,0.0018065103,0.00036145453,0.00012194536,0.0003944212,0.00013865373,0.03669179],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99873644,0.00032161784,0.000072262184,0.00020400855,0.00046295283,0.0002028132],"domain_scores_gemma":[0.9991468,0.00026637,0.00007233436,0.00011615743,0.00027092124,0.00012736136],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013349424,0.00034559667,0.00024016724,0.0015393207,0.0011757307,0.0018256762,0.0008662872,0.00061258406,0.005308986],"category_scores_gemma":[0.0017971222,0.00023715317,0.00059596513,0.0011157889,0.004613444,0.0043379148,0.0028036975,0.0014367691,0.0007319761],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000029560813,0.0000028282573,0.00006760916,0.000010794123,0.0000017265442,0.000023653192,0.00016629956,0.00020176783,0.0003013672,0.99628335,0.00028898433,0.0026485827],"study_design_scores_gemma":[0.000004228445,0.000010622425,0.00021366254,0.000013783748,0.000005164648,0.00007155509,0.00013378734,0.0016949225,0.0007026005,0.9773719,0.019768674,0.0000090963495],"about_ca_topic_score_codex":0.003040443,"about_ca_topic_score_gemma":0.002281687,"teacher_disagreement_score":0.005308986,"about_ca_system_score_codex":0.0023059675,"about_ca_system_score_gemma":0.00090852863,"threshold_uncertainty_score":0.017760336},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0018825182,0.008858886,0.019673582,0.004827566,0.001969037,0.000017023554,0.0001666759,0.00012077526,0.96248406],"genre_scores_gemma":[0.19340497,0.014472996,0.017418139,0.0040098247,0.0077614156,0.0001480761,0.0005133393,0.0003037448,0.7619675],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99966633,0.00009110922,0.000011214403,0.00006736115,0.00012248736,0.000041468076],"domain_scores_gemma":[0.99972063,0.00012299961,0.0000133191215,0.000059117538,0.00006126071,0.00002267185],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004049159,0.00057347585,0.00057145406,0.0010805695,0.0016593388,0.0031039242,0.00063566543,0.0010037611,0.019763762],"category_scores_gemma":[0.0011284525,0.00038732527,0.00056236377,0.0011401274,0.0044356324,0.0052450076,0.0011932168,0.0035732293,0.0066000465],"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.0000019796698,0.0000025751451,0.000009829763,0.000013508618,0.0000012323343,0.000003836201,0.00007113592,0.000049422324,0.000055269036,0.97998273,0.014317849,0.00549055],"study_design_scores_gemma":[0.000002480258,0.0000023329928,0.00004296467,0.000011252642,0.0000013975194,0.000024474719,0.000023136732,0.000115105264,0.000057316636,0.8716954,0.1280219,0.0000023243983],"about_ca_topic_score_codex":0.0011663028,"about_ca_topic_score_gemma":0.0012181149,"teacher_disagreement_score":0.019763762,"about_ca_system_score_codex":0.0020269984,"about_ca_system_score_gemma":0.001239208,"threshold_uncertainty_score":0.06611639},"labels":[],"label_agreement":null},{"id":"W4361200815","doi":"10.1090/mcom/3849","title":"Sparse trace tests","year":2023,"lang":"en","type":"article","venue":"Mathematics of Computation","topic":"Polynomial and algebraic computation","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"National Science Foundation","keywords":"Mathematics; TRACE (psycholinguistics); Extension (predicate logic); Algebraic number; Set (abstract data type); Sparse approximation; Polynomial; Applied mathematics; Algebra over a field; Algorithm; Pure mathematics; Mathematical analysis; Computer science","score_opus":0.03140312312006853,"score_gpt":0.27760300026785845,"score_spread":0.2461998771477899,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4361200815","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.34569585,0.00012871591,0.61747867,0.00064966135,0.00012082197,0.00022575574,0.0006552181,0.001621688,0.03342373],"genre_scores_gemma":[0.9595079,0.000064415355,0.035692547,0.00012375033,0.00007998689,0.000116489944,0.00047844343,0.00022208349,0.0037144576],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9971154,0.0004980463,0.00010361952,0.00042100134,0.0015170039,0.0003450257],"domain_scores_gemma":[0.98430264,0.008468418,0.0020686144,0.0020324807,0.00231869,0.000809021],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020794591,0.0008621801,0.00084364536,0.0021022102,0.000822861,0.0018146217,0.0016579601,0.00091264246,0.01146357],"category_scores_gemma":[0.03966218,0.00034808405,0.0005000879,0.0013423625,0.0028774901,0.0052033616,0.004017501,0.0014840856,0.0012406365],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0007279114,0.00025414614,0.016576579,0.00022749465,0.00006997762,0.00051543646,0.0005764379,0.123176895,0.024333987,0.7207438,0.00419619,0.10860115],"study_design_scores_gemma":[0.00006113308,0.00031611774,0.001707014,0.000040657873,0.000019723868,0.000295453,0.00020523774,0.51237273,0.022981586,0.45865783,0.0032929815,0.00004946715],"about_ca_topic_score_codex":0.00095985574,"about_ca_topic_score_gemma":0.00080264214,"teacher_disagreement_score":0.01146357,"about_ca_system_score_codex":0.00077254814,"about_ca_system_score_gemma":0.0011943494,"threshold_uncertainty_score":0.03834951},"labels":[],"label_agreement":null},{"id":"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0239152,0.0021682512,0.66722745,0.011679995,0.005065519,0.00013873915,0.000758308,0.0010924817,0.28795403],"genre_scores_gemma":[0.5944826,0.0030833583,0.27873048,0.0050144494,0.0027993077,0.00037511674,0.0006022724,0.0009776909,0.11393472],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99872655,0.00017274787,0.000066000575,0.00021010856,0.0006737216,0.00015089914],"domain_scores_gemma":[0.9986224,0.00043909554,0.00007017051,0.00020343023,0.00055317534,0.000111741225],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016972327,0.00069931586,0.0007179727,0.0012315806,0.001759245,0.002339349,0.0014262233,0.00082539243,0.016725518],"category_scores_gemma":[0.0035451471,0.00045388285,0.0011167588,0.0008302808,0.002820253,0.0038200154,0.0037717028,0.0037263227,0.0024691983],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000063743237,0.000015839376,0.00004586358,0.000033187825,0.000003216725,0.0000847312,0.000075029675,0.00023498248,0.00095187424,0.9903116,0.004363727,0.0038735636],"study_design_scores_gemma":[0.000016689151,0.00001695006,0.00016545597,0.00003976806,0.0000060901903,0.00021101178,0.000051704646,0.0062008966,0.002386103,0.9431221,0.04776565,0.000017576042],"about_ca_topic_score_codex":0.001429341,"about_ca_topic_score_gemma":0.001822974,"teacher_disagreement_score":0.016725518,"about_ca_system_score_codex":0.0022629586,"about_ca_system_score_gemma":0.0015764169,"threshold_uncertainty_score":0.05595243},"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":"editorial","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0009846498,0.0047712736,0.007295165,0.077960804,0.88708544,0.00007387092,0.000855308,0.0013439237,0.019629618],"genre_scores_gemma":[0.06015496,0.010560356,0.009451697,0.049412496,0.5086163,0.0002552696,0.0032601922,0.0029294814,0.35535923],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99356705,0.0013316097,0.00038745935,0.0015089294,0.0026485983,0.00055642385],"domain_scores_gemma":[0.9883913,0.0021191076,0.00046110875,0.0012814734,0.0066337353,0.0011133916],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00409687,0.002090025,0.002479125,0.003188302,0.0024382805,0.0031328949,0.0033783508,0.0034017928,0.08705663],"category_scores_gemma":[0.026093492,0.0007103241,0.0021195353,0.001803181,0.002304646,0.0032381308,0.0028996456,0.0034811539,0.039261837],"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.00008851117,0.000031149735,0.00019151953,0.00028841305,0.00005121818,0.00022359833,0.00007575088,0.00018762151,0.0002628045,0.009760438,0.97538334,0.013455681],"study_design_scores_gemma":[0.000077093915,0.000083085135,0.0015271171,0.00016024047,0.000103799,0.0006776573,0.0000690223,0.0021189386,0.0013613661,0.017610593,0.9761278,0.00008326583],"about_ca_topic_score_codex":0.0058402517,"about_ca_topic_score_gemma":0.005324654,"teacher_disagreement_score":0.08705663,"about_ca_system_score_codex":0.0054278728,"about_ca_system_score_gemma":0.0025604581,"threshold_uncertainty_score":0.29123348},"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.19186927,0.0029740538,0.11742787,0.07479091,0.009211292,0.00023700735,0.0048584742,0.002651084,0.59598],"genre_scores_gemma":[0.83015406,0.0018978443,0.037837576,0.00950845,0.005958961,0.00038532104,0.005615303,0.0013562408,0.10728621],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9981699,0.0003388232,0.000065855485,0.00044764392,0.00053638744,0.00044144882],"domain_scores_gemma":[0.9966413,0.0014972539,0.00022199239,0.00072080345,0.0005330585,0.000385643],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016295159,0.0014076139,0.0015426816,0.0011666685,0.0033395216,0.005892337,0.0015209696,0.0033238097,0.036491662],"category_scores_gemma":[0.006478106,0.0007133407,0.0015362961,0.001356644,0.0045950348,0.012861859,0.0044688657,0.008523758,0.008542396],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00022253838,0.00006982389,0.00037767066,0.00023228042,0.000015119841,0.00019667902,0.00030302585,0.001503216,0.00086804834,0.9194789,0.06565505,0.011077742],"study_design_scores_gemma":[0.00004410137,0.000013200882,0.00024968406,0.000021777365,0.0000065701606,0.00010482814,0.00008406774,0.002196584,0.00056861417,0.9802494,0.016438803,0.000022365926],"about_ca_topic_score_codex":0.0023469175,"about_ca_topic_score_gemma":0.0017287378,"teacher_disagreement_score":0.036491662,"about_ca_system_score_codex":0.0015669343,"about_ca_system_score_gemma":0.0022392974,"threshold_uncertainty_score":0.12207675},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0043189097,0.00007391592,0.9838418,0.00012509603,0.000056711902,0.00004229376,0.000088129695,0.0043187058,0.0071345726],"genre_scores_gemma":[0.1225785,0.00025040863,0.86649096,0.00016170033,0.000103336526,0.00024961703,0.00035520748,0.0034604885,0.0063497294],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.999241,0.00018900132,0.00005584317,0.00010934032,0.0003146679,0.000090088884],"domain_scores_gemma":[0.9975261,0.0013470814,0.00010200758,0.00061302865,0.0003377098,0.0000739897],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002015911,0.0010147667,0.00082927896,0.0019208712,0.0010976179,0.0023582927,0.0022407605,0.0009914903,0.021494273],"category_scores_gemma":[0.008599264,0.0005186655,0.0012675324,0.001469191,0.0017035577,0.004269793,0.0031269123,0.0038470072,0.006697903],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008073033,0.00009585583,0.0013276845,0.00033166277,0.00005310611,0.0001651989,0.00050266366,0.030181998,0.004327134,0.7505917,0.008682512,0.20365988],"study_design_scores_gemma":[0.000052438932,0.00004680274,0.00024708975,0.00011352581,0.000025492043,0.00013201727,0.000114104,0.26962724,0.008977899,0.6854385,0.035184655,0.000040179417],"about_ca_topic_score_codex":0.0014515021,"about_ca_topic_score_gemma":0.0022876717,"teacher_disagreement_score":0.021494273,"about_ca_system_score_codex":0.0010000212,"about_ca_system_score_gemma":0.0014368205,"threshold_uncertainty_score":0.071905494},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6543535,0.0008883586,0.20020373,0.0022363607,0.0004296428,0.000082038925,0.00039938337,0.0010619123,0.14034513],"genre_scores_gemma":[0.9606553,0.00046917485,0.010951578,0.00026318975,0.0005109916,0.00009860555,0.000332406,0.0003313764,0.026387399],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992162,0.00024166839,0.000024737283,0.00009741554,0.00022787957,0.00019205733],"domain_scores_gemma":[0.99698985,0.0014565369,0.00044285302,0.00023705853,0.00033941914,0.0005342737],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012411139,0.0012415448,0.0010255215,0.003968323,0.0016179727,0.0038394004,0.0018303161,0.0018397657,0.013538523],"category_scores_gemma":[0.007945692,0.0006826343,0.000932122,0.0017261304,0.0031016602,0.0033856153,0.0022591904,0.0030805364,0.0018247389],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000054345353,0.00004262293,0.00055694743,0.0000386386,0.000006350383,0.00012720101,0.00022953442,0.00240846,0.0013147651,0.98665255,0.0016820056,0.0068866205],"study_design_scores_gemma":[0.000022438633,0.000025993722,0.0008043995,0.000035025074,0.000009223439,0.00024985394,0.00011770679,0.02647879,0.00086660247,0.9697953,0.0015713715,0.000023350049],"about_ca_topic_score_codex":0.0010976378,"about_ca_topic_score_gemma":0.0007296692,"teacher_disagreement_score":0.013538523,"about_ca_system_score_codex":0.0020378926,"about_ca_system_score_gemma":0.0007192807,"threshold_uncertainty_score":0.045290828},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008208314,0.000107140404,0.986177,0.0002003407,0.000057699053,0.000057771405,0.000107057465,0.002253965,0.0028305699],"genre_scores_gemma":[0.10716216,0.0001119642,0.8856998,0.0001968916,0.0000670941,0.00011975998,0.0004342396,0.00047263288,0.0057354216],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989778,0.00017365166,0.000055136697,0.00027965286,0.0003072244,0.00020657686],"domain_scores_gemma":[0.9984315,0.00052840344,0.00009829211,0.00050319097,0.0002785829,0.0001599532],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00092741946,0.00073865836,0.0010276473,0.0008202005,0.001018843,0.0014923895,0.0012807741,0.001223606,0.010629489],"category_scores_gemma":[0.0043761265,0.0004411831,0.00088214816,0.0010284329,0.00093203684,0.0031290846,0.0025603997,0.00179931,0.004113143],"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.0008856345,0.0002688089,0.0015359866,0.00034713943,0.00007342164,0.00040236826,0.0004021818,0.07397758,0.029837236,0.19049443,0.026837582,0.67493767],"study_design_scores_gemma":[0.00019904267,0.00019211955,0.00027825165,0.000062454106,0.000033910437,0.0004941458,0.000092727685,0.760225,0.020252358,0.19164467,0.026459107,0.00006618365],"about_ca_topic_score_codex":0.0014119644,"about_ca_topic_score_gemma":0.0022321884,"teacher_disagreement_score":0.010629489,"about_ca_system_score_codex":0.000636833,"about_ca_system_score_gemma":0.0016053115,"threshold_uncertainty_score":0.035559118},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05455855,0.00026861252,0.93475425,0.0003660328,0.0000623554,0.00012416093,0.0002937299,0.0031110072,0.0064613684],"genre_scores_gemma":[0.31445357,0.0003474117,0.6762747,0.00015426302,0.00013577347,0.00026412267,0.0014501432,0.000724927,0.0061951],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99787235,0.00034757686,0.00016113989,0.0005343304,0.00073302427,0.0003515771],"domain_scores_gemma":[0.99533576,0.0021982216,0.0003024585,0.0012012126,0.000755209,0.00020711325],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017008934,0.0011229904,0.0009515692,0.002121179,0.0008146775,0.002683214,0.002466672,0.0009929764,0.005240549],"category_scores_gemma":[0.011076317,0.0005175008,0.0012303296,0.0020625335,0.0016665182,0.0074694087,0.003455482,0.002053595,0.0019375344],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0004904975,0.00026602554,0.0053253644,0.00036559088,0.00008192558,0.00015907154,0.0009186021,0.046953753,0.010356492,0.46905333,0.009947291,0.45608202],"study_design_scores_gemma":[0.00012801882,0.00012255582,0.00079328485,0.000053079708,0.00003941116,0.00025048305,0.0002851524,0.2616802,0.016737707,0.7094998,0.010326782,0.000083487306],"about_ca_topic_score_codex":0.0016816909,"about_ca_topic_score_gemma":0.0028447595,"teacher_disagreement_score":0.005240549,"about_ca_system_score_codex":0.0019186393,"about_ca_system_score_gemma":0.0017580129,"threshold_uncertainty_score":0.017531395},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.027274206,0.0033278093,0.9309969,0.007447825,0.00025900436,0.0002807206,0.00017074044,0.0034367538,0.026806084],"genre_scores_gemma":[0.3303708,0.003412532,0.65241843,0.001532746,0.00044263946,0.0006463668,0.00030703607,0.0007330983,0.010136289],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9942846,0.0021913678,0.00028891442,0.00073147967,0.002174775,0.00032879278],"domain_scores_gemma":[0.9883354,0.006915261,0.00034306623,0.00288792,0.0013051569,0.00021313131],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00427582,0.0009220611,0.0010587263,0.0013746002,0.0013519434,0.0026039232,0.003630206,0.0016338581,0.015776822],"category_scores_gemma":[0.014915293,0.0007312546,0.0010297442,0.0020083713,0.0030193727,0.007721624,0.0026758104,0.0044288365,0.008450304],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00060808513,0.00024735546,0.0010056051,0.0010026213,0.000092380724,0.00010733105,0.0004874259,0.038222577,0.011044614,0.54833674,0.015632795,0.38321245],"study_design_scores_gemma":[0.00027767124,0.00037691902,0.0004184007,0.00025731456,0.000033463006,0.00032361978,0.00028700504,0.5940827,0.024444545,0.33029443,0.04906108,0.00014277433],"about_ca_topic_score_codex":0.0024247942,"about_ca_topic_score_gemma":0.0028296474,"teacher_disagreement_score":0.015776822,"about_ca_system_score_codex":0.0023916878,"about_ca_system_score_gemma":0.0040125395,"threshold_uncertainty_score":0.05277872},"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":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0011603164,0.08826967,0.1116065,0.006465466,0.01000927,0.000091622234,0.0016241049,0.0020674027,0.77870554],"genre_scores_gemma":[0.013533586,0.039096665,0.02605933,0.0014419422,0.006847357,0.00015969797,0.0009434351,0.0009339589,0.91098416],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9993587,0.000101594065,0.000028256944,0.00008689287,0.0004013726,0.000023234217],"domain_scores_gemma":[0.9991037,0.00044526835,0.000041246207,0.00014961592,0.00020925049,0.00005092702],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005585792,0.0016466358,0.0017822974,0.0028091273,0.000950841,0.003779544,0.00094059424,0.00083200337,0.05850877],"category_scores_gemma":[0.0028265978,0.0006382254,0.00053320546,0.0064448253,0.001756968,0.0033503135,0.0011899151,0.003417107,0.043189928],"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.000012139639,0.000030312925,0.000085071144,0.0003736317,0.000014881571,0.000040908657,0.00012772482,0.0011493514,0.00047565336,0.26980323,0.56091285,0.16697428],"study_design_scores_gemma":[0.0000050324343,0.000013858035,0.0002957049,0.00010743147,0.000009000009,0.0001336142,0.000039778773,0.002785033,0.00024024813,0.24090226,0.7554541,0.000013775038],"about_ca_topic_score_codex":0.002225367,"about_ca_topic_score_gemma":0.0036971977,"teacher_disagreement_score":0.05850877,"about_ca_system_score_codex":0.0015617752,"about_ca_system_score_gemma":0.0017720415,"threshold_uncertainty_score":0.19573134},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15313555,0.00037336716,0.81848615,0.0015377856,0.0002754564,0.00017838104,0.00027888926,0.0013555447,0.024378976],"genre_scores_gemma":[0.9503117,0.00020210785,0.042425696,0.00025043893,0.00011609176,0.0001165846,0.00013607042,0.00016280464,0.006278442],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99617153,0.0007130132,0.0002711968,0.00055114133,0.0012870366,0.0010060485],"domain_scores_gemma":[0.9950081,0.0014869553,0.00039230194,0.0024240834,0.0004549966,0.00023363395],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002582982,0.0005333577,0.0010804335,0.00060177717,0.0014765391,0.0041437363,0.0013110002,0.0016276869,0.004160914],"category_scores_gemma":[0.005245172,0.00059967814,0.0012943144,0.00083151634,0.003244327,0.008546326,0.0062305178,0.0036364584,0.0011874965],"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.000272748,0.00008146073,0.00017775172,0.00008281379,0.00002735857,0.0001715091,0.0003707926,0.0061978824,0.0062939986,0.97399646,0.0014132491,0.010914002],"study_design_scores_gemma":[0.000098863355,0.00008453046,0.00019274974,0.00005641564,0.0000781442,0.00019512803,0.00011871886,0.0760663,0.02182538,0.89561945,0.005580109,0.00008423897],"about_ca_topic_score_codex":0.0004527414,"about_ca_topic_score_gemma":0.00035198717,"teacher_disagreement_score":0.004160914,"about_ca_system_score_codex":0.0015970081,"about_ca_system_score_gemma":0.0018434331,"threshold_uncertainty_score":0.0139196515},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009280229,0.0001215692,0.98270506,0.00007119101,0.00003775237,0.000020817544,0.000041519328,0.00044227813,0.0072795767],"genre_scores_gemma":[0.34722254,0.00038879225,0.64077455,0.00007546208,0.00008605852,0.00010540834,0.00026421223,0.00033340615,0.0107495375],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99970573,0.0000793039,0.000011822824,0.000038217207,0.00013309458,0.000031751173],"domain_scores_gemma":[0.99957985,0.00025627334,0.000023404413,0.000077532306,0.00005116281,0.000011829071],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003539744,0.00068318984,0.0008991684,0.00041263565,0.0003427911,0.00079590885,0.00081655366,0.0006545347,0.006956594],"category_scores_gemma":[0.0019020017,0.0004900348,0.0006020078,0.00077019085,0.00065905845,0.0011836793,0.0013276429,0.0015742006,0.0014328879],"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.00011939237,0.00007139382,0.0004436553,0.000330014,0.00005350119,0.00012045472,0.00023794422,0.51135105,0.011875122,0.1565745,0.0054787067,0.3133442],"study_design_scores_gemma":[0.000014300554,0.000035213947,0.000047351576,0.000012001092,0.000006428072,0.000051653402,0.00005256594,0.9630656,0.0022188337,0.030743966,0.0037431398,0.000008888261],"about_ca_topic_score_codex":0.001025846,"about_ca_topic_score_gemma":0.0021126934,"teacher_disagreement_score":0.006956594,"about_ca_system_score_codex":0.00027595813,"about_ca_system_score_gemma":0.00042233412,"threshold_uncertainty_score":0.023272157},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.34164867,0.0047211447,0.35858226,0.0011883709,0.00088753365,0.00011493631,0.0003218884,0.0007375727,0.29179758],"genre_scores_gemma":[0.9031434,0.001156408,0.029251875,0.00010445717,0.0003009731,0.000048426165,0.0002238296,0.0002880164,0.065482594],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99922657,0.00016703694,0.000037973987,0.00010845962,0.00032809208,0.00013185287],"domain_scores_gemma":[0.9991227,0.00042869127,0.00005616876,0.00017384804,0.000118636395,0.00009993111],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00078966503,0.00059570704,0.0006905681,0.000768043,0.0008160811,0.00235207,0.0008159547,0.00035866429,0.010252549],"category_scores_gemma":[0.0025643762,0.00040828923,0.0005981056,0.0007205108,0.0021354458,0.004631582,0.0020834,0.0015536427,0.0012879297],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004432646,0.000016547154,0.000076422686,0.000036334735,0.0000046229957,0.000038300568,0.00017391094,0.0007916404,0.001941506,0.98591334,0.0009222065,0.010040813],"study_design_scores_gemma":[0.000022699354,0.000030078583,0.00014901294,0.000012595356,0.00000786405,0.000095520285,0.000063382155,0.004205868,0.0035194552,0.9790756,0.012809594,0.000008341997],"about_ca_topic_score_codex":0.00039441822,"about_ca_topic_score_gemma":0.0006723403,"teacher_disagreement_score":0.010252549,"about_ca_system_score_codex":0.0010735865,"about_ca_system_score_gemma":0.00037527666,"threshold_uncertainty_score":0.034298122},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.77415663,0.0015018546,0.19560222,0.00082256866,0.00048076466,0.00013954591,0.0012965349,0.0029621131,0.023037752],"genre_scores_gemma":[0.8808335,0.000473013,0.10818443,0.000080663165,0.0002575949,0.00004005795,0.0015595583,0.00031675483,0.008254424],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99866235,0.00018524351,0.00011608295,0.00036389954,0.00039396732,0.0002784975],"domain_scores_gemma":[0.99596596,0.0018666943,0.0005420312,0.00060705363,0.00060364546,0.00041465106],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013665173,0.0010372215,0.001329978,0.0018252487,0.0010086548,0.0033419267,0.0010564564,0.0005721702,0.010019547],"category_scores_gemma":[0.009527051,0.0005331582,0.000924734,0.0026840025,0.0011506797,0.0065884357,0.0026442886,0.0012515271,0.0021162522],"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.003752707,0.00056355546,0.043561265,0.001106265,0.00024965516,0.0019916275,0.0015284637,0.043730907,0.035492666,0.20884687,0.02643179,0.63274425],"study_design_scores_gemma":[0.00040033748,0.0010725455,0.012558817,0.00042402017,0.0002938346,0.0032282777,0.0027840282,0.22634317,0.045100585,0.66423005,0.04336798,0.00019635711],"about_ca_topic_score_codex":0.00066911866,"about_ca_topic_score_gemma":0.001639685,"teacher_disagreement_score":0.010019547,"about_ca_system_score_codex":0.0010890175,"about_ca_system_score_gemma":0.0011477679,"threshold_uncertainty_score":0.03351873},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.047740128,0.00023703376,0.9360427,0.000207922,0.00014527592,0.00015437324,0.00025288312,0.00407653,0.011143159],"genre_scores_gemma":[0.19393164,0.00018885742,0.7941537,0.0000998001,0.00013830683,0.00019918957,0.0014087035,0.00080633163,0.009073511],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99920815,0.000078265395,0.000063937114,0.00022407903,0.0002806282,0.00014488299],"domain_scores_gemma":[0.9989116,0.00039574516,0.000082148385,0.0002889801,0.00022294391,0.0000986169],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009039251,0.0016626146,0.0013763196,0.0021563445,0.0012277107,0.003154231,0.0030030124,0.001056008,0.01738894],"category_scores_gemma":[0.0028391667,0.0007341358,0.0017363789,0.0022500043,0.0013475887,0.0048648636,0.0045863274,0.0017877998,0.005665899],"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.00071608985,0.00027113946,0.003083398,0.00042843723,0.00013690216,0.0002853052,0.00046605832,0.016525917,0.026102144,0.19837187,0.014906867,0.73870593],"study_design_scores_gemma":[0.0004090887,0.00058753806,0.0024810806,0.0001304171,0.00027535646,0.00089834916,0.00061255513,0.41958207,0.040157333,0.5078562,0.02688495,0.00012504135],"about_ca_topic_score_codex":0.0013312566,"about_ca_topic_score_gemma":0.0022837317,"teacher_disagreement_score":0.01738894,"about_ca_system_score_codex":0.0013442617,"about_ca_system_score_gemma":0.0014076098,"threshold_uncertainty_score":0.05817181},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.032604314,0.00062500587,0.9153991,0.0005677619,0.00043826006,0.000071397684,0.00022246389,0.00986811,0.04020363],"genre_scores_gemma":[0.4598291,0.0011105158,0.49276283,0.0007303103,0.00069955736,0.00025220696,0.0005029392,0.004427214,0.03968529],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99869007,0.00026760707,0.00007216751,0.0001819302,0.0006170463,0.00017121657],"domain_scores_gemma":[0.9989844,0.0004090918,0.00007811158,0.00026946014,0.00015818009,0.00010074474],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019863718,0.0005869525,0.0005918829,0.0009786483,0.00089161936,0.0037589353,0.0010818564,0.0006127394,0.011028512],"category_scores_gemma":[0.0046133017,0.00043914915,0.0009069887,0.001058632,0.0024045042,0.006085921,0.0024172338,0.0023582736,0.003503149],"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.00027582835,0.000063738036,0.00077793136,0.00016013108,0.0000194784,0.0003282455,0.0011570998,0.004256351,0.007632159,0.882281,0.0073630307,0.095684916],"study_design_scores_gemma":[0.00008381138,0.00022377117,0.000801543,0.0001912603,0.00004347426,0.0006352942,0.00032392002,0.035632934,0.033243053,0.5975267,0.33118802,0.000106190484],"about_ca_topic_score_codex":0.00054165215,"about_ca_topic_score_gemma":0.00052908796,"teacher_disagreement_score":0.011028512,"about_ca_system_score_codex":0.000887208,"about_ca_system_score_gemma":0.0006056836,"threshold_uncertainty_score":0.036894023},"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":"methods","genre_gemma":"software","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"software","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11598447,0.0007604948,0.8566709,0.00034965784,0.00008383405,0.00017513405,0.0018292826,0.009524012,0.014622182],"genre_scores_gemma":[0.48341763,0.0004977585,0.5026014,0.00013134346,0.00017463995,0.00021889941,0.003119693,0.0020658923,0.007772717],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99838185,0.00023752176,0.00010369237,0.00038992128,0.00069436745,0.00019264912],"domain_scores_gemma":[0.99869233,0.00046576763,0.00017180941,0.0003335848,0.00021407328,0.00012243072],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011637809,0.0012676452,0.0012843302,0.0034131098,0.0012894461,0.0023991629,0.001532231,0.00083117053,0.014022021],"category_scores_gemma":[0.0046629333,0.0007132809,0.0014580638,0.0021088617,0.002217145,0.005318271,0.00653353,0.0016293383,0.003601183],"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.00046990011,0.000102562175,0.0068699345,0.00064784405,0.000096263386,0.00047724124,0.0016636765,0.021128811,0.01018643,0.7804039,0.014487781,0.16346559],"study_design_scores_gemma":[0.00014341946,0.0002258005,0.0021820117,0.00016025006,0.00005529871,0.00070561556,0.00048956095,0.069601074,0.026468573,0.8432933,0.056548536,0.00012653101],"about_ca_topic_score_codex":0.0011945638,"about_ca_topic_score_gemma":0.0011581299,"teacher_disagreement_score":0.014022021,"about_ca_system_score_codex":0.0009741886,"about_ca_system_score_gemma":0.000630836,"threshold_uncertainty_score":0.04690832},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.013827241,0.00015356694,0.9713227,0.0003905421,0.00009241645,0.00017117063,0.00021938054,0.0033377132,0.010485152],"genre_scores_gemma":[0.23772442,0.00016929545,0.7466722,0.00026029412,0.00009524168,0.00043401454,0.00097721,0.00042613794,0.013241069],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988526,0.00015313772,0.000050716695,0.00023093817,0.00050293014,0.00020963748],"domain_scores_gemma":[0.9988086,0.0003517623,0.00010965894,0.00036384354,0.00028322072,0.000082862105],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007030211,0.0007878397,0.00080176303,0.0010123792,0.0011103394,0.0015913721,0.0012322512,0.00074440445,0.012208943],"category_scores_gemma":[0.0034878617,0.00039942208,0.00077095337,0.0013811239,0.0012127454,0.0021210397,0.0019081378,0.0015332206,0.0039103855],"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.00091624836,0.00038269733,0.0014900167,0.00028854032,0.00007051536,0.00021060533,0.00024103801,0.08050064,0.02010368,0.2683429,0.03699818,0.5904549],"study_design_scores_gemma":[0.00036820982,0.00023725553,0.00064920937,0.00003440956,0.000026307702,0.00026706778,0.00011924418,0.7503823,0.014502601,0.21409139,0.019220607,0.00010141076],"about_ca_topic_score_codex":0.0074300845,"about_ca_topic_score_gemma":0.015417957,"teacher_disagreement_score":0.012208943,"about_ca_system_score_codex":0.0018570872,"about_ca_system_score_gemma":0.0045518014,"threshold_uncertainty_score":0.04084295},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.082137235,0.0021301596,0.89684457,0.0018260404,0.00015054694,0.00013732302,0.0003725522,0.00604703,0.010354492],"genre_scores_gemma":[0.635454,0.0010270387,0.35296905,0.0004902053,0.00025467557,0.00017965086,0.00057198375,0.00052895537,0.008524419],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9979971,0.00034639143,0.000119036005,0.00060762605,0.0005652539,0.00036457268],"domain_scores_gemma":[0.9947944,0.002676665,0.00037694824,0.0014190817,0.0004993768,0.00023346618],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017959483,0.00091346627,0.0014977924,0.0011298761,0.0011048943,0.0021534192,0.0018971511,0.00087804074,0.0061088484],"category_scores_gemma":[0.008495785,0.0005328303,0.0013289017,0.0023135461,0.0018115409,0.008404231,0.0037249294,0.0027142856,0.0016752133],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.001850671,0.00031638762,0.007652661,0.00080410263,0.00011885074,0.00049606716,0.0007515747,0.12469398,0.025781425,0.46018422,0.02237677,0.35497335],"study_design_scores_gemma":[0.00019396748,0.00026026982,0.0014825364,0.000099894394,0.00008336887,0.00066504837,0.00022473634,0.4199125,0.022603137,0.5302287,0.02415306,0.000092827824],"about_ca_topic_score_codex":0.0021922959,"about_ca_topic_score_gemma":0.002907328,"teacher_disagreement_score":0.0061088484,"about_ca_system_score_codex":0.0025407835,"about_ca_system_score_gemma":0.0017242425,"threshold_uncertainty_score":0.020436168},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.89419866,0.00023407133,0.08725335,0.00023560003,0.000038181326,0.000023234621,0.000110508314,0.00031652788,0.017590005],"genre_scores_gemma":[0.9896242,0.00021445712,0.0051113553,0.00002416769,0.00003321895,0.000020112144,0.00007527133,0.000093226176,0.0048039733],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993369,0.00010513798,0.000033257336,0.00012107172,0.00025805118,0.00014561188],"domain_scores_gemma":[0.99809986,0.0007302563,0.0002080266,0.00028190456,0.0003020045,0.00037805596],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00067677454,0.00054965174,0.00051484175,0.0022719079,0.0011437759,0.0027187427,0.00080634945,0.0004574528,0.0038803418],"category_scores_gemma":[0.0047284747,0.00026605977,0.000590056,0.001193966,0.0026175801,0.004986148,0.001960855,0.0014035064,0.00037633083],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000058649774,0.00004944103,0.0023704947,0.000037103146,0.000015395874,0.00043243798,0.0012208571,0.003253533,0.0044169435,0.97841656,0.0002851083,0.0094434],"study_design_scores_gemma":[0.000018745675,0.00007281975,0.001953908,0.000026730833,0.000021885588,0.0005675025,0.00077719236,0.03395995,0.006571011,0.9530397,0.0029605173,0.00003001865],"about_ca_topic_score_codex":0.0016860225,"about_ca_topic_score_gemma":0.0007605583,"teacher_disagreement_score":0.0038803418,"about_ca_system_score_codex":0.0010843689,"about_ca_system_score_gemma":0.00053927087,"threshold_uncertainty_score":0.012981057},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.02014569,0.0012168083,0.91668254,0.0014989617,0.0005322375,0.000033007866,0.0001865625,0.001138247,0.058566004],"genre_scores_gemma":[0.65617,0.0019552072,0.29576418,0.0010737765,0.0012093814,0.00014779037,0.00037471176,0.002078433,0.04122641],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9981609,0.00061017275,0.000114603405,0.0003248916,0.0006098298,0.00017960108],"domain_scores_gemma":[0.99772674,0.0010365142,0.00018604982,0.00057618093,0.00036306752,0.000111410736],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0022643618,0.0010324764,0.0013912149,0.001776887,0.0017190474,0.0037959612,0.0014984065,0.00080917316,0.01408112],"category_scores_gemma":[0.01047946,0.00057085167,0.0010918014,0.0019675442,0.004038488,0.009649871,0.0045928215,0.0034164607,0.002755925],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000016770884,0.000006687648,0.00007223742,0.000025230496,0.0000060406514,0.000012580449,0.000045974604,0.002037246,0.00018689578,0.9866909,0.0011685884,0.009730828],"study_design_scores_gemma":[0.00000458938,0.000008229007,0.00005560052,0.000016022712,0.0000066703415,0.000035862467,0.000013766965,0.021502389,0.0007441027,0.9718959,0.005707968,0.000008854846],"about_ca_topic_score_codex":0.0014084982,"about_ca_topic_score_gemma":0.0011267875,"teacher_disagreement_score":0.01408112,"about_ca_system_score_codex":0.0021229803,"about_ca_system_score_gemma":0.0012498177,"threshold_uncertainty_score":0.047106028},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01729417,0.0003012017,0.9601049,0.00073662837,0.00018610145,0.00003733444,0.00022853003,0.0054306793,0.015680434],"genre_scores_gemma":[0.24485922,0.00038097912,0.73546714,0.0004884904,0.00026248017,0.00018726007,0.00047720253,0.0019015034,0.015975764],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994679,0.00016551722,0.00001924162,0.00005780124,0.00022538136,0.0000641536],"domain_scores_gemma":[0.9992924,0.00037217545,0.00004649702,0.000111140675,0.00012859426,0.000049323597],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00077499764,0.00063973083,0.000773946,0.0005966736,0.00066364673,0.0010744726,0.0007139107,0.0005952476,0.017166335],"category_scores_gemma":[0.0036703355,0.00046626414,0.0008564175,0.0005800002,0.0006841029,0.0019414102,0.001902197,0.0018107961,0.004635129],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00026416208,0.00017442714,0.001509631,0.0004942359,0.000081415616,0.00039338364,0.0007665435,0.15093803,0.011119672,0.46595404,0.05105899,0.31724545],"study_design_scores_gemma":[0.00008732481,0.000075404,0.00041081588,0.00006846246,0.000014899744,0.00020210548,0.00017654267,0.56255037,0.008397929,0.37403736,0.0539244,0.000054373133],"about_ca_topic_score_codex":0.0013214571,"about_ca_topic_score_gemma":0.0032778613,"teacher_disagreement_score":0.017166335,"about_ca_system_score_codex":0.0005159783,"about_ca_system_score_gemma":0.0005151768,"threshold_uncertainty_score":0.057427168},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.115482114,0.0035031848,0.6580078,0.004108242,0.00043894694,0.00011861557,0.00057501445,0.0008078391,0.21695817],"genre_scores_gemma":[0.8836134,0.0014292526,0.075442664,0.0018065103,0.00036145453,0.00012194536,0.0003944212,0.00013865373,0.03669179],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99873644,0.00032161784,0.000072262184,0.00020400855,0.00046295283,0.0002028132],"domain_scores_gemma":[0.9991468,0.00026637,0.00007233436,0.00011615743,0.00027092124,0.00012736136],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013349424,0.00034559667,0.00024016724,0.0015393207,0.0011757307,0.0018256762,0.0008662872,0.00061258406,0.005308986],"category_scores_gemma":[0.0017971222,0.00023715317,0.00059596513,0.0011157889,0.004613444,0.0043379148,0.0028036975,0.0014367691,0.0007319761],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000029560813,0.0000028282573,0.00006760916,0.000010794123,0.0000017265442,0.000023653192,0.00016629956,0.00020176783,0.0003013672,0.99628335,0.00028898433,0.0026485827],"study_design_scores_gemma":[0.000004228445,0.000010622425,0.00021366254,0.000013783748,0.000005164648,0.00007155509,0.00013378734,0.0016949225,0.0007026005,0.9773719,0.019768674,0.0000090963495],"about_ca_topic_score_codex":0.003040443,"about_ca_topic_score_gemma":0.002281687,"teacher_disagreement_score":0.005308986,"about_ca_system_score_codex":0.0023059675,"about_ca_system_score_gemma":0.00090852863,"threshold_uncertainty_score":0.017760336},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.28500345,0.000744917,0.5990723,0.00097131083,0.00056265894,0.00009407845,0.00032266628,0.0022928468,0.1109358],"genre_scores_gemma":[0.9158869,0.00035251345,0.067984626,0.00024068757,0.000106863765,0.00008230322,0.0001731823,0.00055744033,0.014615513],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99955386,0.00012351965,0.000024099789,0.00007416288,0.00013621205,0.00008816875],"domain_scores_gemma":[0.9993948,0.00021109296,0.0001060758,0.00008428083,0.0001323349,0.00007138987],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00046401663,0.00070080394,0.00049341423,0.0014522902,0.00085287704,0.0021746703,0.0008007422,0.0010404766,0.0101670325],"category_scores_gemma":[0.002371181,0.0003255792,0.00063231523,0.00089272356,0.0010866155,0.002947819,0.00069765566,0.0010875008,0.0017690033],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006449642,0.000025028077,0.00029076595,0.00006318468,0.000008492455,0.0002270118,0.00015799023,0.010024443,0.006048469,0.969716,0.002349569,0.01102447],"study_design_scores_gemma":[0.000021535618,0.000032020875,0.00031457812,0.000046489302,0.000010077517,0.0002692765,0.0001747348,0.10909842,0.0070303786,0.87628055,0.0066826534,0.000039273113],"about_ca_topic_score_codex":0.00093753875,"about_ca_topic_score_gemma":0.0011082228,"teacher_disagreement_score":0.0101670325,"about_ca_system_score_codex":0.0007873181,"about_ca_system_score_gemma":0.00042155944,"threshold_uncertainty_score":0.03401214},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.40870747,0.001012137,0.31564623,0.0030929404,0.0005010189,0.00009404085,0.0003828478,0.00071148283,0.26985186],"genre_scores_gemma":[0.94442195,0.00054914923,0.029080393,0.00025247346,0.00025555358,0.000049415947,0.00012519027,0.00011846301,0.025147447],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995529,0.0000785323,0.000010839767,0.00010434025,0.00013448809,0.000118855234],"domain_scores_gemma":[0.99957496,0.0001215547,0.000075600015,0.00007309635,0.00006329112,0.000091526286],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00051610894,0.0005520381,0.00045356862,0.0010527842,0.0009386377,0.001311661,0.00062360615,0.00047857227,0.009257729],"category_scores_gemma":[0.0016937096,0.00025517933,0.00045412345,0.00073948066,0.0025866516,0.0022467533,0.0022427177,0.0019822745,0.0015507378],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000016542881,0.0000055847795,0.0001766879,0.000020743522,0.000001934063,0.000035995225,0.0001056551,0.0007076024,0.0021086168,0.991991,0.0006959348,0.0041337935],"study_design_scores_gemma":[0.000012691937,0.00004523156,0.0005197442,0.000017449865,0.000007766161,0.00023147617,0.000104912884,0.008700438,0.0032990198,0.9769991,0.010041508,0.00002073215],"about_ca_topic_score_codex":0.00079554226,"about_ca_topic_score_gemma":0.00089677825,"teacher_disagreement_score":0.009257729,"about_ca_system_score_codex":0.0011656021,"about_ca_system_score_gemma":0.0007005018,"threshold_uncertainty_score":0},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0003815717,0.014060658,0.0036597431,0.0013271167,0.0015622999,0.000019436571,0.00016479543,0.00019686543,0.9786275],"genre_scores_gemma":[0.00387564,0.007653794,0.0018005483,0.00048969866,0.0012811838,0.000027921154,0.0001566905,0.0001972905,0.98451716],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99971503,0.000038951344,0.000008310241,0.00003985319,0.00017324799,0.000024526184],"domain_scores_gemma":[0.9997693,0.00008354259,0.000014123246,0.000038183498,0.000057804777,0.000037077672],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00027504773,0.0013750737,0.0009659238,0.00219595,0.0014669208,0.004480283,0.0008211597,0.0007028309,0.14415416],"category_scores_gemma":[0.00093112746,0.0006017304,0.00047334936,0.0038097475,0.001405972,0.004532451,0.0012453425,0.0027196298,0.07771332],"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.00001639665,0.00003637069,0.00005870276,0.00018286405,0.0000068649956,0.000026648167,0.00016526363,0.00033567834,0.00033853558,0.28841174,0.6124321,0.097988755],"study_design_scores_gemma":[0.0000036318218,0.000008159926,0.00014616373,0.00008208438,0.00000471199,0.000045238536,0.00004226922,0.00030568807,0.00009087794,0.06944234,0.9298242,0.0000046735872],"about_ca_topic_score_codex":0.0026821257,"about_ca_topic_score_gemma":0.007985913,"teacher_disagreement_score":0.14415416,"about_ca_system_score_codex":0.0018318275,"about_ca_system_score_gemma":0.0013993657,"threshold_uncertainty_score":0.48224372},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.22058742,0.00040669105,0.76458085,0.00082531845,0.00006704674,0.00019063843,0.0006423319,0.0013420972,0.011357706],"genre_scores_gemma":[0.6551411,0.00035212006,0.33620027,0.00012086854,0.00006865792,0.00015324513,0.0011646611,0.00040888836,0.006390176],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99872833,0.00024920184,0.000120605255,0.00036167123,0.00037215164,0.00016805428],"domain_scores_gemma":[0.9915155,0.0065875193,0.00037128778,0.0007690566,0.00047941084,0.0002772837],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012946356,0.0007289575,0.0014179527,0.0022475477,0.0013284246,0.0058490094,0.002631396,0.0015074995,0.009577783],"category_scores_gemma":[0.01200842,0.00083087117,0.0019897418,0.0026831347,0.0025061367,0.010419528,0.0048546568,0.0032052838,0.0012267804],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00037128883,0.00014977623,0.0027302173,0.0005200906,0.00008497414,0.00014564859,0.0010393462,0.17534336,0.0033626312,0.659388,0.004213369,0.15265131],"study_design_scores_gemma":[0.000025142728,0.000029344303,0.00027703476,0.000035382214,0.00002027511,0.00004897146,0.00018873852,0.28576517,0.0017821419,0.71044624,0.0013610405,0.000020579555],"about_ca_topic_score_codex":0.0036505002,"about_ca_topic_score_gemma":0.0047644726,"teacher_disagreement_score":0.009577783,"about_ca_system_score_codex":0.0021280795,"about_ca_system_score_gemma":0.001708723,"threshold_uncertainty_score":0.032040894},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009896251,0.00042838673,0.98072135,0.00029948168,0.00017912414,0.000115573064,0.00024681957,0.0017225863,0.006390356],"genre_scores_gemma":[0.06050339,0.00028258696,0.922979,0.00026311958,0.00020427695,0.00019053003,0.00073287066,0.0009244081,0.013919768],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9984079,0.00032336748,0.00011316247,0.00034342267,0.0006869711,0.00012510782],"domain_scores_gemma":[0.99719125,0.0012351237,0.00014888855,0.00060195493,0.0007048219,0.0001181056],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019445089,0.0014505348,0.0013388342,0.0038968245,0.0009542843,0.0012843211,0.0025926696,0.0012975334,0.017313581],"category_scores_gemma":[0.0098322285,0.0007690298,0.0018693035,0.0023239828,0.0012183725,0.003689616,0.0026411342,0.0025401118,0.008698221],"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.00040134075,0.0002972717,0.0017293072,0.0011579273,0.00015870905,0.00031664938,0.0005374112,0.041767526,0.02682783,0.13044602,0.02868291,0.76767707],"study_design_scores_gemma":[0.00038764544,0.00036327087,0.0014881596,0.00014413499,0.00012577711,0.0010235221,0.00027654434,0.63941664,0.029257221,0.25983506,0.06748442,0.0001976119],"about_ca_topic_score_codex":0.002498857,"about_ca_topic_score_gemma":0.0049147736,"teacher_disagreement_score":0.017313581,"about_ca_system_score_codex":0.0007187089,"about_ca_system_score_gemma":0.0012581528,"threshold_uncertainty_score":0.05791968},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.120879255,0.00041576615,0.85743815,0.00072320463,0.000092619244,0.00020037203,0.00046479944,0.0037719535,0.016013838],"genre_scores_gemma":[0.38862422,0.00019396507,0.6027567,0.00020053601,0.000107715634,0.00022940314,0.0016300733,0.0006074653,0.0056499946],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985784,0.0003322375,0.00008925556,0.00025142735,0.00044871698,0.00030002164],"domain_scores_gemma":[0.99780434,0.0010930981,0.00014870953,0.0005250915,0.00031391627,0.00011491699],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012743687,0.0010419099,0.0009083712,0.0017597494,0.00086499756,0.0023146935,0.0021041336,0.0009583798,0.010085897],"category_scores_gemma":[0.0068348288,0.0004968018,0.0009337328,0.0018601278,0.0011453268,0.0042089117,0.0025957774,0.002229062,0.0023962988],"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.0009253249,0.00050595886,0.0035052781,0.00046889138,0.000098032695,0.00020393399,0.0006107783,0.1312414,0.014663024,0.40550664,0.017182454,0.42508832],"study_design_scores_gemma":[0.00015681033,0.00015542554,0.00051839557,0.00006582707,0.000031989286,0.000085759195,0.0002115791,0.51967347,0.013114514,0.46113703,0.0048125912,0.00003656547],"about_ca_topic_score_codex":0.0025247075,"about_ca_topic_score_gemma":0.0070128418,"teacher_disagreement_score":0.010085897,"about_ca_system_score_codex":0.0017816663,"about_ca_system_score_gemma":0.0019280674,"threshold_uncertainty_score":0.03374076},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04394505,0.0029741537,0.11497778,0.0043009645,0.00079278206,0.00008736973,0.0011425227,0.00056987075,0.8312094],"genre_scores_gemma":[0.68648756,0.0056651607,0.04477638,0.0012928292,0.0009596809,0.00010854202,0.0014296947,0.00034416775,0.258936],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99979085,0.000060172766,0.000012421011,0.000024161109,0.00006879106,0.0000436927],"domain_scores_gemma":[0.99975497,0.00007134779,0.000016358399,0.000043223896,0.00008096963,0.0000332089],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003900472,0.00025089932,0.00029472267,0.00091951905,0.00071318843,0.0010020245,0.00023698297,0.00023488307,0.035175793],"category_scores_gemma":[0.0011911268,0.00011684756,0.00040843894,0.00084688404,0.0007499955,0.0017995003,0.00093365443,0.00062320946,0.005627047],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000005226262,0.0000039177025,0.00020433826,0.000023220444,0.0000022386182,0.00005852832,0.00013846831,0.00024917166,0.00031688515,0.9812416,0.0088819815,0.008874548],"study_design_scores_gemma":[0.0000044164403,0.000009688832,0.0008701274,0.000046667534,0.0000042615516,0.0001682588,0.00009863118,0.0016196382,0.00047695558,0.8134564,0.18323673,0.000008310962],"about_ca_topic_score_codex":0.002106945,"about_ca_topic_score_gemma":0.0023648646,"teacher_disagreement_score":0.035175793,"about_ca_system_score_codex":0.0007218038,"about_ca_system_score_gemma":0.00070506614,"threshold_uncertainty_score":0.11767477},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010160195,0.004348575,0.13151786,0.0016404004,0.00073629594,0.000095328716,0.0013249662,0.00057375495,0.84960264],"genre_scores_gemma":[0.2592723,0.012865878,0.08620958,0.0012590191,0.0013234799,0.00046832,0.004336737,0.0014878674,0.63277686],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9995778,0.000080859994,0.000022739325,0.00008813505,0.00017667729,0.000053675045],"domain_scores_gemma":[0.99943715,0.00025342428,0.000028629514,0.000100342324,0.00014881857,0.00003160885],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006593023,0.00081467483,0.00046834594,0.0019318233,0.0010306617,0.0020967566,0.00082069775,0.0007161576,0.06285382],"category_scores_gemma":[0.0017111053,0.0002933734,0.00061021704,0.0015426802,0.0011843612,0.0028030002,0.0010654883,0.0015384312,0.021395918],"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.0000031060229,0.000006234816,0.000034412442,0.000032590677,0.0000011072817,0.000020268306,0.000071602975,0.00020851381,0.0002350184,0.97021693,0.007467003,0.021703258],"study_design_scores_gemma":[0.0000036632737,0.000009674986,0.00011505267,0.00005358239,0.0000031689358,0.00023000786,0.000048312326,0.0011106533,0.00087735057,0.772146,0.22539108,0.000011368077],"about_ca_topic_score_codex":0.00051307835,"about_ca_topic_score_gemma":0.0004311175,"teacher_disagreement_score":0.06285382,"about_ca_system_score_codex":0.0014333976,"about_ca_system_score_gemma":0.00055785215,"threshold_uncertainty_score":0.21026695},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0216628,0.005134234,0.09674387,0.002568442,0.00049409264,0.00004725295,0.00030169857,0.00046440106,0.87258315],"genre_scores_gemma":[0.6997308,0.0069349655,0.039409876,0.00097002037,0.00088452734,0.00017063113,0.0007782374,0.00052769633,0.25059327],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9992072,0.00014677142,0.000027707789,0.00012231898,0.00036174647,0.00013420537],"domain_scores_gemma":[0.99948126,0.00018227968,0.000024502215,0.00012891588,0.00013732634,0.000045638288],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00048892555,0.00046235186,0.0005370521,0.0011449209,0.0017196244,0.0034803436,0.00074168574,0.0004961847,0.01797066],"category_scores_gemma":[0.0018381674,0.0002647856,0.00054377614,0.0014309959,0.002903873,0.004416166,0.0019801334,0.001904575,0.0030276391],"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.000002084157,0.0000019655922,0.000015469532,0.000012038208,7.6591164e-7,0.0000057584066,0.000038711525,0.00026599126,0.00005295251,0.99350584,0.0014921137,0.0046061897],"study_design_scores_gemma":[0.0000019727854,0.0000021022954,0.00003342246,0.00001562573,0.0000013758754,0.00002054602,0.000029036493,0.001106737,0.00019871704,0.96556103,0.033026714,0.0000027671683],"about_ca_topic_score_codex":0.0020637608,"about_ca_topic_score_gemma":0.002284247,"teacher_disagreement_score":0.01797066,"about_ca_system_score_codex":0.002809333,"about_ca_system_score_gemma":0.0013073132,"threshold_uncertainty_score":0.06011784},"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06943647,0.0033258672,0.34574175,0.050298616,0.0034881008,0.0006095206,0.008098856,0.0025062957,0.5164944],"genre_scores_gemma":[0.7204652,0.0030215366,0.15794516,0.011119009,0.0036956228,0.0017071061,0.011900089,0.0013088263,0.088837504],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9930126,0.0015591721,0.0006598035,0.0021588914,0.001161868,0.0014476927],"domain_scores_gemma":[0.97608393,0.014109636,0.0012227927,0.0029109204,0.0036214865,0.0020511209],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004623765,0.0013606611,0.0022227492,0.0029542795,0.005945881,0.006992629,0.0032494739,0.005663742,0.07714916],"category_scores_gemma":[0.030057115,0.001430722,0.004169813,0.0023587067,0.008046429,0.016582692,0.008640162,0.012407245,0.009500819],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000097940654,0.00006276343,0.00043223271,0.00017803579,0.000032873686,0.0002095225,0.00016231583,0.00084130606,0.00032306195,0.98099685,0.0123132765,0.0043497332],"study_design_scores_gemma":[0.000060311817,0.000028529006,0.00027690225,0.00006836903,0.00002190334,0.0001639736,0.00025545142,0.00431258,0.00044522135,0.97670835,0.017633809,0.000024689587],"about_ca_topic_score_codex":0.0025474932,"about_ca_topic_score_gemma":0.004007483,"teacher_disagreement_score":0.07714916,"about_ca_system_score_codex":0.0036915427,"about_ca_system_score_gemma":0.005237974,"threshold_uncertainty_score":0.2580896},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.17070358,0.00094057265,0.7848018,0.00067565084,0.00038484324,0.00013576447,0.00009915629,0.0005761852,0.04168248],"genre_scores_gemma":[0.6820025,0.0015054147,0.28061748,0.00043121428,0.0004242323,0.00028321316,0.00021356634,0.0005207783,0.034001645],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99894434,0.00033735254,0.00004697418,0.00009545036,0.0004063546,0.00016965118],"domain_scores_gemma":[0.99838006,0.00078953156,0.00013076256,0.00023416831,0.0003307755,0.00013471388],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0023162519,0.00083557307,0.0007925598,0.002218234,0.0010004262,0.0018602676,0.0012931322,0.0008667112,0.0038641177],"category_scores_gemma":[0.0076863966,0.00044703367,0.0011458592,0.0025089837,0.002982775,0.0032990274,0.0021081795,0.0027901626,0.0018331558],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000057070458,0.000032831496,0.00042593505,0.000039669092,0.000008336993,0.0001837141,0.00033646615,0.008561844,0.0030268687,0.9645685,0.00063102844,0.022127656],"study_design_scores_gemma":[0.000038280596,0.00005583462,0.00031702648,0.00004920588,0.000016278082,0.00020240838,0.0000672915,0.17968254,0.0043570804,0.8094148,0.0057533816,0.000045876644],"about_ca_topic_score_codex":0.0015706732,"about_ca_topic_score_gemma":0.0018202515,"teacher_disagreement_score":0.0038641177,"about_ca_system_score_codex":0.0019158408,"about_ca_system_score_gemma":0.0012877432,"threshold_uncertainty_score":0.013900459},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.38840014,0.0011575007,0.574398,0.0017346579,0.00018587822,0.0001581971,0.00019099345,0.00038164403,0.033392932],"genre_scores_gemma":[0.860624,0.0010191036,0.12501946,0.00016836608,0.00015998451,0.00012417223,0.00026038478,0.00023825649,0.012386326],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995572,0.00015734359,0.000020887732,0.000052979456,0.00012720848,0.00008439973],"domain_scores_gemma":[0.9980196,0.0014178109,0.00016130958,0.0001477173,0.00015353989,0.00010001193],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001413085,0.00071627164,0.00080837164,0.0020180275,0.0014071346,0.0019844018,0.0009567473,0.0010190372,0.0053920886],"category_scores_gemma":[0.009992127,0.00030658868,0.0006270159,0.0016147147,0.003187552,0.0041297497,0.0023813024,0.0019990553,0.0010146347],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001290276,0.000027562935,0.00051614235,0.00015538945,0.000013089978,0.00016467538,0.000434873,0.012105079,0.0025957155,0.96001023,0.0011035767,0.022744602],"study_design_scores_gemma":[0.000020956943,0.000033244807,0.00015497228,0.000028811179,0.000008176661,0.00009847603,0.00010684539,0.09994667,0.0026942065,0.8954503,0.0014400055,0.000017313429],"about_ca_topic_score_codex":0.0006723051,"about_ca_topic_score_gemma":0.00078409,"teacher_disagreement_score":0.0053920886,"about_ca_system_score_codex":0.0008955056,"about_ca_system_score_gemma":0.000967226,"threshold_uncertainty_score":0.018038273},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.02034633,0.00044689744,0.96106,0.00051251805,0.0001761549,0.00012090427,0.00023029333,0.0025427558,0.014564241],"genre_scores_gemma":[0.3364628,0.0006517675,0.63955665,0.0004666907,0.0003551557,0.00019949133,0.00091080193,0.0011693232,0.020227289],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99849737,0.0003499674,0.000067820176,0.00024330922,0.00062202924,0.00021946512],"domain_scores_gemma":[0.99777716,0.00092436554,0.0000916258,0.0008427138,0.00025534685,0.00010877244],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013444653,0.0013729394,0.001286167,0.0015952019,0.0009347029,0.0022269133,0.0018070894,0.0010462966,0.021114111],"category_scores_gemma":[0.005974295,0.00060234434,0.0009958128,0.0021781756,0.0011615802,0.0060955854,0.0039739734,0.0028005182,0.0051087267],"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.00090022193,0.0003357366,0.0005957439,0.00036342224,0.00007242428,0.00011748773,0.00032669533,0.0292219,0.012250444,0.4486115,0.018491058,0.48871344],"study_design_scores_gemma":[0.00018560854,0.00017107658,0.00018008679,0.0000645881,0.000056142944,0.00017823707,0.00015728749,0.33434066,0.018862823,0.62474746,0.021005655,0.000050386436],"about_ca_topic_score_codex":0.0015146681,"about_ca_topic_score_gemma":0.0029270216,"teacher_disagreement_score":0.021114111,"about_ca_system_score_codex":0.00081384956,"about_ca_system_score_gemma":0.0012663667,"threshold_uncertainty_score":0.07063371},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.040355317,0.00022007636,0.92596924,0.0006507272,0.00024117195,0.00012045074,0.00011205189,0.0003950155,0.03193591],"genre_scores_gemma":[0.33238932,0.00037834072,0.6367766,0.00031234694,0.00014916525,0.0002959139,0.0002515052,0.00045973132,0.02898708],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99930644,0.0002814524,0.000024866207,0.000056357247,0.00024436435,0.00008646073],"domain_scores_gemma":[0.99914503,0.00050381577,0.00004678077,0.00009834228,0.00014111407,0.00006486832],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009642894,0.0006173718,0.0008331751,0.00096201,0.00090730767,0.0013367693,0.0008884642,0.00070394966,0.0096772965],"category_scores_gemma":[0.0034469918,0.00046664567,0.0005673865,0.0009989552,0.0016844334,0.0017890766,0.0020737622,0.00222026,0.0016547344],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00016807532,0.00012246039,0.000448081,0.00015607961,0.000033112476,0.00008254938,0.0003004407,0.043831684,0.002568234,0.8539255,0.0049354457,0.0934283],"study_design_scores_gemma":[0.00007213342,0.0000654653,0.00015657039,0.000053783104,0.000017340573,0.000047714264,0.000097839824,0.32446656,0.0040584956,0.6636763,0.0072564627,0.000031361116],"about_ca_topic_score_codex":0.0022924077,"about_ca_topic_score_gemma":0.005850451,"teacher_disagreement_score":0.0096772965,"about_ca_system_score_codex":0.0008784655,"about_ca_system_score_gemma":0.0010986333,"threshold_uncertainty_score":0.032373786},"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":"methods","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.16520776,0.027126636,0.4655181,0.07458373,0.0041951495,0.0001460813,0.00094929984,0.00053872843,0.26173455],"genre_scores_gemma":[0.81152344,0.009965452,0.09317007,0.0054356516,0.009150531,0.0002823185,0.00091948383,0.00034075975,0.06921224],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9976119,0.00062617933,0.00011097092,0.000636238,0.0007309413,0.0002838012],"domain_scores_gemma":[0.99001384,0.0074357283,0.0005022842,0.0007971292,0.00082022004,0.00043080805],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021058735,0.0006599504,0.0013391874,0.0022028782,0.0027469702,0.004029038,0.0017707784,0.002144201,0.008543378],"category_scores_gemma":[0.011142811,0.00045007482,0.0014170666,0.0027354497,0.006433404,0.010588727,0.002920731,0.0072728894,0.001318997],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000017539156,0.000018684674,0.00008233379,0.000043030996,0.000006501208,0.000017147982,0.00009129561,0.0007189367,0.00012237656,0.9885014,0.0030821778,0.0072983783],"study_design_scores_gemma":[0.000007866194,0.000011993015,0.00012804606,0.000012507016,0.0000029044968,0.00003191221,0.000045701407,0.00232855,0.00019409515,0.9910114,0.006213326,0.0000116946],"about_ca_topic_score_codex":0.0017028272,"about_ca_topic_score_gemma":0.0008266762,"teacher_disagreement_score":0.008543378,"about_ca_system_score_codex":0.0034056117,"about_ca_system_score_gemma":0.001352711,"threshold_uncertainty_score":0.028580427},"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.16526106,0.009357436,0.3874471,0.025403233,0.0025652987,0.00010648341,0.0015664346,0.0013524253,0.40694058],"genre_scores_gemma":[0.8637183,0.004614554,0.061881565,0.0041396683,0.0034198866,0.0002471661,0.0012040337,0.00045407593,0.060320757],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9979588,0.00044216478,0.00008881158,0.00059158565,0.00053516787,0.0003835382],"domain_scores_gemma":[0.99538887,0.002353729,0.00029182842,0.0007460156,0.0008170886,0.00040250085],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0025084084,0.0008501366,0.0011790886,0.0025603776,0.0035140738,0.0041096504,0.0012948872,0.0013981828,0.015773853],"category_scores_gemma":[0.008588401,0.0004646586,0.0014456401,0.0016811971,0.005775053,0.014389563,0.005702759,0.0041950964,0.0022474623],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000057726793,0.000024156217,0.00029516555,0.00006577892,0.000009992475,0.000116196585,0.00029548266,0.00054831925,0.0005906912,0.97937167,0.007296752,0.011328122],"study_design_scores_gemma":[0.000012847624,0.000023627716,0.00027869383,0.000028819924,0.000007657662,0.00023633835,0.00009657559,0.0018806291,0.00073956035,0.96716994,0.02951125,0.000014019252],"about_ca_topic_score_codex":0.0019758418,"about_ca_topic_score_gemma":0.0011141389,"teacher_disagreement_score":0.015773853,"about_ca_system_score_codex":0.002926235,"about_ca_system_score_gemma":0.00064445875,"threshold_uncertainty_score":0.052768826},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.055896956,0.00065481075,0.93212485,0.00097314414,0.00012585189,0.00006218356,0.00018098354,0.0002980726,0.009683163],"genre_scores_gemma":[0.8600046,0.0014009408,0.11684826,0.001224177,0.0007909411,0.00078414485,0.00054527156,0.0005704473,0.017831165],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9928703,0.0024382058,0.00023675428,0.0015263308,0.0021972973,0.00073117856],"domain_scores_gemma":[0.9633249,0.022495614,0.0028169556,0.004385241,0.004776352,0.0022010498],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.013274619,0.0012841412,0.0021800844,0.0037410194,0.002278658,0.003621016,0.004093235,0.0016951092,0.0064978665],"category_scores_gemma":[0.038373716,0.0010699114,0.002257987,0.0024152845,0.009367582,0.012954865,0.005571655,0.005927938,0.0011828475],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000029000334,0.000020320836,0.00026230759,0.00003895665,0.000027762977,0.000059001617,0.00013043848,0.0038039617,0.00059224665,0.993174,0.00037062145,0.0014914381],"study_design_scores_gemma":[0.00001789155,0.00003175207,0.0003185272,0.000017537901,0.000018745572,0.00012872288,0.000033342847,0.12392183,0.000655971,0.87395155,0.00086119183,0.000042867116],"about_ca_topic_score_codex":0.0020807635,"about_ca_topic_score_gemma":0.0013761912,"teacher_disagreement_score":0.013274619,"about_ca_system_score_codex":0.0025657022,"about_ca_system_score_gemma":0.00233778,"threshold_uncertainty_score":0.07020378},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10751906,0.00037738495,0.8690548,0.0003303784,0.00021952919,0.00004640871,0.000072739065,0.0004908625,0.021888819],"genre_scores_gemma":[0.63433003,0.00037045134,0.35595366,0.00020365548,0.00011793524,0.00006330608,0.00015692481,0.00016583133,0.0086381985],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99964607,0.00006640204,0.000019855044,0.00004878394,0.00017450734,0.000044377546],"domain_scores_gemma":[0.999537,0.0001781884,0.000046735873,0.00010854713,0.00009923477,0.00003029848],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000571356,0.00032731582,0.00035051646,0.00079284207,0.00043153155,0.0011974399,0.0007017095,0.0004988591,0.003573501],"category_scores_gemma":[0.0034352131,0.00013536426,0.00036196117,0.0006412642,0.00093655137,0.0016768153,0.00069240475,0.0010084127,0.0010599055],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00020004097,0.000049852293,0.00096126547,0.00016735245,0.000011446973,0.00023327082,0.0001833099,0.016900389,0.01694732,0.87122834,0.0018826211,0.0912348],"study_design_scores_gemma":[0.000042787604,0.00023527035,0.00086014625,0.000076036384,0.00002535113,0.000646884,0.00009531445,0.34887236,0.02436291,0.6116302,0.013085458,0.00006723159],"about_ca_topic_score_codex":0.00034584882,"about_ca_topic_score_gemma":0.00039599155,"teacher_disagreement_score":0.003573501,"about_ca_system_score_codex":0.000521644,"about_ca_system_score_gemma":0.00039398082,"threshold_uncertainty_score":0.011954546},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.123804234,0.001906965,0.73626125,0.005753469,0.00071670616,0.00023505797,0.0023035626,0.0007635769,0.12825517],"genre_scores_gemma":[0.75179064,0.0021235216,0.17853099,0.0005080448,0.00031355507,0.0002828949,0.0016821427,0.00022090305,0.064547256],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99954444,0.00010072329,0.000024554995,0.000112236856,0.00013273723,0.00008527894],"domain_scores_gemma":[0.99909306,0.00038068765,0.00012601636,0.00016415911,0.00013804754,0.000098061],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003922489,0.0005039777,0.0005011657,0.0004200085,0.0012622621,0.0014386347,0.0013148837,0.00082907756,0.00799969],"category_scores_gemma":[0.003472393,0.00016937085,0.00047345337,0.00056662504,0.0012745047,0.0019582598,0.0023847816,0.0010691049,0.0021100864],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00061059016,0.00006040549,0.001659331,0.00045884383,0.000047722602,0.00065280753,0.00053758174,0.21385352,0.005364635,0.5886014,0.05328507,0.13486807],"study_design_scores_gemma":[0.000079466176,0.00017873012,0.0009393828,0.00010196558,0.000023877896,0.000712357,0.0008891548,0.49900362,0.008924744,0.35727927,0.13182124,0.00004624033],"about_ca_topic_score_codex":0.002436101,"about_ca_topic_score_gemma":0.002085342,"teacher_disagreement_score":0.00799969,"about_ca_system_score_codex":0.00095609255,"about_ca_system_score_gemma":0.00071197056,"threshold_uncertainty_score":0.026761651},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.123804234,0.001906965,0.73626125,0.005753469,0.00071670616,0.00023505797,0.0023035626,0.0007635769,0.12825517],"genre_scores_gemma":[0.75179064,0.0021235216,0.17853099,0.0005080448,0.00031355507,0.0002828949,0.0016821427,0.00022090305,0.064547256],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99954444,0.00010072329,0.000024554995,0.000112236856,0.00013273723,0.00008527894],"domain_scores_gemma":[0.99909306,0.00038068765,0.00012601636,0.00016415911,0.00013804754,0.000098061],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003922489,0.0005039777,0.0005011657,0.0004200085,0.0012622621,0.0014386347,0.0013148837,0.00082907756,0.00799969],"category_scores_gemma":[0.003472393,0.00016937085,0.00047345337,0.00056662504,0.0012745047,0.0019582598,0.0023847816,0.0010691049,0.0021100864],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00061059016,0.00006040549,0.001659331,0.00045884383,0.000047722602,0.00065280753,0.00053758174,0.21385352,0.005364635,0.5886014,0.05328507,0.13486807],"study_design_scores_gemma":[0.000079466176,0.00017873012,0.0009393828,0.00010196558,0.000023877896,0.000712357,0.0008891548,0.49900362,0.008924744,0.35727927,0.13182124,0.00004624033],"about_ca_topic_score_codex":0.002436101,"about_ca_topic_score_gemma":0.002085342,"teacher_disagreement_score":0.00799969,"about_ca_system_score_codex":0.00095609255,"about_ca_system_score_gemma":0.00071197056,"threshold_uncertainty_score":0.026761651},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9085355,0.0016575617,0.074762225,0.00052026444,0.00017502559,0.0001573842,0.00031049704,0.0028263165,0.011055213],"genre_scores_gemma":[0.98931074,0.00010909215,0.009505876,0.00003293699,0.000012355848,0.000023971657,0.00023303062,0.00003864163,0.0007332956],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.996042,0.0010253033,0.00025841224,0.0005954019,0.0011378935,0.00094109686],"domain_scores_gemma":[0.9949486,0.001979736,0.0004488377,0.0014636131,0.0008618666,0.0002972932],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002464004,0.00059361395,0.000897533,0.00085037935,0.0007929822,0.0018350764,0.001266822,0.0010421989,0.0040013096],"category_scores_gemma":[0.0067308433,0.00015746283,0.0004171503,0.0009856448,0.00061269297,0.00270733,0.0017170388,0.0008017894,0.0007109826],"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.014756397,0.0012547706,0.014452995,0.00054382393,0.0005454671,0.00038894895,0.0003314032,0.5841938,0.07729875,0.052196346,0.008610635,0.24542663],"study_design_scores_gemma":[0.0001743454,0.0007091471,0.0014756925,0.000014809638,0.00004735795,0.00014036434,0.000061566454,0.961171,0.031168312,0.0038410202,0.0011553771,0.000041042033],"about_ca_topic_score_codex":0.0017967083,"about_ca_topic_score_gemma":0.0009086901,"teacher_disagreement_score":0.0040013096,"about_ca_system_score_codex":0.0016691025,"about_ca_system_score_gemma":0.0020470757,"threshold_uncertainty_score":0.013385773},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.030560963,0.00010832114,0.96563596,0.00009776055,0.000020208536,0.000016161002,0.000036958383,0.0002119272,0.0033117465],"genre_scores_gemma":[0.73176295,0.00024955254,0.26254928,0.00007691749,0.00005226068,0.00011169953,0.0002506939,0.0003113596,0.004635262],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995844,0.00018543171,0.000019751424,0.00005268644,0.00011049183,0.00004726504],"domain_scores_gemma":[0.9988269,0.00071020937,0.000116834155,0.0000869275,0.0001771112,0.00008210563],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013776572,0.0006388431,0.0006501609,0.00064911984,0.00036268827,0.001319717,0.0009815113,0.00067292334,0.0028150426],"category_scores_gemma":[0.004000489,0.00024421603,0.0004798314,0.00043101516,0.0012621533,0.0017818547,0.0013683641,0.0011909055,0.00053264166],"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.00014922394,0.000039552553,0.0006419398,0.00016727867,0.000033951976,0.00013231822,0.00020059376,0.6059283,0.0062410925,0.34757626,0.0011327978,0.037756756],"study_design_scores_gemma":[0.0000022725158,0.000012131999,0.000041453644,0.000005357984,0.0000012694665,0.000009493934,0.000016506114,0.9632713,0.00070610654,0.035575088,0.0003526397,0.000006327183],"about_ca_topic_score_codex":0.0013498258,"about_ca_topic_score_gemma":0.001424532,"teacher_disagreement_score":0.0028150426,"about_ca_system_score_codex":0.0007956257,"about_ca_system_score_gemma":0.00070001563,"threshold_uncertainty_score":0.009417236},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06102092,0.00024621724,0.9199994,0.00020605403,0.00018205357,0.00015001977,0.00025421262,0.0046242294,0.013316841],"genre_scores_gemma":[0.25913903,0.00022664237,0.72608656,0.00009273971,0.00021331018,0.00014358165,0.0011398821,0.00060564675,0.012352606],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99948114,0.000061087834,0.00003883316,0.00012431163,0.00019682907,0.00009775559],"domain_scores_gemma":[0.9991258,0.00028063048,0.000084346095,0.00020554836,0.00022320448,0.00008056785],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00066892477,0.001233506,0.0008464306,0.0015389646,0.0007196365,0.0016029647,0.0013837426,0.00057551445,0.011239695],"category_scores_gemma":[0.0025724738,0.00039598925,0.0011384262,0.0014628858,0.0006090344,0.0026318943,0.0022791019,0.0011990914,0.0039777975],"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.0006461043,0.0002577949,0.0023775715,0.00030060983,0.00010216158,0.00037286547,0.00029081164,0.022197895,0.04047295,0.13131477,0.014875223,0.78679127],"study_design_scores_gemma":[0.0005060266,0.00085312023,0.0024945766,0.00012339701,0.00026787462,0.0013792141,0.0003450384,0.59645194,0.07745807,0.27891865,0.041081365,0.00012073583],"about_ca_topic_score_codex":0.0006768942,"about_ca_topic_score_gemma":0.001805443,"teacher_disagreement_score":0.011239695,"about_ca_system_score_codex":0.00079523266,"about_ca_system_score_gemma":0.0011061196,"threshold_uncertainty_score":0.037600577},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.02839015,0.00020471265,0.93520916,0.0002717631,0.00010898253,0.00013500957,0.00060805806,0.013080911,0.021991251],"genre_scores_gemma":[0.2900196,0.0001906724,0.6887165,0.00020620733,0.000107071835,0.00037560132,0.0014409237,0.0018080784,0.017135357],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99795234,0.00029206587,0.0001660012,0.00046114286,0.0007807924,0.0003476654],"domain_scores_gemma":[0.9969561,0.0010641947,0.00012749995,0.0012276148,0.00048068585,0.00014382722],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012464973,0.0011879525,0.001725829,0.001884018,0.00159634,0.0047801896,0.0041549294,0.001653347,0.032336507],"category_scores_gemma":[0.0065832417,0.0009475487,0.0016921125,0.003131875,0.0013281223,0.008814833,0.006213382,0.0018510531,0.0070547108],"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.00091782527,0.00029228322,0.0023552668,0.0004911488,0.0001067952,0.00022096133,0.0006114635,0.02487665,0.01355558,0.29556498,0.032519363,0.6284877],"study_design_scores_gemma":[0.00023386316,0.00025999002,0.0009029859,0.00013895944,0.00011465843,0.00036793962,0.00052658975,0.49174136,0.035682753,0.41510674,0.054798122,0.00012609157],"about_ca_topic_score_codex":0.0016897571,"about_ca_topic_score_gemma":0.0030767107,"teacher_disagreement_score":0.032336507,"about_ca_system_score_codex":0.0013637403,"about_ca_system_score_gemma":0.0011493553,"threshold_uncertainty_score":0.10817635},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0025953006,0.00043403605,0.7588702,0.00200547,0.00091162807,0.0003280908,0.02880627,0.06442345,0.14162548],"genre_scores_gemma":[0.039661456,0.0010634313,0.7102811,0.000970284,0.0005303523,0.0005843617,0.06745507,0.030827647,0.14862634],"study_design_codex":"not_applicable","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99895215,0.00019233371,0.00011332938,0.00021909612,0.00041954414,0.00010353573],"domain_scores_gemma":[0.9983139,0.0005323969,0.00008653265,0.00048353095,0.00046789864,0.00011567418],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013917324,0.001140325,0.0010719029,0.0029262465,0.0011053471,0.004397924,0.0023039498,0.0014142368,0.2322021],"category_scores_gemma":[0.0056188214,0.0009483832,0.0013155894,0.0033355039,0.0006224108,0.004194923,0.0027602108,0.0022599697,0.13631633],"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.00022067277,0.00016490124,0.00036602316,0.0005600354,0.00003453974,0.00011975889,0.00020560314,0.0027701538,0.0064791637,0.21246259,0.5385771,0.2380396],"study_design_scores_gemma":[0.0001468122,0.00004169544,0.0003650458,0.00016420045,0.000019611058,0.0002594922,0.000070112656,0.02514117,0.013669435,0.11694989,0.84310466,0.000067831774],"about_ca_topic_score_codex":0.0024908183,"about_ca_topic_score_gemma":0.0038778638,"teacher_disagreement_score":0.2322021,"about_ca_system_score_codex":0.0014822461,"about_ca_system_score_gemma":0.001555385,"threshold_uncertainty_score":0.7767934},"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":"methods","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0030249285,0.003635712,0.64038694,0.01123593,0.002107029,0.00037435116,0.00158184,0.0037562698,0.33389693],"genre_scores_gemma":[0.058874983,0.0060809,0.63917404,0.004904988,0.0005612008,0.0006913949,0.0036262488,0.0033008428,0.2827854],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9988973,0.00023204884,0.000082342434,0.00027185018,0.00039939652,0.000116951414],"domain_scores_gemma":[0.9990382,0.00037961832,0.00005025908,0.00022744364,0.0002287102,0.0000758417],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009402645,0.0009943282,0.00071620813,0.00095247664,0.0016209872,0.0049928143,0.0014891041,0.002115636,0.09880885],"category_scores_gemma":[0.005726865,0.00057265896,0.0014802199,0.0013016292,0.0017229134,0.00937948,0.003025317,0.003458667,0.04657399],"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.00005017838,0.000046293233,0.00021172863,0.00046353828,0.000028964458,0.00015304235,0.00054641964,0.0034640834,0.0013088334,0.6671258,0.13877441,0.1878268],"study_design_scores_gemma":[0.000019639036,0.000034065113,0.00011094157,0.00031006406,0.000015097142,0.00025874734,0.00027217597,0.0062540593,0.00081005273,0.34020916,0.65168524,0.000020822612],"about_ca_topic_score_codex":0.0013125665,"about_ca_topic_score_gemma":0.0016741452,"teacher_disagreement_score":0.09880885,"about_ca_system_score_codex":0.0011806486,"about_ca_system_score_gemma":0.0018131144,"threshold_uncertainty_score":0.33054852},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0024615088,0.0062847,0.43732166,0.0024688488,0.0010919234,0.00012950135,0.0007553931,0.0045342394,0.54495215],"genre_scores_gemma":[0.05552935,0.0066477642,0.32607615,0.0020232536,0.0005510168,0.0002794294,0.0016089593,0.0028124135,0.6044717],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99968207,0.000042432705,0.000014656227,0.000081718434,0.00014521168,0.000033865388],"domain_scores_gemma":[0.9997898,0.00006316705,0.000010370792,0.000054752556,0.000066405955,0.000015622598],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00027955908,0.00073276693,0.00045298727,0.0008954531,0.0007075978,0.0035792869,0.0008895738,0.0010486026,0.08316353],"category_scores_gemma":[0.0014908968,0.000419311,0.0006081379,0.000785688,0.0012910849,0.005485702,0.0015829697,0.0019200102,0.036754977],"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.000019982066,0.000011802841,0.00008869977,0.00018967931,0.000008294402,0.00007541908,0.0003796107,0.0010914302,0.0018663883,0.7089774,0.11036189,0.17692941],"study_design_scores_gemma":[0.0000068376567,0.000012134718,0.00015798329,0.00010975719,0.000005042791,0.00038279864,0.00012612788,0.0032925399,0.001455765,0.2412128,0.75322384,0.0000143826555],"about_ca_topic_score_codex":0.0010727401,"about_ca_topic_score_gemma":0.0016265769,"teacher_disagreement_score":0.08316353,"about_ca_system_score_codex":0.0010133494,"about_ca_system_score_gemma":0.00050520705,"threshold_uncertainty_score":0.27820975},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.001360016,0.03175025,0.38680157,0.009421179,0.0031096488,0.00019312584,0.0005363988,0.0033767414,0.5634511],"genre_scores_gemma":[0.03336187,0.03644294,0.30669102,0.005483423,0.0023280024,0.00063668686,0.001357917,0.0021151046,0.61158305],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987218,0.00027161223,0.0000716575,0.00023370712,0.0005798863,0.00012131413],"domain_scores_gemma":[0.9991872,0.00035654166,0.000039448856,0.00019785996,0.00016123547,0.000057748923],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010689455,0.0015173821,0.00065675925,0.0017089124,0.0013763647,0.006321942,0.0014554398,0.0014434466,0.04412454],"category_scores_gemma":[0.0035147,0.00078568986,0.0011379393,0.0018890612,0.0039213724,0.008273245,0.0028398198,0.005490641,0.028974924],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009290885,0.000017767114,0.000071751034,0.00031963654,0.000009502625,0.000039428065,0.0006822253,0.0008204614,0.0005335556,0.76622707,0.13075724,0.100511946],"study_design_scores_gemma":[0.000003956914,0.000010516588,0.00009344639,0.00022594353,0.000004304276,0.00013037921,0.00012404204,0.00086255145,0.00024772578,0.28459668,0.71369123,0.000009274699],"about_ca_topic_score_codex":0.0013674176,"about_ca_topic_score_gemma":0.0015429182,"teacher_disagreement_score":0.04412454,"about_ca_system_score_codex":0.002341648,"about_ca_system_score_gemma":0.0019219569,"threshold_uncertainty_score":0.14761132},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0031196733,0.014706597,0.4847842,0.0054842485,0.002365064,0.00017372482,0.0013139257,0.0032354384,0.48481715],"genre_scores_gemma":[0.08213128,0.017288238,0.32321277,0.0035722794,0.0017768184,0.0006589928,0.0031850524,0.0024111185,0.56576335],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99937856,0.000113273134,0.000047333247,0.00014439535,0.00026717933,0.000049207243],"domain_scores_gemma":[0.9995777,0.00016180736,0.000028239288,0.000089624366,0.000121992045,0.000020635633],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005709523,0.00088727596,0.0005872857,0.0010748719,0.0008255568,0.002965911,0.0008972154,0.0008137104,0.056378007],"category_scores_gemma":[0.0028617436,0.0004174286,0.0008221544,0.001261866,0.001221004,0.004959091,0.0013200042,0.0023507602,0.027274845],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000012839232,0.000013159458,0.0000742629,0.00019740987,0.00001060703,0.000054428772,0.00030665818,0.001332178,0.0006587644,0.7864715,0.10155509,0.10931316],"study_design_scores_gemma":[0.000006884754,0.000016180476,0.00012834226,0.00014038343,0.000008159607,0.00023034179,0.00007846482,0.0030743068,0.00067031843,0.45946896,0.53616154,0.00001609517],"about_ca_topic_score_codex":0.0009651727,"about_ca_topic_score_gemma":0.0013503651,"teacher_disagreement_score":0.056378007,"about_ca_system_score_codex":0.0012331024,"about_ca_system_score_gemma":0.0007405921,"threshold_uncertainty_score":0.18860322},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0145642515,0.0002199002,0.98054504,0.00015484444,0.000036266567,0.00005057685,0.000041006537,0.00025650358,0.0041316],"genre_scores_gemma":[0.30626708,0.0009465031,0.6838501,0.000103395345,0.00014668668,0.00009186354,0.0002849027,0.00019725303,0.008112165],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993612,0.0001291349,0.00004666246,0.00009901192,0.00027804225,0.00008593409],"domain_scores_gemma":[0.99900013,0.00045406315,0.00010513252,0.00018089723,0.00022054247,0.00003923203],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010724615,0.00050686393,0.00058763986,0.0011165278,0.00070035696,0.0013083944,0.0007228088,0.00036667904,0.0039731245],"category_scores_gemma":[0.0036951168,0.00023912579,0.00081101496,0.0012287531,0.0011557759,0.001997148,0.0018321412,0.0015493644,0.001323226],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00011112935,0.00006369559,0.00090514537,0.00017383281,0.0000231305,0.0001898428,0.0004089287,0.06440089,0.00838718,0.6561494,0.0025352018,0.2666516],"study_design_scores_gemma":[0.000057131972,0.00012423271,0.00039430763,0.00006482637,0.000030169955,0.00037568746,0.00016264012,0.38416892,0.0144012375,0.5803423,0.019841399,0.00003710752],"about_ca_topic_score_codex":0.0007449807,"about_ca_topic_score_gemma":0.0012542533,"teacher_disagreement_score":0.0039731245,"about_ca_system_score_codex":0.0007945172,"about_ca_system_score_gemma":0.0009301038,"threshold_uncertainty_score":0.013291419},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.51521003,0.0012966583,0.32940418,0.0017623792,0.00023375501,0.00019142161,0.0006848769,0.00035968891,0.15085702],"genre_scores_gemma":[0.969724,0.00033283766,0.019919902,0.0002451625,0.00014253621,0.000113782175,0.00031481075,0.00004905443,0.009157882],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986576,0.0002454595,0.00010088636,0.00031960753,0.00033717885,0.00033931283],"domain_scores_gemma":[0.9954015,0.0018101579,0.0006070146,0.00060584,0.000891824,0.00068352575],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014539805,0.0004645572,0.0005865471,0.0013327955,0.0020498752,0.0023970627,0.0008776309,0.00094532757,0.016273743],"category_scores_gemma":[0.005187311,0.00039755006,0.0010240376,0.0008601328,0.0032483388,0.008145832,0.004738703,0.0019454114,0.0012399843],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000028005652,0.000020918053,0.0008268443,0.000037123507,0.000006371741,0.00011258671,0.00021760972,0.0009244228,0.0012899456,0.9942095,0.00033124417,0.0019954627],"study_design_scores_gemma":[0.00002425224,0.00007943635,0.0007133118,0.0000342248,0.000019573925,0.0002749511,0.00037489797,0.01594308,0.004414446,0.9721254,0.005971214,0.000025215862],"about_ca_topic_score_codex":0.0010356042,"about_ca_topic_score_gemma":0.001071866,"teacher_disagreement_score":0.016273743,"about_ca_system_score_codex":0.001666303,"about_ca_system_score_gemma":0.00076306064,"threshold_uncertainty_score":0.054441094},"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":"editorial","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00041216408,0.0015001999,0.0050829113,0.07788071,0.9064724,0.000020583278,0.0016077529,0.00094248226,0.006080809],"genre_scores_gemma":[0.06321773,0.008065381,0.019409517,0.12033266,0.54143405,0.00023077235,0.0037295383,0.005438038,0.23814231],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99401265,0.0011545612,0.00083692634,0.0010438348,0.0024703648,0.0004815675],"domain_scores_gemma":[0.96358603,0.008382092,0.0017288026,0.0023219495,0.0224319,0.0015493733],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0041682944,0.0022795962,0.0014395624,0.0033500225,0.003085905,0.0039772647,0.002823633,0.0042323046,0.058229707],"category_scores_gemma":[0.06412982,0.0008027817,0.0013269414,0.0024436577,0.0037479731,0.005144453,0.002732566,0.009241614,0.030688386],"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.00006769556,0.000005591386,0.00008884558,0.00015024462,0.000012473041,0.00014850259,0.000089365654,0.0000900207,0.00009527478,0.0076486333,0.9854403,0.0061630816],"study_design_scores_gemma":[0.000034808338,0.000027148551,0.0006398878,0.00019692283,0.000027706776,0.0005305292,0.0000955804,0.0006976076,0.0005380753,0.009149421,0.98800665,0.000055648023],"about_ca_topic_score_codex":0.008905161,"about_ca_topic_score_gemma":0.007727717,"teacher_disagreement_score":0.058229707,"about_ca_system_score_codex":0.0045196293,"about_ca_system_score_gemma":0.005294479,"threshold_uncertainty_score":0.19479781},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.45721102,0.0037627069,0.13917229,0.007429385,0.00206275,0.00015474003,0.0006991302,0.0006191484,0.38888875],"genre_scores_gemma":[0.91726476,0.0013718496,0.019939296,0.00076258543,0.0007308814,0.00007625479,0.00041694002,0.00019180603,0.059245653],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99945194,0.00011101647,0.00002497536,0.00009870412,0.00019550537,0.00011783384],"domain_scores_gemma":[0.9992538,0.0002840816,0.000115158255,0.00009156742,0.00013417375,0.000121149315],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00058069854,0.0005766829,0.0007890685,0.0017919734,0.0022316363,0.0031764898,0.00088898407,0.0010857515,0.012901986],"category_scores_gemma":[0.0028217782,0.00044406595,0.0006142989,0.0013649273,0.0033894533,0.002973302,0.0022811193,0.0032620712,0.0015528167],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000016341388,0.0000062705253,0.000049197202,0.000017776158,0.0000018351393,0.000025727768,0.00015180882,0.0007223332,0.00024858082,0.99435705,0.0009164543,0.0034866068],"study_design_scores_gemma":[0.0000127368,0.000005900329,0.00007562735,0.0000075541384,0.0000021165456,0.00003117505,0.0000941968,0.0022637036,0.00012429153,0.99197024,0.0054052602,0.000007262084],"about_ca_topic_score_codex":0.0043439986,"about_ca_topic_score_gemma":0.0039459225,"teacher_disagreement_score":0.012901986,"about_ca_system_score_codex":0.001910285,"about_ca_system_score_gemma":0.0007783574,"threshold_uncertainty_score":0.04316145},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.049519457,0.0013438107,0.82605636,0.0017559873,0.00037687595,0.00015987577,0.00055121246,0.00052751106,0.1197089],"genre_scores_gemma":[0.7570364,0.0017971802,0.21290691,0.0009930856,0.0006231788,0.00047369263,0.0007523275,0.00039873098,0.02501849],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.998243,0.00045150897,0.00007304742,0.00027792266,0.0006583908,0.0002961334],"domain_scores_gemma":[0.9984957,0.0006723285,0.00011962558,0.00031316825,0.00025891594,0.00014029692],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017625274,0.0012484435,0.0012488639,0.0025398545,0.002389394,0.006574282,0.0025102573,0.0018893471,0.011255355],"category_scores_gemma":[0.0034283688,0.0009576073,0.0023622797,0.002202809,0.004624498,0.010066737,0.0033119742,0.0056288852,0.0019005247],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000022648312,0.0000041353737,0.000009406517,0.000008001371,0.0000013520894,0.000016890815,0.00003059471,0.00044571963,0.0001266967,0.9987595,0.00014536436,0.00045002566],"study_design_scores_gemma":[0.00000815443,0.000007373831,0.000022840133,0.000013539921,0.0000046420823,0.00003554868,0.000026275022,0.0054843226,0.00031819823,0.9908454,0.003224602,0.000009143544],"about_ca_topic_score_codex":0.002342885,"about_ca_topic_score_gemma":0.002586964,"teacher_disagreement_score":0.011255355,"about_ca_system_score_codex":0.0038835227,"about_ca_system_score_gemma":0.0014498389,"threshold_uncertainty_score":0},"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":"editorial","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0005912247,0.001547434,0.00468549,0.13701735,0.8487525,0.00002324517,0.0014639031,0.0010311992,0.0048876735],"genre_scores_gemma":[0.07886906,0.008207482,0.015464249,0.15646677,0.5557753,0.0002565966,0.0028295903,0.0053482596,0.17678273],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9926105,0.0015788317,0.000984936,0.0013404073,0.0028497106,0.0006355269],"domain_scores_gemma":[0.9555133,0.012326628,0.0021212748,0.0029376675,0.025245475,0.0018556637],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0054504895,0.002013133,0.0015446255,0.0033330906,0.0037455184,0.004555653,0.0029478343,0.0046564317,0.03899876],"category_scores_gemma":[0.08708747,0.0008069344,0.0011695242,0.0025036763,0.0047746105,0.0053096456,0.0028086742,0.010947375,0.02164549],"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.000051437477,0.000005196988,0.000094097806,0.00010584716,0.000010133509,0.00012907416,0.00007928501,0.00009774066,0.000067574605,0.006805799,0.9876633,0.004890502],"study_design_scores_gemma":[0.000043159704,0.000027758817,0.00064208836,0.00024574884,0.000028643446,0.00054991536,0.00011431675,0.0009120008,0.00061932625,0.01172414,0.9850212,0.000071628725],"about_ca_topic_score_codex":0.010843783,"about_ca_topic_score_gemma":0.008282906,"teacher_disagreement_score":0.03899876,"about_ca_system_score_codex":0.0052392813,"about_ca_system_score_gemma":0.0050803046,"threshold_uncertainty_score":0.13046384},"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":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0014511023,0.0015918216,0.96804863,0.0005490478,0.0002120094,0.00004273713,0.00035348165,0.00055140833,0.027199829],"genre_scores_gemma":[0.10559185,0.009171745,0.772288,0.0008215197,0.00057132036,0.000351274,0.0019767731,0.0020592643,0.10716826],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9996221,0.00006426761,0.000015335285,0.00007878003,0.00019835692,0.000021041],"domain_scores_gemma":[0.99965453,0.00018310531,0.000012478061,0.00006953765,0.000068827416,0.000011443678],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006039427,0.0007482615,0.0006411536,0.00040142072,0.00037164238,0.0013521113,0.0008616844,0.0005625176,0.014351936],"category_scores_gemma":[0.0017128926,0.00040848914,0.00066927326,0.00071834185,0.00068572036,0.0015677126,0.0013419776,0.002230194,0.0048350347],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000040695748,0.000054939865,0.0002432693,0.0005370884,0.00004003075,0.00007271453,0.00015293287,0.17407247,0.0058061224,0.6202995,0.03623278,0.16244745],"study_design_scores_gemma":[0.0000102006325,0.000029586063,0.00020807098,0.0001439959,0.000012874178,0.000095406576,0.000041193394,0.4704318,0.007210941,0.31655818,0.20522693,0.000030834897],"about_ca_topic_score_codex":0.0013301864,"about_ca_topic_score_gemma":0.0016443273,"teacher_disagreement_score":0.014351936,"about_ca_system_score_codex":0.0009038058,"about_ca_system_score_gemma":0.0009505951,"threshold_uncertainty_score":0.04801202},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07092817,0.0059394496,0.7915352,0.0071887732,0.0017694968,0.00006138077,0.00018872182,0.00019477638,0.122194014],"genre_scores_gemma":[0.73935324,0.00889133,0.17235109,0.002452037,0.004070631,0.00021907709,0.00040805654,0.00041210616,0.07184245],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989091,0.00055249885,0.00004663566,0.00012033742,0.00027843454,0.00009301589],"domain_scores_gemma":[0.99607277,0.0023824195,0.00032611532,0.0003077802,0.0005688011,0.00034216998],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0029855245,0.0015556775,0.0013346296,0.003521616,0.001796722,0.003571958,0.0021587794,0.0017971847,0.006969176],"category_scores_gemma":[0.011537613,0.0007057253,0.0013909182,0.0027808365,0.0062314984,0.0075519495,0.0034610135,0.0055916933,0.00089396467],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000004027372,0.000007256733,0.00005179365,0.000010571342,0.0000026006815,0.000010520772,0.000042094653,0.001037527,0.000063646374,0.99701786,0.00031469445,0.0014373432],"study_design_scores_gemma":[0.0000034844993,0.000003817395,0.000041282274,0.000007097865,0.0000020074037,0.000012175583,0.00001556381,0.0120303435,0.000039239967,0.98682225,0.0010178282,0.0000047984895],"about_ca_topic_score_codex":0.002311591,"about_ca_topic_score_gemma":0.0027679433,"teacher_disagreement_score":0.006969176,"about_ca_system_score_codex":0.0022671558,"about_ca_system_score_gemma":0.0010885083,"threshold_uncertainty_score":0.023314238},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.20926014,0.002093283,0.6178055,0.0010424581,0.0005127712,0.000054906886,0.00022304407,0.00036451334,0.16864336],"genre_scores_gemma":[0.84041655,0.0013211963,0.08867776,0.00033364625,0.0003823548,0.000045299505,0.00012788827,0.00029955385,0.06839568],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99970347,0.000052128125,0.000014056477,0.00004850523,0.00013777563,0.00004408524],"domain_scores_gemma":[0.99967253,0.000078390316,0.000032547716,0.00005407758,0.000105268526,0.0000572744],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000622095,0.00046738374,0.00043555105,0.0010344657,0.00060542993,0.0012394678,0.0007117402,0.0005952172,0.005871698],"category_scores_gemma":[0.0015113839,0.0001786099,0.0005112479,0.00051584875,0.0010858357,0.0025147912,0.0008485649,0.001311964,0.0011210259],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000007968845,0.00000925399,0.000073424104,0.000020367255,0.000002786289,0.00008398878,0.00006758735,0.0014721721,0.0011652033,0.9928127,0.0004623182,0.00382222],"study_design_scores_gemma":[0.000011516338,0.000030904674,0.00025509394,0.000025926569,0.000012050847,0.000514918,0.00006761528,0.063935325,0.0028421483,0.91892356,0.013360595,0.000020277948],"about_ca_topic_score_codex":0.0005816513,"about_ca_topic_score_gemma":0.00071289734,"teacher_disagreement_score":0.005871698,"about_ca_system_score_codex":0.0007358536,"about_ca_system_score_gemma":0.00058327377,"threshold_uncertainty_score":0.01964271},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09815276,0.00084423984,0.8882336,0.0028360016,0.00012014016,0.000045953195,0.00032936037,0.00028910444,0.0091487905],"genre_scores_gemma":[0.9264822,0.00088560925,0.06374058,0.000493379,0.0005188058,0.000075924225,0.0002768421,0.00014637064,0.007380412],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99694854,0.0016983296,0.00008350861,0.00042901468,0.00045145492,0.00038911146],"domain_scores_gemma":[0.9716134,0.021969777,0.0022722278,0.0020094803,0.0012623724,0.0008727486],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0056140414,0.00085503457,0.001629882,0.002209713,0.0018246224,0.002888242,0.0023111424,0.0018027219,0.004429053],"category_scores_gemma":[0.045054622,0.0008785232,0.0011745347,0.0018507898,0.00622062,0.006214012,0.003939514,0.0037150667,0.0007063134],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000024661105,0.00001321959,0.00047992103,0.000021955891,0.00001145438,0.000037019432,0.00011243415,0.023653686,0.00012728763,0.9713761,0.00051829795,0.0036240353],"study_design_scores_gemma":[0.0000046785003,0.0000055536743,0.00011580312,0.0000065916174,0.0000028204759,0.000019904925,0.000017990542,0.07909089,0.000062510604,0.92032695,0.00033525456,0.000011116435],"about_ca_topic_score_codex":0.004896357,"about_ca_topic_score_gemma":0.0040252814,"teacher_disagreement_score":0.0056140414,"about_ca_system_score_codex":0.0025595666,"about_ca_system_score_gemma":0.0020504908,"threshold_uncertainty_score":0.029690266},"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0050140093,0.00056846085,0.21315184,0.0060902033,0.0020238075,0.0004059833,0.031247938,0.038790356,0.7027074],"genre_scores_gemma":[0.04905377,0.0027386078,0.17763686,0.0028670914,0.0006808296,0.00094473583,0.06674746,0.073851615,0.625479],"study_design_codex":"not_applicable","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99931705,0.00014647754,0.000056138717,0.00011502769,0.0002901849,0.000075148484],"domain_scores_gemma":[0.9991689,0.00018149982,0.000064356565,0.00027623738,0.0002183705,0.00009082104],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0009987468,0.0011893751,0.00073142425,0.001919074,0.0012333574,0.005718514,0.002152362,0.0016457307,0.31512722],"category_scores_gemma":[0.0028896637,0.0008116466,0.0012364715,0.0029955762,0.00091979775,0.0063098604,0.0018320595,0.002612885,0.16246258],"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.0001330637,0.000074877964,0.0003267966,0.0002527011,0.000027710981,0.00020109618,0.0003932915,0.00074304506,0.0038763024,0.18089391,0.72992224,0.08315492],"study_design_scores_gemma":[0.000052325817,0.000016222957,0.0005877001,0.00008917778,0.000010097474,0.00015766302,0.00014915553,0.0031353838,0.0044396063,0.05576286,0.93555623,0.00004354384],"about_ca_topic_score_codex":0.011745596,"about_ca_topic_score_gemma":0.017526438,"teacher_disagreement_score":0.31512722,"about_ca_system_score_codex":0.0019982336,"about_ca_system_score_gemma":0.001211112,"threshold_uncertainty_score":0.9768879},"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":"software","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"software","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0068485104,0.00027292708,0.9126521,0.00047192365,0.0002774443,0.00039212184,0.003350315,0.05211241,0.023622211],"genre_scores_gemma":[0.04812454,0.00020958082,0.8964932,0.0004635899,0.00011293452,0.0009855885,0.009201765,0.013746908,0.030661901],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9991161,0.00012001059,0.00006818306,0.00018834727,0.0003592054,0.00014812505],"domain_scores_gemma":[0.9980957,0.00049531733,0.00014202352,0.0003521763,0.00083466683,0.00008013301],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009672058,0.0021974957,0.0009271853,0.0015943539,0.0014369431,0.0033161542,0.0024852608,0.0012648972,0.070787124],"category_scores_gemma":[0.0045736865,0.00072086725,0.00093166524,0.0012967266,0.000910672,0.002518509,0.0026483159,0.0015860422,0.04151941],"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.00052488793,0.00018048823,0.0027634643,0.0009168318,0.000109455876,0.00029369254,0.00036128075,0.040612835,0.009625287,0.073202014,0.31586877,0.555541],"study_design_scores_gemma":[0.0005773405,0.00018707608,0.001638839,0.0003889845,0.00006163328,0.0008660364,0.00034181183,0.42611715,0.047047116,0.1297641,0.39285055,0.00015935767],"about_ca_topic_score_codex":0.0035227924,"about_ca_topic_score_gemma":0.0056245923,"teacher_disagreement_score":0.070787124,"about_ca_system_score_codex":0.0014846248,"about_ca_system_score_gemma":0.0036557508,"threshold_uncertainty_score":0.23680657},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07375809,0.0019490502,0.8194869,0.0072680446,0.00060129666,0.00024247477,0.0007088236,0.0057265265,0.09025876],"genre_scores_gemma":[0.8756664,0.0009097989,0.10224365,0.0014903876,0.0005536809,0.0005904961,0.0008034902,0.0006888995,0.017053304],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9870781,0.0035749627,0.0006476808,0.0022201103,0.0040849084,0.0023943507],"domain_scores_gemma":[0.9624726,0.02619572,0.0016726643,0.006389009,0.0021376256,0.0011323659],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0084009925,0.001451169,0.0014760956,0.0021441225,0.0022729794,0.0072650164,0.003372047,0.0031891707,0.013854401],"category_scores_gemma":[0.031541083,0.00093467976,0.0018107083,0.0022327239,0.00789431,0.016649403,0.009293464,0.008579456,0.0031819784],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00035694594,0.00008706979,0.00025629922,0.00014359118,0.000024644,0.00007671259,0.00024572856,0.018082043,0.0013726744,0.95789397,0.003766681,0.017693616],"study_design_scores_gemma":[0.000082745224,0.00007340538,0.000090262525,0.000055766537,0.000032749707,0.00003769055,0.000028800097,0.109116785,0.0036290248,0.8813563,0.0054575177,0.000038901962],"about_ca_topic_score_codex":0.0027558096,"about_ca_topic_score_gemma":0.0027238736,"teacher_disagreement_score":0.013854401,"about_ca_system_score_codex":0.008484409,"about_ca_system_score_gemma":0.004218117,"threshold_uncertainty_score":0.061558962},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12837806,0.0009751101,0.83704776,0.0039687725,0.00011949514,0.00021497294,0.0026518656,0.0017016515,0.0249423],"genre_scores_gemma":[0.8080069,0.0008000006,0.16848698,0.0008529712,0.000527968,0.0006995887,0.003339205,0.0011163085,0.016170176],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9950363,0.0009536704,0.0002406127,0.0013004186,0.001587373,0.0008817343],"domain_scores_gemma":[0.9747055,0.018916517,0.0013487884,0.0030723922,0.0012063821,0.0007505348],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0030236433,0.0013219115,0.0017923939,0.0016953255,0.001949817,0.0059774136,0.0040823524,0.0017377258,0.00751483],"category_scores_gemma":[0.017404795,0.0010695772,0.0031742528,0.002266166,0.0045672213,0.014072384,0.0029780196,0.008306413,0.0010577731],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00031690794,0.00015486668,0.0012480933,0.00039153086,0.000051963456,0.0001535572,0.00064026844,0.039035812,0.0035583363,0.9382961,0.003652932,0.01249961],"study_design_scores_gemma":[0.00006821528,0.000046367837,0.0005611482,0.000039357612,0.000033480093,0.00012551631,0.000106488034,0.13020109,0.002419038,0.86139995,0.004956971,0.000042364638],"about_ca_topic_score_codex":0.0035561672,"about_ca_topic_score_gemma":0.0046438933,"teacher_disagreement_score":0.00751483,"about_ca_system_score_codex":0.0046314322,"about_ca_system_score_gemma":0.0034406013,"threshold_uncertainty_score":0.03360355},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7900411,0.0012174788,0.17761089,0.0042385412,0.00012251246,0.00033195005,0.0012416353,0.0015562631,0.023639597],"genre_scores_gemma":[0.9051986,0.00053797354,0.08514928,0.00043549543,0.0002455727,0.0003463401,0.0019302015,0.00035464732,0.0058020246],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9953544,0.0011275996,0.0003216317,0.0007949536,0.0015192785,0.00088214915],"domain_scores_gemma":[0.9687228,0.025267448,0.001598997,0.002781473,0.0009096901,0.00071959227],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002830805,0.0010293665,0.001104737,0.0014436968,0.0011892318,0.00525653,0.0029146967,0.0012923571,0.006553431],"category_scores_gemma":[0.021999894,0.00065911503,0.0014099979,0.0015961978,0.003058724,0.010083597,0.003860082,0.0034610906,0.00097244565],"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.006515854,0.0009850903,0.028711643,0.0017134595,0.0004664825,0.00081161596,0.0026269087,0.3458143,0.055763952,0.3338646,0.013915257,0.20881093],"study_design_scores_gemma":[0.00028872024,0.00030240603,0.003352363,0.0000851938,0.00014771611,0.00026709007,0.00045880376,0.65359503,0.021256767,0.31698036,0.0031763138,0.000089281406],"about_ca_topic_score_codex":0.0024253132,"about_ca_topic_score_gemma":0.0043737297,"teacher_disagreement_score":0.006553431,"about_ca_system_score_codex":0.003676367,"about_ca_system_score_gemma":0.0027751378,"threshold_uncertainty_score":0.026674032},"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":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0030805715,0.047249753,0.08648414,0.0044823335,0.0045483494,0.000074089585,0.0005654203,0.00060114847,0.85291415],"genre_scores_gemma":[0.072669886,0.048134845,0.04548722,0.0017854943,0.006488853,0.000283653,0.0010794965,0.0007950392,0.82327545],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99957424,0.00008044413,0.00001835153,0.000075375705,0.00021351165,0.000038036425],"domain_scores_gemma":[0.9996176,0.0001818907,0.000018608667,0.000082268634,0.00006577011,0.000033906566],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00035048253,0.001372576,0.0016976141,0.0017283601,0.0012331471,0.0042980146,0.0010419522,0.00073920866,0.045519654],"category_scores_gemma":[0.0012064208,0.0005269804,0.0006132915,0.004397611,0.0020084851,0.0038904704,0.0012973783,0.0037183824,0.021583451],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000019384497,0.00003191236,0.000076807824,0.0003235038,0.000013838593,0.000020773257,0.00011348517,0.0010389091,0.0005139499,0.7469632,0.11142826,0.13945608],"study_design_scores_gemma":[0.0000133204685,0.000017453907,0.00023158522,0.00009731351,0.000010154109,0.00011492465,0.000047613164,0.0024145097,0.00025076012,0.60373,0.39306387,0.000008437341],"about_ca_topic_score_codex":0.00072676665,"about_ca_topic_score_gemma":0.0010010818,"teacher_disagreement_score":0.045519654,"about_ca_system_score_codex":0.0019264193,"about_ca_system_score_gemma":0.0010745242,"threshold_uncertainty_score":0.15227842},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6944764,0.0028383906,0.15329768,0.0026444327,0.00030277696,0.00007540252,0.0002779759,0.00025250192,0.14583449],"genre_scores_gemma":[0.98052156,0.0004332663,0.010437935,0.000094606396,0.00018853327,0.00002702249,0.00010276481,0.000020362604,0.008174028],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9996296,0.00009842001,0.000013670893,0.00006353697,0.00013937303,0.00005529256],"domain_scores_gemma":[0.99972695,0.00008758643,0.000040489183,0.000047374226,0.000048675884,0.000048872826],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00041830214,0.00034369575,0.0003137938,0.0012210859,0.00097618613,0.0016304766,0.00042862172,0.00033619857,0.0028707327],"category_scores_gemma":[0.0007555863,0.00012880786,0.00037533554,0.00058369973,0.0029605099,0.0026469207,0.0013880711,0.0008907303,0.0003475318],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000044326457,0.000005669262,0.00015784208,0.000009640677,0.0000014327277,0.000038264763,0.00010110557,0.00029825605,0.00048145477,0.9971102,0.00015401756,0.0016376277],"study_design_scores_gemma":[0.000007826464,0.000027486902,0.00061417196,0.0000073137485,0.0000044803273,0.0002557924,0.00017989986,0.0054939506,0.0011137304,0.9844379,0.007850501,0.0000069432185],"about_ca_topic_score_codex":0.00057864934,"about_ca_topic_score_gemma":0.00040573327,"teacher_disagreement_score":0.0028707327,"about_ca_system_score_codex":0.0011576792,"about_ca_system_score_gemma":0.00041798622,"threshold_uncertainty_score":0.00960356},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.030399043,0.00010710648,0.96466166,0.00010506872,0.000040136674,0.00006372934,0.00010648013,0.0017883857,0.0027283372],"genre_scores_gemma":[0.30456233,0.00024566252,0.6887268,0.000100786194,0.000100042416,0.00014305345,0.0005055845,0.00033017131,0.0052855453],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993144,0.00009831816,0.00003838902,0.000117323616,0.00025932476,0.00017227043],"domain_scores_gemma":[0.9989994,0.00034754013,0.000086793974,0.00032073358,0.00018082,0.00006471157],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007805311,0.00060270325,0.00065190444,0.0007544013,0.00066266337,0.0007557354,0.00073592586,0.00039622112,0.0070978464],"category_scores_gemma":[0.002719795,0.0003165374,0.0007871298,0.00084245886,0.00064247544,0.0019226978,0.0017713846,0.0011869746,0.0017764625],"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.0008148119,0.00021888052,0.0022161487,0.0003061004,0.00006544172,0.000257514,0.00048723453,0.132132,0.035882972,0.19160685,0.009677981,0.62633413],"study_design_scores_gemma":[0.00016630194,0.00027701174,0.0006738997,0.000045697067,0.000034615758,0.00018463821,0.00011019522,0.77535516,0.032363944,0.17665808,0.014080536,0.00004986974],"about_ca_topic_score_codex":0.0014750165,"about_ca_topic_score_gemma":0.0021014272,"teacher_disagreement_score":0.0070978464,"about_ca_system_score_codex":0.00061712007,"about_ca_system_score_gemma":0.00088171795,"threshold_uncertainty_score":0.023744643},"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":"software","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"software","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010989514,0.000069418886,0.9259009,0.00010213972,0.000039980867,0.00010868062,0.00071743474,0.053662304,0.008409685],"genre_scores_gemma":[0.19983761,0.00015916921,0.76302385,0.00025624855,0.0000743328,0.00070474605,0.002953846,0.01265294,0.020337332],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995585,0.00009246184,0.000026060716,0.000109695444,0.00013492667,0.00007839206],"domain_scores_gemma":[0.9987871,0.0006715185,0.00006832174,0.00020583958,0.00019083072,0.000076292585],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007375031,0.00082209095,0.0005793196,0.0008560511,0.0004880155,0.0010224374,0.0009386033,0.0005668768,0.03697684],"category_scores_gemma":[0.0036636405,0.00052442664,0.00075223297,0.0007539716,0.00051117217,0.0016495883,0.0014697872,0.0009969306,0.009175048],"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.0019566922,0.0004525764,0.003749134,0.0008682814,0.00014303613,0.00068882987,0.0008215312,0.07009241,0.030648408,0.11002328,0.11619553,0.6643602],"study_design_scores_gemma":[0.00059325446,0.00031764994,0.0015083185,0.00019876246,0.000049148708,0.00044253416,0.00015730392,0.6424621,0.07143664,0.1217432,0.16096704,0.00012402533],"about_ca_topic_score_codex":0.0009310245,"about_ca_topic_score_gemma":0.0010271985,"teacher_disagreement_score":0.03697684,"about_ca_system_score_codex":0.00056017976,"about_ca_system_score_gemma":0.0007486531,"threshold_uncertainty_score":0.123699844},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0075084763,0.017595856,0.95072466,0.004289119,0.0005789819,0.00003513718,0.00011534261,0.0002212388,0.01893109],"genre_scores_gemma":[0.43867645,0.04364823,0.4799458,0.0012505342,0.0033523848,0.00032122913,0.00059624156,0.00046999237,0.03173912],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991798,0.00034898065,0.00004045923,0.00015089665,0.00020346692,0.000076325276],"domain_scores_gemma":[0.99839145,0.0011328115,0.00007729433,0.0001419406,0.00018011327,0.00007648641],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020063214,0.00091465854,0.0011448058,0.0011695732,0.00062475604,0.002004631,0.0008005743,0.0009806738,0.0037487615],"category_scores_gemma":[0.0048429957,0.00047588133,0.00085091754,0.0023056,0.0022650075,0.0029792406,0.0020585672,0.0047914227,0.0011639112],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003114178,0.000025414029,0.0001739419,0.00019245206,0.000028103443,0.00003291958,0.00014014865,0.031679925,0.00089845853,0.8912819,0.009300043,0.0662155],"study_design_scores_gemma":[0.000012310339,0.0000310965,0.00018968518,0.000052404204,0.000010166481,0.00005014747,0.000041314397,0.19602597,0.00055815413,0.77973115,0.023279168,0.000018336737],"about_ca_topic_score_codex":0.0015840069,"about_ca_topic_score_gemma":0.0011436468,"teacher_disagreement_score":0.0037487615,"about_ca_system_score_codex":0.0014720367,"about_ca_system_score_gemma":0.0010250601,"threshold_uncertainty_score":0.012540877},"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":"commentary","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"commentary","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.013379565,0.48174322,0.15042351,0.101179026,0.09104037,0.0011082053,0.004716875,0.0049728663,0.15143631],"genre_scores_gemma":[0.10873771,0.44749066,0.1510776,0.04338754,0.04257471,0.0013211861,0.015084668,0.005332216,0.18499376],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9954367,0.0011434389,0.00026686632,0.0003421159,0.002547366,0.0002635116],"domain_scores_gemma":[0.96899474,0.008810445,0.00062389934,0.0013297254,0.019185627,0.001055595],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.009335909,0.00079672004,0.0010743457,0.002075105,0.00082778255,0.0021733388,0.0023032331,0.0015518507,0.024175214],"category_scores_gemma":[0.038593303,0.0004221659,0.00064816006,0.0030665041,0.0012323598,0.0031026881,0.001664051,0.002282272,0.013051908],"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.00030086355,0.00008168766,0.00019577303,0.0035166917,0.00012169778,0.000035708006,0.00006556118,0.0029779472,0.0014423013,0.023578564,0.5857988,0.38188443],"study_design_scores_gemma":[0.0000989999,0.00027745252,0.00045534046,0.0012939781,0.00011335056,0.000076909884,0.000052954554,0.0040331907,0.0045368015,0.0074953553,0.98152333,0.000042185646],"about_ca_topic_score_codex":0.0030205804,"about_ca_topic_score_gemma":0.005828113,"teacher_disagreement_score":0.024175214,"about_ca_system_score_codex":0.0020856466,"about_ca_system_score_gemma":0.007378915,"threshold_uncertainty_score":0.080874205},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0205533,0.00017995478,0.93334043,0.00029131872,0.0001379494,0.00019761677,0.0008106797,0.019586477,0.024902215],"genre_scores_gemma":[0.19123635,0.00023406629,0.7912696,0.0002524491,0.000062823136,0.00033382446,0.0017746598,0.0026515522,0.012184729],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9986015,0.00018132447,0.00008909689,0.00018720275,0.0006448706,0.00029612335],"domain_scores_gemma":[0.99835,0.000650341,0.000084697174,0.0002867059,0.00055070873,0.00007748464],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008464544,0.0009508464,0.00075029145,0.0011863878,0.0011708958,0.0019316467,0.0022024445,0.001149795,0.01948241],"category_scores_gemma":[0.0056402986,0.0005452452,0.0007723612,0.0018472676,0.00074059167,0.002162328,0.0020265481,0.0015462177,0.005231844],"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.00094881083,0.00039152673,0.0023819949,0.000519783,0.000111813926,0.0005933748,0.0005791226,0.18093067,0.020702884,0.23234893,0.06256066,0.4979305],"study_design_scores_gemma":[0.00032111595,0.00011500585,0.0003434639,0.00005617904,0.000026826134,0.00019328103,0.00009815268,0.85805666,0.040465385,0.053068448,0.04718115,0.00007433583],"about_ca_topic_score_codex":0.0076443073,"about_ca_topic_score_gemma":0.010602464,"teacher_disagreement_score":0.01948241,"about_ca_system_score_codex":0.0013230137,"about_ca_system_score_gemma":0.0033683376,"threshold_uncertainty_score":0.065175116},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03733553,0.00027838093,0.95304394,0.0001431885,0.00003296107,0.000029818655,0.0002158137,0.0008330519,0.008087217],"genre_scores_gemma":[0.55029565,0.00036386572,0.43899927,0.000147029,0.000074133175,0.00012107859,0.0009763836,0.00053952856,0.008483102],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99948007,0.00014066778,0.000015924486,0.00009756438,0.00015740137,0.000108395194],"domain_scores_gemma":[0.9990171,0.00043960373,0.000091463175,0.0001791119,0.0001964134,0.00007635245],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00073597534,0.00074192294,0.0006286195,0.00091152784,0.0004884255,0.0012030968,0.00055253366,0.0005912058,0.0068634884],"category_scores_gemma":[0.0034797052,0.00036432984,0.0005551968,0.0007412481,0.000984097,0.0023279153,0.0012401083,0.0010601332,0.0015087338],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00019953058,0.00010862207,0.0012926795,0.000219983,0.000039316754,0.0002517153,0.00028075773,0.39911097,0.007895171,0.45421162,0.008142652,0.12824704],"study_design_scores_gemma":[0.000015153764,0.000067430046,0.00017003043,0.000021826248,0.000006475868,0.00006955186,0.00005622038,0.80876106,0.0028047892,0.18431345,0.0036999094,0.000014108598],"about_ca_topic_score_codex":0.001042659,"about_ca_topic_score_gemma":0.0017427024,"teacher_disagreement_score":0.0068634884,"about_ca_system_score_codex":0.00041233638,"about_ca_system_score_gemma":0.0007571746,"threshold_uncertainty_score":0.022960603},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6374866,0.0029131963,0.32700583,0.0006636398,0.00014307283,0.00009470788,0.00084357447,0.00026023277,0.03058914],"genre_scores_gemma":[0.94265336,0.0013030175,0.053621788,0.000052525826,0.000098329954,0.00010296147,0.00021947338,0.000108857115,0.0018396778],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99922025,0.00021148223,0.000067189336,0.00021282039,0.00014427268,0.00014399942],"domain_scores_gemma":[0.99169195,0.004985598,0.001230804,0.0006160764,0.0006849241,0.0007906226],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011873596,0.0008376585,0.0006370328,0.0012836759,0.00055222126,0.0020320234,0.0008527934,0.0004913922,0.0027827292],"category_scores_gemma":[0.012725853,0.0006265464,0.00044874448,0.000802524,0.001638431,0.0029841424,0.0014504195,0.0009129046,0.00046724072],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0009627405,0.00011165205,0.011712612,0.0006220886,0.00007016427,0.00021064775,0.0007281259,0.14680211,0.035121646,0.6919807,0.0057240585,0.1059534],"study_design_scores_gemma":[0.000063751424,0.0006294417,0.012189641,0.00025182732,0.00010487443,0.0015063061,0.0007738127,0.26556483,0.04294428,0.6579897,0.017833153,0.0001483354],"about_ca_topic_score_codex":0.0003236345,"about_ca_topic_score_gemma":0.00051951234,"teacher_disagreement_score":0.0027827292,"about_ca_system_score_codex":0.00077986607,"about_ca_system_score_gemma":0.0004573303,"threshold_uncertainty_score":0.009309173},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4084885,0.0013102657,0.21766874,0.0059280377,0.0010481596,0.00013286168,0.0007932088,0.0014330735,0.36319715],"genre_scores_gemma":[0.94510984,0.00033417024,0.030475669,0.0009023216,0.00020511397,0.000076401884,0.0004622848,0.00021774277,0.022216355],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993057,0.00011720639,0.000041758598,0.00015367325,0.00027525245,0.000106281725],"domain_scores_gemma":[0.99907035,0.00011609062,0.00008568022,0.00039479937,0.00024107976,0.00009215231],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005119489,0.00038289864,0.00041722012,0.00092652737,0.0009946228,0.0017278148,0.0009407923,0.0013143433,0.009059479],"category_scores_gemma":[0.0027259483,0.00022296415,0.0007024596,0.00051488006,0.0024491048,0.0030588966,0.003127693,0.002017008,0.0017081845],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000015527969,0.000009980926,0.00041033578,0.00003129642,0.0000038136193,0.000095450014,0.00013058944,0.00058759225,0.0016661074,0.9881166,0.0014937469,0.0074389],"study_design_scores_gemma":[0.000013697238,0.000025525265,0.0008920569,0.000032659394,0.0000060567254,0.00046378293,0.0001542233,0.010509286,0.0023177662,0.9673515,0.018211896,0.000021526224],"about_ca_topic_score_codex":0.0012302517,"about_ca_topic_score_gemma":0.0007088005,"teacher_disagreement_score":0.009059479,"about_ca_system_score_codex":0.0008570652,"about_ca_system_score_gemma":0.00086042745,"threshold_uncertainty_score":0.030306995},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.693354,0.00036655023,0.29832637,0.00036699377,0.00006116843,0.00004526604,0.00017691436,0.00015520876,0.0071475403],"genre_scores_gemma":[0.9802579,0.0002147849,0.01816107,0.00002093608,0.00009933964,0.000045513454,0.00012411618,0.00002966991,0.001046625],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.998728,0.00035691774,0.000061712184,0.0002879867,0.0004445074,0.00012085183],"domain_scores_gemma":[0.9919337,0.004861022,0.0011874714,0.0007457345,0.0007229937,0.0005491245],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002092694,0.00041871206,0.0009316133,0.0057422672,0.00092619203,0.0022027441,0.0016876559,0.00057640515,0.002501436],"category_scores_gemma":[0.01445815,0.00035756925,0.00044884224,0.0024077776,0.0038456717,0.003805499,0.0020872282,0.0010144878,0.0001612411],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000053629698,0.000025131612,0.0089154765,0.00004635937,0.000024259334,0.00012608455,0.00034132946,0.01903125,0.0044742976,0.94987667,0.00042102305,0.016664542],"study_design_scores_gemma":[0.000015799806,0.000058537364,0.0065347576,0.00003131302,0.0000153298,0.00028444576,0.0002795222,0.26576108,0.006720636,0.71862125,0.0016200378,0.000057332054],"about_ca_topic_score_codex":0.00075953593,"about_ca_topic_score_gemma":0.00037852765,"teacher_disagreement_score":0.0057422672,"about_ca_system_score_codex":0.0012756645,"about_ca_system_score_gemma":0.0004462301,"threshold_uncertainty_score":0.011067331},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.17339097,0.0006001744,0.71385646,0.00081122044,0.001334315,0.00014742564,0.00015129008,0.00088551786,0.10882256],"genre_scores_gemma":[0.7204392,0.0012275593,0.19453023,0.0005816147,0.0014158391,0.0002599008,0.00016415947,0.00086926605,0.08051229],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99942505,0.00011943596,0.00003299439,0.00008734514,0.00024227948,0.00009288589],"domain_scores_gemma":[0.9991441,0.00019678596,0.00011095115,0.00023119069,0.00018606357,0.0001309052],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009225752,0.0008509227,0.00055686303,0.002144853,0.0007700807,0.0017266768,0.0012230858,0.0006016705,0.009695626],"category_scores_gemma":[0.0039801258,0.00035463594,0.00089658774,0.0013778999,0.0017039712,0.00369525,0.001669944,0.0023789406,0.002417128],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000019124303,0.000020531339,0.00012842262,0.000019990404,0.0000052801347,0.00008254245,0.00012991387,0.0029795931,0.0018955484,0.9805433,0.0007893826,0.013386238],"study_design_scores_gemma":[0.000020690377,0.000054500546,0.00019817038,0.000025469895,0.000010039497,0.00016865885,0.000059041315,0.04787386,0.004268803,0.93553394,0.011757483,0.000029355228],"about_ca_topic_score_codex":0.00040924194,"about_ca_topic_score_gemma":0.0006310269,"teacher_disagreement_score":0.009695626,"about_ca_system_score_codex":0.0010554574,"about_ca_system_score_gemma":0.00074286107,"threshold_uncertainty_score":0.03243506},"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13333948,0.00873798,0.3621951,0.0428521,0.004385271,0.00021746078,0.0026753093,0.0033233727,0.44227394],"genre_scores_gemma":[0.8399985,0.00584721,0.07992892,0.013057514,0.0039366963,0.00045651582,0.0016292002,0.002075071,0.053070277],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9961359,0.0006870014,0.00015437695,0.0013672456,0.00093693705,0.0007185157],"domain_scores_gemma":[0.9842845,0.009251034,0.0007575111,0.0028025575,0.001645885,0.0012585724],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00328033,0.0022666513,0.0031504342,0.002793735,0.0039085806,0.004678011,0.005550443,0.0037832698,0.01952796],"category_scores_gemma":[0.016501743,0.0013807281,0.0033510828,0.002333387,0.0054027042,0.019115657,0.012538418,0.010310698,0.004134304],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00028726365,0.00008683802,0.0007663958,0.00041587828,0.00007010895,0.00034984527,0.0003985333,0.0031266192,0.0065094833,0.95449543,0.018822756,0.01467076],"study_design_scores_gemma":[0.000092323615,0.000067030494,0.0009537696,0.000078315185,0.000082258615,0.00036028767,0.0001544102,0.015038502,0.0026068653,0.95857394,0.021934645,0.000057522295],"about_ca_topic_score_codex":0.0022660443,"about_ca_topic_score_gemma":0.0013713242,"teacher_disagreement_score":0.01952796,"about_ca_system_score_codex":0.0029207713,"about_ca_system_score_gemma":0.0011201751,"threshold_uncertainty_score":0.065327585},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5470208,0.0015481958,0.19159453,0.0034733415,0.0006216853,0.000107204345,0.00051084964,0.00056830805,0.25455502],"genre_scores_gemma":[0.9447758,0.0006215967,0.021198532,0.00035262282,0.00044040562,0.00007751956,0.00022267296,0.00027878885,0.032031927],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989016,0.00031975578,0.000048931586,0.00013298688,0.00025288924,0.0003438044],"domain_scores_gemma":[0.9983584,0.0007632751,0.00018164929,0.00015771581,0.00028176818,0.00025715027],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013411166,0.0009012832,0.0010475358,0.0036102985,0.0027430842,0.004552298,0.0015924855,0.0015015018,0.010966774],"category_scores_gemma":[0.0058155195,0.0006716708,0.0011625849,0.0018254712,0.0049231667,0.0047850856,0.0025945627,0.0037654673,0.0020324432],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002827339,0.000013756596,0.000099643985,0.000023360486,0.0000036285353,0.000043249685,0.00016051166,0.0004076701,0.000455663,0.99557954,0.00044860927,0.0027361521],"study_design_scores_gemma":[0.000015531781,0.000010852873,0.00014164884,0.000015620375,0.0000057242623,0.0000422221,0.000070666094,0.002413473,0.00030074955,0.9954615,0.0015116401,0.000010413236],"about_ca_topic_score_codex":0.0016940798,"about_ca_topic_score_gemma":0.0018818894,"teacher_disagreement_score":0.010966774,"about_ca_system_score_codex":0.0029624964,"about_ca_system_score_gemma":0.001083901,"threshold_uncertainty_score":0.036687553},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7727126,0.00085855625,0.19469783,0.0009931868,0.000099478595,0.000078104815,0.00031143802,0.00056765403,0.029681167],"genre_scores_gemma":[0.9803094,0.00017221509,0.015149893,0.0001311955,0.0000893949,0.00006294799,0.0001991018,0.00010904844,0.0037767878],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99584097,0.00065367814,0.00023910518,0.001370057,0.0010859725,0.00081014534],"domain_scores_gemma":[0.98111236,0.011877002,0.0014297668,0.0022536372,0.0018399424,0.0014871504],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0037763948,0.0009882658,0.0018684408,0.0031897377,0.003107714,0.006260376,0.0025136385,0.0014175882,0.0049680118],"category_scores_gemma":[0.01836791,0.001035617,0.0026464248,0.0015567961,0.008376088,0.00995536,0.0064497553,0.0040060445,0.0005465038],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00046766072,0.000077440214,0.0048868563,0.00015407363,0.000092334616,0.00051627675,0.0018006429,0.0036350614,0.008582334,0.97339904,0.0005074756,0.0058808587],"study_design_scores_gemma":[0.00010865172,0.00019933004,0.0014970955,0.0001118425,0.00018791461,0.0006850517,0.00072768587,0.027074961,0.017035747,0.94779396,0.0044889874,0.00008876839],"about_ca_topic_score_codex":0.0016959365,"about_ca_topic_score_gemma":0.0012392281,"teacher_disagreement_score":0.006260376,"about_ca_system_score_codex":0.0041790996,"about_ca_system_score_gemma":0.0011272088,"threshold_uncertainty_score":0.030321658},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.030327722,0.00056907703,0.81767046,0.00092411024,0.0012967167,0.00005841069,0.0002710603,0.0016260734,0.1472564],"genre_scores_gemma":[0.45675063,0.0016302555,0.3963972,0.0012017059,0.0009006887,0.00018593144,0.00048711043,0.004115409,0.13833094],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992908,0.00010993843,0.00003656667,0.00016986126,0.0002859006,0.00010692998],"domain_scores_gemma":[0.99951756,0.00017450438,0.00005631456,0.00008731283,0.00013034983,0.000033938308],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00080262945,0.0008961931,0.0004978751,0.0009325094,0.0012065046,0.0020801844,0.0011048523,0.00067589537,0.016686479],"category_scores_gemma":[0.0022389318,0.00034298512,0.0008620059,0.00068153115,0.0021870555,0.0049141,0.001392278,0.002086143,0.007322979],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006996163,0.00001938356,0.00027892969,0.00008052442,0.000008198191,0.00041358513,0.00036313912,0.0021527584,0.012241176,0.92934954,0.008268998,0.046753857],"study_design_scores_gemma":[0.000013147373,0.00005653323,0.0004967792,0.00004522784,0.000019416648,0.001000035,0.00015553796,0.021044027,0.021917513,0.8363204,0.118870236,0.000061143386],"about_ca_topic_score_codex":0.0008144885,"about_ca_topic_score_gemma":0.0020752924,"teacher_disagreement_score":0.016686479,"about_ca_system_score_codex":0.000996979,"about_ca_system_score_gemma":0.0006163457,"threshold_uncertainty_score":0.055821776},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0012658999,0.03631888,0.0051510762,0.0015308175,0.002050393,0.000025744584,0.0004362975,0.00045878734,0.95276207],"genre_scores_gemma":[0.015689721,0.024531277,0.004848583,0.0010541087,0.001683939,0.00004159474,0.0006117037,0.0004257975,0.95111316],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99972993,0.000029860921,0.000011310603,0.00006168126,0.000134056,0.000033059994],"domain_scores_gemma":[0.99979955,0.000062187326,0.000014993193,0.00003894669,0.000051164683,0.000033140554],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00019929692,0.0008624114,0.0007417568,0.0012135942,0.0009973367,0.0037384094,0.00079832546,0.00041796512,0.08799446],"category_scores_gemma":[0.0012463274,0.00033033313,0.00038641065,0.0030947954,0.0017124589,0.005015017,0.0011863048,0.0019686148,0.057725478],"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.000048851536,0.000032316126,0.0001787583,0.000460079,0.000007576212,0.00012833161,0.00042596087,0.00024055892,0.0010348377,0.33115727,0.462294,0.20399131],"study_design_scores_gemma":[0.0000035334372,0.000011456036,0.00021445774,0.00008056137,0.0000031847567,0.00026075708,0.00008448284,0.00007236828,0.00020627624,0.06768829,0.93136984,0.0000047302774],"about_ca_topic_score_codex":0.0016069012,"about_ca_topic_score_gemma":0.003179006,"teacher_disagreement_score":0.08799446,"about_ca_system_score_codex":0.0010624379,"about_ca_system_score_gemma":0.00084042794,"threshold_uncertainty_score":0.29437077},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0041372175,0.0010859696,0.034318775,0.0018455365,0.0006674609,0.000032142325,0.00037548292,0.0002717118,0.9572657],"genre_scores_gemma":[0.24941643,0.0032038551,0.02644621,0.0015583711,0.0015565226,0.00016779515,0.001189036,0.001119873,0.7153419],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99939585,0.000113530434,0.000022128062,0.00017519294,0.00020546358,0.00008770392],"domain_scores_gemma":[0.9993462,0.00018303067,0.00004048164,0.00015894749,0.00019682353,0.00007452568],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005290421,0.00070238055,0.00067093055,0.0011644019,0.0018402595,0.0042535183,0.00071506173,0.00072281953,0.0867238],"category_scores_gemma":[0.0023401827,0.0004645955,0.00060198334,0.0009629297,0.0023108514,0.00543951,0.0028020954,0.004381367,0.023411341],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000012737134,0.0000069036287,0.000029551582,0.000032781918,0.0000025790507,0.000013055237,0.000078834586,0.0000834931,0.00019928277,0.97135377,0.014311577,0.013875358],"study_design_scores_gemma":[0.000006805891,0.000008241398,0.00007649322,0.000027868884,0.0000057962143,0.00010654126,0.00006804317,0.00032214326,0.0004846148,0.8473322,0.151556,0.0000051983743],"about_ca_topic_score_codex":0.00040630554,"about_ca_topic_score_gemma":0.00039231713,"teacher_disagreement_score":0.0867238,"about_ca_system_score_codex":0.0012277372,"about_ca_system_score_gemma":0.00076088513,"threshold_uncertainty_score":0},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0028854832,0.008225271,0.010739915,0.0036377565,0.0011848569,0.000014704593,0.00017501724,0.00011467014,0.9730223],"genre_scores_gemma":[0.16880517,0.0142085245,0.008337942,0.0022097002,0.0025666044,0.00009209007,0.00049442047,0.00032649716,0.8029591],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9997601,0.000052435225,0.000009996868,0.000051804866,0.00009306389,0.000032616634],"domain_scores_gemma":[0.9998369,0.000046767735,0.000013855058,0.000035808822,0.00004937679,0.000017284816],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00023999374,0.0007042056,0.0005261317,0.0010523243,0.001335486,0.0031946567,0.00053478713,0.0010851135,0.03827331],"category_scores_gemma":[0.0015414136,0.00035954977,0.00043084632,0.0012843651,0.002178393,0.004066465,0.0013555565,0.0028607938,0.0120357685],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000033129318,0.000002527316,0.000019958281,0.000013152351,0.0000015660005,0.000013951356,0.000058843758,0.00007707371,0.00008987512,0.9694336,0.01826384,0.01202224],"study_design_scores_gemma":[0.0000030103386,0.0000029001985,0.00007979815,0.000019536643,0.0000024568917,0.000077497774,0.000037944315,0.0002797989,0.00013751037,0.83687675,0.1624782,0.00000463924],"about_ca_topic_score_codex":0.0022003006,"about_ca_topic_score_gemma":0.0017294737,"teacher_disagreement_score":0.03827331,"about_ca_system_score_codex":0.0017139276,"about_ca_system_score_gemma":0.00098815,"threshold_uncertainty_score":0.12803698},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.624468,0.0010082786,0.2617874,0.0011540165,0.00018758806,0.00006346056,0.00061293086,0.00022682405,0.11049143],"genre_scores_gemma":[0.9545393,0.00035758008,0.03271231,0.00008834208,0.00020596683,0.000043654287,0.00022440155,0.00005293238,0.011775474],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994654,0.00009445958,0.00002155595,0.00018988017,0.00016870777,0.00006000724],"domain_scores_gemma":[0.99959403,0.000096056494,0.00007935155,0.00007360919,0.0000786535,0.00007832348],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00046130916,0.00029260467,0.000384378,0.0010303927,0.00075451174,0.0022034382,0.00070548087,0.00032634335,0.0050126524],"category_scores_gemma":[0.0011830634,0.0002190856,0.00043505558,0.00061308144,0.0030620438,0.0027631775,0.0015583268,0.0011811492,0.0006250345],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000012011773,0.0000041757435,0.00019387554,0.000013437623,0.000002064885,0.000040050018,0.00016897841,0.0012441331,0.0010067924,0.99339867,0.0002910736,0.0036247035],"study_design_scores_gemma":[0.000010206566,0.000038528804,0.0008742453,0.00001550437,0.000005219605,0.0002708753,0.00025298103,0.015288002,0.0014448186,0.96554303,0.016236044,0.000020507778],"about_ca_topic_score_codex":0.0009063861,"about_ca_topic_score_gemma":0.0005687995,"teacher_disagreement_score":0.0050126524,"about_ca_system_score_codex":0.0010534443,"about_ca_system_score_gemma":0.00034099698,"threshold_uncertainty_score":0.016769052},"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.14173996,0.0032838166,0.11243005,0.0071004145,0.0017236811,0.000076201824,0.00064188906,0.0009254589,0.7320785],"genre_scores_gemma":[0.85127985,0.0012726214,0.015333488,0.0010698065,0.0020009177,0.000043366806,0.00051738304,0.000308618,0.12817396],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99921227,0.0001545088,0.000034813704,0.00017673349,0.0002932448,0.0001284413],"domain_scores_gemma":[0.99920005,0.0001776623,0.00007268425,0.00020665495,0.00021369712,0.00012935787],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007243172,0.0005595712,0.0008871433,0.0026331863,0.0024578834,0.0037860472,0.0009879547,0.0009088295,0.03185337],"category_scores_gemma":[0.0018570245,0.00035050762,0.00067489577,0.0022362096,0.0030885597,0.007595277,0.0025723516,0.0031713317,0.00472926],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000005799134,0.0000069856515,0.000039697334,0.000013323203,0.000002347851,0.000017143951,0.000079162746,0.00006498617,0.00018530923,0.99574935,0.0011341877,0.0027016578],"study_design_scores_gemma":[0.0000038258086,0.000005097035,0.00010336833,0.000004207756,0.0000028386564,0.00006697374,0.000030820982,0.00038452083,0.00025548844,0.98908603,0.010051759,0.0000050544236],"about_ca_topic_score_codex":0.0006388732,"about_ca_topic_score_gemma":0.00062896835,"teacher_disagreement_score":0.03185337,"about_ca_system_score_codex":0.0021230166,"about_ca_system_score_gemma":0.0007234873,"threshold_uncertainty_score":0.10656017},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05632611,0.0059362813,0.8724564,0.0053501055,0.00054110977,0.000116713476,0.00047473563,0.0015384956,0.057259925],"genre_scores_gemma":[0.82526886,0.0037068909,0.14021496,0.0013415895,0.0011846736,0.00027192954,0.0012352195,0.0012338881,0.025542008],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99548435,0.0010034823,0.00017433609,0.00076356524,0.0016239097,0.0009503457],"domain_scores_gemma":[0.96850765,0.023453513,0.0013172135,0.0029511652,0.0022487796,0.0015215502],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0050610933,0.0021310362,0.0020287104,0.003148208,0.0021132585,0.0059304284,0.003315453,0.0018271401,0.019592503],"category_scores_gemma":[0.029195331,0.001189647,0.0015739602,0.002808124,0.0037839347,0.013103611,0.0070735314,0.011751249,0.0043184855],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0011181773,0.00021615895,0.0009290402,0.00053776545,0.00011160481,0.0001156872,0.0004933434,0.03556685,0.005818769,0.85692567,0.017346323,0.08082066],"study_design_scores_gemma":[0.00005991148,0.000055802648,0.00025785444,0.00007055711,0.000055965415,0.00006443048,0.0000675424,0.1026042,0.0027408388,0.88742703,0.006562977,0.00003288628],"about_ca_topic_score_codex":0.0012905889,"about_ca_topic_score_gemma":0.0019695621,"teacher_disagreement_score":0.019592503,"about_ca_system_score_codex":0.003945238,"about_ca_system_score_gemma":0.002432825,"threshold_uncertainty_score":0.06554341},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3253327,0.0056909267,0.45642015,0.029525211,0.001729399,0.00033370106,0.0035930802,0.0055877273,0.17178719],"genre_scores_gemma":[0.76006556,0.001872166,0.20785871,0.0029161137,0.0013131206,0.00028585727,0.004335214,0.00088705326,0.020466182],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99436945,0.002162662,0.00026228643,0.0013068082,0.0010963205,0.0008024306],"domain_scores_gemma":[0.9613466,0.03131253,0.0011440091,0.0040768753,0.0014220725,0.0006977409],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.007687357,0.0015898272,0.0019938205,0.0015105515,0.002750077,0.005978865,0.0034061053,0.0017737368,0.016128998],"category_scores_gemma":[0.02943357,0.00087326113,0.002749346,0.0020856825,0.0047748913,0.011463408,0.0046525677,0.0043924637,0.003897697],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0020197395,0.00038880348,0.0054876194,0.00093371276,0.00017530128,0.00038577043,0.0007178741,0.091978624,0.0020235202,0.7640467,0.04246181,0.08938047],"study_design_scores_gemma":[0.00028990465,0.00008659722,0.0004608634,0.000116456074,0.00010062568,0.00013088952,0.00014285246,0.17587662,0.0016627299,0.8093958,0.011686612,0.000050129525],"about_ca_topic_score_codex":0.005298971,"about_ca_topic_score_gemma":0.0079247495,"teacher_disagreement_score":0.016128998,"about_ca_system_score_codex":0.0032957555,"about_ca_system_score_gemma":0.004650647,"threshold_uncertainty_score":0.053956866},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.18125702,0.010952916,0.67184776,0.0038878068,0.0011559343,0.000094547744,0.0001872142,0.0003020961,0.1303147],"genre_scores_gemma":[0.86347145,0.0047539845,0.10805355,0.0007151066,0.0008625853,0.000068425965,0.00010996367,0.00011734185,0.021847568],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993767,0.00019141192,0.000044236058,0.00010617054,0.00021916688,0.00006234495],"domain_scores_gemma":[0.99912566,0.00025723723,0.00010731694,0.00015030336,0.00021572734,0.00014376489],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009873633,0.0005600346,0.0004554218,0.0012121825,0.0012807448,0.0015966175,0.00072251854,0.00097445044,0.0028710712],"category_scores_gemma":[0.0021799472,0.00025614878,0.00057141506,0.0009861774,0.0038294846,0.004029271,0.0021333445,0.0021437735,0.0007963789],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000001655718,0.000004423125,0.00008602354,0.00001201806,0.0000012853566,0.000045065175,0.00013528124,0.00069153897,0.00032892893,0.9960252,0.00013520049,0.002533338],"study_design_scores_gemma":[0.0000014371014,0.000007327893,0.00006311399,0.000008853367,0.0000010165611,0.00009279253,0.000037841735,0.0023933086,0.0002502757,0.9927523,0.0043861633,0.0000055164223],"about_ca_topic_score_codex":0.0005967202,"about_ca_topic_score_gemma":0.0007279703,"teacher_disagreement_score":0.0028710712,"about_ca_system_score_codex":0.0010077731,"about_ca_system_score_gemma":0.0008206247,"threshold_uncertainty_score":0.009604692},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.28525522,0.0012517616,0.6731501,0.0025481016,0.00009264193,0.00004312142,0.00024842928,0.00036756546,0.03704303],"genre_scores_gemma":[0.9339619,0.00039465594,0.062142685,0.00018138261,0.00017794986,0.000051748546,0.00011532657,0.000060960094,0.0029133884],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9978264,0.00093453383,0.00013623263,0.0003905854,0.00049112755,0.00022110481],"domain_scores_gemma":[0.9931993,0.0047918265,0.00043075878,0.00075882656,0.00042372957,0.00039551267],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0025421956,0.00041949493,0.0006059279,0.0017519823,0.0012361894,0.0023613707,0.00078453694,0.00039543642,0.0019897295],"category_scores_gemma":[0.005507628,0.0004730999,0.0008685813,0.0017039436,0.0042411485,0.0053117615,0.003526879,0.0024675028,0.00019484862],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000022272809,0.0000111515965,0.000541987,0.000027489717,0.0000065150616,0.0000370525,0.00019183257,0.0011947948,0.0005813674,0.9919899,0.00026643855,0.0051292507],"study_design_scores_gemma":[0.0000096021495,0.000020162635,0.00050710986,0.000016634944,0.000014537497,0.00012278251,0.00012045361,0.016862035,0.0021504124,0.97637546,0.00378156,0.000019312522],"about_ca_topic_score_codex":0.0006086569,"about_ca_topic_score_gemma":0.0005726309,"teacher_disagreement_score":0.0025421956,"about_ca_system_score_codex":0.0020967915,"about_ca_system_score_gemma":0.0004049551,"threshold_uncertainty_score":0.015213311},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8984003,0.0009325625,0.067987636,0.0007917386,0.000061782186,0.000027481565,0.00038833858,0.000110380184,0.031299725],"genre_scores_gemma":[0.99170566,0.00017706057,0.005443328,0.000038913447,0.0000695933,0.000020392717,0.00015893298,0.000009899955,0.00237619],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992489,0.00013053918,0.000054870045,0.00016167256,0.00029250619,0.0001113166],"domain_scores_gemma":[0.99858874,0.00046906323,0.00024224418,0.00014510489,0.0002843241,0.0002705575],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005904889,0.00020609189,0.0004075164,0.0010150098,0.00081004226,0.0018583791,0.0005363991,0.00034913243,0.0031265481],"category_scores_gemma":[0.0016688713,0.00022265654,0.00047626224,0.00065075664,0.0017360342,0.0022038228,0.0015811981,0.00077697536,0.00021842151],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000030504305,0.000012671537,0.0008865905,0.000037989153,0.000009808309,0.00012530008,0.00031298786,0.0016165581,0.002753944,0.99116194,0.00024582545,0.002805901],"study_design_scores_gemma":[0.000027375812,0.00007889834,0.0023911519,0.00003530649,0.000024325782,0.0006202486,0.00053219777,0.03241221,0.005130912,0.9494431,0.009276932,0.00002730187],"about_ca_topic_score_codex":0.000895056,"about_ca_topic_score_gemma":0.00064021477,"teacher_disagreement_score":0.0031265481,"about_ca_system_score_codex":0.0011118695,"about_ca_system_score_gemma":0.0002629654,"threshold_uncertainty_score":0.010459363},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06556896,0.0011061848,0.7425608,0.006863926,0.00030106292,0.00023253105,0.00063753413,0.0014933781,0.18123561],"genre_scores_gemma":[0.63536775,0.0008789849,0.33709508,0.0018743722,0.0004858377,0.00042318215,0.0008570721,0.0011652719,0.021852486],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9909176,0.0038677899,0.00058652915,0.002129687,0.0013816576,0.0011168098],"domain_scores_gemma":[0.9726744,0.015910313,0.0012261614,0.0077138874,0.0014320932,0.0010430968],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005510693,0.0011904348,0.0021002097,0.0024449248,0.003631945,0.011668453,0.0049255993,0.005106188,0.030567931],"category_scores_gemma":[0.0353502,0.0018511474,0.0035537481,0.0029990987,0.007975343,0.027544994,0.008432495,0.0125619015,0.0040006237],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000034131062,0.00003234723,0.00029299068,0.000056913137,0.0000137456855,0.00003893324,0.00021836246,0.00093225844,0.00020051276,0.991441,0.0007382093,0.006000612],"study_design_scores_gemma":[0.000012802476,0.000027282324,0.0001599076,0.000051590243,0.000016679463,0.000079734324,0.00009776812,0.0052942117,0.0005372047,0.9875706,0.006134971,0.000017279413],"about_ca_topic_score_codex":0.0022279422,"about_ca_topic_score_gemma":0.0014837718,"teacher_disagreement_score":0.030567931,"about_ca_system_score_codex":0.002850522,"about_ca_system_score_gemma":0.0032529286,"threshold_uncertainty_score":0.102259934},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0029781617,0.008571787,0.032310974,0.004115847,0.0015044061,0.00006974118,0.0013817536,0.0003103653,0.94875705],"genre_scores_gemma":[0.14825082,0.02769722,0.06050899,0.0071133794,0.004569326,0.00039586873,0.0048532537,0.0005905435,0.7460206],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9995821,0.00008514433,0.000029263116,0.00008732347,0.00015558941,0.000060444814],"domain_scores_gemma":[0.9996724,0.00009052135,0.000028221612,0.00004586734,0.00012488493,0.000038024926],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00044384654,0.00085030845,0.00046063354,0.0014843894,0.0021030768,0.0030733296,0.0009972607,0.000631257,0.055882934],"category_scores_gemma":[0.0010206831,0.00032914645,0.0004278983,0.0014409368,0.0017511834,0.0032380403,0.0017911948,0.0026906456,0.023158504],"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.0000060429397,0.000010371129,0.000029726833,0.00009273699,0.0000017193787,0.00004522257,0.00019507768,0.00008847786,0.00034132026,0.95366967,0.035675686,0.009843974],"study_design_scores_gemma":[0.0000038811436,0.000010191152,0.000118643155,0.000036229492,0.000002829104,0.00022837541,0.00012545804,0.0001515917,0.00018553418,0.3355743,0.66355824,0.000004766118],"about_ca_topic_score_codex":0.0012986048,"about_ca_topic_score_gemma":0.0013183482,"teacher_disagreement_score":0.055882934,"about_ca_system_score_codex":0.0011859664,"about_ca_system_score_gemma":0.000602798,"threshold_uncertainty_score":0.18694705},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9629854,0.00012209489,0.02289011,0.00012922297,0.000013930151,0.000022895927,0.00021621447,0.00012342825,0.013496758],"genre_scores_gemma":[0.9882407,0.00009691798,0.007088528,0.000030848198,0.0000149510515,0.000022162321,0.0005457239,0.000036540325,0.0039235502],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9996331,0.00003602995,0.000025496118,0.00008614983,0.00011168292,0.00010752043],"domain_scores_gemma":[0.99916816,0.00029230598,0.00015120245,0.000120384466,0.00012015129,0.00014786671],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00019121093,0.00029089043,0.00046177837,0.0014932787,0.0012034572,0.0022118525,0.00053097645,0.00054940453,0.0072866282],"category_scores_gemma":[0.0012088664,0.00028818383,0.00046290085,0.0011298874,0.0025652412,0.0023425573,0.002211944,0.0009322771,0.00083936396],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00021617398,0.00006631874,0.008863231,0.00014052993,0.000022629067,0.0004879298,0.0015619479,0.003646665,0.008960566,0.9406202,0.0012439503,0.03416995],"study_design_scores_gemma":[0.000055008695,0.00013544332,0.0070253746,0.00010451567,0.000034691035,0.0010448885,0.0022015139,0.019929197,0.0190166,0.93417996,0.016220436,0.00005235827],"about_ca_topic_score_codex":0.00055440934,"about_ca_topic_score_gemma":0.0005767417,"teacher_disagreement_score":0.0072866282,"about_ca_system_score_codex":0.00052711123,"about_ca_system_score_gemma":0.00031317963,"threshold_uncertainty_score":0.024376214},"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15340611,0.0032080242,0.13806637,0.0060434416,0.0014008813,0.000078008976,0.0011254321,0.0008733805,0.69579834],"genre_scores_gemma":[0.79831326,0.0020189579,0.011717166,0.0010572982,0.0015202212,0.00007171486,0.0007205341,0.0006273431,0.18395348],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990337,0.00014799423,0.000033397242,0.00022165287,0.00034691082,0.00021637586],"domain_scores_gemma":[0.99857056,0.00050282525,0.00013763524,0.00023551566,0.00037975665,0.00017377765],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010223497,0.0006894417,0.00067320146,0.0019871076,0.00155431,0.0031159117,0.000883838,0.0006964291,0.033221874],"category_scores_gemma":[0.003776312,0.000376455,0.0008027649,0.0015081923,0.0024728738,0.005237736,0.0025096294,0.0030312324,0.008532855],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000041862673,0.000020331265,0.000196864,0.00006794658,0.0000086314885,0.00007209517,0.00017149214,0.00052189326,0.00054767064,0.9786289,0.007435574,0.012286841],"study_design_scores_gemma":[0.000016950433,0.000024975045,0.0005246585,0.000026853404,0.000014054681,0.00015421885,0.00009049163,0.0032149649,0.0008736914,0.9661509,0.028890686,0.000017493436],"about_ca_topic_score_codex":0.001551969,"about_ca_topic_score_gemma":0.0015387163,"teacher_disagreement_score":0.033221874,"about_ca_system_score_codex":0.0027983391,"about_ca_system_score_gemma":0.00074664596,"threshold_uncertainty_score":0.111138225},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.024073223,0.011512749,0.6121975,0.01888639,0.012228177,0.00043528306,0.0022566484,0.002260589,0.3161493],"genre_scores_gemma":[0.45837605,0.015808422,0.31340057,0.014175221,0.0070421123,0.0011841407,0.0023162214,0.0019622426,0.18573491],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99936336,0.000091498805,0.000033998575,0.00013097402,0.0002625459,0.00011760763],"domain_scores_gemma":[0.999313,0.00025683534,0.000041999938,0.00007845746,0.00022547971,0.00008414744],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012978399,0.0018224724,0.0008668697,0.0018639322,0.0018841451,0.0015948595,0.0014420521,0.001379806,0.031078333],"category_scores_gemma":[0.002446862,0.00059687893,0.0019177336,0.0016892304,0.0024179514,0.0035762088,0.004119686,0.0046643056,0.008302086],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000093751216,0.000103904546,0.00023526474,0.00045409054,0.00006792471,0.00050930324,0.00042412826,0.0013453142,0.0062972666,0.8989773,0.039309826,0.05218198],"study_design_scores_gemma":[0.000043497923,0.000077054974,0.00078835315,0.00010459386,0.000045668323,0.0002983523,0.00008897887,0.0018250833,0.002277983,0.8497376,0.14466509,0.000047701284],"about_ca_topic_score_codex":0.0023064315,"about_ca_topic_score_gemma":0.0018874274,"teacher_disagreement_score":0.031078333,"about_ca_system_score_codex":0.0013353582,"about_ca_system_score_gemma":0.0007847632,"threshold_uncertainty_score":0.10396743},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06743872,0.0010651018,0.8714221,0.00087314105,0.00036255477,0.00010521705,0.00047970758,0.0013548044,0.056898654],"genre_scores_gemma":[0.44368687,0.0008772462,0.5027351,0.00056333694,0.00028202124,0.00022220008,0.0014581335,0.00075653824,0.049418572],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987445,0.00021647336,0.00010158411,0.00028468133,0.00042849386,0.00022426958],"domain_scores_gemma":[0.9992305,0.00028096736,0.000054366497,0.00017236672,0.0001925202,0.0000692988],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009960368,0.0007541149,0.0009102985,0.001682547,0.0009241989,0.0030769827,0.001337217,0.00095835887,0.015969167],"category_scores_gemma":[0.004487228,0.00031805746,0.0008522649,0.0019027549,0.0011803354,0.0034199988,0.0028439588,0.002036798,0.0070602074],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00021850938,0.000052021835,0.00038652876,0.00014321861,0.000019563298,0.00006549339,0.0002323032,0.0061276485,0.0031374095,0.7316344,0.01150321,0.24647975],"study_design_scores_gemma":[0.000096980984,0.00014041558,0.0004341798,0.000084799445,0.000031757063,0.0002995489,0.0002019554,0.06929495,0.009576187,0.8757945,0.04399036,0.000054376553],"about_ca_topic_score_codex":0.001753806,"about_ca_topic_score_gemma":0.0017965647,"teacher_disagreement_score":0.015969167,"about_ca_system_score_codex":0.0019651065,"about_ca_system_score_gemma":0.0010366347,"threshold_uncertainty_score":0.053422153},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.20470476,0.0007421681,0.72115296,0.00054957275,0.00042564026,0.00008592755,0.00040897762,0.0034399994,0.06849001],"genre_scores_gemma":[0.7576545,0.0004651174,0.21423885,0.00012993999,0.00017829423,0.00010046204,0.0006501779,0.0006524677,0.025930218],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99976176,0.000048158392,0.000015862577,0.000040412975,0.00009415809,0.000039672348],"domain_scores_gemma":[0.9994777,0.00026345282,0.000027867047,0.00011116797,0.000092475435,0.000027360908],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00042176843,0.0006938725,0.0008491498,0.00064651686,0.00060138124,0.0013198296,0.00091223296,0.0004436913,0.012236549],"category_scores_gemma":[0.0019334292,0.00034135525,0.00060519285,0.001118735,0.00062752585,0.001653167,0.00095907046,0.000654569,0.0018026198],"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.00091412617,0.00021580128,0.002002496,0.0005091551,0.00014332357,0.00054238003,0.00040297958,0.2314912,0.020728005,0.35444406,0.018692937,0.3699136],"study_design_scores_gemma":[0.00007833929,0.000043471966,0.00032772563,0.000018047667,0.000033150733,0.0001078336,0.000070142094,0.75793695,0.009615963,0.22534955,0.0064049712,0.000013825477],"about_ca_topic_score_codex":0.0013552138,"about_ca_topic_score_gemma":0.0027581614,"teacher_disagreement_score":0.012236549,"about_ca_system_score_codex":0.0006864085,"about_ca_system_score_gemma":0.0005844666,"threshold_uncertainty_score":0.040935278},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05283721,0.0007103812,0.9189134,0.0003673713,0.0008874563,0.00020284351,0.000273468,0.0048737186,0.020934194],"genre_scores_gemma":[0.15584697,0.00037892326,0.82578987,0.00024173364,0.00030764245,0.0001634716,0.0007905034,0.00063240546,0.015848484],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99926263,0.00009020888,0.000058527978,0.00020990822,0.00026033045,0.0001185216],"domain_scores_gemma":[0.99945575,0.000106915504,0.000040262446,0.0001970395,0.00012656866,0.00007351342],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00051704346,0.00093034,0.0014474171,0.001512049,0.0012591388,0.0018114556,0.0012677382,0.000812796,0.015090647],"category_scores_gemma":[0.0014410788,0.0004977569,0.0007953282,0.0024284858,0.00073976186,0.0031909312,0.0028983888,0.0014113904,0.0053686937],"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.00078508916,0.0002589164,0.0008049466,0.00030215897,0.00006978177,0.0003772811,0.0002205852,0.007281028,0.043611452,0.091769,0.0214881,0.83303165],"study_design_scores_gemma":[0.0010937599,0.0012785372,0.0019629025,0.00020399252,0.00027378113,0.0034151408,0.00043304937,0.33488882,0.1127709,0.36265495,0.18070284,0.00032139663],"about_ca_topic_score_codex":0.0005196475,"about_ca_topic_score_gemma":0.00067877857,"teacher_disagreement_score":0.015090647,"about_ca_system_score_codex":0.00049036916,"about_ca_system_score_gemma":0.0011709777,"threshold_uncertainty_score":0.050483227},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.27899328,0.0014463975,0.5989152,0.004006885,0.00030062185,0.00006302338,0.00017914046,0.00022807159,0.115867324],"genre_scores_gemma":[0.95227396,0.00042845763,0.038822256,0.0003823471,0.0002618959,0.000041807783,0.000043591204,0.000049394643,0.0076963417],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99923944,0.00014671401,0.000031125495,0.00010621499,0.0003469346,0.0001295657],"domain_scores_gemma":[0.9986241,0.0004951537,0.00024685083,0.00021783575,0.00025229875,0.00016381203],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011264049,0.00028516835,0.0003652556,0.0014796329,0.0013259376,0.0018100301,0.00081538776,0.0007646169,0.0036363616],"category_scores_gemma":[0.0030996746,0.00016518826,0.0005494438,0.0008755303,0.0039790445,0.004443865,0.0013667132,0.0013993956,0.00034933435],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000002364316,0.0000034626914,0.00006306012,0.000005121002,9.1584167e-7,0.000016926559,0.000039731865,0.00052890356,0.00025206973,0.9976216,0.00018371092,0.001282188],"study_design_scores_gemma":[0.0000026976609,0.0000079101055,0.00018957749,0.000005837398,0.0000014867127,0.00006821328,0.000042343156,0.013969686,0.00029294257,0.9832508,0.0021607142,0.000007857805],"about_ca_topic_score_codex":0.0014746126,"about_ca_topic_score_gemma":0.0011812419,"teacher_disagreement_score":0.0036363616,"about_ca_system_score_codex":0.0018360015,"about_ca_system_score_gemma":0.0007883699,"threshold_uncertainty_score":0.013321161},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.77697283,0.0018298108,0.08305539,0.0062658526,0.0005928417,0.000041278443,0.00039355442,0.00048063707,0.13036774],"genre_scores_gemma":[0.99105924,0.000273113,0.0051847002,0.00024478306,0.00020455942,0.000030155741,0.00009185049,0.000024649938,0.0028869945],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989793,0.0001323999,0.00005008086,0.00029554713,0.00030244706,0.00024017204],"domain_scores_gemma":[0.9971511,0.0018051164,0.00018104902,0.00042194632,0.00018684957,0.00025396593],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011874264,0.00024636812,0.00074312935,0.0014510544,0.0026947765,0.0030979882,0.0007758633,0.00085999136,0.002400085],"category_scores_gemma":[0.0073832083,0.00024326972,0.0004980699,0.0013035733,0.0068068835,0.004663509,0.0023523946,0.0022003392,0.00035902247],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000049162318,0.000006894153,0.00082795514,0.000016849222,0.0000025490103,0.000100080346,0.0002726931,0.000988306,0.00036455932,0.9906006,0.0010862631,0.005684088],"study_design_scores_gemma":[0.000012048255,0.000014265365,0.00040464586,0.000016800566,0.000004709012,0.00012628554,0.0001326166,0.0023106555,0.001207508,0.99041873,0.0053396113,0.000012041133],"about_ca_topic_score_codex":0.0011258626,"about_ca_topic_score_gemma":0.0006166065,"teacher_disagreement_score":0.0030979882,"about_ca_system_score_codex":0.0014710096,"about_ca_system_score_gemma":0.0006725928,"threshold_uncertainty_score":0.0106729865},"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":"methods","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.026352113,0.0028635093,0.72855616,0.0017941442,0.0010258651,0.00019225178,0.00050097285,0.0027638949,0.23595114],"genre_scores_gemma":[0.2697901,0.0017174676,0.5993397,0.0009214433,0.00041419122,0.00019559784,0.0006329455,0.001889892,0.12509863],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9994031,0.00018918565,0.000016300683,0.00009714132,0.0001911408,0.00010311982],"domain_scores_gemma":[0.9989557,0.00036852053,0.000031625605,0.00043849164,0.00014601083,0.000059576567],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00065370806,0.00075369247,0.0012130423,0.0014157756,0.0012595532,0.0021461851,0.002504166,0.0012672818,0.032347236],"category_scores_gemma":[0.003642995,0.0005657586,0.00076646113,0.002516707,0.0015195119,0.0024659657,0.0014639895,0.0019802134,0.00754246],"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.00036742643,0.00015126406,0.00027613674,0.00022204754,0.00007570856,0.00011670247,0.00011695593,0.06525729,0.0016240613,0.50295514,0.06590163,0.36293557],"study_design_scores_gemma":[0.00018705933,0.00006995772,0.0003375382,0.00009969392,0.000065881286,0.0002574655,0.00010668275,0.3630785,0.003249474,0.5563407,0.07614373,0.00006336351],"about_ca_topic_score_codex":0.0056252247,"about_ca_topic_score_gemma":0.011105495,"teacher_disagreement_score":0.032347236,"about_ca_system_score_codex":0.0016724722,"about_ca_system_score_gemma":0.0021951494,"threshold_uncertainty_score":0.10821229},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.015370427,0.00054128515,0.9791474,0.0003717526,0.00018256,0.000035004083,0.000033542827,0.00032963092,0.003988563],"genre_scores_gemma":[0.4272457,0.00084223645,0.56036794,0.00021173124,0.0002048895,0.00018600766,0.000108782115,0.0007066201,0.010126061],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99822325,0.0006337601,0.00007235715,0.00024889346,0.0007269125,0.00009481635],"domain_scores_gemma":[0.9875377,0.009475633,0.00041925156,0.0011529061,0.0012119189,0.00020262257],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0041391714,0.00072488346,0.00078578194,0.0017472493,0.00094458443,0.0015419334,0.0012449097,0.0015114213,0.0048994506],"category_scores_gemma":[0.026638124,0.0003968157,0.0006959646,0.00088825385,0.0027079156,0.002755921,0.0027441552,0.0025833321,0.0010412362],"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.0002987167,0.0000750833,0.0024252518,0.00026114436,0.00006449799,0.00020293295,0.00033681127,0.4059402,0.006735416,0.45142433,0.002330191,0.12990549],"study_design_scores_gemma":[0.0000150409505,0.000050456052,0.00020459916,0.000035028766,0.0000070650453,0.00004045394,0.000033708246,0.9102078,0.002442568,0.084368214,0.0025782723,0.000016692104],"about_ca_topic_score_codex":0.003376762,"about_ca_topic_score_gemma":0.0027185758,"teacher_disagreement_score":0.0048994506,"about_ca_system_score_codex":0.0012853513,"about_ca_system_score_gemma":0.0012812823,"threshold_uncertainty_score":0.021890283},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3086858,0.0018129875,0.35225347,0.0027477222,0.0014144642,0.00020156182,0.0009742961,0.0018086478,0.3301011],"genre_scores_gemma":[0.86426073,0.0011149788,0.05863937,0.00048409402,0.00037316067,0.00017177025,0.00060338597,0.0006311327,0.07372128],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99924254,0.00020291675,0.00003803323,0.00014963612,0.00022843128,0.00013847857],"domain_scores_gemma":[0.99910635,0.00036528066,0.00013142888,0.000104061546,0.00013258871,0.00016039168],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00084272545,0.00057637575,0.00046014442,0.0020844282,0.0020837113,0.003567877,0.00068138575,0.0015551028,0.017403156],"category_scores_gemma":[0.0027709669,0.00039590662,0.0005894787,0.0014170422,0.0019657416,0.007004442,0.0015379288,0.0019238162,0.002646576],"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.00002147049,0.000011407471,0.00009778236,0.000022766919,0.0000021088683,0.00006312165,0.00014639265,0.00021010576,0.00051153346,0.9926882,0.0012807737,0.0049445117],"study_design_scores_gemma":[0.000011129127,0.000009069272,0.00010412346,0.000017725353,0.0000038505277,0.00012651073,0.000095596726,0.0012848632,0.0005680247,0.98984015,0.007929828,0.0000091787515],"about_ca_topic_score_codex":0.0007826721,"about_ca_topic_score_gemma":0.0011053907,"teacher_disagreement_score":0.017403156,"about_ca_system_score_codex":0.0009786232,"about_ca_system_score_gemma":0.0006759988,"threshold_uncertainty_score":0.058219373},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.264474,0.0029632167,0.62706363,0.0017618787,0.00026810353,0.000045641118,0.00033956164,0.00025954994,0.10282437],"genre_scores_gemma":[0.87825274,0.003054502,0.057320435,0.0003506199,0.0002577891,0.00006910862,0.0004023179,0.00019858997,0.060093928],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995714,0.000068837835,0.000015541356,0.00009437891,0.0001894481,0.00006042007],"domain_scores_gemma":[0.99948823,0.00014565894,0.00010734974,0.000066392255,0.00013755116,0.000054789158],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005933803,0.0005341308,0.00045664288,0.00087581645,0.00062760036,0.0017514045,0.0007432367,0.0005609556,0.007510798],"category_scores_gemma":[0.001453314,0.00034983092,0.0007235783,0.0007075658,0.001963094,0.0024649163,0.0013161923,0.0020249062,0.0007067026],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000020863476,0.000010007914,0.0005589487,0.00008967346,0.000021484615,0.00011164204,0.0002576395,0.012167395,0.0037054087,0.9743576,0.000993036,0.0077062687],"study_design_scores_gemma":[0.000024249244,0.00007420998,0.0027769676,0.00005990538,0.000036244743,0.00042133327,0.00048503373,0.16892014,0.0042633456,0.8051025,0.017787255,0.00004882396],"about_ca_topic_score_codex":0.00415081,"about_ca_topic_score_gemma":0.0030941586,"teacher_disagreement_score":0.007510798,"about_ca_system_score_codex":0.001464799,"about_ca_system_score_gemma":0.00094335625,"threshold_uncertainty_score":0.02512616},"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":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0109133115,0.32070076,0.13998379,0.05016744,0.012082297,0.00026241166,0.0025845896,0.0020874778,0.46121788],"genre_scores_gemma":[0.06946704,0.116043456,0.05640945,0.0018192204,0.0045420327,0.00022961959,0.0024152007,0.0009345389,0.74813944],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9991986,0.000090898255,0.000025838028,0.00018121327,0.0003815666,0.00012186556],"domain_scores_gemma":[0.99852896,0.0004861846,0.000031020245,0.00015149197,0.0005908912,0.00021136213],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017815704,0.0012591238,0.0010539311,0.0015290763,0.0016675633,0.003208218,0.0011872109,0.0007079779,0.052821964],"category_scores_gemma":[0.0025620647,0.0007986508,0.00067919755,0.0032147877,0.002537803,0.0027697969,0.0015727698,0.002721424,0.009112242],"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.00010850252,0.00006294244,0.00051807566,0.0003195268,0.000025849537,0.000045081066,0.00029700715,0.004611221,0.0012508305,0.14965841,0.61206794,0.23103468],"study_design_scores_gemma":[0.000029744306,0.00004125907,0.001499253,0.00038796203,0.000030276398,0.00011540293,0.00022814704,0.011153016,0.0013519656,0.065377876,0.91973835,0.000046748777],"about_ca_topic_score_codex":0.16466062,"about_ca_topic_score_gemma":0.33415887,"teacher_disagreement_score":0.83533937,"about_ca_system_score_codex":0.013726638,"about_ca_system_score_gemma":0.010158585,"threshold_uncertainty_score":0.32740438},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0022557639,0.25103146,0.098587714,0.014903008,0.0100603895,0.00015777648,0.0024845963,0.0023382585,0.6181811],"genre_scores_gemma":[0.009474835,0.1349141,0.035922926,0.0013170341,0.0034039235,0.00009500024,0.0025302193,0.0009587601,0.8113831],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9992987,0.000050272327,0.000020577685,0.00006153324,0.0005319725,0.00003686655],"domain_scores_gemma":[0.99894994,0.00026415326,0.000031978052,0.00011185402,0.0005060382,0.00013608785],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00067608897,0.0009560329,0.0008877444,0.0019556028,0.0013713085,0.004362892,0.00097409217,0.00066524284,0.04986685],"category_scores_gemma":[0.0019022386,0.00066635385,0.0004639359,0.0058184504,0.0015364367,0.0031572569,0.0012200152,0.0022294798,0.025339635],"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.000016006436,0.00001747719,0.00009896566,0.00041526306,0.00001100994,0.00003335315,0.0001540955,0.0012219801,0.00070086337,0.058460742,0.77228105,0.1665892],"study_design_scores_gemma":[0.0000033677918,0.0000039440065,0.00020472072,0.00017672198,0.0000042326897,0.000077889665,0.00003301946,0.0011222333,0.0002535274,0.017154949,0.98095787,0.00000756683],"about_ca_topic_score_codex":0.031899747,"about_ca_topic_score_gemma":0.098505795,"teacher_disagreement_score":0.96810025,"about_ca_system_score_codex":0.0055919504,"about_ca_system_score_gemma":0.006631585,"threshold_uncertainty_score":0.16682124},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1255461,0.0009803099,0.84447545,0.0002977731,0.00014685806,0.00008655573,0.000045883426,0.00019159784,0.028229445],"genre_scores_gemma":[0.54586965,0.0017010857,0.43225926,0.00016197552,0.00015455429,0.0001723032,0.00010257324,0.00020204997,0.019376505],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99944776,0.00019322023,0.00003402175,0.00005114883,0.00021917115,0.00005457043],"domain_scores_gemma":[0.99835086,0.00094905554,0.000086997585,0.00026007975,0.00024623246,0.00010681015],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015380906,0.00047507047,0.0005345833,0.0007263903,0.0005002638,0.00073442725,0.00070179946,0.00048309538,0.0017169375],"category_scores_gemma":[0.0047009774,0.00026123042,0.0008893158,0.00064563047,0.0015461964,0.0012619501,0.0015486401,0.0016327718,0.00033536373],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00020359806,0.00009414641,0.0015107212,0.00016863264,0.000019131967,0.0003005511,0.0007649543,0.19336715,0.008855021,0.6988054,0.00084957486,0.0950612],"study_design_scores_gemma":[0.000036212346,0.00019665595,0.0006223238,0.00008535964,0.000014803068,0.00022764025,0.00008250852,0.82470626,0.0042574983,0.15811394,0.011627648,0.000029183057],"about_ca_topic_score_codex":0.0024059194,"about_ca_topic_score_gemma":0.0028980896,"teacher_disagreement_score":0.0024059194,"about_ca_system_score_codex":0.000885305,"about_ca_system_score_gemma":0.0006539536,"threshold_uncertainty_score":0.008134365},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"dataset","genre_consensus":"dataset","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0012119955,0.00058083254,0.001769679,0.00050917006,0.00014957985,0.00007917789,0.97555023,0.009181867,0.010967552],"genre_scores_gemma":[0.002246647,0.000306212,0.0025369385,0.0001955543,0.000034728073,0.00025654456,0.9910703,0.00069312524,0.0026600442],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99686384,0.0006155628,0.00044370868,0.00071500667,0.0010281962,0.00033369535],"domain_scores_gemma":[0.99624133,0.0009887377,0.00029797116,0.0013147681,0.0008821306,0.0002749931],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019633425,0.0024711874,0.0012834619,0.004988112,0.0010590133,0.0039642183,0.0029994822,0.0016482781,0.05057711],"category_scores_gemma":[0.009757441,0.0006302062,0.0014279092,0.0070863697,0.0005610922,0.0033784262,0.0028229293,0.0026123952,0.1163623],"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.00019308167,0.000041514544,0.0009448559,0.00075362175,0.000028407338,0.000038515518,0.00006892856,0.00062805164,0.00024720782,0.0032056961,0.98013514,0.0137150055],"study_design_scores_gemma":[0.00012992467,0.000020523315,0.0013125056,0.00017275024,0.0000088304205,0.00007175108,0.00008147096,0.0007350492,0.0005116168,0.0031679657,0.9937675,0.000020144334],"about_ca_topic_score_codex":0.010088572,"about_ca_topic_score_gemma":0.015518146,"teacher_disagreement_score":0.05057711,"about_ca_system_score_codex":0.0013204537,"about_ca_system_score_gemma":0.002667453,"threshold_uncertainty_score":0.16919726},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9632382,0.00017443018,0.025740338,0.00028855764,0.00003647263,0.0000149463285,0.000053599488,0.00006158089,0.0103918845],"genre_scores_gemma":[0.99037313,0.00018736566,0.004391314,0.000047043988,0.000047088244,0.000016358546,0.00007121969,0.000030521885,0.004835922],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99983466,0.000034469358,0.000008524559,0.000033425677,0.00004162635,0.000047224417],"domain_scores_gemma":[0.99954706,0.00012331155,0.00010510164,0.00004994692,0.000044527456,0.00012995758],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00032274623,0.00047282196,0.00050735986,0.0017418093,0.0008237302,0.0017750544,0.0007359301,0.00076994643,0.0028097576],"category_scores_gemma":[0.0018212395,0.00021611874,0.00042869776,0.0007875748,0.0013914342,0.0021236178,0.00087929325,0.00073729124,0.00029931142],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007108032,0.00003837163,0.0016329271,0.000031247542,0.000008584744,0.0004176766,0.00023004453,0.007985837,0.0045024147,0.98008955,0.00037418606,0.0046180813],"study_design_scores_gemma":[0.000034505938,0.000054642085,0.0012951684,0.000016066015,0.000010002135,0.00046643184,0.0002395735,0.09642954,0.0026280317,0.8972518,0.0015543497,0.00001986743],"about_ca_topic_score_codex":0.0010018732,"about_ca_topic_score_gemma":0.0007270205,"teacher_disagreement_score":0.0028097576,"about_ca_system_score_codex":0.0007091147,"about_ca_system_score_gemma":0.0002640764,"threshold_uncertainty_score":0.009399593},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"dataset","genre_consensus":"dataset","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00006663272,0.00004547225,0.00005287686,0.000044423166,0.000012479434,0.0000061957867,0.9986449,0.0004585353,0.00066846097],"genre_scores_gemma":[0.00019048477,0.000039457107,0.00019421914,0.00004270385,0.0000031558207,0.000034892415,0.9990256,0.00009696192,0.00037256375],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99905246,0.00012514346,0.00011318651,0.00032692653,0.0002291958,0.0001532265],"domain_scores_gemma":[0.99804026,0.0005338187,0.00016599242,0.00055127783,0.00048048495,0.00022814012],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0008832226,0.0020053526,0.001562336,0.004397425,0.0009695168,0.0024218122,0.0030021458,0.0022632603,0.11343106],"category_scores_gemma":[0.005396509,0.0007542953,0.0011794947,0.0089644985,0.00045257137,0.0021218068,0.0022921173,0.0020583263,0.17431809],"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.00003183716,0.000014837375,0.0003754688,0.0005270957,0.000014811107,0.000014665968,0.000016760405,0.00018942276,0.00011726516,0.0005077247,0.9966974,0.001492723],"study_design_scores_gemma":[0.00009567286,0.000010193744,0.0017504876,0.0001859133,0.00001383743,0.000043960754,0.00006268064,0.00031175237,0.00022884023,0.0011387556,0.99614125,0.000016706637],"about_ca_topic_score_codex":0.01744402,"about_ca_topic_score_gemma":0.030201336,"teacher_disagreement_score":0.88656896,"about_ca_system_score_codex":0.0017099589,"about_ca_system_score_gemma":0.0022137002,"threshold_uncertainty_score":0.37946475},"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":"protocol","genre_gemma":"protocol","domain_codex":null,"domain_gemma":"methods","model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"protocol","genre_consensus":"protocol","domain_candidate":"methods","domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0016849946,0.001934825,0.007933729,0.0020490822,0.00076521735,0.97257644,0.00957387,0.00032193772,0.003159936],"genre_scores_gemma":[0.001841064,0.00049115455,0.009288324,0.00029804892,0.000039380877,0.9868934,0.00069834903,0.000027206397,0.00042299708],"study_design_codex":"systematic_review","study_design_gemma":"systematic_review","domain_scores_codex":[0.7878696,0.08375146,0.083025865,0.011188634,0.026119681,0.008044757],"domain_scores_gemma":[0.52616525,0.15810393,0.06619529,0.05542679,0.18508154,0.0090272045],"candidate_categories":["metaresearch","scholarly_communication"],"consensus_categories":["metaresearch"],"category_scores_codex":[0.26191562,0.0044321134,0.011243792,0.020134583,0.009603726,0.013240596,0.006178143,0.012835785,0.054958094],"category_scores_gemma":[0.44185582,0.0056332317,0.017880924,0.020983052,0.008925798,0.009982468,0.014485162,0.011964068,0.01567685],"study_design_candidate":"systematic_review","study_design_consensus":"systematic_review","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.025042696,0.0014692504,0.004685813,0.5942021,0.004874462,0.0010868518,0.021446666,0.0035561165,0.0044343406,0.031168556,0.11540359,0.19262955],"study_design_scores_gemma":[0.04191901,0.0037181722,0.0142355235,0.49387658,0.012316811,0.00038704727,0.011453252,0.003122564,0.012047553,0.035972863,0.3696896,0.0012611006],"about_ca_topic_score_codex":0.014451493,"about_ca_topic_score_gemma":0.021758405,"teacher_disagreement_score":0.9867594,"about_ca_system_score_codex":0.027306117,"about_ca_system_score_gemma":0.12210882,"threshold_uncertainty_score":0.91018945},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0008529487,0.014689699,0.00014342243,0.004283757,0.0029794436,0.000015694388,0.0017517451,0.000090273716,0.9751931],"genre_scores_gemma":[0.002362406,0.0026127242,0.000058855654,0.00017347754,0.00020034112,0.000006612244,0.00020520948,0.00004178772,0.9943386],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9998005,0.000018707098,0.000009114312,0.00004430008,0.000091456364,0.000036063557],"domain_scores_gemma":[0.9998374,0.000026536869,0.000013477736,0.000018491917,0.00007330315,0.00003081826],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00021252979,0.0006312795,0.00039974262,0.0013189128,0.003349344,0.003440271,0.0005062408,0.00090699305,0.270184],"category_scores_gemma":[0.000930582,0.0003043529,0.0001959129,0.0021209468,0.0008973526,0.0019208312,0.0012362907,0.001789304,0.11170128],"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.000036768717,0.0000064096034,0.00029918185,0.000106278916,0.000003641926,0.0001251028,0.00036386526,0.000050198774,0.00013380265,0.038889565,0.9174058,0.04257934],"study_design_scores_gemma":[7.781364e-7,0.000001241025,0.00025457723,0.000034898756,3.9362905e-7,0.000017724124,0.00004958259,0.00000742356,0.000024351502,0.0005188204,0.999089,0.0000012920652],"about_ca_topic_score_codex":0.040608834,"about_ca_topic_score_gemma":0.2123545,"teacher_disagreement_score":0.270184,"about_ca_system_score_codex":0.0030453901,"about_ca_system_score_gemma":0.0014651442,"threshold_uncertainty_score":0.90385556},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.99708,0.0010342532,0.00027633287,0.000014325171,0.0000071582863,0.000023922341,0.00072570785,0.000023576717,0.00081484864],"genre_scores_gemma":[0.9908179,0.0012396082,0.0029503875,0.00003779257,0.00000705099,0.00004401833,0.0018585976,0.000015782485,0.0030288533],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.9998435,0.0000094770885,0.000008607149,0.00006552069,0.00003218974,0.00004072418],"domain_scores_gemma":[0.99978644,0.000039888968,0.00007733032,0.000015933621,0.00004215558,0.00003816784],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00019884916,0.00036679703,0.00026191474,0.0017951543,0.00052351115,0.00030373028,0.00014083702,0.00035041888,0.0017487097],"category_scores_gemma":[0.00033108794,0.00025631758,0.00017690667,0.00074263767,0.0004538277,0.00021159403,0.00034310255,0.00027711742,0.00042798094],"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.000570249,0.00008161124,0.6008003,0.00019365955,0.0001241142,0.002795974,0.0017414134,0.00055736647,0.35466537,0.00018548494,0.0005904489,0.037693996],"study_design_scores_gemma":[0.000009241185,0.0002789153,0.9770348,0.000014955558,0.00007453081,0.0015415974,0.0004997801,0.00017020084,0.015466793,0.000060189504,0.004840022,0.000008909054],"about_ca_topic_score_codex":0.016180154,"about_ca_topic_score_gemma":0.049686052,"teacher_disagreement_score":0.016180154,"about_ca_system_score_codex":0.00069823465,"about_ca_system_score_gemma":0.00032280345,"threshold_uncertainty_score":0.032171965},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00051752006,0.00083280314,0.0007304253,0.0019365173,0.007960211,0.0001048979,0.0014255552,0.0025603175,0.98393166],"genre_scores_gemma":[0.0015515146,0.0003523344,0.00044014296,0.0005382645,0.00053487264,0.000021079004,0.00060961006,0.00088957977,0.99506253],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9989937,0.00008120977,0.00003171761,0.00012693966,0.0006284547,0.00013809808],"domain_scores_gemma":[0.99652356,0.0002776298,0.000072553186,0.00033208544,0.001845074,0.0009490316],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.00087194995,0.0011065356,0.0008397891,0.0019357143,0.0029347257,0.00971804,0.0014084498,0.0022312128,0.880633],"category_scores_gemma":[0.004720356,0.00067022274,0.00093188405,0.0013925915,0.0007510458,0.005093111,0.0029231342,0.0034785082,0.7899096],"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.000026513979,0.000014468881,0.000036410405,0.000043680528,0.000001222897,0.000045685305,0.000020372892,0.00002502329,0.00018090458,0.0009506261,0.9708064,0.027848618],"study_design_scores_gemma":[0.000005578822,0.000014723434,0.00024937975,0.00004241726,0.0000013623854,0.000076887554,0.00006827488,0.00002763394,0.00016484346,0.00037822934,0.9989629,0.000007794682],"about_ca_topic_score_codex":0.0059359404,"about_ca_topic_score_gemma":0.016656969,"teacher_disagreement_score":0.119367,"about_ca_system_score_codex":0.0017213533,"about_ca_system_score_gemma":0.0018280926,"threshold_uncertainty_score":0.17026246},"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":"empirical","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9485339,0.0022783368,0.006369934,0.0003091221,0.0003992667,0.00026545848,0.0013480746,0.0004281748,0.0400678],"genre_scores_gemma":[0.97939485,0.0006785942,0.010755925,0.00022788183,0.00006479357,0.00009167698,0.0016443041,0.000050203522,0.0070918165],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99989665,0.000009075662,0.0000089677205,0.000048336573,0.000015733242,0.000021292191],"domain_scores_gemma":[0.9998989,0.000016417349,0.00003235959,0.00002078469,0.0000113364595,0.000020298721],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000074956006,0.00034685674,0.00018489825,0.0008891315,0.0008771598,0.00042779575,0.00038183917,0.000526072,0.005591502],"category_scores_gemma":[0.00022688303,0.00019304929,0.0004372992,0.00050385424,0.0005296188,0.00049046264,0.00077914295,0.0005807976,0.0016207565],"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.0013120739,0.0002711323,0.32908723,0.0021338067,0.00029351865,0.0252212,0.014458238,0.0004324706,0.188936,0.0033371877,0.011525261,0.42299172],"study_design_scores_gemma":[0.00003109415,0.00024680927,0.85106516,0.00013484663,0.00022365086,0.025314856,0.0024653627,0.0004173085,0.0059501776,0.00041856224,0.113686904,0.000045372817],"about_ca_topic_score_codex":0.0022887755,"about_ca_topic_score_gemma":0.00807962,"teacher_disagreement_score":0.005591502,"about_ca_system_score_codex":0.00029602088,"about_ca_system_score_gemma":0.00012629549,"threshold_uncertainty_score":0.018705487},"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":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00011065456,0.000010799558,0.00014259352,0.00004470098,0.000013551843,0.000027942442,0.99857557,0.00028113206,0.0007929773],"genre_scores_gemma":[0.0036520802,0.00008500752,0.0020960786,0.00026989708,0.00003614763,0.0004374986,0.98735714,0.0012333167,0.004832765],"study_design_codex":"not_applicable","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99928826,0.00007241073,0.000084562314,0.00019677685,0.00020453476,0.0001535235],"domain_scores_gemma":[0.9897912,0.0067606214,0.000441291,0.00076060183,0.0017993592,0.00044690602],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0012620913,0.0013352857,0.0015681224,0.0027954027,0.0018544535,0.0022035975,0.0025754084,0.0014512733,0.8462379],"category_scores_gemma":[0.015761131,0.00084112975,0.0011038838,0.005986379,0.00052441284,0.00215138,0.0013105191,0.0011708713,0.20884506],"study_design_candidate":"bench_or_experimental","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.00027475948,0.00007446792,0.0016402993,0.0025007774,0.000033768883,0.00009517872,0.00007842139,0.00050667697,0.00039051645,0.0008552862,0.98807275,0.005477082],"study_design_scores_gemma":[0.0036136666,0.00017720152,0.021145226,0.0016600592,0.00014915917,0.00033162005,0.00037866566,0.0014476139,0.0017109576,0.008639424,0.96058595,0.00016050282],"about_ca_topic_score_codex":0.04300225,"about_ca_topic_score_gemma":0.065511554,"teacher_disagreement_score":0.95699775,"about_ca_system_score_codex":0.0018972162,"about_ca_system_score_gemma":0.0044427365,"threshold_uncertainty_score":0.21932292},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.016989859,0.013934175,0.72815406,0.016001169,0.001769674,0.00018320492,0.001553646,0.0015254758,0.21988867],"genre_scores_gemma":[0.6210807,0.009578902,0.2958747,0.005456648,0.0041324445,0.00089753245,0.003012384,0.0005835906,0.05938303],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99828964,0.0006361544,0.00011586325,0.00017458411,0.00060099975,0.00018271498],"domain_scores_gemma":[0.9984658,0.0006534507,0.00011949008,0.0003059086,0.00034482937,0.00011055706],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002940993,0.0011828904,0.000727758,0.0032592383,0.0020147199,0.0051912423,0.0015891744,0.001365041,0.010769012],"category_scores_gemma":[0.0029481873,0.00052499404,0.0014936087,0.0029849398,0.006758606,0.009933596,0.002546947,0.00618829,0.0026863192],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000001135855,0.000003434669,0.000015719012,0.00001214444,0.0000013737019,0.0000072332587,0.00006417721,0.000092978225,0.000054801465,0.997785,0.00080661295,0.0011553536],"study_design_scores_gemma":[0.00000594207,0.0000033807787,0.00002677074,0.000013520626,0.0000018022257,0.000022482633,0.00003810899,0.00078992697,0.00007833183,0.98378134,0.015234754,0.000003644021],"about_ca_topic_score_codex":0.0017905222,"about_ca_topic_score_gemma":0.0016754128,"teacher_disagreement_score":0.010769012,"about_ca_system_score_codex":0.003850042,"about_ca_system_score_gemma":0.0014238341,"threshold_uncertainty_score":0.03602594},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0010861484,0.034796357,0.0041784695,0.004561198,0.0053979433,0.00008740428,0.0019213536,0.0016082573,0.9463628],"genre_scores_gemma":[0.0027918005,0.012662102,0.001672732,0.0005072855,0.0009190801,0.000063766565,0.0014103518,0.0005625456,0.9794103],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99935204,0.00007146215,0.000033188582,0.000092544265,0.00039236323,0.000058307574],"domain_scores_gemma":[0.99943405,0.00011687084,0.00003958479,0.00007882593,0.00019803384,0.00013267802],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00065977057,0.0014798265,0.0005650233,0.0037490074,0.0012685439,0.0067852675,0.00094849616,0.0013008423,0.23098743],"category_scores_gemma":[0.0014037777,0.00082326494,0.0004604788,0.0060252696,0.0009331591,0.0063440474,0.0021679343,0.0024706232,0.17443919],"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.000024325382,0.000024307503,0.00006883044,0.00022922378,0.0000037465795,0.000028096778,0.0000859522,0.00043429228,0.00037967385,0.04330242,0.7930774,0.1623417],"study_design_scores_gemma":[0.00000206373,0.000005583481,0.00009965434,0.00006605004,9.839812e-7,0.000031256623,0.000019065417,0.00012047336,0.00009718305,0.0024518406,0.99710256,0.0000034269297],"about_ca_topic_score_codex":0.0061834888,"about_ca_topic_score_gemma":0.010245685,"teacher_disagreement_score":0.23098743,"about_ca_system_score_codex":0.0038435098,"about_ca_system_score_gemma":0.0020100859,"threshold_uncertainty_score":0.77272993},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"dataset","genre_consensus":"dataset","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00025611397,0.00005413199,0.0011883846,0.0022895574,0.0005132326,0.00025748962,0.9863535,0.0015711568,0.0075164647],"genre_scores_gemma":[0.001853448,0.000065057735,0.0033017362,0.0016735935,0.00024601215,0.0021621455,0.97530156,0.000997785,0.014398682],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.98739225,0.0032485987,0.0015545202,0.0019855294,0.0047599333,0.0010591772],"domain_scores_gemma":[0.94263756,0.015056667,0.0023708164,0.01724725,0.01991232,0.0027754644],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.02047498,0.0015800874,0.0020047019,0.0057268436,0.0019872522,0.005485962,0.0036491444,0.0032168878,0.1811485],"category_scores_gemma":[0.08268451,0.00087731396,0.0013438629,0.008880932,0.0010172926,0.0030358818,0.0031463678,0.004938559,0.20420688],"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.000028508979,0.000009989351,0.00015443898,0.000031551146,0.0000024626424,0.000003360792,0.0000051831835,0.000039910334,0.000020628186,0.0003252732,0.99823594,0.0011426664],"study_design_scores_gemma":[0.00022175263,0.000022370607,0.0037253655,0.00012934631,0.0000129055325,0.000020648313,0.00008695386,0.0003030118,0.00061339233,0.0025811892,0.9922455,0.000037501643],"about_ca_topic_score_codex":0.012543403,"about_ca_topic_score_gemma":0.021835782,"teacher_disagreement_score":0.1811485,"about_ca_system_score_codex":0.0038271223,"about_ca_system_score_gemma":0.0052878084,"threshold_uncertainty_score":0.6060021},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.940031,0.0000959044,0.034356866,0.00013381227,0.000052607385,0.000021850587,0.0001274675,0.00007117195,0.025109358],"genre_scores_gemma":[0.99293315,0.00004891647,0.0027299866,0.000015946931,0.000016248001,0.000012481047,0.00012781906,0.00002869465,0.004086754],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99976474,0.000034619807,0.000015887605,0.000058198577,0.00008431066,0.000042374617],"domain_scores_gemma":[0.99970657,0.00006195372,0.00003877238,0.00004528077,0.00006832603,0.00007912689],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002609673,0.00025520902,0.0002985283,0.0009265008,0.0008789117,0.0018986226,0.00032751934,0.00023219791,0.00381409],"category_scores_gemma":[0.00074418355,0.00018040037,0.00031575764,0.00036441407,0.0019050583,0.0016601384,0.00086024095,0.0005434684,0.00024132755],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00018317238,0.000023684459,0.0038937235,0.000051732255,0.000015305683,0.0005452329,0.0007229724,0.0031946849,0.017708011,0.9639923,0.0009465218,0.0087226],"study_design_scores_gemma":[0.000059566442,0.00015743886,0.012391376,0.00005246243,0.00006599255,0.0014892152,0.0018463265,0.032011352,0.032376382,0.8981555,0.021303346,0.00009108673],"about_ca_topic_score_codex":0.00094258547,"about_ca_topic_score_gemma":0.0008060479,"teacher_disagreement_score":0.00381409,"about_ca_system_score_codex":0.0006693725,"about_ca_system_score_gemma":0.00021967883,"threshold_uncertainty_score":0.012759447},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.56030464,0.0003155984,0.39695007,0.00057753426,0.00014602715,0.00007920685,0.0004676348,0.00036052524,0.040798746],"genre_scores_gemma":[0.9755735,0.0001428476,0.019937238,0.00010031824,0.0000726591,0.00004251515,0.00023612758,0.0000942666,0.0038005114],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9984049,0.00028325937,0.000065167864,0.00034945723,0.00058296975,0.00031416243],"domain_scores_gemma":[0.99619764,0.0011759459,0.0008792518,0.00046397102,0.0007327654,0.0005504561],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013474245,0.0005946332,0.0003303835,0.0014020369,0.0009847375,0.0019798987,0.0008862975,0.0007590725,0.004846819],"category_scores_gemma":[0.0067531955,0.00033034573,0.0007796799,0.001127211,0.0018694967,0.0029871813,0.0017763553,0.0016931131,0.0010025277],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013750984,0.000056373567,0.0023540263,0.000058560785,0.000015552354,0.00044267706,0.00035758677,0.0025640165,0.01257022,0.9679106,0.0006955675,0.012837217],"study_design_scores_gemma":[0.0000656135,0.00020789141,0.0017284943,0.000057254438,0.000040740506,0.0017854021,0.00042998267,0.034374688,0.019014282,0.93240666,0.009792708,0.00009630902],"about_ca_topic_score_codex":0.0003452723,"about_ca_topic_score_gemma":0.00032878638,"teacher_disagreement_score":0.004846819,"about_ca_system_score_codex":0.00058243686,"about_ca_system_score_gemma":0.0006309297,"threshold_uncertainty_score":0.016214192},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.16059536,0.0034764681,0.00048769746,0.007932786,0.00028860194,0.000057641286,0.0024728046,0.00045177437,0.8242369],"genre_scores_gemma":[0.23624654,0.0013934834,0.00041628454,0.0012759883,0.000033223238,0.000014859995,0.0007936013,0.00022413573,0.7596019],"study_design_codex":"not_applicable","study_design_gemma":"observational","domain_scores_codex":[0.9992804,0.000027247845,0.000013278538,0.00009978117,0.00035673767,0.00022264158],"domain_scores_gemma":[0.9990515,0.00010397123,0.000036550868,0.00007138795,0.00043291776,0.00030360004],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00032747656,0.00027829563,0.00026814442,0.001990614,0.007523972,0.0051442045,0.00080954214,0.0011469907,0.08790694],"category_scores_gemma":[0.0012327108,0.00030966668,0.0002529286,0.0039153816,0.001841672,0.0016439282,0.002003175,0.0017806175,0.008483615],"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.0003902055,0.00014893367,0.026406433,0.00019075249,0.00002536395,0.002347295,0.0053010583,0.0004883184,0.0020730528,0.08175258,0.6206876,0.26018837],"study_design_scores_gemma":[0.00002998104,0.000023503726,0.0424659,0.00014395815,0.000023675466,0.00050457614,0.007895538,0.0010100622,0.0009960023,0.004029205,0.9428132,0.00006436751],"about_ca_topic_score_codex":0.932613,"about_ca_topic_score_gemma":0.98012084,"teacher_disagreement_score":0.08790694,"about_ca_system_score_codex":0.023696078,"about_ca_system_score_gemma":0.021417903,"threshold_uncertainty_score":0.294078},"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":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.055413466,0.02665494,0.09948617,0.038486592,0.03473021,0.0021812005,0.042259496,0.022678439,0.67810947],"genre_scores_gemma":[0.023390595,0.0059751444,0.012824084,0.0006851712,0.0007662512,0.00013416012,0.018378846,0.0015319822,0.93631375],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99888915,0.00011860573,0.000052728585,0.00022197426,0.000514159,0.0002033129],"domain_scores_gemma":[0.99530965,0.0002821018,0.000090467656,0.00049444963,0.0030847394,0.0007386217],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0031271768,0.0017644328,0.0022318857,0.0013421118,0.005434054,0.0063806553,0.0022965611,0.0020001107,0.15582123],"category_scores_gemma":[0.004063953,0.00088219147,0.00070219114,0.002705627,0.0019593122,0.0026698133,0.0017464526,0.001968092,0.09201033],"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.00038692314,0.00009640634,0.0012223067,0.00018023138,0.000027929731,0.00015827046,0.00042191887,0.001316586,0.0013396668,0.0034481334,0.9470087,0.044392902],"study_design_scores_gemma":[0.00011164658,0.00006290339,0.004466825,0.00018379866,0.00005057207,0.0000974752,0.0006788729,0.005407265,0.0019172454,0.0017378863,0.9852439,0.00004157062],"about_ca_topic_score_codex":0.48049167,"about_ca_topic_score_gemma":0.7882452,"teacher_disagreement_score":0.51950836,"about_ca_system_score_codex":0.0108682625,"about_ca_system_score_gemma":0.017913368,"threshold_uncertainty_score":0.9553898},"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":"empirical","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.48595402,0.012987884,0.0324437,0.0018919881,0.00094132643,0.0014144562,0.037823707,0.0062970296,0.4202459],"genre_scores_gemma":[0.5890411,0.0032103981,0.02645592,0.0017923631,0.00012166828,0.0008375686,0.03285331,0.0006608441,0.34502685],"study_design_codex":"bench_or_experimental","study_design_gemma":"not_applicable","domain_scores_codex":[0.9997216,0.000022901697,0.000023995783,0.00012928562,0.0000643157,0.000037856695],"domain_scores_gemma":[0.99985576,0.000023085779,0.000025136304,0.000021790202,0.00003369562,0.000040406176],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002126218,0.0011599389,0.0007857614,0.0009407816,0.0012940863,0.001148384,0.00058004167,0.00046607904,0.032248896],"category_scores_gemma":[0.0002281218,0.00039930368,0.00061240455,0.0007752621,0.00024740995,0.001290319,0.0013034442,0.0015628464,0.020428069],"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.0008832921,0.00060205336,0.0068601426,0.001141279,0.00009292741,0.0028921086,0.0011216842,0.00055403326,0.77413756,0.0037313174,0.010206577,0.19777703],"study_design_scores_gemma":[0.00014797345,0.0014491715,0.11420072,0.0002630782,0.00018925875,0.004839974,0.0017164869,0.0012672197,0.06552623,0.0032143013,0.8070622,0.00012333048],"about_ca_topic_score_codex":0.0036629534,"about_ca_topic_score_gemma":0.0052818446,"teacher_disagreement_score":0.032248896,"about_ca_system_score_codex":0.0007394711,"about_ca_system_score_gemma":0.00050622923,"threshold_uncertainty_score":0.107883275},"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":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0002713317,0.010075933,0.0023968744,0.0072204093,0.012972108,0.00009971698,0.0067742066,0.002466907,0.95772237],"genre_scores_gemma":[0.0018258754,0.004999569,0.001378857,0.003124497,0.0028058565,0.00010499753,0.0041685076,0.0016098071,0.97998214],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9985537,0.00020769013,0.00010225464,0.0002907754,0.0007447749,0.000100808065],"domain_scores_gemma":[0.99679464,0.00075912295,0.00017512265,0.00046600297,0.0014261621,0.00037891336],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00097038224,0.0013602899,0.0011001659,0.002889088,0.0020441378,0.009130597,0.001767072,0.0016610452,0.59847814],"category_scores_gemma":[0.006317219,0.00069537596,0.0007508454,0.004727732,0.0011169156,0.0055272332,0.0028908497,0.004032457,0.53441656],"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.0000063246084,0.000004736895,0.00002294328,0.00008734733,0.000001007206,0.000014605448,0.000083081635,0.000020595355,0.00006623245,0.006373344,0.9688833,0.024436524],"study_design_scores_gemma":[0.000001040428,0.0000022669753,0.00006364007,0.000092532726,4.8741657e-7,0.00002228406,0.000036834506,0.000011888267,0.00002316935,0.0011814226,0.99856156,0.0000029922362],"about_ca_topic_score_codex":0.003223405,"about_ca_topic_score_gemma":0.0053705634,"teacher_disagreement_score":0.59847814,"about_ca_system_score_codex":0.002477093,"about_ca_system_score_gemma":0.0026866794,"threshold_uncertainty_score":0.5727222},"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":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.005655947,0.017523965,0.0051872646,0.048165053,0.0052918047,0.000073778574,0.0019507065,0.0021303184,0.91402113],"genre_scores_gemma":[0.014189648,0.002642013,0.0013355886,0.0012031979,0.00011655739,0.000014930063,0.00018860945,0.0003071224,0.9800023],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9993795,0.000044143297,0.000012981572,0.00012347751,0.00030003476,0.00013990953],"domain_scores_gemma":[0.9986565,0.00014660732,0.000038883616,0.00006671621,0.0007455697,0.00034564105],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000587555,0.00064991,0.00031491136,0.001069735,0.0073250076,0.003412075,0.00066956354,0.001331939,0.21314186],"category_scores_gemma":[0.0012720162,0.00041976472,0.00017068243,0.0011836117,0.0014038815,0.0016430755,0.0014135555,0.0017033264,0.0519172],"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.00005961511,0.000024076346,0.000718716,0.00007353084,0.0000024477554,0.0002664156,0.0007249431,0.00011862915,0.0006441057,0.024644447,0.8620231,0.11069997],"study_design_scores_gemma":[0.000003017147,0.0000038298426,0.0006185163,0.00003120547,0.0000018491002,0.00012936405,0.00045092378,0.00009431364,0.00022625313,0.0011430571,0.99728954,0.000008122001],"about_ca_topic_score_codex":0.3880548,"about_ca_topic_score_gemma":0.73034966,"teacher_disagreement_score":0.6119452,"about_ca_system_score_codex":0.0068892003,"about_ca_system_score_gemma":0.0069604064,"threshold_uncertainty_score":0.77159214},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0063787745,0.0025770725,0.001002047,0.021191174,0.0030211476,0.00008461518,0.0027604543,0.0004344923,0.9625502],"genre_scores_gemma":[0.017920433,0.00079158414,0.00042983965,0.0022650051,0.00016291659,0.000027430397,0.0008253728,0.00010886368,0.9774686],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9987342,0.00011680459,0.000033921024,0.00024722982,0.00049689505,0.00037093667],"domain_scores_gemma":[0.9978376,0.000091861286,0.00006393008,0.00018591758,0.0012312772,0.0005894811],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00093172607,0.0006130531,0.00041461166,0.0011015964,0.009251941,0.006444727,0.001158468,0.0027145145,0.29023772],"category_scores_gemma":[0.0028551682,0.00033839486,0.00044998198,0.0012662713,0.0019839515,0.0020519402,0.0027136572,0.0024378595,0.087826155],"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.00005940834,0.000032544332,0.0031068462,0.0001190613,0.000011224648,0.00027988388,0.003458525,0.0000799201,0.0007347238,0.05191965,0.86036813,0.079830036],"study_design_scores_gemma":[0.0000019998997,0.000004479685,0.0018626677,0.000041437565,0.0000018159697,0.000040145198,0.0006849517,0.000022651559,0.000084235115,0.000521837,0.9967269,0.0000067700657],"about_ca_topic_score_codex":0.56084746,"about_ca_topic_score_gemma":0.73450273,"teacher_disagreement_score":0.7097623,"about_ca_system_score_codex":0.012004946,"about_ca_system_score_gemma":0.016793039,"threshold_uncertainty_score":0},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.973712,0.0044700406,0.010760414,0.00032379615,0.00018308253,0.00010258488,0.00029403355,0.00016335929,0.009990788],"genre_scores_gemma":[0.9810759,0.0020239658,0.012645313,0.0000812362,0.000014596929,0.00005895159,0.00016160464,0.000029915353,0.0039086174],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99994326,0.0000057620337,0.0000029786154,0.000011798282,0.000022976634,0.000013167433],"domain_scores_gemma":[0.9999819,0.00000394022,0.0000042979786,0.000002403042,0.000004336896,0.0000032365156],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000083744584,0.00025376052,0.00010472597,0.00016502925,0.00017810616,0.00019297916,0.00019627415,0.0003485097,0.0009926624],"category_scores_gemma":[0.0000969092,0.00011893758,0.00018306277,0.00011681526,0.00010685108,0.00019884385,0.00013090903,0.00027985533,0.0003262547],"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.000011489034,0.000012417407,0.000027971426,0.00006825544,0.0000035019327,0.00003928584,0.000024126357,0.00025449955,0.99533445,0.00034087923,0.00013029444,0.0037527378],"study_design_scores_gemma":[0.0000039163397,0.00007772955,0.00045075934,0.00000931825,0.000004326212,0.000057062425,0.000014767796,0.000900102,0.99268603,0.00010078704,0.005689769,0.000005410732],"about_ca_topic_score_codex":0.00042788038,"about_ca_topic_score_gemma":0.0010449005,"teacher_disagreement_score":0.0009926624,"about_ca_system_score_codex":0.0002509699,"about_ca_system_score_gemma":0.00008051583,"threshold_uncertainty_score":0.0033207536},"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":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.38369748,0.00079615443,0.5850705,0.0024868147,0.0003018443,0.00038751622,0.00039690497,0.0015665144,0.0252962],"genre_scores_gemma":[0.9736831,0.00017861028,0.017237099,0.000047612582,0.000060292845,0.00004408482,0.00012955321,0.00010126148,0.008518363],"study_design_codex":"simulation_or_modeling","study_design_gemma":"not_applicable","domain_scores_codex":[0.9988902,0.00032155815,0.000040330637,0.0001894987,0.00033105913,0.00022734622],"domain_scores_gemma":[0.9943298,0.0025530239,0.0007952009,0.0005070261,0.001279024,0.0005358806],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019547802,0.0008295639,0.0011404613,0.0010347669,0.0011394265,0.0021632523,0.0019513413,0.0013616807,0.009945373],"category_scores_gemma":[0.012780931,0.00043022743,0.0004956439,0.0007232591,0.00078641274,0.0034481613,0.0020706493,0.0012240182,0.0007582158],"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.0012251986,0.0002793848,0.012905034,0.00024587338,0.00011782663,0.0009659913,0.00044255482,0.7480767,0.0075822906,0.06519118,0.016610874,0.14635704],"study_design_scores_gemma":[0.000041262738,0.00014215003,0.0016272011,0.000021317312,0.00004604196,0.000107613036,0.00029485676,0.94868255,0.002622523,0.043668315,0.0027277363,0.00001836959],"about_ca_topic_score_codex":0.0018391459,"about_ca_topic_score_gemma":0.0016183648,"teacher_disagreement_score":0.009945373,"about_ca_system_score_codex":0.0011107716,"about_ca_system_score_gemma":0.0012744695,"threshold_uncertainty_score":0.033270538},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7735123,0.0035937093,0.0057614567,0.0836878,0.00057947886,0.0009731563,0.0003431518,0.00024355346,0.13130549],"genre_scores_gemma":[0.9710659,0.0011706961,0.0064704786,0.0037624112,0.000021788834,0.00013207059,0.00021249951,0.000043946533,0.017120339],"study_design_codex":"design_other","study_design_gemma":"qualitative","domain_scores_codex":[0.9810951,0.002944475,0.00035440276,0.0008567199,0.0060113333,0.008738073],"domain_scores_gemma":[0.97006935,0.0020781977,0.0008739236,0.0007779793,0.011089172,0.015111384],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.011917514,0.00047451057,0.00036435673,0.0021027594,0.026194287,0.011110608,0.0034912373,0.001648914,0.0024926472],"category_scores_gemma":[0.014112612,0.0004920067,0.000457329,0.0025417106,0.00815405,0.0024711932,0.009789328,0.004147374,0.0002150064],"study_design_candidate":"qualitative","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.0003837642,0.0008007988,0.10981106,0.0007225244,0.00013414164,0.0016031556,0.30422238,0.005413298,0.0068811476,0.08063604,0.080822796,0.40856892],"study_design_scores_gemma":[0.000046816058,0.00035649675,0.16831376,0.0006823061,0.00007846587,0.00018728369,0.35734192,0.002876931,0.0025700135,0.0049028737,0.4624219,0.00022124012],"about_ca_topic_score_codex":0.99102986,"about_ca_topic_score_gemma":0.9969489,"teacher_disagreement_score":0.254523,"about_ca_system_score_codex":0.254523,"about_ca_system_score_gemma":0.60612637,"threshold_uncertainty_score":0.8646476},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9978618,0.0002971256,0.00037358285,0.000015448337,0.0000058287155,0.000013294154,0.00054860255,0.000011606895,0.0008727728],"genre_scores_gemma":[0.9947089,0.00024666963,0.0012303548,0.00003595971,0.000004037277,0.000024266834,0.0008510316,0.000012754182,0.0028859868],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.9991781,0.00007489851,0.000031799493,0.0003068599,0.00026951934,0.00013872252],"domain_scores_gemma":[0.9969765,0.00073069875,0.0003821323,0.00016623967,0.0015210471,0.00022350013],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010472115,0.00048391084,0.0005932316,0.0011790369,0.0014854486,0.0011857264,0.0005556438,0.00046169295,0.001779716],"category_scores_gemma":[0.0013415419,0.0002951605,0.00060549664,0.001142091,0.0006154223,0.00045385148,0.00041921568,0.0005132452,0.0002502173],"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.00039027515,0.00008209615,0.91044796,0.00019247894,0.00036546396,0.00034903144,0.0018086855,0.001551108,0.06305824,0.00012713991,0.00025054647,0.021376947],"study_design_scores_gemma":[0.000001547828,0.00006757377,0.9972862,0.00000976615,0.000035765803,0.00003893357,0.00036270166,0.00032461216,0.0010192296,0.000009916501,0.0008365944,0.0000071150807],"about_ca_topic_score_codex":0.640793,"about_ca_topic_score_gemma":0.8879185,"teacher_disagreement_score":0.35920697,"about_ca_system_score_codex":0.0048597646,"about_ca_system_score_gemma":0.002483785,"threshold_uncertainty_score":0.7226448},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10042388,0.0028755565,0.69979435,0.0015357025,0.0005647142,0.000098342374,0.00025876527,0.0005168107,0.19393182],"genre_scores_gemma":[0.78817344,0.0026467633,0.12265153,0.0005734501,0.000520619,0.0001651637,0.0003874633,0.00059783715,0.08428372],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9978816,0.0006901804,0.000087550405,0.00038073747,0.00078062306,0.00017933092],"domain_scores_gemma":[0.9961106,0.0018105987,0.00018866078,0.00040254428,0.0011074905,0.0003800016],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0029625092,0.0006907564,0.0008769388,0.0023900385,0.0013639637,0.0032624216,0.00095182436,0.00052827614,0.008974396],"category_scores_gemma":[0.0077839387,0.00036676452,0.0012158355,0.0006741661,0.0038591782,0.002471592,0.0050013284,0.0026489394,0.0011614508],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000021583726,0.000014228728,0.00043399353,0.00008198585,0.000012099962,0.00006925511,0.00033446573,0.0045291204,0.0010756367,0.9814913,0.00088858214,0.011047659],"study_design_scores_gemma":[0.000022323844,0.0000609754,0.0010324179,0.00007696047,0.000011721811,0.00023779468,0.00024828908,0.09349971,0.0026304834,0.8806002,0.021552335,0.000026823202],"about_ca_topic_score_codex":0.0019365656,"about_ca_topic_score_gemma":0.0010851786,"teacher_disagreement_score":0.008974396,"about_ca_system_score_codex":0.0020911202,"about_ca_system_score_gemma":0.0009950125,"threshold_uncertainty_score":0.030022383},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.016307833,0.0014001565,0.0024152307,0.020931745,0.00830867,0.000069466754,0.029410804,0.007455867,0.9137002],"genre_scores_gemma":[0.057779763,0.0012359036,0.0005390234,0.0033890558,0.0007045191,0.00004195731,0.014559595,0.0010395593,0.92071056],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99959236,0.000028937882,0.000009800913,0.00004721289,0.00024661934,0.00007508293],"domain_scores_gemma":[0.9995721,0.000035609915,0.000022608569,0.000046670437,0.00022926429,0.00009371089],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000430886,0.0006735444,0.0004063166,0.000597339,0.0011956556,0.0025093476,0.00058373174,0.0010747781,0.1562514],"category_scores_gemma":[0.0019127959,0.0001779566,0.00043875666,0.0011659386,0.0003600959,0.0014248821,0.0010941629,0.0013909228,0.10103768],"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.000116160154,0.000023772576,0.00052194286,0.000026144622,0.0000044537096,0.00006710888,0.000009430546,0.00024866863,0.00026177443,0.004782723,0.9620333,0.031904634],"study_design_scores_gemma":[0.000032788437,0.000044677105,0.004784899,0.000032767177,0.000004997463,0.00009379305,0.00009798569,0.000937146,0.00071197073,0.0023271625,0.99092346,0.000008401083],"about_ca_topic_score_codex":0.019458126,"about_ca_topic_score_gemma":0.019021774,"teacher_disagreement_score":0.1562514,"about_ca_system_score_codex":0.0013685211,"about_ca_system_score_gemma":0.0012308488,"threshold_uncertainty_score":0.522713},"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":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.042886235,0.028566647,0.061713614,0.062120676,0.0054665087,0.00009497279,0.00015511093,0.00017185908,0.79882437],"genre_scores_gemma":[0.636218,0.017102027,0.024411587,0.011211882,0.0023460146,0.0002578344,0.00020857061,0.00039345663,0.30785066],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99514943,0.0023683722,0.00015495028,0.00084616727,0.0010109589,0.00047011624],"domain_scores_gemma":[0.99653685,0.0015587028,0.00031655256,0.00048067045,0.0007364919,0.0003706446],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0038001013,0.0011516205,0.0005148604,0.0016567176,0.008931739,0.013433973,0.0016452811,0.0048138034,0.020555533],"category_scores_gemma":[0.0051010526,0.0004898249,0.0010870835,0.0013844301,0.024020301,0.011773498,0.005370629,0.009025703,0.003819921],"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.000019610112,0.000017582197,0.0004423738,0.000112407804,0.000008084776,0.00012899103,0.025609741,0.000069898575,0.0003962903,0.96014285,0.004422905,0.008629244],"study_design_scores_gemma":[0.000011645389,0.00005676444,0.0014913713,0.00044632427,0.000020616637,0.000569684,0.024962973,0.00027226435,0.00081794313,0.2022224,0.7690806,0.000047455105],"about_ca_topic_score_codex":0.009799498,"about_ca_topic_score_gemma":0.016756468,"teacher_disagreement_score":0.020555533,"about_ca_system_score_codex":0.0055095977,"about_ca_system_score_gemma":0.005333698,"threshold_uncertainty_score":0.068765104},"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":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.017683893,0.010593254,0.01651306,0.116909385,0.0019359841,0.000029912504,0.00012330033,0.00012557834,0.8360857],"genre_scores_gemma":[0.9173771,0.0026588978,0.0032910858,0.011244559,0.0008391772,0.00005242387,0.000044597127,0.00013053784,0.06436161],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9954283,0.0029169277,0.00006911153,0.0004982383,0.0006688538,0.00041846986],"domain_scores_gemma":[0.9959747,0.0020329673,0.00028608541,0.0007469111,0.00039814712,0.0005611685],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0033675858,0.00048129336,0.0003194575,0.0012442174,0.009760537,0.0131523665,0.0009500793,0.0026805215,0.00811431],"category_scores_gemma":[0.0071491837,0.000254036,0.00031690457,0.00095585163,0.051592384,0.011271148,0.0071467566,0.0067725317,0.0013596204],"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.000004109158,0.000002246854,0.00006127971,0.000010609221,0.0000012391689,0.000027324762,0.008612082,0.000028565022,0.000025634794,0.9820433,0.0070342603,0.0021493952],"study_design_scores_gemma":[0.0000066030448,0.000010440318,0.0001795367,0.00014221552,0.0000036093713,0.0001313362,0.015505615,0.0002488343,0.00011515909,0.628832,0.35481602,0.000008649237],"about_ca_topic_score_codex":0.008250841,"about_ca_topic_score_gemma":0.009126427,"teacher_disagreement_score":0.0131523665,"about_ca_system_score_codex":0.008277714,"about_ca_system_score_gemma":0.0044650068,"threshold_uncertainty_score":0.06005931},"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10393828,0.004605647,0.23607671,0.0070479903,0.0012447722,0.00011071883,0.0008371579,0.0006342441,0.64550453],"genre_scores_gemma":[0.79520005,0.009843153,0.08664306,0.0021165782,0.0024774643,0.0002214932,0.00089187233,0.00060049945,0.10200581],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993513,0.00014937409,0.00003131161,0.00011693106,0.00021325772,0.00013780697],"domain_scores_gemma":[0.9992086,0.0002880132,0.00007528709,0.00012902681,0.00016648987,0.00013254085],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010638407,0.0005782356,0.0004171688,0.0028178685,0.0016477313,0.002837651,0.0005709137,0.0006820991,0.024243815],"category_scores_gemma":[0.00263779,0.00039425018,0.0005638247,0.0018237255,0.0035927847,0.009298549,0.003700807,0.0035160482,0.0034163827],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000022986685,0.0000031583015,0.00007116355,0.000020983929,5.885554e-7,0.000017753158,0.0001735858,0.00014054537,0.00011798571,0.99463356,0.0015768154,0.0032415236],"study_design_scores_gemma":[0.0000041221324,0.00000931744,0.00022919264,0.000040681465,0.0000021088174,0.000121465855,0.00017044436,0.0013237294,0.00026724595,0.9500457,0.04777972,0.0000062692598],"about_ca_topic_score_codex":0.00083198235,"about_ca_topic_score_gemma":0.0009911762,"teacher_disagreement_score":0.024243815,"about_ca_system_score_codex":0.0014025539,"about_ca_system_score_gemma":0.00059933134,"threshold_uncertainty_score":0.08110362},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.22794801,0.0016383252,0.73059094,0.0014652668,0.00013100551,0.0000834879,0.000084462125,0.00019371056,0.03786475],"genre_scores_gemma":[0.96732014,0.0007775229,0.02520257,0.00006698941,0.00014889373,0.000060303206,0.000043318527,0.000037389087,0.006342787],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9996106,0.00013904738,0.00001449356,0.000082164406,0.00009795734,0.00005572463],"domain_scores_gemma":[0.9996928,0.00013111944,0.00006241971,0.000045964436,0.000038204107,0.000029434861],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00064334925,0.00052876334,0.00042770422,0.0005226561,0.0007021366,0.0013599078,0.00037539098,0.00048179596,0.0028075352],"category_scores_gemma":[0.0014045963,0.00018055076,0.00052233087,0.00032718104,0.0022768518,0.0015513084,0.0012404455,0.001234799,0.00032593854],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000040899187,0.000014909304,0.0002536031,0.000047378602,0.000015758886,0.00009920762,0.00018713775,0.04982519,0.0057562287,0.9278458,0.0005011229,0.015412835],"study_design_scores_gemma":[0.000023238017,0.0001868516,0.00060361746,0.000024319277,0.000016639897,0.00014333843,0.00019352099,0.22394648,0.0054204324,0.76373214,0.0056856615,0.000023775752],"about_ca_topic_score_codex":0.00089847465,"about_ca_topic_score_gemma":0.00035107377,"teacher_disagreement_score":0.0028075352,"about_ca_system_score_codex":0.0010072198,"about_ca_system_score_gemma":0.0004749788,"threshold_uncertainty_score":0.009392142},"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":"review","genre_gemma":"review","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"review","genre_consensus":"review","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0011594451,0.9187218,0.00056680874,0.00887804,0.010812702,0.000028053435,0.0009965514,0.0001235529,0.058713038],"genre_scores_gemma":[0.006708768,0.6915167,0.0009803213,0.0026877308,0.0016351377,0.00002299841,0.0013936922,0.00010105578,0.2949536],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9996425,0.000018505038,0.000018006856,0.000052706793,0.00022241831,0.000045914807],"domain_scores_gemma":[0.99927264,0.00005207237,0.000035525925,0.0000137571005,0.00054840033,0.00007755565],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00038726398,0.0010062836,0.00073014735,0.0028510143,0.0018783879,0.0021282579,0.0009956663,0.000490627,0.02081993],"category_scores_gemma":[0.0010261646,0.00040570082,0.00036161658,0.007489309,0.0009930643,0.001283451,0.0006203525,0.0009828765,0.006600328],"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.000017636568,0.000014361751,0.00029438426,0.0011172885,0.0000069193566,0.00007436045,0.0002655798,0.00027488227,0.0003469695,0.0027864901,0.8413297,0.15347153],"study_design_scores_gemma":[8.524091e-7,0.000003376862,0.0011602027,0.00040470206,0.0000033415745,0.000044504428,0.00011355775,0.00001895192,0.000022523913,0.00025049518,0.9979741,0.00000336507],"about_ca_topic_score_codex":0.6157981,"about_ca_topic_score_gemma":0.8132196,"teacher_disagreement_score":0.38420188,"about_ca_system_score_codex":0.010179363,"about_ca_system_score_gemma":0.01851661,"threshold_uncertainty_score":0.7729291},"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.21200621,0.0067499876,0.24770321,0.004040911,0.0013660092,0.000118891585,0.0014012754,0.00074607035,0.5258674],"genre_scores_gemma":[0.89880896,0.0019019246,0.022932949,0.00066265377,0.00089158415,0.00008102594,0.0005217198,0.00017685746,0.0740224],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992465,0.0002068497,0.000036757552,0.00019534238,0.00021563002,0.00009888666],"domain_scores_gemma":[0.99905664,0.00029816077,0.00013184566,0.000099460165,0.00024611983,0.0001676964],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010034507,0.0006712119,0.00040574063,0.0008439879,0.001133838,0.0015877646,0.0004888929,0.00039313405,0.009982434],"category_scores_gemma":[0.0018515899,0.00029684982,0.00056198874,0.00078151166,0.0020482128,0.0035232026,0.0013673062,0.0014805744,0.0028406992],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000802503,0.000021016938,0.0005970749,0.0001394543,0.000007665271,0.0002134226,0.00037656992,0.001032864,0.0031671638,0.9674951,0.0071789795,0.019690532],"study_design_scores_gemma":[0.000012676464,0.00009237742,0.0011678876,0.00003782004,0.000015187665,0.0013288205,0.00016987065,0.0051925895,0.0036127304,0.922797,0.06554351,0.000029382789],"about_ca_topic_score_codex":0.00050750497,"about_ca_topic_score_gemma":0.00037329813,"teacher_disagreement_score":0.009982434,"about_ca_system_score_codex":0.00083934236,"about_ca_system_score_gemma":0.00041246557,"threshold_uncertainty_score":0.033394575},"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":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00170265,0.011169319,0.0015261074,0.009315567,0.003251488,0.000059955568,0.012790077,0.0008558074,0.9593291],"genre_scores_gemma":[0.007034376,0.0055281045,0.0010150189,0.00047431054,0.00043547477,0.00002726136,0.004032793,0.00025637352,0.9811963],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99924374,0.00005552348,0.000033102864,0.00017725641,0.00037251634,0.00011787863],"domain_scores_gemma":[0.99869835,0.00011741107,0.00006972429,0.00012344537,0.00058823393,0.0004027641],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.00041578859,0.00077112636,0.0008254337,0.0020229167,0.003322586,0.0058295717,0.00086665957,0.0013130152,0.5972522],"category_scores_gemma":[0.0014489404,0.00046318493,0.0005152316,0.003559915,0.0009993888,0.0020969254,0.0017584205,0.0013435244,0.2543813],"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.000046606827,0.000019505384,0.00057405065,0.0002403384,0.0000051644756,0.0001314326,0.00029655593,0.00020266912,0.00039694845,0.033958647,0.9039065,0.0602216],"study_design_scores_gemma":[0.0000041994854,0.000005682028,0.0006738846,0.00012556608,0.0000029972755,0.00004239466,0.00016408779,0.00008350818,0.00014090199,0.0025238206,0.99622583,0.0000071111767],"about_ca_topic_score_codex":0.12909141,"about_ca_topic_score_gemma":0.31915632,"teacher_disagreement_score":0.4027478,"about_ca_system_score_codex":0.012145819,"about_ca_system_score_gemma":0.00917553,"threshold_uncertainty_score":0.5744709},"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":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0029670938,0.0127352765,0.0022432785,0.00574913,0.003225417,0.000071143186,0.003983064,0.00081268215,0.9682129],"genre_scores_gemma":[0.00602295,0.0034510405,0.0011947572,0.0005044936,0.00022328581,0.000022477036,0.0013594335,0.00022079011,0.9870007],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99923086,0.00006732475,0.00004390462,0.00026437273,0.00029208107,0.00010146662],"domain_scores_gemma":[0.99924624,0.00010923781,0.000060120547,0.0001374927,0.00026075382,0.00018617667],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00058918126,0.0012228662,0.0007811926,0.0018826427,0.00167679,0.0049853176,0.0012786838,0.0017829855,0.6179216],"category_scores_gemma":[0.0014495392,0.00043005502,0.000542553,0.0017386209,0.00065959577,0.0028669324,0.0022880146,0.0018547527,0.30432975],"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.00034388198,0.00009672277,0.0011226046,0.000561611,0.000032423075,0.0009945233,0.0003754908,0.0007441986,0.001823917,0.09908646,0.4582965,0.4365217],"study_design_scores_gemma":[0.000010536525,0.00001603238,0.0005069273,0.00010916312,0.0000040617197,0.00015099766,0.00007941203,0.00009719453,0.00028234377,0.0036640153,0.9950723,0.000007155526],"about_ca_topic_score_codex":0.007285342,"about_ca_topic_score_gemma":0.015350625,"teacher_disagreement_score":0.3820784,"about_ca_system_score_codex":0.002215365,"about_ca_system_score_gemma":0.0017523984,"threshold_uncertainty_score":0},"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":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0029670938,0.0127352765,0.0022432785,0.00574913,0.003225417,0.000071143186,0.003983064,0.00081268215,0.9682129],"genre_scores_gemma":[0.00602295,0.0034510405,0.0011947572,0.0005044936,0.00022328581,0.000022477036,0.0013594335,0.00022079011,0.9870007],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99923086,0.00006732475,0.00004390462,0.00026437273,0.00029208107,0.00010146662],"domain_scores_gemma":[0.99924624,0.00010923781,0.000060120547,0.0001374927,0.00026075382,0.00018617667],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00058918126,0.0012228662,0.0007811926,0.0018826427,0.00167679,0.0049853176,0.0012786838,0.0017829855,0.6179216],"category_scores_gemma":[0.0014495392,0.00043005502,0.000542553,0.0017386209,0.00065959577,0.0028669324,0.0022880146,0.0018547527,0.30432975],"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.00034388198,0.00009672277,0.0011226046,0.000561611,0.000032423075,0.0009945233,0.0003754908,0.0007441986,0.001823917,0.09908646,0.4582965,0.4365217],"study_design_scores_gemma":[0.000010536525,0.00001603238,0.0005069273,0.00010916312,0.0000040617197,0.00015099766,0.00007941203,0.00009719453,0.00028234377,0.0036640153,0.9950723,0.000007155526],"about_ca_topic_score_codex":0.007285342,"about_ca_topic_score_gemma":0.015350625,"teacher_disagreement_score":0.3820784,"about_ca_system_score_codex":0.002215365,"about_ca_system_score_gemma":0.0017523984,"threshold_uncertainty_score":0},"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":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0023355375,0.0032443886,0.013402159,0.03914649,0.033752996,0.00017132511,0.0024820447,0.0013146398,0.9041504],"genre_scores_gemma":[0.015103772,0.0014561458,0.0037112334,0.0033304424,0.0027855723,0.000084960535,0.0012830744,0.0004664911,0.97177833],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9989753,0.00016377136,0.000042184693,0.00023834524,0.0004091146,0.00017144409],"domain_scores_gemma":[0.99843067,0.0001542808,0.00006143788,0.0001941133,0.000872557,0.00028695253],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0010568922,0.00070536963,0.0005189182,0.0006661247,0.0023236023,0.0036054458,0.0009708413,0.00096931594,0.33078152],"category_scores_gemma":[0.003899917,0.0003297897,0.0005056966,0.0006618277,0.0010936919,0.0033261247,0.0019033526,0.0026491727,0.18721783],"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.000059925387,0.0000124443495,0.00015891533,0.00005209144,0.0000036901977,0.000044278677,0.0005263609,0.00004975832,0.00036047213,0.11224263,0.8366412,0.049848292],"study_design_scores_gemma":[0.0000024392398,0.0000052767678,0.0001191585,0.000021886703,0.0000010551634,0.00002915644,0.0000926732,0.000035242105,0.000103908606,0.004803442,0.9947811,0.000004617977],"about_ca_topic_score_codex":0.0049566114,"about_ca_topic_score_gemma":0.006980683,"teacher_disagreement_score":0.6692185,"about_ca_system_score_codex":0.0030105966,"about_ca_system_score_gemma":0.0012633223,"threshold_uncertainty_score":0},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9982534,0.00006703022,0.000056816734,0.000048085185,0.000018982479,0.0010586929,0.00010745131,0.000005464207,0.00038400886],"genre_scores_gemma":[0.9940644,0.00032303223,0.00095683965,0.00020580778,0.00010019458,0.0030767696,0.00036220063,0.000004646738,0.0009060307],"study_design_codex":"nonrandomized_trial","study_design_gemma":"nonrandomized_trial","domain_scores_codex":[0.99857306,0.0007886174,0.000089927154,0.00012127941,0.0001845673,0.00024262186],"domain_scores_gemma":[0.9973017,0.001002304,0.00028058444,0.0002449038,0.00029040696,0.0008800358],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002875235,0.00062524,0.0009680309,0.00052277587,0.00088235957,0.0004889726,0.0006094048,0.0008042687,0.005003433],"category_scores_gemma":[0.0033837415,0.00039788653,0.0010050276,0.00043931897,0.000726884,0.0005567274,0.00053716707,0.0015069462,0.00059675664],"study_design_candidate":"nonrandomized_trial","study_design_consensus":"nonrandomized_trial","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.1892689,0.65903324,0.06905268,0.0007351306,0.00058272755,0.0007060593,0.0026263783,0.0004140603,0.0074636946,0.00015514961,0.0012918288,0.068670176],"study_design_scores_gemma":[0.05232192,0.7677504,0.1749986,0.00006995314,0.00040530213,0.00017406263,0.0012125784,0.00036721994,0.0013286077,0.000079567515,0.0012539659,0.000037910784],"about_ca_topic_score_codex":0.007697519,"about_ca_topic_score_gemma":0.008565495,"teacher_disagreement_score":0.007697519,"about_ca_system_score_codex":0.00071787107,"about_ca_system_score_gemma":0.0020302034,"threshold_uncertainty_score":0.016738117},"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":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000554199,0.0042268382,0.021399785,0.0059725284,0.0028619906,0.00030448605,0.006827307,0.004106092,0.95374686],"genre_scores_gemma":[0.02595216,0.010468515,0.01499391,0.005194986,0.0032048242,0.0008858366,0.018753277,0.0049201953,0.91562647],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.996314,0.00067128445,0.00024348137,0.0009064951,0.001331867,0.0005329149],"domain_scores_gemma":[0.9969272,0.0005664882,0.00016092953,0.0011292575,0.0008841592,0.00033198655],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.0019919332,0.0019449514,0.001727166,0.0030226286,0.0029886388,0.0128705,0.005024987,0.0042596664,0.6753508],"category_scores_gemma":[0.010146127,0.00062228297,0.0016828994,0.0071387966,0.0030768833,0.01308276,0.006212413,0.003931172,0.65685827],"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.00006690231,0.000080474405,0.00033161492,0.0008878372,0.000017403461,0.00013001735,0.0003858206,0.00039217455,0.0004931569,0.16847011,0.6716609,0.1570835],"study_design_scores_gemma":[0.000009416265,0.000008780474,0.00013710893,0.00017677782,0.000005540406,0.000119918135,0.00012759035,0.0001627012,0.00008292737,0.035334285,0.9638231,0.000011973203],"about_ca_topic_score_codex":0.010434239,"about_ca_topic_score_gemma":0.0048804544,"teacher_disagreement_score":0.3246492,"about_ca_system_score_codex":0.005708348,"about_ca_system_score_gemma":0.004356996,"threshold_uncertainty_score":0.46307266},"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":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.14208391,0.025716245,0.37648535,0.042541713,0.0018773307,0.005844063,0.009307675,0.0010424434,0.3951012],"genre_scores_gemma":[0.9213675,0.005151691,0.04453129,0.0032777868,0.0004864105,0.0016356956,0.001188652,0.00025719035,0.02210373],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9921251,0.005065413,0.00019494566,0.0006462215,0.0014102648,0.0005580711],"domain_scores_gemma":[0.9576745,0.035249416,0.0012438808,0.0024111187,0.002658207,0.0007628462],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.012776707,0.0015753988,0.0013735965,0.002635765,0.0007137729,0.0044929744,0.0020184184,0.0028820552,0.035848964],"category_scores_gemma":[0.05722612,0.0007007993,0.0012635135,0.0016210782,0.0013632105,0.005192535,0.0016592985,0.002832298,0.0019857008],"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.004447348,0.0003469635,0.003823765,0.002200239,0.00068022107,0.00042862748,0.00036343158,0.10939765,0.0025279906,0.5372611,0.049651023,0.2888717],"study_design_scores_gemma":[0.0008140821,0.0013407227,0.005184389,0.0012855228,0.001630547,0.0012196492,0.0007256116,0.19478652,0.003871783,0.7267907,0.06221451,0.00013585399],"about_ca_topic_score_codex":0.0033951649,"about_ca_topic_score_gemma":0.0024143725,"teacher_disagreement_score":0.964151,"about_ca_system_score_codex":0.005636628,"about_ca_system_score_gemma":0.006854803,"threshold_uncertainty_score":0.11992675},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05924976,0.0029860616,0.92346466,0.0038320716,0.0007933413,0.000078408324,0.0008530422,0.001755148,0.0069874683],"genre_scores_gemma":[0.6084398,0.0029951036,0.36090484,0.00081855385,0.0016785554,0.00014621999,0.001984722,0.00021048452,0.022821648],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9996729,0.000076806275,0.00002171594,0.00011519151,0.00008031201,0.000033066088],"domain_scores_gemma":[0.9989637,0.00063610054,0.0000698727,0.00012772258,0.00015596248,0.000046512152],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006673733,0.0004214875,0.00038534234,0.00051283784,0.00034129524,0.00091278064,0.00046673324,0.00035831964,0.0075083883],"category_scores_gemma":[0.0030823012,0.00019884802,0.00034943497,0.00074096833,0.0004562426,0.0018091266,0.0006550283,0.0007279758,0.0022390394],"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.0005607615,0.000349569,0.004177404,0.0005029307,0.000091698166,0.00029607673,0.00019866112,0.07702275,0.011356603,0.1006669,0.08417837,0.7205982],"study_design_scores_gemma":[0.00010262069,0.00033100502,0.0025082573,0.00006338717,0.00005802052,0.000773984,0.000070306814,0.72310674,0.02398942,0.19473681,0.054194003,0.000065369364],"about_ca_topic_score_codex":0.0013659131,"about_ca_topic_score_gemma":0.0015947729,"teacher_disagreement_score":0.0075083883,"about_ca_system_score_codex":0.0005364988,"about_ca_system_score_gemma":0.000357796,"threshold_uncertainty_score":0.025118113},"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":"other","genre_gemma":"review","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"review","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00039855036,0.20130655,0.0011881551,0.060636666,0.11250074,0.0001122588,0.0018136651,0.0006428164,0.62140054],"genre_scores_gemma":[0.0024198839,0.06327194,0.00069716247,0.018896926,0.02509802,0.00006318604,0.0012566308,0.00037042465,0.8879258],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9986105,0.0001580942,0.000081652564,0.00022152264,0.0007987652,0.00012939885],"domain_scores_gemma":[0.99694103,0.0005930272,0.00015073137,0.00030319748,0.0015328673,0.0004791595],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010199809,0.00087594916,0.0010885322,0.0043620155,0.0019617735,0.0069666654,0.001666051,0.0031330613,0.28486684],"category_scores_gemma":[0.006068375,0.0003867222,0.00075769104,0.006050337,0.0014361837,0.0039263726,0.0023099368,0.0029437167,0.23539902],"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.0000063717584,0.000004784165,0.000029634155,0.00013660695,0.0000019002874,0.000021514532,0.000030940977,0.000023045122,0.00003762478,0.0034778041,0.9573618,0.038868],"study_design_scores_gemma":[6.9527357e-7,0.0000018166802,0.000052025884,0.00008855625,6.699746e-7,0.000030102348,0.00001623432,0.0000045033817,0.0000071016775,0.00037799642,0.99941885,0.0000014438189],"about_ca_topic_score_codex":0.008980509,"about_ca_topic_score_gemma":0.016149994,"teacher_disagreement_score":0.28486684,"about_ca_system_score_codex":0.0037812467,"about_ca_system_score_gemma":0.0048180036,"threshold_uncertainty_score":0.9529745},"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":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0025816285,0.010894404,0.012058672,0.036709122,0.05152632,0.0002225071,0.00562805,0.0012218591,0.8791574],"genre_scores_gemma":[0.016637327,0.0049118088,0.0041616606,0.005447148,0.007248889,0.00010807396,0.005119809,0.0005149366,0.9558503],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99783605,0.0002923657,0.00014777383,0.00049443945,0.0010261048,0.00020339724],"domain_scores_gemma":[0.9950695,0.00070961495,0.00018712075,0.0011513107,0.0020936888,0.0007888243],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0019900107,0.0005534147,0.000657927,0.0022838656,0.0026682205,0.0064653214,0.0018571279,0.0023648131,0.41334444],"category_scores_gemma":[0.009192721,0.00035853012,0.00086797436,0.0023258254,0.0011345439,0.0053808587,0.0026130055,0.0025586502,0.20836005],"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.00006837764,0.000040624454,0.00038205844,0.00015763489,0.0000127982885,0.00011651723,0.00015628812,0.0001401265,0.00041847676,0.10912424,0.802945,0.08643788],"study_design_scores_gemma":[0.000007476172,0.000009971106,0.00025137153,0.00007552611,0.0000035235141,0.00010235565,0.00009124048,0.00006048159,0.00022455098,0.015429692,0.9837377,0.000005944635],"about_ca_topic_score_codex":0.0020181283,"about_ca_topic_score_gemma":0.0031137797,"teacher_disagreement_score":0.58665556,"about_ca_system_score_codex":0.0029086305,"about_ca_system_score_gemma":0.0028829707,"threshold_uncertainty_score":0},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.94356227,0.0010392788,0.0047297776,0.0022842698,0.00011129717,0.00006330935,0.0021322053,0.00013815353,0.045939475],"genre_scores_gemma":[0.99211264,0.0002626094,0.0002805025,0.00008892696,0.000033807504,0.000017070719,0.0004670085,0.000021255895,0.006716241],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989579,0.0003511465,0.0000399971,0.00018982285,0.00020213168,0.00025904542],"domain_scores_gemma":[0.99387497,0.0037404867,0.0010780623,0.00037912687,0.000625203,0.0003021474],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0036598535,0.00018493175,0.0005337582,0.00091212644,0.00038899205,0.002824064,0.00077132153,0.0013255948,0.008478342],"category_scores_gemma":[0.018201822,0.00023255886,0.0006930029,0.0010694023,0.0006738167,0.0010141665,0.0005542263,0.0020229397,0.00096242985],"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.0044452357,0.00038304413,0.17025106,0.0005498415,0.0007431766,0.002753453,0.0031444547,0.3310014,0.009808824,0.3368085,0.029947668,0.110163346],"study_design_scores_gemma":[0.00023297171,0.0007967826,0.31543982,0.00014155376,0.00024993444,0.0006277856,0.002283929,0.5998556,0.001712233,0.0454877,0.032971594,0.0002000867],"about_ca_topic_score_codex":0.02778741,"about_ca_topic_score_gemma":0.010795963,"teacher_disagreement_score":0.02778741,"about_ca_system_score_codex":0.0032480177,"about_ca_system_score_gemma":0.0008505969,"threshold_uncertainty_score":0.05525136},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.99620444,0.0007398573,0.000031467007,0.0003174217,0.000007835221,0.000007214573,0.0012619044,0.000004311763,0.0014255447],"genre_scores_gemma":[0.99774444,0.0003746538,0.000052432413,0.000030547617,0.0000050958497,0.0000028456718,0.0008421162,0.0000012573145,0.0009466],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.99935216,0.000031963813,0.000018586808,0.00004233403,0.00020632424,0.0003486112],"domain_scores_gemma":[0.9986307,0.000120315926,0.00035298092,0.000055468834,0.00045996622,0.00038049856],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005630895,0.00024064767,0.0003884953,0.00096097664,0.0014658881,0.00070905016,0.0007166707,0.0003368497,0.0020302807],"category_scores_gemma":[0.0025797433,0.000116048075,0.00048280144,0.002222916,0.0009491375,0.00021339665,0.0009364635,0.00062535447,0.00011448403],"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.0008753441,0.00013329028,0.96671784,0.00008662494,0.00016164465,0.00015339933,0.0010053505,0.0039608725,0.0005643492,0.0014850263,0.0018740802,0.022982271],"study_design_scores_gemma":[0.000037916845,0.00007848795,0.995688,0.000024102701,0.000074083895,0.00003419111,0.0010340485,0.00065698917,0.00034887224,0.00010596262,0.0019063589,0.000010950304],"about_ca_topic_score_codex":0.990923,"about_ca_topic_score_gemma":0.99525356,"teacher_disagreement_score":0.023099637,"about_ca_system_score_codex":0.023099637,"about_ca_system_score_gemma":0.021017466,"threshold_uncertainty_score":0.1676004},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010168921,0.00065041654,0.74764395,0.0017755389,0.001649935,0.00024456013,0.008542075,0.03538101,0.19394355],"genre_scores_gemma":[0.25457704,0.00069434446,0.6180427,0.0015907796,0.0009257029,0.0015050682,0.012959976,0.025565231,0.084139146],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994498,0.00010438791,0.000033067976,0.000071855204,0.00025302995,0.00008780825],"domain_scores_gemma":[0.999006,0.00030949424,0.00005994386,0.00022238205,0.00032736777,0.00007485969],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005530672,0.00063933857,0.0009208956,0.001629737,0.0011176495,0.0014611105,0.0013078357,0.0014069913,0.09874284],"category_scores_gemma":[0.0036731823,0.0004033923,0.0008820993,0.0011873326,0.00081738696,0.0017513186,0.0019406712,0.0020665997,0.033275105],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012485984,0.00005847722,0.0002795785,0.0002101815,0.00003107011,0.00014586141,0.00013031301,0.012513403,0.0025801742,0.7647919,0.16534083,0.053793393],"study_design_scores_gemma":[0.0002534748,0.00003121192,0.00027258738,0.000099365876,0.000027595432,0.00025489897,0.00003995421,0.19882531,0.005885364,0.53230774,0.26193243,0.000070039954],"about_ca_topic_score_codex":0.0013951396,"about_ca_topic_score_gemma":0.0011954318,"teacher_disagreement_score":0.09874284,"about_ca_system_score_codex":0.00080854,"about_ca_system_score_gemma":0.0013023391,"threshold_uncertainty_score":0.3303277},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.35363814,0.00042853705,0.48805752,0.003442271,0.00043147654,0.00021267601,0.0006909358,0.0016313397,0.1514671],"genre_scores_gemma":[0.95154,0.00015594384,0.034204297,0.0002993646,0.00010353245,0.00009415651,0.0003097208,0.00030316622,0.012989818],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9983816,0.00030480334,0.00006885642,0.000311595,0.000621257,0.00031175968],"domain_scores_gemma":[0.9966439,0.001446352,0.00028949892,0.0007345416,0.0006319952,0.00025371573],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015093912,0.00050150475,0.0006575653,0.0010910934,0.0015429608,0.0024493134,0.0008274403,0.0006940888,0.016794095],"category_scores_gemma":[0.008692968,0.00031804838,0.0011692407,0.0004920963,0.005048975,0.0049025808,0.003922891,0.0027980662,0.002084328],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000448779,0.000016295466,0.00055504055,0.000046330657,0.000005246445,0.00009870931,0.00015820027,0.0026607516,0.0018761591,0.98822635,0.0016291805,0.0046828375],"study_design_scores_gemma":[0.00003473931,0.000058169408,0.000631666,0.000040101786,0.000010990981,0.00022391375,0.00014593,0.01996141,0.006344165,0.9608771,0.011635441,0.00003626528],"about_ca_topic_score_codex":0.0009546289,"about_ca_topic_score_gemma":0.00068391673,"teacher_disagreement_score":0.016794095,"about_ca_system_score_codex":0.0016197783,"about_ca_system_score_gemma":0.0016111434,"threshold_uncertainty_score":0.05618179},"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.026551392,0.41744214,0.046343505,0.022704806,0.015349854,0.00008422893,0.0025701742,0.00044321426,0.46851063],"genre_scores_gemma":[0.54390395,0.21018018,0.019308383,0.0027918702,0.0072730337,0.00014987391,0.0018379694,0.0003541215,0.21420062],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991984,0.0002095549,0.000048908885,0.00017488959,0.00028808307,0.00008014508],"domain_scores_gemma":[0.99917954,0.0003734994,0.00006622298,0.00008598412,0.00024384887,0.000050921997],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010088515,0.000629674,0.0002806813,0.0020588767,0.0013646758,0.001693846,0.00030602212,0.00052297773,0.009170528],"category_scores_gemma":[0.004035706,0.00029192452,0.00025175983,0.0025012386,0.0039531426,0.0016195924,0.0011207612,0.0012286027,0.0027276431],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00017892399,0.000014192202,0.0009272382,0.0005118933,0.000030265932,0.00012927578,0.0011154923,0.0021654617,0.00064712216,0.7703893,0.08733807,0.1365527],"study_design_scores_gemma":[0.000008681412,0.000024833374,0.0017075463,0.00038543466,0.000014711126,0.00008434707,0.00016007986,0.00070741103,0.000929556,0.09532336,0.90064013,0.000013962473],"about_ca_topic_score_codex":0.015870642,"about_ca_topic_score_gemma":0.018100074,"teacher_disagreement_score":0.015870642,"about_ca_system_score_codex":0.0102624735,"about_ca_system_score_gemma":0.0033261913,"threshold_uncertainty_score":0.07445979},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.37487495,0.00059164077,0.58393145,0.0010789866,0.00014267507,0.00008573687,0.00033043334,0.000275769,0.038688276],"genre_scores_gemma":[0.9619242,0.00024972355,0.030946435,0.00014466792,0.00019502392,0.000062117615,0.00026654318,0.000070998816,0.0061402917],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986387,0.00037149133,0.000044923305,0.00022384926,0.0003951346,0.00032592245],"domain_scores_gemma":[0.9942979,0.0030486255,0.00091049273,0.0005500974,0.0005359562,0.0006568755],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0022487084,0.00067852635,0.0006800149,0.0013385409,0.0010030943,0.0019913502,0.00089001976,0.00050001283,0.0034905192],"category_scores_gemma":[0.0060533057,0.0005093424,0.0009637461,0.0006046428,0.003052009,0.00337612,0.001955815,0.0018665014,0.00044097667],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000029412076,0.000036823272,0.0007609791,0.000025125782,0.000011845151,0.00009820654,0.0001583359,0.0054693962,0.000880526,0.98985493,0.0004330942,0.0022413651],"study_design_scores_gemma":[0.00001499661,0.000027096889,0.00031645052,0.00001555447,0.000010067614,0.0001040324,0.00008545378,0.08691088,0.00081382826,0.91049194,0.0011936397,0.000016062613],"about_ca_topic_score_codex":0.001208518,"about_ca_topic_score_gemma":0.0009760648,"teacher_disagreement_score":0.0034905192,"about_ca_system_score_codex":0.0010756975,"about_ca_system_score_gemma":0.0009437775,"threshold_uncertainty_score":0.011892438},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.34476274,0.0016486825,0.61443835,0.00083979307,0.0001978785,0.00019602523,0.00060924486,0.0007040032,0.036603227],"genre_scores_gemma":[0.69207054,0.0011000002,0.29879266,0.00017775608,0.00020419057,0.00017283067,0.0008119406,0.00012188997,0.0065481155],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992518,0.00015909124,0.00006226758,0.00011550801,0.00031845525,0.000092838614],"domain_scores_gemma":[0.99921477,0.00032879485,0.0000705149,0.00012675156,0.00016776613,0.00009141211],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013748523,0.00039538648,0.0006258696,0.0018129532,0.0008819435,0.0020602853,0.000763181,0.0004807482,0.004064874],"category_scores_gemma":[0.002947949,0.0003410649,0.0005789685,0.0021748513,0.0013917264,0.0043878076,0.0016882288,0.0016403854,0.00074907194],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000032901386,0.000031941745,0.00053172413,0.00006265028,0.000007248535,0.000046075394,0.00026618107,0.004893123,0.0018692749,0.95734954,0.0008032175,0.03410601],"study_design_scores_gemma":[0.000016791251,0.000022723783,0.00039240005,0.000021988484,0.0000055225005,0.00006312861,0.00011270119,0.026437696,0.0036270886,0.96387243,0.005411231,0.000016288443],"about_ca_topic_score_codex":0.00045083917,"about_ca_topic_score_gemma":0.0005962043,"teacher_disagreement_score":0.004064874,"about_ca_system_score_codex":0.0009850299,"about_ca_system_score_gemma":0.00074989296,"threshold_uncertainty_score":0.0135983825},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8296814,0.000993988,0.08764286,0.00076917047,0.00014888102,0.000033941116,0.0005410129,0.0001623901,0.08002644],"genre_scores_gemma":[0.985557,0.00045192687,0.0059176036,0.00009060795,0.00008493989,0.000016208463,0.00031315375,0.000029392257,0.0075391536],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9996345,0.00007613031,0.000018919885,0.00006838179,0.000095865464,0.00010619266],"domain_scores_gemma":[0.99944633,0.00009379405,0.000113692084,0.000047551057,0.000121151046,0.00017754092],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00031323425,0.00027776335,0.0002571969,0.00096377457,0.00096189353,0.001629969,0.0003368261,0.00019266183,0.003699807],"category_scores_gemma":[0.000909464,0.00019930223,0.00035122156,0.0006063637,0.00168104,0.001884598,0.0014350893,0.0006219705,0.0003690791],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000028052142,0.0000057006496,0.0006715086,0.000029295847,0.0000039210304,0.00009362975,0.00027356506,0.0016272871,0.0019403347,0.98834574,0.00093760475,0.0060433904],"study_design_scores_gemma":[0.00002690399,0.00009917479,0.0043591657,0.00004225477,0.000019112495,0.0007019888,0.0009196286,0.017565068,0.0022638822,0.9457967,0.028156923,0.000049065315],"about_ca_topic_score_codex":0.0028921266,"about_ca_topic_score_gemma":0.001853496,"teacher_disagreement_score":0.003699807,"about_ca_system_score_codex":0.0011766125,"about_ca_system_score_gemma":0.00037932687,"threshold_uncertainty_score":0.012377083},"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.22310595,0.005025102,0.29212958,0.004890997,0.000820616,0.00011163404,0.0007799853,0.0006829115,0.47245315],"genre_scores_gemma":[0.90216935,0.002908606,0.05055537,0.00062077335,0.0007638097,0.00008775384,0.00062790216,0.00013745316,0.042128917],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9996873,0.00005375767,0.000015590189,0.00006541744,0.00010852681,0.00006940828],"domain_scores_gemma":[0.9997602,0.0000845021,0.000056831283,0.00002789636,0.00003175893,0.000038831447],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00038693406,0.00047831368,0.00034842634,0.0011289761,0.0013203815,0.0022056154,0.0004862966,0.00049046637,0.0089916345],"category_scores_gemma":[0.0009420728,0.00019758118,0.00042251655,0.0010197739,0.003745542,0.003838585,0.0014726418,0.0017754481,0.0015187532],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000012960978,0.0000048160396,0.000046343263,0.0000125210545,8.187419e-7,0.00002025773,0.00006503638,0.0006009329,0.00018041249,0.99346817,0.0007418798,0.00484583],"study_design_scores_gemma":[0.0000051791963,0.000008039119,0.00007944252,0.0000067453025,0.0000011634963,0.000025697202,0.00004656647,0.0015557044,0.00019503322,0.9922735,0.0057988963,0.0000040422074],"about_ca_topic_score_codex":0.0016395843,"about_ca_topic_score_gemma":0.0015133662,"teacher_disagreement_score":0.0089916345,"about_ca_system_score_codex":0.0010450692,"about_ca_system_score_gemma":0.0005644718,"threshold_uncertainty_score":0.03008002},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.272089,0.0012860422,0.6498571,0.0010731976,0.0005022436,0.000094179166,0.000304954,0.0005987919,0.07419463],"genre_scores_gemma":[0.89191306,0.0017527275,0.084115274,0.00042887664,0.00068084983,0.00007691622,0.00023348795,0.00020080523,0.020597989],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995515,0.000070789894,0.000018757491,0.00008777776,0.00017944234,0.000091730624],"domain_scores_gemma":[0.9996189,0.00012901444,0.00008191504,0.000061153856,0.000051682142,0.00005729968],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00044788118,0.00038110313,0.00025837222,0.00069728243,0.0005288931,0.00088076276,0.00037597655,0.00031178302,0.0037006014],"category_scores_gemma":[0.0015397165,0.00016443145,0.00044904544,0.00048992224,0.0012501624,0.0023329118,0.0011598014,0.0014886212,0.0005197431],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005600054,0.000022602237,0.00029350747,0.000040479103,0.0000044298317,0.00015718836,0.000111608104,0.0042513185,0.009690506,0.9496933,0.0011982895,0.03448073],"study_design_scores_gemma":[0.000049727118,0.00021927874,0.0009482661,0.000035506557,0.000021253172,0.0010703289,0.00013878067,0.04487764,0.025989903,0.8639784,0.062601045,0.00006990933],"about_ca_topic_score_codex":0.00021050098,"about_ca_topic_score_gemma":0.00022921935,"teacher_disagreement_score":0.0037006014,"about_ca_system_score_codex":0.00048410348,"about_ca_system_score_gemma":0.0004179255,"threshold_uncertainty_score":0.0123797655},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11411446,0.0011199656,0.8574849,0.0031671312,0.00016969569,0.00044012754,0.000981534,0.008058036,0.014464151],"genre_scores_gemma":[0.67063,0.00078733737,0.31398875,0.0013348303,0.00024159523,0.0005618993,0.0019819632,0.0007291419,0.009744559],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9953366,0.0008599018,0.0002872892,0.0015857486,0.001147727,0.00078280835],"domain_scores_gemma":[0.9831251,0.011715775,0.0009734199,0.0029188497,0.00092738157,0.00033950157],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020389946,0.0013087048,0.0013622689,0.0006701512,0.001196395,0.0036601229,0.0022205114,0.001444293,0.008192628],"category_scores_gemma":[0.015964987,0.0009684939,0.002016307,0.0010261764,0.0017811559,0.008429562,0.002367563,0.0041919006,0.002172888],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0018375439,0.0006395717,0.0048235958,0.0017945222,0.00028245637,0.0004869504,0.0013405203,0.13443151,0.058809135,0.5429531,0.016264562,0.23633656],"study_design_scores_gemma":[0.0005740787,0.00019342155,0.00061999937,0.00011204164,0.0001656413,0.0004073198,0.0001562039,0.3253334,0.026642537,0.6328121,0.012913156,0.00007015861],"about_ca_topic_score_codex":0.002246854,"about_ca_topic_score_gemma":0.0048200483,"teacher_disagreement_score":0.008192628,"about_ca_system_score_codex":0.0039003505,"about_ca_system_score_gemma":0.003836443,"threshold_uncertainty_score":0.028299153},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.20586261,0.0005802966,0.77579737,0.00052190793,0.00009544543,0.00003813358,0.00007051774,0.00013439327,0.016899232],"genre_scores_gemma":[0.8846235,0.0007160487,0.10486645,0.00008743572,0.00006855915,0.00004399866,0.00013027809,0.00008718184,0.00937658],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9996375,0.00014032828,0.000012622043,0.000041313055,0.00012986739,0.000038332273],"domain_scores_gemma":[0.99861825,0.0006295263,0.00012761488,0.00014981543,0.00024061152,0.00023419177],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001039769,0.0003763443,0.0004675497,0.0015931763,0.00053895795,0.0016107874,0.00067106995,0.00047511255,0.0024871614],"category_scores_gemma":[0.0059863455,0.00027051166,0.00043130285,0.0006037068,0.0017433114,0.0024306145,0.0018487701,0.0015036702,0.00036633015],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000026684109,0.000019791101,0.00057868473,0.000033958004,0.000009392416,0.0000575918,0.00025858305,0.059156924,0.0018873576,0.9266908,0.0005844715,0.010695847],"study_design_scores_gemma":[0.000004805887,0.00002554658,0.00026875874,0.00001873173,0.0000022204813,0.00003313827,0.00008929193,0.5757517,0.00075602595,0.42147627,0.0015600966,0.0000133002395],"about_ca_topic_score_codex":0.0020925137,"about_ca_topic_score_gemma":0.0021290267,"teacher_disagreement_score":0.0024871614,"about_ca_system_score_codex":0.0013521108,"about_ca_system_score_gemma":0.0006461482,"threshold_uncertainty_score":0.0098103285},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.021398809,0.0020305903,0.90940994,0.00054572267,0.00040598738,0.00011962358,0.00045202984,0.0023733373,0.06326395],"genre_scores_gemma":[0.2237102,0.0037185838,0.7214517,0.0001562897,0.00023044435,0.0004711443,0.00060181686,0.0011593058,0.0485005],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99944264,0.00010734259,0.000029018549,0.0000916631,0.00026936916,0.00005990878],"domain_scores_gemma":[0.99963546,0.00010456434,0.00004346292,0.00007759735,0.00011183902,0.000027020116],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00056565483,0.0004962206,0.00056256703,0.0013323696,0.0006854665,0.0016295384,0.00063159305,0.0004553936,0.017271275],"category_scores_gemma":[0.0015877163,0.00041047996,0.00068865495,0.0012160178,0.0010034145,0.001191932,0.001124631,0.0012584997,0.008861173],"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.00017950995,0.00006533635,0.0009713735,0.0005455759,0.00004643077,0.00065886514,0.0009016704,0.015840786,0.02745997,0.33895484,0.010718487,0.60365725],"study_design_scores_gemma":[0.00008744602,0.00023373822,0.0018494438,0.0001980559,0.00007644989,0.0016232028,0.00033824242,0.0697172,0.05832732,0.21234982,0.6550205,0.00017860043],"about_ca_topic_score_codex":0.001470266,"about_ca_topic_score_gemma":0.0014333131,"teacher_disagreement_score":0.017271275,"about_ca_system_score_codex":0.0005193425,"about_ca_system_score_gemma":0.001082044,"threshold_uncertainty_score":0.05777818},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.020860089,0.0019762677,0.9129194,0.003899956,0.00034494503,0.00014653776,0.0006127001,0.0010007736,0.058239285],"genre_scores_gemma":[0.43890905,0.00393997,0.5286401,0.00080430973,0.00077657896,0.00036733368,0.001044258,0.0004957792,0.025022542],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9957581,0.0013516115,0.0003700268,0.00093754026,0.0013486507,0.00023408984],"domain_scores_gemma":[0.9951806,0.0020829116,0.00038368226,0.0011762857,0.001018406,0.00015814311],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0038962788,0.0003266235,0.00057773123,0.0011151481,0.0019143998,0.0075117717,0.0010718743,0.0008783165,0.011842374],"category_scores_gemma":[0.010353802,0.00064604415,0.0006379106,0.0019147906,0.0038168174,0.007964865,0.0015708916,0.0017751795,0.005453954],"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.000041028943,0.000034536257,0.00070461567,0.00012371437,0.000015930837,0.000028913451,0.00029536107,0.0012904416,0.0019356385,0.9310504,0.0047306786,0.059748746],"study_design_scores_gemma":[0.000015535774,0.00004375245,0.00068292575,0.00004699238,0.000024595083,0.00020628473,0.00025765828,0.010493096,0.0074418336,0.9441226,0.03663293,0.000031719188],"about_ca_topic_score_codex":0.001436464,"about_ca_topic_score_gemma":0.001190347,"teacher_disagreement_score":0.011842374,"about_ca_system_score_codex":0.0014580924,"about_ca_system_score_gemma":0.0024340658,"threshold_uncertainty_score":0.039616704},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05323375,0.0034106371,0.865937,0.0017658888,0.00035931368,0.00011150227,0.00041742294,0.0008132451,0.07395126],"genre_scores_gemma":[0.6674812,0.0042010755,0.28119516,0.0006234499,0.00077978603,0.00021440374,0.0009799562,0.00023298024,0.044291954],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994042,0.0001364362,0.000027185315,0.00014305087,0.00021138949,0.00007780649],"domain_scores_gemma":[0.99967444,0.00011452963,0.000035855144,0.00006876147,0.00008462678,0.000021795686],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005917481,0.0002927696,0.00036627692,0.00068048853,0.0007382333,0.0018437823,0.00042798728,0.00029884608,0.006582113],"category_scores_gemma":[0.001415043,0.00017337478,0.00041376808,0.00095465675,0.0013087154,0.0018558989,0.0008767867,0.0014598555,0.0028180173],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000096183256,0.000047943417,0.00091487484,0.00018989532,0.000024608016,0.00009663009,0.00025918658,0.009732507,0.008245827,0.81604934,0.013682488,0.1506605],"study_design_scores_gemma":[0.000019078569,0.00012116401,0.0012394788,0.000064714666,0.000021202322,0.0003495617,0.0002750335,0.11875006,0.013289509,0.8066017,0.059230346,0.000038125363],"about_ca_topic_score_codex":0.001184254,"about_ca_topic_score_gemma":0.0010295102,"teacher_disagreement_score":0.006582113,"about_ca_system_score_codex":0.0007877076,"about_ca_system_score_gemma":0.0008429254,"threshold_uncertainty_score":0.022019327},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06511608,0.0013778444,0.81749076,0.0044907755,0.0007373634,0.00025275323,0.00081678806,0.0014022985,0.108315416],"genre_scores_gemma":[0.49503875,0.0018116906,0.46609023,0.00048072787,0.0005731866,0.00029495158,0.0009746161,0.00043497747,0.034300923],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9970317,0.0006718484,0.0002587894,0.00067547924,0.0011651183,0.0001971227],"domain_scores_gemma":[0.99565756,0.0014033042,0.00039716982,0.0009846203,0.0013774374,0.00017993177],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0035587363,0.00028768065,0.00039365867,0.0008559064,0.0014408812,0.0043156324,0.00068150746,0.0007248655,0.009820263],"category_scores_gemma":[0.00851299,0.00045010747,0.0004797909,0.0008361222,0.0025792955,0.0041250573,0.0013565645,0.0015176205,0.0053716865],"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.00019677865,0.00009544604,0.0025903343,0.00021391433,0.000032691114,0.00017867092,0.0011202645,0.0021045986,0.010420193,0.801876,0.007733678,0.17343739],"study_design_scores_gemma":[0.00005025556,0.0001994672,0.00310865,0.00012478637,0.00006276514,0.0007378911,0.0011028145,0.01814214,0.033715792,0.84447986,0.09819191,0.00008364612],"about_ca_topic_score_codex":0.000889901,"about_ca_topic_score_gemma":0.0011601107,"teacher_disagreement_score":0.009820263,"about_ca_system_score_codex":0.0008934652,"about_ca_system_score_gemma":0.0016066908,"threshold_uncertainty_score":0.032851994},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.024193699,0.0025435588,0.9060985,0.0041867625,0.00061974756,0.0002342444,0.00043322062,0.0011649354,0.060525373],"genre_scores_gemma":[0.30455545,0.0032871566,0.6415596,0.0007393909,0.0005797798,0.0003174507,0.00069032976,0.000510288,0.04776065],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9973386,0.0006704513,0.00021152955,0.00053085695,0.0010281758,0.00022037416],"domain_scores_gemma":[0.9971475,0.00084306067,0.00021091699,0.0007060163,0.0009519139,0.00014063399],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0041764015,0.00042104116,0.0006017668,0.0017249624,0.0022756075,0.005849176,0.0012953941,0.0010717768,0.02199193],"category_scores_gemma":[0.0075625903,0.000532157,0.0008000424,0.0021895273,0.0040172264,0.008992472,0.0019987938,0.0017980087,0.0066961013],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000058745438,0.000030158546,0.00042267726,0.00008164697,0.0000102720605,0.000017854278,0.00021374835,0.0006419552,0.0010899741,0.92266333,0.0044223634,0.07034734],"study_design_scores_gemma":[0.000031293486,0.00008759509,0.00045207827,0.00006211689,0.000023134764,0.00015394748,0.00030176202,0.013012798,0.009528632,0.9184538,0.05784606,0.00004678943],"about_ca_topic_score_codex":0.0014019982,"about_ca_topic_score_gemma":0.0015558766,"teacher_disagreement_score":0.02199193,"about_ca_system_score_codex":0.0016394946,"about_ca_system_score_gemma":0.0020702602,"threshold_uncertainty_score":0.07357037},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10900167,0.0048993845,0.66227573,0.012281701,0.00041579086,0.0001886293,0.0011256344,0.0010986028,0.20871286],"genre_scores_gemma":[0.8162405,0.0026682154,0.12610978,0.00053643953,0.00048388296,0.0000847295,0.0005799384,0.00018019174,0.053116407],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99812466,0.0005297186,0.00009807569,0.00050100836,0.00056131365,0.00018526087],"domain_scores_gemma":[0.99643517,0.0015669538,0.0004767982,0.0005014364,0.000796469,0.0002232216],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018379565,0.00049589056,0.00043383017,0.0018298599,0.0017469225,0.0040159672,0.00072588894,0.00075604767,0.011165095],"category_scores_gemma":[0.0065527977,0.0004190045,0.00054411084,0.0032969757,0.0046711774,0.0091781,0.0016848744,0.0019497195,0.0019509661],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000069195616,0.000030363444,0.0004856581,0.000113395385,0.000010014292,0.000032653916,0.0003884346,0.0032111723,0.0008087107,0.952138,0.0049733547,0.03773892],"study_design_scores_gemma":[0.000034122426,0.000046442532,0.0012030008,0.000048658265,0.000025459332,0.00010421386,0.00032931933,0.021398239,0.0036195465,0.92967725,0.043472696,0.000041123287],"about_ca_topic_score_codex":0.008250381,"about_ca_topic_score_gemma":0.005653785,"teacher_disagreement_score":0.011165095,"about_ca_system_score_codex":0.00395171,"about_ca_system_score_gemma":0.0021147765,"threshold_uncertainty_score":0.037350893},"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":"empirical","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5231646,0.0058613773,0.03679261,0.005205447,0.0005650551,0.00029382642,0.00033346325,0.00018823173,0.42759538],"genre_scores_gemma":[0.8738226,0.002198726,0.018731225,0.0006105637,0.00011752007,0.000100290825,0.00009798459,0.000017729533,0.10430342],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99959296,0.00008848193,0.000029580104,0.000111851106,0.00013401617,0.00004307411],"domain_scores_gemma":[0.9994319,0.0001398003,0.00008528642,0.000023463364,0.00025638405,0.00006305621],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006553056,0.00025482973,0.00013218824,0.0007616763,0.0011415988,0.0017636914,0.00025938542,0.000566027,0.0062927343],"category_scores_gemma":[0.0012100413,0.00019311262,0.00020495687,0.0005157521,0.0021366521,0.0019787475,0.00076475175,0.0006007362,0.0010775847],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00053650833,0.00030379114,0.055312384,0.0009410687,0.00016978885,0.001724439,0.021749105,0.003478569,0.05295037,0.49477258,0.010266379,0.357795],"study_design_scores_gemma":[0.00018021173,0.0011277158,0.16659898,0.0005328322,0.0003242775,0.0023769345,0.0452209,0.0066827,0.100429386,0.20113677,0.4750373,0.00035193143],"about_ca_topic_score_codex":0.008639153,"about_ca_topic_score_gemma":0.009163901,"teacher_disagreement_score":0.008639153,"about_ca_system_score_codex":0.0013553804,"about_ca_system_score_gemma":0.0015987852,"threshold_uncertainty_score":0.021051288},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.014758236,0.0011721252,0.9635638,0.0013314175,0.00014634528,0.00007054317,0.00015525469,0.0005251365,0.018277105],"genre_scores_gemma":[0.36748397,0.002696063,0.60620826,0.00047147155,0.00044741784,0.00023987055,0.0003863709,0.00033770164,0.021728922],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99767584,0.0007310866,0.00017627084,0.00061089545,0.0006609971,0.00014490465],"domain_scores_gemma":[0.99689376,0.0014643028,0.00022607624,0.0006599947,0.0006457853,0.000110081186],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003164303,0.00037449028,0.00051085575,0.0009443505,0.001382114,0.00453255,0.00096195587,0.0009060558,0.010241716],"category_scores_gemma":[0.0077527156,0.0007389259,0.0006034295,0.0013644699,0.004310018,0.007268356,0.0016739937,0.0014451231,0.0035457148],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000037781603,0.000014734109,0.00024704626,0.000092489005,0.000011410551,0.000023543469,0.00021606484,0.001236414,0.0015028635,0.9598507,0.0022274507,0.034539476],"study_design_scores_gemma":[0.000014451931,0.00004883084,0.0003064697,0.00003778198,0.000019658337,0.00013046243,0.00013605373,0.011852669,0.006407868,0.9598082,0.021211825,0.000025711095],"about_ca_topic_score_codex":0.00094169815,"about_ca_topic_score_gemma":0.00088463665,"teacher_disagreement_score":0.010241716,"about_ca_system_score_codex":0.001061453,"about_ca_system_score_gemma":0.0013115678,"threshold_uncertainty_score":0.034261942},"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":"other","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08065842,0.012626519,0.25362614,0.011305435,0.0018214206,0.00019154401,0.0004873591,0.00044707488,0.63883615],"genre_scores_gemma":[0.6516375,0.0067542177,0.12980618,0.0018691459,0.0011839813,0.00023219683,0.00038011212,0.0001702296,0.20796631],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99884546,0.00039174722,0.00007949042,0.0002222416,0.0003829626,0.000078060875],"domain_scores_gemma":[0.9983777,0.000666011,0.0001278031,0.00014001262,0.00059129886,0.00009712905],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015791788,0.0004591052,0.00033202104,0.001398314,0.0014722609,0.0031602222,0.00041572753,0.00067817175,0.01179042],"category_scores_gemma":[0.0023200226,0.00031004718,0.0005127665,0.0010646522,0.005097944,0.0053924005,0.0011245415,0.001732181,0.0024833572],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000032419535,0.000016874365,0.00035838928,0.00009064975,0.000014185905,0.00003572378,0.0007840778,0.00056295755,0.0011268168,0.96479803,0.003250357,0.028929422],"study_design_scores_gemma":[0.000022349146,0.00005024555,0.0010501781,0.00005767733,0.000019402762,0.00012968802,0.0007879044,0.0021808322,0.0046859295,0.88615936,0.104830116,0.000026277283],"about_ca_topic_score_codex":0.0034515793,"about_ca_topic_score_gemma":0.0020892096,"teacher_disagreement_score":0.01179042,"about_ca_system_score_codex":0.002777933,"about_ca_system_score_gemma":0.0018758676,"threshold_uncertainty_score":0.039442897},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4162502,0.00707987,0.25464767,0.0051097646,0.0009955213,0.00017795888,0.0009531818,0.0018180079,0.31296778],"genre_scores_gemma":[0.92200947,0.0025528641,0.024312338,0.00063006155,0.0004871697,0.00008422865,0.0005260695,0.00029073312,0.049107235],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993345,0.00012512914,0.00003557722,0.00012692293,0.00018076392,0.00019710054],"domain_scores_gemma":[0.9990721,0.000298998,0.00011891719,0.0002850744,0.00008544121,0.0001396238],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005144221,0.00071226305,0.0009077404,0.0016309711,0.0022238959,0.0025502283,0.0010162091,0.0008624283,0.010096775],"category_scores_gemma":[0.0023184393,0.00043147683,0.0010417888,0.0019530281,0.0038959733,0.006463891,0.003569298,0.0020373536,0.001933419],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000030427664,0.000013216638,0.00019792984,0.000037462516,0.0000071174704,0.000085138716,0.00016414266,0.0017011976,0.0004336068,0.9876002,0.00265597,0.007073632],"study_design_scores_gemma":[0.000006598888,0.000008864122,0.00013439506,0.000013292899,0.0000058375995,0.00009621109,0.000054291766,0.0028551177,0.00023045269,0.9904146,0.0061711962,0.000009156199],"about_ca_topic_score_codex":0.0019963498,"about_ca_topic_score_gemma":0.002985811,"teacher_disagreement_score":0.010096775,"about_ca_system_score_codex":0.0016840245,"about_ca_system_score_gemma":0.0005391655,"threshold_uncertainty_score":0.033777118},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.02372897,0.00029338355,0.9646233,0.0002917516,0.000068929956,0.00007436704,0.00017101377,0.0005421223,0.010206219],"genre_scores_gemma":[0.4302178,0.00046752274,0.5580365,0.00013805699,0.000095268086,0.00027164677,0.0005065077,0.0001799873,0.010086691],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9997876,0.000059868566,0.000008159229,0.00002255966,0.0000883301,0.000033552173],"domain_scores_gemma":[0.99967444,0.00019697494,0.000028402274,0.000027469368,0.00005669455,0.000016056392],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003458203,0.0005014141,0.0008159403,0.00045361012,0.00039177464,0.00057954603,0.00078511547,0.00052209466,0.0033781917],"category_scores_gemma":[0.001276795,0.00026040457,0.00051560346,0.0006334495,0.00056119193,0.00041261304,0.0009150037,0.00090254,0.00070409087],"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.000093071925,0.0000616277,0.0010742361,0.00035290714,0.00004943385,0.00035827578,0.00017647064,0.83956975,0.0047980105,0.06339484,0.0035035554,0.08656781],"study_design_scores_gemma":[0.00001885874,0.000014152765,0.00006189313,0.000010259882,0.0000044737717,0.000023795683,0.000025023282,0.9863377,0.0006797941,0.010566882,0.0022528337,0.0000043102855],"about_ca_topic_score_codex":0.0042645275,"about_ca_topic_score_gemma":0.006233394,"teacher_disagreement_score":0.0042645275,"about_ca_system_score_codex":0.00043161114,"about_ca_system_score_gemma":0.0011887703,"threshold_uncertainty_score":0.01130116},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000813738,0.0002854667,0.878079,0.00014157903,0.00021868442,0.00013123099,0.0057862196,0.085497394,0.029046742],"genre_scores_gemma":[0.029715324,0.0011779807,0.7822809,0.00049554557,0.00038207544,0.0012926975,0.026318857,0.0750308,0.083305806],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9986602,0.00019687702,0.00011156465,0.00022294265,0.0006528771,0.00015559127],"domain_scores_gemma":[0.9980854,0.00067668856,0.00007011966,0.00062728,0.00046809367,0.00007254821],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00095616677,0.0027742868,0.0019383101,0.002568508,0.0010729884,0.002793254,0.0034881947,0.0011371364,0.20779896],"category_scores_gemma":[0.0043631503,0.0020493125,0.0029820818,0.0031408183,0.0006918108,0.0041265134,0.0034514416,0.0036349932,0.16497304],"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.00017902664,0.00014009692,0.00032660732,0.00081389403,0.00009045277,0.00020565516,0.00021117179,0.0048856377,0.005821772,0.115786776,0.42707518,0.44446376],"study_design_scores_gemma":[0.00020669395,0.00008066979,0.000444333,0.000256159,0.00008760882,0.0007476837,0.00008332726,0.04050896,0.017564971,0.28042856,0.6594635,0.00012758636],"about_ca_topic_score_codex":0.0007381432,"about_ca_topic_score_gemma":0.0014502455,"teacher_disagreement_score":0.20779896,"about_ca_system_score_codex":0.0007007725,"about_ca_system_score_gemma":0.000993671,"threshold_uncertainty_score":0.69515675},"labels":[],"label_agreement":null}]}