{"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4320956,0.0017812242,0.46803823,0.0039500967,0.00060118956,0.0001553018,0.00035362004,0.00054112094,0.09248362],"genre_scores_gemma":[0.92509633,0.0008755148,0.045252316,0.0004468776,0.00033169464,0.0000941013,0.00032821362,0.00025770275,0.02731731],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988901,0.00026723294,0.0000745759,0.00021509065,0.00039032073,0.00016276388],"domain_scores_gemma":[0.9982926,0.0006191208,0.00019107087,0.00034230552,0.00026285954,0.0002919488],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010475931,0.0007284762,0.0009299186,0.0035982942,0.0026118786,0.0044356533,0.001736941,0.0014397502,0.008072435],"category_scores_gemma":[0.00430344,0.0005628019,0.00097586313,0.0021467358,0.0035382241,0.0078581935,0.0069939494,0.0032452662,0.0008905279],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008150578,0.000010195094,0.00011179169,0.000014192347,0.0000040935474,0.00003826825,0.00021827528,0.0006392324,0.0002199908,0.99548113,0.0003941614,0.0028605345],"study_design_scores_gemma":[0.00000459539,0.0000072146445,0.00006934469,0.000006436426,0.000005793062,0.00005196645,0.00013117374,0.004405178,0.00022986319,0.9928691,0.002213863,0.0000054154775],"about_ca_topic_score_codex":0.001513682,"about_ca_topic_score_gemma":0.0012158534,"teacher_disagreement_score":0.008072435,"about_ca_system_score_codex":0.001629959,"about_ca_system_score_gemma":0.0005418334,"threshold_uncertainty_score":0.027005017},"labels":[],"label_agreement":null},{"id":"W1539820931","doi":"10.1016/j.jsc.2016.12.004","title":"Numerical algorithms for detecting embedded components","year":2017,"lang":"en","type":"preprint","venue":"Journal of Symbolic Computation","topic":"Polynomial and algebraic computation","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"National Science Foundation","keywords":"Algorithm; Computer science","score_opus":0.052945971012643804,"score_gpt":0.3257271769855561,"score_spread":0.2727812059729123,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1539820931","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.015481291,0.00015803156,0.98076516,0.00018335634,0.00006565169,0.00007483808,0.00015264798,0.0012403163,0.0018786419],"genre_scores_gemma":[0.22747597,0.00016649657,0.7679677,0.000109075576,0.00007463826,0.00019746365,0.0005296013,0.00028042422,0.0031986125],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99822277,0.00038358624,0.0001648675,0.0003910399,0.0006898668,0.00014793067],"domain_scores_gemma":[0.99027354,0.005308704,0.0007197847,0.0016912257,0.0017258548,0.00028093503],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019384135,0.0013026884,0.0011670163,0.0030599048,0.0009795555,0.0027873537,0.0026619795,0.0018365819,0.008506806],"category_scores_gemma":[0.02435123,0.000722586,0.00082871655,0.002512571,0.0018589541,0.0042673023,0.003529818,0.002317632,0.002296503],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0010031696,0.00026159562,0.0050607375,0.0005626349,0.00013926906,0.00014695807,0.00036817684,0.15496166,0.02258125,0.2717644,0.0073254546,0.5358248],"study_design_scores_gemma":[0.00008349559,0.000055737193,0.000466004,0.000048583057,0.00003221035,0.000090387526,0.00009451542,0.7619136,0.01013711,0.22444566,0.0026065814,0.00002611822],"about_ca_topic_score_codex":0.0015272072,"about_ca_topic_score_gemma":0.0019441536,"teacher_disagreement_score":0.008506806,"about_ca_system_score_codex":0.0010361618,"about_ca_system_score_gemma":0.0017381469,"threshold_uncertainty_score":0.028458118},"labels":[],"label_agreement":null},{"id":"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.69256026,0.0007342597,0.20015341,0.0011875333,0.0010379979,0.000117713425,0.0002696931,0.0008597652,0.10307933],"genre_scores_gemma":[0.9316826,0.0006330125,0.027444933,0.0003002395,0.0005371544,0.00008379341,0.00024067196,0.0006790631,0.03839872],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.999065,0.00014589333,0.000047790498,0.00011839571,0.0003740508,0.00024891054],"domain_scores_gemma":[0.9981394,0.0005139803,0.000272169,0.00027888094,0.00029452972,0.0005011115],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012361387,0.0011009402,0.0010231604,0.0046739965,0.0027905127,0.004037282,0.0016623235,0.0014282361,0.007960711],"category_scores_gemma":[0.005062349,0.0010249155,0.00075969304,0.002272828,0.0029058286,0.0071428465,0.004271395,0.0026377535,0.0009297007],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000037283087,0.000027386335,0.00018168185,0.000018371997,0.000010415092,0.000112683236,0.00028379617,0.0011294398,0.001275349,0.9925248,0.0006217983,0.0037771112],"study_design_scores_gemma":[0.000013141965,0.000014528609,0.00021781499,0.000012461931,0.000010214427,0.00007698751,0.00014020286,0.0063591585,0.00076958444,0.9907328,0.001637498,0.000015575495],"about_ca_topic_score_codex":0.0012519576,"about_ca_topic_score_gemma":0.0017686406,"teacher_disagreement_score":0.007960711,"about_ca_system_score_codex":0.0012901238,"about_ca_system_score_gemma":0.0006234323,"threshold_uncertainty_score":0.026631236},"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.14144953,0.002713589,0.37834075,0.0109078875,0.0017544373,0.00007027336,0.0002635192,0.00044865816,0.4640514],"genre_scores_gemma":[0.90192515,0.0010075758,0.03696653,0.0013230959,0.001546254,0.00010039788,0.00014903648,0.00037252033,0.05660943],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99931955,0.00020853501,0.000026736274,0.00010405676,0.00024007155,0.0001011235],"domain_scores_gemma":[0.9989454,0.0004508969,0.000078899495,0.00015086873,0.00021195663,0.00016190748],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001516098,0.000849329,0.0010760414,0.0018791327,0.0015918517,0.0026707875,0.0014208679,0.0016920054,0.008850994],"category_scores_gemma":[0.0051749726,0.00039093298,0.00092957675,0.0009541588,0.0042444966,0.005718804,0.002676205,0.0034050434,0.0008278058],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000070861074,0.000007795945,0.000025504161,0.000009206777,0.0000025676002,0.000016891305,0.000039112027,0.00042182862,0.00015683936,0.9975757,0.00060961203,0.0011278207],"study_design_scores_gemma":[0.000008239976,0.0000037864017,0.00003698769,0.000005219123,0.0000028185334,0.000019650066,0.0000121432295,0.010194477,0.00012423536,0.9883046,0.0012829759,0.0000048743473],"about_ca_topic_score_codex":0.0010812593,"about_ca_topic_score_gemma":0.000893389,"teacher_disagreement_score":0.008850994,"about_ca_system_score_codex":0.0015840228,"about_ca_system_score_gemma":0.0007865498,"threshold_uncertainty_score":0.029609501},"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.034082096,0.10729228,0.30857623,0.15377317,0.00951317,0.00008828004,0.0009012343,0.0005748276,0.3851987],"genre_scores_gemma":[0.72679305,0.042805027,0.14730757,0.012764486,0.012105553,0.0002507212,0.00051250483,0.00051107234,0.05694996],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9974371,0.0011624084,0.00013838787,0.0002926948,0.0007827206,0.00018662853],"domain_scores_gemma":[0.9954573,0.0032719271,0.00016077243,0.0005567726,0.00041295742,0.00014026953],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0034756716,0.0009873877,0.0016049913,0.0025784418,0.0032552397,0.0058131763,0.0011281843,0.0030642587,0.008183481],"category_scores_gemma":[0.013326395,0.00091414544,0.0010341775,0.002875868,0.013002855,0.012454726,0.0035842361,0.009171802,0.0020982637],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000013752241,0.0000055139985,0.000015148629,0.000023426279,0.0000037009913,0.0000074999452,0.00004232697,0.0008954393,0.000046367804,0.9947425,0.0021657452,0.0020387266],"study_design_scores_gemma":[0.0000065552695,0.0000026932112,0.000007859843,0.000012859391,0.0000013597459,0.000005736959,0.000007463604,0.0011569464,0.00003994871,0.9936046,0.005148473,0.000005562318],"about_ca_topic_score_codex":0.003928098,"about_ca_topic_score_gemma":0.0024055156,"teacher_disagreement_score":0.008183481,"about_ca_system_score_codex":0.0039258134,"about_ca_system_score_gemma":0.0019320283,"threshold_uncertainty_score":0.028483927},"labels":[],"label_agreement":null},{"id":"W1875131895","doi":"10.1016/j.jsc.2011.08.010","title":"When does <mml:math xmlns:mml=\"http://www.w3.org/1998/Math/MathML\" altimg=\"si1.gif\" display=\"inline\" overflow=\"scroll\"><mml:mrow><mml:mo>〈</mml:mo><mml:mi>T</mml:mi><mml:mo>〉</mml:mo></mml:mrow></mml:math> equal <mml:math xmlns:mml=\"http://www.w3.org/1998/Math/MathML\" altimg=\"si2.gif\" display=\"inline\" overflow=\"scroll\"><mml:mstyle mathvariant=\"normal\"><mml:mi>sat</mml:mi></mml:mstyle><mml:mrow><mml:mo>(</mml:mo><mml:mi>T</mml:mi><mml:mo>)</mml:mo></mml:mrow></mml:math>?","year":2011,"lang":"lv","type":"article","venue":"Journal of Symbolic Computation","topic":"Polynomial and algebraic computation","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"","keywords":"Ideal (ethics); Mathematics; Algorithm; Gröbner basis; Univariate; Discrete mathematics; Multivariate statistics; Statistics; Law","score_opus":0.018675859307230633,"score_gpt":0.24020042370704187,"score_spread":0.22152456439981122,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1875131895","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01258335,0.00069265865,0.087167986,0.023444664,0.0066191508,0.00060875656,0.03216619,0.10672561,0.7299916],"genre_scores_gemma":[0.17631252,0.0018857322,0.06196165,0.009103674,0.0022590407,0.00064210105,0.054116093,0.10019568,0.5935235],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99755436,0.00036961093,0.0001936705,0.0005409173,0.0007787144,0.0005626882],"domain_scores_gemma":[0.99635494,0.00068335526,0.00015736916,0.0009797778,0.0013324342,0.00049220305],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.0020025612,0.001034109,0.0013723335,0.0015383961,0.0022091076,0.007600573,0.0017194698,0.0029674175,0.35062313],"category_scores_gemma":[0.010802916,0.001207445,0.0014869544,0.0011173615,0.0016851319,0.015645169,0.0031688018,0.0020683883,0.3153854],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005506465,0.00013912385,0.0019274822,0.0004243335,0.00004405338,0.0003197891,0.0010443493,0.000454963,0.0027798763,0.054852318,0.8747754,0.06268772],"study_design_scores_gemma":[0.00006704244,0.00003213242,0.0011603045,0.00013090171,0.000025456877,0.00016050928,0.00071246276,0.0010254638,0.009151398,0.015382279,0.9720705,0.00008156516],"about_ca_topic_score_codex":0.0126109645,"about_ca_topic_score_gemma":0.017856756,"teacher_disagreement_score":0.64937687,"about_ca_system_score_codex":0.002582859,"about_ca_system_score_gemma":0.0016155043,"threshold_uncertainty_score":0.9262573},"labels":[],"label_agreement":null},{"id":"W1941702124","doi":"10.1016/j.jsc.2015.11.005","title":"Faster sparse multivariate polynomial interpolation of straight-line programs","year":2015,"lang":"en","type":"article","venue":"Journal of Symbolic Computation","topic":"Polynomial and algebraic computation","field":"Computer Science","cited_by":31,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"National Science Foundation of Sri Lanka; Natural Sciences and Engineering Research Council of Canada; National Science Foundation","keywords":"Mathematics; Interpolation (computer graphics); Polynomial; Function (biology); Polynomial interpolation; Field (mathematics); Representation (politics); Multivariate statistics; Finite field; Applied mathematics; Degree (music); Line (geometry); Birkhoff interpolation; Algorithm; Mathematical optimization; Discrete mathematics; Algebra over a field; Linear interpolation; Pure mathematics; Mathematical analysis; Geometry; Computer science; Statistics; Artificial intelligence","score_opus":0.046147414931284,"score_gpt":0.28755890546700813,"score_spread":0.24141149053572414,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1941702124","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08423921,0.00020688142,0.8994327,0.00019414537,0.000079412195,0.0000928474,0.00027491862,0.0048561394,0.010623715],"genre_scores_gemma":[0.59796023,0.00018580495,0.3893079,0.00012325132,0.000091902875,0.00012119708,0.0008772332,0.0010237719,0.010308749],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991986,0.00017088313,0.000033132892,0.00012159566,0.0003282976,0.00014753456],"domain_scores_gemma":[0.9981104,0.0009011488,0.00013866166,0.0004814058,0.0002814576,0.00008685562],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007204737,0.0008214528,0.0011350889,0.0009769073,0.00048100555,0.0010040465,0.0012317032,0.0005681961,0.014853674],"category_scores_gemma":[0.0045380914,0.00039897513,0.0007430101,0.0017479513,0.000539256,0.0023005698,0.0016359057,0.0016528891,0.0022916486],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0013099405,0.0004228754,0.0017522215,0.0003908704,0.00008790693,0.00021292386,0.0003028894,0.194159,0.021623615,0.11490932,0.013192127,0.65163624],"study_design_scores_gemma":[0.00010584417,0.00017158117,0.00037038216,0.000025820676,0.000025770689,0.000081141465,0.00007349182,0.93491393,0.012846204,0.045218803,0.0061433716,0.000023628496],"about_ca_topic_score_codex":0.0026636182,"about_ca_topic_score_gemma":0.0074526216,"teacher_disagreement_score":0.014853674,"about_ca_system_score_codex":0.0007794292,"about_ca_system_score_gemma":0.0011223755,"threshold_uncertainty_score":0.049690545},"labels":[],"label_agreement":null},{"id":"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.056313872,0.00020286492,0.93066496,0.00021553093,0.00009423314,0.00007693637,0.00018863665,0.000716798,0.011526164],"genre_scores_gemma":[0.56244874,0.0003232732,0.42585814,0.00018842015,0.00011417169,0.00010093294,0.00055559987,0.00039961308,0.010011091],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992893,0.00013157773,0.000049993076,0.00013297153,0.00024964067,0.00014641845],"domain_scores_gemma":[0.99919504,0.0003418348,0.00006391347,0.0001513844,0.00018735351,0.000060413917],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00073766476,0.0004797342,0.000996988,0.0013918749,0.0009279887,0.0017174876,0.00080551003,0.00039204943,0.0053683277],"category_scores_gemma":[0.0022406837,0.00038815063,0.0014549347,0.0010368668,0.0016351341,0.0022582093,0.0018803745,0.0013433569,0.00090586895],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00017927328,0.00006611803,0.00046250338,0.00012603603,0.000043681226,0.00020214875,0.00023343945,0.020304361,0.009521156,0.91198444,0.0021150236,0.05476188],"study_design_scores_gemma":[0.000040162264,0.000059667444,0.00020658912,0.000039007686,0.000050263334,0.00012867425,0.000067188936,0.15164015,0.0054911515,0.8357248,0.0065130573,0.000039282822],"about_ca_topic_score_codex":0.0021398214,"about_ca_topic_score_gemma":0.0034811276,"teacher_disagreement_score":0.0053683277,"about_ca_system_score_codex":0.0006407941,"about_ca_system_score_gemma":0.0010821522,"threshold_uncertainty_score":0.01795882},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.057519592,0.00092745456,0.91315174,0.0009841677,0.00053763896,0.00013269979,0.00020820081,0.00094105204,0.025597455],"genre_scores_gemma":[0.7794503,0.0009192154,0.17920855,0.00056881964,0.0012028959,0.00025435415,0.00030386864,0.00056576915,0.037526198],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989311,0.00021611917,0.000053024494,0.00018604343,0.00048602384,0.00012778105],"domain_scores_gemma":[0.99800116,0.0010306757,0.00011898803,0.00045003748,0.00026473426,0.00013445436],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010178447,0.0014562114,0.0012038522,0.0015990874,0.0011226587,0.0015814871,0.0014010266,0.0012377559,0.0114435945],"category_scores_gemma":[0.0056331838,0.00046160122,0.0012464556,0.0015211442,0.0020143124,0.0039269077,0.002417098,0.0025167023,0.0028372002],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00040566942,0.00021295049,0.0009536092,0.00022338357,0.00007004497,0.00079516246,0.00031410035,0.02772644,0.018386964,0.8281329,0.009464548,0.11331424],"study_design_scores_gemma":[0.000043710188,0.00012929861,0.0004512453,0.000036487254,0.000048135258,0.0009345143,0.00004222834,0.3769659,0.008103031,0.60620356,0.0069833137,0.000058532773],"about_ca_topic_score_codex":0.00033584458,"about_ca_topic_score_gemma":0.0004616543,"teacher_disagreement_score":0.0114435945,"about_ca_system_score_codex":0.00073515135,"about_ca_system_score_gemma":0.00089407794,"threshold_uncertainty_score":0.038282633},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.51954955,0.0007616179,0.26465228,0.002934864,0.0004717835,0.00012875021,0.00057392975,0.0009167803,0.21001047],"genre_scores_gemma":[0.9581787,0.00022159296,0.02327688,0.00020647528,0.0001704509,0.000085044034,0.00033383665,0.00015122745,0.017375797],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992248,0.00015417015,0.000048128113,0.00014998537,0.0002083113,0.00021457259],"domain_scores_gemma":[0.9991959,0.00019498965,0.000097839875,0.0002314599,0.00012984578,0.00015011022],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007423253,0.0008459403,0.0010536175,0.0014117439,0.0024135904,0.003779634,0.0013866224,0.0014735906,0.010383089],"category_scores_gemma":[0.0019763778,0.00052589906,0.00091612514,0.001320789,0.0037515569,0.006264459,0.0038245001,0.0025064396,0.0010226454],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000016131184,0.0000094476745,0.00004330193,0.000009448972,0.0000019303066,0.000052620228,0.00012140714,0.00020075936,0.00042431647,0.9975848,0.00026468994,0.0012711654],"study_design_scores_gemma":[0.000013358108,0.0000073700157,0.00007226292,0.0000038977882,0.0000028481004,0.00006221735,0.00006738298,0.0017716461,0.00040170748,0.9960024,0.0015883652,0.0000064873398],"about_ca_topic_score_codex":0.00082148757,"about_ca_topic_score_gemma":0.0012218416,"teacher_disagreement_score":0.010383089,"about_ca_system_score_codex":0.0013622891,"about_ca_system_score_gemma":0.0007019268,"threshold_uncertainty_score":0.034734905},"labels":[],"label_agreement":null},{"id":"W1968315351","doi":"10.1006/jsco.2001.0456","title":"Commutative Algebra in the Mizar System","year":2001,"lang":"en","type":"article","venue":"Journal of Symbolic Computation","topic":"Polynomial and algebraic computation","field":"Computer Science","cited_by":39,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Generalization; Mathematics; Algebra over a field; Formal power series; Power series; Commutative property; Algebraic number; Basis (linear algebra); Discrete mathematics; Pure mathematics; Geometry","score_opus":0.015564302864567206,"score_gpt":0.25650667957007073,"score_spread":0.24094237670550353,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1968315351","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.22097628,0.0052428064,0.54369867,0.0073675094,0.0011045297,0.00010840739,0.0008088799,0.0012114617,0.2194815],"genre_scores_gemma":[0.89590526,0.0013528995,0.07151998,0.0011741715,0.0010086914,0.00010387944,0.00038144382,0.00025724288,0.028296396],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9982474,0.00064296025,0.00010920211,0.00029659056,0.00046552593,0.00023835927],"domain_scores_gemma":[0.99821883,0.0007834088,0.00017115098,0.0002460248,0.00041222235,0.00016841317],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001751883,0.0003216162,0.0010460733,0.0010966731,0.0030472279,0.0042084903,0.0007292812,0.00076432043,0.009446145],"category_scores_gemma":[0.0029284814,0.0004910661,0.0007410379,0.0012306003,0.0036364843,0.0061163283,0.0022144585,0.0021175425,0.0027234086],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000026074027,0.0000087733,0.000091329435,0.000019477247,0.0000066161465,0.000041535972,0.00012944976,0.00025280315,0.00037873953,0.9953241,0.0010801902,0.0026409563],"study_design_scores_gemma":[0.000015523081,0.000013152411,0.000121120574,0.0000048906977,0.000010252618,0.00011585216,0.00005028452,0.0021987192,0.00066366047,0.99017674,0.006617834,0.0000121300045],"about_ca_topic_score_codex":0.0007538537,"about_ca_topic_score_gemma":0.00093590864,"teacher_disagreement_score":0.009446145,"about_ca_system_score_codex":0.0013156716,"about_ca_system_score_gemma":0.00096419983,"threshold_uncertainty_score":0.031600475},"labels":[],"label_agreement":null},{"id":"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.041391976,0.0017047345,0.9355712,0.00186659,0.00036547193,0.00018512615,0.00052677066,0.0034912843,0.014896906],"genre_scores_gemma":[0.46025702,0.0013347545,0.5210101,0.0005770779,0.0004071412,0.00028822888,0.0013168373,0.00080800685,0.014000723],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99694866,0.00075591,0.0003893797,0.0005779119,0.0008590021,0.00046915203],"domain_scores_gemma":[0.98752314,0.0077117835,0.00042297383,0.003042658,0.0010343896,0.00026499716],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0027137527,0.0013914428,0.0014644511,0.0019577388,0.0017256924,0.0057166764,0.0024219411,0.0019009826,0.012743016],"category_scores_gemma":[0.014626319,0.0010037109,0.0014305332,0.003182033,0.0027033093,0.014097229,0.0042482344,0.0045280512,0.003847548],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0010017274,0.00025438165,0.0015857749,0.0004721462,0.0000977207,0.00013198241,0.0005888465,0.03045342,0.003535858,0.5754663,0.016083535,0.37032837],"study_design_scores_gemma":[0.00020195867,0.00006761234,0.00017586663,0.00009739222,0.000049783896,0.0001542406,0.00012729784,0.08162166,0.005555657,0.9024653,0.009448396,0.0000348819],"about_ca_topic_score_codex":0.0011113997,"about_ca_topic_score_gemma":0.0015877676,"teacher_disagreement_score":0.012743016,"about_ca_system_score_codex":0.0022376655,"about_ca_system_score_gemma":0.002327973,"threshold_uncertainty_score":0.04262966},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3764192,0.001979611,0.5749167,0.0015558103,0.00038676395,0.0001437491,0.00017132128,0.00039260666,0.044034295],"genre_scores_gemma":[0.9664089,0.0006707566,0.026116028,0.00009266523,0.00020162346,0.00007076886,0.00008366099,0.00007807058,0.006277513],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99978,0.00009427131,0.000010644727,0.00001868147,0.000049683935,0.000046741934],"domain_scores_gemma":[0.9987405,0.0008402576,0.00011415091,0.000061168204,0.000110555105,0.00013333761],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009801572,0.00070384267,0.0008460734,0.002989139,0.00088365277,0.0012702491,0.00079357973,0.0006399735,0.002490008],"category_scores_gemma":[0.0033705814,0.00037000192,0.0008104448,0.00089369726,0.0023143475,0.0021712708,0.0011627416,0.0014601175,0.00027939785],"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.00004072193,0.000043398482,0.0004226062,0.000045276134,0.00002598371,0.00008257953,0.00019477436,0.06838456,0.00071590266,0.92487174,0.000806528,0.0043658516],"study_design_scores_gemma":[0.000009951024,0.000015448839,0.0001232987,0.000010538962,0.000012124233,0.000017497634,0.000076448974,0.3427018,0.00023811865,0.65614796,0.0006362946,0.000010478769],"about_ca_topic_score_codex":0.0022695162,"about_ca_topic_score_gemma":0.0023526475,"teacher_disagreement_score":0.002989139,"about_ca_system_score_codex":0.0011443949,"about_ca_system_score_gemma":0.0006597995,"threshold_uncertainty_score":0.008329928},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.24964337,0.00095506717,0.7135042,0.0005858949,0.00031347567,0.00015447296,0.00044122958,0.0007830083,0.03361936],"genre_scores_gemma":[0.7349148,0.00067455607,0.23682994,0.00023421228,0.0001847591,0.00012924899,0.0011807774,0.00046689052,0.025384746],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.999405,0.00012533598,0.000048861093,0.00006647149,0.00018910071,0.00016526107],"domain_scores_gemma":[0.9991518,0.00020858373,0.000057329522,0.00020859725,0.0002403643,0.00013337599],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008860704,0.00061525457,0.00083556114,0.0012125139,0.0007596351,0.0024779025,0.00080082536,0.00041379096,0.008225067],"category_scores_gemma":[0.001614796,0.0003791273,0.0006442248,0.0009369177,0.0009694374,0.0039093643,0.001981849,0.0014154123,0.00195879],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002405231,0.00021085145,0.00043166563,0.00012658599,0.000024507233,0.00008351389,0.00036763027,0.008088071,0.010339139,0.90223116,0.004289275,0.07356721],"study_design_scores_gemma":[0.0000347233,0.00004044602,0.0001028836,0.000027515058,0.00001375768,0.000046227116,0.00010420184,0.036261417,0.0040554013,0.9536346,0.0056677256,0.0000109842385],"about_ca_topic_score_codex":0.0005456047,"about_ca_topic_score_gemma":0.0012931696,"teacher_disagreement_score":0.008225067,"about_ca_system_score_codex":0.000768962,"about_ca_system_score_gemma":0.00084820925,"threshold_uncertainty_score":0.02751553},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04199856,0.00020371102,0.9469651,0.00032859348,0.0001627683,0.000022537135,0.00008276622,0.00040358488,0.009832407],"genre_scores_gemma":[0.69939876,0.00042726457,0.29044774,0.0001120044,0.00015983566,0.00004923301,0.00025496667,0.00027527747,0.008875026],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99960786,0.00012818628,0.00001398946,0.000030813833,0.00018178453,0.00003743863],"domain_scores_gemma":[0.9991086,0.00035059315,0.00008759146,0.00022971681,0.00018477532,0.000038753256],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00062957883,0.00038626275,0.00057522487,0.00074810995,0.00045336937,0.0008657166,0.0005765337,0.00045590047,0.004700074],"category_scores_gemma":[0.0049419724,0.00021764525,0.00033190328,0.0014911558,0.0007727204,0.0012283969,0.0011519761,0.0011472054,0.0007466399],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00031943747,0.00008359745,0.0010877443,0.00014724347,0.00003876902,0.0001594476,0.00019103364,0.30139482,0.0111401295,0.45345473,0.0043425644,0.22764051],"study_design_scores_gemma":[0.000012696334,0.000020917587,0.00012928751,0.000012953267,0.000005121131,0.000041401778,0.000021928972,0.94014204,0.0028731201,0.053479772,0.0032521777,0.000008629954],"about_ca_topic_score_codex":0.0016844205,"about_ca_topic_score_gemma":0.0030220093,"teacher_disagreement_score":0.004700074,"about_ca_system_score_codex":0.00047470923,"about_ca_system_score_gemma":0.0007631872,"threshold_uncertainty_score":0.015723288},"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":"editorial","genre_gemma":"editorial","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"editorial","genre_consensus":"editorial","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0065755667,0.047668274,0.047218658,0.04443048,0.4948995,0.00050045364,0.003833384,0.0028958027,0.3519779],"genre_scores_gemma":[0.029675819,0.03271399,0.014477708,0.0030767322,0.28607863,0.00030844132,0.0065194736,0.0017835262,0.6253657],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99828416,0.00023952863,0.00014984103,0.00035200268,0.0008150488,0.00015944455],"domain_scores_gemma":[0.99385417,0.0011092176,0.0002523732,0.00095423224,0.002972566,0.0008574967],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020713275,0.001981074,0.0032456936,0.003897684,0.002217536,0.008170012,0.0017697209,0.0027655845,0.15131384],"category_scores_gemma":[0.006016914,0.0006551904,0.0012894996,0.0043382198,0.001513661,0.0048336172,0.0025556788,0.0036562423,0.05256721],"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.00010594801,0.00008288133,0.0003424182,0.0003939755,0.000029047618,0.00007505692,0.000034666587,0.0008652781,0.00043998825,0.019543255,0.8881447,0.08994293],"study_design_scores_gemma":[0.00003469996,0.00009768173,0.0015592037,0.00034885376,0.000060517857,0.00028624985,0.00007148006,0.0051313136,0.0009326213,0.030395437,0.9610426,0.00003925849],"about_ca_topic_score_codex":0.0022155168,"about_ca_topic_score_gemma":0.004189411,"teacher_disagreement_score":0.15131384,"about_ca_system_score_codex":0.0029126548,"about_ca_system_score_gemma":0.0039909757,"threshold_uncertainty_score":0.5061952},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.083741784,0.00024799176,0.9020194,0.0015725584,0.00020327509,0.00024835413,0.00013649951,0.0021466874,0.00968355],"genre_scores_gemma":[0.8399099,0.00023733289,0.1558217,0.0002686886,0.00015924692,0.00024206535,0.00017977673,0.00027794408,0.0029034175],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.98477095,0.0059971754,0.0014578855,0.0011216251,0.004832631,0.0018196634],"domain_scores_gemma":[0.93437564,0.04538606,0.0038242245,0.0090941945,0.0060574966,0.0012623076],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.012468475,0.00083024165,0.0011218206,0.0018362445,0.0019581758,0.0061136996,0.0028576779,0.0020398428,0.0023760803],"category_scores_gemma":[0.047009643,0.0014015624,0.0014020236,0.0012102413,0.008455924,0.006072881,0.0042330925,0.0048265597,0.00035657524],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00032314257,0.00017396858,0.0010541133,0.00019382183,0.000059708756,0.0002559029,0.0011295037,0.101019286,0.0053483783,0.86106586,0.0012980792,0.028078279],"study_design_scores_gemma":[0.00020326159,0.000069159905,0.0001652105,0.00008616287,0.000067441106,0.000058800688,0.00017629874,0.3839988,0.0072906693,0.6031844,0.0046559647,0.000043789154],"about_ca_topic_score_codex":0.0072598867,"about_ca_topic_score_gemma":0.0075040115,"teacher_disagreement_score":0.012468475,"about_ca_system_score_codex":0.00326538,"about_ca_system_score_gemma":0.0061612204,"threshold_uncertainty_score":0.06594038},"labels":[],"label_agreement":null},{"id":"W1985407367","doi":"10.1016/j.jsc.2007.12.002","title":"A bound for the Rosenfeld–Gröbner algorithm","year":2008,"lang":"en","type":"article","venue":"Journal of Symbolic Computation","topic":"Polynomial and algebraic computation","field":"Computer Science","cited_by":13,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"Natural Sciences and Engineering Research Council of Canada; Russian Foundation for Basic Research; National Science Foundation","keywords":"Mathematics; Ideal (ethics); Gröbner basis; Decomposition; Differential (mechanical device); Upper and lower bounds; Algebraic number; Polynomial; Set (abstract data type); Discrete mathematics; Combinatorics; Algorithm; Algebra over a field; Pure mathematics; Mathematical analysis; Computer science","score_opus":0.024194627056162567,"score_gpt":0.2645510586430663,"score_spread":0.2403564315869037,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1985407367","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.026707213,0.005403428,0.857419,0.00940668,0.0013404666,0.00021735179,0.00062300044,0.0021097632,0.09677309],"genre_scores_gemma":[0.38573495,0.00405501,0.54922116,0.0036879147,0.0017089596,0.0009045126,0.0017059064,0.0017827079,0.051198993],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9914267,0.0022353663,0.00037932224,0.0015369095,0.0031231302,0.0012986022],"domain_scores_gemma":[0.98322415,0.009911832,0.0005496251,0.0036544914,0.0018426863,0.00081730506],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.007490114,0.0024492422,0.0027312343,0.0035125497,0.003314309,0.00741341,0.006922249,0.005600803,0.0238584],"category_scores_gemma":[0.030095784,0.001197092,0.002519536,0.004423776,0.004894931,0.01466626,0.0076380735,0.011102332,0.010940201],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005476893,0.00021893233,0.00040750916,0.00025201528,0.00009534874,0.00007562001,0.00021263507,0.023658823,0.0034725696,0.89070654,0.015448817,0.06490356],"study_design_scores_gemma":[0.00009064169,0.00010193696,0.00025144295,0.00012843723,0.00007593402,0.00012231432,0.000044522683,0.1201083,0.003640817,0.8609197,0.014451188,0.000064744054],"about_ca_topic_score_codex":0.0018388543,"about_ca_topic_score_gemma":0.0024907945,"teacher_disagreement_score":0.0238584,"about_ca_system_score_codex":0.0052782837,"about_ca_system_score_gemma":0.005169587,"threshold_uncertainty_score":0.079814315},"labels":[],"label_agreement":null},{"id":"W1985924702","doi":"10.1016/j.jsc.2013.03.004","title":"On the complexity of the generalized MinRank problem","year":2013,"lang":"en","type":"article","venue":"Journal of Symbolic Computation","topic":"Polynomial and algebraic computation","field":"Computer Science","cited_by":50,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"Institut Universitaire de France; Agence Nationale de la Recherche","keywords":"Mathematics; Rank (graph theory); Bounded function; Computational complexity theory; Polynomial; Matrix (chemical analysis); Ideal (ethics); Variety (cybernetics); Discrete mathematics; Representation (politics); Algebraic number; Algebra over a field; Combinatorics; Algorithm; Pure mathematics","score_opus":0.030379033731166363,"score_gpt":0.24297582710149582,"score_spread":0.21259679337032944,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1985924702","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.55911905,0.0040000235,0.28673172,0.023668919,0.0007127692,0.0002550562,0.002998765,0.0011718663,0.12134174],"genre_scores_gemma":[0.93793947,0.0014315969,0.041865595,0.00094035437,0.00094471575,0.00019168918,0.0018437302,0.0003732865,0.01446957],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9965101,0.0011079378,0.00015985181,0.0006026232,0.0009772892,0.0006421088],"domain_scores_gemma":[0.9765595,0.01899292,0.0011505173,0.0017624263,0.0008745615,0.0006601691],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0023372977,0.0011035784,0.0023692395,0.0014817549,0.002057161,0.006614951,0.0028880374,0.0024492014,0.019127954],"category_scores_gemma":[0.020739162,0.0006432137,0.0014572074,0.0028325324,0.003648761,0.015767429,0.0037705242,0.0046120477,0.0016540777],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00089119707,0.0002579833,0.0024476976,0.00051577546,0.000111576715,0.0003143153,0.0005644181,0.08145178,0.0017117023,0.847187,0.019555971,0.044990662],"study_design_scores_gemma":[0.000066573375,0.000023531346,0.00029573878,0.000019410945,0.000019449339,0.000077423945,0.00008826877,0.0740661,0.00031164175,0.9237812,0.0012313493,0.000019205927],"about_ca_topic_score_codex":0.0034330396,"about_ca_topic_score_gemma":0.0046484713,"teacher_disagreement_score":0.019127954,"about_ca_system_score_codex":0.0027175636,"about_ca_system_score_gemma":0.0025666885,"threshold_uncertainty_score":0.0639894},"labels":[],"label_agreement":null},{"id":"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07353813,0.00094100926,0.896601,0.0018743871,0.0003453299,0.00008736021,0.0005272224,0.0004876048,0.025598003],"genre_scores_gemma":[0.8089651,0.0014406542,0.1612571,0.0011286007,0.00074803224,0.00017613696,0.00075555954,0.0004110963,0.025117746],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9982644,0.00065287296,0.000051556763,0.0001937577,0.0005377823,0.00029967597],"domain_scores_gemma":[0.99668354,0.0013424597,0.000307971,0.00077815,0.0006417375,0.000246218],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0023600862,0.0012049949,0.0013741172,0.0018270619,0.0016232714,0.0026410136,0.0016141114,0.0011969393,0.005425065],"category_scores_gemma":[0.011146657,0.0005474315,0.00093731104,0.0021373038,0.0035209348,0.0039213556,0.00277418,0.0026033663,0.0013989559],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010912061,0.000035177378,0.00027416204,0.00005209024,0.000017247103,0.00008723257,0.000110242436,0.011312379,0.00072285143,0.9680274,0.005361391,0.013890704],"study_design_scores_gemma":[0.0000144903615,0.000021833665,0.00015345393,0.000022096974,0.000010213947,0.000121043144,0.000045889294,0.12571833,0.0010455222,0.87081593,0.0020001389,0.00003117359],"about_ca_topic_score_codex":0.0019323446,"about_ca_topic_score_gemma":0.002332172,"teacher_disagreement_score":0.005425065,"about_ca_system_score_codex":0.0010223722,"about_ca_system_score_gemma":0.0022107447,"threshold_uncertainty_score":0.01814866},"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":"editorial","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00014319239,0.003119403,0.000853263,0.04794655,0.9358255,0.00004162676,0.00094779127,0.00038330487,0.010739416],"genre_scores_gemma":[0.012061118,0.01775791,0.0040966305,0.08609697,0.37865275,0.0003088631,0.005293204,0.0014549483,0.49427763],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9970402,0.00049064326,0.0003948401,0.0005115522,0.0012220178,0.0003408009],"domain_scores_gemma":[0.9859195,0.002469457,0.00043685967,0.0010236986,0.009451687,0.0006988488],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020478852,0.0029013404,0.003414396,0.005114695,0.0039597303,0.0039756577,0.00473799,0.0052907662,0.14496751],"category_scores_gemma":[0.023275506,0.0012324948,0.0029050303,0.0037805478,0.002736333,0.005130301,0.003027763,0.0060795275,0.07784173],"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.000020649026,0.000005967297,0.000024858193,0.00009764589,0.000009683912,0.00006901215,0.000011347205,0.00003701483,0.00003180927,0.0011130448,0.99579215,0.0027868785],"study_design_scores_gemma":[0.00005296542,0.000043070027,0.0011838843,0.00023875947,0.00007051736,0.00034885624,0.000077118195,0.0004777283,0.00054356665,0.00785155,0.98903775,0.00007414391],"about_ca_topic_score_codex":0.019851597,"about_ca_topic_score_gemma":0.025612887,"teacher_disagreement_score":0.14496751,"about_ca_system_score_codex":0.0054397215,"about_ca_system_score_gemma":0.002795211,"threshold_uncertainty_score":0.4849646},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5463292,0.004260939,0.35622582,0.002459118,0.0002968165,0.00010999921,0.0005481495,0.0005763645,0.08919365],"genre_scores_gemma":[0.9543601,0.0008783147,0.035598025,0.00012603583,0.00007721658,0.000045709534,0.00029518333,0.00010192346,0.008517441],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99919194,0.00021872569,0.000052282827,0.00012842116,0.00028386817,0.00012476205],"domain_scores_gemma":[0.9976547,0.0014937427,0.00012652422,0.00022210815,0.00031789287,0.00018496203],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00079216267,0.0003959874,0.0007640575,0.0017347564,0.0018698963,0.00412607,0.0011379182,0.0012092205,0.0070775044],"category_scores_gemma":[0.0061888886,0.0004594215,0.0008365693,0.00253792,0.0030649155,0.0064376355,0.0022209066,0.0014460497,0.00058589666],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000022058057,0.000009313791,0.00027534273,0.000033862776,0.000008030054,0.000051944095,0.00034918592,0.0034721082,0.0003832637,0.988817,0.00046088765,0.006116922],"study_design_scores_gemma":[0.0000032803357,0.0000027329563,0.000060771443,0.0000071440472,0.0000039246925,0.000016474354,0.00005357744,0.008544261,0.0002467702,0.9894254,0.0016296289,0.000006022159],"about_ca_topic_score_codex":0.0052056205,"about_ca_topic_score_gemma":0.0061853845,"teacher_disagreement_score":0.0070775044,"about_ca_system_score_codex":0.0018367828,"about_ca_system_score_gemma":0.0010195684,"threshold_uncertainty_score":0.023676634},"labels":[],"label_agreement":null},{"id":"W1993473229","doi":"10.1016/j.jsc.2014.09.012","title":"Relaxed Hensel lifting of triangular sets","year":2014,"lang":"en","type":"article","venue":"Journal of Symbolic Computation","topic":"Polynomial and algebraic computation","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Agence Nationale de la Recherche","keywords":"Set (abstract data type); Point (geometry); Algorithm; Mathematics; Implementation; Computer science; Geometry; Programming language","score_opus":0.011571822478849265,"score_gpt":0.24724955102981688,"score_spread":0.2356777285509676,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1993473229","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4869374,0.00024527212,0.42705315,0.00056979497,0.00047031965,0.00014277882,0.0005195504,0.0008133241,0.083248414],"genre_scores_gemma":[0.90497446,0.00018428703,0.07151345,0.00022008742,0.00019332962,0.00006548242,0.0005703414,0.0002539993,0.022024598],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992318,0.0001307586,0.00004206234,0.00013508339,0.00024198073,0.00021842924],"domain_scores_gemma":[0.99882644,0.00030582334,0.000074050266,0.0004316549,0.0002264899,0.00013548341],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007366096,0.0003733994,0.0008544376,0.0009185602,0.0014554345,0.001542161,0.0009837413,0.00045423125,0.016351575],"category_scores_gemma":[0.002574071,0.0003944891,0.0009134846,0.0007637707,0.0015409589,0.0024773534,0.0029019518,0.0018963766,0.0016005368],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00023060488,0.000068377034,0.00024966692,0.00007446163,0.000016711987,0.00018070321,0.00045326306,0.0030391621,0.0063478188,0.95893556,0.0021373532,0.0282664],"study_design_scores_gemma":[0.00003972337,0.00009541955,0.0002885906,0.000027466862,0.000023464341,0.00011931858,0.0002635578,0.020028282,0.0052010356,0.9659481,0.007940248,0.00002483278],"about_ca_topic_score_codex":0.0011732739,"about_ca_topic_score_gemma":0.00143768,"teacher_disagreement_score":0.016351575,"about_ca_system_score_codex":0.0006439556,"about_ca_system_score_gemma":0.0004802535,"threshold_uncertainty_score":0.054701507},"labels":[],"label_agreement":null},{"id":"W1994728957","doi":"10.1016/s0747-7171(02)00139-6","title":"On lattice reduction for polynomial matrices","year":2003,"lang":"en","type":"article","venue":"Journal of Symbolic Computation","topic":"Polynomial and algebraic computation","field":"Computer Science","cited_by":119,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Eidgenössische Technische Hochschule Zürich","keywords":"Mathematics; Computation; Lattice reduction; Hermite polynomials; Lattice (music); Matrix polynomial; Polynomial; Reduction (mathematics); Canonical form; Combinatorics; Discrete mathematics; Algebra over a field; Pure mathematics; Algorithm; Mathematical analysis; Geometry","score_opus":0.015613794153033869,"score_gpt":0.26775971741067944,"score_spread":0.25214592325764557,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1994728957","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15848596,0.004650442,0.5040455,0.010350992,0.002885547,0.00024423754,0.00068683893,0.002155394,0.31649512],"genre_scores_gemma":[0.7691908,0.003278958,0.14000084,0.0022528342,0.0022009243,0.00028367396,0.0013473176,0.0013967529,0.08004785],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986076,0.00038361005,0.00005520633,0.00018073099,0.00046314148,0.00030962023],"domain_scores_gemma":[0.99815696,0.0010914085,0.000073558906,0.00028182578,0.0002443217,0.0001519933],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013379857,0.0012355438,0.0019351109,0.002252127,0.0027570496,0.0035589172,0.0015173618,0.0012271928,0.016589388],"category_scores_gemma":[0.0046718605,0.0007265637,0.0019129562,0.0026196036,0.004831592,0.0068913414,0.003871492,0.0052967523,0.00307139],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010016922,0.00007873259,0.000153341,0.000068185414,0.000012374917,0.000060249098,0.00027064164,0.0030271441,0.0006822172,0.97047365,0.0064038457,0.018669458],"study_design_scores_gemma":[0.000019516323,0.000011628239,0.000034107583,0.000010709555,0.0000056013296,0.000022329443,0.000044477845,0.005136622,0.0003398203,0.99096394,0.0034011893,0.0000100340385],"about_ca_topic_score_codex":0.0040282668,"about_ca_topic_score_gemma":0.005358107,"teacher_disagreement_score":0.016589388,"about_ca_system_score_codex":0.0020359794,"about_ca_system_score_gemma":0.0011889532,"threshold_uncertainty_score":0.05549699},"labels":[],"label_agreement":null},{"id":"W1995653528","doi":"10.1016/s0747-7171(03)00097-x","title":"High-order lifting and integrality certification","year":2003,"lang":"en","type":"article","venue":"Journal of Symbolic Computation","topic":"Polynomial and algebraic computation","field":"Computer Science","cited_by":81,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Mathematics; Invertible matrix; Univariate; Dimension (graph theory); Matrix (chemical analysis); Polynomial matrix; Field (mathematics); Matrix multiplication; Ring (chemistry); Correctness; Polynomial; Order (exchange); Multiplication (music); Algebra over a field; Discrete mathematics; Combinatorics; Pure mathematics; Matrix polynomial; Algorithm; Mathematical analysis","score_opus":0.017708436857765117,"score_gpt":0.25371895663028965,"score_spread":0.23601051977252452,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1995653528","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1817153,0.00051688065,0.7399249,0.0019643563,0.0005295733,0.00012794096,0.00020464709,0.0019015712,0.07311486],"genre_scores_gemma":[0.9123042,0.0003013891,0.07461641,0.0002551602,0.00022584654,0.000039618757,0.00022297491,0.0002822729,0.011752132],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99827635,0.00021410902,0.00008974993,0.0003273943,0.00058448495,0.0005079639],"domain_scores_gemma":[0.9941453,0.002283452,0.00025417632,0.0019658662,0.0009917422,0.00035948528],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017346423,0.0004894471,0.0009069143,0.0014462252,0.002328065,0.0034144043,0.0011528685,0.0011639594,0.009672829],"category_scores_gemma":[0.009932507,0.0006376025,0.0011329758,0.0013114118,0.0045849215,0.0074639777,0.004746639,0.0045752926,0.0013404412],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013002727,0.000064130916,0.0008254084,0.0000523631,0.000008975972,0.00017760557,0.00034625398,0.0031097352,0.0025193444,0.9553367,0.0019952476,0.035434265],"study_design_scores_gemma":[0.000020870439,0.00002224774,0.00026457323,0.000021393096,0.000017370616,0.00013914416,0.00008804868,0.013473941,0.004120712,0.97695345,0.004858519,0.000019768066],"about_ca_topic_score_codex":0.0016221412,"about_ca_topic_score_gemma":0.002009099,"teacher_disagreement_score":0.009672829,"about_ca_system_score_codex":0.0013303009,"about_ca_system_score_gemma":0.001638931,"threshold_uncertainty_score":0.032358825},"labels":[],"label_agreement":null},{"id":"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.023412481,0.0008682473,0.9499494,0.00088257814,0.00030824472,0.0001542358,0.00033971103,0.0022852551,0.021799834],"genre_scores_gemma":[0.31549928,0.0009934308,0.66350716,0.00040158717,0.0003054906,0.0004659493,0.0011428029,0.00092940684,0.016754983],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99822193,0.00044632872,0.00011015796,0.00021495786,0.0007202539,0.00028632375],"domain_scores_gemma":[0.9967518,0.0015115336,0.000100442645,0.0011259287,0.0003907691,0.00011961133],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013336437,0.0012428476,0.0015661974,0.0019488308,0.0015173286,0.0035361852,0.0020682428,0.0013974992,0.012163683],"category_scores_gemma":[0.007990655,0.0008329275,0.0012212557,0.0031854757,0.0018441657,0.0053559877,0.0035219805,0.0041347886,0.0041535054],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00035621936,0.00018761506,0.00043244835,0.00017395298,0.00004902196,0.000051408097,0.00024170564,0.02542833,0.0030066115,0.6816602,0.01458367,0.2738288],"study_design_scores_gemma":[0.00009584886,0.000036512378,0.00008740431,0.000027315278,0.000022095352,0.000041197905,0.000045504436,0.107681945,0.0021851235,0.88333225,0.0064249686,0.0000198703],"about_ca_topic_score_codex":0.0017496137,"about_ca_topic_score_gemma":0.0034935575,"teacher_disagreement_score":0.012163683,"about_ca_system_score_codex":0.0019060331,"about_ca_system_score_gemma":0.002072537,"threshold_uncertainty_score":0.040691555},"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":"dataset","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"dataset","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05298647,0.024795871,0.69132704,0.0070968396,0.0023805194,0.0005025471,0.06619242,0.010462466,0.1442559],"genre_scores_gemma":[0.4350421,0.015617165,0.40826994,0.0023636285,0.0012787682,0.0007718555,0.08102837,0.0018356619,0.053792514],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99710387,0.0004212559,0.00058520824,0.001012309,0.0006845929,0.00019284965],"domain_scores_gemma":[0.99554574,0.00075503567,0.00022543446,0.0018006837,0.0013425659,0.00033037292],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016289621,0.000809808,0.001987917,0.008598645,0.0032981057,0.011203263,0.0030943453,0.0016077383,0.02260569],"category_scores_gemma":[0.0071435873,0.001349613,0.001723489,0.012228736,0.0021445805,0.017126968,0.0048503326,0.0025356081,0.0087443385],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010645797,0.000060996234,0.0016646622,0.0002952987,0.000067480694,0.00015440858,0.0007517774,0.00086772826,0.0009668528,0.85473233,0.03186804,0.10846394],"study_design_scores_gemma":[0.00003094661,0.00003265597,0.00060275523,0.0001524965,0.00007198926,0.0004785297,0.00045314166,0.0021965415,0.0008467808,0.6879781,0.30710718,0.00004898915],"about_ca_topic_score_codex":0.0040445724,"about_ca_topic_score_gemma":0.003316244,"teacher_disagreement_score":0.02260569,"about_ca_system_score_codex":0.0018317369,"about_ca_system_score_gemma":0.0024493076,"threshold_uncertainty_score":0.07562357},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03317242,0.00039038665,0.9474969,0.0003210299,0.0002847375,0.000090869595,0.00013012372,0.00082130765,0.017292313],"genre_scores_gemma":[0.5589603,0.0005964762,0.4153836,0.00031731612,0.00024230726,0.00018609969,0.00049413875,0.0005258161,0.023293981],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993998,0.00017094621,0.000032747794,0.00006408087,0.00024578278,0.00008660192],"domain_scores_gemma":[0.9991084,0.0004870256,0.000031909516,0.00017216151,0.00016711278,0.000033338034],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004937871,0.0007738567,0.0010495341,0.00054128113,0.00068291544,0.0010622324,0.0006300603,0.0005022242,0.007591274],"category_scores_gemma":[0.0020188391,0.00032666334,0.0009946963,0.00062215846,0.001020916,0.0010235372,0.0016133676,0.0014017406,0.0015179984],"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.00037780928,0.00032691448,0.0008572686,0.000496594,0.00013956173,0.00041970183,0.0006930429,0.3487938,0.032390866,0.22773185,0.012661842,0.3751108],"study_design_scores_gemma":[0.00002596952,0.000084238316,0.00016528381,0.000015612852,0.000026632264,0.000063535685,0.00007606104,0.8934354,0.008023629,0.09263997,0.0054216986,0.000021955018],"about_ca_topic_score_codex":0.002963529,"about_ca_topic_score_gemma":0.0048571546,"teacher_disagreement_score":0.007591274,"about_ca_system_score_codex":0.00030907974,"about_ca_system_score_gemma":0.000686194,"threshold_uncertainty_score":0.025395334},"labels":[],"label_agreement":null},{"id":"W2017958871","doi":"10.1016/j.jsc.2008.05.007","title":"Dynamic balancing of planar mechanisms using toric geometry","year":2009,"lang":"en","type":"article","venue":"Journal of Symbolic Computation","topic":"Polynomial and algebraic computation","field":"Computer Science","cited_by":17,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université Laval","funders":"","keywords":"Mathematics; Planar; Base (topology); Kinematics; Polynomial; Factorization; Toric variety; Laurent polynomial; Algebraic number; Geometry; Pure mathematics; Computer science; Mathematical analysis; Algorithm","score_opus":0.010288720647671163,"score_gpt":0.25461434666655175,"score_spread":0.24432562601888058,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2017958871","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.43054017,0.00051839533,0.5083956,0.0003762136,0.000240152,0.00013297262,0.00016919582,0.0016897079,0.057937592],"genre_scores_gemma":[0.9674692,0.00015247024,0.024558593,0.00003671034,0.00002106341,0.000055341425,0.00008851677,0.00012651757,0.0074915914],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9997305,0.000033714347,0.000012134954,0.000056160923,0.000079254074,0.00008814701],"domain_scores_gemma":[0.9996637,0.00007035631,0.00005521177,0.00010525966,0.00005812974,0.000047296522],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00035187192,0.00051361293,0.0008538638,0.0012690199,0.0011401409,0.001527856,0.001595793,0.00071198144,0.013998347],"category_scores_gemma":[0.0012769153,0.0003995957,0.00047135723,0.0007799515,0.0010816508,0.002280069,0.002217298,0.000640155,0.0011836946],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00052382774,0.000110051646,0.0008636273,0.0001415087,0.000055686905,0.00023607467,0.00032917358,0.24251205,0.03527233,0.58949405,0.0033703644,0.12709126],"study_design_scores_gemma":[0.00014740591,0.00024100086,0.00062315696,0.000043283104,0.000065224966,0.00016863624,0.0004136625,0.6391689,0.012980204,0.3301364,0.015943913,0.00006821797],"about_ca_topic_score_codex":0.0013032642,"about_ca_topic_score_gemma":0.0015433163,"teacher_disagreement_score":0.013998347,"about_ca_system_score_codex":0.00084418815,"about_ca_system_score_gemma":0.0005552666,"threshold_uncertainty_score":0.046829164},"labels":[],"label_agreement":null},{"id":"W2021258994","doi":"10.1016/j.jsc.2005.10.002","title":"Fraction-free row reduction of matrices of Ore polynomials","year":2005,"lang":"en","type":"article","venue":"Journal of Symbolic Computation","topic":"Polynomial and algebraic computation","field":"Computer Science","cited_by":70,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo; University of Lethbridge","funders":"","keywords":"Mathematics; Skew; Computation; Reduction (mathematics); Fraction (chemistry); Rank (graph theory); Matrix (chemical analysis); Skew-symmetric matrix; Combinatorics; Discrete mathematics; Pure mathematics; Symmetric matrix; Square matrix; Algorithm; Geometry","score_opus":0.011987160902604925,"score_gpt":0.25847732941143414,"score_spread":0.2464901685088292,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2021258994","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.44710428,0.00083074137,0.4497268,0.0011295485,0.0006991569,0.00015361031,0.00074806344,0.0019854808,0.09762235],"genre_scores_gemma":[0.8846654,0.0004126335,0.06781177,0.00041635337,0.00032427273,0.00006872449,0.00081900094,0.0006198661,0.044861972],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99954456,0.00006854997,0.000019940277,0.00007990492,0.00014904108,0.00013800923],"domain_scores_gemma":[0.99940133,0.00023639867,0.0000529363,0.00015726624,0.000093611554,0.00005842005],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003038244,0.0007557113,0.0005956502,0.00065886194,0.00077954103,0.0015570156,0.0006159677,0.00043220056,0.010403031],"category_scores_gemma":[0.0016520481,0.0002642605,0.0007072584,0.0005445023,0.0011037599,0.0017771688,0.0014006423,0.0012314669,0.0025167428],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00046956143,0.00020396635,0.0006397672,0.00021918968,0.000047167785,0.00040917777,0.00069670024,0.01290393,0.027669918,0.83573234,0.014678606,0.106329694],"study_design_scores_gemma":[0.0000719979,0.00012960054,0.00045025864,0.000029494557,0.000033838256,0.00029329414,0.00017754074,0.028676977,0.027460953,0.928885,0.013749772,0.000041205807],"about_ca_topic_score_codex":0.0008760093,"about_ca_topic_score_gemma":0.001494579,"teacher_disagreement_score":0.010403031,"about_ca_system_score_codex":0.00045662269,"about_ca_system_score_gemma":0.0005687794,"threshold_uncertainty_score":0.034801602},"labels":[],"label_agreement":null},{"id":"W2022598246","doi":"10.1016/j.jsc.2013.04.003","title":"Ideal-specific elimination orders form a star-shaped region","year":2013,"lang":"en","type":"article","venue":"Journal of Symbolic Computation","topic":"Polynomial and algebraic computation","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Google (Canada)","funders":"","keywords":"Mathematics; Ideal (ethics); Star (game theory); Combinatorics; Regular polygon; Polynomial; Discrete mathematics; Mathematical analysis; Geometry","score_opus":0.017350610929681792,"score_gpt":0.2385419214357196,"score_spread":0.2211913105060378,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2022598246","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5054777,0.00042082666,0.3722073,0.0005950614,0.000092322334,0.00018738926,0.00094534643,0.0013893015,0.11868466],"genre_scores_gemma":[0.9304967,0.00024090125,0.051614683,0.00014642841,0.000073649266,0.000086642525,0.0007806727,0.00043926723,0.01612112],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.999173,0.00011026775,0.000059929644,0.00017668982,0.00023279634,0.00024733538],"domain_scores_gemma":[0.99789643,0.0007299748,0.00028263655,0.000362212,0.0005075103,0.00022128405],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00085533893,0.00037889482,0.0010291134,0.0014801219,0.0017732421,0.0029050605,0.0010991519,0.00057327177,0.008459787],"category_scores_gemma":[0.0023248186,0.0006553599,0.001008257,0.0012088887,0.0025320337,0.0041332967,0.0018689896,0.001638782,0.003018987],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003425763,0.00005796538,0.0012589904,0.000086675114,0.000020463745,0.00029180685,0.000849985,0.0022514125,0.010692445,0.96848506,0.0014421708,0.014220445],"study_design_scores_gemma":[0.000116872885,0.00018255922,0.0014392635,0.000033196447,0.000050826635,0.00088574825,0.0007777027,0.013205441,0.02071818,0.9467004,0.015831219,0.000058400597],"about_ca_topic_score_codex":0.00069553265,"about_ca_topic_score_gemma":0.0008125098,"teacher_disagreement_score":0.008459787,"about_ca_system_score_codex":0.0008561197,"about_ca_system_score_gemma":0.0008291222,"threshold_uncertainty_score":0.028300762},"labels":[],"label_agreement":null},{"id":"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.571907,0.0021376817,0.34123477,0.0027153168,0.0006983603,0.00012584573,0.00040374306,0.0015458555,0.0792315],"genre_scores_gemma":[0.9482533,0.0011312434,0.02717228,0.00022933341,0.00039396988,0.00003528034,0.00019006824,0.00030370415,0.022290763],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.999315,0.00013738235,0.000029669873,0.00011764457,0.00018826425,0.00021206276],"domain_scores_gemma":[0.9981396,0.0008259843,0.00017994185,0.00047723632,0.00021253529,0.00016476921],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009500436,0.00092610327,0.0010699888,0.0014767086,0.0013736946,0.0022328184,0.0005718382,0.0006469567,0.009590221],"category_scores_gemma":[0.0039845705,0.0004922574,0.0007654469,0.0019031932,0.0030680879,0.005118914,0.0024913717,0.0021865324,0.0018668942],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002990083,0.00007294291,0.0005863674,0.00010900474,0.000024747285,0.00016543496,0.0005654792,0.005180953,0.0041500605,0.93515265,0.0034634848,0.05022996],"study_design_scores_gemma":[0.000048158337,0.000079085745,0.00019880183,0.000038556183,0.000027071452,0.00017059728,0.00012686217,0.009774014,0.0037669947,0.9780748,0.00766853,0.00002654202],"about_ca_topic_score_codex":0.0010602312,"about_ca_topic_score_gemma":0.0014120317,"teacher_disagreement_score":0.009590221,"about_ca_system_score_codex":0.0011809916,"about_ca_system_score_gemma":0.00076192204,"threshold_uncertainty_score":0.03208244},"labels":[],"label_agreement":null},{"id":"W2027966173","doi":"10.1016/j.jsc.2008.07.002","title":"Algebraic transformation of differential characteristic decompositions from one ranking to another","year":2008,"lang":"en","type":"article","venue":"Journal of Symbolic Computation","topic":"Polynomial and algebraic computation","field":"Computer Science","cited_by":15,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"Natural Sciences and Engineering Research Council of Canada; Russian Foundation for Basic Research; National Science Foundation","keywords":"Mathematics; Ideal (ethics); Canonical form; Ranking (information retrieval); Bounded function; Set (abstract data type); Order (exchange); Differential (mechanical device); Algebraic number; Discrete mathematics; Algebra over a field; Pure mathematics; Mathematical analysis; Computer science; Artificial intelligence","score_opus":0.020177325805018277,"score_gpt":0.24066292839953735,"score_spread":0.22048560259451908,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2027966173","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.41137585,0.00016200983,0.47857788,0.0010216453,0.00061780517,0.00016146441,0.00058880646,0.0013041552,0.10619027],"genre_scores_gemma":[0.913346,0.00016653047,0.056096476,0.0003061186,0.00022015613,0.00005149937,0.0005104884,0.00049341284,0.028809246],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99922943,0.000098028184,0.000041185947,0.00014171658,0.00026960234,0.00022010178],"domain_scores_gemma":[0.9988788,0.00020093122,0.00013665883,0.0001927384,0.00038014294,0.00021078004],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00066059356,0.00035311913,0.00043817336,0.00239291,0.0009772507,0.0027298387,0.00054571236,0.00040081184,0.008651994],"category_scores_gemma":[0.0026132006,0.00025174516,0.0005923234,0.0012958044,0.0014754625,0.0024351638,0.0011427145,0.0013850334,0.0017151935],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000668176,0.000065828695,0.00052845303,0.000028084978,0.000009570005,0.00013860581,0.00034694048,0.0014651635,0.005345283,0.9544874,0.003709914,0.03380789],"study_design_scores_gemma":[0.00004392778,0.000075626915,0.00096144987,0.000019732712,0.000017538974,0.00032492704,0.00036524274,0.017855976,0.0047598854,0.9624578,0.013076035,0.00004185175],"about_ca_topic_score_codex":0.0011022252,"about_ca_topic_score_gemma":0.0012304983,"teacher_disagreement_score":0.008651994,"about_ca_system_score_codex":0.0011124982,"about_ca_system_score_gemma":0.0008197188,"threshold_uncertainty_score":0.028943837},"labels":[],"label_agreement":null},{"id":"W2029184018","doi":"10.1016/j.jsc.2002.04.001","title":"Foreword to the special issue on Applications of computer algebra","year":2005,"lang":"en","type":"article","venue":"Journal of Symbolic Computation","topic":"Polynomial and algebraic computation","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Wilfrid Laurier University","funders":"","keywords":"Mathematics; Algebra over a field; Symbolic computation; Mathematics education; Pure mathematics; Mathematical analysis","score_opus":0.00947932950131616,"score_gpt":0.25557740186108635,"score_spread":0.2460980723597702,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2029184018","genre_codex":"editorial","genre_gemma":"editorial","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"editorial","genre_consensus":"editorial","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00017605512,0.013592321,0.00063207425,0.043637324,0.9224213,0.000058319125,0.00016715174,0.000092775415,0.019222734],"genre_scores_gemma":[0.0013557004,0.010504534,0.00038054315,0.021407014,0.83657897,0.000070866256,0.0003546061,0.00022925463,0.12911849],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99895006,0.00013877514,0.000115326984,0.0001656577,0.00051166455,0.00011852917],"domain_scores_gemma":[0.9933878,0.001913913,0.00041271836,0.00027235088,0.0027997775,0.0012134193],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015469017,0.002857023,0.0035075862,0.0038035945,0.0023755524,0.006196043,0.001741272,0.006525355,0.10537937],"category_scores_gemma":[0.005865747,0.00058400497,0.001744061,0.0017875886,0.0010670775,0.0050262837,0.0016224958,0.007535724,0.06115853],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000034269047,0.000020952422,0.000039545692,0.00016494634,0.000010126239,0.000048228987,0.000008743103,0.000024840507,0.00014854397,0.0011818307,0.9868522,0.01146581],"study_design_scores_gemma":[0.00002428882,0.000057243666,0.00061178324,0.0002256764,0.000025961092,0.00011619131,0.000030861887,0.00015585765,0.00015188522,0.003593382,0.9949941,0.000012850852],"about_ca_topic_score_codex":0.000834854,"about_ca_topic_score_gemma":0.0018538666,"teacher_disagreement_score":0.10537937,"about_ca_system_score_codex":0.0015649669,"about_ca_system_score_gemma":0.0014868737,"threshold_uncertainty_score":0.3525291},"labels":[],"label_agreement":null},{"id":"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.014965446,0.00022299106,0.98284054,0.00010500194,0.00007462622,0.000016686747,0.000044750825,0.00023922832,0.0014906304],"genre_scores_gemma":[0.34332356,0.00080321834,0.64963484,0.000077939585,0.00015269584,0.00007104159,0.00031899233,0.00018222774,0.005435506],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994961,0.00012961999,0.000022128721,0.000042049276,0.00025524484,0.00005478008],"domain_scores_gemma":[0.9991819,0.00032502983,0.00007105079,0.0001531948,0.00021742535,0.000051357987],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00070887886,0.000797678,0.0011113706,0.0009529014,0.0004618002,0.0011115851,0.0005749517,0.0005786992,0.0039273407],"category_scores_gemma":[0.0034745468,0.00033613096,0.00067218015,0.0011585723,0.0006313075,0.0014636563,0.00079074106,0.0011755063,0.0012523327],"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.00041016008,0.00018349382,0.0010658343,0.0003072704,0.00013270916,0.00028525788,0.00021632333,0.48895633,0.021397285,0.16606702,0.0057071685,0.3152711],"study_design_scores_gemma":[0.000012893341,0.000025281546,0.000080487065,0.0000098263945,0.000008147058,0.000032160442,0.000021672058,0.975009,0.0016934641,0.021730855,0.0013689877,0.0000072158296],"about_ca_topic_score_codex":0.003233185,"about_ca_topic_score_gemma":0.004210585,"teacher_disagreement_score":0.0039273407,"about_ca_system_score_codex":0.0003958883,"about_ca_system_score_gemma":0.00094893004,"threshold_uncertainty_score":0.013138294},"labels":[],"label_agreement":null},{"id":"W2040516344","doi":"10.1016/s0747-7171(03)00071-3","title":"Efficient decomposition of separable algebras","year":2003,"lang":"en","type":"article","venue":"Journal of Symbolic Computation","topic":"Polynomial and algebraic computation","field":"Computer Science","cited_by":16,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo; University of Calgary","funders":"","keywords":"Mathematics; Algebra over a field; Factorization of polynomials; Separable space; Polynomial; Generator (circuit theory); Simple (philosophy); Computation; Factorization; Pure mathematics; Matrix polynomial; Algorithm; Power (physics)","score_opus":0.009798005884001877,"score_gpt":0.2656074410536992,"score_spread":0.25580943516969734,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2040516344","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.23808031,0.00089972647,0.6987769,0.0007885567,0.00022347446,0.0001549822,0.00052111567,0.0009810415,0.059573825],"genre_scores_gemma":[0.7787637,0.00061152293,0.1823664,0.00022226988,0.00015303084,0.000110931374,0.00121915,0.00050814607,0.03604496],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99952364,0.00009692185,0.00002721139,0.00006016225,0.00015413525,0.0001379566],"domain_scores_gemma":[0.99952936,0.00011260408,0.000030135147,0.0001207196,0.00012957474,0.00007762443],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005986411,0.00063944975,0.0008622713,0.0010582377,0.00084222015,0.002040972,0.0006772962,0.00035299343,0.010832838],"category_scores_gemma":[0.0011670153,0.00038964843,0.0007840437,0.000839982,0.0008972671,0.0028516513,0.0020647608,0.0016906698,0.0024841889],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00024655633,0.00012735475,0.00023689958,0.000102322956,0.000022496994,0.00006063203,0.00031817792,0.005356102,0.008792101,0.91323453,0.0056860186,0.06581687],"study_design_scores_gemma":[0.000037843223,0.00003419424,0.000107553096,0.000019018751,0.000017494698,0.000040797488,0.00009221243,0.030728342,0.004259489,0.9574022,0.00724945,0.000011304176],"about_ca_topic_score_codex":0.00072758674,"about_ca_topic_score_gemma":0.0016381807,"teacher_disagreement_score":0.010832838,"about_ca_system_score_codex":0.0008657888,"about_ca_system_score_gemma":0.000754762,"threshold_uncertainty_score":0.036239505},"labels":[],"label_agreement":null},{"id":"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06739135,0.0010932237,0.89656955,0.0014411374,0.00028628507,0.00032490905,0.0007728289,0.005164077,0.026956577],"genre_scores_gemma":[0.30672815,0.00060602743,0.67813087,0.00043566432,0.00019972527,0.0004074201,0.0016452795,0.0005923576,0.011254633],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985946,0.00028006005,0.00012299143,0.00033606563,0.00043609965,0.00023030212],"domain_scores_gemma":[0.99537826,0.0032138599,0.00020690137,0.0006242872,0.00044592205,0.0001306968],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010587863,0.0014097106,0.0009422546,0.0012620558,0.001540716,0.002845417,0.002563074,0.001677412,0.016882878],"category_scores_gemma":[0.007601397,0.00085775927,0.001262307,0.0024730184,0.0014584167,0.0053156205,0.002602486,0.0034232407,0.0028805481],"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.0008167733,0.00043356232,0.0019173729,0.0010257493,0.00014496669,0.00013761332,0.00067832426,0.1164838,0.0053987685,0.23619959,0.025926758,0.6108367],"study_design_scores_gemma":[0.00048664527,0.00014029747,0.00038484696,0.000106429274,0.00011722851,0.00014036518,0.000343719,0.4860955,0.0083614215,0.4916749,0.012109237,0.00003944397],"about_ca_topic_score_codex":0.004528821,"about_ca_topic_score_gemma":0.010924516,"teacher_disagreement_score":0.016882878,"about_ca_system_score_codex":0.0017392915,"about_ca_system_score_gemma":0.0025497505,"threshold_uncertainty_score":0.0564788},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0853861,0.0004138308,0.90794814,0.00021638532,0.00014236102,0.000038872487,0.000024446084,0.00020326667,0.0056266068],"genre_scores_gemma":[0.69334716,0.00059905124,0.2987658,0.00010163577,0.00010858941,0.00009666224,0.00009464438,0.00017457626,0.006711961],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9996455,0.00009998645,0.00003829575,0.000041693358,0.00014112188,0.000033526867],"domain_scores_gemma":[0.999188,0.00048871175,0.00006801183,0.00008445293,0.00012428737,0.000046634446],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012440427,0.00043414044,0.0008477386,0.0007032278,0.0006395601,0.0016089642,0.00086012256,0.0007101619,0.002358727],"category_scores_gemma":[0.0035317389,0.00053797,0.0007428349,0.00067078095,0.0014075052,0.002034021,0.0015246216,0.001280826,0.00025222448],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013896106,0.00014120943,0.0017359046,0.00018033251,0.00011664993,0.00024918516,0.00073271035,0.22847635,0.0078912135,0.66689396,0.0014461859,0.091997385],"study_design_scores_gemma":[0.00001966677,0.000020908132,0.00011378786,0.000009509457,0.00001544767,0.00002368386,0.00003946921,0.9210536,0.00090597774,0.07657521,0.0012147701,0.000007975459],"about_ca_topic_score_codex":0.003297465,"about_ca_topic_score_gemma":0.004220174,"teacher_disagreement_score":0.003297465,"about_ca_system_score_codex":0.000628279,"about_ca_system_score_gemma":0.00066935655,"threshold_uncertainty_score":0.007890761},"labels":[],"label_agreement":null},{"id":"W2052338752","doi":"10.1016/j.jsc.2008.04.019","title":"Fast arithmetic for triangular sets: From theory to practice","year":2008,"lang":"en","type":"article","venue":"Journal of Symbolic Computation","topic":"Polynomial and algebraic computation","field":"Computer Science","cited_by":32,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"","keywords":"Mathematics; Quicksort; Modular arithmetic; Arithmetic; Euclidean algorithm; Division (mathematics); Multiplication (music); Axiom; Univariate; Dimension (graph theory); Euclidean geometry; Algebra over a field; Discrete mathematics; sort; Cryptography; Algorithm; Sorting algorithm; Pure mathematics; Combinatorics","score_opus":0.018415195422730957,"score_gpt":0.28258018679888164,"score_spread":0.2641649913761507,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2052338752","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011914599,0.0034697575,0.94495165,0.0013497295,0.00035399015,0.00013279455,0.00024122957,0.0051900344,0.032396257],"genre_scores_gemma":[0.2732733,0.0031198876,0.7097268,0.0007137705,0.0005953649,0.0002926047,0.00065853767,0.001410107,0.010209606],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99589807,0.0010312549,0.00021874897,0.0006870702,0.0017887107,0.00037605016],"domain_scores_gemma":[0.98720574,0.0058441176,0.00033519324,0.004471042,0.0018106427,0.00033319206],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0026966494,0.0012365433,0.0014681532,0.0018217518,0.0017300525,0.006220977,0.0041540675,0.002010125,0.03602001],"category_scores_gemma":[0.019021248,0.0010878671,0.0010833658,0.0037609502,0.0025008223,0.01160342,0.0034551583,0.0039604036,0.009432795],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005941585,0.00013432253,0.0009220841,0.0005971545,0.000053528092,0.000096723335,0.00036987753,0.017212605,0.0041354964,0.47735772,0.023730416,0.47479597],"study_design_scores_gemma":[0.00014130105,0.00015625257,0.00020389151,0.00030784422,0.000046654386,0.00029579806,0.00023190556,0.14449477,0.008596056,0.7996121,0.04584536,0.000068182395],"about_ca_topic_score_codex":0.0022051896,"about_ca_topic_score_gemma":0.0034869567,"teacher_disagreement_score":0.03602001,"about_ca_system_score_codex":0.0025068878,"about_ca_system_score_gemma":0.0027152526,"threshold_uncertainty_score":0.120498955},"labels":[],"label_agreement":null},{"id":"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":"review","genre_gemma":"review","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"review","genre_consensus":"review","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.034401294,0.5006759,0.34043607,0.06986557,0.0050243773,0.00007901775,0.00031847513,0.002061132,0.047138173],"genre_scores_gemma":[0.3955154,0.30044487,0.26874754,0.0052162292,0.011821836,0.00021593901,0.0006679209,0.00082315895,0.016547171],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9960949,0.00089972623,0.00018560137,0.00037764898,0.0022471533,0.00019502884],"domain_scores_gemma":[0.9778021,0.012946035,0.000537548,0.0023791925,0.0055153477,0.0008198153],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.011470582,0.0009790647,0.002500325,0.0015083855,0.0010333143,0.006411951,0.00415234,0.0038634497,0.0070729954],"category_scores_gemma":[0.02402678,0.0007670822,0.00065844454,0.0030523383,0.0048309434,0.0109897405,0.0037243953,0.005978284,0.0035558175],"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.0005829232,0.00026533668,0.0021610605,0.0030094024,0.00013376799,0.000114955605,0.0005749392,0.022356315,0.0034045463,0.37469116,0.038889114,0.55381644],"study_design_scores_gemma":[0.00021182103,0.00024886456,0.0012718816,0.0012221282,0.00009034826,0.00033004055,0.0007543749,0.17112783,0.0041375305,0.6555912,0.16487041,0.00014356973],"about_ca_topic_score_codex":0.0010449074,"about_ca_topic_score_gemma":0.0011048433,"teacher_disagreement_score":0.011470582,"about_ca_system_score_codex":0.0013000303,"about_ca_system_score_gemma":0.0024848816,"threshold_uncertainty_score":0.060662985},"labels":[],"label_agreement":null},{"id":"W2053029682","doi":"10.1016/j.jsc.2011.12.023","title":"Algorithms for computing triangular decomposition of polynomial systems","year":2011,"lang":"en","type":"article","venue":"Journal of Symbolic Computation","topic":"Polynomial and algebraic computation","field":"Computer Science","cited_by":87,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"","keywords":"Decomposition; Mathematics; Key (lock); Polynomial; Algorithm; Algebra over a field; Theoretical computer science; Computer science; Pure mathematics","score_opus":0.039196430906365674,"score_gpt":0.2941856011297759,"score_spread":0.2549891702234102,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2053029682","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.023787368,0.00022505003,0.9619853,0.00020410625,0.00011297107,0.00016557093,0.00037034054,0.0027041815,0.010445104],"genre_scores_gemma":[0.23755787,0.00028015944,0.75213444,0.00014838317,0.000077266726,0.00025218405,0.0021886595,0.0005793977,0.0067816963],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990194,0.00018645935,0.000088972214,0.00019115856,0.00029793792,0.00021602926],"domain_scores_gemma":[0.9965436,0.0016948638,0.00014846584,0.00071309286,0.0007151264,0.00018483074],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011761637,0.0011405548,0.0010526512,0.0014711084,0.001144313,0.0025472064,0.0018284075,0.0008817944,0.020822197],"category_scores_gemma":[0.007007956,0.0005945601,0.0013617942,0.0022519703,0.00094094424,0.0034165208,0.0025143248,0.0022964168,0.0045835027],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0007883709,0.00033470555,0.0017449955,0.00051253283,0.00010308594,0.00014374962,0.00046970753,0.10049866,0.008123822,0.20306793,0.023595387,0.6606171],"study_design_scores_gemma":[0.00017818503,0.00011577837,0.00028210864,0.000058742935,0.000059301194,0.000086812375,0.00024794895,0.6724374,0.006651343,0.31173787,0.008111553,0.00003285954],"about_ca_topic_score_codex":0.004809504,"about_ca_topic_score_gemma":0.013461999,"teacher_disagreement_score":0.020822197,"about_ca_system_score_codex":0.0016186568,"about_ca_system_score_gemma":0.0019813492,"threshold_uncertainty_score":0.06965721},"labels":[],"label_agreement":null},{"id":"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5909109,0.0024207293,0.2227335,0.0027497825,0.0012403239,0.00018819247,0.0008070768,0.0002843492,0.17866513],"genre_scores_gemma":[0.9461957,0.0010918499,0.028140567,0.0004356114,0.00061507884,0.000112333386,0.00055035437,0.00009610217,0.022762304],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99938333,0.0001243718,0.00004351873,0.00006687731,0.00025761194,0.00012429792],"domain_scores_gemma":[0.99932647,0.00013947341,0.000107699445,0.00007077916,0.00017550835,0.0001801847],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010866517,0.0006576831,0.0008445305,0.0022741205,0.0020120332,0.0032826131,0.0011279968,0.0007368803,0.008203336],"category_scores_gemma":[0.001683429,0.00032735858,0.0006026128,0.0016786772,0.0027140894,0.0033580528,0.001833566,0.002043957,0.0012820453],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000015162817,0.00001895316,0.000055655302,0.000015324063,0.000003014467,0.000018432718,0.000097695236,0.0004472507,0.0004919957,0.9952166,0.00040910125,0.003210901],"study_design_scores_gemma":[0.000012374985,0.000008465793,0.00007678423,0.0000069675843,0.0000022584093,0.000022385071,0.000059051883,0.001966043,0.0002596772,0.9962733,0.0013047039,0.000008161351],"about_ca_topic_score_codex":0.0011213287,"about_ca_topic_score_gemma":0.001698107,"teacher_disagreement_score":0.008203336,"about_ca_system_score_codex":0.0013227434,"about_ca_system_score_gemma":0.0013154317,"threshold_uncertainty_score":0.027442873},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8379184,0.00044586827,0.13303973,0.000741096,0.00024054211,0.0000690402,0.00041068552,0.0010272095,0.026107425],"genre_scores_gemma":[0.9707498,0.00017775084,0.02410243,0.0000744712,0.00014749379,0.00001930046,0.0005537121,0.00018539056,0.0039896346],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99914277,0.00012969346,0.00006887804,0.00020366516,0.00023334587,0.00022171979],"domain_scores_gemma":[0.99770784,0.0011139371,0.00030398418,0.00036407547,0.0002549675,0.00025512124],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012188635,0.0010559105,0.0012018712,0.0027757487,0.0014419834,0.004619788,0.0017963996,0.0006968457,0.008554952],"category_scores_gemma":[0.004149076,0.0005408894,0.0009737427,0.0028030202,0.002919419,0.009066422,0.003076658,0.0016615908,0.0011936419],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.001199828,0.00045608656,0.0124175325,0.0003042767,0.00014482622,0.0006663365,0.0017424709,0.018152498,0.013161696,0.7845942,0.008024867,0.15913545],"study_design_scores_gemma":[0.000061430364,0.00010975549,0.001076235,0.000025581088,0.00006212136,0.00013121775,0.0003196211,0.024630027,0.006442868,0.9646528,0.002463159,0.000025283878],"about_ca_topic_score_codex":0.0007913498,"about_ca_topic_score_gemma":0.0016890286,"teacher_disagreement_score":0.008554952,"about_ca_system_score_codex":0.0012340959,"about_ca_system_score_gemma":0.0007221503,"threshold_uncertainty_score":0.02861923},"labels":[],"label_agreement":null},{"id":"W2064756116","doi":"10.1016/j.jsc.2006.12.004","title":"On approximate triangular decompositions in dimension zero","year":2007,"lang":"en","type":"article","venue":"Journal of Symbolic Computation","topic":"Polynomial and algebraic computation","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"National Science Foundation","keywords":"Mathematics; Zero (linguistics); Dimension (graph theory); Generalization; Polynomial; Homotopy; System of polynomial equations; Algebra over a field; Applied mathematics; Discrete mathematics; Pure mathematics; Mathematical analysis","score_opus":0.011061004748159575,"score_gpt":0.268565815014977,"score_spread":0.25750481026681743,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2064756116","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2378205,0.0010195693,0.6785197,0.0011992195,0.0005052397,0.00011279907,0.0004520775,0.00067683274,0.07969406],"genre_scores_gemma":[0.8693169,0.00068039907,0.10901694,0.00033623754,0.00018881228,0.00007628953,0.00059584324,0.00023377326,0.019554777],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99947447,0.00014560013,0.00002465906,0.00005743265,0.0002058092,0.00009213957],"domain_scores_gemma":[0.9982889,0.0008162249,0.00011036579,0.00040689352,0.00026293934,0.00011468874],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007972456,0.00050897186,0.00072663807,0.0011134455,0.00091201696,0.0017050293,0.0007547292,0.0006338312,0.011242276],"category_scores_gemma":[0.0059207045,0.0002692149,0.00041562275,0.0015743221,0.0015803364,0.0029923553,0.0018165965,0.0014367398,0.0011819669],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001839767,0.00004204228,0.00062384765,0.00005819784,0.000011873213,0.000080193386,0.00028673885,0.02086139,0.0013383455,0.921636,0.0049242587,0.049953133],"study_design_scores_gemma":[0.000012936257,0.00002356071,0.00012807605,0.000019552903,0.000006599114,0.000046771816,0.00014546547,0.117010154,0.0006331716,0.87870896,0.0032555202,0.000009223076],"about_ca_topic_score_codex":0.0018643368,"about_ca_topic_score_gemma":0.00337057,"teacher_disagreement_score":0.011242276,"about_ca_system_score_codex":0.00070008036,"about_ca_system_score_gemma":0.0003940424,"threshold_uncertainty_score":0.03760916},"labels":[],"label_agreement":null},{"id":"W2067539682","doi":"10.1016/j.jsc.2011.09.006","title":"Triangular <mml:math xmlns:mml=\"http://www.w3.org/1998/Math/MathML\" altimg=\"si1.gif\" display=\"inline\" overflow=\"scroll\"><mml:mi>x</mml:mi></mml:math>-basis decompositions and derandomization of linear algebra algorithms over <mml:math xmlns:mml=\"http://www.w3.org/1998/Math/MathML\" altimg=\"si2.gif\" display=\"inline\" overflow=\"scroll\"><mml:mstyle mathvariant=\"sans-serif\"><mml:mi>K</mml:mi></mml:mstyle><mml:mrow><mml:mo>[</mml:mo><mml:mi>x</mml:mi><mml:mo>]</mml:mo></mml:mrow></mml:math>","year":2011,"lang":"lv","type":"article","venue":"Journal of Symbolic Computation","topic":"Polynomial and algebraic computation","field":"Computer Science","cited_by":42,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Mathematics; Invertible matrix; Degree (music); Basis (linear algebra); Factorization; Polynomial; Prime (order theory); Discrete mathematics; Algorithm; Finite field; Linearization; Linear system; Combinatorics; Pure mathematics; Mathematical analysis; Geometry; Nonlinear system","score_opus":0.01625062571401865,"score_gpt":0.24227548051093784,"score_spread":0.2260248547969192,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2067539682","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008106232,0.00061210815,0.48217562,0.004614054,0.0008499483,0.00022476801,0.022557253,0.049542144,0.43131787],"genre_scores_gemma":[0.18356912,0.001940509,0.21158503,0.002324036,0.00073502836,0.00052357756,0.0679273,0.054417603,0.47697777],"study_design_codex":"not_applicable","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990246,0.00022511045,0.00007421818,0.00018798136,0.0003522181,0.0001358611],"domain_scores_gemma":[0.99753124,0.00073066755,0.00013980042,0.00078570616,0.0006607985,0.00015171446],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011457425,0.0008152789,0.0006778135,0.0013887832,0.0009643363,0.0038465196,0.0012933649,0.0008797542,0.2680255],"category_scores_gemma":[0.006349172,0.0005801194,0.0008926556,0.0022871243,0.0007948535,0.004494634,0.0018411225,0.0021130445,0.15915856],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00031068557,0.00006260463,0.0005873592,0.00032414324,0.000024939407,0.000100755235,0.00022244867,0.0044710655,0.0047782757,0.27901235,0.595779,0.11432638],"study_design_scores_gemma":[0.000111704976,0.00005030983,0.0010246359,0.00013404149,0.000028392,0.00023248326,0.00015606578,0.03523295,0.018118165,0.24474967,0.70008814,0.00007353882],"about_ca_topic_score_codex":0.0054899673,"about_ca_topic_score_gemma":0.007815441,"teacher_disagreement_score":0.2680255,"about_ca_system_score_codex":0.0019271675,"about_ca_system_score_gemma":0.0013070026,"threshold_uncertainty_score":0.8966346},"labels":[],"label_agreement":null},{"id":"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.18832648,0.0011170867,0.7607819,0.0008170761,0.00034358504,0.00015785126,0.0002973353,0.0012387885,0.046919882],"genre_scores_gemma":[0.89846575,0.00022140487,0.09713533,0.000100053054,0.000039079987,0.000090573085,0.000111080146,0.000101277255,0.003735443],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99962676,0.00012356155,0.000022398088,0.0000618706,0.000108449574,0.000056942015],"domain_scores_gemma":[0.9991322,0.0005676223,0.000044750817,0.0001462125,0.00006629112,0.000042861215],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005416981,0.00043092234,0.0006561549,0.00042776557,0.00064748497,0.001097503,0.0007382636,0.0006509799,0.00471245],"category_scores_gemma":[0.0015541457,0.00030762397,0.0005265611,0.00037793035,0.0008993196,0.0012398019,0.0008473772,0.0009529287,0.00065868115],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003542358,0.00015081534,0.0002742752,0.0002962233,0.00006804486,0.0001481476,0.0001459404,0.07456204,0.044362955,0.80910164,0.0018783973,0.06865726],"study_design_scores_gemma":[0.00013586723,0.0001491403,0.00016234154,0.00006641182,0.000055039007,0.00009498277,0.000033989007,0.41354918,0.060531963,0.5148497,0.010323149,0.00004814737],"about_ca_topic_score_codex":0.000384634,"about_ca_topic_score_gemma":0.0010511021,"teacher_disagreement_score":0.00471245,"about_ca_system_score_codex":0.0007264657,"about_ca_system_score_gemma":0.00079726765,"threshold_uncertainty_score":0.015764773},"labels":[],"label_agreement":null},{"id":"W2072653231","doi":"10.1016/j.jsc.2003.08.010","title":"Telescoping in the context of symbolic summation in Maple","year":2004,"lang":"en","type":"article","venue":"Journal of Symbolic Computation","topic":"Polynomial and algebraic computation","field":"Computer Science","cited_by":22,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo; McMaster University","funders":"","keywords":"Maple; Telescoping series; Mathematics; Context (archaeology); Symbolic computation; Algebra over a field; Pure mathematics; Mathematical analysis","score_opus":0.014686698666798963,"score_gpt":0.25727426159478695,"score_spread":0.24258756292798797,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2072653231","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.19176193,0.0026989318,0.67331225,0.0027209718,0.0015031922,0.00008000585,0.00014729986,0.0011951816,0.1265803],"genre_scores_gemma":[0.8982726,0.000961523,0.08147813,0.0005577939,0.0007792096,0.00006471958,0.00010751282,0.00049543654,0.017283054],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99884087,0.00037047642,0.00008179104,0.0001634917,0.00033974653,0.00020368925],"domain_scores_gemma":[0.99835193,0.00071265304,0.00015088599,0.00039125446,0.0002564477,0.00013675111],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012938171,0.00061805244,0.0011909441,0.0013916164,0.002402317,0.0031832717,0.0011850789,0.0011007468,0.007103114],"category_scores_gemma":[0.006464249,0.00035239157,0.0007496761,0.0017881878,0.0035061848,0.0060547804,0.0025893913,0.002015349,0.0013329294],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000499503,0.000018553947,0.00011196209,0.00004194248,0.000008075188,0.0002702488,0.00020026228,0.0024685818,0.0007295507,0.9839595,0.0016521908,0.010489207],"study_design_scores_gemma":[0.00000920043,0.000015865035,0.000047479207,0.000014521136,0.000007855695,0.00013128246,0.000041290245,0.014503886,0.00091921556,0.9807562,0.0035380225,0.000015091933],"about_ca_topic_score_codex":0.00090040127,"about_ca_topic_score_gemma":0.0015418945,"teacher_disagreement_score":0.007103114,"about_ca_system_score_codex":0.0009691183,"about_ca_system_score_gemma":0.0009208074,"threshold_uncertainty_score":0.023762286},"labels":[],"label_agreement":null},{"id":"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5202897,0.0004553293,0.4182988,0.0009532787,0.00031575208,0.000121507444,0.00044380076,0.0011398464,0.057981994],"genre_scores_gemma":[0.88311523,0.0002966045,0.10702698,0.00012877316,0.00008344692,0.00003576447,0.00042305962,0.00022704562,0.008663141],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99945337,0.00011884997,0.00004188587,0.000099873665,0.00017576046,0.0001101842],"domain_scores_gemma":[0.9984534,0.0009112451,0.00011119042,0.0002065937,0.00024147698,0.00007606321],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006887623,0.0007616252,0.0006911067,0.0014556603,0.00077446643,0.0030037786,0.000772115,0.00057941454,0.010728713],"category_scores_gemma":[0.0055809915,0.00040348497,0.00047343352,0.0013516846,0.0016427173,0.0037698955,0.0013631735,0.0010247051,0.0017321307],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00045464316,0.00016198221,0.0028744624,0.00024788917,0.00003941002,0.00032205624,0.0008959399,0.05114209,0.009929363,0.7520686,0.0073044747,0.17455913],"study_design_scores_gemma":[0.00006212494,0.00008153065,0.00034959897,0.000046578843,0.00002017796,0.00009406134,0.00038437132,0.11513935,0.0071791746,0.87142,0.0051966966,0.000026367818],"about_ca_topic_score_codex":0.001267333,"about_ca_topic_score_gemma":0.003644146,"teacher_disagreement_score":0.010728713,"about_ca_system_score_codex":0.00079032226,"about_ca_system_score_gemma":0.00062254403,"threshold_uncertainty_score":0.035891116},"labels":[],"label_agreement":null},{"id":"W2079007848","doi":"10.1016/j.jsc.2006.05.003","title":"Gröbner fan and universal characteristic sets of prime differential ideals","year":2006,"lang":"en","type":"article","venue":"Journal of Symbolic Computation","topic":"Polynomial and algebraic computation","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"Università di Pisa; Russian Foundation for Basic Research","keywords":"Mathematics; Prime (order theory); Differential (mechanical device); Combinatorics; Pure mathematics; Discrete mathematics; Algebra over a field","score_opus":0.006545562213871806,"score_gpt":0.22256338713067086,"score_spread":0.21601782491679905,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2079007848","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.80302334,0.001873187,0.099357404,0.0020402588,0.0001680789,0.00007669775,0.00052642304,0.0002884145,0.09264618],"genre_scores_gemma":[0.9853198,0.00038449443,0.0068570063,0.00011427966,0.0001511007,0.000050965835,0.00021453673,0.000042367075,0.0068654404],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988568,0.00020714423,0.00004534841,0.00024627201,0.0003838108,0.00026065693],"domain_scores_gemma":[0.99731064,0.001665483,0.00028559135,0.00016491332,0.0002201638,0.00035321258],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017325594,0.0007108834,0.0012868446,0.0036714238,0.0029280302,0.005001708,0.0012541016,0.0007016537,0.005790183],"category_scores_gemma":[0.0057526436,0.00077651424,0.0007756922,0.0022743251,0.005143048,0.007336187,0.0028085557,0.002317471,0.00039597662],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000053659638,0.000020469657,0.00044833453,0.000019809566,0.0000071098752,0.000053144147,0.00032490876,0.0010168914,0.0002739259,0.99466336,0.0002698795,0.002848444],"study_design_scores_gemma":[0.000019959827,0.000008181253,0.00034536928,0.000013696907,0.000009705866,0.00007600157,0.000092598006,0.0032917974,0.0003395634,0.99447256,0.0013202175,0.000010322879],"about_ca_topic_score_codex":0.0014598214,"about_ca_topic_score_gemma":0.0018593655,"teacher_disagreement_score":0.005790183,"about_ca_system_score_codex":0.0034517779,"about_ca_system_score_gemma":0.0010608141,"threshold_uncertainty_score":0.0250445},"labels":[],"label_agreement":null},{"id":"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13211282,0.0006470804,0.8335516,0.0012147948,0.00035731733,0.00013979396,0.00023680269,0.0014153458,0.030324442],"genre_scores_gemma":[0.7737073,0.0007086633,0.20727696,0.00033820447,0.00018649783,0.00020461595,0.0006489684,0.0006764231,0.016252344],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99927276,0.0002180101,0.000048478414,0.00007525244,0.0002784201,0.00010712075],"domain_scores_gemma":[0.9979882,0.0010622276,0.00009029442,0.0005484497,0.00023344638,0.00007742457],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00090262893,0.000666052,0.0011288336,0.00068904395,0.00082863163,0.0009517578,0.00080168364,0.0004985694,0.005653482],"category_scores_gemma":[0.0054479027,0.00061789335,0.0010614576,0.0005080519,0.0011897575,0.0023353558,0.002674655,0.00174308,0.000683289],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00059012254,0.0002059563,0.0012783107,0.0004915803,0.000119068274,0.00037745028,0.0007266343,0.18927902,0.025903346,0.60540605,0.01115296,0.1644695],"study_design_scores_gemma":[0.00007829157,0.00006958159,0.00034114168,0.000021725487,0.000051097257,0.000094427305,0.00008746935,0.5390815,0.0094339,0.44354546,0.0071750274,0.000020348902],"about_ca_topic_score_codex":0.0012004542,"about_ca_topic_score_gemma":0.001917408,"teacher_disagreement_score":0.005653482,"about_ca_system_score_codex":0.00050995353,"about_ca_system_score_gemma":0.0008951545,"threshold_uncertainty_score":0.018912733},"labels":[],"label_agreement":null},{"id":"W2079533520","doi":"10.1016/j.jsc.2003.07.004","title":"Certified dense linear system solving","year":2003,"lang":"en","type":"article","venue":"Journal of Symbolic Computation","topic":"Polynomial and algebraic computation","field":"Computer Science","cited_by":33,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Mathematics; Diophantine equation; Ring (chemistry); Ideal (ethics); Certificate; Domain (mathematical analysis); System of linear equations; Ring of integers; Linear system; Discrete mathematics; Integral domain; Field (mathematics); Algebra over a field; Algebraic number field; Algorithm; Pure mathematics; Mathematical analysis","score_opus":0.019108657443917463,"score_gpt":0.24786600853807797,"score_spread":0.2287573510941605,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2079533520","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12555173,0.0005648565,0.73353326,0.004546602,0.0007016909,0.0005762432,0.0023385305,0.023389688,0.10879739],"genre_scores_gemma":[0.75685334,0.00018880762,0.20361209,0.00091284467,0.00026281818,0.00018715441,0.0036982982,0.0014366653,0.032848056],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99527526,0.0009459329,0.00023466638,0.0009586521,0.0017813813,0.00080413],"domain_scores_gemma":[0.9888537,0.003927821,0.00035569456,0.004352641,0.002198102,0.00031210715],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019508703,0.000902635,0.0012108553,0.00091891125,0.0016500304,0.0031540978,0.0022675907,0.0012601046,0.036715344],"category_scores_gemma":[0.012000677,0.0009389346,0.0009533442,0.0012740908,0.0020011333,0.0049384376,0.004670608,0.0032718207,0.0057486],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0016814175,0.0007952223,0.0032965387,0.0006890981,0.00014065679,0.00030596307,0.00058684015,0.043509115,0.016939305,0.40642634,0.089219555,0.4364099],"study_design_scores_gemma":[0.0006823171,0.00031271187,0.0011118394,0.00012069909,0.00014553481,0.00038501868,0.0004377915,0.26357445,0.055433623,0.64018875,0.037529968,0.0000773108],"about_ca_topic_score_codex":0.0035914895,"about_ca_topic_score_gemma":0.010533037,"teacher_disagreement_score":0.036715344,"about_ca_system_score_codex":0.0019028643,"about_ca_system_score_gemma":0.005773882,"threshold_uncertainty_score":0.122825086},"labels":[],"label_agreement":null},{"id":"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.053060915,0.024432661,0.85313046,0.013612489,0.002044969,0.000054204786,0.00040280484,0.00030850852,0.052953064],"genre_scores_gemma":[0.8355392,0.016138697,0.11584505,0.0010674469,0.0027998735,0.00016736753,0.00044570092,0.00023750865,0.027759168],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995378,0.0002022849,0.000031750806,0.00005167179,0.00014641603,0.000030098925],"domain_scores_gemma":[0.99870324,0.0007679807,0.000114241615,0.00013391732,0.00021899307,0.000061661296],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011618537,0.0006259549,0.00143315,0.0012339448,0.0005398554,0.0024036865,0.000623407,0.0018037269,0.0029899105],"category_scores_gemma":[0.0050709397,0.00047118805,0.00070863334,0.00137516,0.0024077913,0.0032368859,0.0010840285,0.0026211431,0.00073113124],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000005334569,0.00000561373,0.00008550692,0.000030634248,0.0000074413824,0.000019300944,0.00003859175,0.013125944,0.00020426096,0.9815113,0.001343293,0.0036228467],"study_design_scores_gemma":[0.000006950863,0.000004541131,0.000089010086,0.000011450707,0.0000044418284,0.000018238836,0.000012104349,0.11241853,0.00008410429,0.88430274,0.0030391107,0.000008883374],"about_ca_topic_score_codex":0.0032309531,"about_ca_topic_score_gemma":0.00179255,"teacher_disagreement_score":0.0032309531,"about_ca_system_score_codex":0.0013015436,"about_ca_system_score_gemma":0.0013880468,"threshold_uncertainty_score":0.010002255},"labels":[],"label_agreement":null},{"id":"W2085665095","doi":"10.1016/j.jsc.2007.08.003","title":"Universal characteristic decomposition of radical differential ideals","year":2007,"lang":"en","type":"article","venue":"Journal of Symbolic Computation","topic":"Polynomial and algebraic computation","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"","keywords":"Mathematics; Ideal (ethics); Ranking (information retrieval); Intersection (aeronautics); Set (abstract data type); Combinatorics; Differential (mechanical device); Finite set; Polynomial; Discrete mathematics; Algebra over a field; Pure mathematics; Mathematical analysis","score_opus":0.008893168748411744,"score_gpt":0.2677494275058659,"score_spread":0.25885625875745416,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2085665095","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.73331445,0.0012317599,0.16008438,0.0016423473,0.0003564139,0.000082718565,0.00032274294,0.00039374214,0.10257147],"genre_scores_gemma":[0.97253686,0.00031014747,0.00977758,0.00014787074,0.00020786027,0.000022926872,0.00017241297,0.00008092007,0.016743349],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99946696,0.000055109012,0.000023559684,0.00010643977,0.00016757323,0.00018045593],"domain_scores_gemma":[0.9990295,0.00026263198,0.00012975733,0.00008933285,0.0002285279,0.00026012384],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00082952756,0.0004993232,0.00075399387,0.002506902,0.0015221825,0.0030064334,0.0007806992,0.00043445735,0.005449603],"category_scores_gemma":[0.0016859986,0.00039102076,0.0006121382,0.0012244806,0.003223837,0.004480319,0.0019117465,0.002178218,0.0007193198],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005476934,0.000027536968,0.0004298452,0.00002120502,0.00000589626,0.00005822731,0.00038160337,0.00046607733,0.0010208116,0.9907012,0.00066761667,0.006165178],"study_design_scores_gemma":[0.000024143563,0.00002785644,0.0004861046,0.000013141044,0.000013598289,0.00012590949,0.0001667605,0.0032011406,0.0010863044,0.9911671,0.0036724664,0.00001539616],"about_ca_topic_score_codex":0.0009992551,"about_ca_topic_score_gemma":0.0011367659,"teacher_disagreement_score":0.005449603,"about_ca_system_score_codex":0.0019047091,"about_ca_system_score_gemma":0.0008540648,"threshold_uncertainty_score":0.018230677},"labels":[],"label_agreement":null},{"id":"W2088713140","doi":"10.1016/j.jsc.2012.05.008","title":"On the complexity of computing with zero-dimensional triangular sets","year":2012,"lang":"en","type":"article","venue":"Journal of Symbolic Computation","topic":"Polynomial and algebraic computation","field":"Computer Science","cited_by":29,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"Agence Nationale de la Recherche","keywords":"Mathematics; Modular design; Degree (music); Dimension (graph theory); Inverse; Zero (linguistics); Las vegas; Field (mathematics); Algebraic number; Computation; Finite field; Set (abstract data type); Discrete mathematics; Algorithm; Combinatorics; Pure mathematics; Computer science","score_opus":0.037617557090772524,"score_gpt":0.2682194969239669,"score_spread":0.23060193983319438,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2088713140","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6391321,0.0026797918,0.25251797,0.016772931,0.00058347196,0.00040317234,0.0036439658,0.002180946,0.082085624],"genre_scores_gemma":[0.9318899,0.00086713186,0.05496813,0.0006251795,0.00046348118,0.00022901178,0.002023565,0.00039789244,0.008535739],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9928895,0.0016579259,0.0005111529,0.0011260039,0.0025596183,0.0012558069],"domain_scores_gemma":[0.93927366,0.049672797,0.0017470525,0.0064121527,0.001893938,0.0010003021],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0032879158,0.0010217509,0.0022195322,0.0014762593,0.0030622708,0.008925815,0.004190213,0.0023644068,0.020018127],"category_scores_gemma":[0.037705455,0.0008768996,0.002191471,0.0039804545,0.004797115,0.024023656,0.005965099,0.0049128295,0.0017831712],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0028712829,0.0004931856,0.0072971364,0.0008722878,0.00020823789,0.0004611767,0.0015158552,0.15230098,0.0052500414,0.70296556,0.022715855,0.10304845],"study_design_scores_gemma":[0.00011143839,0.00005715279,0.00056820083,0.000046608417,0.00006243584,0.00009617792,0.00024362096,0.19334728,0.0018684904,0.8016877,0.0018708786,0.000039945793],"about_ca_topic_score_codex":0.006946403,"about_ca_topic_score_gemma":0.011236717,"teacher_disagreement_score":0.020018127,"about_ca_system_score_codex":0.0053505036,"about_ca_system_score_gemma":0.0049141115,"threshold_uncertainty_score":0.06696731},"labels":[],"label_agreement":null},{"id":"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6843489,0.0004057837,0.2064294,0.0015752065,0.00029715558,0.000075023934,0.00060550746,0.00048530163,0.1057778],"genre_scores_gemma":[0.97329605,0.00022907306,0.011960201,0.00017174573,0.00013243905,0.000034744928,0.0004213519,0.0001171775,0.013637183],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993436,0.000092955495,0.00004548888,0.00013215232,0.00021802327,0.00016779864],"domain_scores_gemma":[0.9981248,0.00070029113,0.00019648795,0.00027594133,0.0004321826,0.00027042947],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00060088764,0.000415676,0.0007103826,0.0019244455,0.0012853153,0.0032137167,0.0009057887,0.00096955936,0.0077930326],"category_scores_gemma":[0.0032024726,0.00025582977,0.0009129137,0.00087071,0.0022675022,0.005332658,0.0019462635,0.0027286368,0.0007581341],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000038853137,0.00003074938,0.00043241834,0.000018867153,0.0000068028394,0.00004700742,0.0001977937,0.00095838035,0.0011050585,0.9909112,0.0006633045,0.0055895457],"study_design_scores_gemma":[0.00001149156,0.00002388589,0.0004240735,0.0000064454184,0.0000053592807,0.000046389578,0.00007961311,0.012711479,0.001020529,0.9842241,0.0014362485,0.000010324907],"about_ca_topic_score_codex":0.001571906,"about_ca_topic_score_gemma":0.0012430488,"teacher_disagreement_score":0.0077930326,"about_ca_system_score_codex":0.0015887597,"about_ca_system_score_gemma":0.00070258876,"threshold_uncertainty_score":0.026070297},"labels":[],"label_agreement":null},{"id":"W2091909596","doi":"10.1016/j.jsc.2010.08.016","title":"The modpn library: Bringing fast polynomial arithmetic into Maple","year":2010,"lang":"en","type":"article","venue":"Journal of Symbolic Computation","topic":"Polynomial and algebraic computation","field":"Computer Science","cited_by":43,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"","keywords":"Mathematics; Maple; Arithmetic; Polynomial; Algebra over a field; Pure mathematics; Botany","score_opus":0.004614438534023594,"score_gpt":0.2208467436048269,"score_spread":0.2162323050708033,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2091909596","genre_codex":"methods","genre_gemma":"software","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"software","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0055278437,0.0007218986,0.68938375,0.00031790466,0.00042635584,0.000120445126,0.0022809021,0.27559334,0.025627557],"genre_scores_gemma":[0.1674761,0.0013009799,0.68020594,0.0014043744,0.0007045476,0.0006497261,0.011622555,0.09437667,0.042259075],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99847025,0.00021251287,0.00009694074,0.00032286323,0.00067112246,0.00022639833],"domain_scores_gemma":[0.99787414,0.0007113846,0.00008925711,0.00077311584,0.00042525027,0.00012684855],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011219692,0.0019465615,0.0015660365,0.002128192,0.0010242269,0.0030954545,0.0038495774,0.0011342268,0.06752293],"category_scores_gemma":[0.006732198,0.0014935047,0.0016547479,0.0022664466,0.0009781249,0.0061583854,0.004295003,0.002826884,0.03409825],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0013086769,0.00025415907,0.0016194275,0.0008820151,0.00019695522,0.0003853711,0.00042326428,0.008211272,0.013676343,0.07902095,0.24666609,0.6473555],"study_design_scores_gemma":[0.0008117726,0.00035704506,0.000947965,0.000353462,0.00021718112,0.0005750856,0.00015594113,0.18593004,0.092502736,0.28253844,0.4353053,0.00030499836],"about_ca_topic_score_codex":0.0016936791,"about_ca_topic_score_gemma":0.002514313,"teacher_disagreement_score":0.06752293,"about_ca_system_score_codex":0.0010642016,"about_ca_system_score_gemma":0.0013878254,"threshold_uncertainty_score":0.2258867},"labels":[],"label_agreement":null},{"id":"W2094689345","doi":"10.1016/j.jsc.2015.03.007","title":"Algorithms to compute the topological Euler characteristic, Chern–Schwartz–MacPherson class and Segre class of projective varieties","year":2015,"lang":"en","type":"article","venue":"Journal of Symbolic Computation","topic":"Polynomial and algebraic computation","field":"Computer Science","cited_by":32,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Hypersurface; Projective space; Chern class; Class (philosophy); Euler's formula; Euler characteristic; Characteristic class; Algorithm; Pure mathematics; Variety (cybernetics); Projective test; Mathematical analysis; Artificial intelligence; Computer science","score_opus":0.035709385655562816,"score_gpt":0.28035825810946524,"score_spread":0.24464887245390243,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2094689345","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.16628093,0.00080987054,0.81607,0.00080508075,0.00019116445,0.00017818027,0.00061042514,0.0042020543,0.010852273],"genre_scores_gemma":[0.5304751,0.00038598632,0.45948246,0.00015002649,0.00018006835,0.00023782243,0.0021616365,0.00064726046,0.006279806],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99911743,0.00018454292,0.0000697187,0.00021738124,0.00026145176,0.00014954878],"domain_scores_gemma":[0.99555606,0.0025383017,0.0003316792,0.000730927,0.0005262589,0.00031675288],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017571462,0.0015674566,0.0011372274,0.0032422412,0.0011205086,0.0037657195,0.0027279377,0.0015448513,0.009973273],"category_scores_gemma":[0.010246058,0.0006830631,0.0010312005,0.0023022527,0.0014666163,0.005877897,0.0029270952,0.0024906963,0.0018599737],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.001054464,0.00053225603,0.011872671,0.00046012952,0.00026381368,0.00020448367,0.0006794216,0.14374438,0.010309082,0.28947175,0.016850185,0.5245575],"study_design_scores_gemma":[0.00023042472,0.00012597248,0.0017168156,0.000047475296,0.00007626021,0.00011725655,0.00023468594,0.5521736,0.0060010906,0.43440473,0.00482158,0.000050074377],"about_ca_topic_score_codex":0.0021405476,"about_ca_topic_score_gemma":0.005737997,"teacher_disagreement_score":0.009973273,"about_ca_system_score_codex":0.002079081,"about_ca_system_score_gemma":0.002260375,"threshold_uncertainty_score":0.03336388},"labels":[],"label_agreement":null},{"id":"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1864865,0.0020618413,0.5777446,0.005069305,0.0024849074,0.00014324469,0.0006534499,0.00036616193,0.22499],"genre_scores_gemma":[0.8405435,0.001728073,0.10830869,0.0013364393,0.0017629167,0.00022979954,0.000648125,0.00030560605,0.045136843],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99752814,0.0006751179,0.0002879764,0.00028863328,0.00092547,0.00029456726],"domain_scores_gemma":[0.99570036,0.0014504999,0.00035158132,0.00067724363,0.0012750031,0.0005452889],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005308953,0.00072411186,0.0011360109,0.003020988,0.004259996,0.006302307,0.0017474431,0.0024651552,0.008689177],"category_scores_gemma":[0.008241147,0.0007607985,0.0017173354,0.0021610053,0.005442684,0.0149359405,0.0039598905,0.004233133,0.0019820132],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000003228435,0.0000050536123,0.000035080324,0.0000046665095,0.0000013289788,0.000016850145,0.0000829853,0.000072917035,0.000064284344,0.99878544,0.00028710434,0.00064113433],"study_design_scores_gemma":[0.0000035359708,0.0000023946943,0.000024866484,0.0000036360716,0.0000017237415,0.000034863853,0.00002891244,0.0010480537,0.00006517588,0.99767584,0.0011050917,0.00000595002],"about_ca_topic_score_codex":0.0015539267,"about_ca_topic_score_gemma":0.0015872568,"teacher_disagreement_score":0.008689177,"about_ca_system_score_codex":0.001876865,"about_ca_system_score_gemma":0.0018391598,"threshold_uncertainty_score":0.029068172},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.39125583,0.0052362275,0.21798539,0.011943839,0.0016165558,0.00010083187,0.00067419535,0.0006146468,0.37057248],"genre_scores_gemma":[0.9592243,0.001672477,0.013921594,0.0006642422,0.0010852648,0.00005415328,0.00030114793,0.00010220065,0.022974694],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989544,0.00024531735,0.000058471996,0.00028308816,0.00023389803,0.00022479364],"domain_scores_gemma":[0.9981914,0.00073772663,0.0002367691,0.0003255895,0.0002466305,0.00026183616],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016406516,0.0009809331,0.001493485,0.0025454052,0.0034519716,0.0038249216,0.0010952845,0.0017551933,0.0070834244],"category_scores_gemma":[0.0044940836,0.0006745729,0.0014332604,0.002692677,0.0068490203,0.010776055,0.0043437947,0.005751223,0.0007738881],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000006951003,0.0000043739783,0.000028415223,0.0000059185454,0.000001833326,0.000020563915,0.00007920724,0.00009922287,0.000049380258,0.99866056,0.0002481581,0.0007953872],"study_design_scores_gemma":[0.000005592341,0.000002817471,0.000035469857,0.000003243452,0.000002894569,0.000040113846,0.00002710772,0.00040591322,0.000038455928,0.9977689,0.0016655239,0.0000040364453],"about_ca_topic_score_codex":0.000859332,"about_ca_topic_score_gemma":0.0007479549,"teacher_disagreement_score":0.0070834244,"about_ca_system_score_codex":0.0017476119,"about_ca_system_score_gemma":0.0007364282,"threshold_uncertainty_score":0.023696363},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01683941,0.00010311217,0.98131895,0.00007815358,0.00003102634,0.000025818219,0.000030275776,0.0003045612,0.0012686643],"genre_scores_gemma":[0.15645985,0.0002860531,0.8397036,0.000057936253,0.000051774387,0.000078360084,0.00014319271,0.00013414917,0.0030852116],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99961,0.000084975545,0.00002826305,0.00006463697,0.0001731543,0.000039065624],"domain_scores_gemma":[0.99940133,0.00023288817,0.00005391097,0.00011192047,0.00014206563,0.000057895977],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009749199,0.0006606083,0.00086817745,0.0015316176,0.0007076528,0.0012803162,0.00096970383,0.0010488844,0.0024892597],"category_scores_gemma":[0.003452634,0.0004570793,0.0006499763,0.001890709,0.00088632706,0.0020765115,0.0018810459,0.0013092858,0.0009945021],"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.00059317454,0.00017698082,0.0011352202,0.00019990928,0.00010340156,0.00015632554,0.00028715783,0.08475237,0.07306211,0.16614284,0.0032747842,0.67011577],"study_design_scores_gemma":[0.00004105567,0.0000944479,0.0002219963,0.0000115747625,0.000020466134,0.00010375972,0.000038752656,0.92806727,0.010398503,0.058811743,0.0021642207,0.000026122618],"about_ca_topic_score_codex":0.0011297656,"about_ca_topic_score_gemma":0.0012679743,"teacher_disagreement_score":0.0024892597,"about_ca_system_score_codex":0.00029776903,"about_ca_system_score_gemma":0.00079633377,"threshold_uncertainty_score":0.0083274245},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10565527,0.0009788373,0.8045323,0.0011480858,0.00043383235,0.00007307932,0.00024696163,0.000333713,0.086597934],"genre_scores_gemma":[0.7541411,0.0019108746,0.20741136,0.0004937787,0.00036668484,0.00011731515,0.0004707303,0.00055516756,0.03453297],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9996737,0.00008199886,0.000016939715,0.00006019143,0.00012365317,0.000043502485],"domain_scores_gemma":[0.99962187,0.0001254194,0.000046097433,0.00007141576,0.00007328832,0.00006186976],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00038735018,0.0005295219,0.0006035431,0.0012577167,0.00096902787,0.0018491027,0.0010614966,0.0005451618,0.0076392014],"category_scores_gemma":[0.002047438,0.00045827273,0.00062646874,0.0010916279,0.0020933691,0.0028042493,0.0036768143,0.0023922431,0.0007759975],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002430131,0.000007910395,0.00012316943,0.000037195918,0.000004718236,0.00004214367,0.000092723734,0.007360604,0.0011682293,0.976588,0.0011868299,0.013364168],"study_design_scores_gemma":[0.000012181509,0.0000227779,0.00023424547,0.000020538397,0.0000086905675,0.00011484757,0.000103752376,0.037518166,0.0012237388,0.9446403,0.01608276,0.000017999977],"about_ca_topic_score_codex":0.0015949983,"about_ca_topic_score_gemma":0.0019185169,"teacher_disagreement_score":0.0076392014,"about_ca_system_score_codex":0.00073144096,"about_ca_system_score_gemma":0.00058557256,"threshold_uncertainty_score":0.02555567},"labels":[],"label_agreement":null},{"id":"W2111878548","doi":"10.1016/j.jsc.2014.02.003","title":"On the length of integers in telescopers for proper hypergeometric terms","year":2014,"lang":"en","type":"article","venue":"Journal of Symbolic Computation","topic":"Polynomial and algebraic computation","field":"Computer Science","cited_by":12,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Capilano University; Simon Fraser University","funders":"","keywords":"Mathematics; Telescoping series; Bivariate analysis; Integer (computer science); Quintic function; Hypergeometric distribution; Combinatorics; Order (exchange); Hypergeometric identity; Upper and lower bounds; Degree (music); Term (time); Binomial (polynomial); Hypergeometric function; Discrete mathematics; Confluent hypergeometric function; Pure mathematics; Hypergeometric function of a matrix argument; Statistics; Mathematical analysis","score_opus":0.01440523090187036,"score_gpt":0.23948412278618766,"score_spread":0.22507889188431732,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2111878548","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7327075,0.0018508473,0.18023458,0.0042496272,0.00060450606,0.00015743007,0.00081011665,0.0007519965,0.078633316],"genre_scores_gemma":[0.9607653,0.0008885561,0.021076499,0.0004537368,0.00046792705,0.00012766472,0.00049013674,0.00041751767,0.015312624],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99713445,0.0008171799,0.00023222834,0.00037965013,0.0006974133,0.00073908793],"domain_scores_gemma":[0.98409826,0.010497492,0.0019382477,0.0012257003,0.0010781812,0.0011620622],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004400167,0.0010737466,0.0015896382,0.00391237,0.003433299,0.006503172,0.0026592088,0.00245694,0.011781162],"category_scores_gemma":[0.023660263,0.0009839358,0.0014917878,0.0027034457,0.0070135454,0.015360429,0.004529672,0.00443918,0.0013757999],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000345835,0.00004562034,0.0013034188,0.00009329494,0.000016796092,0.00015074504,0.0007609299,0.0038478149,0.0014358927,0.9844237,0.0013735241,0.006202343],"study_design_scores_gemma":[0.000043170174,0.000036409343,0.0004355619,0.00007526011,0.000030416677,0.00008168713,0.00024397137,0.013882332,0.0011773705,0.9818308,0.0021164697,0.00004647509],"about_ca_topic_score_codex":0.0021435684,"about_ca_topic_score_gemma":0.0029749067,"teacher_disagreement_score":0.011781162,"about_ca_system_score_codex":0.0039654085,"about_ca_system_score_gemma":0.002085735,"threshold_uncertainty_score":0.039411902},"labels":[],"label_agreement":null},{"id":"W2112151791","doi":"10.1016/j.jsc.2012.05.013","title":"Computing with semi-algebraic sets: Relaxation techniques and effective boundaries","year":2012,"lang":"en","type":"article","venue":"Journal of Symbolic Computation","topic":"Polynomial and algebraic computation","field":"Computer Science","cited_by":12,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"","keywords":"Mathematics; Algebraic number; Parametric statistics; Relaxation (psychology); Chen; Decomposition; Boundary (topology); Polynomial; Characterization (materials science); Algebraic properties; Real algebraic geometry; Algebra over a field; Discrete mathematics; Pure mathematics; Mathematical analysis","score_opus":0.006640947570208393,"score_gpt":0.24592998221887238,"score_spread":0.239289034648664,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2112151791","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04099223,0.0003638713,0.94016457,0.0005375764,0.00008461782,0.000039790844,0.00007030609,0.00028096433,0.01746611],"genre_scores_gemma":[0.5787966,0.00047293163,0.41485092,0.00022165384,0.000107062144,0.00014323137,0.00025651188,0.00041108922,0.0047398913],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985789,0.0004875494,0.000107857246,0.00022400306,0.00039421552,0.00020741609],"domain_scores_gemma":[0.99647176,0.0020853404,0.00016965721,0.0008160222,0.0003044847,0.00015279077],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002068276,0.0006323457,0.0010589357,0.0010039633,0.0014203123,0.0029319867,0.002244292,0.0010276571,0.006004705],"category_scores_gemma":[0.00981788,0.00070477766,0.0010292395,0.0011931396,0.0029783414,0.008088767,0.0042507844,0.0041398164,0.0007797891],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001602036,0.00005900602,0.00021020403,0.00014704572,0.000019793873,0.000038990926,0.0003319144,0.06201355,0.002255488,0.8928128,0.0013187618,0.04063237],"study_design_scores_gemma":[0.000029455236,0.000027721848,0.000055510758,0.000048970232,0.000013172091,0.000028377573,0.00009923647,0.21848619,0.003267677,0.77458566,0.0033448185,0.00001321031],"about_ca_topic_score_codex":0.0008598059,"about_ca_topic_score_gemma":0.0012605818,"teacher_disagreement_score":0.006004705,"about_ca_system_score_codex":0.0011436779,"about_ca_system_score_gemma":0.0010033313,"threshold_uncertainty_score":0.020087719},"labels":[],"label_agreement":null},{"id":"W2113737071","doi":"10.1016/j.jsc.2010.08.014","title":"Sparse polynomial division using a heap","year":2010,"lang":"en","type":"article","venue":"Journal of Symbolic Computation","topic":"Polynomial and algebraic computation","field":"Computer Science","cited_by":43,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Heap (data structure); Mathematics; Maple; Multiplication (music); Polynomial; Division (mathematics); Discrete mathematics; Algebra over a field; Arithmetic; Combinatorics; Algorithm; Pure mathematics","score_opus":0.018389445446087435,"score_gpt":0.2752023028350068,"score_spread":0.25681285738891935,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2113737071","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12721041,0.0008545148,0.83492315,0.0005095376,0.0003439067,0.00013035262,0.0004567252,0.008161889,0.02740951],"genre_scores_gemma":[0.57021254,0.00042377118,0.41066822,0.00023078875,0.00020297464,0.00011954702,0.0005325429,0.00070015795,0.016909469],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99943703,0.000089811525,0.00004840267,0.00011907312,0.00016781835,0.00013785811],"domain_scores_gemma":[0.99874496,0.00038558894,0.00006683956,0.00058508234,0.00014157886,0.00007601905],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005263752,0.00048598988,0.0010986935,0.001267184,0.0014029425,0.0019454955,0.0014586868,0.00064524106,0.0110582495],"category_scores_gemma":[0.0020153623,0.0004777541,0.0006589517,0.0028260723,0.000904327,0.00488132,0.0035548918,0.00086386537,0.0019561166],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0020157965,0.00034536832,0.0020627782,0.00043544208,0.00010477464,0.00023179811,0.0005195174,0.017923791,0.038753703,0.3392244,0.018367453,0.5800151],"study_design_scores_gemma":[0.00066386274,0.0005353247,0.0012280125,0.00016209664,0.00033654764,0.00051739905,0.0003486525,0.22357178,0.098838374,0.5995222,0.074139446,0.000136341],"about_ca_topic_score_codex":0.0015207292,"about_ca_topic_score_gemma":0.004194491,"teacher_disagreement_score":0.0110582495,"about_ca_system_score_codex":0.00094089593,"about_ca_system_score_gemma":0.0014387594,"threshold_uncertainty_score":0.036993504},"labels":[],"label_agreement":null},{"id":"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.73376817,0.000833373,0.24641304,0.0014937407,0.00017936587,0.000115548384,0.0003809208,0.0009871688,0.015828548],"genre_scores_gemma":[0.96327347,0.00012712358,0.033482097,0.000110618384,0.000056448363,0.000021761412,0.00014197506,0.00010680191,0.0026796611],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9977647,0.000440878,0.00017137208,0.00048537855,0.00071508967,0.00042252944],"domain_scores_gemma":[0.9887944,0.0067775827,0.0009789171,0.002050871,0.00092005526,0.00047824657],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017222671,0.0007999296,0.0011676007,0.002103402,0.0013150739,0.002968436,0.0013648096,0.0013391007,0.004425051],"category_scores_gemma":[0.02206278,0.00063097547,0.0005266477,0.0014707331,0.0037680476,0.007533742,0.0038006161,0.0018437499,0.0009731241],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0031911933,0.00024784528,0.021265056,0.00053629786,0.00015103826,0.0015033423,0.0025025448,0.028220365,0.04406044,0.624843,0.00598906,0.26748976],"study_design_scores_gemma":[0.00011191512,0.00021011721,0.0012517301,0.00007370871,0.00005698517,0.0005624358,0.0006494568,0.061385397,0.02334451,0.9082269,0.004075486,0.000051289906],"about_ca_topic_score_codex":0.0006179284,"about_ca_topic_score_gemma":0.0010055983,"teacher_disagreement_score":0.004425051,"about_ca_system_score_codex":0.0009423515,"about_ca_system_score_gemma":0.0010324533,"threshold_uncertainty_score":0.01480329},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04025646,0.00013617973,0.93057317,0.00042935222,0.00014491807,0.000116142604,0.000074366006,0.0006401315,0.027629323],"genre_scores_gemma":[0.6144892,0.00020649288,0.3728006,0.00019157265,0.00013569387,0.00017331394,0.00020923304,0.00042518266,0.011368814],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99939334,0.0001853706,0.000029501743,0.000077996665,0.00023382746,0.0000798581],"domain_scores_gemma":[0.99937785,0.00036178995,0.00003061975,0.000118478536,0.00009087183,0.0000203611],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004964293,0.0006499586,0.0009896165,0.0006866424,0.0010026094,0.0015008828,0.0011061961,0.0006375141,0.0091535505],"category_scores_gemma":[0.0032564094,0.000380457,0.0008838982,0.00072248065,0.0020086188,0.0014605318,0.0022678387,0.0019133104,0.0012423001],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000090305955,0.0001340208,0.00046865508,0.00021997117,0.00003630343,0.00014707728,0.00040719108,0.17820224,0.0029340652,0.6903454,0.00436516,0.12264964],"study_design_scores_gemma":[0.000052571708,0.000044903285,0.00008286038,0.000024086947,0.000019773854,0.000042116568,0.00013148187,0.4951004,0.0025805803,0.4963833,0.0055256276,0.000012275782],"about_ca_topic_score_codex":0.0017791291,"about_ca_topic_score_gemma":0.0039193016,"teacher_disagreement_score":0.0091535505,"about_ca_system_score_codex":0.00068978505,"about_ca_system_score_gemma":0.0010370081,"threshold_uncertainty_score":0.030621648},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.054743506,0.0005804217,0.9287015,0.000928527,0.00020028044,0.00012787363,0.00010279776,0.001277149,0.01333784],"genre_scores_gemma":[0.56650007,0.0004937786,0.41168636,0.00063681614,0.0003515193,0.0003311226,0.00057935837,0.0013860236,0.0180349],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9926893,0.0032096761,0.00031693187,0.0006007285,0.002253602,0.0009296925],"domain_scores_gemma":[0.93381387,0.052937143,0.0013665366,0.0062001697,0.004560005,0.001122317],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.01107273,0.001006718,0.002356837,0.0019967204,0.0022572728,0.0033339413,0.0026203415,0.0021456643,0.008055851],"category_scores_gemma":[0.062063877,0.0012080116,0.00144757,0.002361052,0.004121991,0.0078050694,0.0059655886,0.0074492046,0.0017191374],"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.0030454248,0.00046280894,0.0050847386,0.00044193596,0.00008663573,0.0002946143,0.0014580983,0.09488606,0.0070316102,0.642604,0.01164925,0.23295484],"study_design_scores_gemma":[0.00014274838,0.00017326216,0.00028504228,0.00006114896,0.0000448288,0.00008168616,0.00011439415,0.49441424,0.007412942,0.49389064,0.003354341,0.000024723216],"about_ca_topic_score_codex":0.0018882765,"about_ca_topic_score_gemma":0.0034159622,"teacher_disagreement_score":0.01107273,"about_ca_system_score_codex":0.0018516664,"about_ca_system_score_gemma":0.0024090698,"threshold_uncertainty_score":0.05855888},"labels":[],"label_agreement":null},{"id":"W2127412655","doi":"10.1006/jsco.2000.0370","title":"Challenges of Symbolic Computation: My Favorite Open Problems","year":2000,"lang":"en","type":"article","venue":"Journal of Symbolic Computation","topic":"Polynomial and algebraic computation","field":"Computer Science","cited_by":82,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Simon Fraser University","keywords":"Symbolic computation; Symbolic-numeric computation; The Symbolic; Computation; Computer science; Mathematics; Theoretical computer science; Algebra over a field; Programming language; Pure mathematics","score_opus":0.03688501806389176,"score_gpt":0.2866758961192889,"score_spread":0.24979087805539713,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2127412655","genre_codex":"commentary","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0056006243,0.066710256,0.038881518,0.816498,0.011798443,0.00002355356,0.0002675065,0.00018591087,0.060034126],"genre_scores_gemma":[0.41370195,0.15485723,0.081459604,0.10709026,0.15352295,0.00042113225,0.0011130293,0.0006645457,0.08716927],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9978144,0.00086226116,0.00008005728,0.0003388292,0.00066657644,0.00023778102],"domain_scores_gemma":[0.9856286,0.00988713,0.00035949788,0.0011094413,0.0019110978,0.0011042769],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.006080948,0.00080996775,0.0014207326,0.0012251566,0.0038032546,0.008712415,0.0021917524,0.005683269,0.014763343],"category_scores_gemma":[0.022172725,0.00048015965,0.0008091053,0.0013387608,0.012257244,0.024034755,0.004768551,0.01215737,0.003827157],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000058668855,0.00008410958,0.0002119257,0.00018774698,0.000016223798,0.00004674916,0.00035167392,0.0010360283,0.00012094512,0.82614714,0.12886003,0.04287875],"study_design_scores_gemma":[0.000014395836,0.000008686443,0.00004831417,0.000079080884,0.000002298037,0.000033979264,0.00031640232,0.0010241678,0.000047304697,0.94655395,0.051860515,0.000010892829],"about_ca_topic_score_codex":0.0012520083,"about_ca_topic_score_gemma":0.0012329087,"teacher_disagreement_score":0.014763343,"about_ca_system_score_codex":0.0022422173,"about_ca_system_score_gemma":0.0031373,"threshold_uncertainty_score":0.04938835},"labels":[],"label_agreement":null},{"id":"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":"empirical","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.68286663,0.002914603,0.15409957,0.003985941,0.0008538221,0.000094065785,0.0003913594,0.0015918657,0.15320206],"genre_scores_gemma":[0.9637616,0.00084237155,0.0153657505,0.0001759312,0.00046574714,0.000047401347,0.00017728737,0.0002187821,0.018945135],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9989962,0.00022333737,0.00005666651,0.00014283368,0.0003743437,0.00020663762],"domain_scores_gemma":[0.99763525,0.0010888083,0.00029825125,0.00044291557,0.0003229638,0.00021170267],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011652751,0.0011672354,0.0012460224,0.0058586523,0.0024550813,0.0041664164,0.0012294732,0.001545662,0.0077729127],"category_scores_gemma":[0.005973327,0.00052684004,0.00074948254,0.0039785835,0.0038857185,0.00572118,0.0024001948,0.0021725614,0.0011382386],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00018628965,0.000040873376,0.0027680562,0.00011399219,0.000019745348,0.000326136,0.000578841,0.0047666887,0.002433659,0.95195746,0.0056039724,0.031204222],"study_design_scores_gemma":[0.000014044416,0.000026624182,0.00088954665,0.000041236497,0.000028936984,0.00034070923,0.00009231425,0.0122349765,0.0022346594,0.9786112,0.005461985,0.000023824829],"about_ca_topic_score_codex":0.0007535298,"about_ca_topic_score_gemma":0.0009413317,"teacher_disagreement_score":0.0077729127,"about_ca_system_score_codex":0.0017419943,"about_ca_system_score_gemma":0.00067705195,"threshold_uncertainty_score":0.026003003},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10103761,0.005744158,0.7746635,0.0037746176,0.0066264705,0.00017825066,0.00022413104,0.00051540945,0.10723581],"genre_scores_gemma":[0.42575586,0.0074597863,0.39794707,0.0013161656,0.0037036014,0.00045300313,0.0006401236,0.0008067425,0.16191763],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99966085,0.00009089592,0.000030978143,0.000037061138,0.00014738197,0.000032812623],"domain_scores_gemma":[0.99930215,0.00023350686,0.00007379487,0.000066777495,0.00020545842,0.0001182764],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008044572,0.00078610296,0.000884196,0.0019292599,0.0009183931,0.0019529706,0.001173513,0.0014519057,0.009194249],"category_scores_gemma":[0.0040775007,0.00052941643,0.0009730397,0.00091793726,0.0015789218,0.0030717172,0.0022610615,0.0022924175,0.0013342979],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000041814805,0.000044187986,0.00016394406,0.00013280737,0.000021705446,0.00012767914,0.00020495433,0.004668978,0.003248056,0.96276987,0.0034325977,0.025143519],"study_design_scores_gemma":[0.00005339272,0.00003105413,0.00017743968,0.000048515787,0.000020872589,0.00022532359,0.00009862979,0.09240999,0.0013679301,0.8854198,0.02011571,0.00003126279],"about_ca_topic_score_codex":0.00029123065,"about_ca_topic_score_gemma":0.00056224165,"teacher_disagreement_score":0.009194249,"about_ca_system_score_codex":0.00060145283,"about_ca_system_score_gemma":0.0005978634,"threshold_uncertainty_score":0.030757844},"labels":[],"label_agreement":null},{"id":"W2136692263","doi":"10.1016/j.jsc.2008.04.020","title":"Implicit Riquier Bases for PDAE and their semi-discretizations","year":2008,"lang":"en","type":"article","venue":"Journal of Symbolic Computation","topic":"Polynomial and algebraic computation","field":"Computer Science","cited_by":12,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto; Western University","funders":"Natural Sciences and Engineering Research Council of Canada; National Science Foundation","keywords":"Mathematics; Algebra over a field; Pure mathematics; Calculus (dental)","score_opus":0.016961552615715466,"score_gpt":0.24801522430343043,"score_spread":0.23105367168771496,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2136692263","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05503716,0.0009364743,0.8928487,0.00038459394,0.0003000697,0.00006950667,0.0002696506,0.00027270685,0.04988118],"genre_scores_gemma":[0.676807,0.0012447108,0.2797617,0.00021590567,0.00014835784,0.00017265933,0.00043301057,0.00037320316,0.040843412],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99969935,0.00008167162,0.000018891364,0.00003116038,0.00012490508,0.000044003646],"domain_scores_gemma":[0.9996195,0.00012603178,0.000030001936,0.0001019861,0.0000819891,0.00004040298],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00065169507,0.0004992916,0.0008060003,0.0008580164,0.0007225003,0.0021039466,0.0012449186,0.0008565832,0.006902639],"category_scores_gemma":[0.0023912305,0.0003431508,0.00056767976,0.0007702586,0.0013124007,0.0020344723,0.0015734994,0.0023983675,0.0014523136],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000033207398,0.000025840547,0.000105423846,0.000042129966,0.000007021567,0.000028449662,0.00011422084,0.02303644,0.00087498483,0.95913213,0.00083120697,0.015768958],"study_design_scores_gemma":[0.000032556014,0.000019929086,0.000084916464,0.00003964287,0.000007863993,0.000044974284,0.0000897013,0.34834054,0.001266962,0.63971424,0.01033836,0.000020303092],"about_ca_topic_score_codex":0.0015879091,"about_ca_topic_score_gemma":0.0028480294,"teacher_disagreement_score":0.006902639,"about_ca_system_score_codex":0.00064994814,"about_ca_system_score_gemma":0.0005692442,"threshold_uncertainty_score":0.023091614},"labels":[],"label_agreement":null},{"id":"W2141336296","doi":"10.1016/j.jsc.2006.02.001","title":"Normal forms for general polynomial matrices","year":2006,"lang":"en","type":"article","venue":"Journal of Symbolic Computation","topic":"Polynomial and algebraic computation","field":"Computer Science","cited_by":54,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Mathematics; Matrix polynomial; Polynomial matrix; Matrix (chemical analysis); Computation; Hermite polynomials; Polynomial; Algebra over a field; Pure mathematics; Discrete mathematics; Mathematical analysis; Algorithm","score_opus":0.00823453275827883,"score_gpt":0.24276188508145452,"score_spread":0.2345273523231757,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2141336296","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.26744777,0.0009777058,0.49457988,0.0034210158,0.001697055,0.0003473098,0.0010622056,0.0012644716,0.22920263],"genre_scores_gemma":[0.8407971,0.0010742901,0.056469917,0.00058535003,0.00095034565,0.00024263599,0.0009443094,0.00061173335,0.09832419],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99884343,0.00024686762,0.00007488842,0.00023530968,0.00041534647,0.00018420363],"domain_scores_gemma":[0.9982962,0.0005025465,0.00016425515,0.00023492119,0.000565563,0.00023665285],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011926406,0.0013571604,0.0009155366,0.0025061818,0.0016273722,0.00449518,0.0011632052,0.0012087311,0.018577289],"category_scores_gemma":[0.004815165,0.0006349988,0.0007921325,0.0018650264,0.0032639974,0.0074493177,0.0019251214,0.0028574455,0.003480646],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000027869593,0.000024305858,0.0000841073,0.000014879455,0.0000031518,0.000045112614,0.00018192749,0.000413263,0.0005081046,0.99084395,0.0016283033,0.006224982],"study_design_scores_gemma":[0.000010806419,0.000011064565,0.000036616122,0.0000040784535,0.0000020087175,0.00006758181,0.000049017977,0.0030103435,0.0002722729,0.9941723,0.0023541893,0.0000098162345],"about_ca_topic_score_codex":0.0013346391,"about_ca_topic_score_gemma":0.0017925731,"teacher_disagreement_score":0.018577289,"about_ca_system_score_codex":0.0015713755,"about_ca_system_score_gemma":0.0010455303,"threshold_uncertainty_score":0.0621472},"labels":[],"label_agreement":null},{"id":"W2145025251","doi":"10.1016/j.jsc.2009.05.003","title":"Automatic computation of the complete root classification for a parametric polynomial","year":2009,"lang":"en","type":"article","venue":"Journal of Symbolic Computation","topic":"Polynomial and algebraic computation","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"","keywords":"Mathematics; Discriminant; Sign (mathematics); Root (linguistics); Computation; Positive definiteness; Polynomial; Parametric statistics; Sequence (biology); Characteristic polynomial; Class (philosophy); Linear discriminant analysis; Algorithm; Combinatorics; Discrete mathematics; Artificial intelligence; Positive-definite matrix; Mathematical analysis; Statistics; Computer science; Eigenvalues and eigenvectors","score_opus":0.03063142354722671,"score_gpt":0.2820513312423598,"score_spread":0.2514199076951331,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2145025251","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.29261008,0.00032941968,0.6810101,0.0005659083,0.00016534401,0.00014145172,0.0011728219,0.006589201,0.017415639],"genre_scores_gemma":[0.7475825,0.00008569995,0.2445843,0.00008904181,0.000072224975,0.0000601273,0.0019073142,0.00076631026,0.0048525482],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9993036,0.00008805996,0.00003870305,0.00018899352,0.0002616621,0.00011897923],"domain_scores_gemma":[0.99807966,0.00084113237,0.00012078582,0.00048112293,0.0003729207,0.00010448298],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005280159,0.0007420548,0.0012938743,0.001613602,0.0012485512,0.0026622089,0.0013924834,0.0009777141,0.011472133],"category_scores_gemma":[0.0042826943,0.0004134718,0.000999635,0.0011997346,0.001116523,0.0030721785,0.0023691752,0.0015908767,0.0024282283],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.001012584,0.00027121443,0.004823807,0.00067577645,0.00011301249,0.00039503135,0.0007150938,0.037990645,0.03787111,0.2396989,0.02604143,0.6503914],"study_design_scores_gemma":[0.00019063713,0.00018722983,0.0018359842,0.00006711812,0.00010037023,0.00030507758,0.00038365115,0.43692362,0.029010225,0.5153572,0.015561562,0.00007727091],"about_ca_topic_score_codex":0.0011597157,"about_ca_topic_score_gemma":0.0027879686,"teacher_disagreement_score":0.011472133,"about_ca_system_score_codex":0.0010346127,"about_ca_system_score_gemma":0.0013242321,"threshold_uncertainty_score":0.03837812},"labels":[],"label_agreement":null},{"id":"W2150928761","doi":"10.1016/j.jsc.2011.12.014","title":"Triangular decomposition of semi-algebraic systems","year":2011,"lang":"en","type":"article","venue":"Journal of Symbolic Computation","topic":"Polynomial and algebraic computation","field":"Computer Science","cited_by":57,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"","keywords":"Decomposition; Mathematics; Algebraic number; Polynomial; Exponential function; Algebra over a field; Triangular matrix; Discrete mathematics; Algorithm; Pure mathematics; Mathematical analysis","score_opus":0.02228769174550693,"score_gpt":0.2552590522068215,"score_spread":0.23297136046131456,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2150928761","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.25750527,0.00041730874,0.62179095,0.00062080665,0.00031896302,0.00014295263,0.00075364806,0.00047521904,0.117975004],"genre_scores_gemma":[0.91551733,0.00031189926,0.052701563,0.00016818619,0.00015468172,0.00009668534,0.00081813557,0.00015620192,0.030075332],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99959356,0.00006568372,0.000028608256,0.000063391184,0.00014462309,0.00010412619],"domain_scores_gemma":[0.99919635,0.00018749478,0.000078642755,0.000112216825,0.0003070596,0.00011831701],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00046664182,0.00036137176,0.0006089674,0.00094188075,0.00077437237,0.0020421874,0.00064435095,0.00043816713,0.019021297],"category_scores_gemma":[0.0012838263,0.00022317322,0.00058117806,0.0006489241,0.0013470639,0.0015313092,0.0008944998,0.0011858739,0.0017280517],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005078852,0.000028858229,0.00015955331,0.00003191124,0.000008176863,0.00005099552,0.00021745152,0.005029409,0.0017153948,0.98223084,0.0017185543,0.008758005],"study_design_scores_gemma":[0.000016248387,0.000024897812,0.00012188406,0.000010872238,0.000006921216,0.000044303153,0.00012520346,0.065114945,0.00076852186,0.930144,0.0036118117,0.000010249683],"about_ca_topic_score_codex":0.0022727933,"about_ca_topic_score_gemma":0.003165529,"teacher_disagreement_score":0.019021297,"about_ca_system_score_codex":0.00089373434,"about_ca_system_score_gemma":0.0007656198,"threshold_uncertainty_score":0.06363261},"labels":[],"label_agreement":null},{"id":"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009035482,0.0006137834,0.9805283,0.0003979597,0.00019155507,0.000052933774,0.00007266728,0.00033652803,0.008770661],"genre_scores_gemma":[0.13194248,0.0008461079,0.8534581,0.00032010107,0.00017785691,0.00023636708,0.00023843459,0.000478608,0.012301943],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991591,0.00031904457,0.000043748205,0.00012532224,0.00028283254,0.000069998896],"domain_scores_gemma":[0.99861,0.0008377069,0.000053261832,0.00020896686,0.00023557284,0.00005446643],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015911548,0.0009508477,0.0011511538,0.0023178922,0.0011907547,0.0013814094,0.0023975018,0.0012605008,0.008430359],"category_scores_gemma":[0.00810059,0.00047795955,0.0010534835,0.002536941,0.0022026603,0.0033538837,0.0026989037,0.0029482518,0.0023692201],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00027831848,0.000075501324,0.00051734934,0.00028062044,0.00007188368,0.000079553334,0.0002506844,0.079585835,0.0058807554,0.59596574,0.007325286,0.30968845],"study_design_scores_gemma":[0.00006990168,0.00007370848,0.00023868159,0.00005126231,0.000030004618,0.000095793985,0.000057287783,0.41899297,0.004065031,0.5634351,0.01283458,0.000055752702],"about_ca_topic_score_codex":0.0030458956,"about_ca_topic_score_gemma":0.004375765,"teacher_disagreement_score":0.008430359,"about_ca_system_score_codex":0.0012904229,"about_ca_system_score_gemma":0.0016011144,"threshold_uncertainty_score":0.028202355},"labels":[],"label_agreement":null},{"id":"W2153131327","doi":"10.1016/j.jsc.2011.08.015","title":"Homotopy techniques for multiplication modulo triangular sets","year":2011,"lang":"en","type":"article","venue":"Journal of Symbolic Computation","topic":"Polynomial and algebraic computation","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"","keywords":"Mathematics; Modulo; Multiplication (music); Homotopy; Algebraic number; Algebra over a field; Interpolation (computer graphics); Discrete mathematics; Arithmetic; Combinatorics; Pure mathematics; Mathematical analysis","score_opus":0.03262150932117265,"score_gpt":0.2785053708529415,"score_spread":0.2458838615317689,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2153131327","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.057878062,0.0013632233,0.8318752,0.0014213095,0.0009736723,0.000086206244,0.00014140579,0.000863544,0.10539737],"genre_scores_gemma":[0.6477078,0.0021065515,0.28216666,0.00058127096,0.0008006743,0.00020354892,0.00030839493,0.00073371665,0.065391384],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99951744,0.00011692363,0.00003402016,0.00008693701,0.00017139994,0.000073131116],"domain_scores_gemma":[0.99919206,0.00039403627,0.000037976653,0.00017981457,0.00013243404,0.00006360038],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007957318,0.00080882624,0.0008522454,0.002346368,0.0018789155,0.002004098,0.001345148,0.0008915424,0.018263783],"category_scores_gemma":[0.002843241,0.0004756754,0.0011490438,0.0023909723,0.0026399437,0.0065877116,0.0029625597,0.004009638,0.0026475654],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000021910966,0.000018583665,0.00006439488,0.00003310461,0.00000645024,0.000039073224,0.00026202205,0.00074303726,0.0008569561,0.9747338,0.0013170881,0.021903569],"study_design_scores_gemma":[0.000007652618,0.00001154331,0.000039988776,0.000011666199,0.0000062290974,0.00003010872,0.000061766295,0.005220023,0.00056454266,0.9893299,0.0047086873,0.000007874046],"about_ca_topic_score_codex":0.0013176227,"about_ca_topic_score_gemma":0.0018934861,"teacher_disagreement_score":0.018263783,"about_ca_system_score_codex":0.0011509893,"about_ca_system_score_gemma":0.00051431987,"threshold_uncertainty_score":0.061098456},"labels":[],"label_agreement":null},{"id":"W2158079656","doi":"10.1016/j.jsc.2007.03.001","title":"Output-sensitive modular algorithms for polynomial matrix normal forms","year":2007,"lang":"en","type":"article","venue":"Journal of Symbolic Computation","topic":"Polynomial and algebraic computation","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo; University of Lethbridge","funders":"","keywords":"Mathematics; Unimodular matrix; Polynomial matrix; Algorithm; Matrix multiplication; Polynomial; Normalization (sociology); Modular arithmetic; Matrix (chemical analysis); Homomorphism; Integer matrix; Matrix polynomial; Algebra over a field; Discrete mathematics; Combinatorics; Pure mathematics; Symmetric matrix; Eigenvalues and eigenvectors","score_opus":0.016271988497507783,"score_gpt":0.2861105198451552,"score_spread":0.2698385313476474,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2158079656","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.059687473,0.00025744003,0.9250386,0.0006281934,0.00016010461,0.00013758868,0.00022779817,0.0034033898,0.010459406],"genre_scores_gemma":[0.68052405,0.0002808397,0.3034808,0.0004392257,0.00029340724,0.00021708815,0.0008266762,0.0012570588,0.0126809515],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9961111,0.00091422437,0.00024383048,0.00066351146,0.0013675981,0.0006997653],"domain_scores_gemma":[0.9916545,0.003397443,0.00045339068,0.0030846372,0.0011246742,0.0002853793],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0027057158,0.0013967268,0.0012965266,0.0013953018,0.0012718479,0.0036850243,0.002582331,0.0012359134,0.013048525],"category_scores_gemma":[0.013643214,0.00083071645,0.0014455534,0.0016028625,0.0017681943,0.007752037,0.0064221793,0.0032955927,0.0032269384],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.001814799,0.0004111614,0.0024226194,0.00032035183,0.00013464162,0.00017324969,0.00057618355,0.05077999,0.016781192,0.52185357,0.012992185,0.39174014],"study_design_scores_gemma":[0.00022725968,0.00018865264,0.00034884157,0.000052294356,0.00009369886,0.00013870912,0.00010663949,0.27800447,0.024106516,0.6921076,0.0045729964,0.000052332074],"about_ca_topic_score_codex":0.0006591128,"about_ca_topic_score_gemma":0.0016707607,"teacher_disagreement_score":0.013048525,"about_ca_system_score_codex":0.0018282788,"about_ca_system_score_gemma":0.0017950644,"threshold_uncertainty_score":0.0436517},"labels":[],"label_agreement":null},{"id":"W2159212455","doi":"10.1016/j.jsc.2009.09.004","title":"Computing differential characteristic sets by change of ordering","year":2009,"lang":"en","type":"article","venue":"Journal of Symbolic Computation","topic":"Polynomial and algebraic computation","field":"Computer Science","cited_by":26,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"","keywords":"Mathematics; Prime (order theory); Ideal (ethics); Set (abstract data type); Differential (mechanical device); Ranking (information retrieval); Prime ideal; Software; Algorithm; Discrete mathematics; Algebra over a field; Combinatorics; Pure mathematics; Computer science; Programming language; Artificial intelligence","score_opus":0.018335059526763925,"score_gpt":0.2645680777233865,"score_spread":0.24623301819662255,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2159212455","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.48635408,0.0004564078,0.48547834,0.00063767476,0.00021080406,0.00008571687,0.0004789537,0.001709285,0.024588715],"genre_scores_gemma":[0.8982233,0.00021835534,0.09543778,0.000107519634,0.00008286775,0.000026610995,0.0005135089,0.00028724066,0.0051028593],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99898285,0.00011727552,0.000072237846,0.00023796933,0.00037871444,0.00021093554],"domain_scores_gemma":[0.9973627,0.0011541378,0.00018585126,0.0007115037,0.00037334932,0.00021250015],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008511275,0.0004932203,0.0009520702,0.0025910076,0.0010554323,0.0034387803,0.0012220948,0.00045681314,0.006008788],"category_scores_gemma":[0.00508077,0.00056168536,0.0008778032,0.002727879,0.002944198,0.0073230937,0.002778724,0.0017426767,0.00089372875],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000525464,0.00015837666,0.008671269,0.00016836615,0.000047457932,0.00028256953,0.001000581,0.016933812,0.008544877,0.795216,0.0040289415,0.16442217],"study_design_scores_gemma":[0.000040453862,0.00005387615,0.00086029375,0.000018964105,0.00003692718,0.00012653561,0.00020573947,0.03365973,0.0063625146,0.9532739,0.0053288527,0.000032327214],"about_ca_topic_score_codex":0.0021052114,"about_ca_topic_score_gemma":0.0032218057,"teacher_disagreement_score":0.006008788,"about_ca_system_score_codex":0.0017783339,"about_ca_system_score_gemma":0.00090112607,"threshold_uncertainty_score":0.020101368},"labels":[],"label_agreement":null},{"id":"W2162009465","doi":"10.1016/s0747-7171(03)00090-7","title":"Factoring systems of linear PDEs with finite-dimensional solution spaces","year":2003,"lang":"en","type":"article","venue":"Journal of Symbolic Computation","topic":"Polynomial and algebraic computation","field":"Computer Science","cited_by":40,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Mathematics; Dimension (graph theory); Finite set; Partial differential equation; Rational function; Space (punctuation); Linear system; Function (biology); Finite difference; Mathematical analysis; Applied mathematics; Pure mathematics","score_opus":0.019024809200461894,"score_gpt":0.2428876335570685,"score_spread":0.2238628243566066,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2162009465","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.14360675,0.00062090287,0.83495474,0.00048242632,0.00023752073,0.00009221881,0.00015837251,0.0007453727,0.019101797],"genre_scores_gemma":[0.8266672,0.0005929821,0.15476368,0.00014909921,0.00019669444,0.00011763343,0.0003718973,0.00031135982,0.016829452],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.999154,0.00021984434,0.00007042957,0.00016645854,0.00024188252,0.00014742094],"domain_scores_gemma":[0.99845326,0.0006227743,0.00020632845,0.00023718517,0.00032263057,0.00015784366],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010260683,0.0008773165,0.0010239864,0.0010999532,0.00097306893,0.0027567137,0.0010653224,0.001106779,0.009943636],"category_scores_gemma":[0.0044610216,0.0005414235,0.0011153963,0.0006987473,0.0027515457,0.0034229318,0.0031916578,0.0014971736,0.0010998029],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013484551,0.000089250265,0.0007633911,0.00012911449,0.00005113314,0.00018314659,0.00047766737,0.06708095,0.0049322774,0.88274866,0.001767205,0.041642413],"study_design_scores_gemma":[0.00004581912,0.00006999933,0.00018034127,0.000026215177,0.000021341424,0.000080307465,0.00014660328,0.2660859,0.0024524122,0.72512054,0.0057405964,0.000029867406],"about_ca_topic_score_codex":0.0022679735,"about_ca_topic_score_gemma":0.002606544,"teacher_disagreement_score":0.009943636,"about_ca_system_score_codex":0.0012526225,"about_ca_system_score_gemma":0.0007738309,"threshold_uncertainty_score":0.033264756},"labels":[],"label_agreement":null},{"id":"W2165225265","doi":"10.1016/j.jsc.2005.05.009","title":"Computation of unirational fields","year":2006,"lang":"en","type":"article","venue":"Journal of Symbolic Computation","topic":"Polynomial and algebraic computation","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Mathematics; Factoring; Algebraic number; Algebra over a field; Field (mathematics); Computation; Extension (predicate logic); Field extension; Zero (linguistics); Pure mathematics; Algorithm; Computer science; Mathematical analysis","score_opus":0.010409715088580497,"score_gpt":0.24192445726325396,"score_spread":0.23151474217467347,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2165225265","genre_codex":"empirical","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.63265544,0.0018861005,0.24923043,0.0012656999,0.00043613432,0.00009135859,0.00044439838,0.0016696941,0.11232081],"genre_scores_gemma":[0.9308961,0.000374648,0.056584194,0.0001360268,0.00012154182,0.000023614257,0.00027722857,0.00015291396,0.011433717],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9993554,0.00015955811,0.0000467941,0.0001356555,0.00016849143,0.00013414862],"domain_scores_gemma":[0.9986388,0.00065415195,0.00010869809,0.00030604802,0.00020109935,0.00009122239],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012062157,0.00049336744,0.00065378536,0.0012360351,0.0010422524,0.0023021146,0.0010579188,0.00052934856,0.010604169],"category_scores_gemma":[0.0037471608,0.00029239914,0.0007129065,0.0012615402,0.0016095549,0.005453755,0.0017297156,0.0011716445,0.0011919689],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003295247,0.00007012982,0.0012964896,0.00019993204,0.000025536054,0.00018008311,0.00044906806,0.008463919,0.003908451,0.9059788,0.0032917932,0.07580635],"study_design_scores_gemma":[0.000042219355,0.000060046274,0.00043012475,0.000046495003,0.000028042386,0.00014554728,0.00012119066,0.03159548,0.007818716,0.950029,0.009655645,0.000027522037],"about_ca_topic_score_codex":0.0008219222,"about_ca_topic_score_gemma":0.0016919619,"teacher_disagreement_score":0.010604169,"about_ca_system_score_codex":0.0012479371,"about_ca_system_score_gemma":0.000674238,"threshold_uncertainty_score":0.03547448},"labels":[],"label_agreement":null},{"id":"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":"review","genre_gemma":"review","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"review","genre_consensus":"review","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.040601987,0.602387,0.3161567,0.003132272,0.0006356542,0.00014557292,0.00036340446,0.0008870501,0.03569032],"genre_scores_gemma":[0.20857824,0.61794144,0.16093507,0.0009254709,0.0029585764,0.000100315934,0.0010681463,0.00028374058,0.0072090738],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9985341,0.00027199014,0.00012972785,0.00034671102,0.0005225082,0.00019487648],"domain_scores_gemma":[0.9965917,0.0020784005,0.00020109903,0.000697277,0.00032771533,0.00010381112],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002463404,0.0010918233,0.0017662764,0.0034264144,0.0008313424,0.0028101145,0.0015508832,0.0011897405,0.0043653552],"category_scores_gemma":[0.0055897185,0.0009484528,0.0010734939,0.00676102,0.0021320293,0.01137678,0.0020897125,0.002158538,0.0017938311],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00015282768,0.0001408386,0.0018743475,0.002052854,0.000046843583,0.00008436051,0.00030501024,0.0057396204,0.0018885968,0.20321067,0.008174085,0.77633005],"study_design_scores_gemma":[0.00011453092,0.00043944028,0.0018694932,0.001665639,0.00008726791,0.0028750736,0.00040206974,0.03027548,0.00825587,0.6770169,0.27689672,0.00010144904],"about_ca_topic_score_codex":0.00078880956,"about_ca_topic_score_gemma":0.0007378345,"teacher_disagreement_score":0.0043653552,"about_ca_system_score_codex":0.0010907036,"about_ca_system_score_gemma":0.0013081396,"threshold_uncertainty_score":0.014603555},"labels":[],"label_agreement":null},{"id":"W2233088777","doi":"10.1016/j.jsc.2015.11.011","title":"Factoring linear partial differential operators in n variables","year":2015,"lang":"en","type":"article","venue":"Journal of Symbolic Computation","topic":"Polynomial and algebraic computation","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"German Academic Exchange Service London; Natural Sciences and Engineering Research Council of Canada; Deutscher Akademischer Austauschdienst","keywords":"Mathematics; Factoring; Partial derivative; Pure mathematics; Algebra over a field; Mathematical analysis","score_opus":0.031092829860326993,"score_gpt":0.2753606856662993,"score_spread":0.2442678558059723,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2233088777","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3060056,0.0007735394,0.6497666,0.0005444591,0.000336994,0.000100497964,0.0001462976,0.000627166,0.04169886],"genre_scores_gemma":[0.8834734,0.0005574332,0.0943457,0.00019812174,0.00013156986,0.00004929787,0.00012454003,0.000261601,0.020858426],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995813,0.00008464586,0.000024706376,0.00008594235,0.00012239814,0.000101138794],"domain_scores_gemma":[0.99949515,0.00023481289,0.00005043835,0.00009869352,0.000076518765,0.000044386423],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006891034,0.0006566697,0.00049610995,0.0008476752,0.0006969054,0.0010420687,0.00044864626,0.00040396975,0.0075947708],"category_scores_gemma":[0.0020920509,0.00030189042,0.0006472363,0.00088687957,0.0018062441,0.0027087,0.001687712,0.0007690888,0.00088247773],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00036990413,0.00012833871,0.0010507113,0.00017132264,0.0000456624,0.00045173717,0.0007634765,0.021581292,0.015842011,0.79999834,0.0034938687,0.1561033],"study_design_scores_gemma":[0.00006341692,0.0001059749,0.0003377383,0.000046193232,0.000023658986,0.00021597014,0.00021166388,0.056688778,0.010164882,0.91956425,0.012543924,0.00003357112],"about_ca_topic_score_codex":0.001387444,"about_ca_topic_score_gemma":0.0023789394,"teacher_disagreement_score":0.0075947708,"about_ca_system_score_codex":0.00091842376,"about_ca_system_score_gemma":0.0004926515,"threshold_uncertainty_score":0.025407016},"labels":[],"label_agreement":null},{"id":"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":"editorial","genre_gemma":"editorial","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"editorial","genre_consensus":"editorial","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0001212187,0.0029617804,0.00019426932,0.0548599,0.9368718,0.00001967764,0.00006184246,0.00007166159,0.004837854],"genre_scores_gemma":[0.0029606917,0.0026999984,0.00023999091,0.031129858,0.9083578,0.00006459083,0.00008453915,0.00012343687,0.054339092],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9978181,0.00029768125,0.00027103102,0.00035440197,0.0009879839,0.00027076696],"domain_scores_gemma":[0.9836225,0.0039704493,0.0010987739,0.0008776316,0.0079033645,0.0025273198],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0036222052,0.0013277986,0.0014732323,0.0019884498,0.0021397613,0.0063089486,0.0018652137,0.006995854,0.04637751],"category_scores_gemma":[0.021597855,0.0005047536,0.0011105118,0.00096005236,0.001227149,0.0029947404,0.0023721366,0.0096330885,0.022871079],"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.000026290112,0.000007141669,0.00004042124,0.00008284801,0.000004522755,0.000082058534,0.000019101073,0.000014959883,0.00008623625,0.000590786,0.9903646,0.008681156],"study_design_scores_gemma":[0.000018778324,0.00002397203,0.0003119396,0.00014123786,0.0000123488435,0.00018911957,0.000058457754,0.00010000527,0.00020485689,0.0007929756,0.9981359,0.000010364107],"about_ca_topic_score_codex":0.0009002605,"about_ca_topic_score_gemma":0.0014273634,"teacher_disagreement_score":0.04637751,"about_ca_system_score_codex":0.0014823264,"about_ca_system_score_gemma":0.0019607563,"threshold_uncertainty_score":0.15514821},"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":"commentary","genre_gemma":"editorial","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"editorial","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.006268042,0.08929398,0.012843537,0.6988491,0.08034024,0.000022920045,0.00024365255,0.00029099762,0.1118475],"genre_scores_gemma":[0.36911514,0.085292,0.015957614,0.147634,0.08426655,0.00017321951,0.00031745646,0.0020032786,0.29524085],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99701214,0.0012969163,0.00007601841,0.0005375618,0.0008456787,0.00023164337],"domain_scores_gemma":[0.99544686,0.0027310571,0.00014429467,0.00028280044,0.00093857636,0.0004564564],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0029526972,0.0010014471,0.0010642096,0.0012032986,0.0035608304,0.004717832,0.0009620219,0.0028783453,0.0059927893],"category_scores_gemma":[0.015299931,0.00031014357,0.0003710091,0.001098335,0.0077652014,0.0069182636,0.0037172188,0.006587562,0.004352031],"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.000080451384,0.000037715974,0.00025303554,0.0001388521,0.000022001486,0.00018020572,0.0043312837,0.00046300504,0.00037910746,0.40481076,0.5631033,0.02620021],"study_design_scores_gemma":[0.000015182925,0.000010948916,0.00019246327,0.0002330272,0.000009895342,0.000103570805,0.00096550945,0.00052871683,0.0003261094,0.10971981,0.88786906,0.00002576788],"about_ca_topic_score_codex":0.006289759,"about_ca_topic_score_gemma":0.006618963,"teacher_disagreement_score":0.006289759,"about_ca_system_score_codex":0.002887856,"about_ca_system_score_gemma":0.0021559238,"threshold_uncertainty_score":0.020953},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.34291264,0.0011031778,0.07566313,0.0019043416,0.001977573,0.00023979474,0.0025700338,0.008874597,0.56475466],"genre_scores_gemma":[0.75677055,0.0011285323,0.020269396,0.00068209245,0.00044947382,0.00014078068,0.0036369192,0.005046089,0.21187629],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993685,0.000041003666,0.000030495932,0.000115771865,0.00023081276,0.00021349113],"domain_scores_gemma":[0.9993019,0.00013433167,0.00011090531,0.00012358054,0.0001531958,0.00017605271],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00037651797,0.0015542145,0.0005866122,0.0018974908,0.0015665696,0.0029493356,0.0006291437,0.0010346397,0.05997172],"category_scores_gemma":[0.0019142539,0.00059219945,0.0013607473,0.001254956,0.002041378,0.002315289,0.002718749,0.0021168885,0.02136514],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000752916,0.00031113907,0.0061689317,0.00036539466,0.00008735957,0.003570755,0.0033908004,0.0043694535,0.04450077,0.6179405,0.10523236,0.21330972],"study_design_scores_gemma":[0.00022482728,0.00031858034,0.01973785,0.00023189947,0.000108564884,0.0041321944,0.0020388043,0.008373997,0.056962676,0.46435755,0.44321826,0.00029486718],"about_ca_topic_score_codex":0.0029625809,"about_ca_topic_score_gemma":0.0035983298,"teacher_disagreement_score":0.05997172,"about_ca_system_score_codex":0.0015534104,"about_ca_system_score_gemma":0.00080183137,"threshold_uncertainty_score":0.20062542},"labels":[],"label_agreement":null},{"id":"W2402945515","doi":"10.1016/j.jsc.2017.08.001","title":"Bit complexity for multi-homogeneous polynomial system solving—Application to polynomial minimization","year":2017,"lang":"en","type":"preprint","venue":"Journal of Symbolic Computation","topic":"Polynomial and algebraic computation","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada; Institut Universitaire de France","keywords":"Homogeneous polynomial; Polynomial; Mathematics; Time complexity; TRACE (psycholinguistics); Matrix polynomial; Set (abstract data type); Rank (graph theory); Jacobian matrix and determinant; Minification; Quadratic equation; Algebraic number; Linear system; Algorithm; Discrete mathematics; Mathematical optimization; Computer science; Applied mathematics; Combinatorics","score_opus":0.05342822384063003,"score_gpt":0.3164096717980784,"score_spread":0.2629814479574484,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2402945515","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.060543522,0.0006831075,0.9142895,0.0025514606,0.00021168606,0.00012839824,0.0006026091,0.0011096889,0.01988003],"genre_scores_gemma":[0.69005275,0.0007539288,0.29416615,0.0006634665,0.0004485505,0.0002836856,0.0008632748,0.0009470658,0.011821216],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.997414,0.00080901274,0.00017458941,0.00042343803,0.0008508484,0.00032815285],"domain_scores_gemma":[0.98630965,0.00991021,0.0004323395,0.00211328,0.0009568897,0.0002776743],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0024916325,0.0008711693,0.0015332475,0.0013370897,0.0013317595,0.0039210333,0.002618819,0.0014970632,0.011105343],"category_scores_gemma":[0.019030022,0.0004994731,0.0013396887,0.0024425827,0.002105587,0.007387829,0.0035611787,0.0043946495,0.001490708],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000771027,0.0001922099,0.0013858845,0.00038593396,0.00006630179,0.000114412695,0.0003313032,0.09827294,0.005652465,0.73681706,0.010460901,0.14554954],"study_design_scores_gemma":[0.00003609646,0.00003270639,0.00020897276,0.000019167614,0.000029281944,0.000044511075,0.0000338379,0.38653147,0.0023231346,0.60914797,0.0015747689,0.000018138828],"about_ca_topic_score_codex":0.0025625352,"about_ca_topic_score_gemma":0.0037396317,"teacher_disagreement_score":0.011105343,"about_ca_system_score_codex":0.0021367986,"about_ca_system_score_gemma":0.0019896263,"threshold_uncertainty_score":0.03715104},"labels":[],"label_agreement":null},{"id":"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7424313,0.001999643,0.15399048,0.0052006138,0.00036649895,0.00010039078,0.0008046746,0.0004847706,0.09462165],"genre_scores_gemma":[0.97352207,0.00060746266,0.017772224,0.00019633058,0.0001984345,0.000071369956,0.00033308342,0.00011458558,0.0071844645],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99834895,0.0004290965,0.000082368206,0.00016171423,0.0006892043,0.0002887333],"domain_scores_gemma":[0.9890732,0.008558628,0.0004870784,0.0009316961,0.0007184836,0.00023082504],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014879205,0.00062417693,0.00086743035,0.0015455597,0.0013101602,0.003035944,0.0016641081,0.0010495826,0.011595143],"category_scores_gemma":[0.014497357,0.00039241178,0.00062135846,0.002112018,0.0022500663,0.006677953,0.0019458493,0.0022166735,0.0009788176],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00041582147,0.00013710454,0.0015969813,0.00017078531,0.00003655373,0.00017617519,0.00030221636,0.07795824,0.0030894496,0.87705755,0.0060574096,0.033001777],"study_design_scores_gemma":[0.000031722877,0.000047417205,0.0004589489,0.000028842334,0.000017590422,0.00008565904,0.00009843991,0.21510155,0.001503444,0.78102803,0.0015730293,0.000025335356],"about_ca_topic_score_codex":0.0021890325,"about_ca_topic_score_gemma":0.003681334,"teacher_disagreement_score":0.011595143,"about_ca_system_score_codex":0.0018280587,"about_ca_system_score_gemma":0.0015884821,"threshold_uncertainty_score":0.03878957},"labels":[],"label_agreement":null},{"id":"W2549194755","doi":"10.1016/j.jsc.2018.04.011","title":"An equivalence theorem for regular differential chains","year":2018,"lang":"en","type":"article","venue":"Journal of Symbolic Computation","topic":"Polynomial and algebraic computation","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"","keywords":"Mathematics; Equivalence (formal languages); Pure mathematics; Computation; Differential (mechanical device); Discrete mathematics; Algebra over a field; Algorithm","score_opus":0.017836125736268877,"score_gpt":0.28815487130501716,"score_spread":0.2703187455687483,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2549194755","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.20410927,0.00092322635,0.5454733,0.0030924696,0.0012026464,0.00018977052,0.0008005715,0.0007886399,0.24342018],"genre_scores_gemma":[0.9039366,0.0007587762,0.056558162,0.0012214134,0.0008685614,0.00015577444,0.0009880917,0.00041820205,0.03509439],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99847084,0.00017620147,0.00011027847,0.00047863304,0.00046927854,0.00029481074],"domain_scores_gemma":[0.99652267,0.0016997408,0.00014454279,0.0005653394,0.00075324514,0.000314423],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015615203,0.0005473058,0.000961348,0.0019887052,0.002423081,0.0027835537,0.0012519724,0.0013163942,0.014970686],"category_scores_gemma":[0.0053750887,0.00054131227,0.0015932203,0.001394245,0.0036929513,0.010348399,0.004387789,0.0037911243,0.0012591004],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000033830536,0.000033148015,0.00021164805,0.000024517805,0.000006972091,0.00006296131,0.00023119482,0.00023548712,0.0005757252,0.99017227,0.00091094314,0.0075013535],"study_design_scores_gemma":[0.00001633258,0.000015187446,0.00013559511,0.000008987577,0.0000086313,0.000060378796,0.000058159938,0.0015221346,0.0004810956,0.99347335,0.004213578,0.0000065489044],"about_ca_topic_score_codex":0.0011532421,"about_ca_topic_score_gemma":0.0009241777,"teacher_disagreement_score":0.014970686,"about_ca_system_score_codex":0.0013290314,"about_ca_system_score_gemma":0.00068323145,"threshold_uncertainty_score":0.05008197},"labels":[],"label_agreement":null},{"id":"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":"empirical","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7012268,0.0008502513,0.19037507,0.0028766715,0.0007739589,0.00008727189,0.00028815083,0.00042238834,0.10309953],"genre_scores_gemma":[0.9661817,0.0002906795,0.0150122475,0.0002605259,0.00029869558,0.00006525813,0.000212732,0.00012796138,0.017550258],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99930525,0.00014885995,0.00004111674,0.00008606837,0.00022991482,0.00018875879],"domain_scores_gemma":[0.99912137,0.00022788119,0.00015959378,0.000095059724,0.00017391048,0.00022224766],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00092430407,0.0010401158,0.0011314475,0.0022956238,0.0022117987,0.003945967,0.0014972407,0.0021706459,0.007993385],"category_scores_gemma":[0.00360941,0.0005294825,0.001030009,0.0010940598,0.0038118078,0.0039849435,0.0030666674,0.0020707913,0.0006633344],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000016767737,0.000019936235,0.00008720106,0.00001411892,0.000006850814,0.0000620876,0.00012648088,0.0022879255,0.0004140178,0.9952371,0.00038510538,0.0013423475],"study_design_scores_gemma":[0.00002224066,0.000009677052,0.00006254965,0.000007442189,0.0000033646843,0.00005373236,0.00009521841,0.014448864,0.00017303484,0.98463666,0.0004763887,0.000010824852],"about_ca_topic_score_codex":0.0013250086,"about_ca_topic_score_gemma":0.0014536392,"teacher_disagreement_score":0.007993385,"about_ca_system_score_codex":0.0018786007,"about_ca_system_score_gemma":0.0011435405,"threshold_uncertainty_score":0.026740491},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15568778,0.00029392645,0.82234716,0.00064242247,0.00021970093,0.00018946647,0.0005886969,0.0012875361,0.01874336],"genre_scores_gemma":[0.7136773,0.00018140544,0.25914997,0.0002195184,0.00018432367,0.0003911346,0.0010383292,0.0005949979,0.02456295],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991917,0.00023379188,0.00005620935,0.00012731366,0.00024859476,0.00014232776],"domain_scores_gemma":[0.9973744,0.0014647678,0.00020179742,0.00051053794,0.00027113664,0.00017741905],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005743678,0.0006334927,0.00049227383,0.00053901185,0.0006730436,0.001493037,0.0010246026,0.00064199313,0.015284213],"category_scores_gemma":[0.004105398,0.00034068225,0.0004447957,0.00083299296,0.0009749454,0.0027082555,0.0018308188,0.001086501,0.0021796746],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00090013637,0.00025332868,0.000703133,0.00020083168,0.00002591442,0.00023901126,0.0005643257,0.036942754,0.024312887,0.81060433,0.011342094,0.11391127],"study_design_scores_gemma":[0.00016916476,0.00017785502,0.0002219343,0.000020500887,0.000013339788,0.00013376649,0.00012653663,0.16182461,0.011425262,0.8196276,0.0062299757,0.000029441793],"about_ca_topic_score_codex":0.00046578833,"about_ca_topic_score_gemma":0.0018218706,"teacher_disagreement_score":0.015284213,"about_ca_system_score_codex":0.00058640004,"about_ca_system_score_gemma":0.000943822,"threshold_uncertainty_score":0.05113077},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.21960525,0.0016257267,0.6466421,0.0046814186,0.0010052496,0.00009038755,0.00038122217,0.00076763507,0.12520102],"genre_scores_gemma":[0.8928135,0.0007021727,0.078572005,0.00080567744,0.00054770784,0.000071784736,0.0003425857,0.0004719999,0.025672521],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9984066,0.0006018325,0.00011605399,0.00032128664,0.0003123773,0.00024186046],"domain_scores_gemma":[0.9969261,0.0013903528,0.0003013595,0.0005407179,0.0006310189,0.00021033612],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002129817,0.00068080996,0.000807838,0.0016417118,0.002495264,0.0051707523,0.0013060059,0.0013702315,0.010237464],"category_scores_gemma":[0.008064131,0.00053993234,0.0009890797,0.001745846,0.006314915,0.013956275,0.0040079225,0.0032681248,0.001460173],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000029534332,0.00000550507,0.00007154657,0.000010655128,0.0000024427854,0.000042683274,0.00016673323,0.00028642165,0.00018468556,0.99595636,0.0004950525,0.0027484326],"study_design_scores_gemma":[0.000012528259,0.000017209786,0.00004493736,0.000014088157,0.0000068527916,0.00005810764,0.00012742594,0.0023540363,0.00041835563,0.9915005,0.0054374365,0.0000084086205],"about_ca_topic_score_codex":0.0012162258,"about_ca_topic_score_gemma":0.0008586232,"teacher_disagreement_score":0.010237464,"about_ca_system_score_codex":0.0015511106,"about_ca_system_score_gemma":0.00068300846,"threshold_uncertainty_score":0.034247696},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.16267742,0.0005754854,0.81758636,0.00088444736,0.00035712947,0.00007421135,0.00050771737,0.001922377,0.015414815],"genre_scores_gemma":[0.65720886,0.00040454697,0.32488802,0.0002676538,0.00028127775,0.000083078085,0.0009862686,0.0005495772,0.01533077],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99867046,0.00037527486,0.00005499849,0.00014083051,0.000585941,0.00017250505],"domain_scores_gemma":[0.9946983,0.0032926998,0.00029160397,0.0008462702,0.00066686457,0.00020425125],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012548172,0.0009799084,0.001152661,0.0015552294,0.0005934165,0.0029745318,0.0010309343,0.00097093993,0.010447866],"category_scores_gemma":[0.014947689,0.00047113711,0.0004879736,0.001681687,0.0011436958,0.0027489369,0.0015504498,0.0021771186,0.0025618102],"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.0014603983,0.0004583932,0.0023400413,0.00057245244,0.00013422019,0.00035277355,0.00059880695,0.336061,0.016566735,0.30391476,0.019022932,0.31851754],"study_design_scores_gemma":[0.000045607263,0.00009065141,0.00019923663,0.000028097202,0.000014731031,0.00006673515,0.00010575537,0.8814361,0.005126139,0.10984406,0.0030276487,0.000015252921],"about_ca_topic_score_codex":0.0022964366,"about_ca_topic_score_gemma":0.004868071,"teacher_disagreement_score":0.010447866,"about_ca_system_score_codex":0.0008303014,"about_ca_system_score_gemma":0.0010004101,"threshold_uncertainty_score":0.034951568},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7780732,0.002341684,0.08833333,0.0018590887,0.00041277302,0.000053348725,0.00047593415,0.0004440446,0.12800656],"genre_scores_gemma":[0.9712414,0.0005597967,0.009487927,0.00017821626,0.0003380348,0.00002230089,0.00023743692,0.00008669463,0.01784805],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992193,0.00018100113,0.00004213468,0.00016495876,0.0002193751,0.00017312741],"domain_scores_gemma":[0.99905986,0.00030850954,0.0002029499,0.00013655657,0.00011303244,0.0001790837],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013216226,0.0010737487,0.00091304077,0.003254848,0.0014142711,0.0034207578,0.0007311197,0.0010579807,0.0070802663],"category_scores_gemma":[0.0023599546,0.0006356969,0.00083617563,0.0021434033,0.00306275,0.0054659788,0.0021093918,0.0019685014,0.00089016696],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000714157,0.000041797954,0.0003277821,0.000025077301,0.000013018284,0.00010050148,0.00029015687,0.0010239304,0.0011945955,0.9908076,0.00073459104,0.0053694984],"study_design_scores_gemma":[0.00003214753,0.000031308013,0.00037641774,0.000013195988,0.000015300418,0.00023111989,0.00010619187,0.003338902,0.0011431569,0.991499,0.003189774,0.000023555864],"about_ca_topic_score_codex":0.0009450805,"about_ca_topic_score_gemma":0.00084722624,"teacher_disagreement_score":0.0070802663,"about_ca_system_score_codex":0.001323734,"about_ca_system_score_gemma":0.0005613843,"threshold_uncertainty_score":0.023685813},"labels":[],"label_agreement":null},{"id":"W2788877415","doi":"10.1016/j.jsc.2020.09.008","title":"Solving determinantal systems using homotopy techniques","year":2020,"lang":"en","type":"preprint","venue":"Journal of Symbolic Computation","topic":"Polynomial and algebraic computation","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada; Agence Nationale de la Recherche; National Science Foundation","keywords":"Mathematics; Combinatorics; Polynomial; Homotopy; Algebraic number; Field (mathematics); Closure (psychology); Matching (statistics); Discrete mathematics; Pure mathematics; Mathematical analysis","score_opus":0.037194602030137164,"score_gpt":0.29541361783777026,"score_spread":0.25821901580763307,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2788877415","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1634522,0.00025192293,0.7909973,0.0008699281,0.00037832,0.000101927006,0.0001391711,0.0010727651,0.042736493],"genre_scores_gemma":[0.7753753,0.00021296287,0.20804845,0.00018092411,0.00015997239,0.00008763582,0.00017262172,0.00049466005,0.015267431],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.999686,0.00009326097,0.000015260428,0.000052381758,0.000103408245,0.000049622726],"domain_scores_gemma":[0.9991036,0.0006207992,0.000032456897,0.000098382945,0.00009767395,0.00004703677],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004581303,0.00055798376,0.00087423733,0.0007311054,0.0010657558,0.0013377635,0.0009839691,0.0010090335,0.013686349],"category_scores_gemma":[0.0031651515,0.000421218,0.00064610934,0.00072375004,0.0013684552,0.00209346,0.0019234658,0.0019154823,0.0011896074],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001343437,0.00027238933,0.0012695636,0.00041406692,0.00008950731,0.0003961823,0.00057403295,0.14439492,0.007628297,0.693277,0.010136271,0.1414134],"study_design_scores_gemma":[0.00006905361,0.00004880601,0.00015941595,0.000017639857,0.000019482462,0.00008876575,0.0002050207,0.47525647,0.003470764,0.5152368,0.0054076635,0.00002008423],"about_ca_topic_score_codex":0.0017560506,"about_ca_topic_score_gemma":0.004190157,"teacher_disagreement_score":0.013686349,"about_ca_system_score_codex":0.00046563076,"about_ca_system_score_gemma":0.0007357173,"threshold_uncertainty_score":0.045785427},"labels":[],"label_agreement":null},{"id":"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8969014,0.00093962136,0.057544544,0.002736224,0.00014416501,0.00006765261,0.0013748761,0.0003951911,0.03989625],"genre_scores_gemma":[0.9715498,0.00041492688,0.021302976,0.00021315803,0.00010822616,0.000107373286,0.0010673138,0.00018572001,0.0050504594],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99810445,0.0005894611,0.00014540624,0.00048769527,0.00032855012,0.00034446633],"domain_scores_gemma":[0.9762271,0.018093921,0.0018368957,0.0012478353,0.00076213497,0.0018321187],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0023794319,0.001181601,0.0014796829,0.0020862403,0.0028609312,0.004653407,0.0028032826,0.002318042,0.014479725],"category_scores_gemma":[0.015975358,0.0009801581,0.0013801772,0.0014905689,0.004883906,0.0067798616,0.002794378,0.002358092,0.0008483233],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0023710665,0.00024613147,0.0077293618,0.00075706973,0.00016118409,0.0004127981,0.0013695944,0.053709265,0.011589742,0.8784774,0.008978315,0.03419807],"study_design_scores_gemma":[0.00018116987,0.00022868406,0.003732752,0.00015032938,0.0001402502,0.0005106183,0.00083050964,0.11498401,0.00654858,0.86845154,0.0041563776,0.00008527528],"about_ca_topic_score_codex":0.0010528844,"about_ca_topic_score_gemma":0.0018359353,"teacher_disagreement_score":0.014479725,"about_ca_system_score_codex":0.001702973,"about_ca_system_score_gemma":0.0011778128,"threshold_uncertainty_score":0.048439503},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6825884,0.000982073,0.13789442,0.0052043675,0.0013974567,0.00010056024,0.00080318906,0.0014647736,0.1695647],"genre_scores_gemma":[0.9589889,0.00027583982,0.01859718,0.00032336608,0.00034184812,0.000041336396,0.00036080595,0.00036913468,0.020701587],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99957734,0.00006132441,0.000019421275,0.0000768673,0.00018876138,0.00007633591],"domain_scores_gemma":[0.99906236,0.0002985466,0.000110387366,0.00022789098,0.00014833604,0.00015245331],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00034452297,0.0006835034,0.00083635683,0.0018507659,0.001979051,0.0026359316,0.001111397,0.0018631368,0.013393807],"category_scores_gemma":[0.0035382444,0.00046728438,0.00058277056,0.0011752062,0.002803732,0.0054013636,0.002740405,0.0027275768,0.0012821638],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006553041,0.000020711645,0.00047633008,0.000037417416,0.000011251901,0.0006194773,0.00017503531,0.0012134238,0.0021756412,0.98651,0.002849257,0.005845931],"study_design_scores_gemma":[0.000019505771,0.00001302686,0.00044798866,0.000018502069,0.000009073604,0.0009839367,0.00023782073,0.009869761,0.0012757834,0.9810987,0.0060074814,0.000018433311],"about_ca_topic_score_codex":0.0002952703,"about_ca_topic_score_gemma":0.0002881624,"teacher_disagreement_score":0.013393807,"about_ca_system_score_codex":0.0007396198,"about_ca_system_score_gemma":0.00027128184,"threshold_uncertainty_score":0.04480678},"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.26278353,0.0011337613,0.23835617,0.0057309233,0.0020829288,0.0002568086,0.00058166054,0.0010891324,0.48798501],"genre_scores_gemma":[0.7960808,0.0009428846,0.046658237,0.0011295495,0.0011487588,0.00020554278,0.00069709047,0.00075560214,0.15238152],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993112,0.0001854047,0.00003071513,0.00009745463,0.00022833263,0.00014687688],"domain_scores_gemma":[0.99903095,0.00030513396,0.000078294215,0.00023846766,0.00019291101,0.00015425333],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00094371685,0.001043292,0.00096198934,0.0023458046,0.002187627,0.0026114986,0.0010276536,0.0011021228,0.018532595],"category_scores_gemma":[0.0024175213,0.0004962433,0.0009944803,0.0014889168,0.0027970767,0.0042924182,0.002726144,0.003642974,0.004431553],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000023652943,0.000021273578,0.00006427146,0.000012403655,0.000002729788,0.00002384023,0.000103848,0.00021216291,0.00046416448,0.9918154,0.0015942984,0.0056618955],"study_design_scores_gemma":[0.000015108612,0.00001598296,0.000043711927,0.000009337762,0.0000050288636,0.00006784377,0.00003681823,0.0016908029,0.0009795924,0.99137235,0.0057566627,0.0000068233317],"about_ca_topic_score_codex":0.00033037312,"about_ca_topic_score_gemma":0.00035089493,"teacher_disagreement_score":0.018532595,"about_ca_system_score_codex":0.0012309732,"about_ca_system_score_gemma":0.00080669916,"threshold_uncertainty_score":0.06199771},"labels":[],"label_agreement":null},{"id":"W2944680259","doi":"10.1016/j.jsc.2019.05.001","title":"The complexity of sparse Hensel lifting and sparse polynomial factorization","year":2019,"lang":"en","type":"article","venue":"Journal of Symbolic Computation","topic":"Polynomial and algebraic computation","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Univariate; Polynomial; Interpolation (computer graphics); Multivariate statistics; Polynomial interpolation; Sparse grid; Diophantine equation; Algorithm; Applied mathematics; Discrete mathematics; Combinatorics; Image (mathematics); Linear interpolation; Computer science; Statistics; Artificial intelligence; Mathematical analysis","score_opus":0.027770756451189687,"score_gpt":0.25040911482240735,"score_spread":0.22263835837121768,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2944680259","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.61813074,0.0015580356,0.31511313,0.008093127,0.0004878397,0.00030473672,0.0029135256,0.0016712265,0.051727615],"genre_scores_gemma":[0.9235342,0.0006038303,0.06300639,0.00041984985,0.0004014385,0.0001424291,0.0018421652,0.00029488222,0.009754812],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9968562,0.00054040656,0.00015977639,0.0004828931,0.0012070274,0.00075368944],"domain_scores_gemma":[0.98888105,0.007436087,0.0006430534,0.0019205977,0.0007389841,0.00038020278],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015505487,0.0007714127,0.0015037275,0.00090286764,0.0015920791,0.0038817634,0.0019413095,0.0014378512,0.017824389],"category_scores_gemma":[0.013156161,0.0006781976,0.0013768931,0.0019064621,0.002176606,0.009627981,0.0035545789,0.002736233,0.0018952857],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0034530095,0.00057991134,0.0073362044,0.0009874823,0.00020518401,0.0008839194,0.0010104434,0.17171052,0.01507015,0.5850874,0.032875255,0.18080051],"study_design_scores_gemma":[0.00019148493,0.00010736989,0.0010189905,0.000041272226,0.000067293855,0.0002263265,0.00025545922,0.27363557,0.0038028448,0.71769756,0.0029113812,0.000044471268],"about_ca_topic_score_codex":0.0031534138,"about_ca_topic_score_gemma":0.004592915,"teacher_disagreement_score":0.017824389,"about_ca_system_score_codex":0.0018066698,"about_ca_system_score_gemma":0.0029035152,"threshold_uncertainty_score":0.059628487},"labels":[],"label_agreement":null},{"id":"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7399633,0.0020042486,0.14813119,0.002405797,0.00065254606,0.00011960768,0.0005450852,0.0012462556,0.1049319],"genre_scores_gemma":[0.9607129,0.00062845665,0.019758863,0.00023921981,0.00042489654,0.00007186902,0.00028482464,0.00019874277,0.017680336],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9983565,0.00037654405,0.0000855493,0.0002197617,0.0005647541,0.0003968183],"domain_scores_gemma":[0.9964606,0.0020567616,0.0003525311,0.00045739624,0.000297741,0.00037491255],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020676926,0.0014634953,0.0017239765,0.0047832145,0.0032566818,0.0047281403,0.0018435823,0.0015846797,0.016007502],"category_scores_gemma":[0.006994817,0.0010186232,0.0015199814,0.0028440915,0.0037951714,0.010584611,0.003843088,0.0033614056,0.0018825603],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001663101,0.0000335409,0.00044492332,0.00006411141,0.000017718945,0.00017343854,0.00035465142,0.0029958438,0.0010083265,0.9858042,0.0014297647,0.007507176],"study_design_scores_gemma":[0.00005132197,0.000032144693,0.00027535894,0.000030587733,0.000019218285,0.0001340314,0.00008352207,0.010462088,0.00079061306,0.9864178,0.0016742756,0.000029070929],"about_ca_topic_score_codex":0.0013701472,"about_ca_topic_score_gemma":0.0024145492,"teacher_disagreement_score":0.016007502,"about_ca_system_score_codex":0.0027073736,"about_ca_system_score_gemma":0.00096975884,"threshold_uncertainty_score":0.05355048},"labels":[],"label_agreement":null},{"id":"W2956505993","doi":"10.1016/j.jsc.2019.07.009","title":"On the Extended Hensel Construction and its application to the computation of real limit points","year":2019,"lang":"en","type":"article","venue":"Journal of Symbolic Computation","topic":"Polynomial and algebraic computation","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Univariate; Rational function; Polynomial; Computation; Limit (mathematics); Bivariate analysis; Algebraic number; Multivariate statistics; Discrete mathematics; Algebra over a field; Applied mathematics; Pure mathematics; Algorithm; Mathematical analysis","score_opus":0.010749298313966107,"score_gpt":0.24320198452094566,"score_spread":0.23245268620697956,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2956505993","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.115823716,0.0012496079,0.85572404,0.00054619735,0.00025957476,0.000059177168,0.000083408544,0.00059626513,0.025658017],"genre_scores_gemma":[0.7313313,0.0014257267,0.25447685,0.0002372104,0.00027233473,0.000079418714,0.00013861361,0.00031081794,0.011727714],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.999432,0.0002017668,0.000035955876,0.000110869616,0.00014658005,0.00007280645],"domain_scores_gemma":[0.99838376,0.0009258498,0.00007927822,0.00026256006,0.0002468889,0.00010173275],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019302288,0.00061998254,0.00089905574,0.0021017073,0.0010859041,0.0015713987,0.0012511362,0.00079028384,0.0058851875],"category_scores_gemma":[0.0052906633,0.00045771454,0.00096561655,0.0021142652,0.0038086693,0.003995609,0.0037129826,0.001752748,0.0008348838],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00015283056,0.0000365386,0.0008117471,0.00011954912,0.000029204268,0.00028159938,0.0005440643,0.007980601,0.004075282,0.93012667,0.0008736659,0.054968145],"study_design_scores_gemma":[0.000030164636,0.00007816281,0.00048535888,0.00004994349,0.000030274296,0.0002321699,0.00009850155,0.048815306,0.0044658016,0.93839854,0.007263725,0.000052073014],"about_ca_topic_score_codex":0.0008096093,"about_ca_topic_score_gemma":0.00093929796,"teacher_disagreement_score":0.0058851875,"about_ca_system_score_codex":0.00069648784,"about_ca_system_score_gemma":0.0005092094,"threshold_uncertainty_score":0.019687891},"labels":[],"label_agreement":null},{"id":"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5548507,0.0010651175,0.3211194,0.0075870557,0.0002954777,0.00030182645,0.0015358323,0.001592054,0.11165259],"genre_scores_gemma":[0.87029505,0.0002746716,0.1173875,0.0005189223,0.00013314425,0.00011731308,0.0009746548,0.00032289865,0.00997596],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993548,0.0002095883,0.000030295327,0.00013354719,0.000154573,0.00011726727],"domain_scores_gemma":[0.9973265,0.001955733,0.00016726014,0.00025207954,0.00021794288,0.00008047869],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00073234004,0.0006121446,0.0009819897,0.0023006967,0.002005886,0.002366062,0.0012313876,0.0012517412,0.021917803],"category_scores_gemma":[0.007880579,0.0005412785,0.0011232632,0.001976853,0.0019085628,0.0051870006,0.0019184147,0.0022782506,0.0021330726],"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.00066814775,0.00030230478,0.002870492,0.00041301845,0.000074607,0.0005155661,0.0005417367,0.028425744,0.0030743137,0.84480214,0.017979031,0.10033298],"study_design_scores_gemma":[0.00010554822,0.00008252426,0.00030694148,0.00005075675,0.000036722948,0.00017491893,0.00028867155,0.08871409,0.0027539337,0.90163267,0.0058266562,0.000026588687],"about_ca_topic_score_codex":0.0015240127,"about_ca_topic_score_gemma":0.0025713511,"teacher_disagreement_score":0.021917803,"about_ca_system_score_codex":0.0009593707,"about_ca_system_score_gemma":0.0014249342,"threshold_uncertainty_score":0.073322296},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08692318,0.0023497744,0.881035,0.0054683182,0.0002688846,0.000039392802,0.00079729594,0.00023395546,0.0228843],"genre_scores_gemma":[0.85660934,0.0032801365,0.10446994,0.0010569382,0.0013356359,0.0002516188,0.0015539194,0.00048213662,0.030960238],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99765694,0.0011342551,0.00009312495,0.00042546456,0.0005232989,0.00016694593],"domain_scores_gemma":[0.9823115,0.01367769,0.0010593777,0.0010007865,0.001044568,0.0009060775],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0034519567,0.0014919407,0.0027868873,0.0029112562,0.0013497974,0.0039156755,0.0026808481,0.0025130801,0.008069645],"category_scores_gemma":[0.024253394,0.0010551503,0.0014119106,0.003196358,0.0041127135,0.01135682,0.004542878,0.006362428,0.0006830023],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000019081348,0.000015631758,0.00016330244,0.0000263042,0.000016482692,0.000013658678,0.00004560093,0.010025425,0.000060577633,0.9859897,0.00077260606,0.002851744],"study_design_scores_gemma":[0.0000040506998,0.000004061105,0.00007020457,0.000006246134,0.0000043435957,0.000008108824,0.000008959871,0.044558473,0.00002858943,0.95475596,0.0005463082,0.0000047421063],"about_ca_topic_score_codex":0.0047542388,"about_ca_topic_score_gemma":0.003303653,"teacher_disagreement_score":0.008069645,"about_ca_system_score_codex":0.0036223154,"about_ca_system_score_gemma":0.0016274352,"threshold_uncertainty_score":0.0269956},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.037157748,0.0004774902,0.9118987,0.0010572242,0.0013066311,0.00007773622,0.00012966465,0.0008832883,0.04701159],"genre_scores_gemma":[0.5279334,0.00041838325,0.44867715,0.00097515684,0.0007417393,0.00022798227,0.00033074594,0.001421983,0.019273397],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99692816,0.0009364213,0.00028126524,0.0006540795,0.0008147517,0.00038521874],"domain_scores_gemma":[0.9955337,0.002606453,0.00016961069,0.0007410616,0.00064390374,0.00030526464],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004019186,0.0012034487,0.0014860457,0.003119037,0.003089777,0.004944996,0.0020808617,0.0023660802,0.009866375],"category_scores_gemma":[0.012155246,0.0009203943,0.0019518741,0.0020690449,0.0048428993,0.011051858,0.0043177516,0.0057117697,0.002665021],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000045039505,0.00001736156,0.00006206561,0.000028604452,0.000004515048,0.00007883945,0.00017753975,0.00032010442,0.00079827395,0.9893572,0.001043075,0.008067564],"study_design_scores_gemma":[0.000012840794,0.000019675448,0.00003986226,0.000017322403,0.000011016272,0.00010518766,0.000045277982,0.003475085,0.0014882539,0.9898351,0.0049308273,0.00001960773],"about_ca_topic_score_codex":0.00040873827,"about_ca_topic_score_gemma":0.00030488934,"teacher_disagreement_score":0.009866375,"about_ca_system_score_codex":0.001947338,"about_ca_system_score_gemma":0.0009555166,"threshold_uncertainty_score":0.03300637},"labels":[],"label_agreement":null},{"id":"W3081736912","doi":"10.1016/j.jsc.2022.10.002","title":"Computing critical points for invariant algebraic systems","year":2022,"lang":"en","type":"article","venue":"Journal of Symbolic Computation","topic":"Polynomial and algebraic computation","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"H2020 Marie Skłodowska-Curie Actions; Agence Nationale de la Recherche; H2020 Fast Track to Innovation; Horizon 2020; Natural Sciences and Engineering Research Council of Canada; European Commission","keywords":"Mathematics; Combinatorics; Invariant (physics); Polynomial; Jacobian matrix and determinant; Discrete mathematics; Algebraic number; Finite field; Invariant polynomial; Exponential function; Matrix polynomial; Mathematical analysis; Mathematical physics","score_opus":0.02115593940969856,"score_gpt":0.2819425198729099,"score_spread":0.26078658046321135,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3081736912","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7020085,0.00046035432,0.278964,0.0002928697,0.00008693573,0.00016018623,0.0004408402,0.0012741556,0.016312202],"genre_scores_gemma":[0.9585674,0.00013089059,0.038731635,0.000033453307,0.000032203043,0.000038645274,0.00046431902,0.00019699027,0.0018045409],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99946433,0.00009167855,0.0000340794,0.000107329055,0.0001744653,0.00012815333],"domain_scores_gemma":[0.99646205,0.0022887257,0.00028341357,0.00024691282,0.0004945666,0.00022440843],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000718577,0.0008557526,0.0009953585,0.0041557997,0.0010776339,0.0021642519,0.0010637282,0.00070219784,0.008152959],"category_scores_gemma":[0.0070254346,0.0005687358,0.000616158,0.001329703,0.0021263894,0.0031120647,0.0018276906,0.0014504443,0.00084285357],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0012497115,0.00038387164,0.0156029435,0.000721573,0.00017477677,0.0008630216,0.0014905141,0.11011894,0.02021534,0.6896685,0.008215861,0.15129498],"study_design_scores_gemma":[0.00009377921,0.00013444555,0.0011934395,0.00006910507,0.000057646906,0.00009051936,0.00037627053,0.22766013,0.010358943,0.7581375,0.0017986164,0.00002958259],"about_ca_topic_score_codex":0.0017827257,"about_ca_topic_score_gemma":0.0028741593,"teacher_disagreement_score":0.008152959,"about_ca_system_score_codex":0.0012334196,"about_ca_system_score_gemma":0.0007747163,"threshold_uncertainty_score":0.02727437},"labels":[],"label_agreement":null},{"id":"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.050286688,0.00038038788,0.93164396,0.00026972714,0.00014624115,0.00006180293,0.0007258293,0.0056496384,0.010835783],"genre_scores_gemma":[0.49780372,0.00069459464,0.48975074,0.00008784012,0.00012507873,0.00014741166,0.0017424097,0.001846462,0.007801676],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994686,0.00008298814,0.000029145192,0.00010529966,0.0002681208,0.00004581231],"domain_scores_gemma":[0.9990495,0.00031015542,0.000064616084,0.00031251766,0.00018122926,0.00008192593],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005168806,0.00086791767,0.00085961825,0.0021124019,0.0007579669,0.0030065218,0.001793809,0.00084911735,0.012415059],"category_scores_gemma":[0.0049055084,0.00054170506,0.00063830503,0.002265709,0.0015737001,0.004735281,0.003832272,0.0014795645,0.0031694495],"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.00050047855,0.00006647995,0.0029879326,0.00044110251,0.0000646502,0.00021186586,0.0006857171,0.13590616,0.013826398,0.3074042,0.014866645,0.5230383],"study_design_scores_gemma":[0.00006269748,0.00010523199,0.00080539525,0.000059788195,0.000027176544,0.00020770366,0.00022395357,0.62257,0.011943431,0.34114325,0.022816496,0.00003493846],"about_ca_topic_score_codex":0.0017731889,"about_ca_topic_score_gemma":0.002124875,"teacher_disagreement_score":0.012415059,"about_ca_system_score_codex":0.00050828076,"about_ca_system_score_gemma":0.00076946785,"threshold_uncertainty_score":0.041532457},"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":"other","genre_gemma":"editorial","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"editorial","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0017760234,0.010814732,0.03298486,0.040159933,0.273122,0.0006045097,0.015167423,0.0030410662,0.6223295],"genre_scores_gemma":[0.011153742,0.005502263,0.0070042047,0.006061605,0.035192758,0.00030950067,0.011118413,0.0019265845,0.92173094],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9992073,0.00012039872,0.000047445887,0.00012479219,0.0004427606,0.000057336205],"domain_scores_gemma":[0.9940164,0.00086873234,0.00013822572,0.0006372455,0.0038005712,0.00053884625],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012947503,0.0010003705,0.0007027716,0.003435406,0.0023215516,0.0028637499,0.0012219342,0.0008584559,0.38220948],"category_scores_gemma":[0.012973165,0.0003185278,0.00066753867,0.002433053,0.00070125225,0.0028318,0.0020281824,0.0029102904,0.2329187],"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.00002836686,0.000020843789,0.00008121457,0.000090815076,0.000002660834,0.000027029591,0.000049671333,0.000101705635,0.00015608723,0.009741425,0.9426468,0.04705337],"study_design_scores_gemma":[0.000005726117,0.000012830512,0.00024538775,0.000093222756,0.0000032724872,0.00003776917,0.000050957537,0.000091341055,0.00023385561,0.008895891,0.9903224,0.0000072727903],"about_ca_topic_score_codex":0.0044308845,"about_ca_topic_score_gemma":0.0055098515,"teacher_disagreement_score":0.38220948,"about_ca_system_score_codex":0.0020472314,"about_ca_system_score_gemma":0.0020493923,"threshold_uncertainty_score":0},"labels":[],"label_agreement":null},{"id":"W4290098640","doi":"10.1016/j.jsc.2022.08.015","title":"Parallelization of triangular decompositions: Techniques and implementation","year":2022,"lang":"en","type":"article","venue":"Journal of Symbolic Computation","topic":"Polynomial and algebraic computation","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"","keywords":"Concurrency; Pipeline (software); Component (thermodynamics); Set (abstract data type); Parallel computing; Polynomial; Focus (optics); Mathematics; Computer science; Class (philosophy); Parallelism (grammar); Distributed computing; Programming language","score_opus":0.008855122444873777,"score_gpt":0.28257560946351823,"score_spread":0.27372048701864443,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4290098640","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05322437,0.00032545906,0.914017,0.00028429498,0.00020486902,0.00019883476,0.00046394192,0.0072021117,0.024079083],"genre_scores_gemma":[0.40462193,0.00034999172,0.57819325,0.00018671941,0.00013415511,0.00028109513,0.0016308492,0.0012139026,0.0133881215],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9991773,0.00015072497,0.00006051923,0.00015313944,0.0002609094,0.00019744804],"domain_scores_gemma":[0.9984668,0.0003601804,0.00006092902,0.0005802773,0.0004494966,0.00008238799],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005698742,0.0007836318,0.0008753317,0.000969613,0.0012273922,0.0016143817,0.001638573,0.0004934406,0.025587363],"category_scores_gemma":[0.0027933351,0.0005085553,0.0010686055,0.0019567944,0.0006955741,0.0018968983,0.0018280796,0.0010920891,0.0043698447],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0010238851,0.00042618084,0.0017945218,0.0004478939,0.00012257589,0.00027833937,0.0005936958,0.08214095,0.036078576,0.090741955,0.032528624,0.7538228],"study_design_scores_gemma":[0.00030276363,0.00025413252,0.0005887474,0.00005939682,0.0000767139,0.00021081393,0.00035010354,0.85041314,0.04598013,0.0764195,0.02529568,0.00004882766],"about_ca_topic_score_codex":0.007109207,"about_ca_topic_score_gemma":0.014523133,"teacher_disagreement_score":0.025587363,"about_ca_system_score_codex":0.0008810985,"about_ca_system_score_gemma":0.0015498092,"threshold_uncertainty_score":0.08559823},"labels":[],"label_agreement":null},{"id":"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.68633085,0.0012727325,0.23520549,0.0017661195,0.0006065645,0.00014255634,0.0006731987,0.0013829287,0.07261952],"genre_scores_gemma":[0.94803435,0.00040267807,0.04031959,0.000102590355,0.00019424202,0.00001895009,0.0005725131,0.0002921315,0.010062921],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99867624,0.00024519386,0.00010435248,0.00022840353,0.0004561134,0.00028969086],"domain_scores_gemma":[0.9962436,0.002100965,0.00022638126,0.0005543214,0.0005767505,0.00029806278],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014004282,0.00075334345,0.0012835114,0.002005867,0.0014244913,0.005049377,0.0014751379,0.0005088928,0.012670573],"category_scores_gemma":[0.007645053,0.0007206107,0.0010084026,0.0020554652,0.0032013587,0.008436887,0.0025756154,0.0017598849,0.0023002843],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00080220937,0.00031068255,0.006357244,0.00040591502,0.00009334852,0.0005708194,0.0014350282,0.015569614,0.0096243005,0.86085653,0.0073283687,0.096645914],"study_design_scores_gemma":[0.000048964128,0.000050312778,0.00059992535,0.00006330111,0.00005078574,0.00012485804,0.00037773955,0.029091053,0.007060739,0.9573209,0.005183266,0.00002809377],"about_ca_topic_score_codex":0.0012954016,"about_ca_topic_score_gemma":0.003070746,"teacher_disagreement_score":0.012670573,"about_ca_system_score_codex":0.0011319768,"about_ca_system_score_gemma":0.0009386963,"threshold_uncertainty_score":0.042387307},"labels":[],"label_agreement":null},{"id":"W4296916461","doi":"10.1016/j.jsc.2023.102234","title":"Computing roadmaps in unbounded smooth real algebraic sets I: Connectivity results","year":2023,"lang":"en","type":"article","venue":"Journal of Symbolic Computation","topic":"Polynomial and algebraic computation","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"European Commission; Natural Sciences and Engineering Research Council of Canada; Austrian Science Fund; Agence Nationale de la Recherche; European Office of Aerospace Research and Development; Air Force Office of Scientific Research","keywords":"Mathematics; Bounded function; Algebraic number; Real algebraic geometry; Intersection (aeronautics); Computation; Dimension (graph theory); Set (abstract data type); Connected component; Robotics; Polynomial; Algebra over a field; Discrete mathematics; Theoretical computer science; Algorithm; Pure mathematics; Robot; Computer science; Artificial intelligence","score_opus":0.023006470980969553,"score_gpt":0.28940882830363396,"score_spread":0.26640235732266443,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4296916461","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5136016,0.0010792878,0.45151392,0.0011052208,0.00010659307,0.00015099865,0.001478112,0.0013181788,0.029646173],"genre_scores_gemma":[0.91548115,0.0006041397,0.07620416,0.0001408469,0.00010584094,0.00010685372,0.0016581417,0.00034205941,0.00535677],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990146,0.0001448374,0.000070781236,0.00032906965,0.00029367508,0.00014708555],"domain_scores_gemma":[0.988983,0.007829697,0.0007646174,0.0011296106,0.0007170063,0.0005759882],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009529882,0.0009901479,0.001161213,0.0034969072,0.0016024467,0.0044826036,0.002590329,0.0014161033,0.011060701],"category_scores_gemma":[0.012501602,0.00079689507,0.0015823668,0.0035904467,0.0033282042,0.011847832,0.0048298663,0.0034436337,0.0010014375],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00040548484,0.00016702965,0.0051360265,0.0005768612,0.00008667764,0.00024848213,0.0012183698,0.09953073,0.0040514744,0.82356805,0.0050713927,0.059939433],"study_design_scores_gemma":[0.000025257517,0.000071258306,0.0009997286,0.000075680444,0.000044790624,0.00010416605,0.00035019318,0.14660797,0.0024529211,0.84689087,0.0023426784,0.000034502988],"about_ca_topic_score_codex":0.0027748407,"about_ca_topic_score_gemma":0.0037582137,"teacher_disagreement_score":0.011060701,"about_ca_system_score_codex":0.0014268258,"about_ca_system_score_gemma":0.00072656607,"threshold_uncertainty_score":0.03700179},"labels":[],"label_agreement":null},{"id":"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.014258943,0.00008065035,0.97968525,0.0001637378,0.00006873023,0.00011510751,0.00011990492,0.00075232994,0.004755327],"genre_scores_gemma":[0.10228714,0.00014850244,0.8920398,0.00022209184,0.00006532229,0.00025880765,0.0005635934,0.00027814164,0.0041366634],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99881727,0.00031462658,0.00010114046,0.00021107825,0.00042332665,0.00013262294],"domain_scores_gemma":[0.99683124,0.0017076138,0.00015031674,0.0007200981,0.0005081293,0.000082609615],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009963737,0.00084459654,0.00087989337,0.0022076892,0.0013093563,0.0017771333,0.002235846,0.0012036987,0.0058421902],"category_scores_gemma":[0.006194898,0.0005922875,0.0012534257,0.0023108337,0.0013360427,0.002749027,0.0022503617,0.0018965265,0.0017942376],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00018131881,0.0002178742,0.0013614846,0.0003302708,0.000052593354,0.00024640386,0.0004780184,0.038012885,0.019407807,0.5903292,0.006734958,0.34264717],"study_design_scores_gemma":[0.000046468696,0.00013956339,0.00023607911,0.00007898578,0.00006144617,0.000382668,0.00012317754,0.3006212,0.011554945,0.67793256,0.008773172,0.000049707698],"about_ca_topic_score_codex":0.00095198763,"about_ca_topic_score_gemma":0.002353028,"teacher_disagreement_score":0.0058421902,"about_ca_system_score_codex":0.00079443847,"about_ca_system_score_gemma":0.0017464735,"threshold_uncertainty_score":0.019544065},"labels":[],"label_agreement":null},{"id":"W4391556953","doi":"10.1016/j.jsc.2025.102532","title":"Computing roadmaps in unbounded smooth real algebraic sets II: Algorithm and complexity","year":2025,"lang":"en","type":"article","venue":"Journal of Symbolic Computation","topic":"Polynomial and algebraic computation","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada; Fonds Wetenschappelijk Onderzoek; European Office of Aerospace Research and Development; Air Force Office of Scientific Research; Austrian Science Fund; Agence Nationale de la Recherche","keywords":"Algebraic number; Computer science; Algorithm; Algebra over a field; Mathematics; Pure mathematics","score_opus":0.018845130115064463,"score_gpt":0.2839940453018797,"score_spread":0.26514891518681527,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4391556953","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.22058742,0.00040669105,0.76458085,0.00082531845,0.00006704674,0.00019063843,0.0006423319,0.0013420972,0.011357706],"genre_scores_gemma":[0.6551411,0.00035212006,0.33620027,0.00012086854,0.00006865792,0.00015324513,0.0011646611,0.00040888836,0.006390176],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99872833,0.00024920184,0.000120605255,0.00036167123,0.00037215164,0.00016805428],"domain_scores_gemma":[0.9915155,0.0065875193,0.00037128778,0.0007690566,0.00047941084,0.0002772837],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012946356,0.0007289575,0.0014179527,0.0022475477,0.0013284246,0.0058490094,0.002631396,0.0015074995,0.009577783],"category_scores_gemma":[0.01200842,0.00083087117,0.0019897418,0.0026831347,0.0025061367,0.010419528,0.0048546568,0.0032052838,0.0012267804],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00037128883,0.00014977623,0.0027302173,0.0005200906,0.00008497414,0.00014564859,0.0010393462,0.17534336,0.0033626312,0.659388,0.004213369,0.15265131],"study_design_scores_gemma":[0.000025142728,0.000029344303,0.00027703476,0.000035382214,0.00002027511,0.00004897146,0.00018873852,0.28576517,0.0017821419,0.71044624,0.0013610405,0.000020579555],"about_ca_topic_score_codex":0.0036505002,"about_ca_topic_score_gemma":0.0047644726,"teacher_disagreement_score":0.009577783,"about_ca_system_score_codex":0.0021280795,"about_ca_system_score_gemma":0.001708723,"threshold_uncertainty_score":0.032040894},"labels":[],"label_agreement":null},{"id":"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.87505156,0.0001787309,0.09027795,0.00049803016,0.00014350696,0.000046424986,0.00018494089,0.000315649,0.033303212],"genre_scores_gemma":[0.97433454,0.00008781591,0.014981198,0.0000870919,0.000062960324,0.000021442716,0.00015442495,0.000053837313,0.010216757],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99970704,0.000030763476,0.00001202103,0.000071847586,0.00007646094,0.00010180117],"domain_scores_gemma":[0.9997528,0.000041957916,0.000044600973,0.000031328495,0.000036144884,0.00009322194],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003456802,0.00044500944,0.00033125115,0.0008552224,0.000681817,0.0010611705,0.00034138095,0.00039096785,0.008264568],"category_scores_gemma":[0.0006646595,0.00017173882,0.00052174815,0.00030844155,0.0014362822,0.0012160491,0.0008166467,0.00076019665,0.0011169433],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00016909478,0.000072328905,0.0010832609,0.00003989307,0.0000092595565,0.00044814893,0.00063917454,0.0034802326,0.022751996,0.9547318,0.0016843949,0.014890208],"study_design_scores_gemma":[0.000065417524,0.00020551831,0.00158194,0.000027862463,0.00001108455,0.00047480356,0.00040859103,0.037501626,0.019136243,0.9308922,0.009638221,0.00005638354],"about_ca_topic_score_codex":0.0009334134,"about_ca_topic_score_gemma":0.0010156096,"teacher_disagreement_score":0.008264568,"about_ca_system_score_codex":0.0008011058,"about_ca_system_score_gemma":0.00041290026,"threshold_uncertainty_score":0.027647734},"labels":[],"label_agreement":null},{"id":"W4402858306","doi":"10.1016/j.jsc.2024.102389","title":"An <mml:math xmlns:mml=\"http://www.w3.org/1998/Math/MathML\" altimg=\"si1.svg\"> <mml:mi mathvariant=\"fraktur\">m</mml:mi> </mml:math> -adic algorithm for bivariate Gröbner bases","year":2024,"lang":"nl","type":"article","venue":"Journal of Symbolic Computation","topic":"Polynomial and algebraic computation","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"European Research Council; Natural Sciences and Engineering Research Council of Canada; Fonds Québécois de la Recherche sur la Nature et les Technologies","keywords":"Mathematics; Algorithm; Bivariate analysis; Statistics","score_opus":0.01845828149499284,"score_gpt":0.26250158108830496,"score_spread":0.2440432995933121,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4402858306","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0025953006,0.00043403605,0.7588702,0.00200547,0.00091162807,0.0003280908,0.02880627,0.06442345,0.14162548],"genre_scores_gemma":[0.039661456,0.0010634313,0.7102811,0.000970284,0.0005303523,0.0005843617,0.06745507,0.030827647,0.14862634],"study_design_codex":"not_applicable","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99895215,0.00019233371,0.00011332938,0.00021909612,0.00041954414,0.00010353573],"domain_scores_gemma":[0.9983139,0.0005323969,0.00008653265,0.00048353095,0.00046789864,0.00011567418],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013917324,0.001140325,0.0010719029,0.0029262465,0.0011053471,0.004397924,0.0023039498,0.0014142368,0.2322021],"category_scores_gemma":[0.0056188214,0.0009483832,0.0013155894,0.0033355039,0.0006224108,0.004194923,0.0027602108,0.0022599697,0.13631633],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00022067277,0.00016490124,0.00036602316,0.0005600354,0.00003453974,0.00011975889,0.00020560314,0.0027701538,0.0064791637,0.21246259,0.5385771,0.2380396],"study_design_scores_gemma":[0.0001468122,0.00004169544,0.0003650458,0.00016420045,0.000019611058,0.0002594922,0.000070112656,0.02514117,0.013669435,0.11694989,0.84310466,0.000067831774],"about_ca_topic_score_codex":0.0024908183,"about_ca_topic_score_gemma":0.0038778638,"teacher_disagreement_score":0.2322021,"about_ca_system_score_codex":0.0014822461,"about_ca_system_score_gemma":0.001555385,"threshold_uncertainty_score":0.7767934},"labels":[],"label_agreement":null},{"id":"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8014921,0.0006563092,0.16117518,0.0007398488,0.00009132939,0.00006493478,0.00028725108,0.00019023246,0.035302866],"genre_scores_gemma":[0.9759975,0.00042606908,0.0155417165,0.0000815432,0.00017903534,0.0000328172,0.0002751448,0.000059862592,0.0074063116],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994186,0.00010595681,0.00004804394,0.00014846127,0.00017146375,0.000107479726],"domain_scores_gemma":[0.9987155,0.00034713387,0.0003075189,0.0002764548,0.00017528082,0.00017808525],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00083086407,0.00051272,0.0003579685,0.0015806863,0.0010707128,0.0020944253,0.000530116,0.00035301936,0.004007727],"category_scores_gemma":[0.0017286958,0.0002023759,0.0007024776,0.00094123743,0.0029378864,0.0040558013,0.0019159875,0.0011859004,0.0004475929],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000024284902,0.000016189008,0.0007573907,0.000026275025,0.000004777368,0.00010767716,0.00062407856,0.0010361974,0.0017933302,0.9890611,0.000311311,0.0062374533],"study_design_scores_gemma":[0.000008494395,0.00010812768,0.0012982346,0.000021802402,0.000013891172,0.00051347545,0.0009581697,0.009112574,0.005909801,0.9721851,0.009846133,0.000024108193],"about_ca_topic_score_codex":0.0004556283,"about_ca_topic_score_gemma":0.00025830572,"teacher_disagreement_score":0.004007727,"about_ca_system_score_codex":0.00058054633,"about_ca_system_score_gemma":0.00024419065,"threshold_uncertainty_score":0.013407171},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.41288307,0.0011183277,0.45758787,0.0043251733,0.0004740561,0.0001539661,0.00035713948,0.000495801,0.12260463],"genre_scores_gemma":[0.8948057,0.0006215092,0.086482614,0.0005059539,0.0001755073,0.00010377797,0.0002572224,0.0002653389,0.016782355],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995073,0.00010426119,0.000028446206,0.00009439357,0.00016683135,0.000098689256],"domain_scores_gemma":[0.9995247,0.00014580741,0.000069855894,0.00010897167,0.00008613523,0.000064497974],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006883971,0.00052388856,0.00046004224,0.0009384531,0.0011232081,0.0019843613,0.0006874383,0.00089925964,0.0080497945],"category_scores_gemma":[0.0031439373,0.00034369412,0.00065415434,0.0005473796,0.0022543557,0.004959957,0.0014219027,0.0016378709,0.0018158021],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000017029217,0.000011423589,0.0001901745,0.000027267683,0.000004268093,0.00007133189,0.00014605162,0.0008230018,0.0010763531,0.9863359,0.00093787664,0.010359378],"study_design_scores_gemma":[0.000007697362,0.000011926045,0.00006792577,0.0000148737445,0.000004193457,0.00015995846,0.00010088425,0.0026909716,0.0012368133,0.991318,0.004376121,0.000010575901],"about_ca_topic_score_codex":0.00018190934,"about_ca_topic_score_gemma":0.00029372884,"teacher_disagreement_score":0.0080497945,"about_ca_system_score_codex":0.0004297403,"about_ca_system_score_gemma":0.00047230348,"threshold_uncertainty_score":0.0269292},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.28038785,0.0058848965,0.36030066,0.0049658786,0.0045113065,0.00013401902,0.0004258596,0.00042078458,0.34296873],"genre_scores_gemma":[0.89626974,0.0021786923,0.06174453,0.0017163353,0.0016830035,0.00012267598,0.00018810038,0.0002610158,0.035835862],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991055,0.0003348194,0.000057748606,0.00013743818,0.00022053692,0.00014389696],"domain_scores_gemma":[0.9979075,0.0009791391,0.00018038982,0.00025984307,0.00046173757,0.00021148355],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001755317,0.0006975563,0.0010540467,0.0022553382,0.0022328056,0.0032589717,0.0014751042,0.0014205404,0.007891126],"category_scores_gemma":[0.007312397,0.0004907201,0.0014164412,0.0017002893,0.004273154,0.0054053385,0.002549441,0.004200865,0.0010430133],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000014558051,0.000009915181,0.000027315173,0.000013413014,0.0000027579824,0.000033018532,0.00008495439,0.00016648893,0.00017079411,0.99696904,0.00043113908,0.0020766598],"study_design_scores_gemma":[0.0000133923695,0.00001334171,0.000045535682,0.000011294004,0.0000048392135,0.00005115673,0.00003602128,0.0016543292,0.00017979287,0.9956567,0.0023249134,0.000008728813],"about_ca_topic_score_codex":0.0013217265,"about_ca_topic_score_gemma":0.00090070366,"teacher_disagreement_score":0.007891126,"about_ca_system_score_codex":0.0014088348,"about_ca_system_score_gemma":0.0009560065,"threshold_uncertainty_score":0.02639842},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08431802,0.0001388716,0.9130592,0.000121843346,0.000020773576,0.00005074901,0.00006265155,0.0011639714,0.0010639135],"genre_scores_gemma":[0.6414714,0.00009065608,0.357302,0.00005608089,0.000018363882,0.000060004077,0.00017423548,0.000109070286,0.0007182353],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.997687,0.0006304715,0.00017416153,0.0002461528,0.0010348506,0.00022742646],"domain_scores_gemma":[0.9948435,0.0035059904,0.0005372502,0.00060579635,0.0004465212,0.0000609936],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011913283,0.00048848765,0.0006050809,0.0010754485,0.00040267865,0.0007687565,0.0007364643,0.0005036461,0.0013408567],"category_scores_gemma":[0.008137353,0.0003486094,0.00035513478,0.00061968336,0.00070507487,0.0010366322,0.0012778639,0.0009043153,0.00030417566],"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.0008368981,0.00018060773,0.0052286484,0.00066877686,0.00012344177,0.0007984359,0.0010200349,0.08832939,0.30412132,0.10763304,0.0024168342,0.48864257],"study_design_scores_gemma":[0.000046350062,0.00020675377,0.0013693895,0.000038633705,0.000034898818,0.00048066556,0.00008610203,0.8585704,0.10262187,0.034116127,0.0023963784,0.00003240768],"about_ca_topic_score_codex":0.0007673253,"about_ca_topic_score_gemma":0.0011807149,"teacher_disagreement_score":0.0013408567,"about_ca_system_score_codex":0.0004207274,"about_ca_system_score_gemma":0.0008691446,"threshold_uncertainty_score":0.0063004494},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.33028468,0.0005732545,0.5766401,0.002805218,0.00043084405,0.00005929382,0.00031171288,0.00040638354,0.08848845],"genre_scores_gemma":[0.94729096,0.00024601334,0.039239883,0.00013161552,0.00008681686,0.000033841374,0.00011947968,0.000073894924,0.012777454],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.999765,0.000057400437,0.000011481411,0.00001794782,0.000112906804,0.000035422687],"domain_scores_gemma":[0.99950945,0.00028741988,0.000024624178,0.000051979223,0.00009383558,0.000032549735],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00038253213,0.0003135725,0.0006443172,0.00062279776,0.00088285573,0.0014825517,0.0005800975,0.0007476571,0.004278402],"category_scores_gemma":[0.0020942409,0.00018691743,0.0003999696,0.000814886,0.0015988536,0.0018259159,0.0012002295,0.0010294336,0.00034204667],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000040488263,0.000020514011,0.0003023299,0.00004036643,0.000009591435,0.00013152158,0.0001751805,0.047133677,0.0014079886,0.9389677,0.0010969061,0.010673684],"study_design_scores_gemma":[0.000019515735,0.000011102056,0.00011500507,0.000008177552,0.00000513059,0.000045848275,0.000037630914,0.410562,0.0007651231,0.5863738,0.00204569,0.000010948275],"about_ca_topic_score_codex":0.0030461964,"about_ca_topic_score_gemma":0.0031508175,"teacher_disagreement_score":0.004278402,"about_ca_system_score_codex":0.0010977408,"about_ca_system_score_gemma":0.0010924351,"threshold_uncertainty_score":0.014312625},"labels":[],"label_agreement":null}]}