{"meta":{"query_hash":"86f574330bbb","filters":{"venue":"Journal of Symbolic Computation"},"cohort_total":118,"direct_labels_cover":0,"predictions_cover":118,"exported":118,"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/86f574330bbb","api":"https://metacan.xera.ac/api/v1/cohort?venue=Journal+of+Symbolic+Computation"},"results":[{"id":"W151084626","doi":"10.1016/j.jsc.2015.11.020","title":"Reducing complexes in multidimensional persistent homology theory","year":2016,"lang":"en","type":"article","venue":"Journal of Symbolic Computation","topic":"Topological and Geometric Data Analysis","field":"Computer Science","cited_by":21,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Sherbrooke; Bishop's University","funders":"Natural Sciences and Engineering Research Council of Canada; Gruppo Nazionale per le Strutture Algebriche, Geometriche e le loro Applicazioni; Istituto Nazionale di Alta Matematica \"Francesco Severi\"","keywords":"Mathematics; Persistent homology; Homology (biology); Algebra over a field; Pure mathematics; Combinatorics; Discrete mathematics; Algorithm","score_opus":0.020010497799121407,"score_gpt":0.26529078868414807,"score_spread":0.24528029088502667,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W151084626","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.48061633,0.00025788843,0.51675135,0.002066276,0.00019182662,0.000025804064,0.0000012534899,0.0000096646245,0.00007958536],"genre_scores_gemma":[0.9777695,0.000031536863,0.021952394,0.00012143068,0.00006759846,5.6221774e-7,8.1155554e-7,0.000002243718,0.000053941494],"study_design_codex":"design_other","study_design_gemma":"observational","domain_scores_codex":[0.9987776,0.00020143196,0.00044854774,0.00015708925,0.00025708645,0.00015819461],"domain_scores_gemma":[0.99875534,0.0005970779,0.00029462212,0.00011588204,0.00016425193,0.00007282027],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008237395,0.00007860667,0.00023993735,0.0005886906,0.000047348756,0.000024082567,0.00033391616,0.00003984783,0.00003806635],"category_scores_gemma":[0.00023100319,0.000045599612,0.00014579098,0.00060565694,0.000059328264,0.00034547097,0.00011739698,0.00009496113,0.000018117391],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009142553,0.00053205696,0.005729152,0.000011628893,0.00020517984,0.00021170574,0.0015617338,0.01745985,0.009656413,0.1379075,0.0015726087,0.8250607],"study_design_scores_gemma":[0.00548377,0.0017514754,0.6687589,0.00040654987,0.00012556123,0.002164435,0.000656023,0.08311403,0.0013331928,0.23267627,0.0028109376,0.00071884674],"about_ca_topic_score_codex":0.000019985264,"about_ca_topic_score_gemma":0.0000018187312,"teacher_disagreement_score":0.8243419,"about_ca_system_score_codex":0.000071698865,"about_ca_system_score_gemma":0.000055678174,"threshold_uncertainty_score":0.18594982},"labels":[],"label_agreement":null},{"id":"W1539820931","doi":"10.1016/j.jsc.2016.12.004","title":"Numerical algorithms for detecting embedded components","year":2017,"lang":"en","type":"preprint","venue":"Journal of Symbolic Computation","topic":"Polynomial and algebraic computation","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"National Science Foundation","keywords":"Algorithm; Computer science","score_opus":0.052945971012643804,"score_gpt":0.3257271769855561,"score_spread":0.2727812059729123,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1539820931","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08175502,0.00024689446,0.9117697,0.0009151698,0.0047824685,0.00035528673,0.0000054693983,0.00007026044,0.000099743476],"genre_scores_gemma":[0.8380583,0.000013087119,0.16043743,0.00008370404,0.0013385142,0.000010973487,0.000014082767,0.000021669717,0.000022257387],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99748933,0.00012773067,0.0010550834,0.00041727276,0.00058638543,0.00032422034],"domain_scores_gemma":[0.9955142,0.00038289675,0.002763311,0.00040200094,0.0007452723,0.00019230961],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0008757894,0.00031362684,0.0007248766,0.00039481104,0.00033637838,0.0007188509,0.0015320072,0.00021040768,0.0000016106933],"category_scores_gemma":[0.00026265482,0.00029863993,0.0004710489,0.00011801322,0.00003939963,0.00052299147,0.0005633907,0.00064772874,0.000006873765],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006570421,0.00019139852,0.00007800854,0.00021190061,0.00023804308,0.000038651815,0.0022699414,0.11724144,0.0006132169,0.00078085664,0.00091677206,0.8773541],"study_design_scores_gemma":[0.0010716283,0.00021550684,0.004579302,0.0003581634,0.000052064122,0.00016968383,0.000018265851,0.9211845,0.00057097187,0.071105726,0.0003472278,0.0003270014],"about_ca_topic_score_codex":0.000033845645,"about_ca_topic_score_gemma":8.639008e-7,"teacher_disagreement_score":0.87702703,"about_ca_system_score_codex":0.00018116392,"about_ca_system_score_gemma":0.0004005972,"threshold_uncertainty_score":0.9999466},"labels":[],"label_agreement":null},{"id":"W1747269603","doi":"10.1016/j.jsc.2015.05.004","title":"Propagating weights of tori along free resolutions","year":2015,"lang":"en","type":"article","venue":"Journal of Symbolic Computation","topic":"Commutative Algebra and Its Applications","field":"Mathematics","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":"Queen's University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Torus; Mathematics; Resolution (logic); Equivariant map; Action (physics); Ring (chemistry); Polynomial; Polynomial ring; Pure mathematics; Geometry; Topology (electrical circuits); Combinatorics; Mathematical analysis; Computer science; Artificial intelligence","score_opus":0.09825314252495476,"score_gpt":0.356777269611685,"score_spread":0.2585241270867302,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1747269603","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.87540185,0.00020141636,0.12118619,0.0007645058,0.00016707262,0.00017137754,0.000004865853,0.000019708408,0.0020830366],"genre_scores_gemma":[0.9391976,0.000005291942,0.060514722,0.000014360761,0.00021111887,0.0000033539968,0.0000019903625,0.000011948124,0.00003960365],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99861455,0.000100293415,0.00072223874,0.00007415245,0.00038148466,0.00010727481],"domain_scores_gemma":[0.9974907,0.0004145446,0.00083777984,0.00018003385,0.00097504625,0.000101894664],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006485131,0.00008789749,0.0002579597,0.00017570899,0.00007404216,0.00001980962,0.0002192642,0.000039716484,0.000008433958],"category_scores_gemma":[0.00078697724,0.00007355306,0.00009183969,0.00030148914,0.000048442143,0.00020583061,0.000059763817,0.00015981431,0.0000042550687],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00015081002,0.0013153547,0.010803076,0.00027696724,0.00045772997,0.000020271358,0.02867969,0.0025629112,0.005508188,0.87023443,0.047554657,0.032435905],"study_design_scores_gemma":[0.0011812251,0.00027779295,0.01200405,0.00017414236,0.000106436346,0.00011378426,0.0013587555,0.0049268473,0.0018291243,0.97731507,0.0005852094,0.0001275536],"about_ca_topic_score_codex":0.000021225975,"about_ca_topic_score_gemma":0.000013374026,"teacher_disagreement_score":0.10708064,"about_ca_system_score_codex":0.00008444243,"about_ca_system_score_gemma":0.00018286503,"threshold_uncertainty_score":0.29994068},"labels":[],"label_agreement":null},{"id":"W1797947531","doi":"10.1016/j.jsc.2015.08.009","title":"Liouville integrability: An effective Morales–Ramis–Simó theorem","year":2015,"lang":"en","type":"article","venue":"Journal of Symbolic Computation","topic":"Nonlinear Waves and Solitons","field":"Physics and Astronomy","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":"Dawson College","funders":"","keywords":"Mathematics; Meromorphic function; Abelian group; Hamiltonian (control theory); Hamiltonian system; Lie algebra; Pure mathematics; Order (exchange); Algebra over a field; Mathematical analysis; Mathematical optimization","score_opus":0.018397224554194277,"score_gpt":0.30702919134481155,"score_spread":0.28863196679061726,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1797947531","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.95287025,0.000039761606,0.040663265,0.00015524896,0.00035328584,0.00013157702,0.000007560985,0.00001088262,0.005768196],"genre_scores_gemma":[0.99633586,6.8834834e-7,0.0025055544,0.0000308993,0.0010409595,0.0000015888473,0.000013847738,0.000012427459,0.000058170146],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99908596,0.00015542083,0.00031824116,0.00010165116,0.00020750426,0.00013121236],"domain_scores_gemma":[0.998962,0.000090891604,0.000257747,0.0000994738,0.0003992059,0.00019068382],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005012269,0.0001077049,0.00023902654,0.00009116561,0.000049551567,0.000063097614,0.00011557668,0.000029184064,0.000051033086],"category_scores_gemma":[0.000023181068,0.00008409103,0.00012212245,0.00013720998,0.000046425946,0.000264418,0.000024015078,0.0002131831,0.000021037638],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003668104,0.0017820869,0.060314033,0.000035710484,0.0004527352,0.000019477466,0.016178269,0.023414677,0.0011730697,0.06867339,0.0034410693,0.82414865],"study_design_scores_gemma":[0.005788543,0.00282116,0.08884784,0.00023014907,0.0002583488,0.0000927444,0.014630778,0.15371005,0.003051795,0.7218299,0.007968504,0.000770174],"about_ca_topic_score_codex":0.00006860813,"about_ca_topic_score_gemma":0.0000018103763,"teacher_disagreement_score":0.8233785,"about_ca_system_score_codex":0.000052858457,"about_ca_system_score_gemma":0.00010204394,"threshold_uncertainty_score":0.34291327},"labels":[],"label_agreement":null},{"id":"W1835740169","doi":"10.1016/j.jsc.2010.10.001","title":"Bruno Buchberger and the world of Gröbner bases","year":2010,"lang":"fr","type":"article","venue":"Journal of Symbolic Computation","topic":"Cancer Treatment and Pharmacology","field":"Medicine","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":"Wilfrid Laurier University","funders":"","keywords":"Mathematics; Algebra over a field; Pure mathematics","score_opus":0.010168701182477277,"score_gpt":0.3259391925822616,"score_spread":0.31577049139978436,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1835740169","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9523962,0.0149295805,0.00034258925,0.023068158,0.0063354056,0.0002070942,0.0000055973005,0.0000036284448,0.0027117415],"genre_scores_gemma":[0.99107796,0.00092245755,0.0006775745,0.00056859694,0.0025027636,0.0000016511615,0.0000022627719,0.000010777227,0.0042359517],"study_design_codex":"design_other","study_design_gemma":"observational","domain_scores_codex":[0.99894696,0.0001287551,0.00050491956,0.000074480056,0.00020434105,0.00014056465],"domain_scores_gemma":[0.99824953,0.00079053984,0.00051733386,0.000064984604,0.00027332339,0.00010431704],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00059895194,0.00010948148,0.00040141746,0.00018545582,0.000050819806,0.00001534278,0.00005791437,0.000058714635,0.00076577516],"category_scores_gemma":[0.000072440096,0.00006951163,0.00013922525,0.00020983344,0.0003541842,0.000102116726,0.000020616,0.00040700028,0.0000074740083],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0066596786,0.0021273317,0.06278223,0.0007672162,0.002744727,0.0002662569,0.010704241,0.0018794107,0.045512922,0.027258066,0.115831755,0.72346616],"study_design_scores_gemma":[0.059250455,0.0025818762,0.6003757,0.0017823216,0.008009382,0.004303304,0.0009210724,0.026372418,0.012962727,0.015197822,0.26774675,0.0004961395],"about_ca_topic_score_codex":0.00015526162,"about_ca_topic_score_gemma":0.00014700927,"teacher_disagreement_score":0.72297,"about_ca_system_score_codex":0.00003564783,"about_ca_system_score_gemma":0.00018560297,"threshold_uncertainty_score":0.8384701},"labels":[],"label_agreement":null},{"id":"W1875131895","doi":"10.1016/j.jsc.2011.08.010","title":"When does <mml:math xmlns:mml=\"http://www.w3.org/1998/Math/MathML\" altimg=\"si1.gif\" display=\"inline\" overflow=\"scroll\"><mml:mrow><mml:mo>〈</mml:mo><mml:mi>T</mml:mi><mml:mo>〉</mml:mo></mml:mrow></mml:math> equal <mml:math xmlns:mml=\"http://www.w3.org/1998/Math/MathML\" altimg=\"si2.gif\" display=\"inline\" overflow=\"scroll\"><mml:mstyle mathvariant=\"normal\"><mml:mi>sat</mml:mi></mml:mstyle><mml:mrow><mml:mo>(</mml:mo><mml:mi>T</mml:mi><mml:mo>)</mml:mo></mml:mrow></mml:math>?","year":2011,"lang":"lv","type":"article","venue":"Journal of Symbolic Computation","topic":"Polynomial and algebraic computation","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"","keywords":"Ideal (ethics); Mathematics; Algorithm; Gröbner basis; Univariate; Discrete mathematics; Multivariate statistics; Statistics; Law","score_opus":0.018675859307230633,"score_gpt":0.24020042370704187,"score_spread":0.22152456439981122,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1875131895","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.91877264,0.002604091,0.014673071,0.0017092533,0.009399849,0.00024287346,0.00089464337,0.000884256,0.050819345],"genre_scores_gemma":[0.96890706,0.0022328724,0.011313818,0.0038227658,0.008136224,0.0014287907,0.0019214192,0.0018559542,0.000381126],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.97274625,0.0015440637,0.0069816196,0.0048828158,0.0076622358,0.0061830007],"domain_scores_gemma":[0.9781124,0.0042178063,0.008978988,0.0040756045,0.0010746795,0.0035405266],"candidate_categories":["metaepi_narrow","sts","scholarly_communication","open_science","research_integrity","insufficient_payload"],"consensus_categories":["metaepi_narrow","sts","research_integrity","insufficient_payload"],"category_scores_codex":[0.0066477046,0.0031042409,0.001543635,0.002101039,0.004863644,0.005674715,0.006932596,0.005430877,0.022965519],"category_scores_gemma":[0.0032913946,0.0050004288,0.0054971115,0.0033986655,0.0035574546,0.0067543113,0.0059986226,0.0055905613,0.0054815975],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.004248302,0.0016514704,0.000042346182,0.0023830135,0.0043282458,0.0035918178,0.008416789,0.013308658,0.004582979,0.88013464,0.06571488,0.011596863],"study_design_scores_gemma":[0.0059762965,0.005085438,0.00042645904,0.0037339055,0.003797125,0.0071174563,0.0032820564,0.6532532,0.30426395,0.0045488765,0.004179708,0.0043355487],"about_ca_topic_score_codex":0.0047289194,"about_ca_topic_score_gemma":0.0017462292,"teacher_disagreement_score":0.87558573,"about_ca_system_score_codex":0.00014139805,"about_ca_system_score_gemma":0.005172685,"threshold_uncertainty_score":0.99915427},"labels":[],"label_agreement":null},{"id":"W1941702124","doi":"10.1016/j.jsc.2015.11.005","title":"Faster sparse multivariate polynomial interpolation of straight-line programs","year":2015,"lang":"en","type":"article","venue":"Journal of Symbolic Computation","topic":"Polynomial and algebraic computation","field":"Computer Science","cited_by":31,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"National Science Foundation of Sri Lanka; Natural Sciences and Engineering Research Council of Canada; National Science Foundation","keywords":"Mathematics; Interpolation (computer graphics); Polynomial; Function (biology); Polynomial interpolation; Field (mathematics); Representation (politics); Multivariate statistics; Finite field; Applied mathematics; Degree (music); Line (geometry); Birkhoff interpolation; Algorithm; Mathematical optimization; Discrete mathematics; Algebra over a field; Linear interpolation; Pure mathematics; Mathematical analysis; Geometry; Computer science; Statistics; Artificial intelligence","score_opus":0.046147414931284,"score_gpt":0.28755890546700813,"score_spread":0.24141149053572414,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1941702124","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3887144,0.000053289612,0.60951775,0.00040134555,0.00089012366,0.00011383945,9.1401125e-7,0.000026627478,0.00028168026],"genre_scores_gemma":[0.9459107,0.0000017667389,0.053577233,0.00004794126,0.00041022603,0.0000012166772,0.0000053177537,0.000008713913,0.000036890226],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99815756,0.00012781397,0.0008821534,0.0001683009,0.0004817819,0.00018240802],"domain_scores_gemma":[0.99797595,0.000081172315,0.0010083523,0.00013697438,0.0006153668,0.00018217109],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006279638,0.00014926944,0.00032703235,0.0003312666,0.000036113383,0.00010943606,0.00040381815,0.00006502824,0.000004957592],"category_scores_gemma":[0.000070384536,0.00012694331,0.00013314473,0.00039969437,0.000041687887,0.0009026727,0.00010952507,0.00016839989,0.000009697589],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00028102717,0.00065932155,0.0012821283,0.000045367397,0.00014205264,0.000029086206,0.011124435,0.03009872,0.009363861,0.0043479204,0.0012441188,0.941382],"study_design_scores_gemma":[0.0034967698,0.0014805429,0.016534379,0.00019869415,0.000043441043,0.00023281714,0.00024440524,0.9639815,0.0024234804,0.010501533,0.0005791533,0.0002832576],"about_ca_topic_score_codex":0.000040816136,"about_ca_topic_score_gemma":0.000005523237,"teacher_disagreement_score":0.9410987,"about_ca_system_score_codex":0.000073508585,"about_ca_system_score_gemma":0.00025603696,"threshold_uncertainty_score":0.5176598},"labels":[],"label_agreement":null},{"id":"W1949239131","doi":"10.1016/j.jsc.2015.11.008","title":"Quantifier elimination by cylindrical algebraic decomposition based on regular chains","year":2015,"lang":"en","type":"article","venue":"Journal of Symbolic Computation","topic":"Cancer Treatment and Pharmacology","field":"Medicine","cited_by":54,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"National Natural Science Foundation of China","keywords":"Quantifier elimination; Mathematics; Maple; Algebraic number; Decomposition; Tree (set theory); Algebra over a field; Quantifier (linguistics); Algorithm; Discrete mathematics; Combinatorics; Pure mathematics; Computer science; Mathematical analysis; Artificial intelligence","score_opus":0.0341643223409559,"score_gpt":0.3701513871499987,"score_spread":0.3359870648090428,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1949239131","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.95033526,0.00022338076,0.038297895,0.009486201,0.000613987,0.00020591753,0.0000034837326,0.000020612853,0.0008132385],"genre_scores_gemma":[0.9972821,0.000013900384,0.0011924037,0.00089251704,0.00039215642,0.0000031718605,0.00008059756,0.0000122432275,0.00013095014],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998977,0.00008953016,0.0003389592,0.00010309317,0.00038132744,0.00011006588],"domain_scores_gemma":[0.9990577,0.000091064685,0.00027001544,0.00005790381,0.0003503274,0.00017300612],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00030988595,0.00009885137,0.00023323101,0.00024839872,0.0000369352,0.000016269834,0.000038607195,0.00007071532,0.000031655047],"category_scores_gemma":[0.00004056587,0.00008375417,0.00009600916,0.00017554504,0.000024237694,0.00008828763,0.0000050306644,0.00015777197,0.000016455597],"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.017861249,0.012847506,0.015322353,0.00029383902,0.0010425287,0.000804635,0.006423521,0.07636541,0.10953937,0.0030349062,0.37076283,0.38570186],"study_design_scores_gemma":[0.038759205,0.018212233,0.12814425,0.00056320394,0.0013472597,0.0011370815,0.00041066564,0.76218,0.033333775,0.0027943244,0.012571053,0.0005469849],"about_ca_topic_score_codex":0.0000065681884,"about_ca_topic_score_gemma":9.214281e-7,"teacher_disagreement_score":0.68581456,"about_ca_system_score_codex":0.00028408482,"about_ca_system_score_gemma":0.00017031092,"threshold_uncertainty_score":0.34153956},"labels":[],"label_agreement":null},{"id":"W1964452015","doi":"10.1016/j.jsc.2015.03.001","title":"A simple and fast online power series multiplication and its analysis","year":2015,"lang":"en","type":"article","venue":"Journal of Symbolic Computation","topic":"Coding theory and cryptography","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":"Western University","funders":"Natural Sciences and Engineering Research Council of Canada; Agence Nationale de la Recherche","keywords":"Multiplication (music); Mathematics; Multiplication algorithm; Simple (philosophy); Arithmetic; Field (mathematics); Series (stratigraphy); Constant (computer programming); Power analysis; Algorithm; Computer science; Combinatorics; Pure mathematics; Cryptography","score_opus":0.020161471587159207,"score_gpt":0.2764404523851909,"score_spread":0.2562789807980317,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1964452015","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6880744,0.00028096905,0.31107992,0.00043049955,0.000049703653,0.000031789517,0.0000013469158,0.000014761671,0.000036576694],"genre_scores_gemma":[0.99155146,0.00002768442,0.008299585,0.00006583305,0.000042082604,5.13076e-7,0.0000023525586,0.000002765922,0.000007721301],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993192,0.00006785106,0.00024548394,0.00011438668,0.00017494628,0.00007812332],"domain_scores_gemma":[0.99919933,0.00006225751,0.00023739539,0.000078904086,0.00030466085,0.00011744998],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000385444,0.00007102099,0.00016950748,0.00034982656,0.00005678301,0.000107387554,0.00012860303,0.000027007669,0.0000012489178],"category_scores_gemma":[0.00004842841,0.00006181513,0.000051533356,0.0006240651,0.00002306238,0.00059244025,0.00006617398,0.00007456234,6.7222203e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0006019333,0.0009871286,0.098132424,0.00011890087,0.0024396616,0.00008433811,0.08517985,0.052052308,0.008506099,0.23574045,0.0013200843,0.5148368],"study_design_scores_gemma":[0.0016706933,0.00090255175,0.38215703,0.000039369792,0.0003055054,0.00042201488,0.0018508594,0.5120813,0.00035378878,0.09876828,0.0011201291,0.00032848032],"about_ca_topic_score_codex":0.000003120032,"about_ca_topic_score_gemma":0.000005420907,"teacher_disagreement_score":0.5145083,"about_ca_system_score_codex":0.000012826002,"about_ca_system_score_gemma":0.000028445967,"threshold_uncertainty_score":0.2520748},"labels":[],"label_agreement":null},{"id":"W1964709820","doi":"10.1006/jsco.2000.0386","title":"Generic and Explicit Realization of Smallp-groups","year":2000,"lang":"en","type":"article","venue":"Journal of Symbolic Computation","topic":"Advanced Algebra and Geometry","field":"Mathematics","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":"","keywords":"Mathematics; Realization (probability); Algebra over a field; Pure mathematics; Arithmetic; Statistics","score_opus":0.0304748417338381,"score_gpt":0.30354992961702953,"score_spread":0.27307508788319146,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1964709820","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.84945554,0.00017072407,0.14982589,0.00004752328,0.000048191592,0.00004894166,9.048697e-7,0.000007940068,0.00039432585],"genre_scores_gemma":[0.9910947,0.00018280491,0.008488379,0.0000337953,0.00012675059,5.4076844e-7,0.0000019191064,0.000010191645,0.000060884795],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991996,0.000034569082,0.00044337258,0.000062684856,0.00018385127,0.00007590515],"domain_scores_gemma":[0.99924856,0.00012875453,0.00037455527,0.00005700169,0.00014484517,0.000046290148],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00018423013,0.00007005058,0.00021431697,0.00014351161,0.000030790667,0.000010625268,0.000051495485,0.000037708185,0.00005472253],"category_scores_gemma":[0.00006065565,0.00006101707,0.000045670768,0.00022587062,0.000017402075,0.00015707572,0.000008744732,0.000067496054,0.000001702634],"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.00021692202,0.00050244253,0.004869528,0.00045744417,0.00018797455,0.000025801452,0.006889948,0.018326253,0.0072741024,0.11869152,0.001492856,0.8410652],"study_design_scores_gemma":[0.0014259188,0.00039089294,0.031874593,0.00020179055,0.000109341374,0.00032319388,0.0004525437,0.008242191,0.0016360829,0.95477355,0.00037425754,0.00019567658],"about_ca_topic_score_codex":0.0000011134183,"about_ca_topic_score_gemma":7.469387e-7,"teacher_disagreement_score":0.84086955,"about_ca_system_score_codex":0.000017831073,"about_ca_system_score_gemma":0.000018077004,"threshold_uncertainty_score":0.24882038},"labels":[],"label_agreement":null},{"id":"W1968315351","doi":"10.1006/jsco.2001.0456","title":"Commutative Algebra in the Mizar System","year":2001,"lang":"en","type":"article","venue":"Journal of Symbolic Computation","topic":"Polynomial and algebraic computation","field":"Computer Science","cited_by":39,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Generalization; Mathematics; Algebra over a field; Formal power series; Power series; Commutative property; Algebraic number; Basis (linear algebra); Discrete mathematics; Pure mathematics; Geometry","score_opus":0.015564302864567206,"score_gpt":0.25650667957007073,"score_spread":0.24094237670550353,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1968315351","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.46935582,0.00019820427,0.5270564,0.0020454363,0.00039108755,0.00010926047,2.9543054e-7,0.000026461674,0.0008170664],"genre_scores_gemma":[0.99369663,0.000015539725,0.0057142354,0.00034540988,0.00021169819,0.0000026112236,0.0000011724969,0.0000051631173,0.0000075542052],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983257,0.0003350437,0.00059599103,0.00012691725,0.00043314623,0.0001832096],"domain_scores_gemma":[0.99874353,0.0003977594,0.0004662207,0.00014972,0.00018583047,0.000056907153],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009972849,0.00011731657,0.00023253696,0.00029449112,0.00010335893,0.00017129503,0.0007547817,0.000038747803,0.0000019616266],"category_scores_gemma":[0.000040128463,0.000081341976,0.00009922743,0.00079477864,0.000030065861,0.0006020733,0.000062885316,0.00024124888,0.000017887181],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00014349983,0.0006937239,0.00375512,0.00009856371,0.00013899128,0.0011400757,0.07044483,0.09509101,0.00053722685,0.18891948,0.0042855986,0.63475186],"study_design_scores_gemma":[0.0028584069,0.0006099672,0.15329048,0.00035352586,0.00003551144,0.004757464,0.0048085917,0.77770734,0.00015241247,0.053147387,0.001883898,0.00039498357],"about_ca_topic_score_codex":0.000042924945,"about_ca_topic_score_gemma":0.000007947647,"teacher_disagreement_score":0.68261635,"about_ca_system_score_codex":0.0001113921,"about_ca_system_score_gemma":0.00009846913,"threshold_uncertainty_score":0.33170298},"labels":[],"label_agreement":null},{"id":"W1969341770","doi":"10.1006/jsco.1999.0309","title":"Algorithms for Exponentiation in Finite Fields","year":2000,"lang":"en","type":"article","venue":"Journal of Symbolic Computation","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":89,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Exponentiation; Mathematics; Normal basis; Finite field; Modular exponentiation; Multiplication (music); Division (mathematics); Basis (linear algebra); Polynomial; Polynomial basis; Combinatorics; Element (criminal law); Prime (order theory); Discrete mathematics; Arithmetic; Mathematical analysis; Geometry; Computer science","score_opus":0.01953647114672561,"score_gpt":0.2727223051112659,"score_spread":0.25318583396454025,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1969341770","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.23265405,0.000065846936,0.7663129,0.0004529505,0.00022187662,0.00006305123,3.7017313e-7,0.000012500249,0.00021644276],"genre_scores_gemma":[0.9650514,0.000023364737,0.034628626,0.00013935151,0.00012615103,0.0000027912224,0.0000011878403,0.0000031358427,0.000023967936],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99929106,0.000052864496,0.00032412226,0.00008785182,0.00014121382,0.000102889506],"domain_scores_gemma":[0.99944085,0.00020830234,0.00015058983,0.00007318987,0.00009242625,0.00003463936],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00047482635,0.000058032438,0.00011933693,0.0002429182,0.00004454766,0.00006489635,0.00021700774,0.000037700276,0.000018617546],"category_scores_gemma":[0.000024749907,0.00005536953,0.00009389047,0.00031936434,0.0000088528805,0.0004118713,0.00001124353,0.000088774075,0.000003875929],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000050727096,0.00009838067,0.00032140213,0.000011282195,0.000015423822,0.0000067417286,0.0023011405,0.04473567,0.00009256605,0.008317469,0.00027100975,0.9437782],"study_design_scores_gemma":[0.0017387776,0.00051726855,0.02225335,0.00009911087,0.0000135132195,0.00006029259,0.00007092069,0.7321569,0.0003856062,0.24018231,0.0023425221,0.0001794472],"about_ca_topic_score_codex":0.000002742545,"about_ca_topic_score_gemma":0.000001638489,"teacher_disagreement_score":0.94359875,"about_ca_system_score_codex":0.000017884968,"about_ca_system_score_gemma":0.000028438693,"threshold_uncertainty_score":0.2257904},"labels":[],"label_agreement":null},{"id":"W1970573500","doi":"10.1016/j.jsc.2005.07.002","title":"Toric ideals and graph theory to analyze Hopf bifurcations in mass action systems","year":2005,"lang":"en","type":"article","venue":"Journal of Symbolic Computation","topic":"Protein Structure and Dynamics","field":"Biochemistry, Genetics and Molecular Biology","cited_by":80,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"Deutsche Forschungsgemeinschaft","keywords":"Mathematics; Monomial; Toric variety; Algebraic geometry; Jacobian matrix and determinant; Hopf bifurcation; Polynomial; Convex geometry; Pure mathematics; Regular polygon; Bifurcation; Applied mathematics; Mathematical analysis; Convex set; Geometry; Convex optimization; Nonlinear system","score_opus":0.007298646032066711,"score_gpt":0.2755874443450062,"score_spread":0.2682887983129395,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1970573500","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7774625,0.0008110133,0.22120602,0.00020493542,0.00014357106,0.00009002178,0.0000018838648,0.0000023165603,0.000077771205],"genre_scores_gemma":[0.99589497,0.00015493225,0.0034396774,0.00009117494,0.000366436,0.0000029984087,0.000007710126,0.0000062190284,0.000035875117],"study_design_codex":"bench_or_experimental","study_design_gemma":"observational","domain_scores_codex":[0.9993941,0.000068001165,0.00026764913,0.00009088077,0.0000965603,0.00008276979],"domain_scores_gemma":[0.9995814,0.000017073286,0.00016542751,0.000062382525,0.00011584185,0.00005789898],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00029883586,0.000066733824,0.00011967813,0.00019559178,0.00003171371,0.00002752275,0.000055781096,0.00006289781,0.0000010540527],"category_scores_gemma":[0.000041747775,0.000060223283,0.00003581176,0.00016442816,0.0000116642195,0.000011342182,0.000013743503,0.00006901711,8.979964e-7],"study_design_candidate":"observational","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00029070152,0.00008826172,0.009156562,0.00006688386,0.00015683634,0.0000068146414,0.00085032074,0.3099352,0.51209426,0.0035080782,0.00077458494,0.16307151],"study_design_scores_gemma":[0.007796504,0.0032210518,0.76115906,0.0006082856,0.00043393357,0.0017735701,0.0042883004,0.06611809,0.046181176,0.07261064,0.0339118,0.0018976191],"about_ca_topic_score_codex":0.0000106190755,"about_ca_topic_score_gemma":0.000022035825,"teacher_disagreement_score":0.7520025,"about_ca_system_score_codex":0.000032247364,"about_ca_system_score_gemma":0.00003775738,"threshold_uncertainty_score":0.24558343},"labels":[],"label_agreement":null},{"id":"W1976312168","doi":"10.1006/jsco.1999.0308","title":"Efficient Decomposition of Associative Algebras over Finite Fields","year":2000,"lang":"en","type":"article","venue":"Journal of Symbolic Computation","topic":"Advanced Topics in Algebra","field":"Mathematics","cited_by":21,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University; University of Calgary","funders":"","keywords":"Mathematics; Central simple algebra; Associative property; Simple (philosophy); Finite field; Associative algebra; Isomorphism (crystallography); Polynomial; Commutative property; Division algebra; Set (abstract data type); Algebra representation; Basis (linear algebra); Algebra over a field; Field (mathematics); Pure mathematics; Discrete mathematics; Computer science","score_opus":0.02079291340912201,"score_gpt":0.34234036693196795,"score_spread":0.32154745352284597,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1976312168","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.848031,0.00004669019,0.15032178,0.00013395394,0.00015813707,0.00008135012,0.000002882163,0.000010939784,0.0012132846],"genre_scores_gemma":[0.9704674,0.000013712039,0.029196493,0.00006692973,0.00016076442,8.4810557e-7,0.0000017437997,0.000011427974,0.00008069898],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987358,0.00008485347,0.00061892957,0.00007860478,0.00036904693,0.00011279624],"domain_scores_gemma":[0.9981554,0.0007725651,0.000692467,0.00008035268,0.0002540104,0.0000451646],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003149464,0.00009461477,0.00028139635,0.00012501593,0.00004508206,0.000013062793,0.000101249694,0.00007503516,0.00022207221],"category_scores_gemma":[0.00020962082,0.00008730117,0.00012621247,0.00017249743,0.000028574763,0.00007627967,0.0000144780015,0.00019826677,0.000007255793],"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.00059843506,0.0026373898,0.003576835,0.00041006235,0.0009591918,0.000089965615,0.02958987,0.40499547,0.0027826987,0.1926462,0.003946769,0.3577671],"study_design_scores_gemma":[0.0015414663,0.0003502452,0.01982356,0.00027353712,0.000112035086,0.000048989077,0.00016676064,0.059999324,0.0019632105,0.9154154,0.00011847049,0.00018701001],"about_ca_topic_score_codex":0.0000024166156,"about_ca_topic_score_gemma":0.000001356174,"teacher_disagreement_score":0.7227692,"about_ca_system_score_codex":0.000099633384,"about_ca_system_score_gemma":0.000040612675,"threshold_uncertainty_score":0.35600382},"labels":[],"label_agreement":null},{"id":"W1977375620","doi":"10.1016/j.jsc.2008.11.003","title":"Symbolic–numeric sparse interpolation of multivariate polynomials","year":2008,"lang":"en","type":"article","venue":"Journal of Symbolic Computation","topic":"Numerical Methods and Algorithms","field":"Computer Science","cited_by":75,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Universiteit Antwerpen; Natural Sciences and Engineering Research Council of Canada; Mitacs; Fonds Wetenschappelijk Onderzoek; Institut national de recherche en informatique et en automatique (INRIA)","keywords":"Mathematics; Interpolation (computer graphics); Polynomial; Applied mathematics; Floating point; Eigenvalues and eigenvectors; Polynomial interpolation; Algorithm; Algebra over a field; Pure mathematics; Linear interpolation; Mathematical analysis; Computer science; Image (mathematics)","score_opus":0.03533795481161242,"score_gpt":0.3080761204314586,"score_spread":0.2727381656198462,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1977375620","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.24014297,0.0001287959,0.75854856,0.00024872387,0.00065554085,0.00007287024,7.8406794e-7,0.000019882855,0.00018189568],"genre_scores_gemma":[0.67130274,0.0000316036,0.32839143,0.000066447836,0.00018067268,7.42419e-7,4.985514e-7,0.000007003498,0.000018876988],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9980959,0.00023702538,0.00091109663,0.00016421008,0.00040941418,0.0001823491],"domain_scores_gemma":[0.99797076,0.00027895218,0.0011078281,0.00016663896,0.00034966477,0.00012618053],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005756961,0.0001391081,0.0004742088,0.00032444843,0.00008048991,0.00003599863,0.00042487908,0.000056507546,0.000008482907],"category_scores_gemma":[0.00013625769,0.00011715694,0.00017875235,0.0005915618,0.000060580995,0.000584463,0.0000899682,0.00018217332,0.0000075703224],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009694182,0.0006030783,0.0041058813,0.00005350606,0.00018823022,0.00010459832,0.007996305,0.010946426,0.05622213,0.0079162195,0.0005078954,0.9112588],"study_design_scores_gemma":[0.0020270823,0.0009227308,0.18436173,0.00021176724,0.00004972271,0.0012642196,0.00011725996,0.7808497,0.008659959,0.020339644,0.0007756506,0.0004205619],"about_ca_topic_score_codex":0.000056854075,"about_ca_topic_score_gemma":2.8846802e-7,"teacher_disagreement_score":0.91083825,"about_ca_system_score_codex":0.000043112443,"about_ca_system_score_gemma":0.0001216041,"threshold_uncertainty_score":0.47775215},"labels":[],"label_agreement":null},{"id":"W1977783668","doi":"10.1016/j.jsc.2012.06.005","title":"Special issue on symbolic and algebraic computation: Foundations, algorithmics and applications: ISSAC 2011","year":2012,"lang":"en","type":"article","venue":"Journal of Symbolic Computation","topic":"Computability, Logic, AI Algorithms","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; Theory of computation; Algorithmics; Symbolic computation; Computation; Algebraic number; Algebra over a field; Theoretical computer science; Computer science; Algorithm; Pure mathematics; Mathematical analysis","score_opus":0.01787019344714847,"score_gpt":0.2822707966391717,"score_spread":0.26440060319202324,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1977783668","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.037452847,0.0012228035,0.95474315,0.0022931884,0.0021469628,0.0006231186,0.000005466855,0.000103024824,0.0014094686],"genre_scores_gemma":[0.7170713,0.00051734026,0.25005397,0.0010810333,0.03101892,0.000043451437,0.000026524795,0.000061189305,0.00012625725],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.997347,0.00023267923,0.0009413804,0.0004044139,0.00066796987,0.00040658627],"domain_scores_gemma":[0.99744403,0.00063289073,0.0007268147,0.00028476375,0.0005368905,0.00037460352],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0011238764,0.0003137723,0.0004997567,0.00055058085,0.000342005,0.0003757345,0.0004440223,0.00013054204,0.000034911063],"category_scores_gemma":[0.00007704198,0.0003043939,0.00010811648,0.0005340152,0.0001601336,0.0013339461,0.00024712214,0.00037995272,0.000081688224],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000018452445,0.00040444412,0.0020189364,0.000055979803,0.00007357635,0.0000059744925,0.0025597613,0.0020143748,0.000029682838,0.019838624,0.003960987,0.96901923],"study_design_scores_gemma":[0.004522133,0.0016315449,0.33852234,0.00021678761,0.00024021741,0.0032832494,0.0008783207,0.36903733,0.000208377,0.15913334,0.120619595,0.0017067675],"about_ca_topic_score_codex":0.00001348802,"about_ca_topic_score_gemma":0.0000020337898,"teacher_disagreement_score":0.96731246,"about_ca_system_score_codex":0.00016378173,"about_ca_system_score_gemma":0.00013220731,"threshold_uncertainty_score":0.9999408},"labels":[],"label_agreement":null},{"id":"W1982369376","doi":"10.1016/j.jsc.2011.05.003","title":"Formal enforcement of security policies on concurrent systems","year":2011,"lang":"en","type":"article","venue":"Journal of Symbolic Computation","topic":"Distributed systems and fault tolerance","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":"Université du Québec en Outaouais; Université Laval","funders":"","keywords":"Process calculus; Security policy; Modular design; Enforcement; Process (computing); Programming language; Computer science; Algebra over a field; Mathematics; Theoretical computer science; Computer security; Pure mathematics; Political science","score_opus":0.033208491328713355,"score_gpt":0.26869174774293647,"score_spread":0.23548325641422313,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1982369376","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.35265154,0.00051820895,0.63902223,0.00005147987,0.0016524656,0.00018404351,0.000011409048,0.000022924996,0.005885735],"genre_scores_gemma":[0.9992749,0.0000160304,0.0005619333,0.000034635475,0.00009687539,0.0000018891404,0.0000016530458,0.0000036567294,0.000008397068],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99849445,0.0000671473,0.00072708237,0.000094508774,0.00044601253,0.00017082356],"domain_scores_gemma":[0.99847907,0.000041653635,0.0008574617,0.00013138291,0.00040608094,0.0000843322],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00049744395,0.00010412168,0.0002900029,0.00016351142,0.000051381303,0.000054483236,0.00036067748,0.000039234896,0.000005809219],"category_scores_gemma":[0.000015236683,0.00008348055,0.00010430505,0.00020056643,0.000028169328,0.0004979641,0.000051786992,0.00011554057,0.0000048442557],"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.0000658449,0.00054629124,0.0012496433,0.00026019695,0.000165605,0.00002716213,0.034786783,0.020918403,0.00016071078,0.89647484,0.0034729461,0.041871578],"study_design_scores_gemma":[0.007907257,0.0064583663,0.053468123,0.0034755038,0.00012815872,0.0011521754,0.006176276,0.87315184,0.007829632,0.023822589,0.015192767,0.001237311],"about_ca_topic_score_codex":0.00011414115,"about_ca_topic_score_gemma":0.0000013309807,"teacher_disagreement_score":0.87265223,"about_ca_system_score_codex":0.00005494718,"about_ca_system_score_gemma":0.00007160477,"threshold_uncertainty_score":0.3404238},"labels":[],"label_agreement":null},{"id":"W1985407367","doi":"10.1016/j.jsc.2007.12.002","title":"A bound for the Rosenfeld–Gröbner algorithm","year":2008,"lang":"en","type":"article","venue":"Journal of Symbolic Computation","topic":"Polynomial and algebraic computation","field":"Computer Science","cited_by":13,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"Natural Sciences and Engineering Research Council of Canada; Russian Foundation for Basic Research; National Science Foundation","keywords":"Mathematics; Ideal (ethics); Gröbner basis; Decomposition; Differential (mechanical device); Upper and lower bounds; Algebraic number; Polynomial; Set (abstract data type); Discrete mathematics; Combinatorics; Algorithm; Algebra over a field; Pure mathematics; Mathematical analysis; Computer science","score_opus":0.024194627056162567,"score_gpt":0.2645510586430663,"score_spread":0.2403564315869037,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1985407367","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0525317,0.00038555256,0.943141,0.002517743,0.0011671408,0.00014986841,0.0000011657654,0.000028702892,0.00007715929],"genre_scores_gemma":[0.91830724,0.00004859867,0.08017325,0.0004506704,0.0008890328,0.000005464034,0.0000014561758,0.000008492149,0.00011580009],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989071,0.00004495299,0.00043101396,0.00012656962,0.0003176247,0.00017275105],"domain_scores_gemma":[0.9986151,0.00046877397,0.0003870643,0.00012371343,0.00033138331,0.00007394944],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00039822733,0.00010408967,0.0001834247,0.00013312942,0.00031732602,0.00011453017,0.0004536906,0.000036312565,0.0000024470303],"category_scores_gemma":[0.000052047395,0.00006996605,0.00016702544,0.000288546,0.000051535433,0.00047280922,0.00005847108,0.00013042973,0.000007467885],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000020165266,0.00009795697,0.000070353715,0.000008812148,0.00007773216,0.00002359,0.0028300688,0.012841628,0.00032123004,0.005157795,0.008615344,0.9699353],"study_design_scores_gemma":[0.0011580578,0.0002973309,0.015846943,0.000024703622,0.00002554501,0.0010955572,0.000055227323,0.9418423,0.00043502354,0.029720686,0.0093370825,0.00016151863],"about_ca_topic_score_codex":0.0000124665285,"about_ca_topic_score_gemma":0.000001108436,"teacher_disagreement_score":0.9697738,"about_ca_system_score_codex":0.00004755865,"about_ca_system_score_gemma":0.0002000686,"threshold_uncertainty_score":0.28531328},"labels":[],"label_agreement":null},{"id":"W1985924702","doi":"10.1016/j.jsc.2013.03.004","title":"On the complexity of the generalized MinRank problem","year":2013,"lang":"en","type":"article","venue":"Journal of Symbolic Computation","topic":"Polynomial and algebraic computation","field":"Computer Science","cited_by":50,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"Institut Universitaire de France; Agence Nationale de la Recherche","keywords":"Mathematics; Rank (graph theory); Bounded function; Computational complexity theory; Polynomial; Matrix (chemical analysis); Ideal (ethics); Variety (cybernetics); Discrete mathematics; Representation (politics); Algebraic number; Algebra over a field; Combinatorics; Algorithm; Pure mathematics","score_opus":0.030379033731166363,"score_gpt":0.24297582710149582,"score_spread":0.21259679337032944,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1985924702","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.79190844,0.00004684626,0.19177678,0.014948502,0.0004932842,0.00027136377,6.656947e-7,0.00001474045,0.0005393491],"genre_scores_gemma":[0.9896519,0.000002856498,0.009543744,0.0006412314,0.00011526611,0.0000036573654,3.6736856e-7,0.000004686955,0.000036246594],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985676,0.00021789146,0.0005281632,0.00010650045,0.00044480374,0.00013504647],"domain_scores_gemma":[0.99843276,0.00027022752,0.0007111525,0.0002012599,0.00033409937,0.000050478306],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004102688,0.00010407709,0.00019732052,0.000091146416,0.00013711047,0.00010547293,0.0007709799,0.000030108884,0.000022808543],"category_scores_gemma":[0.000058131427,0.000053259097,0.00016236435,0.00038541263,0.00013171528,0.00029046932,0.00011621454,0.00017536689,0.000016526355],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003428792,0.00034211183,0.0003731811,0.000041316194,0.00013056309,0.0000027275873,0.00449102,0.040507574,0.009175975,0.76666987,0.018260594,0.15997079],"study_design_scores_gemma":[0.0007391523,0.00020272903,0.06841884,0.000104393344,0.000015494514,0.000065987224,0.000044655506,0.23507291,0.0028408295,0.6921653,0.00020941971,0.00012029527],"about_ca_topic_score_codex":0.00006374175,"about_ca_topic_score_gemma":0.000002967516,"teacher_disagreement_score":0.19774348,"about_ca_system_score_codex":0.000038624985,"about_ca_system_score_gemma":0.00009972056,"threshold_uncertainty_score":0.21718429},"labels":[],"label_agreement":null},{"id":"W1991713476","doi":"10.1016/j.jsc.2013.04.004","title":"Rank-profile revealing Gaussian elimination and the CUP matrix decomposition","year":2013,"lang":"en","type":"article","venue":"Journal of Symbolic Computation","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":41,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Gaussian elimination; Mathematics; Matrix (chemical analysis); Block matrix; Rank (graph theory); Algorithm; Matrix decomposition; Gaussian; Inverse; Computation; Transformation (genetics); Matrix multiplication; Transformation matrix; Block (permutation group theory); Algebra over a field; Combinatorics; Pure mathematics; Geometry","score_opus":0.006337541460843982,"score_gpt":0.2679057101270298,"score_spread":0.2615681686661858,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1991713476","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.22122416,0.00032481406,0.7713694,0.006043769,0.0003685231,0.00021240127,3.0909442e-7,0.00002427995,0.00043235766],"genre_scores_gemma":[0.95347804,0.00004646808,0.046036277,0.00014924219,0.00022840041,0.000004620212,0.0000012354814,0.0000050912527,0.00005063236],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988288,0.00024016334,0.0004346409,0.00011058767,0.00026416895,0.00012161104],"domain_scores_gemma":[0.99882936,0.00028620698,0.00045642725,0.000107250235,0.00025517397,0.00006556815],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010360985,0.00009199101,0.00018487753,0.00015738954,0.00018032009,0.0003177527,0.00026592438,0.00003796407,0.000016512653],"category_scores_gemma":[0.000047696463,0.00006022201,0.00007305199,0.00022641334,0.00005166048,0.00097082567,0.00005783961,0.00015562003,0.000019199299],"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.000106525295,0.00009944732,0.000111910565,0.00008411652,0.00008149964,0.000015345593,0.0065087136,0.005641271,0.00259133,0.38088554,0.0015879528,0.60228634],"study_design_scores_gemma":[0.0024691299,0.00013984718,0.014186465,0.00012049399,0.000036243124,0.00057935494,0.00023671913,0.79754716,0.00093036046,0.18346877,0.00012427804,0.0001611535],"about_ca_topic_score_codex":0.000013814169,"about_ca_topic_score_gemma":2.2882026e-7,"teacher_disagreement_score":0.79190594,"about_ca_system_score_codex":0.000028370878,"about_ca_system_score_gemma":0.000030195042,"threshold_uncertainty_score":0.30640966},"labels":[],"label_agreement":null},{"id":"W1992572359","doi":"10.1016/j.jsc.2009.04.004","title":"Corrigendum to: “On ordering free groups” [J. Symbolic Comput. 40 (2005) 1285–1290]","year":2009,"lang":"en","type":"erratum","venue":"Journal of Symbolic Computation","topic":"semigroups and automata theory","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 British Columbia","funders":"","keywords":"Mathematics; Algebra over a field; Combinatorics; Pure mathematics","score_opus":0.016467723170452926,"score_gpt":0.25548833239834035,"score_spread":0.23902060922788743,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1992572359","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009022537,0.0030773229,0.8451194,0.0050479495,0.12349852,0.0008653538,0.00003573729,0.000576514,0.012756646],"genre_scores_gemma":[0.5625531,0.003923729,0.20953111,0.036845542,0.08165942,0.000088604844,0.000672765,0.0012885986,0.10343709],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9941519,0.00032169878,0.0018357061,0.00085496274,0.0018178129,0.001017901],"domain_scores_gemma":[0.99512213,0.00029220482,0.0020336097,0.0012001022,0.00068435987,0.00066761195],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0013786347,0.00085673673,0.001533423,0.001694956,0.00032883784,0.0007994471,0.003806634,0.0005861928,0.00004517748],"category_scores_gemma":[0.00030078457,0.0008045246,0.0005752639,0.00115035,0.00006355514,0.0007609796,0.00062611524,0.0019930927,0.00020953304],"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.000052869957,0.00026332546,0.000009722224,0.00008979901,0.00014094979,0.0002595133,0.0012800393,0.0066418815,0.000073828065,0.0060345903,0.8755413,0.109612174],"study_design_scores_gemma":[0.0038542207,0.0038087792,0.019492816,0.005282515,0.00028983815,0.0025103823,0.000285924,0.3075384,0.00020440307,0.08501564,0.5684884,0.0032286872],"about_ca_topic_score_codex":0.000026914899,"about_ca_topic_score_gemma":0.000013688454,"teacher_disagreement_score":0.6355883,"about_ca_system_score_codex":0.00053850096,"about_ca_system_score_gemma":0.00071252906,"threshold_uncertainty_score":0.99944055},"labels":[],"label_agreement":null},{"id":"W1992772797","doi":"10.1016/j.jsc.2006.03.004","title":"Simplicial cycles and the computation of simplicial trees","year":2006,"lang":"en","type":"article","venue":"Journal of Symbolic Computation","topic":"Commutative Algebra and Its Applications","field":"Mathematics","cited_by":19,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Dalhousie University","funders":"","keywords":"Simplicial homology; Simplicial complex; Mathematics; Abstract simplicial complex; Simplicial approximation theorem; Simplicial manifold; h-vector; Combinatorics; Simplicial set; Tree (set theory); Betti number; Discrete mathematics; Pure mathematics; Homotopy","score_opus":0.023662449571438805,"score_gpt":0.3210769085585581,"score_spread":0.29741445898711927,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1992772797","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8576516,0.00020686685,0.14021036,0.0010838,0.000061295716,0.00020563696,0.000004194259,0.000012433915,0.0005638201],"genre_scores_gemma":[0.9955897,0.000015690013,0.0040120548,0.000042031246,0.00031234956,0.000003671454,0.0000034763482,0.00001271176,0.000008351599],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99862033,0.00014311883,0.00076549733,0.000084883846,0.000282181,0.00010397174],"domain_scores_gemma":[0.9974962,0.0011276281,0.0008987011,0.0000804129,0.000365223,0.000031853597],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00051202945,0.00011248362,0.00035158472,0.00014736438,0.00013664625,0.000041031024,0.00012378673,0.00004407679,0.0000047350595],"category_scores_gemma":[0.0001264769,0.00007803895,0.000116670206,0.00022593046,0.00018831828,0.00013057198,0.00003809237,0.00013575278,0.0000011355133],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0004845164,0.0005573519,0.004218307,0.00012425563,0.00023147695,0.0000036789936,0.006613138,0.011340542,0.0045120856,0.8614379,0.004703864,0.1057729],"study_design_scores_gemma":[0.0019643693,0.00009906214,0.117065035,0.000047983347,0.00013036355,0.00006122403,0.00042730029,0.012643975,0.0004385347,0.86694896,0.00008035553,0.00009281487],"about_ca_topic_score_codex":0.000075236334,"about_ca_topic_score_gemma":0.00005452762,"teacher_disagreement_score":0.13793807,"about_ca_system_score_codex":0.000026576045,"about_ca_system_score_gemma":0.00004728071,"threshold_uncertainty_score":0.3182336},"labels":[],"label_agreement":null},{"id":"W1993473229","doi":"10.1016/j.jsc.2014.09.012","title":"Relaxed Hensel lifting of triangular sets","year":2014,"lang":"en","type":"article","venue":"Journal of Symbolic Computation","topic":"Polynomial and algebraic computation","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Agence Nationale de la Recherche","keywords":"Set (abstract data type); Point (geometry); Algorithm; Mathematics; Implementation; Computer science; Geometry; Programming language","score_opus":0.011571822478849265,"score_gpt":0.24724955102981688,"score_spread":0.2356777285509676,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1993473229","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.43336993,0.00007698921,0.56527674,0.00050438225,0.00043767845,0.000043087184,2.4158982e-7,0.000019760735,0.00027118062],"genre_scores_gemma":[0.94286853,0.0000053497565,0.056760952,0.0001169905,0.00022872242,4.3469655e-7,0.0000010245951,0.000006590251,0.000011395126],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984287,0.00016711661,0.0007353325,0.00013449391,0.00038565512,0.00014871376],"domain_scores_gemma":[0.99819756,0.0003140971,0.0009230004,0.00013725244,0.00033483206,0.00009326314],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009412157,0.00010538337,0.00030966295,0.00027584194,0.000063423,0.00006106207,0.00037463673,0.00004871805,0.0000028029212],"category_scores_gemma":[0.00021462725,0.000093736286,0.00014162576,0.00039408458,0.000026002319,0.0004293226,0.00007055833,0.00014567218,0.000007342821],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004812119,0.00016664265,0.0006278153,0.00006106403,0.000079423015,0.000013755011,0.004100319,0.023153702,0.008594422,0.030539088,0.00086015195,0.9317555],"study_design_scores_gemma":[0.0029150313,0.0008002864,0.04716867,0.00026140583,0.00004644308,0.00032622472,0.00009188079,0.8147143,0.0055051423,0.12694997,0.00091059174,0.00031003114],"about_ca_topic_score_codex":0.0000094476545,"about_ca_topic_score_gemma":6.75909e-7,"teacher_disagreement_score":0.9314455,"about_ca_system_score_codex":0.00003508083,"about_ca_system_score_gemma":0.00009695698,"threshold_uncertainty_score":0.38224545},"labels":[],"label_agreement":null},{"id":"W1994728957","doi":"10.1016/s0747-7171(02)00139-6","title":"On lattice reduction for polynomial matrices","year":2003,"lang":"en","type":"article","venue":"Journal of Symbolic Computation","topic":"Polynomial and algebraic computation","field":"Computer Science","cited_by":119,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Eidgenössische Technische Hochschule Zürich","keywords":"Mathematics; Computation; Lattice reduction; Hermite polynomials; Lattice (music); Matrix polynomial; Polynomial; Reduction (mathematics); Canonical form; Combinatorics; Discrete mathematics; Algebra over a field; Pure mathematics; Algorithm; Mathematical analysis; Geometry","score_opus":0.015613794153033869,"score_gpt":0.26775971741067944,"score_spread":0.25214592325764557,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1994728957","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.29479095,0.00009686656,0.70218194,0.00058661326,0.0015467528,0.00013890748,7.5405575e-7,0.00003177672,0.0006254101],"genre_scores_gemma":[0.9477965,0.0000073862875,0.051611304,0.00012447652,0.00039516215,0.0000030173114,0.0000011834734,0.000008167423,0.00005280524],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99881905,0.00009524467,0.00047107268,0.00016586766,0.00027768905,0.00017107603],"domain_scores_gemma":[0.998721,0.00029742066,0.00052599364,0.00010260453,0.00026307759,0.00008992892],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005489551,0.00011612241,0.00019880566,0.00031299298,0.00012544917,0.00013715567,0.00024774906,0.00004961625,0.000003758019],"category_scores_gemma":[0.00013917698,0.000103879116,0.00013550857,0.00033656266,0.000016943135,0.0005464867,0.000016915956,0.000120885124,0.000011544173],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00024559096,0.0005222048,0.000062518404,0.00006949987,0.00013215945,0.000014189356,0.0021781258,0.061718713,0.00409359,0.48496538,0.018712383,0.42728564],"study_design_scores_gemma":[0.009090384,0.0046105697,0.007561024,0.00033871707,0.00016834961,0.00201927,0.0003404949,0.26933074,0.018504359,0.66439795,0.022511069,0.0011270418],"about_ca_topic_score_codex":0.0000035237726,"about_ca_topic_score_gemma":2.516812e-7,"teacher_disagreement_score":0.65300554,"about_ca_system_score_codex":0.00008578497,"about_ca_system_score_gemma":0.000148589,"threshold_uncertainty_score":0.42360675},"labels":[],"label_agreement":null},{"id":"W1995653528","doi":"10.1016/s0747-7171(03)00097-x","title":"High-order lifting and integrality certification","year":2003,"lang":"en","type":"article","venue":"Journal of Symbolic Computation","topic":"Polynomial and algebraic computation","field":"Computer Science","cited_by":81,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Mathematics; Invertible matrix; Univariate; Dimension (graph theory); Matrix (chemical analysis); Polynomial matrix; Field (mathematics); Matrix multiplication; Ring (chemistry); Correctness; Polynomial; Order (exchange); Multiplication (music); Algebra over a field; Discrete mathematics; Combinatorics; Pure mathematics; Matrix polynomial; Algorithm; Mathematical analysis","score_opus":0.017708436857765117,"score_gpt":0.25371895663028965,"score_spread":0.23601051977252452,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1995653528","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.41664696,0.00011403518,0.58186334,0.00079452473,0.00039309319,0.000041839292,1.6755047e-7,0.000019968693,0.0001260497],"genre_scores_gemma":[0.9252802,0.000014095538,0.074463055,0.00012428215,0.00009671412,7.9092877e-7,9.327444e-7,0.0000045228667,0.000015373515],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99888605,0.00014149229,0.00047209288,0.00014764836,0.00022663506,0.00012609089],"domain_scores_gemma":[0.99890715,0.00014396875,0.00043554427,0.000095767085,0.00032909808,0.000088479996],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006251978,0.000096081,0.00017724451,0.00017378728,0.00009860042,0.00015420171,0.00017049424,0.00003910429,0.0000035594321],"category_scores_gemma":[0.0001890774,0.000083243925,0.000044726014,0.00038337702,0.000026365964,0.00059624703,0.000033856802,0.00014349427,0.0000051647207],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001345443,0.00015040854,0.0017518622,0.000033742857,0.00005431337,0.000010991264,0.0031802466,0.009268234,0.0043272004,0.22437224,0.00043912642,0.7563982],"study_design_scores_gemma":[0.0028620572,0.0005795146,0.1852885,0.0002153432,0.00006767639,0.000934391,0.00045082511,0.35027122,0.0106388135,0.44447765,0.0035022197,0.0007117952],"about_ca_topic_score_codex":0.00002316635,"about_ca_topic_score_gemma":0.0000020636007,"teacher_disagreement_score":0.7556864,"about_ca_system_score_codex":0.000045093057,"about_ca_system_score_gemma":0.00009822209,"threshold_uncertainty_score":0.33945888},"labels":[],"label_agreement":null},{"id":"W2000760108","doi":"10.1016/j.jsc.2011.12.009","title":"Efficient algorithms for order basis computation","year":2011,"lang":"en","type":"article","venue":"Journal of Symbolic Computation","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":35,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Mathematics; Basis (linear algebra); Order (exchange); Degree (music); Computation; Algorithm; Matrix (chemical analysis); Row; Field (mathematics); Exponent; Matrix multiplication; Normal basis; Row and column spaces; Combinatorics; Discrete mathematics; Computer science; Pure mathematics; Geometry; Galois theory","score_opus":0.04028607635485304,"score_gpt":0.2782715342282155,"score_spread":0.23798545787336245,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2000760108","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1181038,0.00007041769,0.8803029,0.00016782305,0.000768618,0.00013859615,0.0000011106657,0.000043811568,0.0004029104],"genre_scores_gemma":[0.70789486,0.0000026308408,0.2918818,0.000092663235,0.00011203898,0.0000031510285,0.0000010327942,0.0000068985278,0.000004944547],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988165,0.00008610889,0.00047538223,0.00016430701,0.0002803295,0.0001773883],"domain_scores_gemma":[0.998447,0.00019428447,0.00046092572,0.0001103831,0.00069485954,0.00009252498],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007737046,0.00011816913,0.00020928342,0.0003758604,0.00013179974,0.000076662014,0.0003602827,0.000047108522,0.0000073784463],"category_scores_gemma":[0.000053044478,0.00010564674,0.00017285241,0.0006050514,0.00003347585,0.00020082806,0.000048638976,0.000107862994,0.000006055114],"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.00016009361,0.00069461117,0.0003829032,0.00005867708,0.00016999763,0.000019324587,0.012522354,0.085644774,0.0004851657,0.08035469,0.000951783,0.81855565],"study_design_scores_gemma":[0.0013115582,0.00067232235,0.0088296,0.000062689825,0.000044465545,0.0001336197,0.00019626126,0.8973155,0.0007455114,0.09023398,0.00024594445,0.00020854596],"about_ca_topic_score_codex":0.0000039978418,"about_ca_topic_score_gemma":4.5583073e-7,"teacher_disagreement_score":0.8183471,"about_ca_system_score_codex":0.000033819782,"about_ca_system_score_gemma":0.0000761643,"threshold_uncertainty_score":0.4308149},"labels":[],"label_agreement":null},{"id":"W2010426631","doi":"10.1016/s0747-7171(02)00104-9","title":"A database of categories","year":2003,"lang":"en","type":"article","venue":"Journal of Symbolic Computation","topic":"Logic, programming, and type systems","field":"Computer Science","cited_by":25,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Mount Allison University; University of Waterloo","funders":"","keywords":"Functor; Mathematics; Computation; Set (abstract data type); Functor category; Programming language; Algebra over a field; Theoretical computer science; Database; Computer science; Pure mathematics; Algorithm","score_opus":0.025433721231290812,"score_gpt":0.2721982775063541,"score_spread":0.2467645562750633,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2010426631","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.034901086,0.00047546552,0.9622609,0.00007779415,0.0006762157,0.000060028415,2.1038315e-7,0.000013874828,0.0015344475],"genre_scores_gemma":[0.9843814,0.000015035529,0.015471696,0.000025202287,0.00007028874,6.332684e-7,7.415014e-7,0.000003424669,0.000031628308],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990238,0.00009870242,0.00041194572,0.00008387733,0.0002764415,0.00010524583],"domain_scores_gemma":[0.9989388,0.00006835073,0.00049193465,0.00012926123,0.00031351333,0.0000581665],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005896064,0.00006701633,0.00018733903,0.00014263965,0.000038978378,0.000054658158,0.0002442415,0.000027121321,0.0000040755685],"category_scores_gemma":[0.00008394225,0.000052797754,0.00006678639,0.00028386718,0.000026414531,0.00038593216,0.000027510545,0.00008288032,0.0000060921393],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009099842,0.00017127082,0.0025926675,0.00008834494,0.00005934996,0.000040302588,0.0040057474,0.0012299538,0.0014019448,0.9503473,0.00088801864,0.03916602],"study_design_scores_gemma":[0.006178142,0.0027388285,0.023752075,0.0001737248,0.0001716488,0.004385576,0.0026407011,0.052874185,0.035027787,0.8213844,0.04953909,0.0011338927],"about_ca_topic_score_codex":0.00001971348,"about_ca_topic_score_gemma":0.0000021190924,"teacher_disagreement_score":0.94948024,"about_ca_system_score_codex":0.000021591954,"about_ca_system_score_gemma":0.00012924982,"threshold_uncertainty_score":0.21530299},"labels":[],"label_agreement":null},{"id":"W2015697919","doi":"10.1016/j.jsc.2011.12.016","title":"On simultaneous row and column reduction of higher-order linear differential systems","year":2011,"lang":"en","type":"article","venue":"Journal of Symbolic Computation","topic":"Numerical methods for differential equations","field":"Mathematics","cited_by":17,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Mathematics; Column (typography); Order (exchange); Reduction (mathematics); Computation; Linear system; Differential (mechanical device); Block (permutation group theory); Applied mathematics; Work (physics); Algorithm; Combinatorics; Mathematical analysis; Geometry; Connection (principal bundle)","score_opus":0.07027741118408987,"score_gpt":0.3445580831731101,"score_spread":0.27428067198902023,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2015697919","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.63872266,0.000035670535,0.36010972,0.000030204375,0.00081058865,0.00014524981,0.0000029046062,0.0000143101115,0.00012869404],"genre_scores_gemma":[0.93484247,0.000010554521,0.06480268,0.0000046552855,0.0002242482,0.000002097824,0.0000017112566,0.00001938479,0.000092186965],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985111,0.0002088546,0.00071100966,0.00010930562,0.00034537818,0.00011438751],"domain_scores_gemma":[0.99785274,0.0006240367,0.000867159,0.00009702429,0.00047319714,0.000085868014],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00024270409,0.00012269297,0.0003950276,0.0001923436,0.000055749922,0.000019109975,0.00008483847,0.00008174875,0.000045409095],"category_scores_gemma":[0.0004724686,0.00010415387,0.00008260864,0.00019261485,0.000061949766,0.00009564291,0.000020783153,0.00018421872,0.0000023940572],"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.0041816924,0.009991804,0.001149176,0.0029542362,0.0028109532,0.00012520373,0.03164884,0.04479999,0.10158492,0.30233237,0.0015511294,0.49686968],"study_design_scores_gemma":[0.0038138083,0.0036586355,0.008631268,0.0008528979,0.0008543858,0.0003963323,0.00083009776,0.13959402,0.005100847,0.8355909,0.00011360054,0.0005632062],"about_ca_topic_score_codex":0.000034757657,"about_ca_topic_score_gemma":8.8380165e-7,"teacher_disagreement_score":0.5332585,"about_ca_system_score_codex":0.000044801185,"about_ca_system_score_gemma":0.000032002576,"threshold_uncertainty_score":0.42472714},"labels":[],"label_agreement":null},{"id":"W2017958871","doi":"10.1016/j.jsc.2008.05.007","title":"Dynamic balancing of planar mechanisms using toric geometry","year":2009,"lang":"en","type":"article","venue":"Journal of Symbolic Computation","topic":"Polynomial and algebraic computation","field":"Computer Science","cited_by":17,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université Laval","funders":"","keywords":"Mathematics; Planar; Base (topology); Kinematics; Polynomial; Factorization; Toric variety; Laurent polynomial; Algebraic number; Geometry; Pure mathematics; Computer science; Mathematical analysis; Algorithm","score_opus":0.010288720647671163,"score_gpt":0.25461434666655175,"score_spread":0.24432562601888058,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2017958871","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3954254,0.00011375652,0.6037305,0.00019316349,0.0004470303,0.000038035134,4.3787855e-7,0.00001595051,0.000035718873],"genre_scores_gemma":[0.85442287,0.0000071518416,0.14537701,0.00010157405,0.00008149591,1.02277696e-7,9.758213e-7,0.0000041707303,0.0000046241526],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986025,0.0000574392,0.0006218474,0.00013532174,0.0004134482,0.00016941932],"domain_scores_gemma":[0.9987317,0.00009061109,0.0007513485,0.000110880355,0.00023039809,0.00008511695],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004165759,0.000115374765,0.0002944045,0.00047832233,0.000066465705,0.0000589215,0.00035785654,0.000049476108,0.0000021692408],"category_scores_gemma":[0.00003665089,0.000106654355,0.000115977695,0.00064661406,0.00001160162,0.00054442143,0.00003046833,0.00013685568,0.0000020948987],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006016781,0.00034161523,0.00021932638,0.00006396779,0.00010540111,0.00007797183,0.002725295,0.1541804,0.14422452,0.05314342,0.00019009013,0.6446678],"study_design_scores_gemma":[0.00065382576,0.00046796218,0.026115878,0.00013370198,0.000025994805,0.00035870698,0.000059346577,0.8255695,0.00220072,0.14423229,0.000015825182,0.00016622504],"about_ca_topic_score_codex":0.000010761201,"about_ca_topic_score_gemma":6.4977223e-7,"teacher_disagreement_score":0.67138916,"about_ca_system_score_codex":0.000125832,"about_ca_system_score_gemma":0.00013388261,"threshold_uncertainty_score":0.43492386},"labels":[],"label_agreement":null},{"id":"W2021258994","doi":"10.1016/j.jsc.2005.10.002","title":"Fraction-free row reduction of matrices of Ore polynomials","year":2005,"lang":"en","type":"article","venue":"Journal of Symbolic Computation","topic":"Polynomial and algebraic computation","field":"Computer Science","cited_by":70,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo; University of Lethbridge","funders":"","keywords":"Mathematics; Skew; Computation; Reduction (mathematics); Fraction (chemistry); Rank (graph theory); Matrix (chemical analysis); Skew-symmetric matrix; Combinatorics; Discrete mathematics; Pure mathematics; Symmetric matrix; Square matrix; Algorithm; Geometry","score_opus":0.011987160902604925,"score_gpt":0.25847732941143414,"score_spread":0.2464901685088292,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2021258994","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6542154,0.00041053628,0.34325206,0.0013016831,0.000502354,0.00008034536,0.0000019407091,0.000020094183,0.00021559934],"genre_scores_gemma":[0.94841206,0.000053465006,0.050865125,0.000031742788,0.0006074813,7.6493853e-7,0.0000014612278,0.0000068413474,0.000021049318],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99812645,0.00009193105,0.0010186047,0.00014373913,0.00048323657,0.00013604185],"domain_scores_gemma":[0.9973067,0.00015694837,0.0017422475,0.00020022689,0.0005167587,0.000077104356],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00053623144,0.00011968581,0.0003686301,0.000492179,0.000055538818,0.000044120818,0.0005296364,0.00006516653,0.00001190098],"category_scores_gemma":[0.00009457866,0.00010936831,0.00016624483,0.0005565193,0.000044254357,0.0010995923,0.0000897253,0.00014242427,0.0000048346697],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00011533798,0.00041743336,0.00055664283,0.00009593462,0.00013555046,0.0000040810683,0.0024029536,0.08901059,0.038360443,0.006428304,0.004391038,0.8580817],"study_design_scores_gemma":[0.0077665662,0.0024433513,0.15132603,0.00093314896,0.00030447118,0.0016505226,0.00096533186,0.48960927,0.22058028,0.11924981,0.004119605,0.0010516057],"about_ca_topic_score_codex":0.00004165225,"about_ca_topic_score_gemma":0.0000022246443,"teacher_disagreement_score":0.8570301,"about_ca_system_score_codex":0.000086327724,"about_ca_system_score_gemma":0.00018462418,"threshold_uncertainty_score":0.445991},"labels":[],"label_agreement":null},{"id":"W2022598246","doi":"10.1016/j.jsc.2013.04.003","title":"Ideal-specific elimination orders form a star-shaped region","year":2013,"lang":"en","type":"article","venue":"Journal of Symbolic Computation","topic":"Polynomial and algebraic computation","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Google (Canada)","funders":"","keywords":"Mathematics; Ideal (ethics); Star (game theory); Combinatorics; Regular polygon; Polynomial; Discrete mathematics; Mathematical analysis; Geometry","score_opus":0.017350610929681792,"score_gpt":0.2385419214357196,"score_spread":0.2211913105060378,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2022598246","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.36782616,0.00011085594,0.62823707,0.0029065898,0.0005461893,0.00016979007,2.0801961e-7,0.000048850303,0.00015428028],"genre_scores_gemma":[0.97653955,0.000046936384,0.02279524,0.00024432698,0.00031968378,0.0000060247226,0.000004256921,0.000011420811,0.000032569656],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981956,0.00009064941,0.00074808346,0.0002107963,0.0005061472,0.00024871354],"domain_scores_gemma":[0.99804884,0.00016876604,0.0007778318,0.00016063718,0.0006966696,0.00014726768],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00034101782,0.00016495035,0.00026670957,0.00043762822,0.00013570992,0.0003142903,0.00046163308,0.00006831635,0.000018323039],"category_scores_gemma":[0.000046873083,0.0001469352,0.00013770437,0.00057943625,0.000032618238,0.0018605479,0.000081953374,0.00019975677,0.00007102037],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000026597134,0.00019165842,0.00006912935,0.000020406735,0.000036223493,0.000019579536,0.002656738,0.0016337117,0.0026350452,0.018592576,0.0071177203,0.9670006],"study_design_scores_gemma":[0.002970178,0.00085833983,0.05033854,0.00011658127,0.000019287869,0.00046116146,0.00025762967,0.81266004,0.00041008607,0.12849106,0.0030409386,0.00037617536],"about_ca_topic_score_codex":0.000045322515,"about_ca_topic_score_gemma":0.0000027209871,"teacher_disagreement_score":0.96662444,"about_ca_system_score_codex":0.00014967525,"about_ca_system_score_gemma":0.00012115732,"threshold_uncertainty_score":0.5991844},"labels":[],"label_agreement":null},{"id":"W2023200896","doi":"10.1006/jsco.2001.0493","title":"Factoring Polynomials Over Local Fields","year":2001,"lang":"en","type":"article","venue":"Journal of Symbolic Computation","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":29,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Mathematics; Factoring; Divisor (algebraic geometry); Prime factor; Irreducible polynomial; Basis (linear algebra); Prime (order theory); Factorization of polynomials; Polynomial; Greatest common divisor; Discrete mathematics; Combinatorics; Algebra over a field; Pure mathematics; Matrix polynomial; Mathematical analysis","score_opus":0.015358704786723486,"score_gpt":0.26642591801028304,"score_spread":0.25106721322355957,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2023200896","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3721622,0.00007645747,0.6264761,0.0003344578,0.0004876057,0.000020328544,9.6860205e-8,0.000020299713,0.00042243296],"genre_scores_gemma":[0.995354,0.00002168533,0.0040981397,0.00022019542,0.00028046753,3.563382e-7,1.9094868e-7,0.0000040205405,0.00002092655],"study_design_codex":"design_other","study_design_gemma":"observational","domain_scores_codex":[0.99913883,0.000058775622,0.00032770738,0.00009792591,0.00023907235,0.00013769668],"domain_scores_gemma":[0.999321,0.0001355039,0.00024427983,0.000111122165,0.00010702007,0.00008109245],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00036392457,0.00008107452,0.00015907222,0.00022707669,0.00007140453,0.00010539658,0.00033496897,0.000046241516,0.000021050375],"category_scores_gemma":[0.000020882511,0.00007168444,0.00012760988,0.0003352456,0.000022263634,0.0004920725,0.00005520006,0.00015312713,0.0000067793635],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007567707,0.00014557077,0.005942963,0.000013999113,0.00008815379,0.0001143507,0.0043629482,0.018158011,0.0013186263,0.037729025,0.0010094316,0.93104124],"study_design_scores_gemma":[0.0053057675,0.002241018,0.34272584,0.0005083045,0.00011928363,0.003011057,0.00076017005,0.25852898,0.0057914234,0.3393726,0.040302772,0.0013327698],"about_ca_topic_score_codex":0.000007390172,"about_ca_topic_score_gemma":0.0000010814588,"teacher_disagreement_score":0.9297085,"about_ca_system_score_codex":0.000032611053,"about_ca_system_score_gemma":0.000041877098,"threshold_uncertainty_score":0.29232067},"labels":[],"label_agreement":null},{"id":"W2027966173","doi":"10.1016/j.jsc.2008.07.002","title":"Algebraic transformation of differential characteristic decompositions from one ranking to another","year":2008,"lang":"en","type":"article","venue":"Journal of Symbolic Computation","topic":"Polynomial and algebraic computation","field":"Computer Science","cited_by":15,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"Natural Sciences and Engineering Research Council of Canada; Russian Foundation for Basic Research; National Science Foundation","keywords":"Mathematics; Ideal (ethics); Canonical form; Ranking (information retrieval); Bounded function; Set (abstract data type); Order (exchange); Differential (mechanical device); Algebraic number; Discrete mathematics; Algebra over a field; Pure mathematics; Mathematical analysis; Computer science; Artificial intelligence","score_opus":0.020177325805018277,"score_gpt":0.24066292839953735,"score_spread":0.22048560259451908,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2027966173","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4929652,0.00002064457,0.50616246,0.00044800315,0.00027124054,0.000074752905,0.0000035860428,0.000016730115,0.000037401376],"genre_scores_gemma":[0.9774132,0.000012365738,0.022142261,0.00016775362,0.00023644381,0.000002124408,0.000012486323,0.000008655035,0.000004725296],"study_design_codex":"design_other","study_design_gemma":"observational","domain_scores_codex":[0.99841374,0.000090401336,0.00077540014,0.00014264871,0.0004265247,0.00015125719],"domain_scores_gemma":[0.9988426,0.00015467714,0.00052879547,0.000116820076,0.000261584,0.000095511736],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00014726789,0.00012694867,0.00033397943,0.00038236316,0.00012256055,0.000054469405,0.00033671057,0.000046581008,0.000023374087],"category_scores_gemma":[0.000022061091,0.00012341207,0.00013964149,0.00038191664,0.00002813905,0.00064608373,0.000041229538,0.00012529369,0.000014687033],"study_design_candidate":"observational","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003521588,0.0012243404,0.0010506086,0.00008503255,0.00040938845,0.000044112017,0.04923401,0.021325694,0.33155292,0.010091361,0.0004239049,0.58420646],"study_design_scores_gemma":[0.003965574,0.00095398223,0.646037,0.0005460456,0.00012922422,0.00036908122,0.000091939226,0.28255662,0.036785625,0.027769014,0.0001973102,0.0005985914],"about_ca_topic_score_codex":0.000037587117,"about_ca_topic_score_gemma":0.0000024564383,"teacher_disagreement_score":0.6449864,"about_ca_system_score_codex":0.000059024806,"about_ca_system_score_gemma":0.000099123856,"threshold_uncertainty_score":0.5032598},"labels":[],"label_agreement":null},{"id":"W2029184018","doi":"10.1016/j.jsc.2002.04.001","title":"Foreword to the special issue on Applications of computer algebra","year":2005,"lang":"en","type":"article","venue":"Journal of Symbolic Computation","topic":"Polynomial and algebraic computation","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Wilfrid Laurier University","funders":"","keywords":"Mathematics; Algebra over a field; Symbolic computation; Mathematics education; Pure mathematics; Mathematical analysis","score_opus":0.00947932950131616,"score_gpt":0.25557740186108635,"score_spread":0.2460980723597702,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2029184018","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.046963017,0.00003683464,0.93964326,0.0116361,0.00075562525,0.00027696058,0.0000028449308,0.000024024424,0.00066135544],"genre_scores_gemma":[0.9130077,0.0000065085756,0.06955607,0.0016811258,0.01563387,0.000007970593,0.0000019623933,0.0000100115385,0.00009479876],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984616,0.00007515006,0.0006504181,0.00017148303,0.00047108615,0.00017024635],"domain_scores_gemma":[0.99862164,0.00022895566,0.0005063985,0.00022059312,0.0003082615,0.00011415226],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00042357505,0.00012929982,0.000242319,0.00030329806,0.00011497186,0.000075184755,0.0007423682,0.0000405859,0.00002058286],"category_scores_gemma":[0.000020095395,0.00009382421,0.00013636518,0.0006200821,0.000030391195,0.00031798118,0.000117180985,0.0001747342,0.00011835758],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001838469,0.00010758797,0.000017604745,0.0000056721856,0.000021668497,0.0000011551579,0.0015261717,0.063531846,0.000049283142,0.013960025,0.018894123,0.9018665],"study_design_scores_gemma":[0.001628516,0.0014256756,0.028454972,0.00016774485,0.00004855298,0.00020423098,0.00011096846,0.5427668,0.0027896261,0.023390792,0.39856339,0.0004487135],"about_ca_topic_score_codex":0.0000054245534,"about_ca_topic_score_gemma":0.0000070511564,"teacher_disagreement_score":0.9014178,"about_ca_system_score_codex":0.000070761234,"about_ca_system_score_gemma":0.00009437892,"threshold_uncertainty_score":0.38260403},"labels":[],"label_agreement":null},{"id":"W2038133488","doi":"10.1016/j.jsc.2007.11.005","title":"Approximate factorization of multivariate polynomials using singular value decomposition","year":2007,"lang":"en","type":"article","venue":"Journal of Symbolic Computation","topic":"Numerical Methods and Algorithms","field":"Computer Science","cited_by":69,"is_retracted":false,"has_abstract":false,"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":"Mathematics; Singular value decomposition; Factorization; Multivariate statistics; Generalization; Applied mathematics; Set (abstract data type); Decomposition; Algorithm; Mathematical analysis; Statistics; Computer science","score_opus":0.02778806671875694,"score_gpt":0.35593004644580806,"score_spread":0.3281419797270511,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2038133488","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.20104094,0.000053195858,0.79811573,0.000048060494,0.00062083337,0.00007309741,5.7088727e-7,0.000014792975,0.000032772703],"genre_scores_gemma":[0.51935315,0.000002382887,0.48049858,0.000018882347,0.0001206351,7.535394e-8,7.229624e-7,0.000004759914,8.130036e-7],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983611,0.00015972421,0.0008049896,0.00013282488,0.0003712908,0.0001700627],"domain_scores_gemma":[0.9981298,0.00023476638,0.0010590053,0.00010235562,0.00038028162,0.00009381756],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014043172,0.00010817372,0.0003083966,0.0003184286,0.0000736314,0.000064737076,0.00023386511,0.000057976904,0.0000013559032],"category_scores_gemma":[0.00009330185,0.00009553659,0.00011072378,0.0005083942,0.000025150885,0.0005279593,0.000050498766,0.000101909536,4.5211112e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005898784,0.00029971695,0.0006495848,0.000048503472,0.00008290382,0.00002586626,0.0018745459,0.08903696,0.3942165,0.01497492,0.000006293909,0.4987252],"study_design_scores_gemma":[0.00077331444,0.00024410988,0.022745075,0.00013235098,0.000034224533,0.00012906568,0.00003508294,0.89867264,0.050158367,0.026874766,0.00003259283,0.00016841468],"about_ca_topic_score_codex":0.000032414344,"about_ca_topic_score_gemma":1.4901035e-7,"teacher_disagreement_score":0.8096357,"about_ca_system_score_codex":0.00009064927,"about_ca_system_score_gemma":0.00006497361,"threshold_uncertainty_score":0.3895869},"labels":[],"label_agreement":null},{"id":"W2040516344","doi":"10.1016/s0747-7171(03)00071-3","title":"Efficient decomposition of separable algebras","year":2003,"lang":"en","type":"article","venue":"Journal of Symbolic Computation","topic":"Polynomial and algebraic computation","field":"Computer Science","cited_by":16,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo; University of Calgary","funders":"","keywords":"Mathematics; Algebra over a field; Factorization of polynomials; Separable space; Polynomial; Generator (circuit theory); Simple (philosophy); Computation; Factorization; Pure mathematics; Matrix polynomial; Algorithm; Power (physics)","score_opus":0.009798005884001877,"score_gpt":0.2656074410536992,"score_spread":0.25580943516969734,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2040516344","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.48488006,0.00014460694,0.51383084,0.000114589566,0.00040360587,0.000050718194,2.9838472e-7,0.00001362737,0.00056163827],"genre_scores_gemma":[0.95737094,0.0000059517474,0.042476818,0.00006257019,0.00006415824,7.68722e-7,8.164975e-7,0.0000056097015,0.000012375113],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998517,0.0001433922,0.0006544402,0.00013595214,0.00039032535,0.0001589207],"domain_scores_gemma":[0.99858683,0.00015793959,0.0006875352,0.000120474026,0.00035320816,0.00009398886],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00058854703,0.00010938518,0.00025950986,0.00030526522,0.000069862486,0.00005573518,0.00026719074,0.00004239125,0.000008964839],"category_scores_gemma":[0.00006061095,0.00009934609,0.00013467303,0.00049510156,0.000028250037,0.00021782676,0.00003346136,0.00011521895,0.000010203668],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004385615,0.0006067848,0.00065537624,0.00006367256,0.00010597954,0.000027278342,0.0026585977,0.73720926,0.023106886,0.14159265,0.0008388917,0.09309074],"study_design_scores_gemma":[0.002336819,0.0007190859,0.028520184,0.00021342303,0.000055712106,0.0007724552,0.00011616204,0.8434196,0.029085856,0.09370326,0.0006776543,0.00037976852],"about_ca_topic_score_codex":0.0000059507383,"about_ca_topic_score_gemma":4.6845616e-7,"teacher_disagreement_score":0.47249088,"about_ca_system_score_codex":0.00006444023,"about_ca_system_score_gemma":0.00016749543,"threshold_uncertainty_score":0.40512162},"labels":[],"label_agreement":null},{"id":"W2045078718","doi":"10.1016/j.jsc.2010.05.001","title":"Algorithms for solving linear systems over cyclotomic fields","year":2010,"lang":"en","type":"article","venue":"Journal of Symbolic Computation","topic":"Algebraic Geometry and Number Theory","field":"Mathematics","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":"Mathematics; Modulo; Prime (order theory); Product (mathematics); Algorithm; Field (mathematics); Cyclotomic field; Finite field; Discrete mathematics; Algebra over a field; Pure mathematics; Combinatorics","score_opus":0.0310037852513228,"score_gpt":0.3309011250881962,"score_spread":0.2998973398368734,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2045078718","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7146321,0.000039520703,0.28335774,0.00008481783,0.0015441491,0.00014450343,0.000002166995,0.000017380698,0.00017762881],"genre_scores_gemma":[0.9776775,0.000004224076,0.020721309,0.000042507694,0.0013845095,0.0000037803047,0.000001769552,0.000018535064,0.00014586994],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99901164,0.00003133962,0.00051300036,0.00008497238,0.00021375014,0.00014528893],"domain_scores_gemma":[0.99823403,0.00083821744,0.00049922074,0.00009605237,0.00025948428,0.00007296435],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00094711495,0.0001011777,0.00026832815,0.00015041507,0.000083965795,0.000042739168,0.00013397538,0.000117144664,0.000029697701],"category_scores_gemma":[0.00040508193,0.00008621657,0.00014013104,0.00010519981,0.00002250175,0.00016285141,0.000019343985,0.00030829787,0.0000053408176],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0014849348,0.0028405453,0.007898313,0.004363019,0.002659812,0.00016626109,0.02945969,0.028814249,0.069896504,0.5984318,0.06294366,0.19104119],"study_design_scores_gemma":[0.0033912747,0.00049438624,0.003915281,0.00031674094,0.0002577476,0.00082371075,0.0009216591,0.2688555,0.0029259678,0.71459997,0.0030201494,0.00047760157],"about_ca_topic_score_codex":0.000005587073,"about_ca_topic_score_gemma":0.0000015402147,"teacher_disagreement_score":0.2630454,"about_ca_system_score_codex":0.000022685686,"about_ca_system_score_gemma":0.000053087588,"threshold_uncertainty_score":0.35158098},"labels":[],"label_agreement":null},{"id":"W2047164313","doi":"10.1016/s0747-7171(03)00020-8","title":"The integration of systems of linear PDEs using conservation laws of syzygies","year":2003,"lang":"en","type":"article","venue":"Journal of Symbolic Computation","topic":"Nonlinear Waves and Solitons","field":"Physics and Astronomy","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":"Brock University","funders":"","keywords":"Mathematics; Conservation law; Partial differential equation; Applied mathematics; Computation; Basis (linear algebra); Differential equation; Algebra over a field; Mathematical analysis; Algorithm; Pure mathematics","score_opus":0.03422602274259525,"score_gpt":0.3113566256499596,"score_spread":0.27713060290736435,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2047164313","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9095119,0.00014938547,0.089762166,0.000029408115,0.00019841421,0.00007267041,0.0000074241257,0.0000011183198,0.00026749427],"genre_scores_gemma":[0.99605143,0.000008264581,0.0037966094,0.0000022120846,0.00011557779,3.0221096e-7,0.000003611718,0.0000050091135,0.000016989561],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99901307,0.000100183905,0.0006261452,0.00003695596,0.00016521025,0.00005844679],"domain_scores_gemma":[0.9981544,0.0001722528,0.0010185024,0.00006115447,0.00057578343,0.000017913144],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000386892,0.000057325866,0.00021425463,0.00006762874,0.000052366682,0.000013602438,0.00005683763,0.000020504458,0.0000031062675],"category_scores_gemma":[0.00003196322,0.000039961516,0.000092219496,0.00013329819,0.00005414977,0.000103337115,0.000006335292,0.00007053668,1.6951702e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001784837,0.0006545558,0.07732117,0.00037362167,0.00071582757,0.0000011071198,0.007646771,0.32629484,0.1723791,0.3904161,0.00025635178,0.023762062],"study_design_scores_gemma":[0.0026848218,0.0007959282,0.03835096,0.0016703085,0.00041353915,0.000039442675,0.02994394,0.7453513,0.14698836,0.0321615,0.0012459839,0.00035390715],"about_ca_topic_score_codex":0.00021273585,"about_ca_topic_score_gemma":0.0000024516826,"teacher_disagreement_score":0.41905645,"about_ca_system_score_codex":0.000012616748,"about_ca_system_score_gemma":0.00010769583,"threshold_uncertainty_score":0.16295832},"labels":[],"label_agreement":null},{"id":"W2052338752","doi":"10.1016/j.jsc.2008.04.019","title":"Fast arithmetic for triangular sets: From theory to practice","year":2008,"lang":"en","type":"article","venue":"Journal of Symbolic Computation","topic":"Polynomial and algebraic computation","field":"Computer Science","cited_by":32,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"","keywords":"Mathematics; Quicksort; Modular arithmetic; Arithmetic; Euclidean algorithm; Division (mathematics); Multiplication (music); Axiom; Univariate; Dimension (graph theory); Euclidean geometry; Algebra over a field; Discrete mathematics; sort; Cryptography; Algorithm; Sorting algorithm; Pure mathematics; Combinatorics","score_opus":0.018415195422730957,"score_gpt":0.28258018679888164,"score_spread":0.2641649913761507,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2052338752","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09482001,0.00020985713,0.90046287,0.0030804118,0.0010672576,0.00021535916,0.0000044495027,0.000036752874,0.00010304338],"genre_scores_gemma":[0.56041753,0.000012542217,0.43774322,0.0012333981,0.00051960413,0.000005786126,0.000004662328,0.00001110523,0.000052147414],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984829,0.00018182787,0.00056658936,0.00020360686,0.00037930766,0.00018576352],"domain_scores_gemma":[0.9974474,0.0012165516,0.00051454455,0.00014809416,0.0005086508,0.00016480083],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007551954,0.00013033809,0.00027759504,0.00027305435,0.00015748043,0.00010501951,0.00043519447,0.000048237554,0.00000413111],"category_scores_gemma":[0.0005713591,0.000117116164,0.00014601991,0.00039092996,0.000023730587,0.00081534416,0.000073049705,0.00013423976,0.000023099754],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000299531,0.00025451544,0.000037907663,0.000011570046,0.00014113083,0.000080078855,0.009819806,0.026905462,0.0012005694,0.009712437,0.004861261,0.9466757],"study_design_scores_gemma":[0.008816617,0.0028010407,0.024550628,0.00029176226,0.00025066044,0.0024823626,0.0010827594,0.486334,0.003844456,0.4224063,0.04607443,0.0010649948],"about_ca_topic_score_codex":0.000017505341,"about_ca_topic_score_gemma":9.964156e-7,"teacher_disagreement_score":0.94561076,"about_ca_system_score_codex":0.00008216538,"about_ca_system_score_gemma":0.000205786,"threshold_uncertainty_score":0.47758585},"labels":[],"label_agreement":null},{"id":"W2052784918","doi":"10.1016/j.jsc.2010.08.010","title":"High-precision numerical integration: Progress and challenges","year":2010,"lang":"en","type":"article","venue":"Journal of Symbolic Computation","topic":"Numerical Methods and Algorithms","field":"Computer Science","cited_by":52,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Dalhousie University","funders":"Lawrence Berkeley National Laboratory","keywords":"Realm; Field (mathematics); Mathematics; Relation (database); Numerical integration; Integer (computer science); Computer science; Programming language; Data mining; Pure mathematics; Mathematical analysis","score_opus":0.025112515337038656,"score_gpt":0.3043765023234904,"score_spread":0.2792639869864517,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2052784918","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.072226495,0.0007762958,0.9194981,0.0061364956,0.0012296638,0.00005673805,2.032614e-7,0.000024586176,0.00005143764],"genre_scores_gemma":[0.5043555,0.00012952322,0.49520692,0.00003746525,0.0002635839,9.2508367e-7,1.6128101e-7,0.0000034091106,0.000002501127],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99898016,0.000098957615,0.00034865417,0.00014968759,0.00030947628,0.000113066584],"domain_scores_gemma":[0.99899596,0.00021612493,0.00029581678,0.00011244657,0.00025530742,0.0001243239],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00058186153,0.00009379549,0.00021891268,0.0001298997,0.000064863474,0.00013697609,0.00027001294,0.000055133012,0.0000041425033],"category_scores_gemma":[0.000105160325,0.00006771559,0.000051017123,0.00020354193,0.000045267134,0.00047007672,0.00007877683,0.00030144825,0.0000032088785],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000005659767,0.00005152784,0.000046297984,0.0000053213994,0.0000072457187,0.000009382822,0.00038631677,0.000036269335,0.0005732533,0.019257994,0.00003026921,0.9795905],"study_design_scores_gemma":[0.0020425704,0.0019584303,0.16344514,0.00021039396,0.00004141723,0.0019019142,0.00026430408,0.49599177,0.0038793685,0.3220931,0.0075774156,0.00059417787],"about_ca_topic_score_codex":0.0000026340576,"about_ca_topic_score_gemma":4.1216896e-7,"teacher_disagreement_score":0.9789963,"about_ca_system_score_codex":0.00001079063,"about_ca_system_score_gemma":0.000033739787,"threshold_uncertainty_score":0.27613616},"labels":[],"label_agreement":null},{"id":"W2053029682","doi":"10.1016/j.jsc.2011.12.023","title":"Algorithms for computing triangular decomposition of polynomial systems","year":2011,"lang":"en","type":"article","venue":"Journal of Symbolic Computation","topic":"Polynomial and algebraic computation","field":"Computer Science","cited_by":87,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"","keywords":"Decomposition; Mathematics; Key (lock); Polynomial; Algorithm; Algebra over a field; Theoretical computer science; Computer science; Pure mathematics","score_opus":0.039196430906365674,"score_gpt":0.2941856011297759,"score_spread":0.2549891702234102,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2053029682","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.25372142,0.00021289765,0.74423087,0.00006690303,0.0014457812,0.00021099366,0.0000025811266,0.000027701986,0.00008086641],"genre_scores_gemma":[0.86155164,0.000004557075,0.13794197,0.000029872454,0.0004500864,0.0000019988015,0.0000036671418,0.000009783441,0.0000064445226],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981551,0.00011500824,0.0010248256,0.00018001834,0.00031935438,0.00020566673],"domain_scores_gemma":[0.9976875,0.0002405181,0.0012716888,0.00013139429,0.0005615783,0.000107302294],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008052037,0.00014653557,0.00042163202,0.00038806544,0.00009690859,0.00007402319,0.0004524991,0.00007082384,0.0000017851769],"category_scores_gemma":[0.00004775037,0.00013619053,0.00022185454,0.00032828006,0.000034061526,0.0005407515,0.000067894194,0.0001125672,0.0000022494553],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005236245,0.00090935157,0.00065670884,0.00034340934,0.0004587987,0.000041230545,0.020330425,0.052695993,0.0120970225,0.026662247,0.0023247101,0.8829565],"study_design_scores_gemma":[0.002964344,0.0011076537,0.011171042,0.0002209595,0.00006971563,0.0003359243,0.00025761803,0.96980006,0.0066994242,0.006887114,0.00021634402,0.00026979556],"about_ca_topic_score_codex":0.00005530153,"about_ca_topic_score_gemma":6.947022e-7,"teacher_disagreement_score":0.91710407,"about_ca_system_score_codex":0.00007167733,"about_ca_system_score_gemma":0.00016868129,"threshold_uncertainty_score":0.5553689},"labels":[],"label_agreement":null},{"id":"W2054562350","doi":"10.1016/j.jsc.2013.10.016","title":"Gröbner–Shirshov bases for the non-symmetric operads of dendriform algebras and quadri-algebras","year":2013,"lang":"en","type":"article","venue":"Journal of Symbolic Computation","topic":"Advanced Topics in Algebra","field":"Mathematics","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 Saskatchewan","funders":"Ministerio de Ciencia e Innovación","keywords":"Mathematics; Representation (politics); Algebra over a field; Computation; Symbolic computation; Pure mathematics; Algorithm","score_opus":0.03824089403114503,"score_gpt":0.3243957606280855,"score_spread":0.28615486659694045,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2054562350","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7253018,0.0004737991,0.27229196,0.0008424949,0.00034559602,0.00051131455,0.0000035465118,0.000012347809,0.00021712633],"genre_scores_gemma":[0.9186941,0.000109062385,0.08060722,0.00014604328,0.00031869722,0.00001834971,0.0000016075247,0.000029845134,0.00007510166],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9983597,0.000051395935,0.000860048,0.00013409916,0.00038800013,0.000206776],"domain_scores_gemma":[0.9955431,0.0026193098,0.0008650218,0.00018168082,0.0006980434,0.00009281921],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00061342446,0.00017367558,0.00043345348,0.00031165322,0.00012882838,0.00006841343,0.00026209728,0.00008638192,0.00003882379],"category_scores_gemma":[0.001007411,0.00011794372,0.00015292027,0.00036513613,0.00009406226,0.00041189077,0.00006434347,0.00023535884,0.000004471796],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00015311582,0.00068586774,0.0046819835,0.001011753,0.0008279951,0.000011629518,0.0064161466,0.0018279001,0.0039302395,0.61453843,0.012214789,0.35370013],"study_design_scores_gemma":[0.001728197,0.0004766481,0.027345056,0.00019429164,0.00022210227,0.00020635032,0.0010653931,0.022940861,0.0024148154,0.9426195,0.0005438,0.00024296188],"about_ca_topic_score_codex":0.00001987568,"about_ca_topic_score_gemma":0.000006358939,"teacher_disagreement_score":0.35345718,"about_ca_system_score_codex":0.000062689134,"about_ca_system_score_gemma":0.000075485004,"threshold_uncertainty_score":0.48096052},"labels":[],"label_agreement":null},{"id":"W2064146303","doi":"10.1006/jsco.2002.0558","title":"Computing Modular Invariants of p-groups","year":2002,"lang":"en","type":"article","venue":"Journal of Symbolic Computation","topic":"Geometric and Algebraic Topology","field":"Mathematics","cited_by":25,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Royal Military College of Canada","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Modular design; Algebra over a field; Pure mathematics; Programming language; Computer science","score_opus":0.062461931442986965,"score_gpt":0.3037447393709523,"score_spread":0.24128280792796536,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2064146303","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.82525325,0.00018865726,0.17311685,0.00022658991,0.000257471,0.00005262527,6.4905544e-7,0.000009551145,0.000894333],"genre_scores_gemma":[0.98221743,0.000016620063,0.017486697,0.0000330499,0.00019363138,1.2936489e-7,4.0493285e-7,0.000009765821,0.000042286752],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987547,0.00007762245,0.0006865163,0.00007254013,0.00027771192,0.00013092419],"domain_scores_gemma":[0.9983746,0.00040595414,0.0008395163,0.00007865278,0.0002451268,0.000056189627],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00045341972,0.00008426859,0.00034818694,0.00035526702,0.00003983795,0.000011157373,0.00013367896,0.000059439033,0.00010918561],"category_scores_gemma":[0.00040686954,0.00007368947,0.00010278245,0.00039627697,0.000039019862,0.00009887802,0.00003225632,0.00015384873,0.000009190912],"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.00012294488,0.0035731364,0.017806742,0.0009849195,0.0012662782,0.00031616198,0.029621247,0.03304052,0.0072774375,0.38319746,0.027069282,0.49572387],"study_design_scores_gemma":[0.0042136293,0.0009883193,0.06465962,0.00036826832,0.00024042283,0.0014624083,0.0019256553,0.22824714,0.0011614886,0.69597924,0.0003384908,0.0004153142],"about_ca_topic_score_codex":0.000004234592,"about_ca_topic_score_gemma":3.819798e-7,"teacher_disagreement_score":0.49530855,"about_ca_system_score_codex":0.000027045426,"about_ca_system_score_gemma":0.000016661443,"threshold_uncertainty_score":0.30049694},"labels":[],"label_agreement":null},{"id":"W2064756116","doi":"10.1016/j.jsc.2006.12.004","title":"On approximate triangular decompositions in dimension zero","year":2007,"lang":"en","type":"article","venue":"Journal of Symbolic Computation","topic":"Polynomial and algebraic computation","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"National Science Foundation","keywords":"Mathematics; Zero (linguistics); Dimension (graph theory); Generalization; Polynomial; Homotopy; System of polynomial equations; Algebra over a field; Applied mathematics; Discrete mathematics; Pure mathematics; Mathematical analysis","score_opus":0.011061004748159575,"score_gpt":0.268565815014977,"score_spread":0.25750481026681743,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2064756116","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.41930062,0.000044981287,0.5794201,0.000492954,0.00040750604,0.00007275217,2.2420251e-7,0.000020755002,0.00024011554],"genre_scores_gemma":[0.9700316,0.0000046498335,0.02951229,0.0003192935,0.0001123551,7.630842e-7,0.0000021551775,0.000006899305,0.000009960371],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984755,0.00008106861,0.0006835724,0.00016523081,0.00037363448,0.0002209928],"domain_scores_gemma":[0.99886173,0.00034784884,0.00040911112,0.00012042364,0.00014934,0.00011155235],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010578911,0.00012121011,0.00023457254,0.00066438474,0.000078092526,0.00008014345,0.000284005,0.000053964464,0.0000027294273],"category_scores_gemma":[0.000057236553,0.00010870312,0.000103587234,0.0006061669,0.000018720657,0.00044532653,0.00005302754,0.00021069277,0.000013236673],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003784412,0.0011503627,0.00068387185,0.000038623708,0.00006788259,0.00047112277,0.0051768376,0.17344728,0.014595212,0.14339036,0.0020899088,0.6585101],"study_design_scores_gemma":[0.005554946,0.0012581252,0.10019589,0.00042978185,0.000027033493,0.00065136026,0.0001143326,0.49799255,0.0074965805,0.38541433,0.00033600733,0.00052905135],"about_ca_topic_score_codex":0.000009949192,"about_ca_topic_score_gemma":0.0000050875205,"teacher_disagreement_score":0.65798104,"about_ca_system_score_codex":0.00013365281,"about_ca_system_score_gemma":0.00006997487,"threshold_uncertainty_score":0.44327846},"labels":[],"label_agreement":null},{"id":"W2067539682","doi":"10.1016/j.jsc.2011.09.006","title":"Triangular <mml:math xmlns:mml=\"http://www.w3.org/1998/Math/MathML\" altimg=\"si1.gif\" display=\"inline\" overflow=\"scroll\"><mml:mi>x</mml:mi></mml:math>-basis decompositions and derandomization of linear algebra algorithms over <mml:math xmlns:mml=\"http://www.w3.org/1998/Math/MathML\" altimg=\"si2.gif\" display=\"inline\" overflow=\"scroll\"><mml:mstyle mathvariant=\"sans-serif\"><mml:mi>K</mml:mi></mml:mstyle><mml:mrow><mml:mo>[</mml:mo><mml:mi>x</mml:mi><mml:mo>]</mml:mo></mml:mrow></mml:math>","year":2011,"lang":"lv","type":"article","venue":"Journal of Symbolic Computation","topic":"Polynomial and algebraic computation","field":"Computer Science","cited_by":42,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Mathematics; Invertible matrix; Degree (music); Basis (linear algebra); Factorization; Polynomial; Prime (order theory); Discrete mathematics; Algorithm; Finite field; Linearization; Linear system; Combinatorics; Pure mathematics; Mathematical analysis; Geometry; Nonlinear system","score_opus":0.01625062571401865,"score_gpt":0.24227548051093784,"score_spread":0.2260248547969192,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2067539682","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.94432336,0.0017958625,0.040164374,0.00097400864,0.004348319,0.00019212531,0.0005079276,0.0003658551,0.0073281527],"genre_scores_gemma":[0.97114664,0.0016938319,0.018814877,0.0018253035,0.0038461194,0.0005829233,0.0011994715,0.00079718046,0.00009363017],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.98522365,0.0009205938,0.004490413,0.0025822045,0.0039757746,0.0028073678],"domain_scores_gemma":[0.9870728,0.002550938,0.005836201,0.0021360347,0.0006981498,0.0017058614],"candidate_categories":["metaepi_narrow","sts","scholarly_communication","research_integrity","insufficient_payload"],"consensus_categories":["metaepi_narrow","research_integrity","insufficient_payload"],"category_scores_codex":[0.0037936482,0.0016619533,0.001081185,0.0012617201,0.0028612658,0.0025134124,0.0029040684,0.0027190568,0.0039029147],"category_scores_gemma":[0.0015767507,0.0025812222,0.002964879,0.0021749744,0.001684765,0.0039146803,0.0023232747,0.0025633173,0.0011131526],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.003729499,0.0012553412,0.000026086927,0.0013673854,0.002787421,0.0014141207,0.005835537,0.02043319,0.0034532715,0.93825,0.011376192,0.0100719705],"study_design_scores_gemma":[0.0070048585,0.0028208331,0.00043915308,0.002183665,0.0024677503,0.0033983667,0.0013317582,0.8362557,0.13876848,0.0023464842,0.0010092082,0.0019736942],"about_ca_topic_score_codex":0.002126091,"about_ca_topic_score_gemma":0.00056210934,"teacher_disagreement_score":0.9359035,"about_ca_system_score_codex":0.00007584286,"about_ca_system_score_gemma":0.0026045227,"threshold_uncertainty_score":0.9997378},"labels":[],"label_agreement":null},{"id":"W2069447786","doi":"10.1016/j.jsc.2015.03.002","title":"Ancilla-free synthesis of large reversible functions using binary decision diagrams","year":2015,"lang":"en","type":"article","venue":"Journal of Symbolic Computation","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":49,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of New Brunswick","funders":"","keywords":"Binary decision diagram; Mathematics; Binary number; Exponential function; Function (biology); Boolean function; Algorithm; Theoretical computer science; Discrete mathematics; Computer science; Arithmetic","score_opus":0.02452229376098022,"score_gpt":0.27775794801266673,"score_spread":0.25323565425168654,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2069447786","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.46922266,0.000209138,0.5296212,0.00020639382,0.00063207664,0.00003845409,0.0000024333303,0.000018360888,0.000049286344],"genre_scores_gemma":[0.8152104,0.000008542929,0.18450989,0.00003937173,0.00021645935,3.4214952e-7,5.83148e-7,0.000008145551,0.000006263949],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99832016,0.00012367949,0.0005732781,0.00016741164,0.00060912955,0.00020633946],"domain_scores_gemma":[0.9979191,0.00038604919,0.00062098296,0.00028874452,0.00061784056,0.00016732035],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010748781,0.00012725183,0.00031928215,0.0004068875,0.000119691766,0.00006817338,0.0005959174,0.00006071164,0.0000023726006],"category_scores_gemma":[0.0004513258,0.00010702799,0.00015640396,0.0007373324,0.000029721321,0.00038266345,0.00026342785,0.00019118012,0.0000042590777],"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.00006889483,0.00032199317,0.002117548,0.000043147975,0.0000910815,0.00007044795,0.002413364,0.7261953,0.0013587889,0.00085127354,0.005458418,0.26100978],"study_design_scores_gemma":[0.0008030425,0.00029808297,0.005896478,0.00026772587,0.000034108834,0.00033595544,0.0001807316,0.98169905,0.00044740396,0.009470105,0.00042910338,0.00013819673],"about_ca_topic_score_codex":0.000017037892,"about_ca_topic_score_gemma":0.0000022594031,"teacher_disagreement_score":0.34598774,"about_ca_system_score_codex":0.00009041403,"about_ca_system_score_gemma":0.000255117,"threshold_uncertainty_score":0.43644747},"labels":[],"label_agreement":null},{"id":"W2072653231","doi":"10.1016/j.jsc.2003.08.010","title":"Telescoping in the context of symbolic summation in Maple","year":2004,"lang":"en","type":"article","venue":"Journal of Symbolic Computation","topic":"Polynomial and algebraic computation","field":"Computer Science","cited_by":22,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo; McMaster University","funders":"","keywords":"Maple; Telescoping series; Mathematics; Context (archaeology); Symbolic computation; Algebra over a field; Pure mathematics; Mathematical analysis","score_opus":0.014686698666798963,"score_gpt":0.25727426159478695,"score_spread":0.24258756292798797,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2072653231","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.78811204,0.00016430368,0.20958036,0.0016542948,0.00023409327,0.000139001,3.913079e-7,0.0000083526365,0.000107128144],"genre_scores_gemma":[0.995409,0.000020818054,0.004241595,0.00022237298,0.00009642599,0.000002275061,0.0000015656673,0.000004420879,0.0000015077677],"study_design_codex":"design_other","study_design_gemma":"observational","domain_scores_codex":[0.9983994,0.00014189408,0.00079859915,0.00012247036,0.00037671148,0.00016096722],"domain_scores_gemma":[0.998975,0.00019940172,0.0005323035,0.0001183645,0.00014063336,0.00003432047],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00086380134,0.000101848214,0.00026213162,0.00048254855,0.000037998816,0.00007075956,0.0004770342,0.000044137898,0.0000010984444],"category_scores_gemma":[0.00006716903,0.00007970756,0.00007757433,0.00078356994,0.000029848585,0.0005934447,0.000046224795,0.0002030807,0.000003941977],"study_design_candidate":"observational","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007372431,0.0006883341,0.005926576,0.00013930362,0.00004402648,0.000089728484,0.06671057,0.24274066,0.0044257883,0.10390867,0.0001395489,0.57511306],"study_design_scores_gemma":[0.008094141,0.0007993762,0.59178036,0.0015819733,0.000027579843,0.00051853334,0.004113388,0.1598703,0.006148266,0.22633258,0.00023474213,0.00049875525],"about_ca_topic_score_codex":0.00018053791,"about_ca_topic_score_gemma":0.00010296651,"teacher_disagreement_score":0.5858538,"about_ca_system_score_codex":0.00012809834,"about_ca_system_score_gemma":0.00019443683,"threshold_uncertainty_score":0.325038},"labels":[],"label_agreement":null},{"id":"W2078168416","doi":"10.1006/jsco.2002.0554","title":"Computing Rational Forms of Integer Matrices","year":2002,"lang":"en","type":"article","venue":"Journal of Symbolic Computation","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":24,"is_retracted":false,"has_abstract":false,"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; Integer (computer science); Las vegas; Integer matrix; Matrix (chemical analysis); Combinatorics; Transformation (genetics); Discrete mathematics; Algebra over a field; Pure mathematics; Symmetric matrix; Nonnegative matrix; Computer science; Eigenvalues and eigenvectors","score_opus":0.010251792145755036,"score_gpt":0.21235275661341813,"score_spread":0.2021009644676631,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2078168416","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.885042,0.0007086206,0.111528225,0.000022671207,0.00037053245,0.000042939202,0.000001102085,0.000022313643,0.002261573],"genre_scores_gemma":[0.9990341,0.000025512592,0.0007521532,0.000008273995,0.00016070444,2.4404216e-7,0.0000010888075,0.000008305487,0.00000962567],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99919933,0.000026334877,0.00048007062,0.00003540409,0.00018121375,0.00007765223],"domain_scores_gemma":[0.9994903,0.00008845339,0.00022400843,0.000035741647,0.00012749068,0.00003399267],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002594681,0.00006710092,0.00017564213,0.00019264511,0.000027225804,0.000017709477,0.00007711197,0.000033437937,0.00003753078],"category_scores_gemma":[0.0000136001445,0.000056792393,0.00008409645,0.00018357126,0.00001497385,0.00018218471,0.000006232923,0.0001032695,0.0000084698495],"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.000018970963,0.00009127212,0.002021896,0.00027638098,0.00019870176,0.000010196042,0.0052241343,0.9111633,0.005817017,0.01217188,0.0023089189,0.06069737],"study_design_scores_gemma":[0.0007404726,0.00013144789,0.007579332,0.00026477964,0.000036167046,0.00029526567,0.0005824753,0.9767398,0.0017766615,0.011267464,0.00042877012,0.00015732607],"about_ca_topic_score_codex":6.021233e-7,"about_ca_topic_score_gemma":2.2410444e-7,"teacher_disagreement_score":0.113992065,"about_ca_system_score_codex":0.000022216147,"about_ca_system_score_gemma":0.0000049062364,"threshold_uncertainty_score":0.23159266},"labels":[],"label_agreement":null},{"id":"W2079007848","doi":"10.1016/j.jsc.2006.05.003","title":"Gröbner fan and universal characteristic sets of prime differential ideals","year":2006,"lang":"en","type":"article","venue":"Journal of Symbolic Computation","topic":"Polynomial and algebraic computation","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"Università di Pisa; Russian Foundation for Basic Research","keywords":"Mathematics; Prime (order theory); Differential (mechanical device); Combinatorics; Pure mathematics; Discrete mathematics; Algebra over a field","score_opus":0.006545562213871806,"score_gpt":0.22256338713067086,"score_spread":0.21601782491679905,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2079007848","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.596946,0.000052687446,0.40243024,0.00020423062,0.00025077056,0.000040718813,0.0000013061388,0.000011534452,0.00006250293],"genre_scores_gemma":[0.9945538,0.000008403054,0.005190618,0.000023575953,0.00019439722,2.764508e-7,0.0000038167345,0.0000051567504,0.000019950048],"study_design_codex":"design_other","study_design_gemma":"observational","domain_scores_codex":[0.99890476,0.00007368968,0.0005010127,0.00012549973,0.0002685696,0.00012645977],"domain_scores_gemma":[0.9989428,0.000111072164,0.0006186088,0.00007650864,0.00018603209,0.0000649983],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001704072,0.000104263825,0.00025874458,0.00023410056,0.000052943098,0.0000737411,0.0002030356,0.000039798368,0.0000043935056],"category_scores_gemma":[0.000016010388,0.00009216523,0.00007160397,0.00018810814,0.000041334868,0.0004090285,0.000076741766,0.00009856003,0.0000018870948],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00017342846,0.0006209602,0.0059779314,0.000151529,0.0001817807,0.00010432799,0.0033726764,0.0051008635,0.120980285,0.048240423,0.0011804049,0.8139154],"study_design_scores_gemma":[0.0015778195,0.00035604698,0.803993,0.000116051335,0.000048118585,0.0002653432,0.000031037864,0.1561558,0.004006332,0.03308706,0.00013703427,0.00022636255],"about_ca_topic_score_codex":0.000048128655,"about_ca_topic_score_gemma":0.0000021988892,"teacher_disagreement_score":0.81368905,"about_ca_system_score_codex":0.000035525412,"about_ca_system_score_gemma":0.000079658945,"threshold_uncertainty_score":0.3758389},"labels":[],"label_agreement":null},{"id":"W2079500227","doi":"10.1006/jsco.2001.0509","title":"Size Reduction and Partial Decoupling of Systems of Equations","year":2002,"lang":"en","type":"article","venue":"Journal of Symbolic Computation","topic":"Numerical methods for differential equations","field":"Mathematics","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":"Brock University","funders":"Natural Sciences and Engineering Research Council of Canada; Research England; Engineering and Physical Sciences Research Council; University of Waterloo","keywords":"Mathematics; Decoupling (probability); Nonlinear system; Integrable system; Computation; Partial differential equation; Applied mathematics; Differential algebraic equation; Separable partial differential equation; Connection (principal bundle); Numerical partial differential equations; Reduction (mathematics); Basis (linear algebra); Algebraic number; Ordinary differential equation; Differential equation; Mathematical analysis; Algorithm; Geometry","score_opus":0.0974736332912541,"score_gpt":0.35984526364099184,"score_spread":0.26237163034973776,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2079500227","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.47941214,0.00012873633,0.5200182,0.0000674337,0.00024853722,0.00008305756,0.0000016521678,0.0000052604682,0.000034923858],"genre_scores_gemma":[0.9229916,0.000028245104,0.07681862,0.00000160443,0.00013223426,0.0000016624288,4.6258367e-7,0.000009244515,0.000016362068],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985672,0.000120609366,0.0008776982,0.00006644952,0.00028937234,0.0000786357],"domain_scores_gemma":[0.99716437,0.0011690859,0.0011463122,0.0000724945,0.00039441232,0.000053298823],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00048533644,0.000072564864,0.00033084216,0.00015103901,0.000042556025,0.000014910437,0.00005723819,0.00004685125,0.000024136632],"category_scores_gemma":[0.0013188418,0.000065387736,0.000082223865,0.00021881476,0.00004860814,0.00014230717,0.000014059024,0.00009932898,7.638261e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002762035,0.0034375286,0.0033371802,0.0026426753,0.0013738378,0.000008322392,0.027400464,0.11957012,0.20387606,0.20441803,0.0007054649,0.43295413],"study_design_scores_gemma":[0.0020231935,0.0007717755,0.004578827,0.0007266359,0.00066936674,0.00019818728,0.0016340979,0.6676486,0.0089728655,0.31247061,0.000037665697,0.00026816866],"about_ca_topic_score_codex":0.000013491057,"about_ca_topic_score_gemma":4.049469e-7,"teacher_disagreement_score":0.5480785,"about_ca_system_score_codex":0.000029814384,"about_ca_system_score_gemma":0.000018714733,"threshold_uncertainty_score":0.26664346},"labels":[],"label_agreement":null},{"id":"W2079533520","doi":"10.1016/j.jsc.2003.07.004","title":"Certified dense linear system solving","year":2003,"lang":"en","type":"article","venue":"Journal of Symbolic Computation","topic":"Polynomial and algebraic computation","field":"Computer Science","cited_by":33,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Mathematics; Diophantine equation; Ring (chemistry); Ideal (ethics); Certificate; Domain (mathematical analysis); System of linear equations; Ring of integers; Linear system; Discrete mathematics; Integral domain; Field (mathematics); Algebra over a field; Algebraic number field; Algorithm; Pure mathematics; Mathematical analysis","score_opus":0.019108657443917463,"score_gpt":0.24786600853807797,"score_spread":0.2287573510941605,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2079533520","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.26768106,0.00014937817,0.7298938,0.00022765285,0.0010981124,0.00006350917,2.0129987e-7,0.000057649966,0.00082860823],"genre_scores_gemma":[0.9597533,0.000004377804,0.03988504,0.000087331835,0.00022884764,9.090129e-7,5.028677e-7,0.000008165362,0.00003155855],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984913,0.00016791404,0.000616322,0.0001588456,0.0003690335,0.00019661427],"domain_scores_gemma":[0.9987076,0.00016829305,0.00053023716,0.00013522804,0.00032930615,0.00012934537],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00064997154,0.00012395212,0.00024654085,0.00025581563,0.00012485171,0.00013428702,0.00031482647,0.000050081268,0.0000033325387],"category_scores_gemma":[0.000103728205,0.00010964446,0.00012604597,0.00039870988,0.000017516464,0.00054365484,0.000041735442,0.00016462548,0.000029782414],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008654217,0.00046208626,0.0011773107,0.0002841483,0.0002884053,0.00042991622,0.009444751,0.22277927,0.013818245,0.34707823,0.0034976534,0.40065342],"study_design_scores_gemma":[0.0017881282,0.0003417229,0.0072729974,0.00028777265,0.00004556681,0.0021649273,0.00038177898,0.9648959,0.0051599736,0.015172203,0.0020755106,0.0004135177],"about_ca_topic_score_codex":0.0000063287107,"about_ca_topic_score_gemma":7.9802453e-7,"teacher_disagreement_score":0.74211663,"about_ca_system_score_codex":0.00012054625,"about_ca_system_score_gemma":0.00018477511,"threshold_uncertainty_score":0.44711715},"labels":[],"label_agreement":null},{"id":"W2080563392","doi":"10.1006/jsco.2001.0508","title":"The Riccati Equation in Mathematical Finance","year":2002,"lang":"en","type":"article","venue":"Journal of Symbolic Computation","topic":"Stochastic processes and financial applications","field":"Economics, Econometrics and Finance","cited_by":35,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Class (philosophy); Mathematics; Riccati equation; Computation; Mathematical finance; Linkage (software); Differential equation; Ordinary differential equation; Differential (mechanical device); Algebra over a field; Finance; Applied mathematics; Computer science; Pure mathematics; Algorithm; Mathematical analysis; Artificial intelligence","score_opus":0.04762609303254539,"score_gpt":0.23926780232615041,"score_spread":0.19164170929360502,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2080563392","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.035795666,0.0022104203,0.9551957,0.0022536824,0.00015707812,0.000102268576,0.0000025554273,0.0000049413434,0.0042776903],"genre_scores_gemma":[0.99582094,0.00022566855,0.003715751,0.00006455235,0.00009877641,0.000009415048,5.703012e-7,0.0000062643,0.00005807555],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990447,0.00000423469,0.00070680375,0.00008266829,0.00004911367,0.000112456146],"domain_scores_gemma":[0.9990762,0.00016560737,0.0005863572,0.00007714525,0.000072649666,0.0000220724],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00041253673,0.000057514157,0.00017138285,0.00011871039,0.0000893671,0.000044935525,0.00014260026,0.000035419205,0.000014663739],"category_scores_gemma":[0.00022679321,0.00004933576,0.000051957602,0.00032142943,0.000029868816,0.00013293844,0.0000127436615,0.000116107425,0.00015778562],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000004010634,0.000088169545,0.0004197271,0.000007634639,0.0000058475325,0.0000010753122,0.0007191773,0.0017574072,0.0000034635339,0.96443176,0.00023451074,0.032327212],"study_design_scores_gemma":[0.0002753363,0.000041504027,0.01944149,0.000021276332,0.000002226788,0.000017399709,0.000046048117,0.15157305,0.0000035533608,0.8258809,0.002636651,0.000060577764],"about_ca_topic_score_codex":0.0000069451758,"about_ca_topic_score_gemma":0.0000023490247,"teacher_disagreement_score":0.96002525,"about_ca_system_score_codex":0.000060565024,"about_ca_system_score_gemma":0.00001019478,"threshold_uncertainty_score":0.20280676},"labels":[],"label_agreement":null},{"id":"W2085665095","doi":"10.1016/j.jsc.2007.08.003","title":"Universal characteristic decomposition of radical differential ideals","year":2007,"lang":"en","type":"article","venue":"Journal of Symbolic Computation","topic":"Polynomial and algebraic computation","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"","keywords":"Mathematics; Ideal (ethics); Ranking (information retrieval); Intersection (aeronautics); Set (abstract data type); Combinatorics; Differential (mechanical device); Finite set; Polynomial; Discrete mathematics; Algebra over a field; Pure mathematics; Mathematical analysis","score_opus":0.008893168748411744,"score_gpt":0.2677494275058659,"score_spread":0.25885625875745416,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2085665095","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.48283696,0.000025978981,0.5164014,0.00015531687,0.00046446972,0.00003741255,6.118632e-7,0.000013010779,0.000064819666],"genre_scores_gemma":[0.98614013,0.00000869191,0.013456945,0.000048123165,0.00032960885,1.6843386e-7,0.0000042446777,0.0000055209,0.000006573706],"study_design_codex":"design_other","study_design_gemma":"observational","domain_scores_codex":[0.9984821,0.00007477831,0.00073633157,0.0001258206,0.0004061549,0.00017478013],"domain_scores_gemma":[0.9984968,0.00024050447,0.0007767836,0.00009144921,0.00026610456,0.00012837978],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00050377403,0.00010839019,0.00028050214,0.00038067563,0.00006069253,0.000051581275,0.00033299078,0.00005644265,0.00000958874],"category_scores_gemma":[0.000036234993,0.000100035475,0.00013378297,0.0003172986,0.00004886583,0.00046090514,0.000066656256,0.0001507028,0.0000048077595],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00038286054,0.0006558976,0.0012904094,0.0000885791,0.00017934889,0.00016413163,0.003302387,0.0035473614,0.13472782,0.042799223,0.0005802923,0.81228167],"study_design_scores_gemma":[0.0040029404,0.0013133796,0.7134027,0.00032652295,0.00010870092,0.00093113346,0.000117549156,0.22168523,0.023621636,0.033548046,0.00045536153,0.0004867978],"about_ca_topic_score_codex":0.000010910157,"about_ca_topic_score_gemma":0.0000012818566,"teacher_disagreement_score":0.8117949,"about_ca_system_score_codex":0.00008343538,"about_ca_system_score_gemma":0.00010472396,"threshold_uncertainty_score":0.40793282},"labels":[],"label_agreement":null},{"id":"W2088713140","doi":"10.1016/j.jsc.2012.05.008","title":"On the complexity of computing with zero-dimensional triangular sets","year":2012,"lang":"en","type":"article","venue":"Journal of Symbolic Computation","topic":"Polynomial and algebraic computation","field":"Computer Science","cited_by":29,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"Agence Nationale de la Recherche","keywords":"Mathematics; Modular design; Degree (music); Dimension (graph theory); Inverse; Zero (linguistics); Las vegas; Field (mathematics); Algebraic number; Computation; Finite field; Set (abstract data type); Discrete mathematics; Algorithm; Combinatorics; Pure mathematics; Computer science","score_opus":0.037617557090772524,"score_gpt":0.2682194969239669,"score_spread":0.23060193983319438,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2088713140","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.60334784,0.00006372345,0.39492393,0.001111055,0.00032592143,0.00008745116,7.848908e-7,0.000014704287,0.00012458712],"genre_scores_gemma":[0.9765868,8.6914014e-7,0.022909608,0.0003224266,0.00016605799,4.9737616e-7,0.0000016682911,0.0000072988987,0.0000047845947],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982944,0.00020435786,0.0005492032,0.00011646133,0.00060958904,0.00022598353],"domain_scores_gemma":[0.99801093,0.00058768725,0.0008303512,0.00015844608,0.00029850876,0.000114091425],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000991598,0.00013956512,0.00028940872,0.00018349761,0.00014425744,0.00005268009,0.0003939047,0.00003596513,0.0000074595723],"category_scores_gemma":[0.0000691842,0.00008526184,0.00011288042,0.00041187668,0.00013038676,0.00040530367,0.00008930827,0.00021394758,0.0000082787155],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00036927487,0.0012448707,0.00212666,0.00007462643,0.00039156628,0.000028411063,0.012288575,0.17621933,0.0031587393,0.62028575,0.0046343273,0.17917784],"study_design_scores_gemma":[0.00355246,0.0015526547,0.20892502,0.00050724566,0.00008488681,0.00089688395,0.00020330938,0.61548716,0.0059358003,0.16219509,0.00015654668,0.0005029395],"about_ca_topic_score_codex":0.000010542668,"about_ca_topic_score_gemma":5.977621e-7,"teacher_disagreement_score":0.4580907,"about_ca_system_score_codex":0.000052089556,"about_ca_system_score_gemma":0.000108454515,"threshold_uncertainty_score":0.34768766},"labels":[],"label_agreement":null},{"id":"W2089632712","doi":"10.1016/j.jsc.2014.08.003","title":"Point equivalence of second-order ODEs: Maximal invariant classification order","year":2014,"lang":"en","type":"article","venue":"Journal of Symbolic Computation","topic":"Nonlinear Waves and Solitons","field":"Physics and Astronomy","cited_by":9,"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":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Ordinary differential equation; Modulo; Differential equation; Invariant (physics); Equivalence (formal languages); Order (exchange); Ode; Mathematical analysis; Pure mathematics; Equivalence class (music); Discrete mathematics; Mathematical physics","score_opus":0.019277420620638787,"score_gpt":0.28076071999738195,"score_spread":0.26148329937674314,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2089632712","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.65498716,0.000016566257,0.34061083,0.00028356077,0.000180642,0.00006406166,0.000007540168,0.0000041430353,0.0038454768],"genre_scores_gemma":[0.9867443,0.0000022870813,0.012577473,0.000042206153,0.0005067307,8.6003064e-7,0.000012130386,0.00001020766,0.00010381133],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989885,0.00007692147,0.0005213318,0.00009345797,0.00019773042,0.000122067155],"domain_scores_gemma":[0.9986618,0.000094031915,0.0005869651,0.000098169316,0.00049245846,0.000066552675],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00036866058,0.00009203918,0.00022709426,0.00010037342,0.000048285197,0.000031263084,0.00011581104,0.000030347588,0.00023608739],"category_scores_gemma":[0.000024016535,0.0000793335,0.0000903888,0.00018134227,0.000037139565,0.00018382045,0.000023836075,0.00015019509,0.000010056608],"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.00032445,0.002202366,0.049738076,0.00037700168,0.0007881009,0.0000072535813,0.009452461,0.041323476,0.08194333,0.44164163,0.003441735,0.3687601],"study_design_scores_gemma":[0.004517599,0.0010256305,0.3340393,0.00045583156,0.00023921071,0.0000712599,0.0040513836,0.5055591,0.0055389544,0.13787518,0.005934812,0.0006917467],"about_ca_topic_score_codex":0.00002400639,"about_ca_topic_score_gemma":0.0000016738065,"teacher_disagreement_score":0.4642356,"about_ca_system_score_codex":0.000017914412,"about_ca_system_score_gemma":0.0001142726,"threshold_uncertainty_score":0.3235126},"labels":[],"label_agreement":null},{"id":"W2091909596","doi":"10.1016/j.jsc.2010.08.016","title":"The modpn library: Bringing fast polynomial arithmetic into Maple","year":2010,"lang":"en","type":"article","venue":"Journal of Symbolic Computation","topic":"Polynomial and algebraic computation","field":"Computer Science","cited_by":43,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"","keywords":"Mathematics; Maple; Arithmetic; Polynomial; Algebra over a field; Pure mathematics; Botany","score_opus":0.004614438534023594,"score_gpt":0.2208467436048269,"score_spread":0.2162323050708033,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2091909596","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.56741077,0.00012623226,0.42393273,0.005197717,0.0025714831,0.00009107451,4.4091675e-7,0.000072016126,0.00059754495],"genre_scores_gemma":[0.9656706,0.000014135238,0.033052087,0.00018346673,0.000955386,0.000001585386,0.0000012226767,0.000012695489,0.000108807326],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985572,0.00007651762,0.00056315225,0.00017349358,0.00038372018,0.00024591893],"domain_scores_gemma":[0.9986888,0.00033136236,0.00049397396,0.0002007946,0.00013628595,0.00014878814],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004825607,0.00014135338,0.00019951994,0.00023253863,0.00036358938,0.00067878223,0.00084932573,0.000057250523,0.000006607061],"category_scores_gemma":[0.00007395373,0.00010441597,0.00013726446,0.00043205588,0.00006732361,0.0011468475,0.0002150299,0.00044253826,0.000020231793],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003173848,0.00007606184,0.0005303634,0.000012373497,0.000059240694,0.000023446526,0.0023546629,0.004976442,0.006147496,0.015331087,0.004269067,0.966188],"study_design_scores_gemma":[0.0012074088,0.0002493839,0.032248095,0.00006258507,0.000029441335,0.0005957472,0.00014325549,0.8809308,0.0029194679,0.065955505,0.0153089585,0.00034935868],"about_ca_topic_score_codex":0.000023992387,"about_ca_topic_score_gemma":0.000010036565,"teacher_disagreement_score":0.9658387,"about_ca_system_score_codex":0.000029553432,"about_ca_system_score_gemma":0.00022820252,"threshold_uncertainty_score":0.65455127},"labels":[],"label_agreement":null},{"id":"W2094689345","doi":"10.1016/j.jsc.2015.03.007","title":"Algorithms to compute the topological Euler characteristic, Chern–Schwartz–MacPherson class and Segre class of projective varieties","year":2015,"lang":"en","type":"article","venue":"Journal of Symbolic Computation","topic":"Polynomial and algebraic computation","field":"Computer Science","cited_by":32,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Hypersurface; Projective space; Chern class; Class (philosophy); Euler's formula; Euler characteristic; Characteristic class; Algorithm; Pure mathematics; Variety (cybernetics); Projective test; Mathematical analysis; Artificial intelligence; Computer science","score_opus":0.035709385655562816,"score_gpt":0.28035825810946524,"score_spread":0.24464887245390243,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2094689345","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.43765593,0.00010705857,0.5576546,0.0033667206,0.0008463619,0.00018007733,0.000002247963,0.000026309166,0.00016069737],"genre_scores_gemma":[0.97781366,0.0000084969215,0.021313824,0.000347468,0.0004719871,0.0000036800923,0.0000016982549,0.0000082851075,0.00003092158],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99820936,0.00023227982,0.00059732434,0.00022737375,0.00052130397,0.00021235761],"domain_scores_gemma":[0.9980564,0.0003339261,0.00059368473,0.00014504859,0.00067053695,0.00020038629],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008430334,0.00017679967,0.0003874853,0.0001757638,0.00010689663,0.00016685005,0.00045671893,0.00008018456,0.0000023731639],"category_scores_gemma":[0.00015672963,0.00012018009,0.0000895355,0.00042833903,0.0001085096,0.0004294219,0.00023735591,0.00026955575,0.0000059523404],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0004349715,0.00057707226,0.0024010658,0.00009273273,0.00035848294,0.00008741811,0.06822309,0.02428544,0.0024717946,0.039130997,0.005009704,0.8569272],"study_design_scores_gemma":[0.0023427287,0.002648032,0.15628152,0.00015561013,0.00008036393,0.0007480693,0.0019506523,0.7932158,0.0011620194,0.0368122,0.0041020135,0.0005009504],"about_ca_topic_score_codex":0.000046268353,"about_ca_topic_score_gemma":0.000004112755,"teacher_disagreement_score":0.8564263,"about_ca_system_score_codex":0.000092645634,"about_ca_system_score_gemma":0.00022863847,"threshold_uncertainty_score":0.4900802},"labels":[],"label_agreement":null},{"id":"W2095236488","doi":"10.1006/jsco.2001.0510","title":"Identities for the Associator in Alternative Algebras","year":2002,"lang":"en","type":"article","venue":"Journal of Symbolic Computation","topic":"Advanced Topics in Algebra","field":"Mathematics","cited_by":17,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Saskatchewan","funders":"Iowa State University","keywords":"Mathematics; Subalgebra; Ternary operation; Algebra over a field; Cellular algebra; Basis (linear algebra); Pure mathematics; Quaternion algebra; Degree (music); Product (mathematics); Identity (music); Algebra representation; Universal enveloping algebra; Filtered algebra; Clifford algebra; Symmetric algebra; Division algebra; Computer science; Geometry","score_opus":0.07562860651438333,"score_gpt":0.35465643429425237,"score_spread":0.279027827779869,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2095236488","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.71429557,0.00051472767,0.28209683,0.0013330576,0.00087142887,0.00028964004,0.0000034385714,0.000013503438,0.00058181817],"genre_scores_gemma":[0.9825908,0.00007392959,0.016419558,0.000101111895,0.00047213602,0.000007082161,3.1676038e-7,0.000014445437,0.00032063335],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990799,0.000047553403,0.00044131238,0.000059750582,0.00025693545,0.00011459133],"domain_scores_gemma":[0.99762535,0.0015488677,0.00052954594,0.00006374824,0.00020930555,0.000023157094],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00043470348,0.00007320238,0.00018739473,0.00011498584,0.00006115269,0.000036764377,0.00016144327,0.000033732053,0.00003065031],"category_scores_gemma":[0.00075030833,0.000053823387,0.000092494505,0.000115735835,0.000028294195,0.00019912439,0.000020107513,0.00016321392,0.0000041604876],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000059042904,0.0005068411,0.0028350342,0.00015638757,0.00046417568,0.000042200234,0.025853397,0.005960669,0.0002382181,0.8823466,0.020718534,0.060818918],"study_design_scores_gemma":[0.00073337136,0.000060090835,0.0023434265,0.00005186657,0.000030497698,0.00002957151,0.00048728986,0.013444509,0.00014195457,0.982301,0.00031339625,0.00006300155],"about_ca_topic_score_codex":0.0000018936764,"about_ca_topic_score_gemma":0.0000067766605,"teacher_disagreement_score":0.26829523,"about_ca_system_score_codex":0.00012930592,"about_ca_system_score_gemma":0.000013486768,"threshold_uncertainty_score":0.2194854},"labels":[],"label_agreement":null},{"id":"W2095532129","doi":"10.1006/jsco.2000.0387","title":"Generic Extensions and Generic Polynomials","year":2000,"lang":"en","type":"article","venue":"Journal of Symbolic Computation","topic":"Advanced Differential Equations and Dynamical Systems","field":"Mathematics","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":"Queen's University","funders":"","keywords":"Mathematics; Algebra over a field; Field (mathematics); Pure mathematics; Discrete mathematics","score_opus":0.04472600271828662,"score_gpt":0.3167375862524572,"score_spread":0.27201158353417054,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2095532129","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.76867765,0.00023127756,0.2305099,0.00012455728,0.00012154166,0.00007152278,0.0000015238555,0.000012360282,0.00024962658],"genre_scores_gemma":[0.9685573,0.000097014155,0.030807957,0.000051046747,0.00026317686,0.0000014638863,0.000001729591,0.000011992128,0.00020833714],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99904865,0.00006588511,0.0005089578,0.00008370325,0.0001858218,0.000107007276],"domain_scores_gemma":[0.9992552,0.00018127439,0.000279414,0.000067619374,0.00012139842,0.000095114585],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00016965106,0.000088271794,0.00025907214,0.000096847165,0.00008328071,0.00003379764,0.00005402778,0.000042731965,0.00009391375],"category_scores_gemma":[0.000069789494,0.000069453235,0.00006972387,0.00014261912,0.000025606534,0.00012350637,0.000011390302,0.000082200524,0.000008308494],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008493729,0.00033806,0.00043183842,0.000075885924,0.00012246329,0.00002552019,0.0011803923,0.017456189,0.011166336,0.010525176,0.0016632405,0.95693],"study_design_scores_gemma":[0.0038916045,0.0006992569,0.054689925,0.00036609557,0.00039115362,0.0015614555,0.0004922948,0.33084303,0.00033124042,0.6010013,0.004990193,0.000742444],"about_ca_topic_score_codex":0.000008328942,"about_ca_topic_score_gemma":0.000002321529,"teacher_disagreement_score":0.95618755,"about_ca_system_score_codex":0.00003245951,"about_ca_system_score_gemma":0.000026217207,"threshold_uncertainty_score":0.28322205},"labels":[],"label_agreement":null},{"id":"W2096301867","doi":"10.1016/s0747-7171(03)00021-x","title":"A matching pursuit technique for computing the simplest normal forms of vector fields","year":2003,"lang":"en","type":"article","venue":"Journal of Symbolic Computation","topic":"Numerical methods for differential equations","field":"Mathematics","cited_by":23,"is_retracted":false,"has_abstract":false,"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; Matching pursuit; Matching (statistics); Algebraic number; Computation; Simple (philosophy); Vector field; Singularity; Symbolic computation; Algebra over a field; Applied mathematics; Algorithm; Mathematical analysis; Pure mathematics","score_opus":0.05768186154231249,"score_gpt":0.3778721621319647,"score_spread":0.3201903005896522,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2096301867","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.24051557,0.000014914703,0.75867254,0.00019081596,0.00016451163,0.00031631836,0.000002420845,0.000009245979,0.000113651826],"genre_scores_gemma":[0.6966421,0.0000013488184,0.3032293,0.000026931331,0.00007553358,0.000005675703,9.0494456e-7,0.0000122528445,0.0000059450213],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.998594,0.00015599091,0.00073987443,0.00007181073,0.00028309494,0.00015525933],"domain_scores_gemma":[0.9966533,0.0020053615,0.0008872143,0.00009932398,0.00030823314,0.000046539895],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014171944,0.00010283404,0.00031115385,0.00011623723,0.00012438114,0.00003454709,0.00018242239,0.00006379427,0.0000106736015],"category_scores_gemma":[0.0008544304,0.00006935028,0.00019971079,0.00020191704,0.00003256918,0.00011432881,0.000024597879,0.00021051761,4.4107318e-7],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00018368161,0.0008558664,0.0005719837,0.00096688775,0.00050189014,0.000005532191,0.013457906,0.014663603,0.05468126,0.7486471,0.0004474761,0.1650168],"study_design_scores_gemma":[0.0005045504,0.0002617452,0.0008548394,0.000121702986,0.00009535533,0.000089360205,0.00050478574,0.0028020404,0.010121907,0.984443,0.00010472402,0.000096007556],"about_ca_topic_score_codex":0.000006677107,"about_ca_topic_score_gemma":0.0000044266076,"teacher_disagreement_score":0.4561265,"about_ca_system_score_codex":0.000042641386,"about_ca_system_score_gemma":0.00007159093,"threshold_uncertainty_score":0.28280225},"labels":[],"label_agreement":null},{"id":"W2102022978","doi":"10.1016/j.jsc.2003.08.007","title":"From the zonotope construction to the Minkowski addition of convex polytopes","year":2004,"lang":"en","type":"article","venue":"Journal of Symbolic Computation","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":163,"is_retracted":false,"has_abstract":false,"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":"Polytope; Mathematics; Parallelizable manifold; Hyperplane; Minkowski addition; Bounded function; Combinatorics; Generalization; Time complexity; Polynomial; Regular polygon; Discrete mathematics; Algorithm; Mathematical optimization","score_opus":0.010522826828227867,"score_gpt":0.2417820425937021,"score_spread":0.23125921576547423,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2102022978","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2571355,0.00014242128,0.7327576,0.008820618,0.000903911,0.00014452868,0.000009837122,0.000011033292,0.00007449502],"genre_scores_gemma":[0.9425408,0.000015484082,0.055964544,0.00067747635,0.0007744072,0.0000033564684,0.0000132926,0.000004458792,0.000006136213],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986458,0.00011754654,0.00053113396,0.00013448366,0.0004652905,0.000105784464],"domain_scores_gemma":[0.99838567,0.00033570518,0.00052994065,0.00017144479,0.00051664846,0.000060598126],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00050124514,0.000098556164,0.00017448695,0.0001447237,0.00016121099,0.00011778801,0.00046368118,0.00003855961,0.000016484246],"category_scores_gemma":[0.000119659475,0.00006205236,0.00010163118,0.00062220776,0.000051036244,0.0004270564,0.00006783862,0.00014095688,0.000017230423],"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.00006981457,0.00014132315,0.00019753254,0.0000100152,0.0001269069,0.000006863781,0.008986178,0.6326296,0.0067218817,0.061860293,0.008738778,0.2805108],"study_design_scores_gemma":[0.0063828286,0.0021244597,0.20843601,0.0007587942,0.00027326902,0.0013966274,0.0044476073,0.14851044,0.056320336,0.53115404,0.039248243,0.0009473123],"about_ca_topic_score_codex":0.00008506827,"about_ca_topic_score_gemma":0.000017451592,"teacher_disagreement_score":0.6854053,"about_ca_system_score_codex":0.00006395901,"about_ca_system_score_gemma":0.00020550805,"threshold_uncertainty_score":0.25304216},"labels":[],"label_agreement":null},{"id":"W2111878548","doi":"10.1016/j.jsc.2014.02.003","title":"On the length of integers in telescopers for proper hypergeometric terms","year":2014,"lang":"en","type":"article","venue":"Journal of Symbolic Computation","topic":"Polynomial and algebraic computation","field":"Computer Science","cited_by":12,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Capilano University; Simon Fraser University","funders":"","keywords":"Mathematics; Telescoping series; Bivariate analysis; Integer (computer science); Quintic function; Hypergeometric distribution; Combinatorics; Order (exchange); Hypergeometric identity; Upper and lower bounds; Degree (music); Term (time); Binomial (polynomial); Hypergeometric function; Discrete mathematics; Confluent hypergeometric function; Pure mathematics; Hypergeometric function of a matrix argument; Statistics; Mathematical analysis","score_opus":0.01440523090187036,"score_gpt":0.23948412278618766,"score_spread":0.22507889188431732,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2111878548","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.54811156,0.000021940963,0.45007375,0.0011108884,0.0002973606,0.00013734831,3.3275427e-7,0.0000067241563,0.00024013502],"genre_scores_gemma":[0.9940834,0.000004615389,0.005562038,0.00022520666,0.00010158369,0.0000038731832,4.99254e-7,0.000005816077,0.000012976361],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988733,0.00010295009,0.0004961499,0.00012033167,0.00027196173,0.00013529265],"domain_scores_gemma":[0.99849564,0.00076000876,0.00041560282,0.000112859365,0.00017365135,0.00004224587],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00095806096,0.00009274623,0.00022243212,0.0005206113,0.00004618143,0.000049764232,0.00042683235,0.00003194781,0.000002094438],"category_scores_gemma":[0.00037794554,0.00005710566,0.0001033607,0.00067391834,0.000031462216,0.00024104046,0.000039562983,0.00013929469,0.0000030291576],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000855578,0.00022913117,0.0005507959,0.000044547847,0.00004053178,0.0000019040276,0.0020629598,0.08219246,0.0019595094,0.059599694,0.0009677699,0.8522651],"study_design_scores_gemma":[0.002062483,0.0015591198,0.032708187,0.00029164096,0.000018340352,0.000046209196,0.00015247542,0.8906964,0.0038150346,0.06763152,0.0007860753,0.00023250771],"about_ca_topic_score_codex":0.00001019285,"about_ca_topic_score_gemma":0.0000019857468,"teacher_disagreement_score":0.8520326,"about_ca_system_score_codex":0.000055020486,"about_ca_system_score_gemma":0.000068903835,"threshold_uncertainty_score":0.23287012},"labels":[],"label_agreement":null},{"id":"W2112151791","doi":"10.1016/j.jsc.2012.05.013","title":"Computing with semi-algebraic sets: Relaxation techniques and effective boundaries","year":2012,"lang":"en","type":"article","venue":"Journal of Symbolic Computation","topic":"Polynomial and algebraic computation","field":"Computer Science","cited_by":12,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"","keywords":"Mathematics; Algebraic number; Parametric statistics; Relaxation (psychology); Chen; Decomposition; Boundary (topology); Polynomial; Characterization (materials science); Algebraic properties; Real algebraic geometry; Algebra over a field; Discrete mathematics; Pure mathematics; Mathematical analysis","score_opus":0.006640947570208393,"score_gpt":0.24592998221887238,"score_spread":0.239289034648664,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2112151791","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.51069343,0.00035601197,0.48797113,0.00034315218,0.00026915324,0.00014211044,3.3718473e-7,0.00006585382,0.00015881215],"genre_scores_gemma":[0.95338565,0.000011519638,0.046105064,0.00010376025,0.00037274204,0.0000025259596,0.000002060636,0.000010610608,0.000006045273],"study_design_codex":"design_other","study_design_gemma":"observational","domain_scores_codex":[0.99867415,0.00014667919,0.00042990877,0.0001568066,0.00034761862,0.00024480786],"domain_scores_gemma":[0.99853146,0.00028302564,0.0006822628,0.000097729295,0.0002634994,0.0001420201],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007346123,0.00016418347,0.00026935767,0.0002869462,0.00027275019,0.0003414175,0.00018917197,0.00006023969,0.00000111979],"category_scores_gemma":[0.0000513895,0.00013038558,0.00005282607,0.00040025418,0.00010303852,0.0015993487,0.000097336604,0.00022153609,0.0000031202069],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000059553295,0.00011795455,0.0065839114,0.00005672541,0.000086265274,0.000016636544,0.009907041,0.0008105604,0.0005879338,0.017043212,0.0003042777,0.9644259],"study_design_scores_gemma":[0.005870409,0.004359988,0.64249414,0.0015768403,0.00027583275,0.011465762,0.0010884652,0.22641616,0.018871618,0.07574323,0.010010513,0.0018270557],"about_ca_topic_score_codex":0.000013555125,"about_ca_topic_score_gemma":0.0000013610891,"teacher_disagreement_score":0.96259886,"about_ca_system_score_codex":0.00010277284,"about_ca_system_score_gemma":0.00011681363,"threshold_uncertainty_score":0.531697},"labels":[],"label_agreement":null},{"id":"W2113737071","doi":"10.1016/j.jsc.2010.08.014","title":"Sparse polynomial division using a heap","year":2010,"lang":"en","type":"article","venue":"Journal of Symbolic Computation","topic":"Polynomial and algebraic computation","field":"Computer Science","cited_by":43,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Heap (data structure); Mathematics; Maple; Multiplication (music); Polynomial; Division (mathematics); Discrete mathematics; Algebra over a field; Arithmetic; Combinatorics; Algorithm; Pure mathematics","score_opus":0.018389445446087435,"score_gpt":0.2752023028350068,"score_spread":0.25681285738891935,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2113737071","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5532261,0.000025986725,0.4445142,0.00039571838,0.0016764059,0.00004776698,3.5781844e-7,0.000025372978,0.00008809919],"genre_scores_gemma":[0.9323375,0.0000022928891,0.06682325,0.00013406988,0.00068162143,3.9279143e-7,8.7205666e-7,0.000008668497,0.000011297036],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99854654,0.00006791501,0.0005839236,0.00017789511,0.00041168503,0.00021203031],"domain_scores_gemma":[0.9987164,0.00012804533,0.0005660254,0.00015995993,0.0002647746,0.00016480549],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00052356074,0.00013849884,0.00024950766,0.0003445836,0.000139698,0.00020716581,0.00047565126,0.00007264173,0.000009447673],"category_scores_gemma":[0.00007278803,0.00012258584,0.00014339639,0.00039146474,0.000037577727,0.00088337046,0.00013052397,0.00035831757,0.000015074813],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005542994,0.00033670067,0.0020285498,0.000024733454,0.00006845852,0.00007992882,0.002698833,0.0363419,0.16058521,0.0070943465,0.0017608001,0.7889251],"study_design_scores_gemma":[0.0013564184,0.00026921168,0.042738535,0.00006837377,0.000023790808,0.0008026509,0.00003359344,0.9370119,0.003798684,0.012264069,0.0013369047,0.0002958615],"about_ca_topic_score_codex":0.000029914798,"about_ca_topic_score_gemma":0.0000051848315,"teacher_disagreement_score":0.90067,"about_ca_system_score_codex":0.000049760005,"about_ca_system_score_gemma":0.00023278013,"threshold_uncertainty_score":0.49989054},"labels":[],"label_agreement":null},{"id":"W2114412781","doi":"10.1016/j.jsc.2011.08.006","title":"Detecting lacunary perfect powers and computing their roots","year":2011,"lang":"en","type":"article","venue":"Journal of Symbolic Computation","topic":"Coding theory and cryptography","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":"University of Waterloo","funders":"","keywords":"Lacunary function; Mathematics; Polynomial; Integer (computer science); Combinatorics; Computation; Randomized algorithm; Representation (politics); Conjecture; Discrete mathematics; Algorithm; Mathematical analysis; Computer science","score_opus":0.021891256590385367,"score_gpt":0.23571256640937882,"score_spread":0.21382130981899344,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2114412781","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5936849,0.00016975618,0.40512374,0.00005133282,0.0002585224,0.000032592296,1.06976934e-7,0.000032625274,0.00064640504],"genre_scores_gemma":[0.9742421,0.000008077442,0.025555624,0.00008657703,0.00009900936,2.1158218e-7,1.2164813e-7,0.0000067526707,0.0000015507499],"study_design_codex":"design_other","study_design_gemma":"observational","domain_scores_codex":[0.9990273,0.0001622621,0.0003396803,0.00014528078,0.00016302237,0.00016242113],"domain_scores_gemma":[0.99905807,0.00023830251,0.00036347785,0.00010675539,0.00014172701,0.00009165336],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00097059354,0.0001148158,0.00019133561,0.00029093807,0.00016135914,0.000091708505,0.00030211304,0.000043009986,0.0000042260676],"category_scores_gemma":[0.000045684264,0.00009614533,0.00010522342,0.000338035,0.000042581705,0.0004447796,0.000118113385,0.00022393033,0.0000018634724],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007622763,0.00012967343,0.009159725,0.00004181041,0.00010752008,0.00006767961,0.033941995,0.0009251296,0.003130707,0.013959174,0.00008314276,0.9383772],"study_design_scores_gemma":[0.0024052416,0.0024632164,0.46226946,0.00048915314,0.00009109563,0.0039805328,0.003940624,0.3011213,0.006373814,0.21572676,0.0002721363,0.0008666803],"about_ca_topic_score_codex":0.000004853191,"about_ca_topic_score_gemma":8.336697e-7,"teacher_disagreement_score":0.93751055,"about_ca_system_score_codex":0.000017767296,"about_ca_system_score_gemma":0.000031333737,"threshold_uncertainty_score":0.39206928},"labels":[],"label_agreement":null},{"id":"W2115204962","doi":"10.1016/j.jsc.2007.10.013","title":"Solving polynomial systems via symbolic-numeric reduction to geometric involutive form","year":2008,"lang":"en","type":"article","venue":"Journal of Symbolic Computation","topic":"Numerical Methods and Algorithms","field":"Computer Science","cited_by":25,"is_retracted":false,"has_abstract":false,"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; Reduction (mathematics); Polynomial; Algebra over a field; Symbolic computation; Applied mathematics; Partial differential equation; Pure mathematics; Mathematical analysis; Geometry","score_opus":0.025414302656878687,"score_gpt":0.27760462594355306,"score_spread":0.2521903232866744,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2115204962","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.22937071,0.0003525489,0.76711744,0.00032558737,0.0024911494,0.00017333742,6.364293e-7,0.00004737555,0.00012119338],"genre_scores_gemma":[0.810269,0.000044188393,0.18851529,0.000087966306,0.001017369,0.0000047841745,6.7514645e-7,0.00001474438,0.00004597038],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99759895,0.0001963204,0.00086941966,0.00028612107,0.00067962846,0.00036955505],"domain_scores_gemma":[0.9980246,0.00019605193,0.00074419467,0.00019833709,0.0005168854,0.00031996745],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00073853804,0.00020281444,0.00052424043,0.0011051594,0.00027377432,0.00017895197,0.0005420709,0.00007862508,0.000002619078],"category_scores_gemma":[0.00014036406,0.00017962448,0.00017682204,0.002561539,0.000042213436,0.0011740418,0.00013784897,0.0002989791,0.000029773795],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000063916705,0.00029668715,0.0005982714,0.00004475472,0.0001359466,0.00010976329,0.0062471926,0.037701547,0.0077431053,0.0006048185,0.0029207973,0.9435332],"study_design_scores_gemma":[0.0027213716,0.003301112,0.11873054,0.0003770113,0.00010343237,0.015231575,0.0011061856,0.84341216,0.0037435791,0.0062579964,0.0036380845,0.0013769687],"about_ca_topic_score_codex":0.0001450499,"about_ca_topic_score_gemma":2.914777e-7,"teacher_disagreement_score":0.94215626,"about_ca_system_score_codex":0.00030333482,"about_ca_system_score_gemma":0.00018690538,"threshold_uncertainty_score":0.7324874},"labels":[],"label_agreement":null},{"id":"W2126318803","doi":"10.1016/s0747-7171(03)00088-9","title":"Early termination in sparse interpolation algorithms","year":2003,"lang":"en","type":"article","venue":"Journal of Symbolic Computation","topic":"Advanced Combinatorial Mathematics","field":"Mathematics","cited_by":117,"is_retracted":false,"has_abstract":false,"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":"Interpolation (computer graphics); Algorithm; Mathematics; Univariate; Heuristics; Probabilistic logic; Probabilistic analysis of algorithms; Polynomial interpolation; Polynomial; Computer science; Multivariate statistics; Linear interpolation; Mathematical optimization; Artificial intelligence; Statistics","score_opus":0.038697916394013085,"score_gpt":0.3381397188642772,"score_spread":0.2994418024702641,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2126318803","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7150477,0.000025732816,0.28323796,0.00004354459,0.00060086977,0.00014394923,3.3984307e-7,0.000014979417,0.0008849207],"genre_scores_gemma":[0.90463656,0.0000051183347,0.09519948,0.000010171068,0.00009662394,0.0000023682019,5.4183033e-7,0.00001786047,0.000031258987],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99850667,0.00013810399,0.0007890773,0.00009049944,0.00033980038,0.00013582784],"domain_scores_gemma":[0.9984128,0.00039548468,0.00075740734,0.00009271943,0.00028927147,0.000052306576],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007530345,0.00011577363,0.00028326653,0.00035150864,0.000030440773,0.000035098066,0.00009850188,0.00006909289,0.000012224659],"category_scores_gemma":[0.00095062057,0.0001104788,0.00007132192,0.00030960736,0.00001846829,0.00040313456,0.000012654477,0.00020986913,0.0000063575544],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00015721895,0.0020058763,0.007281507,0.0004052027,0.00014394992,0.00016381625,0.026032522,0.004543033,0.0070889415,0.85578525,0.00075950875,0.09563319],"study_design_scores_gemma":[0.0011998257,0.00017241122,0.005478042,0.00019708002,0.000024936644,0.00012041989,0.00033412967,0.012108352,0.00063460384,0.97953045,0.00007373364,0.00012600502],"about_ca_topic_score_codex":0.0000022011898,"about_ca_topic_score_gemma":0.0000017627224,"teacher_disagreement_score":0.18958889,"about_ca_system_score_codex":0.00015217361,"about_ca_system_score_gemma":0.000058846483,"threshold_uncertainty_score":0.45051947},"labels":[],"label_agreement":null},{"id":"W2127412655","doi":"10.1006/jsco.2000.0370","title":"Challenges of Symbolic Computation: My Favorite Open Problems","year":2000,"lang":"en","type":"article","venue":"Journal of Symbolic Computation","topic":"Polynomial and algebraic computation","field":"Computer Science","cited_by":82,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Simon Fraser University","keywords":"Symbolic computation; Symbolic-numeric computation; The Symbolic; Computation; Computer science; Mathematics; Theoretical computer science; Algebra over a field; Programming language; Pure mathematics","score_opus":0.03688501806389176,"score_gpt":0.2866758961192889,"score_spread":0.24979087805539713,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2127412655","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5109756,0.0027062604,0.46693307,0.0056260703,0.0012067265,0.0007393938,0.0000048765532,0.00011876171,0.011689275],"genre_scores_gemma":[0.9778448,0.00034898522,0.02115449,0.00016752999,0.00035400444,0.000005466681,0.0000049688274,0.000018449638,0.00010130218],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99715257,0.00023916052,0.0012685447,0.0003573113,0.0006733674,0.00030906557],"domain_scores_gemma":[0.9977237,0.00025550395,0.001031731,0.0002505045,0.0005444615,0.0001941148],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009326838,0.00025351343,0.00064228766,0.00039435513,0.00014742081,0.0002864862,0.0013497974,0.000096584445,0.00003436634],"category_scores_gemma":[0.000033810884,0.00023363234,0.00019564471,0.00069506926,0.000071711176,0.0015658666,0.00022372368,0.00026606952,0.000040631912],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000039952905,0.0002856294,0.00009305352,0.00007911667,0.00009074996,0.000016272865,0.0049720984,0.06996448,0.00033639238,0.011607051,0.0005284035,0.91198677],"study_design_scores_gemma":[0.0072097755,0.0024569905,0.11595151,0.0013401468,0.00013714397,0.0014530531,0.000550266,0.62657404,0.0013832093,0.23489259,0.0068453862,0.0012059218],"about_ca_topic_score_codex":0.00005644484,"about_ca_topic_score_gemma":0.000010266547,"teacher_disagreement_score":0.91078085,"about_ca_system_score_codex":0.00008597877,"about_ca_system_score_gemma":0.00027986438,"threshold_uncertainty_score":0.95272505},"labels":[],"label_agreement":null},{"id":"W2129089669","doi":"10.1016/j.jsc.2011.09.003","title":"Genus 2 point counting over prime fields","year":2011,"lang":"en","type":"article","venue":"Journal of Symbolic Computation","topic":"Cryptography and Residue Arithmetic","field":"Computer Science","cited_by":71,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"","keywords":"Mathematics; Genus; Prime (order theory); Jacobian matrix and determinant; Twists of curves; Computation; Prime number; Twist; Discrete mathematics; Combinatorics; Elliptic curve; Algorithm; Schoof's algorithm; Pure mathematics; Applied mathematics; Geometry","score_opus":0.017780788056884152,"score_gpt":0.23933967493675026,"score_spread":0.2215588868798661,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2129089669","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.30110168,0.0001611436,0.6969822,0.00016365078,0.00047095594,0.000039348488,1.3485963e-7,0.000020507443,0.0010603487],"genre_scores_gemma":[0.94809335,0.000016104379,0.051576044,0.00016422058,0.00013765934,4.3659568e-7,1.8585185e-7,0.0000044188705,0.0000076010374],"study_design_codex":"design_other","study_design_gemma":"observational","domain_scores_codex":[0.9990719,0.000047754453,0.00036521716,0.000104523875,0.00027012135,0.00014049093],"domain_scores_gemma":[0.9992057,0.000064201704,0.00034985805,0.000120453005,0.00019005872,0.00006973411],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003809896,0.00008045394,0.00014996443,0.00023502666,0.00007188778,0.000070329406,0.00033041008,0.000049668786,0.00002027826],"category_scores_gemma":[0.000025025398,0.00006683704,0.00012209556,0.00030420843,0.000023977156,0.00046751017,0.000062611834,0.00017213845,0.000007989123],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012850255,0.0011151949,0.021426419,0.00013047969,0.00053033046,0.0006531927,0.056234434,0.0064103687,0.003245598,0.08983021,0.004521675,0.8157736],"study_design_scores_gemma":[0.00228369,0.0009841616,0.70069176,0.00026503115,0.00009307531,0.0015268503,0.00032210338,0.1728571,0.005959429,0.112768106,0.0016502877,0.0005984002],"about_ca_topic_score_codex":0.000029939754,"about_ca_topic_score_gemma":0.0000024671308,"teacher_disagreement_score":0.8151752,"about_ca_system_score_codex":0.000020696407,"about_ca_system_score_gemma":0.00006304046,"threshold_uncertainty_score":0.27255353},"labels":[],"label_agreement":null},{"id":"W2133068164","doi":"10.1016/j.jsc.2011.08.018","title":"New solutions for ordinary differential equations","year":2011,"lang":"en","type":"article","venue":"Journal of Symbolic Computation","topic":"Numerical methods for differential equations","field":"Mathematics","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 British Columbia","funders":"","keywords":"Ode; Mathematics; Ordinary differential equation; Integrating factor; Applied mathematics; Nonlinear system; Invertible matrix; Differential equation; Mathematical analysis; Differential algebraic equation; Pure mathematics","score_opus":0.234487656559519,"score_gpt":0.3882666300393659,"score_spread":0.1537789734798469,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2133068164","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.022274993,0.00004167904,0.97604716,0.00020218322,0.0008266617,0.00027156,0.000007064695,0.000036718542,0.00029198115],"genre_scores_gemma":[0.43693754,0.0000035491855,0.5625171,0.000014163354,0.00036802745,0.0000072539556,0.0000048410107,0.000019954756,0.00012755202],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985329,0.00011874149,0.0007291303,0.00011102451,0.00027061856,0.0002375829],"domain_scores_gemma":[0.99770707,0.00095555047,0.00064280827,0.00011618101,0.00041451666,0.0001638968],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00038562113,0.00013049778,0.00031964676,0.0002644489,0.00018264948,0.000030425894,0.00017560166,0.00007019111,0.00020212066],"category_scores_gemma":[0.0009887174,0.00011539473,0.00027378983,0.00024122983,0.0000302575,0.00023039425,0.000041621624,0.00015632552,0.000008461824],"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.0002627402,0.0011316129,0.00009910198,0.00010716127,0.00047903368,0.000004697326,0.0055271806,0.00031224266,0.0054897554,0.45895302,0.0076575577,0.5199759],"study_design_scores_gemma":[0.0009698315,0.0004145516,0.002769824,0.000050958344,0.00029801507,0.000028489156,0.00012752724,0.008900018,0.00033024335,0.9857936,0.00017895759,0.0001380182],"about_ca_topic_score_codex":0.000021077998,"about_ca_topic_score_gemma":0.0000053073027,"teacher_disagreement_score":0.5268405,"about_ca_system_score_codex":0.000070573464,"about_ca_system_score_gemma":0.00015839684,"threshold_uncertainty_score":0.47056606},"labels":[],"label_agreement":null},{"id":"W2136692263","doi":"10.1016/j.jsc.2008.04.020","title":"Implicit Riquier Bases for PDAE and their semi-discretizations","year":2008,"lang":"en","type":"article","venue":"Journal of Symbolic Computation","topic":"Polynomial and algebraic computation","field":"Computer Science","cited_by":12,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto; Western University","funders":"Natural Sciences and Engineering Research Council of Canada; National Science Foundation","keywords":"Mathematics; Algebra over a field; Pure mathematics; Calculus (dental)","score_opus":0.016961552615715466,"score_gpt":0.24801522430343043,"score_spread":0.23105367168771496,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2136692263","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3230179,0.00016855187,0.67526484,0.0011178614,0.00022009216,0.00010084542,0.0000030243002,0.00002517073,0.00008170382],"genre_scores_gemma":[0.9778298,0.000045705696,0.0214622,0.0003223383,0.00028376933,0.0000039781717,0.000004558355,0.000008112042,0.000039511968],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990881,0.000044638655,0.00041303015,0.0001517728,0.00014941084,0.00015306153],"domain_scores_gemma":[0.9988466,0.00031607735,0.00033432065,0.000091803435,0.00030493157,0.00010629375],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00021494903,0.00011840464,0.00021927102,0.00021164297,0.00022451169,0.0000769708,0.00021881834,0.000039305178,0.0000023260227],"category_scores_gemma":[0.00006723236,0.00009436513,0.00009938707,0.00026563273,0.00004393058,0.0005553708,0.000061858926,0.00008728585,0.000001740993],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00014843907,0.00053509785,0.0039088344,0.00013875404,0.0003098857,0.000042704247,0.022416577,0.057973567,0.015530023,0.0626159,0.02061484,0.8157654],"study_design_scores_gemma":[0.0021788864,0.0006753108,0.060851965,0.00011256924,0.00003053534,0.001848012,0.0002087852,0.844176,0.0029726424,0.08020641,0.006326439,0.00041243274],"about_ca_topic_score_codex":0.000006702423,"about_ca_topic_score_gemma":0.0000015157019,"teacher_disagreement_score":0.8153529,"about_ca_system_score_codex":0.000033207052,"about_ca_system_score_gemma":0.00012785786,"threshold_uncertainty_score":0.38480982},"labels":[],"label_agreement":null},{"id":"W2141336296","doi":"10.1016/j.jsc.2006.02.001","title":"Normal forms for general polynomial matrices","year":2006,"lang":"en","type":"article","venue":"Journal of Symbolic Computation","topic":"Polynomial and algebraic computation","field":"Computer Science","cited_by":54,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Mathematics; Matrix polynomial; Polynomial matrix; Matrix (chemical analysis); Computation; Hermite polynomials; Polynomial; Algebra over a field; Pure mathematics; Discrete mathematics; Mathematical analysis; Algorithm","score_opus":0.00823453275827883,"score_gpt":0.24276188508145452,"score_spread":0.2345273523231757,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2141336296","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.40860495,0.00010720448,0.5897468,0.0004911907,0.0005540074,0.00009553596,0.0000016548005,0.000028902503,0.00036978823],"genre_scores_gemma":[0.91650265,0.0000038044086,0.08179879,0.000118267984,0.0014643135,0.0000032937148,0.000006308324,0.000008503993,0.00009403583],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986709,0.000031034124,0.00062507635,0.00014780433,0.0002933581,0.00023187476],"domain_scores_gemma":[0.99886096,0.00013202082,0.0005843709,0.00008734908,0.00026059125,0.000074717434],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00034438117,0.00012756833,0.00023044719,0.00029437637,0.0001278289,0.00019791194,0.0003896689,0.000051761966,0.0000025722015],"category_scores_gemma":[0.000016596394,0.00010804705,0.00018582531,0.00028777274,0.000019910442,0.0009000746,0.000057946967,0.0000968637,0.000006170816],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00023104546,0.00047531514,0.0016877073,0.000092199785,0.00011343362,0.000035861598,0.0008833878,0.12031595,0.007889332,0.15802576,0.03406359,0.67618644],"study_design_scores_gemma":[0.004341712,0.0009883968,0.07465571,0.000067053064,0.000060005295,0.0005956263,0.000036026733,0.75923854,0.004752984,0.14243567,0.012281895,0.0005463607],"about_ca_topic_score_codex":0.000043561417,"about_ca_topic_score_gemma":0.000004718558,"teacher_disagreement_score":0.67564005,"about_ca_system_score_codex":0.00007214507,"about_ca_system_score_gemma":0.00014069297,"threshold_uncertainty_score":0.44060308},"labels":[],"label_agreement":null},{"id":"W2145025251","doi":"10.1016/j.jsc.2009.05.003","title":"Automatic computation of the complete root classification for a parametric polynomial","year":2009,"lang":"en","type":"article","venue":"Journal of Symbolic Computation","topic":"Polynomial and algebraic computation","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"","keywords":"Mathematics; Discriminant; Sign (mathematics); Root (linguistics); Computation; Positive definiteness; Polynomial; Parametric statistics; Sequence (biology); Characteristic polynomial; Class (philosophy); Linear discriminant analysis; Algorithm; Combinatorics; Discrete mathematics; Artificial intelligence; Positive-definite matrix; Mathematical analysis; Statistics; Computer science; Eigenvalues and eigenvectors","score_opus":0.03063142354722671,"score_gpt":0.2820513312423598,"score_spread":0.2514199076951331,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2145025251","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.41148475,0.000077455494,0.5852971,0.0021742159,0.000603452,0.00028053203,0.0000022971906,0.000028948978,0.000051278745],"genre_scores_gemma":[0.96963286,0.000002577221,0.02993112,0.00017933552,0.00023226363,0.0000034137786,0.000004068846,0.0000076120737,0.0000067300334],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9978182,0.00016568376,0.0010778586,0.0002009811,0.0005270348,0.00021024806],"domain_scores_gemma":[0.99706125,0.00041264785,0.0016663714,0.00019545294,0.00057835574,0.00008592609],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006626151,0.00016617267,0.000383981,0.00045189157,0.00018461482,0.00012401797,0.0006704315,0.000071274015,0.0000013490754],"category_scores_gemma":[0.00020441398,0.00012714344,0.00028846503,0.0010988121,0.0000505607,0.0005254106,0.00005099273,0.00016410158,0.0000027729216],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006151484,0.00034474992,0.0004619414,0.00006824826,0.000067023175,0.0000015207115,0.0013464853,0.048166305,0.0065303785,0.011684174,0.0021217966,0.9291459],"study_design_scores_gemma":[0.0010301898,0.00040188842,0.22310512,0.000087934815,0.000034278208,0.00006024426,0.000028672146,0.75070155,0.00047903362,0.02384214,0.00011314506,0.00011581619],"about_ca_topic_score_codex":0.0000073455108,"about_ca_topic_score_gemma":0.0000019040164,"teacher_disagreement_score":0.92903006,"about_ca_system_score_codex":0.00012863064,"about_ca_system_score_gemma":0.00025045805,"threshold_uncertainty_score":0.51847595},"labels":[],"label_agreement":null},{"id":"W2150928761","doi":"10.1016/j.jsc.2011.12.014","title":"Triangular decomposition of semi-algebraic systems","year":2011,"lang":"en","type":"article","venue":"Journal of Symbolic Computation","topic":"Polynomial and algebraic computation","field":"Computer Science","cited_by":57,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"","keywords":"Decomposition; Mathematics; Algebraic number; Polynomial; Exponential function; Algebra over a field; Triangular matrix; Discrete mathematics; Algorithm; Pure mathematics; Mathematical analysis","score_opus":0.02228769174550693,"score_gpt":0.2552590522068215,"score_spread":0.23297136046131456,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2150928761","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.39986026,0.0003155341,0.59845877,0.00006670953,0.00082080584,0.000097881406,7.250333e-7,0.000025432419,0.00035385002],"genre_scores_gemma":[0.9836685,0.000014395974,0.016053371,0.000039201306,0.00019982454,0.0000016260786,0.000001970241,0.000008082934,0.0000130043245],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982417,0.0001543962,0.00088984234,0.00015046459,0.00040183213,0.00016175344],"domain_scores_gemma":[0.99813,0.0001202726,0.001055375,0.00015366811,0.00043143582,0.0001092101],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00060791476,0.00012939106,0.00035311715,0.0004099406,0.00005764191,0.000060004895,0.0004595962,0.000062763655,0.000007223943],"category_scores_gemma":[0.000037452344,0.00011576091,0.00016103369,0.00045903228,0.000033194163,0.0007044655,0.000066156535,0.00013395451,0.000009711403],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0004626907,0.0017407156,0.0032167323,0.0004928218,0.0006982958,0.0002378205,0.032709226,0.06762118,0.040398702,0.22255814,0.0029945914,0.6268691],"study_design_scores_gemma":[0.0056328974,0.0027725436,0.11686962,0.00090553187,0.00017717264,0.002041297,0.000621229,0.72083783,0.027356446,0.121366456,0.0005642938,0.0008547029],"about_ca_topic_score_codex":0.00005071031,"about_ca_topic_score_gemma":9.421267e-7,"teacher_disagreement_score":0.6532166,"about_ca_system_score_codex":0.00006017271,"about_ca_system_score_gemma":0.00013035849,"threshold_uncertainty_score":0.47205928},"labels":[],"label_agreement":null},{"id":"W2152724910","doi":"10.1016/j.jsc.2010.06.021","title":"On the De Boer–Pellikaan method for computing minimum distance","year":2010,"lang":"en","type":"article","venue":"Journal of Symbolic Computation","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":31,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"","keywords":"Mathematics; Connection (principal bundle); Ideal (ethics); Code (set theory); Projective test; Minimum distance; Discrete mathematics; Algebra over a field; Arithmetic; Pure mathematics; Combinatorics; Geometry; Law; Computer science; Programming language","score_opus":0.013182069695073288,"score_gpt":0.2990532433500757,"score_spread":0.2858711736550024,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2152724910","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15440683,0.00002491814,0.84251124,0.0019567457,0.0006866947,0.00010130038,5.8251635e-7,0.000023730978,0.0002879483],"genre_scores_gemma":[0.7757107,0.0000014203832,0.22356547,0.00046452894,0.00024284302,0.0000013743527,2.907596e-7,0.000006093473,0.0000072787648],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99895185,0.00015547143,0.00033843293,0.00013662608,0.0002245879,0.0001930526],"domain_scores_gemma":[0.9971783,0.0019431368,0.0004094824,0.00018368816,0.00020994394,0.000075428135],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021083474,0.0001033996,0.00016620597,0.00013889442,0.00022757627,0.00016814149,0.0006343459,0.000045174478,0.0000043858313],"category_scores_gemma":[0.00020073027,0.000072814946,0.0001793355,0.00030596685,0.00003697823,0.00016519618,0.000044422766,0.0003258294,0.000002561744],"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.00005167789,0.0000880208,0.00012456976,0.0000136887,0.00003705621,0.000004410465,0.0024891736,0.0072554187,0.0040291017,0.81488705,0.0010893124,0.16993053],"study_design_scores_gemma":[0.00035252367,0.00021555545,0.0017079676,0.000040669252,0.000014206989,0.00009537649,0.000082622704,0.59354275,0.0010525404,0.40146708,0.0013277764,0.00010091109],"about_ca_topic_score_codex":0.0000013886225,"about_ca_topic_score_gemma":0.0000026591742,"teacher_disagreement_score":0.62130386,"about_ca_system_score_codex":0.000020613546,"about_ca_system_score_gemma":0.00006188465,"threshold_uncertainty_score":0.29693076},"labels":[],"label_agreement":null},{"id":"W2153131327","doi":"10.1016/j.jsc.2011.08.015","title":"Homotopy techniques for multiplication modulo triangular sets","year":2011,"lang":"en","type":"article","venue":"Journal of Symbolic Computation","topic":"Polynomial and algebraic computation","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"","keywords":"Mathematics; Modulo; Multiplication (music); Homotopy; Algebraic number; Algebra over a field; Interpolation (computer graphics); Discrete mathematics; Arithmetic; Combinatorics; Pure mathematics; Mathematical analysis","score_opus":0.03262150932117265,"score_gpt":0.2785053708529415,"score_spread":0.2458838615317689,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2153131327","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08316745,0.000079718026,0.91523194,0.00047486695,0.00044210805,0.00031073377,0.0000015720307,0.00008480626,0.00020679334],"genre_scores_gemma":[0.70722455,0.000008082882,0.29242104,0.00012813702,0.00018134608,0.000012286954,0.0000028305733,0.000007901806,0.000013844705],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99880934,0.000060456536,0.00056325016,0.00017646252,0.00022738958,0.0001630865],"domain_scores_gemma":[0.9985766,0.0001271868,0.0006049531,0.00015734855,0.00044192074,0.000091988855],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005351836,0.00012141934,0.00022790211,0.00029558298,0.00009272281,0.000071789575,0.00044013862,0.00006331,0.00000302187],"category_scores_gemma":[0.000078956815,0.00010932493,0.00015726783,0.0002788384,0.00002200775,0.00067787187,0.000052533236,0.00010107283,0.000005124706],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006216388,0.00018675567,0.00009316918,0.00002531592,0.0000413557,0.000005527305,0.0029513345,0.0003032515,0.0036935352,0.011884818,0.0010966623,0.9796561],"study_design_scores_gemma":[0.0028325613,0.0014235685,0.030455988,0.00016491582,0.00006880606,0.00033240812,0.00011140155,0.5829543,0.06402305,0.3141704,0.0029287294,0.0005338971],"about_ca_topic_score_codex":0.00001422428,"about_ca_topic_score_gemma":0.0000011751362,"teacher_disagreement_score":0.9791222,"about_ca_system_score_codex":0.00006229766,"about_ca_system_score_gemma":0.00009425836,"threshold_uncertainty_score":0.44581413},"labels":[],"label_agreement":null},{"id":"W2158079656","doi":"10.1016/j.jsc.2007.03.001","title":"Output-sensitive modular algorithms for polynomial matrix normal forms","year":2007,"lang":"en","type":"article","venue":"Journal of Symbolic Computation","topic":"Polynomial and algebraic computation","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo; University of Lethbridge","funders":"","keywords":"Mathematics; Unimodular matrix; Polynomial matrix; Algorithm; Matrix multiplication; Polynomial; Normalization (sociology); Modular arithmetic; Matrix (chemical analysis); Homomorphism; Integer matrix; Matrix polynomial; Algebra over a field; Discrete mathematics; Combinatorics; Pure mathematics; Symmetric matrix; Eigenvalues and eigenvectors","score_opus":0.016271988497507783,"score_gpt":0.2861105198451552,"score_spread":0.2698385313476474,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2158079656","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2879018,0.000068057685,0.71005255,0.0005196436,0.0010954296,0.0001793054,0.0000028820934,0.000039717856,0.00014060354],"genre_scores_gemma":[0.8863814,0.000004463946,0.112286635,0.00018696566,0.0010494118,0.0000016329684,0.0000059235317,0.000013419602,0.00007014849],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9980428,0.000040039395,0.0008477659,0.00022483131,0.00045616066,0.00038840453],"domain_scores_gemma":[0.99806964,0.00032584317,0.00071395125,0.00013038416,0.0005629024,0.00019726703],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012569707,0.00018737275,0.00034152326,0.00045761763,0.00017031912,0.0001582912,0.00040598054,0.00009109358,0.0000012468576],"category_scores_gemma":[0.00007092831,0.00016598371,0.00026032288,0.00037840358,0.00003667657,0.0009659925,0.0000933692,0.00019300413,0.000009760951],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00025844906,0.0002032229,0.0001424553,0.000036378213,0.00013303461,0.000080908896,0.0030410758,0.027286302,0.00409618,0.008181809,0.001636274,0.9549039],"study_design_scores_gemma":[0.0044464553,0.0011770127,0.04118558,0.00009692534,0.000068521826,0.0010390878,0.0003150105,0.91509175,0.011815372,0.020776685,0.0033984252,0.0005891574],"about_ca_topic_score_codex":0.0000146639795,"about_ca_topic_score_gemma":0.000003809365,"teacher_disagreement_score":0.95431477,"about_ca_system_score_codex":0.00014864336,"about_ca_system_score_gemma":0.00017587596,"threshold_uncertainty_score":0.67686194},"labels":[],"label_agreement":null},{"id":"W2159212455","doi":"10.1016/j.jsc.2009.09.004","title":"Computing differential characteristic sets by change of ordering","year":2009,"lang":"en","type":"article","venue":"Journal of Symbolic Computation","topic":"Polynomial and algebraic computation","field":"Computer Science","cited_by":26,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"","keywords":"Mathematics; Prime (order theory); Ideal (ethics); Set (abstract data type); Differential (mechanical device); Ranking (information retrieval); Prime ideal; Software; Algorithm; Discrete mathematics; Algebra over a field; Combinatorics; Pure mathematics; Computer science; Programming language; Artificial intelligence","score_opus":0.018335059526763925,"score_gpt":0.2645680777233865,"score_spread":0.24623301819662255,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2159212455","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5290903,0.00009403274,0.4697827,0.0004881507,0.00042058926,0.000060318704,0.0000011271809,0.00002179335,0.000040992974],"genre_scores_gemma":[0.99309033,0.000013612602,0.006412782,0.00016738253,0.00030259992,3.6061124e-7,0.000005113058,0.0000045962843,0.0000032239207],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99855524,0.00007021384,0.00067572,0.00015047817,0.00035815904,0.00019019461],"domain_scores_gemma":[0.99863046,0.00009597625,0.00085080403,0.00010288448,0.00022378241,0.00009607062],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00023029973,0.00013723363,0.0003373111,0.00023017036,0.000072228024,0.00008895458,0.00038287012,0.000045954224,0.0000034205177],"category_scores_gemma":[0.00003123891,0.00012698806,0.00011010472,0.00031674438,0.000019781726,0.0005428861,0.000048705377,0.00015421447,0.0000023614068],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000021388305,0.00017950434,0.00021631477,0.00002679273,0.000027715274,0.00001078063,0.002485592,0.00069688365,0.017217206,0.0012204592,0.00028128808,0.9776161],"study_design_scores_gemma":[0.0015970981,0.0009074832,0.40756315,0.00031750606,0.000037705744,0.00019394532,0.000048468923,0.57668006,0.0034814982,0.00868301,0.00014093697,0.00034911893],"about_ca_topic_score_codex":0.000010150675,"about_ca_topic_score_gemma":3.0276806e-7,"teacher_disagreement_score":0.97726697,"about_ca_system_score_codex":0.0000442102,"about_ca_system_score_gemma":0.00005090365,"threshold_uncertainty_score":0.5178423},"labels":[],"label_agreement":null},{"id":"W2162009465","doi":"10.1016/s0747-7171(03)00090-7","title":"Factoring systems of linear PDEs with finite-dimensional solution spaces","year":2003,"lang":"en","type":"article","venue":"Journal of Symbolic Computation","topic":"Polynomial and algebraic computation","field":"Computer Science","cited_by":40,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Mathematics; Dimension (graph theory); Finite set; Partial differential equation; Rational function; Space (punctuation); Linear system; Function (biology); Finite difference; Mathematical analysis; Applied mathematics; Pure mathematics","score_opus":0.019024809200461894,"score_gpt":0.2428876335570685,"score_spread":0.2238628243566066,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2162009465","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4140593,0.00019840436,0.58501494,0.000109711626,0.00048060901,0.000056936642,5.4189513e-7,0.000015369911,0.00006416905],"genre_scores_gemma":[0.9688421,0.0000052023784,0.030976458,0.000020523265,0.00012900833,8.319338e-7,0.0000011096708,0.0000064623605,0.000018340163],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99861103,0.00011242571,0.00051483617,0.00013515573,0.00047381563,0.00015273274],"domain_scores_gemma":[0.99837667,0.0002719705,0.00073099183,0.00009696411,0.00043937357,0.00008400529],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004321556,0.00011937976,0.00026775445,0.0002648199,0.00009015974,0.00007473467,0.0001909156,0.000042292297,0.0000021637225],"category_scores_gemma":[0.00007654562,0.00009247439,0.000072382405,0.0003730249,0.00003288518,0.00055202254,0.000029503255,0.00012954809,0.0000034977465],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000061247825,0.00020874302,0.002772588,0.00009443499,0.0001241677,0.000026081072,0.0028967315,0.9518083,0.0080414675,0.02042103,0.00011511055,0.013430144],"study_design_scores_gemma":[0.0015993406,0.0009193957,0.013636478,0.00044059553,0.000042231717,0.0004520945,0.00018564519,0.97280204,0.005898257,0.0031660635,0.0005607427,0.00029712284],"about_ca_topic_score_codex":0.000031163832,"about_ca_topic_score_gemma":0.0000013642017,"teacher_disagreement_score":0.55478275,"about_ca_system_score_codex":0.00005580979,"about_ca_system_score_gemma":0.00019910515,"threshold_uncertainty_score":0.37709963},"labels":[],"label_agreement":null},{"id":"W2165225265","doi":"10.1016/j.jsc.2005.05.009","title":"Computation of unirational fields","year":2006,"lang":"en","type":"article","venue":"Journal of Symbolic Computation","topic":"Polynomial and algebraic computation","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Mathematics; Factoring; Algebraic number; Algebra over a field; Field (mathematics); Computation; Extension (predicate logic); Field extension; Zero (linguistics); Pure mathematics; Algorithm; Computer science; Mathematical analysis","score_opus":0.010409715088580497,"score_gpt":0.24192445726325396,"score_spread":0.23151474217467347,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2165225265","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.31838852,0.0001069196,0.67989975,0.0006126612,0.00041744622,0.000051704254,7.265545e-7,0.00001951993,0.0005027846],"genre_scores_gemma":[0.9640507,0.0000035831258,0.035511177,0.00007546,0.00032274838,6.798646e-7,0.0000061066385,0.000005202741,0.000024323042],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984346,0.00008125792,0.00078110764,0.00012659437,0.00044990436,0.00012651693],"domain_scores_gemma":[0.99837816,0.00015765105,0.0008114932,0.000082085826,0.0005204335,0.000050149843],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00034893362,0.000107010026,0.00023862532,0.00032040518,0.00006383219,0.00006866575,0.00028527583,0.00005654945,0.0000040262967],"category_scores_gemma":[0.000028768902,0.00009971902,0.00012346319,0.00044385288,0.000034557455,0.0005806799,0.000051282343,0.00012206692,0.000004972622],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004450994,0.0003913952,0.0015504293,0.000060118888,0.00006339565,0.000021578504,0.0010374528,0.63898325,0.004872535,0.108167015,0.0044111153,0.24039723],"study_design_scores_gemma":[0.0014255494,0.0004218572,0.102678254,0.00010516873,0.000026136824,0.00020614525,0.000038785078,0.67671496,0.0037324445,0.2141056,0.00031688294,0.00022817828],"about_ca_topic_score_codex":0.0000443918,"about_ca_topic_score_gemma":0.0000057415555,"teacher_disagreement_score":0.6456622,"about_ca_system_score_codex":0.000048491023,"about_ca_system_score_gemma":0.00017404226,"threshold_uncertainty_score":0.40664235},"labels":[],"label_agreement":null},{"id":"W2170368342","doi":"10.1006/jsco.1999.1002","title":"Factoring Polynomials Over Finite Fields: A Survey","year":2001,"lang":"en","type":"article","venue":"Journal of Symbolic Computation","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":100,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Factoring; Mathematics; Univariate; Finite field; Factorization; Factorization of polynomials; Algebra over a field; Pure mathematics; Discrete mathematics; Algorithm; Polynomial; Multivariate statistics; Statistics; Mathematical analysis","score_opus":0.03254854062645635,"score_gpt":0.28498527948146896,"score_spread":0.2524367388550126,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2170368342","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4784621,0.000075922544,0.5205238,0.00016588178,0.0004929788,0.000025770783,5.0409596e-7,0.00001924399,0.00023377646],"genre_scores_gemma":[0.99657905,0.000034696255,0.0029466029,0.00019780776,0.00021371548,4.437835e-7,7.747017e-7,0.000004822174,0.000022086184],"study_design_codex":"design_other","study_design_gemma":"observational","domain_scores_codex":[0.99893814,0.00016165736,0.00038472094,0.000114188006,0.00024999864,0.00015128637],"domain_scores_gemma":[0.9987169,0.00056272966,0.00033092778,0.00013468157,0.00017164438,0.000083133935],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00089742977,0.00009285214,0.00019050874,0.0002775706,0.00007945159,0.0001505182,0.00038510055,0.000046849407,0.00002056294],"category_scores_gemma":[0.000127645,0.000083137485,0.00012290457,0.0004895453,0.000015762282,0.00051725906,0.0000625046,0.0001605129,0.000007454195],"study_design_candidate":"observational","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00042049334,0.0005643861,0.22033347,0.00004677978,0.0003819453,0.0002740958,0.01591017,0.05252951,0.0023205269,0.024736812,0.003963084,0.6785187],"study_design_scores_gemma":[0.0012992606,0.00048840744,0.91290253,0.0001278855,0.000022562826,0.00026688047,0.000066427296,0.04372567,0.00042574247,0.03650248,0.0038209297,0.00035123955],"about_ca_topic_score_codex":0.000029960327,"about_ca_topic_score_gemma":0.0000072494618,"teacher_disagreement_score":0.692569,"about_ca_system_score_codex":0.000025464276,"about_ca_system_score_gemma":0.00005128413,"threshold_uncertainty_score":0.3390248},"labels":[],"label_agreement":null},{"id":"W2233088777","doi":"10.1016/j.jsc.2015.11.011","title":"Factoring linear partial differential operators in n variables","year":2015,"lang":"en","type":"article","venue":"Journal of Symbolic Computation","topic":"Polynomial and algebraic computation","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"German Academic Exchange Service London; Natural Sciences and Engineering Research Council of Canada; Deutscher Akademischer Austauschdienst","keywords":"Mathematics; Factoring; Partial derivative; Pure mathematics; Algebra over a field; Mathematical analysis","score_opus":0.031092829860326993,"score_gpt":0.2753606856662993,"score_spread":0.2442678558059723,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2233088777","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5075563,0.000037104077,0.49105737,0.00025540928,0.0009799675,0.000038280494,2.4980542e-7,0.00001686334,0.00005844296],"genre_scores_gemma":[0.98932856,0.000003906866,0.010038147,0.000052318668,0.0005591318,0.0000010026597,0.0000013348846,0.000006051072,0.000009555945],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99865013,0.00009976943,0.0005514756,0.0001423361,0.00037514465,0.00018112754],"domain_scores_gemma":[0.99917656,0.00008129906,0.00028195145,0.00008812477,0.00021020982,0.00016186123],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00040265743,0.00011219103,0.000238614,0.00028519402,0.00003869677,0.00012835144,0.00033901725,0.000048290334,0.0000033298052],"category_scores_gemma":[0.00008415695,0.00009746932,0.00006372777,0.00038222407,0.000015302308,0.00074109854,0.00009827882,0.00017955924,0.000009052615],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00019745511,0.00081328116,0.012111789,0.000048250386,0.00012804104,0.00021624782,0.02798211,0.54689634,0.0064050667,0.030713087,0.0010531405,0.3734352],"study_design_scores_gemma":[0.002268891,0.0003114678,0.021891905,0.00008856806,0.000012201181,0.000111215835,0.00012595113,0.96409494,0.0022765712,0.007795413,0.0007893928,0.00023349453],"about_ca_topic_score_codex":0.000040257335,"about_ca_topic_score_gemma":0.0000026085404,"teacher_disagreement_score":0.48177224,"about_ca_system_score_codex":0.000112265196,"about_ca_system_score_gemma":0.00024587297,"threshold_uncertainty_score":0.39746833},"labels":[],"label_agreement":null},{"id":"W2250332546","doi":"10.1016/j.jsc.2011.12.013","title":"Guest Editors’ foreword","year":2011,"lang":"en","type":"article","venue":"Journal of Symbolic Computation","topic":"Posthumanist Ethics and Activism","field":"Social Sciences","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","score_opus":0.06824903765686856,"score_gpt":0.3367604672404705,"score_spread":0.2685114295836019,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2250332546","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8505522,0.000111577014,0.00973306,0.0022384832,0.018516714,0.0001375926,0.0000013767376,0.000039567767,0.118669406],"genre_scores_gemma":[0.9891892,0.000029142748,0.0007917095,0.00008023102,0.009809953,3.551414e-7,3.4898284e-7,0.000004941369,0.000094082694],"study_design_codex":"qualitative","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99922144,0.000081643375,0.00021280396,0.00004691434,0.00032378704,0.000113423754],"domain_scores_gemma":[0.99924624,0.000079528276,0.0002858324,0.000032885164,0.00027558554,0.00007991198],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007763738,0.000044627133,0.00010181444,0.000086420296,0.00019825381,0.00004046566,0.00013218321,0.00005799236,0.00005360979],"category_scores_gemma":[0.00010158736,0.000039423776,0.00006215581,0.00010412336,0.00008699097,0.00026631553,0.000011355919,0.00016834118,0.000014967305],"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.00015394588,0.0008718057,0.01875863,0.0000422758,0.00020849265,0.00012534876,0.4969362,0.00007856721,0.0008067166,0.3108777,0.062174074,0.10896624],"study_design_scores_gemma":[0.0012816318,0.00072577805,0.16626315,0.00022980911,0.000104622726,0.000065203945,0.012418825,0.00042910525,0.0008688053,0.4477993,0.3693346,0.00047914888],"about_ca_topic_score_codex":0.000326156,"about_ca_topic_score_gemma":0.00008593317,"teacher_disagreement_score":0.48451737,"about_ca_system_score_codex":0.000048377326,"about_ca_system_score_gemma":0.00014996616,"threshold_uncertainty_score":0.16076548},"labels":[],"label_agreement":null},{"id":"W2261455439","doi":"10.1016/j.jsc.2011.09.001","title":"In honour of the research and influence of Joachim von zur Gathen at 60","year":2011,"lang":"en","type":"article","venue":"Journal of Symbolic Computation","topic":"Historical, Literary, and Cultural Studies","field":"Arts and Humanities","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; University of Waterloo","funders":"","keywords":"Mathematics; Honour; Humanities; Philosophy; Political science; Law","score_opus":0.0998701685780126,"score_gpt":0.2859238218199876,"score_spread":0.18605365324197498,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2261455439","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9946602,0.0006858344,0.0000023322182,0.0001715423,0.00011718706,0.00005482894,0.0000017456849,0.000001236446,0.0043051164],"genre_scores_gemma":[0.99908197,0.000080291575,0.000036939473,0.000023459992,0.00011072892,7.199772e-7,1.5360509e-7,0.0000028710945,0.0006628646],"study_design_codex":"qualitative","study_design_gemma":"observational","domain_scores_codex":[0.99924874,0.000088449146,0.00032032965,0.000048028276,0.00021808934,0.000076343356],"domain_scores_gemma":[0.9992375,0.0000702034,0.00023062175,0.000039458908,0.00040085943,0.000021385611],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003384367,0.00004717951,0.0001543068,0.000090712696,0.00014886589,0.0000123183145,0.00009587567,0.000016520686,0.000032427626],"category_scores_gemma":[0.000048370606,0.00002764681,0.000039002396,0.000063211606,0.00020463791,0.00017279453,0.000045232286,0.00013647634,0.0000014825631],"study_design_candidate":"qualitative","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00017102037,0.0002669487,0.018544052,0.00013451041,0.00006469284,0.000009726644,0.9529535,0.00017291876,0.0015478253,0.019445833,0.003334163,0.0033548167],"study_design_scores_gemma":[0.0011848668,0.001044726,0.9024707,0.0006301742,0.00004393273,0.00006402188,0.020433707,0.00017351055,0.0011825936,0.04443263,0.028150003,0.00018912512],"about_ca_topic_score_codex":0.00029398795,"about_ca_topic_score_gemma":0.00014670377,"teacher_disagreement_score":0.9325198,"about_ca_system_score_codex":0.000042183554,"about_ca_system_score_gemma":0.000017707252,"threshold_uncertainty_score":0.11449711},"labels":[],"label_agreement":null},{"id":"W2321875349","doi":"10.1016/j.jsc.2015.09.004","title":"Genus 3 curves whose Jacobians have endomorphisms by <mml:math xmlns:mml=\"http://www.w3.org/1998/Math/MathML\" altimg=\"si1.gif\" overflow=\"scroll\"><mml:mi mathvariant=\"double-struck\">Q</mml:mi><mml:mo stretchy=\"false\">(</mml:mo><mml:msub><mml:mrow><mml:mi>ζ</mml:mi></mml:mrow><mml:mrow><mml:mn>7</mml:mn></mml:mrow></mml:msub><mml:mo>+</mml:mo><mml:msub><mml:mrow><mml:mover accent=\"true\"><mml:mrow><mml:mi>ζ</mml:mi></mml:mrow><mml:mrow><mml:mo stretchy=\"false\">¯</mml:mo></mml:mrow></mml:mover></mml:mrow><mml:mrow><mml:mn>7</mml:mn></mml:mrow></mml:msub><mml:mo stretchy=\"false\">)</mml:mo></mml:math>","year":2015,"lang":"lv","type":"article","venue":"Journal of Symbolic Computation","topic":"Algebraic Geometry and Number Theory","field":"Mathematics","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":"National Natural Science Foundation of China; Office of International Science and Engineering; Centre de Recherches Mathématiques; University of Missouri; Chinese Academy of Sciences; National Science Foundation","keywords":"Mathematics; Endomorphism; Genus; Riemann zeta function; Combinatorics; Generating function; Function (biology); Pure mathematics; Botany","score_opus":0.023038606792433563,"score_gpt":0.25347802926440005,"score_spread":0.2304394224719665,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2321875349","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.39604142,0.006446544,0.0033422047,0.0022995828,0.010251135,0.00022364313,0.0023265453,0.00094440725,0.5781245],"genre_scores_gemma":[0.9570044,0.0066082776,0.0059715942,0.005362248,0.009409757,0.0039173546,0.006138549,0.0045296946,0.0010580958],"study_design_codex":"not_applicable","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.95873857,0.0031932206,0.009325105,0.0068173753,0.011973858,0.0099518765],"domain_scores_gemma":[0.9641977,0.008012616,0.012690561,0.0071475585,0.0014944122,0.006457167],"candidate_categories":["metaresearch","metaepi_narrow","sts","scholarly_communication","open_science","research_integrity","insufficient_payload"],"consensus_categories":["metaepi_narrow","sts","research_integrity","insufficient_payload"],"category_scores_codex":[0.010304912,0.004248176,0.0017955521,0.0036122317,0.0058684233,0.007581849,0.010085607,0.010438157,0.8349464],"category_scores_gemma":[0.008811041,0.009078977,0.008787527,0.0060243765,0.0070140506,0.0076562148,0.007979039,0.008676874,0.0069351764],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":true,"about_ca_topic_consensus":false,"about_ca_system_candidate":true,"about_ca_system_consensus":false,"study_design_scores_codex":[0.008538235,0.001777764,0.00007149115,0.0045955474,0.009295444,0.0065210117,0.007031358,0.0072293654,0.0041339598,0.24844319,0.6958358,0.006526833],"study_design_scores_gemma":[0.01081846,0.006838748,0.00021376263,0.006326591,0.009051762,0.010929332,0.010363729,0.016378932,0.9091569,0.002798959,0.009287866,0.007834941],"about_ca_topic_score_codex":0.007604195,"about_ca_topic_score_gemma":0.0057304455,"teacher_disagreement_score":0.905023,"about_ca_system_score_codex":0.0001450128,"about_ca_system_score_gemma":0.008432718,"threshold_uncertainty_score":0.9995382},"labels":[],"label_agreement":null},{"id":"W2402945515","doi":"10.1016/j.jsc.2017.08.001","title":"Bit complexity for multi-homogeneous polynomial system solving—Application to polynomial minimization","year":2017,"lang":"en","type":"preprint","venue":"Journal of Symbolic Computation","topic":"Polynomial and algebraic computation","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada; Institut Universitaire de France","keywords":"Homogeneous polynomial; Polynomial; Mathematics; Time complexity; TRACE (psycholinguistics); Matrix polynomial; Set (abstract data type); Rank (graph theory); Jacobian matrix and determinant; Minification; Quadratic equation; Algebraic number; Linear system; Algorithm; Discrete mathematics; Mathematical optimization; Computer science; Applied mathematics; Combinatorics","score_opus":0.05342822384063003,"score_gpt":0.3164096717980784,"score_spread":0.2629814479574484,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2402945515","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.078808635,0.00020984765,0.91244423,0.0013939925,0.005357466,0.0014709765,0.000066014494,0.00017343418,0.00007541043],"genre_scores_gemma":[0.7662167,0.000009824281,0.23111074,0.0001175798,0.002315089,0.00006391157,0.000078590914,0.000044857356,0.000042689033],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99600405,0.00020057682,0.0017550137,0.00081778097,0.0007180483,0.0005045258],"domain_scores_gemma":[0.9936403,0.00023937167,0.0035710135,0.0007743281,0.0013677756,0.00040718543],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0010104766,0.00054483453,0.0010756451,0.0008576801,0.00059380836,0.0010235432,0.0021901682,0.00039123782,0.0000015619527],"category_scores_gemma":[0.00024545242,0.0005635417,0.00056026736,0.00025508442,0.00008407753,0.00057699607,0.0009715893,0.00051791477,0.000023261744],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0006356091,0.0006842292,0.00032406364,0.0010895153,0.0005149819,0.000045040226,0.0055809207,0.43777698,0.0036678289,0.0043361736,0.014129323,0.5312153],"study_design_scores_gemma":[0.0019845185,0.0003453204,0.0070492835,0.00048316745,0.00012483979,0.00019425405,0.000059028134,0.98498875,0.00084898155,0.0016607259,0.0016386451,0.00062245986],"about_ca_topic_score_codex":0.00021669682,"about_ca_topic_score_gemma":0.00005005564,"teacher_disagreement_score":0.6874081,"about_ca_system_score_codex":0.0007768478,"about_ca_system_score_gemma":0.0009802134,"threshold_uncertainty_score":0.9996816},"labels":[],"label_agreement":null},{"id":"W2473648675","doi":"10.1016/j.jsc.2016.07.004","title":"On the arithmetic complexity of Strassen-like matrix multiplications","year":2016,"lang":"en","type":"article","venue":"Journal of Symbolic Computation","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":26,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Strassen algorithm; Mathematics; Matrix multiplication; Arithmetic; Dimension (graph theory); Multiplication (music); Matrix (chemical analysis); Combinatorics; Discrete mathematics","score_opus":0.023035962756195308,"score_gpt":0.2515946496593419,"score_spread":0.22855868690314662,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2473648675","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8861207,0.00008414781,0.112531394,0.00040368192,0.00031561565,0.00009989955,0.0000073618526,0.000023474004,0.00041373677],"genre_scores_gemma":[0.9994198,0.0000135777445,0.00045842305,0.000012211292,0.000066642606,0.000002044765,5.607286e-7,0.00000931787,0.000017433387],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992451,0.00007440407,0.00038071786,0.00004537584,0.00017310421,0.00008126427],"domain_scores_gemma":[0.99911886,0.00042454523,0.00019032962,0.00010508469,0.00012411646,0.00003705812],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00035368995,0.00007227629,0.00015328896,0.000115199684,0.000041201445,0.000011897323,0.0001280786,0.000030396292,0.000021004438],"category_scores_gemma":[0.000040044153,0.00004049507,0.000086559805,0.00014326387,0.00006481545,0.00007142455,0.000006240924,0.00008794626,0.000013832578],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012257522,0.00039565313,0.0017762315,0.00024420905,0.00058569165,0.000009230612,0.0028113034,0.17238739,0.19760075,0.5680021,0.005349363,0.0507155],"study_design_scores_gemma":[0.0038924634,0.0007227904,0.19745459,0.0015954028,0.00020496518,0.00042561736,0.0011868126,0.13795617,0.023090389,0.6313129,0.0015222247,0.0006356847],"about_ca_topic_score_codex":0.0000022903937,"about_ca_topic_score_gemma":0.0000015017088,"teacher_disagreement_score":0.19567835,"about_ca_system_score_codex":0.000029716128,"about_ca_system_score_gemma":0.000012679109,"threshold_uncertainty_score":0.1651341},"labels":[],"label_agreement":null},{"id":"W2549194755","doi":"10.1016/j.jsc.2018.04.011","title":"An equivalence theorem for regular differential chains","year":2018,"lang":"en","type":"article","venue":"Journal of Symbolic Computation","topic":"Polynomial and algebraic computation","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"","keywords":"Mathematics; Equivalence (formal languages); Pure mathematics; Computation; Differential (mechanical device); Discrete mathematics; Algebra over a field; Algorithm","score_opus":0.017836125736268877,"score_gpt":0.28815487130501716,"score_spread":0.2703187455687483,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2549194755","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.36414498,0.000022733706,0.6344147,0.00038249456,0.0008486906,0.00009028651,0.0000010414215,0.000032221793,0.00006286836],"genre_scores_gemma":[0.96083456,0.0000038108699,0.03743115,0.00014070448,0.0015512349,0.0000022679458,0.0000027412666,0.000008880037,0.00002462588],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987321,0.00008855478,0.0004555819,0.00019684967,0.0003153818,0.00021155557],"domain_scores_gemma":[0.9985774,0.00012539072,0.00045668115,0.00017728601,0.0005303394,0.00013286203],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004501677,0.00012288759,0.00021418146,0.00021081087,0.00016845412,0.00017975869,0.0006147779,0.000048612157,0.0000068445056],"category_scores_gemma":[0.00004907904,0.000104165105,0.00012189029,0.00024398815,0.00007340274,0.00075945986,0.000060292892,0.00008954284,0.000006455247],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001330643,0.00028317558,0.000109168985,0.000032241333,0.00006484335,0.000009588222,0.0045805117,0.0023399105,0.02560946,0.19543178,0.0007090895,0.7706972],"study_design_scores_gemma":[0.0011406128,0.001582379,0.008573019,0.00006510309,0.000023598817,0.00016693868,0.000058328427,0.83879435,0.0062412946,0.14284766,0.0003033133,0.00020341131],"about_ca_topic_score_codex":0.000003281399,"about_ca_topic_score_gemma":0.0000012643076,"teacher_disagreement_score":0.83645445,"about_ca_system_score_codex":0.00004851628,"about_ca_system_score_gemma":0.000116133684,"threshold_uncertainty_score":0.42477298},"labels":[],"label_agreement":null},{"id":"W2549252305","doi":"10.1016/j.jsc.2016.11.018","title":"Formal solutions of completely integrable Pfaffian systems with normal crossings","year":2016,"lang":"en","type":"article","venue":"Journal of Symbolic Computation","topic":"Advanced Combinatorial Mathematics","field":"Mathematics","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":"Fields Institute for Research in Mathematical Sciences","funders":"Université de Limoges; European Research Council; Technische Universität Wien; Universität Wien","keywords":"Pfaffian; Mathematics; Integrable system; Maple; Generalization; Bivariate analysis; Algebra over a field; Symbolic computation; Reduction (mathematics); Matrix (chemical analysis); Algorithm; Pure mathematics; Mathematical analysis","score_opus":0.05307424800168598,"score_gpt":0.30513057257683923,"score_spread":0.25205632457515326,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2549252305","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3757142,0.00004704124,0.62293273,0.00010692711,0.0003770305,0.00014531551,0.000005315373,0.000023216437,0.00064818945],"genre_scores_gemma":[0.96425456,0.000004880757,0.035422157,0.000006232952,0.00017132053,0.0000031214738,6.583216e-7,0.000026497242,0.000110595145],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99808484,0.00006874192,0.0009573081,0.00009322243,0.000512365,0.0002835419],"domain_scores_gemma":[0.9967279,0.00063055666,0.0014922457,0.00015315672,0.00089642545,0.00009975511],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00064977596,0.00015889261,0.00050024095,0.00020953553,0.00014006012,0.000049962597,0.00020648578,0.00006524456,0.000010089943],"category_scores_gemma":[0.00029714577,0.000098300065,0.00010810006,0.0002340877,0.00013029717,0.0006923263,0.000048913396,0.00015534202,0.0000047408644],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000768839,0.0013665967,0.00097131706,0.0014910048,0.00063289516,0.000057453053,0.0089245215,0.008879903,0.015867515,0.9294744,0.003647835,0.027917685],"study_design_scores_gemma":[0.010030261,0.0031655151,0.0016369147,0.005940435,0.00045101688,0.0024412707,0.0029662212,0.021165518,0.004293277,0.9459591,0.0011533203,0.0007971844],"about_ca_topic_score_codex":0.000011706187,"about_ca_topic_score_gemma":0.0000045021343,"teacher_disagreement_score":0.5885403,"about_ca_system_score_codex":0.00014594733,"about_ca_system_score_gemma":0.00016014882,"threshold_uncertainty_score":0.40085602},"labels":[],"label_agreement":null},{"id":"W2569934946","doi":"10.1016/j.jsc.2017.07.010","title":"Time and space efficient generators for quasiseparable matrices","year":2017,"lang":"en","type":"article","venue":"Journal of Symbolic Computation","topic":"Matrix Theory and Algorithms","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":"Horizon 2020 Framework Programme","keywords":"Mathematics; Linear algebra; Eigenvalues and eigenvectors; Matrix (chemical analysis); Matrix multiplication; Rank (graph theory); Algebra over a field; Block matrix; Vector space; Matrix analysis; Numerical linear algebra; QR decomposition; Linear system; Pure mathematics; Combinatorics","score_opus":0.011764631844205776,"score_gpt":0.2745159109163119,"score_spread":0.2627512790721061,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2569934946","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.49108836,0.00030842918,0.5072747,0.0007169473,0.00031808688,0.000086150605,0.0000012870472,0.000012372069,0.00019365581],"genre_scores_gemma":[0.9128965,0.000024868472,0.08667443,0.000035157173,0.00028336435,0.0000012700743,3.4913995e-7,0.0000053018525,0.00007877412],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993402,0.000036139096,0.00023102906,0.00011056003,0.00016523594,0.00011686517],"domain_scores_gemma":[0.9989486,0.00011916573,0.00053717365,0.00014866647,0.00016826382,0.000078181685],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00065994513,0.0000750632,0.00016834658,0.00010967609,0.00033692288,0.00039890214,0.0003733401,0.000028851768,0.0000024400852],"category_scores_gemma":[0.00006507869,0.00006208948,0.00006216867,0.000055371478,0.00003749114,0.000389644,0.00006973604,0.000058114776,0.000006340221],"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.00016867106,0.00043496862,0.00043175224,0.00020663919,0.00022312318,0.000065687884,0.0053780256,0.19199324,0.0058576944,0.13999069,0.0052837403,0.64996576],"study_design_scores_gemma":[0.00074303814,0.00019045407,0.0014916641,0.000046350066,0.000021401946,0.000115815295,0.000024161773,0.97584206,0.0021459754,0.018481227,0.00077893556,0.00011893279],"about_ca_topic_score_codex":0.00000264411,"about_ca_topic_score_gemma":1.727269e-7,"teacher_disagreement_score":0.7838488,"about_ca_system_score_codex":0.000018019264,"about_ca_system_score_gemma":0.000048793587,"threshold_uncertainty_score":0.38466227},"labels":[],"label_agreement":null},{"id":"W2624157057","doi":"10.1016/j.jsc.2018.06.010","title":"On the postulation of lines and a fat line","year":2018,"lang":"en","type":"preprint","venue":"Journal of Symbolic Computation","topic":"Algebraic Geometry and Number Theory","field":"Mathematics","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":"Toronto Metropolitan University","funders":"Vetenskapsrådet; Narodowe Centrum Nauki; Deutsche Forschungsgemeinschaft","keywords":"Line (geometry); Computer science; Mathematics; Geometry","score_opus":0.04762520464268368,"score_gpt":0.3274300068240932,"score_spread":0.2798048021814095,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2624157057","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9720695,0.00015270432,0.026074396,0.0007526481,0.0004498471,0.00017217724,0.0000047165286,0.00000850636,0.0003155008],"genre_scores_gemma":[0.99629664,0.000038429236,0.0028736447,0.00006428537,0.00066093577,0.0000011896667,0.000004025651,0.000014383572,0.00004648798],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986657,0.00016894954,0.00066345744,0.00010225906,0.00032311835,0.00007653852],"domain_scores_gemma":[0.99656516,0.0013268129,0.0014016567,0.00014683232,0.0005229555,0.000036591257],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010363329,0.00014161109,0.0003690982,0.00020831526,0.000052755277,0.000028655117,0.00014799774,0.00013452632,0.00004760291],"category_scores_gemma":[0.00072095846,0.00009151505,0.00011969677,0.000097794735,0.00007906592,0.000048076166,0.00011731287,0.00036249362,0.0000032823104],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0037586193,0.003296801,0.004296614,0.006972756,0.0043023806,0.00006524305,0.06080021,0.030494094,0.0067472667,0.7263544,0.03496167,0.11794995],"study_design_scores_gemma":[0.00031302884,0.00028430388,0.0035488952,0.00063392776,0.00012914313,0.000049629547,0.00019246466,0.004552851,0.0009532118,0.9892301,0.000019598563,0.00009287568],"about_ca_topic_score_codex":0.000003162138,"about_ca_topic_score_gemma":7.0246915e-7,"teacher_disagreement_score":0.26287568,"about_ca_system_score_codex":0.000025011788,"about_ca_system_score_gemma":0.00004598234,"threshold_uncertainty_score":0.37318754},"labels":[],"label_agreement":null},{"id":"W2771141647","doi":"10.1016/j.jsc.2019.07.012","title":"Computing lower rank approximations of matrix polynomials","year":2019,"lang":"en","type":"preprint","venue":"Journal of Symbolic Computation","topic":"Matrix Theory and Algorithms","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":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Rank (graph theory); Matrix (chemical analysis); Matrix polynomial; Robustness (evolution); Quadratic growth; Polynomial matrix; Singular value; Dimension (graph theory); Polynomial; Combinatorics; Applied mathematics; Discrete mathematics; Algorithm; Mathematical analysis; Eigenvalues and eigenvectors","score_opus":0.01577575626765196,"score_gpt":0.29284427614761577,"score_spread":0.2770685198799638,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2771141647","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12030785,0.0005061026,0.8745412,0.00045213246,0.0033133167,0.00029790407,0.00000879243,0.000039054623,0.0005336173],"genre_scores_gemma":[0.86470866,0.00003354858,0.13457264,0.00004481639,0.00054803427,0.0000010352048,0.000006649536,0.000016644528,0.000067960544],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99703234,0.00030036794,0.0015201697,0.00029375567,0.0006257033,0.00022767176],"domain_scores_gemma":[0.9953081,0.00045906438,0.0029692263,0.00044063604,0.00071933784,0.00010363591],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.001688994,0.00026501386,0.00085347367,0.0006154554,0.000078063174,0.00022156806,0.0012198451,0.00020964033,0.00001527961],"category_scores_gemma":[0.00010488466,0.00024584308,0.0004410929,0.00035240388,0.000051179424,0.0004121134,0.0006858975,0.0006565236,0.000020332342],"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.000072642026,0.0004236227,0.00019748726,0.00088428624,0.00036062853,0.00003251163,0.004290024,0.8804597,0.0009332293,0.03088893,0.0014513312,0.08000556],"study_design_scores_gemma":[0.0011825452,0.0002314808,0.0017361961,0.0009185466,0.000103297956,0.00021447826,0.00009560847,0.9365437,0.0009126943,0.057380002,0.00027681465,0.00040462537],"about_ca_topic_score_codex":0.000011323516,"about_ca_topic_score_gemma":2.0743175e-7,"teacher_disagreement_score":0.7444008,"about_ca_system_score_codex":0.00009214192,"about_ca_system_score_gemma":0.00047422695,"threshold_uncertainty_score":0.9999994},"labels":[],"label_agreement":null},{"id":"W2773164695","doi":"10.1016/j.jsc.2020.06.007","title":"Drinfeld modules with complex multiplication, Hasse invariants and factoring polynomials over finite fields","year":2020,"lang":"en","type":"preprint","venue":"Journal of Symbolic Computation","topic":"Coding theory and cryptography","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":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada; Public Works and Government Services Canada; National Science Foundation","keywords":"Mathematics; Finite field; Lift (data mining); Polynomial ring; Invariant (physics); Hasse principle; Multiplication (music); Complex multiplication; Polynomial; Discrete mathematics; Combinatorics; Pure mathematics; Algebraic number field; Elliptic curve; Computer science","score_opus":0.04452285834766072,"score_gpt":0.28032262866603996,"score_spread":0.23579977031837923,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2773164695","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.26756898,0.0001036473,0.7300653,0.0016871666,0.0002937074,0.00014812457,0.0000048827146,0.00004652272,0.00008172347],"genre_scores_gemma":[0.9550528,0.000057690562,0.044249486,0.00030902325,0.0003026961,0.00000431757,0.0000069530165,0.00001383052,0.0000032357866],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983778,0.00012909755,0.0006121081,0.00035114397,0.0003604723,0.00016936332],"domain_scores_gemma":[0.9979326,0.00038547692,0.00094318535,0.00028616464,0.0002836729,0.00016891025],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00036354526,0.0002478979,0.00047264417,0.0003258938,0.00012612861,0.000443364,0.00061779545,0.00014435353,0.000006834738],"category_scores_gemma":[0.000084930376,0.00021694375,0.00012984537,0.0002620392,0.000053011456,0.000405749,0.00050767907,0.000562998,0.0000018774979],"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.0009054853,0.00085044216,0.04596716,0.0013556329,0.0022645856,0.00029082835,0.058843095,0.39825365,0.00933909,0.099940635,0.0033583278,0.3786311],"study_design_scores_gemma":[0.0019935276,0.00057336903,0.39331895,0.0007797079,0.00013842894,0.00016269276,0.00012851579,0.48624167,0.0005646635,0.11444291,0.00089573325,0.00075984176],"about_ca_topic_score_codex":0.000026559737,"about_ca_topic_score_gemma":0.00000512717,"teacher_disagreement_score":0.6874838,"about_ca_system_score_codex":0.000038652,"about_ca_system_score_gemma":0.00012630915,"threshold_uncertainty_score":0.884671},"labels":[],"label_agreement":null},{"id":"W2788877415","doi":"10.1016/j.jsc.2020.09.008","title":"Solving determinantal systems using homotopy techniques","year":2020,"lang":"en","type":"preprint","venue":"Journal of Symbolic Computation","topic":"Polynomial and algebraic computation","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada; Agence Nationale de la Recherche; National Science Foundation","keywords":"Mathematics; Combinatorics; Polynomial; Homotopy; Algebraic number; Field (mathematics); Closure (psychology); Matching (statistics); Discrete mathematics; Pure mathematics; Mathematical analysis","score_opus":0.037194602030137164,"score_gpt":0.29541361783777026,"score_spread":0.25821901580763307,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2788877415","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.18834774,0.00051338633,0.8076811,0.00037000398,0.0025937771,0.00026661876,0.0000032515295,0.00012682774,0.00009732865],"genre_scores_gemma":[0.8706477,0.000033854154,0.12785137,0.00008213089,0.0013494081,0.0000036363365,0.0000043450427,0.000022134527,0.000005403744],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9973746,0.00019234595,0.001178273,0.00038076716,0.00061623665,0.0002577708],"domain_scores_gemma":[0.9970479,0.00013514838,0.0019338399,0.00023721249,0.00045949206,0.0001864283],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0005327798,0.00031526032,0.0006992046,0.00048514994,0.00013123127,0.0006939216,0.0010322505,0.0002079322,0.0000011470852],"category_scores_gemma":[0.000065436805,0.00030183917,0.00030692527,0.00032173132,0.00003671504,0.0006040466,0.00089186337,0.00074344187,0.0000048627835],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000084867,0.0003593564,0.0005526012,0.0014866241,0.0004813882,0.00095873856,0.008956628,0.18420897,0.026219415,0.008701301,0.0018190375,0.7661711],"study_design_scores_gemma":[0.00025809795,0.00018287369,0.00094131083,0.00091037847,0.00005919882,0.0008342309,0.000042385123,0.97482336,0.0017092556,0.019689007,0.00019558548,0.00035434964],"about_ca_topic_score_codex":0.000067751906,"about_ca_topic_score_gemma":7.8649197e-7,"teacher_disagreement_score":0.79061437,"about_ca_system_score_codex":0.00027500477,"about_ca_system_score_gemma":0.0005929086,"threshold_uncertainty_score":0.9999434},"labels":[],"label_agreement":null},{"id":"W2902145203","doi":"10.1016/j.jsc.2019.10.015","title":"On the maximal number of real embeddings of minimally rigid graphs in R2, R3 and S2","year":2019,"lang":"lv","type":"article","venue":"Journal of Symbolic Computation","topic":"Structural Analysis and Optimization","field":"Engineering","cited_by":11,"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":"Horizon 2020; Agence Nationale de la Recherche; European Commission; Horizon 2020 Framework Programme; Alberta Livestock and Meat Agency; Institut national de recherche en informatique et en automatique (INRIA)","keywords":"Mathematics; Combinatorics; Algebraic number; Vertex (graph theory); Upper and lower bounds; Heuristics; Discrete mathematics; Euclidean space; Graph; Mathematical optimization","score_opus":0.005954589595655223,"score_gpt":0.23290226324282906,"score_spread":0.22694767364717383,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2902145203","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9979125,0.00014279544,0.0005723263,0.00013836643,0.00019311372,0.000105156105,0.0000041565936,0.0000032514936,0.0009282915],"genre_scores_gemma":[0.9980872,0.0002995796,0.001516762,0.00001589371,0.000047364552,3.4362634e-7,0.0000030281815,0.000012670077,0.00001710451],"study_design_codex":"simulation_or_modeling","study_design_gemma":"observational","domain_scores_codex":[0.9985798,0.000063466454,0.00081941235,0.000098744225,0.00031931943,0.00011923155],"domain_scores_gemma":[0.9987632,0.00022247747,0.0006698147,0.000077472716,0.00022767516,0.00003938379],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00033960867,0.00013847914,0.0004406813,0.00024963712,0.00002083379,0.000027392021,0.000106051506,0.000080567595,0.00011092229],"category_scores_gemma":[0.00003826162,0.0000989283,0.00014490976,0.00038992485,0.00003891096,0.00015722086,0.000020535173,0.00020481463,0.0000034541813],"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.00030743095,0.000096433374,0.061276123,0.00032394298,0.00035678438,0.000009926301,0.0047935834,0.8989698,0.009523175,0.012729757,0.00016497307,0.011448056],"study_design_scores_gemma":[0.0011257335,0.00028616106,0.523468,0.0005304486,0.00013600205,0.00005433112,0.0006179817,0.4646625,0.00080058404,0.008159612,0.000007720679,0.00015090169],"about_ca_topic_score_codex":0.00007813524,"about_ca_topic_score_gemma":0.000005706749,"teacher_disagreement_score":0.4621919,"about_ca_system_score_codex":0.00004481751,"about_ca_system_score_gemma":0.000027281147,"threshold_uncertainty_score":0.40341792},"labels":[],"label_agreement":null},{"id":"W2904002592","doi":"10.1016/j.jsc.2020.07.018","title":"Unexpected hypersurfaces with multiple fat points","year":2020,"lang":"en","type":"preprint","venue":"Journal of Symbolic Computation","topic":"Algebraic Geometry and Number Theory","field":"Mathematics","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":"Toronto Metropolitan University","funders":"Narodowe Centrum Nauki","keywords":"Point (geometry); Fermat's Last Theorem; Series (stratigraphy); Key (lock); Pure mathematics; Mathematics; Projective test; Computer science; Geometry; Geology","score_opus":0.04446777163729515,"score_gpt":0.2991481696727268,"score_spread":0.25468039803543163,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2904002592","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9134929,0.0001822258,0.08393421,0.0010153337,0.0005367502,0.00023825234,0.000009028107,0.00006335267,0.0005279249],"genre_scores_gemma":[0.95885223,0.000020329328,0.040459186,0.000082656756,0.0004881265,0.0000026344842,0.000013658061,0.00004302426,0.000038147566],"study_design_codex":"qualitative","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.998029,0.00020838292,0.0007660623,0.00023138765,0.00058538344,0.00017979539],"domain_scores_gemma":[0.9969595,0.0007421794,0.0014799325,0.00017848937,0.00048626852,0.00015364331],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00041199275,0.0002863934,0.0007258156,0.00023364834,0.000071229304,0.00008055082,0.0003120354,0.0001893909,0.00005015633],"category_scores_gemma":[0.0005569013,0.00022550963,0.0002051279,0.00026986402,0.0000600437,0.00012730462,0.00017394469,0.0008650905,0.000018618264],"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.019899787,0.009635112,0.06662609,0.021599848,0.02896765,0.0047563533,0.26989284,0.25012556,0.026585843,0.09354529,0.0848309,0.12353472],"study_design_scores_gemma":[0.00345549,0.00065571273,0.008842133,0.0015326311,0.000694179,0.0005010558,0.0036042978,0.011485793,0.0029526001,0.96523654,0.00027881193,0.00076072675],"about_ca_topic_score_codex":0.000008338764,"about_ca_topic_score_gemma":0.000002834244,"teacher_disagreement_score":0.8716913,"about_ca_system_score_codex":0.0000926632,"about_ca_system_score_gemma":0.0001492134,"threshold_uncertainty_score":0.9196016},"labels":[],"label_agreement":null},{"id":"W2911871489","doi":"10.1016/j.jsc.2012.05.010","title":"Generating subfields","year":2012,"lang":"en","type":"article","venue":"Journal of Symbolic Computation","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":15,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Deutsche Forschungsgemeinschaft; National Science Foundation","keywords":"Mathematics; Extension (predicate logic); Factorization; Lattice (music); Set (abstract data type); Unique factorization domain; Implementation; Lattice reduction; Algebra over a field; Degree (music); Discrete mathematics; Combinatorics; Algorithm; Pure mathematics; Computer science","score_opus":0.016794418969717118,"score_gpt":0.2626005843204643,"score_spread":0.24580616535074717,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2911871489","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.39465988,0.0002315422,0.6038312,0.00020213731,0.0006035636,0.00001551856,4.6354717e-8,0.000016329812,0.00043978213],"genre_scores_gemma":[0.94561166,0.000006486068,0.053645775,0.00021077767,0.00051432085,3.6363488e-7,1.7620222e-7,0.0000030087813,0.000007441579],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99927723,0.00007768927,0.0002610704,0.00005202376,0.00018884092,0.00014314594],"domain_scores_gemma":[0.99938506,0.00009762919,0.0002312752,0.00008341338,0.00011569901,0.00008689653],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00068651966,0.000059019752,0.00010742338,0.00015942041,0.000076935874,0.00007267253,0.00023799702,0.000030186824,0.000007327517],"category_scores_gemma":[0.000030594598,0.000050844013,0.00008808521,0.0002653104,0.0000113631595,0.0006880828,0.00004277714,0.000121378114,0.0000073310675],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001938623,0.0002593335,0.014189698,0.000023555252,0.000085803746,0.000009818832,0.0106195025,0.010756806,0.008499434,0.25815898,0.0024783132,0.6948994],"study_design_scores_gemma":[0.0039312285,0.0018397488,0.16622245,0.00038641138,0.00016707601,0.003812251,0.0014054195,0.53565013,0.01598231,0.25246873,0.016548134,0.001586087],"about_ca_topic_score_codex":9.711833e-7,"about_ca_topic_score_gemma":1.4062712e-7,"teacher_disagreement_score":0.69331324,"about_ca_system_score_codex":0.000014459265,"about_ca_system_score_gemma":0.000024747293,"threshold_uncertainty_score":0.20733587},"labels":[],"label_agreement":null},{"id":"W2944680259","doi":"10.1016/j.jsc.2019.05.001","title":"The complexity of sparse Hensel lifting and sparse polynomial factorization","year":2019,"lang":"en","type":"article","venue":"Journal of Symbolic Computation","topic":"Polynomial and algebraic computation","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Univariate; Polynomial; Interpolation (computer graphics); Multivariate statistics; Polynomial interpolation; Sparse grid; Diophantine equation; Algorithm; Applied mathematics; Discrete mathematics; Combinatorics; Image (mathematics); Linear interpolation; Computer science; Statistics; Artificial intelligence; Mathematical analysis","score_opus":0.027770756451189687,"score_gpt":0.25040911482240735,"score_spread":0.22263835837121768,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2944680259","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7280654,0.00015638596,0.26977068,0.0008682484,0.0008583309,0.00011687234,0.0000010224579,0.00001623561,0.00014684892],"genre_scores_gemma":[0.99116826,0.000029504701,0.008511088,0.00005679663,0.00020674997,4.5199383e-7,0.0000015817365,0.0000065195336,0.000019030673],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985622,0.00012095275,0.00064183323,0.00014835541,0.00036040175,0.00016624645],"domain_scores_gemma":[0.9982915,0.00031737637,0.000876922,0.0001392189,0.0002927693,0.00008222678],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00056889013,0.00011801819,0.00025882362,0.00014819068,0.00014042469,0.00014622501,0.00032977376,0.00004387585,0.0000026401663],"category_scores_gemma":[0.000073111,0.00008806279,0.00008282347,0.00029027092,0.0001067834,0.0005187234,0.00011892779,0.00015652967,0.0000060866796],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00032382217,0.0003533112,0.029246366,0.00017565975,0.00027781495,0.000016973589,0.013425588,0.028134264,0.029754786,0.14372483,0.001468004,0.7530986],"study_design_scores_gemma":[0.0024450787,0.00069826806,0.29487985,0.00018908436,0.000040972536,0.00026133878,0.00036669747,0.6260561,0.002714732,0.07081996,0.001168839,0.00035910492],"about_ca_topic_score_codex":0.000035144858,"about_ca_topic_score_gemma":0.0000054807238,"teacher_disagreement_score":0.7527395,"about_ca_system_score_codex":0.000043181895,"about_ca_system_score_gemma":0.00012458222,"threshold_uncertainty_score":0.35910964},"labels":[],"label_agreement":null},{"id":"W2951648961","doi":"10.1016/j.jsc.2011.12.008","title":"Fast arithmetics in Artin–Schreier towers over finite fields","year":2011,"lang":"en","type":"article","venue":"Journal of Symbolic Computation","topic":"Coding theory and cryptography","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; Finite field; Tower; Algebraic number field; Arithmetic; Elliptic curve; Torsion (gastropod); Discrete mathematics; Pure mathematics","score_opus":0.023157195573169496,"score_gpt":0.2446057168958486,"score_spread":0.2214485213226791,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2951648961","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.36250833,0.000079174155,0.635183,0.00013989425,0.00041684878,0.00003653717,2.3761325e-7,0.000015442694,0.0016205381],"genre_scores_gemma":[0.973503,0.000018325043,0.026144354,0.00023744752,0.000076726035,7.3939924e-7,2.4251628e-7,0.000004513278,0.000014666181],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99901587,0.000081120575,0.00041308827,0.00011409631,0.00022196965,0.00015384554],"domain_scores_gemma":[0.99927276,0.00013451389,0.00027096923,0.00013039372,0.000119386605,0.00007198904],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00052247033,0.00009096863,0.00016661694,0.00040115643,0.000040813655,0.000060584756,0.0003534394,0.000056667453,0.000043812743],"category_scores_gemma":[0.00004785732,0.00008325324,0.00010880191,0.00049952866,0.000028249186,0.0004197564,0.0000653789,0.00023451034,0.000008834635],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00019626389,0.00074587873,0.02527997,0.00004363361,0.00012551175,0.00030389748,0.038349837,0.024648093,0.00055935583,0.13054475,0.0010559619,0.77814686],"study_design_scores_gemma":[0.0029288486,0.0014125017,0.2727521,0.00034062847,0.00005231077,0.00029276434,0.00065545656,0.21005288,0.0021326907,0.5069827,0.0017253294,0.00067179604],"about_ca_topic_score_codex":0.000008470486,"about_ca_topic_score_gemma":0.000003927406,"teacher_disagreement_score":0.77747506,"about_ca_system_score_codex":0.000020977248,"about_ca_system_score_gemma":0.000046406258,"threshold_uncertainty_score":0.33949685},"labels":[],"label_agreement":null},{"id":"W2956505993","doi":"10.1016/j.jsc.2019.07.009","title":"On the Extended Hensel Construction and its application to the computation of real limit points","year":2019,"lang":"en","type":"article","venue":"Journal of Symbolic Computation","topic":"Polynomial and algebraic computation","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Univariate; Rational function; Polynomial; Computation; Limit (mathematics); Bivariate analysis; Algebraic number; Multivariate statistics; Discrete mathematics; Algebra over a field; Applied mathematics; Pure mathematics; Algorithm; Mathematical analysis","score_opus":0.010749298313966107,"score_gpt":0.24320198452094566,"score_spread":0.23245268620697956,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2956505993","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.61345464,0.000039512248,0.3809967,0.004639432,0.00036757937,0.0003165124,9.690336e-7,0.000015499965,0.00016917533],"genre_scores_gemma":[0.99404997,0.000019985648,0.005379688,0.00040197588,0.00012654885,0.000004633384,0.0000016947646,0.000007171099,0.000008333519],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984863,0.00017774958,0.0005510721,0.00019565909,0.0004543723,0.00013486897],"domain_scores_gemma":[0.9981637,0.00049672305,0.00070225185,0.00016112912,0.00040461903,0.00007156192],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00073966384,0.00012697102,0.000219592,0.00020508733,0.00012439404,0.00008651257,0.0003511018,0.000044766493,0.000002878166],"category_scores_gemma":[0.000074243835,0.00008055656,0.00007469682,0.00047363056,0.00003333383,0.00031100935,0.00008502377,0.00017252257,0.00002978812],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00015275071,0.00014308971,0.0003113365,0.000048059457,0.00008116527,0.0000019952606,0.004533785,0.0706048,0.008953256,0.3544263,0.0005540934,0.56018937],"study_design_scores_gemma":[0.0011531318,0.0009197116,0.07980738,0.0001833612,0.000036519123,0.0002353889,0.00036395114,0.7871186,0.002749028,0.12700205,0.00019961789,0.00023126752],"about_ca_topic_score_codex":0.00001364211,"about_ca_topic_score_gemma":0.000002415827,"teacher_disagreement_score":0.7165138,"about_ca_system_score_codex":0.000053769352,"about_ca_system_score_gemma":0.00008284938,"threshold_uncertainty_score":0.3285001},"labels":[],"label_agreement":null},{"id":"W2966446838","doi":"10.1016/j.jsc.2019.10.013","title":"Complex Golay pairs up to length 28: A search via computer algebra and programmatic SAT","year":2019,"lang":"en","type":"article","venue":"Journal of Symbolic Computation","topic":"graph theory and CDMA systems","field":"Engineering","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":"Wilfrid Laurier University; University of Waterloo","funders":"","keywords":"Binary Golay code; Mathematics; Sequence (biology); Algebraic number; Symbolic computation; Algorithm; Search algorithm; Conjecture; Satisfiability; Computation; Discrete mathematics; Combinatorics","score_opus":0.011700229146881482,"score_gpt":0.23035184370239942,"score_spread":0.21865161455551793,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2966446838","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8895276,0.000105474624,0.10915836,0.00008526633,0.0006323508,0.00030373543,0.0000010933685,0.00005635165,0.00012977139],"genre_scores_gemma":[0.9964426,0.000005723567,0.0032485006,0.00004934851,0.00020251487,0.0000026507703,0.0000039685406,0.000023919516,0.000020749714],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988615,0.00010437124,0.0004521206,0.00010544567,0.00027124112,0.00020530037],"domain_scores_gemma":[0.9994296,0.00010654044,0.00009281027,0.00009390728,0.00012217849,0.00015500678],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005315957,0.00014125873,0.00031989097,0.00025457243,0.000043527234,0.00009298347,0.00011883041,0.000050400307,0.000023932307],"category_scores_gemma":[0.0000048159495,0.00012570192,0.00008001631,0.00023684441,0.000019482135,0.00017517737,0.000028171951,0.00019134136,0.000079369005],"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.0001625943,0.00013600658,0.015064308,0.0016041915,0.0006631064,0.000044470857,0.028138688,0.45803255,0.017140893,0.0031936425,0.003095888,0.47272366],"study_design_scores_gemma":[0.0016987337,0.00078439515,0.09289031,0.0004228662,0.000053099033,0.00066750107,0.0009934488,0.8972041,0.00032884203,0.0029651665,0.0015893059,0.00040220603],"about_ca_topic_score_codex":0.000004676736,"about_ca_topic_score_gemma":0.0000016305858,"teacher_disagreement_score":0.47232145,"about_ca_system_score_codex":0.0000476753,"about_ca_system_score_gemma":0.000014346705,"threshold_uncertainty_score":0.51259756},"labels":[],"label_agreement":null},{"id":"W3012215194","doi":"10.1016/j.jsc.2020.10.005","title":"Wasserstein distance to independence models","year":2020,"lang":"en","type":"preprint","venue":"Journal of Symbolic Computation","topic":"Point processes and geometric inequalities","field":"Mathematics","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":"Horizon 2020; European Research Council; Deutsche Forschungsgemeinschaft","keywords":"Simplex; Mathematics; Polytope; Piecewise; Lipschitz continuity; Independence (probability theory); Probability measure; Unit sphere; Random variable; Wasserstein metric; Algebraic number; Joint probability distribution; Metric space; Probability distribution; Combinatorics; Discrete mathematics; Mathematical optimization; Applied mathematics; Pure mathematics; Mathematical analysis; Statistics","score_opus":0.1341645464643951,"score_gpt":0.36791560997973294,"score_spread":0.23375106351533784,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3012215194","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12859951,0.00035685668,0.8673626,0.0018752738,0.00060082664,0.00020968073,0.000020304784,0.0000324766,0.00094244926],"genre_scores_gemma":[0.95847344,0.00006472714,0.0405633,0.00022313652,0.0005287128,0.000005404879,0.000005119594,0.00002849686,0.00010766197],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9975277,0.00008013358,0.001056564,0.00022850095,0.0009096168,0.00019748419],"domain_scores_gemma":[0.9971088,0.00036418496,0.0012462065,0.00016880804,0.00092498004,0.00018699942],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00075083313,0.00023394197,0.00068542745,0.00043298112,0.000050087918,0.00014859001,0.000451265,0.00017993631,0.000012551323],"category_scores_gemma":[0.0007700052,0.0002123972,0.00020828079,0.00046358103,0.00001653074,0.00023922033,0.0003085043,0.00078461564,0.0000088830175],"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.00051743205,0.00052504207,0.00014419106,0.0073472178,0.0008047583,0.00028059966,0.043781206,0.57207847,0.00022983403,0.30914026,0.021204077,0.043946877],"study_design_scores_gemma":[0.0002735457,0.00014625328,0.00010583671,0.0007455973,0.00008506264,0.000042893716,0.0007430298,0.04128445,0.0001335174,0.9559621,0.00023395948,0.00024371376],"about_ca_topic_score_codex":0.000019965888,"about_ca_topic_score_gemma":0.000006175832,"teacher_disagreement_score":0.8298739,"about_ca_system_score_codex":0.00016500689,"about_ca_system_score_gemma":0.00034405026,"threshold_uncertainty_score":0.8661306},"labels":[],"label_agreement":null},{"id":"W3036636177","doi":"10.1016/j.jsc.2020.06.003","title":"An unwinding number pair for continuous expressions of integrals","year":2020,"lang":"en","type":"article","venue":"Journal of Symbolic Computation","topic":"Mathematical and Theoretical Analysis","field":"Mathematics","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","keywords":"Mathematics; Intersection (aeronautics); Logarithm; Multiple integral; Real number; Function (biology); Classification of discontinuities; Methods of contour integration; Integration by parts; Mathematical analysis; Pure mathematics; Applied mathematics","score_opus":0.07014748399703147,"score_gpt":0.38082382014542554,"score_spread":0.31067633614839407,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3036636177","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5353864,0.000007895279,0.46332508,0.0007550933,0.000030941803,0.00009015301,0.0000047080707,0.000012118595,0.0003876009],"genre_scores_gemma":[0.9344668,0.0000016092234,0.06526189,0.00007697347,0.00016119637,0.0000021052722,0.0000020064688,0.0000116656765,0.000015747282],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99875414,0.000084538595,0.0007289347,0.00008317993,0.00024145177,0.000107738626],"domain_scores_gemma":[0.99800545,0.0008732032,0.0005551361,0.00006737861,0.00034213514,0.00015672058],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00043428998,0.000092324735,0.0004857855,0.000055226563,0.000039688053,0.000021015956,0.00014405986,0.00004898973,0.0001714922],"category_scores_gemma":[0.00096997654,0.0000632641,0.00023917851,0.00016460883,0.00004549586,0.00011250511,0.000018652825,0.00011150253,0.0000040223836],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00022637607,0.00078154274,0.00089257257,0.0007336293,0.0003595719,0.000009650665,0.008866115,0.0005517225,0.013429697,0.95620453,0.002554047,0.015390532],"study_design_scores_gemma":[0.0005956412,0.0003045731,0.000099768964,0.00022039891,0.00022320898,0.000018381621,0.001135386,0.04255299,0.0052135717,0.9494454,0.00009490332,0.000095723815],"about_ca_topic_score_codex":0.0000010146233,"about_ca_topic_score_gemma":1.7042376e-7,"teacher_disagreement_score":0.3990804,"about_ca_system_score_codex":0.000011483448,"about_ca_system_score_gemma":0.000023073162,"threshold_uncertainty_score":0.25798354},"labels":[],"label_agreement":null},{"id":"W3081736912","doi":"10.1016/j.jsc.2022.10.002","title":"Computing critical points for invariant algebraic systems","year":2022,"lang":"en","type":"article","venue":"Journal of Symbolic Computation","topic":"Polynomial and algebraic computation","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"H2020 Marie Skłodowska-Curie Actions; Agence Nationale de la Recherche; H2020 Fast Track to Innovation; Horizon 2020; Natural Sciences and Engineering Research Council of Canada; European Commission","keywords":"Mathematics; Combinatorics; Invariant (physics); Polynomial; Jacobian matrix and determinant; Discrete mathematics; Algebraic number; Finite field; Invariant polynomial; Exponential function; Matrix polynomial; Mathematical analysis; Mathematical physics","score_opus":0.02115593940969856,"score_gpt":0.2819425198729099,"score_spread":0.26078658046321135,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3081736912","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.078560404,0.0003059686,0.9149127,0.0028648342,0.002967717,0.00024235439,0.0000047541585,0.00005568236,0.000085593274],"genre_scores_gemma":[0.96265316,0.000001775728,0.03638905,0.00040459726,0.0005097711,0.000009087871,0.0000048967963,0.000012734545,0.000014952928],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9977971,0.00027392487,0.0008202673,0.000233097,0.0005946007,0.0002810163],"domain_scores_gemma":[0.99781746,0.0009526558,0.00057879597,0.00013751045,0.0003745338,0.00013903256],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015094402,0.00014152011,0.0003341331,0.0003586609,0.00046387778,0.00025393037,0.0006528152,0.000032337473,0.000007087129],"category_scores_gemma":[0.00023201143,0.00014088624,0.00017241215,0.0004633296,0.000029889314,0.0005031501,0.0002834836,0.00026921782,0.000004561616],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00011066492,0.0004798934,0.00020891854,0.00015876655,0.00013347277,0.000098281445,0.0050260723,0.37495595,0.0012476376,0.46057585,0.008751578,0.14825289],"study_design_scores_gemma":[0.0010123384,0.0006258197,0.0015829082,0.000048566188,0.000021091228,0.00095490523,0.00026440725,0.94821185,0.00006819762,0.04486146,0.0021558271,0.0001926244],"about_ca_topic_score_codex":0.00001362393,"about_ca_topic_score_gemma":3.3879888e-7,"teacher_disagreement_score":0.88409275,"about_ca_system_score_codex":0.0001811137,"about_ca_system_score_gemma":0.00026457207,"threshold_uncertainty_score":0.5745174},"labels":[],"label_agreement":null},{"id":"W3113778377","doi":"10.1016/j.jsc.2022.08.012","title":"PTOPO: Computing the geometry and the topology of parametric curves","year":2022,"lang":"en","type":"article","venue":"Journal of Symbolic Computation","topic":"Advanced Numerical Analysis Techniques","field":"Engineering","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":"H2020 Marie Skłodowska-Curie Actions; Horizon 2020; HORIZON EUROPE Framework Programme; Türkiye Bilimsel ve Teknolojik Araştırma Kurumu; Fondation Mathématique Jacques Hadamard; Agence Nationale de la Recherche; Providence Health Care","keywords":"Mathematics; Topology (electrical circuits); Geometry and topology; Geometric topology; Geometry; Combinatorics","score_opus":0.00641392972369334,"score_gpt":0.24954651326506616,"score_spread":0.24313258354137282,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3113778377","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6650797,0.0068155304,0.3265933,0.0011034415,0.00014321743,0.00010136682,0.0000011235262,0.000029871215,0.00013240277],"genre_scores_gemma":[0.99710363,0.00042092285,0.002273205,0.00014385715,0.000046267123,0.0000016456066,6.9222017e-7,0.0000066188277,0.0000031456254],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991535,0.00013171603,0.00038079565,0.00004416405,0.0002124478,0.00007739618],"domain_scores_gemma":[0.99890274,0.00067736924,0.00026792102,0.0000641752,0.00006974511,0.000018073251],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00065578317,0.000059148315,0.00024058491,0.00018644083,0.00009902997,0.000007918359,0.0001552542,0.000012654951,0.000011847917],"category_scores_gemma":[0.00010758376,0.000035136913,0.00007909221,0.0007377929,0.00009844556,0.000047200898,0.000068827096,0.0002716912,1.8131676e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000032209377,0.00003593282,0.001382498,0.00007769982,0.00018095417,0.0000038367484,0.0008326061,0.8933272,0.00027994026,0.0021098137,0.0010240222,0.10071332],"study_design_scores_gemma":[0.0012751949,0.00029885868,0.025185974,0.00008283404,0.00023519709,0.00051303743,0.0015218135,0.93105996,0.0007866666,0.03717118,0.0016722556,0.00019704767],"about_ca_topic_score_codex":0.00001024919,"about_ca_topic_score_gemma":3.0674985e-7,"teacher_disagreement_score":0.33202392,"about_ca_system_score_codex":0.000034401313,"about_ca_system_score_gemma":0.000008058737,"threshold_uncertainty_score":0.14328417},"labels":[],"label_agreement":null},{"id":"W4211152440","doi":"10.1016/j.jsc.2009.05.001","title":"Preface","year":2009,"lang":"en","type":"article","venue":"Journal of Symbolic Computation","topic":"","field":"","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","score_opus":0.013981961890880674,"score_gpt":0.2997473978945282,"score_spread":0.2857654360036475,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4211152440","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.97749025,0.00020219467,0.018301845,0.0007469998,0.00021635261,0.00007006581,0.0000011283104,0.000036831432,0.0029343267],"genre_scores_gemma":[0.9949714,0.0000059118593,0.004502457,0.00015125277,0.00030873364,1.2202877e-7,0.0000013297188,0.000012389754,0.00004638901],"study_design_codex":"design_other","study_design_gemma":"observational","domain_scores_codex":[0.9989469,0.000061977495,0.00042171893,0.00006436589,0.0003803987,0.00012465802],"domain_scores_gemma":[0.9989594,0.00004229966,0.000513541,0.000060348797,0.0003356164,0.000088788634],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004014427,0.000080267426,0.00018047995,0.00023627211,0.000040269835,0.00004316109,0.0001152052,0.00003231841,0.00002380292],"category_scores_gemma":[0.000069997026,0.000070343354,0.000087177345,0.0002786548,0.000013731984,0.0003218063,0.0000063771813,0.0001564723,0.000254227],"study_design_candidate":"observational","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00052856444,0.0010142731,0.003465579,0.000025747575,0.00017764271,0.00015818317,0.007125958,0.20687076,0.14193314,0.0042754924,0.0607175,0.57370716],"study_design_scores_gemma":[0.0035195951,0.0015633897,0.89932346,0.00021525235,0.00013474161,0.0016691409,0.00033455796,0.03177689,0.0053303954,0.047999114,0.0077480874,0.00038536676],"about_ca_topic_score_codex":0.0000014705387,"about_ca_topic_score_gemma":3.6998276e-7,"teacher_disagreement_score":0.8958579,"about_ca_system_score_codex":0.00009773121,"about_ca_system_score_gemma":0.00006777739,"threshold_uncertainty_score":0.32676587},"labels":[],"label_agreement":null},{"id":"W4290098640","doi":"10.1016/j.jsc.2022.08.015","title":"Parallelization of triangular decompositions: Techniques and implementation","year":2022,"lang":"en","type":"article","venue":"Journal of Symbolic Computation","topic":"Polynomial and algebraic computation","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"","keywords":"Concurrency; Pipeline (software); Component (thermodynamics); Set (abstract data type); Parallel computing; Polynomial; Focus (optics); Mathematics; Computer science; Class (philosophy); Parallelism (grammar); Distributed computing; Programming language","score_opus":0.008855122444873777,"score_gpt":0.28257560946351823,"score_spread":0.27372048701864443,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4290098640","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3941466,0.00032054857,0.60441047,0.0006931496,0.00019370299,0.00014652353,0.0000025211525,0.000025437781,0.0000610784],"genre_scores_gemma":[0.9602822,0.00003457339,0.03951059,0.000067611305,0.00007940889,0.0000070539445,0.000009094593,0.000004632348,0.000004811352],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987905,0.00014965866,0.00054745283,0.00010718101,0.00031982537,0.000085354004],"domain_scores_gemma":[0.99896383,0.000085395186,0.00066400744,0.00007142952,0.00017243669,0.00004287683],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00050383393,0.00007235006,0.00017165478,0.00034937495,0.00014733382,0.000043684126,0.0002020447,0.0000160632,0.000012415703],"category_scores_gemma":[0.000009780059,0.00007399268,0.000061059436,0.00037956875,0.00001780491,0.0004401845,0.000120215016,0.00009377597,2.9565635e-7],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000055480188,0.00016873484,0.0006815711,0.000034285986,0.000059601567,0.000019591582,0.0035961333,0.011488753,0.00784206,0.034700416,0.0007042742,0.9406491],"study_design_scores_gemma":[0.011071764,0.006924461,0.07825322,0.00021391775,0.00024304967,0.00485161,0.003710792,0.45354554,0.06021386,0.3669808,0.012818086,0.0011729148],"about_ca_topic_score_codex":0.000017176731,"about_ca_topic_score_gemma":0.0000010896925,"teacher_disagreement_score":0.9394762,"about_ca_system_score_codex":0.00006482797,"about_ca_system_score_gemma":0.00009391788,"threshold_uncertainty_score":0.3017334},"labels":[],"label_agreement":null},{"id":"W4293832588","doi":"10.1016/j.jsc.2022.08.018","title":"Computing rational powers of monomial ideals","year":2022,"lang":"en","type":"article","venue":"Journal of Symbolic Computation","topic":"Commutative Algebra and Its Applications","field":"Mathematics","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 Toronto","funders":"University of Minnesota; National Science Foundation","keywords":"Monomial; Mathematics; Monomial ideal; Polytope; Ideal (ethics); Function (biology); Rational function; Generalization; Pure mathematics; Regular polygon; Algebra over a field; Discrete mathematics; Polynomial ring; Polynomial; Mathematical analysis","score_opus":0.041612589208420966,"score_gpt":0.3449170127569754,"score_spread":0.3033044235485544,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4293832588","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.87202203,0.00009765122,0.12639894,0.00055707374,0.00018211266,0.00013434248,0.000009178617,0.000010528953,0.00058816676],"genre_scores_gemma":[0.9853094,0.0000033540573,0.014459686,0.00005813343,0.00012663135,0.000002834892,0.00000634484,0.000011207792,0.000022392118],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99854857,0.00014982853,0.00074253813,0.00007641823,0.00038989945,0.000092728915],"domain_scores_gemma":[0.9978348,0.0006942003,0.0010369965,0.000084358166,0.00030568827,0.000043983164],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007222018,0.000078534424,0.00025876073,0.00021290271,0.00018511311,0.000015631531,0.00018128741,0.000017360964,0.0001296059],"category_scores_gemma":[0.00011784587,0.00007928218,0.00012546153,0.0002655993,0.00003365599,0.00010215981,0.000087190914,0.00020582594,0.0000017391725],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00045184177,0.0018654276,0.008013578,0.00020092672,0.0008150762,0.00002302642,0.029345565,0.20634775,0.018285887,0.6133534,0.046570543,0.07472704],"study_design_scores_gemma":[0.003296118,0.0009533225,0.05550326,0.00008098378,0.00020919536,0.0004689053,0.0051005203,0.06829436,0.0017000331,0.86114556,0.0028545614,0.00039317735],"about_ca_topic_score_codex":0.000006082028,"about_ca_topic_score_gemma":8.8535927e-7,"teacher_disagreement_score":0.24779221,"about_ca_system_score_codex":0.00010179062,"about_ca_system_score_gemma":0.00015036363,"threshold_uncertainty_score":0.32330334},"labels":[],"label_agreement":null},{"id":"W4296916461","doi":"10.1016/j.jsc.2023.102234","title":"Computing roadmaps in unbounded smooth real algebraic sets I: Connectivity results","year":2023,"lang":"en","type":"article","venue":"Journal of Symbolic Computation","topic":"Polynomial and algebraic computation","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"European Commission; Natural Sciences and Engineering Research Council of Canada; Austrian Science Fund; Agence Nationale de la Recherche; European Office of Aerospace Research and Development; Air Force Office of Scientific Research","keywords":"Mathematics; Bounded function; Algebraic number; Real algebraic geometry; Intersection (aeronautics); Computation; Dimension (graph theory); Set (abstract data type); Connected component; Robotics; Polynomial; Algebra over a field; Discrete mathematics; Theoretical computer science; Algorithm; Pure mathematics; Robot; Computer science; Artificial intelligence","score_opus":0.023006470980969553,"score_gpt":0.28940882830363396,"score_spread":0.26640235732266443,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4296916461","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8619494,0.000034884728,0.13412243,0.0018984121,0.001090403,0.0001500069,0.0000026390132,0.00016352168,0.00058833015],"genre_scores_gemma":[0.9944229,0.00002728821,0.005116845,0.00011790004,0.00026688012,0.0000012329153,0.0000119214965,0.000013642644,0.000021382479],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9972694,0.00030085916,0.0010995633,0.00034762092,0.00058139424,0.0004011906],"domain_scores_gemma":[0.9977687,0.0007794526,0.00083234924,0.00020529801,0.00026067926,0.00015349805],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001921493,0.0002030043,0.00043669558,0.0009201147,0.00015191469,0.00022634302,0.00057363475,0.000091431306,0.0000015037336],"category_scores_gemma":[0.00026148357,0.00019705141,0.00014437335,0.0020010362,0.00004443534,0.000807366,0.00021969074,0.00035089714,0.000041469164],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00019612456,0.00031341892,0.0034062904,0.0000615791,0.000081407015,0.00041184106,0.012536875,0.191063,0.0017623135,0.015380235,0.003540027,0.7712469],"study_design_scores_gemma":[0.0021628148,0.00022140524,0.35685045,0.0001341981,0.000007792203,0.000114036775,0.00013373992,0.5979978,0.00019453501,0.04179373,0.00016286959,0.00022664116],"about_ca_topic_score_codex":0.00015677049,"about_ca_topic_score_gemma":0.000056400535,"teacher_disagreement_score":0.77102023,"about_ca_system_score_codex":0.00020935433,"about_ca_system_score_gemma":0.00031421948,"threshold_uncertainty_score":0.8035523},"labels":[],"label_agreement":null},{"id":"W4377020029","doi":"10.1016/j.jsc.2023.102231","title":"An algorithmic approach based on generating trees for enumerating pattern-avoiding inversion sequences","year":2023,"lang":"en","type":"article","venue":"Journal of Symbolic Computation","topic":"Coding theory and cryptography","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":"Wilfrid Laurier University","funders":"Türkiye Bilimsel ve Teknolojik Araştırma Kurumu","keywords":"Mathematics; Inversion (geology); Tree (set theory); Set (abstract data type); Algorithm; Combinatorics; Computer science","score_opus":0.030516113599601567,"score_gpt":0.28566463479884335,"score_spread":0.2551485211992418,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4377020029","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.31746063,0.000013125898,0.6818257,0.00022660836,0.00028780336,0.000089465735,0.0000011826321,0.00006781277,0.000027673028],"genre_scores_gemma":[0.88661236,0.000002969351,0.112732425,0.00027219494,0.0003541799,0.0000061208843,0.0000090104,0.000009096993,0.0000016255353],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986193,0.00023914129,0.00039366123,0.0002131322,0.00034097335,0.00019376141],"domain_scores_gemma":[0.99880403,0.00039053193,0.0003739866,0.00013286687,0.00021565585,0.00008292552],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016384546,0.00012380198,0.00018728491,0.0005187179,0.00040972722,0.00026660386,0.00039652872,0.00004560501,0.0000011414551],"category_scores_gemma":[0.000085205946,0.000110178364,0.00013665188,0.0006436876,0.000019130428,0.0005681814,0.000029118435,0.00017539004,0.000001921371],"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.000015006861,0.00006684236,0.00040139304,0.000030600255,0.000018169178,0.000007860344,0.0024007808,0.58932745,0.009484686,0.0015129931,0.00018725973,0.39654696],"study_design_scores_gemma":[0.00045145795,0.00050357654,0.0006775712,0.000084426094,0.000009798779,0.000014698873,0.0005029913,0.9921962,0.0012855361,0.004130568,0.000020969752,0.00012218257],"about_ca_topic_score_codex":0.0000040145496,"about_ca_topic_score_gemma":7.417162e-7,"teacher_disagreement_score":0.56915176,"about_ca_system_score_codex":0.00003993703,"about_ca_system_score_gemma":0.00006911002,"threshold_uncertainty_score":0.44929433},"labels":[],"label_agreement":null},{"id":"W4391556953","doi":"10.1016/j.jsc.2025.102532","title":"Computing roadmaps in unbounded smooth real algebraic sets II: Algorithm and complexity","year":2025,"lang":"en","type":"article","venue":"Journal of Symbolic Computation","topic":"Polynomial and algebraic computation","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada; Fonds Wetenschappelijk Onderzoek; European Office of Aerospace Research and Development; Air Force Office of Scientific Research; Austrian Science Fund; Agence Nationale de la Recherche","keywords":"Algebraic number; Computer science; Algorithm; Algebra over a field; Mathematics; Pure mathematics","score_opus":0.018845130115064463,"score_gpt":0.2839940453018797,"score_spread":0.26514891518681527,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4391556953","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.493984,0.00018466127,0.5032598,0.0013952575,0.00057959865,0.000114627466,0.0000010260671,0.00004100532,0.00044000617],"genre_scores_gemma":[0.9230928,0.000035912883,0.076424405,0.00029642542,0.00011436604,9.4287986e-7,0.000004190689,0.0000069793723,0.000023992121],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9979838,0.00019003179,0.0008887832,0.00029868854,0.0003488671,0.0002898454],"domain_scores_gemma":[0.9987228,0.00026552568,0.0005138101,0.00015039032,0.00023103264,0.00011647682],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00081897445,0.00019847858,0.00044684418,0.0007059869,0.00024882174,0.00022289463,0.00044461022,0.00008198146,0.0000022124364],"category_scores_gemma":[0.00005426358,0.00019360967,0.00009354805,0.0009462939,0.0000954137,0.0006056196,0.00034608383,0.0003249865,0.000002083912],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000021384532,0.00017573105,0.0014208391,0.000036740035,0.000046177127,0.000037748076,0.00270925,0.0046771066,0.00019913218,0.03210442,0.00041555834,0.95815593],"study_design_scores_gemma":[0.0014870949,0.00016720161,0.21976961,0.00018966083,0.000013509723,0.00009750061,0.00009201594,0.635785,0.00009339832,0.14193544,0.00019255342,0.0001770097],"about_ca_topic_score_codex":0.0001788632,"about_ca_topic_score_gemma":0.000032149357,"teacher_disagreement_score":0.9579789,"about_ca_system_score_codex":0.00017468253,"about_ca_system_score_gemma":0.00029894762,"threshold_uncertainty_score":0.7895173},"labels":[],"label_agreement":null},{"id":"W4392094043","doi":"10.1016/j.jsc.2024.102310","title":"Matrix factorizations of the discriminant of S","year":2024,"lang":"en","type":"article","venue":"Journal of Symbolic Computation","topic":"Algebraic structures and combinatorial models","field":"Mathematics","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; Carleton University","funders":"Engineering and Physical Sciences Research Council; Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Discriminant; Noncommutative geometry; Ring (chemistry); Symmetric group; Group (periodic table); Polynomial ring; Matrix (chemical analysis); Combinatorics; Factorization; Algebra over a field; Matrix decomposition; Matrix group; Pure mathematics; Polynomial; Algorithm","score_opus":0.03006970399484468,"score_gpt":0.3498138827065518,"score_spread":0.3197441787117071,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4392094043","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.94606626,0.00028079277,0.051562745,0.00022734945,0.0016406752,0.00007928997,0.000003613598,0.0000064858214,0.00013278855],"genre_scores_gemma":[0.99880594,0.000012374127,0.0009785837,0.000003085964,0.00014977889,3.7548753e-7,3.525118e-7,0.000008763226,0.00004073305],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990936,0.000038806746,0.0004827248,0.00004482371,0.00028476308,0.00005530669],"domain_scores_gemma":[0.9991314,0.00020952908,0.00036668548,0.00007968262,0.00019199654,0.000020723232],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001458993,0.00005995347,0.00018914549,0.000085277374,0.000027078177,0.000015253297,0.00013016243,0.00003486989,0.000012779643],"category_scores_gemma":[0.00010457316,0.000035071964,0.00015184739,0.00021590645,0.000030547722,0.000078914636,0.000028520357,0.00010206524,2.9770212e-7],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000012074217,0.000054486878,0.00027561295,0.00027007578,0.00009746279,0.0000015434935,0.0036745172,0.0016200843,0.002743944,0.9879199,0.00051660114,0.0028136645],"study_design_scores_gemma":[0.00016742168,0.00006816237,0.0038027563,0.00027904898,0.000116908595,0.000030433781,0.00023390545,0.0029090827,0.0028001599,0.9894645,0.00008547529,0.000042144817],"about_ca_topic_score_codex":0.000007142294,"about_ca_topic_score_gemma":7.3227136e-7,"teacher_disagreement_score":0.052739695,"about_ca_system_score_codex":0.00002609434,"about_ca_system_score_gemma":0.0001016796,"threshold_uncertainty_score":0.14301932},"labels":[],"label_agreement":null},{"id":"W4402858306","doi":"10.1016/j.jsc.2024.102389","title":"An <mml:math xmlns:mml=\"http://www.w3.org/1998/Math/MathML\" altimg=\"si1.svg\"> <mml:mi mathvariant=\"fraktur\">m</mml:mi> </mml:math> -adic algorithm for bivariate Gröbner bases","year":2024,"lang":"nl","type":"article","venue":"Journal of Symbolic Computation","topic":"Polynomial and algebraic computation","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"European Research Council; Natural Sciences and Engineering Research Council of Canada; Fonds Québécois de la Recherche sur la Nature et les Technologies","keywords":"Mathematics; Algorithm; Bivariate analysis; Statistics","score_opus":0.01845828149499284,"score_gpt":0.26250158108830496,"score_spread":0.2440432995933121,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4402858306","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.50821733,0.00084116706,0.4851258,0.0010933342,0.0042247763,0.000099394805,0.00006260221,0.00013320097,0.00020235473],"genre_scores_gemma":[0.94216174,0.00021638928,0.052830294,0.00079149933,0.0036424263,0.00004153976,0.00009568299,0.00011770775,0.000102742204],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9957442,0.00022973683,0.0014624919,0.0007561009,0.0010649986,0.00074247166],"domain_scores_gemma":[0.9966733,0.000873006,0.0012020437,0.0004722241,0.00032308436,0.00045633194],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0016404757,0.00048029423,0.00045255868,0.0005482692,0.00059034186,0.0017416367,0.0009432932,0.00040342743,0.00004857791],"category_scores_gemma":[0.00015970856,0.00052613375,0.0007062524,0.00079947594,0.00017324797,0.001963355,0.0003152951,0.00068508484,0.0005026196],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000087288914,0.00022719053,0.0000014856287,0.00028475383,0.00032430337,0.00034987734,0.0024292928,0.012465927,0.00064342975,0.7627611,0.0018220469,0.21860327],"study_design_scores_gemma":[0.0009783069,0.0012878117,0.00029012407,0.0009302816,0.0003674017,0.0014027427,0.00024258929,0.9792207,0.0009578819,0.010246749,0.0035987967,0.00047660366],"about_ca_topic_score_codex":0.00021700843,"about_ca_topic_score_gemma":0.000018836368,"teacher_disagreement_score":0.9667548,"about_ca_system_score_codex":0.00007600977,"about_ca_system_score_gemma":0.001159503,"threshold_uncertainty_score":0.999719},"labels":[],"label_agreement":null},{"id":"W4409534108","doi":"10.1016/j.jsc.2025.102449","title":"Linear preservers of secant varieties and other varieties of tensors","year":2025,"lang":"en","type":"article","venue":"Journal of Symbolic Computation","topic":"Tensor decomposition and applications","field":"Mathematics","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Directorate for Mathematical and Physical Sciences; National Science Foundation","keywords":"Mathematics; Pure mathematics; Algebra over a field","score_opus":0.032607690337990575,"score_gpt":0.34204714740758524,"score_spread":0.30943945706959464,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4409534108","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9148243,0.00013150509,0.082751065,0.00067091023,0.00006725353,0.00012282308,0.000009634579,0.000011103153,0.0014113843],"genre_scores_gemma":[0.98327535,0.000019627321,0.01644465,0.00005186415,0.000028681727,0.0000013823054,7.0796733e-7,0.000006529241,0.00017122185],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991302,0.000049281814,0.00053349306,0.00005762404,0.00017155321,0.0000578492],"domain_scores_gemma":[0.99872404,0.0002868709,0.000501345,0.000081960665,0.0003780454,0.000027731709],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00024531127,0.00006779385,0.00025852502,0.00018280548,0.00003497449,0.000010716401,0.00008486341,0.000044272616,0.000019216179],"category_scores_gemma":[0.000086340435,0.000057550176,0.000072133655,0.00016806346,0.00006757871,0.000063152394,0.000025107554,0.000090018075,4.0570026e-7],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002451709,0.00073440105,0.0077728825,0.001079662,0.00058156444,0.0000023844186,0.009858568,0.007117612,0.013063031,0.9476632,0.007608204,0.00427334],"study_design_scores_gemma":[0.0021004179,0.000329883,0.04137237,0.00046539056,0.00036306938,0.000058924215,0.0032822941,0.024435032,0.013457928,0.91107404,0.0028594965,0.00020116336],"about_ca_topic_score_codex":0.000018190185,"about_ca_topic_score_gemma":0.000002277497,"teacher_disagreement_score":0.06845102,"about_ca_system_score_codex":0.000013627384,"about_ca_system_score_gemma":0.000053976237,"threshold_uncertainty_score":0.23468281},"labels":[],"label_agreement":null},{"id":"W4411200937","doi":"10.1016/j.jsc.2025.102473","title":"How to generate all possible rational Wilf–Zeilberger forms?","year":2025,"lang":"en","type":"article","venue":"Journal of Symbolic Computation","topic":"Advanced Algebra and Geometry","field":"Mathematics","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":"Canadian Anesthesiologists' Society; National Key Research and Development Program of China; Youth Innovation Promotion Association; Austrian Science Fund; Chinese Academy of Sciences; National Natural Science Foundation of China","keywords":"Mathematics; Algebra over a field; Arithmetic; Discrete mathematics; Pure mathematics","score_opus":0.026971046158159394,"score_gpt":0.3336077565991802,"score_spread":0.3066367104410208,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4411200937","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5443905,0.00009703206,0.44988394,0.0046088207,0.0003458123,0.00009649655,0.0000012431814,0.000013252917,0.00056291424],"genre_scores_gemma":[0.9538933,0.000011471383,0.042965513,0.00075833563,0.00030040622,0.000003302014,0.000004099246,0.000011677826,0.0020518692],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99899083,0.000033967415,0.00041755495,0.00010407779,0.00029498845,0.00015858702],"domain_scores_gemma":[0.99891603,0.00021310794,0.0002932339,0.00008644477,0.0004022732,0.00008892748],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00029428155,0.000112253445,0.00024450474,0.00039177662,0.00007549452,0.00010302949,0.00012133763,0.000050935843,0.000014098689],"category_scores_gemma":[0.00028869312,0.0000902144,0.00010298819,0.0004234354,0.000013377871,0.00035225513,0.000034555553,0.000144556,0.000007521241],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00037794,0.00079992256,0.002959998,0.0004801818,0.000953428,0.00007288669,0.0039185216,0.06222665,0.020790627,0.6613416,0.11417317,0.13190505],"study_design_scores_gemma":[0.0010759152,0.00015952812,0.00550979,0.00018473562,0.00008547477,0.000070947535,0.00032306154,0.005357254,0.0044636396,0.97781026,0.0047605927,0.00019879144],"about_ca_topic_score_codex":3.9592834e-7,"about_ca_topic_score_gemma":0.0000027211881,"teacher_disagreement_score":0.40950283,"about_ca_system_score_codex":0.00007961518,"about_ca_system_score_gemma":0.000110436304,"threshold_uncertainty_score":0.36788365},"labels":[],"label_agreement":null},{"id":"W4416345348","doi":"10.1016/j.jsc.2025.102531","title":"q-analogues of π-formulas due to Ramanujan and Guillera","year":2025,"lang":"en","type":"article","venue":"Journal of Symbolic Computation","topic":"Advanced Mathematical Identities","field":"Mathematics","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":"Ramanujan's sum; Series (stratigraphy); Normalization (sociology); Hypergeometric function; Basic hypergeometric series; Recurrence relation","score_opus":0.0306126251127774,"score_gpt":0.36378128869862214,"score_spread":0.33316866358584474,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4416345348","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6665012,0.0001309983,0.3306458,0.00051683595,0.00012142371,0.0001222645,0.0000014217944,0.000011180306,0.0019488371],"genre_scores_gemma":[0.9257048,0.000014858721,0.073796555,0.00006200667,0.0000494103,0.0000013305201,4.4889364e-7,0.000008074373,0.00036253143],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989558,0.00003322825,0.0006373024,0.00006744115,0.00021386797,0.000092360904],"domain_scores_gemma":[0.9986544,0.00052618835,0.0003495443,0.00008628732,0.0003292814,0.000054290605],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003388287,0.00008470169,0.00038949895,0.0003007696,0.000035283792,0.000026366011,0.0001020361,0.000035516863,0.0000102708655],"category_scores_gemma":[0.000726102,0.00007109332,0.00007091776,0.00019082359,0.000039225077,0.00014858498,0.00005962793,0.000090728274,0.000002327818],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00015992305,0.0005689419,0.0006143393,0.0020127406,0.0006360574,0.00005638908,0.01186142,0.0038856033,0.0061935447,0.90590847,0.014518083,0.05358447],"study_design_scores_gemma":[0.0003919876,0.000099632554,0.0027842813,0.00036266405,0.0000784388,0.00005607346,0.0005802776,0.0013528258,0.0018498582,0.9922427,0.00014055417,0.000060689526],"about_ca_topic_score_codex":0.000003272764,"about_ca_topic_score_gemma":0.000004129367,"teacher_disagreement_score":0.25920355,"about_ca_system_score_codex":0.00003693579,"about_ca_system_score_gemma":0.000037737504,"threshold_uncertainty_score":0.28991014},"labels":[],"label_agreement":null},{"id":"W4416510022","doi":"10.1016/j.jsc.2025.102527","title":"Efficient detection of redundancies in systems of linear inequalities","year":2025,"lang":"en","type":"article","venue":"Journal of Symbolic Computation","topic":"Formal Methods in Verification","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":"Mitacs; National Natural Science Foundation of China","keywords":"Redundancy (engineering); Linear inequality; Gaussian; Linear system; Software; Gaussian elimination","score_opus":0.02511455571546124,"score_gpt":0.318067309482351,"score_spread":0.2929527537668898,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4416510022","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.47180012,0.00022160084,0.52727085,0.000024364235,0.0005370665,0.000058549256,3.6121682e-7,0.000005128723,0.000081956576],"genre_scores_gemma":[0.9348333,0.0000112050575,0.06510268,0.0000064116043,0.000030552466,0.0000016392408,1.9712496e-7,0.000002398712,0.0000116132],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99838763,0.00022127853,0.00093358423,0.00008132084,0.00029308334,0.000083076266],"domain_scores_gemma":[0.9983103,0.0001754245,0.0008495187,0.00012915285,0.00051679945,0.000018767769],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014683836,0.00006491632,0.00026608573,0.0006615845,0.000025734982,0.000019134784,0.00025407484,0.000047313333,2.5451706e-7],"category_scores_gemma":[0.00026168243,0.000060238504,0.000060092454,0.0007941868,0.000042302683,0.00015786439,0.00004453434,0.00011369645,3.57197e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000057510046,0.00015260573,0.00087178685,0.0004245219,0.00003031342,0.0000014879402,0.00545433,0.8854925,0.03009802,0.043942515,0.000010295594,0.033464096],"study_design_scores_gemma":[0.00038951833,0.00017207486,0.029310374,0.00040600565,0.000009195471,0.000017635877,0.00065381546,0.9318258,0.035425734,0.0017040201,0.000031773856,0.00005403361],"about_ca_topic_score_codex":0.00006576915,"about_ca_topic_score_gemma":0.000002130497,"teacher_disagreement_score":0.46303317,"about_ca_system_score_codex":0.000092569186,"about_ca_system_score_gemma":0.00012654312,"threshold_uncertainty_score":0.2456455},"labels":[],"label_agreement":null},{"id":"W647353463","doi":"10.1016/j.jsc.2015.06.006","title":"Symbolic computation on a second-order KdV equation","year":2015,"lang":"en","type":"article","venue":"Journal of Symbolic Computation","topic":"Nonlinear Waves and Solitons","field":"Physics and Astronomy","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":"Mathematics; Korteweg–de Vries equation; Symbolic computation; Soliton; Computation; Order (exchange); Nonlinear system; Applied mathematics; Type (biology); Algebra over a field; Mathematical analysis; Pure mathematics; Algorithm; Physics","score_opus":0.04106003361534462,"score_gpt":0.3106694314750446,"score_spread":0.2696093978597,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W647353463","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.79593956,0.00003817062,0.19548175,0.0004256789,0.00066132494,0.00014139868,0.000011251277,0.00001671899,0.0072841393],"genre_scores_gemma":[0.9937633,0.0000010660993,0.004440409,0.00012685425,0.0013980888,0.000001948982,0.000055030836,0.000020485048,0.00019278424],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99861735,0.000109558365,0.00055562006,0.00013415153,0.000400326,0.00018296843],"domain_scores_gemma":[0.9984592,0.00011468873,0.0005393794,0.00008304877,0.000623581,0.00018009068],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004003055,0.00015298955,0.00028107036,0.00021663144,0.00008148951,0.00009493754,0.00010419183,0.00004568366,0.000074927135],"category_scores_gemma":[0.000024706871,0.00013804853,0.00012554677,0.00027253243,0.000025733892,0.00026307922,0.000021378512,0.00023979488,0.00007468861],"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.00041738758,0.0018449691,0.017143164,0.00007386032,0.0006445353,0.000028445118,0.014431233,0.5610005,0.001254568,0.04843038,0.018253936,0.33647698],"study_design_scores_gemma":[0.010274033,0.0021856222,0.05484344,0.00038891367,0.00026922606,0.000105923,0.005918747,0.70267576,0.0016095146,0.20875534,0.011900139,0.0010733178],"about_ca_topic_score_codex":0.000031476535,"about_ca_topic_score_gemma":0.0000018112156,"teacher_disagreement_score":0.33540368,"about_ca_system_score_codex":0.00007593273,"about_ca_system_score_gemma":0.00022906771,"threshold_uncertainty_score":0.5629456},"labels":[],"label_agreement":null}]}